To see the other types of publications on this topic, follow the link: Computer software Software architecture. Java (Computer program language).
Journal articles on the topic 'Computer software Software architecture. Java (Computer program language)'
Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles
Consult the top 50 journal articles for your research on the topic 'Computer software Software architecture. Java (Computer program language).'
Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.
You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.
Browse journal articles on a wide variety of disciplines and organise your bibliography correctly.
1
GÓMEZ-ZAMALLOA, MIGUEL, ELVIRA ALBERT, and GERMÁN PUEBLA. "Test case generation for object-oriented imperative languages in CLP." Theory and Practice of Logic Programming 10, no. 4-6 (July 2010): 659–74. http://dx.doi.org/10.1017/s1471068410000347.
Full textAbstract:
AbstractTesting is a vital part of the software development process. Test Case Generation (TCG) is the process of automatically generating a collection of test-cases which are applied to a system under test. White-box TCG is usually performed by means of symbolic execution, i.e., instead of executing the program on normal values (e.g., numbers), the program is executed on symbolic values representing arbitrary values. When dealing with an object-oriented (OO) imperative language, symbolic execution becomes challenging as, among other things, it must be able to backtrack, complex heap-allocated data structures should be created during the TCG process and features like inheritance, virtual invocations and exceptions have to be taken into account. Due to its inherent symbolic execution mechanism, we pursue in this paper that Constraint Logic Programming (CLP) has a promising application field in tcg. We will support our claim by developing a fully CLP-based framework to TCG of an OO imperative language, and by assessing it on a corresponding implementation on a set of challenging Java programs.
2
MONDRAGON, OSCAR A., ANN Q. GATES, STEVE ROACH, HUMBERTO MENDOZA, and OLEG SOKOLSKY. "GENERATING PROPERTIES FOR RUNTIME MONITORING FROM SOFTWARE SPECIFICATION PATTERNS." International Journal of Software Engineering and Knowledge Engineering 17, no. 01 (February 2007): 107–26. http://dx.doi.org/10.1142/s021819400700315x.
Full textAbstract:
This paper presents an approach to support run-time verification of software systems that combines two existing tools, Prospec and Java-MaC, into a single framework. Prospec can be used to clarify natural language specifications for sequential, concurrent, and nondeterministic behavior. In addition, Prospec assists the user in reading, writing, and understanding formal specifications through the use of property patterns and visual abstractions. Prospec automatically generates specifications written in Future Interval Logic (FIL). Java-MaC monitors Java programs at runtime to ensure adherence to a set of formally specified properties. Safety properties of a program are specified in the formal language Meta-Event Definition Language (MEDL). Java-MaC generates runtime components from specifications. The components are used to instrument the target program and determine whether the execution of the program violates any of the safety properties. This paper describes an algorithm for translating FIL formulas into MEDL formulas. It provides the transformation rules used by this algorithm, and it demonstrates the general correctness of the translation.
3
Harrand, Nicolas, Simon Allier, Marcelino Rodriguez-Cancio, Martin Monperrus, and Benoit Baudry. "A journey among Java neutral program variants." Genetic Programming and Evolvable Machines 20, no. 4 (June 25, 2019): 531–80. http://dx.doi.org/10.1007/s10710-019-09355-3.
Full text
4
Novo-Lourés, María, Reyes Pavón, Rosalía Laza, David Ruano-Ordas, and Jose R. Méndez. "Using Natural Language Preprocessing Architecture (NLPA) for Big Data Text Sources." Scientific Programming 2020 (August 1, 2020): 1–13. http://dx.doi.org/10.1155/2020/2390941.
Full textAbstract:
During the last years, big data analysis has become a popular means of taking advantage of multiple (initially valueless) sources to find relevant knowledge about real domains. However, a large number of big data sources provide textual unstructured data. A proper analysis requires tools able to adequately combine big data and text-analysing techniques. Keeping this in mind, we combined a pipelining framework (BDP4J (Big Data Pipelining For Java)) with the implementation of a set of text preprocessing techniques in order to create NLPA (Natural Language Preprocessing Architecture), an extendable open-source plugin implementing preprocessing steps that can be easily combined to create a pipeline. Additionally, NLPA incorporates the possibility of generating datasets using either a classical token-based representation of data or newer synset-based datasets that would be further processed using semantic information (i.e., using ontologies). This work presents a case study of NLPA operation covering the transformation of raw heterogeneous big data into different dataset representations (synsets and tokens) and using the Weka application programming interface (API) to launch two well-known classifiers.
5
Ghaleb, Taher Ahmed, Khalid Aljasser, and Musab A. Alturki. "An Extensible Compiler for Implementing Software Design Patterns as Concise Language Constructs." International Journal of Software Engineering and Knowledge Engineering 31, no. 07 (July 2021): 1043–67. http://dx.doi.org/10.1142/s0218194021500327.
Full textAbstract:
Design patterns are generic solutions to common programming problems. Design patterns represent a typical example of design reuse. However, implementing design patterns can lead to several problems, such as programming overhead and traceability. Existing research introduced several approaches to alleviate the implementation issues of design patterns. Nevertheless, existing approaches pose different implementation restrictions and require programmers to be aware of how design patterns should be implemented. Such approaches make the source code more prone to faults and defects. In addition, existing design pattern implementation approaches limit programmers to apply specific scenarios of design patterns (e.g. class-level), while other approaches require scattering implementation code snippets throughout the program. Such restrictions negatively impact understanding, tracing, or reusing design patterns. In this paper, we propose a novel approach to support the implementation of software design patterns as an extensible Java compiler. Our approach allows developers to use concise, easy-to-use language constructs to apply design patterns in their code. In addition, our approach allows the application of design patterns in different scenarios. We illustrate our approach using three commonly used design patterns, namely Singleton, Observer and Decorator. We show, through illustrative examples, how our design pattern constructs can significantly simplify implementing design patterns in a flexible, reusable and traceable manner. Moreover, our design pattern constructs allow class-level and instance-level implementations of design patterns.
6
Manik, Ngarap Im, and Don Tasman. "Piranti Lunak Pengujian Struktur Matematika Grup, Ring, Field Berbasis Osp (Open Source Program)." ComTech: Computer, Mathematics and Engineering Applications 5, no. 1 (June 30, 2014): 373. http://dx.doi.org/10.21512/comtech.v5i1.2631.
Full textAbstract:
This design of a computer software is a development and continuation of the software made on the previous research (2009/2010). However, this further research developed and expanded the scopes of testing more on the Siclic Group, Isomorphism Group, Semi Group, Sub Group and Abelian Group, Factor Ring, Sub Ring and Polynomial Ring; developed on the OSP (Open Source Program)-based. The software was developed using the OSP-based language programming, such Java, so it is open and free to use for its users. This research succeeded to develop an open source software of Java program that can be used for testing specific mathematical Groups, such Ciclic Group, Isomorphism Group, Semi Group, Sub Group and Abelian Group, and Rings, Commutative Ring, Division Ring, Ideal Sub Ring, Ring Homomorphism, Ring Epimorphism and Fields. By the results, the software developed was able to test as same as the results from manual testing.
7
YU, Li-Qian, Lin-Zhang WANG, Bin LEI, Jian-Hua ZHAO, and Xuan-Dong LI. "Combined Static and Dynamic Immutability Analysis of Java Program." Chinese Journal of Computers 33, no. 4 (May 10, 2010): 736–46. http://dx.doi.org/10.3724/sp.j.1016.2010.00736.
Full text
8
Türkmen, Aysun, Yalcin Yesil, and Mahmut Kayar. "Heuristic production line balancing problem solution with MATLAB software programming." International Journal of Clothing Science and Technology 28, no. 6 (November 7, 2016): 750–79. http://dx.doi.org/10.1108/ijcst-01-2016-0002.
Full textAbstract:
Purpose The purpose of this paper is to find the most efficient assembly line balancing solution across many heuristic line balancing methods, in assistance with a developed computer program. Design/methodology/approach In this paper, assembly line balancing problem was analyzed using t-shirt and knitted pants data. A computer program using MATLAB software for the solution of assembly line balancing problems has been developed. In this study, following heuristic assembly line balancing methods were applied: Hoffman method; position weight method; COMSOAL method; and Kilbridge and Wester method. A MATLAB program has been developed by taking into account of theoretical solution of all these methods. Later the program is developed further by analyzing solutions made manually and is made to verify the developed program. Findings Pre-studies which were conducted in order to decide which programming language would be the best choice for line balancing methods’ application came out with the result that MATLAB, from between C, C++, C# and Java, would be the best software choice. The main reason for this choice is that MATLAB is a powerful matrix operation software with a powerful user interface designing tool and has the tools to make development program to be used universally in every computer. Originality/value When the researches were investigated, it is clearly seen that, this study is the first research on using computer program for solving assembly line balancing problem.
9
SIEGELMANN, HAVA T. "ON NIL: THE SOFTWARE CONSTRUCTOR OF NEURAL NETWORKS." Parallel Processing Letters 06, no. 04 (December 1996): 575–82. http://dx.doi.org/10.1142/s0129626496000510.
Full textAbstract:
Analog recurrent neural networks have attracted much attention lately as powerful tools of automatic learning. However, they are not as popular in industry as should be justified by their usefulness. The lack of any programming tool for networks. and their vague internal representation, leave the networks for the use of experts only. We propose a way to make the neural networks friendly to users by formally defining a high level language, called Neural Information Processing Programming Langage, which is rich enough to express any computer algorithm or rule-based system. We show how to compile a NIL program into a network which computes exactly as the original program and requires the same computation/convergence time and physical size. Allowing for a natural neural evolution after the construction, the neural networks are both capable of dynamical continuous learning and represent any given symbolic knowledge. Thus, the language along with its compiler may be thought of as the ultimate bridge from symbolic to analog computation.
10
Raman, K. V. "Some Features of Java Language Illustrated through Examples from Chemistry." Mapana - Journal of Sciences 1, no. 2 (July 3, 2003): 22–56. http://dx.doi.org/10.12723/mjs.2.5.
Full textAbstract:
Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Computer programming has been used effectively by theoretical chemists and organic chemists to solve various types of problem in chemistry. Initially the languages used for computations in chemistry were FORTRAN and BASIC. Later the Pascal language was used for solving problems in chemistry and physics. Recently the languages C and C++ and Java have been used to solve problems in chemistry. In this paper I will illustrate features of C, C++ choosing examples from chemistry. Some examples presented in this these languages are Program to calculate reduced mass of homo diatomic or hetero diatomic Program to calculate the molecular weight of a tetra atomic system ABCD Program to calculate NMR frequencies of spin 1/2 nuclei only Program to calculate NMR and ESR frequencies The examples presented in Java 2 are Program to calculate unit cell dimension of a crystal Program to generate the chair form and boat form of cyclohexane. The examples presented in this monograph will help researchers in theoretical chemistry and organic chemistry to develop their own software.
11
Andreev, Dmitry, Sergey Lyokhin, Olga Poletaeva, and Victor Nikolaev. "DEVELOPMENT OF SOFTWARE FOR DESIGN ONTOLOGICAL REPRESENTATIONS OF PRODUCTION TECHNOLOGIES." ENVIRONMENT. TECHNOLOGIES. RESOURCES. Proceedings of the International Scientific and Practical Conference 2 (June 20, 2019): 28. http://dx.doi.org/10.17770/etr2019vol2.4064.
Full textAbstract:
The features of the progressive methodological basis for the construction of formalized descriptions of technologies for their subsequent analysis are discussed. The existing possibilities of ontological knowledge engineering applied to the problem of the structural representation of technologies using computer tools are noted. Presented functionality of the developed software that allows automating staged algorithmic procedures for constructing unified decomposition structures of formalized descriptions of technologies. Analysed following development tools: Java Standard Edition programming platform, “Eclipse” IDE, Java programming language, PostgreSQL database management system, “Swing” library for creating a graphical interface and “JGraphX” library for graphs visualization. Database structure of the developed software is described: shown database schema, database tables are defined and the links between them are indicated. The architecture of the developed software is presented: shown data flow scheme and the purpose of each of the modules is described. The main advantages of the developed software “OntoTechnology” is designated, which shows the practical significance of the results.
12
Chen, Hui. "A Typed Low-Level Language Used in Java Virtual Machine." Journal of Computer Research and Development 43, no. 1 (2006): 15. http://dx.doi.org/10.1360/crad20060103.
Full text
13
Liu, Meng Lin, Jiang Rang Liu, and Qing Yun Chi. "Research on Design and Implementation of Application Server Based on Java." Applied Mechanics and Materials 687-691 (November 2014): 1880–83. http://dx.doi.org/10.4028/www.scientific.net/amm.687-691.1880.
Full textAbstract:
With the development of computer network technology, Java has a fairly extensive use of die circumference. Especially in recent years, the development of the smart phone system is also stimulated the use of the Java language. In this paper, Java server is mainly divided into two categories JSP server and Java EE servers. Java EE function which has more features than perfect JSP servers. Application server is a chief platform of Web-based application. J2EE is a standard of enterprise-scale application server. In this paper J2EE is analyzed from the point of view of software architecture and Java-based application development. Some defects of J2EE are pointed out, such as J2EE being unable to support version management and it having diverse concepts and notions due to its multi-tier architecture. Furthermore, a light weight application server—J Web Frame is developed, which overcomes some problems of J2EE.
14
BAKER, MARK, and GARRY SMITH. "ESTABLISHING A RELIABLE JINI INFRASTRUCTURE FOR PARALLEL APPLICATIONS." Parallel Processing Letters 11, no. 02n03 (June 2001): 203–21. http://dx.doi.org/10.1142/s0129626401000531.
Full textAbstract:
Java is becoming an increasingly popular language for developing distributed and parallel scientific and engineering applications. Jini is a Java-based infrastructure developed by Sun that can allegedly provide all the services necessary to support distributed applications. It is the aim of this paper to explore and investigate the services and properties that Jini actually provides and match these against the needs of high performance distributed and parallel applications written in Java. The motivation for this work is the need to develop a distributed infrastructure to support an MPI-like interface to Java known as MPJ. In the first part of the paper we discuss the needs of MPJ, the parallel environment that we wish to support. In particular we look at aspects such as reliability and ease of use. We then move on to sketch out the Jini architecture and review the components and services that Jini provides. In the third part of the paper we critically explore a Jini infrastructure that could be used to support MPJ. Here we are particularly concerned with Jini's ability to support reliably a cocoon of MPJ processes executing in a heterogeneous envirnoment. In the final part of the paper we summarise our findings and report on future work being undertaken on Jini and MPJ.
15
Su, Rina. "Analysis of language features of English corpus based on Java Web." Microprocessors and Microsystems 80 (February 2021): 103611. http://dx.doi.org/10.1016/j.micpro.2020.103611.
Full text
16
Ensink, Brian, Joel Stanley, and Vikram Adve. "Program Control Language: a programming language for adaptive distributed applications." Journal of Parallel and Distributed Computing 63, no. 11 (November 2003): 1082–104. http://dx.doi.org/10.1016/s0743-7315(03)00117-5.
Full text
17
Tsybulnyk, Serhii, and Danylo Bidnyk. "DESIGN OF THE ARCHITECTURE OF AN AUTOMATED BIBLIOGRAPHIC SYSTEM." Bulletin of the National Technical University «KhPI» Series: New solutions in modern technologies, no. 2(8) (June 15, 2021): 83–89. http://dx.doi.org/10.20998/2413-4295.2021.02.12.
Full textAbstract:
The development of information and computer technologies has led to the need to evolve the concept of universal bibliographic control. The creation of the Internet and web technologies has allowed this concept to reach a new level by creating a number of common international standards. In addition, to ensure control and exchange of bibliographic information public bibliographic and scientometric databases were created. Today, software for managing bibliographic records is in demand in various countries in Europe and America. The most popular software in these countries is EndNote, RefWorks, BibTeX and Zotero. The development of such automated bibliographic system and the adaptation of its functionality to standards and requirements within Ukraine is relevant for a number of reasons. The main reasons are the need for every scientist and lecturer of higher education institutions to confirm their scientific achievements when hiring, submitting scientific work to various competitions, to obtain a scientific degree and so on. Today the rapid development of information and computer technology allows us to abandon the list of scientific papers in manual mode and move to the use of specialized software on smartphones. That is why the architecture of an automated bibliographic system, which is developed as a mobile application based on the Android operating system, was designed. Java is chosen as the programming language in which the software will be written, as the vast majority of the Android operating system is written in this language. A number of technologies were chosen for the selected operating system. They will simplify the process of developing a mobile application. The three-layer architecture of the automated bibliographic system is designed on the basis of the multilevel model of architecture and the MVVM template. This architecture allows to provide the main non-functional characteristics of the quality of the developed software, as well as to effectively implement the rules of business logic within the object-oriented programming paradigm.
18
Ashelford, Kevin E., Nadia A. Chuzhanova, John C. Fry, Antonia J. Jones, and Andrew J. Weightman. "New Screening Software Shows that Most Recent Large 16S rRNA Gene Clone Libraries Contain Chimeras." Applied and Environmental Microbiology 72, no. 9 (September 2006): 5734–41. http://dx.doi.org/10.1128/aem.00556-06.
Full textAbstract:
ABSTRACT A new computer program, called Mallard, is presented for screening entire 16S rRNA gene libraries of up to 1,000 sequences for chimeras and other artifacts. Written in the Java computer language and capable of running on all major operating systems, the program provides a novel graphical approach for visualizing phylogenetic relationships among 16S rRNA gene sequences. To illustrate its use, we analyzed most of the large libraries of cloned bacterial 16S rRNA gene sequences submitted to the public repository during 2005. Defining a large library as one containing 100 or more sequences of 1,200 bases or greater, we screened 25 of the 28 libraries and found that all but three contained substantial anomalies. Overall, 543 anomalous sequences were found. The average anomaly content per clone library was 9.0%, 4% higher than that previously estimated for the public repository overall. In addition, 90.8% of anomalies had characteristic chimeric patterns, a rise of 25.4% over that found previously. One library alone was found to contain 54 chimeras, representing 45.8% of its content. These figures far exceed previous estimates of artifacts within public repositories and further highlight the urgent need for all researchers to adequately screen their libraries prior to submission. Mallard is freely available from our website at http://www.cardiff.ac.uk/biosi/research/biosoft/ .
19
Mlakić, Dragan, Hamid Baghaee, Srete Nikolovski, Marko Vukobratović, and Zoran Balkić. "Conceptual Design of IoT-Based AMR Systems Based on IEC 61850 Microgrid Communication Configuration Using Open-Source Hardware/Software IED." Energies 12, no. 22 (November 10, 2019): 4281. http://dx.doi.org/10.3390/en12224281.
Full textAbstract:
This paper presents an intelligent electronic device (IED) utilized for automatic meter readings (AMR) scheme using “Open-Source” software. This IED is utilized to measure a low-voltage intelligent electronic device) system with a boundless number of sensors, and it is accessible on the Internet of Things (IoT). The utilized equipment for this task is Arduino UNO R3 motherboard and fringe sensors, which are used for measurement of the referenced information. The Arduino motherboard is used not only for sole tranquility of equipment but also for serving as wireless fidelity (Wi-Fi) switch for the sensors. The personal computer is utilized to gather information and perform client-side calculations. The server works based on an open-source program written in Java programming language. The underlying objective of the proposed scheme is to make the meter based on the “Do It Yourself” methodology which requires considerably fewer funds. Also, it is conceivable by keeping easy to understand interface, information legitimacy, precision of measured information and convenience for the conclusive client. The information is measured in just about 1 ms which is superb for custom-designed IED. Furthermore, the measured qualities are calculated based on their RMS values to be used for analyzing and further presentation of data.
20
Evripidou, Paraskevas, and Robert Barry. "Mapping Fortran Programs to Single Assignment Semantics for Efficient Parallelization." Parallel Processing Letters 08, no. 03 (September 1998): 407–18. http://dx.doi.org/10.1142/s0129626498000419.
Full textAbstract:
This paper presents Mustang, a system that automatically parallellizes Fortran programs by mapping them to single assignment semantics. Specifically, sequential Fortran source programs are translated into IF1, a machine-independent dataflow graph description language that is the intermediate form for the SISAL language. During this translation, Parfrase 2 is used to parse the source program perform dependency analysis and to detect opportunities for parallelization which are then explicitly introduced into the IF1 program. The resulting IF1 program is then processed by the Optimizing SISAL Compiler which produces parallel executables on multiple target platforms. A working prototype has been developed and tested. The execution results of several Livermore Loops are presented and compared against Fortran and SISAL implementations on two different platforms. The initial results obtained provide proof of concept that Fortran can be mapped to Single Assignment Semantics without sacrificing efficiency.
21
Srivastava, A., and S. R. Palavali. "Integration of SPICE with TEK LV500 ASIC Design Verification System." VLSI Design 4, no. 1 (January 1, 1996): 69–74. http://dx.doi.org/10.1155/1996/48310.
Full textAbstract:
The present work involves integration of the simulation stage of design of a VLSI circuit and its testing stage. The SPICE simulator, TEK LV500 ASIC Design Verification System, and TekWaves, a test program generator for LV500, were integrated. A software interface in ‘C’ language in UNIX ‘solaris 1.x’ environment has been developed between SPICE and the testing tools (TekWAVES and LV500). The function of the software interface developed is multifold. It takes input from either SPICE2G.6 or SPICE 3e.1. The output generated by the interface software can be given as an input to either TekWAVES or LV500. A graphical user interface has also been developed with OPENWlNDOWS using Xview tool kit on SUN workstation. As an example, a two phase clock generator circuit has been considered and usefulness of the software demonstrated. The interface software could be easily linked with VLSI design such as MAGIC layout editor.
22
HERRMANN, CHRISTOPH A. "GENERATING MESSAGE-PASSING PROGRAMS FROM ABSTRACT SPECIFICATIONS BY PARTIAL EVALUATION." Parallel Processing Letters 15, no. 03 (September 2005): 305–20. http://dx.doi.org/10.1142/s0129626405002234.
Full textAbstract:
This paper demonstrates how parallel programs with message-passing can be generated from abstract specifications embedded in the functional language MetaOCaml. The functional style permits to design parallel programs with a high degree of parameterization, so-called skeletons. Programmers who are unexperienced in parallelism can take such skeletons for a simple and safe generation of parallel applications. Since MetaOCaml also has efficient imperative features and an MPI interface, the entire program can be written in one language, without the need to use a language interface restricting the set of data objects which could be exchanged. The semantics of abstract specifications is expressed by an interpreter written in MetaOCaml. A cost model is defined by abstract interpretation of the specification. Partial evaluation of the interpreter with a specification, a feature which MetaOCaml provides, yields a parallel program. The partial evaluation process takes time on each MPI process directly before the execution of the application program, exploiting knowledge of the number of processes, the current process identifier and the communication structure. Our example is the specification of a divide-and-conquer skeleton which is used to compute the multiplication of multi-digit numbers using Karatsuba's algorithm.
23
Puigdomènech, I., E. Colàs, M. Grivé, I. Campos, and D. García. "A tool to draw chemical equilibrium diagrams using SIT: Applications to geochemical systems and radionuclide solubility." MRS Proceedings 1665 (2014): 111–16. http://dx.doi.org/10.1557/opl.2014.635.
Full textAbstract:
ABSTRACTA set of computer programs has been developed to draw chemical-equilibrium diagrams. This new software is the Java-language equivalent to the Medusa/Hydra software (developed some time ago in Visual basic at the Royal Institute of Technology, Stockholm, Sweden). The main program, now named “Spana” calls Java programs based on the HaltaFall algorithm. The equilibrium constants that are needed for the calculations may be retrieved from a database included in the software package (“Database” program). This new software is intended for undergraduate students as well as researchers and professionals.The “Spana” code can be easily applied to perform radionuclide speciation and solubility calculations of minerals, including solubility calculations relevant for the performance assessment of a nuclear waste repository. In order to handle ionic strength corrections in such calculations several approaches can be applied. The “Spana” code is able to perform calculations based on three models: the Davies equation; an approximation to the model by Helgeson et al. (HKF); and the Specific Ion-Interaction Theory (SIT). Default SIT-coefficients may be used, which widens the applicability of SIT significantly.A comparison is made here among the different ionic strength approaches used by “Spana” (Davies, HKF, SIT) when modelling the chemistry of radionuclides and minerals of interest under the conditions of a geological repository for nuclear waste. For this purpose, amorphous hydrous Thorium(IV) oxide (ThO2(am)), Gypsum (CaSO4·2H2O) and Portlandite (Ca(OH)2) solubility at high ionic strengths have been modelled and compared to experimental data from the literature. Results show a good fitting between the calculated values and the experimental data especially for the SIT approach in a wide range of ionic strengths (0-4 M).
24
Zhou, Zhimin, and Zhongwen Chen. "Split Attention Pointer Network for Source Code Language Modeling." International Journal of Software Engineering and Knowledge Engineering 30, no. 09 (September 2020): 1221–44. http://dx.doi.org/10.1142/s0218194020500321.
Full textAbstract:
There is a growing interest in leveraging Deep Learning (DL) for automating Software Engineering tasks such as program completion. In this paper, we leverage Recurrent Neural Networks (RNNs) for Abstract Syntax Tree (AST)-based code completion. Our approach converts source code into AST nodes and a language model predicts the type and value attributes of next tokens. Our work demonstrates that the attention augmented RNN-based language models are able to understand local context and copy from recent past tokens which have never appeared in the training data set. We observed a drop of performances of both type and value predictions when using a traditional pointer network architecture for out-of-vocabulary (OoV) copying and context understanding, which we call multi-task conflict. To address this challenge, we have devised a new structure of self-attention called Split Attention, where two separate dot-product layers are applied to different parts of the history cache. Based on this structure, we propose a new network called Split Attention Pointer Network (SAPN), which is efficient and flexible in both learning local context and copying OoV tokens from history. The empirical results suggest that our model is superior in syntax-aware generation and OoV token prediction by demonstrating attention behavior similar to human programmers. The results also indicate that our model out performs previous state-of-the-art approaches by more than 6% on widely recognized program completion benchmarks.
25
GRELCK, CLEMENS, STEFFEN KUTHE, and SVEN-BODO SCHOLZ. "A HYBRID SHARED MEMORY EXECUTION MODEL FOR A DATA PARALLEL LANGUAGE WITH I/O." Parallel Processing Letters 18, no. 01 (March 2008): 23–37. http://dx.doi.org/10.1142/s012962640800320x.
Full textAbstract:
We propose a novel execution model for the implicitly parallel execution of data parallel programs in the presence of general I/O operations. This model is called hybrid because it combines the advantages of the standard execution models fork/join and SPMD. Based on program analysis the hybrid model adapts itself to one or the other on the granularity of individual instructions. We outline compilation techniques that systematically derive the organization of parallel code from data flow characteristics aiming at the reduction of execution mode switches in general and synchronization/communication requirements in particular. Experiments based on a prototype implementation show the effectiveness of the hybrid execution model for reducing parallel overhead.
26
GAVA, FRÉDÉRIC. "FORMAL PROOFS OF FUNCTIONAL BSP PROGRAMS." Parallel Processing Letters 13, no. 03 (September 2003): 365–76. http://dx.doi.org/10.1142/s0129626403001343.
Full textAbstract:
The Bulk Synchronous Parallel ML (BSML) is a functional language for BSP programming, a model of computing which allows parallel programs to be ported to a wide range of architectures. It is based on an extension of the ML language by parallel operations on a parallel data structure called parallel vector, which is given by intention. We present a new approach to certifying BSML programs in the context of type theory. Given a specification and a program, an incomplete proof of the specification (of which algorithmic contents corresponds to the given program) is built in the type theory, in which gaps would correspond to the proof obligation. This development demonstrates the usefulness of higher-order logic in the process of software certification of parallel applications. It also shows that the proof of rather complex parallel algorithms may be done with inductive types without great difficulty by using existing certified programs. This work has been implemented in the Coq Proof Assistant, applied on non-trivial examples and is the basis of a certified library of BSML programs.
27
Makarych, M. V., Y. B. Popova, and M. O. Shved. "Linguistic database and software for english-belarusian-russian dictionary of technical terms." «System analysis and applied information science», no. 4 (February 6, 2019): 74–82. http://dx.doi.org/10.21122/2309-4923-2018-4-74-82.
Full textAbstract:
The central object of computer lexicography is a computer or electronic dictionary, which must have a sufficiently large vocabulary, provide the consistent extraction of information depending on the user’s need and provide complete grammatical information about the words of input and output languages. Taking into account the current trend in the development of special terminological dictionaries, the authors propose an English-Belarusian-Russian dictionary of technical terms. At the initial stage of the work the dictionary was named TechLex and covers the following subject areas: architecture and construction, water supply, information technology, pedagogy, transport communications, economics, energy-supply. Currently, each subject area of the dictionary is located in the Internet GoogleTable and contains about 1000 terms. It has the possibility to be simultaneously filled by several teachers. The linguistic database of the dictionary is not created by the traditional way of processing a large number of paper dictionaries and combining the received translations. Lexis from sequential processing of scientific and technical English periodicals of particular subject areas is the base of it. The software of the proposed electronic dictionary is designed taking into account the analysis of modern electronic multilingual translation dictionaries and is a client-server application in Java programming language. The client part of the system contains a mobile application for the Android operating system, which was tested on tablets and smartphones with different screen diagonals. The interface of TechLex dictionary is designed in such a way that only a single zone is activated according to the query, so there is no need to view all the subject areas of the dictionary. The proposed TechLex dictionary is the first technical multilingual electronic dictionary with an English-Belarusian-Russian version.
28
Wilde, D., and S. Rajopadhye. "Memory Reuse Analysis in the Polyhedral Model." Parallel Processing Letters 07, no. 02 (June 1997): 203–15. http://dx.doi.org/10.1142/s0129626497000218.
Full textAbstract:
In the context of developing a compiler for a ALPHA, a functional data-parallel language based on systems of affine recurrence equations (SAREs), we address the problem of transforming scheduled single-assignment code to multiple assignment code. We show how the polyhedral model allows us to statically compute the lifetimes of program variables, and thus enables us to derive necessary and sufficient conditions for reusing memory.
29
LOULERGUE, F. "DISTRIBUTED EVALUATION OF FUNCTIONAL BSP PROGRAMS." Parallel Processing Letters 11, no. 04 (December 2001): 423–37. http://dx.doi.org/10.1142/s0129626401000701.
Full textAbstract:
The BS λp-calculus is a calculus of functional bulk synchronous parallel (BSP) programs. It is the basis for the design of a bulk synchronous parallel ML language. For data-parallel languages, there are two points of view: the programming model where a program is seen as a sequence of operations on parallel vectors, and the execution model where the program is a parallel composition of programs run on each processor of the parallel machine. BSP algorithms are defined by data-parallel algorithms with explicit (physical) processes in order to allow their parallel execution time to be estimated. We present here a distributed evaluation minimally synchronous for BSP execution (which corresponds to the execution model). This distributed evaluation is correct w.r.t. the call-by-value strategy of the BS λp-calculus (which corresponds to the programming model).
30
J, Junaidi. "Working process of TU 3a CNC frais machine using software system." International Journal of Engineering & Technology 9, no. 3 (August 5, 2020): 658. http://dx.doi.org/10.14419/ijet.v9i3.29682.
Full textAbstract:
This workpiece process is: to find out how to transfer images from Auto CAD software to the Q plus CELL Milling Cnc software, and to find out how to transfer programs from the CNC Milling QELL KELLER software to the TU 3A CNC milling machine. The making of this workpiece uses three main media, namely Auto CAD 2000 software, CNC Milling KELLER Q plus software, and TU 3A CNC milling machine. The process of making the workpiece starts from making the workpiece design in Auto CAD software which is then stored on the CDR via DFX data. The design of the workpiece contained in the CDR is then transferred to CNC Millling KELLER Q plus software via Geometry. in Geometry, the design of the workpiece is dimensioned. Completed from the Geometry the workpiece design is included in the Work plan to be processed so that it can be simulated to move to a CNC program to convert the graphical language into a numeric language so that it can be read by a CNC machine. The programming results from the CNC KELLER Q plus software are then recorded to be executed on the CNC TU 3A milling machine to obtain the workpiece in accordance with the design in AutoCAD. Programming results from CNC Milling KELLER Q plus software cannot be directly used on the TU 3A milling machine (EMCO), because the programming language used is different. Programming language in CNC Milling KELLER Q plus software uses the DIN 66025 standard, while the CNC TU 3A (EMCO) milling machine uses ISO standards, so it needs to be converted first.
31
Purwanti Pratiwi Purbosari, Hadi Sasongko, Zuchrotus Salamah, and Nurul Putrie Utami. "Peningkatan Kesadaran Lingkungan dan Kesehatan Masyarakat Desa Somongari melalui Edukasi Dampak Pupuk dan Pestisida Anorganik." Agrokreatif: Jurnal Ilmiah Pengabdian kepada Masyarakat 7, no. 2 (June 7, 2021): 131–37. http://dx.doi.org/10.29244/agrokreatif.7.2.131-137.
Full textAbstract:
Somongari Village, located in Purworejo District, Central Java Province, is well-known as a producer of durian and mangosteen fruits. The income of Somongari Villagers depends on this commodity, however because of durian and mangosteen can only be harvested during a specific season, the villager plans to build vegetable houses for their daily needs. Based on the data obtained through Forum Group Discussion (FGD) with representatives of the villager and farmer group, the villager had not used organic fertilizers and pesticides. The practicality and fast yield of inorganic fertilizers and pesticides are the reasons villagers use them more. In contrast, the application of inorganic fertilizers and pesticides can hurt the environment and human health. Therefore, education was carried out for the Somongari villagers to increase the knowledge and awareness of environmental sustainability and health, primarily due to inorganic fertilizer and pesticide impact. The method used in this event was include preparation (coordination and problem identification through FGD), implementation (delivery of material), evaluation, and follow-up plans. After this activity, public knowledge of the impact of inorganic fertilizers and pesticides has increased. It can be seen from the pretest and post-test scores, respectively, before and after the material's presentation. In addition, the success of this program can also be seen from the awareness of the villager to make follow-up plans related to the production of organic fertilizers and pesticides.
32
Lin, Risheng, and Abdollah A. Afjeh. "Development of XML Databinding Integration for Web-Enabled Aircraft Engine Simulation." Journal of Computing and Information Science in Engineering 4, no. 3 (September 1, 2004): 186–96. http://dx.doi.org/10.1115/1.1736686.
Full textAbstract:
This paper discusses the detailed design and implementation of an XML databinding framework for Web-based aircraft engine simulation. The framework provides an interoperable, high-level object interface to access data. The interface permits semantic validation of engine data while preserving the meaning of the original data. Using this framework makes the integration of engine model and data, along with the relevant interfaces required for sharing and validation engine data, easier and more efficient. The language-independent representation of engine component data enables users to move around XML data using HTTP through disparate networks. The application of this framework is demonstrated via a Web-based turbofan propulsion system simulation using the World Wide Web (WWW). The framework employs a Java Servlet-based Web component architecture that renders XML engine data into HTML format and handles the user’s input events. This feature allows users to conduct and manage engine simulations from a Web browser. The simulation data can be saved to a local disk for archiving or restarting the simulation at a later time.
33
GRELCK, CLEMENS, and SVEN-BODO SCHOLZ. "SAC — FROM HIGH-LEVEL PROGRAMMING WITH ARRAYS TO EFFICIENT PARALLEL EXECUTION." Parallel Processing Letters 13, no. 03 (September 2003): 401–12. http://dx.doi.org/10.1142/s0129626403001379.
Full textAbstract:
SAC is a purely functional array processing language designed with numerical applications in mind. It supports generic, high-level program specifications in the style of APL. However, rather than providing a fixed set of built-in array operations, SAC provides means to specify such operations in the language itself in a way that still allows their application to arrays of any rank and size. This paper illustrates the major steps in compiling generic, rank- and shape-invariant SAC specifications into efficiently executable multithreaded code for parallel execution on shared memory multiprocessors. The effectiveness of the compilation techniques is demonstrated by means of a small case study on the PDE1 benchmark, which implements 3-dimensional red/black successive over-relaxation. Comparisons with HPF and ZPL show that despite the genericity of code, SAC achieves highly competitive runtime performance characteristics.
34
Kusumanti, Ima, Hanna Maria Sitindaon, Fiha Nurfatharani, and Anisa Istiqomah. "Peningkatan Implementasi Sanitasi Lingkungan melalui Pelatihan bagi Siswa Sekolah Dasar di Bogor." Agrokreatif: Jurnal Ilmiah Pengabdian kepada Masyarakat 7, no. 1 (March 23, 2021): 22–29. http://dx.doi.org/10.29244/agrokreatif.7.1.22-29.
Full textAbstract:
Clean and healthy life behavior (PHBS) in schools is an activity to empower students, teachers, and the community to run a healthy lifestyle and create healthy schools. The activity aims to socialize the importance of environmental sanitation in schools and raise awareness about the importance of environmental health in schools, through socialization and implementation training conducted in September 2020 in Bantarjati District, Bogor City, West Java. The activity was followed by students in grade 4 (four) elementary school totaling 35 students with implementation activities consisting of the preparation, core program and evaluation stages, then analyzed qualitatively through field observations and participant understanding interviews. The implementation of sanitation that has been carried out on students is one of the basic sanitation, which is washing hands and sorting waste by type. Minister of Health Regulation No. 3 of 2014 concerning STBM explains that washing hands with soap is the behavior of washing hands using clean running water and soap. Waste in general is divided into two, namely organic and inorganic waste. Both of these wastes have benefits for us, but they also have an impact on the environment. The results showed that the students' level of understanding at SDN 6 Bantarjati Bogor had a fairly good level. However, periodic socialization needs to be carried out as a process of forming student character and becomes a habit that is carried out so that it can be applied in everyday life through implementation training (practice).
35
CABALAR, PEDRO, JORGE FANDINNO, and YULIYA LIERLER. "Modular Answer Set Programming as a Formal Specification Language." Theory and Practice of Logic Programming 20, no. 5 (September 2020): 767–82. http://dx.doi.org/10.1017/s1471068420000265.
Full textAbstract:
AbstractIn this paper, we study the problem of formal verification for Answer Set Programming (ASP), namely, obtaining a formal proof showing that the answer sets of a given (non-ground) logic program P correctly correspond to the solutions to the problem encoded by P, regardless of the problem instance. To this aim, we use a formal specification language based on ASP modules, so that each module can be proved to capture some informal aspect of the problem in an isolated way. This specification language relies on a novel definition of (possibly nested, first order) program modules that may incorporate local hidden atoms at different levels. Then, verifying the logic program P amounts to prove some kind of equivalence between P and its modular specification.
36
SCHWITTER, ROLF. "Specifying and Verbalising Answer Set Programs in Controlled Natural Language." Theory and Practice of Logic Programming 18, no. 3-4 (July 2018): 691–705. http://dx.doi.org/10.1017/s1471068418000327.
Full textAbstract:
AbstractWe show how a bi-directional grammar can be used to specify and verbalise answer set programs in controlled natural language. We start from a program specification in controlled natural language and translate this specification automatically into an executable answer set program. The resulting answer set program can be modified following certain naming conventions and the revised version of the program can then be verbalised in the same subset of natural language that was used as specification language. The bi-directional grammar is parametrised for processing and generation, deals with referring expressions, and exploits symmetries in the data structure of the grammar rules whenever these grammar rules need to be duplicated. We demonstrate that verbalisation requires sentence planning in order to aggregate similar structures with the aim to improve the readability of the generated specification. Without modifications, the generated specification is always semantically equivalent to the original one; our bi-directional grammar is the first one that allows for semantic round-tripping in the context of controlled natural language processing.
37
Teixeira, Thiago SFX, William Gropp, and David Padua. "Managing code transformations for better performance portability." International Journal of High Performance Computing Applications 33, no. 6 (August 4, 2019): 1290–306. http://dx.doi.org/10.1177/1094342019865606.
Full textAbstract:
Code optimization is an intricate task that is getting more complex as computing systems evolve. Managing the program optimization process, including the implementation and evaluation of code variants, is tedious, inefficient, and errors are likely to be introduced in the process. Moreover, because each platform typically requires a different sequence of transformations to fully harness its computing power, the optimization process complexity grows as new platforms are adopted. To address these issues, systems and frameworks have been proposed to automate the code optimization process. They, however, have not been widely adopted and are primarily used by experts with deep knowledge about underlying architecture and compiler intricacies. This article describes the requirements that we believe necessary for making automatic performance tuning more broadly used, especially in complex, long-lived high-performance computing applications. Besides discussing limitations of current systems and strategies to overcome these, we describe the design of a system that is able to semi-automatically generate efficient platform-specific code. In the proposed system, the code optimization is programmer-guided, separately from application code, on an external file in what we call optimization programming. The language to program the optimization process is able to represent complex collections of transformations and, as a result, generate efficient platform-specific code. A database manages different optimized versions of code regions, providing a pragmatic approach to performance portability, and the framework itself has separate components, allowing the optimized code to be used on systems without installing all of the modules required for the code generation. We present experiments on two different platforms to illustrate the generation of efficient platform-specific code that performs comparable to hand-optimized, vendor-provided code.
38
Grossi, Davide, Wiebe van der Hoek, Christos Moyzes, and Michael Wooldridge. "Program models and semi-public environments." Journal of Logic and Computation 29, no. 7 (January 28, 2016): 1071–97. http://dx.doi.org/10.1093/logcom/exv086.
Full textAbstract:
Abstract We develop a logic for reasoning about semi-public environments , i.e. environments in which a process is executing, and where agents in the environment have partial and potentially different views of the process. Previous work on this problem illustrated that it was problematic to obtain both an adequate semantic model and a language for reasoning about semi-public environments. We here use program models for representing the changes that occur during the execution of a program. These models serve both as syntactic objects and as semantic models, and are a modification of action models in Dynamic Epistemic Logic, in the sense that they allow for ontic change (i.e. change in the world or state). We show how program models can elegantly capture a notion of observation of the environment. The use of these models resolves several difficulties identified in earlier work, and admit a much simpler treatment than was possible in previous work on semi-public environments.
39
Abayomi-Alli, Adebayo Adewumi, Oluwasefunmi 'Tale Arogundade, Sanjay Misra, Mulkah Opeyemi Akala, Abiodun Motunrayo Ikotun, and Bolanle Adefowoke Ojokoh. "An Ontology-Based Information Extraction System for Organic Farming." International Journal on Semantic Web and Information Systems 17, no. 2 (April 2021): 79–99. http://dx.doi.org/10.4018/ijswis.2021040105.
Full textAbstract:
In the existing farming system, information is obtained manually, and most times, farmers act based on their discretion. Sometimes, farmers rely on information from experts and extension officers for decision making. In recent times, a lot of information systems are available with relevant information on organic farming practices; however, such information is scattered in different context, form, and media all over the internet, making their retrieval difficult. The use of ontology with the aid of a conceptual scheme makes the comprehensive and detailed formalization of any subject domain possible. This study is aimed at acquiring, storing, and providing organic farming-based information available to current and intending software developer who may wish to develop applications for farmers. It employs information extraction (IE) and ontology development techniques to develop an ontology-based information extraction (OBIE) system called ontology-based information extraction system for organic farming (OBIESOF). The knowledge base was built using protégé editor; Java was used for the implementation of the ontology knowledge base with the aid of the high-level application programming language for working web ontology language application program interface (OWL API). In contrast, HermiT was used to checking the consistencies of the ontology and for submitting queries in order to verify their validity. The queries were expressed in description logic (DL) query language. The authors tested the capability of the ontology to respond to user queries by posing instances of the competency questions from DL query interface. The answers generated by the ontology were promising and serve as positive pointers to its usefulness as a knowledge repository.
40
Cohen, Michael, Noor Alamshah Bolhassan, and Owen Noel Newton Fernando. "A Multiuser Multiperspective Stereographic QTVR Browser Complemented by Java3D Visualizer and Emulator." Presence: Teleoperators and Virtual Environments 16, no. 4 (August 1, 2007): 414–38. http://dx.doi.org/10.1162/pres.16.4.414.
Full textAbstract:
To support multiperspective and stereographic image display systems intended for multiuser applications, we have developed two integrated multiuser multiperspective stereographic browsers, respectively featuring IBR-generated egocentric and CG exocentric perspectives. The first one described, “VR4U2C” (‘virtual reality for you to see’), uses Apple's QuickTime VR technology and the Java programming language together with the support of the QuickTime for Java library. This unique QTVR browser allows coordinated display of multiple views of a scene or object, limited only by the size and number of monitors or projectors assembled around or among users (for panoramas or turnoramas) in various viewing locations. The browser also provides a novel solution to limitations associated with display of QTVR imagery: its multinode feature provides interactive stereographic QTVR (dubbed SQTVR) to display dynamically selected pairs of images exhibiting binocular parallax, the stereoscopic depth percept enhanced by motion parallax from displacement of the viewpoint through space coupled with rotation of the view through a 360° horizontal panorama. This navigable approach to SQTVR allows proper occlusion/disocclusion as the virtual standpoint shifts, as well as natural looming of closer objects compared to more distant ones. We have integrated this stereographic panoramic browsing application in a client/server architecture with a sibling client, named “Just Look at Yourself!” which is built with Java3D and allows realtime visualization of the dollying and viewpoint adjustment as well as juxtaposition and combination of stereographic CG and IBR displays. “Just Look at Yourself!” visualizes and emulates VR4U2C, embedding avatars associated with cylinder pairs wrapped around the stereo standpoints texture-mapped with a set of panoramic scenes into a 3D CG model of the same space as that captured by the set of panoramas. The transparency of the 3D CG polygon space and the photorealistic stereographic 360° scenes, as well as the size of the stereo goggles through which the CG space is conceptually viewed and upon which the 360° scenes are texture-mapped, can be adjusted at runtime to understand the relationship of the spaces.
41
Sapietová, Alžbeta, Milan Sága, Ivan Kuric, and Štefan Václav. "Application of optimization algorithms for robot systems designing." International Journal of Advanced Robotic Systems 15, no. 1 (January 1, 2018): 172988141775415. http://dx.doi.org/10.1177/1729881417754152.
Full textAbstract:
The article presents the design and application of multi-software platform for solving kinematic synthesis of robot manipulator systems. It also presents a modern theoretical and application approach for modelling coupled mechanical systems, which include mobile robots. Due to high requirements for accuracy, efficiency, reliability and life cycle of technical equipment, several parameters ensuring optimal operating parameters need to be taken into account while dealing with the design. This is the reason for linking computational models to optimization algorithms that allows us to find the appropriate design parameters of analysed mechanical system, mechanisms, including mobile robots mostly by iterative way. The commercial working interface of the program ADAMS and open architecture of MATLAB programming language enable to share common data while dealing with model simulations in parallel. Both of them were used while designing and implementing the algorithm for the evaluation and optimization of parameters of technical equipment from the point of view of selected properties. While working on the task of the spatial mechanism of the six-member robot manipulator system, the algorithm solving the optimal parameters was created by applying the selected optimization techniques of the program MATLAB. Presented algorithm involves the creation of a map operating positions, which is further linked to the solution of the motion of interest points in the robotic system following a prescribed trajectory. This requires the geometry optimization of the selected members of the spatial robotic system in order to achieve such parameters so that the trajectory of the interest point of the output member would precisely match with the prescribed trajectory. It is important to note that these types of tasks create wider space for solving the assignments dealing with the development and application of technical equipment like mobile robots and their outputs that are linked to the needs of the practice.
42
Eckert, Candice, Brian Cham, Pengyi Li, Jing Sun, and Gillian Dobbie. "Linking Design Model with Code." International Journal of Software Engineering and Knowledge Engineering 26, no. 09n10 (November 2016): 1473–91. http://dx.doi.org/10.1142/s0218194016400131.
Full textAbstract:
With the growing in size and complexity of modern computer systems, the need for improving the quality at all stages of software development has become a critical issue. The current software production has been largely dependent on manual code development. Despite the slow development process, the errors introduced by the programmers contribute to a substantial portion of defects in the final software product. Model-driven engineering (MDE), despite having many advantages, is often overlooked by programmers due to lack of proper understanding and training in the matter. This paper investigates the advantages and disadvantages of MDE and looks at research results showing the adoption rates of design models. It analyzes different tools used for automated code generation and displays the reasons that led to technical decisions such as the programming language or design model used. In light of the findings, an educational tool, namely Lorini, was developed to provide automated code generation from the design models. The implemented tool consists of a plug-in for the Astah framework aimed at teaching Java programming to students through UML diagrams. It features instantaneous code generation from three types of UML diagrams, code-diagram matching, a feedback panel for error displays and on-the-fly compilation and execution of the resulting program. We also explore the possibility of generating assertion constraints from the design model and use them to verify the implementation. Evaluation of the tool indicated it to be successful with unique educational features and intuitive to use.
43
SILVA, JOSEP, and GERMÁN VIDAL. "Forward slicing of functional logic programs by partial evaluation." Theory and Practice of Logic Programming 7, no. 1-2 (January 2007): 215–47. http://dx.doi.org/10.1017/s1471068406002870.
Full textAbstract:
AbstractProgram slicing has been mainly studied in the context of imperative languages, where it has been applied to a wide variety of software engineering tasks, like program understanding, maintenance, debugging, testing, code reuse, etc. This work introduces the first forward slicing technique for declarative multi-paradigm programs which integrate features from functional and logic programming. Basically, given a program and aslicing criterion(a function call in our setting), the computed forward slice contains those parts of the original program which arereachablefrom the slicing criterion. Our approach to program slicing is based on an extension of (online) partial evaluation. Therefore, it provides a simple way to develop program slicing tools from existing partial evaluators and helps to clarify the relation between both methodologies. A slicing tool for the multi-paradigm language Curry, which demonstrates the usefulness of our approach, has been implemented in Curry itself.
44
Kahl, Patrick, Richard Watson, Evgenii Balai, Michael Gelfond, and Yuanlin Zhang. "The language of epistemic specifications (refined) including a prototype solver." Journal of Logic and Computation 30, no. 4 (September 9, 2015): 953–89. http://dx.doi.org/10.1093/logcom/exv065.
Full textAbstract:
Abstract In this article, we present a new version of the language of Epistemic Specifications. The goal is to simplify and improve the intuitive and formal semantics of the language. We describe an algorithm for computing solutions of programs written in this new version of the language. The new semantics is illustrated by a number of examples, including an Epistemic Specifications-based framework for conformant planning. In addition, we introduce the notion of an epistemic logic program with sorts . This extends recent efforts to define a logic programming language that includes the means for explicitly specifying the domains of predicate parameters. An algorithm and its implementation as a solver for epistemic logic programs with sorts is also discussed.
45
COLVIN, ROBERT, IAN J. HAYES, and PAUL STROOPER. "Calculating modules in contextual logic program refinement." Theory and Practice of Logic Programming 8, no. 01 (May 15, 2007): 1–31. http://dx.doi.org/10.1017/s1471068407003043.
Full textAbstract:
AbstractThe refinement calculus for logic programs is a framework for deriving logic programs from specifications. It is based on a wide-spectrum language that can express both specifications and code, and a refinement relation that models the notion of correct implementation. In this paper we extend and generalise earlier work oncontextual refinement. Contextual refinement simplifies the refinement process by abstractly capturing the context of a subcomponent of a program, which typically includes information about the values of the free variables. This paper also extends and generalisesmodule refinement. Amoduleis a collection of procedures that operate on a common data type; module refinement between a specification moduleAand an implementation moduleCallows calls to the procedures ofAto be systematically replaced with calls to the corresponding procedures ofC. Based on the conditions for module refinement, we present a method forcalculatingan implementation module from a specification module. Both contextual and module refinement within the refinement calculus have been generalised from earlier work and the results are presented in a unified framework.
46
ALMENDROS-JIMÉNEZ, J. M., A. BECERRA-TERÓN, and F. J. ENCISO-BAÑOS. "Querying XML documents in logic programming." Theory and Practice of Logic Programming 8, no. 3 (May 2008): 323–61. http://dx.doi.org/10.1017/s1471068407003183.
Full textAbstract:
AbstractExtensible Markup Language (XML) is a simple, very flexible text format derived from SGML. Originally designed to meet the challenges of large-scale electronic publishing, XML is also playing an increasingly important role in the exchange of a wide variety of data on the Web and elsewhere. XPath language is the result of an effort to provide address parts of an XML document. In support of this primary purpose, it becomes in a query language against an XML document. In this paper we present a proposal for the implementation of the XPath language in logic programming. With this aim we will describe the representation of XML documents by means of a logic program. Rules and facts can be used for representing the document schema and the XML document itself. In particular, we will present how to index XML documents in logic programs: rules are supposed to be stored in main memory, however facts are stored in secondary memory by using two kind of indexes: one for each XML tag, and other for each group of terminal items. In addition, we will study how to query by means of the XPath language against a logic program representing an XML document. It evolves the specialization of the logic program with regard to the XPath expression. Finally, we will also explain how to combine the indexing and the top-down evaluation of the logic program.
47
Jiang, Yu, Hang Yu, and Jun Jiang. "Optimization of Multidimensional Clinical Information System for Schizophrenia." Complexity 2021 (May 13, 2021): 1–10. http://dx.doi.org/10.1155/2021/1744155.
Full textAbstract:
Schizophrenia is a serious mental disease whose pathogenesis has not been fully elucidated. Its clinical evaluation and diagnosis still highly depend on the clinical experience of doctors. It is of great scientific value and clinical significance to study the inducing factors and neuropathological mechanism of schizophrenia. Based on the four research problems of schizophrenia, this paper analyzes the data types that need to be stored in clinical trials and scientific research, including basic information, case report data, neuropsychological and cognitive function evaluation, magnetic resonance data, electroencephalogram (EEG) data, and intestinal flora data. Through the demand analysis of the system, including the data management part, data analysis part, the functional demand of the system management part, and the overall nonfunctional demand of the system, the overall architecture design, functional module division, and database table structure design of the system are completed. Adopting Browser/Server (B/S) architecture and front-end and back-end separation mode and applying Java and Python programming language, based on spring framework and database, a multidimensional information management system for schizophrenia is designed and implemented, which includes four modules: data analysis, data management, system management, and security control. In addition, each functional module of the system is designed and implemented in detail, and the software operation flow of each module is illustrated with the sequence diagram. Finally, the multidimensional data of schizophrenia collected in our laboratory were used for system test to verify whether the system can meet the needs of clinical big data management of schizophrenia and the multidimensional information management system of schizophrenia can meet the needs of clinical big data management. The information management system helps schizophrenic researchers to carry out data management and data analysis. It also has advantages that are easy to use, safe, and efficient and has strong scalability in data management, data analysis, and scalability. It reflects the innovation of the system and provides a good platform for the management, research, and analysis of clinical big data of schizophrenia.
48
COMINI, MARCO, LAURA TITOLO, and ALICIA VILLANUEVA. "Abstract diagnosis for timed concurrent constraint programs." Theory and Practice of Logic Programming 11, no. 4-5 (July 2011): 487–502. http://dx.doi.org/10.1017/s1471068411000135.
Full textAbstract:
AbstractThe timed concurrent constraint language (tccp in short) is a concurrent logic language based on the simple but powerful concurrent constraint paradigm of Saraswat. In this paradigm, the notion of store-as-value is replaced by the notion of store-as-constraint, which introduces some differences w.r.t. other approaches to concurrency. In this paper, we provide a general framework for the debugging of tccp programs. To this end, we first present a new compact, bottom-up semantics for the language that is well suited for debugging and verification purposes in the context of reactive systems. We also provide an abstract semantics that allows us to effectively implement debugging algorithms based on abstract interpretation. Given a tccp program and a behavior specification, our debugging approach automatically detects whether the program satisfies the specification. This differs from other semi-automatic approaches to debugging and avoids the need to provide symptoms in advance. We show the efficacy of our approach by introducing two illustrative examples. We choose a specific abstract domain and show how we can detect that a program is erroneous.
49
KIMMIG, ANGELIKA, BART DEMOEN, LUC DE RAEDT, VÍTOR SANTOS COSTA, and RICARDO ROCHA. "On the implementation of the probabilistic logic programming language ProbLog." Theory and Practice of Logic Programming 11, no. 2-3 (January 27, 2011): 235–62. http://dx.doi.org/10.1017/s1471068410000566.
Full textAbstract:
AbstractThe past few years have seen a surge of interest in the field of probabilistic logic learning and statistical relational learning. In this endeavor, many probabilistic logics have been developed. ProbLog is a recent probabilistic extension of Prolog motivated by the mining of large biological networks. In ProbLog, facts can be labeled with probabilities. These facts are treated as mutually independent random variables that indicate whether these facts belong to a randomly sampled program. Different kinds of queries can be posed to ProbLog programs. We introduce algorithms that allow the efficient execution of these queries, discuss their implementation on top of the YAP-Prolog system, and evaluate their performance in the context of large networks of biological entities.
50
FANDINNO, JORGE, VLADIMIR LIFSCHITZ, PATRICK LÜHNE, and TORSTEN SCHAUB. "Verifying Tight Logic Programs with anthem and vampire." Theory and Practice of Logic Programming 20, no. 5 (September 2020): 735–50. http://dx.doi.org/10.1017/s1471068420000344.
Full textAbstract:
AbstractThis paper continues the line of research aimed at investigating the relationship between logic programs and first-order theories. We extend the definition of program completion to programs with input and output in a subset of the input language of the ASP grounder gringo, study the relationship between stable models and completion in this context, and describe preliminary experiments with the use of two software tools, anthem and vampire, for verifying the correctness of programs with input and output. Proofs of theorems are based on a lemma that relates the semantics of programs studied in this paper to stable models of first-order formulas.