ppxscal/embedding_network huggingface dataset:
Intelligent Content-Aware Model-Free Low Power Evoked Neural Signal Compression
Authors: Chen Han Chung, Yu-Chieh Kao, Liang-Gee Chen, Fu-Shan Jaw
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

Neural recording is an important key for us to realize the neuron activity, and multi-channel recording will be more and more crucial. However, nowadays research can only deal with spontaneous signals, which characteristics are far different from evoked signals. For evoked signals, we cannot just judge the spike at the front-end because evoked signals can't be distinguished by recent spike sorting algorithm. Then, we need to send "full" waveform for bio-researchers. Therefore, proper compression algorithm is unavoidable due to full waveform transmission creates huge data amount. We use signal processing skills to get the targets for lossless compression, SNR>25db, and compression rate (compressed data / origin data)<25%.
High K dielectric resonator antenna
Authors: Nicolaescu Ioan, Ioachim Andrei, Toacsan Irina, Raduionut Raduionut, Banciu Gabriel
Venue: Proceedings of the 5th conference on Applied electromagnetics, wireless and optical communications (2007)

The microwaves are used for both civilian and military applications for communication and detection. Due to the emerging applications and the need for more bandwidth as well as for high speed, there is a strong competition for ultra high frequencies devices. As it is know the size of different kind of microwave components is in a certain relation with the wavelength divided by root square of the dielectric permittivity. So the size of microwave component can be decreased by increasing the dielectric permittivity. Dielectric materials based on TiO2 are recommended for applications in electromagnetism and optics due to their nonlinear properties, to high value of the dielectric permittivity and their temperature behavior. The paper describes very shortly the techology applied to manufacture high dielectric permittivity materials based on TiO2 and a dielectric resonator antenna manufactured with these materials. The experimental data measured for dielectric antenna are presented.
A Probabilistic Method for Point Matching in the Presence of Noise and Degeneracy
Authors: Daniel Keren
Venue: Journal of Mathematical Imaging and Vision (2009)

The Bayesian method is widely used in image processing and computer vision to solve ill-posed problems. This is commonly achieved by introducing a prior which, together with the data constraints, determines a unique and hopefully stable solution. Choosing a "correct" prior is however a well-known obstacle.This paper demonstrates that in a certain class of motion estimation problems, the Bayesian technique of integrating out the "nuisance parameters" yields stable solutions even if a flat prior on the motion parameters is used. The advantage of the suggested method is more noticeable when the domain points approach a degenerate configuration, and/or when the noise is relatively large with respect to the size of the point configuration.
Joint Multicast Routing and Channel Assignment in Multiradio Multichannel Wireless Mesh Networks Using Simulated Annealing
Authors: Hui Cheng, Shengxiang Yang
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper proposes a simulated annealing (SA) algorithm based optimization approach to search a minimum-interference multicast tree which satisfies the end-to-end delay constraint and optimizes the usage of the scarce radio network resource in wireless mesh networks. In the proposed SA multicast algorithm, the path-oriented encoding method is adopted and each candidate solution is represented by a tree data structure (i.e., a set of paths). Since we anticipate the multicast trees on which the minimum-interference channel assignment can be produced, a fitness function that returns the total channel conflict is devised. The techniques for controlling the annealing process are well developed. A simple yet effective channel assignment algorithm is proposed to reduce the channel conflict. Simulation results show that the proposed SA based multicast algorithm can produce the multicast trees which have better performance in terms of both the total channel conflict and the tree cost than that of a well known multicast algorithm in wireless mesh networks.
2-ANTBAL: An ant colony optimisation algorithm for balancing two-sided assembly lines
Authors: Ana S. Simaria, Pedro M. Vilarinho
Venue: Computers and Industrial Engineering (2009)

Two-sided assembly lines are a special type of assembly lines in which workers perform assembly tasks in both sides of the line. This type of lines is of crucial importance, especially in the assembly of large-sized products, like automobiles, buses or trucks, in which some tasks must be performed at a specific side of the product. This paper presents an approach to address the two-sided mixed-model assembly line balancing problem. First, a mathematical programming model is presented to formally describe the problem. Then, an ant colony optimisation algorithm is proposed to solve the problem. In the proposed procedure two ants 'work' simultaneously, one at each side of the line, to build a balancing solution which verifies the precedence, zoning, capacity, side and synchronism constraints of the assembly process. The main goal is to minimise the number of workstations of the line, but additional goals are also envisaged. The proposed procedure is illustrated with a numerical example and results of a computational experience that exhibit its superior performance are presented.
Anomaly Detection Support Vector Machine and Its Application to Fault Diagnosis
Authors: Ryohei Fujimaki
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We address the issue of classification problems in the following situation: test data include data belonging to unlearned classes. To address this issue, most previous works have taken two-stage strategies where unclear data are detected using an anomaly detection algorithm in the first stage while the rest of data are classified into learned classes using a classification algorithm in the second stage. In this study, we propose Anomaly Detection Support Vector Machine (ADSVM) which unifies classification and anomaly detection. ADSVM is unique in comparison with the previous work in that it addresses the two problems simultaneously. We also propose a multiclass extension of ADSVM that uses a pairwise voting strategy. We empirically present that ADSVM outperforms two-stage algorithms in application to an real automobile fault dataset, as well as to UCI benchmark datasets.
Comparing measures of model selection for penalized splines in Cox models
Authors: Elizabeth J. Malloy, Donna Spiegelman, Ellen A. Eisen
Venue: Computational Statistics Data Analysis (2009)

