ppxscal/embedding_network huggingface dataset:
TranSqueak " Making the World a Smaller Place On-the-Fly Translation of Etoy Projects and Instant Messaging
Authors: Michael Ruger, Yoshiki Ohshima
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

This paper presents an extension to the existing mu;tiligualization work (m17n) which will allow people to collaborate on Squeak Etoy projects across different natural languages.Squeak etoys support several languages, both ISO-Latin based ones (erg., English, German, French), and non-ISO languages (e.g., Japanese). Switching between languages for the Etoy tiles is fairly easy to support as the tiles provide a predefined set of words and phrases, which only need to be translated once.There are two areas where we need to go beyond the predefined and pre-translated set of phrases: user supplied names and communication between collaborators. This paper will present an approach based on online translation services. We will demonstrate a working prototype and a first analysis of the feasibility of this approach.
Optimal Time Bounds for Approximate Clustering
Authors: Ramgopal R. Mettu, C. Greg Plaxton
Venue: Machine Learning (2004)

Clustering is a fundamental problem in unsupervised learning, and has been studied widely both as a problem of learning mixture models and as an optimization problem. In this paper, we study clustering with respect to the k-median objective function, a natural formulation of clustering in which we attempt to minimize the average distance to cluster centers. One of the main contributions of this paper is a simple but powerful sampling technique that we call successive sampling that could be of independent interest. We show that our sampling procedure can rapidly identify a small set of points (of size just O(k log \frac{n}{k})) that summarize the input points for the purpose of clustering. Using successive sampling, we develop an algorithm for the k-median problem that runs in O(nk) time for a wide range of values of k and is guaranteed, with high probability, to return a solution with cost at most a constant factor times optimal. We also establish a lower bound of &Omega;(nk) on any randomized constant-factor approximation algorithm for the k-median problem that succeeds with even a negligible (say \frac{1}{100}) probability. The best previous upper bound for the problem was &Otilde;(nk), where the &Otilde;-notation hides polylogarithmic factors in n and k. The best previous lower bound of &Omega;(nk) applied only to deterministic k-median algorithms. While we focus our presentation on the k-median objective, all our upper bounds are valid for the k-means objective as well. In this context our algorithm compares favorably to the widely used k-means heuristic, which requires O(nk) time for just one iteration and provides no useful approximation guarantees.
Teaching computer networking with the help of personal computer networks
Authors: Rocky K. C. Chang
Venue: ACM SIGCSE Bulletin (2004)

This paper describes an "experiential" learning approach to teaching a foundational course on Computer Networking. In additional to the traditional laboratory sessions and analytical problem-solving, I have introduced a class project based on personal computer networks for the last three years. Each project group sets up and owns an IP private network throughout the course, and they perform various experiments on it to verify and test the networking principles learned from the textbooks and lectures. The students' feedbacks collected so far are extremely positive. Not only they can acquire practical skills during the process, they are able to better understand the abstract networking concepts and protocols through their working experience with the personal computer networks.
For Which Densities are Random Triangle-Free Graphs Almost Surely Bipartite?
Authors: Deryk Osthus, J&#x00fc;rgen Pr&#x00f6;mel, Anusch Taraz
Venue: Combinatorica (2003)

Denote by $${\user1{\mathcal{T}}}{\left( {{\user2{n}}{\user2{, m}}} \right)}$$ the class of all triangle-free graphs on n vertices and m edges. Our main result is the following sharp threshold, which answers the question for which densities a typical triangle-free graph is bipartite. Fix &#x03b5; > 0 and let $$t_{3} = t_{3} {\left( n \right)}\frac{{{\sqrt 3 }}} {4}n^{{3/2}} {\sqrt {\log {\kern 1pt} {\kern 1pt} n} }$$. If n/2 &#x2264; m &#x2264; (1 &#x2212; &#x03b5;) t3, then almost all graphs in $${\user1{\mathcal{T}}}{\left( {{\user2{n}}{\user2{, m}}} \right)}$$ are not bipartite, whereas if m &#x2265; (1 + &#x03b5;)t3, then almost all of them are bipartite. For m &#x2265; (1 + &#x03b5;)t3, this allows us to determine asymptotically the number of graphs in $${\user1{\mathcal{T}}}{\left( {{\user2{n}}{\user2{, m}}} \right)}$$. We also obtain corresponding results for C&#x2113;-free graphs, for any cycle C&#x2113; of fixed odd length.
Intelligent Agents on the Web: A Review
Authors: Noureddine Boudriga, Mohammad S. Obaidat
Venue: Computing in Science and Engineering (2004)

