ABSTRACT We present a new derivation of efficient algorithms for a class of optimization problems... more ABSTRACT We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the specification to allow for weight functions with accumulation, which is particularly useful when the weight of each element depends on adjacent elements. This extension of weight functions enables us to treat more interesting optimization problems such as a variant of the maximum segment sum problem and the fair bonus distribution problem. The complexity of the derived algorithm is linear with respect to the size of the input data.
We have proposed a model of periodic axial magnetized hollow tube for atom guidance (1999 Opt. Co... more We have proposed a model of periodic axial magnetized hollow tube for atom guidance (1999 Opt. Commun. 160 72-4). In the present paper, an analytic solution of the magnetic field inside the tube is obtained and the transport efficiency of the cold atoms in the magnetic tube at different tube intensities of magnetization is discussed. The effect of the curvature of magnetic tube on the atom transport efficiency is also considered. We have found that the tube has a cooling effect on the transverse temperature of the transported atoms.
Proceedings of the 29th Annual Acm Symposium, Mar 24, 2014
ABSTRACT The All Nearest Smaller Values (ANSV) problem is an important problem for parallel progr... more ABSTRACT The All Nearest Smaller Values (ANSV) problem is an important problem for parallel programming as it can be used to solve several problems and is one of the phases of several other parallel algorithms. We formally develop by construction a functional parallel program for solving the ANSV problem using the theory of Bulk Synchronous Parallel (BSP) homomorphisms within the Coq proof assistant. The performances of the Bulk Synchronous Parallel ML program obtained from Coq is compared to a version derived without software support (pen-and-paper) and implemented using the Orléans Skeleton Library of algorithmic skeletons, and to a (unproved correct) direct implementation of the BSP algorithm of He and Huang.
We report a new mixed methyl-fluoroalkyl (Rf) 3,5-substituted pyrazole, PzRf,CH3, with Rf=C2F5. A... more We report a new mixed methyl-fluoroalkyl (Rf) 3,5-substituted pyrazole, PzRf,CH3, with Rf=C2F5. An X-ray structural comparison of PzRf,CH3 (Rf=CF3 and C2F5) reveals a similar boat-type H-bonded tetrameric architecture, dominated by the 3,5 tautomers. The tetramers compactness could be compared by computing the volume of the tetrahedron defined by the geometric centers of the four pyrazole rings. Using this criterion the C2F5 group is found to induce a tighter intratetrameric packing relative to CF3, in addition to exhibiting a possibly higher degree of N–H proton delocalization.The new TpRf,CH3 (Rf=C2F5) sodium scorpionate is also reported. The X-ray structure of NaTpC2F5,CH3(H2O) shows discrete mononuclear units. The Na-coordinated H2O exhibits weak, 2.6Å intermolecular Na–O–H···F contacts leading to the formation of a head-to-tail chain assembly. In contrast, the NaTpCF3,CH3 (H2O) complex forms dimers in solid-state, supported by Na-bridging water ligands and intermolecular Na···F interactions.The presence of metal-bonded H2O in the sodium complex of TpC2F5,CH3 as well as the formation of discrete complexes when CF3 is replaced by C2F5 in TpRf,CH3 reflect both the strong σ electronic acceptor nature of the ligand and its enhanced steric bulkiness.
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP '13, 2013
ABSTRACT We introduce a lambda calculus λTFG for transformations of finite graphs by generalizing... more ABSTRACT We introduce a lambda calculus λTFG for transformations of finite graphs by generalizing and extending an existing calculus UnCAL. Whereas UnCAL can treat only unordered graphs, λTFG can treat a variety of graph models: directed edge-labeled graphs whose branch styles are represented by monads T. For example, λTFG can treat unordered graphs, ordered graphs, weighted graphs, probability graphs, and so on, by using the powerset monad, list monad, multiset monad, probability monad, respectively. In λTFG, graphs are considered as extension of tree data structures, i.e. as infinite (regular) trees, so the semantics is given with bisimilarity. A remarkable feature of UnCAL and λTFG is structural recursion for graphs, which gives a systematic programming basis like that for trees. Despite the non-well-foundedness of graphs, by suitably restricting the structural recursion, UnCAL and λTFG ensures that there is a termination property and that all transformations preserve the finiteness of the graphs. The structural recursion is defined in a "divide-and-aggregate" way; "aggregation" is done by connecting graphs with ε-edges, which are similar to the ε-transitions of automata. We give a suitable general definition of bisimilarity, taking account of ε-edges; then we show that the structural recursion is well defined with respect to the bisimilarity.
ATL is a language for describing model transformations currently in uni-direction. In our previou... more ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form can be bidirectionalized and have implemented a system called GRoundTram system for bidirectional graph transformations. We say a transformation t is bidirectionalized when we obtain a backward transformation t′ so that the pair (t,t′) of transformations satisfies certain well-behavedness properties. Bidirectional model transformation is used to reflect the changes in the target model back to the source model, and vice versa. In this paper, as a first step toward realizing practical bidirectional model transformations, we present bidirectionalization of core part of the ATL by encoding it in the UnQL language, which is used as a transformation language in the GRoundTram system. We give the algorithm for the encoding, based on which we have implemented the system for bidirectionalizing the core ATL in OCaml language.
The measurement resolution of an atomic force microscope (AFM) is largely dependent on the radius... more The measurement resolution of an atomic force microscope (AFM) is largely dependent on the radius of the tip. Meanwhile, when using AFM to study nanoscale surface properties, the value of the tip radius is needed in calculations. As such, estimation of the tip radius is important for analyzing results taken using an AFM. In this study, a geometrical model created by scanning a step structure with an AFM tip was developed. The tip was assumed to have a hemispherical cone shape. Profiles simulated by tips with different scanning radii were calculated by fast Fourier transform (FFT). By analyzing the influence of tip radius variation on the spectra of simulated profiles, it was found that low-frequency harmonics were more susceptible, and that the relationship between the tip radius and the low-frequency harmonic amplitude of the step structure varied monotonically. Based on this regularity, we developed a new method to characterize the radius of the hemispherical tip. The tip radii estimated with this approach were comparable to the results obtained using scanning electron microscope imaging and blind reconstruction methods.
ABSTRACT We present a new derivation of efficient algorithms for a class of optimization problems... more ABSTRACT We present a new derivation of efficient algorithms for a class of optimization problems called maximum marking problems. We extend the class of weight functions used in the specification to allow for weight functions with accumulation, which is particularly useful when the weight of each element depends on adjacent elements. This extension of weight functions enables us to treat more interesting optimization problems such as a variant of the maximum segment sum problem and the fair bonus distribution problem. The complexity of the derived algorithm is linear with respect to the size of the input data.
We have proposed a model of periodic axial magnetized hollow tube for atom guidance (1999 Opt. Co... more We have proposed a model of periodic axial magnetized hollow tube for atom guidance (1999 Opt. Commun. 160 72-4). In the present paper, an analytic solution of the magnetic field inside the tube is obtained and the transport efficiency of the cold atoms in the magnetic tube at different tube intensities of magnetization is discussed. The effect of the curvature of magnetic tube on the atom transport efficiency is also considered. We have found that the tube has a cooling effect on the transverse temperature of the transported atoms.
Proceedings of the 29th Annual Acm Symposium, Mar 24, 2014
ABSTRACT The All Nearest Smaller Values (ANSV) problem is an important problem for parallel progr... more ABSTRACT The All Nearest Smaller Values (ANSV) problem is an important problem for parallel programming as it can be used to solve several problems and is one of the phases of several other parallel algorithms. We formally develop by construction a functional parallel program for solving the ANSV problem using the theory of Bulk Synchronous Parallel (BSP) homomorphisms within the Coq proof assistant. The performances of the Bulk Synchronous Parallel ML program obtained from Coq is compared to a version derived without software support (pen-and-paper) and implemented using the Orléans Skeleton Library of algorithmic skeletons, and to a (unproved correct) direct implementation of the BSP algorithm of He and Huang.
We report a new mixed methyl-fluoroalkyl (Rf) 3,5-substituted pyrazole, PzRf,CH3, with Rf=C2F5. A... more We report a new mixed methyl-fluoroalkyl (Rf) 3,5-substituted pyrazole, PzRf,CH3, with Rf=C2F5. An X-ray structural comparison of PzRf,CH3 (Rf=CF3 and C2F5) reveals a similar boat-type H-bonded tetrameric architecture, dominated by the 3,5 tautomers. The tetramers compactness could be compared by computing the volume of the tetrahedron defined by the geometric centers of the four pyrazole rings. Using this criterion the C2F5 group is found to induce a tighter intratetrameric packing relative to CF3, in addition to exhibiting a possibly higher degree of N–H proton delocalization.The new TpRf,CH3 (Rf=C2F5) sodium scorpionate is also reported. The X-ray structure of NaTpC2F5,CH3(H2O) shows discrete mononuclear units. The Na-coordinated H2O exhibits weak, 2.6Å intermolecular Na–O–H···F contacts leading to the formation of a head-to-tail chain assembly. In contrast, the NaTpCF3,CH3 (H2O) complex forms dimers in solid-state, supported by Na-bridging water ligands and intermolecular Na···F interactions.The presence of metal-bonded H2O in the sodium complex of TpC2F5,CH3 as well as the formation of discrete complexes when CF3 is replaced by C2F5 in TpRf,CH3 reflect both the strong σ electronic acceptor nature of the ligand and its enhanced steric bulkiness.
Proceedings of the 15th Symposium on Principles and Practice of Declarative Programming - PPDP '13, 2013
ABSTRACT We introduce a lambda calculus λTFG for transformations of finite graphs by generalizing... more ABSTRACT We introduce a lambda calculus λTFG for transformations of finite graphs by generalizing and extending an existing calculus UnCAL. Whereas UnCAL can treat only unordered graphs, λTFG can treat a variety of graph models: directed edge-labeled graphs whose branch styles are represented by monads T. For example, λTFG can treat unordered graphs, ordered graphs, weighted graphs, probability graphs, and so on, by using the powerset monad, list monad, multiset monad, probability monad, respectively. In λTFG, graphs are considered as extension of tree data structures, i.e. as infinite (regular) trees, so the semantics is given with bisimilarity. A remarkable feature of UnCAL and λTFG is structural recursion for graphs, which gives a systematic programming basis like that for trees. Despite the non-well-foundedness of graphs, by suitably restricting the structural recursion, UnCAL and λTFG ensures that there is a termination property and that all transformations preserve the finiteness of the graphs. The structural recursion is defined in a "divide-and-aggregate" way; "aggregation" is done by connecting graphs with ε-edges, which are similar to the ε-transitions of automata. We give a suitable general definition of bisimilarity, taking account of ε-edges; then we show that the structural recursion is well defined with respect to the bisimilarity.
ATL is a language for describing model transformations currently in uni-direction. In our previou... more ATL is a language for describing model transformations currently in uni-direction. In our previous work we have shown that transformations of graph structures given in some form can be bidirectionalized and have implemented a system called GRoundTram system for bidirectional graph transformations. We say a transformation t is bidirectionalized when we obtain a backward transformation t′ so that the pair (t,t′) of transformations satisfies certain well-behavedness properties. Bidirectional model transformation is used to reflect the changes in the target model back to the source model, and vice versa. In this paper, as a first step toward realizing practical bidirectional model transformations, we present bidirectionalization of core part of the ATL by encoding it in the UnQL language, which is used as a transformation language in the GRoundTram system. We give the algorithm for the encoding, based on which we have implemented the system for bidirectionalizing the core ATL in OCaml language.
The measurement resolution of an atomic force microscope (AFM) is largely dependent on the radius... more The measurement resolution of an atomic force microscope (AFM) is largely dependent on the radius of the tip. Meanwhile, when using AFM to study nanoscale surface properties, the value of the tip radius is needed in calculations. As such, estimation of the tip radius is important for analyzing results taken using an AFM. In this study, a geometrical model created by scanning a step structure with an AFM tip was developed. The tip was assumed to have a hemispherical cone shape. Profiles simulated by tips with different scanning radii were calculated by fast Fourier transform (FFT). By analyzing the influence of tip radius variation on the spectra of simulated profiles, it was found that low-frequency harmonics were more susceptible, and that the relationship between the tip radius and the low-frequency harmonic amplitude of the step structure varied monotonically. Based on this regularity, we developed a new method to characterize the radius of the hemispherical tip. The tip radii estimated with this approach were comparable to the results obtained using scanning electron microscope imaging and blind reconstruction methods.
Uploads