ppxscal/embedding_network huggingface dataset:
Real-time monitoring of SIP infrastructure using message classification
Authors: Arup Acharya, Xiping Wang, Charles Wright, Nilanjan Banerjee, Bikram Sengupta
Venue: Proceedings of the 3rd annual ACM workshop on Mining network data (2007)

Session Initiation Protocol (SIP) is a control-plane protocol for multiple services such as VoIP, Instant Messaging and Presence, and in addition, is key to IP Multimedia Subsystem (IMS). A SIP message consists of plain-text headers and their corresponding values, which are used to route the message between one or more endpoints, resulting in a media session. These headers and values are often transformed/re-written at intermediate SIP servers ("proxies"). It is important to monitor the flow and transformation of such messages in real-time, for functional testing of a SIP overlay network containing malfunctioning or ill-configured SIP entities, or for efficient run-time SIP network operation, including problem determination and load balancing. Towards that end, we have designed and implemented a programmable in-kernel Linux SIP message classification engine. The classifier can be configured to intercept incoming and outgoing SIP messages from a server, extract appropriate message meta-data including distinguishing header-value pairs and their transformations, and forward the same to a monitoring engine. The engine collates this information from different classifiers across the network, to infer the state of a SIP call on individual servers on the call path as well as aggregated call-state.
Speech translation: coupling of recognition and translation
Authors: H. Ney
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

In speech translation, we are faced with the problem of how to couple the speech recognition process and the translation process. Starting from the Bayes decision rule for speech translation, we analyze how the interaction between the recognition process and the translation process can be modelled. In the light of this decision rule, we discuss the already existing approaches to speech translation. None of the existing approaches seems to have addressed this direct interaction. We suggest two new methods, the local averaging approximation and the monotone alignments.
An algorithm to estimate mean vehicle speed from MPEG Skycam video
Authors: Xiaodong Yu, Ping Xue, Lingyu Duan, Qi Tian
Venue: Multimedia Tools and Applications (2007)

With low computation cost, motion vectors can be readily extracted from MPEG video streams and processed to estimate vehicle motion speed. A statistical model is proposed to model vehicle speed and noise. In order to achieve high estimation accuracy and also study the limitations of the proposed algorithm, we quantitatively evaluated four parameters used in our algorithm: temporal filter window size T, video resolution R v (CIF/QCIF), motion vector frame distance m, and video bit-rates. Our experiments showed that the mean vehicle speed can be estimated with high accuracy, up to 85 to 92% by proper spatial and temporal processing. The proposed algorithm is especially suitable for Skycam-based application, where the traditional tracking-based or virtual-loop-based approaches perform poorly because of their requirements of high-resolution images. Although extensive work has been done in extracting motion information directly from MPEG video data in compressed domain, to our best knowledge, this paper is the very first work in which stationary motion (speed) of moving objects can be estimated with high accuracy directly from MPEG motion vectors. Furthermore the proposed method is not limited to vehicle speed estimation by nature and it can be applied to other applications where the stationary motion assumption is satisfied.
Parametric localisation of space-time distributed sources
Authors: G. A. Fabrizio
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

An explicit connection is made between the problem of jointly estimating the parameters of an autoregressive moving-average (ARMA) model which best fits the unbiased sample auto-correlation sequence (ACS) of the data in a least squares sense and the problem of estimating the parameters of superimposed exponentially damped complex sinusoids in additive noise. The mathematical equivalence between the two problems is exploited to derive a novel closed form technique which can be used to parametrically localise one or more space-time distributed sources received by a uniform linear array (ULA) in a computationally attractive manner. The new method is experimentally validated using experimental data from the receiving antenna array of the Jindalee over-the-horizon (OTH) radar located near Alice Springs in central Australia.
Continuing engineering education, the answer to the ever-increasing pace of technology renewal and global economy
Authors: O. Zia
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

