Crystal: Integrating Structured Queries into a Tactic Language

We present the language CRStL (Control Rule Strategy Language, pronounce “crystal”) to formulate mathematical reasoning techniques as proof strategies in the context of the proof assistant Ωmega. The language is arranged in two levels, a query language to access mathematical knowledge maintained in development graphs, and a strategy language to annotate the results of these queries with further control information. The two-leveled structure of the language allows the specification of proof techniques in a declarative way. We present the syntax and semantics of CRStL and illustrate its use by examples.     

Lightweight graphics instrumentation for game state-specific power management in Android

Battery life is a major concern on portable devices like smartphones and tablet PCs. On these devices, games constitute the class of most popular applications and are at the same time highly compute-intensive. Every game consists of several states like the loading, main menu and the gaming state. Each of those states has its own workload characteristics, e.g., the loading phase is likely to be memory bound and the main menu state is less interactive than the gaming state. We propose an interception technique that allows to profile the game and detect its current state based on the game’s communication with the underlying OS. Current power management governors are unaware of the running applications and scale the processor’s voltage and frequency merely based on the system’s utilization. We provide the game’s state information and workload profile to our governor which selects the processing frequency such that the desired frame rate of the current state is ensured. This leads to an optimal choice of processing frequencies and thereby significantly reduces power consumption. We have implemented the scheme on an Android-based Samsung Galaxy Nexus smartphone using popular games like Jetpack Joyride and Temple Run. We reduced the CPU’s power consumption by up to 43.2 % compared to the Android interactive governor without impacting the gaming experience. Motivated by these results we propose a power management API that would allow game developers to significantly reduce the power consumption of their game using simple API calls.     

Uniform satisfiability problem for local temporal logics over Mazurkiewicz traces

We continue our study of the complexity of MSO-definable local temporal logics over concurrent systems that can be described by Mazurkiewicz traces. In previous papers, we showed that the satisfiability problem for any such logic is in PSPACE (provided the dependence alphabet is fixed, Gastin and Kuske (2003) [10]) and remains in PSPACE for all classical local temporal logics even if the dependence alphabet is part of the input, Gastin and Kuske (2007) [8]. In this paper, we consider the uniform satisfiability problem for arbitrary MSO-definable local temporal logics. For this problem, we prove multi-exponential lower and upper bounds that depend on the number of alternations of set quantifiers present in the chosen MSO-modalities.     

On the efficiency of bootstrap method into the analysis contingency table

The bootstrap method is a computer intensive statistical method that is widely used in performing nonparametric inference. Categorical data analysis, in particular the analysis of contingency tables, is commonly used in applied field. This work considers nonparametric bootstrap tests for the analysis of contingency tables. There are only a few research papers which exploit this field. The p-values of tests in contingency tables are discrete and should be uniformly distributed under the null hypothesis. The results of this article show that corresponding bootstrap versions work better than the standard tests. Properties of the proposed tests are illustrated and discussed using Monte Carlo simulations. This article concludes with an analytical example that examines the performance of the proposed tests and the confidence interval of the association coefficient.     

Let's Dance! The Equivocation in Chalmers' Dancing Qualia Argument

David Chalmers' dancing qualia argument is intended to show that phenomenal experiences, or qualia, are organizational invariants. The dancing qualia argument is a reductio ad absurdum, attempting to demonstrate that holding an alternative position, such as the famous inverted spectrum argument, leads one to an implausible position about the relation between consciousness and cognition. In this paper, we argue that Chalmers' dancing qualia argument fails to establish the plausibility of qualia being organizational invariants. Even stronger, we will argue that the gap in the argument cannot be closed.     

Human-centred appraoches to control and information technology: European experiences

In this paper, the concept of Human-Centred Technology will be described with regard to the different dimensions of workplace, groupwork and networks and in terms of the frameworks of both society and the natural environment. These different aspects of Human-Centred Systems will be illustrated by a series of case studies representing several European countries. The report covers a wide range of research fields. The emphasis is on technology: the roles of control and information technology in enterprises today — including issues of applying AI — and the strategies of designing and implementing technology taking into account the specific aspects which characterize human-centred systems.     

Numerical characterization and experimental verification of an in-plane MEMS-actuator with thin-film aluminum heater

In this paper, a novel concept of a thermo-mechanical MEMS actuator using aluminum thin-film heaters on a thermal oxide for electrical insulation is presented. The actuator is part of an universal tensile testing platform for thermo-mechanical material characterization of one dimensional materials on a micro- and nano-scopic scale under different environmental conditions, as varying temperatures, pressure, moisture or even vacuum and is realised in BDRIE technology. It is shown, that the actuator concept fulfills the requirements for the use in a tensile loading stage along with heterogeneously integrated nanofunctional elements, following a specimen centered approach in line with bottom-up self-assembly processes. Simulation and experiment agree very well in the thermal and mechanical domain and allow subsequent optimisation of the actuator performance.     

The ANNIGMA-wrapper approach to fast feature selection for neuralnets

This paper presents a novel feature selection approach for backpropagation neural networks (NNs). Previously, a feature selection technique known as the wrapper model was shown effective for decision trees induction. However, it is prohibitively expensive when applied to real-world neural net training characterized by large volumes of data and many feature choices. Our approach incorporates a weight analysis-based heuristic called artificial neural net input gain measurement approximation (ANNIGMA) to direct the search in the wrapper model and allows effective feature selection feasible for neural net applications. Experimental results on standard datasets show that this approach can efficiently reduce the number of features while maintaining or even improving the accuracy. We also report two successful applications of our approach in the helicopter maintenance applications.     

Rule-based agents for the semantic web

Artificial agents, subsuming both robots and software agents, represent a new paradigm in software engineering and artificial intelligence. Depending on the technologies used in their implementation, they may exhibit various skills; in particular, they may act more or less autonomously, they may be able to learn and to adapt to a changing environment, and they may be able to pursue their goals pro-actively. An artificial agent is called rule-based, if its behaviour and/or its knowledge is expressed by means of rules. In this paper, we discuss a general architecture for rule-based agents and how it can be realized with the help of semantic web languages. We also show how such agents can go live on the web by presenting an implementation in Mandarax, a Java rule platform. The concept and implementation are complemented by a running example, the portfolio agent.