Intelligent agents are goal-driven and autonomous, and can communicate and interact with each other. Moreover, they can evaluate information obtained online from heterogeneous sources and present information tailored to an individual's needs. This article covers different facets of the intelligent agent paradigm and applications, while also exploring new opportunities and trends for intelligent agents.
On Combining a Semantic Engine and Flexible Network Policies for P2P Knowledge Sharing Networks
Authors: S. Castano, A. Ferrara, S. Montanelli, E. Pagani, G. P. Rossi, S. Tebaldi
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

Peer-to-Peer (P2P) systems have recently become popular for content sharing, and a number of different approaches have been studied to perform effective content retrieval in such networks. In this paper, we discuss how conventional P2P network policies for content retrieval could be combined with a semantic engine component to enforce peer-based knowledge sharing. The semantic engine exploits peer ontologies for providing a semantically rich representation of peer knowledge, and matching techniques for comparing ontologies of different peers for knowledge sharing and discovery purposes.
A New Hardware Architecture for Genomic and Proteomic Sequence Alignment
Authors: Greg Knowles, Paul Gardner-Stephen
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

We describe a novel hardware architecture for genomic and proteomic sequence alignment which achieves a speed-up of two to three orders of magnitude over Smith-Waterman dynamic programming (DP) in hardware [1]-[7]. In [8, 9] we introduce several features of our search algorithm, DASH, which outperforms NCBI-Blast (BLAST) [10] by an order of magnitude in software, and has better sensitivity. Indeed, DASH has been shown to have excellent sensitivity compared to Smith-Waterman. It is designed around the principle of considering genomic and proteomic sequence alignments to typically consist of regions of high homology (the diagonals) interspersed with regions of low homology. In DASH, the optimal solution consists of such diagonals joined by regions of exact DP. This is affordable due to the small area of these inter-connecting regions, Accordingly, we have designed a chip which finds the diagonals and performs the inter-region DP directly in hardware. On a Xilinx Virtex II, XC2V6000, FPGA, it performs over 10^12 base comparisons/second.
Scratch: A Sneak Preview
Authors: John Maloney, Leo Burd, Yasmin Kafai, Natalie Rusk, Brian Silverman, Mitchel Resnick
Venue: Proceedings of the Second International Conference on Creating, Connecting and Collaborating through Computing (2004)

Scratch is a networked, media-rich programmingenvironment designed to enhance the development oftechnological fluency at after-school centers ineconomically-disadvantaged communities. Just as theLEGO MindStorms robotics kit added programmabilityto an activity deeply rooted in youth culture (buildingwith LEGO bricks), Scratch adds programmability tothe media-rich and network-based activities that aremost popular among youth at after-school computercenters. Taking advantage of the extraordinaryprocessing power of current computers, Scratchsupports new programming paradigms and activitiesthat were previously infeasible, making it betterpositioned to succeed than previous attempts tointroduce programming to youth.Our working hypothesis is that, as kids work onpersonally meaningful Scratch projects such asanimated stories, games, and interactive art, they willdevelop technological fluency, mathematical andproblem solving skills, and a justifiable self-confidencethat will serve them well in the wider spheres of theirlives.
Real-Time Video Analysis on an Embedded Smart Camera for Traffic Surveillance
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

A smart camera combines video sensing, high-level videoprocessing and communication within a single embeddeddevice. Such cameras are key components in novel surveillancesystems.This paper reports on a prototyping development of asmart camera for traffic surveillance. We present its scalablearchitecture comprised of a CMOS sensor, digital signalprocessors (DSP), and a network processor. We furtherdiscuss the mapping of high-level video processing algorithmsto embedded DSP-based platforms and identify typicalpitfalls for the porting of software from desktops toembedded platforms. Our mapping strategies are demonstratedon an algorithm for automatic detection of stationaryvehicles. This algorithm is migrated from a Matlab-basedprototyping implementation to an embedded DSP implementationin our smart camera.Our implemented smart camera prototype streams thevideo data over an IP-network to a central monitoring stationand is able to detect stationary vehicles and blockingcargo on highways within the required real-time constraintsof six seconds.
Exploiting Multiple Views to Support Visual Exploration and Mining
Authors: Enrico Bertini, Tiziana Catarci, Stephen Kimani, Giuseppe Santucci
Venue: Proceedings of the Second International Conference on Coordinated & Multiple Views in Exploratory Visualization (2004)

It is no exaggeration that the quantity and complexity of data still present a formidable challenge to the effective and efficient acquisition of knowledge. On the other hand, results obtained from the application of mining techniques are often in a form that is difficult to be understood by humans who are accustomed to perceiving information through the visual channel. Multiple views present a special opportunity that can be leveraged in order to address such challenges and visually support the entire exploration and mining process. This paper acknowledges that special visual opportunity by describing how our visual data mining system, VidaMine, exploits multiple views in supporting the user in the exploration and mining process.
Mining Web Transaction Patterns in Electronic Commerce Environment
Authors: Yue-Shi Lee, Show-Jane Yen, Min-Chi Hsieh, Ghi-Hua Tu
Venue: Proceedings of the E-Commerce Technology for Dynamic E-Business, IEEE International Conference (2004)

