ppxscal/embedding_network huggingface dataset:
A personal and inter-vehicle cordless communications system
Authors: W. Jacklin
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

The Northrop Grumman cordless communications system (CCS) is a state-of-the-art, wireless communications system targeted for tomorrow's armored battlefield. Through a single, hand-held or body-mounted personal communications unit (PCU), the CCS provides the soldier with access to a digital, full-duplex wireless intercom, as well as the capability to simultaneously communicate over a point-to-point digital data link. In addition, through the use of a single universal adapter interface (UAI), the soldier can remotely access the existing analog or digital wired vehicle intercom and the attached wide area tactical radios. Moreover, using a novel protocol and system architecture, the CCS is able to reconfigure itself automatically and seamlessly into various centralized and distributed network configurations as the operational scenario changes. At the core of the CCS is a 20 MIPS, fixed-point digital signal processor, which implements the protocol, control and signal processing algorithms required to achieve robust personal and inter-vehicle communications.
An online Web course environment and its application
Authors: C. B. Margi
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper describes some experiences with online Web courses. To manage the courses, we developed a system, the "WEB Course Control" (WebCC). This software allows the monitoring of student navigation over the instructional material, providing important feedback to the instructional designer through collected statistics, such as most accessed pages or media, frequency and size of navigation jumps. Some of these statistics are presented and discussed.
Concurrent Optimization of Technology and Design for Nano CMOS
Authors: Ajith Amerasekera
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

As we move to 45nm and beyond, our ability to manage the need for increased integration together with the drive for higher system performance and lower power presents many challenges to technology and design. It has become no longer possible to consider technology advancement without considering the overall optimization of the transistor and circuit design for full entitlement together with the cost of the chip. This paper looks at the key challenges and technology discontinuities that we face as we move into the nano CMOS regime, and some of the approaches being developed to address them.
Real-time Hybrid Tracking using Edge and Texture Information
Authors: Muriel Pressigout, Eric Marchand
Venue: International Journal of Robotics Research (2007)

This paper proposes a real-time, robust and effective tracking framework for visual servoing applications. The algorithm is based on the fusion of visual cues and on the estimation of a transformation (either a homography or a 3D pose). The parameters of this transformation are estimated using a non-linear minimization of a unique criterion that integrates information both on the texture and the edges of the tracked object. The proposed tracker is more robust and performs well in conditions where methods based on a single cue fail. The framework has been tested for 2D object motion estimation and pose computation. The method presented in this paper has been validated on several video sequences as well as in visual servoing experiments considering various objects. Results show the method to be robust to occlusions or textured backgrounds and suitable for visual servoing applications.
A Feature-based Model to Analyze Mobile Location Services
Authors: Ana M. Bernardos, Jose R. Casar, Paula Tarrio
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

As precursors of fully contextual and personalized services, a significant number of mobile location applications have appeared in the last years. The variety of their technological approaches and the peculiarities of their supporting business models have led us to propose a model to analyse location based services (LBS) from their main differential features. In order to build the model, an exhaustive analysis of the current LBS commercial offer has been accomplished. Basing on it, a primary classification of "horizontal LBS" (services that can be customized for niche applications or market segments) into categories, has been proposed. These categories cover navigation services, tracking, group management, finders, location based content delivery (considering directory search or push based delivery), geotagged content making, social networking, location enhanced communications (e.g. location-enabled push to talk), location based billing and proximity applications activation (M2M). Among all these services, there are divergences about which of them will be real market demand pullers, but some analysts bet for navigation, family trackers and location aware billing. Apart from those, multimedia downloads (music, audio and video) with location related reproduction rights, information in mass entertainment shows (live statistics or sport replays) or pervasive games seem to be other valuable proposals for final users.
Binaural bark subband pre-processing of nonstationary signals for noise robust speech feature extraction
Authors: M. Peters
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

A two channel approach to noise robust feature extraction for speech recognition in the car is proposed. The coherence function within the bark subbands of the mel-frequency-cepstral-transform is calculated to estimate the spectral similarity of two statistic processes. It is illustrated how the coherence of speech in binaural signals is used to increase the robustness against incoherent noise. The introduced pre-processing method of nonstationary signals in two microphones results in an additive correction term of the mel-frequency-cepstral-coefficients. 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 domestic photographic experiences to support autobiographical memory
Authors: Abigail C. Durrant
Venue: Proceedings of the 6th ACM SIGCHI conference on Creativity cognition (2007)

