ppxscal/embedding_network huggingface dataset:
A Location-Aware Mobile Call Handling Assistant
Authors: Ibrahim Bokharouss, Wayne Wobcke, Yiu-Wa Chan, Andrew Limaru, Anna Wong
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

With the near ubiquity of mobile phones, people are reachable almost anywhere and at any time. At the same time we see an increasing need for people to limit their in- teractions on the mobile phone, to control (within socially acceptable bounds) when they are reachable and by whom. The user's location plays a significant role herein. Present mobile phones typically provide static means for manag- ing reachability, such as manual profiles. In this paper, we present a location-aware call handling assistant as a dy- namic solution. The assistant runs on mobile devices and enables users to manage calls based on their current con- text (in particular, their location and activity, the date and time, and the caller and caller's group). The system ex- ploits Bluetooth technology for location determination and for user modelling, a new rule-based technique, Prioritized Ripple Down Rules, which gives the user a high level of con- fidence in the system's behaviour. We discuss the results of a small-scale user study in which the mobile call handling as- sistant was simulated on a PDA.
Automated Software Testing and Analysis: Techniques, Practices and Tools
Authors: Zhi Quan Zhou, Bernhard Scholz, Giovanni Denaro
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

As computer systems are permeating our society in daily life and are performing an increasing number of critical tasks, research in software testing and analysis has become of paramount importance. Although we are currently not able to prove program correctness for real-world applications, rigorous software development processes in combination with testing provides us with confidence in the quality of software. Software testing and analysis, however, is a very involved task. As the size and complexity of software continue to grow, manual testing becomes very tedious. Automation of software testing and tool support for testing, therefore, have been emerging as a key technology to quality assurance of today's software industry. As research in software testing and analysis has become increasingly active, there is also a growing trend towards combining formal methods and informal techniques for program verification.
AMI-SME: An Exploratory Approach to Knowledge Retrieval for SME's
Authors: Piotr Gawrysiak, Henryk Rybinski, Lukasz Skonieczny, Przemyslaw Wiech
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

This paper describes an ontology supported software prototype that combines the advantages of existing Internet search engines with modern text analysis functionalities and an intelligent storage system for search result documents and knowledge items. Designed as a tool supporting the information retrieval process in small and medium enterprises, it becomes a research toolkit for users gathering essential business information.
Fault simulation and test generation for small delay faults
Authors: Duncan M. Walker
Venue:  (2006)

Delay faults are an increasingly important test challenge. Traditional delay fault models are incomplete in that they model only a subset of delay defect behaviors. To solve this problem, a more realistic delay fault model has been developed which models delay faults caused by the combination of spot defects and parametric process variation. According to the new model, a realistic delay fault coverage metric has been developed. Traditional path delay fault coverage metrics result in unrealistically low fault coverage, and the real test quality is not reflected. The new metric uses a statistical approach and the simulation based fault coverage is consistent with silicon data. Fast simulation algorithms are also included in this dissertation. The new metric suggests that testing the K longest paths per gate (KLPG) has high detection probability for small delay faults under process variation. In this dissertation, a novel automatic test pattern generation (ATPG) methodology to find the K longest testable paths through each gate for both combinational and sequential circuits is presented. Many techniques are used to reduce search space and CPU time significantly. Experimental results show that this methodology is efficient and able to handle circuits with an exponential number of paths, such as ISCAS85 benchmark circuit c6288. The ATPG methodology has been implemented on industrial designs. Speed binning has been done on many devices and silicon data has shown significant benefit of the KLPG test, compared to several traditional delay test approaches.
Instruction-based memory distance analysis and its application
Authors: Steven Carr, Zhenlin Wang
Venue:  (2006)

