ppxscal/embedding_network huggingface dataset:
Hybrid Multiprocessing in OPTIMUL: A Multiprocessor for Distributed and Shared Memory Multiprocessing with WDM Optical Fiber Interconnections
Authors: Kanad Ghose, R. Kym Horsell, Nitin Singhvi
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

We present the key features of OPTIMUL (OPTically /nterconnected Mf/Ltiprocessor) - a multiprocessor architecture that implements a distributed shared memory mechanism using wavelength division multi-plexed (WDM) fiber optic buses. The OPTIMUL architecture also supports distributed memory style multiprocessing using the same high-speed message passing mechanisms that implement distributed shared memory. We show the efficiency of the resulting design by presenting the results of a fairly detailed trace-driven simulation of the performance of the proposed interconnection. We also briefly mention some of the engineering issues involved in the design of the WDM fiber bus. Our results seem to indicate that a WDM optical bus with 4 to 5 channels can provide linearly scalable performance for upto 150 CPUs.
Robust altitude estimation for over-the-horizon radar using a state-space model for multipath fading
Authors: R. H. Anderson
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 05 (2001)

In previous work, a matched-field estimate of aircraft altitude from multiple over-the-horizon radar dwells was presented. This approach exploits the altitude dependence of direct and surface reflected returns off the aircraft and the relative phase changes of these micro-multipath arrivals across radar dwells. Since this previous approach assumed high dwell-to-dwell predictability, it is sensitive to mismatch between modeled versus observed micro-multipath phase and amplitude changes from dwell-to-dwell. A generalized matched-field altitude estimate is presented based on a state-space model that accounts for random ionospheric and target-motion effects which degrade the dwell-to-dwell predictability of target returns. The new formulation results in an efficient, robust recursive maximum likelihood altitude estimate. Simulation and real data results suggest that the proposed technique can achieve an accuracy within 5000 ft. using 10-20 dwells, even with relatively high levels of uncertainty in modeling of dwell-to-dwell changes in the target return.
Cross-intensity functions and the estimate of spike-time jitter
Authors: Richard H. R. Hahnloser
Venue: Biological Cybernetics (2007)

Correlation measures are important tools for the analysis of simultaneously recorded spike trains. A well-known measure with probabilistic interpretation is the cross-intensity function (CIF), which is an estimate of the conditional probability that a neuron spikes as a function of the time lag to spikes in another neuron. The non-commutative nature of the CIF is particularly useful when different neuron classes are studied that can be distinguished based on their anatomy or physiology. Here we explore the utility of the CIF for estimating spike-time jitter in synaptic interactions between neuron pairs of connected classes. When applied to spike train pairs from sleeping songbirds, we are able to distinguish fast synaptic interactions mediated primarily by AMPA receptors from slower interactions mediated by NMDA receptors. We also find that spike jitter increases with the time lag between spikes, reflecting the accumulation of noise in neural activity sequences, such as in synfire chains. In conclusion, we demonstrate some new utility of the CIF as a spike-train measure.
QEF - Supporting Complex Query Applications
Authors: Fabio Porto, Othman Tajmouati, Vinicius F. V. Da Silva, Bruno Schulze, Fausto V. M. Ayres
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

This paper describes QEF a query evaluation framework designed to support complex applications on the grid. QEF has been extended to support querying within a number of different applications, including supporting scientific visualization and implementing a web service semantic search engine. Application requests take a form of a workflow in which tasks are represented as algebraic operators and specific data types are enveloped into a common tuple structure. The implemented system is automatically deployed into schedule grid nodes and autonomously manages query evaluation according to grid environment conditions. The generality of our approach has been tested with a number of applications leading to a full grid web service implementation available at http://codims.epfl.ch.
Detection of frequencies using least square error function
Authors: Qi Cheng
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 05 (1996)

We propose a new hypothesis testing method for detection of frequencies from a single measurement of data. The testing is performed on the least square error function. The global minimum value of the least square error function is shown to exhibit /spl chi//sup 2/ distribution which leads to an efficient threshold setup for the proposed method. The new method is a combined detection-estimation technique and provides improved performance over several existing techniques.
A Practical Low Interference Topology Control for Mobile Ad Hoc Networks
Authors: Xiang Yu, Xinming Zhang, Can Que, Qiong Liu
Venue: Proceedings of the Sixth International Conference on Networking (2007)

