ppxscal/embedding_network huggingface dataset:
Automatic generation of textual summaries from neonatal intensive care data
Authors: François Portet, Ehud Reiter, Albert Gatt, Jim Hunter, Somayajulu Sripada, Yvonne Freer, Cindy Sykes
Venue: Artificial Intelligence (2009)

Effective presentation of data for decision support is a major issue when large volumes of data are generated as happens in the Intensive Care Unit (ICU). Although the most common approach is to present the data graphically, it has been shown that textual summarisation can lead to improved decision making. As part of the BabyTalk project, we present a prototype, called BT-45, which generates textual summaries of about 45 minutes of continuous physiological signals and discrete events (e.g.: equipment settings and drug administration). Its architecture brings together techniques from the different areas of signal processing, medical reasoning, knowledge engineering, and natural language generation. A clinical off-ward experiment in a Neonatal ICU (NICU) showed that human expert textual descriptions of NICU data lead to better decision making than classical graphical visualisation, whereas texts generated by BT-45 lead to similar quality decision-making as visualisations. Textual analysis showed that BT-45 texts were inferior to human expert texts in a number of ways, including not reporting temporal information as well and not producing good narratives. Despite these deficiencies, our work shows that it is possible for computer systems to generate effective textual summaries of complex continuous and discrete temporal clinical data.
Rotated Image Based Photomosaic Using Combination of Principal Component Hashing
Authors: Hideaki Uchiyama, Hideo Saito
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This paper introduces a new method of Photomosaic. In this method, we propose to use tiled images that can be rotated in a restricted range. The tiled images are selected from a database. The selection of an image is done by a hashing method based on principal component analysis of a database. After computing the principal components of the database, various kinds of hash tables based on the linear combination of the principal component are prepared beforehand. Using our hashing method, we can reduce the computation time for selecting the tiled images based on the approximated nearest neighbor searching in consideration of a distribution of data in a database. We demonstrate the effectiveness of our hashing method by using a huge number of data in high dimensional space and better looking results of our tiling in experimental results.
Deciding Extensions of the Theories of Vectors and Bags
Authors: Patrick Maier
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

Vectors and bags are basic collection data structures, which are used frequently in programs and specifications. Reasoning about these data structures is supported by established algorithms for deciding ground satisfiability in the theories of arrays (for vectors) and multisets (for bags), respectively. Yet, these decision procedures are only able to reason about vectors and bags in isolation, not about their combination.This paper presents a decision procedure for the combination of the theories of vectors and bags, even when extended with a function bagof bridging between vectors and bags. The function bagof converts vectors into the bags of their elements, thus admitting vector/bag comparisons. Moreover, for certain syntactically restricted classes of ground formulae decidability is retained if the theory of vectors is extended further with a map function which applies uninterpreted functions to all elements of a vector.
An Abstract Interpretation-Based Framework for Control Flow Reconstruction from Binaries
Authors: Johannes Kinder, Florian Zuleger, Helmut Veith
Venue: Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (2008)

Due to indirect branch instructions, analyses on executables commonly suffer from the problem that a complete control flow graph of the program is not available. Data flow analysis has been proposed before to statically determine branch targets in many cases, yet a generic strategy without assumptions on compiler idioms or debug information is lacking.We have devised an abstract interpretation-based framework for generic low level programs with indirect jumps which safely combines a pluggable abstract domain with the notion of partial control flow graphs. Using our framework, we are able to show that the control flow reconstruction algorithm of our disassembly tool Jakstab produces the most precise overapproximation of the control flow graph with respect to the used abstract domain.
Supporting situation-aware services with virtual macro sensors
Authors: Nicola Bicocchi, Marco Mamei, Franco Zambonelli
Venue: Proceedings of the 2007 Workshop on INnovative SERvice Technologies (2007)

Next-generation communication services will be required to adapt their behavior to the specific characteristics of the physical and social environment in which they will be invoked. The technology to acquire contextual information will be increasingly available, e.g., in the form of highly-pervasive sensor networks infrastructure. Indeed, such infrastructure can lead to the production of overwhelming amounts of information, difficult to be managed and interpreted by services. This calls for proper solutions to enable services to extract meaningful general-purpose data from distributed sensors in a compact way. The approach presented in this paper relies on a simple algorithm to let a sensor network self-organize a virtual partitioning in correspondence of spatial regions characterized by similar sensing patterns, and to let distributed aggregation of sensorial data take place on a per-region basis. This makes it possible for services to gather information about the surrounding world as if it was generated by a limited number of virtual macro sensors, independently of the actual structure and density of the underlying sensing infrastructure.
A scalable anonymous protocol for heterogeneous wireless ad hoc networks
Authors: Mimoza Durresi, Vamsi Paruchuri, Arjan Durresi, Leonard Barolli, Makoto Takizawa
Venue: Journal of Embedded Computing (2009)

