On location observability notions for switching systems

The focus of this paper is on the analysis of initial discrete state distinguishability notions for switching systems, in a discrete time setting. Moreover, the relationship between initial discrete state distinguishability and the problem of reconstructing the current discrete state is addressed.     

Illustrating volume data sets and layered models with importance-aware composition

Non-photorealistic (illustrative) rendering augments typical rendering models to selectively emphasize or de-emphasize specific structures of rendered objects. Illustrative techniques may affect not only the rendering style of specific portions of an object but also their visibility, ensuring that less important regions do not occlude more important ones. Cutaway views completely remove occluding, unimportant structures—possibly also removing valuable context information—while existing solutions for smooth reduction of occlusion based on importance lack precise visibility control, simplicity and generality. We introduce a new front-to-back fragment composition equation that directly takes into account a measure of sample importance and allows smooth and precise importance-based visibility control. We demonstrate the generality of our composition equation with several illustrative effects, which were obtained by using a set of importance measures calculated on the fly or defined by the user. The presented composition method is suitable for direct volume rendering as well as rendering of layered 3D models. We discuss both cases and show examples, though focusing mainly on illustration of volumetric data.     

Selfish Bin Packing

Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known bin packing problem where the items are controlled by selfish agents. Each agent is charged with a cost according to the fraction of the used bin space its item requires. That is, the cost of the bin is split among the agents, proportionally to their sizes. Thus, the selfish agents prefer their items to be packed in a bin that is as full as possible. The social goal is to minimize the number of the bins used. The social cost in this case is therefore the number of bins used in the packing.     

Realizability models and implicit complexity

New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs are obtained by instantiating a semantic framework previously introduced by the authors and based on an innovative modification of realizability. The proof is a notable simplification on the original already semantic proof of soundness for the above mentioned logical systems and programming languages. A new result made possible by the semantic framework is the addition of polymorphism and a modality to LFPL, thus allowing for an internal definition of inductive datatypes. The methodology presented proceeds by assigning both abstract resource bounds in the form of elements from a resource monoid and resource-bounded computations to proofs (respectively, programs).     

Utilizing national public-key infrastructure in mobile payment systems

Payments are the locomotive behind any business domain. It has been predicted that mobile payments will become one of the most successful mobile services, and the security of payments is an important requirement. However, it is difficult to strongly authenticate mobile users remotely and provide an adequate level of non-repudiation of transactions. In this article, we argue that a nationwide public-key infrastructure supported by governmental bodies can be used in a mobile payment system. Not only does it provide strong security, but it also makes the system open to any mobile user, merchant, or financial service provider. Two payment protocols are described: one for virtual point-of-sale payments, and one for vending machine payments. We argue that such a system can be implemented using open development platforms, and its performance is adequate for enabling swift transactions. A prototype of a system which accepts virtual point-of-sale payments is implemented, and its performance and usability are evaluated.     

Multimodal support to group dynamics

The complexity of group dynamics occurring in small group interactions often hinders the performance of teams. The availability of rich multimodal information about what is going on during the meeting makes it possible to explore the possibility of providing support to dysfunctional teams from facilitation to training sessions addressing both the individuals and the group as a whole. A necessary step in this direction is that of capturing and understanding group dynamics. In this paper, we discuss a particular scenario, in which meeting participants receive multimedia feedback on their relational behaviour, as a first step towards increasing self-awareness. We describe the background and the motivation for a coding scheme for annotating meeting recordings partially inspired by the Bales’ Interaction Process Analysis. This coding scheme was aimed at identifying suitable observable behavioural sequences. The study is complemented with an experimental investigation on the acceptability of such a service.

---

Influence of temperature on the liver circadian clock in the ruin lizard Podarcis sicula

Reptiles represent an interesting animal model to investigate the influence of temperature on molecular circadian clocks. The ruin lizard Podarcis sicula lives in a continental climate and it is subjected to wide range of environmental temperatures during the course of the year. As consequence, ruin lizard daily activity pattern includes either the hibernation or periods of inactivity determined by hypothermia. Here we showed the rhythmic expression of two clock genes, lPer2 and lClock, in the liver of active lizards exposed to summer photo-thermoperiodic conditions. Interestingly, the exposition of lizards to hypothermic conditions, typical of winter season, induced a strong dampening of clock genes mRNA rhythmicity with a coincident decrease of levels. We also examined the qualitative and quantitative distribution of lPER2 and lCLOCK protein in different cellular compartments during the 24-h cycle. In the liver of active lizards both proteins showed a rhythmic expression profile in all cellular compartments. After 3 days at 6 degrees C, some temporal fluctuations of the lCLOCK and lPER2 are still detectable, although, with some marked modifications in respect to the values detected in the liver of active lizards. Besides demonstrating the influence of low temperature on the lizard liver circadian oscillators, present results could provide new essential information for comparative studies on the influence of temperature on the circadian system across vertebrate classes.     

Theorem Proving Guided Development of Formal Assertions in a Resource-Constrained Scheduler for High-Level Synthesis

This paper presents a formal specification and a proof of correctness for the widely-used Force-Directed List Scheduling (FDLS) algorithm for resource-constrained scheduling of data flow graphs in high-level synthesis systems. The proof effort is conducted using a higher-order logic theorem prover. During the proof effort many interesting properties of the FDLS algorithm are discovered. These properties are formally stated and proved in a higher-order logic theorem proving environment. These properties constitute a detailed set of formal assertions and invariants that should hold at various steps in the FDLS algorithm. They are then inserted as programming assertions in the implementation of the FDLS algorithm in a production-strength high-level synthesis system. When turned on, the programming assertions (1) certify whether a specific run of the FDLS algorithm produced correct schedules and, (2) in the event of failure, help discover and isolate programming errors in the FDLS implementation.We present a detailed example and several experiments to demonstrate the effectiveness of these assertions in discovering and isolating errors. Based on this experience, we discuss the role of the formal theorem proving exercise in developing a useful set of assertions for embedding in the scheduler code and argue that in the absence of such a formal proof checking effort, discovering such a useful set of assertions would have been an arduous if not impossible task.     

Electro-oxidation of two reactive azo dyes on boron-doped diamond electrode

Electrochemical oxidation (decolorization/degradation) of blue and red commercial reactive azo dyes was carried out on boron-doped diamond (BDD) electrode. The effect of various quantities of FeSO(4) was investigated in the electro-Fenton reaction on BDD. Progress of dyes degradation during the electrolysis and electro-Fenton reaction was monitored by UV-visible absorption and by estimation of the chemical oxygen demand (COD). Direct electrolysis showed a limiting capacity for red and blue dye removal even at high current densities, e.g. maximum red color and COD removal were 70 and 20%, respectively at 30 mA cm(-2) after 300 min. Higher red and blue color removal efficiencies were achieved by electro-Fenton oxidation. Current density of 30 mA cm(-2) in the presence of 0.05 mmol/L of FeSO(4) resulted in the red color and COD removal of 98 and 96%, respectively. The optimum FeSO(4) concentration for the electro-Fenton reaction was determined to be 0.05 mmol/L. Instantaneous current efficiency (ICE) in the presence of FeSO(4) was almost three times higher than for experiments carried out without FeSO(4).