Automatic generation of SPIN model checking code from UML activity diagram and its application to Web application design

Date of Conference: 16-18 Aug. 2011ArticleDigital Content, Multimedia Technology and its Applications (IDCTA), 2011 7th International Conference on. 139-144 (2011)conference pape

Retargetable Netlists Generation and Structural Synthesis Based on a Meta Hardware Description Language: Melasy+

Date of Conference: 16-18 April 2012ArticleInformation Technology: New Generations (ITNG), 2012 Ninth International Conference on. 827-830 (2012)conference pape

SOA-based Campus Administration Management System using Multi-layered Architecture : Campus-SIA

Articleマルチメディア通信と分散処理ワークショップ論文集. 4: 219-226 (2012)conference pape

Stability of the 7-3 Compressor Circuit for Wallace Tree. Part I

To evaluate our formal verification method on a real-size calculation circuit, in this article, we continue to formalize the concept of the 7-3 Compressor (STC) Circuit [6] for Wallace Tree [11], to define the structures of calculation units for a very fast multiplication algorithm for VLSI implementation [10]. We define the circuit structure of the tree constructions of the Generalized Full Adder Circuits (GFAs). We then successfully prove its circuit stability of the calculation outputs after four and six steps. The motivation for this research is to establish a technique based on formalized mathematics and its applications for calculation circuits with high reliability, and to implement the applications of the reliable logic synthesizer and hardware compiler [5].This work has been partially supported by the JSPS KAKENHI Grant Number 19K11821, Japan.Shinshu University, Nagano, JapanGrzegorz Bancerek and Yatsuka Nakamura. Full adder circuit. Part I. Formalized Mathematics, 5(3):367–380, 1996.Grzegorz Bancerek, Czesław Bylinski, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, Karol Pak, and Josef Urban. Mizar: State-of-the-art and beyond. In Manfred Kerber, Jacques Carette, Cezary Kaliszyk, Florian Rabe, and Volker Sorge, editors, Intelligent Computer Mathematics, volume 9150 of Lecture Notes in Computer Science, pages 261–279. Springer International Publishing, 2015. ISBN 978-3-319-20614-1. doi:10.1007/978-3-319-20615-8_17.Grzegorz Bancerek, Czesław Bylinski, Adam Grabowski, Artur Korniłowicz, Roman Matuszewski, Adam Naumowicz, and Karol Pak. The role of the Mizar Mathematical Library for interactive proof development in Mizar. Journal of Automated Reasoning, 61(1):9–32, 2018. doi:10.1007/s10817-017-9440-6.Adam Grabowski, Artur Korniłowicz, and Adam Naumowicz. Four decades of Mizar. Journal of Automated Reasoning, 55(3):191–198, 2015. doi:10.1007/s10817-015-9345-1.Naoki Iwasaki and Katsumi Wasaki. A meta hardware description language melasy for model-checking systems. In Proceedings 5th International Conference on Information Technology: New Generations (ITNG 2008), pages 273–278, 2008. doi:10.1109/ITNG.2008.135.Mayur Mehta, Vijay Parmar, and Earl Swartzlander. High-speed multiplier design using multi-input counter and compressor circuits. In Proceedings 10th IEEE Symposium on Computer Arithmetic, pages 43–50, June 1991. doi:10.1109/ARITH.1991.145532.Yatsuka Nakamura and Grzegorz Bancerek. Combining of circuits. Formalized Mathematics, 5(2):283–295, 1996.Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, I. Formalized Mathematics, 5(2):227–232, 1996.Yatsuka Nakamura, Piotr Rudnicki, Andrzej Trybulec, and Pauline N. Kawamoto. Introduction to circuits, II. Formalized Mathematics, 5(2):273–278, 1996.Jean Vuillemin. A very fast multiplication algorithm for VLSI implementation. Integration, 1(1):39–52, 1983. doi:10.1016/0167-9260(83)90005-6.Christopher Stewart Wallace. A suggestion for a fast multiplier. IEEE Transactions on Electronic Computers, EC-13(1):14–17, 1964. doi:10.1109/PGEC.1964.263830.Katsumi Wasaki. Stability of the 4-2 binary addition circuit cells. Part I. Formalized Mathematics, 16(4):377–387, 2008. doi:10.2478/v10037-008-0046-7.Katsumi Wasaki and Pauline N. Kawamoto. 2’s complement circuit. Formalized Mathematics, 6(2):189–197, 1997.Shin’nosuke Yamaguchi, Katsumi Wasaki, and Nobuhiro Shimoi. Generalized full adder circuits (GFAs). Part I. Formalized Mathematics, 13(4):549–571, 2005.657

Dynamics of Matrix-Fracture Coupling During Shale Gas Production

