Relevant bibliographies by topics / Summary or Arbitrary Executions

Academic literature on the topic 'Summary or Arbitrary Executions'

Author: Grafiati
Published: 25 July 2024
Last updated: 28 July 2024

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Contents

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Summary or Arbitrary Executions.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Summary or Arbitrary Executions"

1

Weissbrodt, David. "The Three “Theme” Special Rapporteurs of the UN Commission on Human Rights." American Journal of International Law 80, no. 3 (July 1986): 685–99. http://dx.doi.org/10.2307/2201794.

Full text
Abstract:
In March 1982, the United Nations Commission on Human Rights initiated the appointment of a Special Rapporteur on Summary or Arbitrary Executions. The Special Rapporteur on Summary or Arbitrary Executions has done far more than merely study that grave human rights problem; he has received complaints about impending and past executions, issued appeals to governments about threatened executions and the need to investigate past killings, and reported publicly on much of his activity. The Commission on Human Rights not only has renewed the Special Rapporteur on Summary or Arbitrary Executions in its subsequent annual sessions, but has followed this precedent by appointing in 1985 a similar Special Rapporteur on Torture and in 1986 a Special Rapporteur on Intolerance and Discrimination Based on Religion or Belief.
APA, Harvard, Vancouver, ISO, and other styles
2

Rodley, Nigel S. "United Nations Action Procedures against "Disappearances," Summary or Arbitrary Executions, and Torture." Human Rights Quarterly 8, no. 4 (November 1986): 700. http://dx.doi.org/10.2307/762199.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

O'Donnell, Daniel. "Trends in the application of international humanitarian law by United Nations human rights mechanisms." International Review of the Red Cross 38, no. 324 (September 1998): 481–503. http://dx.doi.org/10.1017/s0020860400091282.

Full text
Abstract:
UN human rights mechanisms continue to proliferate, producing numerous decisions and voluminous reports. This article reviews the ways in which such mechanisms apply international humanitarian law, including the law of Geneva and the law of The Hague. In doing so, it focuses mainly on the practice of the rapporteurs appointed by the UN Commission on Human Rights to investigate the human rights situations in specific countries and on that of the thematic rapporteurs and working groups which the Commission has entrusted with monitoring specific types of serious human rights violations wherever they occur, in particular the Special Rapporteur on Extrajudicial, Summary or Arbitrary Executions and the Representative of the Secretary-General on Internally Displaced Persons, whose mandates most often lead them to examine abuses occurring in the context of armed conflicts. Reference is also made to two innovative mechanisms which functioned in El Salvador: the first UN-sponsored “truth commission” and the first human rights monitoring body established as part of a comprehensive mechanism for monitoring compliance with a UN-sponsored peace agreement. Certain observations made by treaty monitoring bodies are also mentioned.
APA, Harvard, Vancouver, ISO, and other styles
4

Dergachev, A., and A. Sidorin. "Summary-based method of implementing arbitrary context-sensitive checks for source-based analysis via symbolic execution." Proceedings of the Institute for System Programming of the RAS 28, no. 1 (2016): 41–62. http://dx.doi.org/10.15514/ispras-2016-28(1)-3.

Full text
APA, Harvard, Vancouver, ISO, and other styles
5

Ivanov, Ievgen, Mykola Nikitchenko, and Uri Abraham. "Event-Based Proof of the Mutual Exclusion Property of Peterson’s Algorithm." Formalized Mathematics 23, no. 4 (December 1, 2015): 325–31. http://dx.doi.org/10.1515/forma-2015-0026.

Full text
Abstract:
Summary Proving properties of distributed algorithms is still a highly challenging problem and various approaches that have been proposed to tackle it [1] can be roughly divided into state-based and event-based proofs. Informally speaking, state-based approaches define the behavior of a distributed algorithm as a set of sequences of memory states during its executions, while event-based approaches treat the behaviors by means of events which are produced by the executions of an algorithm. Of course, combined approaches are also possible. Analysis of the literature [1], [7], [12], [9], [13], [14], [15] shows that state-based approaches are more widely used than event-based approaches for proving properties of algorithms, and the difficulties in the event-based approach are often emphasized. We believe, however, that there is a certain naturalness and intuitive content in event-based proofs of correctness of distributed algorithms that makes this approach worthwhile. Besides, state-based proofs of correctness of distributed algorithms are usually applicable only to discrete-time models of distributed systems and cannot be easily adapted to the continuous time case which is important in the domain of cyber-physical systems. On the other hand, event-based proofs can be readily applied to continuous-time / hybrid models of distributed systems. In the paper [2] we presented a compositional approach to reasoning about behavior of distributed systems in terms of events. Compositionality here means (informally) that semantics and properties of a program is determined by semantics of processes and process communication mechanisms. We demonstrated the proposed approach on a proof of the mutual exclusion property of the Peterson’s algorithm [11]. We have also demonstrated an application of this approach for proving the mutual exclusion property in the setting of continuous-time models of cyber-physical systems in [8]. Using Mizar [3], in this paper we give a formal proof of the mutual exclusion property of the Peterson’s algorithm in Mizar on the basis of the event-based approach proposed in [2]. Firstly, we define an event-based model of a shared-memory distributed system as a multi-sorted algebraic structure in which sorts are events, processes, locations (i.e. addresses in the shared memory), traces (of the system). The operations of this structure include a binary precedence relation ⩽ on the set of events which turns it into a linear preorder (events are considered simultaneous, if e1 ⩽ e2 and e2 ⩽ e1), special predicates which check if an event occurs in a given process or trace, predicates which check if an event causes the system to read from or write to a given memory location, and a special partial function “val of” on events which gives the value associated with a memory read or write event (i.e. a value which is written or is read in this event) [2]. Then we define several natural consistency requirements (axioms) for this structure which must hold in every distributed system, e.g. each event occurs in some process, etc. (details are given in [2]). After this we formulate and prove the main theorem about the mutual exclusion property of the Peterson’s algorithm in an arbitrary consistent algebraic structure of events. Informally, the main theorem states that if a system consists of two processes, and in some trace there occur two events e1 and e2 in different processes and each of these events is preceded by a series of three special events (in the same process) guaranteed by execution of the Peterson’s algorithm (setting the flag of the current process, writing the identifier of the opposite process to the “turn” shared variable, and reading zero from the flag of the opposite process or reading the identifier of the current process from the “turn” variable), and moreover, if neither process writes to the flag of the opposite process or writes its own identifier to the “turn” variable, then either the events e1 and e2 coincide, or they are not simultaneous (mutual exclusion property).
APA, Harvard, Vancouver, ISO, and other styles
6

