ppxscal/embedding_network huggingface dataset:
An indexing model of HTML documents
Authors: Andrea Molinari, Gabriella Pasi, R. A. Marques Pereira
Venue: Proceedings of the 2003 ACM symposium on Applied computing (2003)

The diffusion of the World Wide Web and the consequent increase in the production and exchange of textual information demand the development of effective information retrieval systems. The HyperText Markup Language (HTML) is broadly employed for defining the "typographical" appearance of documents over the Internet and Intranets. In this paper an indexing model of HTML documents is proposed. In this model the index term weight is computed by weighting the term occurrences differently, according to the tags in which they appear.
Internet privacy: interpreting key issues
Authors: Gurpreet S. Dhillon, Trevor T. Moores
Venue: Advanced topics in information resources management (2003)

The phenomenal growth in Internet commerce in recent years has brought privacy concerns to the fore. Although privacy as a concept has been well understood with respect to brick and motor businesses, there is limited research in identifying major issues of concern related to Internet privacy. This paper systematically identifies the major Internet privacy concerns. Data for the study was collected through two panels and subjective evaluation.
A multi-dimensional taxonomy of software development environments
Authors: Spiros Mancoridis
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

A Software Development Environment (SDE) is a set of tools that, at the very least, supports coding and possibly other software development activities. Related to SDEs are meta-SDEs, which are classes of SDEs that must be configured or populated by tools before they can be useful. We will use the generic term environment to refer to both SDEs and meta-SDEs.This paper presents a multi-dimensional taxonomy of environments. The primary dimensions of our taxonomy are scale and genericity. Scale distinguishes environments that are suitable for small-scale programming from those that are suitable for large-scale software development. Genericity differentiates monolithic environments from highly configurable and extendible ones. Secondary taxonomy dimensions include tool integration, which identifies the degree of interoperability and data sharing between tools, and the historical dimension, which gives insight into past and present research trends in these environments.
The ViscousDisplay: adaptive transient interfaces in public space
Authors: Lily Shirvanee, Marc Downie
Venue: ACM SIGGRAPH 2003 Sketches Applications (2003)

The ViscousDisplay explores the exchange of social information through transient public interfaces. Shaped by principles of 'underground public art', the ViscousDisplay is conceived as a novel mobile communication medium, where messages can be shared in public spaces. Inspired by biological learning systems; the ViscousDisplay learns gestural motions and colors that form along traces of a participant's movements and maps this information onto a flexible display. Because it is made up of inexpensive materials, the ViscousDisplay is also a disposable artifact which may be collected in public spaces. It combines multi-modal sensing, learning algorithms, and a pliable silicone display.
Goal-Focused Self-Modifying Workflow in the Healthcare Domain
Authors: Eric D. Browne, Michael Schrefl, James R. Warren
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 6 - Volume 6 (2004)

This paper introduces the concept of self-modifying workflow in the context of health care planning. Certain tasks in the workflow schema are devoted to modifying the downstream workflow on an instance by instance basis. Such self-modifying schemas provide the necessary flexibility to suit the evolving diagnostic and therapeutic processes encountered in Chronic Disease Management (CDM), particularly in complex areas requiring significant individualisation. The management of Diabetes Mellitus in a community care setting provides an example to illustrate this complexity. Over the past few years, object-oriented modelling tools of inheritance and specialisation have been applied to workflow modelling to assist in schema evolution and workflow migration, thereby potentially empowering new Workflow Management Systems (WfMSs) with the functionality to allow the tailoring of Guideline-based Care Plans to individual patient requirements. However, schema evolution is a necessary butinsufficient requirement for such tailoring. Healthcare WfMSs need to support a paradigm whereby schema evolution becomes a de facto operation for each workflow instance ( i.e.patient episode of care). Self-modifying workflows provide this paradigm. In order to facilitate self-modification of workflow schemas, we annunciate a set of valid operations that can be applied to downstream components of a workflow schema. These operations are primarily concerned with turning abstract subworkflows into concrete ones through completion and alteration of template primitives.
When Bad People Happen to Good Games
Authors: Josh Coates
Venue: Queue (2004)

OK, so I admit it—not only am I a total closet gamer geek, I admit that I actually care enough to be bitter about it. Yep, that’s right—this puts me in the “big-time nerd” category.
Estimating State Variables of Nonlinear Systems
Authors: A. R. Gaiduk
Venue: Automation and Remote Control (2004)

For estimation of the state variables that are linearly involved in the equations of nonlinear systems, a technique was developed to design reduced-order asymptotic observers by reducing the functional matrices of the special decidability equation to the form of companion matrix. The necessary differentiability conditions are imposed only on part of the system nonlinearities.
Energy and quality scalable wireless communication
Authors: Rex Kee Min
Venue:  (2003)