Ensuring anonymity in wireless and hoc networks is a major security goal. Using traffic analysis, the attacker can compromise the network functionality by correlating data flow patterns to event locations/active areas. In this paper we present a novel Scalable Anonymous Protocol that hides the location of nodes and obscure the correlation between event zones and data flow from snooping adversaries. We quantify the anonymity strength of our protocol by introducing a new anonymity metric: Degree of Exposure Index. Our protocol is designed to offer flexible tradeoffs between degree of anonymity and communication-delay overhead.
Interoperability frameworks for electronic governance
Authors: Alejandra Cechich, Lorenzo Madrid, Jeremy Gibbons, Jay Kesan
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

Today, there is a growing awareness that the interoperability of national public information and communication technology (ICT) infrastructures is a precondition for a more service-oriented and competitive public sector. Interoperability means the ability of ICT systems and of business processes they support to exchange data and to enable the sharing of information and knowledge. To help achieve interoperability, both within and across different policy areas, many countries have developed their own interoperability frameworks. However, in spite of the recommendations and guidelines provided by these frameworks, issues such as socio-economic disparities between regions challenge their effective and successful use. This panel will explore several key questions concerning success factors for an interoperability program from various perspectives, including: 1) When are organizations ready to think of running an interoperability initiative? 2) The actions the organization must take to ensure that the process is established and will endure. 3) Preconditions that must exist in the organization to implement interoperability (eventually through a framework). 4) Roles and procedures necessary to implement an interoperability program. 5) Is it possible to start an interoperability program in under-resourced administrations? Opportunities and challenges in less-developed countries.
Integrating Innate and Adaptive Immunity for Worm Detection
Authors: Junmin Zhang, Yiwen Liang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

As most of existing worm detection methods have a number of significant hurdles to overcome in order to employ such actions as blocking unsecure ports, breaking communication between infected and non-infected hosts to slow down Worm propagation and minimize potential damage. The most noteworthy obstacle is the high false positive rate problem. A recently developed hypothesis in immunology, the Danger Theory, states that our immune system responds to the presence of intruders through sensing molecules belonging to those invaders, plus signals generated by the host indicating danger and damage. Inspired by the theory, the paper proposes an artificial immune model for worm detection. The model considers the cooperation of Dendritic cells (DCs) in the innate immune system and T cells in the adaptive immune system, in which system calls comprising a process generated can be viewed as antigens and the corresponding behavioral information of the system and network can be viewed as signals. The theory analysis shows that the dual detection method of DCs detecting the behavioral information caused by antigens and T cells detecting antigens can decrease false positive rate, and the model also has a fast secondary response to the reinfection by the same or similar worm.
The independent role: verification and validation, and compliance testing
Authors: Barbara J. Taute
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The independent role of quality assurance can be most beneficial in the final testing phase of the software development life cycle. At this point various efforts and groups merge, often for the first time. The period of time devoted to the discovery, understanding, prioritization, and correction of software problems is critical to the timely delivery of the product. Quality assurance can provide and foster a healthy working environment for this interaction, as well as serve as an intermediary during points of disagreement. This paper discusses an actual compliance testing effort of customized, complex vendor-supplied software. The value of having an independent group involved during the testing effort was clearly made visible during the arbitration process. The critical timing was monitored, points of disagreement over the contract were resolved, and the testing effort was shortened through the involvement of an independent group. In effect, both vendor and user/purchaser benefited from the quality assurance techniques brought by an independent role involvement. 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 green supplier selection model for high-tech industry
Authors: Amy H. I. Lee, He-Yau Kang, Chang-Fu Hsu, Hsiao-Chu Hung
Venue: Expert Systems with Applications: An International Journal (2009)

With growing worldwide awareness of environmental protection, green production has become an important issue for almost every manufacturer and will determine the sustainability of a manufacturer in the long term. A performance evaluation system for green suppliers thus is necessary to determine the suitability of suppliers to cooperate with the firm. While the works on the evaluation and/or selection of suppliers are abundant, those that concern environmental issues are rather limited. Therefore, in this study, a model for evaluating green suppliers is proposed. The Delphi method is applied first to differentiate the criteria for evaluating traditional suppliers and green suppliers. A hierarchy is constructed next to help evaluate the importance of the selected criteria and the performance of green suppliers. Since experts may not identify the importance of factors clearly, the results of questionnaires may be biased. To consider the vagueness of experts' opinions, the fuzzy extended analytic hierarchy process is exploited. With the proposed model, manufacturers can have a better understanding of the capabilities that a green supplier must possess and can evaluate and select the most suitable green supplier for cooperation.
Executability of scenarios in Petri nets
Authors: Robert Lorenz, Gabriel Juhás, Robin Bergenthum, Jörg Desel, Sebastian Mauser
Venue: Theoretical Computer Science (2009)

