It is shown that the process of structuring of the solutions' set to the acceptable starts at the stage of the initial set building. At the same time, for a consistent structuring of the diversity of the solutions...
详细信息
ISBN:
(纸本)9781509056484
It is shown that the process of structuring of the solutions' set to the acceptable starts at the stage of the initial set building. At the same time, for a consistent structuring of the diversity of the solutions' set during the synthesis of problem-solving algorithms, it is advisable to use the principle of progressive reduction for the initial information uncertainty. At the first stage, the principle of gradual reduction of the uncertainty source for many alternative solutions is structured to multiple valid solutions while at the second stage, the set of feasible solutions is restructured to the set of efficient solutions;finally, the third phase selects a unique solution from the set of efficient solutions. The paper discusses the possibility to use fission probability distributions of the source data for the Committee (serial) synthesis algorithm solving the problem. A procedure is proposed for finding the optimal model evaluation of the corrective algorithm for composition with the basic (standard) algorithm for the purpose of mutual compensation of their errors. A number of examples illustrate the use of the formulated approach. The article presents the achieved results in improving the efficiency and the quality of the algebraizable way to solve the tasks of processing, analysis and control which is an actual and promising direction of modern information systems designing.
Background: With the rapid development of high-throughput genotyping technologies, efficient methods for identifying linked regions using high-density SNP genotype data have become more and more important. Recently, a...
详细信息
Background: With the rapid development of high-throughput genotyping technologies, efficient methods for identifying linked regions using high-density SNP genotype data have become more and more important. Recently, a deterministic method that works very well on SNP genotyping data has been developed (Lin et al. Bioinformatics 2008, 24(1): 86-93). However, that program can only work on a limited number of family structures. In particular, the results (if any) will be poor when the genotype data for the whole chromosome of one of the parents in a nuclear family is missing. Results: We have developed a software package (LIden) for identifying linked regions using high-density SNP genotype data. We focus on handling the case where the genotype data for the whole chromosome of one of the parents in a nuclear family is missing. We use the minimum recombinant model for haplotype inference in pedigrees. Several local optimization algorithms are used to infer the haplotype of each individual and determine the linked regions based on the inferred haplotype data. We have developed a more flexible method to combine nuclear families to further refine (reduce the length of) the linked regions. Conclusion: Our new package (LIden) is efficient software for linked region detection using high-density SNP genotype data. LIden can handle some important cases where the existing programs do not work well. In particular, the new package can handle many cases where the genotype data of one of the two parents is missing for the entire chromosome. The running time of the program is O(mn), where m is the number of members in the family and n is the number of SNP sites in the chromosome. LIden is specifically suitable for handling big sized families. This research also demonstrates another practical use of the minimum recombinant model for haplotype inference in pedigrees. The software package can be downloaded at http://***/similar to lwang/software/Link.
Resource balancing avoids the knowledge-base maintenance bottlenecks inherent in many rule-based configuration approaches. Domain knowledge is based directly on technical relationships. Control knowledge is needed onl...
详细信息
Resource balancing avoids the knowledge-base maintenance bottlenecks inherent in many rule-based configuration approaches. Domain knowledge is based directly on technical relationships. Control knowledge is needed only to fine-tune the configuration process.
We discuss the evaluation of the range of values of an interval polynomial over an interval. Several algorithms are proposed and tested on numerical examples. The algorithms are based on ideas by Cargo and Shiska [2] ...
详细信息
We discuss the evaluation of the range of values of an interval polynomial over an interval. Several algorithms are proposed and tested on numerical examples. The algorithms are based on ideas by Cargo and Shiska [2] and Rivlin [4]. The one basic algorithm uses Bernstein polynomials. It is shown to converge to the exact bounds and it has furthermore the property that if the maximum respectively the minimum of the polynomials occurs at an endpoint of the interval then the bound is exact. This is a useful property in routines for polynomials zeros. The other basic method is based on the meanvalue theorem and it has the advantage that the degree of approximation required for a certain apriori tolerance is smaller than the degree required in the Bernstein polynomial case. The mean value method is shown to be at least quadratically convergent and the Bernstein polynomial method is shown to be at least linearly convergent.
The quartimax and varimax algorithms for orthogonal rotation attempt to maximize particular simplicity criteria by a sequence of two-factor rotations. Derivations of these algorithms have been fairly complex. A simple...
详细信息
The quartimax and varimax algorithms for orthogonal rotation attempt to maximize particular simplicity criteria by a sequence of two-factor rotations. Derivations of these algorithms have been fairly complex. A simple general theory for obtaining “two factor at a time” algorithms for any polynomial simplicity criteria satisfying a natural symmetry condition is presented. It is shown that the degree of any symmetric criterion must be a multiple of four. A basic fourth degree algorithm, which is applicable to all symmetric fourth degree criteria, is derived and applied using a variety of criteria. When used with the quartimax and varimax criteria the algorithm is mathematically identical to the standard algorithms for these criteria. A basic eighth degree algorithm is also obtained and applied using a variety of eighth degree criteria. In general the problem of writing a basic algorithm for all symmetric criteria of any specified degree reduces to the problem of maximizing a trigonometric polynomial of degree one-fourth that of the criteria.
暂无评论