HADDIX, F. FURMAN. "AN ORDER DEGREE ALTERNATOR FOR ARBITRARY TOPOLOGIES." Parallel Processing Letters 18, no. 02 (June 2008): 307–22. http://dx.doi.org/10.1142/s0129626408003405.

Full text
Abstract:
An alternator is an arbitrary set of interacting processes that satisfies three conditions. First, if a process executes its critical section, then no neighbor of that process can execute its critical section at the same state. Second, along any infinite sequence of system states, each process will execute its critical section, an infinite number of times. Third, along any maximally concurrent computation, the alternator will stabilize to a sequence of states in which the processes will execute their critical sections in alternation. A principal reason for interest in alternators is their ability to transform systems correct under serial execution semantics to systems that are correct under concurrent execution semantics. An earlier alternator for arbitrary topology required 2q states where q is the dependency graph circumference and after stabilization would wait 2q steps between critical section executions. In a synchronous environment, this alternator requires only 2d+1 states where d is the degree of the graph of process dependencies for the system and after stabilization will require a wait of 2d+1 steps between critical section executions. In an asynchronous environment, the synchronization properties of this alternator must be supplemented with an asynchronous unison algorithm. The asynchronous unison algorithm requires expansion of the required number of states to dt, where t is the longest chordless cycle in the dependency graph; however, the required wait between critical section executions remains O(d).
APA, Harvard, Vancouver, ISO, and other styles
7

Dardinier, Thibault, and Peter Müller. "Hyper Hoare Logic: (Dis-)Proving Program Hyperproperties." Proceedings of the ACM on Programming Languages 8, PLDI (June 20, 2024): 1485–509. http://dx.doi.org/10.1145/3656437.

Full text
Abstract:
Hoare logics are proof systems that allow one to formally establish properties of computer programs. Traditional Hoare logics prove properties of individual program executions (such as functional correctness). Hoare logic has been generalized to prove also properties of multiple executions of a program (so-called hyperproperties, such as determinism or non-interference). These program logics prove the absence of (bad combinations of) executions. On the other hand, program logics similar to Hoare logic have been proposed to disprove program properties (e.g., Incorrectness Logic), by proving the existence of (bad combinations of) executions. All of these logics have in common that they specify program properties using assertions over a fixed number of states, for instance, a single pre- and post-state for functional properties or pairs of pre- and post-states for non-interference. In this paper, we present Hyper Hoare Logic, a generalization of Hoare logic that lifts assertions to properties of arbitrary sets of states. The resulting logic is simple yet expressive: its judgments can express arbitrary program hyperproperties, a particular class of hyperproperties over the set of terminating executions of a program (including properties of individual program executions). By allowing assertions to reason about sets of states, Hyper Hoare Logic can reason about both the absence and the existence of (combinations of) executions, and, thereby, supports both proving and disproving program (hyper-)properties within the same logic, including (hyper-)properties that no existing Hoare logic can express. We prove that Hyper Hoare Logic is sound and complete, and demonstrate that it captures important proof principles naturally. All our technical results have been proved in Isabelle/HOL.
APA, Harvard, Vancouver, ISO, and other styles
8

Morse, Gregory. "Self-Spectre, Write-Execute and the Hidden State." Tatra Mountains Mathematical Publications 73, no. 1 (August 1, 2019): 131–44. http://dx.doi.org/10.2478/tmmp-2019-0010.

