ppxscal/embedding_network huggingface dataset:
Model Checking Timed Systems with Priorities
Authors: Pao-Ann Hsiung, Shang-Wei Lin
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Priorities are used to resolve conflicts such as in resource sharing and in safety designs. The use of priorities has become indispensable in real-time system design such as in scheduling, synchronization, arbitration, and fairness guaranteeing. There are several modeling frameworks that show how timed systems with priorities are to be designed and how priority schedulers can be automatically synthesized. However, the verification of timed systems with priorities using model checking is still a relatively untouched area. We show what the issues are in model checking timed systems with priorities and how the issues are solved in this work. In the process, we propose an optimal zone subtraction algorithm. The method has been implemented into the SGM model checker and successfully applied to real-time embedded systems and safety-critical systems, which illustrate the feasibility and advantages of the proposedverification method.
Patterns de interface em PDA: aplica&ccedil;&atilde;o em coleta de dados de usabilidade
Authors: Plinio T. Aquino,  Jr, Lucia V. L. Filgueiras, Elen C. de Oliveira, Thaysa R. Bello
Venue: Proceedings of the 2005 Latin American conference on Human-computer interaction (2005)

This poster describes interface patterns for PDA defined from usability studies at application developed from Usability Engineering Laboratory. The applications usability studies generated 15 interface patterns for PDA, with propose to create reliability during usability tests in Laboratory. When using defined patterns, it was gotten efficiency during the execution of the application.
Satisfiability-Based Algorithms for Pseudo-Boolean Optimization Using Gomory Cuts and Search Restarts
Authors: Vasco M. Manquinho, Joao Marques-Silva
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Cutting planes are a well-known, widely used, and very effective technique for Integer Linear Programming (ILP). In contrast, the utilization of cutting planes in Pseudo-BooleanOptimization (PBO) is recent and results still preliminary. This paper addresses the utilization of cutting planes, namely Gomory mixed-integer cuts, in Satisfiability-based algorithms for PBO, and shows how these cuts can be used for computing lower bounds and for learning new constraints. A side result of learning new constraints is that the utilization of cutting planes enables non-chronological backtracking. Besides cutting planes, the paper also proposes the utilization of search restarts in PBO. We show that search restarts can be effective in practice, allowing the computation of more aggressive lower bounds each time the search restarts. Experimental results show that the integration of cutting planes and search restarts in a SAT-based algorithm for PBO yields a very efficient and robust new solution for PBO.
Un intergiciel par envoi de message &eacute;conome en &eacute;nergie bas&eacute; sur une approche multi-agents: support pour la communication sans fil dans les syst&egrave;mes complexes physiques ouverts
Authors: J.-P. Jamont, M. Occello
Venue: Proceedings of the 2nd French-speaking conference on Mobility and ubiquity computing (2005)

Open physical complex artificial systems involve wireless autonomous entities submitted to strength constrainted energetic policies. The features of these systems naturally lead to apply multiagent techniques to ensure both the autonomy of entities and the best organization of the whole system. We propose a multiagent approach for wireless communication management and functional integrity maintaining for such physical multiagent systems using self-organization mechanisms. We show the performances of this multiagent approach by comparison to usual communication management based on wireless protocols used in this area. The genericity of our contribution is highlighted by the proposition of a middleware layer integrated in agent. We give an insight to a real world application of instrumentation of an underground instrumentation using the middleware.
Neural network analysis of MINERVA scene image benchmark
Authors: Markos Markou, Maneesha Singh, Sameer Singh
Venue: Neural Computing and Applications (2006)

Scene analysis is an important area of research with the aim of identifying objects and their relationships in natural scenes. MINERVA benchmark has been recently introduced in this area for testing different image processing and classification schemes. In this paper we present results on the classification of eight natural objects in the complete set of 448 natural images using neural networks. An exhaustive set of experiments with this benchmark has been conducted using four different segmentation methods and five texture-based feature extraction methods. The results in this paper show the performance of a neural network classifier on a tenfold cross-validation task. On the basis of the results produced, we are able to rank how well different image segmentation algorithms are suited to the task of region of interest identification in these images, and we also see how well texture extraction algorithms rank on the basis of classification results.
Alternative Software Stacks for OGSA-based Grids
Authors: Marty Humphrey, Glenn Wasson, Yuliyan Kiryakov, Sang-Min Park, David Del Vecchio, Norm Beekwilder
Venue: Proceedings of the 2005 ACM/IEEE conference on Supercomputing (2005)

