ppxscal/embedding_network huggingface dataset:
Data remanence in semiconductor devices
Authors: Peter Gutmann
Venue: Proceedings of the 10th conference on USENIX Security Symposium - Volume 10 (2001)

A paper published in 1996 examined the problems involved in truly deleting data from magnetic storage media and also made a mention of the fact that similar problems affect data held in semiconductor memory. This work extends the brief coverage of this area given in the earlier paper by providing the technical background information necessary to understand remanence issues in semiconductor devices. Data remanence problems affect not only obvious areas such as RAM and non-volatile memory cells but can also occur in other areas of the device through hot-carrier effects (which change the characteristics of the semiconductors in the device), electromigration (which physically alter the device itself), and various other effects which are examined alongside the more obvious memory-cell remanence problems. The paper concludes with some design and device usage guidelines which can be useful in reducing remanence effects.
SCFS: a UNIX filesystem for smartcards
Authors: Naomaru Itoi, Peter Honeyman, Jim Rees
Venue: Proceedings of the USENIX Workshop on Smartcard Technology on USENIX Workshop on Smartcard Technology (1999)

Smartcard software developers suffer from the lack of a standard communication framework between a workstation and a smartcard. To address this problem, we extended the UNIX filesystem to provide access to smartcard storage, which enables us to use files in a smartcard as though normal UNIX files, but with the additional security properties inherent to smart-cards.
Improving Performance via Post Track Analysis
Authors: L. M. Brown, Max Lu, Chiao-Fe Shu, Ying-li Tian
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

In this paper, we improve the effective performance of a surveillance system via post track analysis. Our system performs object detection via background subtraction followed by appearance based tracking. The primary outputs of the system however, are customized alarms which depend on the user's domain and needs. The ultimate performance therefore depends most critically on the Receiver Operating Characteristic curve of these alarms. We show that by strategically designing post tracking and alarm conditions, the effective performance of the system can be improved dramatically. This addresses the most significant error sources, namely, errors due to shadows, ghosting, temporally or spatially missing fragments and many of the false positives due to extreme lighting variations, specular reflections or irrelevant motion.
Optimistic parallelism requires abstractions
Authors: Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, L. Paul Chew
Venue: Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation (2007)

Irregular applications, which manipulate large, pointer-based data structures like graphs, are difficult to parallelize manually. Automatic tools and techniques such as restructuring compilers and run-time speculative execution have failed to uncover much parallelism in these applications, in spite of a lot of effort by the research community. These difficulties have even led some researchers to wonder if there is any coarse-grain parallelism worth exploiting in irregular applications. In this paper, we describe two real-world irregular applications: a Delaunay mesh refinement application and a graphics application thatperforms agglomerative clustering. By studying the algorithms and data structures used in theseapplications, we show that there is substantial coarse-grain, data parallelism in these applications, but that this parallelism is very dependent on the input data and therefore cannot be uncoveredby compiler analysis. In principle, optimistic techniques such asthread-level speculation can be used to uncover this parallelism, but we argue that current implementations cannot accomplish thisbecause they do not use the proper abstractions for the data structuresin these programs. These insights have informed our design of the Galois system, an object-based optimistic parallelization system for irregular applications. There are three main aspects to Galois: (1) a small number of syntactic constructs for packaging optimistic parallelism as iteration over ordered and unordered sets, (2)assertions about methods in class libraries, and (3) a runtime scheme for detecting and recovering from potentially unsafe accesses to shared memory made by an optimistic computation. We show that Delaunay mesh generation and agglomerative clustering can be parallelized in a straight-forward way using the Galois approach, and we present experimental measurements to show that this approach is practical. These results suggest that Galois is a practical approach to exploiting data parallelismin irregular programs.
An introductory design and innovation course at the University of Tennessee
Authors: J. R. Parsons, P. G. Klukken
Venue: Proceedings of the Frontiers in Education Conference on 1995. Proceedings., 1995 vol 1. - Volume 01 (1995)

