ppxscal/embedding_network huggingface dataset:
Approximation algorithms for clustering uncertain data
Authors: Graham Cormode, Andrew McGregor
Venue: Proceedings of the twenty-seventh ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems (2008)

There is an increasing quantity of data with uncertainty arising from applications such as sensor network measurements, record linkage, and as output of mining algorithms. This uncertainty is typically formalized as probability density functions over tuple values. Beyond storing and processing such data in a DBMS, it is necessary to perform other data analysis tasks such as data mining. We study the core mining problem of clustering on uncertain data, and define appropriate natural generalizations of standard clustering optimization criteria. Two variations arise, depending on whether a point is automatically associated with its optimal center, or whether it must be assigned to a fixed cluster no matter where it is actually located. For uncertain versions of k-means and k-median, we show reductions to their corresponding weighted versions on data with no uncertainties. These are simple in the unassigned case, but require some care for the assigned version. Our most interesting results are for uncertain k-center, which generalizes both traditional k-center and k-median objectives. We show a variety of bicriteria approximation algorithms. One picks O(kε--1log2n) centers and achieves a (1 + ε) approximation to the best uncertain k-centers. Another picks 2k centers and achieves a constant factor approximation. Collectively, these results are the first known guaranteed approximation algorithms for the problems of clustering uncertain data.
An energy-efficient and QoS-based MAC layer protocol for WMSN
Authors: Sangeon Park, Navrati Saxena, Jitae Shin, Minsoo Suk
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Delivering multimedia content with precise quality of service over the energy-constrained sensor networks is enabling a new field popularly known as Wireless Multimedia Sensor Networks (WMSNs). The major goal of these Wireless Multimedia Sensor Networks is to deliver multimedia contents over wireless sensor networks with certain level of QoS guarantee while maintaining the efficient use of energy for such networks. We in this paper propose an energy efficient MAC layer protocol to deliver multimedia contents with certain degree of quality of service guarantee over such networks.
On dynamic rigidity of robotic manipulators
Authors: Attila L. Becsik, Imre J. Rudas
Venue: Proceedings of the 4th WSEAS International Conference on Systems Theory and Scientific Computation (2004)

Dynamic rigidity is one of the key issues in Robotic. The rigidity of the robot arm, which would give useful information to the designer and help to prepare modifications of the construction of the arm. To determine the oscillation of the robot arm while it is in motion or at rest is important to both manufacturer und users. This investigation of rigidity means that we go into the theme of dynamic rigidity and the reciprocal of these, i.e. the compliance. The paper is illustrated with the results of the measurements on robots ATR HD 200 und 500.
Tight RMR lower bounds for mutual exclusion and other problems
Authors: Hagit Attiya, Danny Hendler, Philipp Woelfel
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order encoding algorithm, shared by n processes, has an execution that incurs Ω(n log n) RMRs. From this we derive the same lower bound for the mutual exclusion, bounded counter and store/collect synchronization problems. The bounds we obtain for these problems are tight. It follows from the results of [10] that our lower bounds hold also for algorithms that can use comparison primitives and load-linked/store-conditional in addition to reads and writes. Our mutual exclusion lower bound proves a longstanding conjecture of Anderson and Kim.
Speech Visualization based on Locally Linear Embedding (LLE) for the Hearing Impaired
Authors: Wang Xu, Xue Lifang, Yang Dan, Han Zhiyan
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

This paper describes a novel speech visualization method that creates a readable pattern based on locally linear embedding (LLE). LLE is an unsupervised learning algorithm for feature extraction. If the speech variability is described by a small number of continuous features, then we can imagine the data as lying on a low dimensional manifold in the high dimensional space of speech waveforms. The goal of feature extraction is to reduce the dimensionality of the speech signal while preserving the informative signatures. Firstly, speech signal undergoes a series of preprocessing course. Secondly, we make use of LLE decreasing the dimension of speech feature vector. Finally, we utilize plot display algorithm to generate a speech plot. The algorithm consists of three parts: coordinates partition, area computation and coordinates calculation of speech feature value. The speech feature after dimension decreasing by LLE is displayed on the CRT by plot patterns and the deaf can utilize their own brain to identify different speech for training their oral ability effectively.
Agile Implementation Phase in Two Canadian Organizations
Authors: Jaana Nyfjord, Mira Kajko-Mattsson
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

