ppxscal/embedding_network huggingface dataset:
Data hiding in the bit stream domain for MPEG-2 coded video sequences exploiting space and frequency masking
Authors: S. Arena
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this paper a data hiding technique for MPEG-2 coded video sequences is presented. We have chosen to work in the bit stream domain in order to simplify the data embedding process in the case in which the original data are already in a compressed form. Thanks to the exploitation of an interleaved encoding technique and of some space and frequency masking considerations, we have been able to reduce the BER of the original algorithm. Some results underlining the improvements we have been able to obtain thanks to our technique are shown.
Leveraging and Limiting Practical Drift in Emergency Response Planning
Authors: Steven R. Haynes, Wendy A. Schafer, John M. Carroll
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

A knowledge gap exists between what emergency responders know from their direct experience and what emergency planners know from analysis and reflection. The theory of practical drift suggests that shared understanding between planners and responders may break down as local response practice adapts and evolves with respect to static planning knowledge. Here we discuss how practical drift impacts emergency preparedness and, using Schön's theory of reflective practice, describe how design of collaborative technology might help mitigate this knowledge disparity. We draw on two field studies, one national, and one at the local level, to illustrate dimensions of the problem space.
Turbo channel estimation for OFDM systems on highly time and frequency selective channels
Authors: E. Jaffrot
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

We propose an optimum turbo channel estimation algorithm for OFDM systems on highly selective fading channels. This algorithm performs an iterative estimation of the multiplicative fading channel according to the maximum a posteriori criterion. It requires a convenient representation of the highly time and frequency selective fading channel based on the Karhunen-Loeve expansion theorem. It also optimally takes into account the coded structure of the data symbols in the estimation process thanks to the Bahl (1974) algorithm.
A User-Centric Model for Supporting Web Services
Authors: Jingna Li, Jingsha He
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2007)

the wide deployment of Web services in wire line and wireless networks has resulted in the proliferation of user identities relying on which the trust between a user and a Web service can be established through identification and authentication. Since user identities normally contain some information concerned with user privacy, sharing of such identity information between Web services should be minimized to preserve user privacy. In this paper, we propose a user-centric trust model for supporting Web services based on the principle of least sharing identity information. This model can be applied to applications in which a user is interacting with multiple Web services simultaneously. We describe this model and show how it can be used as the foundation for developing comprehensive solutions to protect user identities during Web service interactions, thus preserving user privacy.
DSP implementation issues for UMTS-channel coding
Authors: U. Walther
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 06 (2000)

The new wireless communication standard UMTS applies an advanced dual-mode channel coding scheme. We investigate the feasibility of implementing the algorithm on a digital signal processor device and the implication upon the processor architecture. Starting with a base architecture which allows for scalability and customization we derive new system parameters and compare the total device to ASIC solutions.
Managing Conceptual Revisions in a Temporal Fungal Taxonomy
Authors: Arash Shaban-Nejad, Volker Haarslev
Venue: Proceedings of the Twentieth IEEE International Symposium on Computer-Based Medical Systems (2007)

Representing and Reasoning about time and change is one of the primary issues in the area of Artificial Intelligence (AI) and Knowledge Representation (KR). Despite the importance of time and change in ontology change management process, current ontology researches are based on time- independent models. One of the reasons is that considering time in ontologies can increase the complexity and a comprehensive and very expressive ontology language is needed to represent it. In this paper we propose using state space model along with category theory as a mathematical notation, which is independent of a specific choice of ontology language and any particular implementation to analyze and represent temporal ontological models in the domain of biomedical applications.
Voronoi diagram based on a non-convex pattern: an application to extract patterns from a cloud of points
Authors: L. Idoumghar, M. Melkemi
Venue: Proceedings of the 4th International Symposium on Voronoi Diagrams in Science and Engineering (2007)

In this article, we propose a new generalization of the Voronoi diagram and the Euclidean á-shape. These new concepts are applied to retrieve from a set of points shapes identical to the shape of a known pattern, independently of translation, rotation and scaling transforms.
A brain-like computer for cognitive software applications: the Ersatz Brain project
Authors: J. A. Anderson
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