World Wide Web is the most excited impacts to the human society in the past few years. It provides another way for doing business. This paper proposes a new algorithm, IPA (Integrating Path traversal patterns and Association rules), for mining web transaction patterns in the electronic commerce environment. The IPA algorithm takes both the traveling and purchasing behaviors of customers into consideration at the same time to overcome the disadvantages of pure association rules mining and pure path traversal pattern mining. The experimental results show that the IPA algorithm can simultaneously and efficiently capture the user's traversing and purchasing behaviors.
Proposal and Evaluation for Organising and Using Available Data for Software Performance Estimations in Embedded Platform Development
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Embedded platform development, where a platform isa basis for a family of products, is characterized by soft-and hardware co-design as well as very tight constraints oncost and available real-time system performance. The latterimplies that early software performance estimation playsa crucial role in embedded platform development. Due tothe different focus of software and hardware design, performancedata and estimations techniques needed are by natureheterogeneous. In order to simplify access and availabilityof software performance data for an entire developmentorganization, a database tool is proposed and implemented,which allows organizing, presenting, and to someextent evaluating the existing, inhomogeneous data for softwareperformance estimations.
Assessing the Impact of Dynamic Power Management on the Functionality and the Performance of Battery-Powered Appliances
Authors: A. Acquaviva, A. Aldini, M. Bernardo, A. Bogliolo, E. Bonta, E. Lattanzi
Venue: Proceedings of the 2004 International Conference on Dependable Systems and Networks (2004)

In this paper we provide an incremental methodology to assessthe effect of the introduction of a dynamic power managerin a mobile embedded computing device. The methodologyconsists of two phases. In the first phase, we verifywhether the introduction of the dynamic power manager altersthe functionality of the system. We show that this canbe accomplished by employing standard techniques basedon equivalence checking for noninterference analysis. In thesecond phase, we quantify the effectiveness of the introductionof the dynamic power manager in terms of power consumptionand overall system efficiency. This is carried outby enriching the functional model of the system with informationabout the performance aspects of the system, andby comparing the values of the power consumption and theoverall system efficiency obtained from the solution of theperformance model with and without dynamic power manager.To this purpose, first we employ a more abstract performancemodel based on the Markovian assumption, thenwe use a more realistic performance model - to be validatedagainst the Markovian one - where general probability distributionsare considered. The methodology is illustrated bymeans of its application to the study of a remote procedurecall mechanism - through which a battery-powered deviceis used by some application requesting information - andof a streaming video service - which is accessed by a mobileclient equipped with a power-manageable network interface card.
Evaluating top-k queries over web-accessible databases
Authors: Amélie Marian, Nicolas Bruno, Luis Gravano
Venue: ACM Transactions on Database Systems (TODS) (2004)

A query to a web search engine usually consists of a list of keywords, to which the search engine responds with the best or "top" k pages for the query. This top-k query model is prevalent over multimedia collections in general, but also over plain relational data for certain applications. For example, consider a relation with information on available restaurants, including their location, price range for one diner, and overall food rating. A user who queries such a relation might simply specify the user's location and target price range, and expect in return the best 10 restaurants in terms of some combination of proximity to the user, closeness of match to the target price range, and overall food rating. Processing top-k queries efficiently is challenging for a number of reasons. One critical such reason is that, in many web applications, the relation attributes might not be available other than through external web-accessible form interfaces, which we will have to query repeatedly for a potentially large set of candidate objects. In this article, we study how to process top-k queries efficiently in this setting, where the attributes for which users specify target values might be handled by external, autonomous sources with a variety of access interfaces. We present a sequential algorithm for processing such queries, but observe that any sequential top-k query processing strategy is bound to require unnecessarily long query processing times, since web accesses exhibit high and variable latency. Fortunately, web sources can be probed in parallel, and each source can typically process concurrent requests, although sources may impose some restrictions on the type and number of probes that they are willing to accept. We adapt our sequential query processing technique and introduce an efficient algorithm that maximizes source-access parallelism to minimize query response time, while satisfying source-access constraints. We evaluate our techniques experimentally using both synthetic and real web-accessible data and show that parallel algorithms can be significantly more efficient than their sequential counterparts.
A Usability Study of Physicians' Interaction with PDA and Laptop Applications to Access an Electronic Patient Record System
Authors: Nestor J. Rodriguez, Jose A. Borges, Yajaira Soler, Viviam Murillo, Daniel Z. Sands
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

