Chunhee WOO Daehyun LEE Hagbae KIM
When a failure or upset occurring in a controller computer induces a task failure durable for a substantial period, system dynamics apparently deviates from its desirable sample paths, and loses its stability in an extreme case for the period to exceed the hard deadline in a real-time control system. In the paper, we propose an algorithm to combine the deadlines of all elementary tasks (derived formerly by our work) executed in several operation modes with multi-sampling periods. This results in computing the hard deadline of the entire system through modifying task-state equations to capture the effects of task failures and inter-correlations among tasks.
Takeshi MATSUDA Yoshifumi NISHIO Yoshihiro YAMAGAMI Akio USHIDA
We propose here a time-domain shooting algorithm for calculating the steady-state responses of nonlinear RF circuits containing parasitic elements that is based on both a modified Newton and a secant methods. Bipolar transistors and MOSFETs in ICs have small parasitic capacitors among their terminals. We can not neglect them because they will gives large effects to the shooting algorithm at the high frequency. Since our purpose is to develop a user friendly simulator, we mainly take into account the relatively large normal capacitors such as coupling and/or by-pass capacitors and so on, because the parasitic capacitors are usually smaller and contained in the device models. We have developed a very simple simulator only using the fundamental tools of SPICE, which can be applied to relatively large scale ICs, efficiently.
Kwang-Sik KIM Moo-Ho CHO Kyoung-Rok CHO
In this Letter, an analytic method to calculate the cumulative distribution function (cdf) of the cell sojourn time with various distributions of a mobile velocity (constant, uniform, or Gaussian distribution) is presented. Gaussian pdf and cdf are estimated through curve-fitting. The cdf of the cell sojourn time is calculated through a numerical method. It is shown that the simulated result matches very close to the calculated result.
Kei EGUCHI Fumio UENO Toru TABATA Hongbing ZHU Takahiro INOUE
In this letter, a simple design of a discrete-time chaos circuit realizing a tent map is proposed. The proposed circuit can be constructed with 13 MOSFET's and 2 capacitors. Concerning the proposed circuit synthesized using switched-current (SI) techniques, the validity of the circuit design is analyzed by SPICE simulations. Furthermore, the proposed circuit is built with commercially-available IC's. The proposed circuit is integrable by a standard CMOS technology.
Yutaka NAKAMURA Ken-ichi CHINEN Suguru YAMAGUCHI Hideki SUNAHARA
A management of WWW server is still relying on the expertise and heuristic of administrators, because the comprehensive understandings of server behavior are missing. The administrators should maintain the WWW server with good states that they should investigate the WWW server in real time. Therefore, it is exactly desirable to provide a measurement application that enables the WWW server administrators to monitor WWW servers in the actual operational environment. We developed a measurement application called ENMA (Enhanced Network Measurement Agent) which is specially designed for WWW server state analysis. Furthermore, we applied this application to the large scale WWW server operation to show its implementation and advantages. In this paper, we analyze the WWW server states based on precise monitoring of performance indices of WWW system to help the server management.
Sangkyung KIM Wonjong NOH Byungkwen SONG Sunshin AN
In this paper, we propose the high-level service architecture supporting multimedia multicast. The proposed architecture specifies network-oriented and lightweight communication management, which includes group management, multiparty call control and multicast connection/multiple connections control. Many of the existing approaches handling multimedia multicast applications are dependent on specific transport technologies, such as the Internet and ATM, and lack effective communication management. On the other hand, our approach defines flexible and extensible communication management that can be applied to a variety of multimedia multicast applications, independently of transport technologies. Our architecture supports the separation of control from a terminal, which enables remote control and control mobility, so that a user can use a multicast service in a more various way. The architecture is overlaid above legacy transport networks so that the existing network protocols are used for connection control. This minimizes the modification to a legacy transport network and enhances the practicality of the architecture. In addition, terminal manager and virtual device concepts are introduced that hide the details of physical devices from an application designer. The architecture consists of several service components that effectively interact with each other on a distributed platform. To verify and evaluate our architecture, we have prototyped the high-level service architecture on a CORBA platform and analyzed the architecture using a simulation.
Designing control and robotic systems as autonomous decentralized systems introduces a new degree of flexibility in the manufacturing and in the application of such systems. This flexibility is required for the systems to work in environments that are not totally predictable and that can change dynamically. In this paper, we present a new concept for real-time communication that supports this flexibility while still preserving real-time guarantees for hard real-time communication. The concept is designed to work on multiple-access busses. In particular, we consider its application on wireless local area networks and field-busses. The concept addresses requirements of hard-real time, soft real-time and non real-time communication. For this, we extend the TDMA (time- division multiple-access) approach for time-triggered hard-real time communication by the concept of shared channels that support event-triggered communication and coexist with hard real-time channels. A first implementation of concept has been carried out in the context of the CAN-bus.
Takashi HATASHIMA Toshihiro MOTODA Shuichiro YAMAMOTO
We describe an index for estimating the level of interest in Web pages. This "time-based interest" (TBI) index combinates an equation reflecting page accesses and an equation reflecting the decrease in interest over time. These equations work simultaneously by using a parameter that is based on the time since the last access. We experimentally estimated the decrease ratio of the TBI index and evaluated the characteristics of the TBI equation. We found that the index follows Zipf's distribution, indicating that reflects the change in popularity. We also introduce an access-log analysis system called CyberRanking that includes TBI analysis. CyberRanking analyzes the access logs of Web servers and presents the results in 2-D or 3-D graph on a Web browser.
Yoichi YAMADA Chiharu SASAKI Yohei YOSHIDA Satoshi KURAI Tsunemasa TAGUCHI Tomoya SUGAHARA Katsushi NISHINO Shiro SAKAI
Excitonic optical properties of GaN homoepitaxial layers have been studied by means of magneto-luminescence and time-resolved luminescence spectroscopy. The luminescence lines due to the radiative recombination of excitons bound to neutral donors and acceptors have been measured under magnetic field up to 8 T, which was aligned perpendicular and parallel to the hexagonal c-axis. Under the magnetic field aligned perpendicular to the hexagonal c-axis, both the donor- and acceptor-bound-exciton lines clearly split into two components, which originated from the Zeeman splitting. The effective g-factors for both the donor- and acceptor-bound excitons were estimated to be 2.02 and 2.47, respectively. Under the magnetic field aligned parallel to the hexagonal c-axis, slight broadening of the bound-exciton lines was observed and the Zeeman splitting was too small to be detected. On the other hand, the diamagnetic shift for both the donor- and acceptor-bound-exciton luminescence lines was observed under the magnetic field aligned both perpendicular and parallel to the hexagonal c-axis. It was found that the diamagnetic shift of the donor-bound exciton was smaller than that of the acceptor-bound exciton. Furthermore, recombination dynamics of excitonic transitions was measured under high-density excitation. An excitation-density-dependent transition of the dominant radiative recombination process from donor-bound excitons to biexcitons was clearly observed in the temporal behavior. In addition, double-exponential decay of biexciton luminescence was observed, which is one of the characteristics of biexciton luminescence at high excitation densities.
In-Ho LIN Bih-Hwang LEE Chwan-Chia WU
This paper presents an object-oriented model to handle the temporal relationship for all of the multimedia objects at the presentation platform. Synchronization of the composite media objects is achieved by ensuring that all objects presented in the upcoming "manageable" period must be ready for execution. To this end, the nature of overlays is first investigated for various types of objects. Critical overlaps which are crucial in synchronization are also defined. The objective of synchronization is to ensure that the media objects can be initiated precisely at the critical point of the corresponding critical overlap. The concept of manageable presentation interval is introduced and the irreducible media group is defined. The resource scheduling of each presentation group for media object pre-fetch time versus buffer occupancy is also examined. Accordingly, a new model called group cascade object composition Petri-net (GCOCPN) is proposed and an algorithm to implement this temporal synchronization scheme is presented.
Masakazu FURUICHI Atsuo OZAKI Kazuhiro ABE Katsuto NAKAJIMA Hidetoshi TANAKA
This paper proposes a Space-Time Object Model, an object oriented model that possesses space and time management mechanisms. The goal of this object model is to provide a common software infrastructure for implementing large-scale moving object simulations efficiently, such as car traffic simulations and disaster evacuation simulations, using a direct mapping scheme on a parallel and distributed computing environment. In this object model, the software infrastructure provides two principal functions, "Space Management" and "Time Management," which allows programmers to focus on application programming instead of parallel programming. Although there are several known infrastructure software, which provide the environment needed to develop and execute parallel and distributed simulations, they only provide a "Time Management" mechanism. In this paper, we present a Space-Time Object Model and an overview of a program called OSim, which is an implementation of the Space-Time Object Model. Then, we demonstrate the applicability and efficiency of this model by introducing the overview and evaluation results of a parallel car traffic simulation system using OSim.
Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA
For a given graph G=(V, E), edge capacities c(e) for edges e E, and flow-demands d(v) for nodes v V, a problem of finding the minimum size source-set S V such that the maximum flow-amount between S and v is greater than or equal to d(v) for every v V is called generalized plural cover problem (GPC). For this problem, O(np s(n,m)) time algorithm is presented, where n, m, and p is the number of nodes, edges, and different values of d(v), respectively, and s(n,m) is the time required to solve the maximum flow problem of a graph with n nodes and m edges. This algorithm also constructs a set of optimal solutions in the same time. This property is convenient for applying it to real problems, because other constraints can also be taken into account.
Shiro AOKI Hiro ITO Hideyuki UEHARA Mitsuo YOKOYAMA Tsuyoshi HORINOUCHI
In this paper, a puzzle called Cell-Maze is analyzed. In this puzzle, cells are arranged in checker board squares. Each cell is rotated when a player arrives at the cell. Cell-Maze asks whether or not a player started from a start cell can reach a goal cell. The reachability problem for ordinary graphs can be easily solved in linear time, however a reachability problem for the network such as Cell-Maze may be extremely difficult. In this paper, NP-hardness of this puzzle is proved. It is proved by reducing Hamiltonian Circuit Problem of directed planar graph G such that each vertex involved in just three arcs. Furthermore, we consider subproblems, which can be solved in polynomial time.
Toshihiro FUJITO Satoshi TAOKA Toshimasa WATANABE
The legal firing sequence problem (LFS) asks if it is possible to fire each transition some prescribed number of times in a given Petri net. It is a fundamental problem in Petri net theory as it appears as a subproblem, or as a simplified version of marking reachability, minimum initial resource allocation, liveness, and some scheduling problems. It is also known to be NP-hard, however, even under various restrictions on nets (and on firing counts), and no efficient algorithm has been previously reported for any class of nets having general edge weights. We show in this paper that LFS can be solved in polynomial time (in O(n log n) time) for a subclass of state machines, called cacti, with arbitrary edge weights allowed (if each transition is asked to be fired exactly once).
The robust induced l-norm control problem is considered for uncertain discrete-time systems. We propose a state feedback and an output feedback controller that quadratically stabilize the systems and satisfy a given constraint on the induced l-norm. Both controllers are constructed by solving a set of scalar-dependent linear matrix inequalities (LMI's), and the gain matrices are characterized by the solution to the LMI's.
Yukiko YOKOYAMA Mineo KUMAZAWA Naoki MIKAMI
We proposed a new model for non-stationary time series analysis based on an inhomogeneous AR (autoregressive) equation. Time series data is regarded as white noise plus output of an AR system excited by non-stationary input sequence represented in terms of a set of basis. A method of model parameter estimation was presented when the set of basis and the AR order are given. In order to extend the method, we present a method of parameter estimation when the AR order is unknown: we set two new criteria 1) minimize the root mean square error of the output sequence, and 2) minimize scattering of estimated frequencies. Then, we derive a procedure for the estimation of the AR order and the other unknown parameters.
The subject of the paper is to give an overview and latest results on the Legal Firing Sequence Problem of Petri nets (LFS for short). LFS is very fundamental in the sense that it appears as a subproblem or a simpler form of various basic problems in Petri net theory, such as the well-known marking reachability problem, the minimum initial resource allocation problem, the liveness (of level 4) problem, the scheduling problem and so on. However, solving LFS generally is not easy: it is NP -hard even for Petri nets having very simple structures. This intractability of LFS may have been preventing us from producing efficient algorithms for those problems. So research on LFS from computational complexity point of view seems to be rewarding.
This letter proposes a combined input- and crosspoint-queued (CIC) switch in which virtual output queuing (VOQ) is used at each input port. This CIC switch has a large buffer at each input port and a small buffer at each crosspoint. It does not require high-speed memory access or high-speed internal cell transmission lines. Since the performance of the CIC switch depends on the scheduling algorithms, we propose new scheduling algorithms for the CIC switch. Numerical results show that the mean cell delay time performance of the CIC switch using the proposed scheduling algorithms is better than that of an input-queued ATM switch. In addition, the required buffer size for the CIC switch using the proposed scheduling algorithms is smaller than that for a crosspoint-queued ATM switch.
The features of the method of moment (MoM) and the finite difference time domain (FDTD) method for numerical analysis of the electromagnetic scattering problem are presented. First, the integral equations for the conducting wire, conducting plane and the dielectric materials are described. Importance to ensure the condition of the continuity of the current of the scatterers is emphasized and numerical examples for a conducting structure involving a junction of wire segment and planar segment is presented. Finally, the advantages and the disadvantages of the FDTD method are discussed.
Moonjae JEONG Satoshi TANAKA Shigetaka TAKAGI Nobuo FUJII Hiroshi KAWAMOTO
This paper presents a 7th-order channel-select filter for a spread-spectrum wireless receiver operating with a minimum power supply of 2.5 V. The channel-select filter implements a sharp transition from 2 MHz to 4 MHz and a stopband attenuation of 50 dB. The 7th-order filter is realized by a cascade of a passive RC integrator, a 3rd-order leapfrog filter, an operational amplifier based differentiator, a 2nd-order notch filter, and a 1st-order allpass filter. It is designed in a 0.35 µm single-poly BiCMOS process. Simulation results show feasibility of the proposed filter.