For universities and colleges all around the world continuing education is becoming a task of increasing importance. The paper attempts to create a connection between undergraduate degree programmes and continuing professional development. The main objective is to examine how university/college based continuing engineering education (CEE) might best prepare engineers to manage the full spectrum of change, changes that are associated primarily with the fast pace of technology renewal and the new global economy. The relationship between undergraduate degree teaching and continuing professional development (CPD) is examined. The goal is to advance the idea that undergraduate curricula should be designed with CPD and CEE in mind. It is shown that it can be so designed with careful building in of certain features. 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
Designing Tool Support for Translating Use Cases and UML 2.0 Sequence Diagrams into a Coloured Petri Net
Authors: Joao M. Fernandes, Simon Tjell, Jens Baek Jorgensen, Oscar Ribeiro
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Using a case study on the specification of an elevator controller, this paper presents an approach that can translate given UML descriptions into a Coloured Petri Net (CPN) model. The UML descriptions must be specified in the form of Use Cases and UML 2.0 Sequence Diagrams. The CPN model constitutes one single, coherent and executable representation of all possible behaviours that are specified by the given UML artefacts. CPNs consitute a formal modelling language that enables construction and analysis of scalable, executable models of behaviour. A combined use of UML and CPN can be useful in several projects. CPN is well supported by CPN Tools and the work we present here is aimed at building a CPN Tools front-end engine that implements the proposed translation.
Pseudo-Voter Identity (PVID) Scheme for e-Voting Protocols
Authors: Orhan Cetinkaya, Ali Doganaksoy
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

Voter anonymity, also known as unlinkability, is the primary requirement to satisfy privacy in e-voting protocols. Up until now, e-voting protocols have tried to make communication channels anonymous in order to keep voter's identity hidden and many protocols have been proposed to construct anonymous communication channels. On the other hand, instead of making channel anonymous if we provide anonymous credentials to voter, we can easily hide voter's identity without any need of anonymous channels. This paper introduces Pseudo-Voter Identity (PVID) scheme based on blind signature in order to achieve anonymity in e-voting protocols. Blind signature is applied on pseudo identities selected by voter. Therefore voter obtains blindly signed pseudo identities namely PVIDs and uses them throughout the entire communication with the authorities. By using PVID scheme, e-voting protocols do not need anonymous channels anymore. This work aims at bringing unlinkable pseudo-voter identities based on blind signature bear on anonymous e-voting protocols.
Analysis by synthesis speech coding with generalized pitch prediction
Authors: P. Mermelstein
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

A new analysis-by-synthesis speech coding structure is presented for high-quality speech coding in the 4 to 8 kb/s range. CELP with generalized pitch prediction (GPP-CELP) differs from classical code-excited linear prediction (CELP) in that for voiced segments it is the speech signal that is decomposed into a component predictable with the aid of the adaptive codebook (ACB) and a nonpredictable aperiodic component, not the LPC residual. The spectrum of the aperiodic component is estimated by linear-prediction analysis. An approximation to the aperiodic component is synthesized from a stochastic codebook of sparse pulse sequences and its spectrum is shaped by the LPC synthesis filter. The ACB contains samples of the past reconstructed signal, low-passed to increase the pitch prediction gain. For voiced segments the new structure yields higher pitch prediction gain and lower linear-prediction gain than classical CELP. Subjective and objective comparisons reveal significant advantages for GPP-CELP over classical CELP.
A bound on the label complexity of agnostic active learning
Authors: Steve Hanneke
Venue: Proceedings of the 24th international conference on Machine learning (2007)

We study the label complexity of pool-based active learning in the agnostic PAC model. Specifically, we derive general bounds on the number of label requests made by the A2 algorithm proposed by Balcan, Beygelzimer & Langford (Balcan et al., 2006). This represents the first nontrivial general-purpose upper bound on label complexity in the agnostic PAC model.
Quantified Equality Constraints
Authors: Manuel Bodirsky, Hubie Chen
Venue: Proceedings of the 22nd Annual IEEE Symposium on Logic in Computer Science (2007)

An equality template (also equality constraint language) is a relational structure with infinite universe whose relations can be defined by boolean combinations of equalities. We prove a complete complexity classification for quantified constraint satisfaction problems (QCSPs) over equality templates: these problems are in L (decidable in logarithmic space), NP-complete, or PSPACE-complete. To establish our classification theorem we combine methods from universal algebra with concepts from model theory.
Efficient camera motion and 3D recovery using an inertial sensor
Authors: Martin Labrie, Patrick Hebert
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

This paper presents a system for 3D reconstruction using a camera combined with an inertial sensor. The system mainly exploits the orientation obtained from the inertial sensor in order to accelerate and improve the matching process between wide baseline images. The orientation further contributes to incremental 3D reconstruction of a set of feature points from linear equation systems. The processing can be performed online while using consecutive groups of three images overlapping each other. Classic or incremental bundle adjustment is applied to improve the quality of the model. Test validation has been performed on object and camera centric sequences.
Parametric Bernstein polynomial for least squares design of 3-D wavelet filter banks
Authors: D. B. H. Tay
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