Full text
Abstract:
Abstract The recent Meltdown and Spectre vulnerabilities have highlighted a very present and real threat in the on-chip memory cache units which can ultimately provide a hidden state, albeit only readable via memory timing instructions [Kocher, P.—Genkin, D.— Gruss, D.— Haas, W.—Hamburg, M.—Lipp, M.–Mangard, S.—Prescher, T.—Schwarz, M.—Yarom, Y.: Spectre attacks: Exploiting speculative execution, CoRR, abs/1801.01203, 2018]. Yet the exploits, although having some complexity and slowness, are demonstrably reliable on nearly all processors produced for the last two decades. Moving out from looking at this strictly as a means of reading protected memory, as the large microprocessor companies move to close this security vulnerability, an interesting question arises. Could the inherent design of the processor give the ability to hide arbitrary calculations in this speculative and parallel side channel? Without even using protected memory and exploiting the vulnerability, as has been the focus, there could very well be a whole class of techniques which exploit the side-channel. It could be done in a way which would be largely un-preventable behavior as the technology would start to become self-defeating or require a more complicated and expensive on-chip cache memory system to properly post-speculatively clean itself. And the ability to train the branch predictor to incorrectly speculatively behave is almost certain given hardware limitations, andthusprovidesexactly this pathway. A novel approach looks at just how much computation can be done speculatively with a result store via indirect reads and available through the memory cache. A multi-threaded approach can allow a multi-stage computation pipeline where each computation is passed to a read-out thread and then to the next computation thread [Swanson, S.—McDowell, L. K.—Swift, M. M.—Eggers, S. J.–Levy H. M.: An evaluation of speculative instruction execution on simultaneous multithreaded processors, ACM Trans. Comput. Syst. 21 (2003), 314–340]. Through channels like this, an application can surreptitiously make arbitrary calculations, or even leak data without any standard tracing tools being capable of monitoring the subtle changes. Like a variation of the famous physics Heisenberg uncertainty principle, even a tool capable of reading the cache states would not only be incredibly inefficient, but thereby tamper with and modify the state. Tools like in-circuit emulators, or specially designed cache emulators would be needed to unmask the speculative reads, and it is further difficult to visualize with a linear time-line. Specifically, the AES and RSA algorithms will be studied with respect to these ideas, looking at success rates for various calculation batches with speculative execution, while having a summary view to see the rather severe performance penalties for using such methods. Either approaches could provide for strong white-box cryptography when considering a binary, non-source code form. In terms of white-box methods, both could be significantly challenging to locate or deduce the inner workings of the code. Further, both methods can easily surreptitiously leak or hide data within shared memory in a seemingly innocuous manner.
APA, Harvard, Vancouver, ISO, and other styles
9

Herlihy, Maurice, Sergio Rajsbaum, Michel Raynal, and Julien Stainer. "From wait-free to arbitrary concurrent solo executions in colorless distributed computing." Theoretical Computer Science 683 (June 2017): 1–21. http://dx.doi.org/10.1016/j.tcs.2017.04.007.

Full text
APA, Harvard, Vancouver, ISO, and other styles
10

Gomes Júnior, Paulo César de Carvalho. "The anti-juridicidity and the incoherence of Summary no. 345 of the STJ." CONTRIBUCIONES A LAS CIENCIAS SOCIALES 17, no. 2 (February 14, 2024): e5050. http://dx.doi.org/10.55905/revconv.17n.2-074.

Full text
Abstract:
The article elucidates some of the issues surrounding the payment of succumbence fees as a result of enforcements of judgments and their challenges, especially when the enforcements are brought against the public treasury. Initially, he presents how these issues were dealt with in executions of individual judgments against private parties governed by the CPC/1973 and how they are now dealt with in executions of individual judgments against private parties governed by the CPC/2015. It then presents how these issues are dealt with in the enforcement of individual judgments against the public treasury. It then presents how these issues are dealt with in individual enforcement of collective judgments against the public treasury. It concludes that Precedent No. 345 of the STJ is unlawful and inconsistent with other precedents of the STJ itself, with precedents of the STF and with the legal order as a whole. It should therefore be revoked or revised.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Books on the topic "Summary or Arbitrary Executions"

1

Rights, United Nations Centre for Human. Summary or arbitrary executions. New York: Centre for Human Rights, United Nations, 1990.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
2

United Nations Centre for Human Rights. Extrajudicial, summary or arbitrary executions. New York: Centre for Human Rights, United Nations, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
3

United Nations Centre for Human Rights. Extrajudicial, summary or arbitrary executions. Geneva: United Nations, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
4

United Nations. Centre for Human Rights., ed. Extrajudicial, summary or arbitrary executions. Geneva: United Nations Centre for Human Rights, 1997.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
5

United Nations. Special Rapporteur on Extrajudicial, Summary, or Arbitrary Executions. Evidence of extrajudicial, summary, or arbitrary executions in Africa. The Gambia, West Africa: African Centre for Democracy and Human Rights Studies, 1994.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
6

Centre for Social Development and Humanitarian Affairs (United Nations)., ed. Manual on the effective prevention and investigation of extra-legal, arbitrary and summary executions. New York: United Nations, 1991.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
7

Philip, Alston, Brazil, and United Nations Human Rights Council, eds. Report of the Special Rapporteur on extrajudicial, summary or arbitrary executions: Addendum : follow-up country recommendations - Brazil. Geneva ; New York ; Vienna: United Nations General Assembly, 2010.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
8

UN. Commission on Human Rights. Special Rapporteur on Extrajudicial, Summary or Arbitrary Executions, ed. Extrajudicial, summary or arbitrary executions: Report of the Special Rapporteur, Philip Alston : addendum. Geneva: UN, 2006.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
9