We want to design a suitable computer for the efficient execution of the software now being developed that displays human-like cognitive abilities. Examples of these potential software applications include natural language understanding, text processing, conceptually based Internet search, natural human-computer interfaces, cognitively based data mining, sensor fusion, and image understanding. Requirements of the proposed software are primary in shaping our hardware design. The hardware architecture design is based on a few ideas taken from the anatomy of mammalian neo-cortex. In common with other such attempts it is a massively parallel, two-dimensional array of CPUs and their associated memory. However, the design used in this project: (1) uses an approximation to cortical computation called the network of networks which holds that the basic computing unit in the cortex is not a single neuron but small groups of them working together in attractor networks; and (2) assumes connections in cortex are very sparse. The resulting architecture depends largely on local data movement.
Thwarting the power-hungry disk
Authors: Fred Douglis, P. Krishnan, Brian Marsh
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

Minimizing power consumption is important for mobile computers, and disks consume a significant portion of system-wide power. There is a large difference in power consumption between a disk that is spinning and one that is not, so systems try to keep the disk spinning only when it must. The system must trade off between the power that can be saved by spinning the disk down quickly after each access and the impact on response time from spinning it up again too often. We use trace-driven simulation to examine these trade-offs, and compare a number of different algorithms for controlling disk spin-down. We simulate disk accesses from a mobile computer (a Macintosh Powerbook Duo 230) and also from a desktop workstation (a Hewlett-Packard 9000/845 personal workstation running HP-UX), running on two disks used on mobile computers, the Hewlett-Packard Kittyhawk C3014A and the Quantum Go•Drive 120. We show that the "perfect" off-line algorithm--one that consumes minimum power without increasing response time relative to a disk that never spins down--can reduce disk power consumption by 35--50%, compared to the fixed threshold suggested by manufacturers. An on-line algorithm with a threshold of 10 seconds, running on the Powerbook trace and Go•Drive disk, reduces energy consumption by about 40% compared to the 5-minute threshold recommended by manufacturers of comparable disks; however, over a 4-hour trace period it results in 140 additional delays due to disk spin-ups.
Efficient Non-Parametric Corner Detection: An Approach Based on Small Eigenvalue
Authors: R. Dinesh, D S. Guru
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

In this paper, we present a fast non-parametric adaptive scheme for detecting corner points on a boundary curve. The accuracy of the proposed method steps from the use of an asymmetric region of support that automatically adopts to the scale of the corner point. The speed of the method is achieved based on a dynamic update of the covariance matrix used to determine the region of support. Several experiments have been conducted to revel the qualities of the proposed method and also to establish its superiority over several other existing methods.
RNIW: a novel general-purpose DSP architecture
Authors: He Qing
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 06 (1996)

High-sped advanced multimedia communication require greater parallelism in the traditional general-purpose DSP architecture. Some RISC architectures can provide enough processing capability comparable to the traditional general-purpose DSP architecture but are not adequate for new multimedia applications. While the very long instruction word (VLIW) architecture has been proved to be a very good approach to this problem, the main disadvantages are the limitation of the hardware resource compared to the complexity of multiple functional units and the code size explosion when a program does not offer enough parallelism at the instruction level. We propose a novel RISC architecture, the RISC plus Normal Instruction Word (RNIW), for DSP. This architecture allows the load FIFOs to increase the data throughput, dynamic linking instruction to pipeline the data between the register groups, and sub-word partition to increase the parallelism. The parallelism has a better cost-performance ratio than the VLIW architecture and is easier for VLSI implementation.
Robust two dimensional spectral estimation based on AR model excited by a t-distribution process
Authors: J. Sanubari
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

A new robust two dimensional (2-D) spectral estimation method based on an AR model is proposed. The optimal coefficient is selected by assuming that the excitation signal is a t-distribution t(/spl alpha/) with /spl alpha/ degrees of freedom. When /spl alpha/=/spl infin/, we get the conventional least square (L/sub 2/) method. Thus, the proposed method can be regarded as a generalization of the L/sub 2/ method. Simulation results show that the obtained estimates using the proposed method with small /spl alpha/ are more efficient, the standard deviation (SD) of the estimation results are smaller, and more accurate than that with large /spl alpha/. The proposed estimator with small /spl alpha/ is more efficient and more accurate than the recursive method based on Huber's (1981) M-estimate.
XMulator: A Listener-Based Integrated Simulation Platform for Interconnection Networks
Authors: A. Nayebi, S. Meraji, A. Shamaei, H. Sarbazi-Azad
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Simulation is perhaps the most cost-effective tool to evaluate the operation of a system under design. A flexible, easy to extend, fully object-oriented, and multilayered simulator for interconnection networks can be a very useful tool for multicomputer designers and researchers. It is so desirable to attach newly designed components to the existing models and to exploit detailed results. This paper presents XMulator, an object-oriented listener-based simulation environment for evaluating multicomputer interconnection networks. The simulator involves a toolbox of various network topologies, routing algorithms, switching techniques, and flexible router models. This work introduces a simulator, using listener-based integration methodology, which has a great impact on extensibility of the system. Mixed-mode event processing improves the performance of the simulator. By decoupling individual parts of the code, XMulator enables independent code development and creates a flexible and extensible environment for different aspects of network design. This simulator uses XML format to define network topologies, input parameters, and outputs reports providing a high level of flexibility. To the best of the authors' knowledge, it is the first simulator enabled to simulate any arbitrary interconnection topology under different working conditions including in the presence of faults.
Assessing the Reliability of a Human Estimator
Authors: Gary D. Boetticher, Nazim Lokhandwala
Venue: Proceedings of the 29th International Conference on Software Engineering Workshops (2007)

