ppxscal/embedding_network huggingface dataset:
Key Distributions as Musical Fingerprints for Similarity Assessment
Authors: Arpi Mardirossian, Elaine Chew
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This paper presents a pitch-based approach for creating musical fingerprints for similarity assessment. An effective measure for musical similarity impacts music indexing and classification in music retrieval systems. The proposed method creates key distributions from polyphonic music, and compares the key distributions of pairs of pieces, by calculating their correlation coefficient, to determine a degree of similarity between them. The proposed method assumes no knowledge of the time structure of the piece, nor does it require pieces to be the same length. We present results using this method to assess similarity among selected variations by Mozart. The results show that the correlation coefficients of pieces from the same set of variations are centered on 0.88 (with a standard deviation of 0.11), and that of pieces across different sets of variations are centered on 0.32 (with a standard deviation of 0.31).
Simulation in surgery, anesthesia and medical interviewing
Authors: Augustine O. Esogbue
Venue: ACM SIGSIM Simulation Digest (1979)

In this paper, we present a bird's-eye view of our work in health systems involving the applications of simulation to the surgical department, anesthesia, and medical diagnosis. Through all these models, an attempt is made to provide the reader with appropriate insights into the process of problem selection, language choice, analysis, interpretation and implementation of results, as well as the limitations of simulation in health systems.
A generator for hierarchical problems
Authors: Edwin D. de Jong, Richard A. Watson, Dirk Thierens
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

We describe a generator for hierarchical problems called the Hierarchical Problem Generator (HPG). Hierarchical problems are of interest since they constitute a class of problems that can be addressed efficiently, even though high-order dependencies between variables may exist. The generator spans a wide ranges of hierarchical problems, and is limited to producing hierarchical problems. It is therefore expected to be useful in the study of hierarchical methods, as has already been demonstrated in experiments. The generator is freely available for research use.
On the scale of probe traffic for internet transport protocols
Authors: C.-C. Jay Kuo
Venue:  (2005)

The probe traffic is an essential tool to an end user in the Internet to monitor the network condition and estimate the available bandwidth. For example, the widely used TCP protocol adds one more packet to the current sending rate at every round-trip-time to explore the potential network capacity. The probe traffic should be aggressive enough to get a meaningful feedback. In the meanwhile, it should not be too aggressive to affect the stability of the network. Thus, it is critical to find a right probe traffic scale with respect to a given network environment. In this research, we investigate several emerging networking environments and applications, in which the probe traffic scale plays an interesting and important role. First, we investigate TCP over 802.11 multihop ad hoc networks. The network participants in 802.11 networks are involved in a complicated cross-layer interaction. It is observed that the inappropriate scale of TCP probe traffic induces the over-reaction of on-demand ad hoc routing protocol and hurts the quality of end-to-end connection. So, we propose limiting the growth rate of TCP window to prevent the over-reaction of the routing protocol. The proposed scheme is analytically tractable, and a dramatic improvement of TCP performance and network stability can be achieved in various 802.11 multihop networks. Next, we investigate layered video multicast for live webcasting to a multitude of heterogeneous viewers. We introduce a congestion control strategy based on the usage of thin layers to suppress the side-effects of the coarse granularity of layer partition commonly found in the typical layered multicast. The strategy is directly applicable to the layered video format in the standard track like MPEG4-FGS to achieve an improvement in TCP-friendliness and network fairness. Based on our research as stated above, we conclude that the scale of the probe traffic is a critical factor to be considered in the design of networking and application systems in the next generation IP networks.
Locke, Intellectual Property Rights, and the Information Commons
Authors: Herman T. Tavani
Venue: Ethics and Information Technology (2005)

