Da-Ren CHEN Chiun-Chieh HSU Chien-Min WANG
A hard real-time system is one whose correctness depends not only on the logical result, but also when the results are produced. While many techniques have been proposed for single processor real-time systems, multiprocessor systems have not been studied so extensively. In this paper, we mainly propose two variant (DCTS) by using the Early-Release-Fair (ERfair) and Proportionate-fair (Pfair) model with integral assumptions for identical multi-processor real-time systems. ERfair is a scheduling model for real-time tasks on a multiprocessor system. On the different definitions of distance constraint, we propose two efficient scheduling algorithms designed to probe whether the distance constraints of all ER-fair tasks can be guaranteed. If the distance constraints cannot be guaranteed, then the proposed algorithms gather the unfeasible tasks and inflate them with a reweighting function. The proposed algorithms are linear-time and most suitable for dynamic systems. The experimental results reveal that the proposed algorithms increase significantly the ratio of schedulable task sets.
Wenliang TSENG Chien-Nan Jimmy LIU Chauchin SU
This paper presents a methodology based on congruent transformation for distributed interconnects described by state-space time-delays system. The proposed approach is to obtain the passive reduced order of linear time-delays system. The unified formulations are used to satisfy the passive preservation. The details of the mathematical proof and a couple of validation examples are given in this paper.
Masahiro FUJII Makoto ITAMI Kohji ITOH
Orthogonal Frequency Division Multiplexing (OFDM) systems are very sensitive to the frequency offset of the local oscillator at the receiver while the symbol timing offset can be absorbed in the guard interval. For the same reason, estimation of the frequency characteristics, needed for OFDM to be adapted to the frequency selective fading, can only be carried out conventionally after the frequency offset has been compensated. And accurate estimation of large frequency offset certainly requires high precision estimate of the frequency characteristics. In this paper, we propose a new joint estimation method of the frequency offset and the channel frequency response using an Expectation-Maximization (EM) algorithm for OFDM systems. The proposed algorithm overcomes the limitation of the thus far proposed algorithm. By computer simulations, we show the proposed algorithm provides estimation accuracy close to its lower bound in a wide range of the frequency offset.
A dynamically reconfigurable device is a device that can change its hardware configuration arbitrarily often in order to achieve the desired performance and functions. Since several tasks are executed on the device concurrently, scheduling of both task execution and reconfiguration is an important problem. In our model, the dynamically reconfigurable device is represented by a two-level hierarchical automaton, and execution of each periodic task is represented by a timed discrete event system. We propose a composition rule to get an automaton, which represents non-preemptive execution of periodic tasks on the dynamically reconfigurable device. We introduce a method to get a feasible execution sequence of tasks by using state feedback control.
Takamichi NAKAMOTO Kenjiro YOSHIKAWA
We developed an olfactory display to blend 8 component odors at any composition. The solenoid valves controlled by an algorithm with delta sigma modulation showed the sufficient capability. Then, we developed a system for presenting a movie together with scents. We actually made a movie with scents and evaluated it using questionnaire survey. It was found that the scene with smell attracted the experimental subjects' attention and, moreover, the contrast of the pleasant smell with the offensive one emphasized their attention. Furthermore, we established several guidelines for producing movies with scents.
In this paper, the interpolation line search (ILS) algorithm to find the desirable step length in a numerical optimization method is investigated to determine the optimal saturation limits with non-smooth nonlinearities. The simple steepest descent algorithm is used to illustrate that the ILS algorithm can provide adequate reductions in an objective function at minimal cost with fast convergence. The power system stabilizer (PSS) with output limits is used as an example for a nonlinear controller to be tuned. The efficient computation to implement the ILS algorithm in the steepest descent method is available by using the hybrid system model with the differential-algebraic-impulsive-switched (DAIS) structure. The simulation results are given to show the performance improved by the ILS algorithm.
The Erlang capacity of multi-service multi-access systems supporting several different radio access technologies was analyzed and compared according to two different operation methods: the separate and common operation methods, by simultaneously considering the link capacity limit per sector as well as channel element (CE) limit in a base station (BS). In a numerical example with GSM-like and WCDMA-like sub-systems, it is shown that we can get up to 60% Erlang capacity improvement through the common operation method using a near optimum so-called service-based user assignment scheme when there is no CE limit in BS. Even with the worst-case assignment scheme, we can still get about 15% capacity improvement over the separate operation method. However, a limited number of CEs in BS reduces the capacity gains of multi-service multi-access systems in both the common operation and separate operation. In order to fully extract the Erlang capacity of multi-service multi-access systems, an efficient method is needed in order to select a proper number of CE in BS while minimizing the equipment cost.
Hiroshi MATSUNO Chen LI Satoru MIYANO
Petri nets have recently become widely accepted as a description method for biological pathways by researchers in computer science as well as those in biology. This paper gives an overview of Petri net formalisms to describe biological pathways and discusses their use in modelings and simulations for the systematic understandings of biological pathways. After reviewing the use of various types of Petri nets for the biological pathway modelings, we showed the examples that analyze fundamental properties of biological pathways using T-invariant, P-invariant, siphon, and trap. Applications of hybrid Petri nets for producing new biological hypotheses through simulations are also illustrated.
A family of sequences with zero correlation zone, which is shortly called a ZCZ set, can provide CDMA system without co-channel interference nor influence of multipath. This paper presents two types of ZCZ sets of non-binary sequence pairs, which achieve the upper bound of family size for length and zero correlation zone. One, which is produced by use of a perfect complementary pair and an orthogonal code, can change zero correlation zone, while the upper bound is kept. The other, which is generated by use of a newly defined orthogonal pair and an orthogonal code, can offer such CDMA system as a binary ZCZ set seems to be used.
Naofumi HOMMA Takafumi AOKI Tatsuo HIGUCHI
This paper presents an algorithm-level interpretation of fast adder structures in binary/multiple-valued logic. The key idea is to employ a unified representation of addition algorithms called Counter Tree Diagrams (CTDs). The use of CTDs makes it possible to describe and analyze addition algorithms at various levels of abstraction. A high-level CTD represents a network of coarse-grained components associated with multiple-valued logic devices, while a low-level CTD represents a network of primitive components directly mapped onto binary logic devices. The level of abstraction in circuit representation can be changed by decomposition of CTDs. We can derive possible variations of adder structures by decomposing a high-level CTD into low-level CTDs. This paper demonstrates the interpretation of redundant arithmetic adders based on CTDs. We first introduce an extension of CTDs to represent possible redundant arithmetic adders with limited carry propagation. Using the extended version of CTDs, we can classify the conventional adder structures including those using emerging devices into three types in a systematic way.
Atsushi TOMIKI Idnin PASYA Takehiko KOBAYASHI
This paper reports on a study of the interference effects from 2 types of ultra wideband (UWB) sources on a QPSK transmission system by simulation. The culprit UWB sources were: multi-band orthogonal frequency-division multiple-access (MB-OFDM) and direct-sequence UWB (DS-UWB), which were modeled on the proposal specifications in the IEEE 802.15.3a to standardize high-speed wireless personal area networks. Average bit error rate (BER) degradation of the victim system was evaluated under in-band interference from the UWB signals. The proposed modified equivalent baseband system was employed in the simulation in order to reduce the simulation costs. Interference effects from the UWB sources were also examined under a Rayleigh fading channel.
The output limits of the power system stabilizer (PSS) can improve the system damping performance immediately following a large disturbance. Due to non-smooth nonlinearities from the saturation limits, these values cannot be determined by the conventional tuning methods based on linear analysis. Only ad hoc tuning procedures have been used. A nonlinear least squares method, which is the Gauss-Newton optimization algorithm, is used in this paper. The gradient required in the Gauss-Newton method can be computed by applying trajectory sensitivities from the hybrid system model with the differential-algebraic-impulsive-switched (DAIS) structure. The optimal output limits of the PSS tuned by the proposed method are evaluated by time-domain simulation in a multi-machine power system (MMPS).
Huu Phu BUI Yasutaka OGAWA Takeo OHGANE Toshihiko NISHIMURA
Multiple-input multiple-output (MIMO) systems using eigenbeam space division multiplexing (E-SDM) perform well and have increased capacities compared with those using conventional space division multiplexing (SDM). However, channel state information (CSI) is required at a transmitter, and the performance of E-SDM systems depends much on the accuracy of the CSI at a transmitter and a receiver. In time-varying fading environments, the channel change between the transmit weight determination time and the actual data transmission time causes the system performance to degrade. To compensate for the channel error, a linear extrapolation method has been proposed for a time division duplexing system. Unfortunately, the system performance still deteriorates as the maximum Doppler frequency increases. Here, two new techniques of channel extrapolation are proposed. One is second order extrapolation, and the other is exponential extrapolation. Also, we propose maximum Doppler frequency estimation methods for exponential extrapolation. Simulation results for 4tx 4rx MIMO systems showed that using the proposed techniques, E-SDM system performs better in a higher Doppler frequency region.
Toshiyuki MIYAMOTO Yasuhiro MORITA Sadatoshi KUMAGAI
Secret sharing is a method for distributing a secret among a party of participants. Each of them is allocated a share of the secret, and the secret can only be reconstructed when the shares are combined together. We have been proposing a secret sharing distributed database system (SSDDB) that uses a secret sharing scheme to improve confidentiality and robustness of distributed database systems. This paper proposes a vertical partitioning algorithm for the SSDDB, and evaluates the algorithm by computational experiments.
There is a certain level of requirements for system performance that intrusion detection systems on the Internet need. One of them is to lower the rate of "False Positive" and "False Negative." Another one is to have a convenient user interface so that users can manage system security easily with the detection systems. However, scan detection systems on public domain show a high rate of false detection and have difficulty in detecting various scanning techniques. In addition, since current scan detection systems are based on the command interface, the systems have been poor at user interface and therefore it is difficult to apply them to system security management. Hence, we first propose a set of new filter rules, which detect various scan attacks based on port scanning techniques. Secondly, a set of ABP-Rules derived from attacker's behavioral patterns is proposed in order to minimize the False Positive rate. With these methods, we implement a new real-time scan detection system, overcoming the limitations of current real-time scan detection systems. Also the implemented system contains a GUI interface for user's convenience of managing the network security, which was developed with Tcl/Tk.
In this paper, we shall describe about a refined theory based on the concept of set-valued operators, suitable for available operation of extremely complicated large-scale network systems. The deduction of theory is accomplished in a weak topology introduced into the Banach space. Fundamental conditions for availability of system behaviors of such network systems are clarified, as a result, in a form of fixed point theorem for system of set-valued operators.
Masaki FUKUSHIMA Hajime NAKAMURA Shinichi NOMOTO Yu WATANABE
In future systems beyond IMT-2000, macrocell cellular systems such as the 3G systems and high bandwidth microcell wireless systems such as Wireless LAN will complement one another. Routing in the systems beyond IMT-2000 will support seamless inter- and intra-system handover among the cellular and WLAN systems by maintaining active connections. Under such environments, the time scales of mobility and bandwidth-sharing behavior cannot be easily separated. It is not obvious what fraction of traffic is accommodated by each cellular and WLAN system, i.e. the traffic distribution is unknown. This paper shows the considerable impacts the mobility of users has on the capacities of the systems beyond IMT-2000 with roaming capability between different bit rate systems. Especially, this paper demonstrates that the traffic distribution among different systems is a major factor in defining total network throughput. We also provide an analytical method to determine the traffic distribution based on the theory of queueing networks.
Yoichiro MIZUNO Ryo HASEGAWA Riaz ESMAILZADEH Masao NAKAGAWA
Higher transmission rates are one of the main characteristics of the fourth-generation (4G*) of mobile communications. These systems are expected to operate at higher frequency bands, which experience larger propagation loss. This results in larger required transmission power, which causes several problems, particularly for uplink communications, as the typical mobile station (MS) has limited transmission power. Multi-hop systems have been proposed to address this problem. In this paper, we consider the issue of random-access (RA) in a multi-hop system. It is clear that a two-hop mobile communication system requires a two-stage RA process. In this paper, we propose a two-stage RA process that is an extension of the RA process of the CDMA-based 3GPP standard. The proposed method uses a hybrid of code division multiple access (CDMA) and Slotted-ALOHA. To realize the proposed two-hop RA, we dedicate one slot for second-hop transmissions in each interval (predefined); we refer to this as the interval slots allocation (ISsA) technique. Numerical analyses and simulations are conducted to evaluate its basic performance in a multi-hop system. The results demonstrate the superior throughput-delay performance of the proposed two-stage RA multi-hop system with ISsA.
Yasuhisa TAKIZAWA Peter DAVIS Makoto KAWAI Hisato IWAI Akira YAMAGUCHI Sadao OBANA
The location information of ubiquitous objects is one of the key issues for context-aware systems. Therefore, several positioning systems to obtain precise location information have been researched. However, they have scalability and flexibility problems because they need completely configured space with a large number of sensors. To avoid the problems, we proposed a self-organizing location estimation method that uses ad hoc networks and Self-Organizing Maps and needs no prepared space with a large number of sensors. But, as in other similar precise localization methods, the proposed method needs advanced distance measurements unavailable to conventional wireless communication systems. In this paper, the self-organizing location estimation method's modification for distance measurement that uses received signal strength available to conventional wireless communication systems but which fluctuates uncertainly, is described and location estimation accuracy with the modified method is shown.
Yusuke MATSUOKA Toshimichi SAITO
This paper studies rich superstable phenomena in a nonautonomous piecewise constant circuit including one impulsive switch. Since the vector field of circuit equation is piecewise constant, embedded return map is piecewise linear and can be described explicitly in principle. As parameters vary the map can have infinite extrema with one flat segment. Such maps can cause complicated periodic orbits that are superstable for initial state and are sensitive for parameters. Using a simple test circuit typical phenomena are verified experimentally.