ppxscal/embedding_network huggingface dataset:
Proxy re-signatures: new definitions, algorithms, and applications
Authors: Giuseppe Ateniese, Susan Hohenberger
Venue: Proceedings of the 12th ACM conference on Computer and communications security (2005)

In 1998, Blaze, Bleumer, and Strauss (BBS) proposed proxy re-signatures, in which a semi-trusted proxy acts as a translator between Alice and Bob. To translate, the proxy converts a signature from Alice into a signature from Bob on the same message. The proxy, however, does not learn any signing key and cannot sign arbitrary messages on behalf of either Alice or Bob. Since the BBS proposal, the proxy re-signature primitive has been largely ignored, but we show that it is a very useful tool for sharing web certificates, forming weak group signatures, and authenticating a network path.We begin our results by formalizing the definition of security for a proxy re-signature. We next substantiate the need for improved schemes by pointing out certain weaknesses of the original BBS proxy re-signature scheme which make it unfit for most practical applications. We then present two secure proxy re-signature schemes based on bilinear maps. Our first scheme relies on the Computational Diffie-Hellman (CDH) assumption; here the proxy can translate from Alice to Bob and vice-versa. Our second scheme relies on the CDH and 2-Discrete Logarithm (2-DL) assumptions and achieves a stronger security guarantee -- the proxy is only able to translate in one direction. Constructing such a scheme has been an open problem since proposed by BBS in 1998. Furthermore in this second scheme, even if the delegator and the proxy collude, they cannot sign on behalf of the delegatee. Both schemes are efficient and secure in the random oracle model.
Issues on Decentralized Consistency Checking of Multi-lateral Collaborations
Authors: Andreas Wombacher
Venue: Proceedings of the 14th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprise (2005)

Decentralized consistency checking of multi-lateral collaborations is based on propagating local information to trading partners until a fixed point has been reached. However, which information has to be propagated and how to represent this information is a challenge, because the local consistency decisions should derive consistency only if the collaboration is consistent. In this paper two scenarios are discussed arguing that history information about reaching a state must be propagated and that messages must be named uniquely in this history information to achieve the aimed equivalence of local consistency and collaboration consistency.
Efficient compression and delivery of stored motion data for avatar animation in resource constrained devices
Authors: Siddhartha Chattopadhyay, Suchendra M. Bhandarkar, Kang Li
Venue: Proceedings of the ACM symposium on Virtual reality software and technology (2005)

Animation of Virtual Humans (avatars) is done typically using motion data files that are stored on a client or streaming motion data from a server. Several modern applications require avatar animation in mobile networked virtual environments comprising of power constrained clients such as PDAs, Pocket-PCs and notebook PCs operating in battery mode. These applications call for efficient compression of the motion animation data in order to conserve network bandwidth, and save power at the client side during data reception and motion data reconstruction from the compressed file. In this paper, we have proposed and implemented a novel file format, termed the Quantized Motion Data (QMD) format, which enables significant, though lossy, compression of the motion data. The motion distortion resulting from the reconstructed motion from the QMD file is minimized by intelligent use of the hierarchical structure of the skeletal avatar model. The compression gained by using the QMD files for the motion data is more than twice achieved via standard MPEG-4 compression using a pipeline comprising of quantization, predictive encoding and arithmetic coding. In addition, considerably fewer CPU cycles are needed to reconstruct the motion data from the QMD files compared to motion data compressed using the MPEG-4 standard.
Mouse calls
Authors: Esther Schindler
Venue: netWorker (2005)

There may not be a remote chance that the doctor you need is within driving distance, but you may be able to get medical expertise remotely.
Low temperature crystallized Ta2O5/Nb2O5 bi-layers integrated into RIR capacitor for 60 nm generation and beyond
Authors: Kyuho Cho, Jinil Lee, Jae-Soon Lim, Hanjin Lim, Junghyun Lee, Sungho Park, Cha-Young Yoo, Sung-Tae Kim, U-In Chung, Joo-Tae Moon
Venue: Microelectronic Engineering (2005)

article-71-abstract
A Wide-Band Lumped Element Compact CAD Model of Si-Based Planar Spiral Inductor for RFIC Design
Authors: Sushanta K. Mandal, Arijit De, Amit Patra, Shamik Sural
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