The interference imposes a potential negative impact on the performance of a wireless network. A device is interfered if it receives a transmission not intended for it. In this paper, we introduce an explicit computation model of node interference based on its actual inducement on the physical layer. We prove that there exists an optimal algorithm to solve the corresponding topology control problem, constructing a network topology with minimum node interference. We also investigate the bad performance of existing methods of solving it and propose a revised algorithm, namely Low Interference-amount Neighborhood Tree (LINT), based on a new link cost metric. The simulation results illustrate that our model is able to reduce node interference effectively and maintain the network performance.
Proceedings of the 2007 workshop on Grid monitoring
Venue: High Performance Distributed Computing (2007)

I am very happy to welcome you to the HPDC workshop on Grid Monitoring. Grid computing is evolving very rapidly both in terms of the amount of provided resources as well as in terms of the number of clients using the computational power, network and storage facilities provided by the Grid. Grid infrastructures of national, regional and international scope have been built over last years and have attracted users from scientific and industrial domains. Operating these infrastructures, increasing their scalability, reliability and performance is currently becoming a high priority task. It is not possible to fulfill these tasks without good monitoring aiming to increase the quality of the Grid infrastructures, the effectiveness of the use and the sharing of the provided resources as well as facilitating the everyday work of the operating teams. On the other hand the monitoring systems with simple, user-friendly interfaces will make users feel familiar with the Grid regardless of their level of expertise in Grid computing. All these arguments show the importance of Grid monitoring which will be discussed during the workshop. The program committee accepted 7 papers covering various aspects of Grid monitoring and describing systems monitoring local fabrics, Grid services, Grid infrastructures in general or providing monitoring view from the user perspective. We believe that the accepted papers summarize current experience and can serve as a reference for the developers of the Grid monitoring tools.
Performance evaluation of 1024 QAM signal transmission in cable television distribution systems by software demodulation method
Authors: N. Nakamura, T. Kurakake, K. Ovamada, S. Itoh
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

1024 QAM transmission characteristics in cable television distribution system is experimentally evaluated. 52.74 Mbps transmission in a 6 MHz cable television channel is achieved. Spectrum efficiency is 8.79 bit/s/Hz. The transmission performance on a 1024 QAM modem with high amplitude density and large capacity is demonstrated. MPEG-2 TS packets are derived by demodulation software from the IF signal received in a PC-based memory. Experimental result shows that the BER of 1024 QAM transmission without forward error correction is 10/sup -4/ at a CN ratio of 38 dB. The implementation loss is less than 2 dB. Furthermore, the distortion effect induced on a 1024 QAM in the presence of a non-linear amplifier is also discussed.
A secure routing protocol for ad hoc networks based on trust
Authors: Raquel Lacuesta Gilaberte, Lourdes Penalver Herrero
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

Routing protocols will be a fundamental piece in the operation of ad-hoc networks. These protocols must fulfil the main objective of using valid routes among the different nodes that form the net in a correct and efficient way keeping in mind the possibility that malicious nodes may exist in the net, and protecting the communication of non-allowed accesses. This work presents a proposal of a secure routing protocol adapted to spontaneous ad-hoc networks.
A joint demosaicking-zooming scheme for single chip digital color cameras
Authors: Lei Zhang, David Zhang
Venue: Computer Vision and Image Understanding (2007)

Demosaicking and zooming are important for the quality of digital images in resource-constrained single chip devices such as wireless camera phones and vision-based pocket devices. The color artifacts introduced in the demosaicking process can be magnified in the subsequent zooming process and vice versa. This paper presents a joint demosaicking-zooming scheme by exploiting the fact that red/green and blue/green color difference signals are much smoother than the original red, green and blue signals. The color difference signals are computed using the high spectral-spatial correlations in the color filter array (CFA) image. The computed color difference signals are used to recover the green channel, which is then enlarged using an edge guided zooming scheme. The enlarged red and blue channels are obtained by adding the correspondingly enlarged red/green and blue/green color difference images to the enlarged green channel. Experimental results show that the proposed joint demosaicking-zooming scheme performs well in both visual perception and PSNR measurement, suppressing many color artifacts arising from demosaicking as well as zippers and rings arising from zooming.
Speech analysis/synthesis/conversion by using sequential processing
Authors: B. Panuthat
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper presents a method for speech analysis/synthesis/conversion by using sequential processing. The aims of this method are to improve the quality of synthesized speech and to convert the original speech into another speech of different characteristics. We apply the Kalman filter for estimating the auto-regressive coefficients of 'time varying AR model with unknown input (ARUI model)', which we have proposed to improve the conventional AR model, and we use a band-pass filter for making 'a guide signal' to extract the pitch period from the residual signal. These signals are utilized to make the driving source signal in speech synthesis. We also use the guide signal for speech conversion, such as in pitch and utterance length. Moreover, we show experimentally that this method can analyze/synthesize/convert speech without causing instability by using the smoothed auto-regressive coefficients.
Genome Data Type: a Vehicle to Deliver a Genome Comparison System on the Web
Authors: Kwangmin choi, Amit Saple, Sun Kim
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

