1660866
A General Fuzzified CMAC Controller with Eligibility
This paper presents an online neural network controller. Cerebellar Model Articulation Controller (CMAC) is suitable to online control due to its fast learning speed. By integrating the CMAC address scheme with fuzzy logic concept, a general fuzzified CMAC (GFAC) is proposed. Then by incorporating the concept of eligibility into the GFAC, a GFAC controller with eligibility is presented, named FACE. A learning algorithm for the FACE is derived to tune the model parameters. To achieve online control, an efficient implementation of the proposed FACE method is presented. As an example, the proposed FACE is applied to a ship steering control system. The simulation results show that the ship course can be properly controlled under the disturbances of wave, wind and current.
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.
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.
19035631
A New Secure Binding Management Protocol for Mobile IPv6 Networks
This paper proposes a novel secure binding management protocol for mobile IPv6 networks for use in the implementation of routing optimization. The idea uses the public key of the home network of a mobile node to cryptographically generate the mobile node's home address and the associated private key to sign the mobile node's authentication requests. In addition, the proposed protocol performs reachability tests for both the home address and the care-of address. The proposed protocol offloads all expensive cryptographic operations from a mobile node to its home agent. The security of the protocol is informally analysed and an initially evaluation of its performance given.
10813806
An efficient protocol for anonymous and fair document exchange
Fairness in document exchange has been well studied, while anonymity in the exchange, which protects the privacy of personal information such as identities and locations, has been either ignored or handled with partial or inappropriate considerations. In this paper we propose a new protocol for anonymous and fair document exchange between two parties with the assistance of an off-line trusted third party. The new protocol treats both fairness and anonymity as essential properties, employs an efficient method for off-line key recovery, and places weak requirements on the security of the third party.
13573453
A general approach to secure components composition
At present, security properties for components composition have two major shortcomings. First, they do not properly consider connectivity between components. This leads to the imposition of over strong security requirements on the components. Consequently their functionality and performance may be sacrificed unnecessarily. Secondly, these properties usually demand components and their system to comply with the same or compatible security requirements. This greatly restricts their applicability. To rectify these problems, we aim to present a composable security property that permits different components to meet different security requirements, and appropriately enforces the requirements on the components with regard to their connectivity.
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.
42648138
Fuzzy Comprehensive Evaluation for Electromagnetic Loop in China Ultra-high Voltage Grid
In initial period of ultra-high voltage grid, 1000kV/500kV loops, perhaps even 1000kV/500kV/ 220kV loops, will turn up. The hazards caused by electromagnetic loop are discussed from two sides involving power transfer and short-circuit current level. Multi-level electromagnetic loop of North and Central China power grid in the planning year 2010 are analyzed. A method combining analytic hierarchy process with fuzzy logic theory is employed to comprehensively evaluate opening schemes for electromagnetic loop. Evaluation results indicate that multi-level electromagnetic loops should be avoided by opening extra-high/high voltage loops promptly. Furthermore, it’s also necessary to open ultra-high/extra-high voltage loops reasonably.
18987585
Efficient elliptic curve scalar multiplication algorithms resistant to power analysis
This paper presents four algorithms for securing elliptic curve scalar multiplication against power analysis. The highest-weight binary form (HBF) of scalars and randomization are applied to resist power analysis. By using a special method to recode the scalars, the proposed algorithms do not suffer from simple power analysis (SPA). With the randomization of the secret scalar or base point, three of the four algorithms are secure against differential power analysis (DPA), refined power analysis (RPA) and zero-value point attacks (ZPA). The countermeasures are also immune to the doubling attack. Fast Shamir's method is used in order to improve the efficiency of parallel scalar multiplication. Compared with previous countermeasures, the new countermeasures achieve higher security and do not impact overall performance.
32437026
Fuzzy Comprehensive Evaluation for Power Network Operating Schemes
Based on the analytic hierarchy process, a fuzzy comprehensive evaluation method is proposed for power network operating schemes. Performance indices and corresponding membership functions are presented to denote their contributions on overall objective. The analytic hierarchy process is used to analyze influencing factors, to establish a hierarchical model and to rank the influencing factors in order of importance. After detailed analyses and calculations for each operating scheme, quantitative evaluation results that considering various factors comprehensively are obtained by a two-level fuzzy comprehensive evaluation. A decision support system using the proposed method is developed. Simulation results of a practical power system show its validity and effectiveness.
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.