The Open Grid Services Architecture (OGSA) has been a major step forward for Grid Computing, but its de facto reliance on the Web Services Resource Framework (WSRF) and WS-Notification have left some in the community questioning if the Grid software and protocols have become too complex. In this paper, we consider the feasibility of an "alternative" software stack, based on WS-Transfer and WS-Eventing. We compare and evaluate WSRF/WS-Notification vs. WS-Transfer/WSEventing, first via a "hello world" service and then via a more complete Grid scenario for remote execution called "Grid-in-a-Box". By qualitatively and quantitatively evaluating each approach, we find that while subtle differences exist (e.g., the naming of resources, the creation of resources), the stacks are overwhelmingly equivalent in their functionality and implied performance. Overall, this paper uniquely shows that there could be alternative software stacks for OGSA-based Grids.
Toward emergent representations for video
Authors: Ryan Shaw, Marc Davis
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Advanced systems for finding, using, sharing, and remixing video require high-level representations of video content. A number of researchers have taken top-down, analytic approaches to the specification of representation structures for video. The resulting schemes, while showing the potential of high-level representations for aiding the retrieval and resequencing of video, have generally proved too complex for mainstream use. In this paper, we propose a bottom-up, emergent approach to developing video representation structures by examining retrieval requests and annotations made by a community of video remixers. Our initial research has found a useful degree of convergence between user-generated indexing terms and query terms, with the salient exception of descriptions of characters' corporeal characteristics.
Learning Object Models from Semistructured Web Documents
Authors: Shiren Ye, Tat-Seng Chua
Venue: IEEE Transactions on Knowledge and Data Engineering (2006)

This paper presents an automated approach to learning object models by means of useful object data extracted from data-intensive semistructured web documents such as product descriptions. Modeling intensive data on the Web involves the following three phrases: First, we identify the object region covering the descriptions of object data when irrelevant contents from the web documents are excluded. Second, we partition the contents of different object data appearing in the object region and construct object data using hierarchical XML outputs. Third, we induce the abstract object model from the analogous object data. This model will match the corresponding object data from a Web site more precisely and comprehensively than the existing handcrafted ontologies. The main contribution of this study is in developing a fully automated approach to extract object data and object model from semistructured web documents using kernel-based matching and View Syntax interpretation. Our system, OnModer, can automatically construct object data and induce object models from complicated web documents, such as the technical descriptions of personal computers and digital cameras downloaded from manufacturers' and vendors' sites. A comparison with the available hand-crafted ontologies and tests on an open corpus demonstrate that our framework is effective in extracting meaningful and comprehensive models.
Closed-form network representations of frequency-dependent RLGC parameters: Research Articles
Authors: A. Ege Engin, Wolfgang Mathis, Werner John, Grit Sommer, Herbert Reichl
Venue: International Journal of Circuit Theory and Applications (2005)

In this paper, equivalent circuit representations for frequency-dependent RLGC (resistance, inductance, conductance and capacitance) parameters of interconnects are presented. Several novel approaches are proposed and compared with each other to model the frequency-dependent behaviour of interconnects due to substrate and conductor losses. The network representations are obtained by network synthesis of suitable non-rational immittances based on analytical methods. Due to the closed-form description of the circuit elements, which consist of positive-valued resistors, inductors, and capacitors, the proposed models can be conveniently implemented in generic circuit simulators. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Data unification in personal information management
Authors: David R. Karger, William Jones
Venue: Communications of the ACM (2006)

Users need ways to unify, simplify, and consolidate information too often fragmented by location, device, and software application.
Design and Implementation of an Extrusion-based Break-In Detector for Personal Computers
Authors: Weidong Cui, Randy H. Katz, Wai-tian Tan
Venue: Proceedings of the 21st Annual Computer Security Applications Conference (2005)

An increasing variety of malware, such as worms, spyware and adware, threatens both personal and business computing. Remotely controlled bot networks of compromised systems are growing quickly. In this paper, we tackle the problem of automated detection of break-ins caused by unknown malware targeting personal computers. We develop a host based system, BINDER (Break-IN DEtectoR), to detect break-ins by capturing user unintended malicious outbound connections (referred to as extrusions). To infer user intent, BINDER correlates outbound connections with user-driven input at the process level under the assumption that user intent is implied by user-driven input. Thus BINDER can detect a large class of unknown malware such as worms, spyware and adware without requiring signatures. We have successfully used BINDER to detect real world spyware on daily used computers and email worms on a controlled testbed with very small false positives.
Mapping generation for XML data sources: a general framework
Authors: Zoubida Kedad, Xiaohui Xue
Venue: Proceedings of the International Workshop on Challenges in Web Information Retrieval and Integration (2005)

