Interest in the regulatory issues for Software Defined Radio (SDR) is spreading worldwide since the Federal Communications Commission (FCC) recently recognized SDR and created a new category for SDR authorization. SDR technology will bring enormous benefits to the field of wireless services. However, in order to ensure such benefits, revisions of the radio law and/or related ordinances are required regardless of standardization of the software downloading and other implementation details. In order to define the issues peculiar to SDR and to investigate how conformity evaluation should be conducted for radio equipments whose RF characteristics can be altered by software changes in the field, "Study Group on Software Technology for Radio Equipment" was organized by the Telecom Engineering Center (TELEC) in 2000. This paper summarizes a report of the Study Group that was published in March 2003 including the proposal for "Technical regulation conformity evaluation system," the principal output of the study, which proposes how to prevent unauthorized changes to radio equipment in the field.

A Java execution environment is implemented, in which a hardware engine is operated in parallel with an embedded processor. This pair of hardware facilities together with an additional software kernel are devised for existing embedded systems, so as to execute Java applications more efficiently in such a way that 39 instructions are added to the original Java Virtual Machine to implement the software kernel. The exploration of design parameters is also attempted to attain a low hardware cost and high performance. The proposed hardware engine of a 6-stage pipeline can be integrated in a single chip using 30 k gates together with the instruction and data cache memories. The proposed approach improves the execution speed by a factor of 5 in comparison with the J2ME software implementation.

A framework of dynamically adaptive hardware mechanism on multicontext reconfigurable devices is proposed, and as an example, an adaptive switching fabric is implemented on NEC's novel reconfigurable device DRP (Dynamically Reconfigurable Processor). In this switch, contexts for the full crossbar and alternative hadware modules, which provide larger bandwidth but can treat only a limited pattern of packet inputs, are prepared. Using the quick context switching functionality, a context for the full crossbar is replaced by alternative contexts according to the packet inputs pattern. If the context corresponding to requested alternative hadware modules is not inside the chip, it is loaded from outside chip to currently unused context memory, then replaced with the full size crossbar. If the traffic includes a lot of packets for specific destinations, a set of contexts frequently used in the traffic is gathered inside the chip like a working set stored in a cache. 4 4 mesh network connected with the proposed adaptive switches is simulated, and it appears that the latency between nodes is improved three times when the traffic between neighboring four nodes is dominant.

The Communications Research Laboratory (CRL) started a new project named the New Generation Mobile Network Project in April 2002. The target of this project is the development of new technologies to enable seamless and secure integration of various wireless access networks such as 3rd and 4th generation cellular, wireless LAN, high-speed mobile wireless, wired communications, and broadcasting networks. This paper presents an overview of CRL's new generation mobile communication system that is called The Multimedia Integrated Network by Radio Access Innovation Plus (MIRAI+), as well as details the role of Software Radio Technology (SDR) in MIRAI+.

Suppose that we need to design a controller for the system x(t) = A x(t) + B u, u = -K x(t), y(t) = C x(t), where matrices A, B and C are given and K is the matrix to to determine. It is required to determine K so that y(t) should not exceed prescribed value (i.e., the peak of output y(t) is limited). This kind of specification, in general, difficult to satisfy, since the peak ymax of y(t) (we define ymax to be max0 t |y(t)|) is a non-trivial function of design parameter K, which can not be expressed explicitly generally. Therefore, a controller design with such specifications often requires try and error process. In this paper, we approximate ymax in the form of formal power series and give an efficient algorithm to compute the series. We also give a design example of a control system as an application of the algorithm.

This paper outlines the perspectives on Software Defined Radio (SDR) technology in viewpoint of the standardization of the future mobile communication systems. The activities of ITU-R SG8 Working Party 8F (WP8F) and mITF (mobile IT Forum) of Japan for systems beyond IMT-2000 (B3G) or 4-th generation mobile systems are firstly summarized. The latest discussions relating to SDR technology in the both parties are reported. It is followed by consideration on both expectations and technical issues on SDR in order to realize the technology in the future mobile communication systems. They are clarified in the viewpoint of standardization activity on B3G. Also some regulation issues are lastly summarized.

The application of fault injection in the context of dependability benchmarking is far from being straightforward. One decisive issue to be addressed is to what extent injected faults are representative of the considered faults. This paper proposes an approach to analyze the effects of real and injected faults.

Two important lemmas on the determinant of random matrixes are deduced in this paper. Then based on these results, expression for the mean capacity of MIMO system over Rayleigh fading channels is obtained. This expression requires little calculation and is simple and efficient compared with conventional methods, and furthermore, it gives an explicit relation on the mean capacity of MIMO systems with antenna numbers and the relation of mean capacity with signal to noise ratio (SNR). Accuracy of this theoretic formula has been verified by computer simulation.

