ppxscal/embedding_network huggingface dataset:
Linearized Transformation of RF Data for Capsule Tracking in Wireless Telemetry
Authors: Khalil Arshak, Francis Adepoju
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

In this paper, we discuss system and method of determining the real-time location of an omni-directional diagnostic radio frequency (RF) system while the object (transmitter) is moving freely inside an inaccessible organ. A specific application to the human gastrointestinal (GI) organ is presented, showing the importance of the method in accessing a specific site for drug administration or for extracting fluid or tissue samples for biopsy and similar medical investigations. For practical purposes, we assume omnidirectional transmitter transmitting at 433MHz, Input power 1W, and Es/No = 20dB (corresponding to the linear region of the target transceiver). We also discuss the method for using the original analogue signal, after conversion to voltage, for position tracking. In our algorithm, we employed a path loss scenario based on the popular log-normal model to simulate the effects of organs on signal quality between transmitter and receiver at various distances.
A Threat Model Driven Approach for Security Testing
Authors: Linzhang Wang, Eric Wong, Dianxiang Xu
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

In this paper, we propose a novel threat model-driven security testing approach for detecting undesirable threat behavior at runtime. Threats to security policies are modelled with UML (Unified Modeling Language) sequence diagrams. From a design-level threat model we extract a set of threat traces, each of which is an event sequence that should not occur during the system execution. The same threat model is also used to decide what kind of information should be collected at runtime and to guide the code instrumentation. The instrumented code is recompiled and executed using test cases randomly generated. The execution traces are collected and analyzed to verify whether the aforementioned undesirable threat traces are matched. If an execution trace is an instance of a threat trace, security violations are reported and actions should be taken to mitigate the threat in the system. Thus the linkage between models, code implementations, and security testing are extended to form a systematic methodology that can test certain security policies.
Architecting Microprocessor Components in 3D Design Space
Authors: Balaji Vaidyanathan, Wei-Lun Hung, Feng Wang, Yuan Xie, Vijaykrishnan Narayanan, Mary Jane Irwin
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Interconnect is one of the major concerns in current and future microprocessor designs from both performance and power consumption perspective. The emergence of three-dimensional (3D) chip architectures, with its intrinsic capability to reduce the wire length, is one of the promising solutions to mitigate the interconnect related issues. In this paper we implement a few components of a microprocessor using custom design to show the potential performance and power benefits achievable through 3D integration under thermal constraints. We also introduce a standard cell based 3D design flow which leverages the commercial 2D design tools. Using this design flow we provide performance results of wide range of arithmetic units in 3D, thus introducing a fast method to analyze the performance benefits of 3D designs. In contrast to prior work, which mostly investigates single components of a processor, our work takes multiple components into consideration and the experimental results are promising in terms of delay and power reductions. Complex designs in 3D that have equivalent performance compared to a simple 2D designs is taken for IPC improvement analysis. An IPC improvement of 11% shown for a microprocessor implemented in 2-strata 3D technology.
GA-based design of multiplierless 2-D state-space digital filters with very small roundoff noise
Authors: Young-Ho Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper presents a GA-based design method for multiplierless 2-D state-space digital filters (SSDFs) with very small roundoff noise. All coefficients of the designed 2-D SSDFs are expressed as the sum of two powers-of-two terms. Consequently, the multiplierless 2-D SSDFs are attractive for the high-speed operation and simplification of hardware, since the signal in the filters can be processed by fewer shifting operations and additions instead of multiplications. The proposed method can design multiplierless 2-D SSDFs without significantly increasing the roundoff noise power gain and with smaller approximation error than those of the other methods which use transfer functions in a continuous coefficient space. The effectiveness of the proposed method is demonstrated with a design example.
Extraction of salient contours from cluttered scenes
Authors: Qiling Tang, Nong Sang, Tianxu Zhang
Venue: Pattern Recognition (2007)