In this paper, a new lumped element compact Si-based on-chip spiral inductor model is presented for wide-band application. It consists of a new substrate network and underpass oxide leakage component to model the reduction in equivalent series resistance at higher frequencies, taking into account the substrate loss due to eddy current effect. The model accurately estimates the equivalent circuit parameters and inductor behavior over a wide frequency range up to 20GHz. The proposed model has been verified with the measured results of octagonal spiral inductors fabricated on a six-metal BiCMOS7 process. Application of global optimizations genetic algorithm (GA) and particle swarm optimization (PSO) are discussed. PSO is used for the extraction of model parameters that speeds up the convergence and overcomes the sub-optimal solution of conventional optimization algorithm.
Simultaneous Estimation of Camera Response Function, Target Reflectance and Irradiance Values
Authors: Leonard G. C. Hamey
Venue: Proceedings of the Digital Image Computing on Techniques and Applications (2005)

Video cameras may be used for radiometric measurement in machine vision applications including colour measurement and shape from shading. These techniques assume that the camera provides a linear measurement of light intensity. Even when the video gamma factor is disabled, video camera response is still often nonlinear and varies from one camera to another. We describe a method of measuring a camera's radiometric response function using unknown but stable reflectance targets and illumination. The technique does not require sophisticated equipment or precise measurement or control of physical properties. The technique simultaneously estimates the camera's radiometric response, the relative reflectance values of reflectance targets and the relative illumination levels of multiple light sources. The technique has been practically applied for colour measurement applications with an experimentally verified accuracy of 0.3%.
Computational complexity and bounds for neighbor-scattering number of graphs
Authors: Fengwei Li, Xueliang Li
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Let G = (V,E) be a graph. A vertex subversion strategy of G, X, is a set of vertices of G whose closed neighborhood is deleted from G. The survival-subgraph is de- fined by G/X. A vertex subversion strategy of G, X, is called a cut-strategy of G if the survival-subgraph is disconnected, or a clique, or \emptyset. The neighbor-scattering number of G, S(G), is defined as S(G) = max{w(G/X) - |X|: X is a cut-stragey of G w(G/X) \ge 1}, where w(G/X) is the number of connected componentsin the graph G/X. As a new graphic parameter, neighbor-scattering number can be used to measure the vulnerability of spy networks. In this paper, we prove that the problem of computing the neighbor-scattering number of a graph is NP-complete and discuss the upper and lower bounds for the neighbor-scattering number via some other well-known graphic parameters. Finally, we give formulas for the neighbor-scattering numbers of the join and union of two disjoint graphs.
Saturation throughput analysis of error-prone 802.11 wireless networks: Research Articles
Authors: Qiang Ni, Tianji Li, Thierry Turletti, Yang Xiao
Venue: Wireless Communications Mobile Computing (2005)

It is well known that the medium access control (MAC) layer is the main bottleneck for the IEEE 802.11 wireless LANs. Much work has been done on performance analysis of the 802.11 MAC. However, most of them assume that the wireless channel is error free. In this paper, we investigate the saturation throughput performance achieved at the MAC layer, in both congested and error-prone channels. We provide a simple and accurate analytical model to calculate the MAC throughput. The model is validated through extensive simulation results. Our results show that channel errors have a significant impact on the system performance. Copyright &copy; 2005 John Wiley & Sons, Ltd.
An Approach for Stemming in Symbolically Compressed Indian Language Imaged Documents
Authors: Utpal Garain, Alok Kumar Datta
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Stemming is used in many information retrieval (IR) systems to reduce variant word forms to common roots, and thereby improving the overall retrieval efficiency. This paper presents an algorithm for stemming in the context of document image retrieval system. The algorithm assumes that the documents are symbolically compressed and stemming has been attempted in the compressed domain itself. Experiments have been conducted on Indian language imaged documents for which efficient OCR still remains a challenging task. Results obtained from a set 150 document images (in Bangla script, the second most popular script in the Indian sub-continent) consisting of about 12K word show a promising performance of the proposed approach.
Multimodal content-based structure analysis of karaoke music
Authors: Yongwei Zhu, Kai Chen, Qibin Sun
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

This paper presents a novel approach for content-based analysis of karaoke music, which utilizes multimodal contents including synchronized lyrics text from the video channel and original singing audio as well as accompaniment audio in the two audio channels. We proposed a novel video text extraction technique to accurately segment the bitmaps of lyrics text from the video frames and track the time of its color changes that are synchronized to the music. A technique that characterizes the original singing voice by analyzing the volume balance between the two audio channels is also proposed. A novel music structure analysis method using lyrics text and audio content is then proposed to precisely identify the verses and choruses of a song, and segment the lyrics into singing phrases. Experimental results based on 20 karaoke music titles of difference languages have shown that our proposed video text extraction technique can detect and segment the lyrics texts with accuracy higher than 90%, and the proposed multimodal approach for music structure analysis method has better performance than the previous methods that are based only on audio content analysis.
Light-Trail Networks: Design and Survivability
Authors: Srivatsan Balasubramanian, Wensheng He, Arun K. Somani
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