Combining social psychology and interaction design research, this PhD project explores how photographic artifacts become resources for the expression and empowerment of family representations, in order to inform the design of domestic photographic experiences. Inter-disciplinary activities address epistemological questions concerning the nature of design research in the HCI field.
An extension theorem for submeasures on Ł ukasiewicz--Moisil algebras
Authors: George Georgescu
Venue: Fuzzy Sets and Systems (2007)

In this paper we prove an extension theorem for submeasures defined on Lukasiewicz-Moisil algebras. This results generalize the Dobrakov extension theorem for submeasures on Boolean algebras.
Is program accreditation useful or needed in computing?
Authors: R. L. Cannon
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This panel focuses on the usefulness of accreditation in the software and design aspects of computing, including computer science, information systems, and software engineering.
Machine translation using probabilistic synchronous dependency insertion grammars
Authors: Martha Stone Palmer
Venue:  (2006)

This thesis addresses the use of Probabilistic Synchronous Dependency Insertion Grammars (PSDIG) for syntax based statistical machine translation (SMT). Dependency Insertion Grammar (DIG) is a generative grammar formalism that captures word order phenomena using dependency representation. Its Synchronous version, Synchronous DIG (or SDIG) aims at capturing structural divergences across languages. We prove DIG has a generation capacity weakly equivalent to that of CFG. In SDIG, the parallel sub-sentential dependency structures are defined as Elementary Tree (ET) pairs. By comparing to TAG and Synchronous TAG, we show how such formalisms are linguistically motivated. We propose a framework to learn such an SDIG from parallel corpora based on synchronous tree partitioning. We introduce three algorithms, which break down the sentence-level parallel dependency trees into phrase-level ET pairs. (1) The synchronous hierarchical partitioning algorithm iteratively adds category constraints to word level alignments, breaking down the dependency tree pairs, generating more fine-grained ET pairs at each iteration. However, its greedy nature motivates the second algorithm: (2) the exhaustive learner. It removes the category constraints and collects all the compatible treelet pairs. For these two algorithms, a set of heuristics in the tree to tree mapping process are used, and are combined together through a Maximum Entropy model. (3) We also introduce a grammar learner that specifically learns treelet pairs that are linear n-gram phrases at the same time.Combining the grammar rules learned from the two learners (algorithms (2) and (3) as mentioned above) improved the MT system performance. We introduce a decoding algorithm which is based on several log-linearly interpolated models, including a tri-gram language model. According to the Bleu automatic MT evaluation software [Papineni et al., 2002], the PSDIG MT system performance is significantly better than IBM Model 4 [Brown et al., 1990, 1993], while on par with the state-of-the-art public domain phrase based system Pharaoh [Koehn, 2004]. Analysis shows PSDIG and phrase based SMT each excel in different sentences, which gives possibility to combine the two approaches together. The improved integration of syntax on both source and target languages opens the door to more sophisticated SMT processes.
Protected dissemination and computer-aided reconstruction of digitized cultural artifacts
Authors: Marc Levoy
Venue:  (2007)

Advances in sensing technologies and data processing algorithms allow us to accurately and efficiently digitize the shape and surface characteristics of many physical objects. Among other applications, this capability presents new opportunities for preserving, sharing, and analyzing cultural heritage objects, such as artistic statuary and archaeological artifacts. This dissertation describes computational methods that we have developed and applied to allow the protected dissemination of archives of digitized 3D objects, and to aid in the reconstruction of a fragmented archaeological artifact. The increased capability for creation and sharing of three-dimensional digital models of valuable cultural artifacts introduces new concerns for their digital rights management. We have investigated several methods of protecting 3D models from piracy and misuse, while still allowing for their interactive display and manipulation. We describe an effective approach using a remote rendering system, which protects the high-resolution 3D geometry by allowing users to access the models only via images rendered on a remote secured server. Several possible types of 3D reconstruction attacks and corresponding defenses are considered. An implementation of our protected graphics system has been employed to protect and share large archives of 3D cultural heritage objects. Next we describe our digitization of the shape and surface appearance of the nearly 1,200 extant fragments of the Severan Marble Plan (Forma Urbis Romae), a giant 3rd-century marble map of Rome that is a primary source of topographical knowledge of the ancient city. We have created a unique digital archive of the Plan, one that includes a searchable relational database with collected archaeological information about each fragment, and that allows users to view 3D models of the fragments using our remote rendering system. Finally, we present a set of computer matching techniques that we have applied to the problem of reassembling the fragments of the Plan. These methods utilize the geometric constraints of the fragments' incisions, shapes, and other archaeological features that we have digitized. The effectiveness of our computer-aided reconstruction approach is demonstrated with a number of new proposed fragment matches and identifications, undiscovered in prior scholarship on the Plan, that extend our understanding of ancient Rome's topography.
Implementing internet key exchange (IKE)
Authors: Niklas Hallqvist, Angelos D. Keromytis
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

