Search results for "Logics"

showing 10 items of 124 documents

The promise of spintronics for unconventional computing

2021

Novel computational paradigms may provide the blueprint to help solving the time and energy limitations that we face with our modern computers, and provide solutions to complex problems more efficiently (with reduced time, power consumption and/or less device footprint) than is currently possible with standard approaches. Spintronics offers a promising basis for the development of efficient devices and unconventional operations for at least three main reasons: (i) the low-power requirements of spin-based devices, i.e., requiring no standby power for operation and the possibility to write information with small dynamic energy dissipation, (ii) the strong nonlinearity, time nonlocality, and/o…

Computer scienceFOS: Physical sciencesApplied Physics (physics.app-ph)02 engineering and technology01 natural sciencesQuantum nonlocalityAffordable and Clean EnergyBlueprintMesoscale and Nanoscale Physics (cond-mat.mes-hall)0103 physical sciencescond-mat.mes-hallElectronic engineeringHardware_ARITHMETICANDLOGICSTRUCTURESStandby powerApplied Physics010302 applied physicsSpintronicsCondensed Matter - Mesoscale and Nanoscale PhysicsMechanical EngineeringReservoir computingPhysics - Applied PhysicsMaterials EngineeringPhysik (inkl. Astronomie)Dissipation021001 nanoscience & nanotechnologyCondensed Matter PhysicsElectronic Optical and Magnetic MaterialsCMOS integrated circuits; Computation theory; Energy dissipation; Green computing; Spin fluctuations; Spintronics; Tunnel junctionsCMOS0210 nano-technologyUnconventional computingphysics.app-ph
researchProduct

TID and SEE Tests of an Advanced 8 Gbit NAND-Flash Memory

2008

We report on the dose and operational mode dependence of error percentage, stand-by current, erase and write time of 8 Gbit / 4 Gbit NAND-flash memories as well as on their static, dynamic and SEFI cross sections.

Non-volatile memoryHardware_MEMORYSTRUCTURESComputer scienceNand flash memorybusiness.industryGigabitHardware_ARITHMETICANDLOGICSTRUCTURESbusinessComputer hardwareFlash memoryHardware_LOGICDESIGN2008 IEEE Radiation Effects Data Workshop
researchProduct

Rapid construction of algebraic axioms from samples

1991

Abstract An axiom is called reliable if it is confirmed in several places in a given sample of algebra. A very effective algorithm for enumerating such axioms is described.

General Computer ScienceTheorySample (material)Theoretical Computer ScienceSeparation axiomAlgebraAxiom of extensionalityMathematics::LogicConstruction of the real numbersTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputingMethodologies_SYMBOLICANDALGEBRAICMANIPULATIONCalculusReverse mathematicsAlgebraic numberAxiomComputer Science(all)MathematicsTheoretical Computer Science
researchProduct

Accounting, microfoundations, hybridization and longitudinal conflict in a Finnish health care organization

2021

PurposeThis article analyzes the cognitive microfoundations, conflicting institutional logics and professional hybridization in a case characterized by conflict.Design/methodology/approachIn contrast to the majority of earlier studies focusing on special health care, the study was conducted in a Finnish basic health care organization. The empirical data include 36 interviews, accounting reports, budgets, newspaper articles and meeting notes collected 2013–2018.FindingsThe use of accounting techniques in this case did not offer professionals sufficient support under conditions of conflict. The authors suggest that this perceived lack of support intensified the negative emotions toward accoun…

kognitioinstituutiotmedia_common.quotation_subjectEconomics Econometrics and Finance (miscellaneous)Accounting researchAccountingContext (language use)terveydenhoitokustannuslaskentaristiriidatammatillinen tietoNewspapercase studytapaustutkimusPoliticsAccountingPerception0502 economics and businessHealth carehealth care accountinghybridizationMicrofoundationsmedia_commonperusterveydenhuoltokirjanpitokirjanpitäjätbusiness.industry05 social scienceskustannustehokkuusCognitioninstitutional logicskonfliktit050201 accountingkäytäntövastuucognitive microfoundationsbudjetointivalvontabusinessPsychology050203 business & managementAccounting, Auditing & Accountability Journal
researchProduct

Weakly algebraizable logics

2000

AbstractIn the paper we study the class of weakly algebraizable logics, characterized by the monotonicity and injectivity of the Leibniz operator on the theories of the logic. This class forms a new level in the non-linear hierarchy of protoalgebraic logics.

AlgebraPhilosophyClass (set theory)HierarchyLogicLeibniz operatorMonotonic functionT-norm fuzzy logicsMathematicsJournal of Symbolic Logic
researchProduct

Economic specialization and diversification at the country and regional level: introducing a conceptual framework to study innovation policy logics

2018

While there has been a shared understanding that innovation policy is about rendering institutional change, there has been an emerging interest in identifying the institutional logics underlying in...

