In this study, we propose an object-based multimedia model for specifying the QoS (quality of service) requirements, such as the maximum data-dropping rate or the maximum data-delay rate. We also present a resource allocation model, called the net-profit model, in which the satisfaction of user's QoS requirements is measured by the benefit earned by the system. Based on the net-profit model, the system is rewarded if it can allocate enough resources to a multimedia delivery request and fulfill the QoS requirements specified by the user. At the same time, the system is penalized if it cannot allocate enough resources to a multimedia delivery request. We first investigate the problem of how to allocate resources efficiently, so that the QoS satisfaction is maximized. However, the net-profit may be distributed unevenly among the multimedia delivery requests. Thus, the second problem discusses how to allocate the resource efficiently so that the net-profit difference is minimized between any two multimedia requests. A dynamic programming based algorithm is proposed to find such an optimal solution with the minimum net-profit differences.

In this paper, we present a pixel-level color image sensor with efficient ambient light suppression using a modulated RGB flashlight to support a recognition system. The image sensor employs bidirectional photocurrent integrators for pixel-level demodulation and ambient light suppression. It demodulates a projected flashlight with suppression of an ambient light at short intervals during an exposure period. In the imaging system using an RGB modulated flashlight, every pixel provides innate color and depth information of a target object for color-based categorization and depth-key object extraction. We have designed and fabricated a prototype chip with 6464 pixels using a 0.35 µm CMOS process. Color image reconstruction and time-of-flight range finding have been performed for the feasibility test.

This paper describes a method for detecting multiple overlapping objects from a real-time video stream. Layered detection is based on two processes: pixel analysis and region analysis. Pixel analysis determines whether a pixel is stationary or transient by observing its intensity over time. Region analysis detects stationary regions of stationary pixels corresponding to stopped objects. These regions are registered as layers on the background image, and thus new moving objects passing through these layers can be detected. An important aspect of this work derives from the observation that legitimately moving objects in a scene tend to cause much faster intensity transitions than changes due to lighting, meteorological, and diurnal effects. The resulting system robustly detects objects at an outdoor surveillance site. For 8 hours of video evaluation, a detection rate of 92% was measured, which is higher than traditional background subtraction methods.

Through many researches on modeling and analyzing biological pathways, Petri net has recognized as a promising method for representing biological pathways. Recently, Matsuno et al. (2003) introduced hybrid functional Petri net (HFPN) for giving more intuitive and natural biological pathway modeling method than existing Petri nets. They also developed Genomic Object Net (GON) which employs the HFPN as a basic architecture. Many kinds of biological pathways have been modeled with the HFPN and simulated by the GON. This paper gives a new HFPN model of "cell cycle of fission yeast" with giving six basic HFPN components of typical biological reactions, and demonstrating the method how biological pathways can be modeled with these HFPN components. Simulation results by GON suggest a new hypothesis which will help biologist for performing further experiments.

Nonminimum phase systems are difficult to be controlled with a conventional PID-type controller because of their inherent characteristics of undershooting. A neuro-controller combined with a PID-type controller has been shown to improve the control performance of the nonminimum phase systems while maintaining stability. In this paper, we apply a multiobjective evolutionary optimization method for training the neuro-controller to reduce the undershooting of the nonminimum phase system. The computer simulation shows that the proposed multiobjective approach is very effective and suitable because it can minimize the control error as well as reduce undershooting and chattering. This method can be applied to many industrial nonminimum phase problems with ease.

When we try to solve Multiobjective Optimization Problems (MOPs) using an evolutionary algorithm, the Pareto Genetic Algorithm (Pareto GA) introduced by Goldberg in 1989 has now become a sort of standard. After the first introduction, this approach was further developed and lead to many applications. All of these approaches are based on Pareto ranking and use the fitness sharing function to maintain diversity. On the other hand in the early 50's another scheme was presented by Nash. This approach introduced the notion of Nash Equilibrium and aimed at solving optimization problems having multiobjective functions that are originated from Game Theory and Economics. Since the concept of Nash Equilibrium as a solution of these problems was introduced, game theorists have attempted to formalize aspects of the equilibrium solution. The Nash Genetic Algorithm (Nash GA), which is introduced by Sefrioui, is the idea to bring together genetic algorithms and Nash strategy. The aim of this algorithm is to find the Nash Equilibrium of MOPs through the genetic process. Another central achievement of evolutionary game theory is the introduction of a method by which agents can play optimal strategies in the absence of rationality. Not the rationality but through the process of Darwinian selection, a population of agents can evolve to an Evolutionary Stable Strategy (ESS) introduced by Maynard Smith in 1982. In this paper, we propose Game theory based Co-Evolutionary Algorithm (GCEA) and try to find the ESS as a solution of MOPs. By applying newly designed co-evolutionary algorithm to several MOPs, the first we will confirm that evolutionary game can be embodied by co-evolutionary algorithm and this co-evolutionary algorithm can find ESSs as a solutions of MOPs. The second, we show optimization performance of GCEA by applying this model to several test MOPs and comparing with the solutions of previously introduced evolutionary optimization algorithms.

