This paper presents a new signaling architecture for radio-access control in wireless communications systems. Called THREP (for THREe-phase link set-up Process), it enables systems with low-cost configurations to provide tetherless access and wide-ranging mobility by using autonomous radio-link controls for fast cell searching and distributed call management. A signaling architecture generally consists of a radio-access part and a service-entity-access part. In THREP, the latter part is divided into two steps: preparing a communication channel, and sustaining it. Access control in THREP is thus composed of three separated parts, or protocol phases. The specifications of each phase are determined independently according to system requirements. In the proposed architecture, the first phase uses autonomous radio-link control because we want to construct low-power indoor wireless communications systems. Evaluation of channel usage efficiency and hand-over loss probability in the personal handy-phone system (PHS) shows that THREP makes the radio-access sub-system operations in a practical application model highly efficient, and the results of a field experiment show that THREP provides sufficient protection against severe fast CNR degradation in practical indoor propagation environments.

Recently, SCTP is attracting attention to support mobility in the Internet because it does not require additional equipment such as the Home Agent of Mobile IP. This paper focuses on an SCTP fast handover mechanism using a single interface because it is assumed that small mobile devices have a single interface per communication medium such as IEEE802.11b due to hardware limitations. The proposed mechanism called SCTPmx employs a cross layer control information exchange system called LIES to predict handover. LIES was originally designed to achieve network layer fast handover and then it was extended by adding the network layer primitives for efficient interaction among the link layer, the network layer, and the transport layer. Prior to handover, SCTPmx can generate a new address that will be used after handover and can execute duplicate address detection of IPv6. SCTPmx can suppress the delay caused by channel scanning at the link layer by employing selective background scanning mechanism which allows to continue data communication during channel scanning. In addition, SCTPmx can notify the correspondent node of the new address before handover. SCTPmx was implemented on FreeBSD. SCTPmx achieved better than 25 times lower handover latency (100 msec) and 2 times higher throughput than previous proposals.

This investigation proposes two methods for embedding backdoors in the RSA modulus N=pq rather than in the public exponent e. This strategy not only permits manufacturers to embed backdoors in an RSA system, but also allows users to choose any desired public exponent, such as e=216+1, to ensure efficient encryption. This work utilizes lattice attack and exhaustive attack to embed backdoors in two proposed methods, called RSASBLT and RSASBES, respectively. Both approaches involve straightforward steps, making their running time roughly the same as that of normal RSA key-generation time, implying that no one can detect the backdoor by observing time imparity.

Using the transient current switch circuit in parallel with the energizing switching contacts for timely control of breaking operation, the increase of contact voltage is suppressed at the last stage of the breaking of electric contacts. Breaking contact voltage Vc and current Ic of electromagnetic relays with Ag contacting electrodes were measured with 12.5-50 V and 0.1-20 A for two hinge springs (Spring constants; 2 N/mm and 0.2 N/mm). The current-decreasing process was clearly measured at the melting voltage Um. After Vc=Um, the breaking time of contact current did not depend on mechanical motion controlled by the two hinge springs and energizing power-supply voltage, but depended on the contact current. The residue of melt electrode was observed optically as a white fusion spot, with radius depending on the energizing current.

Break arcs are generated between silver electrical contacts in a DC 42 V-10 A resistive circuit. Break arcs are driven by the radial magnetic field. The magnetic field is formed between the electrical contacts with a permanent magnet embedded in the cathode. The arc motion is taken with a high-speed camera and contact surfaces are observed after break operations. Experimental results with the magnet are compared with those without the magnet to confirm the effect of the embedded magnet. For break operations with the magnet following results are shown. Break arcs are rotationally driven by the radial magnetic field in the direction according to Lorentz force. The shortening effect of the arc duration is confirmed. The traces of the arc spots on the contact surfaces are ring-shaped, wide and uniform. This result shows the prevention effect of local erosion of electrical contacts. The rotational frequency of the break arc depends on the Lorentz force with the radial magnetic field.

Using the transient current switch circuit in parallel with the energizing contacts, the slow decay of the contact current due to thermal fusion of metal was observed just after the contact voltage exceeded the melting contact voltage Um. At that time, the contact voltage was higher than the boiling contact voltage Ub. These results contradict Holm's θ theory. A new melting model of breaking mechanical contact is proposed. The area surrounding a cluster of contacting a-spots melts, the melt metal diffuses, and the contact spot thermally shrinks. Including the metal phase transition from solid to liquid, the increase of contact resistance is introduced to the electric circuit analysis. The numerical analysis agrees qualitatively with measured V-I characteristics.

The liquid metal current limiter (LMCL) is a possible alternative to limit the short current of power system due to its special merits. This paper is devoted to the investigation of the arc behavior in liquid metal GaInSn for current limiting application. Firstly, the arc evolution including arc initiation, arc expansion and arc extinguish is observed through an experimental device. The resistance of arc and the self healing property of liquid metal are described. Subsequently, the arc erosion on electrodes is presented with its causes analyzed. Finally, the arc characteristics with the influence of rise rate of prospective current and channel diameter are discussed in details.

