ppxscal/embedding_network huggingface dataset:
Patrons
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

IEEE 802.11 wireless LAN technology is mainly used as an access network within corporate enterprises. All the WLAN access points are eventually connected to a wired backbone to reach the Internet or enterprise computing resources. We aim to expand WLAN into an enterprise-scale backbone network technology by developing a multichannel wireless mesh network architecture called Hyacinth. Hyacinth equips each node with multiple IEEE 802.11a/b NICs and supports distributed channel assignment/routing to increase the overall network throughput. We present the results of a detailed performance evaluation study on the multichannel mesh networking aspect of Hyacinth, based on both NS-2 simulations and empirical measurements collected from a 9-node Hyacinth prototype testbed. A key result of this study is that equipping each node of a Hyacinth network with just 3 NICs can increase the total network bandwidth by a factor of 6 to 7, as compared with single-channel wireless mesh network architecture. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Automated intrusion detection using NFR: methods and experiences
Authors: Wenke Lee, Christopher T. Park, Salvatore J. Stolfo
Venue: Proceedings of the 1st conference on Workshop on Intrusion Detection and Network Monitoring - Volume 1 (1999)

There is often the need to update an installed Intrusion Detection System (IDS) due to new attack methods or upgraded computing environments. Since many current IDSs are constructed by manual encoding of expert security knowledge, changes to IDSs are expensive and require a large amount of programming and debugging. We describe a data mining framework for adaptively building Intrusion Detection (ID) models specifically for use with Network Flight Recorder (NFR). The central idea is to utilize auditing programs to extract an extensive set of features that describe each network connection or host session, and apply data mining programs to learn rules that accurately capture the behavior of intrusions and normal activities. These rules can be used for misuse detection and anomaly detection. Detection models are then incorporated into NFR through a machine translator, which produces a working detection model in the form of N-Code, NFR's powerful filtering language.
Contention-Free 2D-Mesh Cluster Allocation in Hypercubes
Authors: Stephen W. Turner, Lionel M. Ni, Betty H. C. Cheng
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Tkaditionally, each job in a hypercube multiprocessor is allocated with a subcube so that communication interference among jobs may be avoided. Although the hypercube is a powerful processor topology, the 2D mesh is a more popular application topology. This paper predents a 2Dmesh cluster allocation strategy for hypercubes. The proposed auxiliary free list procwor allocation strategy can efficiently allocate 2D-mesh clusters without size constraints, can reduce average job turnaround time compared with that based on subcubc allocation strategies, and can guarantee no communication interference among allocated clusters when the underlying hypercube implements deadlockfree Ecube routing. The proposed auxiIiary free list strategy can be easily implemented on hypercube multicomputers to increage processor utilization.
Taylor-Widder representation formulae and Ostrowski, Grüss, integral means and Csiszar type inequalities
Authors: George A. Anastassiou
Venue: Computers Mathematics with Applications (2007)

Based on the very general Taylor-Widder formula, several representation formulae are developed. By applying these are developed very general inequalities of types: Ostrowski, Gruss, comparison of means, Csiszar f-divergence. The estimates involve L"p norms, any 1@?p@?~.
Progress in Broadcast News transcription at Dragon Systems
Authors: S. Wegmann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We report on progress in acoustic modelling and preprocessing in our Broadcast News transcription system. We have gone back to basics in acoustic modelling, and re-examined some of our standard practices, in particular the use of IMELDA and frequency warping, in the context of the Broadcast News corpus. We also report on some preliminary experiments with a generalization of IMELDA, "semi-tied covariances". In combination, these improvements lead to a 3.5% absolute improvement over our eval97 models. We also describe our attempts to fix our rather primitive, silence-based preprocessing system, including initial results using a new speaker-change detection algorithm based on Hotelling's T/sup 2/-test.
Coreference handling in XMG
Authors: Claire Gardent, Yannick Parmentier
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

We claim that existing specification languages for tree based grammars fail to adequately support identifier managment. We then show that XMG (eXtensible Meta-Grammar) provides a sophisticated treatment of identifiers which is effective in supporting a linguist-friendly grammar design.
Priority-driven Coding and Transmission of Progressive JPEG Images for Real-Time Applications
Authors: Albert Mo Cheng, Feng Shang
Venue: Journal of VLSI Signal Processing Systems (2007)