The measurement of the 3-dimensional behavior of early reflections in a sound field has been an important issue in auditorium acoustics since the reflection profile has been found to be strongly correlated with the subjective responsiveness of a listener. In order to detect the incidence angle and relative amplitude of reflections, a 4-point microphone system has conventionally been used. A new measurement system is proposed in this paper, which has 5 microphones. Microphones are located on each four apex of a tetrahedron and at the center of gravity. Early reflections, including simultaneously incident reflections,which previous 4-point microphone system could not discriminate as individual wavefronts, were successfully found with the new system. In order to calculate accurate image source positions, it is necessary to determine the exact peak positions from measured impulse responses composed of highly deformed and overlapped impulse trains. For this purpose, a peak-detecting algorithm, which finds dominant peaks in the impulse response by an iteration method, is introduced. In this paper, the theoretical background and features of the 5-microphone system are described. Also, some results of experiments using this system are described.

Cluster systems are getting widely used because of good performance / cost ratio. However, their reliability has not been well discussed in practical environment so far. As the number of commodity components in a cluster system gets increased, it is indispensable to support reliability by system software. SCore cluster system software is a parallel programming environment for High Performance Computing (HPC). SCore provides checkpointing and rollback-recovery mechanism for high availability. In this paper, we analyze and evaluate the checkpointing and rollback-recovery mechanisms of SCore quantitively. The experimental results reveal that the required time for checkpointing scales very well in respect to the number of computing nodes. However, the required time is quite long due to the low effective network bandwidth. Based on the results, we modify SCore and successfully make checkpointing and recovery 1.8 2.8 times and 3.7 5.0 times faster respectively. This is very helpful for cluster systems to achieve high performance and high availability.

In the 1960's, the problems of distributed systems management did not exist. Systems were centralized and typically housed in one facility. Over time, however, the power, complexity and connectivity of the computer systems and networks evolved. Today, businesses are dependent on their compute and networking infrastructures to operate and survive. These infrastructures are geographically and functionally distributed, and their management is critical. This paper discusses how distributed systems management has evolved, and what the future may bring.

Constraints have been used extensively for the construction of graphical user interfaces. User interface constraints that are declarative are more favorable but require sophisticated constraint planning algorithms. Constraint planning algorithms proposed previously are getting more and more complicated as they were asked to handle more general requirements. We believe that the difficulty is mainly caused by the complicated data structure that is translated directly from the problem. By a transformation, we propose a simplified graph model for the problem and prove that the constraint planning problem can be reduced to finding feedback vertex sets on the simplified graph model. We also consider the general problem of handling non-uniform user interface constraints.

In order to stabilize a convey-crane with only cart position measurement, this paper designs an additional dynamics with which the parallel-connected system is feedback passive. Since the crane system can be stabilized with a proportional-derivative (PD) law, the additional system is constructed by using the PD gains, and the closed-loop system exhibits almost same performances with the PD law. With the proposed control law, the transfer function of the additional system has the form of sH(s) with a strictly positive real (SPR) H(s).

Autonomous distributed manufacturing systems(ADMS) consist of multiple intelligent components with each component acting according to its own judgments. The ADMS objective is to realize more agile and adaptive manufacturing systems. This paper presents the introduction of context-dependent agents (CDAs) in ADMS, and switch strategies depending on system conditions to achieve better performance can be realized by agents that use the same strategies under all system conditions. For the real-time job scheduling problem, the present paper recalls a basic CDA architecture, and presents the results of an extensive empirical evaluation its performance relative to other rule-based schemes based on several common indices for real-time dispatch.

This paper presents the performance modeling application of SIP-T (Session Initiation Protocol for Telephones) signaling system based on two-class priority queueing process in carrier class VoIP (Voice over IP) network. The SIP-T signaling system defined in IETF (Internet Engineering Task Force) is a mechanism that uses SIP (Session Initiation Protocol) to facilitate the interconnection of existing PSTN (Public Switched Telephone Network) with carrier class VoIP network. One of the greatest challenges in the migration from PSTN toward NGN (Next Generation Networks) is to build a carrier class VoIP network that preserves the ubiquity, quality, and reliability of PSTN services while allowing the greatest flexibility for use of new VoIP technology. Based on IETF, the SIP-T signaling system not only promises scalability, flexibility, and interoperability with PSTN but also provides call control function of MGC (Media Gateway Controller) to set up, tear down, and manage VoIP calls in carrier class VoIP network. This paper presents the two class priority queueing model, performance analysis, and simulation of SIP-T signaling system in carrier class VoIP network focused on toll by-pass or tandem by-pass of PSTN. In this paper, we analyze the average queueing length, the mean of queueing delay, and the variance of queueing delay of SIP-T signaling system that are the major performance evaluation parameters for improving QoS (Quality of Service) and system performance of MGC in carrier class VoIP network. A mathematical model of the M/G/1 queue with two-class non-preemptive priority assignment is proposed to represent SIP-T signaling system. Then, the formulae of average queueing length, queueing delay, and delay variation for the non-preemptive priority queue are expressed respectively. Several significant numerical examples of average queueing length, queueing delay, and delay variation are presented as well. Finally, the two-class priority queueing model and performance analysis of SIP-T signaling system are shown the accuracy and robustness after the comparison between theoretical estimates and simulation results.