As more genomes become available, comparing multiple genomes is a very important research method in molecular biology which is useful not only for finding common features in different genomes, but also for understanding evolutionary process and mechanism among multiple genomes. However, it is challenging to develop a system for genome comparison since there are so many computational tools and databases which can be combined in numerous ways. In this paper, we discuss a bioinformatics system design principle by defining and using the genome data type and developing novel data mining algorithms based on the genome data type. Although many systems explored novel approaches for managing workflows among tools and databases in a flexible way, our approach of using the genome data type is unique among existing approaches. In particular, our approach is user-centric as domains and co-domains of the genome data type are what users are looking for. In addition, incorporation of novel data mining algorithms defined on the genome data type makes the genome comparison tasks simple and manageable, even on the web.
Should freshman engineering students be taught a programming language?
Authors: G. Bjedov
Venue: Proceedings of the 26th Annual Frontiers in Education - Volume 01 (1996)

Many first-year engineering curricula include a course in programming in a high-level language (such as FORTRAN, Pascal, C, or even C++). Such courses have traditionally been justified as teaching logical thinking and problem solving, while providing the students with tools that they will use as practicing engineers. However, these goals can be achieved more readily today through the use of modern mathematical software tools such as MATLAB. Such tools are more powerful and easier to master than a traditional programming language, allowing the students to solve interesting and challenging problems earlier in the course. Consequently, there is little reason to teach traditional programming languages to freshman, and many reasons not to.
Numerically-robust O(N/sup 2/) RLS algorithms using least-squares prewhitening
Authors: S. C. Douglas
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

We derive two new O(N/sup 2/) algorithms for arbitrary recursive least-squares (RLS) estimation tasks. The algorithms employ a novel update for an inverse square-root factor of the exponentially-windowed input signal autocorrelation matrix that is the least-squares equivalent of a natural gradient prewhitening algorithm. Both of the new RLS algorithms require 4N/sup 2/+O(N) multiply/adds, two divides, and one square root per iteration to implement. We can prove that our new algorithms are numerically-robust, and simulations are used to indicate this fact in fixed-point arithmetic. An algorithm that computes the square-root factorization of the input signal autocorrelation matrix is also described.
Interactive balance space approach for solving multi-level multi-objective programming problems
Authors: Mahmoud A. Abo-Sinna, Ibrahim A. Baky
Venue: Information Sciences: an International Journal (2007)

This paper studies a multi-level multi-objective decision-making (ML-MODM) problems with linear or non-linear constraints. The objective functions at each level are non-linear functions, which are to be maximized or minimized. This paper presents a three-level multi-objective decision-making (TL-MODM) model and an interactive algorithm for solving such a model. The algorithm simplifies three-level multi-objective decision-making problems by transforming them into separate multi-objective decision making problems at each level, thereby avoiding the difficulty associated with non-convex mathematical programming. Our algorithm is an extension of the work of Shi and Xia [X. Shi, H. Xia, Interactive bi-level multi-objective decision making, Journal of the Operational Research Society 48 (1997) 943-949], which dealt with interactive bi-level multi-objective decision-making problems, with some modifications in assigning satisfactoriness to each objective function in all the levels of the TL-MODM problem. Also, we solve each separate multi-objective decision making problem of the TL-MODM problem by the balance space approach. A new formula is introduced to interconnect the satisfactoriness and the proportions of deviation needed to reflect the relative importance of each objective function. Thus, we have the proportions of deviation including satisfactoriness. In addition, we present new definitions for the satisfactoriness and the preferred solution in view of singular-level multi-objective decision making problems that corresponds to the @h-optimal solution of the balance space approach. Also, new definitions for the feasible solution and the preferred solution (@h-optimal point) of the TL-MODM problem are presented. An illustrative numerical example is given to demonstrate the algorithm.
Total Removal of Baseline Drift from ECG Signal
Authors: V. S. Chouhan, S. S. Mehta
Venue: Proceedings of the International Conference on Computing: Theory and Applications (2007)