Nodes for emerging, high-density wireless networks will face the dual challenges of continuous, multi-year operation under diverse and challenging operating conditions. The wireless communication subsystem, a substantial consumer of energy, must therefore be designed with unprecedented energy efficiency. To meet this challenge, inefficiencies once overlooked must be addressed, and the system must be designed for energy scalability, the use of graceful energy vs. quality trade-offs in response to continuous variations in operational conditions. Using a comprehensive model framework that unifies cross-disciplinary models for energy consumption and communication performance, this work explores multi-dimensional trade-offs of energy and quality for wireless communication at all levels of the system hierarchy. The circuit-level &ldquo;knob&rdquo; of dynamic voltage scaling is implemented on a commercial microprocessor and encourage collaboration between the hardware, which fundamentally dissipates the energy, and software, which controls how the hardware behaves. Accurate models of hardware energy consumption reveal inefficiencies of routing techniques such as multihop, and the models are fused with information-theoretic limits on code performance to bound the energy scalability of the hardware platform. An application-specific protocol for microsensor networks is evaluated with a new, interactive Java simulation tool created expressly for energy-conscious, high density wireless networks. Close collaboration between software and hardware layers, and across the research disciplines that compose wireless communication itself, are crucial enablers for energy-efficient wireless communication. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Implicitization of differential rational parametric equations
Authors: Xiao-Shan Gao
Venue: Journal of Symbolic Computation (2003)

In this paper, we propose algorithms for the following problems in the implicitization of a set of differential rational parametric equations P. (1) To find a characteristic set for the implicit prime ideal of P. (2) To find a canonical representation for the image of P. (3) To decide whether the parameters of P are independent, and if not, to re-parameterize P so that the new parametric equations have independent parameters. (4) To compute the inversion maps of P, and as a consequence, to decide whether P is proper. If the implicit variety is of dimension one and P is not proper, to find a proper re-parameterization for P.
DakNet: Rethinking Connectivity in Developing Nations
Authors: Alex (Sandy) Pentland, Richard Fletcher, Amir Hasson
Venue: Computer (2004)

What is the basis for a progressive, market-driven migration from e-governance to universal broadband connectivity that local users will pay for?DakNet, an ad hoc network that uses wireless technology to provide asynchronous digital connectivity, is evidence that the marriage of wireless and asynchronous service may indeed be the beginning of a road to universal broadband connectivity. DakNet has been successfully deployed in remote parts of both India and Cambodia at a cost two orders of magnitude less than that of traditional landline solutions.
Bandwidth requirement and state consistency in three multiplayer game architectures
Authors: Joseph D. Pellegrino, Constantinos Dovrolis
Venue: Proceedings of the 2nd workshop on Network and system support for games (2003)

Multiplayer games become increasingly popular, mostly because they involve interaction among humans. Typically, multiplayer games are organized based on a Client-Server (CS) or a Peer-to-Peer (PP) architecture. In CS, players exchange periodic updates through a central server that is also responsible for resolving any state inconsistencies. In PP, each player communicates with every other player while state inconsistencies are resolved through a distributed agreement protocol.In this paper, we first examine these architectures from two perspectives: bandwidth requirement at the server and players, and latency to resolve any player state inconsistencies. Our results are based on both analysis and experimentation with an open-source game called "BZFlag". The CS architecture is not scalable with the number of players due to a large bandwidth requirement at the server. The PP architecture, on the other hand, introduces significant overhead for the players, as each player needs to check the consistency between its local state and the state of all other players. We then propose an architecture that combines the merits of CS and PP. In that architecture, called Peer-to-Peer with Central Arbiter (PP-CA), players exchange updates in a peer-to-peer manner but without performing consistency checks. The consistency of the game is checked by a central arbiter that receives all updates, but contacts players only when an inconsistency is detected. As a result, the central arbiter has a lower bandwidth requirement than the server of a CS architecture.
Seven Hot Outsourcing Practices
Authors: Donald J. Reifer
Venue: IEEE Software (2004)

Are you thinking that an outside firm can do a particular job quicker, cheaper, and better than your staff can? This essay looks at those assumptions and suggests a sensible seven-step approach to outsourcing.
An Efficient Framework for Business Software Development
Authors: Ivan Ho, Zentaro Komiya, Billy Pham, Hisato Kobayashi, Kazuo Yana
Venue: Proceedings of the 2003 International Conference on Cyberworlds (2003)