Onyema, Faith, and Chino Obiagwu. Impunity in Nigeria 2006-2007: Report of extra-judicial, arbitrary and summary executions in Nigeria : January-December 2006-2007. Edited by Legal Defence and Assistance Project (Nigeria). Lagos, Nigeria: Legal Defence and Assistance Project (LEPAD), 2008.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
10

USA, Amnesty International, ed. People's Republic of China: Preliminary findings on killings of unarmed civilians : arbitrary arrests and summary executions since June 3, 1989. New York, N.Y: Amnesty International USA, 1989.

Find full text
APA, Harvard, Vancouver, ISO, and other styles
More sources

Book chapters on the topic "Summary or Arbitrary Executions"

1

Tidball-Binz, Morris. "The value and need for incorporating a psychosocial approach to forensic case-work in cases of extrajudicial, summary or arbitrary executions, including those who do not survive enforced and involuntary disappearances 1." In Psychoanalytic, Psychosocial, and Human Rights Perspectives on Enforced Disappearance, 96–112. London: Routledge, 2023. http://dx.doi.org/10.4324/9781003312642-9.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Sun, Dawei, and Sayan Mitra. "NeuReach: Learning Reachability Functions from Simulations." In Tools and Algorithms for the Construction and Analysis of Systems, 322–37. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-99524-9_17.

Full text
Abstract:
AbstractWe present , a tool that uses neural networks for predicting reachable sets from executions of a dynamical system. Unlike existing reachability tools, computes a reachability function that outputs an accurate over-approximation of the reachable set for any initial set in a parameterized family. Such reachability functions are useful for online monitoring, verification, and safe planning. implements empirical risk minimization for learning reachability functions. We discuss the design rationale behind the optimization problem and establish that the computed output is probably approximately correct. Our experimental evaluations over a variety of systems show promise. can learn accurate reachability functions for complex nonlinear systems, including some that are beyond existing methods. From a learned reachability function, arbitrary reachtubes can be computed in milliseconds. is available at https://github.com/sundw2014/NeuReach.
APA, Harvard, Vancouver, ISO, and other styles
3

Gleitze, Joshua, Heiko Klare, and Erik Burger. "Finding a Universal Execution Strategy for Model Transformation Networks." In Fundamental Approaches to Software Engineering, 87–107. Cham: Springer International Publishing, 2021. http://dx.doi.org/10.1007/978-3-030-71500-7_5.

Full text
Abstract:
AbstractWhen using multiple models to describe a (software) system, one can use a network of model transformations to keep the models consistent after changes. No strategy exists, however, to orchestrate the execution of transformations if the network has an arbitrary topology. In this paper, we analyse how often and in which order transformations need to be executed. We argue why linear execution bounds are too restrictive to be useful in practice and prove that there is no upper bound for the number of necessary executions. To avoid non-termination, we propose a conservative strategy that makes execution failures easier to understand. These insights help developers and users of transformation networks to understand under which circumstances their networks can terminate. Additionally, the proposed strategy helps them to find the cause when a network cannot restore consistency.
APA, Harvard, Vancouver, ISO, and other styles
4

Derakhshan, Farzaneh, Myra Dotzel, Milijana Surbatovich, and Limin Jia. "Modal Crash Types for Intermittent Computing." In Programming Languages and Systems, 168–96. Cham: Springer Nature Switzerland, 2023. http://dx.doi.org/10.1007/978-3-031-30044-8_7.

Full text
Abstract:
AbstractIntermittent computing is gaining traction in application domains such as Energy Harvesting Devices (EHDs) that experience arbitrary power failures during program execution. To make progress, programs require system support to checkpoint state and re-execute after power failure by restoring the last saved state. This re-execution should be correct, i.e., simulated by a continuously-powered execution. We study the logical underpinning of intermittent computing and model checkpoint, crash, restore, and re-execution operations as computation on Crash types. We draw inspiration from adjoint logic and define Crash types by introducing two adjoint modality operators to model persistent and transient memory values of partial (re-)executions and the transitions between them caused by checkpoints and restoration. We define a Crash type system for a core calculus. We prove the correctness of intermittent systems by defining a novel logical relation for Crash types.
APA, Harvard, Vancouver, ISO, and other styles
5

Whalen, Christian. "Article 37: Prohibition of Torture, Capital Punishment, and Arbitrary Deprivation of Liberty." In Monitoring State Compliance with the UN Convention on the Rights of the Child, 303–11. Cham: Springer International Publishing, 2022. http://dx.doi.org/10.1007/978-3-030-84647-3_31.