The light-trail architecture provides a novel solution to address IP-centric issues at the optical layer. By incorporating drop and continue functionality, overlaid with a lightweight control protocol, light-trails enable efficient sharing of network resources, support subwavelength traffic and minimize costs. In this work, we investigate network design and survivability issues in such networks in the presence of multi-granularity subwavelength traffic subject to nonbifurcation constraints. We first establish the NP-Hardness of the light-trail routing problem by reduction from a Hamiltonian path problem. We propose three heuristics for lighttrail network design and study their performance with limited network resources. We observe the effect of tunable and fixed transceiver equipment on network throughput. We observe that our heuristics yield excellent wavelength utilization under moderate to high loads even in the presence of heavily fractional traffic.We propose two additional heuristics for shared and dedicated protection and conclude that with only a modest amount of spare capacity, full protection can be achieved for all single link failures.
Statistical anomaly denial of service and reconnaissance intrusion detection
Authors: C. N. Manikopoulos
Venue:  (2004)

This dissertation presents the architecture, methods and results of the Hierarchical Intrusion Detection Engine (HIDE) and the Reconnaissance Intrusion Detection System (RIDS); the former is denial-of-service (DoS) attack detector while the latter is a scan and probe (P S) reconnaissance detector; both are statistical anomaly systems. The HIDE is a packet-oriented, observation-window using, hierarchical, multi-tier, anomaly based network intrusion detection system, which monitors several network traffic parameters simultaneously, constructs a 64-bin probability density function (PDF) for each, statistically compares it to a reference PDF of normal behavior using a similarity metric, then combines the results into an anomaly status vector that is classified by a neural network classifier. Three different data sets have been utilized to test the performance of HIDE; they are OPNET simulation data, DARPA'98 intrusion detection evaluation data and the CONEX TESTBED attack data. The results showed that HIDE can reliably detect DoS attacks with high accuracy and very low false alarm rates on all data sets. In particular, the investigation using the DARPA'98 data set yielded an overall total misclassification rate of 0.13%, false negative rate of 1.42%, and false positive rate of 0.090%; the latter implies a rate of only about 2.6 false alarms per day. The RIDS is a session oriented, statistical tool, that relies on training to model the parameters of its algorithms, capable of detecting even distributed stealthy reconnaissance attacks. It consists of two main functional modules or stages: the Reconnaissance Activity Profiler (RAP) and the Reconnaissance Alert Correlater (RAC). The RAP is a session-oriented module capable of detecting stealthy scanning and probing attacks, while the RAC is an alert-correlation module that fuses the RAP alerts into attack scenarios and discovers the distributed stealthy attack scenarios. RIDS has been evaluated against two data sets: (a) the DARPA'98 data, and (b) 3 weeks of experimental data generated using the CONEX TESTBED network. The RIDS has demonstrably achieved remarkable success; the false positive, false negative and misclassification rates found are low, less than 0.1%, for most reconnaissance attacks; they rise to about 6% for distributed highly stealthy attacks; the latter is a most challenging type of attack, which has been difficult to detect effectively until now.
Improving efficiency and effectiveness of dynamic time warping in large time series databases
Authors: Chotirat Ratanamahatana
Venue:  (2005)

