Built-in Data Types Research Articles

Software Support for Arbitrary Precision Arithmetic in Programming Languages

Arbitrary precision arithmetic, also known as bignum arithmetic, is a computational technique that allows programmers to perform arithmetic operations on numbers with significantly higher precision and magnitude than what is typically supported by the built-in numerical data types in programming languages. This technique is especially useful when working with extremely large or extremely precise numbers, such as in cryptography or scientific computations. Arbitrary precision arithmetic has many applications in the areas of Cryptography, Numerical Computation, Statistical Analysis, and High Precision measurements. For example, the calculation of the modulus in the RSA algorithm involves numbers with 1024-bit numbers and higher. An arithmetic calculation involving Multiplication and exponentiation of such numbers using Modulo arithmetic cannot be easily carried out in the existing programming Languages unless special software is provided. We can calculate the mathematical constant Pi to many thousand decimal places using the support provided in Programming Languages. Many programming languages provide built-in support for libraries for arbitrary precision arithmetic. We discuss the support provided in C/C++, Java and Python Languages with examples. Besides Programming Languages, Toolkits like Matlab and Sagemath also are used for scientific computation and special software support provided in these toolkits can enable arbitrary precision arithmetic. Most Programming Languages have support for floating-point arithmetic. We also discuss how arbitrary precision floating point arithmetic. can be supported in C/C++, Java, and Python. In addition, we discuss support for arbitrary precision integer arithmetic in Ruby, Javascript and Matlab and support for arbitrary precision floating point arithmetic in the Perl Language. Finally, we provide an example of computing the constant Pi to many decimal places using the sagemath tool.

Regular Grid DEM Data Processing Based on Hadoop

Digital Elevation Model (DEM) has been widely used in various sectors. But its data structure is special, and the amount of data is large. When it comes to big data or large-scale data simulation, the data processing of stand-alone mode often fails to meet the needs of users. This paper focuses on the Hadoop cloud computing platform for large data parallel processing and its built-in data types is limited, study the organization method of the regular grid DEM in the cloud computing platform, and designs the data types that applicable to the regular grid DEM processing in MapReduce framework. Finally, realize the parallelization processing of DEM and use non-source flood analysis as an example to verify the feasibility of data types.

Python in Computational Science: Applications and Possibilities

ABSTRACT This paper focuses on the role of python in dramatic increase in productivity and high-level of code reuse in computational science. The salient features of python make it an ideal language for scientific computing exposing the shortcomings of legacy languages and prototyping platforms. Python provides a rich collection of built-in data types such as strings, lists, dictionaries; dynamic typing and dynamic binding, modules, classes, exceptions handling, automatic memory management, multiprocessing, parallel computing capabilities. Python can also be used as a glue language to wrap around existing static compiled code to obtain optimum performance. The uptrend of adopting python as a general purpose language along with its vast collection of scientific libraries are also reviewed in this paper, which ensures the long term presence of python and its growing user base in the foreseeable future. General Terms Computational Science. Keywords

Method for Automatically Generating Test Cases for Web Services

Because manual test case design is time-consuming and laborious and has certain blindness and inclination, Web service testing is based on WSDL document and formal model tree automatic generation. The theoretical research and Web service single operation test case generation method. Web service operation test case method, and to build test tools. The application results show that this method can greatly save the time of manually analyzing the complex data types in WSDL files and the time of generating the test cases according to the test cases of built-in data types. It simplifies the generation of test cases, and prepares test cases.

Similarity identification algorithm of hard-structured data based on semantic networks