The self-timed pipeline (STP) is one of the most promising VLSI/SoC architectures. It achieves efficient utilization of tens of billions of transistors, consumes ultra low power, and is easy-to-design because of its signal integrity and low electro-magnetic interference. These basic features of the STP have been proven by the development of self-timed data-driven multimedia processors, DDMP's. This paper proposes a novel scheme of interacting self-timed (clockless) pipelines by which the various distributed and interconnected pipelines can achieve highly functional stream processing in future giga-transistor chips. The paper also proposes a set of elementary coupling control modules that facilitate various combinations of flow-thru processing between pipelines, and then discusses the practicality of the proposed scheme through the LSI design of application modules such as a priority-based queue, a mutual interconnection network, and a pipelined sorter.

In 2006, Chatterjee and Sarkar proposed a hierarchical identity-based encryption (HIBE) scheme which can support an unbounded number of identity levels. This property is particularly useful in providing forward secrecy by embedding time components within hierarchical identities. In this paper we show that their scheme does not provide the claimed property. Our analysis shows that if the number of identity levels becomes larger than the value of a fixed public parameter, an unintended receiver can reconstruct a new valid ciphertext and decrypt the ciphertext using his or her own private key. The analysis is similarly applied to a multi-receiver identity-based encryption scheme presented as an application of Chatterjee and Sarkar's HIBE scheme.

A critical problem after a natural/manmade disaster is to provide immediate post-disaster communication links between the disaster victims and some overlay networks. This paper proposes a novel scheme that uses the surviving Mobile handSets (MS) as sensing nodes to form an auto-configured Hierarchical Cognitive Radio Network (H-CRN). The implementation of this H-CRN is explained through detailed problem scenario statement and step-by-step implementation of automatic identification of emergency situation by the MS nodes. An overview of the cross-layer framework used by the MS nodes is also presented. This novel scheme is tested through some hypothesis along with probability calculations for successful identification of emergency situation, formation of ad hoc group and Emergency Beacon Message (EBM) transmission.

Recently, Au et al. proposed a practical hierarchical identity-based encryption (HIBE) scheme and a hierarchical identity-based signature (HIBS) scheme. In this paper, we point out that there exists security weakness both for their HIBE and HIBS scheme. Furthermore, based on q-ABDHE, we present a new HIBE scheme which is proved secure in the standard model and it is also efficient. Compared with all previous HIBE schemes, ciphertext size as well as decryption cost are independent of the hierarchy depth. Ciphertexts in our HIBE scheme are always just four group elements and decryption requires only two bilinear map computations.

Quantum computations have so far proved to be more powerful than classical computations, but quantum computers still have not been put into practical use due to several technical issues. One of the most serious problems for realizing quantum computers is decoherence that occurs inevitably since our apparatus are surrounded with environment and open systems. In this paper, we give some surveys on a variety of effects of decoherence in quantum algorithms such as Grover's database search and quantum walks, and we show how quantum algorithms work under decoherence, how sensitive they are against decoherence, and how to implement a robust quantum circuit.

Searchable encryption has many applications including e-mail systems and storage systems. The usefulness of searchable encryption derives from its support of keyword-testability. Keyword-testability means that a receiver of a ciphertext can test whether the ciphertext contains a specific keyword. Recently, Bellare et al. suggested an efficiently-searchable encryption scheme with keyword-recoverability as well as keyword-testability. Keyword-recoverability means that a receiver can extract the keyword from a ciphertext. All of the previous searchable encryption schemes have provided only keyword-testability. However, as explained by Bellare et al., no efficiently-searchable encryption scheme can provide even security against chosen keyword attacks. That is, Bellare et al.'s scheme assumes that no useful partial information about the keyword is known to the adversaries. In this paper, we suggest an SEKR (searchable encryption with keyword-recoverability) scheme which is secure even if the adversaries have any useful partial information about the keyword. Our scheme provides security against chosen ciphertext attacks which are stronger attacks than chosen keyword attacks. We also suggest an SEKR scheme for multi-keywords.

The 3GPP Long Term Evolution Advanced (LTE-A) system, as compared to the LTE system, is anticipated to include several new features and enhancements, such as the usage of channel bandwidth beyond 20 MHz (up 100 MHz), higher order multiple input multiple output (MIMO) for both downlink and uplink transmissions, larger capacity especially for cell edge user equipment, and voice over IP (VoIP) users, and wider coverage and etc. This paper presents some key enabling technologies including flexible uplink access schemes, advanced uplink MIMO receiver designs, cell search, adaptive hybrid ARQ, and multi-resolution MIMO precoding, for the LTE-A system.

