ppxscal/embedding_network huggingface dataset:
Perceptually Prioritized Bit-Plane Coding for High-Definition Advanced Audio Coding
Authors: Te Li, Susanto Rahardja, Soo Ngee Koh
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Wide bitrate range scalability is now the latest trend in audio coding. A lot of efforts has been devoted to the development of algorithms for more efficient scalable audio coder that scales from very low bitrate. Scalable audio coding technique such as MPEG-4 Scalable Lossless coding (SLS) offers a unified solution for high-compression perceptual audio and high-quality lossless audio. SLS provides a fine-grain scalable extension of the well-known MPEG-4 Advanced Audio Coding (AAC) perceptual audio coder up to fully lossless reconstruction. Recently, the combination of SLS and AAC coder is renamed as "High Definition Advanced Audio Coding" (HD-AAC). It is observed that HD-AAC can be further improved at intermediate enhancement bitrate when the core bitrate is low. In this paper, a Perceptually Prioritized Bit-Plane Coding (PPBPC) is proposed. With this novel coding scheme, the bit-plane coding is performed with priorities according to the perceptual information of the signal to be coded. By using this low-complexity structure with trivial extra side information, the bit-plane coding for scalable audio can be implemented in a perceptually more efficient manner and the quality of the audio under aforementioned scenario is greatly improved.
Questions to Improve Quality of Life with Wearables: Humans, Technology, and the World
Authors: Sebastien Duval, Hiromichi Hashizume
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

Existing wearables mainly benefit to specialists and patients however they could also benefit to the general public, improving quality of life. To reach this goal, strategies for the development and implementation of wearables must be chosen based on careful consideration of interaction between humans and computing technologies, from multiple perspectives including cultural, economic, political, and ecological points of view. This paper takes up some of those perspectives by asking the following questions: What needs can wearables help fill? How do people perceive these technologies? What is the relationship between technology and human needs, and how can its understanding inform development strategies? What are the most promising services? What are the apparent difficulties? How do we design products? What can various demographic perspectives tell us? How do we ensure futureviability? Drawing on psychological theories - such as Maslow's hierarchy of needs as a framework for analyzing human factors our discussion presents results of interviews, questionnaires and experiments with prototypes, and raises questions for future research.
Optimal Segmentation Using Tree Models
Authors: Robert Gwadera, Aristides Gionis, Heikki Mannila
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunication. Many real-life sequences have a strong segmental structure, with segments of different complexities. In this paper we study the description of sequence segments using variable length Markov chains (VLMCs), also known as tree models. We discover the segment boundaries of a sequence and at the same time we obtain a VLMC for each segment. Such a context tree contains the probability distribution vectors that capture the essential features of the corresponding segment. We use the Bayesian Information Criterion (BIC) and the Krichevsky-Trofimov Probability (KT) to select the number of segments of a sequence. On DNA data the method selects segments that closely correspond to the annotated regions of the genes.
Slow locomotion of the three-link systems along a horizontal plane
Authors: T. Yu. Figurina
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

We continue to investigate the possibility of slow (quasi-static) locomotion of multi-link systems along a horizontal plane owing to changing their configurations. It has been shown in [Figurina T. Yu, 2001] that the quasi-static motion of a two-link system, occurring when the angle between its links varies, is uncontrollable and that the trajectories of the system's vertices are uniquely defined by the initial position of the system. It has been shown in [Chernousko, F.L., 2001] and [Chernousko, F.L., 2000] that, in contrast, both two-link and three-link systems are controllable (i.e. they can be driven to a prescribed position on the plane), when using both fast and slow motions. We state here quasi-static controllability of three-link systems, both star-like and with links connected in series. We investigate a symmetrical star-like three-link system. We show that there exist much possibilities for the quasi-static motion of the system. One can arrange a motion with the central vertex of the system moving along a prescribed broken line on the plane. As an example, we consider two gaits of the three-link system allowing it to move along a straight line and to rotate on a spot. We also consider a star-link three-link system, which contacts the plane only at the three end vertices. This system is an important special case of the star-like three-link system, since it can move along surfaces. We consider its motion only along a horizontal plane and construct a statically stable gait allowing driving the linkage to a desired position on the plane. At the end, we consider a three-link system with links connected in series and prove its quasi-static controllability.
HB^+^+: a Lightweight Authentication Protocol Secure against Some Attacks
Authors: Julien Bringer, Hervé Chabanne, Emmanuelle Dottax
Venue: Proceedings of the Second International Workshop on Security, Privacy and Trust in Pervasive and Ubiquitous Computing (2006)