The responses of neurons in the primary visual cortex (V1) to stimulus inside the receptive field (RF) can be markedly modulated by stimuli outside the classical receptive field. The modulation, relying on contextual configurations, yields excitatory and inhibitory activities. The V1 neurons compose a functional network by lateral interactions and accomplish specific visual tasks in a dynamic and flexible fashion. Well-organized structures and conspicuous image locations are more salient and thus can pop out perceptually from the background. The excitatory and inhibitory activities give different visual physiological interpretations to the two kinds of saliencies. A model of contour extraction, inspired by visual cortical mechanisms of perceptual grouping, is presented. We unify the dual processes of spatial facilitation and surround inhibition to extract salient contours from complex scenes, and in this way coherent spatial configurations and region boundaries could stand out from their surround. The proposed method can selectively retain object contours, and meanwhile can dramatically reduce non-meaningful elements resulting from a texture background. This work gives a clear understanding for the roles of the inhibition and facilitation in grouping, and provides a biologically motivated computational strategy for contour extraction in computer vision.
PP-trust-X: A system for privacy preserving trust negotiations
Authors: A. Squicciarini, E. Bertino, Elena Ferrari, F. Paci, B. Thuraisingham
Venue: ACM Transactions on Information and System Security (TISSEC) (2007)

Trust negotiation is a promising approach for establishing trust in open systems, in which sensitive interactions may often occur between entities with no prior knowledge of each other. Although, to date several trust negotiation systems have been proposed, none of them fully address the problem of privacy preservation. Today, privacy is one of the major concerns of users when exchanging information through the Web and thus we believe that trust negotiation systems must effectively address privacy issues in order to be widely applicable. For these reasons, in this paper, we investigate privacy in the context of trust negotiations. We propose a set of privacy-preserving features for inclusion in any trust negotiation system, such as the support for the P3P standard, as well as a number of innovative features, such as a novel format for encoding digital credentials specifically designed for preserving privacy. Further, we present a variety of interoperable strategies to carry on the negotiation with the aim of improving both privacy and efficiency.
KLAT2's flat neighborhood network
Authors: H. G. Dietz, T. I. Mattox
Venue: Proceedings of the 4th annual Linux Showcase & Conference - Volume 4 (2000)

KLAT2, Kentucky Linux Athlon Testbed 2, is a cluster of 64 (plus two "hot spare") 700MHz AMD Athlon PCs. The raw compute speed of the processors justifies calling the system a supercomputer, but these fast nodes must be mated with a high-performance network in order to achieve the balance needed to obtain speed-up on real applications. Usually, cluster networks are built by combining the fastest available NICs and switching fabric, making the network expensive. Instead, KLAT2 uses a novel "Flat Neighborhood" network topology that was designed by a genetic algorithm (GA). A total of about $8,100 worth of 100Mb/s Fast Ethernet NICs, switches, and Cat5 cable, allows KLAT2's network to deliver both single-switch latency for any point-to-point communication and up to 25.6Gb/s bisection bandwidth. This paper describes how this new network architecture was derived, how it is used, and how it performs.
New Filter Based Unsupervised Rules for Boolean Blur Metric
Authors: P. Shivakumara, S. Noushat, G. Hemantha Kumar
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

This paper presents a simple and novel no reference Filter based Rules for Boolean Blur Metric (FBBM) to classify the blurred images from the database of home photos. Our primary goal of this paper is to classify the blurred images rather than measuring degree of blurness in the image or deblur an image. Thus the name given to this approach is Boolean Blur Metric (BBM). The proposed approach explores new rules based on establishing the unique relationship between the arithmetic mean filter, geometric mean filter and median filter of given image with the help of canny edge detector. The metric uses the disadvantage of arithmetic mean filter and advantage of geometric mean filter and median filers to define Boolean rule. Further, we have shown that the number of canny edge components in filtered images makes difference in defining rule. Finally, the proposed approach is compared with the well known existing no reference perceptual blur metrics to show that existing metrics are not suitable for classification. In addition, the experimental results revealed that the proposed method works even for rotated and scaled images.
On cepstral and all-pole based spectral envelope modeling with unknown model order
Authors: Axel Röbel, Fernando Villavicencio, Xavier Rodet
Venue: Pattern Recognition Letters (2007)

In this work, we investigate spectral envelope estimation for harmonic signals. We address the issue of model order selection and propose to make use of the fact that the spectral envelope is sampled by means of the harmonic structure of the signal in order to derive upper bounds for the estimator order. An experimental study is performed using synthetic test signals with various fundamental frequencies and different model structures to evaluate the performance of the envelope models. Experimental results confirm the relation between optimal model order and fundamental frequency.
Comparing probability measures using possibility theory: A notion of relative peakedness
Authors: Didier Dubois, Eyke Hüllermeier
Venue: International Journal of Approximate Reasoning (2007)

