نتایج جستجو برای: fixed base

تعداد نتایج: 449629  

2014
Sameer ud Dowla Khan

Many languages employ reduplication processes in which one segment of the reduplicant is fixed. In East Bengali, /t/ is normally the initial consonant in reduplicants of this type (/ a i-ta i/ ‘cars, etc.’). However, when the base itself begins with /t/, speakers prefer alternate fixed segments, such as /f/ or /m/ (not */tæ a-tæ a/, but /tæ a-mæ a/ ‘cross-eyed, etc.’). Speakers also tend to avo...

Journal: :CoRR 2013
Vikraman Arvind

In this paper we study the parameterized complexity of two well-known permutation group problems which are NP-complete. • Given a permutation group G = 〈S〉 ≤ Sn and a parameter k, find a permutation π ∈ G such that |{i ∈ [n] | π(i) 6= i}| ≥ k. This generalizes the NP-complete problem of finding a fixed-point free permutation in G [CW10, Lub81] (this is the case when k = n). We show that this pr...

2005
Wei Tu Eckehard Steinbach

We propose a framework for error robust real−time video telephony over wireless networks. In our approach we cope with packet loss on the downlink by retransmitting lost packets from the base station to the receiver terminal. The effect of lost packets is reduced using error concealment. Retransmitted packets are used for error recovery. In order to be able to use the retransmissions for error ...

Journal: :International Journal of Advanced Computer Science and Applications 2019

Journal: :IEEE Trans. Fuzzy Systems 2001
Huaiqing Wang Changjun Jiang Stephen Shaoyi Liao

Models of fuzzy Petri net (FPN) are defined based on generating rules of knowledge base and the Petri nets semantics description of logical rules are presented. Two kinds of reasoning patterns are considered. First, the beliefs of initial propositions are known and their beliefs of noninitial propositions need to be computed. Second, the beliefs of initial propositions are known and the beliefs...

2012
Gergely Kovásznai Andreas Fröhlich Armin Biere

Bit-precise reasoning is important for many practical applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. From the theoretical point of view, only few results on the complexity of fixed-size bit-vector logics have been published. Some of these results only hold if unary encoding on the bit-wi...

Journal: :European Journal of Operational Research 2013
Joachim Arts Gudrun P. Kiesmüller

In this paper, we consider a serial two-echelon periodic review inventory system with two supply modes at the most upstream stock point. As control policy for this system, we propose a natural extension of the dual-index policy, which has three base-stock levels. We consider the minimization of long run average inventory holding, backlogging, and both per unit and fixed emergency ordering costs...

2002
Mark R. Diamond Daniel D. Reidpath Edith Cowan

If the digits of any multi-digit number are multiplied together, another number results. If this process is iterated, eventually a single digit number will be produced. The number of steps that this process takes, before a single digit number is obtained, is referred to as the persistence of the of the original number [5]. Neil Sloane conjectured that for any base b, there is a number c(b) such...

1997
Joana Matos Dias António Dourado Correia

In this paper a methodology is developed to control linear and nonlinear processes using a fuzzy approach with the main assumption that the output of the process is monotone with respect to the input. Beginning with an empty rule base, a fuzzy model is on-line built. The rule base has a fixed number of rules determined à priori and not depending on the complexity of the process. The controller ...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید