1460741462-d4c2b961-7639-40f3-9a4c-cc92daeeefe8

1. A method for gene mapping to locate a gene associated with a certain phenotype from a dataset of chromosome and phenotype data by analyzing an association between phenotype and genetic markers mi, comprising:
i) searching from said dataset for all marker patterns P that satisfy a pattern evaluation function e(P), wherein
a: the marker patterns are expressions within said dataset comprising genetic markers and their alleles and zero or more of the following: individual covariates, environmental variables and auxiliary phenotypes; and
b: the pattern evaluation function e(P) is a measure of the association between the marker pattern P and a phenotype being studied,

ii) scoring each marker mi of the data with a marker score s(mi), which is a function of the set Si defined as the set of marker patterns overlapping the marker mi and satisfying the pattern evaluation function e as defined in step i), and
iii) locating said gene to the marker mi having the best score s(mi), wherein the best score is the highest obtained score if said scoring function is designed to give higher scores closer to the gene, or the lowest obtained score if said scoring function is designed to give lower scores closer to the gene, or locating said gene to a chromosomal region containing a set of best scoring markers.
2. The method of claim 1, wherein the chromosome data consists of either haplotypes or genotypes.
3. The method of claim 2, wherein said haplotypes and genotypes contain flexible regions.
4. The method of claim 1, wherein
a) the phenotype being studied is qualitative, and
b) the pattern evaluation function e(P) has the form e(P)=true if and only if e\u2032(P)>x, where e\u2032(P) is the signed association measure \u03c72 and x is a user specified minimum value wherein said signed value of the \u03c72 is negative if the relative frequency of the halotype pattern among the control chromosomes is higher than that of the trait-associated chromosomes, and otherwise positive, and
c) the score s(mi) of marker mi as the size of Si, also called marker-wise pattern frequency of mi and denoted by f(mi).
5. The method of claim 1, wherein
a) the pattern evaluation function e(P) has the form e(P)=true if and only if e\u2032(P)>x, where e\u2032(P) is the absolute frequency of pattern P in the data and x is a user-specified value,
b) in order to derive the score s(mi), the p value (statistical significance) of each marker pattern P in determining the phenotype being studied is evaluated, and
c) the score s(mi) is the distance between the observed p value distribution of patterns in Si and the uniform distribution, defined as average of (pi\u2212qi)log(piqi) over all i=1 . . . n, where n is the number of haplotype patterns in Si, pi is the ith smallest p value in Si, and qi is the expectation of the ith smallest p value, if the p values were randomly drawn from the uniform distribution.
6. The method of claim 5, where the p value is computed using a linear model of form Y=\u03b21X1+ . . . +\u03b2kXk+\u03b1Z+\u03b20, where the dependent variable Y is the phenotype being studied, X1 through Xk are covariates, and Z is a dummy variable for the occurrence of the haplotype pattern, and the coefficients \u03b1 and \u03b2* are adjusted for best fit, and then the significance of Z as a covariate is assessed using a t test with the null hypothesis \u201c\u03b1=0\u201d.
7. The method of claim 1, further refining each score s(mi) by replacing it by the marker-wise p value of the score s(mi), where the statistical significance of s(mi) is measured against the null hypotheses that there is no gene effect.
8. The method of claim 1, wherein an area returned from a prediction of a gene location is contiguous or fragmented or a point.
9. A computer-readable data storage medium having computer-executable program code stored thereon operative to perform the method of claim 1 when executed on a computer.
10. A computer system having executable program code that performs the method of claim 1.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A compound of the formula
wherein
Y is CONR2 wherein R2 is H or C1-C6 alkyl;
R3 is C1-C6 alkyl, C3-C6 cycloalkyl or (CH2)n-aryl,
wherein aryl is phenyl or a heteroaromatic ring containing one or two heteroatoms selected from N, O and S and which may be mono- or di-substituted with R4 andor R5;
wherein R4 is H, C1-C6 alkyl, C3-C6 cycloalkyl, halogen, CN, CF3, OH, C1-C6 alkoxy, NR6R7, OCF3, SO3CH3, SO3CF3, SO2NR6R7, phenyl, phenyl-C1-C6 alkyl, phenoxy, C1-C6 alkylphenyl, an optionally substituted heterocyclic ring containing one or two heteroatoms selected from N, O, S, SO and SO2 wherein the substituent(s) is(are) selected from C1-C6 alkyl, C3-C6 cycloalkyl and phenyl-C1-C6 alkyl, an optionally substituted heteroaromatic ring containing one or two heteroatoms selected from N, O and S wherein the substituent(s) is (are) selected from C1-C6 alkyl, C3-C6 cycloalkyl and phenyl-C1-C6 alkyl, or COR8;
wherein R6 is H, C1-C6 alkyl or C3-C6 cycloalkyl;
R7 is H, C1-C6 alkyl or C3-C6 cycloalkyl; and
R8 is C1-C6 alkyl, C3-C6 cycloalkyl, CF3, NR6R7, phenyl, a heteroaromatic ring containing one or two heteroatoms selected from N, O and S or a heterocyclic ring containing one or two heteroatoms selected from N, O, S, SO and SO2 wherein R6 and R7 are as defined above;

