The Trusted Platform Module (TPM) is a cryptoprocessor designed to provide hardware-based secure storage and protect integrity of modern computers. Communications with the TPM go through the TPM Software Stack (TSS), a popular implementation of which is the open-source library tpm2-tss. It is thus crucial to ensure that no leak of sensitive data may occur in the TSS during communications between the host platform and the TPM. Recent work on deductive verification of functional and safety properties for this library faced (...) several challenges. The purpose of this case study paper is to focus on high-level security properties, and to propose an alternative validation approach for such properties on the library by using runtime verification. We describe the proposed approach, apply it to specify and verify at runtime some key security properties using the Frama-C verification platform and report on our first evaluation results. (shrink)

While the theory and practice of runtime monitoring are overall well developed, in embedded systems, runtime monitoring is not as common as one would expect. Especially small-scale embedded systems, which are found in many household devices, are often somewhat safety-critical and could benefit from the possibility to detect software or hardware defects that cannot be uncovered with verification alone. While monitoring frameworks such as RTLola and Copilot are available to address this problem, employing them leads to a gap (...) between verification and runtime monitoring by these frameworks having specialized specification languages for monitoring, and what can be expressed in them is incomparable to the capabilities of the temporal logics traditionally employed in formal verification.This paper discusses how (linear) temporal logic runtime monitoring for small-scale embedded systems can be made more efficient and attractive to the embedded systems practitioner. This includes identifying why monitoring for traditional temporal logics is somewhat inefficient in software, how this problem can be addressed in a low-cost way, and how runtime monitors can become a more useful component of an embedded system. By providing a way to translate a specification to monitor code that also tracks the reason for a specification violation, the overall approach discussed in the paper makes spending developer time on writing a relatively precise specification of a system to build attractive, which also helps paving the way to make formal verification for small-scale embedded systems more common. (shrink)

“ Tripping through ” is an invitation to plunge into the invisible relationships of hard and soft computer matter through sensuous mediation. The projects outlined are designed to provoke and capture the specific behavior of individual computer components through the use of appropriate software fragments. If one approaches a digital apparatus with a transducer that transforms electromagnetic fields into acoustic waves, the analytical sphere is changed into concrete acoustical phenomena and enters the world of sensation (electromagnetic emissions can be picked (...) using induction microphones and output as acoustic signals. A suitable example is a Monacor telephone adapter AC-71/3,5MM). In choreographies for software and computer parts, these become actors in noise pieces for and in computers. Machine noises can be mediated for the public. They reveal the activity of computer programs in the widest sense and the activity of the computers or computer parts they are running on. The time and space of computer processes and memory span different levels of reality during “ runtime. ” Software being processed within this system of coordinates creates its own temporal and spatial dimensions, which are staged for an audience to provide a sensual experience: that of logic encountering the physical world. (shrink)

The use of Requirements at Runtime (RRT) is an emerging research area. Many methods and frameworks that make use of requirements models during software execution can be found in the literature. How...

As AI systems increasingly permeate high-stakes decisionmaking, the terminology regarding human involvement - Human-in-the-Loop (HITL), Human-on-the-Loop (HOTL), and Human Oversighthas become vexingly ambiguous. This ambiguity complicates interdisciplinary collaboration between computer science, law, philosophy, psychology, and sociology and can lead to regulatory uncertainty. We propose a clarification grounded in causal structure, focused on human involvement during the runtime of AI systems. The distinction between HITL and HOTL, we argue, is not primarily spatial but causal: HITL is constitutive (a human contribution (...) is necessary for the decision output), while HOTL is corrective (external to the primary causal chain, capable of preventing or modifying outputs). Within HOTL, we distinguish three temporal modes - synchronous, asynchronous, and anticipatorysituated within a nested model of provider and deployer runtime that clarifies their different capacities for intervention. A second, orthogonal dimension captures cognitive integration: whether human and machine operate as complementary or hybrid intelligence, yielding four structurally distinct configurations. Finally, we distinguish these descriptive categories from the normative requirements they serve: statutory "Human Oversight" is a specific normative mode of HOTL that demands not merely a corrective causal position, but genuine preparedness and capacity for effective intervention. Because the same person may occupy both HITL and HOTL roles simultaneously, we argue that this role duality must be treated as a design problem requiring architectural and epistemic mitigation rather than mere acknowledgment. (shrink)

