Collaboration Task Analysis by Identifying Multi-Context and Collaborative Linkage

Workflow generation, resource management, and scheduling of workflow are three main components of grid based computing architecture. The components in traditional grid architecture require human intervention due to lack of intelligence and use of knowledge from historical data. We have identified the need of intelligence based automatic workflow generation, and the prediction on run-time of tasks for optimal allocation and reservation of resources. We propose soft computing based architecture of intelligent grid. We also propose the neural network based algorithmic flow for the resource matchmaking, the allocation and reservation, and the scheduling of workflow. Our proposed architecture and algorithmic flow does not require human intervention in workflow generation and in finding and allocating optimal resource for task execution. As our proposed work provides flexibility and reduces complexity in workflow generation, it saves the valuable time and cost of user.

Current commercialized PDM tools have drawbacks in representing a variety of data types such as CAD data, images, audio, long text, etc. by relational data modeling. For this reason, object-oriented approaches have been suggested as an alternative. In this paper, using the object-oriented paradigm, an object-oriented data model for the PDM system is proposed. The scope of the modeling is limited to management information for drawings, parts, and product structure. Rumbaugh’s OMT (Object Modeling Technique) has been adopted for the system design. In the modeling, classes of data vault and workspace are taken into account for the review or approval of drawings and parts data based on the concurrent engineering concept. For parts and corresponding product structure, classes of phantoms, options, substitutes, etc. are added to the model. In addition, state transition and data flow diagrams are suggested based on the analysis of work and data flows of drawings and parts.KeywordsPDMobject-oriented modelingOMTconcurrent engineering

A new approach to representing computer penetrations is introduced called penetration state transition analysis. This approach models penetrations as a series of state transitions described in terms of signature actions and state descriptions. State transition diagrams are written to correspond to the states of an actual computer system, and these diagrams form the basis of a rule-based expert system for detecting penetrations, referred to as STAT. >

With the increasing international communications, people are eager to learn foreign languages. As an auxiliary tool, multimedia learning machine (MLM) is welcomed by foreign language learners. So, it is very necessary to design a powerful MLM efficiently. How to deal with the state transition of MLM's different states is a key issue. In this paper, we describe a solution to design a MLM based on non-deterministic finite automaton (MLM-NFA) and present in detail the state transition model, state transition diagram and the core algorithm. The finite automaton helps us distinguish clearly the relation of state transitions of MLM and the mapping between MLM states and buttons in MLM user interfaces. The MLM-NFA has many advanced functions, such as point-to-read, A-B repeating and role playing. At the end of the paper, we implement an MLM-NFA which proves that the model based on non-deterministic finite automaton principle is quite efficient in practice and makes it very simple and flexible in development.

All-Optical magnetization Switching (AOS) is triggered by ultra-short light-matter interaction that is much shorter time scale than conventional magnetic field driven magnetic recording method[1]. The switching “on” and “off’ strongly depends on absorbed energy and its fluence. In addition, the switching mechanism is differently based on sub-ps energy dissipation process in material[2]. So we can expect considerable rapid magnetic recording with AOS. Furthermore we can anticipate that AOS allows as a new type of multi-value magnetic recording without external magnetic field. In this report we irradiated a single femtosecond laser pulse to the double layered film and observed the magneto-optical image of the created magnetic domains. We designed the film structure which have GdFeCo double layer with dielectric interlayer: SiN (60 nm) / Layer I: Gd 27 Fe 63.9 Co 9.1 (10 nm) / SiN (5 nm) / Layer II :Gd 22 Fe 68.2 Co 9 . 8 (10 nm) / SiN (5 nm) / A1Ti (10 nm) / glass sub. Dielectric SiN interlayer decouple magnetic exchange interaction and electric conduction between two metallic GdFeCo magnetic layers. This double layered film shows 4 level magnetization state and Faraday rotation signals. We found that the different state transition diagram in double magnetic layer can realise compared with magnetic field driven magnetic transition diagram. After irradiation of single femtosecond laser pulse, just the magnetization of Layer I reversed in spite of it have much higher coercivity than Layer II. In addition, we irradiated higher intense laser pulse to the sample. Fig. 1 shows the magneto-optical image of the created magnetic domain and area profile of the image. This result shows three magnetic state was simultaneously created following Gaussian intensity profile of irradiated laser pulse.