The main disadvantage of any similarity search algorithm is its purpose. Existing algorithms are focused purely on the text as a continuous element of structural data and do not take into account the context of information that is presented in the text. This makes it impossible to use algorithms for text with a specific context. The only application of such algorithms is the texts that can be elements of a more complex object of comparison. The paper presents a similarity search algorithm of hard-structured data using semantic networks. The built semantic network takes into account all the features of the bibliographic description of the publication and is endowed with methods of comparison of its separate parts. Application of the algorithm for similarity search of bibliographic descriptions in the information-analytical system ScienceLP was investigated. The research results have confirmed the usefulness of the developed algorithm for effective relevant search. For the versatility of the software implementation of the algorithm, reflection-oriented programming approach was used. Such an approach allows to identify almost any object, no matter whether it is built-in or user data type. This allows the algorithm to be independent of the type of the compared object and its internal structure.

Analysis of RSA Algorithm using GPU Programming

Modern-day computer security relies heavily on cryptography as a means to protect the data that we have become increasingly reliant on. The main research in computer security domain is how to enhance the speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo value that can process large power of numbers which otherwise are not supported by built-in data types. First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical soundness can be alleviated by this algorithm.

ANALYSIS OF RSA ALGORITHM USING GPU PROGRAMMING

Modern-day computer security relies heavily on cryptography as a means to protect the data that we have become increasingly reliant on. The main research in computer security domain is how to enhance the speed of RSA algorithm. The computing capability of Graphic Processing Unit as a co-processor of the CPU can leverage massive-parallelism. This paper presents a novel algorithm for calculating modulo value that can process large power of numbers which otherwise are not supported by built-in data types. First the traditional algorithm is studied. Secondly, the parallelized RSA algorithm is designed using CUDA framework. Thirdly, the designed algorithm is realized for small prime numbers and large prime number . As a result the main fundamental problem of RSA algorithm such as speed and use of poor or small prime numbers that has led to significant security holes, despite the RSA algorithm's mathematical soundness can be alleviated by this algorithm.

DB-IR integration using tight-coupling in the Odysseus DBMS

As many recent applications require integration of structured data and text data, unifying database (DB) and information retrieval (IR) technologies has become one of major challenges in our field. There have been active discussions on the system architecture for DB-IR integration, but a clear agreement has not been reached yet. Along this direction, we have advocated the use of the tight-coupling architecture and developed a novel structure of the IR index as well as tightly-coupled query processing algorithms. In tight-coupling, the text data type is supported from the storage system just like a built-in data type so that the query processor can efficiently handle queries involving both structured data and text data. In this paper, for archival purposes, we consolidate our achievements reported at non-regular publications over the last ten years or so, extending them by adding greater details on the IR index and the query processing algorithms. All the features in this paper are fully implemented in the Odysseus DBMS that has been under development at KAIST for over 23 years. We show that Odysseus significantly outperforms two open-source DBMSs and one open-source search engine (with some exceptional cases) in processing DB-IR integration queries. These results indeed demonstrate superiority of the tight-coupling architecture for DB-IR integration.

Cloud MapReduce for Monte Carlo bootstrap applied to Metabolic Flux Analysis

The MapReduce architectural pattern popularized by Google has successfully been utilized in several scientific applications. Up until now, MapReduce is rarely employed in the field of Systems Biology. We investigate whether a MapReduce approach utilizing on-demand resources from a Cloud is suitable to perform simulation tasks in the area of Metabolic Flux Analysis (MFA). An Amazon ElasticMapReduce Cloud implementation of the parallel, parametric Monte Carlo bootstrap in the context to 13C-MFA is presented. The seamless integration of the application into a service-oriented, BPEL-based scientific workflow framework is shown. A comparison of a straightforward MapReduce implementation using the Hadoop streaming interface on various Amazon ElasticMapReduce instance types and a single CPU core computation approach reveals a speedup of 17 on 64 Amazon cores. I/O operations on many small files within the Reduce step were identified as the limiting step. By exploiting the Hadoop Java API, making use of built-in data types and tuning problem-specific Hadoop parameters, the I/O issues could be resolved. With the revised implementation, a speedup of up to 48 could be achieved on 64 Amazon cores. To investigate the runtimes of a realistic 13C-MFA analysis, 50,000 Monte Carlo samples with a typical metabolic network model have been performed on 20 virtual nodes in 24 h and 23 min with a total cost of $384. Our work demonstrates the possibility to perform scalable Systems Biology applications using Amazon’s Cloud MapReduce service.