In this paper, we investigate the status of the agile implementation phase within two Canadian organizations. We do this by comparing current agile process models to the industrial practice. Our results show that the organizations studied have adopted most of the activities as suggested in the agile models. However, they had to make some revisions, due to the fact that some of the guidelines as provided by the agile models were unclear, conflicting, ambiguous or they were simply missing.
The circular chromatic number of series-parallel graphs
Authors: Pavol Hell, Xuding Zhu
Venue: Journal of Graph Theory (2000)

In this article, we consider the circular chromatic number &chi;c(G) of series-parallel graphs G. It is well known that series-parallel graphs have chromatic number at most 3. Hence, their circular chromatic numbers are at most 3. If a series-parallel graph G contains a triangle, then both the chromatic number and the circular chromatic number of G are indeed equal to 3. We shall show that if a series-parallel graph G has girth at least 2 &lfloor;(3k - 1)-2&rfloor;, then &chi;c(G) &le; 4k-(2k - 1). The special case k = 2 of this result implies that a triangle free series-parallel graph G has circular chromatic number at most 8-3. Therefore, the circular chromatic number of a series-parallel graph (and of a K4-minor free graph) is either 3 or at most 8-3. This is in sharp contrast to recent results of Moser [5] and Zhu [14], which imply that the circular chromatic number of K5-minor free graphs are precisely all rational numbers in the interval [2, 4]. We shall also construct examples to demonstrate the sharpness of the bound given in this article. &copy; 2000 John Wiley & Sons, Inc. J Graph Theory 33: 14&ndash;24, 2000
A purely map procedure for two-level multiple-output logic minimization
Authors: Ali M. Rushdi, Omar M. Ba-Rukab
Venue: International Journal of Computer Mathematics (2007)

A pedagogical treatment of two-level multiple-output logic minimization is presented through a compact exposition of a novel manual fast procedure. This procedure is a purely map technique which generalizes the map procedure for single-output minimization. It requires neither the generation of the set of all paramount prime implicants, nor the construction of a cover matrix. Instead, it utilizes certain visual interactions between various groups of maps placed at distinct levels of a Hasse diagram, which is conveniently drawn in a Karnaugh map layout so that any parent map is easily visualized as adjacent to all its children maps. The present exposition is believed to enhance what is currently available in undergraduate texts, and is intended as a supplement to, rather than a replacement of, automated computational experience. An illustrative example demonstrates the proposed procedure for the dual cases of AND-OR and OR-AND minimizations.
Procurement platforms for consumers
Authors: Michael Klafft
Venue: ACM SIGecom Exchanges (2008)

E-procurement platforms have been widely used in business-to-business and business-to-government transactions for many years. More recently, such platforms have become available for consumers as well. However, the question is if such platforms will be as beneficial in a consumer context as they have been in B2B and B2G before. By summarizing recent results from empirical studies and from focus group interviews with platform users, this paper discusses benefits and risks which using e-procurement platforms brings about for the often inexperienced consumer. Current market trends are presented, key obstacles for platform acceptance are identified, and recommendations for future platform development are provided.
Hierarchical Markov chain analysis of an adaptive bandwidth reservation algorithm in wireless communication systems
Authors: Donghwan Lee, Jin-Ghoo Choi, Changhee Joo, Saewoong Bahk
Venue: Performance Evaluation (2008)

Admission control for handoff drops is a key resource management technique in wireless multimedia networks. While several adaptive schemes have been studied in the literature, little effort has been made for their analysis due to difficulty in mathematical modeling. Our main contribution is the proposal of a methodology for analyzing the Markov chain that is created when modeling a simple adaptive bandwidth reservation mechanism. For this purpose, we decompose the Markov chain into two levels: intra-domain for the analysis of equilibrium states and inter-domain for the analysis of transient states. This hierarchical decomposition provides an exact solution with significantly reduced computational complexity.
Introducing USB technology into the undergraduate CS curriculum
Authors: Chuck Pheatt
Venue: Journal of Computing Sciences in Colleges (2008)

The Universal Serial Bus (USB) has become a standard way to attach mainstream products like cameras, disk drives and keyboards to hosts. Historically, developing firmware and software for such devices has been the realm of electrical and computer engineers due to the hardware orientation of the software development process. Introducing this technology to Computer Science (CS) students has been limited due to the steep learning curve associated with understanding the hardware required for implementing USB and the complexity and cost associated with providing an environment that students may use to experiment with the technology. In this paper, an easily accessible development environment and sample course modules are discussed that are applicable to undergraduate CS students and their course of study.
Embedded education for Computer Rank Examination
Authors: Tianzhou Chen, Weihua Hu, Qingsong Shi, Hui Yan
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

