ppxscal/embedding_network huggingface dataset:
Bounding the Information Collection Performance of Wireless Sensor Network Routing
Authors: Qinghua Wang, Tingting Zhang, Stefan Pettersson
Venue: Proceedings of the Fifth Annual Conference on Communication Networks and Services Research (2007)

Wireless sensor networks have mainly been designed for information-collecting purposes, such as habitat monitoring, product process tracing, battlefield surveillance, etc. In order to support efficient communications for such networks, many routing protocols have been proposed. However, protocol designs are out-pacing formal analysis. We propose an optimization model in this paper to bound the routing performance in terms of network information collection. We first argue that a network can only be given a death sentence when it fails to satisfy the application's requirement and propose a more reasonable network lifetime definition. Then, the optimization model concerning maximizing information collection routing is presented based on this new network lifetime definition. Existing typical routing algorithms: MH, MTE, FA and MREP are simulated as references to validate the model proposed. Results show our model can provide a tight upper bound and thus can be used to evaluate existing and up-coming routing algorithms.
New results in group theoretic cryptology
Authors: Spyros S. Magliveras
Venue:  (2006)

With the publication of Shor's quantum algorithm for solving discrete logarithms in finite cyclic groups, a need for new cryptographic primitives arose; namely, for more secure primitives that would prevail in the post-quantum era. The aim of this dissertation is to exploit some hard problems arising from group theory for use in cryptography. Over the years, there have been many such proposals. We first look at two recently proposed schemes based on some form of a generalization of the discrete logarithm problem (DLP), identify their weaknesses, and cryptanalyze them. By applying the expertise gained from the above cryptanalyses, we define our own generalization of the DLP to arbitrary finite groups. We show that such a definition leads to the design of signature schemes and pseudo-random number generators with provable security under a security assumption based on a group theoretic problem. In particular, our security assumption is based on the hardness of factorizing elements of the projective special linear group over a finite field in some representations. We construct a one-way function based on this group theoretic assumption and provide a security proof.
Minimum Energy Range Assignment in Heterogeneous Ad-Hoc Networks
Authors: Miriam Di Ianni, Gianluca Rossi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper we provide a polynomial-time 2- approximation algorithm for the all-to-all minimum cost range assignment problem in Ad-Hoc wireless networks that can be modelled by generic directed weighted graphs. The best already known approximation algorithm has a log-arithmic approximation factor [4].
Beyond the Future Internet--Requirements of Autonomic Networking Architectures to Address Long Term Future Networking Challenges
Authors: M. Siekkinen, V. Goebel, T. Plagemann, K.-A. Skevik, M. Banfield, I. Brusic
Venue: Proceedings of the 11th IEEE International Workshop on Future Trends of Distributed Computing Systems (2007)

We present in this paper an overview of current problems with the Internet from the architectural view point, and we identify and forecast trends for future developments. Our study includes perspectives from different stakeholders of the Internet as well as from the technological development point of view. We conclude that current and future requirements vary greatly between, and even within, different stakeholders, which implies that a successful future network architecture must provide maximum flexibility with a minimal set of "hard-wired" properties. In specific, a revised version of the TCP/IP layered architecture would only suffice to address some of the current issues, but would not provide a long term solution. We then show that an autonomic network architecture with a few simple architectural building blocks is enough to address a great deal of the requirements today and in the future.
Robust recognition of cellular telephone speech by adaptive vector quantization
Authors: M. K. Sonmez, R. Rajasekaran, J. S. Baras
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

The performance degradation as a result of acoustical environment mismatch remains an important practical problem in speech recognition. The problem carries a greater significance in applications over telecommunication channels, especially with the wider use of personal communications systems such as cellular phones which invariably present challenging acoustical conditions. In this work, we introduce a vector quantization (VQ) based compensation technique which both makes use of a priori information about likely acoustical environments and adapts to the test environment to improve recognition. The technique is progressive and requires neither simultaneously recorded speech from the training and the testing environments nor EM-type batch iterations. Instead of using simultaneously recorded data, the integrity of the updated VQ codebooks with respect to acoustical classes is maintained by endowing the codebooks with a topology and using transformations which preserve the topology of the reference environment. We report results on the McCaw Cellular Corpus where the technique decreases the word error for continuous ten digit recognition of cellular hands free microphone speech with land line trained models from 23.8% to 13.6% and the speaker dependent voice calling sentence error from 16.5% to 10.6%.
Context to Make You More Aware
Authors: Adrienne Andrew, Yaw Anokwa, Karl Koscher, Jonathan Lester, Gaetano Borriello
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

