نتایج جستجو برای: fuzzy dual languages

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

Journal: :Early Education and Development 2023

This secondary analysis study examined patterns, predictors, and outcomes of dual language learners’ (DLLs’) development in Spanish English. Research Findings: Latent profile identified three groups DLLs: Balanced Bilinguals (54%), English-Dominant (25%), Spanish-Dominant (21%). These had fairly comparable skills at Head Start (HS) entry but showed distinct learning patterns English during the ...

2013
Nikos Simou Giorgos Stoilos Giorgos B. Stamou

An important problem for the success of ontology-based applications is how to provide persistent storage and querying. For that purpose, many RDF tools capable of storing and querying over a knowledge base, have been proposed. Recently, fuzzy extensions to ontology languages have gained considerable attention especially due to their ability to handle vague information. In this paper we investig...

2005
E. STANLEY LEE

Abstract In this paper, the notions of subgradmnt, subdifferentla[, and differential with respect to convex fuzzy mappings are investigated, whmh provides the basis for the fuzzy extremum problem theory We consider the problems of minimizing or maximizing a convex fuzzy mapping over a convex set and develop the necessary and/or sufficient optlmahty conditions. Furthermore, the concept of saddle...

1997
F. J. MORENO-VELO S. SÁNCHEZ-SOLANO

This paper presents the main features of XFL3, a new language for fuzzy system specification, which has been defined as the starting point for the 3.0 version of our fuzzy system design environment, Xfuzzy [1]. Its main advantages with respect to its precursor, XFL [2], are its capability to admit user-defined membership functions, parametric operators, and linguistic hedges. Taking this langua...

2017
Rahul Kumar Singh Akshama Rani Manoj Kumar Sachan

Classical automata theory cannot deal with the system uncertainty. To deal with the system uncertainty the concept of fuzzy finite automata was proposed. Fuzzy automata can be used in diverse applications such as fault detection, pattern matching, measuring the fuzziness between strings, description of natural languages, neural network, lexical analysis, image processing, scheduling problem and...

2012
Faiz Muhammad Khan Nor Haniza Sarmin Asghar Khan

Algebraic structures especially an ordered semigroups play a prominent role in mathematics with wide ranging applications in many disciplines such as control engineering, computer arithmetics, coding theory, sequential machines and formal languages. A theory of fuzzy sets in terms of fuzzy points on ordered semigroups can be developed. In this paper, we generalize the concept of (α, β)-fuzzy le...

Journal: :Fundam. Inform. 2013
Francesca A. Lisi Umberto Straccia

Fuzzy Description Logics (DLs) are logics that allow to deal with structured vague knowledge. Although a relatively important amount of work has been carried out in the last years concerning the use of fuzzy DLs as ontology languages, the problem of automatically managing the evolution of fuzzy ontologies has received very little attention so far. We describe here a logic-based computational me...

2010
Somaye Moghari Mohammad Mehdi Zahedi Reza Ameri

Fuzzy Finite Tree Automata (FFTA) are natural generalizations of fuzzy automata on words. FFTA accept fuzzy tree languages and are used in many areas of mathematics, computer science and engineering. Therefore, it is important to design algorithms that reduce the size (number of states) of automata, and find the minimal FFTA that recognizes the same language as a given FFTA. We present two mini...

2004
Charles J. Geyer Glen D. Meeden

The optimal hypothesis tests for the binomial distribution and some other discrete distributions are uniformly most powerful (UMP) one-tailed and UMP unbiased (UMPU) two-tailed randomized tests. Conventional confidence intervals are not dual to randomized tests and perform badly on discrete data at small and moderate sample sizes. We introduce a new confidence interval notion, called fuzzy conf...

1999
Peter R.J. Asveld

A fuzzy context-free K-grammar is a fuzzy context-free grammar with a countable rather than a finite number of rules satisfying the following condition: for each symbol α, the set containing all right-hand sides of rules with left-hand side equal to α forms a fuzzy language that belongs to a given family K of fuzzy languages. In this paper we study the effect of the non-self-embedding restricti...

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

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