SAWSDL Service Discovery Based on Fine-Grained Data Semantics

With the aim to improve the effectiveness of SAWSDL service discovery, this paper proposes a novel discovery method for SAWSDL services, which is based on the matchmaking of so-called fine-grained data semantics that is defined via sets of atomic elements with built-in data types. The fine-grained data semantics can be obtained by a transformation algorithm that decomposes parameters at message level into a set of atomic elements, considering the characteristics of SAWSDL service structure and semantic annotations. Then, a matchmaking algorithm is proposed for the matching of fine-grained data semantics, which avoids the complex and expensive structural matching at the message level. The fine-grained data semantics is transparent to the specific data structure of message-level parameters, therefore, it can help to match successfully similar Web services with different data structures of parameters. Moreover, a comprehensive measure is proposed by considering together several important components of SAWSDL service descriptions at the same time. Finally, this method is evaluated on SAWSDL service discovery test collection SAWSDL-TC2 and compared with other SAWSDL matchmakers. The experimental results show that our method can improve the effectiveness of SAWSDL service discovery with low average query response time. The results imply that fine-grained parameters fit to represent the data semantics of SAWSDL services, especially when data structures of parameters are not important for semantics.

A Rank-Sum Testing Method for Multi-Trait Comprehensive Ranking and Its Application

The rank-sum test is a nonparametric method used in variety evaluation. However, the hypothesis testing of the method hasn't been established for multi-trait comprehensive ranking. In this paper, under null hypothesis H 0: the variety's ranking on each trait is random, the theoretical distribution of sum of ranks (SR) was firstly derived and further used to obtain the critical values for multi-trait comprehensive evaluation in rank-sum testing. A new C ++ class and its basic arithmetic were defined to deal with the miscount caused by the precision limitation of built-in data type in common statistical software under large number of varieties and traits. Finally, an application of the theoretical results was demonstrated using five starch viscosity traits of 12 glutinous maize varieties. The proposed method is so simple and convenient that it can be easily used to rank different varieties by multiple traits.

A stochastic bitwidth estimation technique for compact and low-power custom processors

There is an increasing trend toward compiling from C to custom hardware for designing embedded systems in which the area and power consumption of application-specific functional units, registers, and memory blocks are heavily dependent on the bit-widths of integer operands used in computations. The actual bit-width required to store the values assigned to an integer variable during the execution of a program will not, in general, match the built-in C data types. Thus, precious area is wasted if the built-in data type sizes are used to declare the size of integer operands. In this paper, we introduce stochastic bit-width estimation that follows a simulation-based probabilistic approach to estimate the bit-widths of integer variables using extreme value theory. The estimation technique is also empirically compared to two compile-time integer bit-width analysis techniques. Our experimental results show that the stochastic bit-width estimation technique dramatically reduces integer bit-widths and, therefore, enables more compact and power-efficient custom hardware designs than the compile-time integer bit-width analysis techniques. Up to 37% reduction in custom hardware area and 30% reduction in logic power consumption using stochastic bit-width estimation can be attained over ten integer applications implemented on an FPGA chip.

XML schema language: taking XML to the next level

Schemas add data typing and inheritance features, giving XML the sophistication required to create enterprise-class business applications. The XML schema language describes the legal structure, content, and constraints of XML documents. The XML schema language provides the necessary framework for creating XML documents by specifying the valid structure, constraints, and data types for the various elements and attributes of an XML document. Schema language provides enhanced as well as more comprehensive and powerful features than a document type definition (DTD). The XML schema language provides the rich data typing associated with ordinary programming languages. The W3C XML schema specification defines several different built-in data types, such as string, integer, Boolean, date, and time, among others. The specification also provides the capability for defining new types. Developers can use these built-in as well as user-defined data types to effectively define and constrain XML document attributes and element values.