Full text
Abstract:
AbstractArticle 37 is inspired by the provisions of the International Covenant on Civil and Political Rights (ICCPR). However, it extends the ICCPR’s provisions to the protection of the children by: (1) imposing the prohibition of life imprisonment for children without the possibility of release; (2) demanding that detention of a child shall be used as a measure of last resort and be imposed for the shortest period of time; and (3) providing to children deprived of liberty the right to maintain contacts with their family members. Article 37 imposes a child-centred understanding of its provisions and rights. These rights extend beyond the ambit of child justice administration to all situations where children may be deprived of liberty, including, for example, child protection settings, health care settings, and immigration settings. This chapter analyses Article 37 rights in accordance with four essential attributes, as enumerated in its four constituent paragraphs: (1) the prohibition in paragraph (a) on torture or ill-treatment, specifically ruling out capital punishment and life imprisonment without parole for minors; (2) the prohibition in paragraph (b) of unlawful and arbitrary deprivations of liberty, insisting that such sanctions are a measure of last resort that must only be imposed for the shortest appropriate period; (3) the limitations on the deprivation of liberty, including the core commitment in paragraph (c) to upholding the child’s inherent dignity and right to be treated with humanity in such circumstances; and (4) the right, in paragraph (d), to minimal due process guarantees which must accompany any child’s deprivation of liberty. While youth criminal justice practice varies greatly from state to state, Articles 37 and 40 have emerged as a codification of global standards set out in the Beijing Rules and a summary prompt to the adoption of guidelines and minimum rules for the protection of children deprived of liberty and the prevention of youth crime. Article 37 should therefore be applied consistently with the recent General Comment no. 24 (2019) on Children’s Rights in the Child Justice System.
APA, Harvard, Vancouver, ISO, and other styles
6

Melander, Göran, and Gudmundur Alfredsson. "Effective Prevention and Investigation of Extra-legal, Arbitrary and Summary Executions." In The Raoul Wallenberg Institute Compilation of Human Rights Instruments, 569–72. Brill | Nijhoff, 1997. http://dx.doi.org/10.1163/9789004636484_072.

Full text
APA, Harvard, Vancouver, ISO, and other styles
7

Philip, Alston. "Report of the Special Rapporteur on extra judicial, summary or arbitrary executions." In Challenges in International Human Rights Law, 205–33. Routledge, 2017. http://dx.doi.org/10.4324/9781315095905-7.

Full text
APA, Harvard, Vancouver, ISO, and other styles
8

"Principles on the Effective Prevention and Investigation of Extra-legal, Arbitrary and Summary Executions." In Essential Texts on Human Rights for the Police, 293–97. Brill | Nijhoff, 2001. http://dx.doi.org/10.1163/9789004502840_025.

Full text
APA, Harvard, Vancouver, ISO, and other styles
9

Aston, Joshua N. "Response of India towards Torture and Custodial Violence." In Torture Behind Bars, 81–149. Oxford University Press, 2020. http://dx.doi.org/10.1093/oso/9780190120986.003.0005.

Full text
Abstract:
The chapter deals with the legal framework in India against torture and custodial violence and the response and role of the Indian police force in such crimes. It also gives statistical data on violence taking place in the country at the hands of the police and armed forces. It provides a summary of the report of the United Nations Special Rapporteur on arbitrary and extra-judicial executions. The chapter also discusses the right to protection against torture and the views and verdicts of the Supreme Court of India, and highlights the role of statutory bodies and commissions such as the Law Commission of India and the National Police Commission in preventing torture and custodial violence. Therefore, this chapter has reference to several laws of the country and the Constitution of India and its provisions, and it cites some cases and Supreme Court rulings for preventing torture and custodial violence, which provides India’s response towards the prevention of torture and custodial violence and protecting victims as well as every citizen from such crimes.
APA, Harvard, Vancouver, ISO, and other styles
10

Chengeta, Thompson. "Autonomous Armed Drones and the Challenges to Multilateral Consensus on Value-Based Regulation." In Ethics of Drone Strikes, 170–89. Edinburgh University Press, 2021. http://dx.doi.org/10.3366/edinburgh/9781474483575.003.0010.

Full text
Abstract:
This chapter explores ethical challenges potentially arising from AI-controlled drones, focusing on how their use might be restrained through international legal regulation. The starting point is the 2013 recommendation of a moratorium on the production of lethal autonomous weapon systems (LAWS) to the United Nations (UN) Human Rights Council by its Special Rapporteur on extrajudicial, summary or arbitrary executions. The response by UN member states to this recommendation was to resolve that relevant discussions should occur within the framework of the UN Convention on Certain Conventional Weapons (CCW). However, the critical problem identified in this chapter is that the introduction of CCW-based regulation requires consensus among all the treaty’s members. Thus, to achieve principled and legally-binding restraints on the use of autonomous armed drones, scholars and policy practitioners need to confront a set of challenges to multilateral consensus. These challenges include: threats to multilateralism in arms-control generally; ongoing concerns about a military AI arms race; anti-activist sentiments and ‘banphobia’ among arms-control diplomats; and differing international understandings of what moral values are applicable to the deployment of autonomous weapons systems.
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Summary or Arbitrary Executions"

1

Bhattacharjya, Debarun, Oktie Hassanzadeh, Ronny Luss, and Keerthiram Murugesan. "Probabilistic Rule Induction from Event Sequences with Logical Summary Markov Models." In Thirty-Second International Joint Conference on Artificial Intelligence {IJCAI-23}. California: International Joint Conferences on Artificial Intelligence Organization, 2023. http://dx.doi.org/10.24963/ijcai.2023/629.

