著者
住井 英二郎
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:24321982)
巻号頁・発行日
vol.17, no.4, pp.280-290, 2007-12-26 (Released:2017-04-08)
参考文献数
15

This survey presents Abadi and Gordon's spi-calculus, which is a "process calculus" (i.e., a formal language of concurrent computation) for the verification of "cryptographic protocols" (i.e., procedures for secure communication in computer networks). First, we present process calculi before the spi-calculus (CCS and the pi-calculus), introducing the notion of reaction relation and structural congruence. We then define the spi-calculus and show an example of cryptographic ptotocols, represented as a class of spi-calculus processes. After discussing the formalization of security properties (secrecy and authenticity) and multiple sessions, we conclude by referring to generalizations of the spi-calculus (Abadi and Fournet's applied pi-calculus, and a recent result by Bruno Blanchet).
著者
弓場 美裕
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.10, no.4, pp.326-330, 2000-12-15

すったもんだの挙げ句,やっとのことで年金改正法が成立した.厚生省内にプロジェクトが設置されたのは1996年の夏のことであるから,4年近くかかったことになる.1999年3月に自民党の了解を得るも,思わぬ紆余曲折があり,与党案として国会提出となったのは同年7月,そして改正法が成立したのは,なんと2000年3月という案配であった.それだけの大改正であった.厚生年金の改正スローガンは「将来の保険料負担を年収の2割程度に抑えるため,制度内容を見直す.」というものである.本稿では,まず公的年金の制度運営における数理の役割を説明し,続いて,改正案の数理的な観点からの位置付けをご紹介する.
著者
牧野 淳一郎
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.8, no.4, pp.277-287, 1998-12-15
被引用文献数
1

I overview the Fast Multipole Method (FMM) and the Barnes-Hut tree method. These algorithms evaluate mutual gravitational interaction between N particles in O(N) or O(N log N) times, respectively. I present basic algorithms as well as recent developments, such as Anderson's method of using Poisson's formula, the use of FFT, and other optimization techniques. I also summarize the current states of two algorithms. Though FMM with O(N) scaling is theoretically preferred over O(N log N) tree method, comparisons of existing implementations proved otherwise. This result is not surprizing, since the calculation cost of FMM scales as O(Np^2) where p is the order of expansion, while that of the tree method scales as O(N log Np).
著者
池田 思朗 本間 希樹 植村 誠
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.25, no.1, pp.15-19, 2015-03-25

In this paper, we show some examples of sparse modeling in astronomy. In many cases, astronomy data has sparsity. If we can utilize it, we will have better results. What is measured in astronomy is the electromagnetic wave of various wavelength. The technology used for each wavelength is different. We show three examples. For each of them, the sparse modeling plays an important role.
著者
曽 道智 茨木 俊秀
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.9, no.1, pp.12-27, 1999-03-15
被引用文献数
1

We survey the recent research in the field of cake divisions and their procedures. The question is how to divide a cake among n players, so that a certain fairness is achieved, where players have individual measures on the cake, and each player only knows his own measure. The model has very wide applications, such as dividing up the property in an estate, and even in determining the border in an international dispute. We first review mathematical definitions of various concepts of fairness. Although the existence of fair divisions is proved under some mathematical conditions, their dividing procedures are not known for all cases. We summarize several existing division procedures and classify them according to their methods and purposes. Finally, we mention some related topics and describe possible future research directions.
著者
今野 浩
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.1, no.1, pp.36-50, 1991-03-15

Recently, a remarkable progress has been made in the field of the global minimization of nonconvex functions over a polytope. The purpose of this article is to survey one of the most successful approaches in this field, namely parametric programming approaches to quasilinear nonconvex minimization problems. The problems to be discussed are: linear multiplicative programming problems, i. e., the minimization of the product of two affine functions; minimization of the sum of two linear fractional functions; minimization of concave quadratic functions and bilinear programming problems. It will be shown that a global minimum of a fairly large scale problems can be obtained efficiently by applying parametric simplex algorithms. Further, it will be shown that a convex multiplicative programming problems, i. e., the minimization of the product of two convex functions, can be solved by parametrizatioh and branch and bound techniques.
著者
岩田 覚
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.20, no.2, 2010-06-25
著者
平田 祥人
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.22, no.2, pp.105-114, 2012

