ppxscal/embedding_network huggingface dataset:
Nonlinear 3D and 2D Transforms for Image Processing and Surveillance
Authors: Yosef Gavriel Tirat-Gefen
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

Linear transforms such as bidimensional and tridimensional spatial Fourier transforms for image applications have their limitations due to the uncertainty principle. Also, Fourier transforms allow the existence of negative luminance, which is not physically possible. Wavelet transforms alleviate that through the use of a non-negative wavelet function base, but it still leads to wide spectrum representations. This paper discusses the deployment of new nonlinear methods such as Hilbert-Huang transform for low-cost embedded applications using microprocessors and field programmable gate arrays. Basically, we extract a set of intrinsic mode functions (IMFs), which represent the spectrum of the 3D or 2D scene of a space using these functions as a Hilbert base. Immediate applications for our low cost high performance hardware oriented architecture include image processing for biomedical applications (e.g. pattern recognition and image compression telemedicine) and surveillance.
Advanced Optimizations for VQ Compression on Parallel Systems
Authors: Akiyoshi Wakatani
Venue: Proceedings of the 2007 Data Compression Conference (2007)

Recently, parallel processing technologies have been applied to a variety of applications to boost its performance. We implemented a parallel algorithm with "double strip-mining method of optimal codeword search for VQ compression on a shared-memory parallel environment and evaluated the effectiveness of the parallel algorithm. Namely, by applying strip-mining method to a loop with regard to vectors as well as that to codewords (double strip-mining), the buffer area, which keeps the intermediate results, can be dramatically reduced and the results of our experiments find that this method can keep the same performance as the original strip-mining method in terms of the elapsed time. As shown in Figure 1-(b), the p-dist algorithm with the double strip-mining method outperforms the c-dist algorithm by over 10%, when the size of strip-mining is enough large.
On the Complexity of Register Coalescing
Authors: Florent Bouchez, Alain Darte, Fabrice Rastello
Venue: Proceedings of the International Symposium on Code Generation and Optimization (2007)

Memory transfers are becoming more important to optimize, for both performance and power consumption. With this goal in mind, new register allocation schemes are developed, which revisit not only the spilling problem but also the coalescing problem. Indeed, a more aggressive strategy to avoid load/store instructions may increase the constraints to suppress (coalesce) move instructions. This paper is devoted to the complexity of the coalescing phase, in particular in the light of recent developments on the SSA form. We distinguish several optimizations that occur in coalescing heuristics: a) aggressive coalescing removes as many moves as possible, regardless of the colorability of the resulting interference graph; b) conservative coalescing removes as many moves as possible while keeping the colorability of the graph; c) incremental conservative coalescing removes one particular move while keeping the colorability of the graph; d) optimistic coalescing coalesces moves aggressively, then gives up about as few moves as possible so that the graph becomes colorable again. We almost completely classify the NP-completeness of these problems, discussing also on the structure of the interference graph: arbitrary, chordal, or k-colorable in a greedy fashion. We believe that such a study is a necessary step for designing new coalescing strategies.
Efficient design of families of FIR filters by transformation
Authors: L. J. Karam
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 03 (1996)

This paper introduces an efficient technique for designing a parameterized family of one- and multi-dimensional filters by regarding it as a single multi-dimensional filter. The new design technique is very fast since it reduces the design of a large set of filters to the design of a complex or real one-dimensional filter which is then mapped to produce the desired set of filters. It has the additional advantage that the one- and multi-dimensional filters in the set can be designed and realized efficiently without having to explicitly compute the coefficients of the separate filters. Among the types of filters which can be designed with this technique are seismic migration filters and linear-phase filters.
Spectra-a hands-on DSP learning experience
Authors: F. Taylor
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 02 (1996)

This paper describes the integration of cooperative learning and hands-on learning in a senior level course and laboratory. The course is based upon the innovative use of personal CBI tools, a low-cost personal DSP workstation, and real-world DSP microprocessor studies. Elements of this technology are also being used in a junior-level signals and systems course, a senior design laboratory, and several graduate courses. In addition to traditional student evaluation techniques, portfolio assessment was also used in order to provide an effective method of individual evaluation despite the confounding influence of cooperative learning.
Optimal phase parameter estimation of random amplitude linear FM signals using cyclic moments
Authors: M. Morelande
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