Recent surveys of practicing engineers and employers of engineers have identified a need for engineering education to create opportunities for developing stronger communications and interpersonal skills, improve problem solving techniques, and challenge the creative thinking and conceptualization abilities of engineering students. Traditional teaching methodologies often lack opportunities for students to develop these "soft" skills or limit their exposure to this training to senior capstone design courses. At the University of Tennessee, we have developed an introductory engineering course called BE 211, Engineering Design Workshop which was taught on a pilot basis during the 1994-95 academic year. This course was developed to meet this challenge using multiple team projects as a format. The paper describes our experience with these pilot sections. Among the techniques of note are; the integration of different types of projects to explore all aspects of the problem solving process, using the Myers-Briggs Type Indicator for team formation, teaching team dynamics with the assistance of a consulting psychologist, extensive use of videotape for developing presentation skills, and using written responses to readings and group discussion to integrate technology, society, and engineering ethics issues into the course.
Hierarchical segmentation using latent semantic indexing in scale space
Authors: M. Slaney
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

This paper describes a new algorithm which discovers the hierarchical organization of a document or media presentation. We use latent semantic indexing to describe the semantic content of the signal, and scale-space segmentation to describe its features at many different scales. We present results from a text document and a video transcript.
Layer-2 configuration algorithms for cognitive radio networks
Authors: R. Chandrasekaran
Venue:  (2006)

A Cognitive Radio (CR) Network is a mobile multi-hop wireless network consisting of CR nodes. A CR node has the ability to dynamically adapt to local spectrum availability and it can operate on any one channel from a set of (wireless) channels that are part of the frequency spectrum. The set of channels available to a CR node may vary with time, location and the actions of other entities such as licensed users. Layer-2 configuration for a CR node involves determining its neighborhood, a set of locally common channels that it can use to communicate with its neighbors and, if required, determining globally common channels for communication over the entire network. Due to node mobility and dynamism of the channel availability set, this problem of determining a node's neighborhood and the channels the node can communicate on is not trivial. In this work, we propose several time-efficient distributed layer-2 configuration algorithms for various CR node models. The algorithms are symmetric (no leader is needed and all nodes execute the same algorithm) and deterministic. Time is slotted and nodes have access to synchronized clocks. We also present lower bounds on the number of timeslots required for neighborhood discovery that indicate that our algorithms are either optimal or close to being optimal.
A Context Aware Automatic Traffic Notification System for Cell Phones
Authors: Keshu Zhang, Kari Torkkola, Haifeng Li, Christopher Schreiner, Harry Zhang, Mike Gardner, Zheng Zhao
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

Adaptation of devices and applications based on contextual information has a great potential to enhance usability and mitigate the increasing complexity of mobile devices. We have developed a context aware system that can automatically notify user of the traffic conditions by predicting their destination and route using context. In this paper, we describe the system in detail, including data collection, user interaction, context fusion, and learning and prediction of user's destination and route.
Modeling and simulation to the design of &Sigma;&Delta; fractional-N frequency synthesizer
Authors: Shuilong Huang, Huainan Ma, Zhihua Wang
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

A set of behavioral voltage-domain verilogA/verilog models allowing a systematic design of the &Sigma;&Delta; fractional-N frequency synthesizer is discussed in the paper. The approach allows the designer to accurately predict the dynamic or stable characteristic of the closed loop by including nonlinear effects of building blocks in the models. The proposed models are implemented in a three-order &Sigma;&Delta; fractional-N PLL based frequency synthesizer with a 60MHz frequency tuning range. Cadence SpectreVerilog simulation results show that behavioral modeling can provide a great speed-up over circuit-level simulation. Synchronously, the phase noise, spurs and settling time can also be accurately predicted, so it is helpful to a grasp of the fundamentals at the early stage of the design and optimization design at the system level. The key simulation results have been compared against measured results obtained from an actual prototype validating the effectiveness of the proposed models.
Automatic Cookie Usage Setting with CookiePicker
Authors: Chuan Yue, Mengjun Xie, Haining Wang
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

HTTP cookies have been widely used for maintaining session states, personalizing, authenticating, and tracking user behaviors. Despite their importance and usefulness, cookies have raised public concerns on Internet privacy because they can be exploited by Web sites to track and build user profiles. In addition, stolen cookies may also incur security problems. However, current web browsers lack secure and convenientmechanisms for cookie management. A cookie management scheme, which is easy-to-use and has minimal privacy risk, is in great demand; but designing such a scheme is a challenge. In this paper, we introduce CookiePicker, a system that can automatically validate the usefulness of cookies from a Web site and set the cookie usage permission on behalf of users. CookiePicker helps users achieve the maximumbenefit brought by cookies, while minimizing the possible privacy and security risks. We implement CookiePicker as an extension to Firefox Web browser, and obtain promising results in the experiments.
Frequency Analysis of the Detectability of Virtual Haptic Gratings
Authors: Steven Cholewiak, Hong Z. Tan
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

