Vitit Kantabutra - Academia.edu (original) (raw)

Papers by Vitit Kantabutra

Research paper thumbnail of Intentionally Linked Entities

This chapter introduces the Intentionally Linked Entities (ILE) database system and the possibili... more This chapter introduces the Intentionally Linked Entities (ILE) database system and the possibility of using ILE to more efficiently and accurately manage data in health care information systems. ILE links data entities in a more robust and efficient way than the relational database system. ILE also stores data in a more organized fashion than the relational, tabular NoSQL database systems and the graph database system, and it is capable of expressing more general relationships among data entities than the object-oriented database (OODB) system. All these positive qualities of ILE present the possibility of improving the reliability and correctness of health care databases, and may lead to improved and more efficient patient care and health care database analysis. This chapter includes an example that illustrates how ILE can be used for an epidemiological database, and includes a comparison of ILE as applied to electronic health record (her) representation with two other nonrelational approaches to storing and managing EHRs.

Research paper thumbnail of Towards Reliable Convergence in the Training of Neural Networks - The Streamlined Glide Algorithm and the LM Glide Algorithm

MLMTA, 2006

Multilayer perceptron neural networks continue to be very useful in many fields. Unfortunately tr... more Multilayer perceptron neural networks continue to be very useful in many fields. Unfortunately training these networks is still a major problem due to lack of convergence. This converge problem stems from the fact that the error curve has vast flat regions, making even higher-order algorithms move the network weights very slowly. In an ongoing series of papers including this one we propose a new class of training algorithms which is a promising solution to this non-convergence problem. These algorithms, called the Glide Algorithms, are based on the simple idea of changing the weights quickly in flat regions. This paper presents a streamlined version of the basic Glide Algorithm and a new version that incorporates Levenberg-Marquardt type moves. According to experimental results obtained so far both algorithms have a 100% convergence rate with relatively low standard deviation in the convergence time.

Research paper thumbnail of Area- and Power-Reduced Standard-Cell Spanning Tree Adders

Abstract. This paper presents new fast, low-cost Spanning Tree adders for double-precision mantis... more Abstract. This paper presents new fast, low-cost Spanning Tree adders for double-precision mantissas (IEEE 754-floating point standard). The new adders are modifications of conventional Spanning Tree adders. The improvements in the proposed circuits are made possible by replacing high power and area consuming block summation units used in the conventional architectures with newly designed low-area and low-power modules. A 56-bit adder designed as described here and fabricated using AMS 0.35mm CMOS Standard ...

Research paper thumbnail of Fast, low-cost adders using carry-strength signals

Research paper thumbnail of High-radix CORDIC for vector rotation with pipelined FPGA implementation

Abstract We present a new, mixed-radix (radix-4/radix-2) CORDIC algorithm for vector rotation and... more Abstract We present a new, mixed-radix (radix-4/radix-2) CORDIC algorithm for vector rotation and an efficient, pipelined implementation in Atmel's AT40K technology. Using only 3 radix-4 stages and one radix-2 stage, a sample rotator using this new algorithm achieves in 4 clock cycles the same accuracy that a conventional (radix-2) rotator would achieve in 7 cycles, while each cycle is almost the same speed as that of a conventional rotator. This sample rotator attains 12 bits of accuracy externally, while internally 17 bits of accuracy is ...

Research paper thumbnail of A lower bound on the path length of binary trees