In this paper, we review our recent developments of mathematical models for prostate cancer under intermittent androgen suppression. In the intermittent androgen suppression, androgen suppression, which is hormone therapy for prostate cancer, is intermittently stopped to delay the relapse of cancer. To optimize the protocol to each patient, we have proposed some mathematical models including ordinary differential equation models and partial differential equation models. Our most recent model is a three-dimensional piecewise linear model. One of the three variables of the model is for androgen dependent cancer cells and the other two variables are for androgen independent cancer cells. This piecewise linear model can not only fit clinical datasets of tumor marker called prostate specific antigen very well but also classify patients based on past time series of the tumor in a manner similar to medical doctors' classifications. We also discuss the future developments of mathematical methods for mathematical medicine including personalized treatment scheduling.
著者
薩摩 順吉 時弘 哲治
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.9, no.3, pp.236-246, 1999-09-16

Cellular automata exhibiting solitonical behavior are discussed. Then it is shown that such cellular automata are directly related to a class of nonlinear wave equations by means of the technique of "ultradiscretization". Mathematical meaning and applications to other equations of the technique are also mentioned.
著者
徳永 隆治 松本 隆 徳田 功
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.7, no.4, pp.271-282, 1997-12-15
被引用文献数
1

This paper reports a simple algorithm for reconstructing bifurcation diagrams only from time-wave forms of a parameterized family of dynamical systems, without knowing an explicit form of the dynamics and its dependence on the parameters. The algorithm consists of two steps. First, nonlinear predictors are sought using a particular class of nonlinear functions with a lot of model parameters. Second, significant parameters contributing the bifurcation are found by the principal component analysis. Using the parameterized family of nonlinear predictors, it is possible to obtain bifurcation diagram qualitatively similar to that of the original systems. The algorithm is tested against Henon equation and Rossler equation.
著者
安藤 英俊 藤木 史朗 鳥山 孝司
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.20, no.2, pp.107-116, 2010-06-25

Many Preconditioning algorithms for Krylov subspace methods are developed and well tested on parallel computing environment like PC clusters, but performance of those methods on GPU differs from those on clusters. Although incomplete LU decomposition is the most popular preconditioner for Krylov subspace methods on CPU, its implementation on GPU was never successful because of the sequential nature of the algorithm. By using C for CUDA environment, we have efficiently implemented ILU(0) on GPU. We have also implemented and evaluated various kinds of preconditioning methods for Krylov subspace solvers on GPU, including Jacobi, Red-Black Gauss-Seidel, Line-by-Line and ILU(0). ILU(0) preconditioner turned out to be most efficient and fastest among these preconditioners when solving Poisson equation.
著者
深畑 幸俊
出版者
一般社団法人日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.19, no.2, pp.84-96, 2009-06-25
被引用文献数
1

粘弾性の問題を取り扱う際に対応原理がよく用いられる.本稿では,対応原理にラプラス変換の最終値定理を併せて用いることで,粘性緩和完了後の解などが煩雑な粘弾性の計算を経ずに,弾性問題の解から直接に得られることを示す.
著者
甘利 俊一 川鍋 元明
出版者
一般社団法人 日本応用数理学会
雑誌
応用数理 (ISSN:09172270)
巻号頁・発行日
vol.6, no.2, pp.96-109, 1996
参考文献数
19
被引用文献数
10

The present paper studies estimation of the coefficient θ of a linear dependence relation y=θx between two variables x and y from n pairs (y_i, x_i), i=1, …, n, of noise-contaminated observations. This is an old problem where the maximum likelihood estimator or the least square estimator is known not to be a,symptotically optimal. A simple estimator which improves the above one is explicitly given. This is a typical example of semiparametric statistical estimation. The method of estimating functions is used to solve the problem. Information geometry is used for elucidating the set of all the estimating functions and the asymptotic efficiency of the related estimators. A fibre structure is composed on the manifold of a semiparametric model and a dual couple of parallel transports are introduced on the fibres.