Internet engineering task force (IETF) has proposed hierarchical mobile IPv6 (HMIPv6) in order to reduce a frequent location registration of a mobile node in mobile IPv6 (MIPv6). All traffics toward a mobile node must be transmitted through a MAP in HMIPv6. This brings unnecessary packet latency because of the increased processing cost of packet at the MAP. At this point, the processing cost of packet at the MAP is influenced by the packet arrival rate for a mobile node, cell mobility rate and the number of mobile nodes in MAP domain. In this paper, we analyze the MAP's performance considering the above elements. For this, we compare total cost of HMIPv6 with total cost of MIPv6 as MAP's capability after we define Markov chain model for performance analysis. Also, we define network's total profit as total cost of MIPv6 minus total cost of HMIPv6. Then, we can find optimal capability of MAP such that total profit has maximum value. Also, we use the blocking probability by the MAP's capability as performance estimation element. As a conclusion, we can observe both HMIPv6's performance by the MAP's capability and optimal capability of the MAP, and blocking probability form a relationship of trade off between them.

An improved algorithm of Guided Local Search called objective function adjustment algorithm is proposed for combinatorial optimization problems. The performance of Guided Local Search is improved by objective function adjustment algorithm using multipliers which can be adjusted during the search process. Moreover, the idea of Tabu Search is introduced into the objective function adjustment algorithm to further improve the performance. The simulation results based on some TSPLIB benchmark problems showed that the objective function adjustment algorithm could find better solutions than Local Search, Guided Local Search and Tabu Search.

Today's Internet remains faithful to its original design that dates back more than two decades. In spite of tremendous diversity in users, as well as the sheer variety of applications that it supports, it still provides a single, basic, service offering--unicast packet delivery. While this legacy architecture seemed adequate till recently, it cannot support the requirements of newer services and applications which are demanded by the growing, and increasingly sophisticated, user population. The traditional way to solve this impasse has been by using overlay networks to address individual requirements. This does not address the fundamental, underlying problem, i.e., the ossification of the Internet architecture. In this paper, we describe the design of a new Service Oriented Internet framework that enables the flexible and effective deployment of new applications and services. The framework we describe utilizes the existing IP network and presents the abstraction of a service layer that enables communication between service end-points and can better support requirements such as availability, robustness, mobility, etc., that are demanded by the newly emerging applications and services.

Let f and g be two maps from a set E into a set F such that f(x) g(x) for every x in E. Sahili [8] has shown that, if min {|f-1(z)|,|g-1(z)|}≤ n for each z∈ F, then E can be partitioned into at most 2n+1 sets E1,..., E2n+1 such that f(Ei)∩ g(Ei)= for each i=1,..., 2n+1. He also asked if 2n+1 is the best possible bound. By using Sahili's formulation of the problem in terms of the chromatic number of line digraphs, we improve the upper bound from 2n+1 to O(log n). We also investigate extended version for more than two maps.

DC motors are indispensable to improve the automotive functions. Recently, 70-100 motors are installed on luxury cars and this number is increasing year by year. With the recent demand for improved fuel economy and better equipment layout, the improvement of the motor's efficiency and the minimization of the motor size are the key to enhancing the competitive edge of the products. Adopting the high-density coil is an effective method for that, but it is accompanied by the commutation inductance rise which causes the commutation arc increase. The increase of commutation arc decreases motor life, because it causes the rise of brush/commutator wear. This report describes an arc-reducing effect obtained when capacitors are built into a commutation circuit for the purpose of reducing arcing under high commutation inductance conditions. The results of an evaluation using a equivalent commutation circuit and carbon brush/carbon flat-commutator showed that although a commutation circuit with built-in capacitor generated the same arc energy as a commutation circuit without a capacitor above a certain value of residual current, it displayed an excellent arc-reducing effect below that value of residual current.

Breaking arcs occurring between silver electrical contacts are observed in DC42 V resistive circuit using a high-speed camera. The motion and current densities of the cathode and anode spot regions are investigated for different interrupt currents (I=7 A, 10 A and 14 A). Results indicate that the arc length at which the motion of arc spots becomes stable depends on the interrupt current, and the current densities of the cathode spot region are almost constant immediately before arc extinction for each interrupt current.

Arc occurrence rates were measured for Ag contacts in DC resistive and inductive load circuits. In inductive load conditions, arc occurrence rates in general came close to 100% at around 0.4 A, the conventional minimum arc current level of Ag. In resistive load conditions, the similar results were obtained with 30 V, while arc occurrence rates close to 50% were still obtained at around 0.4 A with 14 V and 10 V. Careful attention should be paid to the term "minimum arc current" to avoid misinterpretation thereof.