In 2011, Hibbard suggested an intelligence measure for agents who compete in an adversarial sequence prediction game. We argue that Hibbard’s idea should actually be considered as two separate ideas: first, that the intelligence of such agents can be measured based on the growth rates of the runtimes of the competitors that they defeat; and second, one specific (somewhat arbitrary) method for measuring said growth rates. Whereas Hibbard’s intelligence measure is based on the latter growth-rate-measuring method, we survey other methods (...) for measuring function growth rates, and exhibit the resulting Hibbard-like intelligence measures and taxonomies. Of particular interest, we obtain intelligence taxonomies based on Big-O and Big-Theta notation systems, which taxonomies are novel in that they challenge conventional notions of what an intelligence measure should look like. We discuss how intelligence measurement of sequence predictors can indirectly serve as intelligence measurement for agents with Artificial General Intelligence (AGIs). (shrink)

As AI Systems become increasingly autonomous, they are expected to engage in decision-making processes that have moral implications. In this research we integrate theoretical and empirical lines of thought to address the matters of moral reasoning and moral uncertainty in AI Systems. We reconceptualize the metanormative framework for decision-making under moral uncertainty and we operationalize it through a latent class choice model. The core idea being that moral heterogeneity in society can be codified in terms of a small number of (...) classes with distinct moral preferences and that this codification can be used to express moral uncertainty of an AI. Choice analysis allows for the identification of classes and their moral preferences based on observed choice data. Our reformulation of the metanormative framework is theory-rooted and practical in the sense that it avoids runtime issues in real time applications. To illustrate our approach we conceptualize a society in which AI Systems are in charge of making policy choices. While one of the systems uses a baseline morally certain model, the other uses a morally uncertain model. We highlight cases in which the AI Systems disagree about the policy to be chosen, thus illustrating the need to capture moral uncertainty in AI systems. (shrink)

We present a practical, hybrid algorithm for exact multiplication of large integers combining multiple advanced techniques to achieve practically faster performance than standard implementations while maintaining deterministic correctness. This method integrates: -/- - Fibonacci multiples with recursive doubling - Zeckendorf decomposition and block aggregation to reduce the effective number of blocks r_effective - FFT convolution on smaller, cache-friendly arrays - Hierarchical B-Tree merging with Strassen-style divide-and-conquer for multi-digit addition - SHA verification for deterministic exactness -/- The algorithm achieves asymptotic complexity (...) O(n \log n), matching Van der Hoeven (2019), but reduces practical runtime constants significantly. (shrink)

Purpose This study aims to develop a normative ethical framework for crisis communication and accountability in algorithmically managed transportation systems. It examines how transparency, responsibility, justice and care should be ethically operationalized when crises arise from complex socio-technical coordination rather than from isolated human error. Design/methodology/approach This study uses a structured narrative synthesis (2020–2025) across crisis communication ethics, information ethics, algorithmic governance and transport regulation to construct a multi-layered normative framework, which is subsequently used to interpret a public aviation disruption (...) linked to revised Flight Duty Time Limitation regulations in India as a theory illustrating a vignette rather than an empirical test case. Findings Four systemic ethical failures are identified: opacity in algorithmic crisis communication, diffusion of accountability across design-time and runtime actors, unjust distribution of disruption-related burdens and remedies and insufficient care for vulnerable passengers. These are translated into operational governance requirements, including impact assessments, traceability, fairness audits and care-sensitive communication architectures. Research limitations/implications As a conceptual study supported by a public vignette, the framework does not offer empirical generalization and requires validation across transport modes and institutional contexts. Practical implications The framework provides regulators, transport operators and technology vendors with actionable guidance for designing enforceable crisis communication, accountability structures and passenger protection mechanisms under algorithmic coordination. Social implications This study highlights how algorithmic crisis coordination can amplify social vulnerability, exclusion and public distrust, particularly affecting elderly, disabled, medically dependent and digitally marginalized passengers. Originality/value This study does not merely assemble existing ethical principles; it reconfigures transparency, accountability, justice and care into a crisis-specific governance architecture that links design-time and runtime accountability, channel-level crisis communication requirements and enforceable institutional mechanisms for algorithmically managed transport systems. (shrink)

Contemporary physics remains fractured by a profound explanatory gap regarding the ontological status of the present moment. While the Block Universe of General Relativity dismisses the passage of time as a persistent illusion, human phenomenological experience, quantum non-locality, and modern quantum gravity foundations strongly imply the existence of an absolute, privileged present moment. This paper proposes The Biological Presentist Model. I reframe spacetime not as a static, four-dimensional geometric manifold, but as an active, five- dimensional manifold comprising a two-dimensional spatial (...) hardware lattice (2S) and a three- dimensional temporal phase-space (3T), both driven by an independent, universal system clock (T4). Utilizing a formalized Neo-Lorentzian framework and the structural stability constraints of Causal Dynamical Triangulations (CDT), I demonstrate that the relativity of simultaneity is an informational latency effect within a localized user interface rather than a fundamental metaphysical truth, anchoring the master system's execution rate to the isotropic frame of the Cosmic Microwave Background (CMB). Crucially, I propose that living biological organisms do not merely observe this cosmic runtime but function as its high-bandwidth hardware terminals. These autopoietic systems sustain real-time synchrony with the universal clock through active, negentropic error-correction protocols, paying a localized processing tax dictated by Landauer's Principle. By analyzing the spectrum of altered conscious states ranging from general anesthesia (telemetry bandwidth throttling) to brain death (irreversible ontological decoupling), I show that consciousness is the literal, active execution thread of this universal code. (shrink)