Full text
Abstract:
Event sequences are widely available across application domains and there is a long history of models for representing and analyzing such datasets. Summary Markov models are a recent addition to the literature that help identify the subset of event types that influence event types of interest to a user. In this paper, we introduce logical summary Markov models, which are a family of models for event sequences that enable interpretable predictions through logical rules that relate historical predicates to the probability of observing an event type at any arbitrary position in the sequence. We illustrate their connection to prior parametric summary Markov models as well as probabilistic logic programs, and propose new models from this family along with efficient greedy search algorithms for learning them from data. The proposed models outperform relevant baselines on most datasets in an empirical investigation on a probabilistic prediction task. We also compare the number of influencers that various logical summary Markov models learn on real-world datasets, and conduct a brief exploratory qualitative study to gauge the promise of such symbolic models around guiding large language models for predicting societal events.
APA, Harvard, Vancouver, ISO, and other styles
2

Kubíček, Ondřej, Neil Burch, and Viliam Lisý. "Look-ahead Search on Top of Policy Networks in Imperfect Information Games." In Thirty-Third International Joint Conference on Artificial Intelligence {IJCAI-24}. California: International Joint Conferences on Artificial Intelligence Organization, 2024. http://dx.doi.org/10.24963/ijcai.2024/480.

Full text
Abstract:
Search in test time is often used to improve the performance of reinforcement learning algorithms. Performing theoretically sound search in fully adversarial two-player games with imperfect information is notoriously difficult and requires a complicated training process. We present a method for adding test-time search to an arbitrary policy-gradient algorithm that learns from sampled trajectories. Besides the policy network, the algorithm trains an additional critic network, which estimates the expected values of players following various transformations of the policies given by the policy network. These values are then used for depth-limited search. We show how the values from this critic can create a value function for imperfect information games. Moreover, they can be used to compute the summary statistics necessary to start the search from an arbitrary decision point in the game. The presented algorithm is scalable to very large games since it does not require any search during train time. We evaluate the algorithm's performance when trained along Regularized Nash Dynamics, and we evaluate the benefit of using the search in the standard benchmark game of Leduc hold'em, multiple variants of imperfect information Goofspiel, and Battleships.
APA, Harvard, Vancouver, ISO, and other styles
3

Lang, Fred D. "Errors in Boiler Efficiency Standards." In ASME 2009 Power Conference. ASMEDC, 2009. http://dx.doi.org/10.1115/power2009-81221.

Full text
Abstract:
This paper presents both criticism and suggested changes to boiler efficiency standards associated with fossil-fired steam generators. These standards include the widely used ASME PTC 4.1, PTC 4 and DIN 1942, and others. The chief criticism is inconsistent application of thermodynamic principles. Specifically, conceptual errors are made with application of reference temperatures and the treatment of shaft powers. When using computed fuel flow as a touchstone, it becomes obvious that arbitrary use of reference temperatures and/or use of capricious energy credits cannot dictate a system’s computed fuel flow. Efficiency, calorific value and fuel flow must have fixed definitions concomitant with a system’s useful energy flow. Thermodynamics is not an arbitrary discipline, the computed fuel needs of a system must describe the actual. Boiler efficiency requires the same treatment, as an absolute value, as actual fuel feed and emission flow. Boiler efficiencies and associated calorific values have obvious standing when judging contractual obligations, for thermal performance monitoring, and for confirming carbon emissions. Note that a 0.5 to 1% change in efficiency may well have significant financial consequences when testing a new unit, or the on-going costs associated with fuel and carbon taxes. This paper demonstrates that errors greater than 2% are entirely possible if following the current standards. This paper appeals to the resolution of efficiency at the 0.1% level. The power plant engineer is encouraged to read the Introduction and Summary & Recommendations sections while the thermodynamicist is requested to throughly review and critique the mid-sections. The author hopes such reviews will advocate for improvement of these important industrial standards.
APA, Harvard, Vancouver, ISO, and other styles
4

Martin, Michael, Robert Marshal, and Peter Reed. "Data-Centric Structural Integrity Assessment and Risk-Informed Asset Management Using Operational Data and Probabilistic Updating." In ASME 2022 Pressure Vessels & Piping Conference. American Society of Mechanical Engineers, 2022. http://dx.doi.org/10.1115/pvp2022-84526.

Full text
Abstract:
Abstract The UK EASICS (Establishing Advanced Modular Reactor Structural Integrity Codes and Standards) programme has developed guidance to inform the development of codes and standards for application to the structural integrity assessment of future high-temperature designs [1]. A key aspect of the EASICS guidance describes the use of probabilistic methods in the context of a data-centric approach that can use data from all stages of the product lifecycle from design and manufacture through operation, maintenance and decommissioning to update the structural integrity assessment. This paper provides a summary of the EASICS data-centric approach before focusing on the operational phase of the product lifecycle and the use of data derived from plant monitoring and In-Service Inspection. The numerical analysis of a prototypical geometry with a postulated initial defect and set of simulated operational histories is used to demonstrate how such data can be used to manage the future inspection strategy on a risk-informed basis. A starting point of a required number of operational events, but unknown and arbitrary future operational sequence of events is considered. The structural reliability is calculated and updated through-life using the Monte Carlo random sampling method in conjunction with a selection of probabilistic updating techniques, including Bayesian inference.
APA, Harvard, Vancouver, ISO, and other styles
5

Russell, T., C. Nguyen, G. Loi, S. R. Mohd Shafian, N. N. Zulkifli, S. C. Chee, N. Razali, A. Zeinijahromi, and P. Bedrikovetsky. "Productivity Decline due to Fines Migration Associated with High Water Cuts." In SPE International Conference and Exhibition on Formation Damage Control. SPE, 2024. http://dx.doi.org/10.2118/217854-ms.

