著者
野島 武敏
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.18, no.4, pp.271-284, 2008
参考文献数
35

The present author proposed 'Origami Technology', and envisages the formation of a new discipline; mathematical analysis of Origami and its development in academic applications especially in engineering use. Origami structures consisting of zigzagged faces have foldable/deployable functions as well as solidification characters. Models presented in this paper include typical foldable/deployable thin cylinders, conical-shaped membranes, circular sheets which may be folded or wrapped. These shape-changeable origami models are analytically designed by folding or creasing a flat sheet or a thin plate into a 3-dimentional shape. New types of ultra-light 3-D honeycomb core models and a newly developed core panel named "dia-core" (consisting of 2 periodically dimpled panel pieces) are also presented for use in building such as aerospace structures. The former models are designed by analyzing the helical patterns or structures often found in living organisms, because such helical structures are easily deployed due to the presence of fewer dynamic restraints. The latter are developed on purely geometrical basis. As for academic applications of Origami modeling, two examples are shown; the phyllotaxis of leaves or flowers showing helical patterns, and axial buckling and torsional buckling of cylindrical tubes and conical shells are explained by using origami modeling.
著者
岩見 真吾 佐藤 佳 小柳 義夫
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.22, no.2, pp.85-94, 2012-06-26

Recently, in order to investigate the fundamental phenomena in immunology and virology such as maintenance of immune memory, T-cell homeostasis, the relationship between aging and immunosenescence, the regulation of the adaptive immune response during viral infection, the pathogenesis of CD4^+ depletion in HIV infection, and the underlying mechanisms of leukemia, we successfully quantied lymphocyte kinetics in humanized mice through BrdUlabeling experiment. It is worth noting that our findings are the first to assess lymphocyte dynamics utilizing this technique. At first, we will briefly give an outline of the "Quantification system of lymphocyte kinetics in humanized mice" and then we will discuss about properties of the lymphocyte kinetics and utilities of our established system.
著者
杉原 厚吉
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.1, no.4, pp.280-299, 1991-12-16
被引用文献数
12

New approaches are presented to the problem of topological inconsistency caused by geometric algorithms implemented in finite-precision arithmetic. In geometric computation numerical errors often create inconsistency in topological structures and thus cause theoretically correct algorithms to fail. To overcome this problem two approaches are considered for the case of constructing the Voronoi diagram as an example. In the first approach, higher-precision arithmetic is used to construct a closed world in which topological structures are judged always precisely, and the symbolic perturbation technique is employed to avoid complicated branches of processing for degenerate cases. In the second approach, the highest priority is placed on the maintenance of topological consistency and numerical results are used as lower-priority information; the resultant algorithm is robust in the sense that inconsistency never arises and is correct in the sense that the output converges to the true solution as the precision becomes higher.
著者
永持 仁
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.8, no.1, pp.20-29, 1998-03-16

The connectivity augmentation problem asks to add to a given graph the smallest number of new edges so that the edge- (or vertex-) connectivity of the graph increases up to a specified value k. The problem is first studied by K. P. Eswaran and R. E. Tarjan in 1976, and both type of connectivity augmentation problems for k=2 are shown to be polynomially solvable. Afterwards, in 1987 T. Watanabe and A. Nakamura proved that the problem of making a given graph k-edge-connected by adding the smallest number of edges can be solved in O(k^2(kn+m)n^4) time for general k, where n and m are the number of vertices and edges in the input graph, respectively. Recently, a significantly faster O(nm log n+n^2 log^2 n) time algorithm for solving this problem is proposed by H. Nagamochi and T. Ibaraki by applying L. Lovasz's edge-splitting theorem. This note first reviews this alogorithm and then shows how to modify the algorithm to solve the edgeconnectivity augmentation problem for a graph with real-weighted edges.

1 0 0 0 OA 準結晶の数理

著者
藤原 毅夫
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.1, no.2, pp.117-134, 1991-06-14

Quasicrystals are newly discovered equiliblate systems, showing diffraction patterns of the sharp and densely distributed spots with the crystallographically disallowed symmetry. These materials open a new field of condensed matter physics. Mathematical aspects of quasicrystals are briefly reviewed, including several general methods constructing quasiperiodic systems, generalized crystallography and fractal character of electronic structures.
著者
石村 直之
出版者
日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.17, no.1, pp.14-19, 2007-03
著者
増田 直紀 巳波 弘佳 今野 紀雄
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.16, no.1, pp.2-16, 2006-03-28
被引用文献数
3

Recently, complex networks have drawn increasing interests. It is often convenient to regard this research area to be composed of studies of network structure and network functions. Studies of network structure are concerned about topological characteristics of complex networks such as the small-world and scale-free properties. Studies of network functions deal with processes and phenomena on complex networks such as virus propagation. This article is a minireview of complex networks from these dual viewpoints.