ppxscal/embedding_network huggingface dataset:
Specification and runtime monitoring of object-oriented systems
Authors: Neelam Soundarajan
Venue:  (2006)

The object-oriented (OO) approach has fundamentally changed the way we look at software, and has had an enormous influence on the software engineering discipline. Through the use of powerful tools such as inheritance and polymorphism, developers can specialize and enhance software systems while reusing large portions of already existing code. However, the use of these features can result in complex interactions and dependencies among parts of the code, which may make it difficult when trying to understand and reason about the system's behavior. We will show how such difficulties can be addressed by the use of specifications which provide essential information about how the system can interact with external components. Although such specifications allow us to formally reason about systems in a modular way, to fully realize their benefits, we also need suitable software tools that can be used by general practitioners. Here, we present such a tool which allows for monitoring of systems at runtime to identify any violations of these specifications. The tool exploits the same mechanisms of inheritance and polymorphism, and does not require the availability of the system source code. We will also look at how a similar approach can be applied to track the execution flow through OO class hierarchies. Design patterns, a progression from class-level to design-level OO reuse, have also had a large impact on the way we think about and design large software systems. Not only do patterns allow for the reuse of time-tested solutions, but they also enable others studying the system in question to get a deeper understanding of how the system is built and why it behaves in particular ways. Design patterns have traditionally been presented in an informal manner, however, and such descriptions often contain ambiguities that can lead to different interpretations and assumptions made about specific parts of the system. This can result in misunderstandings among developers working on the same project, and can eventually manifest themselves as incompatibilities among different parts of the system. Hence, we again need ways to precisely specify behaviors of patterns and systems built using them, as well as software tools to monitor the systems to identify any violations of the specifications. We present a pattern contract language that addresses the specificity of individual applications, while maintaining the flexibility inherent in the design patterns. We then present a tool which generates aspect-oriented monitors for checking pattern contract violations during runtime.
Analysis of Markov reward models using zero-suppressed multi-terminal BDDs
Authors: K. Lampka, M. Siegle
Venue: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools (2006)

High-level stochastic description methods such as stochastic Petri nets, stochastic UML statecharts etc., together with specifications of performance variables (PVs), enable a compact description of systems and quantitative measures of interest. The underlying Markov reward models (MRMs) often exhibit a significant blow-up in size, commonly known as the state space explosion problem. In this paper we employ our recently developed type of symbolic data structure, zero-suppressed multi-terminal binary decision diagram (ZDD). In addition to earlier work [12] the following innovations are introduced: (a) new algorithms for efficiently generating ZDD-based representation of user-defined PVs, (b) a new ZDD-based variant of the approach of [17] for computing state probabilities, and (c) a new ZDD-based algorithm for computing moments of the PVs. These contributions yield a ZDD-based framework which allows the computation of complex performance and reliability measures of high-level system specifications, whose underlying MRMs consist of more than 108 states. The proposed algorithms for generating user-defined PVs and computing their moments are independent of the employed symbolic data type. Thus they are highly suited to fit into other symbolic frameworks as realized in popular performance evaluation tools. The efficiency of the presented approach, which we incorporated into the M&ouml;bius modeling framework [16], is demonstrated by analyzing several benchmark models from the literature and comparing the obtained run-time data to other techniques.
Reducing control overhead in dataflow architectures
Authors: Andrew Petersen, Andrew Putnam, Martha Mercaldi, Andrew Schwerin, Susan Eggers, Steve Swanson, Mark Oskin
Venue: Proceedings of the 15th international conference on Parallel architectures and compilation techniques (2006)

In recent years, computer architects have proposed tiled architectures in response to several emerging problems in processor design, such as design complexity, wire delay, and fabrication reliability. One of these architectures, WaveScalar, uses a dynamic, tagged-token dataflow execution model to simplify the design of the processor tiles and their interconnection network and to achieve good parallel performance. However, using a dataflow execution model reawakens old problems, including the instruction overhead required for control flow. Previous work compiling the functional language Id to the Monsoon Dataflow System found this overhead to be 2–3× that of programs written in C and targeted to a MIPS R3000.In this paper, we present and analyze three compiler optimizations that significantly reduce control overhead with minimal additional hardware. We begin by describing how to translate imperative code into dataflow assembly and analyze the resulting control overhead. We report a similar 2–4× instruction overhead, which suggests that the execution model, rather than a specific source language or target architecture, is responsible. Then, we present the compiler optimizations, each of which is designed to eliminate a particular type of control overhead, and analyze the extent to which they were able to do so. Finally, we evaluate the effect using all optimizations together has on program performance. Together, the optimizations reduce control overhead by 80% on average, increasing application performance between 21–37%.
An Empirical Study on Voice-Enabled Web Applications
Authors: Shuchih Ernest Chang, Michael S. H. Heng
Venue: IEEE Pervasive Computing (2006)

