Background: The advent of Julia as a sophisticated and dynamic programming language in 2012 represented a significant milestone in computational programming, mathematical analysis, and statistical modeling. Having rea...
详细信息
Background: The advent of Julia as a sophisticated and dynamic programming language in 2012 represented a significant milestone in computational programming, mathematical analysis, and statistical modeling. Having reached its stable release in version 1.9.0 on May 7, 2023, Julia has developed into a powerful and versatile instrument. Despite its potential and widespread adoption across various scientific and technical domains, there exists a noticeable knowledge gap in comprehending its utilization within biological sciences. The Aim of Review: This comprehensive review aims to address this particular knowledge gap and offer a thorough examination of Julia's fundamental characteristics and its applications in biology. Key scientific concepts of the review: The review focuses on a research gap in the biological science. The review aims to equip researchers with knowledge and tools to utilize Julia's capabilities in biological science effectively and to demonstrate the gap. It paves the way for innovative solutions and discoveries in this rapidly evolving field. It encompasses an analysis of Julia's characteristics, packages, and performance compared to the other programming languages in this field. The initial part of this review discusses the key features of Julia, such as its dynamic and interactive nature, fast processing speed, ease of expression manipulation, user-friendly syntax, code readability, strong support for multiple dispatch, and advanced type system. It also explores Julia's capabilities in data analysis, visualization, machine learning, and algorithms, making it suitable for scientific applications. The next section emphasizes the importance of using Julia in biological research, highlighting its seamless integration with biological studies for data analysis, and computational biology. It also compares Julia with other programming languages commonly used in biological research through benchmarking and performance analysis. Additionally, it provides i
A new programming language SORCA has been defined and a compiler has been written for Z80-based microcomputer systems with CP/M operating system. The language was developed to control behavioral experiments by externa...
详细信息
A new programming language SORCA has been defined and a compiler has been written for Z80-based microcomputer systems with CP/M operating system. The language was developed to control behavioral experiments by external stimuli and by time schedule in real-time. Eight binary hardware input lines are sampled cyclically by the computer and can be used to sense switches, level detectors and other binary information, while 8 binary hardware output lines, that are cyclically updated, can be used to control relays, lamps, generate tones or for other purposes. The typical reaction time (cycle time) of a SORCA-program is 500 μs to 1 ms. All functions can be programmed as often as necessary. Included are the basic logic functions, counters, timers, majority gates and other complex functions. Parameters can be given as constants or as a result of a step function or of a random process (with Gaussian or equal distribution). Several tasks can be performed simultaneously. In addition, results of an experiment (e.g., number of reactions or latencies) can be measured and printed out on request or automatically. The language is easy to learn and can also be used for many other control purposes.
GLYPNIR is one of the earliest existing languages designed for programming the Illiac IV computer. The syntax of the language is based on ALGOL 60, but has been extended to allow the programmer explicitly to specify t...
详细信息
GLYPNIR is one of the earliest existing languages designed for programming the Illiac IV computer. The syntax of the language is based on ALGOL 60, but has been extended to allow the programmer explicitly to specify the parallelism of his algorithm in terms of 64-word *** paper describes the characteristics, goals, and philosophy of the language, and discusses some of the problems associated with parallel computer architectures.
Based on the premise that programming languages interact with one another while their popularities changes over time, we describe a technique for extracting latent features from the popularities of programming languag...
详细信息
Based on the premise that programming languages interact with one another while their popularities changes over time, we describe a technique for extracting latent features from the popularities of programming languages. We constructed a matrix in which each column consisted of a time series of partial correlation coefficients between the popularities of different languages. For the analysis, we utilized non-negative matrix factorization (NMF) to factorize the matrix into the matrices of temporal modes and mixture components. We found that the matrix was optimally factorized with three temporal modes, and the factorization results were more or less independent of factorization algorithms. In accordance with NMF, which learns a part-based representation of the matrix, the sparse property of the temporal modes illustrated different patterns of correlation strength over time. By analyzing the NMF results, we show that the most popular languages of Java, C, and C++ become more correlated as time passes and that the recent similar trends in the popularities of Java and C can be explained by the positive correlation between the two at a later stage in time. These and other characteristics of the popularity explained by NMF may provide clues to understanding the evolution of the popularity of programming language.
The realization of an abstract programming language is a good approach for automating the software production process and facilitating the correctness proof of a software system. This paper introduces a formal languag...
详细信息
The realization of an abstract programming language is a good approach for automating the software production process and facilitating the correctness proof of a software system. This paper introduces a formal language for programming at the abstract level by combining Pascal with VDM (Vienna Development Method). The notation provided by the language obliges programmers to consider the correctness of programs throughout the whole process of programming, and the proof axiom and rules presented in this paper may be used to prove the correctness of programs. A complete example is given to illustrate how to program using APL and how to prove the correctness of programs using the given axiom and rules.
programming languages (PLs) are symbolic instruction for writing programs, which have qualifications of evaluation of algorithm. The basic idea of programming languages (PLs) is to make it easier to write computer pro...
详细信息
programming languages (PLs) are symbolic instruction for writing programs, which have qualifications of evaluation of algorithm. The basic idea of programming languages (PLs) is to make it easier to write computer programs, now while that is true, what is often overlooked by language designers is that the other purpose, and maintaining its primary purpose, is to make it easier for people to read and understand programs. A programming language selection intrinsically is a multi-criteria decision-making (MCDM) problem. To handle the uncertainty of information in a MCDM problem, the theory of fuzzy sets is an effective tool. Interval-valued intuitionistic fuzzy sets (IVIFSs), which are characterized by the interval membership, non-membership and hesitancy functions have more flexibility to model the uncertainty of the MCDM problems than fuzzy sets (FSs). In this paper, a new integrated method based on multi-attributive border approximation area comparison (MABAC) method is proposed to handle MCDM problems with IVIFSs. This method is based on the IVIFS operators, some modifications in the classical MABAC method and a new procedure for calculation of the criteria weight. For calculation of criteria weight, we aggregate the subjective weights expressed by decision experts with the objective weights obtained from the proposed entropy and divergence measures method to obtain more realistic weights. Since the uncertainty is an inevitable characteristic of MCDM problems, the developed method can be a useful tool for decision making in an uncertain environment. To demonstrate the applicability of the developed method in the real-world MCDM problems, a programming language selection problem is taken. We perform a sensitivity analysis with different weights of criteria to show the stability of the proposed approach. This analysis shows that combining the subjective and objective weights can help to increase the stability of the proposed method with different weights of criteria.
The programming language C is becoming increasingly popular. It has many advantages over PASCAL and BASIC for use with PCs. It is known as a high-level assembly language, and provides useful tools for programmers.
The programming language C is becoming increasingly popular. It has many advantages over PASCAL and BASIC for use with PCs. It is known as a high-level assembly language, and provides useful tools for programmers.
We propose a programming language for music named mimium, which combines temporal-discrete control and signal processing in a single language. mimium has an intuitive imperative syntax and can use stateful functions a...
详细信息
ISBN:
(纸本)9781450386135
We propose a programming language for music named mimium, which combines temporal-discrete control and signal processing in a single language. mimium has an intuitive imperative syntax and can use stateful functions as Unit Generator in the same way as ordinary function definitions and applications. Furthermore, the runtime performance is made equivalent to that of lower-level languages by compiling the code through the LLVM compiler infrastructure. By using the strategy of adding a minimum number of features for sound to the design and implementation of a general-purpose functional language, mimium is expected to lower the learning cost for users, simplify the implementation of compilers, and increase the self-extensibility of the language. In this paper, we present the basic language specification, semantics for simple task scheduling, the semantics for stateful functions, and the compilation process. mimium has certain specifications that have not been achieved in existing languages. Future works suggested include extending the compiler functionality to combine task scheduling with the functional paradigm and introducing multi-stage computation for parametric replication of stateful functions.
暂无评论