A key component of the IP Security architecture is the Internet Key Exchange protocol. IKE is invoked to establish session keys (and associated cryptographic and networking configuration) between two hosts across the network. IKE needs to authenticate and authorize the parties involved in an exchange, negotiate parameters to be used for the communication, and interact with the local IPsec stack. The number of tasks, along with the flexibility built into the protocol, as well as the need to allow future additions and modifications to the protocol, need to be taken into consideration when designing and implementing IKE. Another complicating factor is the need for security policy management. Although IKE can establish security associations with remote hosts, some method for determining what kinds of traffic can and should be exchanged with a remote host is necessary. As there is no standard specification yet, we are using a trust-management based approach using the KeyNote system as a basis for specifying policy. This paper discusses the design, architecture, and implementation details of the OpenBSD IKE daemon, with separate mention of the security policy mechanism.
Design methods for security and trust
Authors: Ingrid Verbauwhede, Patrick Schaumont
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The design of ubiquitous and embedded computers focuses on cost factors such as area, power-consumption, and performance. Security and trust properties, on the other hand, are often an afterthought. Yet the purpose of ubiquitous electronics is to act and negotiate on their owner's behalf, and this makes trust a first-order concern. We outline a methodology for the design of secure and trusted electronic embedded systems, which builds on identifying the secure-sensitive part of a system (the root-of-trust) and iteratively partitioning and protecting that root-of-trust over all levels of design abstraction. This includes protocols, software, hardware, and circuits. We review active research in the area of secure design methodologies.
A candidate proposal for a 3GPP adaptive multi-rate wideband speech codec
Authors: C. Erdmann
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

This paper describes an adaptive multi-rate wideband (AMR-WB) speech codec proposed for the GSM system and also for the evolving third generation (3G) mobile speech services. The speech codec is based on SB-CELP (splitband-code-excited linear prediction) with five modes operating bit rates from 24 kbit/s down to 9.1 kbit/s. The respective channel coding schemes are based on RSC (recursive systematic code) and UEP (unequal error protection). Both, source and channel codec are designed as homogenous as possible to guarantee robust transmission on current and future mobile radio channels.
A Fault-Tolerant Routing Algorithm in Hypercubes
Authors: Youran Lan
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 03 (1994)

Fault-tolerant communication mechanism for multicomputer systems is an important feature to reliability-critical applications. In this paper, we will present a fault-tolerant routing algorithm that has a better performance than a previous work in the sense that it requires less message overhead and the message header needs to be updated at fewer intermediate nodes. A comparison between the algorithms and a previous work is given.
SensorWare: Programming sensor networks beyond code update and querying
Authors: Athanassios Boulis, Chih-Chieh Han, Roy Shea, Mani B. Srivastava
Venue: Pervasive and Mobile Computing (2007)

Wireless ad hoc sensor networks have been largely designed with static and custom architectures for specific tasks, thus providing inflexible operation and interaction capabilities. Efforts to make sensor networks dynamically programmable stumble upon the problems of algorithmic expressiveness, compactness of transferred code, efficiency of executed code, and ease of programming. In short, the problem is the choice of abstraction for the sensor node run-time environment. Our framework, called SensorWare, defines and supports lightweight and mobile control scripts that allow the computation, communication, and sensing resources at the sensor nodes to be efficiently harnessed in an application-specific fashion, through the use of abstraction services. A key feature is that the run-time abstraction can change by dynamically defining new services. Furthermore, by making the scripts autonomously mobile we enable the deployment of the algorithm to be tied to its execution, a feature that reduces the code transferred, compared to conventional code deployment and update approaches. The implementation of SensorWare on an XScale-based prototype sensor node platform occupies less than 240 KB of code memory. The implementation is used to measure the delay and memory overheads, but more importantly, quantitatively highlight the trade-offs involved in run-time abstraction versatility.
An Ad Hoc Review of Digital Forensic Models
Authors: Mark M. Pollitt
Venue: Proceedings of the Second International Workshop on Systematic Approaches to Digital Forensic Engineering (2007)