Human-based estimation remains the predominant methodology of choice [1]. Understanding the human estimator is critical for improving the effort estimation process. Every human estimator draws upon their background in terms of domain knowledge, technical knowledge, experience, and education in formulating an estimate. This research uses estimator demographic information to construct over 4000 classifiers which distinguish between the best and worst types of estimators. Various attribute techniques are applied to determine most significant demographics. Best case models produce accuracy rates ranging from 74 to 80 percent. Some of the best case models are presented for gaining insight into how demographics impact effort estimation.
Inferring Available Bandwidth of Overlay Network Paths Based on Inline Network Measurement
Authors: Cao Le Thanh Man, Go Hasegawa, Masayuki Murata
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

We introduce ImSystem, a distributed system that infers real-time information concerning the available bandwidth of all of the paths i n the overlay networks, using a technique called inline network measurement. The key concept in ImSystem is that, when the overlay hosts transmit overlay traffic, they deploy the traffic to perform inline network measurements and exchange results with each other. ImSystem performs supplemental active measurements only when overlay trafic is insuficient for inline measurements, and therefore injects very little probe trafic onto the network. In addition, we enhance the system t o ImSystemPlus, in which conflicts of the supplemental active measurements are greatly reduced, providing that the IP network topology is known. The simulation results show that the proposed systems have the same accuracy as that when all paths are measured by active measurements, while using only a small amount of probe traffic.
Can ISPS and P2P users cooperate for improved performance?
Authors: Vinay Aggarwal, Anja Feldmann, Christian Scheideler
Venue: ACM SIGCOMM Computer Communication Review (2007)

Peer-to-peer (P2P) systems, which are realized as overlays on top of the underlying Internet routing architecture, contribute a significant portion of today's Internet traffic. While the P2P users are a good source of revenue for the Internet Service Providers (ISPs), the immense P2P traffic also poses a significant traffic engineering challenge to the ISPs. This is because P2P systems either implement their own routing in the overlay topology or may use a P2P routing underlay [1], both of which are largely independent of the Internet routing, and thus impedes the ISP's traffic engineering capabilities. On the other hand, P2P users are primarily interested in finding their desired content quickly, with good performance. But as the P2P system has no access to the underlying network, it either has to measure the path performance itself or build its overlay topology agnostic of the underlay. This situation is disadvantageous for both the ISPs and the P2P users. To overcome this, we propose and evaluate the feasibility of a solution where the ISP offers an "oracle" to the P2P users. When the P2P user supplies the oracle with a list of possible P2P neighbors, the oracle ranks them according to certain criteria, like their proximity to the user or higher bandwidth links. This can be used by the P2P user to choose appropriate neighbors, and therefore improve its performance. The ISP can use this mechanism to better manage the immense P2P traffic, e.g., to keep it inside its network, or to direct it along a desired path. The improved network utilization will also enable the ISP to provide better service to its customers.
Bayesian filters for image estimation
Authors: S. R. Kadaba
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

We consider recursive estimation of images modeled by non-Gaussian autoregressive (AR) models and corrupted by spatially white Gaussian noise. The goal is to find a recursive algorithm to compute a near minimum mean squared error (MMSE) estimate of each scene pixel using a fixed lookahead of D rows and D columns of the observations. Our method is based on a simple approximation which facilitates the development of a useful suboptimal nonlinear estimator. In the process, we draw on the well-known reduced update Kalman filter to circumvent computational load problems. A simulation example demonstrates the non-Gaussian nature of the residual for an AR image model and that our algorithm compares favourably with Kalman filtering techniques in such cases.
Unfolding in CHR
Authors: Paolo Tacchella, Maurizio Gabbrielli, Maria Chiara Meo
Venue: Proceedings of the 9th ACM SIGPLAN international conference on Principles and practice of declarative programming (2007)

