Nested datatypes generalise regular datatypes in much the same way that context-free languages generalise regular ones. Although the categorical semantics of nested types turns out to be similar to the regular case, t...
详细信息
Nested datatypes generalise regular datatypes in much the same way that context-free languages generalise regular ones. Although the categorical semantics of nested types turns out to be similar to the regular case, the fold functions are more limited because they can only describe natural transformations. Practical considerations therefore dictate the introduction of a generalised fold function in which this limitation can be overcome. In the paper we show how to construct generalised folds systematically for each nested datatype, and show that they possess a uniqueness property analogous to that of ordinary folds. As a consequence, generalised folds satisfy fusion properties similar to those developed for regular datatypes. Such properties form the core of an effective calculational theory of inductive datatypes.
In recent years, deep neural network (DNN) has been frequently used for classification. In this study, iris flowers having 3 different types are classified by using DNN which are utilized the width and length of petal...
详细信息
the issue of ensuring the reliability of the functioning of global systems of remote online monitoring of the condition of patients is considered. Remote monitoring is in demand when supervision the health status of d...
详细信息
Let there be given a safety related electronic system suffering from random failures or errors. The standard IEC 61508 contains simplified equations for the probability of failure on demand PFDavg for special system a...
详细信息
ISBN:
(纸本)9781622764365
Let there be given a safety related electronic system suffering from random failures or errors. The standard IEC 61508 contains simplified equations for the probability of failure on demand PFDavg for special system architectures, mostly without proof. In various publications PFDavg is defined by several different equations, e.g. as a Laplacian probability, as an integral mean, or by means of the average failure rate of the system. The aim of the paper is to determine PFDavgby stochastic methods and to bring together the different definitions. A formula for PFDavg is given that is valid for most universal electronic systems. The equivalence of 2 different definitions of PFDavgis shown. The special case of a koon-System is investigated, and the resulting equations improve those known so far. The basic idea is to randomize the time to failure, the down time of the system, as well as the repair time, and then, by means of the Stieltjes-Integral, determine the mean or average time as the expectation of the respective random variable.
Lazy functional languages have non-strict semantics and are purely declarative, i.e. they support the notion of referential transparency and are devoid of side effects. Traditional debugging techniques are, however, n...
详细信息
We analyze the search space of two clause-based proof procedures, the Model Elimination procedure and Near-Horn Prolog, both of Loveland. We study how the search space changes with respect to the degree of how “non-H...
详细信息
Fasttext is a powerful word representation method that creates word representations based on vectors of character n-grams. In this work, we propose a method that utilizes fasttext features for a novel feature engineer...
详细信息
A lack of adequate and flexible topology support in the popular message passing systems such as Parallel Virtual Machine was a major factor in the development of our Virtual Process Topology Environment. This parallel...
详细信息
In this paper, we investigate whether or not most novice programming bugs arise because students have misconceptions about the semantics of particular language constructs. Three high frequency bugs are examined in det...
详细信息
The unification problem for terms containing associative and commutative functions is of importance in theorem provers based on term rewriting and resolution methods as well as in logic programming. The complexity of ...
详细信息
暂无评论