We discuss tabular forms. It is known in the previous studies that the “octgrid” is a data structure for single layer tabular forms with ruled line preserving algorithms. And the “hexadeci-grid” is known as a data...
We discuss tabular forms. It is known in the previous studies that the “octgrid” is a data structure for single layer tabular forms with ruled line preserving algorithms. And the “hexadeci-grid” is known as a data structure for multiply layered tabular forms which is a generalization of the “octgrid”. Our purpose of this paper is to propose a new algorithm based on the “hexadeci-grid” model for editing tabular forms.
XML databases are commonly used for representing data with more complex structures than traditional relational data. Like in any data model, it is very important to ensure that the contents of the database always vali...
详细信息
XML databases are commonly used for representing data with more complex structures than traditional relational data. Like in any data model, it is very important to ensure that the contents of the database always valid even after any attempt of updates. XML Updates validation is a process of checking the correctness of XML documents, in terms of satisfying their constraints, after updates operations. The validation can be generally categorized into structural and semantic validation. The first validation is to ensure that all XML nodes in the documents conform to structural information in its associated schema. Meanwhile, the second validation checks the integrity constraints of the documents, and it involve various factors such as the functional dependencies, domain constraint, inheritance, etc. In this paper, we provide a preliminary survey of semantic validation w.r.t XML Updates. The work of validation usually applied either upon any attempt of updates or in a scheduled period. We compare the output gain by works in terms of operation of update, the composition, types of constraint, etc. It shows that even though there are abundant of studies in this area, not much work has investigated a complete semantic validation of different semantic constraints. The constraints are still strongly dependent on structural information of documents and lied only on the data access tier of application architecture.
This paper compared ACF(Auto Correlation Feature) characteristics for ZCD, Kasami and Golay codes. Sequence codes have been used as a spreading sequence in order to overcome ICI(Inter Code Interference) caused by tran...
详细信息
Despite extensive work on traffic dynamics and epidemic spreading on complex networks, the interplay between these two types of dynamical processes has not received adequate attention. We study the effect of local-rou...
详细信息
Despite extensive work on traffic dynamics and epidemic spreading on complex networks, the interplay between these two types of dynamical processes has not received adequate attention. We study the effect of local-routing-based traffic dynamics on epidemic spreading. For the case of unbounded node-delivery capacity, where the traffic is free of congestion, we obtain analytic and numerical results indicating that the epidemic threshold can be maximized by an optimal routing protocol. This means that epidemic spreading can be effectively controlled by local traffic dynamics. For the case of bounded delivery capacity, numerical results and qualitative arguments suggest that traffic congestion can suppress epidemic spreading. Our results provide quantitative insight into the nontrivial role of traffic dynamics associated with a local-routing scheme in the epidemic spreading.
Dedicated Short Range Communication (DSRC) employs one control channel for safety-oriented applications and six service channels for non-safety commercial applications. However, most existing multichannel schemes requ...
详细信息
Textual password authentication schemes are vulnerable to attacks like eves dropping, shoulder surfing and hidden cameras. An authentication scheme which integrates graphics and text is resistant to these attacks. Nat...
详细信息
Textual password authentication schemes are vulnerable to attacks like eves dropping, shoulder surfing and hidden cameras. An authentication scheme which integrates graphics and text is resistant to these attacks. Native language passwords are more secure than standard language passwords. Users can remember native language passwords better than any other language, by nature. A shape based textual password authentication scheme using native language of the user is discussed and enhancements are proposed to make the authentication scheme more secure.
Many fatal accidents of safety critical reactive systems have occurred in unexpected situations which had not been considered during design and test phases of the systems. To prevent these accidents, reactive systems ...
详细信息
Many fatal accidents of safety critical reactive systems have occurred in unexpected situations which had not been considered during design and test phases of the systems. To prevent these accidents, reactive systems should be designed to respond appropriately to any requests of any timing from their environments. Verifying this property in specification phase reduces the development costs of safety critical reactive systems. This property of a specification is well known as realizability. If a specification was found not to be realizable, we have to determine the flaws in the unrealizable specification. Unrealizability of a specification arises from arbitrary requirements given by system designers. From a different point of view, it can be thought that the unrealizable specification implicitly imposes a precondition on the behavior of environment, which a system can not control. If it is possible to obtain the precondition in intuitively comprehensive forms, this makes it easy for system designers to understand the cause of flaws in specifications. In this paper, we propose methods for deriving constraints on the behavior of environments, which is implicitly imposed by unrealizable specifications. Instead of realizability, we use strong satisfiability which is a necessary condition for realizability, due to the fact that many practical unrealizable specifications are also strongly unsatisfiable, and strong satisfiability have the advantage of lower complexity for analysis against realizability. These methods derive constraints in propositional linear temporal logic from Büchi automata representing specifications. The expressions of derived constraints are limited to simple and intuitively comprehensive forms where only two temporal operators appear successively. We give proofs for three correctness properties of our methods, i.e. the termination property, the soundness property, and the weakest constraints derivability. We also discuss complexity of our methods. Fi
In a world where an increasing number of transactions are made on the web, there is a need for a trust evaluation tool dealing with uncertainty, e.g., for customers interested in evaluating the trustworthiness of an u...
详细信息
In a world where an increasing number of transactions are made on the web, there is a need for a trust evaluation tool dealing with uncertainty, e.g., for customers interested in evaluating the trustworthiness of an unknown service provider throughout queries to other customers of unknown reliability. In this paper, we propose to estimate the trust of an unknown agent, say a D , through the information given by a group of agents who have interacted with agent a D . This group of agents is assumed to have an unknown reliability. In order to tackle the uncertainty associated with the trust of unknown agents, we suggest to use possibility distributions. We introduce a new certainty metric to measure the degree of agreement of the information reported by the group of agents about agent a D . Fusion rules are then used to estimate the possibility distribution of agent a D 's trust. To the best of our knowledge, this is the first paper that estimates trust, out of empirical data, subject to some uncertainty, in a discrete multi-valued trust environment. Numerical experiments are presented to validate the proposed tools.
This paper reports on the implementation of Voltage Security Assessment tools in the energy management system of RTE, the French transmission system operator. In particular, secure operation limits are determined in v...
详细信息
ISBN:
(纸本)9781457710001
This paper reports on the implementation of Voltage Security Assessment tools in the energy management system of RTE, the French transmission system operator. In particular, secure operation limits are determined in voltage sensitive regions. This involves a load increase in the region of concern, covered by a power transfer from various locations throughout the system. The limit is the maximum load power increase such that the system can withstand every contingency of a list. A salient feature of the tool is the use of a simplified, fast time simulation based on the quasi steady-state approximation. This is justified by the presence of controls reacting to the load power increase and the contingency, which makes standard power flow computations inappropriate. The paper also describes the implementation of the tools in the energy management platform of RTE and shows some typical results.
The nonlinear model predictive control (MPC) needs to solve a two-point boundary-value problem (TP-BVP) at every sample time based on the receding horizon control strategy. However, solving a nonlinear algebraic equat...
详细信息
暂无评论