Program transformation is an appealing technique which allows to improve run-time efficiency, space-consumption and more generally to optimize a given program. Essentially it consists of a sequence of syntactic program manipulations which preserves some kind of semantic equivalence. One of the basic operations which is used by most program transformation systems is unfolding which consists in the replacement of a procedure call by its definition. While there is a large body of literature on transformation and unfolding of sequential programs, very few papers have addressed this issue for concurrent languages and, to the best of our knowledge, no one has considered unfolding of CHR programs. This paper is a first attempt to define a correct unfolding system for CHR programs. We define an unfolding rule, show its correctness and discuss some conditions which can be used to delete an unfolded rule while preserving the program meaning.
Information system media education (ISM): cooperating for media literacy
Authors: Heike vom Orde
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The Information System Media Education (in German: Informationssystem Medienpaedagogik ISM) is the most extensive digital reference tool on the topic of media education in the German-speaking area.
MeteoBayes: Effective Plan Recognition in a Weather Dialogue System
Authors: Manolis Maragoudakis, Aristomenis Thanopoulos, Nikos Fakotakis
Venue: IEEE Intelligent Systems (2007)

When you've called a voice portal for any kind of information retrieval, chances are that an automated system guided the entire interaction. Perhaps it correctly identified your goal, but only after too many questions. MeteoBayes, a meteorological information dialogue system, lets users employ natural language to clarify their goals. MeteoBayes uses a Bayesian networks-based inference engine to establish user intentions by consulting its past dialogue repository. Because unknown terms are likely to come up, MeteoBayes's unknown term disambiguation module learns word similarities from texts to avoid unnecessary system inquiries, thus speeding up the understanding process.
Registration of IR and EO Video Sequences based on Frame Difference
Authors: Zheng, Robert Laganiere
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Multi-modal imaging sensors are employed in advanced surveillance systems in the recent years. The performance of surveillance systems can be enhanced by using information beyond the visible spectrum, for example, infrared imaging. To ensure correctness of low- or high-level processing, multi-modal imagers must be fully calibrated or registered. In this paper, an algorithm is proposed to register the video sequences acquired by an infrared and an electro-optical (CCD) camera. The registration method is based on the silhouette extracted by differencing adjacent frames. This difference is found by an image structural similarity measurement. Initial registration is implemented by tracing the top head points in consecutive frames. Finally, an optimization procedure to maximize mutual information is employed to refine the registration results.
Development of the Signals and Systems Concept Inventory (SSCI) assessment instrument
Authors: K. E. Wage
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Linear systems theory is a core component of the undergraduate curriculum in electrical and computer engineering. This work-in-progress describes the Signals and Systems Concept Inventory (SSCI), an assessment tool designed to measure students' understanding of fundamental concepts in linear systems. The objective of this research is to develop a means of evaluating pedagogical techniques and curricular reform. The SSCI is patterned after the Force Concept Inventory, which is used to assess students' conceptual understanding of Newtonian physics. This paper discusses the development of the SSCI and its initial testing at the University of Massachusetts Dartmouth (UMassD) and George Mason University (GMU).
Student, alumni and employer satisfaction to a collaborative learning approach
Authors: F. Butler
Venue: Proceedings of the Frontiers in Education Conference, 2001. on 31st Annual - Volume 01 (2001)

A teaching methodology called hyperlearning is used in the Colleges of Software Engineering, Multimedia and Design at the University of Advancing Computer Technology, AZ, USA. It is used to increase knowledge retention, foster team building and problem solving skills, and develop creative thinking and leadership skills in an industry-oriented environment. Hyperlearning embodies five learning methods: lecture, instructor-led tutorials, self-directed tutorials, group recollection and student teachback. Student, alumni and employer satisfaction with this approach is systematically sampled. Students rated the instructor's ability to maintain the student's attention, the incorporation of current technology into the course and that labs and assignments help develop student knowledge. Students that just graduated rated their satisfaction with their courses. Employers of the University's graduates rated the student's teamwork skills, leadership skills, problem solving ability and adaptability to change. The feedback is used to determine faculty training, and course development. This paper describes a systemic approach to active/collaborative learning and the satisfaction levels of students, alumni and employers. The approach is broad: University-wide data are used to drive ongoing improvement.