Search results for "Information Systems"
showing 10 items of 1926 documents
Some algebraic clues towards a syntactic view on the Principles of Non-Contradiction and Excluded-Middle.
2014
This short paper just considers the possibility of a new view for posing and proving the Aristotle’s Principles of Non-Contradiction and Excluded-Middle. It is done by means of their refutability, or deducibility, respectively, under Tarski’s Consequence Operators.
Hierarchical Syntactic Models for Human Activity Recognition through Mobility Traces
2019
AbstractRecognizing users’ daily life activities without disrupting their lifestyle is a key functionality to enable a broad variety of advanced services for a Smart City, from energy-efficient management of urban spaces to mobility optimization. In this paper, we propose a novel method for human activity recognition from a collection of outdoor mobility traces acquired through wearable devices. Our method exploits the regularities naturally present in human mobility patterns to construct syntactic models in the form of finite state automata, thanks to an approach known asgrammatical inference. We also introduce a measure ofsimilaritythat accounts for the intrinsic hierarchical nature of su…
Novel high-performance QCA Fredkin gate and designing scalable QCA binary to gray and vice versa
2022
AbstractIn the design of digital logic circuits, QCA technology is an excellent alternative to CMOS technology. Its advantages over CMOS include low power consumption, fast circuit switching, and nanoscale design. Circuits that convert data between different formats are code converters. Code converters have an essential role in high-performance computing and signal processing. In this paper, first, we proposed a novel QCA structure for the quantum reversible Fredkin gate. Second, we proposed 4-bit and 8-bit QCA binary-to-gray converter and vice versa. For the second proposal, both reversible and irreversible structures are suggested. The proposed structures are scalable up to N bits. To cha…
Strategies for annotation and curation of translational databases: the eTUMOUR project
2012
Altres ajuts: LSHC/CT2004-503094 The eTUMOUR (eT) multi-centre project gathered in vivo and ex vivo magnetic resonance (MR) data, as well as transcriptomic and clinical information from brain tumour patients, with the purpose of improving the diagnostic and prognostic evaluation of future patients. In order to carry this out, among other work, a database-the eTDB-was developed. In addition to complex permission rules and software and management quality control (QC), it was necessary to develop anonymization, processing and data visualization tools for the data uploaded. It was also necessary to develop sophisticated curation strategies that involved on one hand, dedicated fields for QC-gene…
Perinatal Database in Germany
1995
By collecting standardized data from up to 600,000 deliveries per year in Germany a nation-wide database has been established in recent years enabling not only regional and overregional quality control, but also the scientific analysis of rare maternal and fetal complication. During the observation period of 10 years the understanding of perinatal risk factors has considerably improved and the perinatal mortality has declined from 9.4 to 6.4 (per 1,000 deliveries). From the huge amount of calculations typical results are presented.
On using novel “Anti-Bayesian” techniques for the classification of dynamical data streams
2017
The classification of dynamical data streams is among the most complex problems encountered in classification. This is, firstly, because the distribution of the data streams is non-stationary, and it changes without any prior “warning”. Secondly, the manner in which it changes is also unknown. Thirdly, and more interestingly, the model operates with the assumption that the correct classes of previously-classified patterns become available at a juncture after their appearance. This paper pioneers the use of unreported novel schemes that can classify such dynamical data streams by invoking the recently-introduced “Anti-Bayesian” (AB) techniques. Contrary to the Bayesian paradigm, that compare…
Discrimination and Molecular Design of New Theoretical Hypolipaemic Agents Using the Molecular Connectivity Functions
2000
The molecular topology model and discriminant analysis have been applied to the prediction and QSAR interpretation of some pharmacological properties of hypolipaemic drugs using multivariable regression equations with their statistical parameters. Regression analysis showed that the molecular topology model predicts these properties. The corresponding stability (cross-validation) studies done on the selected prediction models confirmed the goodness of the fits. The method used for hypolipaemic activity selection was a linear discriminant analysis (LDA). We make use of the pharmacological distribution diagrams (PDDs) as a visualizing technique for the identification and design of new hypolip…
QSAR Analysis of Hypoglycemic Agents Using the Topological Indices
2001
The molecular topology model and discriminant analysis have been applied to the prediction of some pharmacological properties of hypoglycemic drugs using multiple regression equations with their statistical parameters. Regression analysis showed that the molecular topology model predicts these properties. The corresponding stability (cross-validation) studies performed on the selected prediction models confirmed the goodness of the fits. The method used for hypoglycemic activity selection was a linear discriminant analysis (LDA). We make use of the pharmacological distribution diagrams (PDDs) as a visualizing technique for the identification and selection of new hypoglycemic agents, and we …
Lattice quantum hadrodynamics on a CRAY Y-MP
1992
Quantum corrections to the mean-field equation of state for nuclear matter are estimated in a lattice simulation of quantum hadrodynamics on a CRAY Y-MP. In contrast with lattice quantum chromodynamics, where coordinate space methods are the standard, the calculations are carried out in momentum space and on nonhypercubic (irregular) lattices. The quantum corrections to the known, mean-field equation of state were found to be considerable. The time frame of the project and the large computational needs of the program required the use of powerful supercomputers, like the CRAY Y-MP, which are capable of performing at a very high computing speed by using both vector and parallel hardware, the …
Recent Developments in Quantum Algorithms and Complexity
2014
We survey several recent developments in quantum algorithms and complexity: Reichardt’s characterization of quantum query algorithms via span programs [15]; New bounds on the number of queries that are necessary for simulating a quantum algorithm that makes a very small number of queries [2]; Exact quantum algorithms with superlinear advantage over the best classical algorithm [4].