With the widening gap between processor and memory speeds, program performance has become increasingly dependent upon the effective use of a machine's memory hierarchy. Cache optimization and load speculation are two important approaches to improve memory system performance. Researchers in both areas have been eagerly seeking novel avenues to analyze memory behaviors in order to optimize programs with complex memory access patterns which can not be handled well with traditional approaches. We propose a novel analysis framework to study the behaviors of memory references, and apply the framework to predict cache misses and to determine memory dependences for load speculation. We examine the notation of memory distance as it is applied to the instruction space of a program and to the optimization of the memory hierarchy. Memory distance is defined as a dynamic quantifiable distance in terms of memory references between two accesses to the same memory location. We build an effective framework to analyze and predict the instruction-based memory distance. Evaluation on a set of SPEC CPU2000 benchmarks shows that our framework can accurately predict memory distance distribution of an instruction when program input changes. Furthermore, we propose a novel approach to investigate memory distance on paths leading to an instruction. Applying our analysis framework, we propose a memory-distance-based model to predict data locality for memory instructions in a program when input changes. Our model first uses the predicted memory distance to predict the cache miss rates for an instruction. Based on the predicted miss rates, our model then identifies the program's critical instructions---the set of high miss instructions whose cumulative misses account for 95% of the L2 cache misses in a program. Our experiments show that memory distance analysis can accurately predict L1 and L2 miss rates, and effectively identify critical instructions in both integer and floating-point programs. Based on memory distance analysis, we propose a compiler/architecture cooperative approach for memory disambiguation in out-of-order superscalar processors. Our approach determines memory dependences between loads and stores statically through an extensive analysis of the instruction-based memory distance. By means of instruction annotation, the dependence information is then communicated to the micro-architecture for the processors to disambiguate memory addresses and make load speculation decisions accordingly. Compared with the state-of-the-art hardware-based schemes, the proposed approach consumes much less on-chip memories while achieving a comparable or better performance. To summarize, this dissertation studies the memory access behaviors of programs. Through memory distance analysis, we propose a framework to predict memory behaviors when program input changes. When applied to data locality analysis and memory disambiguation, our framework produces promising results.
Deconvolution of ultrasonic nondestructive evaluation signals using higher-order statistics
Authors: L. Ghouti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

In ultrasonic nondestructive evaluation (NDE) of materials, pulse echo measurements are masked by the characteristics of the measuring instruments, the propagation paths taken by the ultrasonic pulses, and are corrupted by additive noise. Deconvolution operation seeks to undo these masking effects and extract the defect impulse response which is essential for identification. We show that the use of higher-order statistics (HOS)-based deconvolution methods is more suitable to unravel the aforementioned effects. Synthetic and real ultrasonic data obtained from artificial defects is used to show the improved performance of the proposed technique over conventional ones, based on second-order statistics (SOS), commonly used in ultrasonic NDE. 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
The Choice of Mesh Structure in Computer Networks
Authors: Leszek Koszalka
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The mesh-connected architecture is widely used in multi-computers and computer networks for parallel and distributed computing. In such architectures each executor (processor or computer) has up to four neighbors. This condition can be naturally (physically) met in dedicated supercomputers, but the problem arises when there is a need to implement this architecture for computer networks, such as Internet, where each computer is connected to each other. The aim of this work is to provide an algorithm to create an efficient mesh-structure, choosing the best possible connections between considered nodes of a computer network. The proposed algorithms AGAMS is based on the genetic algorithm idea. Some results of investigations of properties of AGAMS are discussed.
Learning from Reflection: Practitioners as Adult Learners
Authors: Jocelyn Armarego
Venue: Proceedings of the 20th Conference on Software Engineering Education & Training (2007)

Although all learning in higher education is considered adult learning, there are characteristics of practitioners returning to formal education that sets this group aside. This paper looks at these characteristics as exemplified in a reflective journal -- maintained as a component of a course in RE, taught in a Studio Learning environment. The results of student reflection shows that while, unlike school leavers, the motivation and will to succeed can transcend every obstacle, adult learners' approaches to study can impinge on their learning.
Service-Oriented E-Learning Platforms: From Monolithic Systems to Flexible Services
Authors: Declan Dagger, Alexander O'Connor, Seamus Lawless, Eddie Walsh, Vincent P. Wade
Venue: IEEE Internet Computing (2007)

The learning management system (LMS) has dominated Internet-based education for the past two decades. However, the traditional LMS is failing to keep pace with advances in Internet technologies and social interactions online. To support technological diversity, current frameworks such as the E-Learning Framework, the IMS Abstract Framework, and the Open Knowledge Initiative have defined the initial steps toward service-oriented e-learning platforms. Here, the authors discuss LMS evolution and present core challenges that must be addressed to achieve information interoperability in next-generation e-learning platforms.
Vehicular Mobility Simulation for VANETs
Authors: Marco Fiore, Jerome Harri, Fethi Filali, Christian Bonnet
Venue: Proceedings of the 40th Annual Simulation Symposium (2007)