Digital forensics has been the subject of academic study for a relatively brief period of time. One of the foundational ways in which researchers try to understand the scientific basis of a discipline is to construct models which reflect their observations. This paper reviews a collection of fifteen published papers which represent data points in the development of digital forensic models. It is neither an exhaustive review, nor exhaustive list of all available papers.
Location-aware scheduling with minimal infrastructure
Authors: John Heidemann, Dhaval Shah
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

Mobile computers often benefit from software which adapts to their location. For example, a computer might be backed up when at the office, or the default printer might always be a nearby one. In many existing systems, location-triggered actions are only possible for specific applications or with special infrastructure. This paper describes lcron, a system which supports user-configurable actions triggered on change in location or other events common to mobile computers. Key features of lcron are its use of existing clues for location information and mapping low-level location information into user-sensible terms. Lcron uses a number of existing sources of location such as network connection and base station ID, allowing it to work without special hardware or GPS receivers. We map sources of low-level information such as IP address and latitude/longitude into user-meaningful logical locations. We describe the design, implementation and our experiences with this system.
Conditional random fields for multi-agent reinforcement learning
Authors: Xinhua Zhang, Douglas Aberdeen, S. V. N. Vishwanathan
Venue: Proceedings of the 24th international conference on Machine learning (2007)

Conditional random fields (CRFs) are graphical models for modeling the probability of labels given the observations. They have traditionally been trained with using a set of observation and label pairs. Underlying all CRFs is the assumption that, conditioned on the training data, the labels are independent and identically distributed (iid). In this paper we explore the use of CRFs in a class of temporal learning algorithms, namely policy-gradient reinforcement learning (RL). Now the labels are no longer iid. They are actions that update the environment and affect the next observation. From an RL point of view, CRFs provide a natural way to model joint actions in a decentralized Markov decision process. They define how agents can communicate with each other to choose the optimal joint action. Our experiments include a synthetic network alignment problem, a distributed sensor network, and road traffic control; clearly outperforming RL methods which do not model the proper joint policy.
Nonlinear Mean Shift for Robust Pose Estimation
Authors: Raghav Subbarao, Yakup Genc, Peter Meer
Venue: Proceedings of the Eighth IEEE Workshop on Applications of Computer Vision (2007)

We propose a new robust estimator for camera pose estimation based on a recently developed nonlinear mean shift algorithm. This allows us to treat pose estimation as a clustering problem in the presence of outliers. We compare our method to RANSAC, which is the standard robust estimator for computer vision problems. We also show that under fairly general assumptions our method is provably better than RANSAC. Synthetic and real examples to support our claims are provided.
Evolutionary Computing on Consumer Graphics Hardware
Authors: Ka-Ling Fok, Tien-Tsin Wong, Man-Leung Wong
Venue: IEEE Intelligent Systems (2007)

Evolutionary algorithms are effective, robust methods for solving many practical problems such as feature selection,electrical-circuitsynthesis, and data mining. However, they can take a long time on some difficult problems because they need toperform several fitnessevaluations. Parallelizing these algorithms is a promising way to overcome this limitation. The authors proposeto implement a parallelEA on consumer graphics cards. Experiments demonstrated that this parallel EA is much more effective than anordinary EA, achievingbetween 1.25 to 5 times greater speed using a current-generation graphics card. Because most personal computershave graphics cards, andthese computers are easy to use and manage, more people will be able to use the parallel algorithm to solvetheir real-world problems.
A case study of motivation theory on the Web-based learning
Authors: Wan-I Lee
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

In recent decades, motivation theory has been mostly utilized in discussing the relationship between the satisfaction of instructors on jobs and the performance of traditional teaching. The rapid development of the Internet and the World Wide Web (WWW) provides an important resource for people to obtain various information and knowledge easily. The purpose of this research is to explore the motivation and hygiene factors of individuals learning via the WWW. It includes three major tasks: (1) explore hygiene factors of the individual before and after Web-based learning; (2) trace the behaviors of individuals' Web-based learning; and (3) collect common influencing factors (motivation and hygiene factors) of students learning via the WWW. The authors then categorize the influencing factors. They believe that a well-designed WWW learning environment with the most adequate factors can improve an individual's performance.