automatic Summarization is need of the era. Mathematics is an important tool of nonfigurative thinking. A mathematic model of automatic summarization is established and discussed in the paper. The model makes use of m...
详细信息
ISBN:
(纸本)3540283129
automatic Summarization is need of the era. Mathematics is an important tool of nonfigurative thinking. A mathematic model of automatic summarization is established and discussed in the paper. The model makes use of meta-knowledge to describe the composition of the summary and help to calculate the semantic distance between summary and source document. It is proposed that how to get meta-knowledge aggregate and their weight are the key problems in the model.
In order to improve product manufacturing efficiency and quality the paper brings up a method of building automatic programming template for the parts in same category with the help of an excellent programming platfor...
详细信息
ISBN:
(纸本)9783037854488
In order to improve product manufacturing efficiency and quality the paper brings up a method of building automatic programming template for the parts in same category with the help of an excellent programming platform --Unigraphics NX. It relieves automatic programming staff from repetitive work and improves the product manufacturing efficiency. The actual application result indicates that the method has certain practicality Meanwhile, it also provides general design method for these similar parts.
In this paper we describe a type system for a generative mechanism that generalizes the concept of generic types by combining it with a controlled form of reflection. This mechanism makes many code generation tasks po...
详细信息
ISBN:
(纸本)3540291385
In this paper we describe a type system for a generative mechanism that generalizes the concept of generic types by combining it with a controlled form of reflection. This mechanism makes many code generation tasks possible for which generic types alone would be insufficient. The power of code generation features are carefully balanced with their safety, so that we axe able to perform static type checks on generator code. This leads to a generalized notion of type safety for generators.
Large Language Models (LLMs) have gained significant attention for using natural language to generate program code without direct programming efforts, e.g., by using ChatGPT in a dialog-based interaction. In the field...
详细信息
ISBN:
(纸本)9789819709885;9789819709892
Large Language Models (LLMs) have gained significant attention for using natural language to generate program code without direct programming efforts, e.g., by using ChatGPT in a dialog-based interaction. In the field of Service-Oriented Computing, the potential of using LLMs' capabilities is yet to be explored. LLMs may solve significant service composition challenges like automated service discovery or automated service composition by filling the gap between the availability of suitable services, e.g., in a registry, and their actual composition without explicit semantic annotations or modeling. We analyze the classical way of service composition and how LLMs are recently employed in code generation and service composition. As a result, we show that classical solution approaches usually require extensive domain modeling and computationally expensive planning processes, resulting in a long time needed to create the composition. To ground the research on LLMs for service compositions, we identify six representative scenarios of service compositions from the literature and perform experiments with ChatGPT and GPT-4 as a notable, representative application of LLMs. Finally, we frame open research challenges for service composition in the context of LLMs. With this position paper, we emphasize the importance of researching LLMs as the next step of automated service composition.
We propose a new method for improving the specialization of programs by inserting an interpreter between a subject program and a specializer. We formulate three specializer projections which enable us to generate spec...
详细信息
ISBN:
(纸本)081865640X
We propose a new method for improving the specialization of programs by inserting an interpreter between a subject program and a specializer. We formulate three specializer projections which enable us to generate specializers from interpreters. The goal is to provide a new way to control the specialization of programs, and we report the first practical results. This is a step towards the automatic production of specializers. Using an existing, self-applicable partial evaluator we succeeded in generating a stand-alone specializer for a first-order functional language which is stronger than the partial evaluator used for its generation. The generated specializer corresponds to a simple super-compiler. As an example we show that the generated specializer can achieve the same speed-up effect as the Knuth, Morris & Pratt algorithm by specializing a naive matcher with respect to a fixed pattern. The generated specializer is also strong enough to handle bounded static variation, a case which partial evaluators usually can not handle.
Transactional memory offers significant advantages for concurrency control compared to locks. This paper presents the design and implementation of transactional memory constructs in an unmanaged language. Unmanaged la...
详细信息
ISBN:
(纸本)9780769527642
Transactional memory offers significant advantages for concurrency control compared to locks. This paper presents the design and implementation of transactional memory constructs in an unmanaged language. Unmanaged languages pose a unique set of challenges to transactional memory constructs - for example, lack of type and memory safety, use of function pointers, aliasing of local variables, and others. This paper describes novel compiler and runtime mechanisms that address these challenges and optimize the performance of transactions in an unmanaged environment. We have implemented these mechanisms in a production-quality C compiler and a high-performance software transactional memory runtime. We measure the effectiveness of these optimizations and compare the performance of lock-based versus transaction-based programming on a set of concurrent data structures and the SPLASH-2 benchmark suite. On a 16 processor SMP system, the transaction-based version of the SPLASH-2 benchmarks scales much better than the coarse-grain locking version and performs comparably to the fine-grain locking version. Compiler optimizations significantly reduce the overheads of transactional memory so that, on a single thread, the transaction-based version incurs only about 6.4% overhead compared to the lock-based version for the SPLASH-2 benchmark suite. Thus, our system is the first to demonstrate that transactions integrate well with an unmanaged language, and can perform as well as fine-grain locking while providing the programming ease of coarse-grain locking even on an unmanaged environment.
To be able to represent FSM as a binary chromosome several restrictions are required. This paper analyzes and discuses the differences between classical FSMs and semantic FSA with evolutionary algorithms. To overcome ...
详细信息
ISBN:
(纸本)9789881925145
To be able to represent FSM as a binary chromosome several restrictions are required. This paper analyzes and discuses the differences between classical FSMs and semantic FSA with evolutionary algorithms. To overcome the limitation of classical Mealy and Moore machine, we use semantic FSA. It is presented that when the evolutionary process is based on the behavior of small building function, then better evolutionary algorithm is developed. In addition, the evolutionary process is highly enhanced by using fitness inheritance technique to constrain the depth of genetic programming tree to overcome its bloat problem.
A Golomb-Costas array is an arrangement of dots and blanks, defined for each positive integer power of a prime and satisfying certain unusual conditions. A dot occurring in such an array is an even/even position if it...
详细信息
ISBN:
(纸本)1424403499
A Golomb-Costas array is an arrangement of dots and blanks, defined for each positive integer power of a prime and satisfying certain unusual conditions. A dot occurring in such an array is an even/even position if it occurs in the i-th row and j-th column, where i and j are both even integers, and there are similar definitions of odd/odd, even/odd and odd/even positions for dots. When q is a power of an odd prime, we enumerate the number of even/even, odd/odd, even/odd and odd/even positions for dots in a Golomb-Costas array of order q - 2. We show that three of these numbers are equal and they differ by +/- 1 from the fourth. More general Costas arrays do not exhibit this regularity. We also show that if q = r(t), where r is a power of a prime and t is an integer greater than 1, any Golomb-Costas array of order q - 2 contains in a natural way a Colomb-Costas array of order r - 2 which can easily be identified.
This paper proposes a probabilistic reachability repair solution that enables abstract machines to automatically evolve and satisfy desired requirements. The solution is a combination of the B-method, machine learning...
详细信息
ISBN:
(纸本)9781728146485
This paper proposes a probabilistic reachability repair solution that enables abstract machines to automatically evolve and satisfy desired requirements. The solution is a combination of the B-method, machine learning and program synthesis. The B-method is used to formally specify an abstract machine and analyse the reachability of the abstract machine. Machine learning models are used to approximate features hidden in the semantics of the abstract machine. When the abstract machine fails to reach a desired state, the machine learning models are used to discover missing transitions to the state. Inserting the discovered transitions into the original abstract machine will lead to a repaired abstract machine that is capable of achieving the state. To obtain the repaired abstract machine, a set of insertion repairs are synthesised from the discovered transitions and are simplified using context-free grammars. Experimental results reveal that the reachability repair solution is applicable to a wide range of abstract machines and can accurately discover transitions that satisfy the requirements of reachability. Moreover, the results demonstrate that random forests are efficient machine learning models on transition discovery tasks. Additionally, we argue that the automated reachability repair process can improve the efficiency of software development.
Big Data query systems represent data in a columnar format for fast, selective access, and in some cases (e.g. Apache Drill), perform calculations directly on the columnar data without row materialization, avoiding ru...
详细信息
ISBN:
(纸本)9781538627150
Big Data query systems represent data in a columnar format for fast, selective access, and in some cases (e.g. Apache Drill), perform calculations directly on the columnar data without row materialization, avoiding runtime costs. However, many analysis procedures cannot be easily or efficiently expressed as SQL. In High Energy Physics, the majority of data processing requires nested loops with complex dependencies. When faced with tasks like these, the conventional approach is to convert the columnar data back into an object form, usually with a performance price. This paper describes a new technique to transform procedural code so that it operates on hierarchically nested, columnar data natively, without row materialization. It can be viewed as a compiler pass on the typed abstract syntax tree, rewriting references to objects as columnar array lookups. We will also present performance comparisons between transformed code and conventional object-oriented code in a High Energy Physics context.
暂无评论