Search results for "Tribute"

showing 10 items of 1455 documents

Knowledge-based verification of concatenative programming patterns inspired by natural language for resource-constrained embedded devices

2020

We propose a methodology to verify applications developed following programming patterns inspired by natural language that interact with physical environments and run on resource-constrained interconnected devices. Natural language patterns allow for the reduction of intermediate abstraction layers to map physical domain concepts into executable code avoiding the recourse to ontologies, which would need to be shared, kept up to date, and synchronized across a set of devices. Moreover, the computational paradigm we use for effective distributed execution of symbolic code on resource-constrained devices encourages the adoption of such patterns. The methodology is supported by a rule-based sys…

Computer scienceinternet of thing02 engineering and technologycomputer.software_genrelcsh:Chemical technologyBiochemistryOracleArticleAnalytical ChemistryDomain (software engineering)Softwarewireless sensor network0202 electrical engineering electronic engineering information engineeringlcsh:TP1-1185Electrical and Electronic Engineeringdistributed programmingwireless sensor networksEmbedded systemInstrumentationAbstraction (linguistics)concatenative languagessymbolic programmingSettore ING-INF/05 - Sistemi Di Elaborazione Delle InformazioniSymbolic programmingProgramming languagebusiness.industryRuntime verification020206 networking & telecommunications020207 software engineeringcomputer.file_formatforthinternet of thingsAtomic and Molecular Physics and Opticsconcatenative languageProgramming patternsembedded systemsExecutablebusinesscomputerNatural language
researchProduct

The Stability-Plasticity Dilemma: Investigating the Continuum from Catastrophic Forgetting to Age-Limited Learning Effects

2013

The stability-plasticity dilemma is a well-know constraint for artificial and biological neural systems. The basic idea is that learning in a parallel and distributed system requires plasticity for the integration of new knowledge, but also stability in order to prevent the forgetting of previous knowledge. Too much plasticity will result in previously encoded data being constantly forgotten, whereas too much stability will impede the efficient coding of this data at the level of the synapses. However, for the most part, neural computation has addressed the problems related to excessive plasticity or excessive stability as two different fields in the literature.

Computer sciencelcsh:BF1-990Catastrophic Forgetting02 engineering and technologyPlasticity050105 experimental psychologyPsycholinguisticsLearning effectModels of neural computationConnectionismneural computation0202 electrical engineering electronic engineering information engineeringPsychology0501 psychology and cognitive sciencesGeneral PsychologyComputingMilieux_MISCELLANEOUSCognitive scienceForgettingPsycholinguisticsParallel Distributed Processingbusiness.industryAge of Acquisition05 social sciencesOpinion ArticleDilemmalcsh:Psychology[ SDV.NEU ] Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]020201 artificial intelligence & image processing[SDV.NEU]Life Sciences [q-bio]/Neurons and Cognition [q-bio.NC]Artificial intelligencebusinessCoding (social sciences)Frontiers in Psychology
researchProduct

An Online Observer for Minimization of Pulsating Torque in SMPM Motors.

2015

A persistent problem of surface mounted permanent magnet (SMPM) motors is the non-uniformity of the developed torque. Either the motor design or the motor control needs to be improved in order to minimize the periodic disturbances. This paper proposes a new control technique for reducing periodic disturbances in permanent magnet (PM) electro-mechanical actuators, by advancing a new observer/estimator paradigm. A recursive estimation algorithm is implemented for online control. The compensating signal is identified and added as feedback to the control signal of the servo motor. Compensation is evaluated for different values of the input signal, to show robustness of the proposed method.

Computer sciencelcsh:Medicine02 engineering and technologyBioinformaticsInfographics01 natural sciences0202 electrical engineering electronic engineering information engineeringlcsh:Science010302 applied physicsMultidisciplinaryFourier AnalysisPhysicsApplied MathematicsSimulation and ModelingClassical MechanicsSignal Processing Computer-AssistedEquipment DesignSignal FilteringRotorsPhysical SciencesMagnetsEngineering and TechnologyGraphsAlgorithmsResearch ArticleComputer and Information SciencesObserver (quantum physics)Materials ScienceServomotorResearch and Analysis MethodsOnline SystemsFeedbackMagneticsMotionRobustness (computer science)Control theory0103 physical sciencesTorqueEnginesMaterials by AttributeMechanical EngineeringData Visualization020208 electrical & electronic engineeringlcsh:RMotor controlModels TheoreticalBandpass FiltersVibrationTorqueDirect torque controlMagnetSignal Processinglcsh:QActuatorMathematicsPLoS ONE
researchProduct

A Generic Approach to Scheduling and Checkpointing Workflows

2018

This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as HEFT and MinMin and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CkptAll), which is an overkill when failures are rare events, …