The design of non-separable 3-D biorthogonal wavelet filter banks is addressed in this paper. The sampling is on the FCO (face centered orthorhombic) lattice and the ideal low-pass filter's passband shape is the TRO (truncated octahedron). We introduce a 3-D parametric Bernstein polynomial that preserves biorthogonality and gives a good approximation to the TRO shape. Furthermore, filters with arbitrarily flat frequency response for giving regular wavelet systems are readily obtainable. The free parameters of the Bernstein polynomial can be chosen to sharpen the frequency response of the filter. A least squares approach is employed for the design of the parameters. The design process is efficient as it involves solving linear equations and is non-iterative. This approach provides a trade-off mechanism between the sharpness of roll-off and the degree of flatness.
Cooperative learning at a commuter school and its implications for distance education
Authors: M. E. Ssemakula
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

A variety of social, economic and technological factors are converging to create increased demand for distance education. Consequently, enormous challenges are facing today's educational institutions, to reduce costs, improve access, and cater to a changing population more interested in lifelong learning using distance education. This societal change promises to have a profound impact on the traditional university system. Schools have responded by spawning a variety of methods and technologies for delivering distance education. This is in turn transforming how knowledge is delivered to students. Not only does the instructor need to learn how to use the new technologies, the nature and style of delivery of the course content itself has to be adapted to the new medium of delivery. It has become axiomatic that teamwork and cooperative learning are essential ingredients in engineering and engineering technology education. Cooperative learning becomes a challenge in a commuter school where the students are widely dispersed throughout the community and many of whom have significant out-of-school commitments including work and families. The paper describes strategies that were followed to promote cooperative learning at an urban commuter school where these challenges are a given. The author's experiences in adapting cooperative learning techniques to Web-enhanced classes, as well as live 2-way interactive television classes, with reflections on lessons learnt, are also given. 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
Entity Driven Task Software Framework for EIS
Authors: Yang Xi-Min, Xie Chang-Sheng, Ni Jin
Venue: Proceedings of the Second International Conference on Systems (2007)

Enterprise information systems are usually reappearance of enterprise business actions. However, surprisingly little research has been done on partition rules and implementation methods of enterprise business in enterprise systems. This paper begins with our presentation that enterprise information system can be abstracted to a scenario in which users could schedule the task suites of controlled entities under enterprise security mechanism. Then a novel framework for enterprise information system, named EDTSF (Entity Driven Task Software Framework), was proposed by means of updating some information system engineering methodology and technologies. The EDTSF can clearly implements enterprise business partition, and can also reduce coupling between data objects and task objects. At the same time, the EDTSF increases flexibility and expansibility of enterprise information systems by expanding service function of data object and reusing the scheduling mechanism at system level.
An Autonomic Service Discovery Mechanism to Support Pervasive Device Accessing Semantic Grid
Authors: Tao Guan, Ed Zaluska, David De Roure
Venue: Proceedings of the Fourth International Conference on Autonomic Computing (2007)

An important challenge of integrating pervasive devices into Grid environment to enhance pervasive device capabilities is that pervasive devices need to locate, find, select and invoke the appropriate Grid services in an autonomic and flexible way. However, at this stage, both Grid service description and discovery standards are not very sophisticated. Semantic web technology benefits the concept of Grid services on pervasive devices by adding machine-processable explicit knowledge into the interaction between pervasive devices and Grid services. In this paper, we have presented a semantic-based Grid service discovery mechanism to support pervasive device accessing Grid services. In order to protect personal privacy in the pervasive computing environment, a service discovery restricting mechanism is also built to ensure the service can automatically be hidden for unauthorized users.
Analog signal processing first [educational course]
Authors: R. W. Schafer
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The Department of Electrical and Computer Engineering at the University of Illinois recently adopted new undergraduate curricula. The most radical change was the introduction of ECE 210, Analog Signal Processing, in place of both the sophomore-level circuit analysis course and the junior-level signals and systems course. The new course combines core material from these traditional courses, along with applications such as AM radio and a modest laboratory component, in a way that improves both the students' understanding and their motivation. The new course still serves well as the base of the required curriculum and as a prerequisite for subsequent courses, while realizing savings in the early curriculum and allowing more time for advanced signal processing and systems courses in future semesters.
Looking Forward, Looking Back
Authors: Fred Douglis
Venue: IEEE Internet Computing (2007)