Research paper thumbnail of The movements of multilink robot arms in two-dimensional regions (algorithms, complexity theory, robotics, motion planning, mover's problem)

Problems related to the movements of multilink robot arms in two dimensions are considered. A rob... more Problems related to the movements of multilink robot arms in two dimensions are considered. A robot arm is constructed from n(n > O) links, or straight-line segments, joined together end-to-end by freely rotating joints so that the links are allowed to cross each other. The author presents an algorithm, requiring O(n) computation time, which moves an arm in a circle to any reachable configuraion in O(n) moves. Also given is an O(n) computation time algorithm that computes all the regions reachable by the joints of such an arm.

Research paper thumbnail of A linear-time near-optimum-length triangulation algorithm for convex polygons

Journal of Computer and System Sciences, Oct 1, 1994

This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n ... more This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n is the number of sides of the input polygon. The resulting triangulation is guaranteed to be of a total length that is only a constant factor of the shortest possible.

Research paper thumbnail of Design of 3:1 multiplexer standard cell

Electronics Letters, 2000

the thetmal and electrical system, the bias heating can bc replicated on a capacitor in thc elect... more the thetmal and electrical system, the bias heating can bc replicated on a capacitor in thc electric circuit. In Fig. 1, the voltage across the capacitor CO can be written as where Thus, if a replica of bias heating can be generated on capacitor CO, which can be used to cancel the bias-heating effect. Thus, Io and C, should be chosen such that eqn. 6 is satisfied. The ratio of the current and the capacitance, lo/Co, can be determined from the given parameters of the microbolometer.

Research paper thumbnail of Fast and energy-efficient Manchester carry-bypass adders

IEE proceedings, 2004

A new modified Manchester carry chain (MCC) is presented. The objective is to reduce the carry pr... more A new modified Manchester carry chain (MCC) is presented. The objective is to reduce the carry propagation delay in the chain obtaining a layout-oriented architecture. The modification provides bypass (carry-skip) routes for the carry to propagate through quickly, avoiding long carry propagation paths that go through the entire carry chain. When realised using AMS 0.35 mm 2poly 3-metal 3.3V CMOS technology (CSD), a 32-bit adder designed as described here shows a computational delay of about 2.2 ns and an energy dissipation of only 27 pJ. This represents a significant improvement in terms of energy-delay product with respect to both conventional MCC adders and newer adder structures.

Research paper thumbnail of On hardware for computing exponential and trigonometric functions

IEEE Transactions on Computers, Mar 1, 1996

This paper presents new, fast hardware for computing the exponential function, sine, and cosine. ... more This paper presents new, fast hardware for computing the exponential function, sine, and cosine. The main new idea is to use low-precision arithmetic components to approximate high precision computations, and then to correct very quickly the approximation error periodically so that the effect is to get high precision computation at near low-precision speed. The algorithm used in the paper is a nontrivial modification of the well-known CORDIC algorithm, and might be applicable to the computation of other functions than the ones presented. index Terms-Exponential function, trigonometric functions, elementary functions, transcendental functions, CORDIC, division by convergence, high-precision VLSl computer arithmetic hardware, real-time graphics, navigation, control systems.

Research paper thumbnail of An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular Polygons

FCS, 2009

A refill cartridge for a wet electrophotographic printer. The refill cartridge, for supplying ink... more A refill cartridge for a wet electrophotographic printer. The refill cartridge, for supplying ink to an ink cartridge fixed in a printer main body having a hollow area therein, includes: a case having an air hole and an ink supply hole, for detachable installation in the hollow area; a disk slidably mounted within the case; a spring for elastically biasing the disk toward the ink supply hole; and an ink supply hole plug capable of opening and closing the ink supply hole.

Research paper thumbnail of Using the Newly-created ILE DBMS to Better Represent Temporal and Historical GIS Data

Transactions in Gis, Jun 29, 2010

This article introduces a type of DBMS called the Intentionally-Linked Entities (ILE) DBMS for us... more This article introduces a type of DBMS called the Intentionally-Linked Entities (ILE) DBMS for use as the basis for temporal and historical Geographical Information Systems. ILE represents each entity in a database only once, thereby mostly eliminating redundancy and ...

Research paper thumbnail of A State Assignment Approach to Asynchronous

Abstracf-We present a new algorithm for state assignment in asynchronous circuits so that for eac... more Abstracf-We present a new algorithm for state assignment in asynchronous circuits so that for each circuit state transition, only one (secondary) state variable switches. No intermediate unstable states are used. The resultant circuits operate at optimum speed in terms of the number of transitions made and use only static CMOS gates. By reducing the number of switching events per state transition, noise due to the switching events is reduced and dynamic power dissipation may also be reduced. Our approach is suitable for asynchronous sequential circuits that are designed from flow tables or state transition diagrams. The proposed approach may also be useful for designing synchronous circuits, but explorations into the subject of clock power would be necessary to determine its usefulness.

Research paper thumbnail of Patent Application of Vitit Kantabutra for TITLE : INTENTIONALLY-LINKED ENTITIES : A GENERAL-PURPOSE DATABASE SYSTEM CROSS-REFERENCE TO RELATED APPLICATIONS

In accordance with one embodiment the subject of the patent is a method for storing a database co... more In accordance with one embodiment the subject of the patent is a method for storing a database comprising entity objects or data structures representing the data entities, and relationship objects or data structures representing the relationships amongst the entities. Each relationship object or data structure possesses links to the entity objects or data structures that play the various roles in the relationship. Where there is a link from a relationship to an entity, there is also a link from the entity to the relationship, facilitating queries and updates to the database system. It is possible and often desirable for an embodiment to permit not merely one, but possibly many (or zero) entities to play each role in a relationship. The database is value-oriented in the sense that the address of an entity is not part of the key, thus permitting value-comparison-based searches.

Research paper thumbnail of A Research Scheme for a World History of the World

Universitat Pompeu Fabra, 2020

We propose a research scheme for a "world history of the world." Our method pro... more We propose a research scheme for a "world history of the world." Our method provides the means of analyzing the networks, on a global scale if desired, that connected places and people in the context of the multiple political, legal and institutional regimes, local cultural environments, and disruptive events through which the connecting social networks passed. We propose the use of the computational advances of the artificial intelligence (AI) age. However, this article presents these advances in an introductory form designed for novices. In particular, we explain how historians can compensate for the lack of information needed to explain self-organization and emergence in the social networks of the planetary complex, nonlinear, human world-system of the First Global Age, 1400-1800. To fill the information lacunae, we propose the use agent-based modeling (ABM), a type of computational artificial intelligence (AI), to simulate needed data, extending what we know from the available sources. We employ Intentionally-Linked Entities (ILE), a revolutionary database management system (DBMS), to model and visualize information about the influences

Research paper thumbnail of A suggestion for a data structure for temporal GIS

Research paper thumbnail of Designing optimum one-level carry-skip adders

IEEE Transactions on Computers, 1993

Research paper thumbnail of A recursive carry-lookahead/carry-select hybrid adder

IEEE Transactions on Computers, 1993

We present a very fast adder for double-precision mantissas, which is an improvement on Lynch and... more We present a very fast adder for double-precision mantissas, which is an improvement on Lynch and Swartzlander's Spanning ' h e Carry Lookahead Adder or Redundant Cell Adder (IEEE Trans. Comput, Aug. 1992 and IEEE ARITHlO Symp., 1991) which was implemented in AMD's Am29050 microprocessor. Our adder is faster than theirs mainly because we use Manchester carry chains of various lengths instead of chains of all the same length.

Research paper thumbnail of On the benefits of using linked data structures and dynamically-allocated memory for the modeling and visualization of practical complex systems

Proceedings of the 2010 International Conference on Modeling, Simulation and Visualization Methods (part of WORLDCOMP), Las Vegas, Nevada, 2010

Data modeling and storage are major challenges in the visualization of complex systems. Ideally d... more Data modeling and storage are major challenges in the visualization of complex systems. Ideally data should be stored in a way that is close to both how they occur naturally and how they are supposed to be visualized. A complex system normally involves various sorts of entities that are interconnected in complicated ways. Unfortunately the Relational DBMS is often the database of choice even for complex systems because that is the only kind of database that is widely available. However, the Relational paradigm is often ill-suited for modeling complex systems because complex systems are not similar to a set of two-dimensional tables. Using RDBMS can lead to redundancy, errors and search inefficiencies. We show how we can store data in a complex system as a linked data structure instead of tables, making use of modern dynamically memory allocation, thereby facilitating better visualization of the inter-relationships among entities.

Research paper thumbnail of Intentionally Linked Entities

This chapter introduces the Intentionally Linked Entities (ILE) database system and the possibili... more This chapter introduces the Intentionally Linked Entities (ILE) database system and the possibility of using ILE to more efficiently and accurately manage data in health care information systems. ILE links data entities in a more robust and efficient way than the relational database system. ILE also stores data in a more organized fashion than the relational, tabular NoSQL database systems and the graph database system, and it is capable of expressing more general relationships among data entities than the object-oriented database (OODB) system. All these positive qualities of ILE present the possibility of improving the reliability and correctness of health care databases, and may lead to improved and more efficient patient care and health care database analysis. This chapter includes an example that illustrates how ILE can be used for an epidemiological database, and includes a comparison of ILE as applied to electronic health record (her) representation with two other nonrelational approaches to storing and managing EHRs.

Research paper thumbnail of Towards Reliable Convergence in the Training of Neural Networks - The Streamlined Glide Algorithm and the LM Glide Algorithm

MLMTA, 2006

Multilayer perceptron neural networks continue to be very useful in many fields. Unfortunately tr... more Multilayer perceptron neural networks continue to be very useful in many fields. Unfortunately training these networks is still a major problem due to lack of convergence. This converge problem stems from the fact that the error curve has vast flat regions, making even higher-order algorithms move the network weights very slowly. In an ongoing series of papers including this one we propose a new class of training algorithms which is a promising solution to this non-convergence problem. These algorithms, called the Glide Algorithms, are based on the simple idea of changing the weights quickly in flat regions. This paper presents a streamlined version of the basic Glide Algorithm and a new version that incorporates Levenberg-Marquardt type moves. According to experimental results obtained so far both algorithms have a 100% convergence rate with relatively low standard deviation in the convergence time.

Research paper thumbnail of Area- and Power-Reduced Standard-Cell Spanning Tree Adders

Abstract. This paper presents new fast, low-cost Spanning Tree adders for double-precision mantis... more Abstract. This paper presents new fast, low-cost Spanning Tree adders for double-precision mantissas (IEEE 754-floating point standard). The new adders are modifications of conventional Spanning Tree adders. The improvements in the proposed circuits are made possible by replacing high power and area consuming block summation units used in the conventional architectures with newly designed low-area and low-power modules. A 56-bit adder designed as described here and fabricated using AMS 0.35mm CMOS Standard ...

Research paper thumbnail of Fast, low-cost adders using carry-strength signals

Research paper thumbnail of High-radix CORDIC for vector rotation with pipelined FPGA implementation

Abstract We present a new, mixed-radix (radix-4/radix-2) CORDIC algorithm for vector rotation and... more Abstract We present a new, mixed-radix (radix-4/radix-2) CORDIC algorithm for vector rotation and an efficient, pipelined implementation in Atmel's AT40K technology. Using only 3 radix-4 stages and one radix-2 stage, a sample rotator using this new algorithm achieves in 4 clock cycles the same accuracy that a conventional (radix-2) rotator would achieve in 7 cycles, while each cycle is almost the same speed as that of a conventional rotator. This sample rotator attains 12 bits of accuracy externally, while internally 17 bits of accuracy is ...

Research paper thumbnail of A lower bound on the path length of binary trees

Research paper thumbnail of The movements of multilink robot arms in two-dimensional regions (algorithms, complexity theory, robotics, motion planning, mover's problem)

Problems related to the movements of multilink robot arms in two dimensions are considered. A rob... more Problems related to the movements of multilink robot arms in two dimensions are considered. A robot arm is constructed from n(n > O) links, or straight-line segments, joined together end-to-end by freely rotating joints so that the links are allowed to cross each other. The author presents an algorithm, requiring O(n) computation time, which moves an arm in a circle to any reachable configuraion in O(n) moves. Also given is an O(n) computation time algorithm that computes all the regions reachable by the joints of such an arm.

Research paper thumbnail of A linear-time near-optimum-length triangulation algorithm for convex polygons

Journal of Computer and System Sciences, Oct 1, 1994

This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n ... more This paper shows how to compute a short triangulation for a convex polygon in O(n) time, where n is the number of sides of the input polygon. The resulting triangulation is guaranteed to be of a total length that is only a constant factor of the shortest possible.

Research paper thumbnail of Design of 3:1 multiplexer standard cell

Electronics Letters, 2000

the thetmal and electrical system, the bias heating can bc replicated on a capacitor in thc elect... more the thetmal and electrical system, the bias heating can bc replicated on a capacitor in thc electric circuit. In Fig. 1, the voltage across the capacitor CO can be written as where Thus, if a replica of bias heating can be generated on capacitor CO, which can be used to cancel the bias-heating effect. Thus, Io and C, should be chosen such that eqn. 6 is satisfied. The ratio of the current and the capacitance, lo/Co, can be determined from the given parameters of the microbolometer.

Research paper thumbnail of Fast and energy-efficient Manchester carry-bypass adders

IEE proceedings, 2004

A new modified Manchester carry chain (MCC) is presented. The objective is to reduce the carry pr... more A new modified Manchester carry chain (MCC) is presented. The objective is to reduce the carry propagation delay in the chain obtaining a layout-oriented architecture. The modification provides bypass (carry-skip) routes for the carry to propagate through quickly, avoiding long carry propagation paths that go through the entire carry chain. When realised using AMS 0.35 mm 2poly 3-metal 3.3V CMOS technology (CSD), a 32-bit adder designed as described here shows a computational delay of about 2.2 ns and an energy dissipation of only 27 pJ. This represents a significant improvement in terms of energy-delay product with respect to both conventional MCC adders and newer adder structures.

Research paper thumbnail of On hardware for computing exponential and trigonometric functions

IEEE Transactions on Computers, Mar 1, 1996

This paper presents new, fast hardware for computing the exponential function, sine, and cosine. ... more This paper presents new, fast hardware for computing the exponential function, sine, and cosine. The main new idea is to use low-precision arithmetic components to approximate high precision computations, and then to correct very quickly the approximation error periodically so that the effect is to get high precision computation at near low-precision speed. The algorithm used in the paper is a nontrivial modification of the well-known CORDIC algorithm, and might be applicable to the computation of other functions than the ones presented. index Terms-Exponential function, trigonometric functions, elementary functions, transcendental functions, CORDIC, division by convergence, high-precision VLSl computer arithmetic hardware, real-time graphics, navigation, control systems.

Research paper thumbnail of An Infinite Class of Non-Hamiltonian Voronoi Duals Based on Regular Polygons

FCS, 2009

A refill cartridge for a wet electrophotographic printer. The refill cartridge, for supplying ink... more A refill cartridge for a wet electrophotographic printer. The refill cartridge, for supplying ink to an ink cartridge fixed in a printer main body having a hollow area therein, includes: a case having an air hole and an ink supply hole, for detachable installation in the hollow area; a disk slidably mounted within the case; a spring for elastically biasing the disk toward the ink supply hole; and an ink supply hole plug capable of opening and closing the ink supply hole.

Research paper thumbnail of Using the Newly-created ILE DBMS to Better Represent Temporal and Historical GIS Data

Transactions in Gis, Jun 29, 2010

This article introduces a type of DBMS called the Intentionally-Linked Entities (ILE) DBMS for us... more This article introduces a type of DBMS called the Intentionally-Linked Entities (ILE) DBMS for use as the basis for temporal and historical Geographical Information Systems. ILE represents each entity in a database only once, thereby mostly eliminating redundancy and ...

Research paper thumbnail of A State Assignment Approach to Asynchronous

Abstracf-We present a new algorithm for state assignment in asynchronous circuits so that for eac... more Abstracf-We present a new algorithm for state assignment in asynchronous circuits so that for each circuit state transition, only one (secondary) state variable switches. No intermediate unstable states are used. The resultant circuits operate at optimum speed in terms of the number of transitions made and use only static CMOS gates. By reducing the number of switching events per state transition, noise due to the switching events is reduced and dynamic power dissipation may also be reduced. Our approach is suitable for asynchronous sequential circuits that are designed from flow tables or state transition diagrams. The proposed approach may also be useful for designing synchronous circuits, but explorations into the subject of clock power would be necessary to determine its usefulness.

Research paper thumbnail of Patent Application of Vitit Kantabutra for TITLE : INTENTIONALLY-LINKED ENTITIES : A GENERAL-PURPOSE DATABASE SYSTEM CROSS-REFERENCE TO RELATED APPLICATIONS

In accordance with one embodiment the subject of the patent is a method for storing a database co... more In accordance with one embodiment the subject of the patent is a method for storing a database comprising entity objects or data structures representing the data entities, and relationship objects or data structures representing the relationships amongst the entities. Each relationship object or data structure possesses links to the entity objects or data structures that play the various roles in the relationship. Where there is a link from a relationship to an entity, there is also a link from the entity to the relationship, facilitating queries and updates to the database system. It is possible and often desirable for an embodiment to permit not merely one, but possibly many (or zero) entities to play each role in a relationship. The database is value-oriented in the sense that the address of an entity is not part of the key, thus permitting value-comparison-based searches.

Research paper thumbnail of A Research Scheme for a World History of the World

Universitat Pompeu Fabra, 2020

We propose a research scheme for a "world history of the world." Our method pro... more We propose a research scheme for a "world history of the world." Our method provides the means of analyzing the networks, on a global scale if desired, that connected places and people in the context of the multiple political, legal and institutional regimes, local cultural environments, and disruptive events through which the connecting social networks passed. We propose the use of the computational advances of the artificial intelligence (AI) age. However, this article presents these advances in an introductory form designed for novices. In particular, we explain how historians can compensate for the lack of information needed to explain self-organization and emergence in the social networks of the planetary complex, nonlinear, human world-system of the First Global Age, 1400-1800. To fill the information lacunae, we propose the use agent-based modeling (ABM), a type of computational artificial intelligence (AI), to simulate needed data, extending what we know from the available sources. We employ Intentionally-Linked Entities (ILE), a revolutionary database management system (DBMS), to model and visualize information about the influences

Research paper thumbnail of A suggestion for a data structure for temporal GIS

Research paper thumbnail of Designing optimum one-level carry-skip adders

IEEE Transactions on Computers, 1993

Research paper thumbnail of A recursive carry-lookahead/carry-select hybrid adder

IEEE Transactions on Computers, 1993

We present a very fast adder for double-precision mantissas, which is an improvement on Lynch and... more We present a very fast adder for double-precision mantissas, which is an improvement on Lynch and Swartzlander's Spanning ' h e Carry Lookahead Adder or Redundant Cell Adder (IEEE Trans. Comput, Aug. 1992 and IEEE ARITHlO Symp., 1991) which was implemented in AMD's Am29050 microprocessor. Our adder is faster than theirs mainly because we use Manchester carry chains of various lengths instead of chains of all the same length.

Research paper thumbnail of On the benefits of using linked data structures and dynamically-allocated memory for the modeling and visualization of practical complex systems

Proceedings of the 2010 International Conference on Modeling, Simulation and Visualization Methods (part of WORLDCOMP), Las Vegas, Nevada, 2010

Data modeling and storage are major challenges in the visualization of complex systems. Ideally d... more Data modeling and storage are major challenges in the visualization of complex systems. Ideally data should be stored in a way that is close to both how they occur naturally and how they are supposed to be visualized. A complex system normally involves various sorts of entities that are interconnected in complicated ways. Unfortunately the Relational DBMS is often the database of choice even for complex systems because that is the only kind of database that is widely available. However, the Relational paradigm is often ill-suited for modeling complex systems because complex systems are not similar to a set of two-dimensional tables. Using RDBMS can lead to redundancy, errors and search inefficiencies. We show how we can store data in a complex system as a linked data structure instead of tables, making use of modern dynamically memory allocation, thereby facilitating better visualization of the inter-relationships among entities.