Businesses operate today in an increasingly dynamicenvironment through a worldwide network of informationexchanges and business transactions. The Semantic Web- an extension of the current Web - which comprisesontologies and XML-related technologies, provides ashared and standardized vocabulary that can becommunicated among automatic and human agents toshare information and knowledge.Consider that an electronic business is a set ofbusiness processes governed by business rules that runover the Internet. These business rules play a significantrole in determining the success or failure of a business asa whole.The goal of this paper is to introduce a framework thatis designed to build business systems faster and which canmore easily accommodate changes within a business. Theadvantages of this framework arise from its unity andsimplicity, and especially its ability to effectively change,add, and/or delete business rules.
Enhancing hyperlink structure for improving web performance
Authors: Evangelos Kranakis, Andrzej Pelc
Venue:  (2003)

In a Web site, each page v has a certain probability pv of being requested by a user. The access cost of page v, is c(v) = pv &middot; c(r, v), where c(r, v) is the cost of the shortest path between the home page, r, and page v. The access cost of a Web site is the sum of the access cost of all its pages. The cost of a path is measured in two ways. One measure is in terms of its length, where the cost of the path is simply the number of hyperlinks in it. The other measure is in terms of the data transfer generated for traversing the path. This research work concerns the problem of minimizing the access cost of a Web site by adding hotlinks over its underlying structure. We propose an improvement on Web site access by making the most popular pages more accessible to users. We do this by assigning hotlinks to the existing structure of the Web site. The problem of finding an optimal assignment of hotlinks is known as the hotlink problem.Consider a directed graph G = (V, E), where V represents the pages of a Web site connected via hyperlinks E. We prove that the hotlink assignment problem is NP-hard, and give some theoretical results related to this problem. We present heuristic algorithms which are tested and compared by simulation on real and random Web sites. We develop The Hotlink Optimizer (HotOpt), a new software tool that finds an assignment of hotlinks reducing the average number of steps in a Web site. HotOpt is empowered by one of the algorithms presented in this dissertation.
Shaping technology across social worlds: groupware adoption in a distributed organization
Authors: Gloria Mark, Steven Poltrock
Venue: Proceedings of the 2003 international ACM SIGGROUP conference on Supporting group work (2003)

In this paper, we draw on theory about social worlds to analyze how different organizational contexts affect groupware adoption. We report on a study of the adoption of data conferencing in a large distributed organization. Our data show that the diffusion process, which was driven by the users, was a result of communication and transformation of the technology across different social worlds. We also discovered that membership in multiple social worlds in an organization creates a tension for the potential adopter who is in a distributed team. To function effectively, team members must uniformly adopt the technology, yet some may face resistance at their organizational homes. Our case study showed that adoption was affected by organizational sites having conflicting views of the value of collaboration, different amounts and needs for resources, and different acceptance of technology standards. Potential technology adopters on distributed teams are faced with conflicting loyalties, constraints, and requirements between their distributed collaborations and organizational homes.
Depth-first discovery algorithm for incremental topological sorting of directed acyclic graphs
Authors: Jianjun Zhou, Martin Müller
Venue: Information Processing Letters (2003)

We study the problem of incrementally maintaining a topological sorting in a large DAG. The Discovery Algorithm (DA) of Alpern et al. [Proc. 1st Annual ACM-SIAM Symp. on Discrete Algorithms, 1990, pp. 32-42] computes a cover K of nodes such that a solution to the modified problem can be found by changing node priorities within K only. It achieves a runtime complexity that is polynomially bounded in terms of the minimal cover size k.The temporary space complexity of DA grows quickly with increasing number of added edges and cover size. We introduce the Depth-First Discovery Algorithm (DFDA), which uses depth-first search to reduce the temporary space of DA from O(|A| × ||-K||) to O(|A| + ||K||), where |A| is the number of edges to add and ||K|| is the extended size of the cover. DFDA is simpler than DA and performs better in our empirical tests.
Configuration knowledge representations for Semantic Web applications
Authors: Alexander Felfernig, Gerhard Friedrich, Dietmar Jannach, Markus Stumptner, Markus Zanker
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2003)

Today's economy exhibits a growing trend toward highly specialized solution providers cooperatively offering configurable products and services to their customers. This paradigm shift requires the extension of current standalone configuration technology with capabilities of knowledge sharing and distributed problem solving. In this context a standardized configuration knowledge representation language with formal semantics is needed in order to support knowledge interchange between different configuration environments. Languages such as Ontology Inference Layer (OIL) and DARPA Agent Markup Language (DAML+OIL) are based on such formal semantics (description logic) and are very popular for knowledge representation in the Semantic Web. In this paper we analyze the applicability of those languages with respect to configuration knowledge representation and discuss additional demands on expressivity. For joint configuration problem solving it is necessary to agree on a common problem definition. Therefore, we give a description logic based definition of a configuration problem and show its equivalence with existing consistency-based definitions, thus joining the two major streams in knowledge-based configuration (description logics and predicate logic&sol;constraint based configuration).
Impact of thermal cycling on the evolution of grain, precipitate and dislocation structure in Al, 0.5% Cu, 1% Si thin films
Authors: B. Kaouache, P. Gergaud, O. Thomas, O. Bostrom, M. Legros
Venue: Microelectronic Engineering (2003)

