Search results for " Computer Science"
showing 10 items of 3983 documents
Gradation of Fuzzy Preconcept Lattices
2021
Noticing certain limitations of concept lattices in the fuzzy context, especially in view of their practical applications, in this paper, we propose a more general approach based on what we call graded fuzzy preconcept lattices. We believe that this approach is more adequate for dealing with fuzzy information then the one based on fuzzy concept lattices. We consider two possible gradation methods of fuzzy preconcept lattice—an inner one, called D-gradation and an outer one, called M-gradation, study their properties, and illustrate by a series of examples, in particular, of practical nature.
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…
Heuristics for the Constrained Incremental Graph Drawing Problem
2019
Abstract Visualization of information is a relevant topic in Computer Science, where graphs have become a standard representation model, and graph drawing is now a well-established area. Within this context, edge crossing minimization is a widely studied problem given its importance in obtaining readable representations of graphs. In this paper, we focus on the so-called incremental graph drawing problem, in which we try to preserve the user’s mental map when obtaining successive drawings of the same graph. In particular, we minimize the number of edge crossings while satisfying some constraints required to preserve the position of vertices with respect to previous drawings. We propose heur…
Approximate supervised learning of quantum gates via ancillary qubits
2018
We present strategies for the training of a qubit network aimed at the ancilla-assisted synthesis of multi-qubit gates based on a set of restricted resources. By assuming the availability of only time-independent single and two-qubit interactions, we introduce and describe a supervised learning strategy implemented through momentum-stochastic gradient descent with automatic differentiation methods. We demonstrate the effectiveness of the scheme by discussing the implementation of non-trivial three qubit operations, including a Quantum Fourier Transform (QFT) and a half-adder gate.
Symmetry as an Intrinsically Dynamic Feature
2010
Symmetry is one of the most prominent spatial relations perceived by humans, and has a relevant role in attentive mechanisms regarding both visual and auditory systems. The aim of this paper is to establish symmetry, among the likes of motion, depth or range, as a dynamic feature in artificial vision. This is achieved in the first instance by assessing symmetry estimation by means of algorithms, putting emphasis on erosion and multi- resolution approaches, and confronting two ensuing problems: the isolation of objects from the context, and the pertinence (or lack thereof) of some salient points, such as the centre of mass. Next a geometric model is illustrated and detailed, and the problem …
MAD+. Introducing Misconceptions in the Temporal Analysis of the Mathematical Modelling Process of a Fermi Problem
2021
This work describes how the combination of the mistakes committed by a group of pre-service teachers when solving a Fermi problem, with the representation of the temporal analysis of their resolutions, can offer more in-depth information about their conceptual misconceptions regarding mathematical and modelling concepts. The combined representation allows knowing when mistakes occur and provides a powerful tool for instructors to adapt the teaching–learning processes of mathematics at all levels of education. Our study is based on a recent categorisation of students’ mistakes, together with the creation of a new representation tool, called MAD+, that can combine all this information. The ma…
Diffusive neural network
2002
Abstract A non-connectionist model of a neuronal network based on passive diffusion of neurotransmitters is presented as an alternative to hard-wired artificial neural networks. Classic thermodynamical approach shows that the diffusive network is capable of exhibiting asymptotic stability and a dynamics resembling that of a chaotic system. Basic computational capabilities of the net are discussed based on the equivalence with a Turing machine. The model offers a way to represent mass-sustained brain functions in terms of recurrent behaviors in the phase space.
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…