13044783
A New Time-domain Detection Approach with Blind Separation Based on Neural Network
In this paper a new technique is proposed for time-domain detection in energy detection. The proposed scheme is based on a independent-component analysis (ICA): blind separation of unknown source signals. This method not only improves the nicety of time-domain detection for narrow band signal and the sinusoidal signal but also reduces the power of the whole detection system.
7670857
A secure method for signature delegation to mobile agents
This paper presents a novel method that allows the delegation of signature power to one or more entities that jointly play the role of a proxy signer. This work is different from other related proxy signature schemes in that in addition to providing confidentiality protection to the proxy key, the method provides non-repudiation services to all the parties involved. In particular, it protects against repudiation of signature delegation by the original signer, repudiation of proxy signature generation by the proxy signer, and repudiation of receipt of the proxy signature by the signature recipient. This feature is attractive for signature delegation in agent-based paradigm in which proxy signers are mobile agents that are executed in remote untrustworthy hosts.
2987811
Achieving fine-grained access control in virtual organizations
In a virtual organization environment, where services and data are provided and shared among organizations from different administrative domains and protected with dissimilar security policies and measures, there is a need for a flexible authentication framework that supports the use of various authentication methods and tokens. The authentication strengths derived from the authentication methods and tokens should be incorporated into an access-control decision-making process, so that more sensitive resources are available only to users authenticated with stronger methods. This paper reports our ongoing efforts in designing and implementing such a framework to facilitate multi-level and multi-factor adaptive authentication and authentication strength linked fine-grained access control. The proof-of-concept prototype is designed and implemented in the Shibboleth and PERMIS infrastructures, which specifies protocols to federate authentication and authorization information and provides a policy-driven, role-based, access-control decision-making capability. Copyright (c) 2006 John Wiley & Sons, Ltd.
2593409
Plugging a scalable authentication framework into Shibboleth
In a VO (virtual organization) environment where services are provided and shared by dissimilar organizations from different administrative domains and are protected with dissimilar security policies and measures, there is a need for a flexible authentication framework that supports the use of various authentication tokens. The authentication strengths derived from these tokens should be fed into an access control decision making process. This paper reports our ongoing efforts in designing and implementing such a framework to facilitate multi-level and multi-factor authentication and authentication strength linked fine-grained access control in Shibboleth. The proof-of-concept prototype using a Java smart card is reported.
206522593
Revocation of privacy-enhanced public-key certificates
This paper presents a novel protocol for the revocation of privacy-enhanced/anonymous public-key certificates in relation to a protocol for anonymous public-key certificate issuing published previously. Not only can this certificate revocation protocol revoke an anonymous public-key certificate upon a request from its holder, but also automatically revoke any certificate issued directly or indirectly based on the certificate revoked, in an anonymous and accountable manner. In case the private key associated with an anonymous public-key certificate is suspected of having been compromised, the certificate holder can operate the protocol to easily revoke the compromised certificate together with its related ones so as to stop them being abused. The protocol is also assessed with regard to requirements such as accountability and anonymity.
5355145
Non-Repudiation and Fairness in Electronic Data Exchange
In this paper we discuss the two security issues: non-repudiation and fairness in association with e-commerce applications. In particular, these issues are addressed in the context of electronic data exchange, which is one of the most commonly seen e-commerce applications. In detail, this paper gives a survey of the approaches to non-repudiation and fair electronic data exchange protocols. We additionally discuss the current technologies that propose solutions to these issues, and the emerging standards in the area of business data formats and protocols for the exchange of such data. Finally, we discuss the architecture layer at which to implement the protocols for non-repudiation and fair data exchange.
206743120
An Efficient Cloud Computing-Based Architecture for Freight System Application in China Railway
Cloud computing is a new network computing paradigm of distributed application environment. It utilizes the computing resource and storage resource to dynamically provide on-demand service for users. The distribution and parallel characters of cloud computing can leverage the railway freight system. We implement a cloud computing-based architecture for freight system application, which explores the Tashi and Hadoop for virtual resource management and MapReduce-based search technology. We propose the semantic model and setup configuration parameter by experiment, and develop the prototype system for freight search and tracking.
41726157
Lossless compression of color mosaic images
We present a low complexity algorithm for lossless compression of color mosaic images generated by a Bayer CCD color filter array. This algorithm is based on an interesting use of the integer wavelet transform followed by a fast adaptive context-based Golomb-Rice coding. The lossless compression performance of the proposed algorithm is apparently the best reported in the literature so far for color mosaic images.
16171710
An Analysis Framework of Factors Influencing China Software and Information Service Offshore Outsourcing
Offshore outsourcing has become popular because of cost or skill advantage. China is considered as one of major global software and information service offshore destinations, but it cannot compete with India right now. Based on literature review, this paper first presents an overview of the industry. Then 38 service providers in China are investigated to give a firm-level analysis of the industry. A framework of factors influencing the industry is presented. Influence factors are classified into macro factors, middle factors, and micro factors, each of which is analyzed in detail. It is concluded that China software and information service offshore outsourcing industry is of great potential, but needs marketing and advertising.
8279850
Analysis and Simulation Protocols Based on Slotted ALOHA for Plastic Optical Fiber Network
In this paper a novel multipriority reservation protocols for plastic optical fiber network is proposed. In conventional OCDMA system only allows finite units to transmit and access simultaneously according to the number of channels which be restricted by BER. To resolve this problem, a novel protocol based on slotted ALOHA is proposed in this paper. By using the reservation scheme and a distributed arbitration algorithm, channel collision and destination conflict can be avoided. The protocol can efficiently support the transmission of multimedia messages that require the different time-delay. The network throughput and average delay has been investigated by numerical analysis and simulation experiments. It is showed that the multipriority reservation protocol in this POF network is valid and efficient.
9362943
Finding shortest paths in large network systems
This paper describes a disk-based algorithm for finding shortest paths in a large network system. It employs a strategy of processing the network piece by piece and is based on new algorithms for graph partitioning and for finding shortest paths that overcome the problem of existing approaches. To show that it is scalable to large network systems and is adaptable to different computing environments, seven states in Tiger/Line files are extracted as test cases and are experimented on machines with different configurations. The running time for finding the shortest path depends primarily on the power of the underlying systems. Moreover, to run the algorithm optimally, the memory requirement is not large, even for a very large network system such as the road system in several states in Tiger/Line file. To evaluate its performance, New Mexico state road system is used as the test case, and is compared with Dijkstra's algorithm. The average running time of the proposed algorithm is, in the worst case, about two and a half times slower than that of Dijkstra's algorithm; provided that in Dijkstra's algorithm, the whole graph can be fit into main memory and is already loaded in advance. If the I/O time for loading the whole graph is counted, the proposed algorithm is faster in essentially all cases.