Operational Techniques in PVS — A Preliminary Evaluation

In this paper we present a preliminary analysis of the suitability of using PVS as a tool for developing operational semantics and programming logics in a semi-automatic fashion. To this end we present a formalized proof of the Church–Rosser theorem for a version of the call-by-value lambda calculus in the spirit of Landin's ISWIM. The proof is developed in the PVS system, and is used as a test bed or benchmark for evaluating the applicability of that system for carrying out more complex operational arguments. Our approach is relatively unusual in that it is based on the named variable approach, and concentrates on the call-by-value version of the β rule. Although there are numerous computer-based proofs of the Church–Rosser theorem in the literature, all of the existing proofs eliminate the need to treat α conversion. The novel aspects of our approach are that: we use the PVS system, especially its built-in abstract data types facility, to verify a version of the Church–Rosser theorem; we formalize a version of the λ-calculus, as it normally appears in textbooks, rather than tailoring it to suit the machine or system; we treat an ISWIM variation on the call-by-value version of the λ-calculus, rather than the simpler traditional call-by-name version. However the main aim of the work reported here was to evaluate PVS as a tool for developing, state of the art, operational based programming logics for realistic programming languages.

Programming with dual numbers and its applications in mechanisms design

Dual numbers are expressed in the form x+ɛy where ɛ2. Dual metanumbers are defined in this paper as DualZero, DualInf and DualNaN. The extended dual plane and the extended finite dual plane are introduced to describe dual numbers and dual metanumbers. Handling of dual numbers in the CH programming language is presented. The I/O, arithmetic and relational operations, and built-in mathematical functions are defined for both dual numbers and dual metanumbers. As a result of polymorphism, the syntaxes of dual arithmetic and relational operations, and built-in dual functions are the same as those for real and complex numbers in the CH programming language. The valid lvalues related to dual numbers in CH are defined. The computation of the motion screw for a rigid-body displacement is used as an example to illustrate the creation of user's dual functions. The efficacy of CH programming with dual numbers is demonstrated by displacement analysis of an RCCC mechanism. For the first time, dual data is handled as a built-in data type in a general-purpose computer programming language. Programming with dual numbers in CH is simpler than in any other computer programming language.

Handling of Complex Numbers in the CHProgramming Language

The handling of complex numbers in the CHprogramming language will be described in this paper. Complex is a built-in data type in CH. The I/O, arithmetic and relational operations, and built-in mathematical functions are defined for both regular complex numbers and complex metanumbers of ComplexZero, Complexlnf, and ComplexNaN. Due to polymorphism, the syntax of complex arithmetic and relational operations and built-in mathematical functions are the same as those for real numbers. Besides polymorphism, the built-in mathematical functions are implemented with a variable number of arguments that greatly simplify computations of different branches of multiple-valued complex functions. The valid lvalues related to complex numbers are defined. Rationales for the design of complex features in CHare discussed from language design, implementation, and application points of views. Sample CHprograms show that a computer language that does not distinguish the sign of zeros in complex numbers can also handle the branch cuts of multiple-valued complex functions effectively so long as it is appropriately designed and implemented.

VML: An intermediate language for robot programming

VML (Virtual Machine Language) is an intermediate level programming language for manipulators which allows structured programming, concurrency, built-in robot-specific data types and a certain degree of robot independence. VML can be used both as an interactive command language and as a target language for advanced high-level robotics software systems. Its definition involves a number of design choices which portray an abstract view of the robot as one of several components in the automated factory.

QUEL as a data type

This paper explores the use of commands in a query language as an abstract data type (ADT) in data base management systems Basically, an ADT facility allows new data types, such as polygons, lines, money, time, arrays of floating point numbers, bit vectors, etc, to supplement the built-in data types in a data base system. In this paper we demonstrate the power of adding a data type corresponding to commands in a query language We also propose three extensions to the query language QUEL to enhance its power in this augmented environment.