This paper considers the problem of estimating the phase parameters of a linear FM signal which is modulated by a random process and is embedded in additive noise. In particular, we consider the use of cyclic moments and derive variance expressions for the phase parameter estimates for all values of the lag parameter of the second order cyclic moment, /spl tau/. It is seen that the accuracy of the phase parameter estimates depends greatly on /spl tau/. This allows the definition of an optimal value of /spl tau/, in the sense that it minimises the phase parameter estimation variance. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Node Stability in Dynamic Communication Networks
Authors: Matthias R. Brust, Steffen Rothkugel, Adrian Andronache
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. Neighboring devices elect one appropriate device as clusterhead. Due to the dynamic environment, clusterhead selection becomes an important issue. We consider the problem of appropriate clusterhead selection in wireless ad-hoc networks and sensor networks. This work analyzes synchronous as well as asynchronous heuristics for discovering nodes with prolonged topological stability. These nodes appear more appropriate to be elected as clusterheads, since the frequency of clusterhead re-election and re-clustering can be decreased. The heuristics described rely on 2-hop topological information and avoid any use of geographical data.
Modelling of the deposition of retardant in a tree crown during fire fighting
Authors: D. Calogine, N. Rimbert, O. Séro-Guillaume
Venue: Environmental Modelling Software (2007)

In this work we propose an approach for estimating the deposition of retardant in vegetation during fire fighting by aerial dropping. Firstly we define the geometrical structure of a tree using fractal interpolation. Once this structure has been defined a mesh is constructed and the flow of retardant is then computed using a simple V.O.F. model. Estimation of the quantity of retained liquid is calculated with a so called ''dripping model''. The results of the two approaches are compared and it is shown that they provide coherent results.
Development in QoS control for video communication
Authors: M. R. Ito, Y. Bai
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

Quality of service (QoS) guarantees can be provided within a network by relying on the integrated services, differentiated services, and active networking approaches. The three approaches are presented in several papers, but none provide a comparison between all of them. Therefore, this paper overviews the key functionality and the relative strengths and weaknesses of video-specific QoS control techniques based on the three approaches. This overview discusses both academic research and practice in the industry. The quality assurance and scalability of the three approaches are then compared. Finally, future research directions on each approach are suggested.
Synchronized background music generation for video
Authors: Jong-Chul Yoon, In-Kwon Lee
Venue: Proceedings of the international conference on Advances in computer entertainment technology (2007)

We synchronize background music with a video by changing the timing of music, an approach that minimizes the damage to music data. Starting from a MIDI file and video data, feature points are extracted from both sources, paired, and then synchronized using dynamic programming to time-scale the music. We also introduce the music graph, a directed graph that encapsulates connections between many short music sequences. By traversing a music graph, we cangenerate large amounts of new background music, in which we expect to find a sequence which matches the video features better than the original music.
Dynamic critical resistance: a timing-based critical resistance model for statistical delay testing of nanometer ICs
Authors: J. L. Rosselló, C. de Benito, S. A. Bota, J. Segura
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

As CMOS IC feature sizes shrink down to the nanometer regime, the need for more efficient test methods capable of dealing with new failure mechanisms increases. Advances in this domain require a detailed knowledge of these failure physical properties and the development of appropriated test methods. Several works have shown the relative increase of resistive defects (both opens and shorts), and that they mainly affect circuit timing rather than impacting its static DC behavior. Defect evolution, together with the increase of parameter variations, represents a serious challenge for traditional delay test methods based on fixed time delay limit setting. One alternative to deal with variation relies on adopting correlation where test limits for one parameter are settled based on its correspondence to other circuit variables. In particular, the correlation of circuit delay to reduced VDD has been proposed as a useful test method. In this work we investigate the merits of this technique for future technologies where variation is predicted to increase, analyzing the possibilities of detecting resistive shorts and opens.
Design of a high-speed optical interconnect for scalable shared memory multiprocessors
Authors: A. K. Kodi, A. Louri
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

The paper proposes a highly connected optical interconnect based architecture that maximizes the channel availability for future scalable parallel computers, such as distributed shared memory (DSM) multiprocessors and cluster networks. As the system size increases, various messages (requests, responses and acknowledgments) increase in the network resulting in contention. This results in increasing the remote memory access latency and significantly affects the performance of these parallel computers. As a solution, we propose an architecture called RAPID (reconfigurable and scalable all-photonic interconnect for distributed-shared memory), that provides low remote memory access latency by providing fast and efficient unicast, multicast and broadcast capabilities using a combination of aggressively designed WDM, TDM and SDM techniques. We evaluated RAPID based on network characteristics and by simulation using synthetic traffic workloads and compared it against other networks such as electrical ring, torus, mesh and hypercube networks. We found that RAPID outperforms all networks and satisfies most of the requirements of parallel computer design such as low latency, high bandwidth, high connectivity, and easy scalability.
Analysis of SNR threshold for differential Doppler frequency measurement in digital receivers
Authors: S. D. Howard
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

