نتایج جستجو برای: benchmark functions
تعداد نتایج: 544592 فیلتر نتایج به سال:
In this paper, we develop segmental semi-Markov models (SSMM) to exploit alignment profiles for protein secondary structure prediction. A novel parameterized model is proposed as the likelihood function for the SSMM to capture the segmental conformation from the profiles. By incorporating the information of long range interactions in β-sheets, this model is capable to carry out inference on con...
In this paper, we present a simple mining technique named the Quran Mining Technique (QMT) in an attempt to automatically classify the Suras (i.e. chapters) of the Quran based on predefined set of 10 themes. QMT is composed mainly of two phases: a preprocessing phase and a classification phase. In the first phase, we manually label a set of representative words for ten predefined themes. In the...
Decision support systems refer to interactive computer-based systems which help decision-makers to make a decision. Evaluation of a decision support system, that is, the act of measuring its quality characteristics, is an essential component of its design and development if considered an integral part of it and not employed at the end of its completion. In fact, evaluation permits to keep the d...
Electronic mail has become an integral part of our daily lives With this trend mail servers have to provide a fast highly available reliable and secure service Hence workload characterization and performance evaluation of mail servers are to be addressed as primary issues This paper deals with a detailed characterization of mail server workloads Our study is based on the analysis of a large set...
We exploit the “regularity” of Boolean functions with the purpose of decreasing the time for constructing minimal threelevel expressions, in the sum of pseudoproducts (SPP) form recently developed. The regularity of a Boolean function of variables can be expressed by an autosymmetry degree (with 0 ). = 0 means no regularity, that is we are not able to provide any advantage over standard synthes...
There is an increasing interest in recent years for querying and ranking XML documents. In this paper, we present a new framework for querying and ranking schema-less XML documents based on concise summaries of their structural and textual content. We introduce a novel data synopsis structure to summarize the textual content of an XML document for efficient indexing. More importantly, we extend...
A new intelligent segmentation technique is proposed that may be used in conjunction with a neural classifier and a simple lexicon for the recognition of difficult handwritten words. A heuristic segmentation algorithm is initially used to over-segment each word. An Artificial Neural Network (ANN) trained with 32,034 segmentation points is then used to verify the validity of the segmentation poi...
This paper presents a new approach to two-level hazardfree sum-of-products logic minimization. No currently available minimizers for single-output literal-exact two-level hazard-free logic minimization can handle large circuits without synthesis times ranging up over thousands of seconds. The logic minimization approach presented in this paper is based on state graph exploration in conjunction ...
This paper proposes a new knowledge-based method for clustering metagenome short reads. The method incorporates biological knowledge in the clustering process, by means of a list of proteins associated to each read. These proteins are chosen from a reference proteome database according to their similarity with the given read, as evaluated by BLAST. We introduce a scoring function for weighting ...
In this paper we present black-box models of work-load diierence and use them to develop quantitative methods for the design of benchmark suites. The proposed design methods (the method of optimum subsets , and the method of optimum weights) combine a new concept of program space coverage functions, and the criteria of completeness, redundancy, density, and granularity of benchmark suites.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید