A well-ingrained and recommended engineering practice in safety-critical software systems is to separate safety concerns from other aspects of the system. Along these lines, there have been calls for operating systems that implement ethical controls in an ethical layer separate from, and not amenable to tampering by, developers and modules in higher-level intelligence or cognition layers. There have been no implementations that demonstrate such a marshalling of ethical principles into an ethical layer. To address this, we present three (...) different tracks for implementing such systems, and offer a prototype implementation of the third track. We end by addressing objections to our approach. (shrink)

In this work, a virtual submerged floating operational system based on parallel and serial robotic platforms is proposed. The primary aim behind its development lies in carrying out simulated underwater manipulation experiments in an easier and safer way. This VSFOS is consisted of a six-degree-of-freedom parallel platform, an ABB serial manipulator, an inertial sensor, and a real-time industrial computer. The 6-DOF platform is used to simulate the movement of an underwater vehicle, whose attitude is measured by the inertial sensor. (...) The ABB manipulator, controlled by the real-time industrial computer, works as an operational tool to perform underwater manipulation tasks. In the control system architecture, software is developed to receive the data collected by the inertial sensor, to communicate and send instructions. Furthermore, the real-time status of the manipulator is displayed in this software. To validate the proposed system, two experiments have been conducted to test its performance. In the first experiment, the test is carried out to check the communication function of VSFOS, while in the second one, the manipulator is intended to follow the movement of the parallel platform and perform simulated operational task in the space. The obtained results from these two experiments show clearly the effectiveness and the performance of the proposed VSFOS. (shrink)

Pervasive, easy-to-use privacy services are keys to enabling users to maintain control of their private data in the online environment. This paper proposes (1) an online privacy lifecycle from the user perspective that drives and categorizes the development of these services, (2) a layered platform design solution for online privacy, (3) the evolution of the PeCAN (Personal Context Agent Networking) architecture to a platform for pervasively providing multiple contexts for user privacy preferences and online informational privacy services, and (4) use (...) of platform network effects for increasing wide-scale user adoption of privacy services. One implication of this paper’s concepts is that platform-mediated networks, which are reportedly the vehicles for most of the revenue earned by 60 of the world’s largest companies, and other platforms that commonly host millions of users, will not have to individually reinvent and manage sophisticated user services for privacy protection since universal privacy platforms can be layered on them in future. (shrink)

This paper is mainly concerned with proof-theoretic analysis of some second-order systems of explicit mathematics with a non-constructive minimum operator. By introducing axioms for variable types we extend our first-order theory BON to the elementary explicit type theory EET and add several forms of induction as well as axioms for μ. The principal results then state: EET plus set induction is proof-theoretically equivalent to Peano arithmetic PA <0).

Feferman, S. and G. Jäger, Systems of explicit mathematics with non-constructive μ-operator. Part I, Annals of Pure and Applied Logic 65 243-263. This paper is mainly concerned with the proof-theoretic analysis of systems of explicit mathematics with a non-constructive minimum operator. We start off from a basic theory BON of operators and numbers and add some principles of set and formula induction on the natural numbers as well as axioms for μ. The principal results then state: BON plus set induction (...) is proof-theoretically equivalent to Peano arithmetic PA; BON plus formula induction is proof-theoretically equivalent to the system <0 of second-order arithmetic. (shrink)

The aim of this article is to give the proof-theoretic analysis of various subsystems of Feferman's theory T1 for explicit mathematics which contain the non-constructive μ-operator and join. We make use of standard proof-theoretic techniques such as cut-elimination of appropriate semiformal systems and asymmetrical interpretations in standard structures for explicit mathematics.

The purpose of this article is to provide a multi-perspective examination of one of the most important contemporary security issues: weaponized, and especially lethal, artificial intelligence. This technology is increasingly associated with the approaching dramatic change in the nature of warfare. What becomes particularly important and evermore intensely contested is how it becomes embedded with and concurrently impacts two social structures: ethics and law. While there has not been a global regime banning this technology, regulatory attempts at establishing a ban (...) have intensified along with acts of resistance and blocking coalitions. This article aims to reflect on the prospects and limitations, as well as the ethical and legal intensity, of the emerging regulatory framework. To allow for such an investigation, a power-analytical approach to studying international security regimes is utilized. (shrink)

In the paper [8], the first author developped a topos- theoretic approach to reference and modality. (See also [5]). This approach leads naturally to modal operators on locales (or spaces without points). The aim of this paper is to develop the theory of such modal operators in the context of the theory of locales, to axiomatize the propositional modal logics arising in this context and to study completeness and decidability of the resulting systems.

In 1990, J.L. Krivine introduced the notion of storage operator to simulate 'call by value' in the 'call by name' strategy. J.L. Krivine has shown that, using Gödel translation of classical into intuitionitic logic, we can find a simple type for the storage operators in AF2 type system. This paper studies the $forall$-positive types (the universal second order quantifier appears positively in these types), and the Gödel transformations (a generalization of classical Gödel translation) of TTR type system. We (...) generalize, by using syntaxical methods, the J.L. Krivine's Theorem about these types and for these transformations. We give a proof of this result in the case of the type of recursive integers. (shrink)

. In this paper, the significance of using general logic-systems and finite consequence operators defined on non-organized languages is discussed. Results are established that show how properties of finite consequence operators are independent from language organization and that, in some cases, they depend only upon one simple language characteristic. For example, it is shown that there are infinitely many finite consequence operators defined on any non-organized infinite language L that cannot be generated from any finite logic-system. On the other (...) hand, it is shown that for any nonempty language L, a set map is a finite consequence operator if and only if it is defined by a general logic-system. Simple logic-system examples that determine specific consequence operator properties are given. (shrink)

Disaster response is a highly collaborative and critical process that requires the involvement of multiple emergency responders (ERs), ideally working together under a unified command, to enable a rapid and effective operational response. Following the 9/11 and 11/13 terrorist attacks and the devastation of hurricanes Katrina and Rita, it is apparent that inadequate communication and a lack of interoperability among the ERs engaged on-site can adversely affect disaster response efforts. Within this context, we present a scenario-based terrorism case study to (...) highlight the challenges of operational disaster command and response. In this article, which is based on the French emergency response doctrine, we outline a semantics-based common operational command system that is designed to guarantee an efficient information flow among ERs. Our focus is on offering to all ERs, a real-time operational picture of the situation in order to enable multilevel coordination among firefighters, police, healthcare units, public authorities, and other stakeholders. Our approach consolidates information to promote timely sharing of data among ERs. The proposed system is based on an ontology that has been developed to represent the different types of knowledge on the part of ERs, providing a shared vocabulary that covers a variety of interoperability concerns. (shrink)

This paper introduces the concept of Operator Contestability in AI systems: the principle that those overseeing AI systems (operators) must have the necessary control to be accountable for the decisions made by these algorithms. We argue that designers have a duty to ensure operator contestability. We demonstrate how this duty can be fulfilled by applying the'Design for Defeaters' framework, which provides strategies to embed tools within AI systems that enable operators to challenge decisions. Defeaters are designed to contest either the (...) justification for the AI’s data inputs (undercutting defeaters) or the validity of the conclusions drawn from that data (rebutting defeaters). To illustrate the necessity and application of this framework, we examine case studies such as AI-driven recruitment processes, where operators need tools and authority to uncover and address potential biases, and autonomous driving systems, where real-time decision-making is crucial. The paper argues that operator contestability requires ensuring that operators have (1) epistemic access to the relevant normative reasons and (2) the authority and cognitive capacity to act on these defeaters. By addressing these challenges, the paper emphasizes the importance of designing AI systems in a way that enables operators to effectively contest AI decisions, thereby ensuring that the appropriate individuals can take responsibility for the outcomes of human-AI interactions. (shrink)

The functional capabilities that consciousness seems to provide to biological systems can supply valuable principles in the design of more autonomous and robust technical systems. These functional concepts keep a notable similarity to those underlying the notion of operating system in software engineering, which allows us to specialize the computer metaphor for the mind into that of the operating system metaphor for consciousness. In this article, departing from these ideas and a model-based theoretical framework for cognition, (...) we present an architectural proposal for machine consciousness, called the Operative Mind. According to it, machine consciousness could be implemented as a set of services, in an operative system fashion, based on modeling of the own control architecture, that supervise the adequacy of the system architectural structure to the current objectives, triggering and managing adaptativity mechanisms. (shrink)

This book presents a systematic philosophical and historical analysis of operating systems (0S). The discussion starts with the evolution of OSs since before their birth. It continues with a comprehensive philosophical analysis grounded in technical aspects. Coverage looks at software and (where appropriate) hardware as well as their historical developments. The authors not only offer historical and philosophical reflections on operating systems. They also explore the programs they coordinate and trace the epsitemic and ontological consequences of their designs. (...) Each chapter investigates one or more overlapping fragments of this fascinating history. These include: the birth of the UNIX system and the development of early systems and prototypes; a conceptual analysis of the plurality of systems; an investigation into business, ethical, and aesthetics aspects related to operating systems; and logical principles of formal languages. This book will interest researchers from a diversity of backgrounds. It will appeal to historians, philosophers, as well as logicians and computer scientists who want to engage with topics relevant to the history and philosophy of programming and more specifically that of operating systems. (shrink)

This work adopts H. Kelsen’s concept of legal system, proposes a formal definition for such notion, and introduces an operational semantical framework for legal systems that are situated in agent societies. Agent societies are defined. Relevant formal properties of situated legal systems are discussed; the way they are exposed in the operational semantical framework is explained, and their truth formally proved. Also, for the sake of a better understanding of the legal-theoretic assumptions of the paper, recurring issues regarding Kelsen’s (...) theory of law are briefly reviewed. They are put in confrontation with the points of view of R. Dworkin, H. Hart, and J. Raz, and an attempt is made to clarify them from the perspective of the provided formalization. A brief case study in agent-based modeling and simulation of public policy processes is presented, as an illustration of the way of using situated legal systems, and the proposed operational semantical framework, in a practical application. (shrink)

If anyone deserves the title "father of social cognition," it is William J. McGuire who, along with his wife and colleague Claire V. McGuire, has written the ...

Sub-Saharan emerging countries experience electrical shortages resulting in power rationing, which ends up hampering economic activities. This paper proposes an approach for very short-term blackout forecast in grid-tied PV systems operating in low reliability weak electric grids of emerging countries. A pilot project was implemented in Arusha-Tanzania; it mainly comprised of a PV-inverter and a lead-acid battery bank connected to the local electricity utility company, Tanzania Electric Supply Company Limited. A very short-term power outage prediction model framework based on (...) a hybrid random forest algorithm was developed using open-source Python machine learning libraries and using a dataset generated from the pilot project’s experimental microgrid. Input data sampled at a 15-minute interval included day of the month, weekday, hour, supply voltage, utility line frequency, and previous days’ blackout profiles. The model was composed of an adaptive similar day module that predicts 15 minutes ahead from a sliding window lookup table spanning 2 weeks prior to the prediction target day, after which ASD prediction was fused with RF prediction, giving a final optimised RF-ASD blackout prediction model. Furthermore, the efficacy analysis of the short-term blackout prediction of the formulated RF, ASD, and RF-ASD regression and classification algorithms was compared. Considering the stochastic nature of blackouts, their performance was found to be fair in short-term blackout predictions of the test site’s weak grid using limited input data from the point of coupling of the user. The models developed were only able to predict blackouts if they occurred frequently and contiguously, but they performed poorly if they were sparse or dispersed. (shrink)

This paper proposes an extension of Chaitin's halting probability Ω to a measurement operator in an infinite dimensional quantum system. Chaitin's Ω is defined as the probability that the universal self-delimiting Turing machine U halts, and plays a central role in the development of algorithmic information theory. In the theory, there are two equivalent ways to define the program-size complexity H of a given finite binary string s. In the standard way, H is defined as the length of the (...) shortest input string for U to output s. In the other way, the so-called universal probability m is introduced first, and then H is defined as –log2m without reference to the concept of program-size.Mathematically, the statistics of outcomes in a quantum measurement are described by a positive operator-valued measure in the most general setting. Based on the theory of computability structures on a Banach space developed by Pour-El and Richards, we extend the universal probability to an analogue of POVM in an infinite dimensional quantum system, called a universal semi-POVM. We also give another characterization of Chaitin's Ω numbers by universal probabilities. Then, based on this characterization, we propose to define an extension of Ω as a sum of the POVM elements of a universal semi-POVM. The validity of this definition is discussed.In what follows, we introduce an operator version equation image of H in a Hilbert space of infinite dimension using a universal semi-POVM, and study its properties. (shrink)

Following the idea of L -fuzzy generalized neighborhood systems as introduced by Zhao et al., we will give the join-complete lattice structures of lower and upper approximation operators based on L -fuzzy generalized neighborhood systems. In particular, as special approximation operators based on L -fuzzy generalized neighborhood systems, we will give the complete lattice structures of lower and upper approximation operators based on L -fuzzy relations. Furthermore, if L satisfies the double negative law, then there exists an order isomorphic mapping (...) between upper and lower approximation operators based on L -fuzzy generalized neighborhood systems; when L -fuzzy generalized neighborhood system is serial, reflexive, and transitive, there still exists an order isomorphic mapping between upper and lower approximation operators, respectively, and both lower and upper approximation operators based on L -fuzzy relations are complete lattice isomorphism. (shrink)

The research aims to identify the impact of the management requirements on operating of computerized management information systems to improve performance, and discuss the perceptions of respondents to develop the performance of employees in the Gaza Electricity Distribution Company, the researchers used the stratified sample method, (360) questionnaires were distributed on the study sample, (306) questionnaires were recoved with a percentage of (85%). The most important findings of the study: computerized MI have a positive impact on the development of (...) performance in the Gaza Electricity Distribution Company systems. The is statistical significance impact between “the physical, software supplies, human and organizational” requirements for the management and operation of computerized management information systems and performance development in the Gaza Electricity Distribution Company. -/- The research also concluded a series of recommendations: the need to strengthen the company's management interest in the use of computerized management information systems in all its components and elements of being an important variable which contributes to the effect on performance development. It's essential that we develop the infrastructure for information technology in general, and computerized management information systems, in particular for the development of performance. Increased interest in providing the material of equipment and devices used in the computerized management information system requirements. Interest in providing technical inputs to the computerized management information systems through keeping pace with technological means and modern techniques and work on the training of personnel to use those systems. And increased attention to human inputs of computerized management information systems "specialists technicians and end-users" through a variety of disciplines working in the field of computerized management information systems. (shrink)

Internet of thing building sensors can capture several types of building operations, performances, and conditions and send them to a central dashboard to analyze data to support decision-making. Traditionally, laptops and cell phones are the majority of Internet-connected devices. IoT tracking allows customers to close the distance between devices and enterprises by collecting and analyzing various IoT data through connected devices, customers, and applications on the network. There is a lack of requirements for IoT edge applications security and approval. There (...) are no best practices regarding operations focused on IoT incidents. IoT elements are not covered by audit and logging requirements. In this article, a big data analytics-based customer operation system analyzes the operation. With the exponential rise in data usage, the explosive development in the IoT devices reflects the ideal overlap of big data growth with IoT. Big data analytics continuously evolving network raises trivial questions about the performance, distribution of data, analysis, and protection of data collection. IoT modifies almost all the construction industry characteristics. Human-centered artificial intelligence is described as systems that always improve because of human input while also delivering an effective experience between the human and the robotic. The IoT is the key factor that ensures greater building performance. It was the first evolution of technology in a long time to turn genuine inventions into an industry that depended heavily on paper and manual processes. The benefits of the IoT in construction are now quite obviously much heavier than those of current manual processes. As a result, more construction companies explore and incorporate IoT strategies to address their productivity challenges, increasing efficiencies and profits. The simulation analysis shows that the proposed BDA-CO model enhances the trust score of 98.5%, accuracy detection ratio of 93.4%, probability ratio of 97.6%, and security ratio of 98.7% and reduces the false negative ratio of 21.3%, response time of 10.5%, delay rate of 19.9%, and packet loss ratio of 15.4% when compared to other existing techniques. (shrink)

We study vertex operators in 4D conformal field theory derived from quantized gravity, whose dynamics is governed by the Wess-Zumino action by Riegert and the Weyl action. Conformal symmetry is equal to diffeomorphism symmetry in the ultraviolet limit, which mixes positive-metric and negative-metric modes of the gravitational field and thus these modes cannot be treated separately in physical operators. In this paper, we construct gravitational vertex operators such as the Ricci scalar, defined as space-time volume integrals of them are invariant (...) under conformal transformations. Short distance singularities of these operator products are computed and it is shown that their coefficients have physically correct signs. Furthermore, we show that conformal algebra holds even in the system perturbed by the cosmological constant vertex operator as in the case of the Liouville theory shown by Curtright and Thorn. (shrink)

The aim of this paper is to give one kind of internal proportional systems with general representation and without closure and finiteness assumptions. First, we introduce the notions of internal proportional system and of general representation. Second, we briefly review the existing results which motivate our generalization. Third, we present the new systems, characterized by the fact that the linear order induced by the comparison weak order ≥ at the level of equivalence classes is also a weIl order. We (...) prove the corresponding representation theorem and make some comments on strong limitations of uniqueness; we present in an informal way a positive result, restricted uniqueness for what we call connected objects. We conclude with some final remarks on the property that characterizes these systems and on three possible empirical applications. (shrink)

Different cultures, different lenses -- Various approaches to risk in the legal system -- Institutional background -- Regulation -- Tort law generally -- Information about risk and assumption of risk -- Medical malocurrences -- The duty/proximite cause problem -- Scientific evidence -- Tort reform -- Statutory compensation systems.

We consider an extension of Gödel logic by a unary operator that enables the addition of non-negative reals to truth-values. Although its propositional fragment has a simple proof system, first-order validity is Π2-hard. We explain the close connection to Scarpellini’s result on Π2-hardness of Łukasiewicz’s logic.

This article describes the phenomenon of knowledge building in online environments. Knowledge building is a process within a community, which leads to the development of knowledge. In order to analyze this process, we will look into the ways in which individuals interact with the collective as a whole. For this purpose, the psychic and social systems, which are involved here are regarded as meaning-based systems in the sense of Luhmann’s systems theory—open to the environment, but operatively closed. The respective modes (...) of operation of psychic and social systems will be examined, and “structural coupling” between these systems described. Another characteristic of knowledge-building communities is self-organization, which is described here in the sense of autopoiesis. A pivotal task, which knowledge-building communities have to tackle, is to handle complexity and reach common understanding. These aspects will also be described using conceptualizations of Luhmann’s systems theory, illustrated by many examples. (shrink)

The emergence of an autocatalytic network from an available set of elements is a fundamental step in early evolutionary processes, such as the origin of metabolism. Given the set of elements, the reactions between them (chemical or otherwise), and with various elements catalysing certain reactions, a Reflexively Autocatalytic F-generated (RAF) set is a subset R′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$'$$\end{document} of reactions that is self-generating from a given food set, and with each reaction in R′\documentclass[12pt]{minimal} \usepackage{amsmath} (...) \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$'$$\end{document} being catalysed from within R′\documentclass[12pt]{minimal} \usepackage{amsmath} \usepackage{wasysym} \usepackage{amsfonts} \usepackage{amssymb} \usepackage{amsbsy} \usepackage{mathrsfs} \usepackage{upgreek} \setlength{\oddsidemargin}{-69pt} \begin{document}$$'$$\end{document}. RAF theory has been applied to various phenomena in theoretical biology, and a key feature of the approach is that it is possible to efficiently identify and classify RAFs within large systems. This is possible because RAFs can be described as the (nonempty) subsets of the reactions that are the fixed points of an (efficiently computable) interior map that operates on subsets of reactions. Although the main generic results concerning RAFs can be derived using just this property, we show that for systems with at least 12 reactions there are generic results concerning RAFs that cannot be proven using the interior operator property alone. (shrink)

Bd. 1. System des menschlichen Erkennens -- Bd. 2. Die stammesgeschichtliche Entwicklung des menschlichen Sprechens -- Bd. 3. Die Entwicklung der Operation "Messen" -- Bd. 4. Die Evolution der instrumentellen Wahrnehmung -- Bd. 5. Die Genesis des schlussfolgernden Denkens -- Bd. 6. Die evolutionären Stufen der Analyse (des Scheidens und Unterscheidens) -- Bd. 7. Das Werden des Vorstellens (Geistes) -- Bd. 8. Die Mechanisierung und Automation der erkennenden Akte und Operationen -- Bd. 9. Die Entstehung des beziehenden Denkens -- (...) Bd. 10. Der phylogenetische Weg der Zeichengebung (Entwicklung der Elemente der Verständigung) -- Bd. 11. Der Irrtum -- Bd. 12. Kritik der Erkenntnislehre des transzendentalen Idealismus Immanuel Kants. (shrink)