Search results for "complexi"

showing 10 items of 1116 documents

A new autonomous data transmission reduction method for wireless sensors networks

2018

International audience; The inherent limitation in energy resources and computational power for sensor nodes in a Wireless Sensor Network, poses the challenge of extending the lifetime of these networks. Since radio communication is the dominant energy consuming activity, most presented approaches focused on reducing the number of data transmitted to the central workstation. This can be achieved by deploying both on the workstation and the sensor node a synchronized prediction model capable of forecasting future values. Thus, enabling the sensor node to transmit only the values that surpasses a predefined error threshold. This mechanism offers a decrease in the cost of transmission energy f…

Computer sciencebusiness.industryReal-time computing020206 networking & telecommunications[INFO.INFO-SE]Computer Science [cs]/Software Engineering [cs.SE]02 engineering and technology[INFO.INFO-MO]Computer Science [cs]/Modeling and Simulation7. Clean energy[INFO.INFO-IU]Computer Science [cs]/Ubiquitous ComputingReduction (complexity)[INFO.INFO-CR]Computer Science [cs]/Cryptography and Security [cs.CR]Transmission (telecommunications)[INFO.INFO-MA]Computer Science [cs]/Multiagent Systems [cs.MA]020204 information systemsSensor node0202 electrical engineering electronic engineering information engineeringWireless[INFO.INFO-ET]Computer Science [cs]/Emerging Technologies [cs.ET][INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]businessWireless sensor networkEnergy (signal processing)Data transmissionData reduction2018 IEEE Middle East and North Africa Communications Conference (MENACOMM)
researchProduct

Numerical experiments with a parallel fast direct elliptic solver on Cray T3E

1997

A parallel fast direct O(N log N) solver is shortly described for linear systems with separable block tridiagonal matrices. A good parallel scalability of the proposed method is demonstrated on a Cray T3E parallel computer using MPI in communication. Also, the sequential performance is compared with the well-known BLKTRI-implementation of the generalized. cyclic reduction method using a single processor of Cray T3E.

ComputerSystemsOrganization_COMPUTERSYSTEMIMPLEMENTATIONTridiagonal matrixComputer scienceLinear systemMathematicsofComputing_NUMERICALANALYSISParallel algorithmParallel computingComputerSystemsOrganization_PROCESSORARCHITECTURESSolverMatrix (mathematics)ScalabilityPoisson's equationTime complexityCyclic reductionBlock (data storage)
researchProduct

Dynamics and topological mass of skyrmionic spin structures (presentation video)

2014

Skyrmions are topologically protected particle-like configurations, with a topological complexity described by their Skyrmion number. In magnetic systems, they have been numerically predicted to exhibit rich dynamics, such as the gyrotropic and breathing modes, dominated by their topology. Recent experimental advances brought their static manipulation well under control. However, their dynamical behaviour is largely unexplored experimentally. In this work, we provide with the first direct observation of eigenmode skyrmion dynamics. In particular, we present dynamical imaging data with high temporal and spatial resolution to demonstrate the GHz gyrotropic mode of a single skyrmion bubble, as…

Condensed Matter::Quantum GasesPhysicsTopological complexitySpintronicsMagnetismSkyrmionmedia_common.quotation_subjectCondensed Matter::Mesoscopic Systems and Quantum Hall EffectInertiaTopologyClassical mechanicsNormal modeTopology (chemistry)media_commonSpin-½SPIE Proceedings
researchProduct

Multiscale Information Storage of Linear Long-Range Correlated Stochastic Processes

2019

Information storage, reflecting the capability of a dynamical system to keep predictable information during its evolution over time, is a key element of intrinsic distributed computation, useful for the description of the dynamical complexity of several physical and biological processes. Here we introduce a parametric approach which allows one to compute information storage across multiple timescales in stochastic processes displaying both short-term dynamics and long-range correlations (LRC). Our analysis is performed in the popular framework of multiscale entropy, whereby a time series is first "coarse grained" at the chosen timescale through low-pass filtering and downsampling, and then …

Conditional entropyFOS: Computer and information sciencesComputer scienceStochastic processDynamical system01 natural sciencesMeasure (mathematics)010305 fluids & plasmasMethodology (stat.ME)Multiscale Entropy Information Theory ComplexityAutoregressive model0103 physical sciencesState space010306 general physicsRepresentation (mathematics)AlgorithmStatistics - MethodologyParametric statistics
researchProduct

Entropy-Based Detection of Complexity and Nonlinearity in Short-Term Heart Period Variability under different Physiopathological States

2020

