Search results for "operating systems"

showing 10 items of 35 documents

Quantum algorithms for formula evaluation

2010

We survey the recent sequence of algorithms for evaluating Boolean formulas consisting of NAND gates.

FOS: Computer and information sciencesQuantum PhysicsHardware_MEMORYSTRUCTURESFOS: Physical sciencesComputational Complexity (cs.CC)Computer Science::PerformanceComputer Science::Hardware ArchitectureComputer Science - Computational ComplexityComputer Science::Emerging TechnologiesComputer Science - Data Structures and AlgorithmsData Structures and Algorithms (cs.DS)Hardware_ARITHMETICANDLOGICSTRUCTURESQuantum Physics (quant-ph)Computer Science::Operating SystemsHardware_LOGICDESIGN
researchProduct

An Alternative Derivation of Johannisson's Regular Perturbation Model

2012

We provide here an alternative derivation of the generalization of the nonlinear Turin model for dispersion unmanaged coherent optical links provided in Johannisson's report [arXiv:1205.2193]

FOS: Physical sciencesComputer Science::Operating SystemsPhysics - OpticsOptics (physics.optics)
researchProduct

Reverse and normal drag along a fault

2005

An analysis of the theoretical displacement field around a single dip-slip fault at depth reveals that normal and reverse fault drag develop by perturbation flow induced by fault slip. We analytically model the heterogeneous part of the instantaneous displacement field of an isolated two-dimensional mode II fault in an infinite, homogeneous elastic body in response to fault slip. Material on both sides of the fault is displaced and ‘opposing circulation cells’ arise on opposite sides of the fault, with displacement magnitudes increasing towards the center of the fault. Both normal and reverse drag can develop at the fault center depending on the angle between the markers and the fault; norm…

Flow (psychology)Mode (statistics)Perturbation (astronomy)GeologyGeometryFault (power engineering)Displacement (vector)Physics::Fluid DynamicsComputer Science::Hardware ArchitectureDragDisplacement fieldGeotechnical engineeringRollover anticlinesComputer Science::Operating SystemsComputer Science::Distributed Parallel and Cluster ComputingGeologyJournal of Structural Geology
researchProduct

Job seeker's spatial equilibrium in a fuzzy mathematical framework

1990

This paper incorporates complex behavior in a job seeking strategy model. Since the state of information is imperfect, a job seeker faces an imprecise labor market. His behavior is fuzzy and variable. It is shown how this complex behavior can be described by fuzzy subsets theory and bifurcation analysis. The latter examines the discontinuous phenomena. Then it is proved that a job seeker’s fuzzy equilibrium with a spatial constraint exists.

Internal and EU commerceComputingMilieux_THECOMPUTINGPROFESSIONStatisticsConsumer affairsOperations research[SHS.ECO]Humanities and Social Sciences/Economics and FinanceOperational researchDomestic marketingControl theory[ SHS.ECO ] Humanities and Social Sciences/Economies and finances[SHS.ECO] Humanities and Social Sciences/Economics and FinanceComputer Science::Operating SystemsRecherche opérationnelleAutomatique
researchProduct

Biological and clinical significance of dysplastic hematopoiesis in patients with newly diagnosed multiple myeloma

2020

On behalf of the PETHEMA/GEM Cooperative Group.

MaleOncologyPhysics::Instrumentation and Detectorsmedicine.medical_treatmentKaplan-Meier EstimateHematopoietic stem cell transplantationBiochemistryhemic and lymphatic diseasesAntineoplastic Combined Chemotherapy ProtocolsTumor MicroenvironmentProspective StudiesComputer Science::Operating SystemsIn Situ Hybridization FluorescenceMultiple myelomaRandomized Controlled Trials as TopicComputer Science::Cryptography and SecurityHazard ratioHematopoietic Stem Cell TransplantationHigh-Throughput Nucleotide SequencingHematologyMiddle AgedFlow CytometryPrognosisCombined Modality TherapyProgression-Free Survivalmedicine.anatomical_structureFemaleClonal HematopoiesisMultiple Myelomamedicine.medical_specialtyImmunologyTransplantation AutologousInternal medicinemedicineHumansClinical significanceProgression-free survivalComputer Science::Distributed Parallel and Cluster ComputingAgedAntineoplastic Combined Chemotherapy Protocolbusiness.industryCell Biologymedicine.diseaseTransplantationClinical Trials Phase III as TopicMyelodysplastic SyndromesMutationBone marrowbusinessMonoclonal gammopathy of undetermined significance
researchProduct

Handling precedence constraints in scheduling problems by the sequence pair representation

2015

In this paper, we show that sequence pair (SP) representation, primarily applied to the rectangle packing problems appearing in the VLSI industry, can be a solution representation of precedence constrained scheduling. We present three interpretations of sequence pair, which differ in complexity of schedule evaluation and size of a corresponding solution space. For each interpretation we construct an incremental precedence constrained SP neighborhood evaluation algorithm, computing feasibility of each solution in the insert neighborhood in an amortized constant time per examined solution, and prove the connectivity property of the considered neighborhoods. To compare proposed interpretations…