wherein R5 is H, OH, CF3, OCF3, halogen, C1-C6 alkyl or C1-C6 alkoxy; n is 0-4;

and
R9 is H, C1-C6 alkyl, C3-C6 cycloalkyl, OCF3, OCHF2, OCH2F, halogen, CN, CF3, OH, C1-C6 alkoxy, C1-C6 alkoxy-C1-C6 alkyl, NR6R7, SO3CH3, SO3CF3, SO2NR6R7, an unsubstituted or substituted heterocyclic or heteroaromatic ring containing one or two heteroatoms selected from N and O, wherein the substituent(s) is(are) C1-C6 alkyl; or COR8; wherein R6, R7 and R8 are as defined above.
2. A process for the preparation of the compound of claim 1, which comprises the steps of
(i) Cyclization of the compound of formula II to a compound of formula III in a suitable solvent in the presence of ethyl cyanoacetate and a suitable base at a temperature between +20\xb0 C. and 100\xb0 C.;
(ii) Conversion of a compound of formula III to a compound of formula IV, either by a) hydrolysis under acidic condition followed by decarboxylation under acidic conditions using a suitable acid in a suitable solvent at a temperature between +20\xb0 C. and reflux or b) hydrolysis under basic conditions using a suitable base in a suitable solvent followed by decarboxylation under acidic conditions using a suitable acid in a suitable solvent at a temperature between +20\xb0 C. and reflux;
(iii) Conversion of a compound of formula IV to a compound of formula V, either by a) activation of the acid function of a compound of formula IV as an acid halide with a suitable base or by b) using an activating reagent with a suitable base in a suitable solvent, followed by the addition of an appropriate amine or aniline HNR2R3, where R2 and R3 are as defined in claim 1 at a temperature between 0\xb0 C. and +120\xb0 C.; and
(iv) Conversion of a compound of formula V to a compound of formula VI, either by a) hydrogenation using a catalyst containing palladium, platinum, nickel or rhodium in a suitable solvent at a reaction temperature between +20\xb0 C. and +120\xb0 C. or b) by reduction with a suitable reductive reagent in a suitable solvent at a reaction temperature between +20\xb0 C. and +120\xb0 C.
3. The process according to claim 2, wherein
in step (i), the solvent is selected from N,N-dimethylformamide or dimethylsulfoxide and the base is selected from K2CO3 or KOH;
in step (ii), the hydrolysis and decarboxylation steps under acidic conditions are both carried out in an acid selected from HCl, HBr or H2SO4 and a solvent selected from acetic acid, water or a mixture thereof or the hydrolysisdecarboxylation process is carried out by hydrolysis under basic conditions in a base selected from NaOH or KOH and a solvent selected from water, ethanol, methanol or a mixture thereof followed by decarboxylation under acidic conditions using an acid selected from HCl, HBr or H2SO4 and a solvent selected from acetic acid, water or a mixture thereof;
in step (iii), the activation is carried out either a) with an acid halide with a trialkylamine as the base or b) with an activating agent selected from N,N-carbonyldiimidazole, N,N-dicyclohexylcarbodiimide or diphenylphosphinic chloride with N-methylmorpholine as the base in a solvent selected from methylene chloride, chloroform, toluene, N,N-dimethylformamide, dioxane or tetrahydrofuran; and
in step (iv), the conversion is carried out either by a) catalytic hydrogenation in a solvent selected from ethanol, methanol or acetic acid or by b) reduction with sodium dithionite in N,N-dimethylformamide as solvent.