At Crypto'05, Juels and Weis introduce HB+, an enhancement of the Hopper and Blum (HB) authentication protocol. This protocol HB+ is proven secure against active attacks, though preserving HB's advantages: mainly, requiring so few resources to run that it can be implemented on an RFID tag. However, in a wider adversarial model, Gilbert, Robshaw and Sibert exhibit a very effective attack against HB+. We here show how a modification of the HB+ protocol thwarts Gilbert et al's attack. The resulting protocol, HB++, remains a good choice for RFID authentication.
A Wiki for discussing and promoting best practices in research
Authors: Mark D. Hill, Jean-Luc Gaudiot, Mary Hall, Joe Marks, Paolo Prinetto, Donna Baglio
Venue: Communications of the ACM (2006)

Dealing with the demands of escalating paper submissions is a daunting challenge for conference organizers and program chairs. ACM and IEEE have joined forces to create a forum for sharing ideas on the best ways to handle it all.
Simulation modeling requirements for determining soldier tactical mission system effectiveness
Authors: Eric S. Tollefson, Michael J. Kwinn,  Jr., Phillip G. Martin, Gregory L. Boylan, Bobbie L. Foote
Venue: Proceedings of the 36th conference on Winter simulation (2004)

In order to maintain an edge during this time of unprecedented technological growth, the Army must field Infantry soldier systems quickly; however, the cost of doing so without some assessment of utility is quite high. Therefore, the acquisition community must estimate the operational impact of proposed systems with an increasing degree of accuracy. For this, the Army has turned to combat simulations. However, the focus in the past has been on larger battlefield systems and unit-level analyses. Additionally, Infantry soldier models require unprecedented fidelity in terms of the soldier entity and his environment. As a result, the simulation representation of the individual soldier on the battlefield has not kept pace with other representations. In this paper, we discuss our identification of the unique simulation requirements for modeling the Infantry soldier as a system of systems in support of acquisition decision making.
Adaptive Random Testing with Enlarged Input Domain
Authors: Johannes Mayer, Christoph Schneckenburger
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Adaptive Random Testing (ART) subsumes a family of random testing techniques that are designed to be more effective than pure Random Testing. These methods spread test cases more evenly within the input domain than a uniform distribution does. In the present paper, it is investigated why standard ART methods are less effective for higher failure rates. Therefore, the spatial distribution of the test cases generated by these methods is analyzed--also in higher dimensions--with a new approach. Based on the results of the analysis, improved algorithms are proposed that are equally effective for all failure rates as an empirical study reveals.
A Fuzzy Logic Model Based upon Reused and New & Changed Code for Software Development Effort Estimation at Personal Level
Authors: Cuauhtemoc Lopez-Martin, Cornelio Yanez-Marquez, Agustin Gutierrez-Tornes
Venue: Proceedings of the 15th International Conference on Computing (2006)

Unless engineers have the capabilities provided by personal training, they cannot properly support their teams or consistently and reliably produce quality products. This paper presents a research aimed to compare a model based upon Fuzzy Logic with a Multiple Linear Regression model. From a replicated experiment using a sample integrated by sixteen developers and 94 small programs these two models are derived. A common process as well as inside of a controlled environment this experiment is based. These comparisons based upon analysis of variance (ANOVA), Magnitude of Relative Error (MRE) as well as Multiple Range Tests show that a Fuzzy Logic model based on New and Changed code as well as Reused code can be an alternative for the software development effort estimation at personal level.
Ripple presentation for tree structures with historical information
Authors: Masaki Ishihara, Kazuo Misue, Jiro Tanaka
Venue: Proceedings of the 2006 Asia-Pacific Symposium on Information Visualisation - Volume 60 (2006)

We propose a new method for representing tree structures with historical information. We call this method Ripple Presentation. Categories of nodes are represented by the angles of edges and elapsed time is represented by the length of the edges. In this way, the method can express both the time series and categories, which has been diffic lt to achieve with either tree structures or lists. As a result, users can nderstand the overall information from their viewpoint view and discover target information effectively. We applied the method to trackback links of Weblog articles and the latest articles of News sites using RSS on Web as a resource.
Towards a Framework for Monitoring and Analyzing QoS Metrics of Grid Services
Authors: Hong-Linh Truong, Robert Samborski, Thomas Fahringer
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

QoS (Quality of Service) parameters play a key role in selecting Grid resources and optimizing resources usage efficiently. Although many works have focused on using QoS metrics, surprisingly few tools support the monitoring and analysis of QoS metrics of Grid services. This paper presents a novel framework which supports the monitoring and analysis of QoS metrics in the Grid. Our approach is that, firstly, we develop a classification of important QoS metrics for Grid services that should be monitored and analyzed. Secondly, sensors are developed to monitor QoS of disparate Grid services by using a peer-to-peer Grid monitoring middleware. The dependencies among Grid services are modeled. Based on that, several techniques are used to analyze QoS metrics of dependent Grid services
Object-Relational Database Metrics Formalization
Authors: Aline Lucia Baroni, Coral Calero, Fernando Brito e. Abreu, Mario Piattini
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