In his inaugural column, EIC Fred Douglis discusses changes to the Web throughout the past decade.
Nazca: A Geographic Location Service
Authors: Mio Suzuki, Teruaki Yokoyama, Takuji Iimura, Shigeru Kashihara, Takeshi Okuda, Suguru Yamaguchi
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet Workshops (2007)

With the great expansion of advanced wireless technologies, users can now conveniently access the Internet from almost anywhere. We consider geographic information to be an important metric for supporting people's daily lives because it has a strong relationship with their activities in the real world. In this paper we propose a database system for providing a geographic location service using the Internet. It processes the geographic information obtained from users via HTTP access. Since we have designed the system as a simple Web-based service, users can access the information easily. Our proposal contributes to creating geographic-oriented applications. We also introduce two demonstration systems using our database system.
Resolving ambiguity in depth extraction for motion capture using genetic algorithm
Authors: T. C. Fogarty, Tong Lee
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

There is considerable interest in motion capture from an image sequence taken from a video camera. However, since the images only consist of 2D information, the distance of an object from the image plane cannot be determined uniquely unless some constraints are imposed. Coplanar motion is a popular constraint adopted for this purpose. If the captured motion is not coplanar, only two possible solutions can be obtained at the best even the actual size of the object is given. Therefore, the motion cannot be captured without resolving the distances of each control point from the image plane. By assuming smooth transition, the problem is formulated as one minimizing the transition between image frames and the application of GA to solve this optimization problem is proposed.
Building high accuracy bloom filters using partitioned hashing
Authors: Fang Hao, Murali Kodialam, T. V. Lakshman
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

The growing importance of operations such as packet-content inspection, packet classification based on non-IP headers, maintaining flow-state, etc. has led to increased interest in the networking applications of Bloom filters. This is because Bloom filters provide a relatively easy method for hardware implementation of set-membership queries. However, the tradeoff is that Bloom filters only provide a probabilistic test and membership queries can result in false positives. Ideally, we would like this false positive probability to be very low. The main contribution of this paper is a method for significantly reducing this false positive probability in comparison to existing schemes. This is done by developing a partitioned hashing method which results in a choice of hash functions that set far fewer bits in the Bloom filter bit vector than would be the case otherwise. This lower fill factor of the bit vector translates to a much lower false positive probability. We show experimentally that this improved choice can result in as much as a ten-fold increase in accuracy over standard Bloom filters. We also show that the scheme performs much better than other proposed schemes for improving Bloom filters.
On a New Outlier Rejection Technique
Authors: C. Thibeault
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

This paper presents a novel approach to reject outliers based on parametric measurements, namely quiescent current and IC speed estimates. Unlike the existing multi-parameter or I_DDQ-based techniques which use additional measurements to estimate the expected healthy I_DDQ response, we focus on the variance to reject outliers. We take advantage of the correlation between the two types of measurements and of the fact that speed estimate measurements are more reliable than leakage ones in order to evaluate the acceptable current variation level. For that, we derive approximate variance equations from basic current and delay equations. Using these variance equations, we are able to identify current variations that cannot be justified by normal process variations, based on simple outlier rejection criteria. This approach is developed to be used as a pre-processing tool to other post-processing techniques. Results are promising.
Mental models and programming aptitude
Authors: Michael E. Caspersen, Kasper Dalgaard Larsen, Jens Bennedsen
Venue: ACM SIGCSE Bulletin (2007)

Predicting the success of students participating in introductory programming courses has been an active research area for more than 25 years. Until recently, no variables or tests have had any significant predictive power. However, Dehnadi and Bornat claim to have found a simple test for programming aptitude to cleanly separate programming sheep from non-programming goats. We briefly present their theory and test instrument. We have repeated their test in our local context in order to verify and perhaps generalise their findings, but we could not show that the test predicts students' success in our introductory program-ming course. Based on this failure of the test instrument, we discuss various explanations for our differing results and suggest a research method from which it may be possible to generalise local results in this area. Furthermore, we discuss and criticize Dehnadi and Bornat's programming aptitude test and devise alternative test instruments.