Since high-quality image/video systems based on the JPEG/MPEG compression standards often require power-expensive implementations at relatively high bit-rates, they have not been widely used in low-power wireless applications. To alleviate this problem, we designed, implemented, and evaluated a strategy that can adapt to different compression and transmission rates. (1) It gives important parts of an image higher priority over unimportant parts. Therefore, the high-priority parts can achieve high image quality, while the low-priority parts, with a slight sacrifice of quality, can achieve huge compression rate and thus save the power/energy of a low-power wireless system. (2) We also introduce a priority-driven scheduling approach into our coding algorithm, which makes the transmission of important parts earlier with more data than other parts. Through a balanced trade-off between the available time/bandwidth/power and the image quality, this adaptive strategy can satisfy users with desired images quality and lead to a significant reduction of the important parts' deadline misses.
Statistical blockade: a novel method for very fast Monte Carlo simulation of rare circuit events, and its application
Authors: Amith Singhee, Rob A. Rutenbar
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Circuit reliability under statistical process variation is an area of growing concern. For highly replicated circuits such as SRAMs and flip flops, a rare statistical event for one circuit may induce a not-so-rare system failure. Existing techniques perform poorly when tasked to generate both efficient sampling and sound statistics for these rare events. Statistical Blockade is a novel Monte Carlo technique that allows us to efficiently filter---to block---unwanted samples insufficiently rare in the tail distributions we seek. The method synthesizes ideas from data mining and Extreme Value Theory, and shows speed-ups of 10X-100X over standard Monte Carlo.
Determination of a canonical lattice structure for odd length linear-phase PR filter banks
Authors: D. Pinchon
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The problem of designing two-channel perfect reconstruction filter banks with odd length FIR linear phase analysis and synthesis filters is revisited. Based on an algebraic approach we introduce a complete and canonical lattice structure. Design examples show that, for short length filters, multiplierless realizations providing an acceptable frequency behaviour were attainable.
Graph branch algorithm: an optimum tree search method for scored dependency graph with arc co-occurrence constraints
Authors: Hideki Hirakawa
Venue: Proceedings of the COLING/ACL on Main conference poster sessions (2006)

Various kinds of scored dependency graphs are proposed as packed shared data structures in combination with optimum dependency tree search algorithms. This paper classifies the scored dependency graphs and discusses the specific features of the "Dependency Forest" (DF) which is the packed shared data structure adopted in the "Preference Dependency Grammar" (PDG), and proposes the "Graph Branch Algorithm" for computing the optimum dependency tree from a DF. This paper also reports the experiment showing the computational amount and behavior of the graph branch algorithm.
Privacy Preserving Vehicle Purchase Marketplace
Authors: Satish K. Sehgal, Atul Saroop
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

The car customer in the U.S. market has come to ex- pect many incentives during her purchase process. Many of these incentives are based on the private profile infor- mation of the customer, which she would not want to dis- close to the set of all possible dealers. On the other hand, the dealers want to keep the exact information on various incentives on offer private as well due to various business reasons. In this paper, we present design of a privacy pre- serving marketplace that executes control on information disclosure while enabling the purchasing process. Market- place designs pertaining to both single dealer and multiple dealer participation are dealt with.
MonetDB/SQL Meets SkyServer: the Challenges of a Scientific Database
Authors: M. Ivanova, N. Nes, R. Goncalves, M. Kersten
Venue: Proceedings of the 19th International Conference on Scientific and Statistical Database Management (2007)

This paper presents our experiences in porting the Sloan Digital Sky Survey(SDSS)/ SkyServer to the state-of- the-art open source database system MonetDB/SQL. SDSS acts as a well-documented benchmark for scientific database management. We have achieved a fully functional prototype for the personal SkyServer, to be downloaded from our site. The lessons learned are 1) the column store approach of MonetDB demonstrates a great potential in the world of scientific databases. However, the application also challenged the functionality of our implementation and revealed that a fully operational SQL environment is needed, e.g. including persistent stored modules; 2) the initial performance is competitive to the reference platform, MS SQL Server 2005, and 3) the analysis of SDSS query traces hints at several techniques to boost performance by utilizing repetitive behavior and zoom-in/zoom-out access patterns, that are currently not captured by the system.
Font subsetting and downloading in the postscript printer driver of Qt/X11
Authors: Sivan Toledo, Lars Knoll
Venue: Proceedings of the 5th annual Linux Showcase & Conference - Volume 5 (2001)

This paper describes the font discovery, subset-ting, and downloading mechanism in Qt/X11. The mechanism addresses a major usability issue: prior to the implementation of this mechanism, users of Qt applications (and hence users of KDE) could not print non-Latin text, and could only print Latin text in fonts that are built into most printers. The new mechanism allows users to print text in any script that Qt/X11 supports, which includes western scripts (primarily Latin, Cyrillic, and Greek), Arabic, Hebrew, and east-Asian scripts. The new mechanism also allows users to print Latin text using almost any PostScript Type 1 or TrueType font that X11 supports. The mechanism usually finds font files without any configuration beyond that required to use the fonts under X11.
One-more matching conjugate problem and security of braid-based signatures
Authors: Licheng Wang, Zhenfu Cao, Peng Zeng, Xiangxue Li
Venue: Proceedings of the 2nd ACM symposium on Information, computer and communications security (2007)