There is a signal-to-noise ratio (SNR) below which the frequency of a coherent radar pulse train can be estimated no more accurately than the incoherent combination of the frequency estimates from the individual pulses. This SNR threshold applies to all frequency estimators, and defines a fundamental limit for passive location of radar emitters using differential Doppler. In this paper, an approximation to the estimation variance of any maximum likelihood (ML) type estimator is derived. The approximation is shown to be a very good predictor of the mean square error performance of ML estimators and the SNR at which the threshold occurs. A rigorous Barankin bound on any unbiased estimator of frequency is derived and compared to the above approximate estimation variance.
Extrapolation errors in linear model trees
Authors: Wei-Yin Loh, Chien-Wei Chen, Wei Zheng
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2007)

Prediction errors from a linear model tend to be larger when extrapolation is involved, particularly when the model is wrong. This article considers the problem of extrapolation and interpolation errors when a linear model tree is used for prediction. It proposes several ways to curtail the size of the errors, and uses a large collection of real datasets to demonstrate that the solutions are effective in reducing the average mean squared prediction error. The article also provides a proof that, if a linear model is correct, the proposed solutions have no undesirable effects as the training sample size tends to infinity.
Existence of positive solution to a singular second-order initial value problem with impulses
Authors: Jianli Li, Jianhua Shen
Venue: Journal of Computational and Applied Mathematics (2007)

This paper deals with the existence of positive solutions to singular initial value problem with impulse effects. The right-hand side of the differential equation can be singular in its dependent variable.
Mass detection and classification in breast ultrasound images
Authors: Heng-Da Cheng
Venue:  (2006)

Breast cancer can be most effectively treated when detected during its early stages. Currently, the most effective method for early detection and screening of breast cancer is X-ray mammography. But the high number of false positives in mammography causes a lot of unnecessary biopsies. Sonography is an important adjunct to mammography in breast cancer detection and has been primarily useful for differentiating cysts from solid tumors. It has been shown that breast sonography is superior to mammography in its ability to detect focal abnormalities in the dense breasts of adolescent women. The accuracy rate of breast ultrasounds can reach a high level in the diagnosis of simple benign cysts and reduce the number of false positives. The lesions characterized as benign cysts do not require biopsies.This research focuses on developing a novel computer-aided diagnosis system of mass detection and classification in breast ultrasound images using statistical methods. First, we propose a novel, automatic enhancement approach to preprocess the regions of interest in breast ultrasound images. Next, a Markov random field segmentation algorithm is developed to segment the suspicious areas from the regions of interest. Third, three kinds of features, including textural features, fractal dimensions, and histogram-based features, are analyzed and extracted based on the suspicious areas and regions of interest, and a stepwise regression method is used to select an optimal subset of features. Fourth, based on the optimal subset of features, we develop a novel classification method based on the fuzzy support vector machines to classify the regions of interest as benign or malignant masses. Finally, two objective evaluation methods, five objective indices, and the receiver operating characteristic curve are used to evaluate the performance of the proposed computer-aided diagnosis system. The experimental results show that the proposed computer-aided diagnosis system greatly improves the five objective indices and the value of Az (the area under the receiver operating characteristic curve), as opposed to other classification methods and radiologists' assessments. Our method's ability to improve the accuracy of breast cancer diagnosis while reducing the number of unnecessary biopsies is a valuable tool for patients and radiologists alike.
A Conceptual Design of an Adaptive and Collaborative E-Work Environment
Authors: Obinna Anya, Hissam Tawfik, Atulya Nagar
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

Emerging work models increasingly take the form of loosely structured, often self-organising networks of nimble and virtual knowledge work teams within and between organisations. To model such work patterns requires a different approach from that of traditional workflow management systems. This paper presents the conceptual design of a prototype adaptive and collaborative e-Work environment -- e-Workbench, which we are currently developing to enable future collaborative workspaces to adapt to emerging knowledge work models. We argue that with appropriate knowledge of tasks, workspaces will be able to adapt to work, and automatically retrieve contextually relevant knowledge elements from the Web in order to contribute creatively to problem solving and semantically manage shared information among collaborating workers. Our goal is to enable e-Workbench to become, not only a working environment but also, a collaborator and a co-worker as a result of its knowledge of work and creative participation in problem solving.
A New Adaptive Congestion Control Mechanism for the Internet Based on RED
Authors: F. Al-Raddady, Mike Woodward
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

