ppxscal/embedding_network huggingface dataset:
Robust nonlinear echo canceller with adaptive volterra filter applying VAD and echo-path delay estimation
Authors: M. A. Tinati, T. Yousefi Rezaii, A. Rastegarnia
Venue: Proceedings of the IASTED International Conference on Communication Systems, Networks, and Applications (2007)

In this paper, a fast reliable and computationally efficient algorithm is proposed to solve the nonlinearity problem in line echo cancellation. Adaptive volterra filters, AVFs, are used as the basic tools to deal with such nonlinearities. We have made modified AVFs to make them robust and flexible, so they are more applicable to various problems like variable echo-path delays, variable nonlinearity intensities, high power echo component cancellations, speech signals with sparse voiced frames (slow speaker), high complexities, reliability, etc. In this new structure, an utmost attempt has been made to consider all of the practical problems while the minimum simplifying assumptions are made to achieve the best performance. The performance comparison of this structure with the other techniques in the same conditions and assumptions is performed and the results are the evidence of robustness and computational efficiency of the proposed structure compared with the others.
Design of degree distributions for LDPCA codes
Authors: Feng Cen
Venue: IEEE Communications Letters (2009)

A degree distribution design method of Low-Density Parity-Check Accumulate (LDPCA) codes [6] is proposed for rate-compatible asymmetric Slepian-Wolf coding (SWC) of correlated binary memoryless sources. The degree distribution is designed by seeking the simultaneous optimum at the lowest and the highest compression rates of the specified range with density evolution algorithm. The experimental results show that the coding efficiency of codes constructed with the designed degree distribution is close to the Slepian-Wolf limit over the entire target range and better than all other reported results of the rate-compatible asymmetric SWC.
Memory reduction methodology for distributed-arithmetic- based DWT/IDWT exploiting data symmetry
Authors: Amit Acharyya, Koushik Maharatna, Bashir M. AI-Hashimi, Steve R. Gunn
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

In this brief, we show that by exploiting the inherent symmetry of the discrete wavelet transform (DWT) algorithm and consequently storing only the nonrepetitive combinations of filter coefficients, the size of required memory can be significantly reduced. Subsequently, a memory-efficient architecture for DWT/inverse DWT is proposed. It occupies 6.5-mm2 silicon area and consumes 46.8-µW power at 1 MHz for 1.2 V using 0.13-µm standard cell technology.
Efficient hamming weight comparators for binary vectors based on accumulative and up/down parallel counters
Authors: Behrooz Parhami
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

New counting-based methods for comparing the Hamming weight of a binary vector with a constant, as well as comparing the Hamming weights of two input vectors, are proposed. It is shown. that the proposed comparators are faster and simpler, both in asymptotic sense and for moderate vector lengths, compared with the best available fully digital designs. These speed and cost advantages result from a more efficient population counting, as well as the merger of counting and comparison operations, via accumulative and up/down parallel counters.
Trust relationship prediction using online product review data
Authors: Nan Ma, Ee-Peng Lim, Viet-An Nguyen, Aixin Sun, Haifeng Liu
Venue: Proceeding of the 1st ACM international workshop on Complex networks meet information & knowledge management (2009)

Trust between users is an important piece of knowledge that can be exploited in search and recommendation.Given that user-supplied trust relationships are usually very sparse, we study the prediction of trust relationships using user interaction features in an online user generated review application context. We show that trust relationship prediction can achieve better accuracy when one adopts personalized and cluster-based classification methods. The former trains one classifier for each user using user-specific training data. The cluster-based method first constructs user clusters before training one classifier for each user cluster. Our proposed methods have been evaluated in a series of experiments using two datasets from Epinions.com. It is shown that the personalized and cluster-based classification methods outperform the global classification method, particularly for the active users.
Linear IIR precoding for non-redundant transmission over minimum-phase channels in wireline multitone systems
Authors: Francisco J. Simois, José I. Acha
Venue: IEEE Transactions on Communications (2009)

Discrete multitone (DMT) systems need the use of a guard interval, known as cyclic prefix (CP), to avoid inter-symbol interference (ISI) and interchannel interference (ICI). Unfortunately, this prefix produces a decrease in the achievable bandwidth efficiency. To overcome this problem, we present in this paper an IIR linear precoder that adds memory in the time-domain, avoiding the need of a guard time. It is shown that the received signal with this precoder and the received signal in a DMT system that uses CP are identical, so perfect reconstruction is possible in a noise-free situation. In addition, the behavior of this scheme in presence of noise is the same as in a DMT system with CP, allowing the use of bit and power loading algorithms. It is also proved that the only condition for the precoder stability is that the channel is minimum-phase. As an example, it is shown the good performance of this algorithm in an ADSL environment.
Design of web-based collaborative learning environments. Translating the pedagogical learning principles to human computer interface
Authors: Wilfred Rubens, Bruno Emans, Teemu Leinonen, Antonio Gomez Skarmeta, Robert-Jan Simons
Venue: Computers Education (2005)