The tactile detectability of sinusoidal and squarewave virtual texture gratings were measured and analyzed. Using a three-interval one-up three-down adaptive tracking procedure, detection thresholds for virtual gratings were estimated using a customdesigned high position-resolution 3-degrees-offreedom force-feedback haptic device. Two types of gratings were used, defined by sinusoidal and square waveforms, with spatial wavelengths of 0.2 to 25.6 mm. The results indicated that the participants demonstrated a higher sensitivity (i.e., lower detection threshold) to square-wave gratings than to sinusoidal ones at all the wavelengths tested. When the squarewave gratings were represented by the explicative Fourier series, it became apparent that the detectability of the square-wave gratings could be determined by that of the sinusoidal gratings at the corresponding fundamental frequencies. This was true for any square-wave grating as long as the detection threshold for the fundamental component was below those of the harmonic components.
Understanding calculations through experiments with functions [computer science education]
Authors: J. A. Piotrowski
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

First year students often use a functional language in their introductory programming classes today. Experiences gained in this way allows them to build mathematical concepts quickly and properly. On the other hand, modern algebra systems, such as MATLAB, accelerate advanced calculation and offer an excellent platform for experimentation, but they do not facilitate understanding of fundamental concepts. It is proposed to use jointly the functional approach and a modern algebra system (in this instance, the MATLAB software). This would reduce a danger of creating a clutter of unrelated procedures in place of a coherent system of concepts. 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
Experimental Study on Augmented Reality Potentials in Urban Design
Authors: Xiangyu Wang, Rui Chen, Yan Gong, Yi-Ting Hsieh
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

Urban design is generally a pre-organizing process of land usage and is traditionally regarded as a highly collaborative activity. Augmented Reality (AR) technology, the addition of virtual entities into the real world view, can support design assessment and collaboration within design team. This paper presented an experimental study that investigated the capability of Augmented Reality in the field of urban design and other related design tasks which involve group design and planning processes. Two realistic urban design scenarios were used to compare the performance between two treatments: the traditional wood block (TWB) method and the AR technology (ART). The results obtained from this experiment showed that although some technical difficulties in the AR system introduced negative performance factors on the outcome, all the subjects believed that the system holds significant potentials in urban design.
Hyperspectral Image Analysis--A Robust Algorithm Using Support Vectors and Principal Components
Authors: S. Sindhumol, M. Wilscy
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper presents a new algorithm for hyperspectral image analysis using spectral-angle based Support Vector Clustering (SVC) and Principal Component Analysis (PCA). In the classical approach to hyper-spectral dimensionality reduction based on Principal Component Analysis (PCA), no meaning or behavior of the spectrum is considered and results are influenced by majority components in the scene. A spectral angle based classification before dimensionality reduction is a possible solution to this problem. Clustering based on support vectors using spectral based kernels is proposed in this work, which is found to generate good results in hyperspectral image classification. The algorithm is tested with two hyperspectral image data sets of 210 bands each, which are taken with HYper-spectral Digital Imagery Collection Experiment (HYDICE) air-borne sensors. A comparative study of the proposed algorithm and other two conventional algorithms (PCA alone and PCA with Spectral Angle Mapping (SAM)) is also done.
A Service-Oriented System to Support Data Integration on Data Grids
Authors: Anastasios Gounaris, Carmela Comito, Rizos Sakellariou, Domenico Talia
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Data Grids provide transparent access to heterogeneous and autonomous data resources. The main contribution of this paper is the presentation of a data sharing system that (i) is tailored to data grids, (ii) supports well established and widely spread relational DBMSs, and (iii) adopts a hybrid architecture by relying on a peer model for query reformulation for retrieving semantically equivalent expressions, and on a wrapper-mediator integration model for accessing and querying distributed data sources. The system builds upon the infrastructure provided by the OGSA-DQP distributed query processor and the XMAP query reformulation algorithm. The paper discusses the implementation methodology, and also presents empirical evaluation results.
Mobile pervasive networks: routing, capacity assessment, and performance
Authors: Mario Gerla
Venue:  (2006)