This article presents an application and a simulation study of model fit criteria for selecting the optimal degree of smoothness for penalized splines in Cox models. The criteria considered were the Akaike information criterion, the corrected AIC, two formulations of the Bayesian information criterion, and a generalized cross-validation method. The estimated curves selected by the five methods were compared to each other in a study of rectal cancer mortality in autoworkers. In the stimulation study, we estimated the fit of the penalized spline models in six exposure-response scenarios, using the five model fit criteria. The methods were compared on the basis of a mean squared error score and the power and size of hypothesis tests for any effect and for detecting nonlinearity. All comparisons were made across a range in the total sample size and number of cases.
Tailored Transmissions for Efficient Near-Video-On-Demand Service
Authors: Yitzhak Birk, Ron Mondri
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

Near-Video-On-Demand (NVOD) entails the provision of viewing flexibility that approaches that of VOD to an unlimited number of viewers of a ?hot? movie at a fixed cost to the provider. This presents an exciting opportunity to service providers, especially when employing broadcast channels such as cable television and satellites. Unlike previous NVOD schemes, which were all highly structured, we employ an algorithmic approach to produce Tailor-Made transmission schemes that dominate all previous ones in both resource consumption and flexibility. The ability to tailor the transmissions to match resource availability is often key to the practicality of the service in a given environment. The design algorithms have been coded, and a prototype has been constructed.
Vehicle Detection and Counting by Using Real Time Traffic Flux through Differential Technique and Performance Evaluation
Authors: H. S. Mohana, M. Ashwathakumar, G. Shivakumar
Venue: Proceedings of the 2009 International Conference on Advanced Computer Control (2009)

This paper is dedicated to detecting and counting vehicles in day environment by using real time traffic flux through differential techniques. The basic idea used is variation in the traffic flux density due to presence of vehicle in the scene. In the present work a simple differential algorithm is designed and tested with vehicle detection and counting application. Traffic flux estimation will play vital role in implementing vehicle detection and counting scheme. Real time dynamic scene analysis has become very important aspect as the increase in video analysis. The technique developed is having simple statistical background. Dynamic selection of images from the sequence is implemented successfully in order to reduce the computation time. The designed technique are evaluated such a 20 different video sequences and weighed thoroughly with simple confidence measures. In the present work we have achieved real time analysis with normal video rate of 15 and 30 frames per second. And for vehicle count computation we are taking specific frame period (such as 2,5,10 etc), normal subtraction for vehicle count done on the basis of frame period. The result produced with this analysis is extremely good and beneficial in real time traffic control, detecting and counting vehicles in urban areas. MATLAB image processing tool box is explored to implement the technique. In the normal condition the average accuracy raised near to 95%.
Clock buffer polarity assignment combined with clock tree generation for power/ground noise minimization
Authors: Yesin Ryu, Taewhan Kim
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

A new approach to the problem of clock buffer polarity assignment for minimizing power/ground noise on the clock network is presented. The previous approaches solve the assignment problem in two separate steps: (step 1) generating a clock routing tree of minimum total wirelength, satisfying the clock skew constraint and then (step 2) inserting buffering elements with their polarities under the objective of minimizing power/ground noise while satisfying the clock skew constraint. Yet, there is no easy way to predict the result of step 2 during step 1. In our approach, we place the primary importance on the cost of power/ground noise. Consequently, we try to minimize the cost of power/ground noise first and then to construct a clock routing tree later while satisfying the clock skew constraint. Through experimentation using several benchmark circuits, it is shown that this approach is quite effective and produces very good solutions, reducing the power/ground noise by 75% and the peak current by 26% at the expense of 5% wirelength overhead compared to that produced by the conventional approach.
Automatic Music Transcription for a Trio Using Stereo Musical Sound Signal
Authors: Akihiro Miwa, Satoru Morita
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