This paper examines the question whether, and to what extent, John Locke's classic theory of property can be applied to the current debate involving intellectual property rights (IPRs) and the information commons. Organized into four main sections, Section 1 includes a brief exposition of Locke's arguments for the just appropriation of physical objects and tangible property. In Section 2, I consider some challenges involved in extending Locke's labor theory of property to the debate about IPRs and digital information. In Section 3, it is argued that even if the labor analogy breaks down, we should not necessarily infer that Locke's theory has no relevance for the contemporary debate involving IPRs and the information commons. Alternatively, I argue that much of what Locke has to say about the kinds of considerations that ought to be accorded to the physical commons when appropriating objects from it --- especially his proviso requiring that "enough and as good" be left for others --- can also be applied to appropriations involving the information commons. Based on my reading of Locke's proviso, I further argue that Locke would presume in favor of the information commons when competing interests (involving the rights of individual appropriators and the preservation of the commons) are at stake. In this sense, I believe that Locke offers us an adjudicative principle for evaluating the claims advanced by rival interests in the contemporary debate about IPRs and the information commons. In Section 4, I apply Locke's proviso in my analysis of two recent copyright laws: the Copyright Term Extension Act (CTEA), and the Digital Millennium Copyright Act (DMCA). I then argue that both laws violate the spirit of Locke's proviso because they unfairly restrict the access that ordinary individuals have previously had to resources that comprise the information commons. Noting that Locke would not altogether reject copyright protection for IPRs, I conclude that Locke's classic property theory provides a useful mechanism for adjudicating between claims about how best to ensure that individuals will be able to continue to access information in digitized form, while at the same time also allowing for that information to enjoy some form of legal protection.
Using offline bitstream analysis for power-aware video decoding in portable devices
Authors: Yicheng Huang, Samarjit Chakraborty, Ye Wang
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Dynamic voltage/frequency scheduling algorithms for multimedia applications have recently been a subject of intensive research. Many of these algorithms use control-theoretic feedback techniques to predict the future execution demand of an application based on the demand in the recent past. Such techniques suffer from two major disadvantages: (i) they are computationally expensive, and (ii) it is difficult to give performance or quality-of-service guarantees based on these techniques (since the predictions can occasionally turn out to be incorrect). To address these shortcomings, in this paper we propose a completely new approach for dynamic voltage and frequency scaling. Our technique is based on an offline bitstream analysis of multimedia files. Based on this analysis, we insert metadata information describing the computational demand that will be generated when decoding the file. Such bitstream analysis and metadata insertion can be done when the multimedia file is being downloaded into a portable device from a desktop computer. In this paper we illustrate this technique using the MPEG-2 decoder application. We show that the amount of metadata that needs to be inserted is a very small fraction of the total size of the video clip and it can lead to significant energy savings. The metadata inserted will typically consist of the frequency value at which the processor needs to be run at different points in time during the decoding process. Lastly, in contrast to runtime prediction-based techniques, our scheme can be used to provide performance and quality-of-service guarantees and at the same time avoids any runtime computation overhead.
Stabilizing Chaos with Predictive Control
Authors: B. T. Polyak
Venue: Automation and Remote Control (2005)

A novel approach to controlling chaos in discrete-time nonlinear autonomous systems is proposed. A desired unstable periodic orbit is stabilized by small control using the predicted trajectory of the system. The exact knowledge of the periodic orbit is not assumed, just its existence is required. The method developed is validated for one-dimensional and multi-dimensional mappings; its efficacy is demonstrated via numerical simulations of the mappings known from the literature, such as logistic, tent, cubic, and Henon maps. The method is simple in implementation, but its application is limited to systems with no exogenous disturbances and uncertainties in the model description. The approach looks highly promising and may have diverse applications.
Uncertain Variables in Decision Problems for Hybrid Uncertain Systems
Authors: Z. Bubnicki
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

The paper is concerned with the application of uncertain variables to complex uncertain systems containing elements with random parameters described by probability distributions and uncertain parameters described by certainty distributions given by an expert. The first part of the paper presents a general approach to decision making in the complex system under consideration. The second part is devoted to a special case: the hybrid system with a cascade structure containing random and uncertain parts. A simple example illustrates the presented approach.
Spherical manifolds for adaptive resolution surface modeling
Authors: Cindy M. Grimm
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present a surface modeling technique that supports adaptive resolution and hierarchical editing for surfaces of spherical topology. The resulting surface is analytic, Ck, and has a continuous local parameterization defined at every point. To manipulate these surfaces we describe a user-interface based on multiple, overlapping subdivision-style meshes.
Intersection Characteristics of End-to-End Internet Paths and Trees
Authors: Sevcan Bilir, Kamil Sarac, Turgay Korkmaz
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

