Image coding with vector quantization (VQ) reveals several defects which include edge degradation and high encoding complexity. This paper presents an edge-preserving coding system based on VQ to overcome these defects. A signal processing unit first classifies image blocks into low-activity or high-activity class. A high-activity block is then decomposed into a smoothing factor, a bit-plane and a smoother (lower variance) block. These outputs can be more efficiently encoded by VQ with lower distortion. A set of visual patterns is used to encode the bit-planes by binary vector quantization. We also develop a modified search-order coding to further reduce the redundancy of quantization indexes. Simulation results show that the proposed algorithm achieves much better perceptual quality with higher compression ratio and significant lower computational complexity, as compared to the direct VQ.

The design of a liner decorrelating detector for multi-processing gain code-division multiple-access (MPG-CDMA) systems is proposed, and its performance is discussed. As the result, the performance improvement by this detector is confirmed. Also, it is found that that the degrees of the noise enhancement depend on the processing gains of the signals.

In this paper, the Linear Exponential Quadratic Gaussian with Loop Transfer Recovery (LEQG/LTR) methodology is employed for the design of high performance induction motor servo systems. In addition, we design a speed sensorless induction motor vector controlled driver with both the extended Kalman filter and the LEQG/LTR algorithm. The experimental realization of an induction servo system is given. Compared with the traditional PI and LQG/LTR methods, it can be seen that the system output sensitivity for parameter variations and the rising time for larger command input of the proposed method can be significantly reduced.

The explicit formula for the coefficients of maximally linear digital differentiators is derived by the use of Taylor series. A modification in the formula is proposed to extend the effective passband of the differentiator with the same number of coefficients.

This paper examines fairness of service in the up-link of CDMA cellular slotted-ALOHA packet communication systems with site diversity reception. Site diversity rescues the packets originating mainly from near the edge of the cells, whereas packets originating near the base stations can not obtain the benefits of diversity reception. This situation causes an unfairness in packet reception that depends on location of the mobile station. Two transmission control schemes for reducing this unfairness are proposed. In the first scheme, mobile stations control the target received power for the open-loop power control based on the reception level of the pilot signals of the surrounding base stations. In the second, mobile stations control transmit permission probability. Successful packet reception rate, fairness coefficient and throughput performance are evaluated in fading environments with imperfect power control. Computer simulation shows that both schemes improve service fairness for all mobile stations and throughput performances. A performance comparison between the two schemes concludes that transmission power control outperforms transmit permission probability control as a simple technique for maintaining fairness of services.

In this paper, a token-controlled network with exhaustive service strategy is analyzed. The mean and variance of service time of a station, and the mean token rotation time on the network are derived under the condition that the buffer capacity of each station is individually finite. For analysis, an extended stochastic Petri-net model of a station is presented. Then, by analyzing the model, the mean service time of a station and the mean token rotation time are derived, as functions of the given network parameters such as the total number of stations on the network, the arrival rate of frames, the transmission rate of frames, and the buffer capacity. The variance of service time of a station is also derived. By examining derived results, it is shown that they exactly describe the actual operations of the network. In addition, computer simulations with sufficient confidence intervals help to validate the results.

The complexity of designing communication protocols has lead researchers to develop various techniques for designing and verifying protocols. One of the most important techniques is a compositional technique. Using a compositional technique, a large and complex protocol is designed and verified by composing small and simple protocols which are easy to handle, design and verify. Unlike the other compositional approaches, we propose compositional techniques for simultaneously composing service specifications and protocol specifications based on Formal Description Techniques (FDTs) called LOTOS. The proposed techniques consider alternative, sequential, interrupt and parallel composition of service specifications and protocol specifications. The composite service specification and the composite protocol specification preserve the original behaviour and the correctness properties of individual service specifications and protocol specifications. We use the weak bisimulation equivalence (), to represent the correctness properties between the service specification and the protocol specification. When a protocol specification is weak bisimulation equivalent to a service specification, the protocol satisfies all the logical properties of a communication protocol as well as provides the services that are specified in the service specification.