PDA (Personal Digital Assistant) technology is beginning to emerge as a viable technologyfor accessing and updating patient records. A handful of studies can be found in the literatureon the use of PDAs for accessing patient's records. However, none have actually presented a formal usability study of user interaction with these systems. In this paper we describe ausability study in which we compared two versions (PDA and laptop) of an application toaccess an electronic patient record system in terms of the efficiency and satisfaction achieved by physicians while conducting typical tasks.The results of the study revealed that physicians are significantly faster on a laptop than ona PDA reading and performing tasks that require text entry. However, they are significantlyfaster on a PDA than on a laptop performing tasks that only require pointing and clicking. Ingeneral they are significantly more satisfied with the actions performed to complete typicaltasks on the laptop than on the PDA.
Distributed council election
Authors: Danny Raz, Yuval Shavitt, Lixia Zhang
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

This paper studies the problem of electing a small number of representatives (council) out of a (possible large) group of anonymous candidates. The problem arises in scenarios such as multicast where, to avoid feedback implosion, a small subset of the receivers is chosen to provide feedback on network conditions.We present several algorithms for this problem and analyze the expected number of messages and rounds required for their convergence. In particular, we present an algorithm that almost always converges in one round using a small number of messages (for typical council size) when the number of hosts is known. In the case where the number of hosts is unknown (and too large to be polled), our algorithms converge in a small number of rounds that improves previous results by Bolot et al. (1994).
A Knowledge-based Framework for Dynamic Semantic Web Services Brokering and Management
Authors: Randy Howard, Larry Kerschberg
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

The concept of automating Web services, specifically the brokering activities, is an active research topic. We need a comprehensive and overarching framework that handles the discovery, differentiation, negotiation and selection processing within the context of workflow management, and addresses the issues related to Virtual Organizations. The goal is to add semantics to Web services to endow them with capabilities currently lacking in the literature, but necessary for their successful deployment in future systems. This paper references how such a framework, called the KDSWS Framework, addresses in an integrated end-to-end manner, the life-cycle of activities involved in brokering and managing Semantic Web Services. The following issues are addressed: semantic specification of services' capabilities; brokering the services, workflow management, resource management, interoperation and evolution of the Virtual Organization.
A Theoretical Analysis of Gene Selection
Authors: Sach Mukherjee, Stephen J. Roberts
Venue: Proceedings of the 2004 IEEE Computational Systems Bioinformatics Conference (2004)

A great deal of recent research has focused on the challenging task of selecting differentially expressed genes from microarray data (ýgene selectioný). Numerous gene selection algorithms have been proposed in the literature, but it is often unclear exactly how these algorithms respond to conditions like small sample-sizes or differing variances. Choosing an appropriate algorithm can therefore be difficult in many cases. In this paper we propose a theoretical analysis of gene selection, in which the probability of successfully selecting relevant genes, using a given gene ranking function, is explicitly calculated in terms of population parameters. The theory developed is applicable to any ranking function which has a known sampling distribution, or one which can be approximated analytically. In contrast to empirical methods, the analysis can easily be used to examine the behaviour of gene selection algorithms under a wide variety of conditions, even when the numbers of genes involved runs into the tens of thousands. The utility of our approach is illustrated by comparing three well-known gene ranking functions.
Minimum-power multicast routing in static ad hoc wireless networks
Authors: Peng-Jun Wan, Gruia Călinescu, Chih-Wei Yi
Venue: IEEE/ACM Transactions on Networking (TON) (2004)

Wieselthier et al. (2000) proposed three greedy heuristics for Min-Power Asymmetric Broadcast Routing: SPT (shortest-path tree), MST (minimum spanning tree), and BIP (broadcasting incremental power). Wan et al. (2001) proved that SPT has an approximation ratio of at least (n2) where n is the total number of nodes, and both MST and BIP have constant approximation ratios. Based on the approach of pruning, Wieselthier et al. also proposed three greedy heuristics for Min-Power Asymmetric Multicast Routing: P-SPT (pruned shortest-path tree), P-MST (pruned minimum spanning tree), and P-BIP (pruned broadcasting incremental power). In this paper, we first prove that the approximation ratios of these three heuristics are at least (n-1/2), n-1, and n-2-o(1), respectively. We then present constant-approxiation algorithms for Min-Power Asymmetric Multicast Routing. We show that any ρ-approximation Steiner tree algorithm gives rise to cρ-approximation heuristic for Min-Power Asymmetric Multicast Routing, where c is a constant between 6 and 12. In particular, the Takahashi-Matsuyama Steiner tree heuristic leads to a heuristic called SPF (shortest-path first), which has an approximation ratio of at most 2c. We also present another heuristic, called MIPF (minimum incremental path first), for Min-Power Asymmetric Multicast Routing and show that its approximation ratio is between (13/3) and 2c. Both SPF and MIPF can be regarded as an adaptation of MST and BIP, respectively, in a different manner than pruning. Finally, we prove that any ρ-approximation Steiner tree algorithm also gives rise to a 2ρ-approximation algorithm for Min-Power Symmetric Multicast Routing.