ppxscal/embedding_network huggingface dataset:
A distortion analysis and optimal design of orthogonal basis for DMT transceivers
Authors: Xueming Lin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

An orthogonal transmultiplexer (synthesis/analysis filter bank) utilizing DFT (discrete fourier transform) basis is the current DMT (discrete multitone) standard for HDSL communications. The measures of the ICI and ISI distortions in a multicarrier modulation scheme are presented. The ICI and ISI performance of DFT along with other known linear transforms are compared. The issues of optimal basis design for a given channel are discussed. The available design tools of the subband transform theory are highlighted for the future performance improvements.
Image indexing and retrieval based on vector quantization
Authors: Shyh Wei Teng, Guojun Lu
Venue: Pattern Recognition (2007)

To effectively utilize information stored in a digital image library, effective image indexing and retrieval techniques are essential. This paper proposes an image indexing and retrieval technique based on the compressed image data using vector quantization (VQ). By harnessing the characteristics of VQ, the proposed technique is able to capture the spatial relationships of pixels when indexing the image. Experimental results illustrate the robustness of the proposed technique and also show that its retrieval performance is higher compared with existing color-based techniques.
An innovative approach to visualization of stress
Authors: W. K. Szaroletta
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

This paper describes the development of a tool to help students easily visualize stresses in truss structures through photoelastic visualization of quickly assembled truss structures. Clear polymer structural members of varying lengths were designed with the capability to be connected to form a variety of simple truss structures. This development effort was conducted across functional areas in a mechanical engineering technology department. Eventually, a fully developed mechanical toolkit will be used in conjunction with computational and numerical tools in the study of stress, strain, and strength analysis as well as offering a platform to teach instrumentation techniques in experimental stress analysis.
A Calculus of Global Interaction based on Session Types
Authors: Marco Carbone, Kohei Honda, Nobuko Yoshida
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2007)

This paper proposes a calculus for describing communication-centred programs and discusses its use through a formal description of several use cases from real business protocols. The formalism, called global calculus, aims at representing global message flows as structured communications. The global calculus originates from the Choreography Description Language (CDL), a web service description language developed by W3C's WS-CDL Working Group. Its type discipline is based on session types which have been studied over long years in the context of the @p-calculus [Honda, K., V. Vasconcelos and M. Kubo, Language primitives and type disciplines for structured communication-based programming, in: ESOP'98, LNCS 1381, 1998, pp. 22-138; Dezani-Ciancaglini, M., D. Mostrous, N. Yoshida and S. Drossopoulou, Session Types for Object-Oriented Languages, in: Proceedings of ECOOP'06, LNCS, 2006; Vasconcelos, V., A. Ravara and S.J. Gay, Session types for functional multithreading., in: CONCUR'04, LNCS 3170, 2004, pp. 497-511; Bonelli, E., A.B. Compagnoni and E.L. Gunter, Correspondence assertions for process synchronization in concurrent communications., JFP 15 (2005), pp. 219-247]. Session types offer a high-level abstraction and articulation for complex communication behaviours, and play a fundamental role to guide the programmer towards a clear, well-structured description of business protocols.
Standardization and testing of implementations of mathematical functions in floating point numbers
Authors: V. V. Kuliamin
Venue: Programming and Computing Software (2007)

Requirements definition and test suites development for implementations of mathematical functions in floating point arithmetic in the framework of the IEEE 754 standard are considered. A method based on this standard is proposed for defining requirements for such functions. This method can be used for the standardization of implementations of such functions; this kind of standardization extends IEEE 754. A method for designing test suites for the verification of those requirements is presented. The proposed methods are based on specific properties of the representation of floating point numbers and on some features of the functions under examination.
Job Management in WebCom
Authors: Neil Cafferkey, Philip D. Healy, David A. Power, John P. Morrison
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

