ppxscal/embedding_network huggingface dataset:
Gear Fault Monitoring Based on Order Tracking and Bi-spectrum under Running-Up Condition
Authors: Hui Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper deals with the detection of gear crack faults in gearbox under non-stationary run-up of gear drives. In order to process the non-stationary vibration signals such as run-up or run-down vibration signals effectively, the order bi-spectrum technique is presented. This new method combines computed order tracking technique with bi-spectrum analysis. Firstly, the vibration signal is sampled at constant time increments during run-up of gearbox and then uses numerical techniques to resample the data at constant angle increments. Therefore, the vibration signals are transformed from the time domain transient signal to angle domain stationary one. In the end, the re- sampled signals are processed by bi-spectrum analysis method. The experimental results show that order tracking and bi-spectrum technique can effectively diagnosis the gear faults.
Satellite bandwidth allocation based on MPEG-4 videoconference traffic prediction
Authors: Polychronis Koutsakis
Venue: Wireless Personal Communications: An International Journal (2007)

The provision of acceptable Quality-of- Service for multimedia traffic over a geosynchronous earth orbit satellite network demands the existence of a well-designed Medium Access Control protocol. This paper proposes a new dynamic satellite bandwidth allocation technique which is based on accurate MPEG-4 videoconference traffic prediction. The use of the prediction in our protocol is shown via a simulation study to provide very good throughput and delay results.
A Study on How to Help Back-propagation Escape Local Minimum
Authors: Shaobin Chai, Yong Zhou
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

One peculiarity impairing the performance of back-propagation is the presence of local minimum. In this paper, a local minimum detection algorithm called LMD is advocated. LMD bases on two kinds of constraint of local minimum to detect and escape local minimum. Before back-propagation trapping into local minimum, LMD will take measure to rectify the adjusting method of weights and biases. Combining LMD, back-propagation is improved to LMDBP algorithm in this paper. Results of experiment of back-propagation and LMDBP indicate that LMDBP can escape local minimum much more sufficiently than back-propagation algorithm.
An Easily Controlled Network for Frequently Used Permutations
Authors: Pen-Chung Yew
Venue: IEEE Transactions on Computers (1981)

A p network, which is a concatenation of 2 O networks [2], along with a simple control algorithm is proposed. This network is capable of performing all O network realizable permutations and the bit-permute-complement (BPC) class of permutations[5] in 0(log N) time. The control algorithm is actually a multiple-pass control algorithm on the O network, which is more general than Pease's LU decomposition method [6] and Lenfant's decomposition method[4].
Anticipation from example
Authors: Victor Zordan, Adriano Macchietto, Jose Medin, Marc Soriano, Chun-Chih Wu, Ronald Metoyer, Robert Rose
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

Automatically generated anticipation is a largely overlooked component of response in character motion for computer animation. We present an approach for generating anticipation to unexpected interactions with examples taken from human motion capture data. Our system generates animation by quickly selecting an anticipatory action using a Support Vector Machine (SVM) which is trained offline to distinguish the characteristics of a given scenario according to a metric that assesses predicted damage and energy expenditure for the character. We show our results for a character that can anticipate by blocking or dodging a threat coming from a variety of locations and targeting any part of the body, from head to toe.
Non-Uniform Slant Correction for Handwritten Text Line Recognition
Authors: R. Bertolami, S. Uchida, M. Zimmermann, H. Bunke
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

In this paper we apply a novel non-uniform slant correc- tion preprocessing technique to improve the recognition of offline handwritten text lines. The local slant correction is expressed as a global optimisation problem of the sequence of local slant angles. This is different to conventional slant removal techniques that rely on the average slant angle. Ex- periments based on a state-of-the-art handwritten text line recogniser show a significant gain in word level accuracy for the investigated preprocessing methods.
Mining Multidimensional Data Using Clustering Techniques
Authors: Marco Pagani, Gloria Bordogna, Massimiliano Valle
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

We describe a novel data mining procedure to discover relevant associations in multidimensional data. The procedure applies hierarchical clustering to distinct pattern sets (views) of the same dataset and identifies the best partitions in the two dendrograms that exhibit the greatest correlation. Finally the most relevant associations between pattern sets characterizing the most correlated clusters in the identified partitions are discovered. An application of the procedure to identify association between compositional views and performance views of a dataset of materials is discussed.
A Facial-Skin Condition Classification System Using Texture and Fuzzy C-Means Technologies
Authors: Jiann-der Lee, Yu-chi Chen, Li-chang Liu, Chung-hsien Huang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

