We have studied the formation of Pd-nanodots on SiO2 from ultrathin Pd films being exposed to remote hydrogen plasma at room temperature, in which parameters such as the gas pressure and input power to generate H2 plasma and the Pd film thickness were selected to get some insights into surface migration of Pd atoms induced with atomic hydrogen irradiation and resultant agglomeration with cohesive action. The areal dot density was controlled in the range from 3.4 to 6.51011 cm - 2 while the dot size distribution was changed from 7 to 1.5 in average dot height with 40% variation in full-width at half maximum. We also fabricated MOS capacitors with a Pd-nanodots floating gate and confirmed the flat-band voltage shift in capacitance-voltage characteristic due to electron injection to and emission from the dots floating gate.

Fair allocation of bandwidth and maximization of channel utilization are two important issues when designing a contention-based wireless medium access control (MAC) protocol. However, fulfilling both design goals at the same time is very difficult. Considering the problem in the IEEE 802.11 wireless local area networks (WLANs), in this work we propose a method using a p-persistent enhanced DCF, called P-IEEE 802.11 DCF, to achieve weighted fairness and efficient channel utilization among multiple priority classes in a WLAN. Its key idea is that when the back-off timer of a node reaches zero, the transmission probability is properly controlled to reflect the relative weights among data traffic flows so as to maximize the aggregate throughput and to minimize the frame delay at the same time. In particular, we obtain the optimal transmission probability based on a theoretical analysis, and also provide an approximation to this probability. The derived optimal and approximation are all evaluated numerically and simulated with different scenarios. The results show that the proposed method can fulfill our design goals under different numbers of priority classes and different numbers of nodes.

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.

In this letter, we propose a new power allocation scheme for random unitary beamforming assuming a discrete transmission rate with a small amount of feedback information and low latency. Simulation results show that the proposed scheme can improve throughput compared to the conventional power allocation scheme.

This paper investigates the uplink throughput performance and the interference power to other cells using an Evolved UTRA (E-UTRA) laboratory and field experimental system. In E-UTRA uplink, the near-far problem is not an issue since the orthgonality among the users within the target cell is maintained. Therefore, the fractional transmission power control (TPC), in which the target level of TPC is adjusted according to the path loss level, can be adopted. Thus, it is expected the high cell throughput and the large coverage area by combining fractional TPC, adaptive modulation and channel coding (AMC), and variable resource block (RB) allocation. The indoor and field experimental results show that the peak throughput of approximately 45 Mbps is achieved by allocating a wider bandwidth and setting higher target level for the UE located near the cell site while keeping the adjacent cell interference level almost the constant. We also showed that the system capacity can be improved by 50% in simple cell model by applying the AMC and the fractional TPC.

The first part of this paper contains an introduction to Bell inequalities and Tsirelson's theorem for the non-specialist. The next part gives an explicit optimum construction for the "hard" part of Tsirelson's theorem. In the final part we describe how upper bounds on the maximal quantum violation of Bell inequalities can be obtained by an extension of Tsirelson's theorem, and survey very recent results on how exact bounds may be obtained by solving an infinite series of semidefinite programs.

The holding voltage of high-voltage devices under the snapback breakdown condition has been known to be much smaller than the power supply voltage. Such characteristics cause high-voltage ICs to be susceptible to the transient latch-up failure in the practical system applications, especially when these devices are used as the ESD power clamp circuit. A new latchup-free design of the ESD power clamp circuit with stacked-bipolar devices is proposed and successfully verified in a 0.35 µm BCD (Bipolar-CMOS-DMOS) process to achieve the desired ESD level. The total holding voltage of the stacked-bipolar devices in the snapback breakdown condition can be larger than the power supply voltage.

Quantum random access coding (QRAC) is one of the basic tools in quantum computing. It uses a quantum state for encoding the sender's bit string so that the receiver can recover any single bit of the bit string with high probability. This article surveys recent developments of QRAC, with some concrete examples of QRAC using one quantum bit, and its applications, focusing on communication complexity and locally decodable codes.

In order to improve the synchronization performance of the OFDM-based FM broadcasting system, this letter addresses the problem of delay selection when the system uses a cyclic delay diversity (CDD) scheme. By proper selection of the amount of cyclic delay, an improved fine carrier frequency offset estimator is derived. By computer simulation, the proposed estimator is shown to benefit from properly chosen delay parameter and perform robustly.

An interference cancellation (ICAN) scheme for mobile communication radio repeaters is presented. When a radio repeater has a gain that is larger than the isolation between its transmit and receive antennas, it oscillates due to feedback interference signals. To prevent feedback oscillation of a radio repeater, we first formulate a feedback oscillation model of the radio repeater and then derive an ICAN model from that model. From the derived ICAN model, we show that the stability and the signal quality of the repeater depend on the repeater's gain and delay, the propagation delay on feedback paths, feedback channel characteristics, and the capability of the feedback channel estimation algorithm. It is also shown that the stability condition of the repeater does not guarantee the quality of the repeater's output signal. To guarantee repeater's stability and signal quality, an ICAN scheme based on an iterative algorithm is subsequently proposed. The simulation results confirm the relationship between the stability and signal quality of the repeater and the impact of the aforementioned factors. Using the proposed ICAN scheme, a mean error vector magnitude (quality indicator) of about 6.3% for the repeater's output signal was achieved.

Single-carrier (SC) multiple access is a promising uplink multiple access technique because of its low peak-to-average power ratio (PAPR) property and high frequency diversity gain that is achievable through simple one-tap frequency-domain equalization (FDE) in a strong frequency-selective channel. The multiple access capability can be obtained by combining either frequency division multiple access (FDMA) or code division multiple access (CDMA) with SC transmission. In this article, we review the recent research on the SC multiple access techniques with one-tap FDE. After introducing the principle of joint FDE/antenna diversity combining, we review various SC multiple access techniques with one-tap FDE, i.e., SC-FDMA, SC-CDMA, block spread CDMA, and delay-time/CDMA.

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.

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.