WebCom is a metacomputer based on the Condensed Graphs model of computing. Within this model, applications are represented as directed acyclic graphs with the nodes representing tasks and arcs their sequencing constraints. This paper presents the job management system used in WebCom. We describe the techniques required to apply common job management concepts, such as suspension, migration and monitoring, to the execution of applications expressed as Condensed Graphs.
Performance Modelling of Finite Capacity Queues with Complete Buffer Partitioning Scheme for Bursty Traffic
Authors: Shakeel Ahmad, Irfan Awan, Bashir Ahmad
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Finite buffer queues under complex management schemes are of great importance towards effective congestion control and quality of service (QoS) provision in the telecommunication networks. This paper analyses a single server G/G/1/N censored queue with R(R \geqslant 2) traffic classes under complete buffer partitioning scheme and first come first served (FCFS) service discipline. A finite capacity vector, N, represents the capacitiy of partitions for each class (N_1, N_2, ...,N_R). The forms of the state probabilities, as well as basic performance measures such as blocking probability are analytically established at equilibrium via appropriate mean value constraints based on the principle of maximum entropy (ME). Typical numerical experiments are included to illustrate the credibility of the proposed analysis in the context of Generalised Exponential (GE)-type queues.
Deans of engineering and deans of education: best practices in collaborations on campus
Authors: D. Gorham
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

The need for a technologically literate citizenry is increasing with the rapid innovations occurring in technology. Pre-college schools and districts are not able to stay abreast of these innovations. Working together, university engineering schools and education schools are in a position to impact the level of technological literacy among pre-college students and current and future teachers and engineers. This paper showcases outreach program resulting. from on-campus collaborations that impact the pre-college community. The authors describe these and discuss how they overcame the barriers and constraints that arise when any new program is undertaken. They offer guidance on how schools of engineering and education can work collaboratively to increase the level of technological literacy among the pre-college community.
Using robots in an undergraduate artificial intelligence course: an experience report
Authors: A. N. Kumar
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

In this paper, we report our experience using robots in the artificial intelligence course we taught in Fall 2000. Our objective was to use robots to reinforce the traditional concepts of search and expert systems. We wanted the robots to be simple to build, yet powerful enough to illustrate AI concepts. In this paper, we discuss our choice of robot, describe the projects we assigned and list the problems our students encountered carrying out those projects. We surveyed our class regarding the use of robots in this course at the end of the semester. We discuss the results of this survey, which we believe, make a strong case for using robots in the AI course.
Bridging Business Value Models and Process Models in Aviation Value Webs via Possession Rights
Authors: Vincent Pijpers, Jaap Gordijn
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

While exploring value webs -cooperating enterprises- it is common to view such webs from multiple perspectives: (1) the business value perspective, (2) the business process perspective, and (3) the information system perspective. The value perspective explains why a web can exist from a commercial perspective, whereas the process perspective shows the interacting processes of enterprises and the IT perspectives shows the supporting IT architecture. These perspectives each take a different view on the same phe- nomenon: the value web. Because the phenomenon is for each viewpoint the same the perspectives need to be consis- tent. This paper introduces an approach to arrive at a busi- ness process model of a value web that is consistent with a business value model of the same value web. We propose a step-wise approach that starts with considering the inde- pendent transfer of ownership right of a value object and the actual object itself, and finally considers time ordering of these transfers. We illustrate our approach using an in- dustrial strength case study in the aviation sector.
Investigations on inter-speaker variability in the feature space
Authors: R. Haeb-Umbach
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

We apply Fisher variate analysis to measure the effectiveness of speaker normalization techniques. A trace criterion, which measures the ratio of the variations due to different phonemes compared to variations due to different speakers, serves as a first assessment of a feature set without the need for recognition experiments. By using this measure and by recognition experiments we demonstrate that cepstral mean normalization also has a speaker normalization effect, in addition to the well-known channel normalization effect. Similarly vocal tract normalization (VTN) is shown to remove inter-speaker variability. For VTN we show that normalization on a per sentence basis performs better than normalization on a per speaker basis. Recognition results are given on Wall Street Journal and Hub-4 databases.
Analytic Model of IEEE 802.15.4 with Download Traffic
Authors: Tae Ok Kim, Jin Soo Park, Bong Dae Choi
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

This paper proposes an analytical model of IEEE 802.15.4, which is a standard toward low complexity, low power consumption and low data rate wireless data connectivity. In this paper, we concentrate on the MAC performance of the IEEE 802.15.4 LR-WPAN with non-beacon mode and non-saturated condition in a star topology. Our approach is to model stochastic behavior of one device as a discrete time Markov chain. We propose an analytical model considering only download traffic.We obtain five performance measures : throughput, packet delay, number of backoff, energy consumption and packet loss probability. Our results are used to find optimal number of devices with some constraints on these measures.
Blind channel estimation for CDMA systems: an induced cyclostationarity approach
Authors: W. Hachem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