In recent years, indexing, classification, clustering, and anomaly detection of time series data have become topics of great interest within the database/data mining community; within those data mining applications, the measurement of similarity between two time series is one of the most essential subroutines. The superiority of Dynamic Time Warping (DTW) similarity measure over Euclidean distance for these tasks has been well-demonstrated by many researchers. However, the greater accuracy of DTW comes at a price of forbiddingly higher CPU demands. The recent introduction of lower bounding function greatly helps address this problem, making DTW calculation tenable for larger datasets. In spite of the great success of DTW in a variety of domains, there still are several persistent myths about it, causing great confusion in the literature. This work identifies and dispels these myths by empirical demonstration of the findings with a comprehensive set of experiments. Based on these findings, a novel framework, so called Ratanamahatana-Keogh Band ( R-K Band), is proposed, making DTW faster and more accurate by learning arbitrary constraints on the warping path of the DTW calculation. This proposed framework can conveniently replace the existing DTW distance measures, or can be incorporated into any other time series applications; the extensive empirical evaluations demonstrate significant improvement both in accuracy for classification problems, and in precision/recall for a relevance feedback system for time series retrieval. As an augmentation to this work, a bit-level dimensionality reduction technique, a clipped representation, is proposed and shown to improve the compression ratio by a wide margin, while being able to maintain or increase the tightness of its lower bound, allowing even faster nearest neighbor queries, especially in ones that require DTW distance measure.
Distributed Self-Minimum Connected Covering of a Query Region in Sensor Networks
Authors: Ajoy K. Datta, Rajesh Patel, Maria Gradinariu
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Wireless ad-hoc sensor networks are composed of a large number of tiny sensors that have limited resources and yet must form a connected network. A group of sensors is said to cover a certain region when the union of the sensing disks of these sensors completely cover this region. Given a query over a sensor network the minimum connected sensor cover problem is to select a minimum, or nearly minimum, set of sensors such that the selected sensors cover the query region and form a connected network. One proposed solution for the minimum connected sensor cover problem can be to first form a minimum connected dominating set (MCDS), and then to include all sensors in the MCDS in the final cover set. In this paper, we use this approach to present a fully distributed, strictly localized, scalable, self-solution to the minimum connected sensor cover problem.
A WBEM based solution for a 4G network integrated management
Authors: Pedro Goncalves, Jose Luis Oliveira, Rui L. Aguiar
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Next generation networks will put a new set of challenges related to operation and management, due to the increased complexity arising by the seamless integration of different kinds of technologies, services and terminals, and with the expected offered bandwidth. In this paper we present a Policy-based management system that is being developed inside the Daidalos IST project for such environments. This system uses Policy Based Management concepts associated with Web-Based Enterprise Management to control QoS aspects in this complex network.
Generalizations of artin's conjecture for primitive roots
Authors: Cherng-Tiao Perng
Venue:  (2005)

The dissertation consists of four chapters. The first chapter is an introduction, where we formulate new generalizations of Artin's conjecture for primitive roots and also mention some existing formulations. In chapter two we prove the following result: given a CM elliptic curve E defined over a number field, we have an asymptotic formula counting the number of prime ideals p with norm &le; x, such that the reduction of E modulo p is cyclic. In this formula the error term estimate is given with effectively computable constant. In chapter three we point out that the arguments given in Bilharz's paper for an example of nonexistence of natural density don't seem to be clear. We correct a typo and give full justification for his claim in the cases when the characteristic p of the function field satisfies some inequality. Depending on the interests of the readers, chapters two and three can be read independently. In chapter four we include some examples, which are either in the new formulation or more complicated cases in the existing formulation.
Comparison of Psychoacoustic Principles and Genetic Algorithms in Audio Compression
Authors: Howard Chen, T. L. Yu
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

High audio data compression can be achieved by removing irrelevant signal information that is not detectable by even a well- trained or sensitive listener. Contemporary audio coding schemes like MP3, AAC, and Ogg Vorbis identify the irrelevant information during signal analysis by incorporating into the coder several psychoacoustic principles, including absolute hearing thresholds, critical band analysis, simultaneous masking, and temporal masking [1]. Masking is the process of removing faint but normally audible sound signals that are rendered inaudible as they are very close in frequency to or have much smaller amplitudes than surrounding sounds. Numerous studies have been conducted on genetic algorithms, which solve problems by modeling the Darwinian evolution. The algorithms have been recently applied to audio coding with some success [2]. To achieve audio compression, genetic algorithms analyze a large number of sound files to determine the chunks that are most likely to contain irrelevant signals. The combination of the irrelevant chunks form a solution, which will be used to compress any sound files. We present in this paper a study of the comparison of applying psychoacoustic principles and genetic algorithms to compress audio signals. We developed a coder to perform the experiment, where like most well-known audio coders, Huffman coding is used to handle lossless compression and modified discrete cosine transform (MDCT) is used to transform the time-domain signals to the frequency domain. The results are compared using signal-to-noise ratios (SNRs) and subjective testing, where eighteen subjects (who are students in CSUSB) are asked to listen and rate the decompressed files by the two methods.
AspectAda: aspect oriented programming for ada95
Authors: Knut H. Pedersen, Constantinos Constantinides
Venue: ACM SIGAda Ada Letters (2005)

Concerns for concurrent systems are not always easy to modularize within single units using traditional programming languages. The concept of aspect orientation can be applied to allow a modular implementation of these concerns. Existing programming languages has been extended with new language features to support aspect-orientation. The most dominant of these language extensions are AspectJ for the Java programming language. However, Java is not ideal for all types of applications, or there exists legacy systems that need to be maintained.This paper presents AspectAda a new language extension to Ada95 and an AspectAda weaver tool built with the Ada Semantic Interface Specifciation (ASIS). The AspectAda language provides powerful language elements to facilitate aspect oriented programming in domains where Ada's capabilities are of high interest and the AspectAda weaver tool demonstrates the AspectAda language in action.