ppxscal/embedding_network huggingface dataset:
A Bernoulli Relational Model for Nonlinear Embedding
Authors: Gang Wang, Hui Zhang, Zhihua Zhang, Frederick H. Lochovsky
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

The notion of relations is extremely important in mathematics. In this paper, we use relations to describe the embedding problem and propose a novel stochastic relational model for nonlinear embedding. Given some relation among points in a high-dimensional space, we start from preserving the same relation in a low embedded space and model the relation as probabilistic distributions over these two spaces, respectively. We illustrate that the stochastic neighbor embedding and the Gaussian process latent variable model can be derived from our relational model. Moreover we devise a new stochastic embedding model and refer to it as Bernoulli relational embedding (BRE). BRE's ability in nonlinear dimensionality reduction is illustrated on a set of synthetic data and collections of bitmaps of handwritten digits and face images.
Bounded Clustering with Low Node-Clusterhead Separation in Wireless Sensor Networks
Authors: Sushanta Karmakar, Arobinda Gupta
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Clustering is an important technique for distributed coordination in sensor networks. Clusters of bounded size are of special interest for their effectiveness in reducing energy consumption by limiting the neighborhood of a node. Further energy saving can be achieved by reducing the average node to clusterhead separation as it allows nodes to transmit at lower power. In this paper, we propose a bounded clustering algorithm which reduces the average node-clusterhead separation for energy-efficient communication. Extensive simulation results show that the algorithm generates bounded clusters where average nodeclusterhead separation is low. In addition, for about 80% of the nodes, the actual separation is less than the average.
Head-Driven Statistical Models for Natural Language Parsing
Authors: Michael Collins
Venue: Computational Linguistics (2003)

This article describes three statistical models for natural language parsing. The models extend methods from probabilistic context-free grammars to lexicalized grammars, leading to approaches in which a parse tree is represented as the sequence of decisions corresponding to a head-centered, top-down derivation of the tree. Independence assumptions then lead to parameters that encode the X-bar schema, subcategorization, ordering of complements, placement of adjuncts, bigram lexical dependencies, wh-movement, and preferences for close attachment. All of these preferences are expressed by probabilities conditioned on lexical heads. The models are evaluated on the Penn Wall Street Journal Treebank, showing that their accuracy is competitive with other models in the literature. To gain a better understanding of the models, we also give results on different constituent types, as well as a breakdown of precision/recall results in recovering various types of dependencies. We analyze various characteristics of the models through experiments on parsing accuracy, by collecting frequencies of various structures in the treebank, and through linguistically motivated examples. Finally, we compare the models to others that have been applied to parsing the treebank, aiming to give some explanation of the difference in performance of the various models.
Consistent Evolution of UML Models by Automatic Detection of Change Traces
Authors: Cristine R. Dantas, Leonardo G. P. Murta, Claudia M. L. Werner
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

As software evolves, analysis and design models should be modified, correspondingly. In this scenario, one of the main problems is to detect which elements should be changed due to a given change. This paper presents an approach that applies data mining over a versioned UML repository in order to detect change patterns among model elements at different abstraction levels. These patterns are presented to the software engineer together with contextual information obtained from a change control system, so he can decide the software evolution task at hand.
Architecture, mobility management, and quality of service for integrated 3G and WLAN networks: Research Articles
Authors: Yang Xiao, Kin K. Leung, Yi Pan, Xiaojiang Du
Venue: Wireless Communications Mobile Computing (2005)

Integration of 3G and wireless LAN (WLAN) becomes a trend in current and future wireless networks, and brings many benefits to both end users and service providers. In this paper, we provide a comprehensive survey on integration of 3G and WLAN. We discuss issues such as underline network architectures, integrated architectures, mobility management, and quality of service (QoS). We particularly study handoff QoS mapping and guarantee between 3G and WLAN, as well as how seamless voice&#x002F;multimedia&#x002F;data handoff becomes possible. Copyright &copy; 2005 John Wiley & Sons, Ltd.
On Compatibility and Behavioural Substitutability of Component Protocols
Authors: Nabil Hameurlain
Venue: Proceedings of the Third IEEE International Conference on Software Engineering and Formal Methods (2005)