The previously introduced transmitter induced cyclostationarity (TIC) techniques are applied to the CDMA uplink blind identification problem. In the proposed transmission model, the spreading code vectors are periodic, each user having a period of his own. As a consequence, a cyclic covariance function is associated to each user. This function generates a structured signal subspace which depends only on the transfer function of this user. The approach leads to clear and mild identifiability conditions. An identification algorithm is described and its theoretical asymptotic performance is presented. Simulations and comparisons with the existing stationary subspace techniques are provided. The algorithm is particularly adapted to systems where the number of users is close to the spreading factor.
Spectral graph-theoretic approach to 3D mesh watermarking
Authors: Emad E. Abdallah, A. Ben Hamza, Prabir Bhattacharya
Venue: Proceedings of Graphics Interface 2007 (2007)

We propose a robust and imperceptible spectral watermarking method for high rate embedding of a watermark into 3D polygonal meshes. Our approach consists of four main steps: (1) the mesh is partitioned into smaller sub-meshes, and then the watermark embedding and extraction algorithms are applied to each sub-mesh, (2) the mesh Laplacian spectral compression is applied to the sub-meshes, (3) the watermark data is distributed over the spectral coefficients of the compressed sub-meshes, (4) the modified spectral coefficients with some other basis functions are used to obtain uncompressed watermarked 3D mesh. The main attractive features of this approach are simplicity, flexibility in data embedding capacity, and fast implementation. Extensive experimental results show the improved performance of the proposed method, and also its robustness against the most common attacks including the geometric transformations, adaptive random noise, mesh smoothing, mesh cropping, and combinations of these attacks.
Applying Animation to the Visual Analysis of Financial Time-Dependent Data
Authors: Tatiana Tekusova, Jorn Kohlhammer
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

For decades, financial analysts have strived to use modern data visualization tools to improve the timeliness and quality of their analysis. As the amount of data to be processed increases rapidly and requirements on quality of financial analysis rise, the demand for analysis support systems grows. We present a system for the visual analysis of large amounts of time-dependent data using animation. For each data entity, indicators are presented in a scatter-plot framework, displaying the correlation between them. The design of the glyphs illustrates additional data dimensions. The system uses animation to handle the time-dimension of the data. It offers various features, such as focus, zoom, details on demand and time period selection to support the analysis. Financial indicators are used to demonstrate the usability of the system. The animation proves to be a powerful tool for analysing time-dependent processes in cross-sectional data sets and discovering patterns in the data.
Ubiquitous memory introspection
Authors: Qin Zhao, Rodric Rabbah, Saman Amarasinghe, Larry Rudolph, Weng-Fai Wong
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Modern memory systems play a critical role in the performance of applications, but a detailed understanding of the application behavior in the memory system is not trivial to attain. It requires time consuming simulations and detailed modeling of the memory hierarchy, often using long address traces. It is increasingly possible to access hardware performance counters to count relevant events in the memory system, but the measurements are coarse-grained and better suited for performance summaries than providing instruction level feedback. The availability of a low cost, online, and accurate methodology for deriving finegrained memory behavior profiles can prove extremely useful for runtime analysis and optimization of programs. This paper presents a new methodology for Ubiquitous Memory Introspection (UMI). It is an online and lightweight methodology that uses fast mini-simulations to analyze short memory access traces recorded from frequently executed code regions. The simulations provide profiling results at varying granularities, down to that of a single instruction or address. UMI naturally complements runtime optimizations and enables new opportunities for online memory specific optimizations. We present a prototype runtime system implementing UMI. The prototype has an average runtime overhead of 14%. This overhead is only 1% more than a state of the art binary instrumentation tool. We used 32 benchmarks, including the full suite of SPEC CPU2000 benchmarks, for evaluation. We show that the mini-simulations accurately reflect the cache performance of two existing memory systems, an Intel Pentium 4 and an AMD Athlon MP (K7). We also demonstrate that UMI predicts delinquent load instructions with an 88% rate of accuracy for applications with a relatively high number of cache misses, and 61% overall. The online profiling results are used at runtime to implement a simple software prefetching strategy that achieves an overall speedup of 64% in the best case.
Design time analysis of multiagent protocols
Authors: Pınar Yolum
Venue: Data Knowledge Engineering (2007)