One of the main challenges in the internet backbone is to provide an adequate quality of service (QoS) and this can be done by either adopting a suitable buffer management method or by QoS routing. One of the popular buffer management algorithms used is random early detection (RED) which falls into the category of Active Queue Management (AQM) algorithms. There are many variant algorithms based on RED including adaptive RED and in this paper a new AQM algorithm which depends on changing the maximum dropping probability in a way that has been shown by simulation to have a similar throughput and lower delay than either RED or adaptive RED is proposed.
A performance comparison of UNIX operating systems on the Pentium
Authors: Kevin Lai, Mary Baker
Venue: Proceedings of the 1996 annual conference on USENIX Annual Technical Conference (1996)

This paper evaluates the performance of three popular versions of the UNIX operating system on the x86 architecture: Linux, FreeBSD, and Solaris. We evaluate the systems using freely available micro- and application benchmarks to characterize the behavior of their operating system services. We evaluate the currently available major releases of the systems "asis," without any performance tuning. Our results show that the x86 operating systems and system libraries we tested fail to deliver the Pentium's full memory write performance to applications. On small-file workloads, Linux is an order of magnitude faster than the other systems. On networking software, FreeBSD provides two to three times higher bandwidth than Linux. In general, Solaris performance usually lies between that of the other two systems. Although each operating system out-performs the others in some area, we conclude that no one system offers clearly better overall performance. Other factors, such as extra features, ease of installation, or freely available source code, are more convincing reasons for choosing a particular system.
Synesthetic music experience communicator
Authors: James Oliver
Venue:  (2006)

The Synesthetic Music Experience Communicator combines research in the areas of human computer interaction, music technology, and human perception to illustrate the experience of synesthesian mental imagery in response to musical sounds. Synesthesian musicians have reported positive benefits from their augmented awareness of sound in the areas of pitch identification, memorization, composition, and improvisation. This dissertation attempts to communicate both the experience and performance benefits associated with this cognitive phenomenon. Several virtual worlds have been developed to explore group education, rehearsal, and the artistic transformation of live performances into informative and entertaining visual presentations. Initial inspirations, background research, development stages, iterations, user evaluation, and future directions are discussed. Two virtual reality prototype systems are overviewed. The first demonstrates chromesthetic translations of real-time Musical Instrument Digital Interface (MIDI) events. The second demonstrates real-time transformations of multi-band Fast Fourier Transform processed audio into visual scenery. Observations and feedback about the initial prototype systems are summarized. Three systems are proposed which expand the initial prototypes and demonstrate concepts for computer augmented ensemble rehearsals. The Synesthetic Visualizer modules combine real-time audio and MIDI data to demonstrate synesthesia and photism-like imagery. The Computer Augmented Percussion Trainer and Small Ensemble Trainer are proposed to augment musical practices and rehearsals by providing real-time displays of ensemble members' performances and displaying transformations between instrument fingerings. An introductory user study is conducted to determine which aspects of music are best communicated by the visual displays and to evaluate the potential benefits of this synesthetic approach. The user study asks participants to consider this research in relationship to existing music visualization and education methods. Exhibitions and publication efforts are reviewed. The user study, observations, and exhibitions serve to validate the core hypothesis of this research. The dissertation concludes by proposing an intelligent interactive synesthetic software agent to facilitate profile driven multimedia content creation.
Note: What power of two divides a weighted Catalan number?
Authors: Alexander Postnikov, Bruce E. Sagan
Venue: Journal of Combinatorial Theory Series A (2007)

Given a sequence of integers b=(b"0,b"1,b"2,...) one gives a Dyck path P of length 2n the weightwt(P)=b"h"""1b"h"""2...b"h"""n, where h"i is the height of the ith ascent of P. The corresponding weighted Catalan number isC"n^b=@?Pwt(P), where the sum is over all Dyck paths of length 2n. So, in particular, the ordinary Catalan numbers C"n correspond to b"i=1 for all i>=0. Let @x(n) stand for the base two exponent of n, i.e., the largest power of 2 dividing n. We give a condition on b which implies that @x(C"n^b)=@x(C"n). In the special case b"i=(2i+1)^2, this settles a conjecture of Postnikov about the number of plane Morse links. Our proof generalizes the recent combinatorial proof of Deutsch and Sagan of the classical formula for @x(C"n).