Braid groups have recently attracted the attention of many cryptographers as an alternative to number-theoretic public key cryptography. But the published braid-based signatures have failed to reach the most desired security, i.e., existential unforgeability under adaptively chosen message attack (EUF-CMA). In this paper, we at first prompt a new kind of braid-based assumption --- one-more matching conjugate assumption; and then based on it, we prove that some braid-based signatures are EUF-CMA secure in the random oracle model.
Computing the Stability Number of a Graph Via Linear and Semidefinite Programming
Authors: Javier Pen&tilde;a, Juan Vera, Luis F. Zuluaga
Venue: SIAM Journal on Optimization (2007)

We study certain linear and semidefinite programming lifting approximation schemes for computing the stability number of a graph. Our work is based on and refines de Klerk and Pasechnik&rsquo;s approach to approximating the stability number via copositive programming [SIAM J. Optim., 12 (2002), pp. 875-892]. We provide a closed-form expression for the values computed by the linear programming approximations. We also show that the exact value of the stability number $\alpha(G)$ is attained by the semidefinite approximation of order $\alpha(G)-1$ as long as $\alpha(G) \leq 6$. Our results reveal some sharp differences between the linear and the semidefinite approximations. For instance, the value of the linear programming approximation of any order is strictly larger than $\alpha(G)$ whenever $\alpha(G) > 1$.
Minitrack: Consumer Health Informatics, Patient Safety and Quality of Practice
Authors: Cynthia LeRouge, Gordana Culjak, Thomas A. Horan
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Health Information Consumers are increasingly seeking access to timely, accurate and accessible information, as made possible through Information Technology (IT). These technological developments have direct implications for access, awareness and use of health information by consumers, as well as patient decision making, safety, and quality of health care provision. Healthcare information systems are expected to reduce medical errors, improve quality of patient care and safety. These systems are increasingly supporting evidence-based medicine and patientcentric technologies, including monitoring of patient outcomes and adverse events, as well as better informing and empowering consumers themselves to work for better outcomes. This mini-track embraces all aspects of consumer health informatics and consumer-centric technologies or studies aimed at improving patient safety and quality of care, including: supporting consumers taking an active role in understanding, deciding about and/or managing their health; doctor-patient communication; clinical guideline and protocol support; monitoring and prevention of adverse events; and electronic health records (especially, security and privacy, access control rights, and consumer ability to make entries into the health record, including home monitoring). The Consumer Health Informatics, Patient Safety and Quality of Practice Minitrack uses the international and interdisciplinary forum provided by HICSS for the expression of practical, theoretical, academic and industrial insight in this area.
Quasi-random points keep their distance
Authors: I. M. Sobol, B. V. Shukhman
Venue: Mathematics and Computers in Simulation (2007)

In contrast to random points that may cluster, quasi-random points keep their distance. These distances are investigated.1.If N independent random points in the n-dimensional unit hypercube are selected, two of these points may be arbitrarily close. However, if Q"0, Q"1, ..., Q"N"-"1, are quasi-random points, the minimum distance between pairs of these points, d"N, has a positive lower bound. For the Sobol sequence d"N>=1/2nN^-^1. Numerical experiments suggest that for large N(1)d"N@?N^-^1^/^n. 2.For certain search algorithms, it is important to know points Q"i and Q"i"+"1 that are not close. For the Sobol sequence, the distances@r(Q"2"k,Q"2"k"+"1)=12n,and14n@?@r(Q"4"k"+"1,Q"4"k"+"2)@?145n+c,where c=0 for even n and c=4 for odd n. 3.Numerical estimations of d"N for the Halton and Faure sequences were carried out. It is likely that for these sequences, (1) is true also.
A multi criteria meta-heuristic approach to nurse rostering
Authors: E. K. Burke, P. De Causmaecker, S. Petrovic, G. Vanden Berghe
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Users of hospital personnel planning software cope with the complex task of translating their needs into several constraints of a very different nature and with differing cost parameters. We present a multi criteria evolutionary approach, which overcomes some of the practical difficulties that personnel schedulers in hospitals often face.
Applying the minimum free energy spectral estimation algorithm to ISAR imaging
Authors: A. Freedman
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