Seven pedagogical principles guided the development of a collaborative virtual environment, within an international project called ITCOLE. The progressive inquiry model as a theoretical framework had a large impact on describing these principles. Furthermore, this article describes the two web-based software systems - Synergeia and FLE3 - that were developed in the project. Teachers evaluated this software in the light of two perspectives: user friendliness (ease of use) and user satisfaction (especially the pedagogical usability). It is concluded that the participants find the software easy to use. The user satisfaction ranges between good and average. Details about the different types of evaluation are reported in the paper.
Acquiring Mood Information from Songs in Large Music Database
Authors: Yi Liu, Yue Gao
Venue: Proceedings of the 2009 Fifth International Joint Conference on INC, IMS and IDC (2009)

Automatic mood information acquiring from music data is an important topic of music retrieval area. In this paper, we try to find the strongest emotional expression of the song in large music databases. By analyzing hundreds of credible reviews from website, a 7 keywords mood model is constructed. 217 songs were collected in our dataset. Every song was divided into several 10s-long segments and our dataset containing 5929 music clips. We used Gaussian Mixture Model (GMM) and Support Vector Machine (SVM) as classifier and four feature selection algorithms to do mood classification experiments. A post-processing method was presented to find the strongest mood expression of each song. From the experiment result, we can see that SVM is the best classifier for mood classification, and Active Selection algorithm can remove weak features effectively. Using SVM classifier, the classification accuracy can achieves 83.33% with 40 features by using active selection algorithm, and 85.42% with 84 features which selected by ReliefF.
Boss Smart
Authors: Wushow "Bill" Chou
Venue: IT Professional (2009)

This article addresses the soft skills specifically required to build good rapport with and to gain trust from our bosses. The mantras imparted include the following: our bosses expect our loyalty to them; we should share credit with our bosses for accomplishments and shoulder the blame for failures, even if our bosses contributed to the failure; we should be able to read nuances from our bosses; and we should be proactive and possess farsighted vision.
Corrections to "VLSI design of diminished-one modulo 2n + 1 adder using circular carry selection"
Authors: Tso-Bing Juang, Ming-Yu Tsai, Chin-Chieh Chiu
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

In a recent paper by Lin and Sheu, the authors have proposed a new circular-carry-selection technique that is applied in the design of an efficient diminished-one modulo 2n +1 adder. The proposed modulo adder in the aforementioned paper consists of a dual-sum carry look-ahead (DS-CLA) adder, a circular carry generator, and a multiplexer, which can reduce both area-time (AT) and time-power (TP) products compared with previous modulo adders. However, in our investigation, there will be incorrect results on the calculation of modulo addition because the carry-in of the DS-CLA adder is equal to zero. To remedy this drawback, we propose the corrected architecture of the DS-CLA adder based on the equations proposed in the aforementioned paper, which can perform correct modulo addition. The complexity of the corrected architecture is almost the same as the one proposed by Lin and Sheu but with less area cost, which can also have the same merits of both AT and TP products.
Expert model development in e-learning systems
Authors: Jekaterina Bule, Larissa Zaitseva
Venue: Proceedings of the 10th IASTED International Conference on Computers and Advanced Technology in Education (2007)

The paper studies the problem of the more effective organizing e-learning process by using computer-based teaching systems. The main models that should be included into such kind of systems are outlined. The results of the research of essential knowledge, skills and other characteristics of programming engineer are shown. Expert/knowledge model considering knowledge and skills needed for programmer is offered.
Power-saving scheduling for multiple-target coverage in wireless sensor networks
Authors: Sung-Yeop Pyun, Dong-Ho Cho
Venue: IEEE Communications Letters (2009)

We address the multiple-target coverage problem (MTCP) in wireless sensor networks (WSNs). We also propose an energy-efficient sensor-scheduling algorithm for multiple-target coverage (MTC) that considers both the transmitting energy for collected data and overlapped targets. We introduce two algorithms: one optimal, the other heuristic. Simulation results show that the proposed algorithms can contribute to extending the lifetime of network and that the heuristic algorithm is more practical than the optimal algorithm with respect to complexity.
Study and Implement of Downward Communication Function in Rotary Steerable Drilling System
Authors: Tang Nan, Huo Aiqing, Wang Yaolong, Cheng Weibin
Venue: Proceedings of the 2009 Second International Workshop on Computer Science and Engineering - Volume 02 (2009)