Computer scienceworkflowDistributed computing02 engineering and technologyTheoretical Computer ScienceScheduling (computing)résiliencecheckpointfail-stop error0202 electrical engineering electronic engineering information engineeringRare eventsOverhead (computing)[INFO]Computer Science [cs]Resilience (network)resilienceComplement (set theory)020203 distributed computing020206 networking & telecommunications020202 computer hardware & architecture[INFO.INFO-PF]Computer Science [cs]/Performance [cs.PF]Task (computing)WorkflowHardware and Architectureerreur fatale[INFO.INFO-DC]Computer Science [cs]/Distributed Parallel and Cluster Computing [cs.DC]HeuristicsSoftware
researchProduct

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…

Connected componentInformation Systems and ManagementBridging (networking)business.industryComputer scienceDistributed computingComplex systemCommunity structureFilter (signal processing)Modular designComputer Science ApplicationsTheoretical Computer ScienceSet (abstract data type)Artificial IntelligenceControl and Systems EngineeringComponent (UML)businessSoftwareInformation Sciences
researchProduct

On the Robust Synthesis of Logical Consensus Algorithms for Distributed Intrusion Detection

2013

We introduce a novel consensus mechanism by which the agents of a network can reach an agreement on the value of a shared logical vector function depending on binary input events. Based on results on the convergence of finite--state iteration systems, we provide a technique to design logical consensus systems that minimize the number of messages to be exchanged and the number of steps before consensus is reached, and that can tolerate a bounded number of failed or malicious agents. We provide sufficient joint conditions on the input visibility and the communication topology for the method's applicability. We describe the application of our method to two distributed network intrusion detecti…

Consensus algorithmTheoretical computer scienceComputer scienceDistributed computingVisibility (geometry)Binary numberValue (computer science)Topology (electrical circuits)Computer Science::Multiagent SystemsSettore ING-INF/04 - AutomaticaControl and Systems EngineeringConsensus distributed algorithms intrusion detection security.Bounded functionConvergence (routing)Electrical and Electronic EngineeringVector-valued function
researchProduct

2014

This paper investigates the finite-time distributedL2–L∞consensus control problem of multiagent systems with parameter uncertainties. The relative states of neighboring agents are used to construct the control law and some agents know their own states. By substituting the control input into multiagent systems, an augmented closed-loop system is obtained. Then, we analyze its finite-time boundedness (FTB) and finite-timeL2–L∞performance. A sufficient condition for the existence of the designed controller is given with the form of linear matrix inequalities (LMIs). Finally, simulation results are described.

ConsensusControl theorybusiness.industryApplied MathematicsDistributed generationMulti-agent systemControl (management)Construct (python library)Linear matrixFinite timebusinessAnalysisMathematicsAbstract and Applied Analysis
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

The Brave New World of development in the internetwork computing architecture (InterNCA): or how distributed computing platforms will change systems …

1998

This essay is a speculation of the impact of the next generation technological platform — the internetwork computing architecture (InterNCA) — on systems development. The impact will be deep and pervasive and more substantial than when computing migrated from closed computer rooms to ubiquitous personal computers and flexible client-server solutions. Initially, by drawing upon the notion of a technological frame, the InterNCA, and how it differs from earlier technological frames, is examined. Thereafter, a number of hypotheses are postulated with regard to how the architecture will affect systems development content, scope, organization and processes. Finally, some suggestions for where the…

Context-aware pervasive systemsUtility computingScope (project management)Computer Networks and CommunicationsComputer scienceDistributed computingEnd-user computingFrame (networking)Systems designArchitectureSoftwareInformation SystemsAutonomic computingInformation Systems Journal
researchProduct

A Virtual Tool for Load Flow Analysis in a Micro-Grid

2020

This paper proposes a virtual tool for load flow analysis in energy distribution systems of micro-grids. The solution is based on a low-cost measurement architecture, which entails low-voltage power measurements in each secondary substation and a voltage measurement at the beginning of the medium voltage (MV) feeder. The proposed virtual tool periodically queries these instruments to acquire the measurements. Then, it implements a backward&ndash

Control and OptimizationComputer scienceEnergy Engineering and Power Technologylcsh:TechnologyElectric power systemDistributed generatorPower-flow studyElectrical and Electronic Engineeringsmart gridEngineering (miscellaneous)Simulationdistributed generationRenewable Energy Sustainability and the Environmentbusiness.industrylcsh:TMicro gridPower (physics)Smart gridpower systemFlow (mathematics)Distributed generationload flowNode (circuits)micro-gridmeasurement uncertaintiesbusinessSettore ING-INF/07 - Misure Elettriche E ElettronicheEnergy (miscellaneous)Voltage
researchProduct