Deciding whether one probability distribution is more informative (in the sense of representing a less indeterminate situation) than another one is typically done using well-established information measures such as, e.g., the Shannon entropy or other dispersion indices. In contrast, the relative specificity of possibility distributions is evaluated by means of fuzzy set inclusion. In this paper, we propose a technique for comparing probability distributions from the point of view of their relative dispersion without resorting to a numerical index. A natural partial ordering in terms of relative ''peakedness'' of probability functions is proposed which is closely related to order-1 stochastic dominance. There is also a close connection between this ordering on probability distributions and the standard specificity ordering on possibility distributions that can be derived by means of a known probability-possibility transformation. The paper proposes a direct proof showing that the (total) preordering on probability measures defined by probabilistic entropy refines the (partial) ordering defined by possibilistic specificity. This result, also valid for other dispersion indices, is discussed against the background of related work in statistics, mathematics (inequalities on convex functions), and the social sciences. Finally, an application of the possibilistic specificity ordering in the field of machine learning or, more specifically, the induction of decision forests is proposed.
Using computer assisted collaborative learning for high quality distance education
Authors: N. A. Pendergrass
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Describes a high-quality distance learning course in undergraduate signals and systems which is being taught at the University of Massachusetts, Dartmouth and is being shared with the University of Massachusetts, Boston. The course uses computer-assisted collaborative learning techniques over two-way compressed video. Students in this course spend most of their class time working in groups on problems or interactive demonstrations. Often, they use simulators with audio input and output. This gives students an active learning experience during the class while also sharply reducing the amount of information which must be sent in broadcast fashion through the video system. By using collaborative learning methods, the negative impact of the video system is greatly reduced in the classrooms at both ends. There are many logistical issues in designing a distance learning course using collaborative learning methods for a subject like linear systems. This paper describes the layout of a computer-assisted learning studio. It also discusses the teaching methods used. These were optimized together for maximum effectiveness of this distance learning course.
Unequal error protection methods for perceptual audio coders
Authors: D. Sinha
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

In most source coded bit streams certain bits can be much more sensitive to transmission errors than others. Unequal error protection (UEP) offers a mechanism for matching error protection capability to sensitivity to transmission errors. A UEP system typically has the same average transmission rate as a corresponding equal error protection (EEP) system but offers an improved perceived signal quality at equal channel signal to noise ratio. In this work we introduce methods of UEP to the perceptual audio coder (PAC). An error sensitivity classifier divides the bits in classes of different sensitivity. Different channel codes are then applied to each class. We show how punctured convolutional codes can be used for UEP of the PAC bitstream. Experimental results for channels with uniform as well as non-uniform noise/interference level indicate that the systems with UEP exhibit graceful degradation and extended range for applications such as digital audio broadcasting (DAB).
The emerging resource and admission control function standards and their application to the new triple-play services: Research Articles
Authors: Thomas W. Anderson, Peter Busschbach, Igor Faynberg, Hui-Lan Lu, Dong Sun
Venue: Bell Labs Technical Journal (2007)

The next-generation network (NGN) is characterized by, among other characteristics, the prevalent use of the Internet Protocol (IP) for end-to-end packet transfer. In contrast to today's specialized networks optimized for specific applications, NGN is a general multiservice network that must meet a wide range of application performance needs and security requirements. The key to fulfilling this complex duty is a dynamic, policy-based resource management framework, known as the Resource and Admission Control Functions (RACF). This paper discusses the relevant standardization efforts and provides a vision for the future work in the International Telecommunication Union (ITU), 3rd Generation Partnership Projects (3GPP&ast; and 3GPP2), Internet Engineering Task Force (IETF), and European Telecommunications Standards Institute (ETSI). The discussion is illustrated by the applications of the RACF architecture to the new triple-play services: high-speed Internet, IP television (video on demand or regular broadcasts), and telephone service over a single broadband connection. &copy; 2007 Alcatel-Lucent.
Tutte sets in graphs I: Maximal tutte sets and D-graphs
Authors: D. Bauer, H. J. Broersma, A. Morgana, E. Schmeichel
Venue: Journal of Graph Theory (2007)

A well-known formula of Tutte and Berge expresses the size of a maximum matching in a graph G in terms of what is usually called the deficiency of G. A subset X of V(G) for which this deficiency is attained is called a Tutte set of G. While much is known about maximum matchings, less is known about the structure of Tutte sets. In this article, we study the structural aspects of maximal Tutte sets in a graph G. Towards this end, we introduce a related graph D(G). We first show that the maximal Tutte sets in G are precisely the maximal independent sets in its D-graph D(G), and then continue with the study of D-graphs in their own right, and of iterated D-graphs. We show that G is isomorphic to a spanning subgraph of D(G), and characterize the graphs for which G&cong;D(G) and for which D(G)&cong;D2(G). Surprisingly, it turns out that for every graph G with a perfect matching, D3(G)&cong;D2(G). Finally, we characterize bipartite D-graphs and comment on the problem of characterizing D-graphs in general. &copy; 2007 Wiley Periodicals, Inc. J Graph Theory 55: 343&ndash;358, 2007
Calypso: an implementation of the order graph method
Authors: G. R. Cato
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