We compare different estimators of a popular en-tropy-based nonlinear dynamic measure, i.e. the conditional entropy (CE), as regards their ability to assess the complexity and nonlinearity of short-term heart rate variability (HRV). The CE is computed using binning, kernel and nearest neighbor entropy estimators in HRV time series measured from young, old and post-myocardial infarction patients studied at rest and during orthostatic stress. We find that the three estimators yield similar patterns of CE, but different patterns of nonlinear dynamics, across groups and conditions. These results suggest that the strategy for CE estimation is not crucial for the quantification of complexity, but…

Conditional entropynearest neighborHeart period variabilityEstimatork-nearest neighbors algorithmConditional entropy (CE)Nonlinear systemStatisticsSettore ING-INF/06 - Bioingegneria Elettronica E InformaticaEntropy (information theory)Heart rate variabilitynonlinear analysis methodTime seriescomplexityheart rate variability (HRV)Mathematics
researchProduct

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.

Connected componentDegree (graph theory)Artificial IntelligenceDiscrete spaceBinary imageVisibility (geometry)Parallel algorithmComputer Vision and Pattern RecognitionTime complexityAlgorithmSoftwareMathematicsCylindrical algebraic decompositionInternational Journal of Pattern Recognition and Artificial Intelligence
researchProduct

Representing 2D Digital Objects

2000

The paper describes the combination a multi-views approach to represent connected components of 2D binary images. The approach is based on the Object Connectivity Graph (OCG), which is a sub-graph of the connectivity graph generated by the Discrete Cylindrical Algebraic Decomposition(DCAD) performed in the 2D discrete space. This construction allows us to find the number of connected components, to determine their connectivity degree, and to solve visibility problem. We show that the CAD construction, when performed on two orthogonal views, supply information to avoid ambiguities in the interpretation of each image component. The implementation of the algorithm is outlined and the computati…

Connected componentTheoretical computer scienceSettore INF/01 - InformaticaComputational complexity theoryDegree (graph theory)Computer scienceDiscrete spaceDigital topologyShape representationTopologyTheoretical Computer ScienceCylindrical algebraic decompositionComputer ScienceShape decompositionRepresentation (mathematics)Digital topologyConnectivityShape description
researchProduct

Towards human cell simulation

2019

The faithful reproduction and accurate prediction of the phe-notypes and emergent behaviors of complex cellular systems are among the most challenging goals in Systems Biology. Although mathematical models that describe the interactions among all biochemical processes in a cell are theoretically feasible, their simulation is generally hard because of a variety of reasons. For instance, many quantitative data (e.g., kinetic rates) are usually not available, a problem that hinders the execution of simulation algorithms as long as some parameter estimation methods are used. Though, even with a candidate parameterization, the simulation of mechanistic models could be challenging due to the extr…

Constraint-based modelingAgent-based simulation; Big data; Biochemical simulation; Computational intelligence; Constraint-based modeling; Fuzzy logic; High-performance computing; Model reduction; Multi-scale modeling; Parameter estimation; Reaction-based modeling; Systems biology; Theoretical Computer Science; Computer Science (all)Computer scienceBiochemical simulationDistributed computingSystems biologyBig dataComputational intelligenceContext (language use)ING-INF/05 - SISTEMI DI ELABORAZIONE DELLE INFORMAZIONITheoretical Computer ScienceReduction (complexity)Big dataParameter estimationHigh-performance computingComputational intelligenceAgent-based simulationMathematical modelbusiness.industryModel reductionComputer Science (all)Multi-scale modelingINF/01 - INFORMATICASupercomputerVariety (cybernetics)Fuzzy logicReaction-based modelingbusinessSystems biology
researchProduct

A Holistic Approach to Comprehending the Complexity of the Post-growth Era: The Emerging Profile

2015

The goal of this study is to investigate the problems caused by the rapid growth of the global economy, coupled with high population growth and the excessive exploitation of natural resources. The global economy will not be able to maintain its current speed of growth in the long term, so a paradigm shift in production and consumption is necessary, if the collapse of ecosystems and the concurrent depletion of natural resources are to be avoided. This is the reason why capitalism needs to take a turn towards a sustainable and naturally harmonized development model.

Consumption (economics)Post-growthComplexityCapitalismResource depletionsustainabilityBusineParadigm shiftEconomicsProduction (economics)Holistic ApproachEconomic systemSustainable growth ratePost-growth EraSettore SECS-P/08 - Economia E Gestione Delle ImpreseExploitation of natural resources
researchProduct

Reduction in tobacco consumption: an emerging topic within the smoking debate

2009

Consumption (economics)Tobacco harm reductionReduction (complexity)business.industryEnvironmental healthMedicineGeneral MedicinebusinessArchivos de Bronconeumología ((English Edition))
researchProduct