4695766
Threat-Driven Architectural Design of Secure Information Systems
To deal with software security issues in the early stages of system development, this paper presents a threatdriven approach to the architectural design and analysis of secure information systems. In this approach, we model security threats to systems with misuse cases and mitigation requirements with mitigation use cases at the requirements analysis phase. Then we drive system architecture design (including the identification of architectural components and their connections) by use cases, misuse cases, and mitigation use cases. According to the misuse case-based threat model, we analyze whether or not a candidate architecture is resistant to the identified security threats and what constraints must be imposed on the choices of system implementation. This provides a smooth transition from requirements specification to high-level design and greatly improves the traceability of security concerns in high assurance information systems. We demonstrate our approach through a case study on a security-intensive payroll information system.
14135016
A Study on Illumination Invariant Face Recognition Methods Based on Multiple Eigenspaces
This paper presents two multiple illumination eigenspaces-based methods, RDEB and BPNNB, for solving the variable illumination problem of face recognition. The experiment shows that the methods have a high recognition ratio. In particular, BPNNB has outperformed the assumptive method which knows the illumination directions of faces and completes recognition in the specific eigenspace using eigenface method[2] for each face subset with a specific illumination direction.
11509547
Illumination invariant face recognition based on neural network ensemble
An illumination invariant face recognition method based on neural network ensemble architecture is proposed. Given a face image with an arbitrary illumination direction, it can complete recognition in a uniform way with high performance without knowing or estimating the illumination direction. Experimental result shows that the recognition ratio of the ensemble architecture is higher than the conventional approach that uses a single neural network to recognize faces of a specific illumination direction.
41800471
Ensuring Consistent Use/Misuse Case Decomposition for Secure Systems
11130686
An Aspect-Oriented Approach to Security Requirements Analysis
This paper presents an aspect-oriented approach to integrated elicitation of functional and security requirements based on use case-driven development. We identify security threats with respect to use cases and adopt threat mitigations for preventing or reducing security threats. To capture crosscutting nature of threats and mitigations, we specify them as aspects that encapsulate pointcuts and advice. A threat (mitigation) pointcut is a collection of join points in use cases at which the use cases are threatened (secured); whereas threat/mitigation advice describes how a threat can become an attack (can be mitigated). Eliciting threats and mitigations as aspects provides a structured way for separating functional and security concerns
11698669
Modeling and verifying multi-agent behaviors using predicate/transition nets
In a multi-agent system, how agents accomplish a goal task is usually specified by multi-agent plans built from basic actions (e.g. operators) of which the agents are capable. A critical problem with such an approach is how can the designer make sure the plans are reliable. To tackle this problem, this paper presents a formal approach for modeling and analyzing multi-agent behaviors using Predicate/Transition (PrT) nets, a high-level formalism of Petri nets. We construct a multi-agent model by representing agent capabilities as transitions. To verify a multi-agent PrT model, we adapt the planning graphs as a compact structure for the reachability analysis. We also demonstrate that, based on the PrT model, whether parallel actions specified in multi-agent plans can be executed in parallel and whether the plans guarantee the achievement of the goal can be verified by analyzing the dependency relations among the transitions.
342298
Nonlinear information aggregation via evidential reasoning in multiattribute decision analysis under uncertainty
In many decision situations, it is inevitable to deal with both quantitative and qualitative information under uncertainty. Evidence-based reasoning within a multiple criteria decision analysis framework provides an alternative way of handling such information systematically and consistently. In this paper, the evidential reasoning (ER) approach is introduced, which is based on a recursive ER algorithm that, in essence, constitutes a nonlinear information aggregation process. To facilitate the application of the ER approach and as an indispensable part of its development, the nonlinear features of the ER information aggregation process need to be thoroughly investigated and properly understood. This forms the theme of this paper where the nonlinear features are explored by examining typical reasoning patterns in aggregating harmonic, quasi-harmonic, and contradictory decision information. This analytical investigation provides insights into the recursive nature of the ER approach as well as valuable experience that could be useful to other researchers and practitioners interested in developing and applying operation research/artificial intelligence (OR/AI)-based approaches for decision analysis under uncertainty. The analytical study is complemented by the numerical studies of two application examples. The analysis of a quality assessment problem for motor engines is aimed to show the step-by-step process of implementing the ER approach and to illustrate its nonlinear features in a real-life decision situation. The study of a more complex assessment problem in ship design is intended to demonstrate the potential of the ER approach and its supporting software for dealing with general decision problems.
11019838
Intelligent Decision Support for Family Financial Planning
In today’s financial markets characterized by constantly changing tax laws and increasingly complex transactions, the demand for family financial planning (FFP) services is rising dramatically. However, the current trend to develop advisory systems that focus mainly on the financial or investment side fails to consider the whole picture of FFP. Separating financial or investment advice from legal and accounting advice may result in conflicting advice or important omissions that could lead to users suffering financial loss. In this paper, we propose a conceptual model for FFP decision-making process, followed by a novel architecture to support an aggregated FFP decision process by utilizing intelligent-agents and Web-services technology. A prototype system for supporting FFP decision is presented to demonstrate the advances of the proposed Web-service multi-agents-based system architecture and business value.
7446737
A web-service agent-based decision support system for securities exception management
Abstract With rising trading volumes and increasing risks in securities transactions, the securities industry is making an effort to shorten the trade lifecycle and minimize transaction risks. While attempting to achieve this, exception management is crucial to pass trade information within the trade lifecycle in a timely and accurate fashion. For a competitive solution to exception management, a web-service-agent-based decision support system is developed in this paper. Agent technology is applied to deal with the dynamic, complex, and distributed processes in exception management; web services techniques are proposed for more scalability and interoperability in network-based business environment. By integrating agent technology with web services to make use of the advantages from both, this approach leads to more intelligence, flexibility and collaboration in business exception management. The effectiveness of this approach is evaluated through a use case and demonstration feedback.
9795964
On finding disjoint paths in single and dual link cost networks
Finding a disjoint path pair is an important component in survivable networks. Since the traffic is carried on the active (working) path most of the time, it is useful to find a disjoint path pair such that the length of the shorter path (to be used as the active path) is minimized. In this paper, we first address such a minmin problem. We prove that this problem is NP-complete in either single link cost (e.g. dedicated backup bandwidth) or dual link cost (e.g. shared backup bandwidth) networks. In addition, it is NP-hard to obtain a k-approximation to the optimal solution for any k>1. Our proof is extended to another open question regarding the computational complexity of a restricted version of the min-sum problem in an undirected network with ordered dual cost links (called MSOD problem). To solve the minmin problem efficiently, we introduce a novel concept called conflicting link set which provides insights into the so-called trap problem, and develop a divide-and-conquer strategy. The result is an effective heuristic for the minmin problem called COLE, which can outperform other approaches in terms of both the optimality and running time. We also apply COLE to the MSOD problem to efficiently provide shared path protection and conduct comprehensive performance evaluation as well as comparison of various schemes for shared path protection. We show that COLE not only processes connection requests much faster than existing ILP based approaches but also achieves a good balance among the AP length, bandwidth efficiency and recovery time.
46223238
Environmental impact assessment using the evidential reasoning approach
Environmental impact assessment (EIA) problems are often characterised by a large number of identified environmental factors that are qualitative in nature and can only be assessed on the basis of human judgments, which inevitably involve various types of uncertainties such as ignorance and fuzziness. So, EIA problems need to be modelled and analysed using methods that can handle uncertainties. The evidential reasoning (ER) approach provides such a modelling framework and analysis method. In this paper the ER approach will be applied to conduct EIA analysis for the first time. The environmental impact consequences are characterized by a set of assessment grades that are assumed to be collectively exhaustive and mutually exclusive. All assessment information, quantitative or qualitative, complete or incomplete, and precise or imprecise, is modelled using a unified framework of a belief structure. The original ER approach with a recursive ER algorithm will be introduced and a new analytical ER algorithm will be investigated which provides a means for using the ER approach in decision situations where an explicit ER aggregation function is needed such as in optimisation problems. The ER approach will be used to aggregate multiple environmental factors, resulting in an aggregated distributed assessment for each alternative policy. A numerical example and its modified version are studied to illustrate the detailed implementation process of the ER approach and demonstrate its potential applications in EIA.