In this work, a dynamic permeability model for organic-rich shale matrix is constructed and implemented into a flow simulation to investigate the impact on production. Effective stress and molecular transport effects on the permeability are considered during the flow in the matrix. Using a sector model with a single hydraulically-induced fracture, we investigate the dynamic nature of fracture-matrix coupling during the first year of production. The proposed apparent permeability shows improved transport near the fracture due to adsorption capacity of the rock and molecular transport of the adsorbed phase. This fosters drainage and leads eventually to a larger cumulative production. Away from the fracture, however, within the region of depletion, sensitivity to the stress is more pronounced which may impair the local permeability and reduce the production. Overall the shale matrix typically yields more fluid than that with the constant-permeability case. When the fracture-matrix coupling is considered during the production, an infinite conductivity fracture has negligible effect on the production trends, and that production optimization efforts should focus to considerations to improve the flow rates in the matrix

Development and Evaluation of a Large-Scale Agent-Based System for Information Literacy Education - Improving the Automatic Collection of Learning Results through Template Matching

Date of Conference: 11-13 April 2011ArticleInformation Technology: New Generations (ITNG), 2011 Eighth International Conference on. 1-6 (2011)conference pape

Reports of studies supported by Grant-in-Aid for Research from the Graduate School of Biosphere Science, Hiroshima University

基盤研究サポート Grant-in-Aid for Fundamental Research ・環境ウイルスのキャラクタリゼーションに関する基礎研究…中井敏博 ・ウシの行動反応と気質関連遺伝子多型との関係…豊後貴嗣 ・クラスター構造の根を形成する植物の低リン適応特性の解明…和崎

Complex Integral

In this article, we defined complex curve and complex integral. Then we have proved the linearity for the complex integral. Furthermore, we have proved complex integral of complex curve's connection is the sum of each complex integral of individual complex curve.Yamazaki Masahiko - Shinshu University, Nagano, JapanYamazaki Hiroshi - Shinshu University, Nagano, JapanShidama Yasunari - Shinshu University, Nagano, JapanWasaki Katsumi - Shinshu University, Nagano, JapanCzesław Byliński. Basic functions and operations on functions. Formalized Mathematics, 1(1):245-254, 1990.Czesław Byliński. The complex numbers. Formalized Mathematics, 1(3):507-513, 1990.Czesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Czesław Byliński. Partial functions. Formalized Mathematics, 1(2):357-367, 1990.Czesław Byliński. Some basic properties of sets. Formalized Mathematics, 1(1):47-53, 1990.Noboru Endou, Katsumi Wasaki, and Yasunari Shidama. Definition of integrability for partial functions from R to R and integrability for continuous functions. Formalized Mathematics, 9(2):281-284, 2001.Krzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):35-40, 1990.Jarosław Kotowicz. Convergent sequences and the limit of sequences. Formalized Mathematics, 1(2):273-275, 1990.Takashi Mitsuishi, Katsumi Wasaki, and Yasunari Shidama. Property of complex functions. Formalized Mathematics, 9(1):179-184, 2001.Konrad Raczkowski and Paweł Sadowski. Real function continuity. Formalized Mathematics, 1(4):787-791, 1990.Konrad Raczkowski and Paweł Sadowski. Real function differentiability. Formalized Mathematics, 1(4):797-801, 1990.Konrad Raczkowski and Paweł Sadowski. Topological properties of subsets in real numbers. Formalized Mathematics, 1(4):777-780, 1990.Yasunari Shidama and Artur Korniłowicz. Convergence and the limit of complex sequences. Series. Formalized Mathematics, 6(3):403-410, 1997.Andrzej Trybulec. Tuples, projections and Cartesian products. Formalized Mathematics, 1(1):97-105, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990.Edmund Woronowicz. Relations defined on sets. Formalized Mathematics, 1(1):181-186, 1990

Morphology for Image Processing. Part I

In this article we defined mathematical morphology image processing with set operations. First, we defined Minkowski set operations and proved their properties. Next, we defined basic image processing, dilation and erosion proving basic fact about them [5], [8].Yamazaki Hiroshi - Shinshu University, Nagano, JapanByliński Czesław - University of Białystok, PolandWasaki Katsumi - Shinshu University, Nagano, JapanCzesław Byliński. Functions and their basic properties. Formalized Mathematics, 1(1):55-65, 1990.Czesław Byliński. Functions from a set to a set. Formalized Mathematics, 1(1):153-164, 1990.Yuzhong Ding and Xiquan Liang. Preliminaries to mathematical morphology and its properties. Formalized Mathematics, 13(2):221-225, 2005.Noboru Endou, Takashi Mitsuishi, and Yasunari Shidama. Dimension of real unitary space. Formalized Mathematics, 11(1):23-28, 2003.H. J. A. M. Heijimans. Morphological Image Operators. Academic Press, 1994.Krzysztof Hryniewiecki. Basic properties of real numbers. Formalized Mathematics, 1(1):35-40, 1990.Beata Padlewska. Families of sets. Formalized Mathematics, 1(1):147-152, 1990.P. Soille. Morphological Image Analysis: Principles and Applications. Springer, 2003.Wojciech A. Trybulec. Vectors in real linear space. Formalized Mathematics, 1(2):291-296, 1990.Zinaida Trybulec. Properties of subsets. Formalized Mathematics, 1(1):67-71, 1990