While the automatic music transcription has been researched recently. it is dificult to make a melody s- core in case of many instructions because it is difficult to separate a music source from many music sources.In this paper, we describe the method of automatic music transcription for a trio using stereo musical sound signal. We estimate where the music sources exist and separate a music source from many music sources made by the ratio between left and right volume. In practice, we treat to a trio and put two musical instruments in the left side and the right side of a music source.
TIG: a utility for generating course web pages and a case study for teaching data structures
Authors: Ali Erkan
Venue: Journal of Computing Sciences in Colleges (2009)

In this paper, we discuss a web page generation tool called TIG for academic professionals in general and Computer Scientists in particular. TIG has been designed to (i) minimize the time it takes to create aesthetically pleasing and calendar based course pages that effectively disseminate instructional material, and to (ii) allow the instructor to focus on the arrangement of this material on his/her computer rather than the storage space of a courseware system. After an outline of the basic operation and significant features of the program, we overview the use of its implementation as a case study in our Data Structures and Algorithms courses.
Resource Matching in Non-dedicated Multicluster Environments
Authors: Josep Lluis Lérida, Francesc Solsona, Francesc Giné, Jose Ramon García, Porfidio Hernández
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

We are interested in making use of Multiclusters to execute parallel applications. The present work is developed within the M-CISNE project. M-CISNE is a non-dedicated and heterogeneous Multicluster environment which includes MetaLoRaS, a two-level MetaScheduler that manages the appropriate job allocation to available resources.In this paper, we present a new resource-matching model for MetaLoRaS, which is aimed at mitigating the degraded turnaround time of co-allocated jobs, caused by the contention on shared inter-cluster links. The model is linear programming based and considers the availability of computational resources and the contention of shared inter and intra-cluster links. Its goal is to minimize the average turnaround time of the parallel applications without disturbing the local applications excessively and maximize the prediction accuracy.We also present a parallel job model that takes both computation and communication characterizations into account. By doing this, greater accuracy is obtained than in other models only focused on one of these characteristics.Our preliminary performance results indicate that the linear programming model for on-line resource matching is efficient in speed and accuracy and can be successfully applied to co-allocate jobs across different clusters.
Semantic Analysis for the Geospatial Web --- Application to OWL-DL Ontologies
Authors: Alina-Dia Miron, Jérôme Gensel, Marlène Villanova-Oliver
Venue: Proceedings of the 8th International Symposium on Web and Wireless Geographical Information Systems (2008)

Towards the concretization of Egenhofer's idea of a future Geospatial Semantic Web, an important limitation is the absence of spatial and temporal reasoners capable of combining quantitative and qualitative knowledge for inferring new relations between individuals described in OWL or RDF(S) ontologies. As a first response to this limitation, we propose the use of the ONTOAST system, a spatio-temporal ontology modeling and semantic query environment compatible with OWL-DL. In this paper we illustrate the practical use of ONTOAST for querying the Geospatial Semantic Web in order to discover semantic associations between individuals. We present problems we have encounter when handling spatial and temporal knowledge described in OWL-DL as well as the solutions we have adopted.
Photonic quantum ring laser of 3D whispering cave mode
Authors: O'Dae Kwon, D. K. Kim, J. H. Yoon, Y. C. Kim, Y. H. Jang, M. H. Shin
Venue: Microelectronics Journal (2009)

A new whispering cave mode (WCM), a three-dimensional (3D) case of Lord Rayleigh's 2D whispering gallery modes, based upon 3D total internal reflection is presented, where GaAs quantum well (QW) near-vertical microdisk resonators exhibit a strong carrier-photon coupling for the QW carriers located in the Rayleigh band, generating 2D-to-1D carrier phase transitions of photonic quantum ring (PQR). It is a 'photonic' quantum corral effect (PQCE), whose simulation work produces a tangled web pattern of imminent recombinant carriers in picoseconds timescale. The PQCE is responsible for the ultralow threshold currents below 300nA for a single mode GaAs PQR laser, and a prototype GaN PQR laser with a threshold near and below 1&mu;A.
Mutation testing in UTP
Authors: Bernhard K. Aichernig, He Jifeng
Venue: Formal Aspects of Computing (2009)

This paper presents a theory of testing that integrates into Hoare and He&#x2019;s Unifying Theory of Programming (UTP). We give test cases a denotational semantics by viewing them as specification predicates. This reformulation of test cases allows for relating test cases via refinement to specifications and programs. Having such a refinement order that integrates test cases, we develop a testing theory for fault-based testing. Fault-based testing uses test data designed to demonstrate the absence of a set of pre-specified faults. A well-known fault-based technique is mutation testing. In mutation testing, first, faults are injected into a program by altering (mutating) its source code. Then, test cases that can detect these errors are designed. The assumption is that other faults will be caught, too. In this paper, we apply the mutation technique to both, specifications and programs. Using our theory of testing, two new test case generation laws for detecting injected (anticipated) faults are presented: one is based on the semantic level of UTP design predicates, the other on the algebraic properties of a small programming language.
A UML-based approach for heterogeneous IP integration
Authors: Sun Zhenxin, Wong Weng-Fai
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