The inter-operability of multiple autonomous and heterogeneous data sources is an important issue in many applications such as mediation systems, datawarehouses, or web-based systems. These systems provide a view, called a target schema, on the top of the data sources. Mappings are defined for describing the way instances of the target schema are derived from instances of the data sources. The generation of such mappings is a difficult problem, especially when the target schema and the source schemas are in XML format. In this paper, we propose a framework to automatically find the mappings for a target schema given the source schemas and a set of semantic correspondences. In our framework, the target schema is decomposed into subtrees. Mappings are first determined for each subtree, and then combined to generate the mapping for the whole target schema. The generated mappings are expressed in a standard language, such as XQuery or XSLT.
Using a computerized conferencing system as a laboratory tool
Authors: Starr Roxanne Hiltz, Murray Turoff, Kenneth Johnson, Charles Aronovitch
Venue: ACM SIGSOC Bulletin (1982)

Computerized Conferencing Systems are a new communications medium which offer an opportunity for geographically dispersed groups of persons to communicate regularly and to interact and make decisions as a group. They also include an embedded language which makes it possible to program and conduct fully automated experiments on group communication processes. The system thereby becomes a "laboratory without walls" which can be transported to the subjects.This paper reviews the methodological aspects of the first of a series of controlled "laboratory" experiments on the effects of the medium on small group communication processes. It focusses on the potentials for use of such systems as a tool for conducting communication experiments. The findings of the experiment itself will be reported more fully elsewhere.
Synthesis of correct and distributed adaptors for component-based systems: an automatic approach
Authors: Paola Inverardi, Leonardo Mostarda, Massimo Tivoli, Marco Autili
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Building a distributed system from third-party components introduces a set of problems, mainly related to compatibility and communication. Our approach to solve these problems is to build an adaptor which forces the system to exhibit only a set of safe or desired behaviors. By exploiting an abstract and partial specification of the global behavior that must be enforced, we automatically build a centralized adaptor. It mediates the interaction among components by both performing the specified behavior and, simultaneously, avoiding possible deadlocks. However in a distributed environment it is not always possible or convenient to insert a centralized adaptor. In contrast, building a distributed adaptor might increase the applicability of the approach in a real-scale context. In this paper we show how it is possible to automatically generate a distributed adaptor by exploiting an approach to the definition of distributed IDS (Intrusion Detection Systems) filters developed by us to increase security measures in component based systems. Firstly, by taking into account a high level specification of the global behavior that must be enforced, we synthesize a behavioral model of a centralized adaptor that allows the composed system to only exhibit the specified behavior and, simultaneously, avoid possible unspecified deadlocks. This model represents a lower level specification of the global behavior that is enforced by the adaptor. Secondly, by taking into account the synthesized adaptor model, we generate a set of component filters that validate the centralized adaptor behavior by simply looking at local information. In this way we address the problem of mechanically generating correct and distributed adaptors for real-scale component-based systems.
Differencing Data Streams
Authors: Sudarshan S. Chawathe
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

We present external-memory algorithms for differencing large hierarchical datasets. Our methods are especially suited to streaming data with bounded differences. For input sizes m and n and maximum output (difference) size e, the I/O, RAM, and CPU costs of our algorithm rdiff are, respectively, m + n, 4e + 8, and O(MN). That is, given 4e + 8 blocks of RAM, our algorithm performs no I/O operations other than those required to read both inputs. We also present a variant of the algorithm that uses only four blocks of RAM, with I/O cost 8me+18m+n+6e+5 and CPU cost O(MN).
Prototypes in Pervasive Computing
Authors: Marc Bohlen, Jesse Fabian, Dirk Pfeifer, Jt Rinker, Bjorn Hartmann, Scott R. Klemmer, Michael Bernstein, Seng Loke, Sea Ling
Venue: IEEE Pervasive Computing (2005)

The four entries in this month's Works in Progress department span different aspects of prototype building for pervasive computing.PERVASIVE COMPUTING FOR ROAD TRIPS Marc Böhlen, Jesse Fabian, Dirk Pfeifer, and JT Rinker This entry discusses ongoing student projects exploring pervasive computing in automotive environments.D.TOOLS: INTEGRATED PROTOTYPING FOR PHYSICAL INTERACTION DESIGN Björn Hartmann, Scott R. Klemmer, and Michael Bernstein This entry is developing a rapid prototyping environment that combines both form and function. DESIGN PATTERNS FOR RECOGNIZING SITUATIONS Seng Loke This entry explores the challenges of recognizing situations and recurring contextual information.RAPIDLY PROTOTYPING DEVICE ECOLOGY INTERACTIONS Sea Ling This entry investigates approaches to expressing high-level workflow paradigms for device interactions.This department is part of a special issue on rapid prototyping.
Design and Analysis of Optimal Multi-Level Hierarchical Mobile IPv6 Networks
Authors: Sangheon Pack, Yanghee Choi, Minji Nam
Venue: Wireless Personal Communications: An International Journal (2006)