As artificial intelligence systems acquire increasing autonomy, the question of how humans can maintain meaningful control over their behavior becomes urgent. This question is especially pressing for agentic AI: systems built on foundation models that coordinate networks of autonomous agents to pursue complex goals with minimal human oversight. While the engineering literature has developed several mechanisms for constraining such systems, it has largely treated controllability as a purely causal property, the ability to physically intervene in a system’s operation, without engaging (...) the normative dimensions that determine whether such intervention is meaningful. Drawing on the distinction between causal and normative control in the philosophy of action, this paper presents a structured conceptual survey of controllability mechanisms in agentic AI. We organize the literature around four paradigms: constraints and guardrails, adaptive control via reinforcement learning, agent-in-the-loop oversight, and human-in-the-loop oversight. For each, we analyze its technical foundations, its philosophical assumptions about agency and authority, and its persistent limitations. Our analysis reveals unresolved tensions across these paradigms, particularly between the scalability of automated oversight and the legitimacy of human judgment, between design-time constraint specification and runtime adaptability, and between individual agent control and system-level governance. We argue that meaningful controllability requires integrating causal intervention mechanisms with normative frameworks that address value alignment, epistemic transparency, and distributed responsibility. We conclude by proposing directions for research that bridges engineering controllability and philosophically grounded human oversight. (shrink)

This is a case-study in knowledge representation. We analyze the ‘one hundred prisoners and a lightbulb’ puzzle. In this puzzle it is relevant what the agents (prisoners) know, how their knowledge changes due to observations, and how they affect the state of the world by changing facts, i.e., by their actions. These actions depend on the history of previous actions and observations. Part of its interest is that all actions are local, i.e. not publicly observable, and part of the problem (...) is therefore how to disseminate local results to other agents, and make them global. The various solutions to the puzzle are presented as protocols (iterated functions from agent’s local states, and histories of actions, to actions). The computational aspect is about average runtime termination under conditions of random (‘fair’) scheduling. (shrink)

In this paper we ask whether approximation for abstract argumentation is useful in practice, and in particular whether reasoning with grounded semantics – which has polynomial runtime – is already an approximation approach sufficient for several practical purposes. While it is clear from theoretical results that reasoning with grounded semantics is different from, for example, skeptical reasoning with preferred semantics, we investigate how significant this difference is in actual argumentation frameworks. As it turns out, in many graphs models, reasoning (...) with grounded semantics actually approximates reasoning with other semantics almost perfectly. An algorithm for grounded reasoning is thus a conceptually simple approximation algorithm that not only does not need a learning phase – like recent approaches – but also approximates well – in practice – several decision problems associated to other semantics. (shrink)

Strictly Local (SL) languages have proven useful for the modeling of local phonotactic dependencies and functional analogues that can describe local phonological processes were recently defined by exploiting a convenient property: namely that a word’s suffix (up to a particular finite length) determines its grammatical continuations. Strictly Piecewise (SP) languages are much like the SL languages and have been used to model non-local phonotactic dependencies, the difference between SL and SP languages being the choice of strict or general precedence. A (...) functional extension of the SP languages would be useful for describing non-local phonological processes, but the SP languages do not exhibit a residual-defining property directly parallel to that which formed the basis of SL functions. The Boolean closure of the SP languages, known as the Piecewise Testable (PT) languages, do exhibit such a property, and we show how a class of SP functions can be defined by first defining a class of PT functions and then imposing specific restrictions onto them. We then characterize the PT functions using finite-state transducers, and consider an alternative for the SP functions since the size of a PT transducer is exponential in the size of the alphabet. By using a transducer-like object that operates by checking its memory store against sets of logical formulae, an exponential reduction in the size of the overall machine is possible, though it comes at the cost of an increase in run-time polynomially proportional to the size of the alphabet. The increased runtime is directly comparable to that of the factored acceptors for SP languages which inspired our alternative to simple finite-state transducers. This characterization also highlights a distinction between PT and SP functions that mirrors how the PT languages are the Boolean closure of the SP languages. (shrink)

