Active Contour Model with Splitting Characteristics for Multiple Area Extractions and its Hardware Realization

Abstract: In this paper, a new Sampled Active Contour Model (ACM) and its hardware realization method are proposed. The proposed Sampled-ACM is a virtual closed curve with some contour points to extract a specified area in images. Forces, such as "pressure", "attraction", "repulsion" and "vibration factor" work on every contour point of the proposed Sampled-ACM. The proposed Sampled-ACM only accesses the memories on which the contour points locate, the number of the memory access is reduced, and the faster processing speed is performed than ordinal contour models such as Snakes. The proposed Sampled-ACM has characteristics which reverses direction of attraction by the basis of specific conditions and also has splitting characteristics for multiple area extractions. The proposed Sampled-ACM is realized on FPGA (Field Programmable Gate Array) to construct a real-time hardware equipments. The experimental results to confirm the fast processing abilities of the proposed Sampled-ACM are also included

Human Tracking across Heterogeneous Systems Based on Mobile Agent Technologies

In a human tracking system, expanding a monitoring range of one system is complicating the management of devices and increasing its cost. Therefore, we propose a method to realize a wide-range human tracking by connecting small systems. In this paper, we examined an agent deploy method and information contents across the heterogeneous human tracking systems. By implementing the proposed method, we can construct a human tracking system across heterogeneous systems, and the system can track a target continuously between systems

Evaluation of Program Code Caching for Mobile Agent Migrations

Abstract: Mobile agents are able to migrate among machines to achieve their tasks. This feature is attractive to design, implement, and maintain distributed systems because we can implement both client-side and server-side programming in one mobile agent. However, it involves the increase of data traffic for mobile agent migrations. In this paper, we propose program code caching to reduce the data traffic caused by mobile agent migrations. A mobile agent consists of many program codes that define a task executed in each machine they migrate; thus, the mobile agent migration involves the transfer of their program codes. Therefore, our method reduces the number of the transfer of program codes by using program code cache. We have implemented our method on a mobile agent framework called Maglog and conducted experiments on a meeting scheduling system

Dynamical Gauge-Higgs Unification in the Electroweak Theory

$SU(2)_L$ doublet Higgs fields are unified with gauge fields in the $U(3)_s \times U(3)_w$ model of Antoniadis, Benakli and Quir\'{o}s' on the orbifold $M^4 \times (T^2/Z_2)$. The effective potential for the Higgs fields (the Wilson line phases) is evaluated. The electroweak symmetry is dynamically broken to $U(1)_{EM}$ by the Hosotani mechanism. There appear light Higgs particles. There is a phase transition as the moduli parameter of the complex structure of $T^2$ is varied.Comment: 14 pages, 3 figures, v.

NMSSM in gauge-mediated SUSY breaking without domain wall problem

A problem of the gauge-mediated SUSY breaking model is its difficulty to generate a natural value of mu/Bmu, while the NMSSM is a natural framework to solve the mu/Bmu problem. The NMSSM in gauge-mediated SUSY breaking in its original form does not work well since the singlet field cannot develop a desired vacuum expectation value. It also suffers from the cosmological domain wall problem. We study an extension of the model to include additional vector-like matter, which is charged under the hidden QCD. It is shown that this simple extension solves both the problems. We study phenomenological and cosmological implications of this extended models. The lightest Higgs mass can be as large as 130-140 GeV for some model points.Comment: 15 pages; the version to be published in PL