ppxscal/embedding_network huggingface dataset:
Finitary winning in &omega;-regular games
Authors: Krishnendu Chatterjee, Thomas A. Henzinger, Florian Horn
Venue: ACM Transactions on Computational Logic (TOCL) (2009)

Games on graphs with &omega;-regular objectives provide a model for the control and synthesis of reactive systems. Every &omega;-regular objective can be decomposed into a safety part and a liveness part. The liveness part ensures that something good happens &ldquo;eventually.&rdquo; Two main strengths of the classical, infinite-limit formulation of liveness are robustness (independence from the granularity of transitions) and simplicity (abstraction of complicated time bounds). However, the classical liveness formulation suffers from the drawback that the time until something good happens may be unbounded. A stronger formulation of liveness, so-called finitary liveness, overcomes this drawback, while still retaining robustness and simplicity. Finitary liveness requires that there exists an unknown, fixed bound b such that something good happens within b transitions. While for one-shot liveness (reachability) objectives, classical and finitary liveness coincide, for repeated liveness (B&uuml;chi) objectives, the finitary formulation is strictly stronger. In this work we study games with finitary parity and Streett objectives. We prove the determinacy of these games, present algorithms for solving these games, and characterize the memory requirements of winning strategies. We show that finitary parity games can be solved in polynomial time, which is not known for infinitary parity games. For finitary Streett games, we give an EXPTIME algorithm and show that the problem is NP-hard. Our algorithms can be used, for example, for synthesizing controllers that do not let the response time of a system increase without bound.
Integrating Healthcare Knowledge Artifacts for Clinical Decision Support: Towards Semantic Web Based Healthcare Knowledge Morphing
Authors: Sajjad Hussain, Syed Sibte Abidi
Venue: Proceedings of the 12th Conference on Artificial Intelligence in Medicine: Artificial Intelligence in Medicine (2009)

Healthcare decision making demands the systematic integration of knowledge from multiple sources, such as clinical guidelines, clinical pathways, knowledge of practitioners and so on. We present a semantic web based approach for synthesizing health knowledge through the semantic modeling of healthcare knowledge as ontologies and reasoning over the ontologies to derive a morphed knowledge object. We demonstrate the application of our approach by generating morphed knowledge about prostate cancer clinical pathways.
Controversy Corner: An assessment of systems and software engineering scholars and institutions (2002-2006)
Authors: W. Eric Wong, T. H. Tse, Robert L. Glass, Victor R. Basili, T. Y. Chen
Venue: Journal of Systems and Software (2009)

This paper summarizes a survey of publications in the field of systems and software engineering from 2002 to 2006. The survey is an ongoing, annual event that identifies the top 15 scholars and institutions over a 5-year period. The rankings are calculated based on the number of papers published in TSE, TOSEM, JSS, SPE, EMSE, IST, and Software. The top-ranked institution is Korea Advanced Institute of Science and Technology, Korea, and the top-ranked scholar is Magne Jorgensen of Simula Research Laboratory, Norway.
The power saving mechanism with binary exponential traffic indications in the IEEE 802.16e/m
Authors: Eunju Hwang, Kyung Jae Kim, Jung Je Son, Bong Dae Choi
Venue: Queueing Systems: Theory and Applications (2009)

