نتایج جستجو برای: process map

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

2014
Russell G. Almond Ilya M. Goldin Yuhua Guo Nan Wang

Students and instructors would benefit from a graphical display of student proficiency throughout a course. However, valid and reliable proficiency estimates based on modern statistical techniques require data that are not usually collected in traditional instruction. For example, problems that students solve on tests and homeworks may not be properly equated to a vertical scale; building a tru...

Journal: :JSW 2014
Houda Kaffela Naoufel Kraïem Jamil Dimassi Zuhoor Al-Khanjari

This work presents a method to bridge the gap between intentional process modeling and business process modeling. The first represent the business objectives of an enterprise and the strategies used in order to achieve these objectives, while the second concentrate on the business processes. The proposed method uses MAP as an intentional modeling language and Business Process Modeling Notation ...

2006
James Ledoux

In this paper, we deal with the so-called Markovian Arrival process (MAP). An MAP is thought of as a partially observed Markov process, so that the ExpectationMaximization (EM) algorithm is a natural way to estimate its parameters. Then, non-linear filters of basic statistics related to the MAP must be computed. The forward-backward principle is the basic way to do it. Here, bearing in mind a f...

2011
XINGYUAN WANG YISONG TAN

In this paper, the authors propose a new chaotic block cryptosystem based on multiple one-dimensional chaotic maps. In the proposed cryptosystem, the authors establish map-to-task relations between the multiple chaotic maps and the tasks, which must be performed in the encryption rounds. The encryption process is based on these map-to-task relations. The authors enhance the security of the cryp...

2017
Yaokun Wu Zeying Xu Yinfeng Zhu YAOKUN WU YINFENG ZHU

Given a finite set K, a Boolean linear map on K is a map f from the set 2 of all subsets of K into itself with f(∅) = ∅ such that f(A∪B) = f(A)∪f(B) holds for all A,B ∈ 2 . For fixed subsets X,Y of K, to predict if Y is reachable from X in the dynamical system driven by f , one can assume the existence of nonnegative integers h with f(X) = Y , find an upper bound α for the minimum of all such a...

2003
Changyou Wang

We prove that a stationary extrinsic (or intrinsic, respectively) biharmonic map u 2 W ( ; N) from R into a Riemnanian manifold N is smooth away from a closed set of (m 4)-dimensional Hausdor measure zero. x

2010
Ignacio Díaz Blanco Abel Alberto Cuadrado Vega Alberto B. Diez González Manuel Domínguez-González Juan J. Fuertes-Martínez Miguel A. Prada

In this paper a new method based on the self-organizing map (SOM) is proposed to track and identify changes in the dynamic behaviour of a physical process. In a first stage, a SOM is trained on a parameter space composed of the coefficients of local dynamic models estimated around different operating points of the process. On execution, new models estimated from process data are compared agains...

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

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