ppxscal/embedding_network huggingface dataset:
Auditory-based algorithms for sound segregation in multisource and reverberant environments
Authors: Deliang Wang
Venue:  (2005)

At a cocktail party, we can selectively attend to a single voice and filter out all the other acoustical interferences. This perceptual ability has motivated the emergence of a new field of study known as computational auditory scene analysis (CASA) which aims to build speech separation systems that incorporate principles of auditory organization. This dissertation investigates four aspects of CASA processing: location-based speech segregation in multisource environments, binaural tracking of multiple moving sources, binaural sound segregation in reverberant environments, and monaural segregation of reverberant speech. The principal cues used by the auditory system to determine locations are the interaural time difference (ITD) and interaural intensity difference (IID) between the two ears. We observe that within a narrow frequency band, modifications to the relative strength of the target source with respect to the interference trigger systematic changes for ITD and IID. Moreover, for a fixed spatial configuration, this interaction produces a characteristic clustering in the binaural feature space. Consequently, we propose a supervised learning approach to estimate the ideal binary mask using the estimated binaural features. A systematic evaluation in terms of signal-to-noise ratio (SNR) as well as automatic speech recognition (ASR) scores shows that the resulting system produces masks very close to the ideal binary ones in anechoic conditions. Furthermore, the model produces large speech intelligibility improvements with normal listeners. While the above binaural systems perform optimally in anechoic conditions, reverberation affects the ITD and IID cues and therefore degrades their performance. For reverberant conditions, we propose a binaural segregation system that combines target cancellation through adaptive filtering and a binary decision rule to estimate the ideal binary mask. Specifically, we observe a correlation between the attenuation produced by the target cancellation stage and the relative strength between target and interference which is used subsequently to determine the target dominant T-F units. A major advantage of the proposed system is that, while requiring a fixed target location, it imposes no restrictions on the number, location or content of the interfering sources. An extensive comparison using SNR as well as ASR results shows that our system outperforms standard two-microphone beamforming approaches. (Abstract shortened by UMI.)
MuON: Epidemic Based Mutual Anonymity
Authors: Neelesh Bansod, Ashish Malgi, Byung Kyu Choi, Jean Mayo
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

A mutually anonymous service hides the identity of a client from the service provider and vice-versa. Providing mutual anonymity usually requires a large number of participants. While peer-to-peer (P2P) networks are capable of recruiting a large number of participants, reliable anonymous communication in these architectures, with low bandwidth usage, still needs further investigation. This paper presents MuON, a protocol to achieve mutual anonymity in unstructured P2P networks. MuON leverages epidemic-style data dissemination to deal with the high churn (changes in system membership) characteristic of unstructured P2P networks. The results from our security analysis and simulation show that MuON provides mutual anonymity over unstructured P2P networks while maintaining predictable latencies, high reliability, and low communication overhead.
Optimized pre-copy calibration of hard drives
Authors: David M. Nicol
Venue: ACM SIGMETRICS Performance Evaluation Review (2005)