In IEEE 802.16e (air interface standard for MWiMAX) and IEEE 802.16m (evolution of MWiMAX for IMT-Advanced), power saving is one of the important issues for the battery-powered mobile stations (MSs). According to IEEE 802.16e standard, when an MS switches from awake mode to sleep mode, the MS is required to send a sleep request (MOB-SLP-REQ) message and to receive a sleep response (MOB-SLP-RSP) message. In this paper we propose a new sleep mode scheme, called the power saving mechanism with binary exponential traffic indications. This sleep mode scheme omits MOB-SLP-REQ/RSP messages and has a traffic indication (TRF-IND) interval as a main system parameter, applying the truncated binary exponential increasing method for its length. The proposed scheme in this paper is quite well aligned with the design policy of sleep mode in discussion at IEEE 802.16m in the sense that it tries to minimize the overhead for the state transition between awake mode and sleep mode, and hence it can reduce the delay due to the state transition and enhance the power saving efficiency. We present a mathematical analysis for the proposed scheme and investigate its performance. As performance measures, we provide the sleep interval ratio, the average power consumption, and the mean delay. Using the analytical results, the system parameters such as the initial TRF-IND interval and the maximum binary exponent for TRF-IND intervals can be optimized while satisfying the QoS constraint on the mean delay. The numerical results show that the proposed scheme consumes less energy than the power saving class of type I in the IEEE 802.16e standard.
Counting Multiplicity over Infinite Alphabets
Authors: Amaldev Manuel, R. Ramanujam
Venue: Proceedings of the 3rd International Workshop on Reachability Problems (2009)

In the theory of automata over infinite alphabets, a central difficulty is that of finding a suitable compromise between expressiveness and algorithmic complexity. We propose an automaton model where we count the multiplicity of data values on an input word. This is particularly useful when such languages represent behaviour of systems with unboundedly many processes, where system states carry such counts as summaries. A typical recognizable language is: "every process does at most k actions labelled a". We show that emptiness is elementarily decidable, by reduction to the covering problem on Petri nets.
Research of Vector Digital Chart Update System Based on C/S Mode
Authors: Jian Dong, Ren-can Peng, Mu-hua Zhu, Gai-xiao Li, Yi-dong Zheng
Venue: Proceedings of the 2009 International Forum on Information Technology and Applications - Volume 01 (2009)

In recent ten years, with the rapid development of computer and navigation technology, a great deal of national vector digital charts in different scales have been produced and issued. While, even up to now, effective update mechanism has not been erected, which makes national vector digital charts can not be devoted into daily use. Obviously, it is of great significance to build up effective update mechanism for national vector digital charts. To improve the update service standard of national vector digital charts, based on international update modes, the paper not only brings forward the assume of founding national vector digital chart update system based on client/server (C/S) mode, but also introduces the general design and each specific of the update system from the viewpoint of engineering realization, which provides definite theory foundation and technique support to the thoroughly research and business development of national vector digital chart update software.
PNNL: a supervised maximum entropy approach to word sense disambiguation
Authors: Stephen Tratz, Antonio Sanfilippo, Michelle Gregory, Alan Chappell, Christian Posse, Paul Whitney
Venue: Proceedings of the 4th International Workshop on Semantic Evaluations (2007)

In this paper, we described the PNNL Word Sense Disambiguation system as applied to the English all-word task in SemEval 2007. We use a supervised learning approach, employing a large number of features and using Information Gain for dimension reduction. The rich feature set combined with a Maximum Entropy classifier produces results that are significantly better than baseline and are the highest F-score for the fined-grained English all-words subtask of SemEval.
Bridging Software Evolution's Gap: The Multilayer Concept
Authors: Bruno Merlin, Christophe Hurter, Mathieu Raynal
Venue: Proceedings of the 1st International Conference on Human Centered Design: Held as Part of HCI International 2009 (2009)

The multilayer interface concept is used to promote the universal usability, to smooth the transition to new systems and working methods and to help the user optimize his interface for the management of contextual situations. In this article, we will explain how this concept can help to tackle a serious issue for R D projects: the integration of the innovative concepts into the operational environment. To illustrate this, we will explain how we used a multilayer interface to promote a way to integrate different concepts currently in maturation in the R D sphere.
Expectation Maximization driven Geodesic Active Contour with Overlap Resolution (EMaGACOR): Application to Lymphocyte Segmentation on Breast Cancer Histopathology
Authors: Hussain Fatakdawala, Ajay Basavanhally, Jun Xu, Gyan Bhanot, Shridar Ganesan, Michael Feldman, John Tomaszewski, Anant Madabhushi
Venue: Proceedings of the 2009 Ninth IEEE International Conference on Bioinformatics and Bioengineering (2009)