In Rotary steerable drilling system, there should be a downward communication channel to send the guided control command from ground monitor to downhole steeling tool. The downward command word has been transmitted by negative pulse of mud drilling fluid and encoded by a characteristic of three-descending and three-ascending. Downward communication receiving function in downhole tool detects the change of underground mud flow; then gets the guided control command rightly by processing and interpretation software. Several different measures are used in receiving device for improve reliability and anti-interference performance of downward transmitting. Experimental results show the feasibility of this downward transmission scheme.
Reduction of edge effects in spatial information extraction from regional geochemical data: a case study based on multifractal filtering technique
Authors: Yong Ge, Qiuming Cheng, Shenyuan Zhang
Venue: Computers Geosciences (2005)

Spatial information extraction in geoscience data analysis often involves operations, such as filtering and reducing noise/signal ratio that are frequently conducted in the frequency domain. Unfortunately, abrupt truncation of data or images along the edges and holes (with missing data) often cause distortion of patterns in the frequency domain. For example, bright strips on the frequency distribution pattern are often seen when the Fourier transform is used. These artifacts due to edge effects may adversely affect the results of data analysis; the effects can be significant depending on edge abruptness. Traditional solutions to reduce edge effects are to smooth the boundary of the image prior to applying the Fourier transformation. Zero-padding is one of the most frequently used smoothing methods. This simple method can reduce the edge effect to some degree but is ineffective in some applications when the image remains distorted. Moreover, due to the complexity of geoscience data involving irregular shapes and holes with missing data, zero-padding generally does not give satisfactory results. In this paper, decay functions are suggested to handle edge effects in geoscience image analysis. As a case study, it is used in a newly developed multifractal filtering technique: spectrum-area fractal method (S-A) for separating geochemical anomalies from background patterns. A geochemical data set chosen from a mineral district in Nova Scotia, Canada was used for validating the method. Optimal parameters including extension width and computational load involved in the selection of decay functions are experimentally determined and documented in this study.
Operations planning for collect-and-place machines in PCB assembly
Authors: Martin Grunow, Hans-Otto Günther, Martin Schleusener, Ihsan Onur Yilmaz
Venue: Computers and Industrial Engineering (2004)

Collect-and-place machines represent one of the most popular types of placement machines in automated printed circuit board (PCB) assembly. For scheduling the operations of this type of machinery, a three-stage heuristic solution approach is presented. In the first stage, the feeders (component types) are assigned to locations in the magazine of the placement machine. In the second stage, based on the assignment of component feeders to magazine positions, the component placement sequence is determined. Apparently, for a collect-and-place machine, this problem is similar to the well-known vehicle-routing problem. Therefore, we adapt standard methods for vehicle-routing problems, namely savings heuristics introduced by Clark and Wright [Clark, G., & Wright, J. W. (1964). Scheduling vehicles from a central delivery depot to a number of delivery points. Operations Research Quarterly, 12, 568-581]. Finally, local search principles are applied in order to improve the feeder assignment and the component placement sequence obtained. Numerical experiments are performed in order to compare the performance of the various savings-based heuristics under different experimental settings.
Upper bounds on the symbol-error probability of MPSK with phase error using Pawula F-function IV
Authors: Seungkeun Park, Byeong-Gwon Kang
Venue: IEEE Transactions on Communications (2009)

This letter presents an alternative derivation of the Case IV of Pawula F-function and an approximation for the corresponding probability density function (pdf) in the presence of the Tikhonov distributed phase error. The pdf of Case IV is used to obtain new upper bounds for the conditional and average symbol-error probabilities of M-ary phase shift keying with phase error over additive white Gaussian noise channels. Numerical results demonstrate the validity of the upper bounds.
Data bus inversion in high-speed memory applications
Authors: Timothy M. Hollis
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

Efforts to reduce high-speed memory interface power have led to the adoption of data bus inversion or bus-invert coding. This study compares two popular algorithms, which seek to limit the number of simultaneously transitioning signals and bias the state of transmitted data toward a preferred binary level, respectively. A new algorithm, which provides a compromise between transition frequency and preferred signal level, is proposed, and the three algorithms are compared in terms of their impact on power consumption, power supply noise reduction, and general signal integrity enhancement when used in conjunction with a variety of link topologies.
Stability analysis of switched positive systems: a switched linear copositive Lyapunov function method
Authors: Xingwen Liu
Venue: IEEE Transactions on Circuits and Systems II: Express Briefs (2009)

This brief addresses the stability problem of discrete-time switched positive systems. The main contribution lies in two aspects. First, a novel method [the switched linear copositive Lyapunov function (SLCLF)] is proposed to reduce the conservatism of the stability criterion obtained by means of the common linear copositive Lyapunov function. Second, some necessary and sufficient conditions are established for the existence of the switched linear copositive Lyapunov function, assuming that a switched linear positive system is given. A numerical example shows the advantage of the obtained results.
Envelope and phase distribution of two correlated Gaussian variables
Authors: Prathapasinghe Dharmawansa, Nandana Rajatheva, Chinthananda Tellambura
Venue: IEEE Transactions on Communications (2009)

Probability density functions (pdf's) are derived for the phase and amplitude (envelope) of the complex gain X +jY (j = √-1), where X and Y are two correlated non zero-mean Gaussian random variables. The pdf of the amplitude is derived as an infinite series, but reduces to a closed-form expression when the means are zero. The classical Rayleigh and Rician pdf's turn out to be special cases of the derived pdf. This pdf is used to analyze the error performance of non-coherent binary frequency shift keying (BFSK) with in-phase/quadrature(I/Q) imbalance over an additive white Gaussian noise (AWGN) channel. The resulting bit error rate (BER) expression is derived as an infinite series. The analytical expressions are validated by simulation, and the I/Q imbalance related performance degradation is quantified. Convergence of the PDF series and the BER series is established.
Efficient power allocation for coded OFDM systems
Authors: Hichan Moon, Donald C. Cox
Venue: IEEE Transactions on Communications (2009)

In coded OFDM systems, the transmission power of each subchannel is the same. In this letter, a power optimization scheme is presented to minimize FER or BER of a coded OFDM system under constant transmission power constraint. The power optimization is shown to be a convex optimization problem.
Decoding the (47,24,11) quadratic residue code using bit-error probability estimates
Authors: Gregory Dubney, Irving S. Reed, T.-K. Truong, Jun Yang
Venue: IEEE Transactions on Communications (2009)

A new algorithm is developed to facilitate faster decoding of the (47,24,11) Quadratic Residue (QR) code. This decoder, based on the idea first developed by Reed in a 1959 MIT Lincoln Laboratory Report, uses real channel data to estimate the individual bit-error probabilities in a received word. The algorithm then sequentially inverts the bits with the highest probability of error until one of the errors is canceled. The remaining errors are then corrected by the use of algebraic decoding techniques. This new algorithm, called the reliability-search algorithm, is a complete decoder that significantly reduces the decoding complexity in terms of CPU time while maintaining the same bit-error rate (BER) performance. In fact, this algorithm is an appropriate modification to the algorithm developed by Chase.
Analysis of Web Alert Models
Authors: Jameela Al-Jaroodi, Nader Mohamed
Venue: Proceedings of the 2009 International Conference on Network-Based Information Systems (2009)

Web alerts are user-defined monitor conditions for public Internet information in which notification messages are sent to users whenever their alert conditions are met. The notification conditions are directly or indirectly and completely or partially based on public information available on the Internet such as news, stock prices, exchange rates, oil price, etc. In some alert services, the user can reuse this information to define alert conditions for some required interests in which mobile phone text messages, instant messages, or email alert messages are sent to them upon meeting the pre-specified alert conditions. This paper discusses currently available alert models and some research based proposed models. Then it provides a classification of these different web alert models. This study also provides engineers and researchers with an overview of these models and their types then discusses several system design issues and challenges related to each alert model.
Effects of Cooperation--Based Peer-to-Peer Authentication on System Performance
Authors: Esther Palomar, Arturo Ribagorda, Juan E. Tapiador, Julio Hernandez-Castro
Venue: Proceedings of the 2009 International Conference on Multimedia Information Networking and Security - Volume 01 (2009)

Fully distributed file sharing systems, where participants share content and collaborate in a Peer--to--Peer (P2P) manner, have to deal with a highly dynamic environment to ensure that even when some nodes are unavailable, others can still perform the task through the coalition of cooperating parties. Therefore, cooperation--based services have been extensively deployed over the majority of P2P networks. This leads, however, to significant challenges for network services and data management, especially facilitating security properties. In a previous work, we presented a protocol for content authentication based on attribute certificates that does not rely on the existence of a public key infrastructure. Instead, peers cooperate to guarantee data integrity. In this context, it is reasonable to assume that peers would cooperate aimed at maximizing the expected benefit, but, generally, efficiency performance pays dearly for this. In this paper, we present an experimental evaluation of our analytical model in order to validate its dependability, and also discussing its tolerance under failures. 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