Embedded system has become one of the most important directions in computer education. Embedded system is at the intersection of control system, command and control, wireless data systems, real-time system and so on. The Computer Rank Examination (CRE) is designed to promote the certification for computer application. In this paper, we describe the efforts on embedded education for CRE including the curriculum design and practice.
Statistical leakage estimation of double gate FinFET devices considering the width quantization property
Authors: Jie Gu, John Keane, Sachin Sapatnekar, Chris H. Kim
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

This paper presents a statistical leakage estimation method for FinFET devices considering the unique width quantization property. Monte Carlo simulations show that the conventional approach underestimates the average leakage current of FinFET devices by as much as 43% while the proposed approach gives a precise estimation with an error less than 5%. Design example on subthreshold circuits shows the effectiveness of the proposed method.
Some(what) grand challenges for information retrieval
Authors: Nicholas J. Belkin
Venue: ACM SIGIR Forum (2008)

Although we see the positive results of information retrieval research embodied throughout the Internet, on our computer desktops, and in many other aspects of daily life, at the same time we notice that people still have a wide variety of difficulties in finding information that is useful in resolving their problematic situations. This suggests that there still remain substantial challenges for research in IR. Already in 1988, on the occasion of receiving the ACM SIGIR Gerard Salton Award, Karen Sp&auml;rck Jones suggested that substantial progress in information retrieval was likely only to come through addressing issues associated with users (actual or potential) of IR systems, rather than continuing IR research's almost exclusive focus on document representation and matching and ranking techniques. In recent years it appears that her message has begun to be heard, yet we still have relatively few substantive results that respond to it. In this paper, I identify and discuss a few challenges for IR research which fall within the scope of association with users, and which I believe, if properly addressed, are likely to lead to substantial increases in the usefulness, usability and pleasurability of information retrieval.
Parallel algorithm for finding the minimum edges to build a strongly connected directed graph
Authors: Akio Tada, Eiichi Mukai, Masahiro Migita, Tsuyoshi Itokawa
Venue: Proceedings of the 12th WSEAS International Conference on Applied Mathematics (2007)

The problem of finding the minimum edges to build a strongly connected directed graph is one of the most fundamental problems in graph theory. The known parallel algorithm solves this problem in O(log n) time using O(n3) processors on a CRCW PRAM model. In this paper, we propose a parallel algorithm to find the minimum edges to build a strongly connected directed graph for a disconnected directed acyclic graph in O(log(n+m)) time using O(n + m) processors on a CREW PRAM model. This algorithm is an efficient parallel algorithm because the number of processors depends on the density of the given graph and the time complexity is also more efficient when compared with the identical model.
Strategy-Based Instruction: Lessons Learned in Teaching the Effective and Efficient Use of Computer Applications
Authors: Suresh K. Bhavnani, Frederick A. Peck, Frederick Reif
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

Numerous studies have shown that many users do not acquire the knowledge necessary for the effective and efficient use of computer applications such as spreadsheets and Web-authoring tools. While many cognitive, cultural, and social reasons have been offered to explain this phenomenon, there have been few systematic attempts to address it. This article describes how we identified a framework to organize effective and efficient strategies to use computer applications and used an approach called strategy-based instruction to teach those strategies over five years to almost 400 students. Controlled experiments demonstrated that the instructional approach (1) enables students to learn strategies without harming command knowledge, (2) benefits students from technical and nontechnical majors, and (3) is robust across different instructional contexts and new applications. Real-world classroom experience of teaching strategy-based instruction over several instantiations has enabled the approach to be disseminated to other universities. The lessons learned throughout the process of design, implementation, evaluation, and dissemination should allow teaching a large number of users in many organizations to rapidly acquire the strategic knowledge to make more effective and efficient use of computer applications.
Implementation of CAM physiotherapy device with a virtual spring
Authors: Hung-Jung Ho, Tien-Chi Chen
Venue: Computers in Biology and Medicine (2008)