The goal of our work is to help users make more informed choices about what physical activities they undertake. One example is to provide relevant information to help someone choose whether to wait at the closest bus stop, or walk a few minutes to the next stop, without missing the bus. In this paper, we report on our development of a platform which collects relevant context information for five different scenarios, processes this data, and presents relevant information to the user at the right time, in an unobtrusive way. The personal area network we use consists of a sensor platform with wireless capabilities, a Bluetooth-enabled wristwatch, and a mobile phone. We are also able to communicate with the user's PCs and various web services through multiple wireless channels. In future work, we will integrate the scenarios into a customizable set of applications, and evaluate the complete system.
Balanced Decision Making in Software Engineering--General Thoughts and a Concrete Example from Industry
Authors: Hannes Omasreiter
Venue: Proceedings of the First International Workshop on The Economics of Software and Computation (2007)

Software Engineering is often treated as a mere technical challenge. However, especially in industry projects we primarily have to ask what value a software engineering activity generates. To create as much value as possible during a software project, we have to be able to make economically balanced decisions. This paper presents some general thoughts about balanced decision making in software engineering and drafts a concrete example for a value-oriented, light-weight process improvement approach.
Obstacles to Comprehension in Usage Based Reading
Authors: David J. A. Cooper, Brian R. von Konsky, Michael C. Robey, David A. McMeekin
Venue: Proceedings of the 2007 Australian Software Engineering Conference (2007)

Usage Based Reading (UBR) is a recent approach to object oriented software inspections. Like other Scenario Based Reading (SBR) techniques it proposes a prescriptive reading procedure. However, the impact of such procedures upon comprehension is not well known, and consideration has not been given to established software cognition theories. This paper describes a study examining software comprehension in UBR inspections. Participants traced the events of a UML sequence diagram through Java source code while thinking aloud. An electronic interface collected real-time data, allowing the identification of .points of interest ., which were categorised according to issues affecting participants' performance. Together with indicators of participants' cognitive processes, this suggests that adherence to UBR scenarios is non-trivial. While UBR can detect more critical defects, we argue that a re-think of its prescriptive nature, including the use of cognition support, is required before it can become a practical reading technique.
Dynamic Community Entertainment Services Composition on Next Generation Mobile Network IP Multimedia Subsystem
Authors: Yasuhiro Araki, Akio Yamamoto, Michael Sweeney
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

With the advent of Web services and dynamic service composition, flexible and adaptable complex services may be realized. Assuming that such services have been provided with all the necessary service orchestration and end user information, simple services may be enhanced with contextual information, such as location, presence and user preferences, to provide a more tailored experience for the end user. Mobile next generation service environments include many functional components suitable for the provision of contextual data with which to build tailored and complex services for subscribers. Specifically, the IP Multimedia Subsystem (IMS) defined by 3rd Generation Partnership Project (3GPP) and its enablers provide an interesting environment for researching techniques for the composition and delivery of complex context-specific personalized and community services to mobile users. In this paper we discuss our ongoing research into dynamic service composition for mobile communities. As such, we investigate community-based mobile entertainment services, their provisioning requirements, enablers, and dynamic composition of group-specific real-time next generation packet mobile services. To the end, we have developed a service platform called the Group Entertainment Service platform (GESP) for IMS that we describe in detail.
Speech recognition on Mandarin Call Home: a large-vocabulary, conversational, and telephone speech corpus
Authors: Fu-Hua Liu, M. Picheny, P. Srinivasa, M. Monkowski, J. Chen
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 01 (1996)

We describe IBM's most recent efforts for speech recognition on a conversational-speech database, the Mandarin Call Home corpus. While it is similar to the well-known Switchboard corpus, the Call Home task addresses several major challenges in the domain of spoken language systems, including spontaneous dialogue with no pre-specified topics, limited-bandwidth telephone signal, and recognition of other languages than English. We particularly describe the methodology used in Mandarin Call Home corpus to address language-specific issues. We also examine and compare our results with those of the English Switchboard corpus. Preliminary experiments show that a 58.7% character error rate can be achieved in the context of April 95 Mandarin Call Home data set. The experimental results are comparable to those of the state-of-the-art IBM Switchboard system with similar amount of training data.
Fast correction of bleed-through distortion in grayscale documents by a blind source separation technique
Authors: Anna Tonazzini, Emanuele Salerno, Luigi Bedini
Venue: International Journal on Document Analysis and Recognition (2007)

