ppxscal/embedding_network huggingface dataset:
Real time Java on resource-constrained platforms with Fiji VM
Authors: Filip Pizlo, Lukasz Ziarek, Jan Vitek
Venue: Proceedings of the 7th International Workshop on Java Technologies for Real-Time and Embedded Systems (2009)

Real-time Java is quickly emerging as a platform for building safety-critical embedded systems. The real-time variants of Java, including [8, 15], are attractive alternatives to Ada and C since they provide a cleaner, simpler, and safer programming model. Unfortunately, current real-time Java implementations have trouble scaling down to very hard real-time embedded settings, where memory is scarce and processing power is limited. In this paper, we describe the architecture of the Fiji VM, which enables vanilla Java applications to run in very hard environments, including booting on bare hardware with only very rudimentary operating system support. We also show that our minimalistic approach delivers comparable performance to that of server-class production Java Virtual Machine implementations.
Partial intrinsic reflectional symmetry of 3D shapes
Authors: Kai Xu, Hao Zhang, Andrea Tagliasacchi, Ligang Liu, Guo Li, Min Meng, Yueshan Xiong
Venue: ACM Transactions on Graphics (TOG) (2009)

While many 3D objects exhibit various forms of global symmetries, prominent intrinsic symmetries which exist only on parts of an object are also well recognized. Such partial symmetries are often seen as more natural than a global one, even when the symmetric parts are under complex pose. We introduce an algorithm to extract partial intrinsic reflectional symmetries (PIRS) of a 3D shape. Given a closed 2-manifold mesh, we develop a voting scheme to obtain an intrinsic reflectional symmetry axis (IRSA) transform, which is a scalar field over the mesh that accentuates prominent IRSAs of the shape. We then extract a set of explicit IRSA curves on the shape based on a refined measure of local reflectional symmetry support along a curve. The iterative refinement procedure combines IRSA-induced region growing and region-constrained symmetry support refinement to improve accuracy and address potential issues arising from rotational symmetries in the shape. We show how the extracted IRSA curves can be incorporated into a conventional mesh segmentation scheme so that the implied symmetry cues can be utilized to obtain more meaningful results. We also demonstrate the use of IRSA curves for symmetry-driven part repair.
Learning Contract Management and Administration Using a Simulated Game Environment
Authors: Andrew Agapiou, Paul Maharg, Emma Nicol
Venue: Proceedings of the 2009 Second International Conference in Visualisation (2009)

Built Environment education entails the acquisition of complex technical knowledge by students. Currently, the conventional lecture format is the dominant educational method used, with the main principle being that of information transfer. As the required knowledge base increases, so the ability of the students to effectively absorb and use information is reduced.There is, therefore, an identifiable need to establish alternative modes of learning for students. To address this challenge, Strathclyde University has developed an approach to professional simulations called SIMPLE (SIMulated Professional Learning Environment). One aspect of the project focuses on developing an interactive digital, simulated learning environment to enable postgraduate Architecture students to learn some aspects of the Management, Practice and Law syllabus. This paper describes the design, pedagogical structure, implementation and evaluation of the SIMPLE simulation within this module. The results of the evaluation show that the teaching strategies of critical observation followed by critical imitation help students understand the transition from knowledge of first principles as presented in lectures to applied knowledge.
Proceedings of the Workshop on Multiword Expressions: Integrating Processing
Venue: ACL Workshops (2004)

This is the proceedings of the second ACL workshop on multiword expressions (MWEs). MWEs are increasingly being singled out as a problem for NLP, particularly for the many applications which require some degree of semantic interpretation and require tasks such as parsing and word sense disambiguation. In the call for papers we solicited papers that especially laid emphasis on integrating analysis, acquisition and treatment of various kinds of multiword expressions in natural language NLP. For example, research that combines a linguistic analysis with a method of automatically acquiring the classes described, work that combines the computational treatment of a class of MWEs with a solid linguistic analysis and research that extracts MWEs and either classifies them or uses them in some task. We received 23 submissions (3 from Asia, 11 from Europe and 9 from the Americas), and accepted 11 of them for presentation, with two reserves. Each submission was reviewed by three members of the program committee, who not only judged each submission but also gave detailed comments to the authors. The overall quality of submissions was high, making the final selection very difficult. The papers in these proceedings are those which were finally selected for presentation. Many of the papers deal with MWEs in general, rather than aiming at specific subtypes, with examples from a wide range of languages (Basque, English, Japanese, Portuguese, Russian and Turkish). There were also a variety of formalisms considered (dependency grammar, finite state machines, lexical conceptual structure, HPSG, . . . ) as well as more descriptive papers. The main applications targeted were machine translation and information retrieval.
Wikipedia-Graph Based Key Concept Extraction towards News Analysis
Authors: Baoyao Zhou, Ping Luo, Yuhong Xiong, Wei Liu
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