Baseline drift in ECG signal is the biggest hurdle in visualization of correct waveform and computerized detection of wave complexes based on threshold decision. The baseline drift may be linear, static, non-linear or wavering. Reducing the baseline drift to a near zero value greatly helps in visually inspecting the morphology of the wave components as well as in computerized detection and delineation of the wave complexes. The algorithm is developed for computer implementation using MATLAB. It deploys least squares error correction and correction based on overall median of individual single lead data, to reduce baseline drift. QRS complexes are then detected to find RR intervals of the waveform. Finally, median based correction is implemented in the RR interval and a drift free signal is achieved. This can help cardiologists significantly.
A C/V segmentation algorithm for Mandarin speech signal based on wavelet transforms
Authors: H. Tolba
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 01 (1999)

This paper proposes a new consonant/vowel (C/V) segmentation algorithm for Mandarin speech signal. Since the Mandarin phoneme structure is a combination of a consonant (may be null) followed by a vowel, the C/V segmentation is an important part in the Mandarin speech recognition system. Based on the wavelet transform, the proposed method can directly search for the C/V segmentation point by using a product function and energy profile. The product function is generated from the appropriate wavelet and scaling coefficients of the input speech signal, and it can be applied to indicate the C/V segmentation point. With this product function and the additional verification of the energy profile, the C/V segmentation can be accurately pointed out with a low computation complexity. Experiments are provided that demonstrate the superior performance of the proposed algorithm. An overall accuracy rate of 97.2% is achieved. This algorithm is suitable for Mandarin speech recognition task.
An ECO Technique for Removing Crosstalk Violations in Clock Networks
Authors: Amit Kumar, Krishnendu Chakrabarty, Chunduri Rama Mohan
Venue: Proceedings of the 20th International Conference on VLSI Design held jointly with 6th International Conference: Embedded Systems (2007)

Crosstalk noise in the clock network of digital circuits is often detected late in the design cycle, sometimes as late as after first silicon. It is therefore necessary to fix crosstalk violations in the clock tree by making minimal design changes and maintaining skew bounds. We propose a novel approach for making Engineering Change Order (ECO) changes in the clock network to remove crosstalk violations. A two-pronged approach based on wire-translocation and rerouting is presented. Wire translocation, i.e., changing the track for a net to another free track with less crosstalk, eliminates a large percentage of removable violations. A linear time procedure to check if a violation is removable by translocation is developed. Next, an efficient rerouting method based on an incremental loci-finding algorithm is combined with linear time dynamic programming approach to eliminate the remaining crosstalk violations. Simulation results for randomly-generated clock tree of different sizes and benchmark circuits demonstrate the effectiveness of this approach.
Efficient algorithms for wireless sensor and satellite communication networks
Authors: Stuart C. Schwartz, Sanjeev R. Kulkarni
Venue:  (2006)

This dissertation investigates two major topics: distributed, energy efficient algorithms for inference applications in wireless sensor networks and heuristic, computation efficient algorithms for the oversubscribed job scheduling problems in satellite communication networks. Energy efficient algorithms in wireless sensor networks. The distributed nature of wireless sensor networks illustrates classical engineering tradeoffs: how to minimize energy cost while maintaining acceptable performance levels in detection, estimation, and optimization applications. In this thesis, a wireless sensor network with a fusion center is considered to study the energy-accuracy tradeoff in the context of the following problems: distributed quickest detection, distributed parameter estimation with dependent observations, and distributed incremental parameter estimation with clustering. Since most of the energy consumption in a wireless sensor network is in communication and not in computation, sending all data to a fusion center is the most costly, but leads to optimum performance results. Processing data at each sensor and sending parameter estimates and associated quality measures is a reasonable communication saving procedure and yet, in some cases, may lead to performance that is equivalent to sending all data to the fusion center. A sequential procedure is most parsimonious in terms of communication cost and especially effective in large wireless sensor networks. The focus is to develop distributed, energy efficient algorithms where communication transport cost is significantly reduced while incurring little or no loss in performance. Computation efficient algorithms in satellite communication networks . In a satellite communication network, the role of the satellite is to relay the information collected by the sensor network to the command station. However, due to the sheer size and the enormous data gathering capabilities of a sensor network, instances exist where the amount of data greatly exceed the bandwidth that can be accommodated by the satellite communication link. Hence, some data must be discarded and the scheduling becomes oversubscribed. In many of the simplest cases, the oversubscribed job scheduling problem is non-deterministic polynomial-time hard. In this thesis, a systematic method of solving the oversubscribed job scheduling problem is introduced. Also, the original framework is extended by considering new heuristic measures that better capture the data traffic transmission model. The focus is to develop heuristic, computation efficient algorithms that perform close to the optimal solution and schedule the jobs in polynomial time.