Mathematical optimizationPrecedence diagram methodControl and Optimizationrectangle packing problemMultiprocessing0102 computer and information sciences02 engineering and technology01 natural sciencesScheduling (computing)0202 electrical engineering electronic engineering information engineeringDiscrete Mathematics and CombinatoricsschedulingComputer Science::Operating SystemsMathematicsVery-large-scale integrationAmortized analysisApplied MathematicsJob scheduling problemComputer Science ApplicationsComputational Theory and Mathematics010201 computation theory & mathematicsMetaheuristic algorithmsTheory of computation020201 artificial intelligence & image processingAlgorithmprecedence constraintssequence pairJournal of Combinatorial Optimization
researchProduct

Scheduling Multimodal Transportation Systems

2004

Abstract In this paper a Lagrangian based heuristic procedure for scheduling transportation networks is presented. The solution procedure schedules a single line at a time, possibly correcting the previous decisions at each step.

Mathematical optimizationScheduleInformation Systems and ManagementGeneral Computer ScienceComputer scienceSchedulingTransportation systems; Multimodality; Scheduling; Transfer coordinationReal-time computingScheduling (production processes)Dynamic priority schedulingTransportation systemsManagement Science and Operations ResearchIndustrial and Manufacturing EngineeringFair-share schedulingScheduling (computing)symbols.namesakeModeling and SimulationTwo-level schedulingsymbolsTransportation systemTransfer coordinationComputer Science::Operating SystemsLagrangianMultimodality
researchProduct

Identification of Distributed Systems with Logical Interaction Structure

2012

This paper focuses on the structure identification problem for a class of networked systems, where the interaction among components or agents is described through logical maps. In particular, agents are heterogeneous cooperating systems, i.e. they may have different individual dynamics and different interaction rules depending on input events. While we assume that the individual agents' dynamics are known, each agent has partial knowledge of the logical map encoding the interaction of another agent with its neighbors. Based on the so-called algebraic normal form for binary functions, we present a technique by which the network structure described by a logical function can be dynamically est…

Partial knowledgeTheoretical computer scienceInteraction ruleDistributed computingBinary numberClass (philosophy)Individual dynamicAlgebraic normal formLogical functionAlgebraic normal forms; Binary functions; Cooperating systems; Distributed systems; Individual agent; Individual dynamics; Interaction rules; Interaction structures; Logical functions; Logical maps; Lower approximation; Network structures; Networked systems; Partial knowledge; Real systems; Structure identification; Truth tablesBinary functionSettore ING-INF/04 - AutomaticaLogical mapMathematicsCooperating systemStructure (mathematical logic)Networked systemStructure identificationTruth tablesTruth tableMobile robotReal systemParameter identification problemAlgebraic normal formIdentification (information)Lower approximationInteraction structureIndividual agentDistributed systemNetwork structure
researchProduct

Manipulating antiferromagnets with magnetic fields: Ratchet motion of multiple domain walls induced by asymmetric field pulses

2016

Future applications of antiferromagnets (AFs) in many spintronics devices rely on the precise manipulation of domain walls. The conventional approach using static magnetic fields is inefficient due to the low susceptibility of AFs. Recently proposed electrical manipulation with spin-orbit torques is restricted to metals with a specific crystal structure. Here we propose an alternative, broadly applicable approach: using asymmetric magnetic field pulses to induce controlled ratchet motion of AF domain walls. The efficiency of this approach is based on three peculiarities of AF dynamics. First, a time-dependent magnetic field couples with an AF order parameter stronger than a static magnetic …

PhysicsCondensed Matter - Materials SciencePhysics and Astronomy (miscellaneous)SpintronicsField (physics)RatchetDynamics (mechanics)Materials Science (cond-mat.mtrl-sci)FOS: Physical sciences02 engineering and technology021001 nanoscience & nanotechnologyRatchet effectMagnetostatics01 natural sciencesMagnetic fieldDomain (software engineering)Classical mechanics0103 physical sciences010306 general physics0210 nano-technologyComputer Science::Operating SystemsApplied Physics Letters
researchProduct

Nonlocal energy density functionals for low-energy nuclear structure

2014

We introduce a finite-range pseudopotential built as an expansion in derivatives up to next-to-next-to-next-to-leading order (N$^3$LO) and we calculate the corresponding nonlocal energy density functional (EDF). The coupling constants of the nonlocal EDF, for both finite nuclei and infinite nuclear matter, are expressed through the parameters of the pseudopotential. All central, spin-orbit, and tensor terms of the pseudopotential are derived both in the spherical-tensor and Cartesian representation. At next-to-leading order (NLO), we also derive relations between the nonlocal EDF expressed in the spherical-tensor and Cartesian formalism. Finally, a simplified version of the finite-range pse…

PhysicsCoupling constantNuclear and High Energy PhysicsEnergy density functionalNuclear Theory[PHYS.NUCL]Physics [physics]/Nuclear Theory [nucl-th]Nuclear structureFOS: Physical sciencesNuclear matterlaw.inventionPseudopotentialNuclear Theory (nucl-th)Low energylawEnergy densityCartesian coordinate systemComputer Science::Operating SystemsMathematical physics
researchProduct