The well-known Wikipedia can serve as a comprehensive knowledge repository to facilitate textual content analysis, due to its abundance, high quality and well-structuring. In this paper, we propose WikiRank - a Wikipedia-graph based ranking model, which can be used to extract key Wikipedia concepts from a document. These key concepts can be regarded as the most salient terms to represent the themeof the document. Different from other existing graph-based ranking algorithms, the concept graph used for ranking in this model is constructed by leveraging not only the co-occurrence relations within the local context of a document but also the preprocessed hyperlink-structure of Wikipedia. We have applied the proposed WikiRank model with the Support Propagation ranking algorithm to analyze the news articles, especially for enterprise news. These promising applications include Wikipedia Concept Linking and Enterprise Concept Cloud Generation.
Exact scheduling analysis of non-accumulatively monotonic multiframe tasks
Authors: A. Zuhily, A. Burns
Venue: Real-Time Systems (2009)

In this paper, we present exact analysis for the worst case response time of the general multiframe (MF) task model executing on a uniprocessor according to the fixed priority scheduling scheme. The analysis is developed in four stages. Firstly, we present the basic response time analysis where we optimize the number of frames that have to be considered in such analysis; we show how their number can be significantly reduced by eliminating non critical frames that are dominated by other frames. Secondly, we extend this analysis to be applicable to MF tasks with arbitrary deadlines. Thirdly, the basic analysis is extended to cope with frame specific deadlines. Lastly, the two models of frame specific deadlines and arbitrary deadlines are combined and the relative analysis is presented. An optimal priority assignment scheme for the frame specific deadline scenario is also presented in this paper.
Real-time identification of operating room state from video
Authors: Beenish Bhatia, Tim Oates, Yan Xiao, Peter Hu
Venue: Proceedings of the 19th national conference on Innovative applications of artificial intelligence - Volume 2 (2007)

Managers of operating rooms (ORs) and of units upstream (e.g., ambulatory surgery) and downstream (e.g., intensive care and post-anesthesia care) of the OR require real-time information about OR occupancy. Which ORs are in use, and when will each ongoing operation end? This information is used to make decisions about how to assign staff, when to prepare patients for the OR, when to schedule add-on cases, when to move cases, and how to prioritize room cleanups (Dexter et at. 2004). It is typically gathered by OR managers manually, by walking to each OR and estimating the time to case completion. This paper presents a system for determining the state of an ongoing operation automatically from video. Support vector machines are trained to identify relevant image features, and hidden Markov models are trained to use these features to compute a sequence of OR states from the video. The system was tested on video captured over a 24 hour period in one of the 19 operating rooms in Baltimore's R. Adams Crowley Shock Trauma Center. It was found to be more accurate and have less delay while providing more fine-grained state information than the current state-of-the-art system based on patient vital signs used by the Shock Trauma Center.
Strong performance guarantees for asynchronous buffered crossbar scheduler
Authors: Jonathan S. Turner
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

Crossbar-based switches are commonly used to implement routers with throughputs up to about 1 Tb/s. The advent of crossbar scheduling algorithms that provide strong performance guarantees now makes it possible to engineer systems that perform well, even under extreme traffic conditions. Until recently, such performance guarantees have only been developed for crossbars that switch cells rather than variable length packets. Cell-based crossbars incur a worst-case bandwidth penalty of up to a factor of two, since they must fragment variable length packets into fixed length cells. In addition, schedulers for cell-based crossbars may fail to deliver the expected performance guarantees when used in routers that forward packets. We show how to obtain performance guarantees for asynchronous crossbars that are directly comparable to those previously developed for synchronous, cell-based crossbars. In particular we define derivatives of the Group by Virtual Output Queue (GVOQ) scheduler of Chuang et al. and the Least Occupied Output First Scheduler of Krishna et al. and show that both can provide strong performance guarantees in systems with speedup 2. Specifically, we show that these schedulers are work-conserving and that they can emulate an output-queued switch using any queueing discipline in the class of restricted Push-In, First-Out queueing disciplines. We also show that there are schedulers for segment-based crossbars, (introduced recently by Katevenis and Passas) that can deliver strong performance guarantees with small buffer requirements and no bandwidth fragmentation.
Total outer-connected domination numbers of trees
Authors: Joanna Cyman, Joanna Raczek
Venue: Discrete Applied Mathematics (2009)

Let G=(V,E) be a graph without an isolated vertex. A set D@?V(G) is a total dominating set if D is dominating, and the induced subgraph G[D] does not contain an isolated vertex. The total domination number of G is the minimum cardinality of a total dominating set of G. A set D@?V(G) is a total outer-connected dominating set if D is total dominating, and the induced subgraph G[V(G)-D] is a connected graph. The total outer-connected domination number of G is the minimum cardinality of a total outer-connected dominating set of G. We characterize trees with equal total domination and total outer-connected domination numbers. We give a lower bound for the total outer-connected domination number of trees and we characterize the extremal trees.
A New Side-Channel Attack on RSA Prime Generation
Authors: Thomas Finke, Max Gebhardt, Werner Schindler
Venue: Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems (2009)