One of the most convenient ways to query XML data is a keyword search because it does not require any knowledge of XML structure or learning a new user interface. However, the keyword search is ambiguous. The users may use different terms to search for the same information. Furthermore, it is difficult for a system to decide which node is likely to be chosen as a return node and how much information should be included in the result. To address these challenges, we propose an XML semantic search based on keywords called XSemantic. On the one hand, we give three definitions to complete in terms of semantics. Firstly, the semantic term expansion, our system is robust from the ambiguous keywords by using the domain ontology. Secondly, to return semantic meaningful answers, we automatically infer the return information from the user queries and take advantage of the shortest path to return meaningful connections between keywords. Thirdly, we present the semantic ranking that reflects the degree of similarity as well as the semantic relationship so that the search results with the higher relevance are presented to the users first. On the other hand, in the LCA and the proximity search approaches, we investigated the problem of information included in the search results. Therefore, we introduce the notion of the Lowest Common Element Ancestor (LCEA) and define our simple rule without any requirement on the schema information such as the DTD or XML Schema. The first experiment indicated that XSemantic not only properly infers the return information but also generates compact meaningful results. Additionally, the benefits of our proposed semantics are demonstrated by the second experiment.

This paper presents a comparison of hierarchical and non-hierarchical synchronization channel (SCH) structures in terms of the initial cell search time and neighboring cell search time in order to establish the optimum SCH structure in the Evolved UTRA downlink. Computer simulation results show that in a 19-cell configuration, the cell search time at 90% in the cumulative distribution function (CDF) using the hierarchical SCH structure is less than half that using the non-hierarchical SCH structure in a neighboring cell search under low signal-to-interference plus noise power ratio (SINR) conditions, although both structures achieve almost the same cell search time in the initial cell search. This is due to the cross-correlation based SCH symbol timing detection in the hierarchical SCH structure, which is affected less by noise than the auto-correlation based detection in the non-hierarchical SCH structure. Thus, we conclude that the hierarchical SCH structure is superior to the non-hierarchical SCH structure based on the cell search time performance especially in the neighboring cell search.

Testing and diagnosis techniques play a key role in the advance of semiconductor memory technology. The challenge of failure detection has created intensive investigation on efficient testing and diagnosis algorithm for better fault coverage and diagnostic resolution. At present, March test algorithm is used to detect and diagnose all faults related to Random Access Memories. However, the test and diagnosis process are mainly done manually. Due to this, a systematic approach for developing and evaluating memory test algorithm is required. This work is focused on incorporating the March based test algorithm using a software simulator tool for implementing a fast and systematic memory testing algorithm. The simulator allows a user through a GUI to select a March based test algorithm depending on the desired fault coverage and diagnostic resolution. Experimental results show that using the simulator for testing is more efficient than that of the traditional testing algorithm. This new simulator makes it possible for a detailed list of stuck-at faults, transition faults and coupling faults covered by each algorithm and its percentage to be displayed after a set of test algorithms has been chosen. The percentage of diagnostic resolution is also displayed. This proves that the simulator reduces the trade-off between test time, fault coverage and diagnostic resolution. Moreover, the chosen algorithm can be applied to incorporate with memory built-in self-test and diagnosis, to have a better fault coverage and diagnostic resolution. Universities and industry involved in memory Built-in-Self test, Built-in-Self repair and Built-in-Self diagnose will benefit by saving a few years on researching an efficient algorithm to be implemented in their designs.

Low energy and high performance embedded processor is crucial in the future nomadic embedded systems design. Improvement of memory accesses, especially improvement of spatial and temporal locality is well known technique to reduce energy and increase performance. However, after transformations that improve locality, address calculation often becomes a bottleneck. In this paper, we propose novel AGU (Address Generation Unit) exploration and mapping technique based on a reconfigurable AGU model. Experimental results show that the proposed techniques help exploring AGU architectures effectively and designers can get trade-offs of real life applications for about 10 hours.

A scheduling algorithm aims to minimize the overall execution time of the program by properly allocating and arranging the execution order of the tasks on the core processors such that the precedence constraints among the tasks are preserved. In this paper, we present a new scheduling algorithm by using geometry analysis of the Task Precedence Graph (TPG) based on A* search technique and uses a computationally efficient cost function for guiding the search with reduced complexity and pruning techniques to produce an optimal solution for the allocation/scheduling problem of a parallel application to parallel and multiprocessor architecture. The main goal of this work is to significantly reduce the search space and achieve the optimality or near optimal solution. We implemented the algorithm on general task graph problems that are processed on most of related search work and obtain the optimal scheduling with a small number of states. The proposed algorithm reduced the exhaustive search by at least 50% of search space. The viability and potential of the proposed algorithm is demonstrated by an illustrative example.

The goal of personal-style handwriting synthesis is to produce texts in the same style as an individual writer by analyzing the writer's samples of handwriting. The difficulty of handwriting synthesis is that the output should have the characteristics of the person's handwriting as well as looking natural, based on a limited number of available examples. We develop a synthesis algorithm which produces handwriting that exhibits naturalness based on the probabilistic character model.