The presence of lymphocytic infiltration (LI) has been correlated with nodal metastasis and tumor recurrence in HER2+ breast cancer (BC), making it important to study LI. The ability to detect and quantify extent of LI could serve as an image based prognostic tool for HER2+ BC patients. Lymphocyte segmentation in H & E-stained BC histopathology images is, however, complicated due to the similarity in appearance between lymphocyte nuclei and cancer nuclei. Additional challenges include biological variability, histological artifacts, and high prevalence of overlapping objects. Although active contours are widely employed in segmentation, they are limited in their ability to segment overlapping objects. In this paper, we propose a segmentation scheme (EMaGACOR) that integrates Expectation Maximization (EM) based segmentation with a geodesic active contour (GAC). Additionally, a novel heuristic edge-path algorithm exploits the size of lymphocytes to split contours that enclose overlapping objects. For a total of 62 HER2+ breast biopsy images, EMaGACOR was found to have a detection sensitivity of over 90% and a positive predictive value of over 78%. By comparison, EMaGAC (model without overlap resolution) and GAC (Randomly initialized geodesic active contour) model yielded corresponding sensitivities of 57.4% and 26.7%, respectively. Furthermore, EMaGACOR was able to resolve over 92% of overlaps. Our scheme was found to be robust, reproducible, accurate, and could potentially be applied to other biomedical image segmentation applications.
Research on the Model of Mixing Wine Bodies Based on Neural Network
Authors: Ren Jianping, Li Zhimin
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

Aiming at instability of the quality of liquor blending and seasoning process, this paper puts out making use of advanced detecting system to acquire information on wine bodies physical-chemical ingredient, raises to 100 kinds ofthe non-skeletons ingredients of wine bodies. Meanwhile, byusing the technology of computer and database, liquor fingerprint is draw, and information on physical-chemicalingredient is analyzed in BP neutral network, and achievingthe object of intelligent blending of liquor is realized.
A Task-Based Evaluation of an Aggregated Search Interface
Authors: Shanu Sushmita, Hideo Joho, Mounia Lalmas
Venue: Proceedings of the 16th International Symposium on String Processing and Information Retrieval (2009)

This paper presents a user study that evaluated the effectiveness of an aggregated search interface in the context of non-navigational search tasks. An experimental system was developed to present search results aggregated from multiple information sources, and compared to a conventional tabbed interface. Sixteen participants were recruited to evaluate the performance of the two interfaces. Our results suggest that the aggregated search interface is a promising way of supporting non-navigational search tasks. The quantity and diversity of the retrieved items which participants accessed to complete a task, increased in the aggregated interface. Participants also found the aggregated presentation easier to access to retrieved items and to find relevant information, compared to the conventional interface.
Refinement Algebra with Explicit Probabilism
Authors: T. M. Rabehaja, J. W. Sanders
Venue: Proceedings of the 2009 Third IEEE International Symposium on Theoretical Aspects of Software Engineering (2009)