We introduce and analyze a side-channel attack on a straight-forward implementation of the RSA key generation step. The attack exploits power information that allows to determine the number of the trial divisions for each prime candidate. Practical experiments are conducted, and countermeasures are proposed. For realistic parameters the success probability of our attack is in the order of 10---15 %.
Tempest in a Teapot: Compromising Reflections Revisited
Authors: Michael Backes, Tongbo Chen, Markus Duermuth, Hendrik P. A. Lensch, Martin Welk
Venue: Proceedings of the 2009 30th IEEE Symposium on Security and Privacy (2009)

Reflecting objects such as tea pots and glasses, but also diffusely reflecting objects such as a user's shirt, can be used to spy on confidential data displayed on a monitor. First, we show how reflections in the user's eye can be exploited for spying on confidential data. Second, we investigate to what extent monitor images can be reconstructed from the diffuse reflections on a wall or the user's clothes, and provide information-theoretic bounds limiting this type of attack. Third, we evaluate the effectiveness of several countermeasures. This substantially improves previous work (Backes et al., IEEE Symposium on Security & Privacy, 2008).
A Coalgebraic Characterization of Behaviours in the Linear Time --- Branching Time Spectrum
Authors: Luís Monteiro
Venue: Recent Trends in Algebraic Development Techniques: 19th International Workshop, WADT 2008, Pisa, Italy, June 13-16, 2008, Revised Selected Papers (2009)

The paper outlines an approach for characterizing several kinds of behaviours for transition systems in coalgebraic terms and illustrates the approach with some behaviours in the linear time --- branching time spectrum, namely, traces, ready-traces and failures. The approach is based on an abstract notion of "behaviour object" that can be defined in any (concrete) category and enjoys a uniqueness property similar to the uniqueness of morphisms to final objects. That property makes behaviour objects final in a suitable extension of the given category with additional morphisms, which allows to define the behaviours of arbitrary objects by the unique morphisms to the behaviour objects. The main purpose of the paper is to show how trace, ready-trace and failure semantics can be characterized in terms of behaviour objects. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
A Routing Protocol for Data Centric Storage in Location Ignorant Sensor Networks
Authors: Yansheng Zhang, Dancheng Li, Zhiliang Zhu
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 02 (2009)

Presently available schemes for data centric storage in sensor networks usually use geographical routing protocols to communicate data between sensor nodes. However, sensor nodes are required to know their locations for them to use geographical routing protocols. In this paper, we propose a new routing protocol that does not rely on location information, and thus can be used for data centric storage in the sensor networks where location information is not available.
Multi-granularity Parallel Computing in a Genome-Scale Molecular Evolution Application
Authors: Jesse D. Walters, Thomas B. Bair, Terry A. Braun, Todd E. Scheetz, John P. Robinson, Thomas L. Casavant
Venue: Proceedings of the 10th International Conference on Parallel Computing Technologies (2009)

Previously [1], we reported a coarse-grained parallel computational approach to identifying rare molecular evolutionary events often referred to as horizontal gene transfers. Very high degrees of parallelism (up to 65x speedup on 4,096 processors) were reported, yet the overall execution time for a realistic problem size was still on the order of 12 days. With the availability of large numbers of compute clusters, as well as genomic sequence from more than 2,000 species containing as many as 35,000 genes each, and trillions of sequence nucleotides in all, we demonstrated the computational feasibility of a method to examine "clusters" of genes using phylogenetic tree similarity as a distance metric. A full serial solution to this problem requires years of CPU time, yet only makes modest IPC and memory demands; thus, it is an ideal candidate for a grid computing approach involving low-cost compute nodes. This paper now describes a multiple granularity parallelism solution that includes exploitation of multi-core shared memory nodes to address fine-grained aspects in the tree-clustering phase of our previous deployment of XenoCluster 1.0. In addition to benchmarking results that show up to 80% speedup efficiency on 8 CPU cores, we report on the biological accuracy and relevance of our results compared to a reported set of known xenologs in yeast.
The Role of Personal and Shared Displays in Scripted Collaborative Learning
Authors: Sara Streng
Venue: Proceedings of the 12th IFIP TC 13 International Conference on Human-Computer Interaction: Part II (2009)