Ancient documents are usually degraded by the presence of strong background artifacts. These are often caused by the so-called bleed-through effect, a pattern that interferes with the main text due to seeping of ink from the reverse side. A similar effect, called show-through and due to the nonperfect opacity of the paper, may appear in scans of even modern, well-preserved documents. These degradations must be removed to improve human or automatic readability. For this purpose, when a color scan of the document is available, we have shown that a simplified linear pattern overlapping model allows us to use very fast blind source separation techniques. This approach, however, cannot be applied to grayscale scans. This is a serious limitation, since many collections in our libraries and archives are now only available as grayscale scans or microfilms. We propose here a new model for bleed-through in grayscale document images, based on the availability of the recto and verso pages, and show that blind source separation can be successfully applied in this case too. Some experiments with real-ancient documents arepresented and described.
"UC-Russia" globalization educational initiative
Authors: V. Uskov
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

Teaching and learning online through the Internet are bound to change the structure of US traditional educational institutions. This motivated faculty of the College of Applied Science (OCAS), University of Cincinnati (UC) to propose and complete an international project on establishment of mutually beneficial international collaboration on Web-based education (WBE) between OCAS and the Ministry of Education of Russia. This project was a part of UC's globalization strategy.
Toward alternative measures for ranking venues: a case of database research community
Authors: Su Yan, Dongwon Lee
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Ranking of publication venues is often closely related with important issues such as evaluating the contributions of individual scholars/research groups, or subscription decision making. The development of large-scale digital libraries and the availability of various meta data provide the possibility of building new measures more efficiently and accurately. In this work, we propose two novel measures for ranking the impacts of academic venues an easy-to-implement seed-based measure that does not use citation analysis, and a realistic browsing-based measure that takes an article reader's behavior into account. Both measures are computationally efficient yet mimic the results of the widely accepted Impact Factor. In particular, our proposal exploits the fact that: (1)in most disciplines, there are "top" venues that most people agree on; and (2) articles that appeared in good venues are more likely to be viewed by readers. Our proposed measures are extensively evaluated on a test case of the Database research community using two real bibliography data sets - ACM and DBLP. Finally, ranks of venues by our proposed measures are compared against the Impact Factor using the Spearman's rank correlation coefficient, and their positive rank order relationship is proved with a statistical significance test.
Deleted Interpolation Using a Hierarchical Bayesian Grammar Network for Recognizing Human Activity
Authors: K. M. Kitani, Y. Sato, A. Sugimoto
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

From the viewpoint of an intelligent video surveillance system, the high-level recognition of human activity requires a priori hierarchical domain knowledge as well as a means of reasoning based on that knowledge. We approach the problem of human activity recognition based on the understanding that activities are hierarchical, temporally constrained and temporally overlapped. While stochastic grammars and graphical models have been widely used for the recognition of human activity, methods combining hierarchy and complex queries have been limited. We propose a new method of merging and implementing the advantages of both approaches to recognize activities in real-time. To address the hierarchical nature of human activity recognition, we implement a hierarchical Bayesian network (HBN) based on a stochastic context-free grammar (SCFG). The HBN is applied to digressive substrings of the current string of evidence via deleted interpolation (DI) to calculate the probability distribution of overlapped activities in the current string. Preliminary results from the analysis of activity sequences from a video surveillance camera show the validity of our approach.
Pre- and Post-Fabrication Architecture Exploration for Partially Reconfigurable VLIW Processors
Authors: A. Chattopadhyay, Z. Rakosi, K. Karuri, D. Kammler, R. Leupers, G. Ascheid, H. Meyr
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