In this paper, we show that it can be tested in polynomial time as to whether a scenario is an execution of a Petri net. This holds for a wide variety of Petri net classes, ranging from elementary nets to general inhibitor nets. Scenarios are given by causal structures expressing causal dependencies and concurrency among events. In the case of elementary nets and of place/transition nets, such causal structures are partial orders among transition occurrences. For several extended Petri net classes, the extension of partial orders to stratified order structures is considered. The algorithms are based on the representation of the non-sequential behavior of Petri nets by so-called token flow functions and a characterization of Petri net executions called token flow property. This property allows nontrivial transformations into flow optimization problems, which can be solved in polynomial time. The paper is a revised, consolidated and extended version of the conference papers [G. Juhas, R. Lorenz, J. Desel, Can I execute my scenario in your net?, in: G. Ciardo, P. Darondeau (Eds.), ICATPN, in: Lecture Notes in Computer Science, Springer, 2005, pp. 289-308; R. Lorenz, S. Mauser, R. Bergenthum, Testing the Executability of Scenarios in General Inhibitor Nets, in: ACSD, IEEE Computer Society, 2007, pp. 167-176] and includes parts of the habilitation thesis [R. Lorenz, Szenario-basierte Verifikation und Synthese von Perinetzen: Theorie und Anwendungen, Habilitation, 2006].
Google Scholar & More: New Google Applications & Tools For Libraries & Library Users, 1st edition
Authors: William Miller, Rita Pellen
Venue:  (2008)

In only a few years, Google has become an authoritative provider of multiple products which have changed the digital information landscape. This book discusses how libraries can go beyond Google's basic search and Scholar functions to expand services for their patrons. Respected authorities reveal the expanding variety of new Google applications developed in the past few years, many of which have not received wide attention and are as yet not often used in libraries. Applications explored include Google Co-op, Google News, Google Docs & Spreadsheets, Google Calendar, and Google Talk.This book also discusses different important aspects of the company's expansion of functions, such as the failure of the Google Answers experiment, the broad variety of free Google applications that librarians can use to collaborate, and the success of Google's Blogger, among others. A helpful chronology of Google's growth is provided, as well as comparative analyses between various Google functions and other functions that are currently available. The book is extensively referenced. This book is an invaluable resource for academic librarians, public librarians, school librarians, library science faculty, and special librarians. This book was published as a special issue of the "Journal of Library Administration".
The Rank-Width of the Square Grid
Authors: Vít Jelínek
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

Rank-width is a graph width parameter introduced by Oum and Seymour. It is known that a class of graphs has bounded rank-width if and only if it has bounded clique-width, and that the rank-width of G is less than or equal to its branch-width.The n×n square grid, denoted by G n,n , is a graph on the vertex set $\{1,2,\dotsc,n\}\times\{1,2,\dotsc,n\}$, where a vertex (x,y) is connected by an edge to a vertex (x¿,y¿) if and only if |x ¿ x¿| + |y ¿ y¿| = 1.We prove that the rank-width of G n,n is equal to n ¿ 1, thus solving an open problem of Oum.
Path-following methods for shape optimal design of periodic microstructural materials
Authors: Ronald H. W. Hoppe, Svetozara I. Petrova
Venue: Optimization Methods Software (2009)

We are concerned with optimal shape design of composite materials with periodic microstructures. The homogenization approach is applied to obtain a computationally feasible macromodel. The microstructural geometrical details of the microcells (such as lengths and widths of the different layers forming the cell walls) are considered as design parameters. They have a tremendous impact on the macroscopic behaviour of the final produced composites. Our purpose is to find the best material-and-shape combination in order to achieve the optimal performance of the materials. The objective functional depends on the state variables describing the operational mode and the design parameters determining the shape. Our partial differential equation (PDE) constrained optimization routine is based on the elasticity problem as a state equation and additional equality and inequality constraints this are technically or physically motivated. The discretization of the PDE-constrained optimization problem typically gives rise to a large-scale nonlinear programming problem. Primal-dual Newton-type interior-point methods are used for the numerical solution. The inequality constraints are treated by parameterized logarithmic barrier functions. The algorithm relies on an application of the adaptive path-following predictor-corrector method, inexact Newton solvers, and the all-at-once optimization approach. Numerical experiments are presented and discussed.
Extracting geographic features from the Internet to automatically build detailed regional gazetteers
Authors: Daniel W. Goldberg, John P. Wilson, Craig A. Knoblock
Venue: International Journal of Geographical Information Science (2009)

