ppxscal/embedding_network huggingface dataset:
A Weighted Moving Average-based Approach for Cleaning Sensor Data
Authors: Yongzhen Zhuang, Lei Chen, X. Sean Wang, Jie Lian
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems (2007)

Nowadays, wireless sensor networks have been widely used in many monitoring applications. Due to the low quality of sensors and random effects of the environments, however, it is well known that the collected sensor data are noisy. Therefore, it is very critical to clean the sensor data before using them to answer queries or conduct data analysis. Popular data cleaning approaches, such as the moving average, cannot meet the requirements of both energy efficiency and quick response time in many sensor related applications. In this paper, we propose a hybrid sensor data cleaning approach with confidence. Specifically, we propose a smart weighted moving average (WMA) algorithm that collects confidence data from sensors and computes the weighted moving average. The rationale behind the WMA algorithm is to draw more samples for a particular value that is of great importance to the moving average, and provide higher confidence weight for this value, such that this important value can be quickly reflected in the moving average. Based on our extensive simulation results, we demonstrate that, compared to the simple moving average (SMA), our WMA approach can effectively clean data and offer quick response time.
Discovering and Exploiting Causal Dependencies for Robust Mobile Context-Aware Recommenders
Authors: Ghim-Eng Yap Ah-Hwee Tan
Venue: IEEE Transactions on Knowledge and Data Engineering (2007)

Acquisition of context poses unique challenges to mobile context-aware recommender systems. The limited resources in these systems make minimizing their context acquisition a practical need, and the uncertainty in the mobile environment makes missing and erroneous context inputs a major concern. In this paper, we propose an approach based on Bayesian networks (BNs) for building recommender systems that minimize context acquisition. Our learning approach iteratively trims the BN-based context model until it contains only the minimal set of context parameters that are important to a user. In addition, we show that a two-tiered context model can effectively capture the causal dependencies among context parameters, enabling a recommender system to compensate for missing and erroneous context inputs. We have validated our proposed techniques on a restaurant recommendation data set and a Web page recommendation data set. In both benchmark problems, the minimal sets of context can be reliably discovered for the specific users. Furthermore, the learned Bayesian network consistently outperforms the J4.8 decision tree in overcoming both missing and erroneous context inputs to generate significantly more accurate predictions.
Modified motion compensated temporal frame interpolation for very low bit rate video
Authors: Chi-Kong Wong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

Common techniques such as frame repetition or linear interpolation for reconstructing skipped frames in temporally subsampled video sequences tend to introduce undesirable artifacts. A previously proposed technique, fast motion compensated temporal interpolation (FMCTI), can interpolate video frames in the time domain with good interpolated image quality. However, the reconstructed frames tend to be blocky. We propose to incorporate a pixel-based motion classifier into FMCTI to solve the problem. The resulting technique, modified fast motion compensated temporal interpolation (MFMCTI), was found by simulation to give significantly reduced blocking artifacts.
Small moving object detection in video sequences
Authors: R. Zaibi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

In this paper, we propose a method for detection of small moving objects in video. We first eliminate the camera motion using motion compensation. We then use an adaptive predictor to estimate the current pixel using neighboring pixels in the motion compensated image and, in this way, obtain a residual error image. Small moving objects appear as outliers in the residual image and are detected using a statistical Gaussianity detection test based on higher order statistics. It turns out that in general, the distribution of the residual error image pixels is almost Gaussian. On the other hand, the distribution of the pixels in the residual image deviates from Gaussianity in the existence of outliers. Simulation examples are presented.
Differential evolution algorithms using hybrid mutation
Authors: P. Kaelo, M. M. Ali
Venue: Computational Optimization and Applications (2007)

Differential evolution (DE) has gained a lot of attention from the global optimization research community. It has proved to be a very robust algorithm for solving non-differentiable and non-convex global optimization problems. In this paper, we propose some modifications to the original algorithm. Specifically, we use the attraction-repulsion concept of electromagnetism-like (EM) algorithm to boost the mutation operation of the original differential evolution. We carried out a numerical study using a set of 50 test problems, many of which are inspired by practical applications. Results presented show the potential of this new approach.
A virtual honeypot framework
Authors: Niels Provos
Venue: Proceedings of the 13th conference on USENIX Security Symposium - Volume 13 (2004)