argumentation has proven to be a versatile tool to model and analyze various problems in an argumentative setting. The addition of collective attacks syntactically extends Dung’s original argumentation frameworks (AFs), while retaining the most desirable properties—the resulting class of frameworks is called SETAFs. While most reasoning tasks in the realm of abstract argumentation have been shown to be intractable, real-world instances oftentimes are not entirely random but admit a certain structure that allows for efficient computational shortcuts. In certain cases, we (...) can characterize this structure via an integer parameter, and exploit these insights with advanced algorithmic techniques. A thorough analysis of the computational aspects of SETAFs w.r.t. parameterized algorithms has not yet been conducted. We start the investigation of these approaches by applying the backdoor and treewidth approaches to SETAFs. A backdoor is a part of a problem instance, such that removing the backdoor leads to a simple structure. If we can find such a backdoor and guess the solution on this part (respectively, extensions), the rest of the solution follows almost effortlessly. Similarly, the treewidth of a problem instance is a parameter that characterizes the properties of the instance’s graph structure. Intuitively, the lower the treewidth of a graph, the more “tree-like” it is. Since most argumentation problems become easy on trees, one can exploit low treewidth for efficient algorithms. In this paper, we establish that for SETAFs with constant backdoor sizes general argumentation tasks become efficiently solvable—they are fixed-parameter tractable. We generalize the respective techniques that are known for the special case of Dung-style AFs and show that they also apply to the more general case of SETAFs. In addition, we can show an improvement in the asymptotic runtime compared to earlier approaches for AFs via two-valued guesses instead of the state-of-the-art three-valued approach. Along the way, we point out similarities and interesting situations arising from the more general setting. While treewidth is well-studied in the context of AFs with their graph structure, it cannot be directly applied to the (directed) hypergraphs representing SETAFs. We thus introduce two generalizations of treewidth based on different graphs that can be associated with SETAFs, that is, the primal graph and the incidence graph. We show that while some of these notions allow for parameterized tractability results, reasoning remains intractable for other notions, even if we fix the parameter to a small constant. We present parameterized algorithms for efficient reasoning on SETAFs via tree decompositions by characterizing extensions not only by labeling the arguments, but also by assigning (temporary) labels to the attacks. (shrink)

Deciding the amalgamation property for a given class of finite structures is an important subroutine in classifying countable finitely homogeneous structures. We study the computational complexity of the amalgamation decision problem for finitely bounded classes, i.e. classes specified by a finite set of forbidden finite substructures, or equivalently by a finite set of universal axioms. We link the amalgamation decision problem to the problem of testing the containment between the reducts of two given finitely bounded amalgamation classes to a given (...) common subset of their signatures. On the one hand, this link enables polynomial-time reductions from various decision problems that can be represented within the reduct containment problem for finitely bounded amalgamation classes, e.g. the 2-exponential square tiling problem, leading to a new lower bound for the complexity of the amalgamation decision problem: 2NEXPTIME -hardness. On the other hand, the link also allows us to show that the amalgamation decision problem is decidable under the assumption that every finitely bounded strong amalgamation class has a computable finitely bounded Ramsey expansion. The runtime of our conditional decision procedure depends 2-exponentially on the size of a minimal Ramsey expansion. We subsequently prove that the closely related problem of testing homogenizability is already undecidable, by a polynomial-time reduction from the regularity of context-free languages. Our results indicate that the relationship between finitely bounded amalgamation classes and arbitrary finitely bounded classes shares similarities with the relationship between regular grammars and context-free grammars. A key difference is that the regularity of context-free grammars can be tested in linear time, while the problem of testing the amalgamation property for finitely bounded classes is 2NEXPTIME -hard. (shrink)

Much like admissibility is the key concept underlying preferred semantics, strong admissibility is the key concept underlying grounded semantics, as membership of a strongly admissible set is sufficient to show membership of the grounded extension. As such, strongly admissible sets and labellings can be used as an explanation of membership of the grounded extension, as is for instance done in some of the proof procedures for grounded semantics. In the current paper, we present two polynomial algorithms for constructing relatively small (...) strongly admissible labellings, with associated min–max numberings, for a particular argument. These labellings can be used as relatively small explanations for the argument’s membership of the grounded extension. Although our algorithms are not guaranteed to yield an absolute minimal strongly admissible labelling for the argument (as doing so would have implied an exponential complexity), our best performing algorithm yields results that are only marginally larger. Moreover, the runtime of this algorithm is an order of magnitude smaller than that of the existing approach for computing an absolute minimal strongly admissible labelling for a particular argument. As such, we believe that our algorithms can be of practical value in situations where the aim is to construct a minimal or near-minimal strongly admissible labelling in a time-efficient way. (shrink)

