ppxscal/embedding_network huggingface dataset:
Packing k-edge trees in graphs of restricted vertex degrees
Authors: A. K. Kelmans
Venue: Journal of Graph Theory (2007)

Let ${\cal G}^{s}_{r}$ denote the set of graphs with each vertex of degree at least r and at most s, v(G) the number of vertices, and &tau;k (G) the maximum number of disjoint k-edge trees in G. In this paper we show that if G &isin; ${\cal G}^{s}_{2}$ and s &ge; 4, then &tau;2(G) &ge; v(G)&sol;(s + 1), if G &isin; ${\cal G}^{3}_{2}$ and G has no 5-vertex components, then &tau;2(G) &ge; v(G)4, if G &isin; ${\cal G}^{s}_{1}$ and G has no k-vertex component, where k &ge; 2 and s &ge; 3, then &tau;k(G) &ge; (v(G) -k)&sol;(sk - k + 1), and the above bounds are attained for infinitely many connected graphs. Our proofs provide polynomial time algorithms for finding the corresponding packings in a graph. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 306&ndash;324, 2007
hFS: a hybrid file system prototype for improving small file and metadata performance
Authors: Zhihui Zhang, Kanad Ghose
Venue: ACM SIGOPS Operating Systems Review (2007)

Two oft-cited file systems, the Fast File System (FFS) and the Log-Structured File System (LFS), adopt two sharply different update strategies---update-in-place and update-out-of-place. This paper introduces the design and implementation of a hybrid file system called hFS, which combines the strengths of FFS and LFS while avoiding their weaknesses. This is accomplished by distributing file system data into two partitions based on their size and type. In hFS, data blocks of large regular files are stored in a data partition arranged in a FFS-like fashion, while metadata and small files are stored in a separate log partition organized in the spirit of LFS but without incurring any cleaning overhead. This segregation makes it possible to use more appropriate layouts for different data than would otherwise be possible. In particular, hFS has the ability to perform clustered I/O on all kinds of data---including small files, metadata, and large files. We have implemented a prototype of hFS on FreeBSD and have compared its performance against three file systems, including FFS with Soft Updates, a port of NetBSD's LFS, and our lightweight journaling file system called yFS. Results on a number of benchmarks show that hFS has excellent small file and metadata performance. For example, hFS beats FFS with Soft Updates in the range from 53% to 63% in the PostMark benchmark.
Speaker time-drifting adaptation using trajectory mixture hidden Markov models
Authors: Jian Su
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

In this paper, a trajectory mixture hidden Markov model (TMHMM) is proposed to cope with the problems of trajectory variability and speaker time-drifting. A theoretical formulation of TMHMM learning is presented. By introducing two pragmatic adaptation schemes, the practical issues which demonstrate the use of the model in capturing the time-drifting of speaker model for speaker recognition are addressed. To evaluate with the YOHO corpus, a set of phonetic units is defined. The effectiveness of the modeling approach is confirmed by a set of experiments. It is shown that an error rate of 0.07% is obtained for closed-set speaker recognition with a total population of 138 talkers. TMHMM can be considered as a special HMM topology dedicated to the time-drifting adaptation problem.
Hierarchical System-Level Diagnosis Based on a Voting Scheme for Identical-Unit-Interconnection Systems
Authors: Tomoyoshi Fukuta, Hiroshi Masuyama, Toshihiko Sasama
Venue: Proceedings of the Sixth International Conference on Networking (2007)

A hierarchical non-adaptive system-level diagnosis approach is introduced categorized into three types of interconnection systems; array-, hypercube-, and tree-typed systems which consist of a large number of identical units (This type of interconnection system does appear to be more common in modern hardware such as Red Storm Supercomputer or Blue Gene/L system in parallel computers). This diagnostic approach employs a simple voting scheme where the votes are counted locally by a monitor unit in each set and in each hierarchical cluster, and the monitor calculates an answer based on the threshold. The main contribution of this paper is to show the effectiveness of this test architecture under realistic circumstances.
Bandwidth Scheduling and Path Computation Algorithms for Connection-Oriented Networks
Authors: Sartaj Sahni, Nageshwara Rao, Sanjay Ranka, Yan Li, Eun-Sung Jung, Nara Kamath
Venue: Proceedings of the Sixth International Conference on Networking (2007)