A honeypot is a closely monitored network decoy serving several purposes: it can distract adversaries from more valuable machines on a network, provide early warning about new attack and exploitation trends, or allow in-depth examination of adversaries during and after exploitation of a honeypot. Deploying a physical honeypot is often time intensive and expensive as different operating systems require specialized hardware and every honeypot requires its own physical system. This paper presents Honeyd, a framework for virtual honeypots that simulates virtual computer systems at the network level. The simulated computer systems appear to run on unallocated network addresses. To deceive network fingerprinting tools, Honeyd simulates the networking stack of different operating systems and can provide arbitrary routing topologies and services for an arbitrary number of virtual systems. This paper discusses Honeyd's design and shows how the Honeyd framework helps in many areas of system security, e.g. detecting and disabling worms, distracting adversaries, or preventing the spread of spam email.
Detecting hit shaving in click-through payment schemes
Authors: Michael K. Reiter, Vinod Anupam, Alain Mayer
Venue: Proceedings of the 3rd conference on USENIX Workshop on Electronic Commerce - Volume 3 (1998)

A web user "clicks through" one web site, the referrer, to another web site, the target, if the user follows a hypertext link to the target's site contained in a web page served from the referrer's site. Numerous click-through payment programs have been established on the web, by which (the webmaster of) a target site pays a referrer site for each click through that referrer to the target. However, typically the referrer has no ability to verify that it is paid for every click-through to the target for which it is responsible. Thus, targets can undetectably omit to pay referrers for some number of click-throughs, a practice called hit shaving. In this paper, we explore simple and immediately useful approaches to enable referrers to monitor the number of click-throughs for which they should be paid.
Architecture for Variable-Length Combined FFT, DCT, and MWT Transform Hardware for a Multi-ModeWireless System
Authors: Rohit Pandey, Michael L. Bushnell
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

We propose a novel combined wireless baseband processor architecture targeting the Fast Fourier Transform (FFT) for orthogonal frequency division multiplexing (OFDM), the discrete cosine transform (DCT) for video and audio compression, and the modified Walsh transform (MWT) for demodulation of the complementary code key (CCK) in the wireless standard 802.11b. The architecture is variable-length and is suitable for multi-mode and multi-standard OFDM communication systems such as 802.11a, digital audio broadcasting (DAB), digital video broadcasting-terrestrial (DVB-T), very-high-speed digital subscriber loop (VDSL), asymmetric digital subscriber loop (ADSL), and also for 802.11b. It also does joint photographic expert group (JPEG) and moving picture expert group (MPEG) texture en-/decoding. The combined architecture uses 42.5% fewer multipliers, and 35% fewer logic gates in the nonmultiplier hardware, than three individual cores. It has a signalto- noise-ratio (SNR) of 46.5dB with 8 input bits for a 1,024-size FFT. It saves 28.6% of the dynamic and 37% of the static power.
Exact performances analysis of a selective coefficient adaptive algorithm in acoustic echo cancellation
Authors: I. Kammoun
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In the hands-free communications, the identification of long impulse response in acoustic echo cancellation requires very important load calculations. One way to reduce the complexity of the classical normalized least mean square (NLMS) adaptive algorithm, is to use the Mmax NLMS algorithm (Aboulnasr and Mayyas 1999). It is shown that this algorithm is a very promising one, that maintains closest performance to the full update NMLS filter in spite of the updating of a small number of coefficients. However, due to its complexity, the mean square analysis uses an unrealistic hypothesis. It was then not possible to consider the practical context such as high input correlation or high step size. In this paper, we present an exact performances analysis, inspired from Besbes et al. (1999), when the input signal remains in a finite alphabet set. With this realistic hypothesis, dedicated to the digital context, we can describe accurately the Mmax NLMS' behavior without any unrealistic assumption. In particular, we evaluate the exact value of critical and optimal step size and we provide the exact mean square error (MSE) for all step sizes and input correlations. The influence of high order statistics can be enhanced.
Non-uniform sampling in wavelet subspaces
Authors: G. G. Walter
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

It is well known that the Shannon (1949) sampling theorem can be put into a wavelet context. But it has also been shown that for most wavelets, a sampling theorem for the associated subspaces exists. There is even a non-uniform sampling theorem as in the Shannon case. In general the bounds on the deviations from uniform are not as easy to specify in this case. No simple Kadec 1/4 theorem holds except in special cases (such as the Franklin case where the bound is 1/2). For a particular class, the Meyer (1990) wavelets, which are bandlimited but with a smooth spectrum, a similar bound is sometimes obtainable. Unfortunately, it is much smaller that 1/4.
DSL implementation using staging and monads
Authors: Tim Sheard, Zine-el-abidine Benaissa, Emir Pasalic
Venue: Proceedings of the 2nd conference on Conference on Domain-Specific Languages - Volume 2 (1999)