Refinement algebra provides axioms for the stepwise removal of abstraction, in the form of demonic nondeterminism, in a first-order system that supports reasoning about loops. It has been extended by Solin and Meinecke to computations involving implicit probabilistic choices: demonic nondeterminism then satisfies weaker properties. In this paper their axiom system is extended to capture explicit probabilistic choices. The first form is an unquantified probabilistic choice; the second is a partial quantified probabilistic choice (from which the usual binary probabilistic choice can be recovered). The new refinement algebra is sound with respect to 1-bounded expectation transformers, the premier model of probabilistic computations, but also with respect to a new model introduced here to capture more directly partial quantified computations. In this setting a `normal form' result of Kozen is proved, replacing multiple loops with a single loop that does the same job; and the extent to which the two forms of loop have the same expected number of steps to termination is considered. Being entirely first-order, the new refinement algebra is targeted to automation.
Research on Third-party B2B E-marketplaces Service Orientation from Global Production Networks Embeddedness of SMEs Perspective
Authors: Baoliang Hu
Venue: Proceedings of the 2009 Second International Symposium on Electronic Commerce and Security - Volume 01 (2009)

First, this paper puts forward the construct of third-party B2B e-marketplaces service orientation from global production networks(GPN) embeddedness of Small and Medium-Sized Enterprises(SMEs) perspective; Second, through the exploratory factor analysis of 56 questionnaire data and confirmatory factor analysis of 148 questionnaire data, the study verifies the multi-dimensional construct and develops the measurement model of it. The result shows that such service orientation includes three dimensions: SMEs’ function matching support which measures from transaction matching, manufacturing and technology matching between SMEs and flagship enterprises; SMEs’ alliance construction support which measures from trust establishing, information sharing and solving problems jointly between SMEs and flagship enterprises; SMEs’ risk aversion support which measures from avoiding demand risk, procurement and price risk in the GPN for SMEs.
Using OpenMP vs. Threading Building Blocks for Medical Imaging on Multi-cores
Authors: Philipp Kegel, Maraike Schellmann, Sergei Gorlatch
Venue: Proceedings of the 15th International Euro-Par Conference on Parallel Processing (2009)

We compare two parallel programming approaches for multi-core systems: the well-known OpenMP and the recently introduced Threading Building Blocks (TBB) library by Intel®. The comparison is made using the parallelization of a real-world numerical algorithm for medical imaging. We develop several parallel implementations, and compare them w.r.t. programming effort, programming style and abstraction, and runtime performance. We show that TBB requires a considerable program re-design, whereas with OpenMP simple compiler directives are sufficient. While TBB appears to be less appropriate for parallelizing existing implementations, it fosters a good programming style and higher abstraction level for newly developed parallel programs. Our experimental measurements on a dual quad-core system demonstrate that OpenMP slightly outperforms TBB in our implementation.
Exploring shopping information and navigation strategies with a mobile device
Authors: David Wilfinger, Astrid Weiss, Manfred Tscheligi
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

In this article a field trial is presented that explores shopping information and navigation strategies and evaluates if the spectacles camera is beneficial as mobile device for this research context. The spectacles camera, a small camera installed in a pair of glasses, was used as exploration instrument in a shopping mall where passers-by could take part in a field trial on a voluntary basis. The goal of the field trial was twofold: 1.) Gaining insights on shoppers' behavior. 2.) Investigating the feasibility of the spectacles camera as exploration instrument. The field trial gave insights on navigation patterns and constituting elements of interest points of participants' shopping behavior, while the spectacles camera proved its value for investigating shopping strategies in the field.
PhotoMap: using spontaneously taken images of public maps for pedestrian navigation tasks on mobile devices
Authors: Johannes Schöning, Antonio Krüger, Keith Cheverst, Michael Rohs, Markus Löchtefeld, Faisal Taher
Venue: Proceedings of the 11th International Conference on Human-Computer Interaction with Mobile Devices and Services (2009)

In many mid- to large-sized cities public maps are ubiquitous. One can also find a great number of maps in parks or near hiking trails. Public maps help to facilitate orientation and provide special information to not only tourists but also to locals who just want to look up an unfamiliar place while on the go. These maps offer many advantages compared to mobile maps from services like Google Maps Mobile or Nokia Maps. They often show local landmarks and sights that are not shown on standard digital maps. Often these 'You are here' (YAH) maps are adapted to a special use case, e.g. a zoo map or a hiking map of a certain area. Being designed for a fashioned purpose these maps are often aesthetically well designed and their usage is therefore more pleasant. In this paper we present a novel technique and application called PhotoMap that uses images of 'You are here' maps taken with a GPS-enhanced mobile camera phone as background maps for on-the-fly navigation tasks. We discuss different implementations of the main challenge, namely helping the user to properly georeference the taken image with sufficient accuracy to support pedestrian navigation tasks. We present a study that discusses the suitability of various public maps for this task and we evaluate if these georeferenced photos can be used for navigation on GPS-enabled devices.
Shared Service Center vs. Shared Service Network: A Multiple Case Study Analysis of Factors Impacting on Shared Service Configurations
Authors: Jörg Becker, Björn Niehaves, Andreas Krause
Venue: Proceedings of the 8th International Conference on Electronic Government (2009)

Shared services have proven to be a key element when it comes to increasing government efficiency by collaboration. Here, we seek to investigate into the shared services phenomenon in the context of government reforms. For this purpose, an interview and document analysis-based multiple case study has been conducted in Germany. The qualitative analysis covers two shared service implementations on the local government level and identifies important preconditions for shared service emergence, namely cost pressure as motive, the existence of key actors promoting the topic and the existence of prior cooperation. Moreover, it is shown that the structure of such previous cooperation determines, if shared services are being organised in a centralised (shared service centre) or decentralised format (shared service network).
Access Control Policies for Semantic Networks
Authors: Tatyana Ryutov, Tatiana Kichkaylo, Robert Neches
Venue: Proceedings of the 2009 IEEE International Symposium on Policies for Distributed Systems and Networks (2009)

As web-based technologies mature, dynamic graphs of interlinked resources are replacing hierarchical catalogs as means for storing and organizing information. Such graphs,or semantic networks, often span multiple static and dynamic resources from a variety of sources. It is often highly desirable to give users access only to parts of the semantic network without breaking its logical continuity or consistency.Traditional access control models, such as mandatory, discretionary and role-based access controls, are ill-suited for these new resource structures. New models that allow users to specify access rights in terms of semantic relationships between various objects within semantic networks are needed. In this paper we discuss requirements for an access control model for semantic networks and present our approach and an initial implementation. We also describe end user tools for policy specification and assessment.
Hierarchy Theorems for Property Testing
Authors: Oded Goldreich, Michael Krivelevich, Ilan Newman, Eyal Rozenberg
Venue: Proceedings of the 12th International Workshop and 13th International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (2009)

Referring to the query complexity of property testing, we prove the existence of a rich hierarchy of corresponding complexity classes. That is, for any relevant function q, we prove the existence of properties that have testing complexity ¿(q). Such results are proven in three standard domains often considered in property testing: generic functions, adjacency predicates describing (dense) graphs, and incidence functions describing bounded-degree graphs. While in two cases the proofs are quite straightforward, the techniques employed in the case of the dense graph model seem significantly more involved. Specifically, problems that arise and are treated in the latter case include (1) the preservation of distances between graph under a blow-up operation, and (2) the construction of monotone graph properties that have local structure.
Proceedings of the 4th ACM international workshop on Experimental evaluation and characterization
Venue: International Conference on Mobile Computing and Networking (2009)

It is our great pleasure to welcome you to the 4th ACM International Workshop on Wireless Network Testbeds, Experimental Evaluation and Characterization (WiNTECH) 2009 and to the city of Beijing! Following the three previous successful editions in San Francisco, Montreal and Los Angeles, WiNTECH has now established itself as a high quality forum that brings together researchers sharing new ideas and experiences in experimental wireless systems and networks. This year, WiNTECH received 25 paper submissions. After a thorough review by the members of the Technical Program Committee, 9 papers were selected for publication. We believe that thanks to the high-quality submissions, we can present a strong and broad technical program. The topics span a significant part of experimental wireless networks' research including methodologies, tools and techniques for both mobile and static wireless network testbeds. We trust you will find the papers both stimulating and valuable. In addition to paper presentations, we will continue with the innovations introduced at last year's WiNTECH program. The workshop will be one full day, featuring 9 papers, 5 posters, and 9 demos which will compete in the WinCool demo contest.