diversificationNorwayInstitutional change05 social sciencesGeography Planning and Development0211 other engineering and technologiesKansantaloustiede - Economics021107 urban & regional planninginstitutional logics02 engineering and technologyDiversification (marketing strategy)Rendering (computer graphics)specializationInnovation policyConceptual frameworkLiiketaloustiede - Business and management0502 economics and businessEconomicsEconomic geographyFinland050203 business & managementEuropean Planning Studies
researchProduct

A generalized transitive closure for relational queries

1988

We augment relational algebra with a generalized transitive closure operator that allows for the efficient evaluation of a subclass of recursive queries. The operator is based on a composition operator which is as general as possible when the operator is required to be associative and when only relational algebra operators are used in its definition. The closure of such a composition can be computed using the well-known efficient algorithms designed for the computation of the usual transitive closure. Besides the case in which complete materialization of recursive relations are required, our strategy also yields an efficient solution in the case in which a selection is applied to the closur…

Transitive relationSelection (relational algebra)Closure (topology)Transitive closure020207 software engineering02 engineering and technologyTransitive setRelational algebraTransitive reductionAlgebraTheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESOperator (computer programming)TheoryofComputation_LOGICSANDMEANINGSOFPROGRAMS020204 information systems0202 electrical engineering electronic engineering information engineeringMathematicsProceedings of the seventh ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems - PODS '88
researchProduct

Heart failure and anti tumor necrosis factor-alpha in systemic chronic inflammatory diseases.

2013

Tumor necrosis factor alpha (TNF-alpha) antagonists have emerged as an effective therapy for patients with diseases as Crohn's disease, rheumatoid arthritis, and other chronic systemic inflammatory diseases. In the last years, there has been a growing interest in the role that inflammatory cytokines, which sustain the pathogenesis of these diseases, plays in regulating cardiac structure and function, particularly in the progression of chronic heart failure. In fact there is an increase of anti-TNF alpha levels in advanced heart failure but the treatment with anti-TNF alpha has been shown to worsen the prognosis of heart failure in randomized controlled trials. Patients with rheumatoid arthr…

medicine.medical_specialtyPathologySettore MED/09 - Medicina InternaAlpha (ethology)DiseaseGastroenterologyProinflammatory cytokinePathogenesisRisk FactorsInternal medicineInternal MedicinemedicineHumansHeart FailureInflammationCrohn's diseaseTumor Necrosis Factor-alphabusiness.industrymedicine.diseaseHeart failureRheumatoid arthritishearth failure.biologicsChronic DiseaseTumor necrosis factor alphabusiness
researchProduct

Deciding properties of integral relational automata

1994

This paper investigates automated model checking possibilities for CTL* formulae over infinite transition systems represented by relational automata (RA). The general model checking problem for CTL* formulae over RA is shown undecidable, the undecidability being observed already on the class of Restricted CTL formulae. The decidability result, however, is obtained for another substantial subset of the logic, called A-CTL*+, which includes all ”linear time” formulae.

Model checkingDiscrete mathematicsClass (set theory)TheoryofComputation_COMPUTATIONBYABSTRACTDEVICESComputer scienceComputer Science::Software EngineeringDecidabilityUndecidable problemComputer Science::Multiagent SystemsCTL*TheoryofComputation_MATHEMATICALLOGICANDFORMALLANGUAGESRelational calculusTheoryofComputation_LOGICSANDMEANINGSOFPROGRAMSComputer Science::Logic in Computer ScienceAutomata theoryTime complexityComputer Science::Formal Languages and Automata Theory
researchProduct

Design and simulation of efficient combinational circuits based on a new XOR structure in QCA technology

2021

AbstractQuantum-dot cellular automata (QCA), due to its unique characteristics like low power consumption, nanoscale design, and high computing speed is considered as an emerging technology, and it can be used as an alternative for CMOS technology in circuit design for quantum computers in the near future. XOR gate has many applications in the design of digital circuits in QCA. In this paper, an efficient novel structure of XOR gate is proposed in QCA. Also, a novel 1-bit comparator circuit, 1-bit full adder, binary to gray and gray to binary convertor code based on the proposed XOR is designed and simulated using QCADesigner 2.0.3. The simulation results demonstrated that the proposed stru…

full adderAdderComparatorComputer scienceCircuit designelektroniset piiritBinary numberHardware_PERFORMANCEANDRELIABILITYElectronic engineeringHardware_INTEGRATEDCIRCUITSElectrical and Electronic EngineeringHardware_ARITHMETICANDLOGICSTRUCTURESXOR gateCombinational logicDigital electronicsbusiness.industrykvanttitietokoneetkvanttilaskentaconverterAtomic and Molecular Physics and OpticsElectronic Optical and Magnetic MaterialsCMOSsoluautomaatitbusinessquantum-dot cellular automataXOR gatecomparatorHardware_LOGICDESIGN
researchProduct