Applying technologies in collaborative learning is an important but difficult task. In this work I will investigate ways of supporting "scripted" collaborative learning with technologies. "Scripted" means that the learning phases, activities and tasks are predefined by educationalists to provide some form of guidance. In particular, I focus on the role of personal and shared displays in different learning phases. Furthermore, I examine how user interfaces can be designed in a way that guides the learner's activities. The proposed contribution is a set of guidelines as well as a software framework that support the creation of scripted collaborative learning applications.
Mathematical modeling and solving procedure of the planar storage location assignment problem
Authors: Changkyu Park, Junyong Seo
Venue: Computers and Industrial Engineering (2009)

This paper focuses on the planar storage location assignment problem (PSLAP) that needs to be clearly defined and newly formulated. In addition, the solving procedure should be developed. The PSLAP can be defined as the assignment of the inbound and outbound objects to the storage yard with aim of minimizing the number of obstructive object moves. The storage yard allows only planar moves of objects. The PSLAP usually occurs in the assembly block stockyard operations at a shipyard. This paper formulates the PSLAP using a mathematical programming model, but which belongs to the NP-hard problems category. Thus this paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances. The performance of the proposed mathematical programming model and developed GA is verified by a number of numerical experiments.
A diagrammatic approach to model transformations
Authors: Adrian Rutle, Uwe Wolter, Yngve Lamo
Venue: Proceedings of the 2008 Euro American Conference on Telematics and Information Systems (2008)

The raise of the abstraction level of programming languages has resulted in the usage of models and model transformations in software development processes. As a consequence of the usage of models as input to model transformation tools, there is a need for formal modeling languages and formal transformation definition techniques which can be employed to automatically translate between (and integrate) models. Therefore, a major focus of our research is on the formalization of modeling and model transformation in the generic formalism, Diagrammatic Predicate Logic (DPL). In this paper, we discuss a formalization approach to model transformation definitions based on DPL. Then, based on this formalization, some features of model transformations such as traceability, bidirectionality and compositionality are discussed.
Evaluating Three Scrutability and Three Privacy User Privileges for a Scrutable User Modelling Infrastructure
Authors: Demetris Kyriacou, Hugh C. Davis, Thanassis Tiropanis
Venue: Proceedings of the 17th International Conference on User Modeling, Adaptation, and Personalization: formerly UM and AH (2009)

This paper describes the evaluation of a Scrutable User Modelling Infrastructure. SUMI is intended to form a service to allow users to share their user models from social e-networking and e-commerce providers to educational systems. The model is scrutable, meaning users can inspect and correct the data that is held about them, and implements privacy policies so that users can control how their models are accessed by other users. This evaluation was conducted with 107 users, which were exposed to a prototype service, for determining whether the proposed scrutability and privacy privileges were acceptable to the users, whether the users were able to achieve the desired outcome, and whether they understood the consequences of their interactions with the system. The conclusions show that the users expressed their general approval of the proposed privileges while making useful suggestions regarding improvements to the presentation and interface to the system.
Living Labs as a Methodological Approach to Universal Access in Senior Design
Authors: Julie Christiane Thiesen Winthereik, Lone Malmborg, Tanja Belinda Andersen
Venue: Proceedings of the 5th International Conference on Universal Access in Human-Computer Interaction. Addressing Diversity. Part I: Held as Part of HCI International 2009 (2009)

In this paper we discuss the potential of using the Living Lab methodology as an approach to ensuring universal access when designing for senior citizens. Our understanding of Living Labs is based on a recent study of 32 Living Labs cases, identifying central activities and issues in different applications of the methodology. We describe a Danish Living Lab project initiated to design for better quality of life for senior citizens in Sølund, a nursing home in Copenhagen. Two crucial concepts from the Living Lab methodology --- co-creation and context --- act as the core concepts for our analysis of user participation and universal access in Living Labs in general and in the Sølund Living Lab specifically. In our conclusion we suggest areas that should be given special attention when designing Living Lab projects and selecting user participants.
Java Test Driver Generation from Object-Oriented Interaction Traces
Authors: Frank S. de Boer, Marcello B. Bonsangue, Andreas Grüner, Martin Steffen
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

In the context of test-driven development for object-oriented programs, mock objects are increasingly used for unit testing. Several Java mock object frameworks exist, which all have in common that mock objects, realizing the test environment, are directly specified at the Java program level. Though using directly the programming language may facilitate acceptance by software developers at first sight, the entailed syntax noise sometimes distracts from the actual test specification, speaking about interaction traces. We propose a Java-like test specification language, which allows to describe the behavior of the test harness in terms of the expected interaction traces between the program and its environment. The language is tailor-made for Java, e.g., in that it reflects the nested calls and return structure of thread-based interaction at the interface. From a given trace specification, a testing environment, i.e., a set of classes for mock objects, is synthesized. The design of the specification language is a careful balance between two goals: using programming constructs in Java-like notation helps the programmer to specify the interaction without having to learn a completely new specification notation. On the other hand, additional expressions in the specification language allow to specify the desired trace behavior in a concise, abstract way, hiding the intricacies of the required synchronization code at the lower-level programming language.