Role is a commonly used concept in software development, but a concept with divergent definitions. This paper discusses the characteristics of roles in software organizations, and contrasts such organization roles with other player-centric conceptions. Roles in organizations have their own identity and do not depend on role players for their existence. In software terms, such roles are first-class runtime entities rather than just design concepts. We define characteristic properties of both roles and players in organizational contexts, and show how (...) the boundary between a role and its player varies depending on the level of autonomy the player is allowed. We show how roles can facilitate the separation of structure from process facilitating greater adaptivity in software. The problem of preservation of state in role-based organizations is also discussed. Possible implementation strategies for both roles and players are discussed and illustrated with various role-oriented approaches to building software organizations. (shrink)

We describe a tool that allows the merging of extensions of argumentation frameworks, following the approach defined by 33–42). The tool is implemented in Java, and is highly modular thanks to Object Oriented Programming principles. We describe a short experimental study that assesses the scalability of the approach, as well as the impact on runtime of using an integrity constraint.

This paper explores the assumption of autonomy. Several arguments are presented against the assumption of runtime autonomy as a principle of design for artificial intelligence systems. The arguments vary from being theoretical, to practical, and to analytic. The latter parts of the paper focus on one strategy for building non-autonomous systems (the practice view). One critical theme is that intelligence is not located in the system alone, it emerges from a history of interactions among user, builder, and designer over (...) a given set of data as mediated by the system. A second critical theme is that artificially intelligent systems are ongoing projects that must be continuously adapted and revised using joint person-machine efforts. (shrink)

The wide range of interpretations of aoristic and imperfective aspect in Ancient Greek cannot be attributed to unambiguous aspectual operators but suggest an analysis in terms of coercion in the spirit of de Swart (Nat Lang Linguist Theory 16:347–385, 1998). But since such an analysis cannot explain the Ancient Greek data, we combine Klein’s (Time in language, 1994) theory of tense and aspect with Egg’s (Flexible semantics for reinterpretation phenomena, 2005) aspectual coercion approach. Following Klein. (grammatical) aspect relates the (...) class='Hi'>runtime of an eventuality and the current time of reference (topic time). We claim that these relations can trigger aspectual selection restrictions (and subsequent aspectual coercions) just like e.g. aspectually relevant temporal adverbials, and are furthermore susceptible to the Duration Principle of Egg (Flexible semantics for reinterpretation phenomena, 2005): Properties of eventualities must be compatible with respect to the duration they specify for an eventuality. The Duration Principle guides the selection between different feasible coercion operators in cases of aspectual coercion but can also trigger coercions of its own. We analyse the interpretations of aorist and imperfective as cases of coercion that avoid impending violations of aspectual selection restrictions or of the Duration Principle, which covers cases that are problematic for de Swart’s (Nat Lang Linguist Theory 16:347–385, 1998) analysis. (shrink)

The adaptive object model method is an effective way to develop dynamic and configurable adaptive software. It has the characteristics of metamodel, description drive, and runtime reflection. First, the core idea of the adaptive object model is explained; then, the five modes of establishing the metamodel in the adaptive object model architecture, the model engine, and supporting tools are analyzed; and the basketball tracking algorithm of the adaptive object model is discussed. Secondly, a two-dimensional joint information strategy is proposed (...) to improve the tracking effect. When the basketball is in a very complex environment, there will always be some color information in the background that is the same as the target, which affects the effect of basketball tracking. Therefore, this paper proposes a Camshift tracking method based on the significance of histograms, through real time. The basketball movement is compared with the background histogram to continuously adjust the basketball movement tracking model. These two methods can better establish the tracking model of the basketball adaptive object, reduce the interference of background information, and achieve the effect of stable tracking of the target. The simulation experiment results show that the method proposed in this paper can effectively improve the accuracy of the basketball goal model and achieve stable tracking of the goal. (shrink)

The integrated scheduling algorithm of process sequence time-selective strategy is an advanced algorithm in the field of integrated scheduling. The proposed algorithm points out the shortcomings of the process sequence time-selective strategy. Generally, there are too many “trial scheduling” times. The authors propose that there is no need to make “trial scheduling” at every “quasi-scheduling time point.” In fact, the process scheduling scheme can be obtained by trial scheduling on some “quasi-scheduling time points.” The scheduling result is the same as (...) that of the sequence timing strategy. The proposed algorithm reduces the runtime of scheduling algorithm and improves the performance of the algorithm without reducing the optimization effect. (shrink)