In certain contexts a small window of time exists during which law enforcement has access to a hard-drive suspected of containing important information. Given legal authority to copy or seize this disk, a decision must be made whether to use that access time to make a copy of the disk (which may take more than an hour, depending on the size of the disk) and leave its owner unaware that it has been copied. The copying operation uses especially fast drivers that bypass normal error correction mechanisms. Therefore, for the copy to be successful it is necessary that the disk onto which the copy is placed yield exactly the same bits on subsequent reads as would the original disk. To gain confidence that the copy will be successful the copying software typically chooses some sectors at random, copies them, and determines whether their copies are identical to the original. We address the problem of quantifying the conditional probability that the disk will copy correctly given that some samples have copied correctly, as a function of the, number and placement of those samples. Our framework allows us then to choose the placement of those samples in such a way that this conditional probability is maximized.
Report on the first IEEE international workshop on networking meets databases (NetDB'05)
Authors: Cyrus Shahabi, Ramesh Govindan, Karl Aberer
Venue: ACM SIGMOD Record (2005)

In this report, to the best of our ability, we try to summarize the presentations and discussions occurred within the First IEEE International Workshop on Networking Meets Databases (NetDB) which was held in Tokyo Japan on April 8th and 9th, 2005. NetDB was one of the many (11 to be exact) satellite workshops of the IEEE ICDE (International Conference on Data Engineering) 2005 conference. This workshop is part of the very few initiatives in bringing the networking and database communities together. The focus research areas of NetDB 2005 were sensor and peer-to-peer networks.
A secured hierarchical trust management framework for public computing utilities
Authors: Arindam Mitra, Ranganath Udupa, Muthucumaru Maheswaran
Venue: Proceedings of the 2005 conference of the Centre for Advanced Studies on Collaborative research (2005)

This paper presents a hierarchical (two-layered) trust management framework for very large scale distributed computing utilities where public resources provide majority of the resource capacity. The dynamic nature of these utility networks introduce challenging management and security issues due to behavior turnabout, maliciousness and diverse policy enforcement. The trust management approach offers interesting answers to such issues. In our framework, the lower layer computes local reputation for peers within their domain based on individual contribution, while the upper layer combines the local reputation with that of its domain's (as perceived by other domains) to compute the peer's global trust. Simulation results show that the hierarchical scheme is more scalable, highly robust in hostile conditions and capable of creating rapid trust estimates. Features of the framework include: (a) ability to carry forward local behavior trends, (b) autonomous domain-based policing, (c) high cohesiveness with the resource management system, and (d) securely exposing the trust evaluation operations to peers (i.e., the subjects of the evaluation process). A detailed analysis of the threats/attacks that the framework could be subjected is presented along with countermeasures against the attacks.
UMHexagonS Algorithm Based Motion Estimation Architecture for H.264/AVC
Authors: Choudhury A. Rahman, Wael Badawy
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper presents an integer pel variable block motion estimation architecture based on JVT accepted UMHexagonS algorithm for H.264/MPEG-4 Part 10 (AVC) encoder. The proposed pipelined architecture is capable of calculating the required 41 motion vectors of various size blocks supported by H.264/AVC within a 16x16 block in parallel. The architecture can be used for rapid prototyping of motion estimation core using FPGA. The performance analysis shows that the architecture is capable of processing CIF frame sequences in real time considering 5 reference frames within the search range of ±16 at a clock speed of around 30 MHz.
Securing distributed storage: challenges, techniques, and systems
Authors: Vishal Kher, Yongdae Kim
Venue: Proceedings of the 2005 ACM workshop on Storage security and survivability (2005)

The rapid increase of sensitive data and the growing number of government regulations that require longterm data retention and protection have forced enterprises to pay serious attention to storage security. In this paper, we discuss important security issues related to storage and present a comprehensive survey of the security services provided by the existing storage systems. We cover a broad range of the storage security literature, present a critical review of the existing solutions, compare them, and highlight potential research issues.
Spatio-Temporal Relevant Logic as the Logical Basis for Spatio-Temporal Information Systems
Authors: Jingde Cheng
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

To specify, verib, and reason about spatio-temporal knowledge, we need a right findantental logic system to provide us with a criterion of logical validity for reasoning as well as a formal representation and specificution language. In order to reason out new spatio-temporal knowledge with incomplete or sometime even inconsistent knowledge, the fundamental logic must be able to underlie truth-preserving and relevant reasoning in the sense of conditional, ampliative reasoning, paracomplete reasoning, paraconsistent reasoning, spatial reasoning, and temporal reasoning. This paper proposes a new family of relevant logic, named "spatio-teriporal relevant logic," and shows that it is a hopeful candidate for the fundamental logic to underlie specifying, vzribing, and reasoning about spatio-temporal knowledge.
On Stability Cones for Quadratic Systems of Differential Equations
Authors: V. Ye. Belozyorov
Venue: Journal of Dynamical and Control Systems (2005)

New sufficient conditions of conditional stability of the trivial solution of a system of quadratic ordinary differential equations are obtained. For the homogeneous system the domain of unlocal stability is also found (it is a cone). This domain is then used for design of piecewise linear (discontinuous) control laws on output for a bilinear control system of any order. Thus, a system closed by such discontinuous feedback becomes globally stable in the Lyapunov sense on the whole state space. Examples are given.
Report on the DB/IR panel at SIGMOD 2005
Authors: Sihem Amer-Yahia, Pat Case, Thomas Rölleke, Jayavel Shanmugasundaram, Gerhard Weikum
Venue: ACM SIGMOD Record (2005)

This paper summarizes the salient aspects of the SIGMOD 2005 panel on "Databases and Information Retrieval: Rethinking the Great Divide". The goal of the panel was to discuss whether we should rethink data management systems architectures to truly merge Database (DB) and Information Retrieval (IR) technologies. The panel had very high attendance and generated lively discussions.
Artificial Neural Network Based Automatic Cardiac Abnormalities Classification
Authors: S. Issac Niwas, R. Shantha Selva Kumari, V. Sadasivam
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Automatic Detection and classification of Cardiac Arrhythmias from a limited number of ECG signals is of considerable importance in critical care or operating room patient monitoring. We propose a method to accurately classify the heartbeat of ECG signals through the Artificial Neural Networks (ANN). Feature sets are based on Heartbeat intervals, RR intervals and Spectral entropy of the ECG signal. The ability of properly trained artificial neural networks to correctly classify and recognize patterns makes them particularly suitable for use in an expert system that aids in the interpretation of ECG signals. In the present work the ECG data is taken from standard MIT-BIH Arrhythmia database. The proposed method is capable of distinguishing the normal beat and 9 different arrhythmias. The overall accuracy of classification of the proposed approach is 99.02%. The results of the analysis are found to be more accurate than the other existing methods. Detection and classification of cardiac signals is important for diagnosis of cardiac abnormalities and hence any automated processing of the ECG that assists this process would be of assistance and is the focus of this paper.
Rebuilding the human firewall
Authors: Michael E. Whitman, Philippa Fendler, John Caylor, Danny Baker
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

In 2000, a consortium of industry, government and academic representatives formed the Human Firewall Council, established on the premise that information security is a people problem, a managerial problem that does have some technical solutions. In 2004 the HFO changed hands, from the original commercial sponsoring organization to the ISSA. With this change came a need to revise and update the organization's Web site, and the Security Management Index, an online survey that allowed respondents to benchmark their organizations with their peers, based on the ISO 17799 standard. This paper overviews the efforts of a faculty and student development team in rebuilding the Human Firewall.
Cross-Layer Scheduler Design with QoS Support forWireless Access Networks
Authors: Qingwen Liu, Xin Wang, Georgios B. Giannakis
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

Scheduling plays an important role in providing quality of service (QoS) support for multimedia networks. We propose a cross-layer scheduler at the medium access control (MAC) layer for multiple connections with diverse QoS requirements, where each connection employs adaptive modulation and coding (AMC) scheme at the physical (PHY) layer. Each connection is assigned a priority, which is updated dynamically based on its channel and service quality; and the connection with the highest priority is scheduled each time. Our scheduler provides diverse QoS guarantees, uses the wireless bandwidth efficiently and enjoys flexibility, scalability and low implementation complexity. The performance of our scheduler is evaluated via simulations in the IEEE 802.16 standard setting.
Regularity of the Free Boundary in an Optimization Problem Related to the Best Sobolev Trace Constant
Authors: Julián Fernández Bonder, Julio D. Rossi, Noemi Wolanski
Venue: SIAM Journal on Control and Optimization (2005)

In this paper we study the regularity properties of a free boundary problem arising in the optimization of the best Sobolev trace constant in the immersion $H^1(\Omega)\hookrightarrow L^q(\partial\Omega)$ for functions that vanish in a subset of $\Omega$. This problem is also related to a minimization problem for Steklov eigenvalues.
Projective slice for a dynamic steering task
Authors: Pierre Salom, Javier Becerra, Marc Donias, Rémi Megret
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Volume visualization using 2-D slices is a technique exploited in several scientific fields such as medicine, geology or any other industrial application using 3D data. The expert has the possibility to explore the data by displaying a set of slices extracted from the volume. The objective is to detect some specific three-dimensional structure and point it in 2-D, directly on slices with a device. This type of interaction realized during the animation of slices is named dynamic pointing. To formalize this task we define in this article a new paradigm: the dynamic steering task (DST). We first relate it with the other tasks studied in Human-Computer Interaction. This study helps us to better understand the reason of the difficulty of this task and why users produce so many positioning errors. We formulate the hypothesis that the errors generated in a DST are coming from the impossibility for the experts to anticipate the structural variations of the structures to be pointed. In order to solve this problem we propose a new technique of visualization, which facilitates anticipation, called the projective slice. The effectiveness of this tool and the veracity of our assertions are determined experimentally.
An approach to the collection, representation and simulation of program execution behavior
Authors: Robert S. Feingold
Venue: ACM SIGSIM Simulation Digest (1973)

Most computer system modeling efforts must address two important implementation questions: first, how will hardware resource characteristics be modeled and second, how will program resource demand characteristics be represented. The first question, although extremely interesting, is deferred for another time. This paper describes a technique developed to partially answer the second question.
Efficient full-chip thermal modeling and analysis
Authors: Peng Li, L. T. Pileggi, M. Asheghi, R. Chandra
Venue: Proceedings of the 2004 IEEE/ACM International conference on Computer-aided design (2004)

The ever-increasing power consumption and packaging density of integrated systems creates on-chip temperatures and gradients that can have a substantial impact on performance and reliability. While it is conceptually understood that a thermal equivalent circuit can be constructed to characterize the temperature gradients across the chip, direct and iterative solutions of the corresponding 3D equations are often intractable for a full-chip analysis. Multigrid accelerated iterative methods can be applied to solve the equivalent circuit problem that is provably symmetric positive definite; however, explicitly building the matrix problem is intractable for most full-chip problems. In This work we present a multigrid iterative approach for the full-chip thermal analysis which does not require explicit construction of the equivalent circuit matrix. We propose specific multigrid treatments to cope with the strong anisotropy of the full-chip thermal problem that is created by the vast difference in material thermal properties and chip geometries. Importantly, we demonstrate that only with careful thermal modeling assumptions and appropriate choices for grid hierarchy, multigrid operators and smoothing steps across grid points, can we accurately and efficiently analyze a full-chip thermal problem. Experimental results demonstrate the efficacy of the proposed multigrid methodology. Our prototyped thermal simulator is able to solve a steady-state problem with more than 10 million unknowns in 125 CPU seconds with a peak memory usage of 231 mega bytes.
Random generation models for NFA'S
Authors: Jean-Marc Champarnaud, Georges Hansel, Thomas Paranthoën, Djelloul Ziadi
Venue: Journal of Automata, Languages and Combinatorics (2004)

The aim of this study is the random generation of non-deterministic automata. We focus our attention on the random generation processed with bitstreams for which we present a probabilistic analysis. Let m be the size of the alphabet. We show that the DFAs obtained by subset construction from n-state NFAs based on equiprobable bitstreams have a probability of being of size m + 2 that tends to 1 when n tends to infinity. This property gives an asymptotical explanation to van Zijl's experimental results concerning the succinctness of NFAs. We also determine the probability that a state is reachable from an equiprobably chosen DFA state. We show that the distribution of the subsets that appear during the subset construction is an equiprobable one in the case of bitstreams generated with the probability 2 - 2n-1/n. This result is related to the conjecture of Leslie, Raymond and Wood, which says that the number of states of the DFA is maximum when the density of the NFA is approximately equal to 2/n. Finally we extend this probabilistic study to the case of *-NFAs defined by van Zijl.
Level of detail based occlusion culling for dynamic scenes
Authors: Anselm Grundhöfer, Benjamin Brombach, Robert Scheibe, Bernd Fröhlich
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

This paper presents a non-conservative occlusion culling technique for dynamic scenes with animated or user-manipulated objects. We use a multi-pass algorithm, which decides the visibility based on low level of detail representations of the geometric models. Our approach makes efficient use of hardware support for occlusion queries and avoids stalling the graphics pipeline. We have tested our approach for large real-world models from different areas. Our results show that the algorithm performs well for medium complex scenes with 5 to 20 million triangles, with a very low number of hardly noticeable pixel errors, typically in the range of 0.02 percent of the total number of visible pixels.
Evolutionary algorithms for dynamic optimization problems: workshop preface
Authors: Shengxiang Yang, Jürgen Branke
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

Evolutionary algorithms (EAs) have been widely applied to solve stationary optimization problems. However, many real-world optimization problems are actually dynamic. For example, new jobs are to be added to the schedule, the quality of the raw material may be changing, and new orders have to be included into the vehicle routing problem etc. In such cases, when the problem changes over the course of the optimization, the purpose of the optimization algorithm changes from finding an optimal solution to being able to continuously track the movement of the optimum over time. This seriously challenges traditional EAs since they cannot adapt well to the changing environment once converged.
Multimodal affect recognition in learning environments
Authors: Ashish Kapoor, Rosalind W. Picard
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

We propose a multi-sensor affect recognition system and evaluate it on the challenging task of classifying interest (or disinterest) in children trying to solve an educational puzzle on the computer. The multimodal sensory information from facial expressions and postural shifts of the learner is combined with information about the learner's activity on the computer. We propose a unified approach, based on a mixture of Gaussian Processes, for achieving sensor fusion under the problematic conditions of missing channels and noisy labels. This approach generates separate class labels corresponding to each individual modality. The final classification is based upon a hidden random variable, which probabilistically combines the sensors. The multimodal Gaussian Process approach achieves accuracy of over 86%, significantly outperforming classification using the individual modalities, and several other combination schemes.
Symmetry and other transformation features of Lorenz/Leimkuhler representations of informetric data
Authors: Quentin L. Burrell
Venue: Information Processing and Management: an International Journal (2005)

In this paper we develop in particular the use of Lorenz/Leimkuhler concentration curves in an informetric context. Many of the features to be presented are akin to, or are adaptations of, ones that have featured in the econometric literature but not in informetrics. We acknowledge in particular our debt to Lambert [Lambert, P. J. (2001). The distribution and redistribution of income. Manchester: Manchester University Press] and Kleiber and Kotz [Kleiber, C., & Kotz, S. (2003). Statistical size distributions in economics and actuarial sciences. New Jersey: Wiley] for source material in the econometrics literature. Although the development is purely theoretical, the aim is to provide additional and more incisive analytic tools for the practising informetrician.