Interaction protocols enable agents to communicate with each other effectively. Whereas several approaches exist to specify interaction protocols, none of them has design tools that can help protocol designers catch semantic protocol errors at design time. As research in networking protocols has shown, flawed specifications of protocols can have disastrous consequences. Hence, it is crucial to systematically analyze protocols in time to ensure effective specification. This paper first studies and formalizes important generic properties of commitment protocols that can ease their effective and consistent development significantly. Next, we identify robustness properties of protocols that are useful in determining the applicability of protocols in different settings. Since these properties are formal, they can easily be incorporated in a software tool to (semi-)automate the design and specification of commitment protocols. Where appropriate we provide algorithms that can directly be used to check these properties in such a design tool.
Sharing between translation units in C++ program databases
Authors: Samuel C. Kendall, Glenn Allin
Venue: Proceedings of the 6th conference on USENIX Sixth C++ Technical Conference - Volume 6 (1994)

A C++ program database represents information about C++ code, typically to enable program browsing or debugging. Such databases can grow very large. The growth is fundamentally due to the translation unit (TU) program structure C++ inherited from C: a naively designed data-base will consist largely of representations of redundant or unused code from header files. This paper measures the effect of some techniques for shrinking this naively designed data-base: the elision of unused entities from a TU, and the sharing or linking (generically, the combination) of redundant entities across TUs. We also measure the overhead imposed by the segregation of class types with external linkage from those with internal linkage. We define and measure these techniques for our own database, which was designed with very specific requirements. We also discuss techniques and organizations used in other program databases to save space: sharing at header file granularity; ruthless simplification of the data-base; and lazy loading of data into the database. Finally, we note the potential problems associated with independently implemented translators feeding into the same database.
A Stochastic Model for Video and its Information Rates
Authors: Arthur L. da Cunha, Minh Do, Martin Vetterli
Venue: Proceedings of the 2007 Data Compression Conference (2007)

We propose a stochastic model for video and compute its information rates. The model has two sources of information representing ensembles of camera motion and visual scene data (i.e. "realities"). The sources of information are combined generating a vector process that we study in detail. Both lossless and lossy information rates are derived. The model is further extended to account for realities that change over time. We derive bounds on the lossless and lossy information rates for this dynamic reality model, stating conditions under which the bounds are tight. Experiments with synthetic sources suggest that in the presence of scene motion, simple hybrid coding using motion estimation with DPCM can be suboptimal relative to the true rate-distortion bound.
Towards Automatic Traffic Classification
Authors: Zhaohong Lai, Alex Galis, Miguel Rio, Chris Todd
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Classification of network traffic recently has attracted a great deal of interest as it plays important roles in many areas such as traffic engineering, service class mapping, network management etc. One of the challenging issues for existing detection schemes is that they need prior manual analysis to detect unknown traffic, which is infeasible to cope with the fast growing number of new applications. In this paper, we propose an automatic traffic classification scheme, which is realised by managing traffic detection knowledge with the use of ontologies on the one hand, while developing the self-learning model on traffic detection according to ontologies on the other hand. Also, based on two scenarios, the experiment results demonstrate the automated detection capability for the proposed scheme.
AC: Cluster Based Secure Routing Protocol for WSN
Authors: Rampur Srinath, A. Vasudev Reddy, R. Srinivasan
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Wireless sensor networks (WSN) consist of small nodes with sensing, computation and wireless communication capabilities. Increasing computing and wireless communication capabilities have expanded the role of sensor from mere information dissemination to more demanding task as sensor fusion, classification, collaborative target tracking etc. WSN facilitate monitoring and controlling of physical environment from remote location with better accuracy. Recent advances in WSN have lead to many new protocols specially designed for sensor networks. Many routing protocols have been proposed, energy awareness is an essential consideration but none of them have been designed with security as goal. In particular, we believe that some kind of security is necessary for WSN. In this paper we describe a simple secure algorithm that is an enhancement to the functionality of cluster based routing protocol.
Interactive presentation: Towards a methodology for the quantitative evaluation of automotive architectures
Authors: Patrick Popp, Marco Di Natale, Paolo Giusto, Sri Kanajan, Claudio Pinello
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Architecture design is a critical stage of the Electronics/Controls/Software (ECS) -based vehicle design flow. Traditional approaches relying on component-level design and analysis are no longer effective as they do not always allow for the quantitative evaluation of properties arising from the composition of subsystems. This paper presents a system level architecture design methodology that is supported by tools and methods for the quantitative evaluation of key metrics of interest related to timing, dependability and cost. An example of its application to a by-wire system case study is presented, and the challenges faced in its application in the context of the actual development process are discussed.