Previous efforts to speed up signal and image processing algorithms have focused on executing them in parallel on multiprocessor systems. An important issue in achieving the maximum parallelism is how to automatically partition and schedule algorithms onto the individual processors. We present the order graph method (OGM) as an effective technique for parallel task scheduling which considers interprocessor communication and network topology. Calypso is introduced as an implementation of the OGM. Results from scheduling image processing algorithms are presented. In addition, we propose some standard benchmarks that can be used to compare various methods for parallel task scheduling.
An Information-Theoretic Approach to Stochastic Materials Modeling
Authors: Nicholas Zabaras, Sethuraman Sankaran
Venue: Computing in Science and Engineering (2007)

An approach derived from information-theoretic principles can help researchers build stochastic microstructural models. This approach involves extracting topological information from microstructural samples and using this information to build a stochastic model. To generate huge databases of stochastic material models, the authors thus propose using an information-learning algorithm to train a network for statistical outputs.
Digital fundamental group and Euler characteristic of a connected sum of digital closed surfaces
Authors: Sang-Eon Han
Venue: Information Sciences: an International Journal (2007)

Unlike the connected sum in classical topology, its digital version is shown to have some intrinsic feature. In this paper, we study both the digital fundamental group and the Euler characteristic of a connected sum of digital closed k"i-surfaces, i@?{0,1}.
Plot monitoring for interactive narrative games
Authors: Guylain Delmas, Ronan Champagnat, Michel Augeraud
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

Interactive narrative and video games are two fields divided between the will to follow a scenario and that to offer a maximum of freedom and interaction. We propose a method combining emergent narrative theory and game monitoring to create a new system of dynamic generation of narrative. This method is based on a multi-agent architecture, which supervises and monitors the game execution.allIt uses of narrative structures descriptors as a reference to lead the evolution of an emergent narrative world. A first application has been developed to test the validity of the system in term of effectiveness and computational cost.
Preserving Private Knowledge in Frequent Pattern Mining
Authors: Zhihui Wang, Wei Wang, Baile Shi, S. H. Boey
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

The knowledge discovered by data mining may contain sensitive information, which may cause potential threats towards privacy and security. In this paper, we address the problem of better preserving private knowledge by proposing an Item-based Pattern Sanitization to prevent the disclosure of private patterns. We also present two strategies to generate a safe and shareable pattern set for preserving private knowledge in frequent pattern mining.
A future of customizable processors: are we there yet?
Authors: Laura Pozzi, Pierre G. Paulin
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

Customizable processors are being used increasingly often in SoC designs. During the past few years, they have proven to be a good way to solve the conflicting flexibility and performance requirements of embedded systems design. While their usefulness has been demonstrated in a wide range of products, a few challenges remain to be addressed: 1) Is extending a standard core template the right way to customization, or is it preferable to design a fully customized core from scratch? 2) Is the automation offered by current toolchains, in particular generation of complex instructions and their reuse, enough for what users would like to see? 3) And when we look at the future with the increasing use of multi-processor SoCs, do we see a sea of identical customized processors, or a heterogeneous mix? We comment and elaborate here on these challenges and open questions.
Design and semantics of quantum: a language to control resource consumption in distributed computing
Authors: Luc Moreau, Christian Queinnec
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

This paper describes the semantics of Quantum, a language that was specifically designed to control resource consumption of distributed computations, such as mobile agent style applications. In Quantum, computations can be driven by mastering their resource consumption. Resources can be understood as processors cycles, geographical expansion, bandwidth or duration of communications, etc. We adopt a generic view by saying that computations need energy to be performed. Quantum relies on three new primitives that deal with energy. The first primitive creates a tank of energy associated with a computation. Asynchronous notifications inform the user of energy exhaustion and computation termination. The other two primitives allow us to implement suspension and resumption of computations by emptying a tank and by supplying more energy to a tank. The semantics takes the form of an abstract machine with explicit parallelism and energy-related primitives.