Thermal cycles have been performed both outside and inside a transmission electron microscope (TEM) in order to analyze the evolution of the microstructure of Al, 0.5% Cu, 1% Si thin films deposited onto oxidized Si substrates. It is shown that grain growth and dislocation activity start almost simultaneously and cooperate throughout the plastic regime of the stress-temperature curve to generate bamboo-type grains with low dislocation density. Si precipitates serve as anchoring points for dislocations and grain boundaries. Thermal cycling and diffusion cause the growth of these precipitates and a diminution of their number. Diffusion also proves to play an important role regarding plastic relaxation at the Al/SiOx interface and at the grain boundaries where an intense hillock and whisker formation has been observed in scanning electron microscope (SEM). The stress-temperature evolution is discussed in light of these observations.
Typed feature structures and design space exploration
Authors: R. Woodbury, A. Burrow, S. Datta, T.-W. Chang
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

Design space explorers are computer programs that play on an exploration metaphor to support design. They assist designers in creating alternative designs by structuring the process of design creation in a space of alternatives. Subsidiary metaphors relevant to design space explorers are generation, navigation, and reuse. This paper introduces, in two sketches, typed feature structures as a formal system in which a design space explorer and its knowledge level might be implemented. First, informal and abstract properties of typed feature structures suffice to build a sketch of the behavior of a design space explorer. Second, using an example based on single-fronted cottages (a common Australian housing type), we outline the typed feature structure machinery most relevant to design space exploration.
Modeling the state and behavior of an enzyme using UML - an object oriented approach
Authors: V. N. Christofilakis, Ch. Alexopoulos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

In this paper an object oriented approach is used to visualize a family of enzymes that are widespread in nalure and can be found in many animals and plant species. To achieve this assay, Unified Modeling Language (UML) is utilized to describe accurately and in detail the chemical information. In this survey we intend to provide multiple dimensional access to the inherent information concerning a biochemical process, and as an example the acid phosphatase is chosen.
Using a Victim Buffer in an Application-Specific Memory Hierarchy
Authors: Chuanjun Zhang, Frank Vahid
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 1 (2004)

Customizing a memory hierarchy to a particular application or applications is becoming increasingly common in embedded system design, with one benefit being reduced energy. Adding a victim buffer to the memory hierarchy is known to reduce energy and improve performance on average, yet victim buffers are not typically found in commercial embeddedprocessors. One problem with such buffers is, while they work well on average, they tend to hurt performance for many applications. We show that a victim buffer can be very effective if it is considered as a parameter in designing a memory hierarchy, like the traditional cache parameters of total size, associativity, and line size. We describe experiments on PowerStoneand MediaBench benchmarks, showing that having the option of adding a victim buffer to a direct-mapped cache can reduce memory-access energy by a factor of 3 in some cases. Furthermore, even when other cache parameters are configurable, we show that a victim buffer can still reduce energy by 43%. By treating the victim buffer as a parameter, meaning the buffer can be included or excluded, we can avoid performance overhead of up to 4% on some examples. We discuss the victim buffer in the context of both core-based and pre-fabricated platform based design approaches.
Static verification and extreme programming
Authors: Peter Amey, Roderick Chapman
Venue: ACM SIGAda Ada Letters (2004)

At first glance, the worlds of high-integrity software engineering and Extreme Programming (XP) seem to have little in common. Somewhat surprisingly, we have found the reverse to be the case-indeed it seems that many practices advocated by the XP community are familiar to us from many years' of experience in building safety- and security-critical systems. This paper discusses our experiences in applying some XP practices in critical projects. Secondly, we discuss how static verification can augment XP, particularly in the Pairwise Programming and Refactoring practices.
The forbidden minor characterization of line-search antimatroids of rooted digraphs
Authors: Yoshio Okamoto, Masataka Nakamura
Venue: Discrete Applied Mathematics (2003)

An antimatroid is an accessible union-closed family of subsets of a finite set. A number of classes of antimatroids are closed under taking minors such as point-search antimatroids of rooted (di)graphs, line-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees, shelling antimatroids of posets, etc. The forbidden minor characterizations are known for point-search antimatroids of rooted (di)graphs, shelling antimatroids of rooted trees and shelling antimatroids of posets. In this paper, we give the forbidden minor characterization of line-search antimatroids of rooted digraphs.