Hierarchical Mobile IPv6 (HMIPv6) is an enhanced version of Mobile IPv6 designed to reduce signaling overhead and to support seamless handoff in IP-based wireless/mobile networks. To support more scalable services, HMIPv6 networks can be organized as the form of a multi-level hierarchy architecture (i.e., tree structure). However, since multi-level HMIPv6 networks incur additional packet processing overhead at multiple mobility agents, it is important to find the optimal hierarchy level to minimize the total cost, which consists of the location update cost and the packet delivery cost. In this paper, we investigate this problem, namely the design of an optimal multi-level HMIPv6 (OM-HMIPv6) network. To accomplish this, we design a function to represent the location update cost and the packet delivery cost in multi-level HMIPv6 networks. Based on these formulated cost functions, we calculate the optimal hierarchy level in multi-level HMIPv6 networks, in order to minimize the total cost. In addition, we investigate the effects of the session-to-mobility ratio (SMR) on the total cost and the optimal hierarchy. The numerical results, which show various relationships among the network size, optimal hierarchy, and SMR, can be utilized to design an optimal HMIPv6 network. In addition, the analytical results are validated by comprehensive simulations.
Applying the Peephole Metaphor in a Mixed-Reality Room
Authors: Andreas Butz, Antonio Kruger
Venue: IEEE Computer Graphics and Applications (2006)

This article presents the generalized peephole metaphor, a model of interaction for ubiquitous computing and instrumented environments. The metaphor provides a way of organizing and structuring ubiquitous input and output facilities in instrumented environments consisting of several distributed but coordinated sensors and displays. Its main idea is to look at the environment as one large display and sensor continuum, in which peepholes provide localized and user-specific windows between the physical environment and a virtual information layer. The metaphor nicely matches models of human perception, for example the fact that humans make use of external representation in their environments and access information by guiding their attention to specific locations. The article presents a specific mixed-reality room and shows how a number of input and output activities can be described in terms of the peephole metaphor. It discusses how the metaphor can cope with scalability and access control and how it supports a family of interaction styles and presentation methods in instrumented environments. It analyzes the technological requirements for implementing the peephole metaphor and show that it works well with the limited hardware already available, such as projector-camera units, wall-mounted displays, and portable screens.
Debug Support Strategy for Systems-on-Chips with Multiple Processor Cores
Authors: Andrew B. T. Hopkins Klaus D. McDonald-Maier
Venue: IEEE Transactions on Computers (2006)

On-chip program and data tracing is now an essential part of any system level development platform for System-on-Chip (SoC). Current debug support solutions are platform specific and incompatible with processors and active peripherals from other sources, restricting effective design reuse. In order to overcome this reuse challenge, this paper defines interfaces to decouple the debug support from processor cores and other active data accessing units. The on-chip debug support infrastructure is also decoupled from each core's debug support and from the trace port or trace memory, using an additional interface. As a result, this decoupling of the debug support infrastructure provides freedom from a specific SoC platform. These interfaces are applied through a reference design modeled using VHDL that is based on a novel low overhead trace message framework. Compared with a leading implementation of a relevant standard, the reference design is 50 percent more compact while providing improvements in trace compression of 8.4 percent for program trace messages and almost 24 percent for data trace messages. This reference design is a multiple core solution that is compatible with most SoC architectures, including those based on emerging Network-on-Chip architectures.
Chinese Postman Problem in Stochastic Networks
Authors: Guozhen Tan, Xiaoting Cui, Yong Zhang
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Transportation systems can be represented by networks with travel times that are stochastic, which motivates the need for widely research on Chinese postman problem in stochastic networks. This paper first gives stochastic networks model and the description of Chinese postman problem in stochastic networks. Next, this paper presents the theoretical foundation of Chinese postman problem in stochastic networks, which justifies the correctness of the algorithm(SNCPP algorithm). The calculation of expected value of Euler circuit and SNCPP algorithm are given. Finally, this paper also illustrates how the algorithm can be implemented.
Bridging the WWW to the Semantic Web by Automatic Semantic Tagging of Web Pages
Authors: Hsin-Chang Yang
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The Semantic Web is gaining popularity for its ability on information interchange and sharing between machines. Such ability is possible when the Web pages are properly annotated. For newly developed Semantic Web resources, such annotation can be done manually or by help of sophisticated authoring tools. However, it is not practical to semantically annotating existing Web pages due to the gigantic amount of them. To bridge the gap between the Semantic Web and the World Wide Web, we propose a machine learning approach to automatically generate semantic markups for traditional Web pages. The proposed method applies the self-organizing map algorithm to cluster training Web pages and conducts a text mining process to discover the words to be tagged and their semantic descriptions. Preliminary experiments show that our method may successfully generate semantical markups for the Web pages.