The utility of every imaginable application which incorporates a gazetteer hinges on the simple fact that the resulting system will only be as useful, complete, or accurate as the underlying gazetteer itself. A major issue confronting gazetteers utilized in systems today is that they are not complete and measures of their accuracy are largely unknown. In this paper we describe a methodology which addresses this problem by automatically generating highly complete and detailed regional gazetteers from Internet sources. We utilize information extraction and integration techniques to automatically obtain geographic features and associated footprints and feature types from freely and widely available online data which could be applied to create a gazetteer for nearly any area. We discuss the distinguishing characteristics of the generated gazetteer and extend previous work to define measures which can be used to assess the completeness and accuracy of gazetteers. Using these measures, the generated gazetteer is evaluated against the Alexandria Digital Library Gazetteer and the Los Angeles Comprehensive Bibliographic Database. Our results indicate that a gazetteer created by our methods will be at least as complete as any gazetteer currently available for certain feature classes, while falling short in others. We conclude by offering suggestions to address these shortcomings.
Viewing Enterprises As Systems-Of-Systems (SOS): Implications For SOS Research
Authors: Azad M. Madni, Assad Moini
Venue: Journal of Integrated Design Process Science (2007)

With modern enterprises continuing to grow in size and complexity, there is a pressing need to make their transformation, management and evolution more understandable and rigorous. In this paper, we argue that viewing enterprises as system-of-systems (SoS) can potentially provide a fresh perspective and unique insights into understanding organizational and operational issues surrounding modern enterprises. We claim that, both as a modeling construct and as a system abstraction, the notion of SoS is well-suited to studying, analyzing and characterizing the structural and behavioral aspects of modern enterprises. Motivated by the potential synergy between these two independent disciplines while recognizing the nascent state of the SoS body of knowledge, we propose a new research direction in applying systems thinking to understanding enterprises and, at the same time, improving the state-of-the-art in enterprise transformation, management, and evolution.
Efficient bit error analysis of asynchronous code-division multiple-access systems in Rician fading
Authors: Jen-Shiun Chen
Venue: Proceedings of the International Conference on Mobile Technology, Applications, and Systems (2008)

The paper deals with code-division multiple-access (CDMA) systems where users employ random code sequences and transmit asynchronously. It is assumed that the transmitted signals propagate through statistically independent, Rician fading channels. Bit error evaluation of CDMA systems in Rician fading is considered. Based on a flat Rician fading model and the Simplified Improved Gaussian Approximation (SIGA) method, new closed-form equations are derived for the bit error probability (BEP). The new SIGA equations allow one to analyze the effects of both deterministic and Rayleigh fading signal components on the BEP. The new equations are efficient and accurate as long as the CDMA processing gain is large and are subject to some limitations on system parameters. Computational data confirm the validity of the new equations and indicate how Rician parameters affect the BEP.
Pixar's RenderMan
Authors: Malcolm Kesson
Venue: ACM SIGGRAPH ASIA 2008 courses (2008)

Pixar's RenderMan is the dominant rendering technology used throughout the feature film industry. For many years the only publication available to CG artists who wished to learn how to use Renderman was "The RenderMan Companion" by Steve Upstill. Even after 19 years it is still a great source of information. However, the "Companion" focused on the use of the 'C' programming language to write RenderMan "programs" and as such it served the needs of programmers rather than CG artists. Perhaps as a consequence of it being seen as just another kind of programming, RenderMan acquired a slew of misconceptions about its role as a creative medium for CG artists.
Player Detection and Tracking in Broadcast Tennis Video
Authors: Yao-Chuan Jiang, Kuan-Ting Lai, Chaur-Heh Hsieh, Mau-Fu Lai
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, we propose a novel algorithm for player detection and tracking in tennis games. The algorithm utilizes court knowledge as well as player color and edge information to extract deformable player figures. Several new techniques are presented in our algorithm: initially, the court lines are detected and reconstructed. Based on the court model, an adaptive search window is designed for locating the minimum region containing a player figure. After retrieving the region of interest, pixel data are processed by non-dominant color extraction and edge detection filters, respectively. Finally, the non-dominant color map and edge map are refined and combined, and a novel shadow removal method is then applied to isolate the player figure. The algorithm was tested on numerous videos with different courts and light condition. Experiments reveal promising results against various environmental factors.