ppxscal/embedding_network huggingface dataset:
A fast audio classification from MPEG coded data
Authors: Y. Nakajima
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

Audio information classification becomes a very important task for such purposes as automatic keyword spotting and other content-based audio-visual query systems. In this paper, we describe a fast and accurate audio data classification method on the MPEG coded data domain. Firstly silent segments are detected using a robust approach for different recording conditions. Then the non-silent segments are classified into three types, music, speech, and applause using temporal density, bandwidth and center frequency of subband energy. In order to be robust for a variety of audio sources as much as possible, we use Bayes discriminant function for multivariate Gaussian distribution instead of manually adjusting a threshold for each discriminator. In the experiment, every one-second of MPEG audio data is classified and about 90% of audio and speech segments have been successfully detected. As for the detection speed, less than 20% of MPEG audio decoding processing power is required.
Optimal chain rule placement for instruction selection based on SSA graphs
Authors: Stefan Schäfer, Bernhard Scholz
Venue: Proceedingsof the 10th international workshop on Software compilers for embedded systems (2007)

Instruction selection is a compiler optimisation that translates the intermediate representation of a program into a lower intermediate representation or an assembler program. We use the SSA form as an intermediate representation for instruction selection. Patterns are used for translation and are expressed as production rules in a graph grammar. The instruction selector seeks for a syntax derivation with minimal costs optimising execution time, code size, or a combination of both. Production rules are either base rules which match nodes in the SSA graph or chain rules which convert results of operations. We present a new algorithm for placing chain rules in a control flow graph. This new algorithm places chain rules optimally for an arbitrary cost metric. Experiments with the MiBench and SPEC2000 benchmark suites show that our proposed algorithm is feasible and always yields better results than simple strategies currently in use. We reduce the costs for placing chain rules by 25% for the MiBench suite and by 11% for the SPEC2000 suite.
Fast principal component extraction by a homogeneous neural network
Authors: Shan Ouyang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

On the basis of the concepts of both weighted subspace criterion and information maximization, the paper proposes a weighted information criterion (WINC) for searching for the optimal solution of a homogeneous neural network. We develop two adaptive algorithms based on the WINC for extracting in parallel multiple principal components. Both algorithms are able to provide an adaptive step size which leads to a significant improvement in the learning performance. Furthermore, the recursive least squares version of WINC algorithms has a low computational complexity O(Np), where N is the input vector dimension and p is the number of desired principal components. Since the weighting matrix does not require an accurate value, it facilitates the system design of the WINC algorithm for real applications. Simulation results are provided to illustrate the effectiveness of WINC algorithms for PCA.
Diagnosis of timed automata with an application to industrial actuators
Authors: J. Lunze, P. Supavatanakul
Venue: Integrated Computer-Aided Engineering (2004)

This paper concerns the modelling and diagnosis of discrete-event systems. The timed automaton is used as a discrete-event representation of such systems. The diagnosis is based on the investigation whether the measured input and output sequences are consistent with the timed automaton. The paper describes how the timed automaton can be obtained by qualitative identification using a set of measurement data and how it can be used together with the diagnostic algorithm to detect and identify faults. An important aspect of this method is the decomposition of the diagnostic system into the model and diagnostic algorithm which makes it possible to use the same algorithm for different systems by simply exchanging the model. The results are applied to industrial actuators.
Configuring a load-balanced switch in hardware
Authors: S. Arekapudi, Shang-Tse Chuang, I. Keslassy, N. McKeown
Venue: Proceedings of the High Performance Interconnects, 2004. on Proceedings. 12th Annual IEEE Symposium (2004)

The load-balanced switch architecture is a promising way to scale router capacity. We explained previously (Keslassy, I. et al., Proc. ACM SIGCOMM, 2003) how it can be used to build a 100 Tb/s router with no centralized scheduler, no memory operating faster than the line-rate, no packet mis-sequencing, a 100% throughput guarantee for all traffic patterns, and an optical switch fabric that simply spreads traffic evenly among linecards. This switch fabric uses optical MEMS switches that are reconfigured only when linecards are added and deleted, allowing the router to function when any subset of linecards is present and working. We have also introduced a configuration algorithm that can find a correct configuration of the MEMS switches in polynomial time (Keslassy et al., Proc. IEEE Infocom '04, 2004). However, we found that our algorithm takes over 50 seconds to run in software for a 100 Tb/s router. Our goal is to restore the router to operation within 50 ms of failure. We have modified our algorithm for implementation in dedicated hardware. In particular, to simplify the Ford-Fulkerson algorithm in bipartite matches, we reduce memory accesses and use bit manipulation schemes. Then, we decompose permutations using the Slepian-Duguid algorithm and reduce the configuration time with a simplified memory scheme. Our experimental results show that it is possible to achieve the 50 ms target.
On Performance Testing with Path Delay Patterns
Authors: Bram Kruseman, Ananta Majhi, Guido Gronthoud
Venue: Proceedings of the 25th IEEE VLSI Test Symmposium (2007)

Application specific ICs are typically designed to meet a given performance specification. For these ICs a higher performance does not add value and less performance makes the IC useless. This class of ICs is designed based on worst-case corner analysis. It is expected that this will become area costly in more advanced technologies. An alternative is to use statistical design techniques but this implies that the performance needs to be tested with, for example, path delay testing. Our experiments in 65 nm show that the actual delay depends on the global activity within an IC as well as effects in the local neighbourhood of the path. These global and local effects can independently cause about 15% of additional delay. Hence, their impact needs to be included during test and we propose to create (close to) worst-case delay patterns. Individually, the patterns have an enhanced sensitivity for the most important local effects and combined they provide coverage for global effects. This makes them better suited as speed indicators than conventional path delay patterns.
Directing change using Bcfg2
Authors: Narayan Desai, Rick Bradshaw, Cory Lueninghoener
Venue: Proceedings of the 20th conference on Large Installation System Administration (2006)

Configuration management tools have become quite adept at representing target configurations at a point in time. While a point-in-time model helps with system configuration tasks, it cannot represent the complete scope of configuration tasks needed to manage a complex environment over time. In this paper, we introduce a mechanism for representing changes over time in target configurations and show how it alleviates several common administrative problems. We discuss the motivating factors, design, and implementation of this approach in Bcfg2. We also describe how this approach can be applied to other tools.
There is More to Color Scales than Meets the Eye: A Review on the Use of Color in Visualization
Authors: Samuel Silva, Joaquim Madeira, Beatriz Sousa Santos
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

The appropriate use of color in Visualization is a very important subject. The choice of the proper color scale to use with a particular data set is not just a matter of choosing the prettiest representation. Throughout the years researchers have studied this subject and managed to propose guidelines which help users along the process of color scale selection. This article presents a brief overview on the subject focusing on the desired properties for color scales, the guidelines that should drive their choice, the advantages of applying those guidelines, the experimental research work on the field, and the tools proposed to help non-expert users.
Automatic Generation of Bas-reliefs from 3D Shapes
Authors: Wenhao Song, Alexander Belyaev, Hans-Peter Seidel
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

In this paper, we introduce and study a new problem of converting a given 3D shape (or a 2.5D range data) into a bas-relief. The problem can be considered as a geometry counterpart of the HDR image compression problem widely studied in computer graphics. In our approach to the shape bas-reliefing problem, we combine the concepts of mesh saliency, shape exaggerating, and discrete differential coordinates. The final bas-relief has a small width, preserves salient features of the original 3D shape, and, therefore, can be used for shape decorating purposes.
Bernoulli shift generated chaotic watermarks: theoretic investigation
Authors: S. Tsekeridou
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

The paper statistically analyzes the behaviour of chaotic watermark signals generated by n-way Bernoulli shift maps. For this purpose, a simple blind copyright protection watermarking system is considered. The analysis involves theoretical evaluation of the system detection reliability, when a correlator detector is used. The aim of the paper is twofold: (i) to introduce the n-way Bernoulli shift generated chaotic watermarks and theoretically contemplate their properties with respect to detection reliability and (ii) to establish theoretically their potential superiority against the widely used pseudorandom watermarks. Experimental verification of the theoretical analysis results is also performed.
A Hybrid Strategy for Clustering Data Mining Documents
Authors: Yi Peng, Gang Kou, Yong Shi, Zhengxin Chen
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

With the increase in the number of electronic documentsC it is hard to manually organize, analyze and present these documents efficiently. Document clustering, which automatically groups similar or related documents together, has been used in practical applications to understand the contents and structures of documents. Although a variety of methods and algorithms have been proposed, it is still a challenging task to generate meaningful document clusters. This paper uses an approach that combines quantitative and qualitative methods in order to create high-quality clusters for a collection of data mining and knowledge discovery (DMKD) publications. The quantitative method extracts a list of noun/noun phrases from the DMKD documents and uses an optimization procedure from CLUTO toolkit to assign documents to clusters. The qualitative method uses grounded theory to identify major categories of the documents to improve the comprehensibility of resultant clusters. The results demonstrate that the strategy produces more meaningful clusters than single-term k-way clustering algorithm in terms of internal metrics and human assessment.
The Effects of Mobile Customer Relationship Management on Customer Loyalty: Brand Image Does Matter
Authors: Ja-Shen Chen, Russell K. H. Ching
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

With the expansive growth of mobile commerce come opportunities for business and mobile service providers. To distinguish its service from another's and build a loyal customer base, a mobile service provider must look beyond technology and appeal to their customers' individuality through CRM. A study to examine the relationships of CRM practices and mobile services with customer loyalty, and the moderating effects of brand image was conducted. The results suggest that all contribute to loyalty. However, brand image moderates the relationships of customer service and customization, and mobile usage with customer loyalty.
A graduate certificate in computer network communications
Authors: R. H. Brown
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The paper describes a graduate certificate program and curriculum in computer network communications. First the paper introduces the concept of a "graduate certification" that has been in place for nearly five years at Rensselaer At Hartford. Graduate certificate programs have a selective focus and require that a student successfully complete four graduate-level courses in a specific area. Second, the specific course curriculum for the Computer Network Communications certificate is presented. Although the certificate is limited to just four graduate courses, we believe that the "content" includes a fair balance of traditional and innovative computer networking courses. The paper identifies the objectives of each course. Our intent is to provide solid graduate education, with an eye on diversity in computer network solutions. The program is not tied to any vendor specific solutions; rather the students are asked to use their fundamental knowledge of networking to evaluate several choices. Third, the paper looks at the evolution of the computer network communications certificate. Feedback from working professionals in the field of network engineering, network management, and client/server applications support will influence the content of the program. Using preliminary student feedback (from students who have completed the requirements of the certificate), we propose some changes and additional electives within the certificate. 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
A Convergent Incremental Gradient Method with a Constant Step Size
Authors: Doron Blatt, Alfred O. Hero, Hillel Gauchman
Venue: SIAM Journal on Optimization (2007)

An incremental aggregated gradient method for minimizing a sum of continuously differentiable functions is presented. The method requires a single gradient evaluation per iteration and uses a constant step size. For the case that the gradient is bounded and Lipschitz continuous, we show that the method visits infinitely often regions in which the gradient is small. Under certain unimodality assumptions, global convergence is established. In the quadratic case, a global linear rate of convergence is shown. The method is applied to distributed optimization problems arising in wireless sensor networks, and numerical experiments compare the new method with other incremental gradient methods.
Machine intelligence of a mobile manipulator to utilize dynamically interfered motion and nonlinear friction
Authors: M. Minami, A. Tamamura, T. Asakura
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

Dynamical interferences have been thought that they should be erased to improve control accuracy. However it may be possible to improve the performance of total motion using the interferences. We propose a method to acquire a kind of machine intelligence to utilize dynamically interfered motion. The machine intelligence is defined here as an ability that the machine can find by itself a way to use dynamical interferences and nonlinear friction to obtain a desired motion. We propose a strategy of how a machine uses the effects of the dynamical interferences, and how it acquires the way to achieve an objective motion. The desired motion is traveling of a 1-link mobile manipulator by using interfering motion of the mounted link, which does not possess driving motors nor brakes. The proposed method is composed of functions to give the machine sample motions using Fourier series and to improve the Fourier coefficients by evaluating the motion results based on a function used in a genetic algorithm as a fitness function. Further, an ability to avoid collisions between the mounted manipulator and the floor is added to the traveling ability to confirm that the proposed method could be adapted to many objectives. We confirmed by simulations and real experiments that the mobile manipulator could find effective motion that makes it travel forward without colliding against the floor.
Determining Sets for the Discrete Laplacian
Authors: Aviad Rubinstein, Jacob Rubinstein, Gershon Wolansky
Venue: SIAM Review (2007)

We define a notion of determining sets for the discrete Laplacian in a domain &OHgr;. A set $D$ is called determining if harmonic functions are uniquely determined by providing their values on $D$, and if $D$ has the same size as the boundary of &OHgr;. It is shown that there exist determining sets that are fairly evenly distributed in &OHgr;. A number of basic properties of determining sets are derived.
Efficient cycle-accurate simulation of the UltraSPARC III CPU
Authors: Peter Strazdins, Bill Clarke, Andrew Over
Venue: Proceedings of the thirtieth Australasian conference on Computer science - Volume 62 (2007)

This paper presents a novel technique for cycle-accurate simulation of the Central Processing Unit (CPU) of a modern superscalar processor, the UltraSPARC III Cu processor. The technique is based on adding a module to an existing fetch-decode-execute style of CPU simulator, rather than the traditional method of fully modelling the CPU microarchitecture. It is also suitable for accurate SMP modelling. The main functions of the module are the simulation of instruction grouping, register interlocks and the store buffer. Its simple table-driven implementation permits easy modification for exploring microarchitectural variations. The technique results in a 40% loss of simulation speed, instead of a 10 times or greater performance loss by fully implementing the detailed micro-architecture. The technique is validated against an actual UltraSPARC III Cu processor, and achieves high levels of accuracy over a range of scientific benchmarks.
Supporting distributed scientific collaboration: Implications for designing the CiteSeer collaboratory
Authors: Umer Farooq, Craig H. Ganoe, John M. Carroll, C. Lee Giles
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

It is unclear if and how collaboratories have enhanced distributed scientific collaboration. Furthermore, little is known in the way of design strategies to support such collaboration. Based on a survey and follow-up interviews with CiteSeer users, we present four novel implications for designing the CiteSeer collaboratory. First, visualize query-based social networks to identify scholarly communities of interest. Second, provide online collaborative tool support for upstream stages of scientific collaboration. Third, support activity awareness for staying cognizant of online scientific activities. Fourth, use notification systems to convey scientific activity awareness.
Hierarchical dynamic slicing
Authors: Tao Wang, Abhik Roychoudhury
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

Dynamic slicing is a widely used technique for program analysis, debugging, and comprehension. However, the reported slice is often too large to be inspected by the programmer. In this work, we address this deficiency by hierarchically applying dynamic slicing at various levels of granularity. The basic observation is to divide a program execution trace into "phases", with data/control dependencies inside each phase being suppressed. Only the inter-phase dependencies are presented to the programmer. The programmer then zooms into one of these phases which is further divided into sub-phases and analyzed. We also discuss how our ideas can be used to augment debugging methods other then slicing (such as "fault localization", a recently proposed trace comparison method for software debugging).
Sequences of orthogonal Laurent polynomials, bi-orthogonality and quadrature formulas on the unit circle
Authors: Ruymán Cruz-Barroso, Leyla Daruis, Pablo González-Vera, Olav Njstad
Venue: Journal of Computational and Applied Mathematics (2007)

In this paper, the construction of orthogonal bases in the space of Laurent polynomials on the unit circle is considered. As an application, a connection with the so-called bi-orthogonal systems of trigonometric polynomials is established and quadrature formulas on the unit circle based on Laurent polynomials are studied.
Efficient Solution of A, x(k) = b(k) Using A-1
Authors: Adi Ditkowski, Gadi Fibich, Nir Gavish
Venue: Journal of Scientific Computing (2007)

In this work, we consider the problem of solving $${Ax^{(k)}=b^{(k)}}$$ , $${k=1,\ldots, K}$$ , where b (k+1) = f(x (k)). We show that when A is a full $${n \times n}$$ matrix and $${K\geqslant cn}$$ , where $${c\ll1}$$ depends on the specific software and hardware setup, it is faster to solve $${Ax^{(k)}=b^{(k)}}$$ for $${{k = 1,\ldots, K}}$$ by explicitly evaluating the inverse matrix A ¿1 rather than through the LU decomposition of A. We also show that the forward error is comparable in both methods, regardless of the condition number of A.
Low power design on algorithmic and architectural level: a case study of an HSDPA baseband digital signal processing system
Authors: M. Schämann, S. Hessel, U. Langmann, M. Bücker
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

The optimization of power consumption plays a key role in the design of a cellular system: Increasing data rates together with high mobility represent a constantly growing design challenge because advanced algorithms are required with a higher complexity, more chip area and increased power consumption which contrast with limited power supply. In this contribution, digital baseband components for a High Speed Downlink Packet Access (HSDPA) system are optimized on algorithmic and architectural level. Three promising algorithms for the equalization of the propagation channel are compared regarding performance, complexity and power consumption using fixed-point SystemC models. On architectural level an adaptive control unit is introduced together with an output interference analyzer. The presented strategy reduces the arithmetic operations for convenient propagation conditions up to 70% which relates to an estimated power reduction of up to 40% while the overall performance is not affected.
Integrating windows 95/NT into an existing UNIX enterprise network
Authors: Cameron D. Luerkens, Mark J. Bartelme, Kevin K. Sizer, James Bud Lande
Venue: Proceedings of the 1997 Workshop on Large Scale System Administration of Windows NT (1997)

A task of large Information Technologies (IT) organizations is how to connect thousands of PCs to an Enterprise network. Many of these networks have used UNIX servers to host and deliver applications to PCs running Windows 3.1. With Windows 95/NT's dominance of the desktop, it is becoming essential to integrate the Windows environment with the existing UNIX infrastructure so existing resources can be used for their full lifecycle.