Two dimensional optical fiber measurement system is used to investigate experimentally the arc motion and reignition with four different configurations of quenching chamber in an AC contactor. It demonstrates that the splitter plate arrangement has significant effect on the arc motion in arc quenching chamber, and fixing arc runner in the first and last splitter plates benefits to arc motion, and increase the dielectric recovery strength. The results are very useful to design the quenching chamber in AC contactor with high performance.

An instance of the classical stable marriage problem requires all participants to submit a strictly ordered preference list containing all members of the opposite sex. However, considering applications in real-world, we can think of two natural relaxations, namely, incomplete preference lists and ties in the lists. Either variation leaves the problem polynomially solvable, but it is known that finding a maximum cardinality stable matching is NP-hard when both variations are allowed. It is easy to see that the size of any two stable matchings differ by at most a factor of two, and so, an approximation algorithm with a factor two is trivial. A few approximation algorithms have been proposed with approximation ratio better than two, but they are only for restricted instances, such as restricting occurrence of ties and/or lengths of ties. Up to the present, there is no known approximation algorithm with ratio better than two for general inputs. In this paper, we give the first nontrivial result for approximation of factor less than two for general instances. Our algorithm achieves the ratio for an arbitrarily positive constant c, where N denotes the number of men in an input.

Arranging n points as uniformly as possible is a frequently occurring problem. It is equivalent to packing n equal and non-overlapping circles in a unit square. In this paper we generalize this problem in such a way that points are inserted one by one with uniformity preserved at every instance. Our criterion for uniformity is to minimize the gap ratio (which is the maximum gap over the minimum gap) at every point insertion. We present a linear time algorithm for finding an optimal n-point sequence with the maximum gap ratio bounded by in the 1-dimensional case. We describe how hard the same problem is for a point set in the plane and propose a local search heuristics for finding a good solution.

In this paper, the separation of heat generation and heat transfer related to temperature rise of silver palladium contact was investigated experimentally in order to predict the temperature rise of contact by the use conditions such as voltage range between 25 to 40 V, current range between 3.2 to 5.0 A and silver palladium alloy (AgPd) materials. Firstly, relationship between temperature rise of contact and supply power was discussed. The effects of heat generation and heat transfer on temperature rise were separated and quantified by least squares method. Secondly, effects of durations and integral powers of bridge and arc on temperature rise were also discussed by changing supply power. Results show that the integral power of the bridge increases when supply power increases. As the supply power increases, integral power of arc also increases. The temperature rise is dominated by integral power of bridge. Remarkable difference of bridge duration can not be seen in the five materials (AgPd30, AgPd40, AgPd50, AgPd70 and Pd). The supply power is increased, arc duration gets longer. As weight percent of Pd content increases, the effect of supply power on arc duration becomes larger. Consequently, the integral power of arc increases. This study is a basic consideration to realize methods predicting temperature rise of contact.

We proposed a method for suppressing arc ignition in mechanical contact devices using a transient current switch and a capacitor. We applied the method to conventional reed switches. For the electric circuit analysis, we clarified the momentary voltage-current characteristics at breaking operation of reed switches by FEM analysis. We could also estimate the capacitance of the contact electrodes at the metal bridge rupture by FEM analysis, and would derive the non-arcing condition using SPICE simulation. The suitable capacitor value in the transient current circuit for arc ignition suppression would be depend on the load impedance, the power supply, the time depending contact resistance R(t)s, the contact capacitance, and the minimum arc voltage and current.

Breaking arcs are generated between a pair of Cu electrical contacts in a DC 42 V/10.5 A circuit, and the arc voltage, the arc current and the time-resolved arc spectral intensities near contact surfaces are simultaneously measured. The arc temperature is calculated from some spectral intensities emitted from Cu neutral atoms using the Boltzmann plot method. The arc temperatures near the cathode and anode surfaces are measured, and the following experimental results were obtained. (1) Time evolutions of the spectral intensities and the calculated arc temperature have similar characteristics. (2) The arc temperature near the anode surface is higher than that near the cathode surface, and the temperature fluctuation near the anode surface is larger than that near the cathode. (3) Just before arc extinction, the arc temperature near the cathode surface is almost constant for many breaking operations but the arc temperature near the anode surface varies.

This letter proposes a fast k nearest neighbors search algorithm based on the wavelet transform. This technique exploits the important information of the approximation coefficients of the transform coefficient vector, from which we obtain two crucial inequalities that can be used to reject those vectors for which it is impossible to be k nearest neighbors. The computational complexity for searching for k nearest neighbors can be largely reduced. Experimental results on texture classification verify the effectiveness of our algorithm.

