There is now a world-wide trend towards the downsizing of information systems using a number techniques, such as clientserver architecture. Consequently, enterprise networks are fast growing in terms of size and functionality. These networks need to be managed effectively. Researchers have been working on the development of management solutions for enterprise networks, using recent advances in software engineering, communication protocols, and artificial intelligence techniques. However, not much work has been published on the role of human factors in the integrated management of networks and systems. This paper presents a new Cooperative management Methodology for Enterprise Networks (CoMEN), based on Computer Supported Cooperative Work (CSCW) techniques.

In this paper, we present a new state space-based approach for the two-dimensional (2-D) frequency estimation problem which occurs in various areas of signal processing and communication problems. The proposed method begins with the construction of a state space model associated with the noiseless data which contains a summation of 2-D harmonics. Two auxiliary Hankel-block-Hankel-like matrices are then introduced and from which the two frequency components can be derived via matrix factorizations along with frequency shifting properties. Although the algorithm can render high resolution frequency estimates, it also calls for lots of computations. To alleviate the high computational overhead required, a highly parallelizable implementation of it via the principle subband component (PSC) of some appropriately chosen transforms have been addressed as well. Such a PSC-based transform domain implementation not only reduces the size of data needed to be processed, but it also suppresses the contaminated noise outside the subband of interest. To reduce the computational complexity induced in the transformation process, we also suggest that either the transform of the discrete Fourier transform (DFT) or the Haar wavelet transform (HWT) be employed. As a consequence, such an approach of implementation can achieve substantial computational savings; meanwhile, as demonstrated by the provided simulation results, it still retains roughly the same performance as that of the original algorithm.

In this paper a cyclic place-timed controlled marked graph (PTCMG), which is an extended class of a cyclic controlled marked graph (CMG), is presented as a model of discrete event systems (DESs). In a PTCMG, time constraints are attached to places instead of transitions. The time required for a marked place to be marked again is represented in terms of time constraints attached to places. The times required for an unmarked place to be marked under various controls, are calculated. The necessary and sufficient condition for a current marking to be in the admissible marking set with respect to the given forbidden condition is provided, as is the necessary and sufficient condition for a current marking to be out of the admissible marking set with respect to the forbidden condition in one transition. A maximally permissive state feedback control is synthesized in a PTCMG to guarantee a larger admissible marking set than a CMG for most forbidden state problems. Practical applications are illustrated for a railroad crossing problem and an automated guided vehicle (AGV) coordination problem in a flexible manufacturing facility.

Neural networks can be used as associative memories which can learn problems of acquiring input-output relations presented by examples. The learning time problem addresses how long it takes for a neural network to learn a given problem by a learning algorithm. As a solvable model to this problem we analyze the learning dynamics of the linear associative memoty with the least-mean-square algorithm. Our result shows that the learning time τ of the linear associative memory diverges in τ (1-ρ)-2 as the memory rate ρ approaches 1. It also shows that the learning time exhibits the exponential dependence on ρ when ρ is small.

In OSI management, we utilize a scope parameter in Common Management Information Service (CMIS) that enables us to operate multiple Managed Objects (MOs) at one CMIS operation, so that we may reduce the number of communications between a manager and an agent. The more the number of MOs increases, the harder it is to find optimal combinations of scopes. In an existing approximation algorithm for finding optimal combinations of scopes, there are restrictions on the structure of a naming tree for the algorithm to work efficiently and the lower bound of its approximation ratio, n/4, grows in proportion to the number of MOs, n. This paper proposes a new approximation algorithm that removes the restriction on the structure of a naming tree and significantly improves the approximation ratio to (1 + ln n) in the upper bound, by keeping the same time complexity as the existing algorithm.

This paper describes the effectiveness of stream-oriented data-driven scheme for achieving autonomous fault management of hyper-distributed systems such as networks based on the Telecommunications Information Networking Architecture (TINA). TINA, whose specifications are in the finalizing phase within TINA-Consortium, is aiming at achieving interoperability and reusability of telecom applications software and independent of underlying technologies. However, to actually implement TINA network, it is essential to consider the technology constraints. Especially autonomous fault management at run-time is crucial for distributed network environment because centralized control using global information is very difficult. So far many works have been done on so-called off-line management but runtime management of service failure seems immature. This paper proposes introduction of stream-oriented data-driven processors to the autonomous fault management at runtime in TINA based distributed network environment. It examines the features of distributed network applications and technology requirements to achieve fault management of those distributed applications such as effective multiprocessing of surveillance, testing, reconfiguration in addition to ordinary processing.

