-
Inf. Sci. 01/2010; 180:3894-3913.
-
[show abstract]
[hide abstract]
ABSTRACT: Security is a requisite and vital concern that should be addressed in e-commerce systems. Traditionally, to add security properties to the application, developers had to specify when, where and how to apply what security policies manually. Such a process is often complicate and error-prone. This paper describes an aspect oriented approach to separating security and application concerns at the architecture level. In the approach, security and application concerns are specified in security aspect models and a base model separately. By specifying the crosscutting relationship between them, the two kinds of models are combined together through weaving. The weaving is based on process algebras and is automatic. Separating security aspects at the early stage of software development can promote maintainability and traceability of the system.
Electronic Commerce and Security, 2008 International Symposium on; 09/2008
-
[show abstract]
[hide abstract]
ABSTRACT: A large number of heterogeneous and computing devices, such as PCs, PDAs, and cell phones, nowadays are used to access the same information. Currently, designers designing such multi-device user interfaces have to design a UI separately for each device, which is a time consuming and error prone activity. This paper discusses our approach to the multi-device interface development. We describe how abstract UI descriptions with FMP model. We also discuss how get adaptive presentational models for various devices with UI templates and UI design patterns help. Lastly, with code generate tool help, concrete user interfaces are generated.
Network and Parallel Computing Workshops, 2007. NPC Workshops. IFIP International Conference on; 10/2007
-
[show abstract]
[hide abstract]
ABSTRACT: Patterns play a more role on the knowledge use of the HCI domain. Many user interface (UI) patterns are well suited to identifying UI knowledge to strengthen reuse. Some UI pattern tools provide simulation capabilities and/or aid in the construction of concrete user interfaces. When it is desirable for the simulated or constructed interface to be realistic, different implementation architectures need to be built for every pattern because of lack of the uniform implementation mechanism, which has effect on the capability of UI knowledge reuse thoroughly. After the granularity of above patterns are shortened, a uniform UI pattern architecture (UUIPA) is proposed towards the engineering UI development. The architecture is based on MVC architecture which contains the interior data, the behavior control and presentation control. The three aspects come from Interaction Object (IO) extended from General Object in the conceptual model to Presentation Style (PS) used frequently by designers in the implementation model, which embodies the map relation from IO to PS. Through the visible customization, UI patterns are instantiate as various UI units meet needs of users. Additionally, the approach is also used to multi-device user interface development through extending PSs fitted to different devices gradually while keeping fixed IOs. A case study is provided to demonstrate the applicability of the UI pattern.
Automation and Logistics, 2007 IEEE International Conference on; 09/2007
-
[show abstract]
[hide abstract]
ABSTRACT: This paper proposes a PNP model that can support heuristic Web user interface design. Using this method, data information relevant Web user interface is captured by the object presentation model. The operation and navigation among page units expressed by the navigation and interaction model. With the participation of the users and supported by Web user interface design patterns, Web designers can build page presentation models heuristically, which are based on page template. In this way, the Web designers can finish the design of complex Web user interface in a higher abstract level without increasing the design difficulty. In the end, with the help of tools, codes are automatically generated through the model transformation.
Information Reuse and Integration, 2007. IRI 2007. IEEE International Conference on; 09/2007
-
Proceedings of the 8th ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing, SNPD 2007, July 30 - August 1, 2007, Qingdao, China; 01/2007
-
Advanced Parallel Processing Technologies, 7th International Symposium, APPT 2007, Guangzhou, China, November 22-23, 2007, Proceedings; 01/2007
-
Proceedings of the MoDELS 2007 Workshop on Model Driven Development of Advanced User Interfaces, Nashville, Tennessee, USA, October 1, 2007; 01/2007
-
[show abstract]
[hide abstract]
ABSTRACT: Platform independent models (PIMs), platform specific models (PSMs) and the transformation between them are key technologies in OMG's MDA. But there is no effective solution until now. Starting from software architecture modeling, a modeling approach was proposed to build platform independent models for Web applications by extending UML and adding user-interface presentation views. Based on this approach, an abstract algebra method is employed to realize the transformation from PIMs to PSMs according to the mapping relations between architectures. This solution makes better use of traceable links established by software architecture between the phases of software lifecycle, and it can support model driven software engineering effectively for keeping independency for PIMs. Software architecture becomes the basis of system analysis and model transformation at the same time. J2EE was used as a target platform to help interpreting the process of using this approach
Intelligent Systems Design and Applications, 2006. ISDA '06. Sixth International Conference on; 11/2006
-
[show abstract]
[hide abstract]
ABSTRACT: In order to resolve the problem of low accuracy in Chinese natural language parsing introduced by the lack of complete grammar rules set, a Binary Combinatorial Grammar (BCG) for describing natural language through binary relations between constituents is proposed, which can depict complicated syntactic structures by a very small number of binary relations between head words and their hierarchical combinations. Based on the Binary Combinatorial Grammar, a parsing algorithm for Chinese natural language is proposed which takes operator precedence computing as its basic ideas. Four basic operations and one extended operation are defined in the algorithm. The order of combinatorial operations in parsing is controlled according to the priority between adjacent binary relations, and eventually the recognition of chunks and whole syntactic structures is achieved. The validity of the grammar and the parsing algorithm is proved by the analysis of the space complexity and the time complexity.
Intelligent Systems Design and Applications, International Conference on. 10/2006; 2:761-766.
-
Proceedings of the Sixth International Conference on Intelligent Systems Design and Applications (ISDA 2006), October 16-18, 2006, Jinan, China; 01/2006
-
[show abstract]
[hide abstract]
ABSTRACT: It is necessary to guarantee the validity of Web services and their composition. Traditional approaches transform the BPEL4WS specification into other formal models and then check them. Unfortunately, if we could not find the proper composition of services to fulfill the request but have to develop parts of services ourselves, the models used to verify are almost useless in other development steps. The B-method is a state model-based, formal specification notation that has strong structuring mechanisms and good tool support. Furthermore, refinement, a key concept in the B-method, allows one to start from a high-level specification and then gradually refine it into an implementation. There are some tools which have been developed for the automatic refinement check. Therefore, modeling for Web services and their composition, and then verifying the B models, and refining, and finally even implementing parts of the B models if necessary with the help of the tools of B, is proposed in this paper.
Next Generation Web Services Practices, International Conference on.
-
[show abstract]
[hide abstract]
ABSTRACT: To deal with the problems in the current parsing method of natural language, a language model based on purely typed binary relations is proposed in this paper, which is quite different from classical context-free grammar, Chomsky normal form and dependency grammar. The completeness of language structure coverage is easily captured using the proposed language model, so long as the binary relations can be recognized thoroughly. The parsing process is considered as the manipulation of binary operations of words, which is similar to the computation of arithmetic expressions in terms of the proposed language model, where operands are words and operators are the typed relations. And thereafter, a parsing algorithm based on operator precedence is proposed in the paper, with the algorithm formalized and the complexity analyzed. The proposed ideas have been proved valid and realistic through the application to parsing Chinese sentences. Further researches are needed to put it into the effective and practical usages in large scale to make it developed as a powerful theoretical way for parsing natural language.
Natural Language Processing and Knowledge Engineering, 2005. IEEE NLP-KE '05. Proceedings of 2005 IEEE International Conference on;
-
[show abstract]
[hide abstract]
ABSTRACT: Current aspect specification methods do not provide enough support for explicitly specifying aspects and their weaving logic, nor do they provide effective and suitable mechanisms for aspect analysis and evaluation. A formal approach for specifying architecture aspects and their weaving logic is presented. In this approach, architecture aspects and their weaving logic are specified in independent abstract mechanisms. More importantly, Petri Nets are used as the common foundations for describing their behaviors. Owing to the powerful specification capability of these mechanisms, the main advantages of this approach lie in that it can not only specify complex aspect architecture structures and behaviors and their complex weaving logic, but also make it possible for reasoning about and evaluating the weaving results. A simple example is given to illustrate the approach and its advantages.
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on;
-
[show abstract]
[hide abstract]
ABSTRACT: Cohesion degree is an important feature in differentiating ambiguous Chinese phrases. At the present time, there are no module in computer-oriented linguistic theories to represent this information and it is represented by additional statistical modules. The Binary Combinatorial Grammar (BCG) is based on arithmetic computing and integrates the cohesion degree as the priorities between operators. In order to resolve the share space problem and to improve the efficiency of operator-precedence shift-reduce parsing algorithm, the notion of precedence is introduced to the CYK algorithm to determine the combinatorial direction and to prune a portion of unnecessary subtrees during the parsing process. In the experiment of Chinese BCG parsing, all of the spent time, produced edges and result trees in the precedence based CYK algorithm are much less than that of the traditional CYK algorithm and the operator precedence based shift-reduce algorithm.
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on;
-
[show abstract]
[hide abstract]
ABSTRACT: In order to integrate the context and linguistic information into the parsing model in a holistic and strict way, and to describe the complex structure more precisely, a parsing model is proposed to visually take the above information into account. Considering that the functional words and the words with special usage can have a profound impact on the syntactic structure, some patterns are built especially for them, and the probabilities of patterns are pre-computed and stored. The matching between partial parse and pattern is based on the ordered tree inclusion, and the probability of parse tree is computed on the basis of the matched patterns. It is plausible to match and retrieve the probability from the pattern bank for there are many algorithms with linear space and time spent for ordered tree inclusion problem. The method can provide a vivid, strict and somewhat fuzzy restriction for the complex structures modeling.
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on;
-
[show abstract]
[hide abstract]
ABSTRACT: As the knowledge reuse is becoming more and more crucial, patterns play a more effective way on the knowledge use of the HCI domain. However, some patterns are mostly oriented to different tasks, which are too coarse-grained to be easily implemented. And the relative user interfaces are not provided in these patterns. Furthermore many different patterns are oriented to different models in the model based on UI development, which are hard to be integrated into the UI development tool. On the point of multi-device UI development (MD_UID), the composition-oriented UI design pattern (CUIDP) is proposed from the interior model, the presentation characteristic and the behavior feature. In particular, it spans various models of the MD_UID and provides various parameters to users to custom UIs intuitively, which helps the engineering-oriented UI development. As a case, the grid CUIDP is explicitly described according to the form of CUIDP. The algorithm of grid presentation unit is given, which is oriented to ASP.NET. Finally, the conclusion and the further work are discussed.
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on;
-
[show abstract]
[hide abstract]
ABSTRACT: Model transformation is touted to play a key role in model-driven development. The mapping relations between models are the foundation and basis for the transformation. On the basis of software architecture, this paper tries to provide a precise semantics for both components structuring and models mapping by using category theory. Morphism composition is used to trace the interconnections and mapping relations between component-based models, while consistency between the sorts /operations of component models at different abstract levels is maintained by functors. Category theory supports the diagrammatic representation of component model that visualizes the relationships between components and the structural features, which can be used to strengthen the understandability and traceability of model transformation. The formalization enables users to check whether the mapping relations satisfy some desired properties and also is suitable to automatic software development, and thus can make an effective support to model-driven software development.
Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing, 2007. SNPD 2007. Eighth ACIS International Conference on;