Component Based Development (CBD) aims to facilitate the construction of large-scale applications by supporting the composition of simple building blocks into complex applications. Components specification is thus needed to ensure the safety of composing systems from components. This paper focus on component protocols specification and provides a framework for modelling protocols together with their composition. We start by investigating compatibility of component protocols based on service observation. Two compatibility relations together with their characterisation by the preservation to their degree of change property are proposed. Safety and liveness properties such as deadlock-freeness and proper termination of protocols are preserved up to different extents. Then, we propose some behavioural subtyping relations for component protocols related to the principle of substitutability. Finally, we address the soundness of our subtyping relations by showing the existing link between compatibility and substitutability concepts, namely their combination, which have found necessary when dealing with incremental design of components.
Baby Names, Visualization, and Social Data Analysis
Authors: Martin Wattenberg
Venue: Proceedings of the Proceedings of the 2005 IEEE Symposium on Information Visualization (2005)

The NameVoyager, a web-based visualization of historical trends in baby naming, has proven remarkably popular. This paper discusses the interaction techniques it uses for smooth visual exploration of thousands of time series. We also describe design decisions behind the application and lessons learned in creating an application that makes do-it-yourself data mining popular. The prime lesson, it is hypothesized, is that an information visualization tool may be fruitfully viewed not as a tool but as part of an online social environment. In other words, to design a successful exploratory data analysis tool, one good strategy is to create a system that enables "social" data analysis.
A generic approach to supporting diagram differencing and merging for collaborative design
Authors: Akhil Mehra, John Grundy, John Hosking
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Differentiation tools enable team members to compare two or more text files, e.g. code or documentation, after change. Although a number of general-purpose differentiation tools exist for comparing text documents very few tools exist for comparing diagrams. We describe a new approach for realising visual differentiation in CASE tools via a set of plug-in components. We have added diagram version control, visual differentiation and merging support as component-based plug-ins to the Pounamu meta-CASE tool. The approach is generic across a wide variety of diagram types and has also been deployed with an Eclipse diagramming plug-in. We describe our approach's architecture, key design and implementation issues, illustrate feasibility of our approach via implementation of it as plug-in components and evaluate its effectiveness.
uPen: A Smart Pen-liked Device for Facilitating Interaction on Large Displays
Authors: Xiaojun Bi, Yuanchun Shi, Xiaojie Chen
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

This paper presents the uPen, a laser pointer combined with a contact-pushed switch, three press buttons and a wireless communication module. This novel interaction device allows users to interact on large displays at a distance or directly on the surface with full-function of mouse. Onboard software enable the uPen system to identify different users and provide personalized services to them, such as associating users with corresponding privileges, giving access to each participant's private content (e.g., home pages, personal calendars). Additionally, with our two-step association method, the uPen system has the ability to distinguish strokes of different uPens working simultaneously and support multiuser simultaneous interaction. A prototype system has been implemented in our Smart Classroom [1]. And user studies show the benefit of using it.
Modelling Assumptions and Requirements in the Context of Project Risk
Authors: Andriy Miranskyya, Nazim Madhavji, Matt Davison, Mark Reesor
Venue: Proceedings of the 13th IEEE International Conference on Requirements Engineering (2005)

Many researchers have emphasized the importance of documenting assumptions (As) underlying software requirements (Rs) [2]. However, As and Rs can change with time for reasons such as: (i) an A or R was elicited incorrectly and subsequently needs to be changed; (ii) operational domain changes induce changes in the A and R sets; and (iii) the change in validity of an A, or desirability of an R, respectively, causes the validity of another A or desirability of an R to change.
A Two-Level Semantic Caching Scheme for Super-Peer Networks
Authors: Pawe Garbacki, Dick H. J. Epema, Maarten van Steen
Venue: Proceedings of the 10th International Workshop on Web Content Caching and Distribution (2005)

Recent measurement studies of file-sharing peer-to-peer networks have demonstrated the presence of semantic proximity between peers and between shared files. In this paper we tackle the problem of exploiting the semantic locality of peer requests to improve the performance of a P2P network by the use of semantic caches. Such caches group together peers with similar interests as well as files with similar request patterns. The resulting two-level caching infrastructure can be integrated in a very natural way with the superpeer concept. The super-peers in our system cache pointers to files recently requested by their client peers. The client peers, on the other hand, keep caches of super-peers that answered most of their requests in the past. As a consequence, peers with similar interests are grouped (clustered) under the same super-peers, and also files with similar request patterns are indexed by the same super-peers. We discuss the design choices and optimizations of the presented model. We also evaluate our system versus the network that uses only one level of semantic caches.
Agents and Databases: Friends or Foes?
Authors: Peter C. Lockemann, Rene Witte
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

On first glance agent technology seems more like a hostile intruder into the database world. On the other hand, the two could easily complement each other, since agents carry out information processes whereas databases supply information to processes. Nonetheless, to view agent technology from a database perspective seems to question some of the basic paradigms of database technology, particularly the premise of semantic consistency of a database. The paper argues that the ensuing uncertainty in distributed databases can be modelled by beliefs, and develops the basic concepts for adjusting peer-to-peer databases to the individual beliefs in single nodes and collective beliefs in the entire distributed database.
Policy Specification and Matching for Business Performance Management
Authors: Jun-Jang Jeng
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

Business performance management (BPM) has emerged as a critical discipline to enable enterprise to manage their business solutions in an on demand fashion. BPM applications promote an adaptive means by emphasizing the ability to monitor and control both business processes and IT events. BPM policy governs the BPM behavior of a business entity that takes the environmental stimulus, analyzes it, makes decisions, and renders actions. Business entities are never isolated islands. They tend to interact with one another in order to achieve business functions. Henceforth, BPM policies as a means to govern the monitoring and control behavior of business entities need to be integrated together in a meaningful and scalable fashion. In this paper, we show that how BPM policies can be constructed and weaved into large-scale (e.g. enterprise) policy solutions using formal models. This paper presents a framework for specifying and matching policies based on order-sorted predicate logic; and how this framework can help build scalable enterprise level BPM policies.
Capturing Nontrivial Concerns in Object-Oriented Software
Authors: Mircea Trifu, Volker Kuttruff
Venue: Proceedings of the 12th Working Conference on Reverse Engineering (2005)

Code that is scattered and tangled as a result of orthogonal concerns seriously hinders software maintenance and reuse. As OO decompositions are unable to cleanly encapsulate such orthogonal (cross-cutting) concerns simultaneously, new ideas and languages were devised to capture and encapsulate them. In this paper, we argue that the current leading approaches (AOP as it is understood in AspectJ and MDSOC), although a step forward in the right direction, have some serious limitations. We, then, propose a new conceptual model for encapsulating concerns identified in existing OO code, which we apply to an example taken from the Java Swing library. Our case study shows that our approach is able to capture cross-cutting concerns in a cleaner and more elegant fashion than current state of the art approaches.
A Review of Common Receive-End Adaptive Equalization Schemes and Algorithms for a High-Speed Serial Backplane
Authors: Charles E. Berndt, Tad Kwasniewski
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper provides a review of the structures and algorithms used in receive end adaptive equalization. These structures are necessary in order to allow high speed signaling over several gigabits per second across a serial backplane channel. As the data rates continue to increase over these channels the causes and the techniques used mitigate interference become more and more important.
Extraction of a representative tile from a near-periodic texture
Authors: Khalid Djado, Richard Egli, François Deschênes
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

Near-periodic textures are all around us, in brick walls, fabrics, mosaics, and many other manifestations. They are made up of a basic motif, which can be extracted, yielding a small image known as a tile. In particular, such textures are used in 3D scenes in virtual environments like games. However, the memory allocated for textures on a video card is limited. Generating texture by tiling allows scenes to be rendered in a realistic manner while using very little memory. This paper presents a simple method for extracting a representative tile from a near-periodic texture, working from a photo. The period of the texture is calculated to determine the size of the tile. Then the representative tile is chosen based on two criteria: avoiding color discontinuities at the junction of tiles, and recreating a texture that is as faithful as possible to the original.
Learning the structure of Markov logic networks
Authors: Stanley Kok, Pedro Domingos
Venue: Proceedings of the 22nd international conference on Machine learning (2005)

Markov logic networks (MLNs) combine logic and probability by attaching weights to first-order clauses, and viewing these as templates for features of Markov networks. In this paper we develop an algorithm for learning the structure of MLNs from relational databases, combining ideas from inductive logic programming (ILP) and feature induction in Markov networks. The algorithm performs a beam or shortest-first search of the space of clauses, guided by a weighted pseudo-likelihood measure. This requires computing the optimal weights for each candidate structure, but we show how this can be done efficiently. The algorithm can be used to learn an MLN from scratch, or to refine an existing knowledge base. We have applied it in two real-world domains, and found that it outperforms using off-the-shelf ILP systems to learn the MLN structure, as well as pure ILP, purely probabilistic and purely knowledge-based approaches.
MPLS network management: MIBs, tools and techniques
Authors: Thomas D. Nadeau
Venue:  (2002)