With increasing availability of predefined IP (Intellectual Properties) blocks and inexpensive microprocessors, embedded system designers are faced with more design choices than ever. On the other hand, there is a constant pressure on reducing the time to market. However, as the IP blocks are provided by different vendors, they differ in their interfaces. In order to improve design reuse, methods for combining heterogeneous IP blocks with incompatible protocols and I/Os are needed. In this paper, we propose an interface synthesis method that uses the UML notation to model the interfaces of predefined components and glue logic within the standard OCP-compliant environment. We built a code generator to produce the interface adapters from the UML models. We experimented with our approach using simple-bus and a MPEG-2 decoder as case studies.
Dynamic nodeID based heterogeneity aware p2p system
Authors: Kyungbaek Kim
Venue: Computer Communications (2009)

A lot of research papers discussed Distributed Hash Table (DHT) based p2p systems to promise that idle resources may be efficiently harvested. However, p2p systems are composed of components with extremely heterogeneous availabilities and they will generate heavy information maintenance traffic to keep the efficiency of DHT based p2p systems under churn. In this paper, we suggest a dynamic nodeID based heterogeneity aware p2p system to reduce the overhead by exploiting the heterogeneity of participant nodes efficiently. Unlike the DHT based p2p systems, the nodeID of a node changes on the fly according to its characteristic and each node takes different responsibility in accordance with its nodeID to support p2p systems efficiently. A nodeID is composed of Load-Balanced ID (LBID) which balances the loads of reliable nodes and Load-Free ID (LFID) which reduces the responsibility of normal nodes and eliminates compulsory maintenance overhead. We conduct an event-driven simulation and show that our p2p system reduces data maintenance traffic and makes routing process more efficient and more reliable.
Optimizing parallelism for nested loops with iterational and instructional retiming
Authors: Chun Jason Xue, Zili Shao, Meilin Liu, Mei Kang Qiu, Edwin H.-M. Sha
Venue: Journal of Embedded Computing (2009)

Embedded systems have strict timing and code size requirements. Retiming is one of the most important optimization techniques to improve the execution time of loops by increasing the parallelism among successive loop iterations. Traditionally, retiming has been applied at instruction level to reduce cycle period for single loops. While multi-dimensional (MD) retiming can explore the outer loop parallelism, it introduces large overheads in loop index generation and code size due to loop transformation. In this paper, we propose a novel approach, that combines iterational retiming with instructional retiming to satisfy any given timing constraint by achieving full parallelism for iterations in a partition with minimal code size. The experimental results show that combining iterational retiming and instructional retiming, we can achieve 37% code size reduction comparing to applying iteration retiming alone.
On the problem of bandwidth partitioning in FDD block-fading single-user MISO/SIMO systems
Authors: Michel T. Ivrlač, Josef A. Nossek
Venue: EURASIP Journal on Advances in Signal Processing (2008)

We report on our research activity on the problem of how to optimally partition the available bandwidth of frequency division duplex, multi-input single-output communication systems, into subbands for the uplink, the downlink, and the feedback. In the downlink, the transmitter applies coherent beamforming based on quantized channel information which is obtained by feedback from the receiver. As feedback takes away resources from the uplink, which could otherwise be used to transfer payload data, it is highly desirable to reserve the "right" amount of uplink resources for the feedback. Under the assumption of random vector quantization, and a frequency flat, independent and identically distributed block-fading channel, we derive closed-form expressions for both the feedback quantization and bandwidth partitioning which jointly maximize the sum of the average payload data rates of the downlink and the uplink. While we do introduce some approximations to facilitate mathematical tractability, the analytical solution is asymptotically exact as the number of antennas approaches infinity, while for systems with few antennas, it turns out to be a fairly accurate approximation. In this way, the obtained results are meaningful for practical communication systems, which usually can only employ a few antennas.
An intermediate introduction to the Erlang programming language: tutorial presentation
Authors: David R. Naugler
Venue: Journal of Computing Sciences in Colleges (2009)

Erlang is a general purpose functional programming language. It is dynamically typed, uses pattern matching extensively, and has built in support for concurrency and fault tolerance. Erlang allows parallel processing without locks, shared memory or synchronized methods. Erlang programs can run on a single a core processor, can use multiple core seamlessly, can run run over trusted networks and even, with restrictions, over the internet.