Full text
Abstract:
Summary The objective of this work is to describe the extent of productivity decline due to fines migration during periods of increasing water-cut. Two models are presented which allow for estimating the formation damage due to fines migration in both homogeneous and heterogeneous reservoirs. The model utilizes a description of the fluid distributions withing the pore structure to determine the fines detachment during progressive sweep of the reservoir by an aquifer. In heterogeneous reservoirs, an extension of the Dietz model is used to calculate pseudo relative permeability curves accounting for any arbitrary permeability distribution in a layer-cake reservoir. Both models are compared with field productivity decline data to evaluate their validity. Both models allow for explicit predictions of the wellbore productivity during periods of increasing water-cut. A novel diagnostic plot, the well impedance plotted against the well fractional flow, allows for the isolation of the formation damage characteristics of the reservoir. Tuning the formation damage and reservoir properties using field data exhibits good agreement and allows for extrapolation of the curves to higher water cuts. The models provide unique insight into the future formation damage of the well and allow for strategic planning of well remediation and stimulation. For heterogeneous reservoirs, the new diagnostic plots are proven to be linear, regardless of the permeability distribution in the reservoir, providing a quick and easy tool for formation damage evaluation. The new models and diagnostic plot provide a simple method to extrapolate existing formation damage and estimate formation damage from laboratory studies and/or well analogues.
APA, Harvard, Vancouver, ISO, and other styles
6

Ni, Zihan, Xinyi Jiang, Xiaoyu Xu, Chun Zi Wu, and Tianhong Fang. "Analysis of the Willingness and Path of Metropolitan Residents to Participate in Rural Landscape Design：A Case Study of Yanjing Village, Yexie Town." In 15th International Conference on Applied Human Factors and Ergonomics (AHFE 2024). AHFE International, 2024. http://dx.doi.org/10.54941/ahfe1005338.

Full text
Abstract:
With the introduction of the concept of "people's city and people's construction", participatory construction has gradually attracted people's attention and attention. In Yanjing Village, on the outskirts of Shanghai, there is a rural "retirement home" where managers and elderly people from nearby villages are actively involved in landscaping activities. Taking the village as the research object, this paper sorted out the participation intention, influencing factors, participation methods, organizational forms, funding sources, technical support and other issues of rural participatory landscape design on the basis of literature research, and formed a semi-structured questionnaire. Through field observation and in-depth interviews, the interview texts of the above questions were obtained, and then the conclusions were drawn through text analysis and inductive summary methods. The results show that the villagers have a strong willingness to participate, and are currently in the spontaneous stage, mainly in front of and behind their own houses or on the vacant land near the nursing home, and the main difficulties include insufficient plant design and planting technology, insufficient aesthetic resources, insufficient funding sources, arbitrary organizational forms, and lack of norms and rules, resulting in insufficient sustainability. It can be through technical guidance, such as joint construction with relevant majors in colleges and universities, to improve the ability of villagers' landscape design, to expand the channels of funding sources, such as villagers' self-raising + government subsidies + enterprise donations, and to establish a multi-party participation of the coordination mechanism, such as the establishment of a rural landscape design team composed of villagers, village committees, volunteers, and experts, to formulate rules to ensure the sustainable development of rural participatory landscape design.
APA, Harvard, Vancouver, ISO, and other styles
7

Briceño-León, Christian Xavier, Pedro Luis Iglesias-Rey, Francisco Javier Martínez-Solano, and Enrico Creaco. "Pumping Station Design with an Analysis of Variability of Demand and Considering Techno-Economic and Environmental Criteria through the AHP Method." In 2nd WDSA/CCWI Joint Conference. València: Editorial Universitat Politècnica de València, 2022. http://dx.doi.org/10.4995/wdsa-ccwi2022.2022.14098.

Full text
Abstract:
Pumping stations costs including, capital and operational costs are some of the highest costs in urban water distribution system. A proper pumping station design could be defined as the solution with the minimum life cycle cost and satisfying extreme scenarios in water distribution system. These costs are associated with investment, operational and maintenance costs. However, there are some important aspects to consider un a pumping station design, such as the feasibility of infrastructure construction, the size of the infrastructure, and the complexity of operation in the pumping station. These aspects are associated with technical criteria. In a classical pumping station design, the number of pumps is determined in arbitrary form according to the criteria of the engineer, and the pump model is selected according to the maximum requirements of flow and pressure of the network. In summary, these variables in a pumping station design are not usually analyzed deeply. In addition, global warming acceleration in the last decades has gained momentum to be considered in engineering problems to mitigate the environmental impact. Hence, it is imperative to consider environmental aspects, such as greenhouse emission, energetic efficiency of the pump in modern pumping systems of water distribution networks. Finally, the most suitable solution is determined only by analyzing economic aspects. Therefore, this work proposed a methodology to design pumping stations in urban water networks considering technical, environmental, and economic criteria and link them together through the Analytic Hierarchy Process (AHP) method. The propose of this method is to determine the importance priority of these aspects to assess the possible solutions and determine the most suitable solution in the pumping station design. In addition, this work considers the variability of demand pattern. This work analyses several scenarios of demand patterns from the minimum possible demand to the maximum possible demand in a water distribution network and the respective probabilities of occurrence of scenario. It allows that the pumping station design be more robust. This methodology has been applied in different case studies to analyze how affects to determine the most suitable solution when the characteristics of the network change.
APA, Harvard, Vancouver, ISO, and other styles
8