MPLS Network Management: MIBs, Tools, and Techniques is the first and only book that will help you master MPLS management technologies and techniques, as they apply to classic MPLS networks, traffic-engineered networks, and VPNs. Written by the co-author of most current MPLS management standards, it provides detailed, authoritative coverage of official MIBs, examining key topics ranging from syntax to access levels to object interaction. It also offers extensive consideration of third-party management interfaces, including tools for metering traffic and predicting traffic growth and behavior. If you're a network operator, network device engineer, or MPLS application developer, you need this book to get all you can out of all of MPLS's many capabilities.
Subtyping for session types in the pi calculus
Authors: Simon Gay, Malcolm Hole
Venue: Acta Informatica (2005)

Extending the pi calculus with the session types proposed by Honda et al. allows high-level specifications of structured patterns of communication, such as client-server protocols, to be expressed as types and verified by static typechecking. We define a notion of subtyping for session types, which allows protocol specifications to be extended in order to describe richer behaviour; for example, an implemented server can be refined without invalidating type-correctness of an overall system. We formalize the syntax, operational semantics and typing rules of an extended pi calculus, prove that typability guarantees absence of run-time communication errors, and show that the typing rules can be transformed into a practical typechecking algorithm.
Writing Speed Normalization for On-Line Handwritten Text Recognition
Authors: Moises Pastor, Alejandro Toselli, Enrique Vidal
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Pen-based interfaces aim at improving the manmachine interaction of many portable systems. While statistical models can be used to learn pen position sequences, they suffer from the huge variability exhibited by the speed of writing. To improve performance, invariance to the writing speed is needed. Trace segmentation is a technique that can be used to normalize the writing speed. This method is controlled by a parameter called resampling distance. A study of the resampling distance is presented here, along with an other approximation to the writing speed normalization called "derivatives normalization". The improvement using trace segmentation was 19.3% relative to the baseline, whilst the improvement using derivatives normalization was 47.3% relative.
The LAN-simulation: A Refactoring Teaching Example
Authors: Serge Demeyer, Filip Van Rysselberghe, Tudor Girba, Jacek Ratzinger, Radu Marinescu, Tom Mens, Bart Du Bois, Dirk Janssens, Stéphane Ducasse, Michele Lanza, Matthias Rieger, Harald Gall, Mohammad El-Ramly
Venue: Proceedings of the Eighth International Workshop on Principles of Software Evolution (2005)

The notion of refactoring - transforming the sourcecode of an object-oriented program without changing its external behaviour - has been studied intensively within the last decade. This diversity has created a plethora of toy-examples, cases and code snippets, which make it hard to assess the current state-of-the-art. Moreover, due to this diversity, there is currently no accepted way of teaching good refactoring practices, despite the acknowledgment in the software engineering body of knowledge. Therefore, this paper presents a common example - the LAN simulation - which has been used by a number of European Universities for both research and teaching purposes.
A trucking firm problem
Authors: Thomas J. Schriber
Venue: ACM SIGSIM Simulation Digest (1973)

A trucking firm has a contract with 8 different stores under which it agrees to deliver packages for them within a small urban area. Packages are placed on a loading dock each day at each of the stores, at 8:00 a.m., and again at 1:00 p.m. Each store simultaneously lets the dispatching agent at the trucking firm know how many "new" packages have just been made available for delivery. (Note that, at any particular 8:00 a.m. or 1:00 p.m., there may still be "old" packages on the loading dock, which the trucking firm has not yet gotten around to picking up.) The dispatching agent consequently knows at all times exactly how many packages are waiting for pickup at each of the 8 stores.
IC Outlier Identification Using Multiple Test Metrics
Authors: Sagar S. Sabade, Duncan M. Walker
Venue: IEEE Design Test (2005)

The use of IDDQ as a test method has been threatened by high leakage currents in nanometer designs. This article suggests a method for keeping it useful and also delineates some of thechallenges in recognizing and rejecting outlier parts.
Topological crossover for the permutation representation
Authors: Alberto Moraglio, Riccardo Poli
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Topological crossovers are a class of representation-independent operators that are well-defined once a notion of distance over the solution space is defined. In this paper we explore how the topological framework applies to the permutation representation and in particular analyze the consequences of having more than one notion of distance available. Also, we study the interactions among distances and build a rational picture in which pre-existing recombination/crossover operators for permutation fit naturally. Lastly, we also analyze the application of topological crossover to TSP.