This paper presents the optimum control interval for intra-cell fractional transmission power control (TPC) for a shared data channel employing frequency domain channel-dependent scheduling and adaptive modulation and coding (AMC) in the Evolved UTRA uplink using single-carrier (SC)-FDMA radio access. The simulation results show that the best attenuation factor in the fractional TPC is approximately 0.6 for achieving the maximum user throughput when the maximum target received signal power, P0 is -60 dBm. Then, we show that the optimum averaging interval for the desired signal level, which corresponds to a substantial control interval for the fractional TPC, is approximately 100-200 msec regardless of the maximum Doppler frequency up to 222 Hz and the distance at the shadowing correlation of 0.5. Throughout the simulation results, we verify that slow intra-cell fractional TPC associated with fast AMC is effective in achieving the maximum cell throughput and cell-edge user throughput.

This paper investigates the best cell-common reference signal (RS) structure and transmit diversity scheme for Multimedia Broadcast Multicast Service (MBMS) signals considering frequency diversity in a single-frequency network (SFN) in the OFDM based Evolved UTRA downlink. Link-level simulation results show that cyclic delay diversity (CDD) is the most promising transmit diversity scheme for the MBMS signals considering the RS overhead. It is also elucidated that the required average received signal energy per symbol-to-noise power spectrum density ratio (Es/N0) using CDD is reduced by approximately 0.5 dB even though the MBMS signal obtains a sufficient frequency diversity gain in SFN operation. Furthermore, we clarify the achievable data rate for the MBMS signal at the cell edge of the centered MBMS cell that satisfies the required block error rate (BLER) using two-antenna transmit CDD and diversity reception by system-level simulation. Then, the simulation results show that the offered data rates with the required BLER of less than 10-2 at 95% coverage are 0.211 (0.17), 0.243 (0.196), 1.168 (1.084), and 2.754 (2.754) bps/Hz with the number of cells providing MBMS, NMBMS = 1, 3, 21, and 57, respectively, employing transmit CDD with two antennas (single-antenna transmission) for ISD = 500 m.

This paper proposes block-wise resource block (RB)-level distributed OFDMA transmission with ND-block division in order to obtain the frequency diversity effect even for low-rate traffic (here ND indicates the number of virtual RBs within one physical RB) in Evolved UTRA downlink. More specifically, we propose a constraint rule such that distributed transmission is multiplexed into a different physical RB from that of localized transmission in order to achieve the same resource assignment and independent decoding between the distributed and localized transmissions. Based on the proposed rule, a virtual RB for distributed transmission is segmented into ND blocks with the size of 1/ND of the original virtual RB. Then, the ND virtual blocks with the size of 1/ND are mapped together into each ND physical RB in a distributed manner, resulting in a large frequency diversity effect. Numerical calculations show that the block-wise RB-level distributed transmission can reduce the number of control signaling bits required for resource assignment compared to the subcarrier-level distributed transmission scheme, which provides the best performance. Moreover, a system-level simulation shows that the loss in the cell throughput employing the block-wise RB-level distributed transmission compared to that using the subcarrier-level transmission is only within 3-4% when the channel load is 0.5 and 1.0, i.e., the maximum loss is 3-4% at approximately 90% in the cumulative distribution function (CDF).

Dimensionality reduction is one of the important preprocessing steps in practical pattern recognition. SEmi-supervised Local Fisher discriminant analysis (SELF)--which is a semi-supervised and local extension of Fisher discriminant analysis--was shown to work excellently in experiments. However, when data dimensionality is very high, a naive use of SELF is prohibitive due to high computational costs and large memory requirement. In this paper, we introduce computational tricks for making SELF applicable to large-scale problems.