Scattering of the two dimensional electromagnetic waves is studied by the infinite sequences of zeros arising on the complex plane, which just correspond to the null points of the far field pattern given as a function of the azimuthal angle θ. The convergent sequences of zeros around the point of infinity are evaluated when the scattering objects are assumed to be N-polygonal cylinders. Every edge condition can be satisfied if the locations of zeros are determined appropriately. The parameters, which allow us to calculate the exact positions of zeros, are given by the asymptotic analysis. It is also shown that there are N-directions of convergence, which tend to infinity. An illustrative example is presented.

To provide multimedia services, a server system can use a cluster of servers to serve many users concurrently. In the literature, several assignment algorithms have been proposed to assign the media objects to these servers. The popularities of the media objects may change with time, and the service provider may add new objects or delete obsolete objects. In these cases, it is necessary to execute an assignment algorithm to find a new assignment. To realize the new assignment from the current one, it is necessary to relocate some objects. In this paper, we formulate and solve this relocation problem, and our objective is to minimize the relocation time for minimal service interruption. We propose a two-stage algorithm to solve this relocation problem. In the first stage, we introduce the concept of server relabelling, and apply the Hungarian method to find the largest common assignment between the new and current assignments. In the second stage, we propose a chain relocation schedule by which every object is directly relocated from its original server to the new server without deadlock. We use computer simulation to demonstrate the effectiveness of the optimal relocation method.

The cost-effective provision of IP services requires multi-layered traffic engineering to obtain dynamic cooperation between IP and photonic layers. The effective control and management of generalized multi-protocol label-switching (GMPLS) networks is an essential part of this. Huge photonic capacities and the number of IP and photonic networks make it likely that enormous amounts of GMPLS network-related data will have to be managed in the near future. At the same time, routing burdens on individual GMPLS routers are critical because of the strong need for per-path quality of service (QoS). To solve these problems, we propose a hierarchically distributed network-management system (NMS) in which we flexibly allocate a GMPLS subnetwork to each sub-NMS and at the same time conduct QoS routing. The distributed nature of our architecture reduces the burden on the NMS as a whole and also lets us remove the routing-burden from GMPLS routers with minimum effect on management processes.

VoIP is one of the key technologies for recent telecommunication services. The quality of its services should be discussed in subjective terms. Since subjective quality assessment is time-consuming and expensive, however, objective quality assessment which estimates subjective quality without carrying out subjective quality experiments is desirable. This paper discusses the performance of the objective quality measure that was standardized as ITU-T Recommendation P.862 and clarifies the quality factors that can be evaluated with satisfactory accuracy based on it. We found that P.862 can be applied to the evaluation of coding distortion, tandeming of codecs, transmission bit-errors, packet loss, and silence compression in a codec, at least for clean Japanese speech. In addition, we propose a method of estimating the subjective quality evaluation value from objective measurement results and show the validity of this method. We also evaluate the uniqueness of objective quality assessment based on P.862 from the viewpoints of the effect of measurement noise and the variation of test speech samples, and propose how to improve the reproducibility of objective quality assessment.

Cohesion is an important software attribute, and it is one of significant criteria for assessing object-oriented software quality. Although several metrics for measuring cohesion have been proposed, there is an aspect which has not been supported by those existing metrics, that is "cohesive-part size." This paper proposes a new metric focusing on "cohesive-part size," and evaluates it in both of qualitative and quantitative ways, with a mathematical framework and an experiment measuring some Java classes, respectively. Through those evaluations, the proposed metric is showed to be a reasonable metric, and not redundant one. It can collaborate with other existing metrics in measuring class cohesion, and will contribute to more accurate measurement.

Refactoring is one of the promising techniques for improving software design by means of behavior-preserving structural transformation, and is widely taken into practice. In particular, it is frequently applied to design models represented with UML such as class diagrams. However, since UML design models includes multiple diagrams which are closely related from various views, to get behavior-preserving property, we should get the other types of design information and should handle with the propagation of the change on a diagram to the other diagrams. For example, to refactor a class diagram, we need behavioral information of methods included in the class and should also refactor diagrams which represent the behavior, such as state diagrams, activity diagrams. In this paper, we introduce refactoring on design models as transformations of a graph described by UML class diagram and action semantics. First, we define basic transformations of design models that preserve the behavior of designed software, and compose them into refactoring operations. We use Object Constraint Language (OCL) to specify when we can apply a refactoring operation. Furthermore we implement our technique on a graph transformation system AGG to support the automation of refactoring, together with evaluation mechanism of OCL expressions. Some illustrations are presented to show its effectiveness. The work is the first step to handle with refactoring on UML design models in integrated way.

