Access control is a vital security mechanism in today's operating systems, and the security policies dictating the security relevant behaviors is lengthy and complex, for example in Security-Enhanced Linux (SELinu...
详细信息
Access control is a vital security mechanism in today's operating systems, and the security policies dictating the security relevant behaviors is lengthy and complex, for example in Security-Enhanced Linux (SELinux). It is extremely difficult to verify the consistency between the security policies and the security goals desired by applications. In this paper, we present how to predict whether the information flow security goal is violated or not during runtime, how to generate the corresponding control actions on-line when divergence is detected and how to apply these actions in time based on software active monitoring technique. The symbolic security information flow model of SElinux is generated from a formalization of the access control mechanism which can be used to generate the N-step ahead projection of the future behavior. Information flow security goals are expressed in linear temporal logic (LTL) which provides clear description of the objectives desired by applications. Anticipatory monitor is generated from LTL formula automatically. We consider an on-line scheme where after the occurrence of an event, the next control action is determined on the basis of the N-step ahead projection of the future behavior. This procedure is repeated after the occurrence of next security relevant event. Thus, a closed-loop system is generated that all behavior sequences will satisfy the security goals.
The complexity of pairwise RNA structure alignment depends on the structural restrictions assumed for both the input structures and the computed consensus structure. For arbitrarily crossing input and consensus struct...
详细信息
A new approach for segmenting different anatomical regions in dental Computed Tomography (CT) studies is presented in this paper. It is expected that the proposed approach will help automate different tissues regions ...
详细信息
A new approach for segmenting different anatomical regions in dental Computed Tomography (CT) studies is presented in this paper. It is expected that the proposed approach will help automate different tissues regions by providing initial boundary points for deformable models or seed points for split and merge segmentation algorithms. Preliminary results obtained for dental CT studies of dentate and edentulous human-mandible are presented with finite element models divided by tetrahedral elements, which built based on actual CT data combined with triangulation equations. Identification of different anatomical regions set for mandible cortical and cancellous bones by generated 3D models by marching cubes technique.
In this paper, a new approach for computing different anatomical regions in dental Computed Tomography (CT) is presented. The approach consists of two steps. First, a HU threshold window sets to separate between diffe...
详细信息
In this paper, a new approach for computing different anatomical regions in dental Computed Tomography (CT) is presented. The approach consists of two steps. First, a HU threshold window sets to separate between different regions upon their gray-level values; second, a set of objects are generated and texture descriptors are calculated for selected windows from the image data sample. Finally, identification of different anatomical regions set for mandible bones to determine the cystic lesion volume based on numerical methods. Preliminary results obtained for dental CT of female patient aged 14 years old complaining of bilateral swelling in her mandible are presented.
The construction and development of "two-oriented society" in Wuhan city circle should be combined with the development of colleges and universities in the region. It's necessary to update the concept an...
详细信息
Boolean Differential Calculus (BDC) extends Boolean *** Boolean algebra is focused on values of logic functions,BDC allows the evaluation of changes of the function values. Such changes can be investigated between cer...
详细信息
ISBN:
(纸本)9781608451821
Boolean Differential Calculus (BDC) extends Boolean *** Boolean algebra is focused on values of logic functions,BDC allows the evaluation of changes of the function values. Such changes can be investigated between certain pairs of function values as well as regarding whole subspaces. Due to the same basic data structures, BDC can be applied to any task described by logic functions and equations together with the Boolean *** used is BDC in analysis, synthesis, and testing of digital circuits. In this chapter, we introduce basic definitions of BDC together with some typical applications.
This paper presents a new tuning method based on model parameters identified in closed-loop. For classical controllers such as PI(D) controllers a large number of simple tuning methods for various application areas ex...
详细信息
ISBN:
(纸本)9781849192521
This paper presents a new tuning method based on model parameters identified in closed-loop. For classical controllers such as PI(D) controllers a large number of simple tuning methods for various application areas exist. However, when it comes to designing a generalised predictive controller (GPC) four parameters have to be specified. To choose those parameters is not a trivial task since they are not directly related to control or regulation performance. The presented tuning method exploits model-parameters to select suitable controller parameters. Additionally, a Rhinehart filter is incorporated in the design to decrease the impact of noise, therefore, a fifth parameter has to be optimised. The proposed method has been tested in simulation and on a real system.
Multithreaded Object-Oriented programming in concurrency environment using object-oriented technology is a complex activity. Programmers need to be aware of issues unrelated to their domain of problem, and are often u...
详细信息
ISBN:
(纸本)9789604742073
Multithreaded Object-Oriented programming in concurrency environment using object-oriented technology is a complex activity. Programmers need to be aware of issues unrelated to their domain of problem, and are often unprepared for the challenges of the concurrent object-oriented programming brings. The interaction of their components becomes more complex, and makes it difficult to validate the design and correctness of the implemented program. Supporting separation of concerns in the design and implementation of the multithreaded object-oriented programming can provide a number of benefits such as comprehension, reusability, extensibility and adaptability in both design and implementation. We have tackled this problem by adopting the technique of separation of concerns in multithreaded object-oriented programming. In this paper we demonstrate an Aspect-Oriented approach that can be used for multithreaded object-oriented programming. We also show how better the separation of concerns in components. Readers/Writers problem is demonstrated using an aspect-oriented approach. Our methodology, which is based on aspect-oriented techniques as well as language and architecture independence, is an aspect-oriented framework.
Let G = ( V , E ) be a simple connected undirected graph. Each vertex v ∈ V has a cost c ( v ) and provides a positive coverage radius R ( v ). A distance d uv is associated with each edge { u , v } ∈ E, and d ( u ,...
Let G = ( V , E ) be a simple connected undirected graph. Each vertex v ∈ V has a cost c ( v ) and provides a positive coverage radius R ( v ). A distance d uv is associated with each edge { u , v } ∈ E, and d ( u , v ) is the shortest distance between every pair of vertices u , v ∈ V . A vertex v can cover all vertices that lie within the distance R ( v ), except the vertex itself. The conditional covering problem is to minimize the sum of the costs required to cover all the vertices in G . This problem is NP-complete for general graphs, even it remains NP-complete for chordal graphs. In this paper, an O ( n 2 ) time algorithm to solve a special case of the problem in a trapezoid graph is proposed, where n is the number of vertices of the graph. In this special
case, d uv = 1 for every edge { u , v } ∈ E , c ( v ) = c for every v ∈ V ( G ), and R ( v ) = R , an integer >1, for every v ∈ V ( G ). A new data structure on trapezoid graphs is used to solve the problem.
ModelicaML is a UML profile for the creation of executable models. ModelicaML supports the Model-Based Systems Engineering (MBSE) paradigm and combines the power of the OMG UML standardized graphical notation for syst...
详细信息
ModelicaML is a UML profile for the creation of executable models. ModelicaML supports the Model-Based Systems Engineering (MBSE) paradigm and combines the power of the OMG UML standardized graphical notation for systems and software modeling, and the simulation power of Modelica. This addresses the increasing need for precise integrated modeling of products containing both software and hardware. This paper focuses on the implementation of executable UML state machines in ModelicaML and demonstrates that using Modelica as an action language enables the integrated modeling and simulation of continuous-time and reactive or event-based system dynamics. More specifically, this paper highlights issues that are identified in the UML specification and that are experienced with typical executable implementations of UML state machines. The issues identified are resolved and rationales for design decisions taken are discussed.
暂无评论