We have developed a management agent that adapts the delegation concept to achieve efficient network management. In conventional delegation architecture, a network management operator details management operations in an operation-script that describes management operation flow and such network management functions as event management and path tracing. The operator sends this script to agents to execute. In our delegation architecture, the operator sends only a script skeleton describing management operation flow alone; management functions are built into the agents in the form of fuction objects. This helps keep management traffic low. Each function object is designed by utilizing three operational objects: enhanced, primitive, and communication. Each enhanced operational object (EOO) provides a script skeleton with an individual network management function. A primitive operational object (POO) provides an EOO with managed object (MO) access functions. A communication operational object (COO) provides an EOO with a mechanism for accessing the functions of other remote EOOs. We have tested our design by applying it to a path tracing application, and we have measured the total data transfer size between a manager and an agent and the amount of memory usage in our agent's running environment. Evaluation of our implementation suggests that our design can be applied such network management functions as connection establishment and release, fault isolation, and service provisioning.

We study state feedback control of discrete event systems described by the Golaszewski-Ramadge model. We derive a necessary and sufficient condition for the existence of a balanced state feedback controller under partial observations.

The usage of a diagram, which we call a state fence diagram (SFD), for analyzing discrete event systems such as reactive systems, is presented. This diagram is useful for event concurrent response and scenario analysis by using its three description styles.

A switched-capacitor phase-shifter oscillator of low distortion is discussed. The dc voltage related to the amplitude of oscillation was made for an automatic gain controller. The distortion factor was less than 0.5% in the frequency range from 100 µHz to 1 Hz.

A new linearization technique of a transconductor is presented. The linearization is realized by using a differential current amplifier with an emitter-coupled pair. A specific value of the linearization parameter gives a maximally flat or an equiripple characteristic. Deviations from the theoretical characteristic can be adjusted by tuning the tail current of the emitter-coupled pair. The proposed technique is demonstrated by PSPICE simulation.

The supervisory control theory of discrete event dynamic systems was proposed in the framework of automata and formal languages. The concept of decentralized supervisory control was developed for the local supervisor Si whose concurrent operation results in the closed-loop language L (Si/G) equal to that of global supervisor, L (S/G). In this letter we extend this concept by considering the problem of optinal combination of decentralized with centralized control in case pure decentralized control happens to be inadequate. We introduce the concept of locally controllable complementary tuple and present an analytical framework for nonhomogeneous decentralized supervisory control systems.

An algorithm for extracting fundamental frequencies from duet sounds is proposed. The algorithm is based on an acoustical feature that the temporal fluctuation patterns in frequency an power are similar for harmonic components composing a sound for a single musical note played on a single instrument with a single active vibrating source. The algorithm is applied to the sounds of 153 combinations of pair-notes played by a flute duet and a violin duet. Experimental results show that the zone-wize correct identification rate by pitch name are 98% for the flute duet and 95% for the violin duet in the best cases.

The problem of non-preemptive scheduling of real-time periodic tasks with specified release times on a uniprocessor system is known as NP-hard problem. In this paper we propose a new non-preemptive scheduling algorithm and a new static scheduling strategy which use the repetitiveness and the predictability of periodic tasks in order to improve schedulabilities of real-time periodic tasks with specified release times. The proposed scheduling algorithm schedules periodic tasks by using the heuristic that precalculates if the scheduling of the selected task leads to the case that a task misses a deadline when tasks are scheduled by the non-preemptive EDF algorithm. If so, it defers the scheduling of the selected task to avoid the precalculated deadline-missing. Otherwise, it schedules the selected task in the same way as the non-preemptive EDF algorithm. Our scheduling algorithm can always find a feasible schedule for the set of periodic tasks with specified release times which is schedulable by the non-preemptive EDF algorithm. Our static sheduling strategy transforms the problem of non-preemptive scheduling for periodic tasks with specified release times into one with same release times for all tasks. It suggests dividing the given problem into two subproblems, making a non-preemptive scheduling algorithm to find two feasible subschedules for the two subproblems in the forward or backward scheduling within specific time intervals, and then combining the two feasible subschedules into a complete feasible schedule for the given problem. We present the release times as a function of periods for the efficient problem division. Finally, we show improvements of schedulabilities of our scheduling algorithm and scheduling strategy by simulation results.