The impact of Domain Specific Languages (DSLs) on software design is considerable. They allow programs to be more concise than equivalent programs written in a high-level programming languages. They relieve programmers from making decisions about data-structure and algorithm design, and thus allows solutions to be constructed quickly. Because DSL's are at a higher level of abstraction they are easier to maintain and reason about than equivalent programs written in a high-level language, and perhaps most importantly they can be written by domain experts rather than programmers. The problem is that DSL implementation is costly and prone to errors, and that high level approaches to DSL implementation often produce inefficient systems. By using two new programming language mechanisms, program staging and monadic abstraction, we can lower the cost of DSL implementations by allowing reuse at many levels. These mechanisms provide the expressive power that allows the construction of many compiler components as reusable libraries, provide a direct link between the semantics and the low-level implementation, and provide the structure necessary to reason about the implementation.
Involutive divisions and monomial orderings
Authors: A. S. Semenov, P. A. Zyuzikov
Venue: Programming and Computing Software (2007)

In the paper, two classes of involutive divisions related to admissible monomial orderings--¿-divisions and ¿-divisions--are considered. The latter may be viewed as an improvement of the class of induced divisions introduced in [1]. The continuity and constructivity of the ¿-divisions, as well as a number of additional properties of the ¿-divisions, are proved. Taking into account that the Janet division is a ¿-division associated with the lexicographical order, its "antipode"--a ¿-division associated with the same order--is separated in the class of the ¿-divisions.
Delimiting cut-off of age at onset in Schizophrenia using Bayesian network
Authors: A. Ouali, A. Ramdane-Cherif, M. O. Krebs
Venue: Proceedings of the Fourth IEEE International Conference on Cognitive Informatics (2005)

The heterogeneity of Schizophrenia disease has been a major pitfall for identifying the aetiological, genetic or environmental factors. Age at onset or several other quantitative variables could allow for categorizing more homogeneous subgroups of patients, although there is little information on which are the boundaries for such categories. The Bayesian networks classifier approach is one of the most popular formalisms for reasoning under uncertainty. We used this approach to determine the best cut-off point for three continuous variables (i.e. age at onset of schizophrenia (AFC* & AFE**) and neurological soft signs (NSS)) with a minimal loss of information, using a data set including genotypes of selected candidate genes for schizophrenia.
Information Visualization of Multi-dimensional Cellular Automata using GPU Programming
Authors: Stephane Gobron, Daniel Mestre
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We propose a method for generating all possible rules of multidimension Boolean cellular automata (CA). Based on an original encoding method and the programming of graphical processor units (GPU), this method allows us to visualize the CA information flow in real-time so that emerging behaviors can be easily identified. Algorithms of first and von Neumann neighborhood second degrees are detailed with their respective Fragment Shaders programs. As symmetrical CA rules are especially useful in many research fields, we propose an encoding technique to automatically derive their codes; we then apply this technique to identify the 4096 possible cases for surface CA. To show the efficiency of our model a set of converging global behaviors are listed and described. In the last part of the paper we present methods for developing Moore neighborhood in two and in three dimensions. Finally we discus issues concerning computation and the visualization of non-Boolean and higher dimension CA.
Computer aided vision assistance for human blind
Authors: R. Nagarajan, Sazali Yaacob, G. Sainarayanan
Venue: Integrated Computer-Aided Engineering (2004)

