Transforming and generating models is a meaningful process in Model Driven Engineering (MDE). Theoretical and practical researches for MDE have remarkably progressed recently in managing with the increase of complexit...
详细信息
ISBN:
(纸本)9783030366919;9783030366902
Transforming and generating models is a meaningful process in Model Driven Engineering (MDE). Theoretical and practical researches for MDE have remarkably progressed recently in managing with the increase of complexity within information systems (IS) during their development and support processes by growing the level of abstraction using different kinds of models as information storage - as knowledge storage of problem domain. As models expand in use for developing systems, the possible transformation among models grows in importance. The main scope of the article is to present transformation algorithm of Unified Modelling Language Use Case model generation from Enterprise Model (EM). The transformation algorithm is presented in details and depicted by steps. The presented generation process steps are illustrated by particular UML Use Case example following the transformation algorithm step by step.
The collaboration work is an important key for working in software engineering *** a team should have developers whom have difference *** achieve goal on time and budget,they should select an appropriate tool which co...
详细信息
The collaboration work is an important key for working in software engineering *** a team should have developers whom have difference *** achieve goal on time and budget,they should select an appropriate tool which conform to their *** the time consumption for learning and understanding will be ***,some projects are depended on the legacy *** project manager cannot determine the favorite tools and ***,in the study propose a transformation algorithm which can help developers spend less time to get used to with the new *** experiment focused on the query mechanisms of Hibernate *** are variety of query mechanisms which are Criteria API,HQL and Native *** experiment is concerned only Criteria API and HQL which present the ability of conversion *** that,to measure the efficiency and validate of function,the back to back testing is *** retrieved data between both methods have to *** results showed the equivalence queried ***,the transformation algorithm can covert those statements correctly.
The transformation algorithm for Nonlinear Feedback Shift Registers (NLFSRs) converts NLFSRs between Fibonacci and Galois configurations. Up to now, three types of Galois NLFSRs namely Type-I, Type-II and Type-III Gal...
详细信息
The transformation algorithm for Nonlinear Feedback Shift Registers (NLFSRs) converts NLFSRs between Fibonacci and Galois configurations. Up to now, three types of Galois NLFSRs namely Type-I, Type-II and Type-III Galois NLFSRs have been discovered to be equivalent to Fibonacci NLFSRs in existing works. However, either no transformation algorithm has been proposed or the proposed algorithm has very high complexity for these Galois NLFSRs. More importantly, the common issue is that the output sequence is assumed to be generated by the first stage of the NLFSR. The sequences generated by other stages are not considered. In this paper, we develop a compensation method to address all these issues. Based on this unified method, we propose Fibonacci-to-Galois and Galois-to-Fibonacci transformation algorithms for the three types of Galois NLFSRs. Moreover, we discover a new type of Galois NLFSRs (Type-IV) that can be transformed to Fibonacci NLFSRs and propose transformation algorithms based on the same compensation method. No matter what the output function is, the output sequences are the same before and after being transformed by any of the proposed transformation algorithms.
This article deals with the design of the MDA transformation models. It suggests a new general algorithm for systematic and step by step construction of the MDA transformation models. In the first part, the theory and...
详细信息
ISBN:
(纸本)9780769550428;9781479905874
This article deals with the design of the MDA transformation models. It suggests a new general algorithm for systematic and step by step construction of the MDA transformation models. In the first part, the theory and the model driven architecture prolematic, such as its standards, process and transformation, is discussed in general. Subsequently the specification of the transformation model is described in more detail. We define special conditions for the mapping rules classification. The most important part of this paper is the algorithm definition. There is the specification of the transformation model creation same as the target metamodel extension there. The final part contains an example of the proposed algorithm application and a summary of the results. We present the algorithm behavior on a concrete model transformation.
Digital world is a dire need of the current scenario. Now these days equipments take the digital snapshots which may be blur due to bad focus of camera, relative motion between camera and scene to be capture etc. This...
详细信息
ISBN:
(纸本)9781479915729
Digital world is a dire need of the current scenario. Now these days equipments take the digital snapshots which may be blur due to bad focus of camera, relative motion between camera and scene to be capture etc. This is an extensive problem to restore this sort of images. This paper proposed a hybrid methodology to recover these images in order to improve the quality. This work uses the basic concept of kernel and padding. This work also applies the Haar wavelet Transform for filtering the image in order to reconstruct image which have the noise and blur. The results of this paper show that the proposed method gives the better result from the previous methods. It seems to be that the PSNR, Mean Square Rate and execution time is better in the proposed scheme.
Current methods for object-oriented software development provide notation for the specification of models, yet do not sufficiently relate the different model types to each other, nor do they provide support for transf...
详细信息
Current methods for object-oriented software development provide notation for the specification of models, yet do not sufficiently relate the different model types to each other, nor do they provide support for transformations from one model type to another. This makes transformations a manual activity, which increases the risk of inconsistencies among models and may lead to a loss of information. We have developed and implemented an algorithm supporting one of the transitions from analysis to design, the transformation of scenario models into behavior models. This algorithm supports the Unified Modelling Language (UML), mapping the UML's collaboration diagrams into state transition diagrams. We believe that CASE tools implementing such algorithms will be highly beneficial in object-oriented software development. In this paper, we provide an overview of our algorithm and discuss all its major steps. The algorithm is detailed in semi-formal English and illustrated with a number of examples. Furthermore, the algorithm is assessed from different perspectives, such as scope and role in the overall development process, issues in the design of the algorithm, complexity, implementation and experimentation, and related work. Copyright (C) 2001 John Wiley & Sons, Ltd.
UML statechart are finite state machines extended with hierarchy, orthogonality and broadcasting. It can describes all dynamic actions of the element in system. But it is very difficult to be applied to generating tes...
详细信息
ISBN:
(纸本)9781467329644;9781467329637
UML statechart are finite state machines extended with hierarchy, orthogonality and broadcasting. It can describes all dynamic actions of the element in system. But it is very difficult to be applied to generating test cases directly in practical application for its complex syntax definition and imprecise semantics. The paper analyses the UML statechart in detail and designs a transformation algorithm for transformation from UML statechart to classical state diagram. It provides a feasible approch for generating test cases directly from UML statechart. At last the approach is illustrated with an example.
Role-based access control (RBAC) is widely used as an access control mechanism in various computer systems. Since an organization's lines of authority influence the authorized privileges of jobs, roles also form a...
详细信息
Role-based access control (RBAC) is widely used as an access control mechanism in various computer systems. Since an organization's lines of authority influence the authorized privileges of jobs, roles also form a hierarchical structure. A role graph is a model that represents role hierarchies and is suitable for the runtime phase of RBAC deployment. Since a role graph cannot take various forms for given roles and cannot handle abstraction of roles well, however, it is not suitable for the design phase of RBAC deployment. Hence, an extended role graph, which can take a more flexible form than that of a role graph, is proposed. The extended role graph improves diversity and clarifies abstraction of roles, making it suitable for the design phase. An equivalent transformation algorithm (ETA), for transforming an extended role graph into an equivalent role graph, is also proposed. Using the ETA, system administrators can deploy efficiently RBAC by using an extended role graph in the design phase and a standard role graph in the runtime phase.
Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property *** there is an extensive literature on qualitative properties such as safety and liveness,t...
详细信息
Model checking is an automated formal verification method to verify whether epistemic multi-agent systems adhere to property *** there is an extensive literature on qualitative properties such as safety and liveness,there is still a lack of quantitative and uncertain property verifications for these *** uncertain environments,agents must make judicious decisions based on subjective *** verify epistemic and measurable properties in multi-agent systems,this paper extends fuzzy computation tree logic by introducing epistemic modalities and proposing a new Fuzzy Computation Tree Logic of Knowledge(FCTLK).We represent fuzzy multi-agent systems as distributed knowledge bases with fuzzy epistemic interpreted *** addition,we provide a transformation algorithm from fuzzy epistemic interpreted systems to fuzzy Kripke structures,as well as transformation rules from FCTLK formulas to Fuzzy Computation Tree Logic(FCTL)***,we transform the FCTLK model checking problem into the FCTL model *** enables the verification of FCTLK formulas by using the fuzzy model checking algorithm of FCTL without additional computational ***,we present correctness proofs and complexity analyses of the proposed ***,we further illustrate the practical application of our approach through an example of a train control system.
Espresso cipher is designed targeting 5G wireless communication systems. To achieve high efficiency, a maximum period Galois NLFSR is used as the only building block. The Galois NLFSR is constructed by a scalable meth...
详细信息
Espresso cipher is designed targeting 5G wireless communication systems. To achieve high efficiency, a maximum period Galois NLFSR is used as the only building block. The Galois NLFSR is constructed by a scalable method which converts a maximum LFSR to a Galois NLFSR. Based on this method, a new class of stream ciphers, namely maximum period Galois NLFSR-based stream ciphers can be designed. However, we identify a conditional equivalence problem in the design method and adopt the Type-II-to-Fibonacci transformation algorithm. We apply the algorithm to the Espresso cipher and successfully transform the Galois NLFSR to a Fibonacci LFSR with a nonlinear output function. The Espresso cipher is transformed to an LFSR filter generator. We break it by the fast algebraic attack and the Ronjom-Helleseth attack with complexity of 2(68.50) and 2(48.59) logical operations respectively. Moreover, we show that the entire class of maximum period Galois NLFSR-based stream ciphers can be transformed to LFSRs. Therefore, this kind of cipher is always equivalent to an LFSR filter generator. We discuss other related attacks and give suggestions for future design.
暂无评论