A semi-synchronous circuit is a circuit in which every register is ticked by a clock periodically, but not necessarily simultaneously. In a semi-synchronous circuit, the minimum delay between registers may be critical with respect to the clock period of the circuit, while it does not affect the clock period of an ordinary synchronous circuit. In this paper, we discuss a delay insertion method which makes such a semi-synchronous circuit faster. The maximum delay-to-register ratio over the cycles in the circuit gives a lower bound of the clock period. We show that this bound is achieved in the semi-synchronous framework by the proposing gate-level delay insertion method.

The growth and saturation characteristics of an electromagnetic (EM) wave in a Smith-Purcell free-electron laser (FEL) with a Bragg cavity are investigated in detail with the aid of numerical simulation based upon the fluid model of the electron beam. To analyze the problem, a two-dimensional (2-D) model of the Smith-Purcell FEL is considered. The model consists of a planar relativistic electron beam and a parallel plate metallic waveguide, which has a uniform grating carved on one plate. For confinement and extraction of EM waves, a Bragg cavity is formed by a couple of reflector gratings with proper spatial period and length, which are connected at both ends of the waveguide. The results of numerical simulation show that a compact Smith-Purcell FEL can be realized by using a Bragg cavity composed of metallic gratings.

This paper proposes an implementation of the Telecommunications Information Networking Architecture (TINA) connection management system, based on our involvement of The TINA Trial (TTT). The system is used for managing ATM networks, which consist of network elements with SNMP interfaces. It provides setup, configuration, and release of ATM connection with a GUI-based network design tool that generates network resource data used for deploying TINA software components. This paper reports on a method of implementing TINA components over a Distributed Processing Environment (DPE) and an effective way to manage computational objects with multiple interfaces by using the Trading Service.

In this paper, we describe the PS3 load distribution scheme. A target service is a transaction service consisting of multiple processes that communicate with each other. A target system consists of workstations connected by a LAN. PS3 determines the process allocation by estimating response times and throughputs. It allows us to set an upper limit of a response time, and to set lower and upper limits for the throughput of each service. PS3 tries to find a process allocation that provides the minimum response time under conditions set by the user in advance. We measured the response times and throughputs and compared the values with the estimated ones. The results show that PS3 provides an appropriate process allocation, and that calculated results agree well with the measured ones.

In this paper, we design and implement a Web-based Internet/Intranet service management system which can support Quality of Service (QoS) contracted by users and service providers, using Service Level Agreement (SLA) concept. We have analyzed the requirements and management information for Internet/Intranet service management. Based on this analysis, we have defined the suitable QoS parameters for the management of Internet/Intranet services, and developed new WWW service Management Information Bases (MIBs) for QoS management by extending the existing IETF's MIBs. The support of QoS management is done by incorporating the SLA concept, which is measured, monitored and controlled systematically in a multi-domain environment. Finally, we have built a prototype system, and evaluated its performance. The prototype system utilizes Java and CORBA technologies, so that various benefits of these technologies such as platform independence and scalability can be obtained.

In order to enhance the energy transfer efficiency in a rectangular Cherenkov laser, we propose to vary properly the permittivity of a loaded dielectric in the transverse direction. With the aid of particle simulation, we investigate the amplification characteristics of the rectangular Cherenkov laser with a dielectric permittivity varied in the transverse direction, demonstrating the effectiveness of our proposal for efficiency enhancement.

In this paper, we present a traffic scheduling algorithm, called the Delay-Bound Monotonic with Average Rate Reservation (DM/ARR), which generates minimum output burstiness streams. We assume that connection i is policed by the leaky bucket algorithm with parameters (σi,ρi) where σi is the bucket size (or burstiness) and ρi is the leaky rate. Compared with the totally isolated scheme where connection i is allocated a bandwidth ri=max{σi/di,ρi} (di is the delay bound requirement of connection i), the DM/ARR algorithm has a better performance in the sense that it has a larger admission region. We prove that, among all possible scheduling algorithms that satisfy the delay bound requirements of established connections, DM/ARR results in the minimum output burstiness. This is important because a smaller burstiness implies a smoother traffic and thus the receiver (or next switch node in a multihop network) can handle it more easily. Numerical results show that the admission region of the DM/ARR algorithm is close to that of the earliest deadline first algorithm. A packetized version is studied for ATM networks.