This paper focuses on understanding the scale and the distribution of "state overhead" (briefly load) that is incurred on the routers by various value-added network services, e.g., IP multicast and IP traceback. This understanding is essential to developing appropriate mechanisms and provisioning resources so that the Internet can support such value-added services in an efficient and scalable manner. We mainly consider the number of end-to-end paths or trees intersecting at a router to represent the amount of state overhead at that router. Hence, we analyze the router-level intersection characteristics of end-to-end Internet paths or trees to approximate the state overhead distribution in the Internet. For the reliability of our analysis, a representative, end-to-end router-level Internet map is essential. Although several maps are available, they are at best insufficient for our analysis. Therefore, in the first part of our work, we exert a measurement study to obtain a large size end-to-end router-level map conforming to our constraints. In the second part, we conduct various experiments using our map and shed some light on the scale and distribution of state overhead of value-added Internet services in both unicast and multicast environments.
Fault-Tolerant Wormhole Switching with Backtracking Capability
Authors: Masato Kitakami, Manabu Sueishi
Venue: Proceedings of the 20th IEEE International Symposium on Defect and Fault Tolerance in VLSI Systems (2005)

The message switching method, which controls message transmission in, the parallel computer, is one of the most important factors to improve the performance of the parallel computer. Since parallel computers have high failure rate, mmy fault-tolerant switching methods have been, proposed. The existing methods have problems, however, such, as loto communication, throughput, low fault-tolerant capability, large hardware overhead, and requiring special routing method. This paper proposes fault-tolerant wormhole switching. This switching has backtracking capability by inserting dummy flits after th,e h,eader flit. This can be used with, general fault-tolerant routing which, requires backtracking capability to the switching Computer simulation, shows that in, a 16 by 16 2D torus, for example, the throughput of the proposed method is almost equal to that of existing methods which, require large hardware overhead if the number of the faulty nodes is less then or equal to 64.
Determining the Optimal Number of Clusters Using a New Evolutionary Algorithm
Authors: Wei Lu, Issa Traore
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Estimating the optimal number of clusters for a dataset is one of the most essential issues in cluster analysis. An improper pre-selection for the number of clusters might easily lead to bad clustering outcome. In this paper, we propose a new evolutionary algorithm to address this issue. Specifically, the proposed evolutionary algorithm defines a new entropy-based fitness function, and three new genetic operators for splitting, merging, and removing clusters. Empirical evaluations using the synthetic dataset and an existing benchmark show that the proposed evolutionary algorithm can exactly estimate the optimal number of clusters for a set of data.
Super Parsing: Sentiment Classification with Review Extraction
Authors: Jian Liu, JianXin Yao, Gengfeng Wu
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

This paper describes the sentiment classification with review extraction. Whole process can be illustrated logically as: (1) extract the review expressions on specific subjects and attach sentiment tag and weight to each expression; (2) calculate the sentiment indicator of each tag by accumulating the weights of all the expression with the corresponding tag; (3) given the indicators on different tags, use a classifier to predict the sentiment label of the text. A system Approximate Text Analysis (ATA) is used for review extraction in stage 1. It follows the idea of Super Parsing, which enables non-adjacent constituents to be merged to deduce a new one. To traverse the valid constituent combinations in Super Parsing, an algorithm named Candidate List Algorithm (CLA) is proposed. Then the performance of three kinds of classifiers (a simple linear classifier, SVM and decision tree) in stage 3 is studied. The experiments on on-line documents show that the SVM algorithm achieves the best performance.
Mining software repositories to assist developers and support managers
Authors: Ahmed E. Hassan
Venue:  (2005)

This thesis explores mining the evolutionary history of a software system to support software developers and managers in their endeavors to build and maintain complex software systems. We introduce the idea of evolutionary extractors which are specialized extractors that can recover the history of software projects from software repositories, such as source control systems. The challenges faced in building C-REX, an evolutionary extractor for the C programming language, are discussed. We examine the use of source control systems in industry and the quality of the recovered C-REX data through a survey of several software practitioners. Using the data recovered by C-REX, we develop several approaches and techniques to assist developers and managers in their activities. We propose Source Sticky Notes to assist developers in understanding legacy software systems by attaching historical information to the dependency graph. We present the Development Replay approach to estimate the benefits of adopting new software maintenance tools by reenacting the development history. We propose the Top Ten List which assists managers in allocating testing resources to the subsystems that are most susceptible to have faults. To assist managers in improving the quality of their projects, we present a complexity metric which quantifies the complexity of the changes to the code instead of quantifying the complexity of the source code itself. All presented approaches are validated empirically using data from several large open source systems. The presented work highlights the benefits of transforming software repositories from static record keeping repositories to active repositories used by researchers to gain empirically based understanding of software development, and by software practitioners to predict, plan and understand various aspects of their project.
Arrested decisions: the effects of information latency on high-risk decision-making
Authors: Kenneth Rosson Pence
Venue:  (2005)