In the OTS/CafeOBJ method, software specifications are described in CafeOBJ executable formal specification language, and verification is done by giving scripts to the CafeOBJ system. The script is called a proof score. In this study, we propose a test case generator from an OTS/CafeOBJ specification together with a proof score. Our test case generator gives test cases by analyzing the proof score. The test cases are used to test whether an implementation satisfies the specification and the property verified by the proof score. Since a proof score involves important information for verifying a property, the generated test cases are also expected to be suitable to test the property.

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.

Routing algorithms with low overhead, stable link and independence of the total number of nodes in the network are essential for the design and operation of the large-scale wireless mobile ad hoc networks (MANET). In this paper, we develop and analyze the Cluster Based Location-Aided Routing Protocol for MANET (C-LAR), a scalable and effective routing algorithm for MANET. C-LAR runs on top of an adaptive cluster cover of the MANET, which can be created and maintained using, for instance, the weight-based distributed algorithm. This algorithm takes into consideration the node degree, mobility, relative distance, battery power and link stability of mobile nodes. The hierarchical structure stabilizes the end-to-end communication paths and improves the networks' scalability such that the routing overhead does not become tremendous in large scale MANET. The clusterheads form a connected virtual backbone in the network, determine the network's topology and stability, and provide an efficient approach to minimizing the flooding traffic during route discovery and speeding up this process as well. Furthermore, it is fascinating and important to investigate how to control the total number of nodes participating in a routing establishment process so as to improve the network layer performance of MANET. C-LAR is to use geographical location information provided by Global Position System to assist routing. The location information of destination node is used to predict a smaller rectangle, isosceles triangle, or circle request zone, which is selected according to the relative location of the source and the destination, that covers the estimated region in which the destination may be located. Thus, instead of searching the route in the entire network blindly, C-LAR confines the route searching space into a much smaller estimated range. Simulation results have shown that C-LAR outperforms other protocols significantly in route set up time, routing overhead, mean delay and packet collision, and simultaneously maintains low average end-to-end delay, high success delivery ratio, low control overhead, as well as low route discovery frequency.

In this paper, we propose a novel scheme of cooperative relaying network based on data exchange between relays before forwarding their received data to destination. This inter-relay data exchange step is done during an additional middle-slot in order to enhance the transmit signals from relays to the destination under low transmit power condition. To reduce the propagation errors between relays as well as the required transmit power during this data exchange, only the relay possessing the highest SNR is engaged into exchanging data by forwarding its received signal to the other relays. As for the remaining non-selected relays, i.e. with low SNR, the transmitted signal is estimated by using both signals received separately at different time slots (i.e., 1st and 2nd slot) from source and the 'best' selected relay, respectively, emulating virtual antenna array where appropriate weights for the antenna array are developed. In addition, we investigate distributed transmit beamforming and maximum ratio combining at the relays and the destination, respectively, to combine coherently the received signals. At the relay optimal location and for low SNR condition, the proposed method has significant better outage behavior and average throughput than conventional methods using one or two time slots for transmission.

The emergence of Web 2.0 technologies such as Ajax and Mashup has revealed the weakness of the same-origin policy [1], the current de facto standard for the Web browser security model. We propose a new browser security model to allow fine-grained access control in the client-side Web applications for secure mashup and user-generated contents. We propose a browser security model that is based on information-flow-based access control (IBAC) to overcome the dynamic nature of the client-side Web applications and to accurately determine the privilege of scripts in the event-driven programming model.

Recently, various types of 3-D nonvolatile memory (NVM) devices have been researched to improve the integration density [1]-[3]. The NVM device of pillar structure can be considered as one of the candidates [4],[5]. When this is applied to a NAND flash memory array, bottom end of the device channel is connected to the bulk silicon. In this case, the current in vertical direction varies depending on the thickness of silicon channel. When the channel is thick, the difference of saturation current levels between on/off states of individual device is more obvious. On the other hand, when the channel is thin, the on/off current increases simultaneously whereas the saturation currents do not differ very much. The reason is that the channel potential barrier seen by drain electrons is lowered by read voltage on the opposite sidewall control gate. This phenomenon that can occur in 3-D structure devices due to proximity can be called gate-induced barrier lowering (GIBL). In this work, the dependence of GIBL on silicon channel thickness is investigated, which will be the criteria in the implementation of reliable ultra-small NVM devices.

In recent years huge potential benefits from novel applications in mobile ad hoc networks (MANET) have been discussed extensively. However, without robust security mechanisms and systems to provide safety shell through the MANET infrastructure, MANET applications can be vulnerable and hammered by malicious attackers easily. In order to detect misbehaved message routing and identify malicious attackers in MANET, schemes based on reputation concept have shown their advantages in this area in terms of good scalability and simple threshold-based detection strategy. We observed that previous reputation schemes generally use predefined thresholds which do not take into account the effect of behavior dynamics between nodes in a period of time. In this paper, we propose a Threshold-Adaptive Reputation System (TARS) to overcome the shortcomings of static threshold strategy and improve the overall MANET performance under misbehaved routing attack. A fuzzy-based inference engine is introduced to evaluate the trustiness of a node's one-hop neighbors. Malicious nodes whose trust values are lower than the adaptive threshold, will be detected and filtered out by their honest neighbors during trustiness evaluation process. The results of network simulation show that the TARS outperforms other compared schemes under security attacks in most cases and at the same time reduces the decrease of total packet delivery ratio by 67% in comparison with MANET without reputation system.