To realize the hardware object which facilitates the application development in the reconfigurable computing system, a hardware module (HwModule) is proposed and implemented. To access the circuit in the HwModule from the standard PC without detailed knowledge of the hardware, an object manager (ObjectManager) is also implemented. With the help of the ObjectManager, the programmers can use the hardware objects like the usual software objects. The HwModule is applied to the image matching, and the easiness of the application development for the HwModule is confirmed.

In databases based on a multi-aspects object data model whcih enables multiple aspects of a real-world entity to be represented and to be acquired/lost dynamically, Object Migration (OM) updating membership relationships between an object and classes occurs, as the properties of the object evolve in its lifetime. We have proposed an OM behavior modeling framework using Colored Petri Nets (CPN) to analyze OM behavior. Based on the proposed framework, this paper presents a technique for constructing OM behavior models from OM constraint descriptions and class schemas as its input. The presented technique makes it easy to construct consistent and complete OM behavior models, since OM constraints are described in a simple, modular, and declarative form.

In this paper, an efficient optimization algorithm for solving the inverse problem of a two-dimensional lossless homogeneous dielectric object is investigated. A lossless homogeneous dielectric cylinder of unknown permittivity scatters the incident wave in free space and the scattered fields are recorded. Based on the boundary condition and the incident field, a set of nonlinear surface integral equation is derived. The imaging problem is reformulated into optimization problem and the steady-state genetic algorithm is employed to reconstruct the shape and the dielectric constant of the object. Numerical results show that the permittivity of the cylinders can be successfully reconstructed even when the permittivity is fairly large. The effect of random noise on imaging reconstruction is also investigated.

Genetic algorithm (GA) is a widely used numerical technique to simplify some analytical solutions in electromagnetic theory. Genetic algorithms can be combined with the geometric optics method to tackle electromagnetic scattering problems. This paper presents an extrapolation procedure, which derived, as a first step, a functional representation of the radar cross section (RCS) of three different dielectric objects that was computed via the Mie solution or the method of moments (MOM). An algorithm was employed to fit the scattering characteristics of dielectric objects at high frequencies.

Detecting the possibility of inference attacks is necessary in order to keep a database secure. Inference attacks mean that a user tries to infer the result of an unauthorized queries to the user. For method schemas, which are a formal model of object-oriented databases, it is known that the security problem against inference attacks is decidable in polynomial time in the size of a given database instance. However, when the database instance or authorization has slightly been updated, it is not desirable to check the entire database again for efficiency. In this paper, we propose several sufficient conditions for update operations to preserve the security. Furthermore, we show that some of the proposed sufficient conditions can be decided much more efficiently than the entire security check. Thus, the sufficient conditions are useful for incremental security checking.

This paper assesses the media synchronization quality of recovery control schemes from asynchrony, which are referred to as reactive control schemes here, in terms of objective and subjective measures. We deal with four reactive control techniques: skipping, discarding, shortening and extension of output duration, and virtual-time contraction and expansion. We have carried out subjective and objective assessment of the media synchronization quality of nine schemes which consist of combinations of the four techniques. The paper makes a comparison of media synchronization quality among the schemes. It also clarifies the relations between the two kinds of quality measures.

The video coding standard MPEG-4 is enabling content-based functionalities. It takes advantage of a prior decomposition of sequences into video object planes (VOP's) so that each VOP represents a semantic object. Therefore, the extraction of semantic video objects is crucial initial part. In this paper, we present an efficient region based semi-automatic segmentation system, which combines low level automatic region segmentation with interactive method for defining and tracking high level semantic video objects. The proposed segmentation system extracts accurate object boundaries using gradual region merging and bi-directional temporal boundary refinement. The system comprises of two steps: an initial object extraction step where user input in the starting frame is used to extract a semantic object; and an object tracking step where underlying regions of the semantic object are tracked and grouped through successive frames. Experiments with different types of videos show the efficiency of the proposed system in semantic object extraction.

Web Services (WS) have received significant attention recently. Delivering Quality of Service (QoS) on the Internet is a critical and significant challenge for WS community. This article proposes a Web Services Testing Framework (WSTF) for WS participates to perform WS testing. WSTF provides three main distributed components: test master, test agents and test monitor. Test master manages scenarios and generates test scripts. It initiates WS testing by sending test scripts to test agents. Test agents dynamically bind and invoke the WS. Test monitors capture synchronous/asynchronous messages sent and received, attach timestamp, and trace state change information. The benefit to use WSTF is that the user only needs to specify system scenarios based on the system requirements without needing to write test code. To validate the proposed approach, this paper used the framework to test a supply-chain system implemented using WS.