One of the main difficulties experienced by the blind people is navigation without collision. It is well known that blind individuals are sensitive to sound. This paper presents a real time scheme in providing vision substitution to visually handicapped people. A prototype system had been constructed. It has a laptop computer, a headgear with a digital video camera and a set of stereo earphones interconnected. The images of the environment are captured by digital video camera. The critically designed image processing software processes the image to locate the object and its boundaries. The image processing software is designed to incorporate some of human vision properties using artificial intelligent techniques. The processed image is mapped onto structured stereo sound patterns, so that the blind can understand the environment around him through the set of stereo earphone. The prototype equipment is used to train blind volunteers with the acoustic patterns. Suggestions from the blind volunteers regarding pleasantness and discrimination of sound patterns were also incorporated in the system. The prototype equipment is tested by blinds for their successful indoor collision free motion and navigation within a building.
Stereo Matching Using 2-D Hopfield Network with Multiple Constraints
Authors: Hai-feng Hu, Ping Zhang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Stereo matching is one of the classic difficult problems in the computer vision, and its complexity and precision hedge the capability of vision system to reconstruct the 3-D scene. This paper presents a new matching method based on neural network. On the condition that stereo rectification has been performed, the energy function is built on the basis of uniqueness, compatibility and similarity constraints, which reflects the constraint relations of all matching units of the same lines. It is then mapped onto a 2-D neural network for minimization, whose final stable state indicates the possible correspondence of the matching units. The depth map can be acquired through performing the above operation on the all epipolar lines. The algorithm has two traits relative to the traditional approach. Firstly, individual pixel point but not scene point or edge line is adopted as matching unit and dense depth map could be obtained directly. Secondly, the external input of the nodes is not constant again and is the function of gray similarity of correspondent points. The experiments on the synthetic and real images demonstrate the feasibility of the proposed approach..
You Are Here
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

The Global Positioning System is getting ready for an update, and other nations are developing new satellite navigation systems, including the European Commission's Galileo project. At the same time, the market for personal navigation devices is poised for explosive growth.
The discursive coding of software: a study of the relationship between stability and change
Authors: David Russell
Venue:  (2006)

Software has become an integral part of most people's everyday lives. Though discussions of software in the field of rhetoric have traditionally taken an instrumentalist approach that seeks to increase the effective use of software, a critical turn has established the need to examine the ideological signification of software. I argue that one way we can do so is to examine the social practices that symbolically constitute software to reveal how software is discursively coded, and how, consequently, users of software are themselves discursively coded. To this end, I examine the discourse of those primarily responsible for the design and regulation of software---the software programming culture. To analyze the discourse of the software programming culture, I developed a spatio-temporal framework rooted in theories of practice and theories of space and time to guide both my choice of data and the methods by which I conduct analyses. In attempting to resist the objectivist/subjectivist dualism that so often limits accounts of how meaning is made through social practices, I employ historical, ideological, and genre analysis to contextualize and analyze the discourse of the software programming culture. My goal is to identify, describe, and map a network of meaning that simultaneously allows for stability and change. I argue that this network of meaning constitutes not just software but also the software programming culture as a discursive site of ideological struggle, the effects of which have significance for society as a whole. Unveiling the process by which software, as a technological and culture artifact, is discursively coded is a move toward digital literacy that is important for understanding the ways in which ideologies are embedded in the discourse of technological artifacts. In the case of software, I argue that such an understanding may allow even the least technologically-adept users to interrupt and challenge their own coding as digital subjects by the software programming culture and to cultivate a digital literacy that empowers users to have a voice in how their own lives are affected by the discursive coding of software.
Two-layer restoration scheme for IP over optical networks with MPLS
Authors: Ke Jia, L. Mason, Yang Qin
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

Wavelength division multiplexing (WDM) based IP networks will provide capacity for the explosive growth in IP traffic. Network reliability gains importance with the huge volume of traffic carried by such IP-over-WDM networks. Providing survivability at the optical layer is inherently attractive, but raises many questions and challenges, given similar mechanisms already exist at IP layer. The emergence of MPLS and its extension, MP/spl lambda/S, opens up new possibilities for developing simple integrated protection/restoration schemes that can be coordinated at both the IP and optical layers. This paper first presents an overview of existing MPLS/MP/spl lambda/S recovery mechanisms. Then we propose a joint two-layer recovery scheme for IP-centric WDM based optical networks where the optical layer will take the recovery actions first and subsequently the upper IP layer initiates its own recovery mechanism, if the optical layer does not restore all affected services. A simulation-based analysis shows the benefits of the proposed two-layer recovery scheme compared to the single layer recovery schemes.
A multi-disciplinary model for teaching the engineering product realization process
Authors: K. Collier
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Team-project based design courses have become popular in undergraduate engineering programs in recent years. These courses help students learn to work in teams, communicate effectively, and apply engineering principles to the product realization process. While the focus of such courses is on teaching sound engineering process methods, students often ignore process in an effort to complete the project thereby negating the pedagogical value of the experience. This paper describes a technique used in Northern Arizona University's Engineering Path to Synthesis Program to ensure that sound process methods are an integral part of a successful project. This technique involves a high degree of inter-team communication and documentation as well as the use of accepted engineering practices.