This paper describes a facial-skin condition classification system based on cosmeticians' suggestions to let the users realize their facial-skin conditions. Two kinds of features are extracted from the captured skin image. The contrast, inverse difference moment, deviation information in the gray-value histogram, and the entropy of the co-occurrence matrix information are calculated as the firs kind of features. Four parameters in Wavelet domain are used as the second kind of features. A 2-stage fuzzy c-means process is used to classify these 2 kinds of features into 3 groups: the oily skin, neutral skin, and the dry skin. In the two experiments, the classified results are compared with the cosmeticians' results, and the average correct rate is 93%.
Computers and Cartography
Authors: D. L. Bress
Venue: Computer (1972)

Computer-aided plotting is turning the ancient art of cartography into an exact science. Today's geologist, civil engineer, city planner, highway engineer and government cartographer have turned to small computers and digital plotters for maps that in the past were produced entirely by hand. This movement to computer-aided cartography has yielded more accurate maps faster and at lower cost. 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
On the Combined Problem of Compaction and Sorting
Authors: F. L. Vermeulen
Venue: IEEE Transactions on Software Engineering (1982)

Under certain assumptions, a garbage collection algorithm which compacts the dynamic storage area also involves sorting a set of pointers, whose order usually has only been partially disturbed since the last garbage coliection. Using this structure and combining the sorting and compaction, we can achieve a rather important reduction of the time to perform a garbage collection.
A Prototype Power Management Proxy for Gnutella Peer-to-Peer File Sharing
Authors: Miguel Jimeno, Ken Christensen
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

In order to be part of a peer-to-peer (P2P) file sharing network a host must be fully powered-on all of the time. In addition to providing a user interface, a P2P host handles query messages and serves requested files. In this paper, we describe the development of a prototype Gnutella-like P2P power management proxy sub-system that handles query messages. This can allow desktop PCs acting as P2P hosts to enter a low-power sleep state for most of the time and be woken-up by the proxy only when needed to serve files. TCP connections with neighbors are maintained by the host when it is awake and by the proxy when the host is sleeping. Experiments show that a low-cost Freescale ColdFire processor can effectively proxy for a P2P host. This suggests that a controller for a Gnutella P2P proxy could be co-located on an Ethernet NIC at low cost. This could lead to significant energy savings by allowing P2P hosts to power manage into a low-power sleep state when not in active use.
Stochastic Sparse-grid Collocation Algorithm (SSCA) for Periodic Steady-State Analysis of Nonlinear System with Process Variations
Authors: Jun Tao, Xuan Zeng, Wei Cai, Yangfeng Su, Dian Zhou, Charles Chiang
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

In this paper, Stochastic Collocation Algorithm combined with Sparse Grid technique (SSCA) is proposed to deal with the periodic steady-state analysis for nonlinear systems with process variations. Compared to the existing approaches, SSCA has several considerable merits. Firstly, compared with the moment-matching parameterized model order reduction (PMOR), which equally treats the circuit response on process variables and frequency parameter by Taylor approximation, SSCA employs Homogeneous Chaos to capture the impact of process variations with exponential convergence rate and adopts Fourier series or Wavelet Bases to model the steady-state behavior in time domain. Secondly, contrary to Stochastic Galerkin Algorithm (SGA), which is efficient for stochastic linear system analysis, the complexity of SSCA is much smaller than that of SGA for nonlinear case. Thirdly, different from Efficient Collocation Method, the heuristic approach which may results in "Rank deficient problem" and "Runge phenomenon", Sparse Grid technique is developed to select the collocation points in SSCA in order to reduce the complexity while guaranteing the approximation accuracy. Furthermore, though SSCA is proposed for the stochastic nonlinear steady-state analysis, it can be applied for any other kinds of nonlinear system simulation with process variations, such as transient analysis, etc..
Preparing for change: Medical informatics international initiatives for health care and biomedical research
Authors: Reinhold Haux
Venue: Computer Methods and Programs in Biomedicine (2007)

The intention of this paper is to reflect on the development of medical informatics as a discipline and on the development of IMIA, the International Medical Informatics Association, as its international organization. IMIA is the international organization in health and biomedical informatics, which has the goal of stimulating and communicating high quality research, education and application, with medical informatics now being one of the central disciplines for achieving health for the people in societies worldwide. The need for new international initiatives is discussed and IMIA's recently approved Strategic Plan as well as its joint initiative with WHO are presented as examples.
A Model for the Effect of Caching on Algorithmic Efficiency in Radix based Sorting
Authors: Arne Maus, Stein Gjessing
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

This paper demonstrates that the algorithmic performance of end user programs may be greatly affected by the two or three level caching scheme of the processor, and we introduce a general but simple model that estimates this effect with good accuracy. Using 4 different processors and two simple tests, we demonstrate that a number of random reads and writes in an array can have a penalty factor of 40-70 compared to the exact same number of sequential array accesses. These effects from cache misses first occur when a randomly accessed array is larger than the L1 cache and even more so when the array does not fit in the much larger L2 cache. A similar but much smaller effect between sequential reads and writes in large arrays compared with smaller arrays is also reported. In the second part of this paper three versions of the well known Radix algorithm is used to demonstrate that the "artificial' results from the first part definitely occur in practice. These versions use one, two and three digits, and hence one, two or three full passes to sort an array. For small arrays the two and three digit Radix algorithms of course are much slower than the one digit version, but for larger arrays the former outperform the latter. For comparison, the radix sorting execution times are compared to Quicksort and Flashsort, a different one-digit sorting algorithm, both of which are outperformed by the two and three digit Radix algorithms. Finally, a simple model based on the penalty of cache misses is introduced, and we use this model to explain the demonstrated differences in algorithmic efficiency.
Monte Carlo methods in fuzzy linear regression II
Authors: Areeg Abdalla, James J. Buckley
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

We apply our new fuzzy Monte Carlo method to a certain fuzzy linear regression problem to estimate the best solution. The best solution is a vector of crisp numbers, for the coefficients in the model, which minimizes one of two error measures. We use a quasi-random number generator to produce random sequences of these crisp vectors which uniformly fill the search space. We consider an example problem and show this Monte Carlo method obtains the best solution for both error measures.
XQuery on SQL hosts
Authors: Torsten Grust, Sherif Sakr, Jens Teubner
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Relational database systems may be turned into efficient XML and XPath processors if the system is provided with a suitable relational tree encoding. This paper extends this relational XML processing stack and shows that an RDBMS can also serve as a highly efficient XQuery runtime environment. Our approach is purely relational: XQuery expressions are compiled into SQL code which operates on the tree encoding. The core of the compilation procedure trades XQuery's notions of variable scopes and nested iteration (FLWOR blocks) for equi-joins. The resulting relational XQuery processor closely adheres to the language semantics, e.g., it obeys node identity as well as document and sequence order, and can support XQuery's full axis feature. The system exhibits quite promising performance figures in experiments. Somewhat unexpectedly, we will also see that the XQuery compiler can make good use of SQL's OLAP functionality.
ARMA(1,1) modeling of Quake4 Server to client game traffic
Authors: Anthony Cricenti, Philip Branch
Venue: Proceedings of the 6th ACM SIGCOMM workshop on Network and system support for games (2007)

Modeling traffic generated by Internet based multiplayer computer games has attracted a great deal of attention in the past few years. In part this has been driven by a need to simulate correctly the network impact of highly interactive online game genres such as the first person shooter (FPS). Packet size distributions and autocorrelation models are important elements in the creation of realistic traffic generators for network simulators such as ns-2 and OMNET++. In this paper we show that ARMA(1,1) models capture the time series behaviour of Quake4 game traffic well. We also show that the random component of the ARMA models (the innovations) have distributions that appear to change little as the number of players increases.
An Optimized Breaking Index for the Boussinesq-Type Numerical Model
Authors: Shuang Li, Hailun He, Jinbao Song
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

A breaking index appeared in the Boussinesq-type numer- ical model (Lynett, 2006) is replaced and tested. The new breaking index, which includes the water depth effect and is not sensitive to the spatial grid length, was first proposed by the Smith and Kraus (1991) and further optimized by many experimental data in this study. The numerical tests show that the modified Lynett's model with this new breaking in- dex is more stable and e±cient in the nearshore breaking point computations. Comparison with Dingemans (1994) experiment shows the validity of the modified Lynett's model in the nearshore wave breaking simulation.
Reducing runtime complexity of long-running application services via dynamic profiling and dynamic bytecode adaptation for improved quality of service
Authors: John Bergin, Liam Murphy
Venue: Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE) (2007)

We present a transparent optimisation framework for automatically improving run-time performance of component-based enterprise applications. Run-time performance is improved by automatically identifying and dynamically switching to an optimised but functionally equivalent program flow, for a specific transaction type. More precisely, one or more application components can have both static and dynamic inputs, where the former and its output remain mostly fixed from invocation-to-invocation, while the latter is unconstrained. Through dynamic profiling and run-time adaptation, an optimised program flow is derived, that allows only future execution of program points that operate on dynamic inputs and not static inputs. During execution, a target application is instrumented to switch to an optimised program flow. Additional instrumentation occurs to profile key program points that may invalidate an optimised program flow. If these points execute, then the application reverts back to its pre-optimised program flow. We evaluate and demonstrate how run-time performance for a typical thre-tired enterprise system can be improved for frequently accessed data that remains mostly static. For the application studied we showed a 49% marked improvement in the number of users serviced per second.
Testing High-Reliability Software for Continuous Casting Steel Plants - Experiences and Lessons Learned from Siemens VAI
Authors: Stefan Larndorfer, Rudolf Ramler, Christian Federspiel, Klaus Lehner
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

As the world's leading supplier of metallurgical plants, Siemens VAI provides integrated and universally applicable continuous casting systems for the steel industry. The complexity of the process of casting liquid steel is supported by software products that enable high-quality steel casts and efficient plant performance. Over the last recent years Siemens VAI developed a flexible software product line. The system has been classified as highly reliable, which implies rigorous and systematic testing throughout all phases of the development lifecycle. In this paper we investigate how testing is embedded in the development lifecycle and how various testing methods are applied to ensure high software reliability. The lessons learned distilled from over five years of project experience discuss practices that contributed to the current testing approach.
Testability Considerotions in Microprocessor-Based Design
Authors: J. P. Hayes
Venue: Computer (1980)

Microprocessors are difficult to test-many failure modes exist and access to internal components is limited. Design techniques that enhance testability can reduce the impact of these constraints.
A Probabilistic Analysis of EM for Mixtures of Separated, Spherical Gaussians
Authors: Sanjoy Dasgupta, Leonard Schulman
Venue: The Journal of Machine Learning Research (2007)

We show that, given data from a mixture of k well-separated spherical Gaussians in ℜd, a simple two-round variant of EM will, with high probability, learn the parameters of the Gaussians to near-optimal precision, if the dimension is high (d >> ln k). We relate this to previous theoretical and empirical work on the EM algorithm.
Rendering of Translucent Objects Based upon PRT
Authors: Jin Zhou, Zhang Jiawan, Sun Jizhou
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

A framework to incorporate subsurface scattering effects is proposed in this paper based on pre-computed light transport technology, which can interactively rerender translucent objects. First, the complete BSSRDF model is considered and the two-pass hierarchical technique by [5] in the space of non-linearly approximated transport vectors is applied, which efficiently evaluate transport vectors due to diffuse multiple scattering. Single scattering is also incorporated by considering [16]'s approximation. For a general phase function, a technique from BRDF rendering is extended which using a separable decomposition to allow decoupled precomputation and rendering [8]. Using this approach, interactive frame rates with comparable speed to the state-of-the-art systems is achieved.
Hydrologic Modeling of the Big Thompson River Using a Neural Network
Authors: Ward Huffman, A. K. Mzouz
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Methods of modeling the hydrologic process range from human observers to sophisticated surveys and statistical analysis of climatic data. In the last few years, researchers have applied computer programs called Neural Networks or Artificial Neural Networks to a variety of uses ranging from medical to financial. The purpose of the study was to demonstrate that Commercial Neural Networks can be successfully applied to hydrologic modeling. Using publicly available climatic and stream flow data and a Ward Systems Neural Network, the study resulted in prediction accuracy of greater than 97% in +/-100 cubic feet per minute range. The average error of the predictions was less than 16 cubic feet per minute. To further validate the model's predictive capability, a multiple regression analysis was done on the same data. The Neural Network's predictions exceeded those of the multiple regression analysis by significant margins in all measurement criteria.
Microarchitectures for Managing Chip Revenues under Process Variations
Authors: Abhishek Das, Serkan Ozdemir, Gokhan Memik, Joseph Zambreno, Alok Choudhary
Venue: IEEE Computer Architecture Letters (2007)

As transistor feature sizes continue to shrink intothe sub-90nm range and beyond, the effects of process variationson critical path delay and chip yields have amplified. A commonconcept to remedy the effects of variation is speed-binning, bywhich chips from a single batch are rated by a discrete range offrequencies and sold at different prices. In this paper, we discussstrategies to modify the number of chips in different bins andhence enhance the profits obtained from them. Particularly, wepropose a scheme that introduces a small Substitute Cacheassociated with each cache way to replicate the data elementsthat will be stored in the high latency lines. Assuming a fixedpricing model, this method increases the revenue by as much as 13.8% without any impact on the performance of the chips.