During the last few years, continuous progresses in wireless communications have opened new research fields in computer networking, aimed at extending data networks connectivity to environments where wired solutions are impracticable. Among these, vehicular traffic is attracting a growing attention from both academia and industry, due to the amount and impor- tance of the related applications, ranging from road safety to traffic control, up to mobile entertainment. Vehicular Ad-hoc Networks (VANETs) are self-organized networks built up from moving vehicles, and are part of the broader class of Mobile Ad-hoc Networks (MANETs). Because of their peculiar char- acteristics, VANETs require the definition of specific network- ing techniques, whose feasibility and performance are usually tested by means of simulation. One of the main challenges posed by VANETs simulations is the faithful characterization of vehicular mobility at both macroscopic and microscopic levels, leading to realistic non-uniform distributions of cars and ve- locity, and unique connectivity dynamics. In this paper we first present and describe VanetMobiSim, a freely available gener- ator of realistic vehicular movement traces for networks simu- lators.Then, VanetMobiSim is validated by illustrating how the interaction between featured macro- and micro-mobility is able to reproduce typical phenomena of vehicular traffic.
A first year engineering student survey to assist recruitment and retention
Authors: M. R. Anderson-Rowland
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

In recent years the recruitment and retention of engineering students, especially underrepresented minorities and women have received increased attention in the United States. Underrepresented minorities and women are the largest untapped resources available to help maintain and/or increase engineering enrollments and to ensure a diverse engineering working force. In order to understand better and to serve their first-year students in the School of Engineering, a survey is administered to these students each semester at Arizona State University (ASU). In addition to basic demographics, the survey asks for information on when and why students chose to study engineering at ASU, what recruitment events they attended and which were most effective, how many contacts the student had with ASU, how many hours per week they work, and predictions of success in graduating from ASU with an engineering degree. The data is analyzed to give direction for more successful recruitment and retention efforts, including advisement about course and work loads. The results are further analyzed to determine if recruitment efforts have differential success when the target population is men, women, underrepresented minorities, students who considered another university, local residents, traditional-age, or community college transfer students. The results of this analysis are being used to guide recruitment and retention efforts of our engineering students, especially women and underrepresented minorities. While not exhaustive, this paper contains a discussion on several of the survey items. The survey, although developed at ASU, can be customized for any individual institution.
PHAS: a prefix hijack alert system
Authors: Mohit Lad, Dan Massey, Dan Pei, Yiguo Wu, Beichuan Zhang, Lixia Zhang
Venue: Proceedings of the 15th conference on USENIX Security Symposium - Volume 15 (2006)

In a BGP prefix hijacking event, a router originates a route to a prefix, but does not provide data delivery to the actual prefix. Prefix hijacking events have been widely reported and are a serious problem in the Internet. This paper presents a new Prefix Hijack Alert System (PHAS). PHAS is a real-time notification system that alerts prefix owners when their BGP origin changes. By providing reliable and timely notification of origin AS changes, PHAS allows prefix owners to quickly and easily detect prefix hijacking events and take prompt action to address the problem. We illustrate the effectiveness of PHAS and evaluate its overhead using BGP logs collected from RouteViews. PHAS is light-weight, easy to implement, and readily deployable. In addition to protecting against false BGP origins, the PHAS concept can be extended to detect prefix hijacking events that involve announcing more specific prefixes or modifying the last hop in the path.
Design and evaluation of a voice conversion algorithm based on spectral envelope mapping and residual prediction
Authors: A. Kain
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

The purpose of a voice conversion (VC) system is to change the perceived speaker identity of a speech signal. We propose an algorithm based on converting the LPC spectrum and predicting the residual as a function of the target envelope parameters. We conduct listening tests based on speaker discrimination of same/difference pairs to measure the accuracy by which the converted voices match the desired target voices. To establish the level of human performance as a baseline, we first measure the ability of listeners to discriminate between original speech utterances under three conditions: normal, fundamental frequency and duration normalized, and LPC coded. Additionally, the spectral parameter conversion function is tested in isolation by listening to source, target, and converted speakers as LPC coded speech. The results show that the speaker identity of speech whose LPC spectrum has been converted can be recognized as the target speaker with the same level of performance as discriminating between LPC coded speech. However, the level of discrimination of converted utterances produced by the full VC system is significantly below that of speaker discrimination of natural speech.
An SIR estimation method adequate to high data rate packet communication in W-CDMA system
Authors: Yuanxin Zhang, Jaemin Ahn, Deuk-Su Lyu
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