Although most users access Web applications using Web browser interfaces, pervasive computing offers new ways of accessing Internet applications from any device at any location. Pervasive computing technology impacts consumer attitudes, and the authors studied consumers' acceptance rate toward new pervasive interfaces using various attributes and factors. The study was undertaken in Taiwan, with the cellular phone chosen as the pervasive device for accessing an Internet application prototype--a voice-enabled Web system--through voice user interface technology. The study result showed that Handling was the most important factor in using a voice-enabled Web system. The article's findings can help with the design and
Neural Circuits Involved in the Recognition of Actions Performed by Nonconspecifics: An fMRI Study
Authors: Giovanni Buccino, Fausta Lui, Nicola Canessa, Ilaria Patteri, Giovanna Lagravinese, Francesca Benuzzi, Carlo A. Porro, Giacomo Rizzolatti
Venue: Journal of Cognitive Neuroscience (2004)

Functional magnetic resonance imaging was used to assess the cortical areas active during the observation of mouth actions performed by humans and by individuals belonging to other species (monkey and dog). Two types of actions were presented: biting and oral communicative actions (speech reading, lip-smacking, barking). As a control, static images of the same actions were shown. Observation of biting, regardless of the species of the individual performing the action, determined two activation foci (one rostral and one caudal) in the inferior parietal lobule and an activation of the pars opercularis of the inferior frontal gyrus and the adjacent ventral premotor cortex. The left rostral parietal focus (possibly BA 40) and the left premotor focus were very similar in all three conditions, while the right side foci were stronger during the observation of actions made by conspecifics. The observation of speech reading activated the left pars opercularis of the inferior frontal gyrus, the observation of lip-smacking activated a small focus in the pars opercularis bilaterally, and the observation of barking did not produce any activation in the frontal lobe. Observation of all types of mouth actions induced activation of extrastriate occipital areas. These results suggest that actions made by other individuals may be recognized through different mechanisms. Actions belonging to the motor repertoire of the observer (e.g., biting and speech reading) are mapped on the observer's motor system. Actions that do not belong to this repertoire (e.g., barking) are essentially recognized based on their visual properties. We propose that when the motor representation of the observed action is activated, the observer gains knowledge of the observed action in a "personal" perspective, while this perspective is lacking when there is no motor activation.
Cross-layer Architecture of a Distributed OS for Ad Hoc Networks
Authors: Peter Janacik, Tales Heimfarth
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Despite the advances in wireless, energy-constrained ad hoc networks, there are still many challenges due to the limited capabilities of the current hardware. Therefore, our aim is to develop a lightweight, yet powerful operating system (OS) for such networks. We reject the brute force method of provisioning all necessary OS services at each node of the system. Instead, in our approach, services provided by the OS organise autonomously to achieve an efficient distribution over the network. In order to enable the use of our OS in energy- and hardware-constrained networks, we argue that it is necessary that all layers of the system are designed to cooperate within a cross-layer approach. At the link layer, our contribution includes an emergent topology control protocol taking into account node and network properties enabling the division of roles between nodes. Further, we employ a combined link metric based on signal strength, success rate, and history to enable a more realistic link quality assessment and pheromone adjustments in routing. At the network layer, to avoid costly reorganisation after role changes incurred by topology control, we use a fuzzy distinction between nodes with different roles by adding a role-based component to the probabilistic next-hop selection function of ant colony routing. At the highest level of our approach, we propose a short- and a long-range migration method for OS service states, based solely on local information and autonomous decisions, to improve the overall quality of service, fairness, balance, predictability, and reduce communication overhead. In ns- 2 simulations, we demonstrate improvements of quality of service of 80 % and load balancing of 200 to 400 %.
Mining Association Rules from a Collection of XML Documents using Cross Filtering Algorithm
Authors: Jun Shin, Juryon Paik, Ungmo Kim
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Since numerous data have been represented and exchanged by XML, the ability to extract useful knowledge from XML data is needed. There are several attempts to mine Association Rules from XML data. However, they mostly rely on legacy relational database with an XML interface so that efficiency and simplicity are challenging issue. In this paper,HILoP(Hierarchical layered structure of PairSet) is introduced. The use of this data structure prevent from multiple XML data scans to mine Association Rules from a Collection of XML Documents. Also. Cross filtering algorithm is introduced to mine frequent patterns, the algorithm reduces the number of candidate set. The performance evaluation result shows that this mechanism is powerful enough to represent both simple and complex structured association relationships inherent in XML data.
Efficient process interaction simulation in Java: implementing co-routines within a single Java thread
Authors: Richard M. Weatherly, Ernest H. Page
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The genesis of a research effort to develop a Java-based process-oriented simulation framework is described. A key enabler to the framework is an efficient co-routine mechanism implemented within the context of a single Java thread. A design for such a co-routine mechanism is described and some initial results of an implementation within the IBM Jikes Reference Virtual Machine are given.
Does the future of modeling and simulation have a game face?
Authors: Michael Zyda
Venue: Proceedings of the 36th conference on Winter simulation (2004)