There has been an increasing number of network deployments that provide dedicated connections through on-demand and in-advance scheduling in support of high-performance applications. We describe algorithms for scheduling and path computations needed for dedicated bandwidth connections for fixed-slot, highest available bandwidth in a given slot, first available slot, and all-available slots computations. These algorithms for bandwidth scheduling are based on extending the classical breadth-first search, Dijkstra, and Bellman-Ford algorithms. We describe a bandwidth management system for UltraScience Net that incorporates implementations of these algorithms.
One-mode quantum Gaussian channels: Structure and quantum capacity
Authors: A. S. Holevo
Venue: Problems of Information Transmission (2007)

A complete classification of one-mode Gaussian channels is given up to canonical unitary equivalence. We also comment on the quantum capacity of these channels. A channel complementary to the quantum channel with additive classical Gaussian noise is described, providing an example of a one-mode Gaussian channel which is neither degradable nor antidegradable.
Wavelet transform domain RLS algorithm
Authors: S. Hosur
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper describes a new wavelet domain RLS algorithm. The algorithm exploits the special sparse structure of the wavelet transform of wide classes of correlation matrices and that of the Cholesky factors of these matrices. Specifically, the algorithm updates a sparse QR factorization of the wavelet domain input data matrix. It then uses these factors to obtain the least-squares (LS) filter coefficients. The computational complexity of the proposed method is O(M log(M)) flops even when the input signal is not a time-series. Its convergence performance is similar to the traditional RLS algorithm. The new algorithm provides a method for trading error performance for lower computational complexity. Simulation results validate the performance of the algorithm.
Design, Analysis and Implementation of a Novel Multiple Resource Scheduler
Authors: Fariza Sabrina, Salil Kanhere, Sanjay Jha
Venue: IEEE Transactions on Computers (2007)

Over the past decade, the problem of achieving fair bandwidth allocation on a link shared by multiple traffic flows has been extensively researched. However, as these flows traverse a computer network, they share many different kinds of resources such as links, buffers, and router CPU. The ultimate goal should hence be overall fairness in the allocation of multiple resources rather than a single specific resource such as link bandwidth. In this paper, we present a novel scheduler called Prediction-based Composite Fair Queueing (PCFQ), which jointly allocates the fair share of the link bandwidth as well as processing resource to all competing flows. We derive the worst-case delay bound, the work complexity and the relative fairness bound for the PCFQ scheduler and show that it outperforms a system consisting of separate bandwidth and CPU schedulers. We further present simulation results, which illustrate the improved performance characteristics achieved by PCFQ. We also demonstrate that our composite scheduler can be easily implemented on an off-the-shelf network processor such as the Intel IXP 2400. Experimental results from the IXP2400 implementation highlight the effectiveness and high performance of this algorithm in a real world system.
Toward a modified variational iteration method
Authors: Tamer A. Abassy, Magdy A. El-Tawil, H. El Zoheiry
Venue: Journal of Computational and Applied Mathematics (2007)

The variational iteration method (VIM) attracted much attention in the past few years as a promising method for solving nonlinear differential equations. It is shown in this paper that the application of VIM to a special kind of nonlinear differential equations leads to calculation of unneeded terms and more time consumed in repeated calculations for series solutions. A modified VIM is introduced to eliminate the shortcomings; and its effectiveness is illustrated by some examples.
Lightweight languages as software engineering tools
Authors: Diomidis Spinellis, V. Guruprasad
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Software subsystems can often be designed and implemented in a clear, succinct, and aesthetically pleasing way using specialized linguistic formalisms. In cases where such a formalism is incompatible with the principal language of implementation, we have devised specialized lightweight languages. Such cases include the use of repeated program code or data, the specification of complex constants, the support of a complicated development process, the implementation of systems not directly supported by the development environment, multiparadigm programming, the encapsulation of system level design, and other complex programming situations. We describe applications and subsystems that were implemented using this approach in the areas of user interface specification, software development process support, text processing, and language implementation. Finally, we analyze a number of implementation techniques for lightweight languages based on the merciless exploitation of existing language processors and tools, and the careful choice of their syntax and semantics.
BLASTH, a BLAS library for dual SMP computer
Authors: Guignon Thomas
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

This paper presents a multi-threaded BLAS library for dual SMP Intel computer running Linux. We present simple techniques to obtain parallelism for BLAS call transparently from the client program. We discuss some synchronization methods available under Linux, show performances results for a representative set of BLAS and for a high level linear algebra kernel. We then explain some key points on cache management and how they can impact on performances of the blasth library. Next we'll draw some conclusions on the use of SMP computer for linear algebra and present evolution perspectives for the library.
Message-driven relaxed consistency in a software distributed shared memory
Authors: Povl T. Koch, Robert J. Fowler, Eric Jul
Venue: Proceedings of the 1st USENIX conference on Operating Systems Design and Implementation (1994)

