Synthesis problems on multiplayer non-zero-sum games (MG) with multiple environment players that behave rationally are the problems to find a good strategy of the system and have been extensively studied. This paper concerns the synthesis problems on stochastic MG (SMG), where a special controller other than players, called nature, which chooses a move in its turn randomly, may exist. Two types of synthesis problems on SMG exist: cooperative rational synthesis problem (CRSP) and non-cooperative rational synthesis problem (NCRSP). The rationality of environment players is modeled by Nash equilibria, and CRSP is the problem to decide whether there exists a Nash equilibrium that gives the system a payoff not less than a given threshold. Ummels et al. studied the complexity of CRSP for various classes of objectives and strategies of players. CRSP fits the situation where the system can make a suggestion of a strategy profile (a tuple of strategies of all players) to the environment players. However, in real applications, the system may rarely have an opportunity to make suggestions to the environment, and thus CRSP is optimistic. NCRSP is the problem to decide whether there exists a strategy σ0 of the system satisfying that for every strategy profile of the environment players that forms a 0-fixed Nash equilibrium (a Nash equilibrium where the system's strategy is fixed to σ0), the system obtains a payoff not less than a given threshold. In this paper, we investigate the complexity of NCRSP for positional (i.e. pure memoryless) strategies. We consider ω-regular objectives as the model of players' objectives, and show the complexity results of the problem for several subclasses of ω-regular objectives. In particular, the problem for terminal reachability (TR) objectives is shown to be Σp2-complete.

Variable Pipeline Cool Mega Array (VPCMA) is a low power Coarse Grained Reconfigurable Architecture (CGRA) based on the concept of CMA (Cool Mega Array). It provides a pipeline structure in the PE array that can be configured so as to fit target algorithms and required performance. Also, VPCMA uses the Silicon On Thin Buried oxide (SOTB) technology, a type of Fully Depleted Silicon On Insulator (FDSOI), so it is possible to control its body bias voltage to provide a balance between performance and leakage power. In this paper, we study the optimization of the VPCMA body bias while considering simultaneously its variable pipeline structure. Through evaluations, we can observe that it is possible to achieve an average reduction of energy consumption, for the studied applications, of 17.75% and 10.49% when compared to respectively the zero bias (without body bias control) and the uniform (control of the whole PE array) cases, while respecting performance constraints. Besides, it is observed that, with appropriate body bias control, it is possible to extend the possible performance, hence enabling broader trade-off analyzes between consumption and performance. Considering the dynamic power as well as the static power, more appropriate pipeline structure and body bias voltage can be obtained. In addition, when the control of VDD is integrated, higher performance can be achieved with a steady increase of the power. These promising results show that applying an adequate optimization technique for the body bias control while simultaneously considering pipeline structures can not only enable further power reduction than previous methods, but also allow more trade-off analysis possibilities.

Body biasing can be used to control the leakage power and performance by changing the threshold voltage of transistors after fabrication. Especially, a new process called Silicon-On-Thin Box (SOTB) CMOS can control their balance widely. When it is applied to a Coarse Grained Reconfigurable Array (CGRA), the leakage power can be much reduced by precise bias control with small domain size including a small number of PEs. On the other hand, the area overhead for separating power domain and delivering a lot of wires for body bias voltage supply increases. This paper explores the grain of domain size of an energy efficient CGRA called CMA (Cool Mega Array). By using Genetic Algorithm based body bias assignment method, the leakage reduction of various grain size was evaluated. As a result, a domain with 2x1 PEs achieved about 40% power reduction with a 6% area overhead. It has appeared that a combination of three body bias voltages; zero bias, weak reverse bias and strong reverse bias can achieve the optimal leakage reduction and area overhead balance in most cases.

The relationship between different brain areas is characterized by functional networks through correlations of time series obtained from neuroimaging experiments. Due to its high spatial resolution, functional MRI data is commonly used for generating functional networks of the entire brain. These networks are comprised of the measurement points/channels as nodes and links are established if there is a correlation in the measured time series of these nodes. However, since the evaluation of correlation becomes more accurate with the length of the underlying time series, we construct in this paper functional networks from MEG data, which has a much higher time resolution than fMRI. We study in particular how the network topologies change in an experiment on ambiguity of words, where the subject first receives a priming word before being presented with an ambiguous or unambiguous target word.

Dynamic spectrum allocation (DSA) based on secondary spectrum market is considered a promising technology to improve spectrum utilization efficiency and to relieve the wireless spectrum shortage problem. We propose a dynamic spectrum allocation algorithm named market equilibrium and game (MEG), and construct a complete secondary spectrum market. The market based on the MEG algorithm consists of two submarkets: multiple primary services providers (PSPs) and a dynamic spectrum allocation server (DSAS) form the high submarket, while the low submarket is composed of the DSAS and a number of secondary users. In the low submarket, the MEG algorithm provides a game type selection strategy. By this strategy, the DSAS can win more payoffs with lower unit spectrum price, which encourages secondary users to use more spectrum. A secondary user can also choose its preferable game type between dynamic game and Nash bargaining flexibly. On the other hand, a bargaining procedure in the high submarket is designed in the MEG algorithm to ensure that market equilibrium is quickly reached. A performance analysis shows that the strategy of game type selection is fair and feasible for both the DSAS and the secondary users. Moreover, the bargaining procedure is better than the existing algorithm which adjusts price step by step in the high submarket. Simulation results also demonstrate that the market fluctuation in the low submarket is passed to the high submarket by way of the DSAS. The MEG algorithm can effectively satisfy the highly-fluctuating demands from the secondary users. In addition, the MEG algorithm can improve the payoffs of all players and increase spectrum utilization efficiency.

Pairing-based cryptography provides us many novel cryptographic applications such as ID-based cryptosystems and efficient broadcast encryptions. The security problems in ubiquitous sensor networks have been discussed in many papers, and pairing-based cryptography is a crucial technique to solve them. Due to the limited resources in the current sensor node, it is challenged to optimize the implementation of pairings on sensor nodes. In this paper we present an efficient implementation of pairing over MICAz, which is widely used as a sensor node for ubiquitous sensor network. We improved the speed of ηT pairing by using a new efficient multiplication specialized for ATmega128L, called the block comb method and several optimization techniques to save the number of data load/store operations. The timing of ηT pairing over GF(2239) achieves about 1.93 sec, which is the fastest implementation of pairing over MICAz to the best of our knowledge. From our dramatic improvement, we now have much high possibility to make pairing-based cryptography for ubiquitous sensor networks practical.

A compact built-in handset antenna for multiple-input multiple-output (MIMO) system at 2 GHz, comprising two elements array of newly proposed L-shaped folded monopole antenna (LFMA), is evaluated under the multipath radio wave propagation environments. By analyzing the fundamental characteristics, mean effective gain (MEG), correlation, and channel capacity, the significant enhancement in the capability, as a handset MIMO antenna under practical use conditions, was confirmed. The performances were also compared to those of an array antenna comprising two planar inversed-F antenna (PIFA) elements in order to verify the effectiveness of the proposed antenna. The results show that the equivalent or improved performances can be realized, by using the proposed LFMA array with a compact size, taking only the volume of 44% of a PIFA array. The LFMA array provides almost the same bandwidth and enhanced isolation compared with a PIFA array, and the sufficiently low correlation and acceptable effective gain are obtained under the multipath radio wave propagation environments. In addition, a greater channel capacity than a PIFA array is achieved especially when the proposed LFMA array is inclined for the display-viewing mode, and moreover, an almost doubled increase in the channel capacity is obtained by using MIMO transmission compared with single-input single-output (SISO). This study also show that the MEG has much effects on the channel capacity, rather than the correlations, for the proposed antenna.

Twin-Channel (TC)-MOSFET with twin omega-gate (Ω-gate) Si channels and its fabrication process were proposed. The twin Si channels are able to be fabricated by self-aligned process utilizing wet etching of SiN and silicon-on-insulator (SOI) wafers. Three-dimensional (3-D) device simulation was performed to optimize gate structure for TC-MOSFET with 10 nm10 nm (TSiWG) channels with the gate length of 30 nm, and it was found that TC-MOSFET with right-angled Ω-gate in case the Lunder was 3 nm showed excellent device characteristics similar to the gate-all-around (GAA) devices corresponding to the gate structure as Lunder=5 nm. Fabrication process of twin Si channels was also investigated experimentally, and approximately 40 nm40 nm twin Si channels were successfully fabricated on SOI by the proposed fabrication process.

Optimistic log-based rollback recovery protocols have been regarded as an attractive fault-tolerant solution in distributed systems based on message-passing paradigm due to low overhead in failure-free time. These protocols are based on a Piecewise Deterministic (PWD) Assumption model. They, however, assumed that all logged non-deterministic events in a consistent global recovery line must be determinately replayed in recovery time. In this paper, we give the impossibility of deterministic replaying of logged non-deterministic event in a consistent global recovery line as a Ω Line Problem, because of asynchronous properties of distributed systems: no bound on the relative speeds of processes, no bound on message transmission delays and no global time source. In addition, we propose a new optimistic log-based rollback recovery protocol, which guarantees the deterministic replaying of all logged non-deterministic events belonged in a consistent global recovery line and solves a Ω Line Problem in recovery time.

Treating an averaged multiple-trials data or non-averaged single-trial data is a main approach in recent topics on applying independent component analysis (ICA) to neurobiological signal processing. By taking an average, the signal-to-noise ratio (SNR) is increased but some important information such as the strength of an evoked response and its dynamics will be lost. The single-trial data analysis, on the other hand, can avoid this problem but the SNR is very poor. In this study, we apply ICA to both non-averaged single-trial data and averaged multiple-trials data to determine the properties and advantages of both. Our results show that the analysis of averaged data is effective for seeking the response and dipole location of evoked fields. The non-averaged single-trial data analysis efficiently identifies the strength and dynamic component such as α-wave. For determining both the range of evoked strength and dipole location, an analysis of averaged limited-trials data is better option.

The concept of an Ω-matrix was introduced by Nishi in order to estimate the number of solutions of a resistive circuit containing active elements. He gave a finite characterization by means of four conditions which are all satisfied if and only if the matrix under investigation is an Ω-matrix. In this note we show that none of the four conditions can be omitted.

A new blind identification method of transfer functions between variables in feedback systems is introduced for single sweep type of MEG data. The method is based on the viewpoint of stochastic/statistical inverse problems. The required conditions of the model are stationary and linear Gaussian processes. Raw MEG data of the brain activities are heavily contaminated with several noises and artifacts. The elimination of them is a crucial problem especially for the method. Usually, these noises and artifacts are removed by notch and high-pass filters which are preset automatically. In the present paper, we will try two types of more careful preprocessing procedures for the identification method to obtain impulse functions. One is a careful notch filtering and the other is a blind source separation method based on temporal structure. As results, identifiably of transfer functions and their impulse responses are improved in both cases. Transfer functions and impulse responses identified between MEG sensors are obtained by using the method in Appendix A, when eyes are closed with rest state. Some advantages of the blind source separation method are discussed.

This paper describes multi-channel SQUID systems for biomagnetic measurement developed at KIT and Yokogawa. They are MEG systems, 24-ch systems for peripheral nerve measurement and 9-ch high spatial resolution system. A concept of calibration of the SQUID sensor array is introduced and discussed. Also discussed are noise performance of the system and crosstalk between sensors. Some examples of biomagnetic measurement are introduced using these systems, and their usefulness in the future is discussed.

The potential network architecture of the emerging carrier class VoIP (Voice over IP) technology for NGN (Next Generation Networks) adopts distributed control architecture to take full advantage of scalability, reliability, flexibility, and interoperability. However, the design of distributed control architecture in the carrier class VoIP network is the state-of-the-art in decentralization and distribution of control. Different configurations of system elements, control scheme of inter system elements communications, signaling protocol, functional partitioning, and scheduling of jobs in call control processing may affect the system performance and QoS (Quality of Service) of MGC (Media Gateway Controller) in carrier class VoIP network. Hence, the modeling of distributed control architecture and its performance analysis are essential issues whenever optimum control architecture has to be determined to meet design requirements. Based on these reasons, this paper proposes several potential network architectures and focuses on the performance study of distributed control architecture in carrier class VoIP network. The SIGTRAN-based distributed control architecture model and the MGCP/MEGACO-based distributed control architecture model are presented. Then, we analyze the SIGTRAN-based distributed control architecture model between MGC and SG (Signaling Gateway) using WRR (Weighted Round Robin) and WF2Q (Worst-case Fair Weighted Fair Queueing) scheduling algorithms respectively. And, we analyze the MGCP/MEGACO-based distributed control architecture model between MGC and MG (Media Gateway) using M/G/1 gating service queueing model. Consequently, the results of performance analysis can be used to evaluate whether the performance of distributed control architecture model can meet the requirement of planning and design for carrier class VoIP network deployment.

In recent years, several inverse solutions of magnetoencephalography (MEG) have been proposed. Among them, the multiple signal classification (MUSIC) method utilizes spatio-temporal information obtained from magnetic fields. The conventional MUSIC method is, however, sensitive to Gaussian noise and a sufficiently large signal-to-noise ratio (SNR) is required to estimate the number of sources and to specify the precise locations of electrical neural activities. In this paper, a new algorithm for solving the inverse problem using the fourth order MUSIC (FO-MUSIC) method is proposed. We apply it to the MEG source estimation problem. Numerical simulations demonstrate that the proposed FO-MUSIC algorithm is more robust against Gaussian noise than the conventional MUSIC algorithm.

For measuring high frequency ultrasonic fields which are often spatially distributed and transient, an array probe with small element sensors is highly required. In this paper, we propose a fiber-optic micro-probe array which is based on wavelength-division-multiplexing technique. The element sensor consists of a micro optical cavity of 100 µm long made at the end of optical fiber. Optical path length of the cavity is changed by the applied acoustic field, and the modulation of output light intensity is monitored at another end of the fiber for the information of the acoustic field. Array of sensor elements and a light source as well as a photo detector are connected together by an optical star coupler. The Fabry-Perot resonance wavelength of each sensor element is designed different one another, and the outputs from the sensors are discriminated by sweeping the wavelength of light source with the use of a tunable semiconductor laser. In this paper, the performance of the micro-probe array is discussed experimentally.

There are two approaches for formal verification of sequential designs or finite state machines: language containment checking and symbolic model checking. To verify designs of practical size, in these two approaches, designs are represented symbolically, in practice, by ordered binary decision diagrams. In the conventional algorithm for language containment checking, finite automata given as specifications are also represented symbolically. This paper proposes a new method, called partially explicit method for checking language containment. By representing states of finite automata given as specifications explicitly, this method can remove redundant computations, and as a result, provide better performance than the conventional method which uses the product machines of designs and specifications. The experimental results show that this approach is effective in checking language containment symbolically.

We present a symbolic language emptiness check algorithm based on forward state traversal. A verification property is given by a set of error traces written in ω-regular expression and is manipulated explicitly as a non-deterministic state transition graph. State space of the design model is implicitly traversed along the explicit graph. This method has a large amount of flexibility for controlling state traversal on the property space. It should become a good framework of incremental or approximate verification of ω-regular properties.

We address, in this paper, the main features of hybrid modes propagating in a rectangular waveguide partially filled with pseudochiral Ω-slabs. For the particular case of a uniaxial Ω-slab, we show that LSE and LSM hybrid modes can propagate in this inhomogeneously filled rectangular waveguide. The influence of the Ω-parameter, which characterizes the magnetoelectric tensors of the bianisotropic slab, on LSM modes is analyzed--namely an increase in the bandwidth for monomodal operation is reported. In addition, a field displacement effect and a variable phase shift proportional to the change of the Ω-parameter are attained. Finally, it is shown that the propagation characteristics are independent of the direction of propagation and so, unlike the case of magnetically biased ferrite loading, reciprocal devices can be achieved.

This paper describes a neuro-based optimization algorithm for three dimensional (3-D) cylindric puzzles which are problems to arrange the irregular-shaped slices so that they perfectly fit into a fixed three dimensional cylindric shape. First, the idea to expand the 2-dimensional tiling technique to 3-dimensional puzzles is described. Next, to energy function with the fitting function of each polyomino is introduced, which is available for 3-D cylindric puzzles. Furthermore our algorithm is applied to several examples using the analog neural array. Finally, it is shown that our algorithm is useful for solving 3-D cylindric puzzles.