The logic of transaction cost economics in health care organization theory.
Stiles, R A; Mick, S S; Wise, C G
2001-01-01
Health care is, at its core, comprised of complex sequences of transactions among patients, providers, and other stakeholders; these transactions occur in markets as well as within systems and organizations. Health care transactions serve one of two functions: the production of care (i.e., the laying on of hands) or the coordination of that care (i.e., scheduling, logistics). Because coordinating transactions is integral to care delivery, it is imperative that they are executed smoothly and efficiently. Transaction cost economics (TCE) is a conceptual framework for analyzing health care transactions and quantifying their impact on health care structures (organizational forms), processes, and outcomes.
Fahim Akhter; Zakaria Maamar; Dave Hobbs
2006-01-01
The purpose of this article is to present an application of fuzzy logic to human reasoning about electronic commerce (e-commerce) transactions. This article uncovers some of the hidden relationships between critical factors such as security, familiarity, design, and competitiveness. We analyze the effect of these factors on human decision process and how they affect the Business-to-Consumer (B2C) outcome when they are used collectively. This research provides a toolset for B2C vendors to acce...
Extending Value Logic Thinking to Value Logic Portfolios
DEFF Research Database (Denmark)
Ritter, Thomas; Andersen, Poul Houman
or transaction, an understanding of firms and transactions as a portfolio of value logics (i.e. an interconnected coexistence of different value creation logics) is proposed. These additions to the original value creation logic theory imply interesting avenues for both, strategic decision making in firms...... and for research into strategic management....
Harris, Tim; Rajwar, Ravi
2010-01-01
The advent of multicore processors has renewed interest in the idea of incorporating transactions into the programming model used to write parallel programs.This approach, known as transactional memory, offers an alternative, and hopefully better, way to coordinate concurrent threads. The ACI(atomicity, consistency, isolation) properties of transactions provide a foundation to ensure that concurrent reads and writes of shared data do not produce inconsistent or incorrect results. At a higher level, a computation wrapped in a transaction executes atomically - either it completes successfullyand
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students......A Gentle introduction to logical languages, logical modeling, formal reasoning and computational logic for computer science and software engineering students...
DEFF Research Database (Denmark)
Hendricks, Vincent Fella; Gierasimczuk, Nina; de Jong, Dick
2014-01-01
of information processing, but likewise helped bring logic and learning in close proximity. This proximity relation is examined with respect to learning and belief revision, updating and efficiency, and with respect to how learnability fits in the greater scheme of dynamic epistemic logic and scientific method.......Learning and learnability have been long standing topics of interests within the linguistic, computational, and epistemological accounts of inductive in- ference. Johan van Benthem’s vision of the “dynamic turn” has not only brought renewed life to research agendas in logic as the study...
Wansing, Heinrich; Willkommen, Caroline; Recent Trends in Philosophical Logic
2014-01-01
This volume presents recent advances in philosophical logic with chapters focusing on non-classical logics, including paraconsistent logics, substructural logics, modal logics of agency and other modal logics. The authors cover themes such as the knowability paradox, tableaux and sequent calculi, natural deduction, definite descriptions, identity, truth, dialetheism, and possible worlds semantics. The developments presented here focus on challenging problems in the specification of fundamental philosophical notions, as well as presenting new techniques and tools, thereby contributing to the development of the field. Each chapter contains a bibliography, to assist the reader in making connections in the specific areas covered. Thus this work provides both a starting point for further investigations into philosophical logic and an update on advances, techniques and applications in a dynamic field. The chapters originate from papers presented during the Trends in Logic XI conference at the Ruhr University ...
Dynamic Logics of Belief Change
van Benthem, J.; Smets, S.; van Ditmarsch, H.; Halpern, J.; van der Hoek, W.; Kooi, B.
2015-01-01
This chapter gives an overview of current dynamic logics that describe belief update and revision, both for single agents and in multi-agent settings. We employ a mixture of ideas from AGM belief revision theory and dynamic-epistemic logics of information-driven agency. After describing the basic
Dynamic epistemic temporal logic
Renne, B.; Sack, Joshua; Yap, Audrey; He, X.; Horty, J.; Pacuit, E.
2009-01-01
We introduce a new type of arrow in the update frames (or "action models") of Dynamic Epistemic Logic in a way that enables us to reason about epistemic temporal dynamics in multi-agent systems that need not be synchronous. Since van Benthem and Pacuit (later joined by Hoshi and Gerbrandy) showed
Rushton, Andrew
2011-01-01
Many engineers encountering VHDL (very high speed integrated circuits hardware description language) for the first time can feel overwhelmed by it. This book bridges the gap between the VHDL language and the hardware that results from logic synthesis with clear organisation, progressing from the basics of combinational logic, types, and operators; through special structures such as tristate buses, register banks and memories, to advanced themes such as developing your own packages, writing test benches and using the full range of synthesis types. This third edition has been substantially rewritten to include the new VHDL-2008 features that enable synthesis of fixed-point and floating-point hardware. Extensively updated throughout to reflect modern logic synthesis usage, it also contains a complete case study to demonstrate the updated features. Features to this edition include: * a common VHDL subset which will work across a range of different synthesis systems, targeting a very wide range of technologies...
Transaction management with integrity checking
DEFF Research Database (Denmark)
Martinenghi, Davide; Christiansen, Henning
2005-01-01
Database integrity constraints, understood as logical conditions that must hold for any database state, are not fully supported by current database technology. It is typically up to the database designer and application programmer to enforce integrity via triggers or tests at the application leve....... 2.~In concurrent database systems, besides the traditional correctness criterion, the execution schedule must ensure that the different transactions can overlap in time without destroying the consistency requirements tested by other, concurrent transactions.......Database integrity constraints, understood as logical conditions that must hold for any database state, are not fully supported by current database technology. It is typically up to the database designer and application programmer to enforce integrity via triggers or tests at the application level...
Embedding Logics into Product Logic
Czech Academy of Sciences Publication Activity Database
Baaz, M.; Hájek, Petr; Krajíček, Jan; Švejda, David
1998-01-01
Roč. 61, č. 1 (1998), s. 35-47 ISSN 0039-3215 R&D Projects: GA AV ČR IAA1030601 Grant - others:COST(XE) Action 15 Keywords : fuzzy logic * Lukasiewicz logic * Gödel logic * product logic * computational complexity * arithmetical hierarchy Subject RIV: BA - General Mathematics
Smullyan, Raymond
2008-01-01
This book features a unique approach to the teaching of mathematical logic by putting it in the context of the puzzles and paradoxes of common language and rational thought. It serves as a bridge from the author's puzzle books to his technical writing in the fascinating field of mathematical logic. Using the logic of lying and truth-telling, the author introduces the readers to informal reasoning preparing them for the formal study of symbolic logic, from propositional logic to first-order logic, a subject that has many important applications to philosophy, mathematics, and computer science. T
Transactional Workflows or Workflow Transactions?
Symes, W.W.; Cicchetti, R.; Grefen, P.W.P.J.
Workflows have generally been accepted as a means to model and support processes in complex organizations. The fact that these processes re-quire robustness and clear semantics has generally been observed and has lead to the combination of workflow and transaction concepts. Many variations on this
Kleene, Stephen Cole
1967-01-01
Undergraduate students with no prior instruction in mathematical logic will benefit from this multi-part text. Part I offers an elementary but thorough overview of mathematical logic of 1st order. Part II introduces some of the newer ideas and the more profound results of logical research in the 20th century. 1967 edition.
Implementing Eco-Logical 2014-2015 Annual Report
2015-12-01
The Eco-Logical approach offers an ecosystem-based framework for integrated infrastructure and natural resource planning, project development, and delivery. The 2014/2015 Implementing Eco-Logical Program Annual Report provides updates on the Federal ...
2013/2014 Eco-Logical program annual report
2014-12-01
The Eco-Logical approach offers an ecosystem-based framework for integrated infrastructure and natural resource planning, project development, and delivery. The 2013/2014 Eco-Logical Program Annual Report provides updates on the Federal Highway Admin...
Tugué, Tosiyuki; Slaman, Theodore
1989-01-01
These proceedings include the papers presented at the logic meeting held at the Research Institute for Mathematical Sciences, Kyoto University, in the summer of 1987. The meeting mainly covered the current research in various areas of mathematical logic and its applications in Japan. Several lectures were also presented by logicians from other countries, who visited Japan in the summer of 1987.
Copies of classical logic in intuitionistic logic
Gaspar, Jaime
2012-01-01
Classical logic (the logic of non-constructive mathematics) is stronger than intuitionistic logic (the logic of constructive mathematics). Despite this, there are copies of classical logic in intuitionistic logic. All copies usually found in the literature are the same. This raises the question: is the copy unique? We answer negatively by presenting three different copies.
Transaction management with integrity checking
DEFF Research Database (Denmark)
Martinenghi, Davide; Christiansen, Henning
2005-01-01
Database integrity constraints, understood as logical conditions that must hold for any database state, are not fully supported by current database technology. It is typically up to the database designer and application programmer to enforce integrity via triggers or tests at the application level......, which are difficult to maintain and error prone. Two important aspects must be taken care of. 1.~It is too time consuming to check integrity constraints from scratch after each update, so simplified checks before each update should be used relying on the assumption that the current state is consistent...
Transaction Design Specification Medical Exam Databases System (MED) update Transaction
1986-12-01
NEUROLOGY 4 OPHTHALMOLOGY 5 INTERNAL MEDICINE 6 CARDIOLOGY • • • •• • ’" "O 46 Page 7-41 Chapter 7.15 Exhibit 7-13: CAMODSAIR Screen - Modify SAM REFERRAL...CASAMRRTBL Col 1 Col 2 1 FLIGHT MEDICINE 2 PSYCHIATRY 3 NEUROLOGY 4 OPHTHALMOLOGY 5 INTERNAL MEDICINE 6 CARDIOLOGY 0 0 0 0 0 0 0 0 0 O Page 7-43 - Chapter...CADIAGTBL: COLI COL2 01 NO EVIDENCE OF ORGANIC HEART DISEASE 02 NO EVIDENCE OF CORONARY ARTERY DISEASE 05 HYPERTROPHIC CARDIOMYOPATHY 06 CARDIOMYOPATHY
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area.......Intuitionistic hybrid logic is hybrid modal logic over an intuitionistic logic basis instead of a classical logical basis. In this short paper we introduce intuitionistic hybrid logic and we give a survey of work in the area....
Smets, P
1995-01-01
We start by describing the nature of imperfect data, and giving an overview of the various models that have been proposed. Fuzzy sets theory is shown to be an extension of classical set theory, and as such has a proeminent role or modelling imperfect data. The mathematic of fuzzy sets theory is detailled, in particular the role of the triangular norms. The use of fuzzy sets theory in fuzzy logic and possibility theory,the nature of the generalized modus ponens and of the implication operator for approximate reasoning are analysed. The use of fuzzy logic is detailled for application oriented towards process control and database problems.
DEFF Research Database (Denmark)
Reynolds, John C.
2002-01-01
In joint work with Peter O'Hearn and others, based on early ideas of Burstall, we have developed an extension of Hoare logic that permits reasoning about low-level imperative programs that use shared mutable data structure. The simple imperative programming language is extended with commands (not...... with the inductive definition of predicates on abstract data structures, this extension permits the concise and flexible description of structures with controlled sharing. In this paper, we will survey the current development of this program logic, including extensions that permit unrestricted address arithmetic...
Managerial accounting for transaction costs
Лабынцев, Николай Тихонович
2015-01-01
Essence and significance of transaction accounting and its basic concepts – transaction and transaction costs – have been determined. Main types of transaction costs and elements of transaction accounting for expenses have been considered. Source documents forms for the purpose of accounting for transaction costs have been worked out.
DEFF Research Database (Denmark)
Carbone, Marco; Montesi, Fabrizio; Schürmann, Carsten
2014-01-01
In Choreographic Programming, a distributed system is programmed by giving a choreography, a global description of its interactions, instead of separately specifying the behaviour of each of its processes. Process implementations in terms of a distributed language can then be automatically...... projected from a choreography. We present Linear Compositional Choreographies (LCC), a proof theory for reasoning about programs that modularly combine choreographies with processes. Using LCC, we logically reconstruct a semantics and a projection procedure for programs. For the first time, we also obtain...... a procedure for extracting choreographies from process terms....
Malcolm, Norman; Altuner, Ilyas
2014-01-01
The paper deals exclusively with the doctrine called ‘Logical Behaviorism’. Although this position does not vogue it enjoyed in the 1930s and 1940s, it will always possess a compelling attraction for anyone who is perplexed by the psychological concepts, who has become aware of worthlessness of an appeal to introspection as an account of how we learn those concepts, and he has no inclination to identify mind with brain. There, of course, are other forms of behaviorism, and of reductionism, wh...
Logical consecutions in discrete linear temporal logic
Rybakov, V. V.
2005-01-01
We investigate logical consequence in temporal logics in terms of logical consecutions, i.e., inference rules. First, we discuss the question: what does it mean for a logical consecution to be ’correct’ in a propositional logic. We consider both valid and admissible consecutions in linear temporal logics and discuss the distinction between these two notions. The linear temporal logic LDTL, consisting of all formulas valid in the frame 〈 , ≤, ≥ 〉 of all integer numbers, is the prime object of...
Automatic Verification of Transactions on an Object-Oriented Database
Spelt, D.; Balsters, H.
1998-01-01
In the context of the object-oriented data model, a compiletime approach is given that provides for a significant reduction of the amount of run-time transaction overhead due to integrity constraint checking. The higher-order logic Isabelle theorem prover is used to automatically prove which
International Nuclear Information System (INIS)
Mittelstaedt, P.
1979-01-01
The subspaces of Hilbert space constitute an orthocomplemented quasimodular lattice Lsub(q) for which neither a two-valued function nor generalized truth function exist. A generalisation of the dialogic method can be used as an interpretation of a lattice Lsub(qi), which may be considered as the intuitionistic part of Lsub(q). Some obvious modifications of the dialogic method are introduced which come from the possible incommensurability of propositions about quantum mechanical systems. With the aid of this generalized dialogic method a propositional calculus Qsub(eff) is derived which is similar to the calculus of effective (intuitionistic) logic, but contains a few restrictions which are based on the incommensurability of quantum mechanical propositions. It can be shown within the framework of the calculus Qsub(eff) that the value-definiteness of the elementary propositions which are proved by quantum mechanical propositions is inherited by all finite compund propositions. In this way one arrives at the calculus Q of full quantum logic which incorporates the principle of excluded middle for all propositions and which is a model for the lattice Lsub(q). (Auth.)
A GRAPH-BASED INVESTIGATION OF BITCOIN TRANSACTIONS
Zhao, Chen; Guan, Yong
2015-01-01
Part 2: INTERNET CRIME INVESTIGATIONS; International audience; The Bitcoin global cryptocurrency system has been the subject of several criminal cases. The Bitcoin network is a peer-to-peer system that has participants from all over the Internet. The Bitcoin protocol requires participating nodes to retain and update all transaction records; this ensures that all Bitcoin activities are accessible from a consistent transaction history database. This chapter describes a graph-based method for an...
Carlton, David Bryan
The exponential improvements in speed, energy efficiency, and cost that the computer industry has relied on for growth during the last 50 years are in danger of ending within the decade. These improvements all have relied on scaling the size of the silicon-based transistor that is at the heart of every modern CPU down to smaller and smaller length scales. However, as the size of the transistor reaches scales that are measured in the number of atoms that make it up, it is clear that this scaling cannot continue forever. As a result of this, there has been a great deal of research effort directed at the search for the next device that will continue to power the growth of the computer industry. However, due to the billions of dollars of investment that conventional silicon transistors have received over the years, it is unlikely that a technology will emerge that will be able to beat it outright in every performance category. More likely, different devices will possess advantages over conventional transistors for certain applications and uses. One of these emerging computing platforms is nanomagnetic logic (NML). NML-based circuits process information by manipulating the magnetization states of single-domain nanomagnets coupled to their nearest neighbors through magnetic dipole interactions. The state variable is magnetization direction and computations can take place without passing an electric current. This makes them extremely attractive as a replacement for conventional transistor-based computing architectures for certain ultra-low power applications. In most work to date, nanomagnetic logic circuits have used an external magnetic clocking field to reset the system between computations. The clocking field is then subsequently removed very slowly relative to the magnetization dynamics, guiding the nanomagnetic logic circuit adiabatically into its magnetic ground state. In this dissertation, I will discuss the dynamics behind this process and show that it is greatly
Resources and transaction costs
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2005-01-01
from resources depends on the property rights that he or she holds and on the transaction costs of exchanging, defining, and protecting them. While transaction costs are a major source of value dissipation, reducing such dissipation may create value. Implications for the RBV analysis of sustained...
Resources and Transaction Costs
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2004-01-01
resources depends on the propertyrights that she holds to those resources and on the transaction costs of exchanging,defining and protecting the relevant property rights. While transaction costs aremajor sources of value dissipation, value may be created by reducing suchdissipation. Implications for the RBV...
DEFF Research Database (Denmark)
Modal logic is a subject with ancient roots in the western logical tradition. Up until the last few generations, it was pursued mainly as a branch of philosophy. But in recent years, the subject has taken new directions with connections to topics in computer science and mathematics. This volume...... is the proceedings of the conference of record in its fi eld, Advances in Modal Logic. Its contributions are state-of-the-art papers. The topics include decidability and complexity results for specifi c modal logics, proof theory of modal logic, logics for reasoning about time and space, provability logic, dynamic...... epistemic logic, and the logic of evidence....
Networks and Transaction Costs
DEFF Research Database (Denmark)
Henning, Christian; Henningsen, Geraldine; Henningsen, Arne
2011-01-01
Based on the well-known fact that social networks can provide effective mechanisms that help to increase the trust level between two trade partners, we apply a simple game-theoretical framework to derive transaction costs as a high risk of opportunistic behavior in a repeated trade relation...... determined by the density and size of trading networks. In the empirical part of the paper we apply a two stage procedure to estimate the impact of social network structures on farm’s transaction costs observed for different input and output markets. At a first stage we estimate a multiple input...... transaction cost functions for all traded farm inputs and outputs. Estimation results based on a sample of 315 Polish farms imply a significant influence of social network structures on farm’s transaction costs. Moreover, estimated transaction costs correspond to a reasonable amount of farm specific shadow...
Doberkat, Ernst-Erich
2009-01-01
Combining coalgebraic reasoning, stochastic systems and logic, this volume presents the principles of coalgebraic logic from a categorical perspective. Modal logics are also discussed, including probabilistic interpretations and an analysis of Kripke models.
Paraconsistent Computational Logic
DEFF Research Database (Denmark)
Jensen, Andreas Schmidt; Villadsen, Jørgen
2012-01-01
In classical logic everything follows from inconsistency and this makes classical logic problematic in areas of computer science where contradictions seem unavoidable. We describe a many-valued paraconsistent logic, discuss the truth tables and include a small case study....
Transactions in Software Components: Container-Interposed Transactions
Czech Academy of Sciences Publication Activity Database
Procházka, M.; Plášil, František
2002-01-01
Roč. 3, č. 2 (2002), s. - ISSN 1525-9293 R&D Projects: GA ČR GA201/99/0244; GA AV ČR IAA2030902 Institutional research plan: AV0Z1030915 Keywords : transactions * component-based software architectures * transaction propagation policy * transaction attributes * container -interposed transactions Subject RIV: JC - Computer Hardware ; Software
Logic programming extensions of Horn clause logic
Directory of Open Access Journals (Sweden)
Ron Sigal
1988-11-01
Full Text Available Logic programming is now firmly established as an alternative programming paradigm, distinct and arguably superior to the still dominant imperative style of, for instance, the Algol family of languages. The concept of a logic programming language is not precisely defined, but it is generally understood to be characterized buy: a declarative nature; foundation in some well understood logical system, e.g., first order logic.
The real-time roll-back and recovery of transactions in database systems
Quantock, David E.
1989-01-01
Approved for public release; distribution is unlimited. A modern database transaction may involve a long series of updates, deletions, and insertions of data and a complex mix of these primary database operations. Due to its length and complexity, the transaction requires back-up and recovery procedures. The back-up procedure allows the user to either commit or abort a lengthy and complex transaction without comprising the integrity of the data. The recovery procedure allows the system to ...
2012-05-02
... Property with Foreign Persons from Quarterly Survey of Transactions in Selected Services and Intangible Assets with Foreign Persons to align with the benchmark survey that the BE-125 updates on a quarterly...
A Logical Approach to the Statement of Cash Flows
Petro, Fred; Gean, Farrell
2014-01-01
Of the three financial statements in financial reporting, the Statement of Cash Flows (SCF) is perhaps the most challenging. The most difficult aspect of the SCF is in developing an understanding of how previous transactions are finalized in this document. The purpose of this paper is to logically explain the indirect approach of cash flow whereby…
Valuation of Transactive Systems
Energy Technology Data Exchange (ETDEWEB)
Hammerstrom, Donald J. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Corbin, Charles D. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Fernandez, Nicholas [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Homer, Juliet S. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Makhmalbaf, Atefe [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Pratt, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Somani, Abhishek [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Gilbert, Erik I. [Navigant Consulting, Boulder, CO (United States); Chandler, Shawn [Navigant Consulting, Portland, OR (United States); Shandross, Richard [Navigant Consulting, Burlington, MA (United States)
2016-05-12
This is a final report from a project funded by the U.S. Department of Energy to formulate and test a methodology for valuation of systems where transaction-based mechanisms coordinate the exchange of value between the system’s actors. Today, the principal commodity being exchanged is electrical energy, and such mechanisms are called transactive energy systems. The authors strove to lay a foundation for meaningful valuations of transactive systems in general, and transactive energy systems as a special case. The word valuation is used in many different ways. This report proposes a valuation methodology that is inclusive of many types of valuations. Many will be familiar with cost-benefit valuations, in which both costs and benefits are assessed to determine whether the assets are worth their cost. Another set of valuation methods attempt to optimize an outcome using available resources, as is the case with integrated resource planning. In the end, this report’s methodology was most influenced by and most resembles the integrated-resource-planning approach. Regardless, we wish to enforce the premise that all valuations are comparative and should clearly specify a baseline scenario. A long, annotated list of prior valuation studies and valuation methodologies that influenced this report has been appended to this report. Much research is being conducted today concerning transactive systems, but only a handful of transactive system mechanisms have been formulated and field tested. They are found to be quite diverse, and the documentation of the various mechanisms is uneven in breadth and quality. It is therefore not adequate to simply assert that a valuation scenario includes a transactive system; certain characteristics and qualities of the chosen transactive system mechanism must be defined and stated. The report lists and discusses most of the known transactive system mechanisms. It offers a set of questions that may be used to help specify important
Analogy: Justification for Logic.
Sacksteder, William
1979-01-01
Presents and defends the thesis that it is analogy which provides justification for any logic, and for any argument to the extent that it depends on logic for justification. Analogy acquires inept support from logic, but logic acquires adroit support from analogy. (JMF)
Metamathematics of fuzzy logic
Hájek, Petr
1998-01-01
This book presents a systematic treatment of deductive aspects and structures of fuzzy logic understood as many valued logic sui generis. Some important systems of real-valued propositional and predicate calculus are defined and investigated. The aim is to show that fuzzy logic as a logic of imprecise (vague) propositions does have well-developed formal foundations and that most things usually named `fuzzy inference' can be naturally understood as logical deduction.
Logical formalization and the formalization of logic(s)
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav; Svoboda, Vladimír
2016-01-01
Roč. 59, č. 233 (2016), s. 55-80 ISSN 0024-5836 R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : logical formalization * logical analysis * reflective equilibrium Subject RIV: AA - Philosophy ; Religion
Efficient Mobile Client Caching Supporting Transaction Semantics
Directory of Open Access Journals (Sweden)
IlYoung Chung
2000-05-01
Full Text Available In mobile client-server database systems, caching of frequently accessed data is an important technique that will reduce the contention on the narrow bandwidth wireless channel. As the server in mobile environments may not have any information about the state of its clients' cache(stateless server, using broadcasting approach to transmit the updated data lists to numerous concurrent mobile clients is an attractive approach. In this paper, a caching policy is proposed to maintain cache consistency for mobile computers. The proposed protocol adopts asynchronous(non-periodic broadcasting as the cache invalidation scheme, and supports transaction semantics in mobile environments. With the asynchronous broadcasting approach, the proposed protocol can improve the throughput by reducing the abortion of transactions with low communication costs. We study the performance of the protocol by means of simulation experiments.
Transactional Network Platform: Applications
Energy Technology Data Exchange (ETDEWEB)
Katipamula, Srinivas; Lutes, Robert G.; Ngo, Hung; Underhill, Ronald M.
2013-10-31
In FY13, Pacific Northwest National Laboratory (PNNL) with funding from the Department of Energy’s (DOE’s) Building Technologies Office (BTO) designed, prototyped and tested a transactional network platform to support energy, operational and financial transactions between any networked entities (equipment, organizations, buildings, grid, etc.). Initially, in FY13, the concept demonstrated transactions between packaged rooftop air conditioners and heat pump units (RTUs) and the electric grid using applications or "agents" that reside on the platform, on the equipment, on a local building controller or in the Cloud. The transactional network project is a multi-lab effort with Oakridge National Laboratory (ORNL) and Lawrence Berkeley National Laboratory (LBNL) also contributing to the effort. PNNL coordinated the project and also was responsible for the development of the transactional network (TN) platform and three different applications associated with RTUs. This document describes two applications or "agents" in details, and also summarizes the platform. The TN platform details are described in another companion document.
New data structures and algorithms for logic synthesis and verification
Amaru, Luca Gaetano
2017-01-01
This book introduces new logic primitives for electronic design automation tools. The author approaches fundamental EDA problems from a different, unconventional perspective, in order to demonstrate the key role of rethinking EDA solutions in overcoming technological limitations of present and future technologies. The author discusses techniques that improve the efficiency of logic representation, manipulation and optimization tasks by taking advantage of majority and biconditional logic primitives. Readers will be enabled to accelerate formal methods by studying core properties of logic circuits and developing new frameworks for logic reasoning engines. · Provides a comprehensive, theoretical study on majority and biconditional logic for logic synthesis; · Updates the current scenario in synthesis and verification – especially in light of emerging technologies; · Demonstrates applications to CMOS technology and emerging technologies.
4th International Conference on Quantitative Logic and Soft Computing
Chen, Shui-Li; Wang, San-Min; Li, Yong-Ming
2017-01-01
This book is the proceedings of the Fourth International Conference on Quantitative Logic and Soft Computing (QLSC2016) held 14-17, October, 2016 in Zhejiang Sci-Tech University, Hangzhou, China. It includes 61 papers, of which 5 are plenary talks( 3 abstracts and 2 full length talks). QLSC2016 was the fourth in a series of conferences on Quantitative Logic and Soft Computing. This conference was a major symposium for scientists, engineers and practitioners to present their updated results, ideas, developments and applications in all areas of quantitative logic and soft computing. The book aims to strengthen relations between industry research laboratories and universities in fields such as quantitative logic and soft computing worldwide as follows: (1) Quantitative Logic and Uncertainty Logic; (2) Automata and Quantification of Software; (3) Fuzzy Connectives and Fuzzy Reasoning; (4) Fuzzy Logical Algebras; (5) Artificial Intelligence and Soft Computing; (6) Fuzzy Sets Theory and Applications.
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2003-01-01
AbstractWe forge linkages between the economics of property rights (Coase, Demsetz,Cheung, Barzel) and strategic management. Property rights to resources consistof the rights to consume, obtain income from, and alienate these resources.Transaction costs are the costs of exchanging, protecting...... and capturing propertyrights. We clarify the key role of transaction costs with respect to understandingvalue creation and the limitations and opportunities of strategizing relative tocompetitive forces. The economics of property rights identifies new sources ofvalue creation (i.e., reducing the dissipation...... caused by transaction costs), andnew types of resources (i.e., capture and protection capabilities), clarifies the roleof contracting in the exercise of market power, and suggests that `strategizing'and `economizing' perspectives are related to a larger extent than is normallyrecognized. Refutable...
Many-valued Logic and Fuzzy Logic
Czech Academy of Sciences Publication Activity Database
Hájek, Petr
2011-01-01
Roč. 27, č. 2 (2011), s. 315-324 ISSN 0970-7794 R&D Projects: GA ČR GEICC/08/E018 Institutional research plan: CEZ:AV0Z10300504 Keywords : many valued logic * fuzzy logic Subject RIV: BA - General Mathematics
An ANFIS-based on B2C electronic commerce transaction
Energy Technology Data Exchange (ETDEWEB)
Lin, Juan, E-mail: linjuanliucaihong@qq.com [Department of Mathematics and Computer Science, Fuqing Branch of Fujian Normal University, Fuqing 350300 (China); Liu, Chenlian, E-mail: chenglian.liu@gmail.com [School of Mathematics and Computer Science, Long Yan University, Longyan 364012 (China); Guo, Yongning, E-mail: guoyn@163.com [Fuqing Branch of Fujian Normal University, Fuqing 350300 (China)
2014-10-06
The purpose of this study is to use an adaptive-network-based fuzzy inference system to model a fuzzy logic-based system (FIS) for supporting decision-making process in B2C electronic commerce transaction. Firstly we introduce FIS in B2C electronic commerce transaction and ANFIS. Then we use ANFIS to model FIS with different membership functions(MF). Lastly we give a conclusion.
An ANFIS-based on B2C electronic commerce transaction
Lin, Juan; Liu, Chenlian; Guo, Yongning
2014-10-01
The purpose of this study is to use an adaptive-network-based fuzzy inference system to model a fuzzy logic-based system (FIS) for supporting decision-making process in B2C electronic commerce transaction. Firstly we introduce FIS in B2C electronic commerce transaction and ANFIS. Then we use ANFIS to model FIS with different membership functions(MF). Lastly we give a conclusion.
An ANFIS-based on B2C electronic commerce transaction
International Nuclear Information System (INIS)
Lin, Juan; Liu, Chenlian; Guo, Yongning
2014-01-01
The purpose of this study is to use an adaptive-network-based fuzzy inference system to model a fuzzy logic-based system (FIS) for supporting decision-making process in B2C electronic commerce transaction. Firstly we introduce FIS in B2C electronic commerce transaction and ANFIS. Then we use ANFIS to model FIS with different membership functions(MF). Lastly we give a conclusion
Newton-Smith, WH
2003-01-01
A complete introduction to logic for first-year university students with no background in logic, philosophy or mathematics. In easily understood steps it shows the mechanics of the formal analysis of arguments.
DEFF Research Database (Denmark)
Mardare, Radu Iulian; Cardelli, Luca; Larsen, Kim Guldstrand
2012-01-01
Continuous Markovian Logic (CML) is a multimodal logic that expresses quantitative and qualitative properties of continuous-time labelled Markov processes with arbitrary (analytic) state-spaces, henceforth called continuous Markov processes (CMPs). The modalities of CML evaluate the rates...
National Research Council Canada - National Science Library
Bickford, Mark
2008-01-01
.... This report describes the design of an Event Logic Assistant (Elan) that provides powerful automated support for applying event logic to the design and implementation of high-assurance distributed protocols...
National Research Council Canada - National Science Library
Jaspan, Ciera; Quan, Trisha; Aldrich, Jonathan
2008-01-01
... it. In this paper, we introduce error reporting logic (ERL), an algorithm and tool that produces succinct explanations for why a target system violates a specification expressed in first order predicate logic...
Shalack, V.
2013-01-01
The article offers a look at the combinatorial logic as the logic of signs operating in the most general sense. For this it is proposed slightly reformulate it in terms of introducing and replacement of the definitions.
Fuzzy logic controller optimization
Sepe, Jr., Raymond B; Miller, John Michael
2004-03-23
A method is provided for optimizing a rotating induction machine system fuzzy logic controller. The fuzzy logic controller has at least one input and at least one output. Each input accepts a machine system operating parameter. Each output produces at least one machine system control parameter. The fuzzy logic controller generates each output based on at least one input and on fuzzy logic decision parameters. Optimization begins by obtaining a set of data relating each control parameter to at least one operating parameter for each machine operating region. A model is constructed for each machine operating region based on the machine operating region data obtained. The fuzzy logic controller is simulated with at least one created model in a feedback loop from a fuzzy logic output to a fuzzy logic input. Fuzzy logic decision parameters are optimized based on the simulation.
Utterance Generation for Transaction Dialogues
Hulstijn, J.; van Hessen, Adrianus J.
1998-01-01
This paper discusses the utterance generation module of a spoken dialogue system for transactions. Transactions are interesting because they involve obligations of both parties: the system should provide all relevant information; the user should feel committed to the transaction once it has been
Transacted Memory for Smart Cards
Hartel, Pieter H.; Butler, Michael J.; de Jong, Eduard; Longley, Mark; Olivieira, J.N.; Zave, P.
A transacted memory that is implemented using EEPROM technology offers persistence, undoability and auditing. The transacted memory system is formally specified in Z, and refined in two steps to a prototype C implementation / SPIN model. Conclusions are offered both on the transacted memory system
James, A. P.; Francis, L. R. V. J.; Kumar, D.
2013-01-01
We report a resistance based threshold logic family useful for mimicking brain like large variable logic functions in VLSI. A universal Boolean logic cell based on an analog resistive divider and threshold logic circuit is presented. The resistive divider is implemented using memristors and provides output voltage as a summation of weighted product of input voltages. The output of resistive divider is converted into a binary value by a threshold operation implemented by CMOS inverter and/or O...
Institutional Logics in Action
DEFF Research Database (Denmark)
Lounsbury, Michael; Boxenbaum, Eva
2013-01-01
This double volume presents state-of-the-art research and thinking on the dynamics of actors and institutional logics. In the introduction, we briefly sketch the roots and branches of institutional logics scholarship before turning to the new buds of research on the topic of how actors engage ins...... prolific stream of research on institutional logics by deepening our insight into the active use of institutional logics in organizational action and interaction, including the institutional effects of such (inter)actions....
Modelling Real Property Transactions
DEFF Research Database (Denmark)
Stubkjær, Erik
2003-01-01
Der er store forskelle i financieringsomkostningerne ved hussalg i forskellige lande. Er disse forskelle nødvendige? og kan udgifterne reduceres? Sådanne spørgsmål søger forskningsprojektet ?Modelling Real Property Transactions?, officielt sat i værk indenfor rammerne af COST (European Co...
Ring Confidential Transactions
Directory of Open Access Journals (Sweden)
Shen Noether
2016-12-01
Full Text Available This article introduces a method of hiding transaction amounts in the strongly decentralized anonymous cryptocurrency Monero. Similar to Bitcoin, Monero is a cryptocurrency which is distributed through a proof-of-work “mining” process having no central party or trusted setup. The original Monero protocol was based on CryptoNote, which uses ring signatures and one-time keys to hide the destination and origin of transactions. Recently the technique of using a commitment scheme to hide the amount of a transaction has been discussed and implemented by Bitcoin Core developer Gregory Maxwell. In this article, a new type of ring signature, A Multilayered Linkable Spontaneous Anonymous Group signature is described which allows one to include a Pedersen Commitment in a ring signature. This construction results in a digital currency with hidden amounts, origins and destinations of transactions with reasonable efficiency and verifiable, trustless coin generation. The author would like to note that early drafts of this were publicized in the Monero Community and on the #bitcoin-wizards IRC channel. Blockchain hashed drafts are available showing that this work was started in Summer 2015, and completed in early October 2015. An eprint is also available at http://eprint.iacr.org/2015/1098.
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 6; Issue 4. Electronic Commerce-Cash Transactions. V Rajaraman. Series Article Volume 6 Issue 4 April 2001 pp 8-14. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/006/04/0008-0014. Author Affiliations.
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2003-01-01
AbstractWe forge linkages between the economics of property rights (Coase, Demsetz,Cheung, Barzel) and strategic management. Property rights to resources consistof the rights to consume, obtain income from, and alienate these resources.Transaction costs are the costs of exchanging, protecting and...... propositions are derived....
DEFF Research Database (Denmark)
Christiansen, Henning; Dahl, Veronica
2009-01-01
By extending logic grammars with constraint logic, we give them the ability to create knowledge bases that represent the meaning of an input string. Semantic information is thus defined through extra-grammatical means, and a sentence's meaning logically follows as a by-product of string rewriting...
Indian Academy of Sciences (India)
andoh
1Indian Institute of Science Education and Research, Mohali. 2The Institute of Mathematical Sciences, Chennai ... Bottomline of this work: One can obtain very reliable Logic Circuit. Elements by exploiting nonlinearity in the presence of ... with the truth tables of the basic logic operations. Sudeshna Sinha. Logical Stochastic ...
DEFF Research Database (Denmark)
Berg Johansen, Christina; Waldorff, Susanne Boch
as change and agency generated by friction between logics. We use these topics as basis for an analysis of selected empirical papers, with the aim of understanding how institutional logics contribute to institutional theory at large, and which social matters institutional logics can and cannot explore...
DEFF Research Database (Denmark)
Lopez, Hugo Andres; Carbone, Marco; Hildebrandt, Thomas
2010-01-01
We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for speciﬁcation and veriﬁcation of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL...
Czech Academy of Sciences Publication Activity Database
Horčík, Rostislav; Cintula, Petr
2004-01-01
Roč. 43, - (2004), s. 477-503 ISSN 1432-0665 R&D Projects: GA AV ČR IAA1030004; GA ČR GA201/02/1540 Grant - others:GA CTU(CZ) project 0208613; net CEEPUS(SK) SK-042 Institutional research plan: CEZ:AV0Z1030915 Keywords : fuzzy logic * many-valued logic * Lukasiewicz logic * Lpi logic * Takeuti-Titani logic * MV-algebras * product MV-algebras Subject RIV: BA - General Mathematics Impact factor: 0.295, year: 2004
DEFF Research Database (Denmark)
Bentzen, Martin Mose
2014-01-01
A new deontic logic, Action Type Deontic Logic, is presented. To motivate this logic, a number of benchmark cases are shown, representing inferences a deontic logic should validate. Some of the benchmark cases are singled out for further comments and some formal approaches to deontic reasoning...... are evaluated with respect to the benchmark cases. After that follows an informal introduction to the ideas behind the formal semantics, focussing on the distinction between action types and action tokens. Then the syntax and semantics of Action Type Deontic Logic is presented and it is shown to meet...
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Huertas, Antonia; Manzano, Maria
2014-01-01
Leon Henkin was not a modal logician, but there is a branch of modal logic that has been deeply influenced by his work. That branch is hybrid logic, a family of logics that extend orthodox modal logic with special proposition symbols (called nominals) that name worlds. This paper explains why...... Henkin’s techniques are so important in hybrid logic. We do so by proving a completeness result for a hybrid type theory called HTT, probably the strongest hybrid logic that has yet been explored. Our completeness result builds on earlier work with a system called BHTT, or basic hybrid type theory...... is due to the first-order perspective, which lies at the heart of Henin’s best known work and hybrid logic....
Hunka, Frantisek; Matula, Jiri
2017-07-01
Transaction based approach is utilized in some methodologies in business process modeling. Essential parts of these transactions are human beings. The notion of agent or actor role is usually used for them. The paper on a particular example describes possibilities of Design Engineering Methodology for Organizations (DEMO) and Resource-Event-Agent (REA) methodology. Whereas the DEMO methodology can be regarded as a generic methodology having its foundation in the theory of Enterprise Ontology the REA methodology is regarded as the domain specific methodology and has its origin in accountancy systems. The results of these approaches is that the DEMO methodology captures everything that happens in the reality with a good empirical evidence whereas the REA methodology captures only changes connected with economic events. Economic events represent either change of the property rights to economic resource or consumption or production of economic resources. This results from the essence of economic events and their connection to economic resources.
National Research Council Canada - National Science Library
Hoffman, Ned
2002-01-01
... for conducting an electronic transaction by the user. A stored audio signature is associated with a transaction processor entity, which the transaction processor entity is responsible for conducting the electronic transaction...
Dalen, Dirk
1983-01-01
A book which efficiently presents the basics of propositional and predicate logic, van Dalen’s popular textbook contains a complete treatment of elementary classical logic, using Gentzen’s Natural Deduction. Propositional and predicate logic are treated in separate chapters in a leisured but precise way. Chapter Three presents the basic facts of model theory, e.g. compactness, Skolem-Löwenheim, elementary equivalence, non-standard models, quantifier elimination, and Skolem functions. The discussion of classical logic is rounded off with a concise exposition of second-order logic. In view of the growing recognition of constructive methods and principles, one chapter is devoted to intuitionistic logic. Completeness is established for Kripke semantics. A number of specific constructive features, such as apartness and equality, the Gödel translation, the disjunction and existence property have been incorporated. The power and elegance of natural deduction is demonstrated best in the part of proof theory cal...
Czech Academy of Sciences Publication Activity Database
Peliš, Michal
2017-01-01
Roč. 26, č. 3 (2017), s. 357-381 ISSN 1425-3305 R&D Projects: GA ČR(CZ) GC16-07954J Institutional support: RVO:67985955 Keywords : epistemic logic * erotetic implication * erotetic logic * logic of questions Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy , History and Philosophy of science and technology http://apcz.umk.pl/czasopisma/index.php/LLP/article/view/LLP.2017.007
Logical database design principles
Garmany, John; Clark, Terry
2005-01-01
INTRODUCTION TO LOGICAL DATABASE DESIGNUnderstanding a Database Database Architectures Relational Databases Creating the Database System Development Life Cycle (SDLC)Systems Planning: Assessment and Feasibility System Analysis: RequirementsSystem Analysis: Requirements Checklist Models Tracking and Schedules Design Modeling Functional Decomposition DiagramData Flow Diagrams Data Dictionary Logical Structures and Decision Trees System Design: LogicalSYSTEM DESIGN AND IMPLEMENTATION The ER ApproachEntities and Entity Types Attribute Domains AttributesSet-Valued AttributesWeak Entities Constraint
Energy Technology Data Exchange (ETDEWEB)
Wall, M.J.W.
1992-07-01
The notion of {open_quotes}probability{close_quotes} is generalized to that of {open_quotes}likelihood,{close_quotes} and a natural logical structure is shown to exist for any physical theory which predicts likelihoods. Two physically based axioms are given for this logical structure to form an orthomodular poset, with an order-determining set of states. The results strengthen the basis of the quantum logic approach to axiomatic quantum theory. 25 refs.
DEFF Research Database (Denmark)
Jensen, Jonas Buhrkal; Birkedal, Lars
2012-01-01
, separation means physical separation. In this paper, we introduce \\emph{fictional separation logic}, which includes more general forms of fictional separating conjunctions P * Q, where "*" does not require physical separation, but may also be used in situations where the memory resources described by P and Q...... overlap. We demonstrate, via a range of examples, how fictional separation logic can be used to reason locally and modularly about mutable abstract data types, possibly implemented using sophisticated sharing. Fictional separation logic is defined on top of standard separation logic, and both the meta...
Heterogeneous logics of competition
DEFF Research Database (Denmark)
Mossin, Christiane
2015-01-01
The purpose of the article is to demonstrate that in order to understand competition as a socially organizing phenomenon, we should not examine competition in isolation, but as constellations of heterogeneous logics. More precisely, the article is based on two main theoretical points: (1) Logics...... of a presumed logic of competition within EU law, whereas the second part focuses on particular legal logics. In this respect, the so-called ‘real link criterion’ (determining the access to transnational social rights for certain groups of unemployed people) is given special attention. What is particularly...
Directory of Open Access Journals (Sweden)
Marco Carbone
2011-10-01
Full Text Available We explore logical reasoning for the global calculus, a coordination model based on the notion of choreography, with the aim to provide a methodology for specification and verification of structured communications. Starting with an extension of Hennessy-Milner logic, we present the global logic (GL, a modal logic describing possible interactions among participants in a choreography. We illustrate its use by giving examples of properties on service specifications. Finally, we show that, despite GL is undecidable, there is a significant decidable fragment which we provide with a sound and complete proof system for checking validity of formulae.
Introduction to mathematical logic
Mendelson, Elliott
2015-01-01
The new edition of this classic textbook, Introduction to Mathematical Logic, Sixth Edition explores the principal topics of mathematical logic. It covers propositional logic, first-order logic, first-order number theory, axiomatic set theory, and the theory of computability. The text also discusses the major results of Gödel, Church, Kleene, Rosser, and Turing.The sixth edition incorporates recent work on Gödel's second incompleteness theorem as well as restoring an appendix on consistency proofs for first-order arithmetic. This appendix last appeared in the first edition. It is offered in th
Crossley, J N; Brickhill, CJ; Stillwell, JC
2010-01-01
Although mathematical logic can be a formidably abstruse topic, even for mathematicians, this concise book presents the subject in a lively and approachable fashion. It deals with the very important ideas in modern mathematical logic without the detailed mathematical work required of those with a professional interest in logic.The book begins with a historical survey of the development of mathematical logic from two parallel streams: formal deduction, which originated with Aristotle, Euclid, and others; and mathematical analysis, which dates back to Archimedes in the same era. The streams beg
Howard, Ayanna
2005-01-01
The Fuzzy Logic Engine is a software package that enables users to embed fuzzy-logic modules into their application programs. Fuzzy logic is useful as a means of formulating human expert knowledge and translating it into software to solve problems. Fuzzy logic provides flexibility for modeling relationships between input and output information and is distinguished by its robustness with respect to noise and variations in system parameters. In addition, linguistic fuzzy sets and conditional statements allow systems to make decisions based on imprecise and incomplete information. The user of the Fuzzy Logic Engine need not be an expert in fuzzy logic: it suffices to have a basic understanding of how linguistic rules can be applied to the user's problem. The Fuzzy Logic Engine is divided into two modules: (1) a graphical-interface software tool for creating linguistic fuzzy sets and conditional statements and (2) a fuzzy-logic software library for embedding fuzzy processing capability into current application programs. The graphical- interface tool was developed using the Tcl/Tk programming language. The fuzzy-logic software library was written in the C programming language.
Inventory Dynamics under Transaction Costs
Jean-Paul Chavas; Paula M. Despins; T. Randy Fortenbery
2000-01-01
A conceptual model of storage behavior is developed. Optimal intertemporal pricing is derived to analyze the effects of transaction costs on storage andarbitrage pricing. It is shown how transaction costs can rationalize the existence of an inverse carrying charge for inventory. The model is applied to U.S. soybeans stocks for the period 1960–95. The empirical results suggest that transaction costs have a significant influence on storage behavior andintertemporal arbitrage pricing. Copyright ...
Towards a Formal Occurrence Logic based on Predicate Logic
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
2015-01-01
argumentation based on formal Occurrence Logic concerning events and occurrences, and illustrate the relations between Predicate Logic and Occurrence Logic. The relationships (and dependencies) is conducive to an approach that can analyse the occurrences of ”logical statements based on different logical...
Army Needs to Identify Government Purchase Card High-Risk Transactions
2012-01-20
United States, Alaska, and Puerto Rico . 6 Split Purchase. The cardholder at Fort Stewart made an improper split purchase with Integrity... holiday purchase. PCOLS logic helped the PCPMO to identify the transactions having the highest risk of being improper. Although technology and
Understanding Social Media Logic
Directory of Open Access Journals (Sweden)
José van Dijck
2013-08-01
Full Text Available Over the past decade, social media platforms have penetrated deeply into the mechanics of everyday life, affecting people's informal interactions, as well as institutional structures and professional routines. Far from being neutral platforms for everyone, social media have changed the conditions and rules of social interaction. In this article, we examine the intricate dynamic between social media platforms, mass media, users, and social institutions by calling attention to social media logic—the norms, strategies, mechanisms, and economies—underpinning its dynamics. This logic will be considered in light of what has been identified as mass media logic, which has helped spread the media's powerful discourse outside its institutional boundaries. Theorizing social media logic, we identify four grounding principles—programmability, popularity, connectivity, and datafication—and argue that these principles become increasingly entangled with mass media logic. The logic of social media, rooted in these grounding principles and strategies, is gradually invading all areas of public life. Besides print news and broadcasting, it also affects law and order, social activism, politics, and so forth. Therefore, its sustaining logic and widespread dissemination deserve to be scrutinized in detail in order to better understand its impact in various domains. Concentrating on the tactics and strategies at work in social media logic, we reassess the constellation of power relationships in which social practices unfold, raising questions such as: How does social media logic modify or enhance existing mass media logic? And how is this new media logic exported beyond the boundaries of (social or mass media proper? The underlying principles, tactics, and strategies may be relatively simple to identify, but it is much harder to map the complex connections between platforms that distribute this logic: users that employ them, technologies that
31 CFR 800.301 - Transactions that are covered transactions.
2010-07-01
... information, or other intangible assets or the transfer of personnel. Assuming no other relevant facts, the... principal assets. The proposed transaction is a covered transaction. Example 2. Same facts as in Example 1... foreign person of any part of an entity or of assets, if such part of an entity or assets constitutes a U...
Fiszdon, W
1965-01-01
Fluid Dynamics Transactions, Volume 2 compiles 46 papers on fluid dynamics, a subdiscipline of fluid mechanics that deals with fluid flow. The topics discussed in this book include developments in interference theory for aeronautical applications; diffusion from sources in a turbulent boundary layer; unsteady motion of a finite wing span in a compressible medium; and wall pressure covariance and comparison with experiment. The certain classes of non-stationary axially symmetric flows in magneto-gas-dynamics; description of the phenomenon of secondary flows in curved channels by means of co
Customized atomicity specification for transactional workflows
Derks, W.L.A.; Dehnert, Juliane; Grefen, P.W.P.J.; Jonker, Willem
2000-01-01
This paper introduces a new approach for specifying transaction management requirements for workflow applications. We propose independent models for the specification of workflow and transaction properties. Although we distinguish multiple transaction properties in our approach, we focus on
Customized Atomicity Specification for Transactional Workflows
Derks, W.L.A.; Dehnert, Juliane; Grefen, P.W.P.J.; Jonker, Willem
This paper introduces a new approach for specifying transaction management requirements for workflow applications. We propose independent models for the specification of workflow and transaction properties. Although we distinguish multiple transaction properties in our approach, we focus on
Criteria for logical formalization
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav; Svoboda, Vladimír
2013-01-01
Roč. 190, č. 14 (2013), s. 2897-2924 ISSN 0039-7857 R&D Projects: GA ČR(CZ) GAP401/10/1279 Institutional support: RVO:67985955 Keywords : logic * logical form * formalization * reflective equilibrium Subject RIV: AA - Philosophy ; Religion Impact factor: 0.637, year: 2013
CSIR Research Space (South Africa)
Klarman, S
2013-05-01
Full Text Available We introduce Description Logics of Context (DLCs) - an extension of Description Logics (DLs) for context-based reasoning. Our approach descends from J. McCarthy's tradition of treating contexts as formal objects over which one can quantify...
Directory of Open Access Journals (Sweden)
Evandro Agazzi
2011-06-01
Full Text Available Humans have used arguments for defending or refuting statements long before the creation of logic as a specialized discipline. This can be interpreted as the fact that an intuitive notion of "logical consequence" or a psychic disposition to articulate reasoning according to this pattern is present in common sense, and logic simply aims at describing and codifying the features of this spontaneous capacity of human reason. It is well known, however, that several arguments easily accepted by common sense are actually "logical fallacies", and this indicates that logic is not just a descriptive, but also a prescriptive or normative enterprise, in which the notion of logical consequence is defined in a precise way and then certain rules are established in order to maintain the discourse in keeping with this notion. Yet in the justification of the correctness and adequacy of these rules commonsense reasoning must necessarily be used, and in such a way its foundational role is recognized. Moreover, it remains also true that several branches and forms of logic have been elaborated precisely in order to reflect the structural features of correct argument used in different fields of human reasoning and yet insufficiently mirrored by the most familiar logical formalisms.
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2012-01-01
In this paper we explore the logic of now, yesterday, today and tomorrow by combining the semantic approach to indexicality pioneered by Hans Kamp [9] and refined by David Kaplan [10] with hybrid tense logic. We first introduce a special now nominal (our @now corresponds to Kamp’s original now...
A. Ponse (Alban); M.B. van der Zwaag
2002-01-01
textabstractWe distinguish two interpretations for the truth value `undefined' in Kleene's three-valued logic. Combining these two interpretations leads to a four-valued propositional logic that characterizes two particular ingredients of process algebra: ``choice' and ``inaction'. We study two
Linear Logical Voting Protocols
DEFF Research Database (Denmark)
DeYoung, Henry; Schürmann, Carsten
2012-01-01
. In response, we promote linear logic as a high-level language for both specifying and implementing voting protocols. Our linear logical specifications of the single-winner first-past-the-post (SW- FPTP) and single transferable vote (STV) protocols demonstrate that this approach leads to concise...
Indian Academy of Sciences (India)
andoh
Our motivation stems from an issue that is receiving considerable attention today: As computational devices and platforms continue to shrink in size .... Changing C changes the symmetry of the potential wells : leads to different logical responses. Morphing Logic Gate. In effect, we are able to obtain the basic ingredients of ...
Malhas, Othman Qasim
1993-10-01
The concept of “abacus logic” has recently been developed by the author (Malhas, n.d.). In this paper the relation of abacus logic to the concept of fuzziness is explored. It is shown that if a certain “regularity” condition is met, concepts from fuzzy set theory arise naturally within abacus logics. In particular it is shown that every abacus logic then has a “pre-Zadeh orthocomplementation”. It is also shown that it is then possible to associate a fuzzy set with every proposition of abacus logic and that the collection of all such sets satisfies natural conditions expected in systems of fuzzy logic. Finally, the relevance to quantum mechanics is discussed.
Microelectromechanical reprogrammable logic device
Hafiz, Md Abdullah Al
2016-03-29
In modern computing, the Boolean logic operations are set by interconnect schemes between the transistors. As the miniaturization in the component level to enhance the computational power is rapidly approaching physical limits, alternative computing methods are vigorously pursued. One of the desired aspects in the future computing approaches is the provision for hardware reconfigurability at run time to allow enhanced functionality. Here we demonstrate a reprogrammable logic device based on the electrothermal frequency modulation scheme of a single microelectromechanical resonator, capable of performing all the fundamental 2-bit logic functions as well as n-bit logic operations. Logic functions are performed by actively tuning the linear resonance frequency of the resonator operated at room temperature and under modest vacuum conditions, reprogrammable by the a.c.-driving frequency. The device is fabricated using complementary metal oxide semiconductor compatible mass fabrication process, suitable for on-chip integration, and promises an alternative electromechanical computing scheme.
Caulfield, H. John
2005-05-01
Progress of optical logic has been anything but uniform or even monotonic. The hope for "all optical computers" was largely abandoned after devastating critiques by Keyes. Over time, optical logic transformed into a very viable niche activity by the needs of optical communication for "all optical" logic and the advent of a critical component: the SOA or Semiconductor Optical Amplifier. I argue that a new phase in this uneven history can be defined - linear (single photon, not multiple entangled photon) quantum optical logic. These can perform conservative, reversible logic operations without energy or time penalties, but cascading requires the irreversible act of measurement, so only single devices or single layers can deliver those advantages.
THE SPECIFICITY OF INTRACOMMUNITY TRANSACTIONS
Directory of Open Access Journals (Sweden)
PALIU-POPA LUCIA
2011-09-01
Full Text Available Considered from the perspective of Romania's accession to the European Union, we can say that starting with 1 January 2007, foreign trade transactions were delimited in relation to the customs borders in intra-Community transactions and international transactions. In this context, the way of conducting these operations is influenced by both the economic and financial features specific to both categories of transactions, that relate to the economic character of the activity, the diversity and specificity of the foreign trade activity, transport of goods, the complexity and regulation of intra-Community and international commercial transactions, and by the specific features of each category of transaction. Starting from the consideration that the economic and financial characteristics of foreign trade activity, specific to intra-Community commercial transactions, have a significant influence in the organization and management of accounting of the entities involved in such transactions, determining in a greater or lesser extent, the way of capitalization of the financial and accounting information in the processes of analysis, decision and control, in this paper we proposed to address the features of intra-Community trade.
31 CFR 596.304 - Financial transaction.
2010-07-01
... OF FOREIGN ASSETS CONTROL, DEPARTMENT OF THE TREASURY TERRORISM LIST GOVERNMENTS SANCTIONS REGULATIONS General Definitions § 596.304 Financial transaction. The term financial transaction shall have the...
Logic in elementary mathematics
Exner, Robert M
2011-01-01
This applications-related introductory treatment explores facets of modern symbolic logic useful in the exposition of elementary mathematics. The authors convey the material in a manner accessible to those trained in standard elementary mathematics but lacking any formal background in logic. Topics include the statement calculus, proof and demonstration, abstract mathematical systems, and the restricted predicate calculus. The final chapter draws upon the methods of logical reasoning covered in previous chapters to develop solutions of linear and quadratic equations, definitions of order and
International Nuclear Information System (INIS)
Bialkowski, J.; Moszynski, M.; Zagorski, A.
1981-01-01
The logic diagram principle of operation and some details of the design of the multiplicity logic unit are presented. This unit was specially designed to fulfil the requirements of a multidetector arrangement for gamma-ray multiplicity measurements. The unit is equipped with 16 inputs controlled by a common coincidence gate. It delivers a linear output pulse with the height proportional to the multiplicity of coincidences and logic pulses corresponding to 0, 1, ... up to >= 5-fold coincidences. These last outputs are used to steer the routing unit working with the multichannel analyser. (orig.)
DEFF Research Database (Denmark)
Xue, Bingtian; Larsen, Kim Guldstrand; Mardare, Radu Iulian
2015-01-01
We introduce Concurrent Weighted Logic (CWL), a multimodal logic for concurrent labeled weighted transition systems (LWSs). The synchronization of LWSs is described using dedicated functions that, in various concurrency paradigms, allow us to encode the compositionality of LWSs. To reflect these......, CWL contains modal operators indexed with rational numbers to predicate over the numerical labels of LWSs as well as a binary modal operator that encodes properties concerning the (de-) composition of LWSs. We develop a Hilbert-style axiomatic system for CWL and we prove weak- and strong......-completeness results for this logic. To complete these proofs we involve advanced topological techniques from Model Theory....
Logical inference and evaluation
International Nuclear Information System (INIS)
Perey, F.G.
1981-01-01
Most methodologies of evaluation currently used are based upon the theory of statistical inference. It is generally perceived that this theory is not capable of dealing satisfactorily with what are called systematic errors. Theories of logical inference should be capable of treating all of the information available, including that not involving frequency data. A theory of logical inference is presented as an extension of deductive logic via the concept of plausibility and the application of group theory. Some conclusions, based upon the application of this theory to evaluation of data, are also given
FINANCING OF INTERNATIONAL TRANSACTIONS
Directory of Open Access Journals (Sweden)
RADU NICOLAE BĂLUNĂ
2013-02-01
Full Text Available Financing (funding is essentially the purchase of funds necessary for a business. This can be done from internal sources (company’s own funds or external (borrowed funds. The high value of goods traded in international trade makes revenues generated from internal resources not sufficient to settle the value of the goods. Thus, it is frequent to resort to borrowed funds. In International Business Transactions, external financing is done both by classical techniques of credit (credit supplier and buyer credit and modern techniques of financing (factoring, forfeiting, leasing all trade tailored. In terms of the length of financing, accounting funding is short-term (1-12 months and long-term financing (over a year. In principle, export and import operations prevailing short-term financing techniques, while international investment and industrial cooperation actions are specific long-term funding
Unifying Memory and Database Transactions
Dias, Ricardo J.; Lourenço, João M.
Software Transactional Memory is a concurrency control technique gaining increasing popularity, as it provides high-level concurrency control constructs and eases the development of highly multi-threaded applications. But this easiness comes at the expense of restricting the operations that can be executed within a memory transaction, and operations such as terminal and file I/O are either not allowed or incur in serious performance penalties. Database I/O is another example of operations that usually are not allowed within a memory transaction. This paper proposes to combine memory and database transactions in a single unified model, benefiting from the ACID properties of the database transactions and from the speed of main memory data processing. The new unified model covers, without differentiating, both memory and database operations. Thus, the users are allowed to freely intertwine memory and database accesses within the same transaction, knowing that the memory and database contents will always remain consistent and that the transaction will atomically abort or commit the operations in both memory and database. This approach allows to increase the granularity of the in-memory atomic actions and hence, simplifies the reasoning about them.
Fisher, Michael; Gabbay, Dov; Gough, Graham
2000-01-01
Time is a fascinating subject that has captured mankind's imagination from ancient times to the present. It has been, and continues to be studied across a wide range of disciplines, from the natural sciences to philosophy and logic. More than two decades ago, Pnueli in a seminal work showed the value of temporal logic in the specification and verification of computer programs. Today, a strong, vibrant international research community exists in the broad community of computer science and AI. This volume presents a number of articles from leading researchers containing state-of-the-art results in such areas as pure temporal/modal logic, specification and verification, temporal databases, temporal aspects in AI, tense and aspect in natural language, and temporal theorem proving. Earlier versions of some of the articles were given at the most recent International Conference on Temporal Logic, University of Manchester, UK. Readership: Any student of the area - postgraduate, postdoctoral or even research professor ...
DEFF Research Database (Denmark)
Aiello, Marco; Bezhanishvili, Guram; Bloch, Isabelle
2012-01-01
Since the early days of physics, space has called for means to represent, experiment, and reason about it. Apart from physicists, the concept of space has intrigued also philosophers, mathematicians and, more recently, computer scientists. This longstanding interest has left us with a plethora...... of mathematical tools developed to represent and work with space. Here we take a special look at this evolution by considering the perspective of Logic. From the initial axiomatic efforts of Euclid, we revisit the major milestones in the logical representation of space and investigate current trends. In doing so......, we do not only consider classical logic, but we indulge ourselves with modal logics. These present themselves naturally by providing simple axiomatizations of different geometries, topologies, space-time causality, and vector spaces....
Henson, C Ward; Kechris, Alexander S; Odell, Edward; Finet, Catherine; Michaux, Christian; Cassels, J W S
2003-01-01
This volume comprises articles from four outstanding researchers who work at the cusp of analysis and logic. The emphasis is on active research topics; many results are presented that have not been published before and open problems are formulated.
DEFF Research Database (Denmark)
Monica, Dario Della; Goranko, Valentin; Montanari, Angelo
2011-01-01
We discuss a family of modal logics for reasoning about relational structures of intervals over (usually) linear orders, with modal operators associated with the various binary relations between such intervals, known as Allen’s interval relations. The formulae of these logics are evaluated...... at intervals rather than points and the main eect of that semantic feature is substantially higher expressiveness and computational complexity of the interval logics as compared to point-based ones. Without purporting to provide a comprehensive survey of the field, we take the reader to a journey through...... the main developments in it over the past 10 years and outline some landmark results on expressiveness and (un)decidability of the satisfiability problem for the family of interval logics....
Characterization of quantum logics
International Nuclear Information System (INIS)
Lahti, P.J.
1980-01-01
The quantum logic approach to axiomatic quantum mechanics is used to analyze the conceptual foundations of the traditional quantum theory. The universal quantum of action h>0 is incorporated into the theory by introducing the uncertainty principle, the complementarity principle, and the superposition principle into the framework. A characterization of those quantum logics (L,S) which may provide quantum descriptions is then given. (author)
DEFF Research Database (Denmark)
Nilsson, Jørgen Fischer
1999-01-01
Conceptual spaces have been proposed as topological or geometric means for establishing conceptual structures and models. This paper, after briey reviewing conceptual spaces, focusses on the relationship between conceptual spaces and logical concept languages with operations for combining concepts...... to form concepts. Speci cally is introduced an algebraic concept logic, for which conceptual spaces are installed as semantic domain as replacement for, or enrichment of, the traditional....
Logic and declarative language
Downward, M
2004-01-01
Logic has acquired a reputation for difficulty, perhaps because many of the approaches adopted have been more suitable for mathematicians than computer scientists. This book shows that the subject is not inherently difficult and that the connections between logic and declarative language are straightforward. Many exercises have been included in the hope that these will lead to a much greater confidence in manual proofs, therefore leading to a greater confidence in automated proofs.
Principles of Transactional Memory The Theory
Guerraoui, Rachid
2010-01-01
Transactional memory (TM) is an appealing paradigm for concurrent programming on shared memory architectures. With a TM, threads of an application communicate, and synchronize their actions, via in-memory transactions. Each transaction can perform any number of operations on shared data, and then either commit or abort. When the transaction commits, the effects of all its operations become immediately visible to other transactions; when it aborts, however, those effects are entirely discarded. Transactions are atomic: programmers get the illusion that every transaction executes all its operati
Fuzzy knowledge base construction through belief networks based on Lukasiewicz logic
Lara-Rosano, Felipe
1992-01-01
In this paper, a procedure is proposed to build a fuzzy knowledge base founded on fuzzy belief networks and Lukasiewicz logic. Fuzzy procedures are developed to do the following: to assess the belief values of a consequent, in terms of the belief values of its logical antecedents and the belief value of the corresponding logical function; and to update belief values when new evidence is available.
Anonymous Transactions in Computer Networks
Dolev, Shlomi; Kopeetsky, Marina
We present schemes for providing anonymous transactions while privacy and anonymity are preserved, providing user anonymous authentication in distributed networks such as the Internet. We first present a practical scheme for anonymous transactions while the transaction resolution is assisted by a Trusted Authority. This practical scheme is extended to a theoretical scheme where a Trusted Authority is not involved in the transaction resolution. Given an authority that generates for each player hard to produce evidence EVID (e. g., problem instance with or without a solution) to each player, the identity of a user U is defined by the ability to prove possession of said evidence. We use Zero-Knowledge proof techniques to repeatedly identify U by providing a proof that U has evidence EVID, without revealing EVID, therefore avoiding identity theft.
Transactional Analysis--Some Concerns
Kilcourse, Tom
1977-01-01
Some causes for concern in connection with the accelerating use of transactional analysis in industrial and business organizations are examined, with suggestions for partial solution of its problems. (MF)
Philosophical Foundations of Intuitionistic Logic
Directory of Open Access Journals (Sweden)
L Nabavi
2013-02-01
Full Text Available Intuitionistic logic, as a non-classical logic, encompasses the principles of logical reasoning which were used by L. E. J. Brouwer in developing his intuitionistic mathematics. Brouwer rejected the principle of the excluded middle on the basis of his philosophy. In his philosophical view, logic is the application of mathematics to the language of mathematics. In other words, logic studies the patterns that characterize valid inference. The resulting linguistic system of logic may be studied mathematically, even independently of the mathematical activities that it was originally abstracted from. In this paper, the philosophical basis of Brouwerâs view about Logic and Mathematics is explained.
Philosophical Foundations of Intuitionistic Logic
Directory of Open Access Journals (Sweden)
L Nabavi
2013-03-01
Full Text Available Intuitionistic logic, as a non-classical logic, encompasses the principles of logical reasoning which were used by L. E. J. Brouwer in developing his intuitionistic mathematics. Brouwer rejected the principle of the excluded middle on the basis of his philosophy. In his philosophical view, logic is the application of mathematics to the language of mathematics. In other words, logic studies the patterns that characterize valid inference. The resulting linguistic system of logic may be studied mathematically, even independently of the mathematical activities that it was originally abstracted from. In this paper, the philosophical basis of Brouwer’s view about Logic and Mathematics is explained.
A Paraconsistent Higher Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen
2004-01-01
of paraconsistent logics in knowledge-based systems, logical semantics of natural language, etc. Higher order logics have the advantages of being expressive and with several automated theorem provers available. Also the type system can be helpful. We present a concise description of a paraconsistent higher order...... logic with countable infinite indeterminacy, where each basic formula can get its own indeterminate truth value (or as we prefer: truth code). The meaning of the logical operators is new and rather different from traditional many-valued logics as well as from logics based on bilattices. The adequacy...
The Resolution Calculus for First-Order Logic
DEFF Research Database (Denmark)
Schlichtkrull, Anders
2016-01-01
This theory is a formalization of the resolution calculus for first-order logic. It is proven sound and complete. The soundness proof uses the substitution lemma, which shows a correspondence between substitutions and updates to an environment. The completeness proof uses semantic trees, i.e. trees...
Visualizing Dynamic Bitcoin Transaction Patterns
McGinn, D; Birch, DA; Akroyd, D; Molina-Solana, M; Guo, Y; Knottenbelt, W
2016-01-01
Abstract This work presents a systemic top-down visualization of Bitcoin transaction activity to explore dynamically generated patterns of algorithmic behavior. Bitcoin dominates the cryptocurrency markets and presents researchers with a rich source of real-time transactional data. The pseudonymous yet public nature of the data presents opportunities for the discovery of human and algorithmic behavioral patterns of interest to many parties such as financial regulators, protocol designers, and...
Non-logic devices in logic processes
Ma, Yanjun
2017-01-01
This book shows readers how to design semiconductor devices using the most common and lowest cost logic CMOS processes. Readers will benefit from the author’s extensive, industrial experience and the practical approach he describes for designing efficiently semiconductor devices that typically have to be implemented using specialized processes that are expensive, time-consuming, and low-yield. The author presents an integrated picture of semiconductor device physics and manufacturing techniques, as well as numerous practical examples of device designs that are tried and true.
Uncertain Reasoning in Justification Logic
Kokkinis, Ioannis
2016-01-01
This thesis studies the combination of two well known formal systems for knowledge representation: probabilistic logic and justification logic. Our aim is to design a formal framework that allows the analysis of epistemic situations with incomplete information. In order to achieve this we introduce two probabilistic justification logics, which are defined by adding probability operators to the minimal justification logic J. We prove soundness and completeness theorems for our logics and estab...
Mathematical logic in the human brain: semantics.
Friedrich, Roland M; Friederici, Angela D
2013-01-01
As a higher cognitive function in humans, mathematics is supported by parietal and prefrontal brain regions. Here, we give an integrative account of the role of the different brain systems in processing the semantics of mathematical logic from the perspective of macroscopic polysynaptic networks. By comparing algebraic and arithmetic expressions of identical underlying structure, we show how the different subparts of a fronto-parietal network are modulated by the semantic domain, over which the mathematical formulae are interpreted. Within this network, the prefrontal cortex represents a system that hosts three major components, namely, control, arithmetic-logic, and short-term memory. This prefrontal system operates on data fed to it by two other systems: a premotor-parietal top-down system that updates and transforms (external) data into an internal format, and a hippocampal bottom-up system that either detects novel information or serves as an access device to memory for previously acquired knowledge.
Connections among quantum logics. Pt. 1. Quantum propositional logics
Energy Technology Data Exchange (ETDEWEB)
Lock, P.F. (Saint Lawrence Univ., Canton, New York (USA). Dept. of Mathematics); Hardegree, G.M. (Massachusetts Univ., Amherst (USA). Dept. of Philosophy)
1985-01-01
In this paper, a theory of quantum logics is proposed which is general enough to enable us to reexamine a previous work on quantum logics in the context of this theory. It is then easy to assess the differences between the different systems studied. The quantum logical systems which are incorporated are divided into two groups which we call ''quantum propositional logics'' and ''quantum event logics''. The work of Kochen and Specker (partial Boolean algebras) is included and so is that of Greechie and Gudder (orthomodular partially ordered sets), Domotar (quantum mechanical systems), and Foulis and Randall (operational logics) in quantum propositional logics; and Abbott (semi-Boolean algebras) and Foulis and Randall (manuals) in quantum event logics, In this part of the paper, an axiom system for quantum propositional logics is developed and the above structures in the context of this system examined.
Logical reasoning with diagrams
Allwein, Gerard
1996-01-01
PART A: Theoretical Issues. 1. Visual Information and Valid Reasoning, Jon Barwise and John Etchemendy. 2. Operational Constraints in Diagrammatic Reasoning, Atsushi Shimojima. 3. Diagrams and the Concept of Logical System, Jon Barwise and Eric Hammer. PART B: Case Studies. 4. Situation-Theoretic Account of Valid Reasoning with Venn Diagrams, Sun-Joo Shin. 5. Towards a Model Theory of Venn Diagrams, eric Hammer and Norman Danner. 6. Peircean Graphs for Propositional Logic, Eric Hammer. 7. A Diagrammatic Subsystem of Hilbert''s Geometry, Isabel Luengo. PART C: Heterogenous Systems. 8. Heterogenous Logic, Jon Barwise and John Etchemendy. 9. Toward the Rigorous Use of Diagrams in Reasoning about Hardware, Steven D. Johnson, Jon Barwise, and Gerard Allwein. 10. Exploiting the Potential of Diagrams in Guiding Hardware Reasoning, Kathi D. Fisler
Directory of Open Access Journals (Sweden)
Zoltan Erdei
2011-12-01
Full Text Available In this paper the authors present the usefulness of fuzzy logic in controlling engineering processes or applications. Although fuzzy logic does not represent a novelty for the scientific and engineering field, it enjoys a great appreciation from those involved in the two domains. The fact that fuzzy logic uses sentences kindred with the natural language make it easier to comprehend that a complex mathematical model required by the classic control theory. In MatLab software there are dedicated toolboxes to this subject that make the design of a fuzzy controller a facile one. In the paper design methods of a fuzzy controller are being presented both in Simulink and MatLab.
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...... case studies and it has been extended in several directions. The aim of this paper is to provide a thorough presentation of the logic.......The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Carlsson, Christer; Fullér, Robert
2004-01-01
Fuzzy Logic in Management demonstrates that difficult problems and changes in the management environment can be more easily handled by bringing fuzzy logic into the practice of management. This explicit theme is developed through the book as follows: Chapter 1, "Management and Intelligent Support Technologies", is a short survey of management leadership and what can be gained from support technologies. Chapter 2, "Fuzzy Sets and Fuzzy Logic", provides a short introduction to fuzzy sets, fuzzy relations, the extension principle, fuzzy implications and linguistic variables. Chapter 3, "Group Decision Support Systems", deals with group decision making, and discusses methods for supporting the consensus reaching processes. Chapter 4, "Fuzzy Real Options for Strategic Planning", summarizes research where the fuzzy real options theory was implemented as a series of models. These models were thoroughly tested on a number of real life investments, and validated in 2001. Chapter 5, "Soft Computing Methods for Reducing...
Modern Logical Frameworks Design
DEFF Research Database (Denmark)
Murawska, Agata Anna
2017-01-01
Throughout the years, logical frameworks have been a successful tool for prototyping and developing a number of logics and programming languages. However, to use the full power of the LF approach, the behaviour of variables in the system being mechanised must match the behaviour of those used...... or a cryptographic protocol used in a voting system, we need the ability to model and reason about both the building blocks of these systems and the intricate connections between them. To this end, this dissertation is an investigation into LF-based formalisms that might help address the aforementioned issues. We...
Conventions and Institutional Logics
DEFF Research Database (Denmark)
Westenholz, Ann
Two theoretical approaches – Conventions and Institutional Logics – are brought together and the similarities and differences between the two are explored. It is not the intention to combine the approaches, but I would like to open both ‘boxes’ and make them available to each other with the purpose...... analyses. The theoretical quest of both Conventions and Institutional Logics has been to understand the increasing indeterminacy, uncertainty and ambiguity in people’s lives where a sense of reality, of value, of moral, of feelings is not fixed. Both approaches have created new theoretical insights...
Stoll, Robert R
1979-01-01
Set Theory and Logic is the result of a course of lectures for advanced undergraduates, developed at Oberlin College for the purpose of introducing students to the conceptual foundations of mathematics. Mathematics, specifically the real number system, is approached as a unity whose operations can be logically ordered through axioms. One of the most complex and essential of modern mathematical innovations, the theory of sets (crucial to quantum mechanics and other sciences), is introduced in a most careful concept manner, aiming for the maximum in clarity and stimulation for further study in
Gibson, J
2013-01-01
Most branches of organizing utilize digital electronic systems. This book introduces the design of such systems using basic logic elements as the components. The material is presented in a straightforward manner suitable for students of electronic engineering and computer science. The book is also of use to engineers in related disciplines who require a clear introduction to logic circuits. This third edition has been revised to encompass the most recent advances in technology as well as the latest trends in components and notation. It includes a wide coverage of application specific integrate
DEFF Research Database (Denmark)
Klose, Karl; Ostermann, Klaus
2010-01-01
In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze the probl......In logic metaprogramming, programs are not stored as plain textfiles but rather derived from a deductive database. While the benefits of this approach for metaprogramming are obvious, its incompatibility with separate checking limits its applicability to large-scale projects. We analyze...
Evens, Aden
2015-01-01
Building a foundational understanding of the digital, Logic of the Digital reveals a unique digital ontology. Beginning from formal and technical characteristics, especially the binary code at the core of all digital technologies, Aden Evens traces the pathways along which the digital domain of abstract logic encounters the material, human world. How does a code using only 0s and 1s give rise to the vast range of applications and information that constitutes a great and growing portion of our world? Evens' analysis shows how any encounter between the actual and the digital must cross an ontolo
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML....... To guard against modelling artefacts we provide an alternative way of characterizing the policy combining algorithms and we formally prove the equivalence of these approaches. This allows us to pinpoint the shortcoming of previous approaches to formalization based either on Belnap logic or on D -algebra....
Progress in Programmable Logic
Directory of Open Access Journals (Sweden)
Jozef Cuntala
2004-01-01
Full Text Available Programmable logic devices (PLD are situated on important place among microelectronic components thanks to the continuing technological development of semiconductor components, due to new architectures and new approaches to digital systems design. Software design of various complicated digital systems becomes advantageous article of many firms. The Department of Electronics and Electrotechnology pays pemanent attention to mentioned components in application field. The collective of authors wants in this article point out on possibilities of design of digital system using the PLD. The paper plan contains the following basic parts: Technological aspects that influence development of configurable logic devices, Methodology od design and implementation and Flexibility of PLD interface.
GOAL Agents Instantiate Intention Logic
Hindriks, Koen; van der Hoek, Wiebe
2008-01-01
It is commonly believed there is a big gap between agent logics and computational agent frameworks. In this paper, we show that this gap is not as big as believed by showing that GOAL agents instantiate Intention Logic of Cohen and Levesque. That is, we show that GOAL agent programs can be formally related to Intention Logic.We do so by proving that the GOAL Verification Logic can be embedded into Intention Logic. It follows that (a fragment of) Intention Logic can be used t...
Quantum logics with existence property
Energy Technology Data Exchange (ETDEWEB)
Schindler, C. (Univ. Bern (Switzerland))
1991-04-01
A quantum logic ({sigma}-orthocomplete orthomodular poset L with a convex, unital, and separating set {Delta} of states) is said to have the existence property if the expectation functionals on lin({Delta}) associated with the bounded observables of L form a vector space. Classical quantum logics as well as the Hilbert space logics of traditional quantum mechanics have this property. The author shows that, if a quantum logic satisfies certain conditions in addition to having property E, then the number of its blocks (maximal classical subsystems) must either be one (classical logics) or uncountable (as in Hilbert space logics).
Some relationships between logic programming and multiple-valued logic
International Nuclear Information System (INIS)
Rine, D.C.
1986-01-01
There have been suggestions in the artificial intelligence literature that investigations into relationships between logic programming and multiple-valued logic may be helpful. This paper presents some of these relationships through equivalent algebraic evaluations
DEFF Research Database (Denmark)
Filipiuk, Piotr; Nielson, Flemming; Nielson, Hanne Riis
2012-01-01
are a Moore Family result and a parametrized worst case time complexity result. We show that the logic and the associated solver can be used for rapid prototyping of analyses and illustrate a wide variety of applications within Static Analysis, Constraint Satisfaction Problems and Model Checking. In all cases...
Temporal logic motion planning
CSIR Research Space (South Africa)
Seotsanyana, M
2010-01-01
Full Text Available In this paper, a critical review on temporal logic motion planning is presented. The review paper aims to address the following problems: (a) In a realistic situation, the motion planning problem is carried out in real-time, in a dynamic, uncertain...
Foundations of mathematical logic
Curry, Haskell B
2010-01-01
Written by a pioneer of mathematical logic, this comprehensive graduate-level text explores the constructive theory of first-order predicate calculus. It covers formal methods, including algorithms and epitheory, and offers a brief treatment of Markov's approach to algorithms, explains elementary facts about lattices and similar algebraic systems, and more. 1963 edition.
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2011-01-01
We study the international standard XACML 3.0 for describing security access control policy in a compositional way. Our main contribution is to derive a logic that precisely captures the idea behind the standard and to formally define the semantics of the policy combining algorithms of XACML. To ...
Quantum probabilistic logic programming
Balu, Radhakrishnan
2015-05-01
We describe a quantum mechanics based logic programming language that supports Horn clauses, random variables, and covariance matrices to express and solve problems in probabilistic logic. The Horn clauses of the language wrap random variables, including infinite valued, to express probability distributions and statistical correlations, a powerful feature to capture relationship between distributions that are not independent. The expressive power of the language is based on a mechanism to implement statistical ensembles and to solve the underlying SAT instances using quantum mechanical machinery. We exploit the fact that classical random variables have quantum decompositions to build the Horn clauses. We establish the semantics of the language in a rigorous fashion by considering an existing probabilistic logic language called PRISM with classical probability measures defined on the Herbrand base and extending it to the quantum context. In the classical case H-interpretations form the sample space and probability measures defined on them lead to consistent definition of probabilities for well formed formulae. In the quantum counterpart, we define probability amplitudes on Hinterpretations facilitating the model generations and verifications via quantum mechanical superpositions and entanglements. We cast the well formed formulae of the language as quantum mechanical observables thus providing an elegant interpretation for their probabilities. We discuss several examples to combine statistical ensembles and predicates of first order logic to reason with situations involving uncertainty.
Czech Academy of Sciences Publication Activity Database
Svoboda, Vladimír; Peregrin, Jaroslav
2016-01-01
Roč. 30, č. 3 (2016), s. 263-287 ISSN 0920-427X R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : argumentation * logical form * incorrect argument * correct arguments Subject RIV: AA - Philosophy ; Religion Impact factor: 0.689, year: 2016
Duration Calculus: Logical Foundations
DEFF Research Database (Denmark)
Hansen, Michael Reichhardt; Chaochen, Zhou
1997-01-01
The Duration Calculus (abbreviated DC) represents a logical approach to formal design of real-time systems, where real numbers are used to model time and Boolean valued functions over time are used to model states and events of real-time systems. Since it introduction, DC has been applied to many...
Harding, John; Yang, Taewon
2015-12-01
Since the work of Crown (J. Natur. Sci. Math. 15(1-2), 11-25 1975) in the 1970's, it has been known that the projections of a finite-dimensional vector bundle E form an orthomodular poset ( omp) {P}(E). This result lies in the intersection of a number of current topics, including the categorical quantum mechanics of Abramsky and Coecke (2004), and the approach via decompositions of Harding (Trans. Amer. Math. Soc. 348(5), 1839-1862 1996). Moreover, it provides a source of omps for the quantum logic program close to the Hilbert space setting, and admitting a version of tensor products, yet having important differences from the standard logics of Hilbert spaces. It is our purpose here to initiate a basic investigation of the quantum logic program in the vector bundle setting. This includes observations on the structure of the omps obtained as {P}(E) for a vector bundle E, methods to obtain states on these omps, and automorphisms of these omps. Key theorems of quantum logic in the Hilbert setting, such as Gleason's theorem and Wigner's theorem, provide natural and quite challenging problems in the vector bundle setting.
Czech Academy of Sciences Publication Activity Database
Peregrin, Jaroslav
2010-01-01
Roč. 4, č. 2 (2010), s. 207-223 ISSN 1661-8297 R&D Projects: GA ČR(CZ) GAP401/10/1279 Institutional research plan: CEZ:AV0Z9009908 Keywords : logic * natural selection * modus potens * inferentialism Subject RIV: AA - Philosophy ; Religion
Expressivist Perspective on Logicality
Czech Academy of Sciences Publication Activity Database
Arazim, Pavel
2017-01-01
Roč. 11, č. 4 (2017), s. 409-419 ISSN 1661-8297 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : logical constant * expressivism * topic-neutrality * proof-theory * conservativity Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology
Czech Academy of Sciences Publication Activity Database
Klev, Ansten
2017-01-01
Roč. 25, č. 3 (2017), s. 341-368 ISSN 0031-8019 Institutional support: RVO:67985955 Keywords : Philosophy of mathematics * logicism * Richard Dedekind Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology Impact factor: 0.419, year: 2016
Parametric Linear Dynamic Logic
Directory of Open Access Journals (Sweden)
Peter Faymonville
2014-08-01
Full Text Available We introduce Parametric Linear Dynamic Logic (PLDL, which extends Linear Dynamic Logic (LDL by temporal operators equipped with parameters that bound their scope. LDL was proposed as an extension of Linear Temporal Logic (LTL that is able to express all ω-regular specifications while still maintaining many of LTL's desirable properties like an intuitive syntax and a translation into non-deterministic Büchi automata of exponential size. But LDL lacks capabilities to express timing constraints. By adding parameterized operators to LDL, we obtain a logic that is able to express all ω-regular properties and that subsumes parameterized extensions of LTL like Parametric LTL and PROMPT-LTL. Our main technical contribution is a translation of PLDL formulas into non-deterministic Büchi word automata of exponential size via alternating automata. This yields a PSPACE model checking algorithm and a realizability algorithm with doubly-exponential running time. Furthermore, we give tight upper and lower bounds on optimal parameter values for both problems. These results show that PLDL model checking and realizability are not harder than LTL model checking and realizability.
Logicism, intuitionism, and formalism
Symons, John
2008-01-01
Aims to review the programmes in the foundations of mathematics from the classical period and to assess their possible relevance for contemporary philosophy of mathematics. This work is suitable for researchers and graduate students of philosophy, logic, mathematics and theoretical computer science.
Greek, Indian and Arabic logic
Gabbay, Dov M
2004-01-01
Greek, Indian and Arabic Logic marks the initial appearance of the multi-volume Handbook of the History of Logic. Additional volumes will be published when ready, rather than in strict chronological order. Soon to appear are The Rise of Modern Logic: From Leibniz to Frege. Also in preparation are Logic From Russell to Gödel, Logic and the Modalities in the Twentieth Century, and The Many-Valued and Non-Monotonic Turn in Logic. Further volumes will follow, including Mediaeval and Renaissance Logic and Logic: A History of its Central. In designing the Handbook of the History of Logic, the Editors have taken the view that the history of logic holds more than an antiquarian interest, and that a knowledge of logic's rich and sophisticated development is, in various respects, relevant to the research programmes of the present day. Ancient logic is no exception. The present volume attests to the distant origins of some of modern logic's most important features, such as can be found in the claim by the authors of t...
Logical analysis of biological systems
DEFF Research Database (Denmark)
Mardare, Radu Iulian
2005-01-01
R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005.......R. Mardare, Logical analysis of biological systems. Fundamenta Informaticae, N 64:271-285, 2005....
DEFF Research Database (Denmark)
Braüner, Torben
2011-01-01
Hybrid logic is an extension of modal logic which allows us to refer explicitly to points of the model in the syntax of formulas. It is easy to justify interest in hybrid logic on applied grounds, with the usefulness of the additional expressive power. For example, when reasoning about time one...... often wants to build up a series of assertions about what happens at a particular instant, and standard modal formalisms do not allow this. What is less obvious is that the route hybrid logic takes to overcome this problem often actually improves the behaviour of the underlying modal formalism....... For example, it becomes far simpler to formulate proof-systems for hybrid logic, and completeness results can be proved of a generality that is simply not available in modal logic. That is, hybridization is a systematic way of remedying a number of known deficiencies of modal logic. First-order hybrid logic...
Remedial transactions curtailment via optimization
Directory of Open Access Journals (Sweden)
Maksimović Viktor
2009-01-01
Full Text Available The new method developed in this paper is aiming at transmission congestion management (CM. The new, Optimal Transactions Management method (OTM, is based on linear programming (LP, DC load flow (DCLF and linear security constraints. The OTM method is embedded in Available Transfer Capabilities (ATCs and Power Transfer Distribution Factors (PTDFs definitions' environment. Well-suited for both preventive and corrective modes of operation, the OTM method aids transmission system operator in running a congested power system network, where congestions are due to transactions. Potential congestion threat is solved by finding the 'culprit' transaction and its optimal reduction. Besides the proposed downsizing of scheduled and/or committed transactions, controls of the OTM method also include redispatching of generation and load levels. The task is to establish a system state without constraint violations. To ensure the feasible network solution, both DC and AC power flows are used. The common 5 nodes/7 lines Ward&Hale sample power system is used to clarify the OTM method. Besides, six other power system networks including the real-life power system network of Serbia, Macedonia and Montenegro (part of the South East Europe - SEE grid are used to test remedial potentials and CPU-time performances of the method. The 24-hour daily demand diagram is used with all test networks to study the effects of transactions as they are being superimposed to the regional grid. The remedial, transactions-curtailing OTM method is found well suited for market-related analyses precluding the hour-ahead, the day-ahead dispatch, as well as the real-time generation dispatch. It could also suit for the novel, Day Ahead Congestion Forecast (DACF procedure used in power markets. .
Information Flow in Logical Environments
Kent, Robert E.
2016-01-01
This paper describes information flow within logical environments. The theory of information flow, the logic of distributed systems, was first defined by Barwise and Seligman (Information Flow: The Logic of Distributed Systems. 1997). Logical environments are a semantic-oriented version of institutions. The theory of institutions, which was initiated by Goguen and Burstall (Institutions: Abstract Model Theory for Specification and Programming. 1992), is abstract model theory. Information flow...
Nguyen, Hung T
2005-01-01
THE CONCEPT OF FUZZINESS Examples Mathematical modeling Some operations on fuzzy sets Fuzziness as uncertainty Exercises SOME ALGEBRA OF FUZZY SETS Boolean algebras and lattices Equivalence relations and partitions Composing mappings Isomorphisms and homomorphisms Alpha-cuts Images of alpha-level sets Exercises FUZZY QUANTITIES Fuzzy quantities Fuzzy numbers Fuzzy intervals Exercises LOGICAL ASPECTS OF FUZZY SETS Classical two-valued logic A three-valued logic Fuzzy logic Fuzzy and Lukasiewi
2010-07-01
... ASSETS CONTROL, DEPARTMENT OF THE TREASURY TERRORISM LIST GOVERNMENTS SANCTIONS REGULATIONS General Definitions § 596.311 Transaction. The term transaction shall have the meaning set forth in 18 U.S.C. 1956(c...
Transactions in domain-specific information systems
Zacek, Jaroslav
2017-07-01
Substantial number of the current information system (IS) implementations is based on transaction approach. In addition, most of the implementations are domain-specific (e.g. accounting IS, resource planning IS). Therefore, we have to have a generic transaction model to build and verify domain-specific IS. The paper proposes a new transaction model for domain-specific ontologies. This model is based on value oriented business process modelling technique. The transaction model is formalized by the Petri Net theory. First part of the paper presents common business processes and analyses related to business process modeling. Second part defines the transactional model delimited by REA enterprise ontology paradigm and introduces states of the generic transaction model. The generic model proposal is defined and visualized by the Petri Net modelling tool. Third part shows application of the generic transaction model. Last part of the paper concludes results and discusses a practical usability of the generic transaction model.
Transactions Concurrency Control in Web Service Environment
DEFF Research Database (Denmark)
Alrifai, Mohammad; Dolog, Peter; Nejdl, Wolfgang
2006-01-01
an engineering point of view as it does not change the way consumers or clients of web services have to be programmed. Furthermore, it avoids direct communication between transaction coordinators which preserves security by keeping the information about business transactions restricted to the coordinators which......Business transactions in web service environments run with relaxed isolation and atomicity property. In such environments, transactions can commit and roll back independently on each other. Transaction management has to reflect this issue and address the problems which result for example from...... concurrent access to web service resources and data. In this paper we propose an extension to the WS-Transaction Protocol which ensures the consistency of the data when independent business transactions access the data concurrently under the relaxed transaction properties. Our extension is based...
21 CFR 1310.08 - Excluded transactions.
2010-04-01
...) Colombia (6) Ecuador (7) French Guiana (8) Guyana (9) Panama (10) Paraguay (11) Peru (12) Suriname (13) Uruguay (14) Venezuela (c) Domestic transactions of Methyl Isobutyl Ketone (MIBK). (d) Import transactions...
Logical Characterisation of Ontology Construction using Fuzzy Description Logics
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
Ontologies based on Description Logics (DLs) have proved to be effective in formally sharing knowledge across semantic technologies, e.g. Semantic Web, Natural Language Processing, Text Analytics, Business intelligence. Our main goal is analysing ontology construction considering vagueness. We have...... had the extension of ontologies with Fuzzy Logic capabilities which plan to make proper backgrounds for ontology driven reasoning and argumentation on vague and imprecise domains. This presentation conceptualises learning from fuzzy classes using the Inductive Logic Programming framework. Then......, employs Description Logics in characterising and analysing fuzzy statements. And finally, provides a conceptual framework describing fuzzy concept learning in ontologies using the Inductive Logic Programming....
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Prohibited transactions involving blocked property; transactions with respect to securities. 585.201 Section 585.201 Money and Finance... transactions involving blocked property; transactions with respect to securities. (a) Except as authorized by...
Directory of Open Access Journals (Sweden)
Baranov G. V.
2016-12-01
Full Text Available in this article the logic perspective in information culture is investigated. The contents of four laws of logical thinking in their value for thinking and humanitarian culture of the personality are described. Formal and logical laws are characterized by a condition of uniform information culture of mankind.
Modal Logics for Cryptographic Processes
DEFF Research Database (Denmark)
Frendrup, U.; Huttel, Hans; Jensen, N. J.
2002-01-01
We present three modal logics for the spi-calculus and show that they capture strong versions of the environment sensitive bisimulation introduced by Boreale et al. Our logics differ from conventional modal logics for process calculi in that they allow us to describe the knowledge of an attacker ...
Lectures on Logic and Computation
DEFF Research Database (Denmark)
The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers fo...
Games for topological fixpoint logic
Bezhanishvili, N.; Kupke, C.
2016-01-01
Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
This article shows how individual Petri nets form models of Girard's intuitionistic linear logic. It explores questions of expressiveness and completeness of linear logic with respect to this interpretation. An aim is to use Petri nets to give an understanding of linear logic and give some apprai...
The Deontic Transaction Model in Multi-Agent Normative Systems
Huang, Yonghua; Esterline, Albert
1998-01-01
In the area of multi-agent systems, much research is devoted to the coordination of the agents. There exist several issues, two of which are summarized. The first is that, although agents are said to be autonomous, they always react in a predictable way to each message, and they cannot decide to violate the conventions that are hard-wired into the protocol. In fact, there might be circumstances in which the agent violates a convention in order to realize a private goal that it considers to be more important. Another issue is that, if the protocols that agents use to react to the environment are fixed, they have no way to respond to changes. However, an important characteristic of agents is that they eon react to a changing environment. Although transaction models ([BOH92], [GR93]) evolved from the database domain, they establish a general execution paradigm that ideally covers all the subsystems invoked in a sequence of transactions. So transaction models apply to multi-agent systems. Recently, some research has been devoted to overcoming the limitations of the traditional transaction models which are suitable for conventional systems and focus on system integrity, e,g., [SJ97]. Here we solve above issues by turning to a deontic concept: obligation. In multi-agent systems, agents interact with each other according to norms, We use deontic logic ([And58], [Aqv84], [B C96], [JS94], [MW93]) to model norms. Here the norms prescribe how the agents ought to behave, but-- and this is essential-- they do not exclude the possibility of "bad" behavior (i.e., the actual behavior may deviate from the ideal), and so they also prescribe what should be done in circumstances of norm violation. Thus, we propose a new approach --- a deontic transaction model for multi-agent normative systems. Our approach improves the protocol of "abort/commit" of traditional transaction models to a protocol of "abort/exception/commit". In multi-agent normative systems, we can see the violation of a
31 CFR 543.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 543.406 Section 543.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... Interpretations § 543.406 Offshore transactions. The prohibitions in § 543.201 on transactions or dealings...
31 CFR 547.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 547.406 Section 547.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... REGULATIONS Interpretations § 547.406 Offshore transactions. The prohibitions in § 547.201 on transactions or...
31 CFR 541.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 541.406 Section 541.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... § 541.406 Offshore transactions. The prohibitions in § 541.201 on transactions involving blocked...
31 CFR 548.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 548.406 Section 548.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... § 548.406 Offshore transactions. The prohibitions in § 548.201 on transactions or dealings involving...
31 CFR 537.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 537.406 Section 537.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... § 537.406 Offshore transactions. The prohibitions in § 537.201 on transactions involving blocked...
31 CFR 546.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 546.406 Section 546.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... § 546.406 Offshore transactions. The prohibitions in § 546.201 on transactions or dealings involving...
31 CFR 542.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 542.406 Section 542.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... § 542.406 Offshore transactions. The prohibitions in § 542.201 on transactions involving blocked...
31 CFR 588.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 588.406 Section 588.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... Interpretations § 588.406 Offshore transactions. The prohibitions in § 588.201 on transactions involving blocked...
5 CFR 1640.4 - Account transactions.
2010-01-01
... 5 Administrative Personnel 3 2010-01-01 2010-01-01 false Account transactions. 1640.4 Section 1640... STATEMENTS § 1640.4 Account transactions. (a) Where relevant, the following transactions will be reported in each individual account statement: (1) Contributions; (2) Withdrawals; (3) Forfeitures; (4) Loan...
Nonblocking Scheduling for Web Service Transactions
DEFF Research Database (Denmark)
Alrifai, Mohammad; Balke, Wolf-Tilo; Dolog, Peter
2007-01-01
For improved flexibility and concurrent usage existing transaction management models for Web services relax the isolation property of Web service-based transactions. Correctness of the concurrent execution then has to be ensured by commit order-preserving transaction schedulers. However, local...
Conventions and Institutional Logics
DEFF Research Database (Denmark)
Westenholz, Ann
Two theoretical approaches – Conventions and Institutional Logics – are brought together and the similarities and differences between the two are explored. It is not the intention to combine the approaches, but I would like to open both ‘boxes’ and make them available to each other with the purpose...... of creating a space for dialog. Both approaches were developed in the mid-1980s as a reaction to rational-choice economic theory and collectivistic sociological theory. These two theories were oversimplifying social life as being founded either in actor-micro level analyses or in structure-macro level...... analyses. The theoretical quest of both Conventions and Institutional Logics has been to understand the increasing indeterminacy, uncertainty and ambiguity in people’s lives where a sense of reality, of value, of moral, of feelings is not fixed. Both approaches have created new theoretical insights...
Pascal, Robert; Pross, Addy
2016-11-01
In this paper we propose a logical connection between the physical and biological worlds, one resting on a broader understanding of the stability concept. We propose that stability manifests two facets - time and energy, and that stability's time facet, expressed as persistence, is more general than its energy facet. That insight leads to the logical formulation of the Persistence Principle, which describes the general direction of material change in the universe, and which can be stated most simply as: nature seeks persistent forms. Significantly, the principle is found to express itself in two mathematically distinct ways: in the replicative world through Malthusian exponential growth, and in the `regular' physical/chemical world through Boltzmann's probabilistic considerations. By encompassing both `regular' and replicative worlds, the principle appears to be able to help reconcile two of the major scientific theories of the 19th century - the Second Law of Thermodynamics and Darwin's theory of evolution - within a single conceptual framework.
Logical frameworks for truth and abstraction an axiomatic study
Cantini, A
1996-01-01
This English translation of the author's original work has been thoroughly revised, expanded and updated. The book covers logical systems known as type-free or self-referential. These traditionally arise from any discussion on logical and semantical paradoxes. This particular volume, however, is not concerned with paradoxes but with the investigation of type-free sytems to show that: (i) there are rich theories of self-application, involving both operations and truth which can serve as foundations for property theory and formal semantics; (ii) these theories provide a new outlook on classical
1981-01-01
Rapport, Groupe Intelligence Pasero, R., Artificielle , Universite d’Aix-Marseille, Roussel, P. Luminy, France, 1973. [Kowalski 1974] Kowalski, R. A...THIS PAGZ(Whan Doee Es tMord) Item 20 (Cont’d) ------ work in the area of artificial intelligence and those used in general program development into a...logic programming with LISP for implementing intelligent data base query systems. Continued developments will allow for enhancements to be made to the
Probabilistic Logical Characterization
DEFF Research Database (Denmark)
Hermanns, Holger; Parma, Augusto; Segala, Roberto
2011-01-01
Probabilistic automata exhibit both probabilistic and non-deterministic choice. They are therefore a powerful semantic foundation for modeling concurrent systems with random phenomena arising in many applications ranging from artificial intelligence, security, systems biology to performance...... modeling. Several variations of bisimulation and simulation relations have proved to be useful as means to abstract and compare different automata. This paper develops a taxonomy of logical characterizations of these relations on image-finite and image-infinite probabilistic automata....
Magnetoresistive logic and biochip
International Nuclear Information System (INIS)
Brueckl, Hubert; Brzeska, Monika; Brinkmann, Dirk; Schotter, J.Joerg; Reiss, Guenter; Schepper, Willi; Kamp, P.-B.; Becker, Anke
2004-01-01
While some magnetoresistive devices based on giant magnetoresistance or spin-dependent tunneling are already commercialized, a new branch of development is evolving towards magnetoresistive logic with magnetic tunnel junctions. Furthermore, the new magnetoelectronic effects show promising properties in magnetoresistive biochips, which are capable of detecting even single molecules (e.g. DNA) by functionalized magnetic markers. The unclear limits of this approach are discussed with two model systems
Decision, Transaction, Law and Contract
DEFF Research Database (Denmark)
Koch, Carsten Allan
is transaction cost economics in the tradition of Oliver E. Williamson. The foundation for this tradition was laid by 1991 Nobel Laureate Ronald Coase in a paper, “The Nature of the Firm” in 1937. But the breakthrough as an influential research program was achieved with Williamson’s influential “Markets...
Transformational and transactional leadership conceptualization ...
African Journals Online (AJOL)
The study to revalidated and re-examined the factor structure and the conceptualization of the transformational and transactional leadership for a possible application to the study of leadership in Nigerian applied settings. Data were collected from 212 employees (160 males and 52 females) who rated eight CEOs (4 males ...
Marketing Logics, Ambidexterity and Influence
DEFF Research Database (Denmark)
Tollin, Karin; Schmidt, Marcus
2012-01-01
in four CMOs have taken on this challenge, or adopted a marketing logic which could be referred to as ambidextrous. Furthermore, the study shows that this logic exerts a stronger impact on marketing's influence, compared to logics related to assuring brand consistency and measuring the performance...... of marketing processes. Three other ways to enact marketing management were also revealed, namely: an innovation; a communication; and a supporting marketing logic. This leads us to conclude that the influence of companies' marketing functions show up a heterogeneous picture within which the marketing logics...
Lectures on Logic and Computation
DEFF Research Database (Denmark)
The European Summer School in Logic, Language and Information (ESSLLI) is organized every year by the Association for Logic, Language and Information (FoLLI) in different sites around Europe. The main focus of ESSLLI is on the interface between linguistics, logic and computation. ESSLLI offers...... foundational, introductory and advanced courses, as well as workshops, covering a wide variety of topics within the three areas of interest: Language and Computation, Language and Logic, and Logic and Computation. During two weeks, around 50 courses and 10 workshops are offered to the attendants, each of 1...
Directory of Open Access Journals (Sweden)
Muhammad Sohail
2018-03-01
Full Text Available Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node’s transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing, which extends the widely used AODV (Ad hoc On-demand Distance Vector routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network. The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.
Sohail, Muhammad; Wang, Liangmin
2018-03-14
Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node's transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical.
Wang, Liangmin
2018-01-01
Today IoT integrate thousands of inter networks and sensing devices e.g., vehicular networks, which are considered to be challenging due to its high speed and network dynamics. The goal of future vehicular networks is to improve road safety, promote commercial or infotainment products and to reduce the traffic accidents. All these applications are based on the information exchange among nodes, so not only reliable data delivery but also the authenticity and credibility of the data itself are prerequisite. To cope with the aforementioned problem, trust management come up as promising candidate to conduct node’s transaction and interaction management, which requires distributed mobile nodes cooperation for achieving design goals. In this paper, we propose a trust-based routing protocol i.e., 3VSR (Three Valued Secure Routing), which extends the widely used AODV (Ad hoc On-demand Distance Vector) routing protocol and employs the idea of Sensing Logic-based trust model to enhance the security solution of VANET (Vehicular Ad-Hoc Network). The existing routing protocol are mostly based on key or signature-based schemes, which off course increases computation overhead. In our proposed 3VSR, trust among entities is updated frequently by means of opinion derived from sensing logic due to vehicles random topologies. In 3VSR the theoretical capabilities are based on Dirichlet distribution by considering prior and posterior uncertainty of the said event. Also by using trust recommendation message exchange, nodes are able to reduce computation and routing overhead. The simulated results shows that the proposed scheme is secure and practical. PMID:29538314
Querying Natural Logic Knowledge Bases
DEFF Research Database (Denmark)
Andreasen, Troels; Bulskov, Henrik; Jensen, Per Anker
2017-01-01
This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes in ontol......This paper describes the principles of a system applying natural logic as a knowledge base language. Natural logics are regimented fragments of natural language employing high level inference rules. We advocate the use of natural logic for knowledge bases dealing with querying of classes...... in ontologies and class-relationships such as are common in life-science descriptions. The paper adopts a version of natural logic with recursive restrictive clauses such as relative clauses and adnominal prepositional phrases. It includes passive as well as active voice sentences. We outline a prototype...
Concrete Quantum Logics and Δ -Logics, States and Δ -States
Hroch, Michal; Pták, Pavel
2017-12-01
By a concrete quantum logic (in short, by a logic) we mean the orthomodular poset that is set-representable. If L=({Ω },L) is a logic and L is closed under the formation of symmetric difference, Δ , we call L a Δ -logic. In the first part we situate the known results on logics and states to the context of Δ -logics and Δ -states (the Δ -states are the states that are subadditive with respect to the symmetric difference). Moreover, we observe that the rather prominent logic E^{ {even}}_{Ω } of all even-coeven subsets of the countable set Ω possesses only Δ -states. Then we show when a state on the logics given by the divisibility relation allows for an extension as a state. In the next paragraph we consider the so called density logic and its Δ -closure. We find that the Δ -closure coincides with the power set. Then we investigate other properties of the density logic and its factor.
Logical Characterisation of Ontology Construction using Fuzzy Description Logics
DEFF Research Database (Denmark)
Badie, Farshad; Götzsche, Hans
Ontologies based on Description Logics (DLs) have proved to be effective in formally sharing knowledge across semantic technologies, e.g. Semantic Web, Natural Language Processing, Text Analytics, Business intelligence. Our main goal is analysing ontology construction considering vagueness. We have......, employs Description Logics in characterising and analysing fuzzy statements. And finally, provides a conceptual framework describing fuzzy concept learning in ontologies using the Inductive Logic Programming....
DEFF Research Database (Denmark)
Birkedal, Lars; Sieczkowski, Filip; Thamsborg, Jacob Junker
2012-01-01
We present a logical relation for showing the correctness of program transformations based on a new type-and-eﬀect system for a concurrent extension of an ML-like language with higher-order functions, higher-order store and dynamic memory allocation. We show how to use our model to verify a number...... of interesting program transformations that rely on eﬀect annotations. In particular, we prove a Parallelization Theorem, which expresses when it is sound to run two expressions in parallel instead of sequentially. The conditions are expressed solely in terms of the types and eﬀects of the expressions...
de Silva, A Prasanna
2011-03-01
Chemists are now able to emulate the ideas and instruments of mathematics and computer science with molecules. The integration of molecular logic gates into small arrays has been a growth area during the last few years. The design principles underlying a collection of these cases are examined. Some of these computing molecules are applicable in medical- and biotechnologies. Cases of blood diagnostics, 'lab-on-a-molecule' systems, and molecular computational identification of small objects are included. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Flexible programmable logic module
Robertson, Perry J.; Hutchinson, Robert L.; Pierson, Lyndon G.
2001-01-01
The circuit module of this invention is a VME board containing a plurality of programmable logic devices (PLDs), a controlled impedance clock tree, and interconnecting buses. The PLDs are arranged to permit systolic processing of a problem by offering wide data buses and a plurality of processing nodes. The board contains a clock reference and clock distribution tree that can drive each of the PLDs with two critically timed clock references. External clock references can be used to drive additional circuit modules all operating from the same synchronous clock reference.
Krötzsch, M
2010-01-01
Ontological modelling today is applied in many areas of science and technology,including the Semantic Web. The W3C standard OWL defines one of the most important ontology languages based on the semantics of description logics. An alternative is to use rule languages in knowledge modelling, as proposed in the W3C's RIF standard. So far, it has often been unclear how to combine both technologies without sacrificing essential computational properties. This book explains this problem and presents new solutions that have recently been proposed. Extensive introductory chapters provide the necessary
DEFF Research Database (Denmark)
Øhrstrøm, Peter
2009-01-01
This paper deals with A.N. Prior's analysis of the concepts of dynamic and static time, i.e. McTaggart's so-called A- and B-concepts. The relations and mutual dependencies between these temporal concepts are investigated, and Prior's response to McTaggart's views is discussed. Futhermore, Prior......'s notion of branching time is analysed. It is argued that Prior can be criticized for identifying 'plain future'. Finally, Prior's four grades of tense-logical involvement are introduced and discussed. It is argued that the third grade is the most attractive form a philosophical point of view....
Computability, complexity, logic
Börger, Egon
1989-01-01
The theme of this book is formed by a pair of concepts: the concept of formal language as carrier of the precise expression of meaning, facts and problems, and the concept of algorithm or calculus, i.e. a formally operating procedure for the solution of precisely described questions and problems. The book is a unified introduction to the modern theory of these concepts, to the way in which they developed first in mathematical logic and computability theory and later in automata theory, and to the theory of formal languages and complexity theory. Apart from considering the fundamental themes an
Bright, Liam Kofi
2017-10-01
The logical empiricists expressed a consistent attitude to racial categorisation in both the ethical and scientific spheres. Their attitude may be captured in the following slogan: human racial taxonomy is an empirically meaningful mode of classifying persons that we should refrain from deploying. I offer an interpretation of their position that would render coherent their remarks on race with positions they adopted on the scientific status of taxonomy in general, together with their potential moral or political motivations for adopting that position. Copyright © 2017 Elsevier Ltd. All rights reserved.
T Atanassov, Krassimir
2017-01-01
The book offers a comprehensive survey of intuitionistic fuzzy logics. By reporting on both the author’s research and others’ findings, it provides readers with a complete overview of the field and highlights key issues and open problems, thus suggesting new research directions. Starting with an introduction to the basic elements of intuitionistic fuzzy propositional calculus, it then provides a guide to the use of intuitionistic fuzzy operators and quantifiers, and lastly presents state-of-the-art applications of intuitionistic fuzzy sets. The book is a valuable reference resource for graduate students and researchers alike.
Classical Mathematical Logic The Semantic Foundations of Logic
Epstein, Richard L
2011-01-01
In Classical Mathematical Logic, Richard L. Epstein relates the systems of mathematical logic to their original motivations to formalize reasoning in mathematics. The book also shows how mathematical logic can be used to formalize particular systems of mathematics. It sets out the formalization not only of arithmetic, but also of group theory, field theory, and linear orderings. These lead to the formalization of the real numbers and Euclidean plane geometry. The scope and limitations of modern logic are made clear in these formalizations. The book provides detailed explanations of all proo
The Logic of Practice in the Practice of Logics
DEFF Research Database (Denmark)
Raviola, Elena; Dubini, Paola
2016-01-01
This paper investigates the workings of institutional logics in practice, by focusing in particular on the interplay between material, practical and linguistic dimensions of practices. In other words, drawing on Bourdieu's sens pratique, the paper explores the logic of practice in the practice...... of logics through a six months full-time ethnographic study at Il Sole-24 Ore, the largest Italian financial newspaper, between 2007 and 2008. An original conceptual framework is developed to analyse how the logic of journalism is enacted vis-à-vis that of advertising in a setting in which an old technology...
Games for Topological Fixpoint Logic
Directory of Open Access Journals (Sweden)
Nick Bezhanishvili
2016-09-01
Full Text Available Topological fixpoint logics are a family of logics that admits topological models and where the fixpoint operators are defined with respect to the topological interpretations. Here we consider a topological fixpoint logic for relational structures based on Stone spaces, where the fixpoint operators are interpreted via clopen sets. We develop a game-theoretic semantics for this logic. First we introduce games characterising clopen fixpoints of monotone operators on Stone spaces. These fixpoint games allow us to characterise the semantics for our topological fixpoint logic using a two-player graph game. Adequacy of this game is the main result of our paper. Finally, we define bisimulations for the topological structures under consideration and use our game semantics to prove that the truth of a formula of our topological fixpoint logic is bisimulation-invariant.
National Oceanic and Atmospheric Administration, Department of Commerce — Circular Updates are periodic sequentially numbered instructions to debriefing staff and observers informing them of changes or additions to scientific and specimen...
Excise Taxes with Multiproduct Transactions
Stephen F. Hamilton
2009-01-01
I examine excise taxes levied on multiproduct retailers. Excise taxes reduce equilibrium output and decrease equilibrium product variety in the short run, but taxes can raise output per product in the long run and induce entry. Excise taxes are overshifted into prices in a wide range of cases, including under linear and concave demand conditions, and excise taxes shift less than one-for-one into prices only when demand is highly convex. Multiproduct transactions substantively alter the effici...
Environmental taxes and transaction costs
International Nuclear Information System (INIS)
Vollebergh, Herman R.J.
1994-06-01
A well-known tax policy principle in the case of environmental bads holds that optimality would apply to a special class of environmental taxes, the so called Pigovian or effluent taxes (or fees or charges). However, an interesting paradox arises here for effluent taxes are seldom chosen in practical policies by governments. An explanation for this discrepancy is that effluent taxes are generally supposed to bring about the highest amount of transaction costs in order to enforce this kind of tax. This would be caused by the fact that usually large numbers of agents are involved if effluents are taken as the principal tax base. Unfortunately this explanation seems to boomerang for it brings about an impossibility result: effluent taxes can never be first best taxes if transaction costs are allowed. Up till now theoretical economics has not paid much attention to this problem. In contrast this essay offers an explanation for the discrepancy and it shows why the impossibility theorem is a paradox. As soon as one allows for transaction costs in welfare analysis, one not only has to acknowledge that such costs are attached to the internalization device but also to the initial status quo. Moreover, the amount of transaction costs is not independent of the tax contracts themselves, neither are the benefits of regulation through taxation. Accordingly a more general welfare assessment of questions where it is optimal to levy environmental taxes shows that first best Pigovian taxes need not be effluent taxes (even if abatement is possible), although in some cases effluent taxes might still be the best policy option from an economic perspective. 31 refs
Superconducting digital logic amplifier
International Nuclear Information System (INIS)
Przybysz, J.X.
1989-01-01
This paper describes a superconducting digital logic amplifier for interfacing between a Josephson junction logic circuit having output current and a higher voltage semiconductor circuit input. The amplifier comprising: an input terminal for connection to a; an output terminal for connection to a semiconductor circuit input; an input, lower critical current, Josephson junction having first and second terminals; a first series string of at least three lower critical current Josephson junctions. The first series string being connected to the first terminal of the input Josephson junction such that the first series string is in series with the input Josephson junction to provide a series combination. The input terminal being connected to the first terminal of the input Josephson junction, and with the critical current of the lower critical current Josephson junctions of the input Josephson junction and the first series Josephson junctions being less than the output current of the low voltage Josephson junction circuit; a second series string of at least four higher critical current Josephson junctions. The second string being connected in parallel with the series combination to provide parallel strings having an upper common connection and a lower common connection. The lower common connection being connected to the second terminal of the input Josephson junction and the upper common connection being connected to the output terminal; and a pulsed DC current source connected the parallel strings at the upper common connection. The DC current source having a current at least equal to the critical current of the higher critical current Josephson junctions
Identifying Bitcoin users by transaction behavior
Monaco, John V.
2015-05-01
Digital currencies, such as Bitcoin, offer convenience and security to criminals operating in the black marketplace. Some Bitcoin marketplaces, such as Silk Road, even claim anonymity. This claim contradicts the findings in this work, where long term transactional behavior is used to identify and verify account holders. Transaction timestamps and network properties observed over time contribute to this finding. The timestamp of each transaction is the result of many factors: the desire purchase an item, daily schedule and activities, as well as hardware and network latency. Dynamic network properties of the transaction, such as coin flow and the number of edge outputs and inputs, contribute further to reveal account identity. In this paper, we propose a novel methodology for identifying and verifying Bitcoin users based on the observation of Bitcoin transactions over time. The behavior we attempt to quantify roughly occurs in the social band of Newell's time scale. A subset of the Blockchain 230686 is taken, selecting users that initiated between 100 and 1000 unique transactions per month for at least 6 different months. This dataset shows evidence of being nonrandom and nonlinear, thus a dynamical systems approach is taken. Classification and authentication accuracies are obtained under various representations of the monthly Bitcoin samples: outgoing transactions, as well as both outgoing and incoming transactions are considered, along with the timing and dynamic network properties of transaction sequences. The most appropriate representations of monthly Bitcoin samples are proposed. Results show an inherent lack of anonymity by exploiting patterns in long-term transactional behavior.
PM 3655 PHILIPS Logic analyzer
A logic analyzer is an electronic instrument that captures and displays multiple signals from a digital system or digital circuit. A logic analyzer may convert the captured data into timing diagrams, protocol decodes, state machine traces, assembly language, or may correlate assembly with source-level software. Logic Analyzers have advanced triggering capabilities, and are useful when a user needs to see the timing relationships between many signals in a digital system.
Logical Full Abstraction and PCF
Longley, John R; Plotkin, Gordon
2000-01-01
We introduce the concept of logical full abstraction, generalising the usual equational notion. We consider the language PCF and two extensions with “parallel” operations. The main result is that, for standard interpretations, logical full abstraction is equivalent to equational full abstraction together with universality; the proof involves constructing enumeration operators. We also consider restrictions on logical complexity and on the level of types.
A Logic for Miranda, Revisited
Thompson, Simon
1995-01-01
This paper expands upon work begun in the author's paper 'A Logic for Miranda', Formal Aspects of Computing 1 (1989), in building a logic for the Miranda functional programming language. After summarising the work in that paper, a translation of Miranda definitions into logical formulas is presented, and illustrated by means of examples. This work expands upon the earlier paper in giving a complete treatment of sequences of equations, and by examining how to translate the local definitions in...
Visualizing Dynamic Bitcoin Transaction Patterns.
McGinn, Dan; Birch, David; Akroyd, David; Molina-Solana, Miguel; Guo, Yike; Knottenbelt, William J
2016-06-01
This work presents a systemic top-down visualization of Bitcoin transaction activity to explore dynamically generated patterns of algorithmic behavior. Bitcoin dominates the cryptocurrency markets and presents researchers with a rich source of real-time transactional data. The pseudonymous yet public nature of the data presents opportunities for the discovery of human and algorithmic behavioral patterns of interest to many parties such as financial regulators, protocol designers, and security analysts. However, retaining visual fidelity to the underlying data to retain a fuller understanding of activity within the network remains challenging, particularly in real time. We expose an effective force-directed graph visualization employed in our large-scale data observation facility to accelerate this data exploration and derive useful insight among domain experts and the general public alike. The high-fidelity visualizations demonstrated in this article allowed for collaborative discovery of unexpected high frequency transaction patterns, including automated laundering operations, and the evolution of multiple distinct algorithmic denial of service attacks on the Bitcoin network.
Visualizing Dynamic Bitcoin Transaction Patterns
McGinn, Dan; Birch, David; Akroyd, David; Molina-Solana, Miguel; Guo, Yike; Knottenbelt, William J.
2016-01-01
Abstract This work presents a systemic top-down visualization of Bitcoin transaction activity to explore dynamically generated patterns of algorithmic behavior. Bitcoin dominates the cryptocurrency markets and presents researchers with a rich source of real-time transactional data. The pseudonymous yet public nature of the data presents opportunities for the discovery of human and algorithmic behavioral patterns of interest to many parties such as financial regulators, protocol designers, and security analysts. However, retaining visual fidelity to the underlying data to retain a fuller understanding of activity within the network remains challenging, particularly in real time. We expose an effective force-directed graph visualization employed in our large-scale data observation facility to accelerate this data exploration and derive useful insight among domain experts and the general public alike. The high-fidelity visualizations demonstrated in this article allowed for collaborative discovery of unexpected high frequency transaction patterns, including automated laundering operations, and the evolution of multiple distinct algorithmic denial of service attacks on the Bitcoin network. PMID:27441715
Tensor product of quantum logics
Pulmannová, Sylvia
1985-01-01
A quantum logic is the couple (L,M) where L is an orthomodular σ-lattice and M is a strong set of states on L. The Jauch-Piron property in the σ-form is also supposed for any state of M. A ``tensor product'' of quantum logics is defined. This definition is compared with the definition of a free orthodistributive product of orthomodular σ-lattices. The existence and uniqueness of the tensor product in special cases of Hilbert space quantum logics and one quantum and one classical logic are studied.
Optimization methods for logical inference
Chandru, Vijay
2011-01-01
Merging logic and mathematics in deductive inference-an innovative, cutting-edge approach. Optimization methods for logical inference? Absolutely, say Vijay Chandru and John Hooker, two major contributors to this rapidly expanding field. And even though ""solving logical inference problems with optimization methods may seem a bit like eating sauerkraut with chopsticks. . . it is the mathematical structure of a problem that determines whether an optimization model can help solve it, not the context in which the problem occurs."" Presenting powerful, proven optimization techniques for logic in
Contextual logic for quantum systems
International Nuclear Information System (INIS)
Domenech, Graciela; Freytes, Hector
2005-01-01
In this work we build a quantum logic that allows us to refer to physical magnitudes pertaining to different contexts from a fixed one without the contradictions with quantum mechanics expressed in no-go theorems. This logic arises from considering a sheaf over a topological space associated with the Boolean sublattices of the ortholattice of closed subspaces of the Hilbert space of the physical system. Different from standard quantum logics, the contextual logic maintains a distributive lattice structure and a good definition of implication as a residue of the conjunction
Admissibility of logical inference rules
Rybakov, VV
1997-01-01
The aim of this book is to present the fundamental theoretical results concerning inference rules in deductive formal systems. Primary attention is focused on: admissible or permissible inference rules the derivability of the admissible inference rules the structural completeness of logics the bases for admissible and valid inference rules. There is particular emphasis on propositional non-standard logics (primary, superintuitionistic and modal logics) but general logical consequence relations and classical first-order theories are also considered. The book is basically self-contained and
DEFF Research Database (Denmark)
A.N. Prior (1914-69) in the course of the 1950s and 1960s founded a new and revolutionary paradigm in philosophy and logic. Its most central feature is the preoccupation with time and the development of the logic of time. However, this was inseparably interwoven with fundamental questions about...... human freedom, ethics, and existence. This remarkable integration of themes also embodies an original and in fact revolutionary conception of logic. The book series, Logic and Philosophy of Time, is dedicated to a deep investigation and also the further development of Prior’s paradigm. ...
Popular lectures on mathematical logic
Wang, Hao
2014-01-01
A noted logician and philosopher addresses various forms of mathematical logic, discussing both theoretical underpinnings and practical applications. Author Hao Wang surveys the central concepts and theories of the discipline in a historical and developmental context, and then focuses on the four principal domains of contemporary mathematical logic: set theory, model theory, recursion theory and constructivism, and proof theory.Topics include the place of problems in the development of theories of logic and logic's relation to computer science. Specific attention is given to Gödel's incomplete
Logic from nonlinear dynamical evolution
Energy Technology Data Exchange (ETDEWEB)
Murali, K. [J. Crayton Pruitt Family Department of Biomedical Engineering, University of Florida, Gainesville, FL 32611-6131 (United States); Department of Physics, Anna University, Chennai 600 025 (India)], E-mail: kmurali@annauniv.edu; Miliotis, Abraham; Ditto, William L. [J. Crayton Pruitt Family Department of Biomedical Engineering, University of Florida, Gainesville, FL 32611-6131 (United States); Sinha, Sudeshna [Institute of Mathematical Sciences, C.I.T. Campus, Chennai 600 113 (India)
2009-03-30
We propose a direct and flexible implementation of logic operations using the dynamical evolution of a nonlinear system. The concept involves the observation of the state of the system at different times to obtain different logic outputs. We explicitly implement the basic NAND, AND, NOR, OR and XOR logic gates, as well as multiple-input XOR and XNOR logic gates. Further we demonstrate how the single dynamical system can do more complex operations such as bit-by-bit addition in just a few iterations.
Logic from nonlinear dynamical evolution
International Nuclear Information System (INIS)
Murali, K.; Miliotis, Abraham; Ditto, William L.; Sinha, Sudeshna
2009-01-01
We propose a direct and flexible implementation of logic operations using the dynamical evolution of a nonlinear system. The concept involves the observation of the state of the system at different times to obtain different logic outputs. We explicitly implement the basic NAND, AND, NOR, OR and XOR logic gates, as well as multiple-input XOR and XNOR logic gates. Further we demonstrate how the single dynamical system can do more complex operations such as bit-by-bit addition in just a few iterations
Implicational (Semilinear) Logics I: A New Hierarchy
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Noguera, C.
2010-01-01
Roč. 49, č. 4 (2010), s. 417-446 ISSN 1432-0665 R&D Projects: GA ČR GEICC/08/E018 Institutional research plan: CEZ:AV0Z10300504 Keywords : abstract algebraic logic * hierarchy of implicational logics * implicative logics * Leibniz hierarchy * linearly ordered logical matrices * mathematical fuzzy logic * non-classical logics * semilinear logics Subject RIV: BA - General Mathematics Impact factor: 0.414, year: 2010
2005-01-01
A new all-electronic Particle Image Velocimetry technique that can efficiently map high speed gas flows has been developed in-house at the NASA Lewis Research Center. Particle Image Velocimetry is an optical technique for measuring the instantaneous two component velocity field across a planar region of a seeded flow field. A pulsed laser light sheet is used to illuminate the seed particles entrained in the flow field at two instances in time. One or more charged coupled device (CCD) cameras can be used to record the instantaneous positions of particles. Using the time between light sheet pulses and determining either the individual particle displacements or the average displacement of particles over a small subregion of the recorded image enables the calculation of the fluid velocity. Fuzzy logic minimizes the required operator intervention in identifying particles and computing velocity. Using two cameras that have the same view of the illumination plane yields two single exposure image frames. Two competing techniques that yield unambiguous velocity vector direction information have been widely used for reducing the single-exposure, multiple image frame data: (1) cross-correlation and (2) particle tracking. Correlation techniques yield averaged velocity estimates over subregions of the flow, whereas particle tracking techniques give individual particle velocity estimates. For the correlation technique, the correlation peak corresponding to the average displacement of particles across the subregion must be identified. Noise on the images and particle dropout result in misidentification of the true correlation peak. The subsequent velocity vector maps contain spurious vectors where the displacement peaks have been improperly identified. Typically these spurious vectors are replaced by a weighted average of the neighboring vectors, thereby decreasing the independence of the measurements. In this work, fuzzy logic techniques are used to determine the true
The Apriori Stochastic Dependency Detection (ASDD) algorithm for learning Stochastic logic rules
Child, C. H. T.; Stathis, K.
2005-01-01
Apriori Stochastic Dependency Detection (ASDD) is an algorithm for fast induction of stochastic logic rules from a database of observations made by an agent situated in an environment. ASDD is based on features of the Apriori algorithm for mining association rules in large databases of sales transactions [1] and the MSDD algorithm for discovering stochastic dependencies in multiple streams of data [15]. Once these rules have been acquired the Precedence algorithm assigns operator precedence w...
A First-Order Policy Language for History-Based Transaction Monitoring
Bauer, Andreas; Goré, Rajeev; Tiu, Alwen
Online trading invariably involves dealings between strangers, so it is important for one party to be able to judge objectively the trustworthiness of the other. In such a setting, the decision to trust a user may sensibly be based on that user’s past behaviour. We introduce a specification language based on linear temporal logic for expressing a policy for categorising the behaviour patterns of a user depending on its transaction history. We also present an algorithm for checking whether the transaction history obeys the stated policy. To be useful in a real setting, such a language should allow one to express realistic policies which may involve parameter quantification and quantitative or statistical patterns. We introduce several extensions of linear temporal logic to cater for such needs: a restricted form of universal and existential quantification; arbitrary computable functions and relations in the term language; and a “counting” quantifier for counting how many times a formula holds in the past. We then show that model checking a transaction history against a policy, which we call the history-based transaction monitoring problem, is PSPACE-complete in the size of the policy formula and the length of the history, assuming that the underlying interpreted functions and relations are polynomially computable. The problem becomes decidable in polynomial time when the policies are fixed. We also consider the problem of transaction monitoring in the case where not all the parameters of actions are observable. We formulate two such “partial observability” monitoring problems, and show their decidability under certain restrictions.
Private benefits in corporate control transactions
DEFF Research Database (Denmark)
Poulsen, Thomas
with high security benefits, or because the buyer has high private benefits from the control rights that come with the shares? Using voting rights as the vehicle for private benefits, I find that the selling shareholders in block transactions attach more value to private benefits than the buyers. In tender......This paper presents an analytical framework from which it can be inferred whether sellers or buyers in corporate control transactions value private benefits highest. I am thus able to suggest an answer to the question: Are blocks of shares traded because the buyer is a more efficient monitor...... offer transactions, the answer is that private benefits are insignificant to both sides of the transaction. As an alternative measure of the transaction premium, I calculate the abnormal return premium. This represents the stock market's valuation of the transaction. I find that the stock market puts...
Towards an arithmetical logic the arithmetical foundations of logic
Gauthier, Yvon
2015-01-01
This book offers an original contribution to the foundations of logic and mathematics, and focuses on the internal logic of mathematical theories, from arithmetic or number theory to algebraic geometry. Arithmetical logic is the term used to refer to the internal logic of classical arithmetic, here called Fermat-Kronecker arithmetic, and combines Fermat’s method of infinite descent with Kronecker’s general arithmetic of homogeneous polynomials. The book also includes a treatment of theories in physics and mathematical physics to underscore the role of arithmetic from a constructivist viewpoint. The scope of the work intertwines historical, mathematical, logical and philosophical dimensions in a unified critical perspective; as such, it will appeal to a broad readership from mathematicians to logicians, to philosophers interested in foundational questions. Researchers and graduate students in the fields of philosophy and mathematics will benefit from the author’s critical approach to the foundations of l...
Correctness of Concurrent Executions of Closed Nested Transactions in Transactional Memory Systems
Peri, Sathya; Vidyasankar, Krishnamurthy
A generally agreed upon requirement for correctness of concurrent executions in Transactional Memory systems is that all transactions including the aborted ones read consistent values. Opacity is a recently proposed correctness criterion that satisfies the above requirement. Our first contribution in this paper is extending the opacity definition for closed nested transactions. Secondly, we define conflicts appropriate for optimistic executions which are commonly used in Software Transactional Memory systems. Using these conflicts, we define a restricted, conflict-preserving, class of opacity for closed nested transactions the membership of which can be tested in polynomial time. As our third contribution, we propose a correctness criterion that defines a class of schedules where aborted transactions do not affect consistency of the other transactions. We define a conflict-preserving subclass of this class as well. Both the class definitions and the conflict definition are new for nested transactions.
Borresen, Jon; Lynch, Stephen
2012-01-01
In the 1940s, the first generation of modern computers used vacuum tube oscillators as their principle components, however, with the development of the transistor, such oscillator based computers quickly became obsolete. As the demand for faster and lower power computers continues, transistors are themselves approaching their theoretical limit and emerging technologies must eventually supersede them. With the development of optical oscillators and Josephson junction technology, we are again presented with the possibility of using oscillators as the basic components of computers, and it is possible that the next generation of computers will be composed almost entirely of oscillatory devices. Here, we demonstrate how coupled threshold oscillators may be used to perform binary logic in a manner entirely consistent with modern computer architectures. We describe a variety of computational circuitry and demonstrate working oscillator models of both computation and memory. PMID:23173034
Partial quantum logics revisited
Vetterlein, Thomas
2011-01-01
Partial Boolean algebras (PBAs) were introduced by Kochen and Specker as an algebraic model reflecting the mutual relationships among quantum-physical yes-no tests. The fact that not all pairs of tests are compatible was taken into special account. In this paper, we review PBAs from two sides. First, we generalise the concept, taking into account also those yes-no tests which are based on unsharp measurements. Namely, we introduce partial MV-algebras, and we define a corresponding logic. Second, we turn to the representation theory of PBAs. In analogy to the case of orthomodular lattices, we give conditions for a PBA to be isomorphic to the PBA of closed subspaces of a complex Hilbert space. Hereby, we do not restrict ourselves to purely algebraic statements; we rather give preference to conditions involving automorphisms of a PBA. We conclude by outlining a critical view on the logico-algebraic approach to the foundational problem of quantum physics.
DEFF Research Database (Denmark)
Ramli, Carroline Dewi Puspa Kencana; Nielson, Hanne Riis; Nielson, Flemming
2014-01-01
We study the international standard XACML 3.0 for describing security access control policies in a compositional way. Our main contributions are (i) to derive a logic that precisely captures the intentions of the standard, (ii) to formally define a semantics for the XACML 3.0 component evaluation......, and (iii) to define a semantics for the XACML 3.0 standard combining operators. To guard against modeling artefacts we provide an alternative lattice based way of characterizing the policy combining operators and we formally prove the equivalence of these approaches thereby increasing our faith in either...... one. We then discuss several ways of extending XACML: one direction is to extend XACML with new combining operators, and another direction is to incorporate the notion of conflict into XACML. We conclude by discussing the possibility of analysing XACML policies for gaps and conflicts....
Cleaveland, Rance; Luettgen, Gerald; Bushnell, Dennis M. (Technical Monitor)
2002-01-01
This paper presents the Logical Process Calculus (LPC), a formalism that supports heterogeneous system specifications containing both operational and declarative subspecifications. Syntactically, LPC extends Milner's Calculus of Communicating Systems with operators from the alternation-free linear-time mu-calculus (LT(mu)). Semantically, LPC is equipped with a behavioral preorder that generalizes Hennessy's and DeNicola's must-testing preorder as well as LT(mu's) satisfaction relation, while being compositional for all LPC operators. From a technical point of view, the new calculus is distinguished by the inclusion of: (1) both minimal and maximal fixed-point operators and (2) an unimple-mentability predicate on process terms, which tags inconsistent specifications. The utility of LPC is demonstrated by means of an example highlighting the benefits of heterogeneous system specification.
Transaction Costs, Market Failure and Economic Development
Todorova, Tamara
2016-01-01
This paper relates economic development to transaction costs. It reveals the triad transaction costs-market failure-economic underdevelopment. Many scholars attribute the problems of development to the failure of markets to perform their role of resource allocation. Some deny market failure and blame government instead. Of those who trace the roots of economic backwardness to market failure, few, if none, investigate transaction costs in their linkage with market failure. This paper tries to ...
Solving transactional control in current management frameworks
Roque, Vitor; Oliveira, José Luís; Lopes, Rui Pedro
2004-01-01
Policy Based Network Management has been presented as a paradigm for efficient and customisable management systems. The IETF has provided a framework to describe the concept but some aspects still open like transactional control. In fact transactional control mechanisms are receiving today great attention in the scope of network management. In here, we identify the lacks of current management paradigms concerning transactional control and we propose a policy-based network manageme...
Solving Transactional Control in Current Management Frameworks
Roque, Vítor
2004-01-01
Policy Based Network Management has been presented as a paradigm for efficient and customisable management systems. The IETF has provided a framework to describe the concept but some aspects still open like transactional control. In fact transactional control mechanisms are receiving today great attention in the scope of network management. In here, we identify the lacks of current management paradigms concerning transactional control and we propose a policy-based network management system th...
Logical entropy of quantum dynamical systems
Directory of Open Access Journals (Sweden)
Ebrahimzadeh Abolfazl
2016-01-01
Full Text Available This paper introduces the concepts of logical entropy and conditional logical entropy of hnite partitions on a quantum logic. Some of their ergodic properties are presented. Also logical entropy of a quantum dynamical system is dehned and ergodic properties of dynamical systems on a quantum logic are investigated. Finally, the version of Kolmogorov-Sinai theorem is proved.
Reversible logic gates on Physarum Polycephalum
International Nuclear Information System (INIS)
Schumann, Andrew
2015-01-01
In this paper, we consider possibilities how to implement asynchronous sequential logic gates and quantum-style reversible logic gates on Physarum polycephalum motions. We show that in asynchronous sequential logic gates we can erase information because of uncertainty in the direction of plasmodium propagation. Therefore quantum-style reversible logic gates are more preferable for designing logic circuits on Physarum polycephalum
Fuzzy Logic and Arithmetical Hierarchy III
Czech Academy of Sciences Publication Activity Database
Hájek, Petr
2001-01-01
Roč. 68, č. 1 (2001), s. 129-142 ISSN 0039-3215 R&D Projects: GA AV ČR IAA1030004 Institutional research plan: AV0Z1030915 Keywords : fuzzy logic * basic fuzzy logic * Lukasiewicz logic * Godel logic * product logic * arithmetical hierarchy Subject RIV: BA - General Mathematics
Flat Coalgebraic Fixed Point Logics
Schröder, Lutz; Venema, Yde
Fixed point logics are widely used in computer science, in particular in artificial intelligence and concurrency. The most expressive logics of this type are the μ-calculus and its relatives. However, popular fixed point logics tend to trade expressivity for simplicity and readability, and in fact often live within the single variable fragment of the μ-calculus. The family of such flat fixed point logics includes, e.g., CTL, the *-nesting-free fragment of PDL, and the logic of common knowledge. Here, we extend this notion to the generic semantic framework of coalgebraic logic, thus covering a wide range of logics beyond the standard μ-calculus including, e.g., flat fragments of the graded μ-calculus and the alternating-time μ-calculus (such as ATL), as well as probabilistic and monotone fixed point logics. Our main results are completeness of the Kozen-Park axiomatization and a timed-out tableaux method that matches ExpTime upper bounds inherited from the coalgebraic μ-calculus but avoids using automata.
Methods in Logic Based Control
DEFF Research Database (Denmark)
Christensen, Georg Kronborg
1999-01-01
Desing and theory of Logic Based Control systems.Boolean Algebra, Karnaugh Map, Quine McClusky's algorithm. Sequential control design. Logic Based Control Method, Cascade Control Method. Implementation techniques: relay, pneumatic, TTL/CMOS,PAL and PLC- and Soft_PLC implementation. PLC...
Injection--ejection protection logic
International Nuclear Information System (INIS)
Brown, H.
1975-01-01
A brief sketch is given of the beginnings of the protective logic which would be needed to guard against quenches or damage in the ISA rings. Two logic diagrams are presented which illustrate the most obvious facets of the hard-wired protection system
DEFF Research Database (Denmark)
By blending historical research with current research, this collection (loosely inspired by themes from the work of Arthur Prior) demonstrates the importance of Prior's writings and helps us to gain a deeper understanding of time, its logic(s), and its language(s)....
Hybrid logics with Sahlqvist axioms
ten Cate, B.; Marx, M.; Viana, P.
2005-01-01
We show that every extension of the basic hybrid logic with modal Sahlqvist axioms is complete. As a corollary of our approach, we also obtain the Beth property for a large class of hybrid logics. Finally, we show that the new completeness result cannot be combined with the existing general
Flow Logics and Operational Semantics
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis
1998-01-01
Flow logic is a “fast prototyping” approach to program analysis that shows great promise of being able to deal with a wide variety of languages and calculi for computation. However, seemingly innocent choices in the flow logic as well as in the operational semantics may inhibit proving the analysis...
Japanese Logic Puzzles and Proof
Wanko, Jeffrey J.
2009-01-01
An understanding of proof does not start in a high school geometry course. Rather, attention to logical reasoning throughout a student's school experience can help the development of proof readiness. In the spirit of problem solving, the author has begun to use some Japanese logic puzzles other than sudoku to help students develop additional…
Epistemic logics for sceptical agents
Czech Academy of Sciences Publication Activity Database
Bílková, M.; Majer, Ondrej; Peliš, Michal
2016-01-01
Roč. 26, č. 6 (2016), s. 1815-1841 ISSN 0955-792X R&D Projects: GA ČR(CZ) GA13-21076S Institutional support: RVO:67985955 Keywords : epistemic logic * substructural logic * frame semantics Subject RIV: AA - Philosophy ; Religion Impact factor: 0.909, year: 2016
Towards Logical Designs In Biology
Indian Academy of Sciences (India)
Towards Logical Designs in Biology. Garima Agarwal. General Article Volume 12 Issue 2 February 2007 pp 29-38. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/012/02/0029-0038. Keywords. Synthetic biology; logic gates; regulatory modules; gene circuits. Author Affiliations.
Structural Completeness in Fuzzy Logics
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Metcalfe, G.
2009-01-01
Roč. 50, č. 2 (2009), s. 153-183 ISSN 0029-4527 R&D Projects: GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10300504 Keywords : structral logics * fuzzy logics * structural completeness * admissible rules * primitive variety * residuated lattices Subject RIV: BA - General Mathematics
Zalta on Unnecessary Logical Truths
Directory of Open Access Journals (Sweden)
MA Hojati
2013-09-01
Full Text Available According to a traditional view all logical truths are necessary however, this thesis recently has been faced with various critiques from different points of view. Introducing some logical operators, David Kaplan and Edward Zalta claim that there are logical truths regarding common definition ‒ that are not necessary. William Hanson objects Zalta's examples believing that they rely on unjustified presuppositions especially he does not accept real world validity as a proper notion for presenting logical truth. Nelson and Zalta reply to his objections claiming that they have unacceptable grounds. In this paper, we introduce logical truths, then present Kaplan's and Zalta's examples and explore Hanson's objections together with their replies. At last we try to show the metaphysical roots of the debates.
Zalta on Unnecessary Logical Truths
Directory of Open Access Journals (Sweden)
SH Shahryari
2013-08-01
Full Text Available According to a traditional view all logical truths are necessary however, this thesis recently has been faced with various critiques from different points of view. Introducing some logical operators, David Kaplan and Edward Zalta claim that there are logical truths regarding common definition â that are not necessary. William Hanson objects Zalta's examples believing that they rely on unjustified presuppositions especially he does not accept real world validity as a proper notion for presenting logical truth. Nelson and Zalta reply to his objections claiming that they have unacceptable grounds. In this paper, we introduce logical truths, then present Kaplan's and Zalta's examples and explore Hanson's objections together with their replies. At last we try to show the metaphysical roots of the debates.
Logical independence and quantum randomness
International Nuclear Information System (INIS)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C; Prevedel, R; Klimek, P
2010-01-01
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Logical independence and quantum randomness
Energy Technology Data Exchange (ETDEWEB)
Paterek, T; Kofler, J; Aspelmeyer, M; Zeilinger, A; Brukner, C [Institute for Quantum Optics and Quantum Information, Austrian Academy of Sciences, Boltzmanngasse 3, A-1090 Vienna (Austria); Prevedel, R; Klimek, P [Faculty of Physics, University of Vienna, Boltzmanngasse 5, A-1090 Vienna (Austria)], E-mail: tomasz.paterek@univie.ac.at
2010-01-15
We propose a link between logical independence and quantum physics. We demonstrate that quantum systems in the eigenstates of Pauli group operators are capable of encoding mathematical axioms and show that Pauli group quantum measurements are capable of revealing whether or not a given proposition is logically dependent on the axiomatic system. Whenever a mathematical proposition is logically independent of the axioms encoded in the measured state, the measurement associated with the proposition gives random outcomes. This allows for an experimental test of logical independence. Conversely, it also allows for an explanation of the probabilities of random outcomes observed in Pauli group measurements from logical independence without invoking quantum theory. The axiomatic systems we study can be completed and are therefore not subject to Goedel's incompleteness theorem.
Transactions on Computational Science IX
DEFF Research Database (Denmark)
The 9th issue of the Transactions on Computational Science journal, edited by François Anton, is devoted to the subject of Voronoi diagrams in science and engineering. The 9 papers included in the issue constitute extended versions of selected papers from the International Symposium on Voronoi...... Diagrams, held in Copenhagen, Denmark, June 23-36, 2009. Topics covered include: divide and conquer construction of Voronoi diagrams; new generalized Voronoi diagrams or properties of existing generalized Voronoi diagrams; and applications of Voronoi diagrams and their duals in graph theory, computer...
Getting started with Oracle WebLogic Server 12c developer's guide
Nunes, Fabio Mazanatti
2013-01-01
Getting Started with Oracle WebLogic Server 12c is a fast-paced and feature-packed book, designed to get you working with Java EE 6, JDK 7 and Oracle WebLogic Server 12c straight away, so start developing your own applications.Getting Started with Oracle WebLogic Server 12c: Developer's Guide is written for developers who are just getting started, or who have some experience, with Java EE who want to learn how to develop for and use Oracle WebLogic Server. Getting Started with Oracle WebLogic Server 12c: Developer's Guide also provides a great overview of the updated features of the 12c releas
Logic regression and its extensions.
Schwender, Holger; Ruczinski, Ingo
2010-01-01
Logic regression is an adaptive classification and regression procedure, initially developed to reveal interacting single nucleotide polymorphisms (SNPs) in genetic association studies. In general, this approach can be used in any setting with binary predictors, when the interaction of these covariates is of primary interest. Logic regression searches for Boolean (logic) combinations of binary variables that best explain the variability in the outcome variable, and thus, reveals variables and interactions that are associated with the response and/or have predictive capabilities. The logic expressions are embedded in a generalized linear regression framework, and thus, logic regression can handle a variety of outcome types, such as binary responses in case-control studies, numeric responses, and time-to-event data. In this chapter, we provide an introduction to the logic regression methodology, list some applications in public health and medicine, and summarize some of the direct extensions and modifications of logic regression that have been proposed in the literature. Copyright © 2010 Elsevier Inc. All rights reserved.
Banknotes and unattended cash transactions
Bernardini, Ronald R.
2000-04-01
There is a 64 billion dollar annual unattended cash transaction business in the US with 10 to 20 million daily transactions. Even small problems with the machine readability of banknotes can quickly become a major problem to the machine manufacturer and consumer. Traditional note designs incorporate overt security features for visual validation by the public. Many of these features such as fine line engraving, microprinting and watermarks are unsuitable as machine readable features in low cost note acceptors. Current machine readable features, mostly covert, were designed and implemented with the central banks in mind. These features are only usable by the banks large, high speed currency sorting and validation equipment. New note designs should consider and provide for low cost not acceptors, implementing features developed for inexpensive sensing technologies. Machine readable features are only as good as their consistency. Quality of security features as well as that of the overall printing process must be maintained to ensure reliable and secure operation of note readers. Variations in printing and of the components used to make the note are one of the major causes of poor performance in low cost note acceptors. The involvement of machine manufacturers in new currency designs will aid note producers in the design of a note that is machine friendly, helping to secure the acceptance of the note by the public as well as acting asa deterrent to fraud.
Kral, M J
1994-01-01
Although suicide is not viewed as a mental disorder per se, it is viewed by many if not most clinicians, researchers, and lay people as a real or natural symptom of depression. It is at least most typically seen as the unfortunate, severe, yet logical end result of a chain of negative self-appraisals, negative events, and hopelessness. Extending an approach articulated by the early French sociologist Gabriel Tarde, in this paper I argue that suicide is merely an idea, albeit a very bad one, having more in common with societal beliefs and norms regarding such things as divorce, abortion, sex, politics, consumer behavior, and fashion. I make a sharp contrast between perturbation and lethality, concepts central to Edwin S. Shneidman's theory of suicide. Evidence supportive of suicide as an idea is discussed based on what we are learning from the study of history and culture, and about contagion/cluster phenomena, media/communication, and choice of method. It is suggested that certain individuals are more vulnerable to incorporate the idea and act of suicide into their concepts of self, based on the same principles by which ideas are spread throughout society. Just as suicide impacts on society, so does society impact on suicide.
Remmel, Jeffrey; Shore, Richard; Sweedler, Moss; Progress in Computer Science and Applied Logic
1993-01-01
The twenty-six papers in this volume reflect the wide and still expanding range of Anil Nerode's work. A conference on Logical Methods was held in honor of Nerode's sixtieth birthday (4 June 1992) at the Mathematical Sciences Institute, Cornell University, 1-3 June 1992. Some of the conference papers are here, but others are from students, co-workers and other colleagues. The intention of the conference was to look forward, and to see the directions currently being pursued, in the development of work by, or with, Nerode. Here is a brief summary of the contents of this book. We give a retrospective view of Nerode's work. A number of specific areas are readily discerned: recursive equivalence types, recursive algebra and model theory, the theory of Turing degrees and r.e. sets, polynomial-time computability and computer science. Nerode began with automata theory and has also taken a keen interest in the history of mathematics. All these areas are represented. The one area missing is Nerode's applied mathematica...
Related Party Transactions and Firms Financial Performance
African Journals Online (AJOL)
Prof
Chien and Hsu (2010) found a positive moderating effect of corporate governance on the related transactions-firm performance relationship and deduce that presence of corporate governance could 'transfer' related party transactions 'conflict- of-interest' to be efficient. Past studies on the impact of RPT on financial reporting ...
Introduction to the Theory of Nested Transactions,
1986-07-01
since the common terminology for access and non-access transactions is of great benefit in unifying the statements and proofs of our results. ’lhus...34Guardians and Actions: Linguistic Support for Robust, 60 Distributed Programs", ACAI Transactions on Programming Ianguages and Systems 5. 3, (July
Trust management for e-transactions
Indian Academy of Sciences (India)
2016-08-26
Aug 26, 2016 ... This is both a technical and a social phenomenon. Transactions and services over the internet have global reach and users, known or unknown to the service provider, might be interested in availing access or participating in the cooperative transaction in a distributed manner. Thus, it is very important for ...
The transactional approach in company boundaries
Directory of Open Access Journals (Sweden)
Bruno Chaihuaque Dueñas
2009-12-01
Full Text Available This article shows the relationship between market and firms through the theory of transactional cost and the relationsthat determine the structure and boundaries of the firm. Using the assumptions from the transactional cost approach,this article proposes some variables that determine optimal organizational structures and their boundaries.
31 CFR 357.28 - Transaction requests.
2010-07-01
... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Transaction requests. 357.28 Section 357.28 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL... System (Legacy Treasury Direct) § 357.28 Transaction requests. (a) General. Unless otherwise authorized...
31 CFR 597.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 597.406 Section 597.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... REGULATIONS Interpretations § 597.406 Offshore transactions. The prohibitions contained in § 597.201 apply to...
31 CFR 544.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 544.406 Section 544.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... SANCTIONS REGULATIONS Interpretations § 544.406 Offshore transactions. The prohibitions in § 544.201 on...
31 CFR 593.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 593.406 Section 593.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... SANCTIONS REGULATIONS Interpretations § 593.406 Offshore transactions. The prohibitions in § 593.201 on...
31 CFR 587.406 - Offshore transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Offshore transactions. 587.406 Section 587.406 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE... MONTENEGRO) MILOSEVIC SANCTIONS REGULATIONS Interpretations § 587.406 Offshore transactions. The prohibitions...
31 CFR 103.63 - Structured transactions.
2010-07-01
... Section 103.63 Money and Finance: Treasury Regulations Relating to Money and Finance FINANCIAL RECORDKEEPING AND REPORTING OF CURRENCY AND FOREIGN TRANSACTIONS General Provisions § 103.63 Structured transactions. No person shall for the purpose of evading the reporting requirements of § 103.22 with respect to...
Rethinking Ethiopian Secured Transactions Law through ...
African Journals Online (AJOL)
Asress Adimi Gikay
this article raises the issue of reform of Ethiopia's secured transactions ..... This article leaves out several issues that are significant for the effective functioning of secured transactions law because of space constraints. Issues such ... 68 John Armour (2008), The Law, and Economics Debate about Secured Lending: Lessons.
Modelling object typicality in description logics - [Workshop on Description Logics
CSIR Research Space (South Africa)
Britz, K
2009-07-01
Full Text Available The authors presents a semantic model of typicality of concept members in description logics that accords well with a binary, globalist cognitive model of class membership and typicality. The authors define a general preferential semantic framework...
Logic with a Probability Semantics
Hailperin, Theodore
2010-01-01
The present study is an extension of the topic introduced in Dr. Hailperin's Sentential Probability Logic, where the usual true-false semantics for logic is replaced with one based more on probability, and where values ranging from 0 to 1 are subject to probability axioms. Moreover, as the word "sentential" in the title of that work indicates, the language there under consideration was limited to sentences constructed from atomic (not inner logical components) sentences, by use of sentential connectives ("no," "and," "or," etc.) but not including quantifiers ("for all," "there is"). An initial
Nanoelectromechanical resonator for logic operations
Kazmi, Syed N. R.
2017-08-29
We report an electro-thermally tunable in-plane doubly-clamped nanoelectromechanical resonator capable of dynamically performing NOR, NOT, XNOR, XOR, and AND logic operations. Toward this, a silicon based resonator is fabricated using standard e-beam lithography and surface nanomachining of a highly conductive device layer of a silicon-on-insulator (SOI) wafer. The performance of this logic device is examined at elevated temperatures, ranging from 25 °C to 85 °C, demonstrating its resilience for most of the logic operations; thereby paving the way towards nano-elements-based mechanical computing.
Meta-Logical Reasoning in Higher-Order Logic
DEFF Research Database (Denmark)
Villadsen, Jørgen; Schlichtkrull, Anders; Hess, Andreas Viktor
The semantics of first-order logic (FOL) can be described in the meta-language of higher-order logic (HOL). Using HOL one can prove key properties of FOL such as soundness and completeness. Furthermore, one can prove sentences in FOL valid using the formalized FOL semantics. To aid in the constru...... in the construction of the proof an interactive proof assistant like Isabelle can be used. The proof assistant can even automate simple proofs using the formalized FOL semantics....
Reactions to Corporate Insider’s Transactions
DEFF Research Database (Denmark)
Rose, Caspar; Søpstad, Nicolai
2015-01-01
We test the impact on security prices of top manager’s requirement’s to disclose their own share transactions in the firm. Specifically we study whether buy or sales transactions convey relevant information for market participants thereby studying the effects of legal stock market disclosure rules....... Based on a comprehensive collection of stock market announcements from Danish CEOs and chairmen we find that insiders’ transactions influence share prices. However, it appears that there is a surprisingly difference, as buy transactions by chairmen have a much higher impact compared to CEO transactions......, which to our knowledge have not been noticed already by others. Thus, our event study shows that the Danish stock market seems to be efficient in the semi-strong from....
Micro-transactions for concurrent data structures
DEFF Research Database (Denmark)
Meawad, Fadi; Iyer, Karthik; Schoeberl, Martin
2013-01-01
implementation of transactional memory that we call micro-transactions. In particular, we argue that hardware support for micro-transactions allows us to efficiently implement certain data structures. Those data structures are difficult to realize with the atomic operations provided by stock hardware and provide......Transactional memory is a promising technique for enforcing disciplined access to shared data in a multiprocessor system. Transactional memory simplifies the implementation of a variety of concurrent data structures. In this paper, we study the benefits of a modest, real-time aware, hardware...... real-time guarantees for those operations. Our main implementation platform is the Java Optimized Processor system, a field-programmable gate array (FPGA) implementation of the Java virtual machine, optimized for real-time Java. We report on the performance of data structures implemented with locks...
Distributed Management of Concurrent Web Service Transactions
DEFF Research Database (Denmark)
Alrifai, Mohammad; Dolog, Peter; Balke, Wolf-Tilo
2009-01-01
in the open and dynamic environment of Web services, where interleaving business transactions enter and exit the system independently, remains an open issue. In this paper, we address this problem and propose an architecture that supports concurrency control on the Web services level. An extension......Business processes involve dynamic compositions of interleaved tasks. Therefore, ensuring reliable transactional processing of Web services is crucial for the success of Web service-based B2B and B2C applications. But the inherent autonomy and heterogeneity of Web services render the applicability...... of conventional ACID transaction models for Web services far from being straightforward. Current Web service transaction models relax the isolation property and rely on compensation mechanisms to ensure atomicity of business transactions in the presence of service failures. However, ensuring consistency...
Influence of transaction costs on controlling activity of territorial taxation bodies
Directory of Open Access Journals (Sweden)
Natalya A. Bondareva
2016-01-01
Full Text Available Objective to disclose and justify transaction costs of controlling activities of the territorial taxation bodies and their impact on tax control under the need for effective functioning and optimal decision making with a view of reducing the state expenditures on tax control. Methods general scientific synthesis deduction induction generalization testing interviewing observation forecasting scientific abstraction statistical analysis logic and methods of grouping and classification expert assessment. Results the analysis and grouping of transaction costs of controlling activities of the territorial taxation bodies have been carried out. It was found that the most time and resource consuming are onsite tax inspections. The factors that have a significant impact on the efficiency of tax control were revealed. It is proved that the release of material and time resources contributes to the transformation of the tax bodies. Scientific novelty the main problem of implementation of the onsite tax control is its costs. The existing studies do not give a systematic list of tax control costs of the territorial tax bodies in general and transaction costs of tax control in particular. The author shows that the reduction of transaction costs as factors of influence on the tax control will free up the working time of the inspectors and will bring economic benefits and also will allow to consolidate territorial tax bodies and change the status of a tax inspector. Practical significance reducing the cost of tax control is becoming increasingly important in terms of saving financial resources of the state.
Skelcher, Chris; Smith, Steven Rathgeb
2015-06-01
We propose a novel approach to theorizing hybridity in public and nonprofit organizations. The concept of hybridity is widely used to describe organizational responses to changes in governance, but the literature seldom explains how hybrids arise or what forms they take. Transaction cost and organizational design literatures offer some solutions, but lack a theory of agency. We use the institutional logics approach to theorize hybrids as entities that face a plurality of normative frames. Logics provide symbolic and material elements that structure organizational legitimacy and actor identities. Contradictions between institutional logics offer space for them to be elaborated and creatively reconstructed by situated agents. We propose five types of organizational hybridity - segmented, segregated, assimilated, blended, and blocked. Each type is theoretically derived from empirically observed variations in organizational responses to institutional plurality. We develop propositions to show how our approach to hybridity adds value to academic and policy-maker audiences.
Logical Theories for Agent Introspection
DEFF Research Database (Denmark)
Bolander, Thomas
2004-01-01
Artificial intelligence systems (agents) generally have models of the environments they inhabit which they use for representing facts, for reasoning about these facts and for planning actions. Much intelligent behaviour seems to involve an ability to model not only one's external environment...... introspective reasoning, the presence of self-reference causes the theory to be prone to inconsistency. The challenge therefore becomes to construct logical theories supporting introspective reasoning while at the same time ensuring that consistency is retained. In the thesis, we meet this challenge by devising...... by developments within semantics for logic programming within computational logic and formal theories of truth within philosophical logic. The thesis provides a number of examples showing how the developed theories can be used as reasoning frameworks for agents with introspective abilities. In Danish...
Preferential reasoning for modal logics
CSIR Research Space (South Africa)
Britz, K
2011-11-01
Full Text Available representation results for both preferential and rational consequence, which paves the way for effective decision procedures for modal preferential reasoning. They then illustrate applications of their constructions to modal logics widely used in AI, notably...
Dependence logic theory and applications
Kontinen, Juha; Väänänen, Jouko; Vollmer, Heribert
2016-01-01
In this volume, different aspects of logics for dependence and independence are discussed, including both the logical and computational aspects of dependence logic, and also applications in a number of areas, such as statistics, social choice theory, databases, and computer security. The contributing authors represent leading experts in this relatively new field, each of whom was invited to write a chapter based on talks given at seminars held at the Schloss Dagstuhl Leibniz Center for Informatics in Wadern, Germany (in February 2013 and June 2015) and an Academy Colloquium at the Royal Netherlands Academy of Arts and Sciences (March 2014). Altogether, these chapters provide the most up-to-date look at this developing and highly interdisciplinary field and will be of interest to a broad group of logicians, mathematicians, statisticians, philosophers, and scientists. Topics covered include a comprehensive survey of many propositional, modal, and first-order variants of dependence logic; new results concerning ...
Counting proofs in propositional logic
David, René; Zaionc, Marek
2009-01-01
International audience; We give a procedure for counting the number of different proofs of a formula in various sorts of propositional logic. This number is either an integer (that may be 0 if the formula is not provable) or infinite.
Observation Predicates in Flow Logic
DEFF Research Database (Denmark)
Nielson, Flemming; Nielson, Hanne Riis; Sun, Hongyan
2003-01-01
in such a way that the hard constraints are satisfi ed exactly when the observation predicates report no violations. The development is carried out in a large fragment of a first order logic with negation and also takes care of the transformations necessary in order to adhere to the stratification restrictions...... inherent in Alternation-free Least Fixed Point Logic and similar formalisms such as Datalog....
On Structural Completeness of Tabular Superintuitionistic Logics
Citkin, Alexander
2015-01-01
As usual, the superintuitionistic (propositional) logics (that is, logics extending intuitionistic logic) are being studied “modulo derivability”, meaning such logics are viewed extensionally — they are identified with the set of formulae that are valid (derivable in the corresponding calculus) in
Entrepreneurship, Transaction Costs, and Resource Attributes
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
transaction costs and property rights shape the process of entrepreneurial discovery. We provide a sketch of the mechanisms that link entrepreneurship, property rights, and transaction costs in a resource-based setting, contributing further to the attempt to take the RBV in a more dynamic direction.......This paper responds to Kim and Mahoney's "How Property Rights Economics Furthers the Resource-Based View: Resources, Transaction Costs and Entrepreneurial Discovery" (a comment on Foss and Foss, 2005). While we agree with many of their arguments, we argue that they fail to recognize how exactly...
Entrepreneurship, transaction costs, and resource attributes
DEFF Research Database (Denmark)
Foss, Kirsten; Foss, Nicolai Juul
2006-01-01
transaction costs shape the process of entrepreneurial discovery. We provide a sketch of the mechanisms that link entrepreneurship, property rights, and transaction costs in a resource-based setting, contributing further to the attempt to take the RBV in a more dynamic direction.......This paper responds to Kim and Mahoney's "How Property Rights Economics Furthers the Resource-Based View: Resources, Transaction Costs and Entrepreneurial Discovery" (a comment on Foss and Foss, 2005). While we agree with many of their arguments, we argue that they fail to recognise how exactly...
Security of M-Commerce transactions
Directory of Open Access Journals (Sweden)
Ion IVAN
2013-07-01
Full Text Available In this material electronic market are defined. How they are structured. Security in E-Commerce applications is very important both at the administrative level and from the user perspective. The new trend in the field is the M-commerce that involves making purchases through mobile devices. And for M-commerce transactions the security is a very important thing. Here's how to analyze the security of M-commerce transactions and ways to increase security for these transactions taking into account the organization of M-Commerce applications, software used, hardware used and other important issues in the development of these applications.
Accounting costs of transactions in real estate
DEFF Research Database (Denmark)
Stubkjær, Erik
2005-01-01
The costs of transactions in real estate is of importance for households, for investors, for statistical services, for governmental and international bodies concerned with the efficient delivery of basic state functions, as well as for research. The paper takes a multi-disciplinary approach...... in relating theoretical conceptualizations of transaction costs to national accounting and further to the identification and quantification of actions on units of real estate. The notion of satellite accounting of the System of National Accounts is applied to the segment of society concerned with changes...... in real estate. The paper ends up with an estimate of the cost of a major real property transaction in Denmark....
Proposal for the Formalization of Dialectical Logic
Directory of Open Access Journals (Sweden)
José Luis Usó-Doménech
2016-12-01
Full Text Available Classical logic is typically concerned with abstract analysis. The problem for a synthetic logic is to transcend and unify available data to reconstruct the object as a totality. Three rules are proposed to pass from classic logic to synthetic logic. We present the category logic of qualitative opposition using examples from various sciences. This logic has been defined to include the neuter as part of qualitative opposition. The application of these rules to qualitative opposition, and, in particular, its neuter, demonstrated that a synthetic logic allows the truth of some contradictions. This synthetic logic is dialectical with a multi-valued logic, which gives every proposition a truth value in the interval [0,1] that is the square of the modulus of a complex number. In this dialectical logic, contradictions of the neuter of an opposition may be true.
Some Practical Approaches to a Course on Paraconsistent Logic for Engineers
Lambert-Torres, Germano; de Moraes, Carlos Henrique Valerio; Coutinho, Maurilio Pereira; Martins, Helga Gonzaga; Borges da Silva, Luiz Eduardo
2017-01-01
This paper describes a non-classical logic course primarily indicated for graduate students in electrical engineering and energy engineering. The content of this course is based on the vision that it is not enough for a student to indefinitely accumulate knowledge; it is necessary to explore all the occasions to update, deepen, and enrich that…
21 CFR 1404.200 - What is a covered transaction?
2010-04-01
... 21 Food and Drugs 9 2010-04-01 2010-04-01 false What is a covered transaction? 1404.200 Section 1404.200 Food and Drugs OFFICE OF NATIONAL DRUG CONTROL POLICY GOVERNMENTWIDE DEBARMENT AND SUSPENSION (NONPROCUREMENT) Covered Transactions § 1404.200 What is a covered transaction? A covered transaction is a...
The Influence of an External Transaction on a BPEL Scope
Kopp, Oliver; Mietzner, Ralph; Leymann, Frank
Business processes constitute an integral part of today's IT applications. They contain transactions as essential building blocks to ensure integrity and all-or-nothing behavior. The Business Process Execution Language is the dominant standard for modeling and execution of business processes in a Web service environment. BPEL itself contains a transaction model based on compensation, that describes the (local) transactions in a business process. The WS-Coordination framework deals with (external) transactions between Web services and is used to define the transaction behavior between a BPEL process and its partners. In this paper, we investigate how external transactions between Web services interrelate with local transactions of BPEL.
A new hierarchy of infinitary logics in abstract algebraic logic
Czech Academy of Sciences Publication Activity Database
Lávička, Tomáš; Noguera, Carles
2017-01-01
Roč. 105, č. 3 (2017), s. 521-551 ISSN 0039-3215 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985556 ; RVO:67985807 Keywords : Abstract algebraic logic * consequence relations * infinitary logics * completeness properties Subject RIV: BA - General Mathematics; BA - General Mathematics (UIVT-O) OBOR OECD: Pure mathematics; Computer science s, information science , bioinformathics (hardware development to be 2.2, social aspect to be 5.8) (UIVT-O) Impact factor: 0.589, year: 2016 http://library.utia.cas.cz/separaty/2017/MTR/noguera-0469118.pdf
Directory of Open Access Journals (Sweden)
Iryna Khomenko
2018-04-01
Full Text Available The challenges of the global time require new solutions and up-to-date ways of thinking and communication. These challenges call for the ability to use critical thinking to face the ever-changing world and the ability to maintain a dialog based on the effective skills of communication. Studies in the fields of logic and argumentation theory are of particular importance in this regard. Nowadays they can be presented as a mix of theoretical and practical approaches. In this paper, I will present my reflections on informal logic, which was formed in the late 1970s. Unfortunately, in spite of numerous papers, books, and text-books published over the last forty years, consensus on many issues in this field has not been achieved so far. Therefore, it is difficult to treat informal logic as one of the well-defined approaches to argumentation. The goal of this paper is to take a look at the place of informal logic in state-of-the art study of argumentation by clarifying its subject matter and figuring out the realm to which informal logic belongs.
Fuzzy logic of Aristotelian forms
Energy Technology Data Exchange (ETDEWEB)
Perlovsky, L.I. [Nichols Research Corp., Lexington, MA (United States)
1996-12-31
Model-based approaches to pattern recognition and machine vision have been proposed to overcome the exorbitant training requirements of earlier computational paradigms. However, uncertainties in data were found to lead to a combinatorial explosion of the computational complexity. This issue is related here to the roles of a priori knowledge vs. adaptive learning. What is the a-priori knowledge representation that supports learning? I introduce Modeling Field Theory (MFT), a model-based neural network whose adaptive learning is based on a priori models. These models combine deterministic, fuzzy, and statistical aspects to account for a priori knowledge, its fuzzy nature, and data uncertainties. In the process of learning, a priori fuzzy concepts converge to crisp or probabilistic concepts. The MFT is a convergent dynamical system of only linear computational complexity. Fuzzy logic turns out to be essential for reducing the combinatorial complexity to linear one. I will discuss the relationship of the new computational paradigm to two theories due to Aristotle: theory of Forms and logic. While theory of Forms argued that the mind cannot be based on ready-made a priori concepts, Aristotelian logic operated with just such concepts. I discuss an interpretation of MFT suggesting that its fuzzy logic, combining a-priority and adaptivity, implements Aristotelian theory of Forms (theory of mind). Thus, 2300 years after Aristotle, a logic is developed suitable for his theory of mind.
Strategies and logics of internationalization
Directory of Open Access Journals (Sweden)
Mahjouba Ben Salem
2013-07-01
Full Text Available The race between firms to acquire capacities worldwide has evolved in a chronological order which centered at first around products, then around position to move later on to skills and to focus currently on networks. Similarly, when observing the evolution of the different international development strategies, it was found out that they have started by the exportation and the setting up of production subsidiaries to move more recently to such strategies as mergers & acquisitions and international alliances. The present paper investigates the relationship between the internationalization strategies and logics and comes to the conclusion that, a particular logic is behind every choice made. Indeed, the present work was conducted within the Tunisian food enterprises and helped confirm this hypothesis as it was found out that the position logic is behind the choice of exportation and the creation of production subsidiaries while the choice of partnership is based on the logic of skills. The option for merger, on the other hand, is motivated by the networks logic.
Extending Software Transactional Memory in Clojure with Side-Effects and Transaction Control
DEFF Research Database (Denmark)
Jensen, Søren Kejser; Thomsen, Lone Leth
2016-01-01
In conjunction with the increase of multi-core processors the use of functional programming languages has increased in recent years. The functional language Clojure has concurrency as a core feature, and provides Software Transactional Memory (STM) as a substitute for locks. Transactions in Clojure...... a transaction, and provide an alternative path of execution if a transaction is forced to restart. eClojure is the implementation of these constructs in Clojure 1.8, and it is tested using an additional set of unit tests. With a series of use cases we show that the addition of these constructs provides...
Glimpses of Learning Theory in Transactional Analysis.
Thompson, Henry O.
1982-01-01
Concepts drawn from Transactional Analysis concerning memory, association, and related components of learning theory are discussed. Ego States (Child, Parent, Adult) are described, along with the patterns and responses characteristic of each state. (PP)
Adjustment to Divorce Through Transactional Analysis
Morris, James D.; Prescott, Mary R.
1976-01-01
Transactional Analysis in a group facilitates adjustment to divorce. Two case histories highlight the value of TA in conceptualizing the problem areas of each individual and the changes during group therapy. (Author)
Developing Your Own Transactional Analysis Training Programme
Training Officer, 1976
1976-01-01
The New York Telephone Company recently improved its customer relations through the development of a transactional analysis training program for its employees. The program's four phases are described. (Author/BP)
Guarding against Collateral Damage during Chromatin Transactions
DEFF Research Database (Denmark)
Altmeyer, Matthias; Lukas, Jiri
2013-01-01
Signal amplifications are vital for chromatin function, yet they also bear the risk of transforming into unrestrained, self-escalating, and potentially harmful responses. Examples of inbuilt limitations are emerging, revealing how chromatin transactions are confined within physiological boundaries....
The transactional interpretation of quantum mechanics
Cramer, John G.
2001-06-01
The transactional interpretation of quantum mechanics [1] was originally published in 1986 and is now about 14 years old. It is an explicitly nonlocal and Lorentz invariant alternative to the Copenhagen interpretation. It interprets the formalism for a quantum interaction as describing a "handshake" between retarded waves (ψ) and advanced waves (ψ*) for each quantum event or "transaction" in which energy, momentum, angular momentum, and other conserved quantities are transferred. The transactional interpretation offers the advantages that (1) it is actually "visible" in the formalism of quantum mechanics, (2) it is economical, involving fewer independent assumptions than its rivals, (3) it is paradox-free, resolving all of the paradoxes of standard quantum theory including nonlocality and wave function collapse, (4) it does not give a privileged role to observers or measurements, and (5) it permits the visualization of quantum events. We will review the transactional interpretation and some of its applications to "quantum paradoxes."
25 CFR 141.41 - Refinancing transaction.
2010-04-01
... keeping requirements of this part and requires the issuance of a new ticket or receipt. (c) The rate of... as extended. (e) The default and sale procedures of this part apply to a refinanced pawn transaction...
Disclosure requirements for merger and acquisition transactions
International Nuclear Information System (INIS)
Holm, D.I.
1998-01-01
The legal disclosure requirements for merger and acquisition transactions involving Canadian public companies are described. The focus is on issues regarding merger and acquisition related disclosure, including the potential consequences of failing to provide proper information, Ontario Securities Commission Policy 9.1 considerations regarding valuation, review, and approval, cross border considerations and financing a merger and acquisition transaction. Legal and practical consequences for failing to provide proper disclosure, including the steps involved in establishing the due diligence defence, are also discussed
Impossible Worlds and Logical Omniscience
DEFF Research Database (Denmark)
Bjerring, Jens Christian Krarup
2013-01-01
”. But I prove that it is impossible to develop an impossible-world framework that can do this job and that satisfies certain standard conditions. Effectively, I show that attempts to model moderately ideal agents in a world-involving framework collapse to modeling either logical omniscient agents......In this paper, I investigate whether we can use a world-involving framework to model the epistemic states of non-ideal agents. The standard possible-world framework falters in this respect because of a commitment to logical omniscience. A familiar attempt to overcome this problem centers around...... falsehoods, they are nevertheless able to rule out blatantly impossible worlds that verify obvious logical falsehoods. To model moderately ideal agents, I argue, the job is to construct a modal space that contains only possible and non-trivially impossible worlds where it is not the case that “anything goes...
Fuzzy Logic Reliability Centered Maintenance
Directory of Open Access Journals (Sweden)
Felecia .
2014-01-01
Full Text Available Reliability Centered Maintenence (RCM is a systematic maintenence strategy based on system reliability. Application of RCM process will not always come out with a binary output of “yes” and “no”. Most of the time they are not supported with available detail information to calculate system reliability. The fuzzy logic method attempts to eliminate the uncertainty by providing “truth” in different degrees.Data and responses from maintenance department will be processed using the two methods (reliability centered maintenance and fuzzy logic to design maintenance strategy for the company. The results of the fuzzy logic RCM application are maintenance strategy which fit with current and future condition.
The Pointer Assertion Logic Engine
DEFF Research Database (Denmark)
Møller, Anders; Schwartzbach, Michael Ignatieff
2001-01-01
in the logical tradition by encoding the programs and partial specifications as formulas in monadic second-order logic. Validity of these formulas is checked by the MONA tool, which also can provide explicit counterexamples to invalid formulas. To make verification decidable, the technique requires explicit loop...... restricted to simple special cases such as lists or trees. Even so, our current implementation is as fast as the previous specialized tools. Programs are annotated with partial specifications expressed in Pointer Assertion Logic, a new notation for expressing properties of the program store. We work......We present a new framework for verifying partial specifications of programs in order to catch type and memory errors and check data structure invariants. Our technique can verify a large class of data structures, namely all those that can be expressed as graph types. Earlier versions were...
Fuzzy logic particle tracking velocimetry
Wernet, Mark P.
1993-01-01
Fuzzy logic has proven to be a simple and robust method for process control. Instead of requiring a complex model of the system, a user defined rule base is used to control the process. In this paper the principles of fuzzy logic control are applied to Particle Tracking Velocimetry (PTV). Two frames of digitally recorded, single exposure particle imagery are used as input. The fuzzy processor uses the local particle displacement information to determine the correct particle tracks. Fuzzy PTV is an improvement over traditional PTV techniques which typically require a sequence (greater than 2) of image frames for accurately tracking particles. The fuzzy processor executes in software on a PC without the use of specialized array or fuzzy logic processors. A pair of sample input images with roughly 300 particle images each, results in more than 200 velocity vectors in under 8 seconds of processing time.
Sequential logic analysis and synthesis
Cavanagh, Joseph
2007-01-01
Until now, there was no single resource for actual digital system design. Using both basic and advanced concepts, Sequential Logic: Analysis and Synthesis offers a thorough exposition of the analysis and synthesis of both synchronous and asynchronous sequential machines. With 25 years of experience in designing computing equipment, the author stresses the practical design of state machines. He clearly delineates each step of the structured and rigorous design principles that can be applied to practical applications. The book begins by reviewing the analysis of combinatorial logic and Boolean a
The logical foundations of mathematics
Hatcher, William S
1981-01-01
The Logical Foundations of Mathematics offers a study of the foundations of mathematics, stressing comparisons between and critical analyses of the major non-constructive foundational systems. The position of constructivism within the spectrum of foundational philosophies is discussed, along with the exact relationship between topos theory and set theory.Comprised of eight chapters, this book begins with an introduction to first-order logic. In particular, two complete systems of axioms and rules for the first-order predicate calculus are given, one for efficiency in proving metatheorems, and
An exercise in 'anhomomorphic logic'
International Nuclear Information System (INIS)
Sorkin, Rafael D
2007-01-01
A classical logic exhibits a threefold inner structure comprising an algebra of propositions U, a space of 'truth values' V, and a distinguished family of mappings φ from propositions to truth values. Classically U is a Boolean algebra, V = Z 2 , and the admissible maps φ: U Z 2 are homomorphisms. If one admits a larger set of maps, one obtains an anhomomorphic logic that seems better suited to quantal reality (and the needs of quantum gravity). I explain these ideas and illustrate them with three simple examples
Logical space and the origins of pluralism in logic
Czech Academy of Sciences Publication Activity Database
Arazim, Pavel
-, č. 2 (2017), s. 7-26 ISSN 0567-8293 R&D Projects: GA ČR(CZ) GA17-15645S Institutional support: RVO:67985955 Keywords : pluralism * expressivism * logical space * geometry * holism Subject RIV: AA - Philosophy ; Religion OBOR OECD: Philosophy, History and Philosophy of science and technology
Petri Nets as Models of Linear Logic
DEFF Research Database (Denmark)
Engberg, Uffe Henrik; Winskel, Glynn
1990-01-01
The chief purpose of this paper is to appraise the feasibility of Girad's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear logic in Petri nets, with respect to which we investigate the expressive power of the logic......The chief purpose of this paper is to appraise the feasibility of Girad's linear logic as a specification language for parallel processes. To this end we propose an interpretation of linear logic in Petri nets, with respect to which we investigate the expressive power of the logic...
Implicational (semilinear) logics III: completeness properties
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Noguera, Carles
2018-01-01
Roč. 57, 3-4 (2018), s. 391-420 ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * protoalgebraic logics * implicational logics * disjunctional logics * semilinear logics * non-classical logics * completeness theorems * rational completeness Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) OBOR OECD: Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.394, year: 2016
Microelectromechanical resonator based digital logic elements
Hafiz, Md Abdullah Al
2016-10-20
Micro/nano-electromechanical resonator based mechanical computing has recently attracted significant attention. However, its full realization has been hindered by the difficulty in realizing complex combinational logics, in which the logic function is constructed by cascading multiple smaller logic blocks. In this work we report an alternative approach for implementation of digital logic core elements, multiplexer and demultiplexer, which can be used to realize combinational logic circuits by suitable concatenation. Toward this, shallow arch shaped microresonators are electrically connected and their resonance frequencies are tuned based on an electrothermal frequency modulation scheme. This study demonstrates that by reconfiguring the same basic building block, the arch microresonator, complex logic circuits can be realized.
Implicational (semilinear) logics III: completeness properties
Czech Academy of Sciences Publication Activity Database
Cintula, Petr; Noguera, Carles
2018-01-01
Roč. 57, 3-4 (2018), s. 391-420 ISSN 0933-5846 R&D Projects: GA ČR GA13-14654S EU Projects: European Commission(XE) 689176 - SYSMICS Institutional support: RVO:67985807 ; RVO:67985556 Keywords : abstract algebraic logic * protoalgebraic logics * implicational logics * disjunctional logics * semilinear logics * non-classical logics * completeness theorems * rational completeness Subject RIV: BA - General Mathematics; BA - General Mathematics (UTIA-B) OBOR OECD: Computer science s, information science , bioinformathics (hardware development to be 2.2, social aspect to be 5.8) Impact factor: 0.394, year: 2016
Anderson, S.W.; Dekker, H.C.
2005-01-01
Using an unusually comprehensive database on 858 transactions for information technology products and accompanying services, we study how close partners who are exposed to opportunistic hazards structure and control a significant transaction. We analyze data on the terms of contracting to determine
Diviak, Tomas; Mazák, Jaromír
2017-01-01
In 2007, Petrova and Tarrow coined the term transactional activism, arguing that, despite weak individual-level political participation, civil societies in Central and Eastern Europe were surprisingly strong due to their capacity to establish transactional links. Yet the research which followed,
22 CFR 208.215 - Which nonprocurement transactions are not covered transactions?
2010-04-01
... 22 Foreign Relations 1 2010-04-01 2010-04-01 false Which nonprocurement transactions are not covered transactions? 208.215 Section 208.215 Foreign Relations AGENCY FOR INTERNATIONAL DEVELOPMENT... to regulate public health, safety, or the environment, unless the U.S. Agency for International...
Contextual Validity in Hybrid Logic
DEFF Research Database (Denmark)
Blackburn, Patrick Rowan; Jørgensen, Klaus Frovin
2013-01-01
of Hans Kamp and David Kaplan. We introduce a simple proof rule, which we call the Kamp Rule, and first we show that it is all we need to take us from logical validities involving now to contextual validities involving now too. We then go on to show that this deductive bridge is strong enough to carry us...
Testing Superconductor Logic Integrated Circuits
Arun, A.J.; Kerkhoff, Hans G.
2005-01-01
Superconductor logic has the potential of extremely low-power consumption and ultra-fast digital signal processing. Unfortunately, the obtained yield of the present processes is low and specific faults occur. This paper deals with fault-modelling, Design-for-Test structures, and ATPG for these
Complexity Issues in Basic Logic
Czech Academy of Sciences Publication Activity Database
Aguzzoli, S.; Gerla, B.; Haniková, Zuzana
2005-01-01
Roč. 9, - (2005), s. 919-934 ISSN 1432-7643 R&D Projects: GA MŠk LN00A056 Institutional research plan: CEZ:AV0Z10300504 Keywords : basic fuzzy logic (BL) * computational complexity * functional representation Subject RIV: BA - General Mathematics Impact factor: 0.538, year: 2005
Phonotactics in inductive logic programming
Nerbonne, J.; Konstantopoulos, S.; Klopotek, M.A.; Wierzchon, S.T.; Trojanowski, K.
2004-01-01
We examine the results of applying inductive logic programming (ILP) to a relatively simple linguistic task, that of recognizing monosyllables in one language. ILP is suited to linguistic problems given linguists' preference for formulating their theories in discrete rules, and because of ILP's
Using Logical Problems in ESP.
Dorrity, Terry
1983-01-01
A course in scientific English for science researchers and advanced civil engineering students in Belgium has a central problem--the heterogeneous nature of the group and lack of common research experience around which to build a curriculum. An attempt to overcome this difficulty by using two logical problems for discussion is presented. (MSE)
Flow Logic for Process Calculi
DEFF Research Database (Denmark)
Nielson, Hanne Riis; Nielson, Flemming; Pilegaard, Henrik
2012-01-01
developed for programming languages, this article provides a tutorial development of the approach of Flow Logic for process calculi based on a decade of research. We first develop a simple analysis for the π-calculus; this consists of the specification, semantic soundness (in the form of subject reduction...
Towards Logical Designs In Biology
Indian Academy of Sciences (India)
Administrator
This article highlights an emerging field known as syn- thetic biology that envisions integrating designed circuits into living organisms in order to instruct them to make logical decisions based on the prevailing intracellular and extracellular conditions and produce a reliable behavior. The attempt is to design cells capable of ...
Generic physical protection logic trees
Energy Technology Data Exchange (ETDEWEB)
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle.
Probabilistic Logic and Probabilistic Networks
Haenni, R.; Romeijn, J.-W.; Wheeler, G.; Williamson, J.
2009-01-01
While in principle probabilistic logics might be applied to solve a range of problems, in practice they are rarely applied at present. This is perhaps because they seem disparate, complicated, and computationally intractable. However, we shall argue in this programmatic paper that several approaches
Logics of communication and change
van Benthem, Johan; van Eijck, Jan; Kooi, Barteld
2006-01-01
Current dynamic epistemic logics for analyzing effects of informational events often become cumbersome and opaque when common knowledge is added for groups of agents. Still, postconditions involving common knowledge are essential to successful multi-agent communication. We propose new systems that
Boggle Logic Puzzles: Minimal Solutions
Needleman, Jonathan
2013-01-01
Boggle logic puzzles are based on the popular word game Boggle played backwards. Given a list of words, the problem is to recreate the board. We explore these puzzles on a 3 x 3 board and find the minimum number of three-letter words needed to create a puzzle with a unique solution. We conclude with a series of open questions.
Mathematical Induction: Deductive Logic Perspective
Dogan, Hamide
2016-01-01
Many studies mentioned the deductive nature of Mathematical Induction (MI) proofs but almost all fell short in explaining its potential role in the formation of the misconceptions reported in the literature. This paper is the first of its kind looking at the misconceptions from the perspective of the abstract of the deductive logic from one's…
Generic physical protection logic trees
International Nuclear Information System (INIS)
Paulus, W.K.
1981-10-01
Generic physical protection logic trees, designed for application to nuclear facilities and materials, are presented together with a method of qualitative evaluation of the trees for design and analysis of physical protection systems. One or more defense zones are defined where adversaries interact with the physical protection system. Logic trees that are needed to describe the possible scenarios within a defense zone are selected. Elements of a postulated or existing physical protection system are tagged to the primary events of the logic tree. The likelihood of adversary success in overcoming these elements is evaluated on a binary, yes/no basis. The effect of these evaluations is propagated through the logic of each tree to determine whether the adversary is likely to accomplish the end event of the tree. The physical protection system must be highly likely to overcome the adversary before he accomplishes his objective. The evaluation must be conducted for all significant states of the site. Deficiencies uncovered become inputs to redesign and further analysis, closing the loop on the design/analysis cycle
Contexts in Dynamic Predicate Logic
Visser, A.
1995-01-01
In this paper we introduce a notion of context for Groenendijk & Stokhof's Dynamic Predicate Logic DPL. We use these contexts to give a characterization of the relations on assignments that can be generated by composition from tests/conditions and random resettings in the case that we are working
Logical Empiricism, Politics, and Professionalism
Edgar, Scott
2009-01-01
This paper considers George A. Reisch's account of the role of Cold War political forces in shaping the apolitical stance that came to dominate philosophy of science in the late 1940s and 1950s. It argues that at least as early as the 1930s, Logical Empiricists such as Rudolf Carnap already held that philosophy of science could not properly have…
Classical Syllogisms in Logic Teaching
DEFF Research Database (Denmark)
Øhrstrøm, Peter; Sandborg-Petersen, Ulrik; Thorvaldsen, Steinar
2013-01-01
This paper focuses on the challenges of introducing classical syllogisms in university courses in elementary logic and human reasoning. Using a program written in Prolog+CG, some empirical studies have been carried out involving three groups of students in Denmark; one group of philosophy student...
Coreflections in Algebraic Quantum Logic
Jacobs, Bart; Mandemaker, Jorik
2012-07-01
Various generalizations of Boolean algebras are being studied in algebraic quantum logic, including orthomodular lattices, orthomodular po-sets, orthoalgebras and effect algebras. This paper contains a systematic study of the structure in and between categories of such algebras. It does so via a combination of totalization (of partially defined operations) and transfer of structure via coreflections.
Linguistics, Logic, and Finite Trees
Blackburn, P.; Meyer-Viol, W.
1993-01-01
A modal logic is developed to deal with finite ordered binary trees as they are used in (computational) linguistics. A modal language is introduced with operators for the 'mother of', 'first daughter of' and 'second daughter of' relations together with their transitive reflexive closures.
An overview of Interpretability Logic
Visser, A.
A miracle happens. In one hand we have a class of marvelously complex theories in predicate logic, theories with 'sufficient coding potential', like PA (Peano Arithmetic) or ZF (Zermelo Fraenkel Set Theory). In the other we have certain modal propositional theories of striking simplicity. We
Morpho (?) phono (?) logical fuzzy edges
African Journals Online (AJOL)
Open Access DOWNLOAD FULL TEXT Subscription or Fee Access. Morpho (?) phono (?) logical fuzzy edges: The case of {-/}/{-/U/} semantic (?) contrast in Shona. K. G. Mkangwanwi. Abstract. (ZAMBEZIA: Journal of Humanities of the Univ of Zimbabwe, 2000 27(1): 47-54). Full Text: EMAIL FULL TEXT EMAIL FULL TEXT
Program Theory Evaluation: Logic Analysis
Brousselle, Astrid; Champagne, Francois
2011-01-01
Program theory evaluation, which has grown in use over the past 10 years, assesses whether a program is designed in such a way that it can achieve its intended outcomes. This article describes a particular type of program theory evaluation--logic analysis--that allows us to test the plausibility of a program's theory using scientific knowledge.…
Symmetric normalisation for intuitionistic logic
DEFF Research Database (Denmark)
Guenot, Nicolas; Straßburger, Lutz
2014-01-01
We present two proof systems for implication-only intuitionistic logic in the calculus of structures. The first is a direct adaptation of the standard sequent calculus to the deep inference setting, and we describe a procedure for cut elimination, similar to the one from the sequent calculus...
Completeness for Coalgebraic Fixpoint Logic
Enqvist, S.; Seifan, F.; Venema, Y.
2016-01-01
We introduce an axiomatization for the coalgebraic fixed point logic which was introduced by Venema as a generalization, based on Moss' coalgebraic modality, of the well-known modal mu-calculus. Our axiomatization can be seen as a generalization of Kozen's proof system for the modal mu-calculus to
Indian Academy of Sciences (India)
Home; Journals; Resonance – Journal of Science Education; Volume 10; Issue 11. The Logic of Animal Conflict. Raghavendra Gadagkar. Article-in-a-Box Volume 10 Issue 11 November 2005 pp 5-5. Fulltext. Click here to view fulltext PDF. Permanent link: http://www.ias.ac.in/article/fulltext/reso/010/11/0005-0005 ...
Learning fuzzy logic control system
Lung, Leung Kam
1994-01-01
The performance of the Learning Fuzzy Logic Control System (LFLCS), developed in this thesis, has been evaluated. The Learning Fuzzy Logic Controller (LFLC) learns to control the motor by learning the set of teaching values that are generated by a classical PI controller. It is assumed that the classical PI controller is tuned to minimize the error of a position control system of the D.C. motor. The Learning Fuzzy Logic Controller developed in this thesis is a multi-input single-output network. Training of the Learning Fuzzy Logic Controller is implemented off-line. Upon completion of the training process (using Supervised Learning, and Unsupervised Learning), the LFLC replaces the classical PI controller. In this thesis, a closed loop position control system of a D.C. motor using the LFLC is implemented. The primary focus is on the learning capabilities of the Learning Fuzzy Logic Controller. The learning includes symbolic representation of the Input Linguistic Nodes set and Output Linguistic Notes set. In addition, we investigate the knowledge-based representation for the network. As part of the design process, we implement a digital computer simulation of the LFLCS. The computer simulation program is written in 'C' computer language, and it is implemented in DOS platform. The LFLCS, designed in this thesis, has been developed on a IBM compatible 486-DX2 66 computer. First, the performance of the Learning Fuzzy Logic Controller is evaluated by comparing the angular shaft position of the D.C. motor controlled by a conventional PI controller and that controlled by the LFLC. Second, the symbolic representation of the LFLC and the knowledge-based representation for the network are investigated by observing the parameters of the Fuzzy Logic membership functions and the links at each layer of the LFLC. While there are some limitations of application with this approach, the result of the simulation shows that the LFLC is able to control the angular shaft position of the
FUZZY LOGIC IN LEGAL EDUCATION
Directory of Open Access Journals (Sweden)
Z. Gonul BALKIR
2011-04-01
Full Text Available The necessity of examination of every case within its peculiar conditions in social sciences requires different approaches complying with the spirit and nature of social sciences. Multiple realities require different and various perceptual interpretations. In modern world and social sciences, interpretation of perception of valued and multi-valued have been started to be understood by the principles of fuzziness and fuzzy logic. Having the verbally expressible degrees of truthness such as true, very true, rather true, etc. fuzzy logic provides the opportunity for the interpretation of especially complex and rather vague set of information by flexibility or equivalence of the variables’ of fuzzy limitations. The methods and principles of fuzzy logic can be benefited in examination of the methodological problems of law, especially in the applications of filling the legal loopholes arising from the ambiguities and interpretation problems in order to understand the legal rules in a more comprehensible and applicable way and the efficiency of legal implications. On the other hand, fuzzy logic can be used as a technical legal method in legal education and especially in legal case studies and legal practice applications in order to provide the perception of law as a value and the more comprehensive and more quality perception and interpretation of value of justice, which is the core value of law. In the perception of what happened as it has happened in legal relationships and formations, the understanding of social reality and sociological legal rules with multi valued sense perspective and the their applications in accordance with the fuzzy logic’s methods could create more equivalent and just results. It can be useful for the young lawyers and law students as a facilitating legal method especially in the materialization of the perception and interpretation of multi valued and variables. Using methods and principles of fuzzy logic in legal
Mathematical logic foundations for information science
Li, Wei
2010-01-01
This book presents the basic principles and formal calculus of mathematical logic. It covers core contents, extensions and developments of classical mathematical logic, and it offers formal proofs and concrete examples for all theoretical results.
Logic functions and equations examples and exercises
Steinbach, Bernd
2009-01-01
With a free, downloadable software package available to help solve the exercises, this book focuses on practical and relevant problems that arise in the field of binary logics, with its two main applications - digital circuit design, and propositional logics.
Set-Theory and Logic in School
Kapadia, Ramesh
1976-01-01
The author argues that the emphasis on logic and set theory in the school mathematics program is unnecessary and possibly harmful. He discusses briefly the relationships between semantics and logic. (SD)
Process algebra with four-valued logic
Bergstra, J.A.; Ponse, A.
2000-01-01
We propose a combination of a fragment of four-valued logic and process algebra. We present an operational semantics in SOS-style, and a completeness result for ACP with conditionals and four-valued logic.
Eco-logical successes : January 2011
2011-01-01
This document identifies and explains each Eco-Logical signatory agency's strategic environmental programs, projects, and efforts that are either directly related to or share the vision set forth in Eco-Logical. A brief description of an agency's key...
Preface. Philosophy and History of Talmudic Logic
Directory of Open Access Journals (Sweden)
Schumann Andrew
2017-06-01
Full Text Available This volume contains the papers presented at the Philosophy and History of Talmudic Logic Affiliated Workshop of Krakow Conference on History of Logic (KHL2016, held on October 27, 2016, in Krakow, Poland.
ACCOUNTING TREATMENTS SPECIFIC TO COUNTERPART COMMERCIAL TRANSACTIONS
Directory of Open Access Journals (Sweden)
Lucia PALIU - POPA
2010-12-01
Full Text Available Given the lack of availability of funds in foreign currency, felt in many countries, especially in the developing and developed countries and the economic or financial crisis in the global foreign exchange, counterpart commercial transactions were imposed as a “disarming” condition of the international trade. In the counterpart a purchase transaction is combined with a sale transaction, an import with an export in order to ensure balanced trade between the partners, trade that involves eliminating or reducing the currency as a payment source and its replacement with trade of goods and services. Thus, in the context of an acute need to export of greatly industrialized countries, where the overproduction phenomenon tends to have a chronic character, the counterpart has become a highly complex and sustainable phenomenon, which has seen a steady increase in the volume of amounts, with a geographical area and large variety of forms and mechanisms of implementation. Based on the characteristics and structure of counterpart transactions, we shall describe in this paper the accounting models specific to international trade, as part of the combined foreign trade transactions without neglecting the tax treatments that influence the entry in the accounts
Czech Academy of Sciences Publication Activity Database
Horčík, Rostislav; Noguera, C.; Petrík, M.
2007-01-01
Roč. 53, č. 3 (2007), s. 268-288 ISSN 0942-5616 R&D Projects: GA AV ČR 1ET100300517 Institutional research plan: CEZ:AV0Z10300504 Keywords : algebraic logic * fuzzy logics * generalized contraction * generalized excluded middle * left-continuous t-norms * MTL-algebras * non-classical logics * residuated lattices * standard completeness * substructural logics * varieties * weak cancellation Subject RIV: BA - General Mathematics Impact factor: 0.317, year: 2007
Logic without energy or bandwidth limits
Caulfield, Henry J.; Westphal, Jonathan
2003-07-01
Boolean logic is an inherently irreversible, hence lossy operation. It has a well-known energy cost and an obvious time cost. To avoid those costs, we must do a different kind of logic. But, it is Boolean logic that we wish to do. We solved that dilemma by using a quantum optical logic gate that is fully reversible that yields the Boolean result after the irreversible loss of information in detection occurs.
FOLE: The First-order Logical Environment
Kent, Robert E.
2013-01-01
This paper describes the first-order logical environment FOLE. Institutions in general, and logical environments in particular, give equivalent heterogeneous and homogeneous representations for logical systems. As such, they offer a rigorous and principled approach to distributed interoperable information systems via system consequence. Since FOLE is a particular logical environment, this provides a rigorous and principled approach to distributed interoperable first-order information systems....
APPLICATION OF FUZZY LOGIC TOOLBOX FOR MODELLING FUZZY LOGIC CONTROLLERS
Olesiak, Krzysztof
2017-01-01
Computer technology, which has been developing very fast in the recent years, can be also fruitfully applied in teaching. For example, the software package Matlab is highly useful in teaching students at Bachelor Programs of Electrical Engineering and Automatics and Robotics. Fuzzy Logic Toolbox of the Matlab package can be used for designing and modelling controllers. Thanks to a large number of pre-defined elements available in the libraries, it is possible to create even highly complicated...
BIO Logical Agents: Norms, Beliefs, Intentions in Defeasible Logic
Governatori, Guido; Rotolo, Antonino
2007-01-01
In this paper we follow the BOID (Belief, Obligation, Intention, Desire) architecture to describe agents and agent types in Defeasible Logic. We argue, in particular, that the introduction of obligations can provide a new reading of the concepts of intention and intentionality. Then we examine the notion of social agent (i.e., an agent where obligations prevail over intentions) and discuss some computational and philosophical issues related to it. We show th...
Energy Flexometer: Transactive Energy-Based Internet of Things Technology
Directory of Open Access Journals (Sweden)
Muhammad Babar
2018-03-01
Full Text Available Effective Energy Management with an active Demand Response (DR is crucial for future smart energy system. Increasing number of Distributed Energy Resources (DER, local microgrids and prosumers have an essential and real influence on present power distribution system and generate new challenges in power, energy and demand management. A relatively new paradigm in this field is transactive energy (TE, with its value and market-based economic and technical mechanisms to control energy flows. Due to a distributed structure of present and future power system, the Internet of Things (IoT environment is needed to fully explore flexibility potential from the end-users and prosumers, to offer a bid to involved actors of the smart energy system. In this paper, new approach to connect the market-driven (bottom-up DR program with current demand-driven (top-down energy management system (EMS is presented. Authors consider multi-agent system (MAS to realize the approach and introduce a concept and standardize the design of new Energy Flexometer. It is proposed as a fundamental agent in the method. Three different functional blocks have been designed and presented as an IoT platform logical interface according to the LonWorks technology. An evaluation study has been performed as well. Results presented in the paper prove the proposed concept and design.
Weak Completeness of Coalgebraic Dynamic Logics
Kupke, C.; Hansen, H.H.
2015-01-01
We present a coalgebraic generalisation of Fischer and Ladner’s Propositional Dynamic Logic (PDL) and Parikh’s Game Logic (GL). In earlier work, we proved a generic strong completeness result for coalgebraic dynamic logics without iteration. The coalgebraic semantics of such programs is given by a
Translating Dominant Institutional Logics in Practice
DEFF Research Database (Denmark)
Agger Nielsen, Jeppe; Jensen, Tina Blegind
In this paper we examine the proliferation of a new mobile technology in a structured setting of home care in Denmark, focusing on how actions at multiple levels interact to enable technology diffusion and institutionalization. The case study shows how a dominating field level logic...... that combining an institutional logic perspective with a translation perspective furthers our understanding of the malleability of institutional logics....
An Adequate First Order Logic of Intervals
DEFF Research Database (Denmark)
Chaochen, Zhou; Hansen, Michael Reichhardt
1998-01-01
This paper introduces left and right neighbourhoods as primitive interval modalities to define other unary and binary modalities of intervals in a first order logic with interval length. A complete first order logic for the neighbourhood modalities is presented. It is demonstrated how the logic can...... support formal specification and verification of liveness and fairness, and also of various notions of real analysis....
Towards a formal logic of design rationalization
DEFF Research Database (Denmark)
Galle, Per
1997-01-01
Certain extensions to standard predicate logic are proposed and used as a framework for critical logical study of patterns of inference in design reasoning. It is shown that within this framework a modal logic of design rationalization (suggested by an empirical study reported earlier) can be for...
Dialogues as a dynamic framework for logic
Rückert, Helge
2007-01-01
Dialogical logic is a game-theoretical approach to logic. Logic is studied with the help of certain games, which can be thought of as idealized argumentations. Two players, the Proponent, who puts forward the initial thesis and tries to defend it, and the Opponent, who tries to attack the
Mathematical Fuzzy Logic - State of Art 2001
Czech Academy of Sciences Publication Activity Database
Hájek, Petr
2003-01-01
Roč. 24, - (2003), s. 71-89 ISSN 0103-9059. [WOLLIC'2001. Brasília, 31.07.2001-03.08.2001] R&D Projects: GA MŠk LN00A056 Keywords : fuzzy logic * many valued logic * basic fuzzy logic BL Subject RIV: BA - General Mathematics http://www.mat.unb.br/~matcont/24_4.pdf
Piaget's Logic of Meanings: Still Relevant Today
Wavering, Michael James
2011-01-01
In his last book, "Toward a Logic of Meanings" (Piaget & Garcia, 1991), Jean Piaget describes how thought can be categorized into a form of propositional logic, a logic of meanings. The intent of this article is to offer this analysis by Piaget as a means to understand the language and teaching of science. Using binary propositions, conjunctions,…
On Product Logic with Truth-Constants
Czech Academy of Sciences Publication Activity Database
Savický, Petr; Cignoli, R.; Esteva, F.; Godo, L.; Noguera, C.
2006-01-01
Roč. 16, č. 2 (2006), s. 205-225 ISSN 0955-792X R&D Projects: GA MŠk 1M0545 Keywords : non-classical logic * fuzzy logic * product logic * truth-constants * standard completeness Subject RIV: BA - General Mathematics Impact factor: 0.840, year: 2006
Parity Games and Automata for Game Logic
Hansen, H.H.; Kupke, C.; Marti, J.; Venema, Y.; Madeira, A.; Benevides, M.
2018-01-01
Parikh’s game logic is a PDL-like fixpoint logic interpreted on monotone neighbourhood frames that represent the strategic power of players in determined two-player games. Game logic translates into a fragment of the monotone μ-calculus, which in turn is expressively equivalent to monotone modal
The dynamic turn in quantum logic
Baltag, Alexandru; Smets, Sonja
In this paper we show how ideas coming from two areas of research in logic can reinforce each other. The first such line of inquiry concerns the "dynamic turn" in logic and especially the formalisms inspired by Propositional Dynamic Logic (PDL); while the second line concerns research into the
Hybrid Logical Analyses of the Ambient Calculus
DEFF Research Database (Denmark)
Bolander, Thomas; Hansen, Rene Rydhof
2010-01-01
In this paper, hybrid logic is used to formulate three control flow analyses for Mobile Ambients, a process calculus designed for modelling mobility. We show that hybrid logic is very well-suited to express the semantic structure of the ambient calculus and how features of hybrid logic can...
Intuitionistic Rules : Admissible Rules of Intermediate Logics
Goudsmit, J.P.
2015-01-01
In this thesis, we investigate the admissible rules of intermediate logics. On the one hand, one can characterize the admissibility of rules in certain logic, and on the other hand, one can characterize logics through their admissible rules. We take both approaches, and reach new results in both
Logics of Business Education for Sustainability
Andersson, Pernilla; Öhman, Johan
2016-01-01
This paper explores various kinds of logics of "business education for sustainability" and how these "logics" position the subject business person, based on eight teachers' reasoning of their own practices. The concept of logics developed within a discourse theoretical framework is employed to analyse the teachers' reasoning.…
Optimizing Concurrent M3-Transactions: A Fuzzy Constraint Satisfaction Approach
Directory of Open Access Journals (Sweden)
Peng LI
2004-10-01
Full Text Available Due to the high connectivity and great convenience, many E-commerce application systems have a high transaction volume. Consequently, the system state changes rapidly and it is likely that customers issue transactions based on out-of-date state information. Thus, the potential of transaction abortion increases greatly. To address this problem, we proposed an M3-transaction model. An M3-transaction is a generalized transaction where users can issue their preferences in a request by specifying multiple criteria and optional data resources simultaneously within one transaction. In this paper, we introduce the transaction grouping and group evaluation techniques. We consider evaluating a group of M3-transactions arrived to the system within a short duration together. The system makes optimal decisions in allocating data to transactions to achieve better customer satisfaction and lower transaction failure rate. We apply the fuzzy constraint satisfaction approach for decision-making. We also conduct experimental studies to evaluate the performance of our approach. The results show that the M3-transaction with group evaluation is more resilient to failure and yields much better performance than the traditional transaction model.
Applications of Logic Coverage Criteria and Logic Mutation to Software Testing
Kaminski, Garrett K.
2011-01-01
Logic is an important component of software. Thus, software logic testing has enjoyed significant research over a period of decades, with renewed interest in the last several years. One approach to detecting logic faults is to create and execute tests that satisfy logic coverage criteria. Another approach to detecting faults is to perform mutation…
Optimizing Memory Transactions for Multicore Systems
Adl-Tabatabai, Ali-Reza; Kozyrakis, Christos; Saha, Bratin
The shift to multicore architectures will require new programming technologies that enable mainstream developers to write parallel programs that can safely take advantage of the parallelism offered by multicore processors. One challenging aspect of shared memory parallel programming is synchronization. Programmers have traditionally used locks for synchronization, but lock-based synchronization has well-known pitfalls that make it hard to use for building thread-safe and scalable software components. Memory transactions have emerged as a promising alternative to lock-based synchronization because they promise to eliminate many of the problems associated with locks. Transactional programming constructs, however, have overheads and require optimizations to make them practical. Transactions can also benefit significantly from hardware support, and multicore processors with their large transistor budgets and on-chip memory hierarchies have the opportunity to provide this support.
Buyer protection for e-commerce transactions
Directory of Open Access Journals (Sweden)
Michał Laskowski
2010-12-01
Full Text Available Buyer protection has been a major challenge for e-commerce entrepreneurs and engineers building application for executing transactions on-line. The threat connected with e-commerce is mostly connected with problems in authenticating users performing the buy/sell action. Key webportals such as eBay.com and Paypal.com offer 100% money back buyer protection programs for transactions that were unsuccessful or purchased goods were substantially different from the provided description. The aim of this article is to analyze procedures of acquiring compensation in buyer protection programs procedures. The case study enclosed in the article seem to advocate that buyer protection programs does not insure e-commerce transactions. Any kind of money back guarantee is affected by the current marketing policy of the company. The user agreement does not directly impose an obligation of receiving compensation by the user.
The Econometric Procedures of Specific Transaction Identification
Directory of Open Access Journals (Sweden)
Doszyń Mariusz
2017-06-01
Full Text Available The paper presents the econometric procedures of identifying specific transactions, in which atypical conditions or attributes may occur. These procedures are based on studentized and predictive residuals of the accordingly specified econometric models. The dependent variable is a unit transactional price, and explanatory variables are both the real properties’ attributes and accordingly defined artificial binary variables. The utility of the proposed method has been verified by means of a real market data base. The proposed procedures can be helpful during the property valuation process, making it possible to reject real properties that are specific (both from the point of view of the transaction conditions and the properties’ attributes and, consequently, to select an appropriate set of similar attributes that are essential for the valuation process.
Editorial for IEEE Transactions on Power Electronics
DEFF Research Database (Denmark)
Blaabjerg, Frede
2007-01-01
Our IEEE transactions on power electronics has had some very positive progress these past years under the leadership of Dr. Daan van Wyk. Papers have been processed efficiently both in review time and publication time. This success has spread throughout the whole power electronics community which...... has increased the submission of papers to the TRANSACTIONS every year. Fortunately, we have been able to increase the number of papers published, however, we still have a relatively large backlog. In 2007, we will increase the number of published papers to nearly 2,000 pages. Unfortunately......, this popularity creates a transient problem for many authors. The impact factor of the TRANSACTIONS has dropped significantly. This parameter was not important years ago for the PELS Society, but now, universities all over the world try to benchmark and one of their factors are publications in high impact...
Programming Games for Logical Thinking
Directory of Open Access Journals (Sweden)
H. Tsalapatas
2013-03-01
Full Text Available Analytical thinking is a transversal skill that helps learners synthesize knowledge across subject areas; from mathematics, science, and technology to critical reading, critical examination, and evaluation of lessons. While most would not doubt the importance of analytical capacity in academic settings and its growing demand for the skill in professional environments, school curricula do not comprehensively address its development. As a result, the responsibility for structuring related learning activities falls to teachers. This work examines learning paradigms that can be integrated into mathematics and science school education for developing logical thinking through game-based exercises based on programming. The proposed learning design promotes structured algorithmic mindsets, is based on inclusive universal logic present in all cultures, and promotes constructivism educational approaches encouraging learners to drive knowledge building by composing past and emerging experiences.
The Relevance of Hegel's Logic
Directory of Open Access Journals (Sweden)
John W Burbidge
2007-12-01
Full Text Available Hegel defines his Logic as the science that thinks about thinking.nbsp; But when we interpret that work as outlining what happens when we reason we are vulnerable to Fregersquo;s charge of psychologism.nbsp; I use Hegelrsquo;s tripartite distinction among understanding, dialectical and speculative reason as operations of pure thought to suggest how thinking can work with objective concepts.nbsp; In the last analysis, however, our ability to move from the subjective contingency of representations and ideas to the pure concepts we think develops from mechanical memory, which separates sign from sense so hat we can focus simply on the latter.nbsp; By becoming aware of the connections that underlie our thinking processes we may be able to both move beyond the abstractions of symbolic logic and clarify what informal logicians call relevance.
An Embedded Reconfigurable Logic Module
Tucker, Jerry H.; Klenke, Robert H.; Shams, Qamar A. (Technical Monitor)
2002-01-01
A Miniature Embedded Reconfigurable Computer and Logic (MERCAL) module has been developed and verified. MERCAL was designed to be a general-purpose, universal module that that can provide significant hardware and software resources to meet the requirements of many of today's complex embedded applications. This is accomplished in the MERCAL module by combining a sub credit card size PC in a DIMM form factor with a XILINX Spartan I1 FPGA. The PC has the ability to download program files to the FPGA to configure it for different hardware functions and to transfer data to and from the FPGA via the PC's ISA bus during run time. The MERCAL module combines, in a compact package, the computational power of a 133 MHz PC with up to 150,000 gate equivalents of digital logic that can be reconfigured by software. The general architecture and functionality of the MERCAL hardware and system software are described.
Challenging institutional logics in Gourmet
DEFF Research Database (Denmark)
Nickelsen, Niels Christian Mossfeldt; Scheuer, John Damm
2015-01-01
This paper focuses on the initial phase of an organizational transformation. More precisely the paper analyses the moment where an institutional entrepreneur produces ideas, which have the capacity to break with existing logics and thus produces the potential for change by challenging existing...... field logics. The empirical case is the gastronomic field in Denmark and in the Nordic countries - more specifically the paper discusses the cook and entrepreneur Claus Meyers ambitions to realize a food-political vision; The New Nordic Kitchen. The theoretical contribution of the paper...... is a conceptualization of the way in which an institutional entrepreneur initiates change in an organizational field. More specifically the paper discusses a system of concepts offered by Svejenova et al. (2007). According to Svejenova et al. the Spanish haute cuisine chef of the 3 star Michelin restaurant El Bulli...
Nanowire NMOS Logic Inverter Characterization.
Hashim, Yasir
2016-06-01
This study is the first to demonstrate characteristics optimization of nanowire N-Channel Metal Oxide Semiconductor (NW-MOS) logic inverter. Noise margins and inflection voltage of transfer characteristics are used as limiting factors in this optimization. A computer-based model used to produce static characteristics of NW-NMOS logic inverter. In this research two circuit configuration of NW-NMOS inverter was studied, in first NW-NMOS circuit, the noise margin for (low input-high output) condition was very low. For second NMOS circuit gives excellent noise margins, and results indicate that optimization depends on applied voltage to the inverter. Increasing gate to source voltage with (2/1) nanowires ratio results better noise margins. Increasing of applied DC load transistor voltage tends to increasing in decreasing noise margins; decreasing this voltage will improve noise margins significantly.
Fuzzy Versions of Epistemic and Deontic Logic
Gounder, Ramasamy S.; Esterline, Albert C.
1998-01-01
Epistemic and deontic logics are modal logics, respectively, of knowledge and of the normative concepts of obligation, permission, and prohibition. Epistemic logic is useful in formalizing systems of communicating processes and knowledge and belief in AI (Artificial Intelligence). Deontic logic is useful in computer science wherever we must distinguish between actual and ideal behavior, as in fault tolerance and database integrity constraints. We here discuss fuzzy versions of these logics. In the crisp versions, various axioms correspond to various properties of the structures used in defining the semantics of the logics. Thus, any axiomatic theory will be characterized not only by its axioms but also by the set of properties holding of the corresponding semantic structures. Fuzzy logic does not proceed with axiomatic systems, but fuzzy versions of the semantic properties exist and can be shown to correspond to some of the axioms for the crisp systems in special ways that support dependency networks among assertions in a modal domain. This in turn allows one to implement truth maintenance systems. For the technical development of epistemic logic, and for that of deontic logic. To our knowledge, we are the first to address fuzzy epistemic and fuzzy deontic logic explicitly and to consider the different systems and semantic properties available. We give the syntax and semantics of epistemic logic and discuss the correspondence between axioms of epistemic logic and properties of semantic structures. The same topics are covered for deontic logic. Fuzzy epistemic and fuzzy deontic logic discusses the relationship between axioms and semantic properties for these logics. Our results can be exploited in truth maintenance systems.
Handling Pressures of Community Logic
DEFF Research Database (Denmark)
Minbaeva, Dana; Hotho, Jasper; Muratbekova-Touron, Maral
2013-01-01
The paper aims at investigating how in pluralistic societies, such as emerging economies and countries in transition, organizational decision-makers respond to pressures of community logics in non-community settings, such as the work place. We theorize that in non-community settings, social relat...... with an experimental vignette study of the effects of clan and kinship ties on recruitment and selection decisions in Kazakhstan, followed by qualitative interviews....
Logic Learning in Hopfield Networks
Sathasivam, Saratha; Abdullah, Wan Ahmad Tajuddin Wan
2008-01-01
Synaptic weights for neurons in logic programming can be calculated either by using Hebbian learning or by Wan Abdullah's method. In other words, Hebbian learning for governing events corresponding to some respective program clauses is equivalent with learning using Wan Abdullah's method for the same respective program clauses. In this paper we will evaluate experimentally the equivalence between these two types of learning through computer simulations.
Admissible Rules of Lukasiewicz Logic
Czech Academy of Sciences Publication Activity Database
Jeřábek, Emil
2010-01-01
Roč. 20, č. 2 (2010), s. 425-447 ISSN 0955-792X R&D Projects: GA AV ČR IAA900090703; GA AV ČR IAA100190902; GA MŠk(CZ) 1M0545 Institutional research plan: CEZ:AV0Z10190503 Keywords : linear temporal logic * unification * consecutions Subject RIV: BA - General Mathematics Impact factor: 0.586, year: 2010 http://logcom.oxfordjournals.org/content/20/2/425
Modelling Emotions with Multidimensional Logic
Gershenson, Carlos
1999-01-01
One of the objectives of Artificial Intelligence has been the modelling of "human" characteristics, such as emotions, behaviour, conscience, etc. But in such characteristics we might find certain degree of contradiction. Previous work on modelling emotions and its problems are reviewed. A model for emotions is proposed using multidimensional logic, which handles the degree of contradiction that emotions might have. The model is oriented to simulate emotions in artificial societies...
Session Types in Abelian Logic
Directory of Open Access Journals (Sweden)
Yoichi Hirai
2013-12-01
Full Text Available There was a PhD student who says "I found a pair of wooden shoes. I put a coin in the left and a key in the right. Next morning, I found those objects in the opposite shoes." We do not claim existence of such shoes, but propose a similar programming abstraction in the context of typed lambda calculi. The result, which we call the Amida calculus, extends Abramsky's linear lambda calculus LF and characterizes Abelian logic.
Is special relativity logically inconsistent
International Nuclear Information System (INIS)
Prokhovnik, S.J.
1980-01-01
The author gives his view that Special Relativity is logically and mathematically consistent, as well as physically comprehensible if, and only if, it is firmly based on the single assumption of a unique fundamental reference frame for light propagation. The theory and all its results are derivable from this assumption; the Relativity and Light Principles become intelligible consequences of this assumption; the physical significance and source of time dilation and length contraction are made manifest thereby. (Auth.)
Anaesthesia monitoring using fuzzy logic.
Baig, Mirza Mansoor; Gholamhosseini, Hamid; Kouzani, Abbas; Harrison, Michael J
2011-10-01
Humans have a limited ability to accurately and continuously analyse large amount of data. In recent times, there has been a rapid growth in patient monitoring and medical data analysis using smart monitoring systems. Fuzzy logic-based expert systems, which can mimic human thought processes in complex circumstances, have indicated potential to improve clinicians' performance and accurately execute repetitive tasks to which humans are ill-suited. The main goal of this study is to develop a clinically useful diagnostic alarm system based on fuzzy logic for detecting critical events during anaesthesia administration. The proposed diagnostic alarm system called fuzzy logic monitoring system (FLMS) is presented. New diagnostic rules and membership functions (MFs) are developed. In addition, fuzzy inference system (FIS), adaptive neuro fuzzy inference system (ANFIS), and clustering techniques are explored for developing the FLMS' diagnostic modules. The performance of FLMS which is based on fuzzy logic expert diagnostic systems is validated through a series of off-line tests. The training and testing data set are selected randomly from 30 sets of patients' data. The accuracy of diagnoses generated by the FLMS was validated by comparing the diagnostic information with the one provided by an anaesthetist for each patient. Kappa-analysis was used for measuring the level of agreement between the anaesthetist's and FLMS's diagnoses. When detecting hypovolaemia, a substantial level of agreement was observed between FLMS and the human expert (the anaesthetist) during surgical procedures. The diagnostic alarm system FLMS demonstrated that evidence-based expert diagnostic systems can diagnose hypovolaemia, with a substantial degree of accuracy, in anaesthetized patients and could be useful in delivering decision support to anaesthetists.
Implementing e-Transactions with Asynchronous Replication
Frolund, Svend; Guerraoui, Rachid
2000-01-01
An e-Transaction is one that executes exactly-once despite failures. This paper describes a distributed protocol that implements the abstraction of e-Transactionsin three-tier architectures. Three-tier architectures are typically Internet-oriented architectures, where the end-user interacts with front-end clients (e.g., browsers) that invoke middle-tier application servers (e.g., web servers) to access back-end databases. We implement the e-Transaction abstraction using an asynchronous replic...
Language-Level Transactions for Modular Reliable Systems
National Research Council Canada - National Science Library
Ananian, C. S; Rinard, Martin
2004-01-01
The authors show how to integrate non-blocking transactions into an object-oriented language, "transactifying" existing code to fix existing concurrency bugs and using transactions for modular fault...
Texture classification using logical operators.
Manian, V; Vasquez, R; Katiyar, P
2000-01-01
In this paper, a new algorithm for texture classification based on logical operators is presented. Operators constructed from logical building blocks are convolved with texture images. An optimal set of six operators are selected based on their texture discrimination ability. The responses are then converted to standard deviation matrices computed over a sliding window. Zonal sampling features are computed from these matrices. A feature selection process is applied and the new set of features are used for texture classification. Classification of several natural and synthetic texture images are presented demonstrating the excellent performance of the logical operator method. The computational superiority and classification accuracy of the algorithm is demonstrated by comparison with other popular methods. Experiments with different classifiers and feature normalization are also presented. The Euclidean distance classifier is found to perform best with this algorithm. The algorithm involves only convolutions and simple arithmetic in the various stages which allows faster implementations. The algorithm is applicable to different types of classification problems which is demonstrated by segmentation of remote sensing images, compressed and reconstructed images and industrial images.
Between quantum logic and concurrency
Directory of Open Access Journals (Sweden)
Luca Bernardinello
2014-07-01
Full Text Available We start from two closure operators defined on the elements of a special kind of partially ordered sets, called causal nets. Causal nets are used to model histories of concurrent processes, recording occurrences of local states and of events. If every maximal chain (line of such a partially ordered set meets every maximal antichain (cut, then the two closure operators coincide, and generate a complete orthomodular lattice. In this paper we recall that, for any closed set in this lattice, every line meets either it or its orthocomplement in the lattice, and show that to any line, a two-valued state on the lattice can be associated. Starting from this result, we delineate a logical language whose formulas are interpreted over closed sets of a causal net, where every line induces an assignment of truth values to formulas. The resulting logic is non-classical; we show that maximal antichains in a causal net are associated to Boolean (hence "classical" substructures of the overall quantum logic.
Cosmic logic: a computational model
International Nuclear Information System (INIS)
Vanchurin, Vitaly
2016-01-01
We initiate a formal study of logical inferences in context of the measure problem in cosmology or what we call cosmic logic. We describe a simple computational model of cosmic logic suitable for analysis of, for example, discretized cosmological systems. The construction is based on a particular model of computation, developed by Alan Turing, with cosmic observers (CO), cosmic measures (CM) and cosmic symmetries (CS) described by Turing machines. CO machines always start with a blank tape and CM machines take CO's Turing number (also known as description number or Gödel number) as input and output the corresponding probability. Similarly, CS machines take CO's Turing number as input, but output either one if the CO machines are in the same equivalence class or zero otherwise. We argue that CS machines are more fundamental than CM machines and, thus, should be used as building blocks in constructing CM machines. We prove the non-computability of a CS machine which discriminates between two classes of CO machines: mortal that halts in finite time and immortal that runs forever. In context of eternal inflation this result implies that it is impossible to construct CM machines to compute probabilities on the set of all CO machines using cut-off prescriptions. The cut-off measures can still be used if the set is reduced to include only machines which halt after a finite and predetermined number of steps
A Resolution Prover for Coalition Logic
Directory of Open Access Journals (Sweden)
Cláudia Nalon
2014-04-01
Full Text Available We present a prototype tool for automated reasoning for Coalition Logic, a non-normal modal logic that can be used for reasoning about cooperative agency. The theorem prover CLProver is based on recent work on a resolution-based calculus for Coalition Logic that operates on coalition problems, a normal form for Coalition Logic. We provide an overview of coalition problems and of the resolution-based calculus for Coalition Logic. We then give details of the implementation of CLProver and present the results for a comparison with an existing tableau-based solver.
Asynchronous Operators of Sequential Logic Venjunction & Sequention
Vasyukevich, Vadim
2011-01-01
This book is dedicated to new mathematical instruments assigned for logical modeling of the memory of digital devices. The case in point is logic-dynamical operation named venjunction and venjunctive function as well as sequention and sequentional function. Venjunction and sequention operate within the framework of sequential logic. In a form of the corresponding equations, they organically fit analytical expressions of Boolean algebra. Thus, a sort of symbiosis is formed using elements of asynchronous sequential logic on the one hand and combinational logic on the other hand. So, asynchronous
Logic and discrete mathematics a concise introduction
Conradie, Willem
2015-01-01
A concise yet rigorous introduction to logic and discrete mathematics. This book features a unique combination of comprehensive coverage of logic with a solid exposition of the most important fields of discrete mathematics, presenting material that has been tested and refined by the authors in university courses taught over more than a decade. The chapters on logic - propositional and first-order - provide a robust toolkit for logical reasoning, emphasizing the conceptual understanding of the language and the semantics of classical logic as well as practical applications through the easy
All-optical symmetric ternary logic gate
Chattopadhyay, Tanay
2010-09-01
Symmetric ternary number (radix=3) has three logical states (1¯, 0, 1). It is very much useful in carry free arithmetical operation. Beside this, the logical operation using this type of number system is also effective in high speed computation and communication in multi-valued logic. In this literature all-optical circuits for three basic symmetrical ternary logical operations (inversion, MIN and MAX) are proposed and described. Numerical simulation verifies the theoretical model. In this present scheme the different ternary logical states are represented by different polarized state of light. Terahertz optical asymmetric demultiplexer (TOAD) based interferometric switch has been used categorically in this manuscript.
Transaction costs and asset prices : a dynamic equilibrium model
Dimitri Vayanos
1998-01-01
In this article we study the effects of transaction costs on asset prices. We assume an overlapping generations economy with a riskless, liquid bond, and many risky stocks carrying proportional transaction costs. We obtain stock prices and turnover in closed form. Surprisingly, a stock's price may increase in transaction costs, and a more frequently traded stock may be less adversely affected by an increase in transaction costs. Calculations based on the 'marginal' investor overestimate the e...
Fareed, Naleef; Mick, Stephen S
2011-01-01
For almost a decade, public and private organizations have pressured hospitals to improve their patient safety records. Since 2008, the Centers for Medicare & Medicaid Services has no longer been reimbursing hospitals for secondary diagnoses not reported during the point of admission. This ruling has motivated some hospitals to engage in safety-oriented programs to decrease adverse events. This study examined which hospitals may engage in patient safety solutions and whether they create these patient safety solutions within their structures or use suppliers in the market. We used a theoretical model that incorporates the key constructs of resource dependence theory and transaction cost economics theory to predict a hospital's reaction to Centers for Medicare & Medicaid Services "never event" regulations. We present propositions that speculate on how forces conceptualized from the resource dependence theory may affect adoption of patient safety innovations and, when they do, whether the adopting hospitals will do so internally or externally according to the transaction cost economics theory. On the basis of forces identified by the resource dependence theory, we predict that larger, teaching, safety net, horizontally integrated, highly interdependent, and public hospitals in concentrated, high public payer presence, competitive, and resource-rich environments will be more likely to engage in patient safety innovations. Following the logic of the transaction cost economics theory, we predict that of the hospitals that react positively to the never event regulation, most will internalize their innovations in patient safety solutions rather than approach the market, a choice that helps hospitals economize on transaction costs. This study helps hospital managers in their strategic thinking and planning in relation to current and future regulations related to patient safety. For researchers and policy analysts, our propositions provide the basis for empirical testing.
MEMS Logic Using Mixed-Frequency Excitation
Ilyas, Saad
2017-06-22
We present multi-function microelectromechanical systems (MEMS) logic device that can perform the fundamental logic gate AND, OR, universal logic gates NAND, NOR, and a tristate logic gate using mixed-frequency excitation. The concept is based on exciting combination resonances due to the mixing of two or more input signals. The device vibrates at two steady states: a high state when the combination resonance is activated and a low state when no resonance is activated. These vibration states are assigned to logical value 1 or 0 to realize the logic gates. Using ac signals to drive the resonator and to execute the logic inputs unifies the input and output wave forms of the logic device, thereby opening the possibility for cascading among logic devices. We found that the energy consumption per cycle of the proposed logic resonator is higher than those of existing technologies. Hence, integration of such logic devices to build complex computational system needs to take into consideration lowering the total energy consumption. [2017-0041
Introduction to fuzzy logic using Matlab
Sivanandam, SN; Deepa, S N
2006-01-01
Fuzzy Logic, at present is a hot topic, among academicians as well various programmers. This book is provided to give a broad, in-depth overview of the field of Fuzzy Logic. The basic principles of Fuzzy Logic are discussed in detail with various solved examples. The different approaches and solutions to the problems given in the book are well balanced and pertinent to the Fuzzy Logic research projects. The applications of Fuzzy Logic are also dealt to make the readers understand the concept of Fuzzy Logic. The solutions to the problems are programmed using MATLAB 6.0 and the simulated results are given. The MATLAB Fuzzy Logic toolbox is provided for easy reference.
Electronic Business Transaction Infrastructure Analysis Using Petri Nets and Simulation
Feller, Andrew Lee
2010-01-01
Rapid growth in eBusiness has made industry and commerce increasingly dependent on the hardware and software infrastructure that enables high-volume transaction processing across the Internet. Large transaction volumes at major industrial-firm data centers rely on robust transaction protocols and adequately provisioned hardware capacity to ensure…
45 CFR 162.1901 - Medicaid pharmacy subrogation transaction.
2010-10-01
... 45 Public Welfare 1 2010-10-01 2010-10-01 false Medicaid pharmacy subrogation transaction. 162... STANDARDS AND RELATED REQUIREMENTS ADMINISTRATIVE REQUIREMENTS Medicaid Pharmacy Subrogation § 162.1901 Medicaid pharmacy subrogation transaction. The Medicaid pharmacy subrogation transaction is the...
17 CFR 30.9 - Fraudulent transactions prohibited.
2010-04-01
... prohibited. 30.9 Section 30.9 Commodity and Securities Exchanges COMMODITY FUTURES TRADING COMMISSION FOREIGN FUTURES AND FOREIGN OPTIONS TRANSACTIONS § 30.9 Fraudulent transactions prohibited. It shall be unlawful... foreign futures contract or foreign options transaction: (a) To cheat or defraud or attempt to cheat or...
17 CFR 32.3 - Unlawful commodity option transactions.
2010-04-01
... 17 Commodity and Securities Exchanges 1 2010-04-01 2010-04-01 false Unlawful commodity option transactions. 32.3 Section 32.3 Commodity and Securities Exchanges COMMODITY FUTURES TRADING COMMISSION REGULATION OF COMMODITY OPTION TRANSACTIONS § 32.3 Unlawful commodity option transactions. (a) On and after...
17 CFR 32.11 - Suspension of commodity option transactions.
2010-04-01
... 17 Commodity and Securities Exchanges 1 2010-04-01 2010-04-01 false Suspension of commodity option transactions. 32.11 Section 32.11 Commodity and Securities Exchanges COMMODITY FUTURES TRADING COMMISSION REGULATION OF COMMODITY OPTION TRANSACTIONS § 32.11 Suspension of commodity option transactions. (a...
Office of Institutional Research Transactional System. A Manual.
Black, Frank S.
1976-01-01
A transactional system is the routine method for carrying out certain processes. This paper describes how a transactional system can be developed and operated for an office that has no computer support. The model is an Office of Institutional Research (OIR). The OIR manual (noncomputer supported) transactional system at Texas Southern University…
A selective logging mechanism for hardware transactional memory systems
Lupon Navazo, Marc; Magklis, Grigorios; González Colás, Antonio María
2011-01-01
Log-based Hardware Transactional Memory (HTM) systems offer an elegant solution to handle speculative data that overflow transactional L1 caches. By keeping the pre-transactional values on a software-resident log, speculative values can be safely moved across the memory hierarchy, without requiring expensive searches on L1 misses or commits.
26 CFR 1.446-4 - Hedging transactions.
2010-04-01
... must be reasonable and consistent with the taxpayer's hedging policies and strategies. (2) Hedges of... transaction hedges sales of inventory, gain or loss on the hedging transaction may be taken into account in... of cost incurred in, or sales proceeds from, that transaction. As with hedges of aggregate risk...
An Architecture for Nested Transaction Support on Standard Database Systems
Boertjes, E.M.; Grefen, P.W.P.J.; Vonk, J.; Apers, Peter M.G.
Many applications dealing with complex processes require database support for nested transactions. Current commercial database systems lack this kind of support, offering flat, non-nested transactions only. This paper presents a three-layer architecture for implementing nested transaction support on
31 CFR 538.418 - Financial transactions in Sudan.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Financial transactions in Sudan. 538... Interpretations § 538.418 Financial transactions in Sudan. (a) Any financial transaction with a depository institution located in an area of Sudan other than the Specified Areas of Sudan, e.g., Khartoum, remains...
The logic of relations and the logic of management.
Buntinx, W
2008-07-01
Increasing emphasis on financial and administrative control processes is affecting service culture in support organisations for persons with intellectual disability. This phenomenon is currently obvious in Dutch service organisations that find themselves in transition towards more community care and at the same time under pressure from new administrative and funding managerial bureaucracy. As a result, the logic of management is becoming more dominant in direct support settings and risk to overshadow the logic of relationships between staff and clients. The article presents a reflection on this phenomenon, starting from a description of service team characteristics as found in the literature. Next, findings about direct support staff (DSS) continuity are summarised from four Dutch studies. Following up these findings, the concept of 'microsystems' is explored as a possible answer to the organisational challenges demonstrated in the studies. Team characteristics, especially team size and membership continuity for DSS, appear relevant factors for assuring supportive relationships and service quality in direct support teams. The structure of the primary support team shows to be of special interest. The organisational concept of 'microsystems' is explored with respect to transcending the present conflict between bureaucratic managerial pressure and the need for supportive relationships. Service organisations need to create structural conditions for the efficacy of direct support teams in terms of client relationships and relevant client outcomes. At the same time, the need for administrative and control processes can not be denied. The concept of 'microsystems', application of a Quality of Life framework and the use of new instruments, such as the Supports Intensity Scale, can contribute to an organisational solution for the present conflicting logic of relations and management.
75 FR 78758 - Prohibited Transaction Exemptions From Certain Prohibited Transaction Restrictions
2010-12-16
... of the prohibited transaction restrictions of the Employee Retirement Income Security Act of 1974... Restrictions AGENCY: Employee Benefits Security Administration, Labor. ACTION: Grant of Individual Exemptions... From the Federal Register Online via the Government Publishing Office DEPARTMENT OF LABOR Employee...
An Analysis of Other Transactions. Have Other Transactions Met the Intent of Congress?
National Research Council Canada - National Science Library
Hanson, Todd T
2005-01-01
.... In 1989, Congress provided "Other Transaction Authority" (OTA) to address this problem. OTA provided a procurement vehicle which minimized the laws and regulations applicable to contracts, grants, or cooperative agreements...
Lu, H.J.; Feng, L.; Han, J.W.
2000-01-01
In this paper, we extend the scope of mining association rules from traditional single-dimensional intratransaction associations, to multidimensional intertransaction associations. Intratransaction associations are the associations among items with the same transaction, where the notion of the
Trust management for e-transactions
Indian Academy of Sciences (India)
R. Narasimhan (Krishtel eMaging) 1461 1996 Oct 15 13:05:22
Based on the severity of perceived risk associated with applications, users enter into collaboration with one of the four distinguishable regions of following figure 1 as the initial trust value. For example, in transactions of high financial value, users might not trust the communicating peer easily and may initiate the negotiation ...
Transformational and transactional leadership styles among leaders ...
African Journals Online (AJOL)
It is recommended that national and state administrative management should examine various strategies to strengthen a balance of both leadership orientations as required with a view to effectively channeling them in order to achieve their goals and objectives. Keywords: Transformational Leadership, Transactional ...
Relationship between transactional leadership and knowledge ...
African Journals Online (AJOL)
A leadership style is a leader's style of providing direction, implementing plans, and motivating people. The Transactional style of leadership involves motivating and directing followers primarily through appealing to their own self-interest. Besides, Knowledge management (KM) is the process of capturing, developing, ...
17 CFR 30.3 - Prohibited transactions.
2010-04-01
... engage in the offer and sale of any foreign futures contract or foreign options transaction for or on behalf of a foreign futures or foreign options customer, except in accordance with the provisions of this... unlawful for any person to engage in the offer and sale of any foreign futures contract or foreign option...
Private Benefits in Corporate Control Transactions
DEFF Research Database (Denmark)
Poulsen, Thomas
2011-01-01
This paper presents an analytical framework from which it can be inferred whether sellers or buyers in block transactions value private benefits highest. I am thus able to suggest an answer to the question: Are blocks of shares traded because the buyer has high security benefits, or because the b...
Private benefits in corporate control transactions
DEFF Research Database (Denmark)
Poulsen, Thomas
This paper presents an analytical framework from which it can be inferred whether sellers or buyers in corporate control transactions value private benefits highest. I am thus able to suggest an answer to the question: Are blocks of shares traded because the buyer is a more efficient monitor...
31 CFR 800.207 - Covered transaction.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Covered transaction. 800.207 Section 800.207 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF..., which could result in control of a U.S. business by a foreign person. ...
31 CFR 337.7 - Servicing transactions.
2010-07-01
... 31 Money and Finance: Treasury 2 2010-07-01 2010-07-01 false Servicing transactions. 337.7 Section 337.7 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) FISCAL SERVICE...-entry debenture system, to be announced in advance by separate public notice, any transfer or...
77 FR 64663 - Iranian Transactions Regulations
2012-10-22
... property; liquidation of blocked property. Subpart C--General Definitions 560.301 Effective date. 560.302... (``Blocking Property of the Government of Iran and Iranian Financial Institutions''), and subsections 1245(c...) provides that the President shall, pursuant to IEEPA, block and prohibit all transactions in all property...
Foreign experience of regulating international trade transactions
Directory of Open Access Journals (Sweden)
Klymenko L. V.
2015-05-01
Full Text Available The article deals with the international experience of state regulating international trade transactions; nature, directions and contradictions of contemporary processes of globalization are defined; components of regulatory and incentive means in system of state supporting foreign trade activity of commodity producers are considered; general provisions for the improvement of state regulation mechanisms of export-import activities in Ukraine are determined.
Transaction charges allocation using sensitivity factor methodology
Indian Academy of Sciences (India)
power flow due to each transaction is calculated based on a sensitivity factor called (ACPTDF) and the transmission ... basic transmission pricing methods in the deregulated power system are Postage Stamp Pric- ing Method ..... (southern major power source point) and Madurai (middle major power demand point). This is.
2010-07-01
... formation of a joint venture. (f) A long-term lease under which a lessee makes substantially all business.... Example. Corporation A, a foreign person, signs a concession agreement to operate the toll road business... other relevant facts, this is not a transaction. ...
A Critical Analysis of Transactional Distance Theory
Gorsky, Paul; Caspi, Avner
2005-01-01
This investigation reviews published empirical studies that attempted to support or to validate transactional distance theory (Moore, 1993). It was found that either data only partially supported the theory or, that if they apparently did so, the studies lacked reliability, construct validity, or both. It was concluded that the basic propositions…
77 FR 62177 - Retail Foreign Exchange Transactions
2012-10-12
... \\5\\ (a retail foreign exchange (forex) rule). Transactions described in section 2(c)(2)(B)(i)(I...'s retail forex rule must treat similarly all such futures and options and all agreements, contracts... forex rules must prescribe appropriate requirements with respect to disclosure, recordkeeping, capital...
76 FR 56094 - Retail Foreign Exchange Transactions
2011-09-12
... currency with retail customers, subject to the requirements enumerated in the OCC's retail forex rule. The... shall prescribe \\5\\ (a retail forex rule). A transaction described in section 2(c)(2)(B)(i)(I) includes... associations are depository institutions. See 12 U.S.C. 1813(c)(1). \\3\\ For purposes of the retail forex rules...
76 FR 41676 - Retail Foreign Exchange Transactions
2011-07-15
... with persons who are not ``eligible contract participants'' (commonly referred to as ``retail forex... temporary Rule 15b12-1T to allow a registered broker-dealer to engage in a retail forex business until July... forex transactions. DATES: Effective Date: Rule 15b12-1T is effective on July 15, 2011 and will remain...
Related party transactions and firms financial performance ...
African Journals Online (AJOL)
The study investigated related party transactions and firm's financial performance using Secondary data obtained from Nigeria stock Exchange. We tried to determine whether RPT is used by firms to manipulate and bloat Return on Asset, Return on Equity and Earnings per share of manufacturing firms. RPT was subjected ...
Transactions of the Zimbabwe Scientific Association
African Journals Online (AJOL)
The Zimbabwe Scientific Association was founded in Bulawayo in 1899 (called the Rhodesia Scientific Assocation at the time) to promote the study and advancement of science in Zimbabwe and to facilitate the acquisition and dissemination of scientific knowledge. Its journal, Transactions of the Zimbabwe Scientific ...
Gestion des transactions en environnement mobile | Nouali ...
African Journals Online (AJOL)
Management of Transactions In Mobile Computing Environment Increasingly diverse applications have made computers an ubiquitous part of our daily lives. As their range of applications widens, demand is growing for computers that can perform outside the home or office. Accordingly, mobile computing is attracting ...
19 CFR 152.103 - Transaction value.
2010-04-01
... made directly or indirectly. Example 1. In a transaction with foreign Company X, a U.S. firm pays... accepted as the appraised value. (i) Interpretative note. A seller requires a buyer of automobiles not to... firm's overall profit realized over a representative period of time (e.g., on an annual basis), in...
How Contracts and Enforcement Explain Transaction Outcomes
Mooi, E.A.; Gilliland, D.I.
2013-01-01
This study considers the influence of contracts on enforcement and the subsequent performance impact of aligned and misaligned enforcement. We define enforcement as a corrective action aimed at remedying problems occurring in the transaction. First we explain the role of contracts and show that at
Towards Online and Transactional Relational Schema Transformations
Wevers, L.; Hofstra, Matthijs; Tammens, Menno; Huisman, Marieke; van Keulen, Maurice
2014-01-01
In this paper, we want to draw the attention of the database community to the problem of online schema changes: changing the schema of a database without blocking concurrent transactions. We have identified important classes of relational schema transformations that we want to perform online, and we
31 CFR 800.303 - Lending transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Lending transactions. 800.303 Section 800.303 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... the creation in the foreign person of a secured interest in securities or other assets of the U.S...
31 CFR 588.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 588.206 Section 588.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... assist in the creation of information or informational materials; and, with respect to information or...
31 CFR 545.208 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 545.208 Section 545.208 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... assist in the creation of information or informational materials; and, with respect to information or...
31 CFR 515.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 515.206 Section 515.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... the creation of information or informational materials, and payment of royalties to a designated...
31 CFR 542.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 542.206 Section 542.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... assist in the creation of information or informational materials; and, with respect to information or...
31 CFR 548.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 548.206 Section 548.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... assist in the creation of information or informational materials; and, with respect to information or...
31 CFR 586.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 586.206 Section 586.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... or assist in the creation of information and informational materials, and payment of royalties to...
31 CFR 538.212 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 538.212 Section 538.212 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... services to market, produce or co-produce, create or assist in the creation of information and...
31 CFR 595.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 595.206 Section 595.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF..., provision of services to market, produce or co-produce, create or assist in the creation of information and...
31 CFR 537.210 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 537.210 Section 537.210 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... assist in the creation of information or informational materials; and, with respect to information or...
31 CFR 539.204 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 539.204 Section 539.204 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... of services to market, produce or co-produce, create, or assist in the creation of information or...
31 CFR 560.210 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 560.210 Section 560.210 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... services to market, produce or co-produce, create or assist in the creation of information and...
31 CFR 544.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 544.206 Section 544.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF...-produce, create, or assist in the creation of information or informational materials; and, with respect to...
31 CFR 587.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 587.206 Section 587.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF...-produce, create, or assist in the creation of information or informational materials; and, with respect to...
31 CFR 541.206 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 541.206 Section 541.206 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... assist in the creation of information or informational materials; and, with respect to information or...
31 CFR 536.205 - Exempt transactions.
2010-07-01
... 31 Money and Finance: Treasury 3 2010-07-01 2010-07-01 false Exempt transactions. 536.205 Section 536.205 Money and Finance: Treasury Regulations Relating to Money and Finance (Continued) OFFICE OF... creation of information and informational materials, and payment of royalties to a specially designated...
Rethinking Ethiopian Secured Transactions Law through ...
African Journals Online (AJOL)
The article uses the unitary concept of security interest and floating lien to exemplify the supremacy of the approaches and policies of UCC Art. 9 and its suitability as a model for potential secured transactions law reform in Ethiopia. Keywords: Credit market, UCC, unitary concept/theory, functional approach, floating lien, ...
Governance structures for real estate transactions: Markets ...
African Journals Online (AJOL)
This article examines the relative prevalence of markets, hierarchies and networks in the governance of real-estate transactions under three property rights regimes in Windhoek's low-income settlements. These governance structures are related to respective property rights regimes and to conjectures made about the ...
Conceptualizing and Measuring Transformational and Transactional Leadership
DEFF Research Database (Denmark)
Ulrich Thy, Jensen,; Andersen, Lotte Bøgh; Ladegaard Bro, Louise
2016-01-01
Existing conceptualizations and measures of transformational and transactional leadership have unclear theoretical bases, confound leadership and its effects, and are not necessarily suitable for public organizations. Overcoming these problems is necessary to test how leadership affects performan...... on employees and leaders, are robust in terms of repeated use by the same respondents, and are applicable to public and private organizations alike....
76 FR 22633 - Retail Foreign Exchange Transactions
2011-04-22
... transactions against any property of a customer other than money or property specifically given as margin for... rule requires a disclosure that when a retail customer loses money trading, the dealer makes money on... Dollar (AUD), Swedish Kronor (SEK), Danish Kroner (DKK), and Norwegian Krone (NOK).\\34\\ An evolving...
16 CFR 802.30 - Intraperson transactions.
2010-01-01
... partnership, however, the manufacturing plant it is contributing to the formation is exempt under § 802.30(c... transactions. (a) An acquisition (other than the formation of a corporation or unincorporated entity under... the profits of partnership X. A also holds 100% of the voting securities of corporation Y. A pays B in...
31 CFR 545.408 - Offshore transactions.
2010-07-01
... OF FOREIGN ASSETS CONTROL, DEPARTMENT OF THE TREASURY TALIBAN (AFGHANISTAN) SANCTIONS REGULATIONS....S. person knows, or has reason to know, that the Taliban or persons whose property or interests in... know, are from the territory of Afghanistan controlled by the Taliban. (b) Prohibited transactions...
Rooks, Gerrit; Raub, Werner; Tazelaar, Frits
2006-01-01
This paper focuses on ex post governance of inter-firm transactions. We develop and test hypotheses on the occurrence of ex post problems like delivery delays, inferior quality, and insufficient service in buyer–supplier transactions. Our hypotheses address effects of transaction characteristics, of
The universal magnetic tunnel junction logic gates representing 16 binary Boolean logic operations
Lee, Junwoo; Suh, Dong Ik; Park, Wanjun
2015-05-01
The novel devices are expected to shift the paradigm of a logic operation by their own nature, replacing the conventional devices. In this study, the nature of our fabricated magnetic tunnel junction (MTJ) that responds to the two external inputs, magnetic field and voltage bias, demonstrated seven basic logic operations. The seven operations were obtained by the electric-field-assisted switching characteristics, where the surface magnetoelectric effect occurs due to a sufficiently thin free layer. The MTJ was transformed as a universal logic gate combined with three supplementary circuits: A multiplexer (MUX), a Wheatstone bridge, and a comparator. With these circuits, the universal logic gates demonstrated 16 binary Boolean logic operations in one logic stage. A possible further approach is parallel computations through a complimentary of MUX and comparator, capable of driving multiple logic gates. A reconfigurable property can also be realized when different logic operations are produced from different level of voltages applying to the same configuration of the logic gate.
Transactive Campus Energy Systems: Final Report
Energy Technology Data Exchange (ETDEWEB)
Katipamula, Srinivas [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Corbin, Charles D. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Haack, Jereme N. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Hao, He [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Kim, Woohyun [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Hostick, Donna J. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Akyol, Bora A. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Allwardt, Craig H. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Carpenter, Brandon J. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Huang, Sen [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Liu, Guopeng [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Lutes, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Makhmalbaf, Atefe [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Mendon, Vrushali V. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Ngo, Hung [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Somasundaram, Sriram [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Underhill, Ronald M. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Zhao, Mingjie [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2017-09-26
Transactive energy refers to the combination of economic and control techniques to improve grid reliability and efficiency. The fundamental purpose of transactive energy management is to seamlessly coordinate the operation of large numbers of new intelligent assets—such as distributed solar, energy storage and responsive building loads—to provide the flexibility needed to operate the power grid reliably and at minimum cost, particularly one filled with intermittent renewable generation such as the Pacific Northwest. It addresses the key challenge of providing smooth, stable, and predictable “control” of these assets, despite the fact that most are neither owned nor directly controlled by the power grid. The Clean Energy and Transactive Campus (CETC) work described in this report was done as part of a Cooperative Research and Development Agreement (CRADA) between the U.S. Department of Energy’s Pacific Northwest National Laboratory (PNNL) and the Washington State Department of Commerce (Commerce) through the Clean Energy Fund (CEF). The project team consisted of PNNL, the University of Washington (UW) and Washington State University (WSU), to connect the PNNL, UW, and WSU campuses to form a multi-campus testbed for transaction-based energy management—transactive—solutions. Building on the foundational transactive system established by the Pacific Northwest Smart Grid Demonstration (PNWSGD), the purpose of the project was to construct the testbed as both a regional flexibility resource and as a platform for research and development (R&D) on buildings/grid integration and information-based energy efficiency. This report provides a summary of the various tasks performed under the CRADA.
How to deal with malleability of BitCoin transactions
Andrychowicz, Marcin; Dziembowski, Stefan; Malinowski, Daniel; Mazurek, Łukasz
2013-01-01
BitCoin transactions are malleable in a sense that given a transaction an adversary can easily construct an equivalent transaction which has a different hash. This can pose a serious problem in some BitCoin distributed contracts in which changing a transaction's hash may result in the protocol disruption and a financial loss. The problem mostly concerns protocols, which use a "refund" transaction to withdraw a deposit in a case of the protocol interruption. In this short note, we show a gener...
Transaction-Based Building Controls Framework, Volume 1: Reference Guide
Energy Technology Data Exchange (ETDEWEB)
Somasundaram, Sriram [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Pratt, Robert G. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Akyol, Bora A. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Fernandez, Nicholas [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Foster, Nikolas AF [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Katipamula, Srinivas [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Mayhorn, Ebony T. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Somani, Abhishek [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Steckley, Andrew C. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States); Taylor, Zachary T. [Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
2014-12-01
This document proposes a framework concept to achieve the objectives of raising buildings’ efficiency and energy savings potential benefitting building owners and operators. We call it a transaction-based framework, wherein mutually-beneficial and cost-effective market-based transactions can be enabled between multiple players across different domains. Transaction-based building controls are one part of the transactional energy framework. While these controls realize benefits by enabling automatic, market-based intra-building efficiency optimizations, the transactional energy framework provides similar benefits using the same market -based structure, yet on a larger scale and beyond just buildings, to the society at large.
International Nuclear Information System (INIS)
Walter, K.E.
1995-01-01
This document provides an updated computer software description for the software used on the FFTF R-1 (C-620-A) and R-2 (C-620-B) air compressor programmable controllers. Logic software design changes were required to allow automatic starting of a compressor that had not been previously started
Conceptual Modeling via Logic Programming
1990-01-01
CONCEPTUAL MODELING VIA LOGIC PROGRAMaNG 12. PERSONAL AUTHOR(S) John Burge, Bill Noah, Las Smith 13a. TYPE OF REPORT 13b. TIME COVERED 14. DATE OF...interpreter and named it Prolog for middle. He found that his program got into an "Programmation en logique ." It provided the infinite loop unless he used... lA N C I WA v Cruse Mle Submartine 44 0 0 0 0 0835 I 9 33 ICC 33 High F.e cruise Misaile 640 0 8S S44 0 0 High Post cruise missile 840 2 7S 440 too
CSIR Research Space (South Africa)
Britz, K
2014-07-01
Full Text Available (T !) ⊆ atm(α). A proof of this theorem is given by Makinson [35]. Essentially, it establishes that, for every theory T , there is a unique least set of elementary atoms such that T may be expressed equivalently using only atoms from that set. Hence... forgetting as a generalization of weak forgetting in the power set algebra as- sociated with the propositional language L. Brink [8] gives a general account of power structures in the context of logic. Definition 10. Let f : An −→ A be an n-ary operation...
Quantum logic properties of hypergraphs
Energy Technology Data Exchange (ETDEWEB)
Klaey, M.P.
1987-10-01
In quantum logics, the notions of strong and full order determination and unitality for states on orthomodular posets are well known. These notions are defined for hypergraphs and their state spaces in a consistent manner and the relations between them and to the notions defined for orthomodular posets are discussed. The state space of a hypergraph is a polytope. This polytope is a simplex if and only if every superposition of pure states is a mixture of these same pure states. Isomorphic hypergraphs have convexly isomorphic state spaces. A class of hypergraphs is given whose group of automorphisms is group-isomorphic to the group of convex automorphisms of their state spaces.
Logical Entity Level Sentiment Analysis
DEFF Research Database (Denmark)
Petersen, Niklas Christoffer; Villadsen, Jørgen
2017-01-01
We present a formal logical approach using a combinatory categorial grammar for entity level sentiment analysis that utilizes machine learning techniques for efficient syntactical tagging and performs a deep structural analysis of the syntactical properties of texts in order to yield precise...... results. The method should be seen as an alternative to pure machine learning methods for sentiment analysis, which are argued to have high difficulties in capturing long distance dependencies, and can be dependent on significant amount of domain specific training data. The results show that the method...
Rethinking Service Companies’ Business Logic: Do We Need a Customer-Dominant Logic as a Guideline?
Heinonen, Kristina; Strandvik, Tore; Mickelsson, Karl-Jacob; Edvardsson, Bo; Sundström, Erik; Andersson, Per
2009-01-01
Purpose –This paper explores and expands the roles of customers and companies in creating value by introducing a new a customer-based approach to service. The customer’s logic is examined as being the foundation of a customer-based marketing and business logic. Design/methodology/approach – The authors argue that both goods-dominant logics and service-dominant logics are provider-dominant. Contrasting the customer-dominant logic with provider-dominant logics, the paper examines the creatio...
Market Model Considering Bilateral Transactions in the Deregulated Electricity Market
Ruiz Monroy, José Joaquín; Kita, Hiroyuki; Tanaka, Eiichi; Hasegawa, Jun
This paper proposes an algorithm to simulate the transactions that take place in a free market of electricity. The algorithm presented is used for Bilateral Transaction Matrix (BTM) creation assuming that a day ahead load forecast is previously known. Bids can be made by both the generation side and the demand side to determine transaction prices, then the algorithm allocates the transactions according to market rules until the demand is satisfied. This creates feasible BTMs that can be used to study system security and to find future methods to regulate bilateral transactions through market mechanisms like the application of penalties to the transactions that affect the system’s security. Results show that the proposed algorithm is a good option for electricity market analysis. The proposed algorithm provides system planners with a practical tool for data creation to further study the effects of bilateral transactions in a deregulated electricity market.
Fuzzy logic based anaesthesia monitoring systems for the detection of absolute hypovolaemia.
Mansoor Baig, Mirza; Gholamhosseini, Hamid; Harrison, Michael J
2013-07-01
Anaesthesia monitoring involves critical diagnostic tasks carried out amongst lots of distractions. Computers are capable of handling large amounts of data at high speed and therefore decision support systems and expert systems are now capable of processing many signals simultaneously in real time. We have developed two fuzzy logic based anaesthesia monitoring systems; a real time smart anaesthesia alarm system (RT-SAAM) and fuzzy logic monitoring system-2 (FLMS-2), an updated version of FLMS for the detection of absolute hypovolaemia. This paper presents the design aspects of these two systems which employ fuzzy logic techniques to detect absolute hypovolaemia, and compares their performances in terms of usability and acceptability. The interpretation of these two systems of absolute hypovolaemia was compared with clinicians' assessments using Kappa analysis, RT-SAAM K=0.62, FLMS-2 K=0.75; an improvement in performance by FLMS-2. Copyright © 2013 Elsevier Ltd. All rights reserved.
[Continuity and transformation of body logic].
Bolens, Guillemette
2003-01-01
This article is concerned with two distinct corporeal logics. In the first, corporeality is founded on joints, tendons, and mobility; in the second, the envelope and its apertures are considered primordial. The first logic is extant in very few works. Although these texts (e.g. The Iliad, Beowulf) clearly share the same, very specific, conception of the body, they belong to different histories. The corporeal logic of the 'jointed body' (corps articulaire) cannot, therefore, be appraised in terms of longue durée. The texts represent, instead, a moment of transition between the psychodynamics of orality and literacy. A problem correlated to this fact is that readers (ancient and modern) no longer think using the same logic as that pertaining to the jointed body. They tend to translate information regarding the logic of the jointed body into data meaningful in their own logic.
All optical programmable logic array (PLA)
Hiluf, Dawit
2018-03-01
A programmable logic array (PLA) is an integrated circuit (IC) logic device that can be reconfigured to implement various kinds of combinational logic circuits. The device has a number of AND and OR gates which are linked together to give output or further combined with more gates or logic circuits. This work presents the realization of PLAs via the physics of a three level system interacting with light. A programmable logic array is designed such that a number of different logical functions can be combined as a sum-of-product or product-of-sum form. We present an all optical PLAs with the aid of laser light and observables of quantum systems, where encoded information can be considered as memory chip. The dynamics of the physical system is investigated using Lie algebra approach.
5th World Congress of Paraconsistent Logic
Chakraborty, Mihir; Dutta, Soma
2015-01-01
The present book discusses all aspects of paraconsistent logic, including the latest findings, and its various systems. It includes papers by leading international researchers, which address the subject in many different ways: development of abstract paraconsistent systems and new theorems about them; studies of the connections between these systems and other non-classical logics, such as non-monotonic, many-valued, relevant, paracomplete and fuzzy logics; philosophical interpretations of these constructions; and applications to other sciences, in particular quantum physics and mathematics. Reasoning with contradictions is the challenge of paraconsistent logic. The book will be of interest to graduate students and researchers working in mathematical logic, computer science, philosophical logic, linguistics and physics.
Molecular processors: from qubits to fuzzy logic.
Gentili, Pier Luigi
2011-03-14
Single molecules or their assemblies are information processing devices. Herein it is demonstrated how it is possible to process different types of logic through molecules. As long as decoherent effects are maintained far away from a pure quantum mechanical system, quantum logic can be processed. If the collapse of superimposed or entangled wavefunctions is unavoidable, molecules can still be used to process either crisp (binary or multi-valued) or fuzzy logic. The way for implementing fuzzy inference engines is declared and it is supported by the examples of molecular fuzzy logic systems devised so far. Fuzzy logic is drawing attention in the field of artificial intelligence, because it models human reasoning quite well. This ability may be due to some structural analogies between a fuzzy logic system and the human nervous system. Copyright © 2011 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.
Trends in merged DRAM-logic computing
Gebis, Joseph
2000-11-01
Recent trends suggest that the current practice of fabricating DRAM and logic on separate dies and different processes should be reexamined. The gap between processing speed and memory latency is growing at 50% per year, and portable systems, where physical size and weight are critical issues, are becoming more popular. Merged DRAM-logic processes address these issues by combining DRAM and logic on a single die; this technology also promises to offer advantages such as increased memory bandwidth, reduced power consumption, and greater flexibility in memory organization. Merged DRAM-logic chips have already been successfully used in several commercial products. More commercial products are planned, and academic research projects are examining future uses of merged DRAM- logic processing. This paper describes the current state of merged DRAM-logic chips and examines proposed architectures, their performance and applications. Finally, tradeoffs and challenges related to the technology are discussed.
How Objects Shape Logics in Construction
DEFF Research Database (Denmark)
Tryggestad, Kjell; Georg, Susse
2011-01-01
The notion of institutional logics is a key tenet in institutional theory but few studies have attended to the micro‐foundations of logics. The sociology of associations is used to explore the micro‐foundations of logics, their emergence and temporal–spatial importance. A case study of the constr......The notion of institutional logics is a key tenet in institutional theory but few studies have attended to the micro‐foundations of logics. The sociology of associations is used to explore the micro‐foundations of logics, their emergence and temporal–spatial importance. A case study...... and identities as emergent and contingent outcomes of the material practices of building construction. The argument is concluded by considering the building construction as a materially mediated meaning structure....
Interdisciplinarity, logic of uncertainty and fuzzy logic in primary school
Directory of Open Access Journals (Sweden)
Luciana Delli Rocili
2015-12-01
Full Text Available On the occasion of the 120th anniversary of Mathesis, this work wants to be a memory, a tribute to two great presidents of Mathesis: Bruno de Finetti and Angelo Fadini. Both have pursued the idea of interdisciplinary teaching and research. Bruno de Finetti, with his books on The invention of truth, (1934, and on Logic and Intuitive Mathematics, (1959, and his very famous "Theory of probability", (1970, shows a rejection of formal education, comfortable, monodisciplinary, made of certainties, and chooses the impervious way of addressing the problems that are to the base of science. Angelo Fadini, with his papers and books on Theory of Fuzzy Sets, shows first in Italy several logical questions which puts as the basis for practical applications in Architecture. This paper is an attempt to experiment, in an interdisciplinary framework, the basic ideas of Bruno de Finetti and Angelo Fadini in primary school, in the belief that in the Primary School are formed ideas and intuitions, while in the secondary school the attention is focused mainly on specific issues of Mathematics. We shows some results of a still ongoing experimentation. Interdisciplinarietà, logica dell'incerto e logica sfumata nella scuola primaria In occasione dei 120 anni della Mathesis, questo lavoro vuole essere un ricordo, un omaggio a due grandi Presidenti della Mathesis: Bruno de Finetti e Angelo Fadini. Entrambi hanno portato avanti l’idea della interdisciplinarietà nell’insegnamento e nella ricerca. Bruno de Finetti, con la sua “Matematica Logico Intuitiva” del 1959, e la sua “Teoria delle probabilità”, del 1970, e ancora prima, con “L’invenzione della verità”, del 1934, mostra un rifiuto dell’insegnamento formale, comodo, monodisciplinare, fatto di certezze, e sceglie la strada impervia dell’affrontare i problemi che sono alla base della scienza. Angelo Fadini, con la sua Teoria degli Insiemi Sfocati, mostra per primo in Italia varie questioni
Analogical proportions: another logical view
Prade, Henri; Richard, Gilles
This paper investigates the logical formalization of a restricted form of analogical reasoning based on analogical proportions, i.e. statements of the form a is to b as c is to d. Starting from a naive set theoretic interpretation, we highlight the existence of two noticeable companion proportions: one states that a is to b the converse of what c is to d (reverse analogy), while the other called paralogical proportion expresses that what a and b have in common, c and d have it also. We identify the characteristic postulates of the three types of proportions and examine their consequences from an abstract viewpoint. We further study the properties of the set theoretic interpretation and of the Boolean logic interpretation, and we provide another light on the understanding of the role of permutations in the modeling of the three types of proportions. Finally, we address the use of these proportions as a basis for inference in a propositional setting, and relate it to more general schemes of analogical reasoning. The differences between analogy, reverse-analogy, and paralogy is still emphasized in a three-valued setting, which is also briefly presented.
Fuzzy Logic for Incidence Geometry
2016-01-01
The paper presents a mathematical framework for approximate geometric reasoning with extended objects in the context of Geography, in which all entities and their relationships are described by human language. These entities could be labelled by commonly used names of landmarks, water areas, and so forth. Unlike single points that are given in Cartesian coordinates, these geographic entities are extended in space and often loosely defined, but people easily perform spatial reasoning with extended geographic objects “as if they were points.” Unfortunately, up to date, geographic information systems (GIS) miss the capability of geometric reasoning with extended objects. The aim of the paper is to present a mathematical apparatus for approximate geometric reasoning with extended objects that is usable in GIS. In the paper we discuss the fuzzy logic (Aliev and Tserkovny, 2011) as a reasoning system for geometry of extended objects, as well as a basis for fuzzification of the axioms of incidence geometry. The same fuzzy logic was used for fuzzification of Euclid's first postulate. Fuzzy equivalence relation “extended lines sameness” is introduced. For its approximation we also utilize a fuzzy conditional inference, which is based on proposed fuzzy “degree of indiscernibility” and “discernibility measure” of extended points. PMID:27689133
Fuzzy logic based robotic controller
Attia, F.; Upadhyaya, M.
1994-01-01
Existing Proportional-Integral-Derivative (PID) robotic controllers rely on an inverse kinematic model to convert user-specified cartesian trajectory coordinates to joint variables. These joints experience friction, stiction, and gear backlash effects. Due to lack of proper linearization of these effects, modern control theory based on state space methods cannot provide adequate control for robotic systems. In the presence of loads, the dynamic behavior of robotic systems is complex and nonlinear, especially where mathematical modeling is evaluated for real-time operators. Fuzzy Logic Control is a fast emerging alternative to conventional control systems in situations where it may not be feasible to formulate an analytical model of the complex system. Fuzzy logic techniques track a user-defined trajectory without having the host computer to explicitly solve the nonlinear inverse kinematic equations. The goal is to provide a rule-based approach, which is closer to human reasoning. The approach used expresses end-point error, location of manipulator joints, and proximity to obstacles as fuzzy variables. The resulting decisions are based upon linguistic and non-numerical information. This paper presents a solution to the conventional robot controller which is independent of computationally intensive kinematic equations. Computer simulation results of this approach as obtained from software implementation are also discussed.
A Dynamic Logic for Learning Theory
DEFF Research Database (Denmark)
Baltag, Alexandru; Gierasimczuk, Nina; Özgün, Aybüke
2017-01-01
Building on previous work that bridged Formal Learning Theory and Dynamic Epistemic Logic in a topological setting, we introduce a Dynamic Logic for Learning Theory (DLLT), extending Subset Space Logics with dynamic observation modalities, as well as with a learning operator, which encodes...... the learner’s conjecture after observing a finite sequence of data. We completely axiomatise DLLT, study its expressivity and use it to characterise various notions of knowledge, belief, and learning. ...