The MOVES Institute's mission is research, application and education in the grand challenges of modeling, virtual environments and simulation (MOVES). The institute's focus is on 3D visual simulation, networked virtual environments, computer-generated autonomy, human performance engineering, immersive technologies, defense/entertainment collaboration, and combat modeling and analysis. In networked virtual environments, we are architecting the technology that allows us to build large-scale, dynamically extensible virtual environments, virtual environments that are semantically interoperable and always on. In computer-generated autonomy, we are building a scenario engine for determining the space of potential outcomes from a virtual description of an infrastructure, a set of policies, characters and cultural behaviors. In immersive technologies, we have designed a source-less tracker that is micromachinable, and have performed considerable work on the deployment of sound to enhance the feeling of immersion. In defense/entertainment collaboration, we have constructed a PC game, America's Army, that provides the experience of a potential career in the Army. America's Army has become the fastest growing online PC game in history, a game that has been the recipient of several "best game" or "runner up for best game" of the year awards. Since the release of America's Army, the number one question being asked of our institute is will the next generation of training and combat modeling systems have a game-like face? In this talk, we answer that question and discuss the potential that game technology has for the future of modeling and simulation.
Convergent Tree-Reweighted Message Passing for Energy Minimization
Authors: Vladimir Kolmogorov
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Algorithms for discrete energy minimization are of fundamental importance in computer vision. In this paper, we focus on the recent technique proposed by Wainwright et al. [33]—tree-reweighted max-product message passing (TRW). It was inspired by the problem of maximizing a lower bound on the energy. However, the algorithm is not guaranteed to increase this bound—it may actually go down. In addition, TRW does not always converge. We develop a modification of this algorithm which we call sequential tree-reweighted message passing. Its main property is that the bound is guaranteed not to decrease. We also give a weak tree agreement condition which characterizes local maxima of the bound with respect to TRW algorithms. We prove that our algorithm has a limit point that achieves weak tree agreement. Finally, we show that, our algorithm requires half as much memory as traditional message passing approaches. Experimental results demonstrate that on certain synthetic and real problems, our algorithm outperforms both the ordinary belief propagation and tree-reweighted algorithm in [33]. In addition, on stereo problems with Potts interactions, we obtain a lower energy than graph cuts.
User perception of adapting video quality
Authors: Nicola Cranley, Philip Perry, Liam Murphy
Venue: International Journal of Human-Computer Studies (2006)

In general, video quality adaptation and video quality evaluation are distinct activities. Most adaptive delivery mechanisms for streaming multimedia content do not explicitly consider user-perceived quality when making adaptation decisions. Equally, video quality evaluation techniques are not designed to evaluate instantaneous quality where the quality is changing over time. We propose that an Optimal Adaptation Trajectory (OAT) through the set of possible encoding exists, and that it indicates how to adapt encoding quality in response to changes in network conditions in order to maximize user-perceived quality. The subjective and objective tests carried out to find such trajectories for a number of different MPEG-4 video clips are described. Experimental subjective testing results are presented that demonstrate the dynamic nature of user perception with adapting multimedia. The results demonstrate that adaptation using the OAT out-performs conventional adaptation strategies in which only a single aspect of the video quality is adapted. In contrast, the OAT provides a mechanism to adapt multiple aspects of the video quality thereby giving better user-perceived quality in both the short and long term.
Similarity and originality in code: plagiarism and normal variation in student assignments
Authors: Samuel Mann, Zelda Frew
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

This paper examines the relationship between plagiarism and normal variation in student programming assignments. Reasons why code might be similar, both innocuous and suspicious are described. Free text searching and structural metrics are used to examine a set of programming assignments. These metrics are used as the basis for analysis of the variability in the student assignments and the processes used by the students. The boundary between normal practice and plagiarism is examined by "forced plagiarism". Finally we briefly examine student understanding of cheating and normal work processes. The investigation of similarity has provided some clarity to the ambiguous fine line of un/acceptable practice.
Tools for Discovery Learning and Generating Educational Sequences for Software Engineering
Authors: Noriko Hanakawa
Venue: Proceedings of the 19th Conference on Software Engineering Education and Training Workshops (2006)