1460741454-db7867a5-89c8-4f9a-bcec-372726c25c2f

1. A computing device-implemented method comprising:
individually refreshing substantially non-overlapping segments of an electronic paper display in a sequential manner; and
upon being refreshed, presenting content in each individual refreshed segment.
2. The computing device-implemented method of claim 1 in which the sequential manner includes refreshing adjacent segments in series.
3. The computing device-implemented method of claim 1 in which the sequential manner includes refreshing horizontally adjacent segments in series.
4. The computing device-implemented method of claim 1 in which the sequential manner include refreshing vertically adjacent segments.
5. The computing device-implemented method of claim 1 in which the sequential manner visually simulates turning a page on the electronic paper display.
6. The computing device-implemented method of claim 1 in which refreshing an individual segment includes applying a charge to a corresponding portion of the electronic paper display.
7. The computing device-implemented method of claim 1 in which the segments include at least sixteen segments.
8. The computing device-implemented method of claim 1 in which the sequential manner includes delaying the refreshing of one segment until another segment is refreshed.
9. The computing device-implemented method of claim 1 in which the sequential manner includes delaying the refreshing of one segment until another segment is refreshed and presents content.
10. A computing device comprising:
a processor configured to execute instructions to define a group of substantially non-overlapping segments of an electronic paper display; and
a display controller configured to individually refresh the substantially non-overlapping segments of the electronic paper display in a sequential manner, and control content presentation in each refreshed segment.
11. The computing device of claim 10, in which the processor is configured to divide the electronic paper display into portions to define the group of substantially non-overlapping segments.
12. The computing device of claim 10, in which the electronic paper display reflects ambient light to present content.
13. The computing device of claim 10, in which the electronic paper display is included in the computing device.
14. The computing device of claim 10, in which the electronic paper display is an electrophoretic display.
15. The computing device of claim 10, in which the substantially non-overlapping segments are rectangular shaped.
16. The computing device of claim 10, in which the substantially non-overlapping segments are horizontally adjacent.
17. The computing device of claim 10, in which the display controller applies a charge to a corresponding portion of the electronic paper display to refresh a segment.
18. The computing device of claim 10, in which the sequential manner visually simulates turning a page on the electronic paper display.
19. The computing device of claim 10, in which the sequential manner includes delaying the refreshing of one segment included in the group of segments until another segment is refreshed.
20. One or more computer readable media storing instructions that are executable by a processing device, and upon such execution cause the processing device to perform operations comprising:
individually refreshing substantially non-overlapping segments of an electronic paper display in a sequential manner; and
upon being refreshed, presenting content in each individual refreshed segment.
21. The computer readable media of claim 20 in which the sequential manner includes refreshing adjacent segments in series.
22. The computer readable media of claim 20 in which the sequential manner includes refreshing horizontally adjacent segments in series.
23. The computer readable media of claim 20 in which the sequential manner include refreshing vertically adjacent segments.
24. The computer readable media of claim 20 in which the sequential manner visually simulates turning a page on the electronic paper display.
25. The computer readable media of claim 20 in which refreshing an individual segment includes applying a charge to a corresponding portion of the electronic paper display.
26. The computer readable media of claim 20 in which the segments include at least sixteen segments.
27. The computer readable media of claim 20 in which the sequential manner includes delaying the refreshing of one segment until another segment is refreshed.
28. The computer readable media of claim 20 in which the sequential manner includes delaying the refreshing of one segment until another segment is refreshed and presents content.

The claims below are in addition to those above.
All refrences to claim(s) which appear below refer to the numbering after this setence.