Anode activity in vacuum arc plays a very important role in both characteristics of vacuum arc and the interruption capacity of vacuum interrupters. In this paper, the transient thermal processes of anode in vacuum arc in a half of arc current cycle with frequency of 50 Hz are simulated by finite element analysis software, ANSYS. Some important phenomena of anode, e.g., the melt and solidification, mass loss due to evaporation, are investigated.

In this letter, a method estimating the intercell carrier frequency-offset (CFO) in orthogonal frequency division multiplexing (OFDM)-based cellular systems is proposed for the user's equipment (UE), especially at the cell boundary, in downlink channels. After describing a new method of deriving the intercell CFO from the signals received by adjacent base stations (BSs), we propose a cell-searching method using the estimated CFOs. It is shown by computer simulation that the proposed methods can uniquely estimate the intercell CFOs and identify the target BS with a high detection probability at the UE.

Developing embedded parallel image processing applications is usually a very hardware-dependent process, often using the single instruction multiple data (SIMD) paradigm, and requiring deep knowledge of the processors used. Furthermore, the application is tailored to a specific hardware platform, and if the chosen hardware does not meet the requirements, it must be rewritten for a new platform. We have proposed the use of design space exploration [9] to find the most suitable hardware platform for a certain application. This requires a hardware-independent program, and we use algorithmic skeletons [5] to achieve this, while exploiting the data parallelism inherent to low-level image processing. However, since different operations run best on different kinds of processors, we need to exploit task parallelism as well. This paper describes how we exploit task parallelism using an asynchronous remote procedure call (RPC) system, optimized for low-memory and sparsely connected systems such as smart cameras. It uses a futures [16]-like model to present a normal imperative C-interface to the user in which the skeleton calls are implicitly parallelized and pipelined. Simulation provides the task dependency graph and performance numbers for the mapping, which can be done at run time to facilitate data dependent branching. The result is an easy to program, platform independent framework which shields the user from the parallel implementation and mapping of his application, while efficiently utilizing on-chip memory and interconnect bandwidth.

The most powerful channel coding schemes, namely those based on turbo codes and low-density parity-check (LDPC) Gallager codes, have in common the principle of iterative decoding. However, the relative coding structures and decoding algorithms are substantially different. This paper presents a 2048-bit, rate-1/2 soft decision decoder for a new class of codes known as Turbo Gallager Codes. These codes are turbo codes with properly chosen component convolutional codes such that they can be successfully decoded by means of the decoding algorithm used for LDPC codes, i.e., the belief propagation algorithm working on the code Tanner graph. These coding schemes are important in practical terms for two reasons: (i) they can be encoded as classical turbo codes, giving a solution to the encoding problem of LDPC codes; (ii) they can also be decoded in a fully parallel manner, partially overcoming the routing congestion bottleneck of parallel decoder VLSI implementations thanks to the locality of the interconnections. The implemented decoder can support up to 1 Gbit/s data rate and performs up to 48 decoding iterations ensuring both high throughput and good coding gain. In order to evaluate the performance and the gate complexity of the decoder VLSI architecture, it has been synthesized in a 0.18 µm standard-cell CMOS technology.

Micromobility management is a key issue for the deployment of broadband mobile communication services. The packet loss during handover and the handover latency need to be minimized to maintain the high quality of these services. We have previously proposed a mobility management scheme that addresses this issue in wide-area mobile networks that employed hierarchical multiple mobility management routers (Mobility Anchor Points or MAPs). Our scheme directs a Mobile Terminal (MT) to a suitable MAP to fully minimize packet loss during handover, and handover latency of the MTs. In our previous work, we confirmed the effectiveness of our scheme using a simple tree network. Actual networks however, always have densely meshed topologies to provide some redundancy for the elimination of single points of failure. In such networks, it is difficult to deduce the relationships between the MAPs, and this makes it difficult for our scheme to select a suitable MAP for an MT, because the selection is performed using both the MT's smoothed speed and the relationships existing between the MAPs located above the Access Router (AR), to which the MT is connected. In this paper, we propose a method to overcome this problem, by autonomously adjusting the selection criteria that are individually configured for use at a particular AR, and we evaluate this method using simulation experiments. The results show that our mobility management scheme works well in densely meshed networks using the proposed additional method.

In this letter, we study the problem of designing an efficient power and bit allocation scheme in the context of a hierarchical image transmission system based on an embedded multi-carrier modulation (EMCM) scheme over digital subscriber line. Authors describe a novel algorithm that performs power minimization under bit rate constraint and QoS requirement. It is based on the Hughes-Hartogs algorithm, and successively allocates the bits of the high, then low priority data streams. Simulations that assess the performance of the proposed algorithm are also provided and discussed; they demonstrate the interest of the proposed scheme.