applying our algorithm for barcode recognition

... presented several graph-based algorithms derived from his formal model of plan recognition In Kautz's algorithms, an explanation for an observation is represented in the form of an explanation graph ... they need to perform, an algorithm for rood- Because many of the augmented rgraph constraints are relations over real-valued variables (e.g the time 37 elling plan recognition in discourse must model ... rgraph construction algorithm, we exploit this by restricting the reasoning done by the algorithm to recipes for A, and by combining explanations for acts as soon as possible Kautz's algorithm, however,...

Ngày tải lên: 23/03/2014, 20:20

... learning algorithm of the pattern recognition allows to improve significantly the quality of recognition that indirectly confirms non-stationary character of the data used for the experiments Algorithm ... Foundation for Basic Research, Yandex, and Russian Association for Artificial Intelligence (RAAI) We are thankful to all of them for their active support We are grateful to the Organizing Committee for ... thank our Organizing Chair Dmitry Ignatov for his enormous contributions toward the organization of the conference and publication of these proceedings Our special thanks are also due ´ ezak for...

Ngày tải lên: 12/12/2017, 04:47

... simple genetic algorithms There are many algorithms of optimization used for different domains We have chosen genetic algorithm [17-19] to accelerate our fractal image coding algorithm We have ... http://jis.eurasipjournals.com/content/2011/1/1 Table Recognition rate versus the number of transformations Page of Table Recognition rate for the two approaches and the two databases Number of transformations ... transformation number continues to grow Consequently, the compromise recognition rate/transformation (the optimal situation is given with the minimum number of transformation and a satisfactory recognition...

Ngày tải lên: 21/06/2014, 00:20

... effectiveness of medications for rheumatoid arthritis (RA) due to the lack of a validated algorithm for this outcome We created and tested a claims-based algorithm to serve as a proxy for the clinical effectiveness ... criterion may not perform optimally As described in Table 5, this issue was the most common reason why patients failed the effectiveness algorithm; our algorithm might be expected to perform better in ... physicians are not directly compensated for these injections and other procedures and likely under-reported them For this reason, our effectiveness algorithm may perform better when there is a financial...

Ngày tải lên: 25/10/2012, 10:45