With wireless networking technologies permeating into the very fabrics of our living and working environments, numerous traditional wired services and simple appliances can now be connected wirelessly. This provides a richly connected wireless network, allowing users with remote/local access conveniences. Yet, several unique attributes of a pervasive network must be considered for performance optimizations of mobile pervasive network applications. We observe that there three unique characteristics with mobile pervasive network applications. First, mobile pervasive network are important data collection points, it contains information provided by a myriad of information sources. Second, mobile pervasive network consist of devices with varying capabilities, such that they may have different interconnecting wireless technology, power requirement, interconnecting abilities, and etc. Third, mobile users interact with this pervasive network, continuous and efficient access to these devices is expected. Targeted at the requirements/characteristics above, we investigate the various enabling mechanisms for an efficient mobile pervasive network. Based on the emerging ZigBee network standard, we developed an evaluation platform that allows better understanding of deployed network scenarios, allowing assessment of the tradeoffs between performance and cost, and the tuning/optimizing of various network parameters according to network characteristics. In addition, we study the classic capacity estimation problem in both CSMA enabled wireless networks and high-speed links. These efficient capacity assessment methods open the way to efficient interconnection and inter-working with various pervasive network fabrics, and can be of great assistance to deployment of various applications. We evaluated the proposed approaches in various CSMA based adhoc wireless networks and high-speed networks. The results show that they are indeed fast and accurate, and can be of great assistance in determining the applicability of various pervasive applications.
Optimal representation of images by localized phase
Authors: S. Urieli
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

The POCS algorithm (projection onto convex sets) used for image reconstruction from spectral phase is investigated. The convergence rate of the algorithm is defined and analyzed, and the characteristics of images optimally represented by phase-only information are presented. It is concluded that images of geometric form are most efficiently represented by their spectral phase whereas images of symmetric form have the poorest convergence characteristics. The transition between the two extremes is shown to be continuous. The results provide a new approach and analysis of the reported advantages of the localized phase representation over the global approach, and suggest possible compression schemes.
Robot Search in 3D Swarm Construction
Authors: Justin Werfel
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Robots in a swarm construction system need to be able to find their way to all potential places to add material to a structure. In two dimensions, a (trivial) procedure exists for a stateless robot moving along the outside of a struc- ture, that will let it start at any point, take it to all potential attachment sites exactly once, and return it to its starting point, regardless of what part of the structure has already been built. Here we show that for three-dimensional struc- tures made from cubic building blocks, where each exposed face of a block is a potential attachment site, no such proce- dure exists. Any robot search scheme must then necessarily involve excess movement and/or increased component com- plexity (e.g., memory or communication).
Cooperative Evolution of Rules for Classification
Authors: Catalin Stoean, Mike Preuss, D. Dumitrescu, Ruxandra Stoean
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

A new learning technique based on cooperative coevolution is proposed for tackling classification problems. For each possible outcome of the classification task, a population of if-then rules, all having that certain class as the conclusion part, is evolved. Cooperation between rules appears in the evaluation stage, when complete sets of rules are formed with the purpose of measuring their classification accuracy on the training data. In the end of the evolution process, a complete set of rules is extracted by selecting a rule from each of the final populations. It is then applied to the test data. Some interesting results were obtained from experiments conducted on Fisher's iris benchmark problem.
Kinetic Flux Vector Splitting Schemes for Ideal Quantum Gas Dynamics
Authors: Jaw-Yen Yang, Tse-Yang Hsieh, Yu-Hsin Shi
Venue: SIAM Journal on Scientific Computing (2007)

Novel quantum kinetic flux vector splitting schemes are presented for the computation of ideal quantum gas dynamical flows. The quantum Boltzmann equation approach is adopted and both Bose-Einstein and Fermi-Dirac gases are considered. Formulas for one spatial dimension are first derived, and the resulting kinetic flux vector splitting scheme is tested for shock tube flows. A modified flux vector splitting based on the BGK model is also presented to reduce the numerical diffusion. Implementation of the efficient weighted essentially nonoscillatory method to yield a class of high resolution methods is also devised. Both the classical limit and the nearly degenerate limit are computed. The flow structures can all be accurately captured by the present kinetic flux vector splitting schemes. Results for one-dimensional boson gas under external potential are also included.
Blind separation of delayed sources based on information maximization
Authors: K. Torkkola
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Bell and Sejnowski (see Neural Computation, vol.7, no.6, p.1004-34, 1995) have presented an approach to blind source separation based on the information maximization principle. We extend this approach into more general cases where the sources may have been delayed with respect to each other. We present a network architecture capable of coping with such sources, and we derive the adaptation equations for the delays and the weights in the network by maximizing the information transferred through the network. Examples using wideband sources such as speech are presented to illustrate the algorithm.