Biologically-inspired approaches are one of the most promising approaches to realize highly-adaptive distributed systems. Biological systems inherently have self-* properties, such as self-stabilization, self-adaptation, self-configuration, self-optimization and self-healing. Thus, the application of biological systems into distributed systems has attracted a lot of attention recently. In this paper, we present one successful result of bio-inspired approach: we propose distributed algorithms for resource replication inspired by the single species population model. Resource replication is a crucial technique for improving system performance of distributed applications with shared resources. In systems using resource replication, generally, a larger number of replicas lead to shorter time to reach a replica of a requested resource but consume more storage of the hosts. Therefore, it is indispensable to adjust the number of replicas appropriately for the resource sharing application. This paper considers the problem for controlling the densities of replicas adaptively in dynamic networks and proposes two bio-inspired distributed algorithms for the problem. In the first algorithm, we try to control the replica density for a single resource. However, in a system where multiple resources coexist, the algorithm needs high network cost and the exact knowledge at each node about all resources in the network. In the second algorithm, the densities of all resources are controlled by the single algorithm without high network cost and the exact knowledge about all resources. This paper shows by simulations that these two algorithms realize self-adaptation of the replica density in dynamic networks.

Wireless ad hoc networks have fundamentally altered today's battlefield, with applications ranging from unmanned air vehicles to randomly deployed sensor networks. Security and vulnerabilities in wireless ad hoc networks have been considered at different layers, and many attack strategies have been proposed, including denial of service (DoS) through the intelligent jamming of the most critical packet types of flows in a network. This paper investigates the effectiveness of intelligent jamming in wireless ad hoc networks using the Dynamic Source Routing (DSR) and TCP protocols and introduces an intelligent classifier to facilitate the jamming of such networks. Assuming encrypted packet headers and contents, our classifier is based solely on the observable characteristics of size, inter-arrival timing, and direction and classifies packets with up to 99.4% accuracy in our experiments.

Linear cryptanalysis using sieve methods is a technique proposed by Takeda et al. in 1998 as an attack capable of breaking ciphers with smaller amounts of data than linear cryptanalysis (LC) by using data that satisfies linear sieve conditions. This paper shows that when considering the amount of data required for cryptanalysis in Takeda et al.'s proposed sieved linear cryptanalysis (S-LC), it is necessary to take into account the independence of keys relating to the linear mask (Linear key) and keys relating to the linear sieve mask (Sieve key) in rounds that are affected by these keys. If p is the probability that the linear approximate expression holds and p* is the probability after applying the linear sieve, then it has been shown that when the Linear keys are independent of the Sieve keys, then it is necessary to select the linear mask and linear sieve mask so that a larger value of p*-p is obtained. It is also shown that the amount of data needed for S-LC cannot be reduced below the amount of data needed for LC when the Linear key and Sieve key are not independent. In fixed sieve linear cryptanalysis, it is shown that the amount of data needed for cryptanalysis cannot be reduced regardless of the independence of the Linear key and Sieve key.

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.

A data analysis technology of atomic force microscopy for atomically flat silicon surfaces has been developed. Atomically flat silicon surfaces composed of atomic terraces and steps are obtained on (100) orientation 200 mm diameter wafers by annealing in pure argon ambience at 1,200 for 30 minutes. Atomically flat silicon surfaces are lead to improve the MOS inversion layer mobility and current drivability of MOSFETs and to decrease the fluctuations in electrical characteristics of MOSFETs. It is important to realize the technology that evaluates the flatness and the uniformity of atomically flat silicon surfaces. The off direction angle is calculated by using two straight edge lines selected from measurement data. And the off angle is calculated from average atomic terrace width under assumption that height difference between neighboring terraces is equal to the step height, 0.135 nm, of (100) silicon surface. The analyzing of flatness of each terrace can be realized by converting the measurement data using the off direction angle and the off angle. And, the average roughness of each terrace is about 0.017-0.023 nm. Therefore, the roughness and the uniformity of each terrace can be evaluated by this proposed technique.

In this letter, we propose a novel approach using wireless sensor networks (WSNs) to enhance the safety and efficiency of four-way stop-sign-controlled (FWSC) intersections. The proposed algorithm provides right of way (RoW) and crash avoidance information by means of an intelligent WSN system. The system is composed of magnetic sensors, embedded in the center of a lane, with relay nodes and a base station placed on the side of the road. The experimental results show that the vehicle detection accuracy is over 99% and the sensor node battery life expectancy is over 3 years for traffic of 5,800 vehicles per day. For the traffic application we consider, a strong effect is observed as the projected conflict rate was reduced by 72% compared to an FWSC intersection operated with only driver perception.