In general, when many functions and services are added to a system, verification and validation become difficult. In design and development in telecommunication services, conflicts that arise from combined telecommunication services have been discussed from various viewpoints. However, correctly and efficiently detecting all conflicts is still not possible and the resolution of conflicts primarily depends on expert designers, who are finding that these problems are beyond their ability. Thus, the burden on the designer must also be alleviated at the design stage. Service interference, which is discussed in this paper, is a kind of conflict. A problem of service interference is that during service, other services interfere with the ongoing service behavior. That is to say, a strange state arises, or an input event doesn't work, or a strange transition occurs, etc. The detection of service interference by only comparing states among services is not enough since the state transition must be considered in the service interference. This paper proposes how to automatically detect the service interference with a rule-based system and an extended adjacency matrix. The proposed method uses and combines features of both the adjacency matrix and rule-based system. The method first generates the extended adjacency matrix by the rule application, then extracts sequences of the state, the event, and the rule applications, and then detects the service interference with the extracted sequences.

Multimedia service users can require multi-services according to their own environment for accessing to public networks. For copying with customer-oriented service requirements, network providers have to prepare multi-layer service networks. This paper deals with frame relay, ATM and IP networking services on multi-layer networks. In order to provide multiple data services, network provider needs to define and make use of client-server and interworking relationships between these networks. In this paper, we propose a service management architecture in order to efficiently manage multiple services and network resources from service point of view. The proposed service management architecture includes functionalities such as subscription management, customer-network management, communication session management, and business layer support management. Especially, it describes an information model for managing multi-layer networks by way of the interworking or client-server relationship. The proposed functionalities are modeled in accordance with the object-oriented modeling concept and implemented on a CORBA platform. The applications on the proposed architecture include VPN services and various statistical services for customers and the carrier. The realized system is to be used for Koera Telecom's high speed networks mainly for supporting Internet services.

As telecommunications companies face the rigors of competition, they soon find that their operational support systems play a critical role in providing new services faster, at lower cost and with better quality than their competitors. At TeleManagement Forum, the model for the successful service provider is 'the smooth operator' - a company whose processes and systems fully support its people to provide the best services possible at the lowest cost. Learning the importance of becoming a 'smooth operator' is hard, particularly as it requires giving up the old way of doing things - moving from an internal development environment to one that can take full advantage of 'off-the-shelf' software. The reasons for this shift include a shortage of resources, shortage of time, and the need to do business as part of a greater (and growing) global supply chain. Getting to 'smooth operator' status can be made easier with help from organizations like the TeleManagement Forum. In this paper, a twelve-step method is outlined to give pointers to service providers and their suppliers on how to make the journey successfully.

Experiment is reported of enhanced backscattering of light in binary and ternary suspensions of rutile and/or alumina particles. With a conventional CCD camera system for observing the phenomena, the angular line shape and the enhancement factor were agreed with the theoretically predicted curve and value. Observation of the angular distribution scattered at the backscattered direction supported the hypothesis proposed by Pine et al. , in which the transport mean free path of the polydisperse mixture can be expressed in terms of summing its reciprocal values weighted over the particle sizes.

A T-user uniquely decodable (UD) code {C1,C2,,CT} over an integer set {0,1,,k} with arbitrary code length is developed for a multiple-access adder channel (MAAC). Each of the T users is equipped with two codewords, one of which is zero vector. The T-user UD code is used to identify users through the MAAC. It is shown that a T(f+g+1)-user UD code with code length f+g+1 can be arranged from two given T(f)-user and T(g)-user UD codes. This idea makes it possible to construct recursively a T-user UD code for an arbitrary code length n and a positive integer k. The T-user UD code includes the Jevticode.

Feature interaction detection determines whether interactions occur or not between the new and existing telecommunication services. Most of conventional detection methods on state transition model utilize an exhaustive search. The exhaustive search is fundamentally very powerful in the sense that all interactions are exactly detected. However, it may suffer from the state explosion problem due to the exponential growth of the number of states in the model when the number of users and the number of features increase. In order to cope with this problem, we propose a new detection method using a state reduction technique. By means of a symmetric relation, called permutation symmetry, we succeed in reducing the size of the model while preserving the necessary information for the interaction detection. Experimental evaluation shows that, for practical interaction detection with three users, the proposed method achieves about 80% reduction in space and time, and is more scalable than the conventional ones especially for the increase of the number of users in the service.