Message-passing and distributed shared memory have their respective advantages and disadvantages in distributed parallel programming. We approach the problem of integrating both mechanisms into a single system by proposing a new message-driven coherency mechanism. Messages carrying explicit causality annotations are exchanged to trigger memory coherency actions. By adding annotations to standard message-based protocols, it is easy to construct efficient implementations of common synchronization and communication mechanisms. Because these are user-level messages, the set of available primitives is extended easily with language-or application-specific mechanisms. CarlOS, an experimental prototype for evaluating this approach, is derived from the lazy release consistent memory of TreadMarks. We describe the message-driven coherency memory model used in CarlOS, and we examine the performance of several applications.
Anatomically Guided Registration for Multimodal Images
Authors: Manasi Datar, Girish Gopalakrishnan, Sohan Ranjan, Rakesh Mullick
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

With an increase in full-body scans and longitudinal acquisitions to track disease progression, it becomes significant to find correspondence between multiple images. One example would be the monitoring size/location of tumors using PET images during chemotherapy to determine treatment progression. While there is a need to go beyond a single parametric transform to recover misalignments, pure deformable solutions become complex, time-consuming and unnecessary at times. Simple anatomically guided approach for whole body image registration offers enhanced alignment of large coverage inter-scan studies. In this experiment, we provide anatomy specific transformations to capture their independent motions. This solution is characterized by an automatic segmentation of regions in the image, followed by a custom registration and volume stitching. We have tested this algorithm on phantom images as well as clinical longitudinal datasets. We were successful in proving that decoupling transformations improves the overall registration quality.
Leadership, teamwork, and ethics in the development of IT professionals
Authors: C. Dianne Martin
Venue: ACM SIGCSE Bulletin (2007)

Increasingly universities are placing student leadership as a central goal for education. Many seminal texts on leadership focus attention on the moral and transformative qualities of leadership, encouraging universities to become a site for leadership development. One way to operationalize this is for leadership development to become an integral part of the learning outcomes of the curricula within the student's major. In the context of the IT majors, such as computer science, information science, and information technology, the definition of leadership can be incorporated with the desired outcomes of teamwork and professionalism. Thus, the development of leadership capacity is combined with the development of high standards of professionalism and the ability to work well on teams in a variety of roles.
An Analysis on the Schemes for Detecting and Preventing ARP Cache Poisoning Attacks
Authors: Cristina L. Abad, Rafael I. Bonilla
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The Address Resolution Protocol (ARP) is used by computers to map network addresses (IP) to physical addresses (MAC). The protocol has proved to work well under regular circumstances, but it was not designed to cope with malicious hosts. By performing ARP cache poisoning or ARP spoofing attacks, an intruder can impersonate another host (man-in-the-middle attack) and gain access to sensitive information. Several schemes to mitigate, detect and prevent these attacks have been proposed, but each has its limitations. In this paper we analyze each of these schemes, identify their strengths and weaknesses, and propose guidelines for the design of an alternative and (arguably) better solution to the problem of ARP cache poisoning.
An Empirical Research on Factors Affecting Continued Intention to Use Mobile Internet Services in Korea
Authors: Yong-Eun Hwang, Hyun-Ju Suh, Hyun-Suk Suh
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The purpose of this study is to find factors that affect the continued intention to use mobile Internet services. Based upon a literature review conducted on the acceptance of mobile information technology, a research model was created; "individual perception factors such as usefulness, enjoyment, values and anxiety, and social influence factors such as subjective norms and voluntariness determine the intention to use the mobile Internet services on a continuous basis,' and verified using an empirical method. The test result has revealed that usefulness and enjoyment in the individual perception category, and subjective norms and voluntariness in the social influence category affect the continued intention to use mobile Internet services.
Neuro Fuzzy Classification and Detection Technique for Bioinformatics Problems
Authors: Mohd Fauzi bin Othman, Thomas Moh Shan Yau
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Bioinformatics is an emerging science and technology which has lots of research potential in the future. It involves multi interdisciplinary approaches such as mathematics, physics, computer science and engineering, biology, and behavioral science. Computers are used to gather, store, analyze as well as integration of patterns and biological data information which can then be applied to discover new useful diagnosis or information. In this study, the focus will be directed to the classification or clustering techniques which can be applied in the bioinformatics fields based on the Sugeno type neuro fuzzy model or ANFIS (Adaptive Neuro Fuzzy Inference System). It is very important to identify new integration of classification or clustering algorithm especially in neuro fuzzy domain as compared to conventional or traditional method. This paper explores the suitability and performance of recurrent classification technique, Fuzzy C Means (FCM) act as classifier in neuro fuzzy system compared to subclustering method. A package of software based on neuro fuzzy model (ANFIS) has been developed using MATLAB software and optimization were done with the help from WEKA. A set diabetes data based on real diagnosis of patient will be used.
Fast positive-real balanced truncation of symmetric systems using cross Riccati equations
Authors: Ngai Wong
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

