Search results for "oftware"
showing 10 items of 7396 documents
On utilizing dependence-based information to enhance micro-aggregation for secure statistical databases
2011
Published version of an article in the journal: Pattern Analysis and Applications. Also available from the publisher at: http://dx.doi.org/10.1007/s10044-011-0199-9 We consider the micro-aggregation problem which involves partitioning a set of individual records in a micro-data file into a number of mutually exclusive and exhaustive groups. This problem, which seeks for the best partition of the micro-data file, is known to be NP-hard, and has been tackled using many heuristic solutions. In this paper, we would like to demonstrate that in the process of developing micro-aggregation techniques (MATs), it is expedient to incorporate information about the dependence between the random variable…
Chebyshev’s Method on Projective Fluids
2020
We demonstrate the acceleration potential of the Chebyshev semi-iterative approach for fluid simulations in Projective Dynamics. The Chebyshev approach has been successfully tested for deformable bodies, where the dynamical system behaves relatively linearly, even though Projective Dynamics, in general, is fundamentally nonlinear. The results for more complex constraints, like fluids, with a particular nonlinear dynamical system, remained unknown so far. We follow a method describing particle-based fluids in Projective Dynamics while replacing the Conjugate Gradient solver with Chebyshev’s method. Our results show that Chebyshev’s method can be successfully applied to fluids and potentially…
A PARALLEL ALGORITHM FOR ANALYZING CONNECTED COMPONENTS IN BINARY IMAGES
1992
In this paper, a parallel algorithm for analyzing connected components in binary images is described. It is based on the extension of the Cylindrical Algebraic Decomposition (CAD) to a two-dimensional (2D) discrete space. This extension allows us to find the number of connected components, to determine their connectivity degree, and to solve the visibility problem. The parallel implementation of the algorithm is outlined and its time/space complexity is given.
Extracting modular-based backbones in weighted networks
2021
Abstract Networks are an adequate representation for modeling and analyzing a great variety of complex systems. However, understanding networks with millions of nodes and billions of connections can be pretty challenging due to memory and time constraints. Therefore, selecting the relevant nodes and edges of these large-scale networks while preserving their core information is a major issue. In most cases, the so-called backbone extraction methods are based either on coarse-graining or filtering approaches. Coarse-graining techniques reduce the network size by gathering similar nodes into super-nodes, while filter-based methods eliminate nodes or edges according to a statistical property.In…
UML-Based Reliability Modeling of Network Services, a UDP Echo Service Case Study
2009
In the paper, we discuss state space reliability modeling formalism of distributed systems and services compliant with UML metamodel. Behavior of modeled application system we describe in terms of states. Service generation process we represent as a sequence of application system states. State space approach allows us to define dependence between application system components via dependence between components states and states input, output parameters. Reliability of application system component we define for each simply action state. Reliability of a service we express by components reliability in states determined by service generation process. As an example, we analyze reliability of cli…
The neural basis of sublexical speech and corresponding nonspeech processing: a combined EEG-MEG study.
2014
Abstract We addressed the neural organization of speech versus nonspeech sound processing by investigating preattentive cortical auditory processing of changes in five features of a consonant–vowel syllable (consonant, vowel, sound duration, frequency, and intensity) and their acoustically matched nonspeech counterparts in a simultaneous EEG–MEG recording of mismatch negativity (MMN/MMNm). Overall, speech–sound processing was enhanced compared to nonspeech sound processing. This effect was strongest for changes which affect word meaning (consonant, vowel, and vowel duration) in the left and for the vowel identity change in the right hemisphere also. Furthermore, in the right hemisphere, spe…
The representation of segmental information: an fMRI investigation of the consonant-vowel distinction
2004
Harvard University, Cambridge, MA, USAAvailable online 23 July 2004IntroductionRecent studies suggest that consonants and vowels are repre-sented separately in cognitive/neural space. Much of the evidencecomes from research on dysgraphia (for review, see Miceli & Cap-asso, submitted). In the first place, letter substitution errors preservethe consonant/vowel (CV) status of the target (e.g., cinema fi ciremaor cinoma, but not cintma). Second, there are reports of selectiveimpairment for consonants or vowels. Additional evidence comesfrom disorders of phonology, demonstrating the dissociability be-tween consonants and vowels (Caramazza, Chialant, Capasso, Mthe ISI was variable (mean 6.75 s). Th…
Spike train statistics for consonant and dissonant musical accords in a simple auditory sensory model
2010
The phenomena of dissonance and consonance in a simple auditory sensory model composed of three neurons are considered. Two of them, here so-called sensory neurons, are driven by noise and subthreshold periodic signals with different ratio of frequencies, and its outputs plus noise are applied synaptically to a third neuron, so-called interneuron. We present a theoretical analysis with a probabilistic approach to investigate the interspike intervals statistics of the spike train generated by the interneuron. We find that tones with frequency ratios that are considered consonant by musicians produce at the third neuron inter-firing intervals statistics densities that are very distinctive fro…
Constraint Management in Engineering of Complex Information Systems
2009
We propose to build an engineering environment for information systems by using metamodels, OCL and symbolic model checkers to manage constraints. Our proposal is based on a definition of constraints as 3D spaces with dimensions corresponding to UML diagrams, constructs, and abstraction levels. We show how such environments can help with engineering quality complex systems by allowing to lift up a part of constraint verifications.
Editorial message
2006
Geometric Computing and Reasoning (GCR) is a new track of SAC and it is dedicated to the recent trends in the domain of geometric constraint solving and automated, or computer aided, deduction in geometry.