This paper proposes efficient single-carrier (SC) based multiplexing schemes for Layer 1 (L1)/Layer 2 (L2) control signals in SC-FDMA radio access using DFT-Spread OFDM in the Evolved UTRA uplink. L1/L2 control signals are necessary for key packet access techniques such as downlink scheduling, link adaptation, hybrid automatic repeat request (ARQ) with soft combining, and for uplink feedback control signals. We first propose a SC-based multiplexing scheme for L1/L2 control signals within a shared data channel for a set of user equipment (UE) that transmits both an uplink shared data channel and L1/L2 control signals within the same subframe. We also propose a multiplexing scheme for L1/L2 control signals without uplink data transmission that takes advantage of intra-subframe frequency hopping (FH) using multiple exclusively-assigned time-frequency resource blocks (RBs) to obtain a frequency diversity gain. Furthermore, we propose an orthogonal CDMA-based multiplexing scheme using cyclic shifts of a constant amplitude zero auto-correlation (CAZAC) sequence for L1/L2 control signals from different UEs within the same narrowband time-frequency RB. Computer simulation results show that the proposed SC-based multiplexing scheme for the L1/L2 control signals within the shared data channel achieves a higher user throughput than a multicarrier-based multiplexing scheme. The results also show that the proposed multiplexing scheme for the L1/L2 control signals that takes advantage of the intra-subframe FH for the UE without uplink data transmission achieves high quality reception through large frequency diversity gain. Furthermore, we show that the proposed cyclic-shift based orthogonal CDMA multiplexing is effective in the multiplexing of multiple L1/L2 control signals from different UEs within the same RB.

This paper proposes a new side channel attack to RSA cryptography. Our target is an implementation with a combination of countermeasures. These are an SPA countermeasure by m-ary method and a DPA countermeasure by randomizing exponent techniques. Here, randomizing exponent techniques shows two DPA countermeasures to randomize the secret exponent d. One is an exponent randomizing technique using d'i = d+ riφ(N) to calculate cd'i (mod N), and another is a technique using di,1 = d/ri and di,2 =(d (mod ri)) to calculate (cdi,1)ri cdi,2 (mod N). Using the combination of countermeasures, it was supposed that the implementation is secure against power attack. However, we firstly show the result to successfully attack the implementation of the combination of these countermeasures. We performed the experiment of this search on a PC, and complete d has been successfully revealed less than 10 hours for both attacks.

With the growth of the Internet, various types of services are rapidly expanding; such services include the World Wide Web (WWW), the File Transfer Protocol (FTP), and remote login. Consequently, managing authentication information, e.g., user ID/password pairs, keys, and certificates- is difficult for users, since the amount of required authentication information has been increased. To address this problem, researchers have developed a Single Sign-On (SSO) system that makes all the services available for a user via a one-time authentication: however, existing authentication systems cannot provide such SSO services for all kind of services on the Internet, even if the service provider deploys the SSO server. Further, existing systems also cannot provide the SSO service which does not make it conscious of a network domain to a user on secure network environment. Therefore, in this paper, we propose a new SSO system with a hardware token and a key management server to improve the safety, ubiquity, and adaptability of services. Further, we implement the proposed system and show its effectiveness through evaluation. Adding any functions for this system provides various conveniences to us. We also explore the ability to add functions to this system; for example, we add high trust connection functionality for a Web server and show its effectiveness.

Code division multiple access (CDMA) technique is used widely since it can flexibly support multi-rate multi-media services by changing the number of orthogonal spreading codes. In this paper, we present a new adaptive code assignment algorithm, which consists of three steps: reserved-space, improved-crowded-first-space, and multi-code combination to fully use the code space. Compared with the existing algorithms, the proposed algorithm can avoid the code blocking problem and lower its total blocking probability while keeping its computational complexity relatively low. Simulation results show that increasing the free space reduces the average total blocking probability while increasing the blocking probability of high rate users.