Continuous passive motion (CPM) and continuous active motion (CAM) physiotherapy devices are commonly used to promote rehabilitation of damaged synovial joints. A CPM/CAM device with no resistive CAM-type components is presented. In the CPM mode the electric motor functions conventionally, but in the CAM mode, intelligent use of the motor simulates resistive components by driving the motor to exert a force opposing the patient's muscle activity, so as to simulate the effect of a spring load. The system easily connects to the Internet or other data links for automatic monitoring of home patients, hospital networks, research stations, or telemedicine applications.
Privacy policy enforcement in enterprises with identity management solutions
Authors: Marco Casassa Mont, Robert Thyne
Venue: Journal of Computer Security (2008)

People are usually asked by enterprises to disclose their personal information to access web services and engage in business interactions. Enterprises need this information to enable their business processes. This is unlikely to change, at least in the foreseeable future. When collecting personal data, enterprises must satisfy privacy laws and policies along with addressing people's expectations on how their data should be handled. Currently much is done by means of manual processes, in particular in terms of privacy enforcement: these processes are prone to mistakes and hard to comply with. Automation can help enterprises to deal with these privacy management issues, in particular the enforcement of privacy policies on collected personal data. Enterprises have already been investing in identity management solutions: they require that approaches to automate privacy management should keep into account and leverage these solutions. This paper discusses our research and development work to automate the enforcement of privacy policies in enterprises. Our model of privacy policy enforcement is introduced along with the technical details of a related prototype, integrated (as a proof of concept) with HP Select Access, a state-of-the-art identity management solution. This technology is currently under productisation. We discuss our current results and next steps.
A survey of agent-oriented software engineering for service-oriented computing
Authors: Peter Leong, Chunyan Miao, Bu-Sung Lee
Venue: International Journal of Web Engineering and Technology (2008)

Services play an increasingly important role in software applications today. Service-Oriented Computing (SOC) increases the speed of system development through loose coupling between the system components, the discovery of services and consolidating multiple heterogeneous services. However, the present conventional approaches to engineering SOC systems are not able to address the complexities of open and dynamic environments, such as those in an extended virtual enterprise or in interorganisation workflows. This is the first survey paper for Agent-Oriented Software Engineering (AOSE) to be applied to SOC. In this paper, we have also identified the critical challenges for Service-Oriented Software Engineering (SOSE) and how agent-based techniques can be applied to address these challenges. The paper surveys and evaluates a number of models and methodologies that attempt to tie in two domains of software engineering, namely, Agent-Oriented Analysis and Design and Service-Oriented Analysis and Design (SOAD).
Application-Oriented Trust in Distributed Computing
Authors: Riccardo Scandariato, Yoram Ofek, Paolo Falcarin, Mario Baldi
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Preserving integrity of applications being executed in remote machines is an open problem. Integrity requires that application code is not tampered with, prior to or during execution, by a rogue user or a malicious software agent.This paper presents a methodology to enforce run-time integrity of application code by means of an integrity-preserving software component that is combined with the application. The software component is a trusted logic that can be replaced continuously from a remote location during run-time. For added assurance, the software component produces continuous sequence of proofs of its proper operation that are verified remotely.
Multiscale numerical algorithm for the elliptic eigenvalue problem with the mixed boundary in perforated domains
Authors: Li-Qun Cao, Jian-Lan Luo
Venue: Applied Numerical Mathematics (2008)

In this paper, we study the elliptic eigenvalue problem with the mixed boundary in a perforated domain. The higher-order asymptotic expansions of the eigenvalues and the eigenfunctions for the problem will be presented. We derive the rigorous justification of the convergence results. From this, a multiscale finite element method and some numerical examples are presented.
Taking Advantage of COTS for Developing Aspect-Oriented Software Architectures
Authors: Jennifer Pérez, Isidro Ramos, Jose Ángel Carsí
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

Reused software artefacts guarantee their quality and suitable functionality because they have been tested and used before. As a consequence, Commercial Off-The-Shelf (COTS) importation has acquired relevance in the last few years. This paper presents a proposal for integrating COTS into aspect-oriented architectural models that are developed and maintained following the Model-Driven Development (MDD) approach. The proposal is based on the PRISMA approach, which gives complete support to the development of technology-independent, aspect-oriented software architectures. PRISMA integrates COTS into its MDD process to obtain the complete application code automatically. The proposal is illustrated using a case study: a tele-operated robot that has been developed completely using this proposal.