This research will evaluate how changes in information latency during computer deployments affect performance of high risk decision makers. High risk decisions and decision-makers, in this case, are police officers deciding whether or not to arrest an individual based on information provided via computer from a distant source. There are three critical research pillars for this research. First, the impact on performance of naturalistic decision-making (NDM) research described for high-risk decision making through the use of a recognition-primed decision (RPD) model (Klein 1998) will be observed. Next, media richness posits richer media has more impact on equivocal tasks. Media of different &ldquo;richness&rdquo; was tested for impacts on decision performance. The recognition primed decision model, portions of media richness, and information thresholds are integrated to provide a model to relate information latency effects on high-risk decision-making. This model was evaluated using three wireless computer deployments by a city-county police department. Using archival data, subjects in this research, 406 mobile police officers, were followed over a six year period to evaluate the impact of varying media richness (from radio verbal access to textural computer queries of varying types) using computers of varying access-information retrieval rates. Outcome measures of arrest warrants served and physical arrests based on probable cause (where a reasonable officer would believe that a person had committed a criminal violation of local, state or federal law), were recorded over all interventions. User performance traits are shown to be a major influencing factor in outcomes and processes changes. Finally, this research shows how individual user performance traits impact high-risk decision performance more than latency but only with high performers in the organization. Information latency is shown to have little impact on low performers. User performance traits may explain the productivity paradox1 with computers. 1Brynjolfsson, E. and L. Hitt (1998). &ldquo;Beyond the Productivity Paradox: Computers are the Catalyst for Bigger Changes.&rdquo; Communications of the ACM 41(8): 49&ndash;55.
SELES: An e-Voting System for Medium Scale Online Elections
Authors: Claudia Garcya-Zamora, Francisco Rodriguez-Henriquez, Daniel Ortiz-Arroyo
Venue: Proceedings of the Sixth Mexican International Conference on Computer Science (2005)

Recent advances in communication networks and cryptographic techniques have made possible to consider online voting systems as a feasible alternative to conventional elections. Until today several protocols for electronic voting have been proposed, unfortunately only a few of them have been implemented in an end-to-end fully functional system. In this paper we present a secure electronic voting system for medium scale on-line elections (SELES). Our system efficiently implements a security communication protocol offering protection against double voting and others frauds while avoiding any private voting channel. SELES accomplishes all the standard properties of conventional voting systems, namely, accuracy, democracy, privacy, verifiability, simplicity, flexibility and double voting detection. Our system has been tested in a distributed and heterogeneous Internet network comprised by workstations, laptops and PDA nodes interacting through wired and wireless connections. Additionally, SELES has been designed to deal with communication failures, thus achieving a certain degree of robustness.
Towards a Collaborative and Combinational Approach to Requirements Elicitation within a Systems Engineering Framework
Authors: Chad Coulin, Abd-El-Kader Sahraoui, Didar Zowghi
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Despite its critical importance to the process of systems development, requirements elicitation continues to be a major problem in both research and practice. This complex activity involving many different facets and issues is often performed badly and subsequently blamed for project failure and poor quality systems. In this paper we present a collaborative and combinational approach to requirements elicitation within a systems engineering framework, proposing the application of current research from other disciplines in areas related to requirements elicitation, such as software engineering and the social sciences, to a general systems engineering context. The work provides both researchers and practitioners with an approach to requirements elicitation for systems engineering that can be applied to real world projects to improve both the process and results, thereby increasing the overall chance of successful system development in terms of on schedule and on budget delivery, and satisfied customers.
Computer Systems and Responsibility: A Normative Look at Technological Complexity
Authors: Deborah G. Johnson, Thomas M. Powers
Venue: Ethics and Information Technology (2005)

In this paper, we focus attention on the role of computer system complexity in ascribing responsibility. We begin by introducing the notion of technological moral action (TMA). TMA is carried out by the combination of a computer system user, a system designer (developers, programmers, and testers), and a computer system (hardware and software). We discuss three sometimes overlapping types of responsibility: causal responsibility, moral responsibility, and role responsibility. Our analysis is informed by the well-known accounts provided by Hart and Hart and Honoré. While these accounts are helpful, they have misled philosophers and others by presupposing that responsibility can be ascribed in all cases of action simply by paying attention to the free and intended actions of human beings. Such accounts neglect the part played by technology in ascriptions of responsibility in cases of moral action with technology. For both moral and role responsibility, we argue that ascriptions of both causal and role responsibility depend on seeing action as complex in the sense described by TMA. We conclude by showing how our analysis enriches moral discourse about responsibility for TMA.