Microprogrammed control unit (MCU) and embedded systems are widely used in all kinds of industrial, communication devices and household appliances. However, for the embedded system, even with well hardware protection, the stability are often impacted by the complicated electro magnetic interference (EMI) and the others interference. To get a better system stability ratio, this paper introduces a potent state transition model for the anti-interference intention instead of the empiristic methods. The states of the embedded system are classified into three types: I/O, computing, and error. By the state transition diagram, we deduced a set of anti-interference probability model, which guide the software measures for the anti-interference intention and reduce the unstable probability of the embedded system.

Chapter 15 - Data Flow Diagrams

A new metric, termed `recovery distance?, is introduced for decision feedback receivsers, and is shown to provide the basis for a simple technique for obtaining bounds on a wide range of error statistics. The error propagation process is modelled using stochastic state transition diagrams with merging of states having the same recovery distance, providing the simplification required to render tractable the derivation of probability generating functions for error random variables of interest. The new technique is illustrated by deriving bounds on error statistics for various signal formats of interest for practical applications.

In order to analyze collaboration of people, the author enhances the modeling techniques with specific constructs for the multiple strata in Multi-Context Map (MCM) and Collaborative Linkage Map (CLM). The first is the collaboration stratum where a collection of collaboration tasks is enumerated as top view for systems analysis. The second is the workflow stratum where, for each of collaboration tasks, workflow of request is clarified, and collaborators, tokens, material and information are enumerated. The third is the state transition stratum where state transitions for collaborators, material and information are clarified.

The paper presents a systematic theoretical approach for the analysis of bounds on power consumption in Baugh-Wooley, binary tree and Wallace tree multipliers. This is achieved by first developing state transition diagrams (STDs) for the sub circuits making up the multipliers. The STD is comprised of states and edges, with the edges representing a transition (switching activity) from one state to another in the sub circuit. Then, maximum (minimum) energy values associated with the edges constituting the STDs are used to derive the zipper (lower) bound in both non pipelined and p-bit level pipelined multipliers. It is shown that as p is decreased, the upper bound approaches the lower bound. Moreover, based on the theoretical analysis we conclude that the upper bound in a Baugh-Wooley multiplier has a cubic dependence on the word length, while that in a binary tree multiplier has a quadratic dependence on the word length.

Collaboration Task Analysis by Identifying Multi-Context and Collaborative Linkage

Design of a Government Collaboration Service Map by Big Data Analytics

Glass transition and state diagram for fresh and freeze-dried Chinese gooseberry

Team coordination and information sharing are important in concurrent engineering (CE), where multiple design teams execute their tasks simultaneously and then share information to update their designs, e.g., through integrated tests. The process then iterates until the global design objective is optimized. When properly controlled and executed, CE can be an effective method to speed up the design process for complex and large-scale projects thanks to its parallel nature. Recently, a coordinate optimization framework is proposed in [1] to model and control the information sharing in CE. It can be shown that under a convexity assumption, CE converges to a globally optimal design. In this paper, we study how the coordinate optimization framework can be applied to CE in a general environment where the objective function is non-convex. We propose a simulation optimization method using a domain space cutting and optimal computing budget allocation to efficiently select the initial points from which the coordinate optimization can be applied under a mild local convexity condition. The proposed approach has broad potentials in decentralized control and optimization of complex and large-scale systems in automation. Numerical experiments show that the optimal selection of the initial points allow coordination optimization to efficiently find the global optimum.

In this paper we propose a functional model for the design and testing of the payroll system, a business application in the real world. With domain of the user actions and range of the system reactions, the function simulates the entire system, and defines the mathematical aspect of the application in high level of view. We present the detailed steps to formalize the model from system states and associated activities, to state transition function and transition diagram. Individual component is modelled by the stream processing functions which map the input options from the user to the output reactions of the condition states. Based on the transition function, a simulation program is developed for architecture design and user training.