1. A service method of a rental storage, in which rental storage users use the rental storage provided by a storage provider on a network and each of said rental storage users and said storage provider communicate with respect to rental storage service, comprising the steps of:
electronically establishing a contract between said storage provider and each of the rental storage users thereby allowing using storage of said storage provider by each of the rental storage users;
calculating by the storage provider an estimation of a data amount in the rental storage for future storage usage of each of said rental storage user, based on the history of storage usage of each of said rental storage user;
showing by the storage provider conditions of said contract including a contracted billing method, a contracted billing period, a contracted storage data amount, a notification threshold storage data amount for triggering contracted notification to each of said rental storage users prior to reaching the storage data amount, and an indication of whether an estimation option is available in said contract for changing the conditions of said contract based upon the estimation, and the estimation to each of said rental storage users; and
electronically re-configuring the conditions of said contract as changed by each of said rental storage users if the estimation option is available in said contract,
wherein said users are human users having capacity to make contracts and pay bills charged to said human users.
2. A service method of a rental storage, in which rental storage users use the rental storage provided by a rental storage service provider on a network and each of said rental storage service users and said rental storage service provider communicate with respect to rental storage service, comprising the steps of:
electronically making a contract between said rental storage service provider and each of said rental storage service users so as to configure contract conditions based on the contract of use of storage service thereby allowing using storage of said rental storage service provider by each of the rental storage service users;
reporting a charge to each of the rental storage service users by the rental storage service provider;
paying the charge for the use of said storage by each of the rental storage service users to the rental storage service provider;
calculating by the storage provider an estimation of a data amount in the rental storage for future storage usage of each of said rental storage user, based on the history of storage usage of each of said rental storage user;
showing by the storage provider said contract conditions and the history of storage usage record to each of the rental storage service users; and
electronically reconfiguring by said rental storage service provider said contract conditions as changed by each of said rental storage users if an estimation option is available in said contract,
wherein said contract conditions include a billing method, a billing period, a storage data amount, a notification threshold storage data amount for triggering contracted notification to each of said rental storage users prior to reaching the storage data amount, rental storage estimation, and whether an estimation option is available for changing said contract conditions based upon the rental storage estimation, and
said users are human users having capacity to make contracts and pay bills charged to said human users.
3. A service method of a rental storage set forth in claim 2, further comprising the steps of:
proposing by said rental storage service provider a reduction plan of the amount of data of storage usage used by each of said rental storage service users; and
reducing the amount of data of storage usage used by each of said rental storage service users in accordance with the recommended reduction plan of data,
wherein the step of reconfiguring said contract conditions is performed after the step of proposing by said rental storage service provider and the step of reducing the amount of data of storage usage used by each of said rental storage service users.
4. A service method of a rental storage set forth in claim 3, in which: when each of said rental storage service users deletes data in use in accordance with the recommended reduction plan of the amount of data of storage usage, said rental storage service provider duplicates on a portable medium a backup copy of the data specified to delete by each of said rental storage service users; and said rental storage service provider sends the backup copy of the data to each of the rental storage service users.
5. A service method of a rental storage, in which rental storage users use the rental storage provided by a rental storage service provider on a network and each of said rental storage service users and said rental storage service provider communicate with respect to rental storage service, comprising the steps of:
electronically establishing a first contract between said storage provider and each of the rental storage users thereby allowing using storage of said storage provider by each of the rental storage users;
estimating by said rental storage service provider amount of data of storage usage in the future based or the history of amount of data of storage usage by each of said rental storage service users;
showing by the storage provider conditions of said first contract including a contracted billing method, a contracted billing period, a contracted storage data amount, a notification threshold storage data amount for triggering contracted notification to each of said rental storage users prior to reaching the storage data amount, and an indication of whether an estimation option is available in said first contract for changing the conditions of said first contract based upon the estimation,
proposing by the storage provider to each of said rental storage service users a recommended contract on an amount of data according to the estimation if the estimation option is available in said first contract, and
electronically re-configuring the conditions of said contract as changed by each of said rental storage users if the estimation option is available in said contract,
wherein said users are human users having capacity to make contracts and pay bills charged to said human users.
6. A service method of a rental storage set forth in claim 3, in which: the step of proposing to each of said rental storage service users a recommended contract on the amount of data include the substep of: proposing reduction of amount of data contracted for the storage usage if the storage usage estimated is less than the currently contracted storage usage.
7. A service method of a rental storage set forth in claim 5, in which:
when each of said rental storage service users updates said contract conditions in accordance with a desirable amount of data of storage usage recommended by said rental storage service provider,
if the amount of data of storage usage by each of said rental storage service users exceeds the contracted amount of data for storage usage reconfigured within the contract period of the contract,
each of said rental storage service users will be allowed using the storage service for the data beyond the contracted amount of said storage usage.