An approximation algorithm dependent on edge-coloring number for minimum maximal matching problem

We consider the minimum maximal matching problem, which is NP-hard (Yannakakis and Gavril (1980) [18]). Given an unweighted simple graph G=(V,E), the problem seeks to find a maximal matching of minimum cardinality. It was unknown whether there exists a non-trivial approximation algorithm whose approximation ratio is less than 2 for any simple graph. Recently, Z. Gotthilf et al. (2008) [5] presented a -approximation algorithm, where c is an arbitrary constant.In this paper, we present a -approximation algorithm based on an LP relaxation, where χ^′(G) is the edge-coloring number of G. Our algorithm is the first non-trivial approximation algorithm whose approximation ratio is independent of |V|. Moreover, it is known that the minimum maximal matching problem is equivalent to the edge dominating set problem. Therefore, the edge dominating set problem is also -approximable. From edge-coloring theory, the approximation ratio of our algorithm is , where Δ(G) represents the maximum degree of G. In our algorithm, an LP formulation for the edge dominating set problem is used. Fujito and Nagamochi (2002) [4] showed the integrality gap of the LP formulation for bipartite graphs is at least . Moreover, χ^′(G) is Δ(G) for bipartite graphs. Thus, as far as an approximation algorithm for the minimum maximal matching problem uses the LP formulation, we believe our result is the best possible.     

Direct Ray Tracing of Phong Tessellation

There are two major ways of calculating ray and parametric surface intersections in rendering. The first is through the use of tessellated triangles, and the second is to use parametric surfaces together with numerical methods such as Newton's method. Both methods are computationally expensive and complicated to implement. In this paper, we focus on Phong Tessellation and introduce a simple direct ray tracing method for Phong Tessellation. Our method enables rendering smooth surfaces in a computationally inexpensive yet robust way.     

A three-dimensional shape memory alloy microelectrode with clippingstructure for insect neural recording

A microelectrode, with clipping structure for neural recording from a free-moving insect, was designed and fabricated using a shape memory alloy (SMA) thin film. The SMA thin films (titanium nickel; Ti-48 at.%Ni) are deposited by RF magnetron sputtering and patterned by HF-HNO ₃ wet etching. The transformation temperatures of the SMA thin films were measured at 54°C (A*) and 50°C (M*). The SMA microelectrode consists of a “hook” structure (720 μm×480 μm) and two “C”-shape probes (600 μm×70 μm). The electrode impedance is about 5 kΩ at 1 kHz. The desired three-dimensional (3D) shape is given to the electrode by a bonded wire. The clinging force of the electrode to the nerve is enhanced by the 3-D structures. The SMA microelectrode can clip a nerve cord tightly. The damages of the nerve by thermal actuation of the clip are not observed by physiological analysis. The neural activity from a living insect was successfully recorded with this SMA microelectrode     

A knowledge assimilation method for logic databases

In this paper we consider a deductive question-answering system for relational databases as a logic database system, and propose a knowledge assimilation method suitable for such a system. The concept of knowledge assimilation for deductive logic is constructed in an implementable form based on the notion of amalgamating object language and metalanguage. This concept calls for checks to be conducted on four subconcepts, provability, contradiction, redundancy, independency, and their corresponding internal database updates. We have implemented this logic database knowledge assimilation program in PROLOG, a logic programming language, and have found PROLOG suitable for knowledge assimilation implementation.     

Object oriented programming in Concurrent Prolog

It is shown that the basic operations of object-oriented programming languages — creating an, object, sending and receiving messages, modifying an object’s state, and forming class-superclass hierarchies — can be implemented naturally in Concurrent Prolog. In addition, a new object-oriented programming paradigm, called incomplete messages, is presented. This paradigm subsumes stream communication, and greatly simplifies the complexity of programs defining communication networks and protocols for managing shared resources. Several interesting programs are presented, including a multiple-window manager. All programs have been developed and tested using the Concurrent Prolog interpreter described in.¹⁾     

Flood Management in Japan—From Rivers to Basins

Abstract

The River Commission of the Ministry of Construction in Japan recommended a basin response to floods in its December 2000 Interim Report to Minister of Construction. This is practically an official declaration of the policy accepting inundation in habited areas. By this policy shift, it is anticipated that more basin response measures and non-structural measures against floods will be promoted to complement structural measures such as continuous levees and dams. Such a policy is not new in the world but is a significant governmental move in Japan, a densely populated, highly developed, and highly flood hazardous country. Although living with floods is a universal coping strategy, the implementation of measures should be different from region to region reflecting region's nature and socio-economic conditions. This paper reviews the flood fighting history of Japan and her statutory evolution against floods and shows the process by which the ever-increasing flood damage potential and the recent increase of flood damages necessitated the official move in flood control management from rivers to basins.     

A facile synthesis of hydro- and vinyl-functionalized di- and tetrasiloxanes and polyaddition via hydrosilylation

Summary Hydro- and vinyl-bifunctionalized di- or tetrasiloxane were synthesized by degradative cleavage of functional cyclic siloxanes with methyllithium followed by quenching with a functional chlorosilane, or by ring-opening of hexamethylcyclotrisiloxane (D₃) by functional alkyllithium followed by quenching with a functional chlorosilane. These bifunctionalized siloxanes were used as monomers in polyaddition with transition metal catalysts.     

Impurity effect on Kramer-Pesch core shrinkage ins-wave vortex and chiralp-wave vortex

The low-temperature shrinking of the vortex core (Kramer-Pesch effect) is studied for an isolated single vortex for chiral p-wave and s-wave superconducting phases. The effect of nonmagnetic impurities on the vortex core radius is numerically investigated in the Born limit by means of a quasiclassical approach. It is shown that in the chiral p-wave phase the Kramer-Pesch effect displays a certain robustness against impurities owing to a specific quantum effect, while the s-wave phase reacts more sensitively to impurity scattering. This suggests chiral p-wave superconductors as promising candidates for the experimental observation of the Kramer-Pesch effect.     

First principles total energy studies of the adsorption of germane on Ge(001)-c(2 × 4)

We perform first principles total energy calculations to study the energetics, and the atomic structure of the adsorption of germane (GeH₄) molecules on the Ge(001)-c(2 × 4) surface. The adsorption of a GeH₄ unit occurs after its dissociation into a germanium trihydride (GeH₃) and a hydrogen atom and a subsequent decomposition into a germanium dihydride (GeH₂) subunit and H atoms. Consequently, we first consider the adsorption of GeH₂ in two different configurations; the on-dimer and the intra-row geometries. Similar to the adsorption of SiH₂ and GeH₂ on Si(001), it is found that the on-dimer site is more stable than the intra-row geometry by 0.13 eV. However, in the adsorption of a GeH₂ fragment together with two H atoms we find that the intra-row geometry is energetically more favorable, again, similar to the adsorption of SiH₂ and GeH₂ (plus two H atoms) on the Si(001) surface.