Decoding the human genome in the past decades has brought into focus a computationally intensive operation through DNA profiling. The typical search space for these kinds of problems is extremely large and requires specialized hardware and algorithms to perform the necessary sequence analysis. In this paper, we propose an innovative and scalable approach to exact multi-pattern matching of nucleotide sequences by harnessing the massively parallel computing power found in commodity graphical processing units. Our approach places careful consideration on preprocessing of (...) DNA datasets and runtime performance, while exploiting the full capabilities of the heterogeneous platform it runs on. Finally, we evaluate our models against real-world DNA sequences. (shrink)

A pseudo-natural algorithm for the word problem of a finitely presented group is an algorithm which not only tells us whether or not a word w equals 1 in the group but also gives a derivation of 1 from w when w equals 1. In [13], [14] Madlener and Otto show that, if we measure complexity of a primitive recursive algorithm by its level in the Grzegorczyk hierarchy, there are groups in which a pseudo-natural algorithm is arbitrarily more complicated than (...) an algorithm which simply solves the word problem. In a given group the lowest degree of complexity that can be realised by a pseudo-natural algorithm is essentially the derivational complexity of that group. Thus the result separates the derivational complexity of the word problem of a finitely presented group from its intrinsic complexity. The proof given in [13] involves the construction of a finitely presented group G from a Turing machine T such that the intrinsic complexity of the word problem for G reflects the complexity of the halting problem of T, while the derivational complexity of the word problem for G reflects the runtime complexity of T. The proof of one of the crucial lemmas in [13] is only sketched, and part of the purpose of this paper is to give the full details of this proof. We will also obtain a variant of their proof, using modular machines rather than Turing machines. As for several other results, this simplifies the proofs considerably. MSC: 03D40, 20F10. (shrink)

Recently we proposed a method of compiling prioritized circumscription into answer set programming. However, its encoding has the guess and check structure, where the candidates are generated by the guess program and the check is expressed by the inconsistency of the check program. In this paper, we present another method which compiles prioritized circumscription into a single general disjunctive program by means of integration of the guess and check programs. The answer sets of the transformed GDP yield models of a (...) given circumscription by emulating the inconsistency of the check program using integrity constraints. Thanks to our integration technique, the circumscriptive theorem prover to evaluate a query with respect to prioritized circumscription is easily established by expressing the inconsistency check in a single GDP. Our experimental results show that the performance of the tool we have implemented using our new method has not only improved remarkably, i.e. reduction of runtime as compared to our previous method, but has also exceeded that of the recently developed software tool, prio_circ2dlp, for prioritized circumscription as far as our experiments are concerned. (shrink)

Cellular Automata, which is a method for analyzing phenomena of complex systems, allows us to construct many kinds of simulators such as road traffic simulators. When we design a CA model, we need a CA simulator for verification of its result. However, at the present, we need to develop a software simulator since CA dedicated computers have not been generalized yet. We need to use a trial and error method with the simulator for design of local rules, which is the (...) main process of making CA models. We have developed an interpreter that makes this process easily. Giving the system a local rule described in a CA dedicated language, the user can instantly confirm the result. When the user change the rules, the system reflects his changes immediately. Our system does not regulate to design the local rules belonging to the CA category because the system is a general purpose CA simulator that adopts the method by description in the special language for definitions of local rules. We can modify a rule dramatically since the system interprets a rule description language in runtime. Furthermore, we can change variable parameters using GUI interfaces. Whereby they iterate to change a rule, a conflictive conditional statement sometimes occurs in a description of local rules. This conflict is far from seeking generally. Our system detects such a conflict automatically and notifies it to users as an error. (shrink)

In this article, we present a new approach for frequent pattern mining that runs fast for both sparse and dense databases. Two algorithms, FEM and DFEM, based on our approach are also introduced. FEM applies a fixed threshold as the condition for switching between the two mining strategies; meanwhile, DFEM adopts this threshold dynamically at runtime to best fit the characteristics of the database during the mining process, especially when minimum support threshold is low. Additionally, we present optimization techniques (...) for the proposed algorithms to speed the mining process, reduce the memory usage, and optimize the I/o cost. We also analyze in depth the performance of FEM and DFEM and compare them with several existing algorithms. The experimental results show that FEM and DFEM achieve a significant improvement in execution time and consume less memory than many popular FPM algorithms including the well-known Apriori, FP-growth, and Eclat. (shrink)