This paper presents experimental evaluations of the effect of time diversity obtained by hybrid automatic repeat request (HARQ) with soft combining in space and path diversity schemes on orthogonal frequency division multiplexing (OFDM)-based packet radio access in a downlink broadband multipath fading channel. The effect of HARQ is analyzed through laboratory experiments employing fading simulators and field experiments conducted in downtown Yokosuka near Tokyo. After confirming the validity of experimental results based on numerical analysis of the time diversity gain in HARQ, we show by the experimental results that, for a fixed modulation and channel coding scheme (MCS), time diversity obtained by HARQ is effective in reducing the required received signal-to-interference plus noise power ratio (SINR) according to an increase in the number of transmissions, K, up to 10, even when the diversity effects are obtained through two-branch antenna diversity reception and path diversity using a number of multipaths greater than 12 observed in a real fading channel. Meanwhile, in combined use with the adaptive modulation and channel coding (AMC) scheme associated with space and path diversity, we clarify that the gain obtained by time diversity is almost saturated at the maximum number of transmissions in HARQ, K ' = 4 in Chase combining and K ' = 2 in Incremental redundancy, since the improvement in the residual packet error rate (PER) obtained through time diversity becomes small owing to the low PER in the initial packet transmission arising from appropriately selecting the optimum MCS in AMC. However, the experimental results elucidate that the time diversity in HARQ with soft combining associated with antenna diversity reception is effective in improving the throughput even in a broadband multipath channel with sufficient path diversity.

To solve the problem of distributed multisensor fusion, the optimal linear methods can be used in Gaussian noise models. In practice, channel noise distributions are usually non-Gaussian, possibly heavy-tailed, making linear methods fail. By combining a classical tool of optimal linear fusion and a robust statistical method, the two-stage MAD robust fusion (MADRF) algorithm is proposed. It effectively performs both in symmetrically and asymmetrically contaminated Gaussian channel noise with contamination parameters varying over a wide range.

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.

Probabilistic model checking is an emerging verification technology for probabilistic analysis. Its use has been started not only in computer science but also in interdisciplinary fields. In this paper, we show that probabilistic model checking allows one to analyze the magnetic behaviors of the one-dimensional Ising model, which describes physical phenomena of magnets. The Ising model consists of elementary objects called spins and its dynamics is often represented as the Metropolis method. To analyze the Ising model with probabilistic model checking, we build Discrete Time Markov Chain (DTMC) models that represent the behavior of the Ising model. Two representative physical quantities, i.e., energy and magnetization, are focused on. To assess these quantities using model checking, we devise formulas in Probabilistic real time Computation Tree Logic (PCTL) that represent the quantities. To demonstrate the feasibility of the proposed approach, we show the results of an experiment using the PRISM model checker.

This paper compares the expressive power of five language-based access control models. We show that the expressive powers are incomparable between any pair of history-based access control, regular stack inspection and shallow history automata. Based on these results, we introduce an extension of HBAC, of which expressive power exceeds that of regular stack inspection.

Considering rapid increase of recent highly organized and sophisticated malwares, practical solutions for the countermeasures against malwares especially related to zero-day attacks should be effectively developed in an urgent manner. Several research activities have been already carried out focusing on statistic calculation of network events by means of global network sensors (so-called macroscopic approach) as well as on direct malware analysis such as code analysis (so-called microscopic approach). However, in the current research activities, it is not clear at all how to inter-correlate between network behaviors obtained from macroscopic approach and malware behaviors obtained from microscopic approach. In this paper, in one side, network behaviors observed from darknet are strictly analyzed to produce scan profiles, and in the other side, malware behaviors obtained from honeypots are correctly analyzed so as to produce a set of profiles containing malware characteristics. To this end, inter-relationship between above two types of profiles is practically discussed and studied so that frequently observed malwares behaviors can be finally identified in view of scan-malware chain.