The abstract is to be in fully-justified italicized text, at the top of the left-hand column as it is here, below the author information. Use the word "Abstract" as the title, in 12-point Times, boldface type, centered relative to the column, initially capitalized. The abstract is to be in 10-point, single-spaced type, and up to 150 words in length. Leave two blank lines after the abstract, then begin the main text.
Optimal tuning widths in population coding of periodic variables
Authors: Marcelo A. Montemurro, Stefano Panzeri
Venue: Neural Computation (2006)

We study the relationship between the accuracy of a large neuronal population in encoding periodic sensory stimuli and the width of the tuning curves of individual neurons in the population. By using general simple models of population activity, we show that when considering one or two periodic stimulus features, a narrow tuning width provides better population encoding accuracy. When encoding more than two periodic stimulus features, the information conveyed by the population is instead maximal for finite values of the tuning width. These optimal values are only weakly dependent on model parameters and are similar to the width of tuning to orientation or motion direction of real visual cortical neurons. A very large tuning width leads to poor encoding accuracy, whatever the number of stimulus features encoded. Thus, optimal coding of periodic stimuli is different from that of nonperiodic stimuli, which, as shown in previous studies, would require infinitely large tuning widths when coding more than two stimulus features.
Can Face Recognition Really be Dissociated from Object Recognition?
Authors: Staff
Venue: Journal of Cognitive Neuroscience (1999)

We argue that the current literature on prosopagnosia fails to demonstrate unequivocal evidence for a disproportionate impairment for faces as compared to nonface objects. Two prosopagnosic subjects were tested for the discrimination of objects from several categories (face as well as nonface) at different levels of categorization (basic, subordinate, and exemplar levels). Several dependent measures were obtained including accuracy, signal detection measures, and response times. The results from Experiments 1 to 4 demonstrate that, in simultaneous-matching tasks, response times may reveal impairments with nonface objects in subjects whose error rates only indicate a face deficit. The results from Experiments 5 and 6 show that, given limited stimulus presentation times for face and nonface objects, the same subjects may demonstrate a deficit for both stimulus categories in sensitivity. In Experiments 7, 8 and 9, a match-to-sample task that places greater demands on memory led to comparable recognition sensitivity with both face and nonface objects. Regardless of object category, the prosopagnosic subjects were more affected by manipulations of the level of categorization than normal controls. This result raises questions regarding neuropsychological evidence for the modularity of face recognition, as well as its theoretical and methodological foundations.
DHAPM: A New Host Auto-configuration Protocol for Highly Dynamic MANETs
Authors: Mohammad Nazeeruddin, Gerard Parr, Bryan Scotney
Venue: Journal of Network and Systems Management (2006)

MANETs are self-organizing infrastructure-less networks formed on the fly by a group of wireless nodes. The lack of central administration in these networks necessitates host auto-configuration. The proposed auto-configuration protocols to date are either not robust enough to respond efficiently to the dynamic nature of the MANETs or they are resource greedy. Also, there has been no detailed attempt made to compare the effectiveness of these protocols which is essential to judge relative merits and demerits. This paper presents a new stateful robust host auto-configuration protocol which is based on dynamically selected Address Agents (AAs) that maintain a distributed address table. The performance of the proposed protocol is comprehensively compared with a representative protocol that employs a different address table management technique.
Perceptual Information of Images and the Bias in Homogeneity-based Segmentation
Authors: Hui Zhang, Sally A. Goldman
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

Semantic image segmentation aims to partition an image into separate regions, which ideally corresponds to different real-world objects. Many segmentation algorithms have been proposed, exploiting a wide variety of image features and characteristics. It has been shown through empirical studies that segmentation methods that assume a good segmentation partitions an image into different homogeneous regions are likely to fail in non-trivial situations, while methods based on perceptual organization generally generate more favorable segmentations. Yet no formal justification has been provided. In this paper, we propose an information measure for images, the perceptual information, based on human visual perception organization. Using perceptual information, we justify that homogeneity-based segmentation methods are inherently biased, and by incorporating knowledge, perceptual organization can overcome the bias and generate better segmentations.
Temporal stratification tests for linear and branching-time deductive databases
Authors: Christos Nomikos, Panos Rondogiannis, Manolis Gergatsoulis
Venue: Theoretical Computer Science (2005)