We propose a new tool for discovery learning of software engineering. The tool consists of two components: a simulator for software development project and a generator of educational sequences. After students use the simulator for learning by discovery, the generator produces an educational sequence tailored to the individual student. This educational sequence includes feedback materials for students with inadequate ability. As a result, the tool provides even a student of software engineering who has insufficient knowledge about designing and programming with a most effective educational sequence
Learnability of term rewrite systems from positive examples
Authors: M. R. K. Krishna Rao
Venue: Proceedings of the 12th Computing: The Australasian Theroy Symposium - Volume 51 (2006)

Learning from examples is an important characteristic feature of intelligence in both natural and artificial intelligent agents. In this paper, we study learnability of term rewriting systems from positive examples alone. We define a class of linear-bounded term rewriting systems that are inferable from positive examples. In linear-bounded term rewriting systems, nesting of defined symbols is allowed in right-hand sides, unlike the class of flat systems considered in Krishna Rao [8]. The class of linear-bounded TRSs is rich enough to include many divide-and-conquer programs like addition, logarithm, tree-count, list-count, split, append, reverse etc.
Silicon Optics Aims to Combine the Best of Both Worlds
Authors: David Geer
Venue: Computer (2006)

To reduce the equipment costs and bring optical systems within the reach of more users, vendors are attempting to use CMOS technology to fabricate optical components on silicon.
Fully Pre-Splicing TCP for Web Switches
Authors: Yeim-Kuan Chang, Wen-Hsin Cheng, Chung-Ping Young
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Fully pre-splicing (FPS) is an extension of TCP splicing which is content-blind that prevents the switches from using application layer information for forwarding decisions. FPS extends TCP splicing to support contentaware load balancing algorithms and pre-splices the client's connections to web servers. In addition, FPS extracts the application information in kernel-space for eliminating the cost of moving data twice through user/kernel protection boundaries and the latency of scheduling the processes. To achieve our design, we extended the TCPSP project of LVS using Linux Netfilter which defines specific hooks to provide a verdict for the packet. On the performance results, FPS improves the TCPSP throughput dramatically.
Using Global Optimization to Estimate Population Class Sizes
Authors: Betsy S. Greenberg, Leon S. Lasdon
Venue: Journal of Global Optimization (2006)

In this paper we formulate a nonlinear optimization model to estimate population class sizes based on sample information. The model is nonconvex and has several local minima corresponding to different populations that could have been the source of the sample data. We show that many if not all local solutions can be found using a new global optimization algorithm called OptQuest/NLP (OQNLP). This can be used to estimate the number of individuals in a population with unique or rarely occurring characteristics, which is useful for assessing disclosure risk. It can also be used to estimate the number of classes in a population, a problem with applications in a variety of disciplines.
Dataflow Predication
Authors: Aaron Smith, Ramadass Nagarajan, Karthikeyan Sankaralingam, Robert McDonald, Doug Burger, Stephen W. Keckler, Kathryn S. McKinley
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Predication facilitates high-bandwidth fetch and large static scheduling regions, but has typically been too complex to implement comprehensively in out-of-ordermicroarchitectures. This paper describes dataflow predication, which provides per-instruction predication in a dataflow ISA, low predication computation overheads similar to VLIW ISAs, and low complexity out-of-order issue. A twobit field in each instruction specifies whether an instruction is predicated, in which case, an arriving predicate token determines whether an instruction should execute. Dataflow predication incorporates three features that reduce predication overheads. First, dataflow predicate computation permits computation of compound predicates with virtually no overhead instructions. Second, early mispredication termination squashes in-flight instructions with false predicates at any time, eliminating the overhead of falsely predicated paths. Finally, implicit predication mitigates the fanout overhead of dataflow predicates by reducing the number of explicitly predicated instructions, by predicating only the heads of dependence chains. Dataflow predication also exposes new compiler optimizations-such as disjoint instruction merging and path-sensitive predicate removal-for increased performance of predicated code in an out-of-order design.
Axioms for classical, intuitionistic, and paraconsistent hybrid logic
Authors: Torben Braüner
Venue: Journal of Logic, Language and Information (2006)

In this paper we give axiom systems for classical and intuitionistic hybrid logic. Our axiom systems can be extended with additional rules corresponding to conditions on the accessibility relation expressed by so-called geometric theories. In the classical case other axiomatisations than ours can be found in the literature but in the intuitionistic case no axiomatisations have been published. We consider plain intuitionistic hybrid logic as well as a hybridized version of the constructive and paraconsistent logic N4.