Reinforcement Learning (RL) is an efficient learning method for solving problems that learning agents have no knowledge about the environment a priori. Ant Colony System (ACS) provides an indirect communication method among cooperating agents, which is an efficient method for solving combinatorial optimization problems. Based on the cooperating method of the indirect communication in ACS and the update policy of reinforcement values in RL, this paper proposes the Q-ACS multiagent cooperating learning method that can be applied to both Markov Decision Processes (MDPs) and combinatorial optimization problems. The advantage of the Q-ACS method is for the learning agents to share episodes beneficial to the exploitation of the accumulated knowledge and utilize the learned reinforcement values efficiently. Further, taking the visited times into account, this paper proposes the T-ACS multiagent learning method. The merit of the T-ACS method is that the learning agents share better policies beneficial to the exploration during agent's learning processes. Meanwhile, considering the Q-ACS and the T-ACS as homogeneous multiagent learning methods, in the light of indirect media communication among heterogeneous multiagent, this paper presents a heterogeneous multiagent RL method, the D-ACS that composites the learning policy of the Q-ACS and the T-ACS, and takes different updating policies of reinforcement values. The agents in our methods are given a simply cooperating way exchanging information in the form of reinforcement values updated in the common model of all agents. Owning the advantages of exploring the unknown environment actively and exploiting learned knowledge effectively, the proposed methods are able to solve both problems with MDPs and combinatorial optimization problems effectively. The results of experiments on hunter game and traveling salesman problem demonstrate that our methods perform competitively with representative methods on each domain respectively.

Digital Subtraction Angiography (DSA) is a technique used for enhancement of small details in angiogram imaging systems. In this approach, X-ray images of a subject, after injection, are subtracted from a reference X-ray image, taken from the same subject before injection. Due to the exponential absorption property of X-rays, effects of small details at different depth appear differently on X-ray images. Consequently, image subtraction cannot be employed on the original images without any adjustment or modification. Proper modification, in this case, is to use some form of logarithmic operation on images before subtraction. In medical imaging systems, the system designer has a choice to implement this logarithmic operation in the analog domain, before digitization of the video signal, or in the digital domain after analog-to-digital conversion (ADC) of the original video signal. In this paper, the difference between these two approaches is studied and upper bounds for quantization error in both cases are calculated. Based on this study, the best approach for utilization of the logarithmic function is proposed. The overall effects of these two approaches on the inherent signal noise are also addressed.

Holonic Manufacturing Systems (HMSs), in which decisions are made through cooperation among holons (autonomous and cooperative manufacturing entities), eliminate various bottlenecks that exist in conventional systems to adapt to high-variety low-volume production. This paper describes the architecture of HMSs. Issues regarding incremental development and dynamic reconfiguration of cooperation mechanisms themselves, and mechanisms for ensuring stable and safe behaviors of HMSs are also discussed with reference to several proposals, with a view to applying the HMS architecture to large and complicated applications.

Finding a nonnegative integer solution x for Ax = b (A Zmn, b Zm1) in Petri nets is NP-complete. Being NP-complete, even algorithms with theoretically bad worst case and with average complexity can be useful for a special class of problems, hence deserve investigation. Then a Grobner basis approach to integer programming problems was proposed in 1991 and some symbolic computation systems became to have useful tools for ideals, varieties, and algorithms for algebraic geometry. In this letter, Grobner basis approach is applied to three typical problems with respect to state equation in P/T Petri nets. In other words, after Grobner bases are derived by the tool Maple 7, we consider how to derive the T-invariants and particular solutions of the Petri nets by using them in this letter.

Fault-tolerant execution of a mobile agent is an important design issue to build a reliable mobile agent system. Several fault-tolerant schemes for a single agent system have been proposed, however, there has been little research result on the multi-agent system. For the cooperating mobile agents, fault-tolerant schemes should consider the inter-agent dependency as well as the mobility; and try to localize the effect of a failure. In this paper, we investigate properties of inter-agent dependency and agent mobility; and then characterize rollback propagation caused by the dependency and the mobility. We then suggest some schemes to localize rollback propagation.