Modern Application Specific Instruction-set Processors (ASIPs) face the demanding task of delivering high performance for a wide range of applications. For enhancing the performance, architectural features e.g. pipelining, VLIW etc are often employed in ASIPs, leading to high design complexity. Integrated ASIP design environments like templated-based approaches [1] and languagedriven approaches [2][3] provide an answer to this growing design complexity. At the same time, increasing hardware design costs have motivated the processor designers to introduce high flexibility in the processor. Flexibility, in its most effective form, can be introduced to the ASIP by coupling a re-configurable unit to the base processor. Due to its obvious benefits, several re-configurable ASIPs (rASIPs) have been designed in the recent years. These rASIP designs lacked a generic flow from high-level specification, resulting into intuitive design decisions and hard-to-retarget processor design tools. Although a template-based approach for rASIP design is existent [4], a clear design methodology especially for the pre-fabrication architecture exploration is not present. In order to address this issue, a high-level specification and design methodology for partially re-configurable VLIW processors is proposed in this paper. To show the benefit of this approach a commercial VLIW processor is used as the base architecture and two domains of applications are studied for potential performance gain.
Segmentation of Time Series by the Clustering and Genetic Algorithms
Authors: Vincent S. Tseng, Chun-Hao Chen, Chien-Hsiang Chen, Tzung-Pei Hong
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

This paper proposes a time series segmentation approach by combining the clustering technique, the discrete wavelet transformation and the genetic algorithm to automatically find segments and patterns from a time series. The genetic algorithm is used to find the segmentation points for deriving appropriate patterns. In the fitness evaluation, the proposed algorithm first divides subsequences in a chromosome into k clusters by using the k-means clustering approach. The Euclidean distance is then used to calculate the distance of each subsequence and evaluate a chromosome. The discrete wavelet transformation is also used to adjust the length of the subsequences for comparing their similarity since their length may be different. Experimental results show that the proposed approach can get good effects in finding appropriate segmentation patterns in time series.
On assertion-based encapsulation for object invariants and simulations
Authors: David A. Naumann
Venue: Formal Aspects of Computing (2007)

In object-oriented programming, reentrant method invocations and shared references make it difficult to achieve adequate encapsulation for sound modular reasoning. This tutorial paper surveys recent progress using auxiliary state (ghost fields) to describe and achieve encapsulation. It also compares this technique with encapsulation in the forms provided by separation logic. Encapsulation is assessed in terms of modular reasoning about invariants and simulations.
An extensible protocol architecture for application-specific networking
Authors: Marc E. Fiuczynski, Brian N. Bershad
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

Plexus is a networking architecture that allows applications to achieve high performance with customized protocols. Application-specific protocols are written in a typesafe language and installed dynamically into the operating system kernel. Because these protocols execute within the kernel, they can access the network interface and other operating system services with low overhead. Protocols implemented with Plexus outperform equivalent protocols implemented on conventional monolithic systems. Plexus runs in the context of the SPIN extensible operating system.
Multiband warped filter equalizer design for loudspeaker systems
Authors: Wang Peng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 02 (2000)

The multiband approach in loudspeaker equalization has the advantage of being able to produce a very flat equalized response. However, its complex structure makes it impractical for low-cost loudspeaker implementation. In this paper, a tri-band equalization method is proposed. The method uses warped filter equalization to enhance the frequency resolution thereby reducing the need for having many equalization sub-bands. A technique has also been developed to adjust the warping effective region to a wider range. Computer simulation results show that the proposed method is able to improve the performance of the equalized response.
Applications of discrete-time Laguerre networks to envelope constrained filter design
Authors: Z. Zang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

The envelope constrained (EC) filtering problem is concerned with the design of a filter with minimum gain to white input noise and with a response to a given signal that fits into a prescribed envelope. Using the discrete-time orthonormal Laguerre network, the EC filtering problem is posed as a quadratic programming (QP) problem with affine inequality constraints. An iterative algorithm for solving this QP problem is proposed which serves as a basis for the derivation of adaptive algorithms for applications where the parameters of the underlying signal model are either not known or varying with time.
OPUS: online patches and updates for security
Authors: Gautam Altekar, Ilya Bagrak, Paul Burstein, Andrew Schultz
Venue: Proceedings of the 14th conference on USENIX Security Symposium - Volume 14 (2005)

We present OPUS, a tool for dynamic software patching capable of applying fixes to a C program at run-time. OPUS's primary goal is to enable application of security patches to interactive applications that are a frequent target of security exploits. By restricting the type of patches admitted by our system, we are able to significantly reduce any additional burden on the programmer beyond what would normally be required in developing and testing a conventional stop-and-restart patch. We hand-tested 26 real CERT [1] vulnerabilities, of which 22 were dynamically patched with our current OPUS prototype, doing so with negligible runtime overhead and no prior knowledge of the tool's existence on the patch programmer's part.