With data increasing continually, data of XML are queried complexly. Several years, there are several algorithms, for example, TJFast which is by scanning repeatedly and make a lot of middle routes in the process of merging; the XML datasets are too uncertain to impose the efficiency of the query well by filtering. In our article, a new efficient index structure—FSM is proposed, which can avoid...

In this work, we study the convergence of an efficient iterative method, the fast sweeping method (FSM), for numerically solving static convex Hamilton–Jacobi equations. First, we show the convergence of the FSM on arbitrary meshes. Then we illustrate that the combination of a contraction property of monotone upwind schemes with proper orderings can provide fast convergence for iterative method...

این پژوهش با الهام گرفتن از نتایج یک طرح مطالعاتی کاربردی، رویکرد سلسله­‌مراتبی جهت پیگیری فرایند توسعه تأمین‌کنندگان و حمایت تصمیمات موجود در هر مراحل آن ارائه‌ می‌کند. ابتدا، زمینه‌های تأمین نیازمند سپس واجد شرایط هریک زمینه‌ها به کمک تصمیم‌گیری چندشاخصه بهترین-بدترین مشخص می‌گردند. معیارهای شناسایی نیز مرور مطالعات پیشین بهره‌گیری نظرات خبرگان حوزه‌ی خرید استخراج‌شده‌اند. درنهایت، مدل ریاضی ...

Functional size has been favored as a software characteristic that can be measured early and independent of language, tools, techniques and technology; hence has many uses in software project management. It has been about three decades since Albrecht introduced the concept of functional size. However, Functional Size Measurement (FSM) has not been a common practice in software community. The pr...

There has been much interest in testing from finite state machines. If the system under test can be modeled by the (minimal) FSM N then testing from a (minimal) finite state machine (FSM) M is testing to check that N is isomorphic to M . In the distributed test architecture, there are multiple interfaces/ports and there is a tester at each port. This can introduce controllability/synchronizatio...

In this paper we address the problem of state assignment for Finite State Machines (FSMs). We target the reduction of power dissipation in FSM circuits by minimizing the switching activity in the state register. We introduce a novel state assignment method that utilizes dynamic loop information extracted from FSM profiling data. We propose three different loop-based state assignment algorithms:...

Computations are developed for the synthesis of an FSM embedded in a known larger system such that the overall behavior satisfies a co-Büchi specification. The procedures for this are very similar to those used for regular (non-omega) automata, except for a special final step in which a set of FSM solutions is represented as a SAT instance. Each satisfying assignment corresponds to an FSM solut...

A common tool for improving the performance quality of natural language processing systems is the use of contextual information for disambiguation. Here I describe the use of a finite state machine (FSM) to disambiguate speech acts in a machine translation system. The FSM has two layers that model, respectively, the global and local structures found in naturally-occurring conversations. The FSM...