Inverse synthetic aperture radar (ISAR) is a technique used to obtain an image of the radar target. It can be described as a spectral analysis problem. This paper discusses the application of the minimum free energy (MFE) spectral estimation algorithm for the purpose of ISAR imaging. The MFE algorithm is a regularization algorithm which achieves a better noise performance than other methods studied previously. The paper discusses the choice of parameters for the MFE technique, and presents ISAR images obtained using MFE for various observation times. MFE indeed achieves a 3-4 times higher resolution than the classic Fourier technique, without prominent spikes in the noise region. However, some of the details observed in the Fourier image are lost. Using diversity (incoherent) combining, it is shown that based upon the same RF data, MFE and the Fourier techniques produce images of similar quality, although MFE poses a less stringent requirement on the length of the coherent observation time. The MFE can be applied to ISAR imaging of close to radial targets.
TST-MUSIC for DOA-delay joint estimation
Authors: Yung-Yi Wang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

A multiple signal classification (MUSIC) based approach, time-space-time MUSIC (TST-MUSIC), is proposed to jointly estimate the directions of arrival (DOAs) and the propagation delays of a wireless multipath channel. The MUSIC algorithms for the DOA and propagation delay estimation are referred to as the S-MUSIC and T-MUSIC algorithms, respectively. By using the space-time characteristics of the multipath channel, the approach combines the temporal filtering and spatial beamforming techniques along with one S-MUSIC and two T-MUSIC algorithms in a tree structure. As such, the incoming rays are grouped, isolated, then estimated in the DOA-delay domain, and the paring of the estimated DOAs and delays are automatically determined. Also, the proposed approach can resolve the incoming rays from very close DOAs or with very close delays. Furthermore, the number of antennas required can be less than that of the incoming rays. The furnished simulations justify the new algorithm.
Deploying safe user-level network services with icTCP
Authors: Haryadi S. Gunawi, Andrea C. Arpaci-Dusseau, Remzi H. Arpaci-Dusseau
Venue: Proceedings of the 6th conference on Symposium on Opearting Systems Design & Implementation - Volume 6 (2004)

We present icTCP, an "information and control" TCP implementation that exposes key pieces of internal TCP state and allows certain TCP variables to be set in a safe fashion. The primary benefit of icTCP is that it enables a variety of TCP extensions to be implemented at user-level while ensuring that extensions are TCP-friendly. We demonstrate the utility of icTCP through a collection of case studies. We show that by exposing information and safe control of the TCP congestion window, we can readily implement user-level versions of TCP Vegas, TCP Nice, and the Congestion Manager; we show how user-level libraries can safely control the duplicate acknowledgment threshold to make TCP more robust to packet reordering or more appropriate for wireless LANs; we also show how the retransmission timeout value can be adjusted dynamically. Finally, we find that converting a stock TCP implementation into icTCP is relatively straightforward; our prototype requires approximately 300 lines of new kernel code.
Guest Editors' Introduction: High-Performance Reconfigurable Computing
Authors: Duncan Buell, Tarek El-Ghazawi, Kris Gaj, Volodymyr Kindratenko
Venue: Computer (2007)

High-performance reconfigurable computers have the potential to exploit coarse-grained functional parallelism as well as fine-grained instruction-level parallelism through direct hardware execution on FPGAs.
Application of He's variational iteration method to nonlinear Jaulent-Miodek equations and comparing it with ADM
Authors: D. D. Ganji, M. Jannatabadi, E. Mohseni
Venue: Journal of Computational and Applied Mathematics (2007)

Instead of finding a small parameter for solving nonlinear problems through perturbation method, a new analytical method called He's variational iteration method (VIM) is introduced to be applied to solve nonlinear Jaulent-Miodek, coupled KdV and coupled MKdV equations in this article. In this method, general Lagrange multipliers are introduced to construct correction functionals for the problems. The multipliers can be identified optimally via the variational theory. The results are compared with exact solutions.
Hypothesis dependent threshold setting for improved out-of-vocabulary data rejection
Authors: D. Jouvet
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 02 (1999)

An efficient rejection procedure is necessary to reject out-of-vocabulary words and noise tokens that occur in voice activated vocal services. Garbage or filler models are very useful for such a task. However, a post-processing of the recognized hypothesis, based on a likelihood ratio statistic test, can refine the decision and improve performance. These tests can be applied either on acoustic parameters or on phonetic or prosodic parameters that are not taken into account by the HMM-based decoder. This paper focuses on the post-processing procedure and shows that making the likelihood ratio decision threshold dependent on the recognized hypothesis largely improves the efficiency of the rejection procedure. Models and anti-models are one of the key-points of such an approach. Their training and usage are also discussed, as well as the contextual modeling involved. Finally results are reported on a field database collected from a 2000-word directory task using various phonetic and prosodic parameters.