What the participants share, their common “sense” of the world, creates a foundation, a framing, an orientation that enables human actors to see and act in coordination with one another. For recurrent activities, the methods the participants use to understand each other as they act change, making the intersubjective space in which actors operate richer and easier to produce. This article works through some of the issues that emerge from a close examination of intersubjectivity as it is managed through representation (...) and interaction. The data that are presented document, in detail, a sequence of related interactions, within and across episodes of cooperation, where continuity and change can be observed. The emergence of conversational structure and coordinating representations are significant milestones in the long‐term development of a representational practice that support the runtime co‐construction of intersubjective space. Conversational structures emerge interactively to mediate recurrent points of coordination in the domain activity, and only secondarily the conversation itself. Coordinating representations change the representational practice of the participants by making it easier to manage their “shared view” of the collective work, enabling the participants to make progress, expand the field of the common activity, while exhibiting more control of if and when explicit grounding occurs. (shrink)

Copyright 2015 ACM.Large scientific code bases are often composed of several layers of runtime libraries, implemented in multiple programming languages. In such situation, programmers often choose conservative synchronization patterns leading to suboptimal performance. In this paper, we present context-sensitive dynamic optimizations that elide barriers redundant during the program execution. In our technique, we perform data race detection alongside the program to identify redundant barriers in their calling contexts; after an initial learning, we start eliding all future instances of barriers (...) occurring in the same calling context. We present an automatic on-the-fly optimization and a multi-pass guided optimization. We apply our techniques to NWChem - a 6 million line computational chemistry code written in C/C++/Fortran that uses several runtime libraries such as Global Arrays, ComEx, DMAPP, and MPI. Our technique elides a surprisingly high fraction of barriers in production runs. This redundancy elimination translates to application speedups as high as 14% on 2048 cores. Our techniques also provided valuable insight about the application behavior, later used by NWChem developers. Overall, we demonstrate the value of holistic context-sensitive analyses that consider the domain science in conjunction with the associated runtime software stack. (shrink)

To adequately deal with unpredictable and dynamic environments, normative frameworks typically deployed in mechanisms for modifying the norms at runtime are crucial. We present the syntax and operational semantics of programming constructs to facilitate runtime norm modification, allowing a programmer to specify when and how the norms may be changed by external agents or by the normative mechanism. The norms take on the form of conditional obligations and prohibitions, instantiating obligations and prohibitions. We present rule-based constructs for (...) class='Hi'>runtime modification of the norms and their instances, and a mechanism for automatically updating the instances when their underlying norms change. Moreover, we investigate a mechanism for avoiding norm conflicts. (shrink)

ABSTRACT Two computation procedures are described for intuitionistic and classical logic. The first introduces Skolem functions at runtime. The second restricts unification by time stamping. For universal Horn clauses the computation is the same as Prolog.

CYBATHLON is an international championship where people with severe physical disabilities compete with the aid of state-of-the-art assistive technology. In one of the disciplines, the BCI Race, tetraplegic pilots compete in a computer game race by controlling an avatar with a brain-computer interface. This competition offers a perfect opportunity for BCI researchers to study long-term training effects in potential end-users, and to evaluate BCI performance in a realistic environment. In this work, we describe the BCI system designed by the team (...) Mirage91 for participation in the CYBATHLON BCI Series 2019, as well as in the CYBATHLON 2020 Global Edition. Furthermore, we present the BCI’s interface with the game and the main methodological strategies, along with a detailed evaluation of its performance over the course of the training period, which lasted 14 months. The developed system was a 4-class BCI relying on task-specific modulations of brain rhythms. We implemented inter-session transfer learning to reduce calibration time, and to reinforce the stability of the brain patterns. Additionally, in order to compensate for potential intra-session shifts in the features’ distribution, normalization parameters were continuously adapted in an unsupervised fashion. Across the aforementioned 14 months, we recorded 26 game-based training sessions. Between the first eight sessions, and the final eight sessions leading up to the CYBATHLON 2020 Global Edition, the runtimes significantly improved from 255 ± 23 s to 225 ± 22 s, respectively. Moreover, we observed a significant increase in the classifier’s accuracy from 46 to 53%, driven by more distinguishable brain patterns. Compared to conventional single session, non-adaptive BCIs, the inter-session transfer learning and unsupervised intra-session adaptation techniques significantly improved the performance. This long-term study demonstrates that regular training helped the pilot to significantly increase the distance between task-specific patterns, which resulted in an improvement of performance, both with respect to class separability in the calibration data, and with respect to the game. Furthermore, it shows that our methodological approaches were beneficial in transferring the performance across sessions, and most importantly to the CYBATHLON competitions. (shrink)

Binding relations are fimdamentally semantic in nature. They arise as relations that are established with an interpretation. This is most apparent with dynamic binding, of the kind found in Dynamic Predicate Logic. Here it is the runtime of the evaluation that may permit a binding relation, in..