... operators For example, for a problem with (n, p) = (100, 20), the algorithm terminates if 448 successive children fail in improving the best solution (For all of our test problems, we had n > 2p √ For ... computational effort 4.10 Algorithm The overall algorithm can be stated as follows Algorithm Generate an initial population of size P (n, p) as described in section 4.4 Initialize a variable for keeping ... better solutions than our algorithm spends considerable more time It seems that our algorithm could be used with success in cases where quickand-dirty solutions are required for large practical...

Ngày tải lên: 08/08/2013, 08:38

... 2 Phan ThÞ Quúnh Mai - 42A2- Foreign Language Department Vinh university Foreign Languages Department - Applying communicative activities for 10 form students to practise grammatical ... important components of language course It is said that learners who master English grammar can perform four skills well and therefore can communicate in English successfully For this reason, to be successful ... 42A2- Foreign Language Department 2.2 Types of communicative activities for students to practise grammatical structures orally at free practice stage 28 2.2.1 Information exchanges 28 2.2.1.1 Information...

Ngày tải lên: 18/12/2013, 10:29

... routine is performed for node sets with 3, 4… (n-m-1) nodes and the minimum cutsets are evaluated, respectively The flowchart of the new algorithm is shown in figure START Load Network's Information ... row4 – { e5}={ e2 , e3 , e4} 6) row = { e4 , e5} IV DEVELOPMENT OF THE BRANCH ADDITION ALGORITHM FOR V NEW ALGORITHM TO CALCULATE MINIMUM CUTSETS GRAPH WITH SOME INPUT NODES Inputs: n: number of ... of minimum cutset However, this problem can be solved easily For this approach, above algorithm should be changed as follows: The algorithm will be repeated p times to evaluate minimum cutsets...

Ngày tải lên: 03/01/2014, 19:35

... network are therefore formed based on the primary network search for upstream circuit breaker J 2.4.4 identifying the classes of nodes: From Section 2.4.1, the upstream nodes before the switching ... flowchart for the algorithm used to identify the classes of nodes is shown in Fig I I E if select disconnect switching devices form separate Subsystems A /-= Subsystem connected to \ source Reliability ... Class D into Class C The repair time for a transformer is much longer than the replacement time, and therefore the difference between the reliability indices for the two cases is significant It...

Ngày tải lên: 03/01/2014, 19:39

... algorithm for energy minimization, extending MFOLD to pseudoknotted structures, the algorithm is not limited to energy minimization Our algorithm can be converted into a probabilistic model for ... introduced for the nested algorithm (that ISs of y > or multiloops are described in some approximated form) Despite these limitations, this truncated pseudoknot algorithm seems to be adequate for the ... our case, since the algorithm now allows a much larger con®guration space Therefore, our limited objective here is to show that on a few small RNAs that are thought to conserve pseudoknots, our...

Ngày tải lên: 12/01/2014, 22:07

... Quantity (MEOQ) Formula 100 Tables S.1 Performance and Resource Metrics for Inventory Management xvi 2.1 Performance Metrics for Inventory Management 2.2 Resource Metrics for Inventory ... from the supporting SSA For the 82nd Airborne, mean CWT was only 1.8 days for SSA fills, compared to, for example, 18 days for referrals and 113 days for backorders CWT for ASL fills was also ... DCB was made mandatory for ASL reviews Figure S.1 shows the ASL fill rates for eight active Army divisions before and after the use of DCB for an ASL review The best performance is in the XVIII...

Ngày tải lên: 17/02/2014, 17:20

... [11,15] A common drastic conformational change is found in this protein family, which participates in switching from an open form to a closed form [16] In EcoMBP, the closed form has been observed ... defined in terms not of the affinities for sugars but of whether the protein adopts the open form or the closed form TvuCMBP–c-CD complex is seen as the closed form (Fig 2A,B), and this structure ... sugar-binding site is formed by N- and C-domains, residues involved in sugar binding are grouped into two parts, the N-domain part and the FEBS Journal 274 (2007) 2109–2120 ª 2007 The Authors Journal compilation...

Ngày tải lên: 19/02/2014, 00:20

... An efficient graph algorithm for dominance constraints Journal of Algorithms, 48:194–219 P Blackburn and J Bos 2005 Representation and Inference for Natural Language A First Course in Computational ... performance of our algorithm is close to the upper bound and much better than the baseline For USRs with fewer than e8 = 2980 configurations (83 % of the data set), the mean reduction factor of our ... highest reduction factor for an individual USR is 666.240 We also measured the ratio of USRs for which the algorithm achieves complete reduction (Fig 6): The algorithm is complete for 56 % of the USRs...

Ngày tải lên: 20/02/2014, 12:20

... explored for more than a decade Early approaches included algorithms for efficiently calculating string prefix probabilities (Jelinek and Lafferty, 1991; Stolcke, 1995) and approaches to exploit such algorithms ... perceptron algorithm It is an online algorithm, which makes several passes over the training set, updating the parameter vector after each training example For a full description of the algorithm, ... compared to wi Initialization: Set α1 = α, and αj = for j = d Algorithm: For t = T, i = m •Calculate yi = arg maxw∈GEN(ai ) Φ(ai , w), α ¯ • For j = m, set αj = αj + Φj (ai , si ) − ¯ ¯...

Ngày tải lên: 20/02/2014, 15:20

... satisfying: • CS(N) + C_ CS(N), for each N; • (N, L) • CS(N), for each N such that N

Ngày tải lên: 20/02/2014, 18:20

... in the source string We call this a skip, because the position i is skipped in the alignment path Using a bigram language model, Eq (9) specifies the modified search criterion for our algorithm ... words in the source string are considered In other words we have to force the algorithm to cover all input string positions Different strategies to solve this problem are possible: For example, ... additional parameter into the recursion formula for DP In the following, we will explain this method in detail 2.3 Recursion F o r m u l a for D P In the DP formalism, the search process is described...

Ngày tải lên: 20/02/2014, 18:20

... ambiguities to be resolved by choosing the maximum likelihood parse Our algorithm is similar in spirit to the recognition algorithm for HMMs (Viterbi 1967) Denote the input English sentence by el, ... segmentation for text retrieval: Achievements and problems Journal of The American Society for Information Science, DAGAN, IDO, KENNETHW CHURCH, & W[][JJ~ A GAL~ 1993 Robust bilingual word alignment for ... Singleton-Rebalancing Algorithm We now introduce an algorithm for further improving the bracketing accuracy in cases of singletons Consider the following bracketing produced by the algorithm of the...

Ngày tải lên: 20/02/2014, 22:20

... the fourth transformation (move) which improves ill-formed TNCBs The fifth is used to establish the well-formedness of undetermined nodes In the diagrams, we use a cross to represent ill-formed ... generation algorithm The cruciM data structure that it employs is the TNCB We give some definitions, state some key assumptions about suitable TNCBs for generation, and then describe the algorithm ... sign) is found However, the target derivation information itself is not used to assist the algorithm Even in (Beaven, 1992a), the derivation information is used simply to cache previous results...

Ngày tải lên: 20/02/2014, 22:20

... computed for each word pair Further iterations were found to yield negligible improvements to the results obtained D Improved Weights and Cognation PERFORMANCE index: 9.32/8 = 1.165 OF THE ALGORITHM ... and consonants vastly improved the performance of the algorltbm No human intervention is needed to identify vowels from consonants, an improved version of an algorithm described in Suhotln 1962 ... the same positions in the two words are scored as possible correspondences Thus for instance, the first pass of the algorithm having matched the "m" of "mata" to the "n" of "nas", Titla "m" is scored...

Ngày tải lên: 21/02/2014, 20:20

... Extended Architecture Hamaguchi's hardware algorithm (Ham~guchi, 1988), proposed for speech recognition systems, is similax to Fukushima's algorithm In Hamaguchi's algorithm, S bit memory space expresses ... algorithm is implemented on it in linear time for the number of candidates, while conventional sequential algorithms are implemented in combinational time This is advantageous for character recognition ... multiple text streams, and the algorithm for extracting morphemes from multiple text streams is proposed Generally, in character recognition results or speech recognition results, there is a...

Ngày tải lên: 21/02/2014, 20:20

... considerable for the small example In the best-first procedure, we reduce this search space, but we also avoid strong commitments The Algorithm at a Glance Basically, the best-first search algorithm ... remaining potantial distractors, surpasses the evaluation of the best solution Formalization of the Algorithm The algorithm operates on a tree of nodes which are implemented as structured objects, ... description Assess, the likely evaluation for completion Minassess, the possible minimum for Assess Successors, pointers to daugther nodes Nextprop, boolean combination for successors The tree is initialized...

Ngày tải lên: 22/02/2014, 02:20