ppxscal/embedding_network huggingface dataset:
Stable Outcomes for Two-Sided Contract Choice Problems
Authors: Somdeb Lahiri
Venue: Computational Mathematical Organization Theory (2005)

In this paper we study the cooperative theory of stable outcomes for the room-mates problem modeled as a contract choice problem. We show, that a simple generalization of the Deferred Acceptance Procedure with firms proposing due to Gale and Shapley (1962), yields outcomes for a two-sided contract choice problem, which necessarily belong to the core and are Weakly Pareto Optimal for firms. Under the additional assumptions: (a) given any two distinct workers, the set of yields achievable by a firm with the first worker is disjoint from the set of yields achievable by it with the second, and (b) the contract choice problem is pair-wise efficient, we prove that there is no stable outcome at which a firm can get more than what it gets at the unique outcome of our procedure.
Interview with Kimberly Till
Authors: Newton Lee
Venue: Computers in Entertainment (CIE) (2005)

Interview with Kimberly Till (April 18, 2005) Kimberly Till is vice president of Microsofts Worldwide Media Entertainment Group (http://www.microsoft.com/presspass/exec/till/default.asp). In the video interview, Kimberly was accompanied by David Alstadter (Senior Director of Marketing, Partners, and Solutions), John Canning (Technical Evangelist of Microsoft Windows eHome Division), and Jon Weisner (Solution Specialist). You will hear what they have to say about: What does the Worldwide Media Entertainment Group do? Video 1 - Kimberly Till What are the challenges and solutions for digital asset management? Video 2 - David Alstadter How does the Microsoft technology benefit the entertainment industry? Video 3 - David Alstadter and Jon Weisner There are interactive TV programs and other special software designed to run on the Windows XP Media Center Edition PC. What are the future plans for the Media Center PC? Video 4 - John Canning
Association search in semantic web: search + inference
Authors: Liang Bangyong, Tang Jie, Li Juanzi
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Association search is to search for certain instances in semantic web and then make inferences from and about the instances we have found. In this paper, we propose the problem of association search and our preliminary solution for it using Bayesian network. We first minutely define the association search and its categorization. We then define tasks in association search. In terms of Bayesian network, we take ontology taxonomy as network structure in Bayesian network. We use the query log of instances to estimate the network parameters. After the Bayesian network is constructed, we give the solution for association search in the network.
Close to the Edge: NAT vs. IPv6 Just the Tip of a Larger Problem
Authors: Greg Goth
Venue: IEEE Internet Computing (2005)

Although some have championed the fundamentally disruptive architecture of IPv6, others have taken the more short-term, pragmatic, and incremental approach of increasing the number of network connections via NAT over IPv4. However, as the issue's subplots emerge, it's becoming clear that this argument is one element in the larger problem of deploying new applications and new architectures.
Tutorial on Practical Prediction Theory for Classification
Authors: John Langford
Venue: The Journal of Machine Learning Research (2005)

We discuss basic prediction theory and its impact on classification success evaluation, implications for learning algorithm design, and uses in learning algorithm execution. This tutorial is meant to be a comprehensive compilation of results which are both theoretically rigorous and quantitatively useful.There are two important implications of the results presented here. The first is that common practices for reporting results in classification should change to use the test set bound. The second is that train set bounds can sometimes be used to directly motivate learning algorithms.
Detachment of Vertices of Graphs Preserving Edge-Connectivity
Authors: Balázs Fleiner
Venue: SIAM Journal on Discrete Mathematics (2005)

The detachment of vertex is the inverse operation of merging vertices s1,... ,st into s. We speak about {d1,... ,dt}-detachment if, for the detached graph G', the new degrees are specified as dG'(s1)=d1,...,dG'(st)=dt. We call a detachment k-feasible if dG'(X)\geq k whenever X separates two vertices of V(G) - s. In our main theorem, we give a necessary and sufficient condition for the existence of a k-feasible {d1,... ,dt}-detachment of vertex s. This theorem also holds for graphs containing 3-vertex hyperedges disjoint from s. From special cases of the theorem, we get a characterization of those graphs whose edge-connectivity can be augmented to k by adding $\gamma$ edges and p 3-vertex hyperedges. We give a new proof for the theorem of Nash-Williams that characterizes the existence of a simultaneous detachment of the vertices of a given graph such that the resulting graph is k-edge-connected.
A New Method for Constructing Williamson Matrices
Authors: Mingyuan Xia, Tianbing Xia, Jennifer Seberry
Venue: Designs, Codes and Cryptography (2005)

For every prime power q ¿ 1 (mod 4) we prove the existence of (q; x, y)-partitions of GF(q) with q=x2+4y2 for some x, y, which are very useful for constructing SDS, DS and Hadamard matrices. We discuss the transformations of (q; x,y)-partitions and, by using the partitions, construct generalized cyclotomic classes which have properties similar to those of classical cyclotomic classes. Thus we provide a new construction for Williamson matrices of order q2.
Systems engineering methodologies, tacit knowledge and communities of practice
Authors: Larry Stapleton, David Smith, Fiona Murphy
Venue: AI Society (2005)

In the context of technology development and systems engineering, knowledge is typically treated as a complex information structure. In this view, knowledge can be stored in highly sophisticated data systems and processed by explicitly intelligent, software-based technologies. This paper argues that the current emphasis upon knowledge as information (or even data) is based upon a form of rationalism which is inappropriate for any comprehensive treatment of knowledge in the context of human-centred systems thinking. A human-centred perspective requires us to treat knowledge in human terms. The paper sets out the particular importance of tacit knowledge in this regard. It sets out two case studies which reveal the critical importance of a careful treatment of tacit knowledge for success in two complex, technology-driven projects.
A Method of Inverse Filter Design Based on Cepstrum Measure
Authors: Chun-yan Gu, Hong-feng Yi, Ke-chu Yi, Li-jun Jin
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper proposes a new method to design FIR inverse filters based on cepstrum distortion measure and two auto-regression expressions. Theoretical analysis suggests that the resulted FIR inverse filter is a very good approximation to an IIR inverse filter, while its computational complexity is much lower than the conventional methods and it particularly suits to FPGA implementation. Simulation results also show that it over-performs the existing methods.
Overview of the fourth message understanding evaluation and conference
Authors: Beth M. Sundheim
Venue: Proceedings of the 4th conference on Message understanding (1992)

The Fourth Message Understanding Conference (MUC-4) is the latest in a series of conferences that concern the evaluation of natural language processing (NLP) systems. These conferences have reported on progress being made both in the development of systems capable of analyzing relatively short English texts and in the definition of a rigorous performance evaluation methodology. MUC-4 was preceded by a period of intensive system development by each of the participating organizations and blind testing using materials prepared by NRaD and SAIC that are described in this paper, other papers in this volume, and the MUC-3 proceedings [1].
RF-MVTC: an efficient risk-free multiversion concurrency control algorithm: Research Articles
Authors: Azzedine Boukerche, Terry Tuck
Venue: Concurrency and Computation: Practice Experience (2004)

In this paper, we focus on the temporary return of data values that are incorrect for given transactional semantics that could have catastrophic effects similar to those in parallel and discrete event simulation systems. In many applications using online transactions processing environments, for instance, it is best to delay the response to a transaction's read request until it is either known or unlikely that a write message from an older update transaction will not make the response incorrect. Examples of such applications are those where aberrant behavior is too costly, and those in which precommitted data is visible to some reactive entity. In light of the avoidance of risk in this approach, we propose a risk-free multiversion temporally correct concurrency-control algorithm. We discuss the algorithm, its implementation and report on the performance results of simulation models using a cluster of workstations. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Capo: robust and scalable open-source min-cut floorplacer
Authors: Jarrod A. Roy, David A. Papa, Saurabh N. Adya, Hayward H. Chan, Aaron N. Ng, James F. Lu, Igor L. Markov
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In this invited note we describe Capo, an open-source software tool for cell placement, mixed-size placement and floorplanning with emphasis on routability. Capo is among the fastest academic placers and scales to millions of movable objects. This note surveys the overall structure of Capo, discusses recent improvements and describes ongoing research.
TRANSPATH&reg;&mdash;a high quality database focused on signal transduction: Conference Reviews
Authors: Claudia Choi, Mathias Krull, Alexander Kel, Olga Kel-Margoulis, Susanne Pistor, Anatolij Potapov, Nico Voss, Edgar Wingender
Venue: Comparative and Functional Genomics (2004)

TRANSPATH&reg; can either be used as an encyclopedia, for both specific and general information on signal transduction, or can serve as a network analyser. Therefore, three modules have been created: the first one is the data, which have been manually extracted, mostly from the primary literature; the second is PathwayBuilder&trade;, which provides several different types of network visualization and hence faciliates understanding; the third is ArrayAnalyzer&trade;, which is particularly suited to gene expression array interpretation, and is able to identify key molecules within signalling networks (potential drug targets). These key molecules could be responsible for the coordinated regulation of downstream events. Manual data extraction focuses on direct reactions between signalling molecules and the experimental evidence for them, including species of genes&#x002F;proteins used in individual experiments, experimental systems, materials and methods. This combination of materials and methods is used in TRANSPATH&reg; to assign a quality value to each experimentally proven reaction, which reflects the probability that this reaction would happen under physiological conditions. Another important feature in TRANSPATH&reg; is the inclusion of transcription factor&ndash;gene relations, which are transferred from TRANSFAC&reg;, a database focused on transcription regulation and transcription factors. Since interactions between molecules are mainly direct, this allows a complete and stepwise pathway reconstruction from ligands to regulated genes. More information is available at . Copyright &copy; 2004 John Wiley & Sons, Ltd.
A 1D coupled Schrödinger drift-diffusion model including collisions
Authors: M. Baro, N. Ben Abdallah, P. Degond, A. El Ayyadi
Venue: Journal of Computational Physics (2005)

We consider a one-dimensional coupled stationary Schrodinger drift-diffusion model for quantum semiconductor device simulations. The device domain is decomposed into a part with large quantum effects (quantum zone) and a part where quantum effects are negligible (classical zone). We give boundary conditions at the classic-quantum interface which are current preserving. Collisions within the quantum zone are introduced via a Pauli master equation. To illustrate the validity we apply the model to three resonant tunneling diodes.
Towards an evaluation of usages for the integration of nomad devices in the aeronautic maintenance domains
Authors: Claude Reyterou
Venue: Proceedings of the 1st French-speaking conference on Mobility and ubiquity computing (2004)

Since the last years, several works show that the use of nomad devices is possible in the aeronautic maintenance due to the improvement of information (the contain of data and the adaptation of supports can satisfy the needs and constraints). However, evaluation of usages is necessary to realize a good integration of technologies. In this paper, we show a first thought on analysis of usage allowing us to take into account the whole issues regarding to integration of nomad devices in the aeronautic maintenance activities.
XML-Based Mobile Agents
Authors: Robert Steele, Tharam Dillon, Parth Pandya, Yuri Ventsov
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Current mobile agent systems are based on agent architectures that are partially or fully implementation programming language-specific. Mobile agent implementation in a specific programming language has usage limitations as the inter agent communication and agent migration to other agent hosts needs support for the same language. Widely used Java-based agents have an advantage of easy agent migration through bytecode transfer but this also imposes the requirement of a Java Virtual Machine (JVM) on each agent host where agents can migrate to. To achieve a truly system independent and agent system architecture independent solution, here we propose a XML-based mobile agent architecture. This paper presents a mobile agent system design based on the use of XML-based agent code, the UDDI registry for agent registration and lookup/discovery and XML Web Service calls for mobile agent intercommunication and migration. This will also facilitate industry to have easier and less risky adaptation from existing agent system implementation.
Pareto based optimization of multi-resolution geometry for real time rendering
Authors: Nicolaas Tack, Gauthier Lafruit, Francky Catthoor, Rudy Lauwereins
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

This paper proposes a view-dependent quality-cost trade-off decision-taking framework for time-critical multi-resolution rendering. The paper extends existing surface to surface error metrics to a view-dependent accuracy heuristic, used in an off-line process for establishing a representative set of elementary accuracy-cost trade-off curves. These so-called Pareto plots are combined at run-time according to the object meshes visibility and importance (e.g. object distance) for proper global view-dependent quality-cost trade-off decision taking at minimum run-time cost. A more realistic viewpoint-dependent quality metric is introduced without sacrificing too much of the simplicity of earlier proposals.
A High-Performance Multimedia Streaming Model on Multi-Source Streaming Approach in Peer-to-Peer Networks
Authors: Satoshi Itaya, Tomoya Enokido, Makoto Takizawa
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

A peer-to-peer (P2P) network is composed of large number of peer computers which are cooperating by exchanging messages in networks. In multimedia streaming applications, multimedia data is required to be efficiently and reliably delivered to processes in a real-time manner. In order to support scalable and reliable multimedia streaming service, we newly discuss a multi-source streaming way where multiple source peers transmit packets of multimedia content to each peer. Here, each of the source peers transmits different packets with some redundancy to the peer in order to be tolerant of some number of faulty peers and packets lost.
Lidstone approximation on the triangle
Authors: F. A. Costabile, F. Dell'Accio
Venue: Applied Numerical Mathematics (2005)

In this paper we give a contribution to Lidstone approximation [Proc. Edinburgh Math. Soc. 2 (1929) 16] with a new approximation formula on the simplex. Interpolation conditions satisfied by the proposed formula are studied and sufficient conditions for the uniform convergence are given. In particular, a class of functions for which the sequence of approximating polynomials uniformly converges to function is determined, by extending to the class of two variate ridge functions [Cheney and Light, A Course in Approximation Theory, Brooks/Cole Publishing Company, 1999] the classic notion of completely convex function [Bull. Amer. Math. Soc. 47 (1941) 750; Trans. Amer. Math. Soc. 51 (1942) 387]. Finally, it is shown that the calculation of the approximating polynomial can be organized in a stable algorithm and some numerical test are performed.
Polymorphic letters: transforming pen movements to extend written expression
Authors: Andrea Taylor, Zoltan Foley-Fisher, Carol Strohecker
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

We are developing a digital writing tool, Polymorphic Letters (PL), to investigate hand and pen movements as they may extend and enrich expression in written language. PL recognizes individual letters and associated spatial, temporal and pressure qualities of pen movements. The system maps these features to typography and colour variables, creating lively representations on-screen. Writers will use the tool in learning environments emphasizing the role of personal expressions. We explore style and voice as they pertain to expressions through hand, pen, and words, and describe the rationale for PL, its iterative design, and next steps based on writers' and readers' experiences.
Lambda machine overview
Authors: Mache Creeger
Venue: Issue 80 (April 1982) (1982)

LMI will be introducing its next generation LISP Machine, the Lambda, for market in the spring. The major design philosophy of the Lambda machine is the concept of modularity. The system is designed so that it can exist in a large number of configurations centered around a 32 bit high performance bus. 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
The Cumulative Idle Time in an ND/D/1 Queue
Authors: S'Andor R'Acz, Tam'As Jakabfy, G'Abor T'Oth
Venue: Queueing Systems: Theory and Applications (2005)

An ND/D/1 queueing model means that N independent periodic sources are served by a single server and the packets have the same size. These models have received close attention as general queueing models in telecommunications. Both discrete models, where it is only permitted to transmit packets at fixed time instances, and also continuous models, where the time of transmission is not restricted, can be applied in the modeling. This paper provides the exact distribution of the cumulative idle time duration in such queuing systems and also proposes accurate approximation formulae for large systems. The results of this paper are of practical significance because existing approximations of the distribution of the cumulative idle time can be replaced by the proposed formulae.
Reflections on building two Go programs
Authors: Bruce Wilcox
Venue: Issue 94 (October 1985) (1985)

From 1972 to 1979 I co-designed and built what became the world's strongest computer Go program, the Reitman-Wilcox Go Program [1]. It took 7 person-years, 8K lines of LISP, 3 megabytes of memory, and an IBM mainframe. Recently I constructed a similar program, called NEMESIS...the Go Master (tm). It has taken 1 person-year, 13.5K lines of C, 146 kilobytes of memory, and an IBM-PC. They play at a similar strength and by similar means. This article discusses both how I went about reengineering the old program and what I learned during this process.
Adaptive query routing in peer web search
Authors: Le-Shin Wu, Ruj Akavipat, Filippo Menczer
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

An unstructured peer network application was proposed to address the query forwarding problem of distributed search engines and scalability limitations of centralized search engines. Here we present novel techniques to improve local adaptive routing, showing they perform significantly better than a simple learning scheme driven by query response interactions among neighbors. We validate prototypes of our peer network application via simulations with 500 model users based on actual Web crawls. We finally compare the quality of the results with those obtained by centralized search engines, suggesting that our application can draw advantages from the context and coverage of the peer collective.
Weaving a social fabric into existing software
Authors: Li-Te Cheng, John Patterson, Steven L. Rohall, Susanne Hupfer, Steven Ross
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

Contextual collaboration is a promising approach to embedding new collaborative features into existing applications. However, incorporating such new features may be too difficult for applications without extensible frameworks or too complex for legacy, custom, and mission-critical applications. We present Aspect-Oriented Retrofitting as a lightweight approach to embedding contextual collaboration in this class of applications, describe guidelines for designing retrofitting aspects, and walk through two examples.
A population-based algorithm-generator for real-parameter optimization
Authors: K. Deb
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2005)

In this paper, we propose a population-based, four-step, real-parameter optimization algorithm-generator. The approach divides the task of reaching near the optimum solution into four independent plans of (i) selecting good solutions from a solution base, (ii) generating new solutions using the selected solutions, (iii) choosing inferior or spurious solutions for replacement, and (iv) updating the solution base with good new or old solutions. Interestingly, many classical and evolutionary optimization algorithms are found to be representable by this algorithm-generator. The paper also recommends an efficient optimization algorithm with the possibility of using a number of different recombination plans and parameter values. With a systematic parametric study, the paper finally recommends a real-parameter optimization algorithm which outperforms a number of existing classical and evolutionary algorithms. To extend this study, the proposed algorithm-generator can be utilized to develop new and more efficient population-based optimization algorithms. The treatment of population-based classical and evolutionary optimization algorithms identically through the proposed algorithm-generator is the main hall-mark of this paper and should enable researchers from both classical and evolutionary fields to understand each other&#x2019;s methods better and interact in a more coherent manner.