We present a computationally efficient implementation of positive-real balanced truncation (PRBT) for symmetric multiple-input multiple-output (MIMO) systems. The solution of a pair of algebraic Riccati equations (AREs) in conventional PRBT, whose complexity limits practical large-scale realization, is replaced with the solution of one cross Riccati equation (XRE). The cross-Riccatian solution then permits simple construction of projection matrices without actually balancing the system. The method encompasses passive linear networks, as commonly used in interconnect and package modelings, due to their inherent reciprocity and therefore symmetric transfer functions. Effectiveness of the proposed approach is verified by numerical examples.
Cognitive computation: the Ersatz Brain project
Authors: J. A. Anderson
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

The following discusses the Ersatz Brain project, a brain-like computing system, of Brown University. It tackles, in general, the proposed hardware and hardware parameters, the software application strategy and potential software applications suitable for its architecture, its technological vision, and the potential result of the project.
Red-Eye Blink, Bendy Shuffle, and the Yuck Factor: A User Experience of Biometric Airport Systems
Authors: M. Angela Sasse
Venue: IEEE Security and Privacy (2007)

The author examines user interaction with biometric systems at airports, and emphasizes usability's importance in successfully operating biometric systems.
Design of a speech recognition system based on acoustically derived segmental units
Authors: M. Bacchiani, M. Ostendorf, Y. Sagisaka, K. Paliwal
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The design of a speech recognition system based on acoustically-derived, segmental units can be divided in three steps: unit design, lexicon building and pronunciation modeling. We formulate an iterative unit design procedure which consistently uses a maximum likelihood (ML) objective in successive application of resegmentation and model re-estimation. The lexicon building allows multi-word entries in the lexicon but restricts the number of these entries in order to avoid a too costly search. Selected multi-word lexical entries are those with high frequency (such as function words) and those which consistently exhibit cross-word phone assimilation. The stochastic pronunciation model represents the likelihood of a particular acoustic segment sequence given the phonetic baseform of a lexical item, where the sequence of baseform phones are treated as a Markov state sequence and each state can emit multiple segments.
VarietyCash: a multi-purpose electronic payment system
Authors: M. Bellare, J. Garay, C. Jutla, M. Yung
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

VarietyCash is a new electronic money system which strikes a balance between functionality, security, and user privacy. The system can encompass both network and stored-value card based payment mechanisms, with transferability between them, hence the name.
Surface Interrogation Methods for Haptic Rendering of Virtual Objects
Authors: Anusha Sridaran, Dianne Hansford, Kanav Kahol, Sethuraman Panchanathan
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The process which enables virtual objects to mimic their real world counterparts is known as realistic rendering in haptics. Realistic sensations could relate to any spatial feature like shape or texture. We have proposed a system here that aims at utilizing the shape information of a surface effectively to aid in object recognition through a haptic interface. This paper describes some surface interrogation techniques namely isophotes, contours and Gaussian curvature to assist in haptic rendering by drawing the user's attention to certain features on a surface that cannot be perceived by realistic means. The effectiveness of these tools, based on their behavior in an external environment, has also been compared. The main goal of this paper is to demonstrate that perception of virtual surfaces can be enhanced by providing haptic feedbacks parameterized according to geometric features identified by surface interrogation.
Implementing a high accuracy speaker-independent continuous speech recognizer on a fixed-point DSP
Authors: Yifan Gong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

Continuous speech recognition is a resource-intensive algorithm. Commercial dictation software requires more than 10 Mbytes to install on the disk and 32 Mbytes RAM to run the application. A typical embedded system can not afford this much RAM because of its high cost and power consumption; it also lacks disk to store the large amount of static data (e.g. acoustic models). We have been working on optimization of a small vocabulary speech recognizer suitable for implementation on a 16-bit fixed-point DSP. This recognizer supports sophisticated continuous density, tied-mixtures Gaussians, parallel model combination, and a noise-robust utterance detection algorithm. The fixed-point version achieves the same performance as the floating-point version. The algorithm runs real-time on a 100 MHz, 16-bit, fixed-point Texas Instruments TMS320C5410 even for the most challenging continuous digit dialing with hands-free microphone in driving conditions.