Recently several dosimetric assessment procedures have been proposed to demonstrate the compliance of handheld mobile telecommuications equipment (MTE) with safety limits. However, for none of these procedures has an estimation of the overall uncertainty in assessing the maximum exposure been provided for a reasonable cross-section of potential users. This paper presents a setup and procedure based on a high-precision dosimetric scanner combined with a new phantom derived from an anatomical study. This allows the assessment of the maximum spatial peak SAR values occurring in approximately 90% of all MTE users, including children, with a precision of better than 25%. This setup and procedure therefore satisfies the requirements of the FCC, as well as those drafted by a CENELEC working group mandated by the European Union.

We demonstrate highly quick response and long distance distributed oil sensors using a newly developed eccentric core fiber (ECF). This distributed oil sensor,based on an interaction between measurand oil and evanescent-wave from the ECF, has achieved as short as 4 minutes response time by using an improved coating material and a sensing length over 17 km at a signal wavelength of 1310 nm. The observed sensitivity characteristics coincide with the calculations of the evanescent power outside the cladding and it is shown that the sensitivity can be well estimated from the amount of the outer cladding component of the evanescent power.

A new memory cell arrangement for a gigabit-scale NAND DRAM is proposed. Although the conventional NAND DRAM in which memory cells are connected in series realizes the small die size, it faces a crucial array noise problem in the 1 gigabit generation and beyond because of its inherent noise of the open bitline arrangement. By introducing the new cell arrangement to a NAND DRAM, the folded bitline scheme is realized, resulting in good noise immunity. The basic operation of the proposed folded bitline scheme was successfully verified using the 64 kbit test chip. The die size of the proposed NAND DRAM with the folded bitline scheme (F-NAND DRAM) at the 1 Gbit generation is reduced to 63% of that of the conventional 1 Gbit DRAM with the folded bitline scheme, assuming the bitlines and the wordlines are fabricated with the same pitch. The new 4/4 bitline grouping scheme in which cell data are read out to four neighboring bitlines is also introduced to reduce the bitline-to-bitline coupling noise to half of that of the conventional folded bitline scheme. The array noise of the proposed F-NAND DRAM with the 4/4 bitline grouping scheme at 1 Gbit generation is reduced to 10% of the read-out signal, while that of the conventional NAND DRAM with open bitline scheme is 29%, and that of the conventional DRAM with the folded bitline scheme is 22%.

A modified error correction/detection scheme based on the scheme by Yi and Lee is proposed. Algebraic decoding is used to perform error correction. Error detection is performed by an absolute value test. It is shown that the proposed scheme bridges the performance gap between Yi and Lee's scheme and Forney's optimal scheme.

RF integration, until recently the integration of active devices in conventional architectures suitable for discrete-component circuits, is now turning into full-integration based on new architectures developed specifically for an LSI technology. This paper reviews some of the key existing and emerging circuit techniques and discusses the serious problem of crosstalk. In order to develop miniature and low power RF transceivers, direct-conversion and monolithic VCO's will be further studied. Silicon bipolar technology will still be playing major role beyond the year 2,000, and CMOS will also be used in certain applications.

In this paper, we propose a handoff scheme with two-level priority for the reservation of handoff request calls in mobile cellular radio systems. We assume two types of mobile subscribers with different distributions of moving speed, that is, users with low average moving speed (e.g., pedestrians) and high average moving speed (e.g., people in moving cars). A fixed number of channels in each cell are reserved exclusively for handoff request calls. Out of these number of channels, some are reserved exclusively for the high speed handoff request calls. The remaining channels are shared by both the originating and handoff request calls. In the proposed scheme, both kinds of handoff request calls make their own queues. The system is modeled by a three-dimensional Markov chain. We apply the Successive Over-Relaxation (SOR) method to obtain the equilibrium state probabilities. Blocking probabilities of calls, forced termination probabilities and average queue length of handoff calls of each type are evaluated. We can make the forced termination probabilities of handoff request calls smaller than the blocking probability of originating calls. Moreover, we can make the forced termination probability of high speed handoff request calls smaller than that of the low speed ones. Necessary queue size for the two kinds of handoff request calls are also estimated.