Search results for "soft"
showing 10 items of 9809 documents
Incorporating hypothetical knowledge into the process of inductive synthesis
1996
The problem of inductive inference of functions from hypothetical knowledge is investigated in this paper. This type of inductive inference could be regarded as a generalization of synthesis from examples that can be directed not only by input/output examples but also by knowledge of, e. g., functional description's syntactic structure or assumptions about the process of function evaluation. We show that synthesis of this kind is possible by efficiently enumerating the hypothesis space and illustrate it with several examples.
Geometric and conceptual knowledge representation within a generative model of visual perception
1989
A representation scheme of knowledge at both the geometric and conceptual levels is offered which extends a generative theory of visual perception. According to this theory, the perception process proceeds through different scene representations at various levels of abstraction. The geometric domain is modeled following the CSG (constructive solid geometry) approach, taking advantage of the geometric modelling scheme proposed by A. Pentland, based on superquadrics as representation primitives. Recursive Boolean combinations and deformations are considered in order to enlarge the scope of the representation scheme and to allow for the construction of real-world scenes. In the conceptual doma…
nalysis, Modeling and Simulation of Mechatronic Systems using the Bond Graph Method
2011
The Bond Graph is the proper choice of physical system used for: (i) Modeling which can be applied to systems combining multidisciplinary energy domains, (ii) Analysis to provide a great value proposition for finding the algebraic loops within the system enabling the process of troubleshooting and eliminating the defects by using the proper component(s) to fix the causality conflict even without being acquainted in the proper system, and (iii) Simulation facilitated through derived state space equations from the Bond Graph model is solved using industrial simulation software, such as 20-Sim. The Bond Graph technique is a graphical language of modeling, in which component energy ports are co…
How Do Computer Science Students Use Distributed Version Control Systems?
2013
The inclusion of version control systems into computing curricula enables educators to promote competences needed in real-life situations. The use of a version control system also has several potential benefits for the teacher. The teacher might, for instance, use the tool to monitor students’ progress and to give feedback efficiently. This study analyzes how students used the distributed version control system Git in several computing courses. We analyzed students’ commit log data in two advanced programming courses, a second-year introductory software engineering course, and two courses where students developed software products. This enables us to compare Git usage between introductory l…
Statistical analysis of RaptorQ failure probability applied to a data recovery software
2014
In this work, we have implemented a data recovery software integrating the most recent rateless codes, i.e., RaptorQ codes. Thanks to the above-mentioned software, it is possible to recover data loss occurring on several kinds of network conditions. We have performed a statistical analysis of failure probabilities at several configurations of RaptorQ parameters. We have found a good agreement with the theoretical values of a random linear fountain code over Galois Field GF(256). Moreover, we have shown that the probability of having a certain number of failed decoded source blocks - when sending a fixed size file - follows a Poisson distribution.
Multiple SIP strategies and bottom-up adorning in logic query optimization
1990
Preprocessing methods called “readorning” and “bottom-up adorning” are introduced as means of enlarging the application domain of magic sets and related query optimization strategies for logic databases. Readorning tries to make possible the simultaneous use of multiple sideways information passing (sip) strategies defined for a rule, thus yielding an optimization effect that may not be achieved by any particular choice of sip strategies. Bottom-up adorning is used to make magic sets applicable to cases in which potential optimizations can be derived from bindings coming upwards from rule bodies to rule heads in bottom-up evaluation. These include the cases in which we know that some base r…
Recursive modeling for completed code generation
2009
Model-Driven Development is promising to software development because it can reduce the complexity and cost of developing large software systems. The basic idea is the use of different kinds of models during the software development process, transformations between them, and automatic code generation at the end of the development. But unlike the structural parts, fully-automated code generation from the behavior parts is still hard, if it works at all, restricted to specific application areas using a domain specific language, DSL.This paper proposes an approach to model the behavior parts of a system and to embed them into the structural models. The underlying idea is recursive refinements …
GPU-accelerated exhaustive search for third-order epistatic interactions in case–control studies
2015
This is a post-peer-review, pre-copyedit version of an article published in Journal of Computational Science. The final authenticated version is available online at: https://doi.org/10.1016/j.jocs.2015.04.001 [Abstract] Interest in discovering combinations of genetic markers from case–control studies, such as Genome Wide Association Studies (GWAS), that are strongly associated to diseases has increased in recent years. Detecting epistasis, i.e. interactions among k markers (k ≥ 2), is an important but time consuming operation since statistical computations have to be performed for each k-tuple of measured markers. Efficient exhaustive methods have been proposed for k = 2, but exhaustive thi…
Challenges of Program Synthesis with Grammatical Evolution
2020
Program synthesis is an emerging research topic in the field of EC with the potential to improve real-world software development. Grammar-guided approaches like GE are suitable for program synthesis as they can express common programming languages with their required properties. This work uses common software metrics (lines of code, McCabe metric, size and depth of the abstract syntax tree) for an analysis of GE’s search behavior and the resulting problem structure. We find that GE is not able to solve program synthesis problems, where correct solutions have higher values of the McCabe metric (which means they require conditions or loops). Since small mutations of high-quality solutions str…
Artificial Intelligence + Distributed Systems = Agents
2009
The connection with Wirth’s book goes beyond the title, albeit confining the area to modern Artificial Intelligence (AI). Whereas thirty years ago, to devise effective programs, it became necessary to enhance the classical algorithmic framework with approaches applied to limited and focused subdomains, in the context of broad-band technology and semantic web, applications - running in open, heterogeneous, dynamic and uncertain environments-current paradigms are not enough, because of the shift from programs to processes. Beside the structure as position paper, to give more weight to some basic assertions, results of recent research are abridged and commented upon in line with new paradigms.…