The existing risk assessment and control methods of enterprise risk financing have a large error in mobile data, which leads to inaccurate risk assessment results and low-risk optimization control efficiency. In order to improve the accuracy of risk financing risk assessment for small and medium-sized enterprises and risk control optimization efficiency, this article proposes risk assessment and risk control algorithms for SMEs in the era of big data. Through verifying the information of the loan application and supplementing the data during (...) the loan period, invoke the existing enterprise financing risk database, establish the SME venture financing risk assessment model; build the risk evaluation index system according to the characteristics of the enterprise production organization, process characteristics, and the development of the socioeconomic and technical environment; apply the GA–PSO algorithm to the design of the SME risk financing risk control scheme, and complete the SME risk financing risk assessment and risk control. The experimental results show that the risk optimization control efficiency of the control algorithm reaches more than 70%, and the risk assessment accuracy of SMEs reaches over 95%, and the runtime less than 80 ms, with good convergence performance of risk assessment and control, strong risk optimization control ability, and accurate evaluation effect. (shrink)

. Network data analysis helps in capturing node usage behavior. Existing algorithms use reduced feature set to manage high runtime complexity. Ignoring features may increase classification errors. This paper presents a model, allowing classification of network traffic, while considering all the relevant features. Learning phase partitions training sample on values of the respective features. This creates equivalence classes related to m features. During classification, each feature value of the test instance results in picking one set from equivalence class generated (...) during learning. Algorithm captures new behavior in semi-supervised incremental learning mode. For problems having m features and n training samples the model has incremental learning complexity of and average classification complexity is of the order. (shrink)

This article describes the UniversAAL platform, an open platform intended to facilitate the development, distribution, and deployment of technological solutions for Ambient assisted living. The platform is intended to benefit end users, authorities with responsibility for AAL, and organizations involved in the development and deployment of AAL services. It consists of an extensive set of resources aimed at these different groups. The resources are classified into three main groups: runtime support, development support, and community support. The article presents the (...) benefits that can be expected from the widespread adoption of the platform. The article also describes progress on prototype implementations of some of the software resources, and the results of initial evaluations of the platform. The work is partially based on results from earlier European Union-funded research projects in the area. (shrink)

Data heterogeneity is the obstacle for the resource sharing on Semantic Web, and ontology is regarded as a solution to this problem. However, since different ontologies are constructed and maintained independently, there also exists the heterogeneity problem between ontologies. Ontology matching is able to identify the semantic correspondences of entities in different ontologies, which is an effective method to address the ontology heterogeneity problem. Due to huge memory consumption and long runtime, the performance of the existing ontology matching techniques (...) requires further improvement. In this work, an extended compact genetic algorithm-based ontology entity matching technique is proposed, which uses both the compact encoding mechanism and linkage learning approach to match the ontologies efficiently. Compact encoding mechanism does not need to store and maintain the whole population in the memory during the evolving process, and the utilization of linkage learning protects the chromosome’s building blocks, which is able to reduce the algorithm’s running time and ensure the alignment’s quality. In the experiment, ECGA-OEM is compared with the participants of ontology alignment evaluation initiative and the state-of-the-art ontology matching techniques, and the experimental results show that ECGA-OEM is both effective and efficient. (shrink)

As a result of the time‐ and context‐dependency of gene expression, gene regulatory and signaling pathways undergo dynamic changes during development. Creating a model of the dynamics of molecular interaction networks offers enormous potential for understanding how a genome orchestrates the developmental processes of an organism. The dynamic nature of pathway topology calls for new modeling strategies that can capture transient molecular links at the runtime. The aim of this paper is to present a brief and informative, but not (...) all‐inclusive, viewpoint on the computational aspects of modeling and simulation of a non‐static molecular network. BioEssays 26:68–72, 2004. © 2003 Wiley Periodicals, Inc. (shrink)

This paper presents a platform for developing, testing and executing synchronous collaborative applications in a distributed, heterogeneous environment. Even though several environments exist nowadays, specific problems are not treated satisfactorily. Especially in ‘real’ network environments, problems like unstable network connections and low bandwidths have to be considered.The DreamTeam platform addresses the special needs of environments with non-optimal characteristics which can, be found in distance learning scenarios. DreamTeam comprises a development environment, a simulation environment and a runtime environment; it is (...) based upon the concept of a fully decentralised architecture and encourages rapid prototyping.DreamTeam supports developers of shared applications through a component concept. Using components helps to divide a software project into well-defined parts. Well-documented interfaces help to reduce integration efforts and improve software quality. A selection of sample applications with DreamTeam validates our design concept. (shrink)