15916460
An approach to security and privacy of RFID system for supply chain
Radio frequency identification (RFID) is expected to become pervasive and ubiquitous, as it can be embedded into everyday items as smart labels. A typical scenario of exploiting RFID is supply chain. The RFID based supply chain management yields convenience, efficiency and productivity gains. However, RFID systems create new risks to security and privacy. We briefly present the current solutions to RFID security and privacy. A new approach is then proposed, which exploits randomized read access control and thus prevents hostile tracking and man-in-the-middle attack. In addition, compared with current schemes that achieve the similar security level, the proposed approach dramatically decreases the computation load. Another benefit is that it is suitable for RFID systems with a large number of tags
5812455
Knowledge Enhanced IT Service Management
To manage the increasing complexity of IT systems and align IT services with business is the main theme of IT Service Management (ITSM). Current ITSM architecture adopts ITU as the framework to integrate silos of operational management tools and configuration information to build an end-to-end solution based on best practices. However, it lacks of a systematic means to address an important aspect of IT operation, i.e., managing the knowledge separated in various tools and experts' minds. In this paper, a novel knowledge-enhanced architecture is proposed to improve the effectiveness and efficiency of ITSM. The essential contribution of this novel architecture is to involve a Knowledge Management Database (KMDB) which provides assistance for knowledge capture, mining, storage and sharing. The paper will discuss an approach of how to construct such a KMDB with motivating scenarios and detailed description of key components. To validate the approach, a prototype system is developed and evaluated by being applied for problem analysis on a Cisco Voice over IP (VoIP) system. The experiment results show a remarkable improvement in the effectiveness and efficiency for practical IT service management operations.
10702245
A wireless LAN-based indoor positioning technology
Context-aware computing is an emerging computing paradigm that can provide new or improved services by exploiting user context information. In this paper, we present a wireless-local-area-network-based (WLAN-based) indoor positioning technology. The wireless device deploys a position-determination model to gather location information from collected WLAN signals. A model-based signal distribution training scheme is proposed to trade off the accuracy of signal distribution and training workload. A tracking-assistant positioning algorithm is presented to employ knowledge of the area topology to assist the procedure of position determination. We have set up a positioning system at the IBM China Research Laboratory. Our experimental results indicate an accuracy of 2 m with a 90% probability for static devices and, for moving (walking) devices, an accuracy of 5 m with a 90% probability. Moreover, the complexity of the training procedure is greatly reduced compared with other positioning algorithms.
14513982
An Online Model Checking Tool for Safety and Liveness Bugs
Modern software model checkers are usually used to find safety violations. However, checking liveness properties can offer a more natural and effective way to detect errors, particularly in complex concurrent and distributed e-business systems. Specifying global liveness properties which should always eventually be true proves to be more desirable, but it is hard for existing software model checkers to verify liveness in real codes because doing so requires finding an infinite execution. For solving such a challenge, this paper proposes an online checking tool to verify the safety and liveness properties of complex systems. We adopt the linear temporal logic to describe the semantics of the finite model checking, use binary instrumentation to obtain the distribute states and apply a checking engine to dynamically verify the finite trace linear temporal logic properties. At last, we demonstrate the method in a distributed system using distributed protocol Paxos and achieve good results by experiments.
12111515
Algorithm of integrating QFD and TRIZ for the innovative design process
TRIZ, the Russian acronym of the Theory of Inventive Problem Solving, is a useful tool that can solve the problem of "how to do" effectively in the innovative design process, while QFD (Quality Function Deployment) is able to settle the problem of "what to do". Although the potential of using both QFD and TRIZ in the product design process is huge, there are little tools to integrate these two methods effectively. In this research, we describe an algorithm that can integrate QFD and TRIZ effectively for the purpose of the innovative design process. The core of the algorithm is to identify the contradictions in TRIZ by defining rules based on HOQ (House of Quality) in QFD. A software tool called TRIZmatrix is developed based on this algorithm. Application of the algorithm to the case of the airbag problem is studied in detail. The software application and the case study show the advantage of this algorithm for CAI (computer aided innovation) software development.
15004157
A Semantic QoS-Aware Discovery Framework for Web Services
Augmenting web services with explicit semantics forms the foundation of Service Oriented Architectures (SOAs) automation. As more and more Semantic Web Services (SWSs) are deployed, similar SWSs could have quite different quality-of-service (QoS) levels. The QoS-aware discovery becomes an important challenge. While some efforts try to solve it via Constraint Programming (CP), they suffer from the purely syntactic matchmaking method. Furthermore, the construction of constraints and the selection of services are completely dependent on the literal translation from QoS descriptions, which increase obstacles to actually apply CP. In this paper, we propose a semantic QoS-aware framework for SWSs discovery by combining the semantic matchmaking and CP. Initially, a QoS ontology is presented to define QoS data into service descriptions. Then the ontology reasoning is adopted to change previous syntactic matchmaking into a semantic way. Through confirming the compatibility of concepts, complex QoS conditions are solved as constraints and a selection algorithm is proposed to obtain the optimal offer. Finally, the prototype implementation of our framework is discussed and a SWSs discovery case is used to illustrate the comprehensive discovery process.
6929789
WSN02-2: Adaptive Network Resource Management in IEEE 802.11 Wireless Random Access MAC
Effective and efficient management of wireless network resources is attracting more and more research attention, due to the rapid growing deployment of wireless mesh and ad hoc networks and to the increasing demand for Quality of Service (QoS) support in these networks. This paper proposes an adaptive network resource management scheme in the popular IEEE 802.11 random access MAC by adaptively adjusting the minimum contention window sizes of traffic flows. First, a novel generalized processor sharing (GPS) model is presented for the IEEE 802.11 random access MAC revealing the relationship between the minimum contention window size of a traffic flow and the amount of network resource this flow can receive. Using this GPS MAC model, a feedback control system model for the proposed adaptive network resource management system is developed, by directly extending our previous work in wireline GPS networks. Based on the feedback control system model, adaptive P and adaptive PI controllers are designed, and their performances are studied in simulations. Simulation results show that by using the designed controllers, the proposed adaptive network resource management approach is able to provide guaranteed distinct QoS support to traffic flows.
12042823
bSpace: A Data Cleaning Approach for RFID Data Streams Based on Virtual Spatial Granularity
RFID holds the promise of real-time identifying, locating, tracking and monitoring physical objects without line of sight, and can be used for a wide range of pervasive computing applications. To achieve these goals, RFID data have to be collected, filtered, and transformed into semantic application data. RFID data, however, contain false readings and duplicates. Such data cannot be used directly by applications unless they are filtered and cleaned. To compensate for the inherent unreliability of RFID data streams, most RFID middleware systems employ a “smoothing filtering”. In this paper, a new “smoothing filtering” approach named bSpace is proposed, which is based on the concept of virtual spatial granularity. For providing accurate RFID data to applications, bSpace uses a Bayesian estimation algorithm to fill up false negatives, and uses the rules which we define to solve false positives.
6984424
Ontology-based security assessment for software products
This paper proposes an ontology-based approach to analyzing and assessing the security posture for software products. It provides measurements of trust for a software product based on its security requirements and evidence of assurance, which are retrieved from an ontology built for vulnerability management. Our approach differentiates with the previous work in the following aspects: (1) It is a holistic approach emphasizing that the system assurance cannot be determined or explained by its component assurance alone. Instead, the software system as a whole determines its assurance level. (2) Our approach is based on widely accepted standards such as CVSS, CVE, CWE, CPE, and CAPEC. Our ontology integrated these standards seamlessly thus provides a solid foundation for security assessment. (3) Automated tools have been built to support our approach, delivering the environmental scores for software products.
24771249
Parallel Approximate Matrix Factorization for Kernel Methods
The kernel methods play a pivotal role in machine learning algorithms. Unfortunately, working with the kernel methods must deal with an n times n kernel matrix, which is memory intensive. In this paper, we present a parallel, approximate matrix factorization algorithm, which loads only essential data to individual processors to enable parallel processing of data. Our method reduces space requirement for the kernel matrix from O(n2) to O(np/m), where n is the amount of data, p the reduced matrix dimension (p << n), and m the number of processors.
15799228
Security policy reconciliation in distributed computing environments
A major hurdle in sharing resources between organizations is heterogeneity. Therefore, in order for two organizations to collaborate their policies have to be resolved. The process of resolving different policies is known as policy reconciliation, which in general is an intractable problem. This paper addresses policy reconciliation in the context of security. We present a formal framework and hierarchical representation for security policies. Our hierarchical representation exposes the structure of the policies and leads to an efficient reconciliation algorithm. We also demonstrate that agent preferences for security mechanisms can be readily incorporated into our framework. We have implemented our reconciliation algorithm in a library called the policy reconciliation engine or PRE. In order to test the implementation and measure the overhead of our reconciliation algorithm, we have integrated PRE into a distributed high-throughput system called Condor.