We consider the problem of extending temporal deductive databases with stratified negation. We argue that the classical stratification test for deductive databases is too restrictive when one shifts attention to the temporal case. Moreover, as we demonstrate, the (more general) local stratification approach is impractical: detecting whether a temporal deductive database is locally stratified is shown to be co-NP hard (even if one restricts attention to programs that only use one predicate symbol and two constants). For these reasons we define temporal stratification, an intermediate notion between stratification and local stratification. We demonstrate that for the temporal deductive databases we consider, temporal stratification coincides with local stratification in certain important cases in which the latter is polynomial-time decidable. We then develop two algorithms for detecting temporal stratification. The first algorithm applies to linear-time temporal deductive databases and it is efficient and more general than existing approaches; however, the algorithm sacrifices completeness for efficiency since it does not cover the whole class of temporally stratified programs. The second algorithm applies to branching-time temporal deductive databases (which include as a special case the linear-time ones). This algorithm is more expensive from a computational point of view, but it covers the whole class of temporally stratified programs. We discuss the relative merits of the two algorithms and compare them with other existing approaches.
A Locally Group Key Management with Revocation and Self-healing Capability for Sensor Networks
Authors: Li Hui, Chen Kefei, Zheng Yanfei, Wen Mi
Venue: Proceedings of the International Conference on Systems and Networks Communication (2006)

In this paper, we present an efficient key management scheme for resource limited sensor networks. Motivated by the fact that group key distribution from remote base station is costly in term of communication, we introduce the scheme of locally group key management scheme with revocation and self-healing capability for sensor network. The idea behind the scheme is use secret sharing to distribute group key and manage group member as well as group header.
Sharing Knowledge in Adaptive Learning Systems
Authors: Milos Kravcik, Dragan Gasevic
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

In this paper we deal with knowledge representation in the area of learning design and adaptive learning. Specification of concrete instances is usually context-dependent and does not support reusability very well, thus we need to represent the knowledge that could help us in generating the instances dynamically.
A Cortical Mechanism for Triggering Top-Down Facilitation in Visual Object Recognition
Authors: Moshe Bar
Venue: Journal of Cognitive Neuroscience (2003)

The majority of the research related to visual recognition has so far focused on bottom-up analysis, where the input is processed in a cascade of cortical regions that analyze increasingly complex information. Gradually more studies emphasize the role of top-down facilitation in cortical analysis, but it remains something of a mystery how such processing would be initiated. After all, top-down facilitation implies that high-level information is activated earlier than some relevant lower-level information. Building on previous studies, I propose a specific mechanism for the activation of top-down facilitation during visual object recognition. The gist of this hypothesis is that a partially analyzed version of the input image (i.e., a blurred image) is projected rapidly from early visual areas directly to the prefrontal cortex (PFC). This coarse representation activates in the PFC expectations about the most likely interpretations of the input image, which are then back-projected as an "initial guess" to the temporal cortex to be integrated with the bottom-up analysis. The top-down process facilitates recognition by substantially limiting the number of object representations that need to be considered. Furthermore, such a rapid mechanism may provide critical information when a quick response is necessary.
Taking without consent: stolen knowledge and the place of abstractions and assessment in situated learning
Authors: Christopher R. Jones
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

This paper explores the idea of situated learning and the related idea of a community of practice. These ideas have had a seminal influence in the CSCL community, yet they have received little serious attention in refining their use. This paper uses material from a recently completed piece of research to reflect on the educational (mis)use of the idea of situation. It argues that the view of situation popularized in the works of John Seely Brown and others contains a moral imperative. It maintains that a better understanding of situation might be achieved by adopting a stance that does not privilege a certain type of situation above others.This paper states a case for abstraction and formalization as forming part of the resources from which a community constitutes itself. In this way it resituates learning as both a participation in a community and a transmission of resources.
QoS Constrained Adaptive Routing Protocol For Mobile Adhoc Networks
Authors: Vinod Kone, Sukumar Nandi
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

The ease of deployment and the infrastructure less nature of Mobile Ad hoc Networks (MANETs) make them highly desirable for the present day multi media communications. Traditional routing protocols may not suffice for real time communications which require QoS support from the network. Though there has been considerable research in this area, most of the routing protocols take into account a single QoS constraint. In this paper, we propose an adaptive distributed routing protocol for MANETs which provides a QoS aware path from a given source to destination. The novelty of the protocol lies in taking multiple QoS constraints into consideration. Admission control and bandwidth reservation schemes are incorporated in the protocol to satisfy the QoS constraints of the applications. Relevant information is stored at the intermediate nodes to achieve the required QoS. The protocol has been simulated on top of IEEE 802.11 MAC, in ns-2 network simulator, to show it's correctness and efficiency.