Biertümpfel, Felix, Dimitrios Gkoutzos, David Levi, Jorge Valderrama, and Harald Pfifer. "Integral Quadratic Constraint-Based Robustness Analysis of Launch Vehicles." In ESA 12th International Conference on Guidance Navigation and Control and 9th International Conference on Astrodynamics Tools and Techniques. ESA, 2023. http://dx.doi.org/10.5270/esa-gnc-icatt-2023-143.

Full text
Abstract:
The certification process of space launchers is challenging due to the complexity of the overall system and the reduced means of full system tests. One of the most crucial mission segments is the atmospheric flight phase. During its ascent through the earth’s atmosphere the space launcher is exposed to rapidly changing environmental conditions and a multitude of disturbance. At the same time, the system dynamics are highly coupled, subject to a significant amount of uncertainty, and vary extremely fast over time along the ascent trajectory. State-of-the-art approaches to assess the wind disturbances’ and parameter perturbations’ effects are simulation-based methods applied to the full nonlinear launcher model. These include Monte Carlo simulations and nonlinear optimization. Due to the complexity of the system and the variety of disturbances as well as perturbations, these methods are computationally expensive. Moreover, they can only provide a lower bound and some probabilistic information on the expected performance. Alternative methods include worst-case analysis methods using linear launcher representations. Common attempts in literature involve linear time-invariant worst-case methods based on the structured singular value (mu). Lately, linear parameter-varying (LPV) methods were applied to the launcher ascent problem. However, mu-based analyses are limited to frozen points in time along the trajectory. LPV-type analyses consider an infinite set of possible trajectories. Moreover, both approaches calculate the performance measure over an infinite analysis horizon. Due to this, they fail to adequately cover the launcher dynamics and the ascent/mission scenario – a prescribed finite trajectory connected to strictly time-varying dynamics. Moreover, both frameworks require the linear system to be stable at all times. To achieve load minimal conditions slight instability of the launcher for short periods of the flight is beneficial for its performance. However, classic linear analyses would deem these designs unfeasible. In summary, the calculated performance measures fail to provide meaningful (upper) bounds for the actual space launcher. This becomes obvious by an arbitrary validation gap comparing the simulation-based and the linear worst-case analysis results. The paper addresses this short-coming by explicitly respecting the time varying dynamics of the launcher in a finite horizon linear time varying (LTV) worst case analysis of typical performance metrics (drift, aerodynamic loads, tracking). The analysis explicitly considers uncertainty in the dynamics and external wind disturbance in an easy to interpret fashion. A gravity turn trajectory for an industry-sized nonlinear model of a light weight expendable launch vehicle (ELV) is calculated. It spans the time frame from the start of the gravity turn until first-sage burnout/ main engine cut off. The nonlinear dynamics can include the multi body dynamics of the space launcher and nozzle (moved by the thrust vectoring control (TVC)), tail-wag-dog effects, flexible modes, differential aerodynamic loads, sloshing effects, jet damping and aeroelastic couplings. The linear time-varying model of the space launcher is calculated about the reference trajectory. This model explicitly covers the launcher’s time-varying dynamics as well as the finite time horizon of the ascent. The performance analysis is conducted inside the LTV integral quadratic constraints (IQC) framework. This framework allows to address a multitude of different perturbations, for example, nonlinearities (saturations), infinite dimensional systems (time delays), as well as dynamic and parametric uncertainties, in a single analytical analysis. Efficient worst-case gain optimization frameworks exist to solve the problem. The calculated performance bounds are guaranteed upper bounds for the nonlinear model. The finite horizon LTV framework also facilitates the analysis of unstable dynamics, which is beneficial for launch systems. To include realistic wind disturbances which yield directly interpretable performance bounds inside the LTV IQC framework a tailored wind filter design is presented. This means the calculated upper bounds represent an actual physical value of e.g. the aerodynamic load or pitch error. The methodology allows to easily design wind filters dedicated to any provided reference wind profile, e.g., based on historical data from the launch side and/or weather balloon measurements. The primary uncertainty will be implemented in a way to resemble disk margins. This type of uncertainty creates simultaneous phase and gain perturbations in the system. Hence, the LTV analysis directly correspond to phase and gain margin analysis typically required in certification processes. The LTV performance analysis will be conducted for two representative control designs. One control design will provide a stable drift motion of the launcher. The alternative design will establish a load minimum condition, i.e. an unstable drift pole, in the maximum dynamic pressure region. A corresponding (mu-based) LTI analysis will be conducted representing the state-of-the-art approach in industry. This means the linear model will be analyzed on frozen points in time, over an infinite horizon. To finish, a Monte Carlo simulation over a set of allowable uncertainties and wind profiles is conducted to validate that the LTV performance analysis is feasible and not overly conservative to calculate performance bounds for the nonlinear model. At the same time, the analysis will emphasize the limitations of the LTI approach and the gaps to the nonlinear simulation.
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Summary or Arbitrary Executions' for particular source types:
Journal articles Books
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography