ppxscal/embedding_network huggingface dataset:
An improved Quiet Direct Simulation method for Eulerian fluids using a second-order scheme
Authors: M. R. Smith, H. M. Cave, J. -S. Wu, M. C. Jermy, Y. -S. Chen
Venue: Journal of Computational Physics (2009)

In this paper, a second-order scheme for the Quiet Direct Simulation (QDS) of Eulerian fluids is proposed. The QDS method replaces the random sampling method used in Direct Simulation Monte Carlo (DSMC) methods with a technique whereby particles are moved, have their properties distributed onto a mesh, are destroyed and then are recreated deterministically from the properties stored on the mesh using Gauss-Hermite quadrature weights and abscissas. Particles are permitted to move in physically realistic directions so flux exchange is not limited to cells sharing an adjacent interface as in conventional, direction decoupled finite volume solvers. In this paper the method is extended by calculating the fluxes of mass, momentum and energy between cells assuming a linear variation of density, temperature and velocity in each cell and using these fluxes to update the mass, velocity and internal energy carried by each particle. This Euler solver has several advantages including large dynamic range, no statistical scatter in the results, true direction fluxes to all nearby neighbors and is computationally inexpensive. The second-order method is found to reduce the numerical diffusion of QDS as demonstrated in several verification studies. These include unsteady shock tube flow, a two-dimensional blast wave and of the development of Mach 3 flow over a forward facing step in a wind tunnel, which are compared with previous results from the literature wherever is possible. Finally the implementation of QUIETWAVE, a rapid method of simulating blast events in urban environments, is introduced and the results of a test case are presented.
High-performance, high-capacity single-chip microcomputers
Authors: ED Peatrowsky
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The MC6801 Single-Chip Microcomputer has long been recognized as a highperformance microcomputer. This paper provides a brief look at the complete M6801 family and then discusses the enhancements made to the Timer and Serial Communications Interface circuitry of the basic MC6801 to develop the new MC6801U4 microcomputer. The MC6801U4 strengthens the M6801 family position in the high-performance single-chip microcomputer marketplace. 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
Personalized video adaptation based on video content analysis
Authors: Min Xu, Jesse S. Jin, Suhuai Luo
Venue: Proceedings of the 9th International Workshop on Multimedia Data Mining: held in conjunction with the ACM SIGKDD 2008 (2008)

Personalized video adaptation is expected to satisfy individual users' needs on video content. Multimedia data mining plays a significant role of video annotation to meet users' preference on video content. In this paper, a comprehensive solution for personalized video adaptation is proposed based on video content mining. Video content mining targets both cognitive content and affective content. Cognitive content refers to those semantic events, which are very specific for the video domains. Sometimes, users might prefer "emotional decision" to select their interested video content. Therefore, we introduce affective content which causes audiences' strong reactions. For cognitive content mining, features are extracted from multiple modalities. Machine learning module is further performed to get some middle-level features, such as specific audio sounds, semantic video shots and so on. Those middle-level features are used to detect cognitive content by using Hidden Markov Models. For affective content mining, affective content is detected with three affective levels: "low", "medium" and "high". Considering affective levels might have no sharp boundaries, fuzzy c mean clustering is used on low-level features to simulate user's perceptions. The adaptation is later implemented based on MPEG-21 Digital Item Adaptation framework. One of the challenges is how to quantify users' preference on video content. Information Entropy (IE) and Membership Functions are calculated to decide priorities for resource allocation for cognitive content and affective content respectively.
Watermarking of audio signals through changing the phase of their maskers
Authors: Radek Zezula, Jiří Mišurec
Venue: Proceedings of the 7th conference on Circuits, systems, electronics, control and signal processing (2008)

This article deals with audio signal watermarking as an alternative to securing the copyright of authors of digital audio data. The proposed method exploits tonal and non-tonal components in audio signal to determine suitable phase components for their modification during digital watermark embedding. This method is robust enough as regards loss compression algorithms, which exploit the masking threshold for audio signal compression. This is due to the fact that the embedded watermark is above the level of the masking curve (which is determined just from tonal and nontonal components) and so the watermark is not removed by the effect of a loss compression algorithm. At the same time, the watermark preserves a really low level of watermark-to-signal ratio (WSR), whereby its imperceptibility in watermarked data is guaranteed.
Parallel Method for Discovering Frequent Itemsets Using Weighted Tree Approach
Authors: Preetham Kumar, Ananthanarayana V. S
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Every element of the transaction in a transaction database may contain the components such as item number, quantity, cost of the item bought and some other relevant information of the customer. Most of the association rules mining algorithms to discover frequent itemsets do not consider the components such as quantity, cost etc. In a large database it is possible that even if the itemset appears in a very few transactions, it may be purchased in a large quantity. Further, this may lead to very high profit. Therefore these components are the most important information and without which it may cause the lose of information. This motivated us to propose a parallel algorithm to discover all frequent itemsets based on the quantity of the item bought in a single scan of the database. This method achieves its efficiency by applying two new ideas. Firstly, transaction database is converted into an abstraction called Weighted Tree that prevents multiple scanning of the database during the mining phase. This data structure is replicated among the parallel nodes. Secondly, for each frequent item assigned to a parallel node, an item tree is constructed and frequent itemsets are mined from this tree based on weighted minimum support.
Distributed, High-Performance and Grid Computing in Computational Biology: International Workshop, GCCB 2006, International Workshop, GCCB 2006, Eilat, ... Science / Lecture Notes in Bioinformatics)
Authors: Werner Dubitzky, Assaf Schuster, Peter Sloot, Michael Schroeder, Mathilde Romberg
Venue:  (2007)

The book constitutes the refereed proceedings of the International Workshop on Distributed, High-Performance and Grid Computing in Computational Biology, GCCB 2006, held in Eilat, Israel in January 2007 in conjunction with the 5th European Conference on Computational Biology, ECCB 2006. The 13 revised full papers presented were carefully reviewed and selected from many high quality submissions. All current issues of computational biology, bioinformatics and life science are addressed concerning distributed, high-performance and grid computing technologies in the context of computational biology and bioinformatics. The papers are organized in topical sections on sequence analysis, grids for screening and property prediction, data management, and collaborative environments.
Pendaphonics: a tangible pendulum-based sonic interaction experience
Authors: Anne-Marie Skriver Hansen, Dan Overholt, Winslow Burleson, Camilla Nørgaard Jensen
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Pendaphonics is a tangible physical-digital-sonic environment and interactive system that engages users in individual, collaborative, group, and distributed interactive experiences. The development of this system, as an element of urban revitalization and as a transdisciplinary research endeavor, presents strategies for the design and evaluation of low-cost, flexible, and distributed tangible interaction architectures for public engagement, expression, and performance. Pendaphonics is installed in a public media arts space, where over 200 people experienced it during the environment's opening event. Internationally, interaction laboratories at five research universities are advancing explorations of Pendaphonics. This paper presents the development process and findings from observation and evaluation of people using Pendaphonics; diverse social interaction patterns among performers and the general public are discussed. In particular, we identify the repeated and sustained invitation to interact -- created by the cyclic motion of a pendulum's simple harmonic oscillation -- as a new tangible interaction modality for human computer interaction, in 3D physical-digital-sonic environments. An investigation of this and related elements of Pendaphonics' large-scale tangible interaction scenarios are articulated, along with descriptions of the system's broad potential as a compositional and choreographic tool; an educational exhibit and classroom manipulative; and as an interface that facilitates playful interaction, exploration, discovery and creativity.
A Marginal Productivity Index Rule for Scheduling Multiclass Queues with Setups
Authors: José Niño-Mora
Venue: Network Control and Optimization: Second Euro-NF Workshop, NET-COOP 2008 Paris, France, September 8-10, 2008. Revised Selected Papers (2009)

This paper addresses the problem of designing a tractable scheduling rule for a multiclass M/G/1 queue incurring class-dependent linear holding costs and setup costs, as well as class-dependent generally distributed setup times, which performs well relative to the discounted or average cost objective. We introduce a new dynamic scheduling rule based on priority indices which emerges from deployment of a systematic methodology for obtaining marginal productivity index policies in the framework of restless bandit models, introduced by Whittle (1988) and developed by the author over the last decade. For each class, two indices are defined: an active and a passive index, depending on whether the class is or is not set up, which are functions of the class state (number in system). The index rule prescribes to engage at each time a class of highest index: it thus dynamically indicates both when to leave the class being currently served, and which class to serve next. The paper (i) formulates the problem as a semi-Markov multiarmed restless bandit problem; (ii) introduces the required extensions to previous indexation theory; and (iii) gives closed index formulae for the average criterion.
Fault Tolerance Improvement through Architecture Change in Artificial Neural Networks
Authors: Fernando Morgado Dias, Ana Antunes
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper presents a technique for improving the fault tolerance capability of Artificial Neural Networks. This characteristic of distributed systems, which is usually pointed out as one of the advantages of this structure hasn't been deeply studied and can be improved in most of the networks. The solution implemented here consists of changing the architecture of feedforward artificial neural networks after the training stage while maintaining its output unchanged. It involves evaluating the elements of the Artificial Neural Network which are more sensible to a fault and duplicating inputs, bias, weights or neurons, according to the evaluation done before. This solution is very interesting because it allows maintaining the pre-trained network, but its cost is the need of additional hardware resources to implement the same network. The paper also presents an example of the application of the technique to illustrate its effectiveness.
An Event Driven TDMA Protocol for Wireless Sensor Networks
Authors: Haigang Gong, Ming Liu, Lingfei Yu, Xiaomin Wang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

MAC protocol is the major consumer of sensor energy because it controls the activity of wireless radio of sensor nodes directly. The energy efficiency of MAC protocol makes a strong impact on the network performance. TDMA-based MAC protocol is inherently collision free, and can rule out idle listening since nodes know when to transmit. But traditional TDMA protocol is not suitable for event driven application. In this paper, we present ED-TDMA, an event driven TDMA protocol for wireless sensor network. It improves channel utility by changing the length of TDMA frame according to the number of source nodes and saves energy with bitmap-assisted TDMA schedule. In addition, ED-TDMA employs intra-cluster coverage to prolong network lifetime and to improve system scalability. Simulation results show that ED-TDMA performs better than some other MAC protocol for event driven application in wireless sensor network with high-density deployment and under low traffic.
Multiple level orthogonal codes and their application in MC-CDMA systems
Authors: Jingtao Zhang, David W. Matolak
Venue: Computer Communications (2009)

This paper proposes the use of multiple level orthogonal (MLO) codes in multicarrier CDMA (MC-CDMA) systems. It is extremely challenging to improve system error probability performance of MC-CDMA systems with binary spreading codes in multi-user conditions, since attainable-diversity performance is severely degraged by multi-user interference (MUI) in frequency-selective fading channel conditions, even with the use of optimum multi-user detection (MUD) methods. MLO codes are shown to improve system error probability performance in heavily-loaded or fully-loaded systems, in comparison to binary codes. Some widely used MLO code generation methods are summarized, and a new generation method is also provided. The performance advantage of MLO codes over binary codes is analyzed by treating the spreading process in MC-CDMA as a coding process and via analysis of pair-wise sequence error probability. Rules for choosing desirable MLO codes for multi-user MC-CDMA are also given. Numerical results show that MLO codes can provide a substantial performance improvement in fully-loaded systems. For example, for a K=4 user system with spreading gain L=4, our system can obtain a diversity order of 3, whereas the binary code system diversity order is only slightly larger than 1. The MLO code application provides a new way to compensate for multi-user interference (MUI) and makes MC-CDMA more attractive for future high data-rate transmission systems.
Sharing Memory between Byzantine Processes Using Policy-Enforced Tuple Spaces
Authors: Alysson Neves Bessani, Miguel Correia, Joni da Silva Fraga, Lau Cheuk Lung
Venue: IEEE Transactions on Parallel and Distributed Systems (2009)

Despite the large amount of Byzantine fault-tolerant algorithms for message-passing systems designed through the years, only recently algorithms for the coordination of processes subject to Byzantine failures using shared memory have appeared. This paper presents a new computing model in which shared memory objects are protected by fine-grained access policies, and a new shared memory object, the Policy-Enforced Augmented Tuple Space (PEATS). We show the benefits of this model by providing simple and efficient consensus algorithms. These algorithms are much simpler and requires less shared memory operations, using also less memory bits than previous algorithms based on ACLs and sticky bits. We also prove that PEATS objects are universal, i.e., that they can be used to implement any other shared memory object, and present lock-free and wait-free universal constructions.
Verification from Declarative Specifications Using Logic Programming
Authors: Marco Montali, Paolo Torroni, Marco Alberti, Federico Chesani, Marco Gavanelli, Evelina Lamma, Paola Mello
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

In recent years, the declarative programming philosophy has had a visible impact on new emerging disciplines, such as heterogeneous multi-agent systems and flexible business processes. We address the problem of formal verification for systems specified using declarative languages, focusing in particular on the Business Process Management field. We propose a verification method based on the g-SCIFF abductive logic programming proof procedure and evaluate our method empirically, by comparing its performance with that of other verification frameworks.
A mixed integer linear formulation for the minimum label spanning tree problem
Authors: M.Eugénia Captivo, João C. N. Clímaco, Marta M. B. Pascoal
Venue: Computers and Operations Research (2009)

In this paper we deal with the minimum label spanning tree problem. This is a relevant problem with applications such as telecommunication networks or electric networks, where each edge is assigned with a label (such as a color) and it is intended to determine a spanning tree with the minimum number of different labels. We introduce some mixed integer formulations for this problem and prove that one of their relaxations always gives the optimal value. Finally we present and discuss the results of computational experiments.
A Novel Filter Bank Design Method with CEM FRM Technique
Authors: Li-Zhi Zhang, Wen-Yu Luo
Venue: International Journal of Distributed Sensor Networks (2009)

Modulation filter banks can be obtained by modulating one or two prototype filters, which reduce the design complexity of the filter banks. Furthermore, this kind of filter can be realized by using DFT or FFT with very high computationally efficiency. The proposition of a modulation filter bank reduces the computation complexity of designing the filter bank consumedly, which has very high computation efficiency. However, with the increasing of channels, the request for transition of the prototype filter is very high. This makes the length of the prototype filter longer, which decreases the computation efficiency. Frequency-response masking technique, which was proposed by Lim in 1986, is a very efficient way for designing the sharp transition filter. It is composed of three sub-filters and a delay chain. The basic thought is designing a low complexity filter before compressing its frequency response, and then eliminating the useless periodic images of the prototype filter and its compensation filter by two masking filters. The complexity of the FRM filter can also be reduced by modifying its architecture. According to it, the paper deduces a Novel FRM low-pass filter based on Complex Exponential Modulation (CEM). The deduced filter is very suitable to the multi-rate digital signal process, apart from applying a single rate digital signal process. In the application of software defined radio, the most bandwidth needs to be separated because it may has many narrowband channels. The need is very stringent for the filter to attenuate the closer channels. The filter banks encounter a main problem when it is used to separate channels, which is that the prototype filter must be a sharp transition bandwidth filter. Furthermore, the length of the prototype filter becomes longer in the DFT filter banks when the number of sub-filters is large and the transition band is very sharp. So it is very important to use a high efficiency digital filter, which can reduce the number of coefficient observably. Based on the advantage of deduced novel low-pass filter, the paper proposes a new analysis filter bank architecture, which makes use of the high efficiency low-pass filter as a prototype filter. So it can decrease the computation complexity consumedly when the transition bandwidth of prototype filter is especially very sharp. It is the same with the alterable bandwidth system. At last, an eight channels filter bank design example is used to illustrate its feasibility. It reduces the computationally complexity of the sharp transition filter by using a CEM FRM prototype filter. At last, an application example has been given to illustrate the design of analysis filter banks, showing that the resulting filter bank reduces the computation complexity, which adapt to use in engineering implementation.
Untraditional Approach to Computer Energy Reduction
Authors: Vasily G. Moshnyaga
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

This paper analyzes energy consumption of computer lifetime stages: manufacturing, usage and end-of-life. It shows that despite high energy costs of manufacturing, computer is used only a fraction of its expected lifetime. Reusing computers could significantly amortize the energy of production and eventually save energy.
A survey of palmprint recognition
Authors: Adams Kong, David Zhang, Mohamed Kamel
Venue: Pattern Recognition (2009)

Palmprint recognition has been investigated over 10 years. During this period, many different problems related to palmprint recognition have been addressed. This paper provides an overview of current palmprint research, describing in particular capture devices, preprocessing, verification algorithms, palmprint-related fusion, algorithms especially designed for real-time palmprint identification in large databases and measures for protecting palmprint systems and users' privacy. Finally, some suggestion is offered.
Open identification and linking of the four Ws
Authors: Ryan Shaw, Michael Buckland
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Platforms for social computing connect users via shared references to people with whom they have relationships, events attended, places lived in or traveled to, and topics such as favorite books or movies. Since free text is insufficient for expressing such references precisely and unambiguously, many social computing platforms coin identifiers for topics, places, events, and people and provide interfaces for finding and selecting these identifiers from controlled lists. Using these interfaces, users collaboratively construct a web of links among entities.
Two WAM Implementations of Action Rules
Authors: Bart Demoen, Phuong-Lan Nguyen
Venue: Proceedings of the 24th International Conference on Logic Programming (2008)

Two implementations of Action Rules are presented in the context of a WAM-like Prolog system: one follows a meta-call based approach, the other uses suspended WAM environments on the WAM heap. Both are based on a program transformation that clarifies the semantics of Action Rules. Their implementation is compared experimentally to the TOAM-based implementation of Action Rules in B-Prolog. The suspension based approach is faster at reactivating agents on the instantiation event. The meta-call approach is easier to implement, performs overall very good and much better for synchronous events, and it is more flexible than the suspension based approaches.