As the demand of down link high speed data packet service such as wireless Internet increases, the standardization for high speed downlink packet access (HSDPA) in wideband code division multiple access (WCDMA) system is in progress. HSDPA adopts adaptive modulation and coding (AMC) scheme, which changes the modulation level (for example, M-PSK, where M=4, 16, etc.) and channel coding rate adaptively to wireless channel conditions to maximize throughput. To adopt AMC, the receiver should measure the signal energy to interference power spectral density ratio (SIR) as the channel quality for feedback to the transmitter. The SIR estimation method, which has been used for the conventional voice services, was un-biased and had no problem in case of low power, low data rate, and low cell loading (i.e., single code transmission). However, the bias error of the conventional method increases as the transmitter has higher power, higher data rate, and more full loading (i.e., multi-code transmission), which are typical of the HSDPA service environment. To solve this problem, this paper proposes and verifies the validity of a SIR estimation method using the symbol patterns which are conventionally used to separate the pilot signals of transmit antennas. This paper also shows the method is always un-biased even with the HSDPA service environments.
Adaptive interpolation methods for spatiotemporal data
Authors: Peter Revesz
Venue:  (2006)

Interpolation methods are needed for spatiotemporal data sets to fill in missing data and predict the future. Spatiotemporal interpolation is more challenging than pure spatial or temporal interpolations, and currently there are only a few known spatiotemporal interpolation methods. We analyze spatiotemporal data sets by introducing spatial and temporal relationship strength measures for them. Based on the relative strengths of the spatial and the temporal relationships in the data sets, we classify them as being spatial-dominated or temporal-dominated. This analysis of spatiotemporal data sets allows us to introduce a class of adaptive spatiotemporal interpolation methods. An adaptive spatiotemporal interpolation method combines a spatial interpolation method with a temporal interpolation method in such a way that the degree of reliance on the two components is driven by the measured spatial and temporal relationship strengths. Hence a spatial-dominated spatiotemporal data set would be interpolated more like a spatial data set. Similarly, a temporal-dominated spatiotemporal data set would be interpolated more like a temporal data set. Adaptive spatiotemporal interpolation reduces in a flexible way the spatiotemporal interpolation problem to the problem of pure spatial and temporal interpolation. Adaptive reduction works in principle for both point-based and region-based spatiotemporal data sets. Although there are many point-based spatial interpolation methods, there is a lack of region-based spatial interpolation methods. As many spatiotemporal data sets are region-based, as a practical matter, we also propose two region-based variations on the well-known inverse distance weighting interpolation method. The first variation assigns uniform weights between neighbors and the second variation assigns weights proportional to the centroid distances. We also propose a new temporal interpolation method, called the exponential decay temporal interpolation method. Finally, we test the adaptive spatiotemporal interpolation methods on a spatial-dominated climate data set and on a temporal-dominated election data set.
Evaluating Aspect Mining Techniques: A Case Study
Authors: Chanchal Kumar Roy, Mohammad Gias Uddin, Banani Roy, Thomas R. Dean
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

Aspect mining aims at identifying cross-cutting concerns in existing systems and therefore advocates the adaption to an aspect-oriented design. This paper presents a case study examining three existing aspect mining techniques from the literature by applying them to four different open source java applications. We compare and evaluate the individual technique and confirm the findings of a previous study of combining different aspect mining techniques in order to get better results with less manual intervention.
The case for a session state storage layer
Authors: Benjamin C. Ling, Armando Fox
Venue: Proceedings of the 9th conference on Hot Topics in Operating Systems - Volume 9 (2003)

This paper motivates the need for a session state storage layer. Session state is used in a large class of applications. Existing session state storage solutions often rely on ad-hoc choices such as databases or file systems, and exhibit various drawbacks such as poor failure/recovery behavior or poor performance, often because the solutions are too general. We present a design for a simple, fast, scalable, and fault-tolerant session state store that we believe accurately addresses the needs of session state retrieval, while avoiding the drawbacks of existing solutions.
End-User Development Framework for Embedded System Applications
Authors: Miroslav Sveda
Venue: Proceedings of the 14th Annual IEEE International Conference and Workshops on the Engineering of Computer-Based Systems (2007)

This paper presents principles of an end-user development support for embedded system networking. The presented approach offers a design framework consisting of reusable patterns for Internet-based embedded system applications. The framework provides a development environment kernel that can be adapted for various embedded system application domains. It stems from (1) the IEEE 1451.1 smart transducer interface standard, which is an object-based networking model supporting group messaging, and (2) the Internet Protocol multicast communication, mediating efficient and unified access to distributed components through both wired and wireless intranets. As an example, this paper focuses on refinement of those concepts for smart sensor application development support and on their utilization for a gas pipes pressure measurement system as an application example. The paper brings this scheme in form suitable not only for framework builders, but also for end-user developers.