ppxscal/embedding_network huggingface dataset:
Technical Section: Accelerated MIP based on GPU using block clipping and occlusion query
Authors: Heewon Kye, DongKyun Jeong
Venue: Computers and Graphics (2008)

We present an acceleration method for maximum intensity projection (MIP) based on graphics processing units (GPUs). To enhance the cache efficiency of the GPU, we divide volume data into equal blocks without memory reordering overhead, and seam on the block boundary. Then, we perform visibility culling on each block to reduce data size during runtime. For efficient visibility culling, we propose a new method using occlusion query, which is a function supported by GPUs. Because this has some drawbacks such as requiring depth buffer, long latency and asynchronous functionality, we present suitable adaptations and experiments for optimal performance. The algorithm achieves good performance improvement without image degradation.
Categorical skylines for streaming data
Authors: Nikos Sarkas, Gautam Das, Nick Koudas, Anthony K. H. Tung
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The problem of skyline computation has attracted considerable research attention. In the categorical domain the problem becomes more complicated, primarily due to the partially-ordered nature of the attributes of tuples. In this paper, we initiate a study of streaming categorical skylines. We identify the limitations of existing work for offline categorical skyline computation and realize novel techniques for the problem of maintaining the skyline of categorical data in a streaming environment. In particular, we develop a lightweight data structure for indexing the tuples in the streaming buffer, that can gracefully adapt to tuples with many attributes and partially ordered domains of any size and complexity. Additionally, our study of the dominance relation in the dual space allows us to utilize geometric arrangements in order to index the categorical skyline and efficiently evaluate dominance queries. Lastly, a thorough experimental study evaluates the efficiency of the proposed techniques.
Recursive object model (ROM)-Modelling of linguistic information in engineering design
Authors: Yong Zeng
Venue: Computers in Industry (2008)

Throughout the engineering design process, the design problem and design solutions may be represented by natural language, sketches, technical drawings, and process diagrams. Due to its ambiguity and flexibility, natural language processing has not been well integrated into the tools and methods assisting the design process. This paper proposes a new graphic language, called recursive object model (ROM), to represent natural language used in engineering, which are mainly composed by statements. The ROM uses only five basic symbols to represent object, compound object, constraint relationship, predicate relationship and connection relationship. Those five elements are derived mathematically and are proven sufficient for technical English through enumeration. Three case studies addressing different aspects of design are used to demonstrate the usefulness of the ROM.
Multiclass SVM-RFE for product form feature selection
Authors: Meng-Dar Shieh, Chih-Chieh Yang
Venue: Expert Systems with Applications: An International Journal (2008)

Various form features affect consumer preference regarding product design. It is, therefore, important that designers identify these critical form features to aid them in developing appealing products. However, the problems inherent in choosing product form features have not yet been intensively investigated. In this paper, an approach based on multiclass support vector machine recursive feature elimination (SVM-RFE) is proposed to streamline the selection of optimum product form features. First, a one-versus-one (OVO) multiclass fuzzy support vector machines (multiclass fuzzy SVM) model using a Gaussian kernel was constructed based on product samples from mobile phones. Second, an optimal training model parameter set was determined using two-step cross-validation. Finally, a multiclass SVM-RFE process was applied to select critical form features by either using overall ranking or class-specific ranking. The weight distribution of each iterative step can be used to analyze the relative importance of each of the form features. The results of our experiment show that the multiclass SVM-RFE process is not only very useful for identifying critical form features with minimum generalization errors but also can be used to select the smallest feature subset for building a prediction model with a given discrimination capability.
Rapid Prototyping for Functional Electrical Stimulation Control
Authors: Philip A. Tresadern, Sibylle B. Thies, Laurence P. J. Kenney, David Howard, John Y. Goulermas
Venue: IEEE Pervasive Computing (2008)

Electrical muscle stimulators can help restore limb function following a neurological injury. However, complex neuromuscular stimulators need a straightforward software interface to simplify hardware programming and make patient care more efficient. The Clinical Set-up Tool integrates fast parameter selection with a user-friendly interface. The system could potentially operate on portable devices, such as mobile phones, increasing its potential for widespread acceptance in the clinical community.
Mining typical patterns from databases
Authors: Hui-Ling Hu, Yen-Liang Chen
Venue: Information Sciences: an International Journal (2008)

There have been many approaches used to discover useful information patterns from databases, such as concept description, associations, sequential patterns, classification, clustering, and deviation detection. This paper proposes a new type of information pattern, called a typical pattern, which is a small subset of objects selected from a large dataset that provides a compact and suitable representation of the original dataset. The Typical Patterns Mining (TPM) algorithm is developed to mine typical patterns from databases. Extensive experiments are carried out using a real dataset to demonstrate the usefulness of typical patterns in practical situations. The experimental results indicate that TPM is a computationally efficient method and that typical patterns can provide a compact and suitable representation of the original dataset.
The optimization of an export/import company by use of a MIMO/4G channel
Authors: J. P. Torres, I. Soto, R. Carrasco
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

The aim of this paper is to present a new view in the transportation problem for the Export/Import process using 4G technology. This paper offers a description of the commercials transactions using the Workflow model in order to quantify the gain of the implementation using MIMO channel. The results show a gain of at least a 14%, because of the reduction in the errors in the channel with a gain of 4.5 dB at the receiver side.
Classical interaction cannot replace a quantum message
Authors: Dmitry Gavinsky
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

We demonstrate a two-player communication problem that can be solved in the one-way quantum model by a 0-error protocol of cost O(log n) but requires exponentially more communication in the classical interactive (bounded error) model.
Software Configuration Management for Product Derivation in Software Product Families
Authors: Cheng Thao, Ethan V. Munson, Tien N. Nguyen
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

A key process in software product line (SPL) engineering is product derivation, which is the process of building software products from a base set of core assets. During product derivation, the components in both core assets and derived software products are modified to meet needs for different functionality, platforms, quality attributes, etc. However, existing software configuration management (SCM) systems do not sufficiently support the derivation process in SPL. In this paper, we introduce a novel SCM system that is well-suited for product derivation in SPL. Our tool, MoSPL handles version management at the component level via its product versioning and data models. It explicitly manages logical constraints and derivation relations among components in both core assets and derived products, thus enabling the automatic propagation of changes in the core assets to their copies in derived products and vice versa. The system can also detect conflicting changes to different copies of components in software product lines.
Generating all minimal integral solutions to AND-OR systems of monotone inequalities: Conjunctions are simpler than disjunctions
Authors: Leonid Khachiyan Endre Boros, Khaled Elbassioni, Vladimir Gurvich
Venue: Discrete Applied Mathematics (2008)

We consider monotone @?,@?-formulae @f of m atoms, each of which is a monotone inequality of the form f"i(x)>=t"i over the integers, where for i=1,...,m, f"i:Z^n@?R is a given monotone function and t"i is a given threshold. We show that if the @?-degree of @f is bounded by a constant, then for linear, transversal and polymatroid monotone inequalities all minimal integer vectors satisfying @f can be generated in incremental quasi-polynomial time. In contrast, the enumeration problem for the disjunction of m inequalities is NP-hard when m is part of the input. We also discuss some applications of the above results in disjunctive programming, data mining, matroid and reliability theory.
Managing virtual money for satisfaction and scale up in P2P systems
Authors: Jorge-Arnulfo Quiané-Ruiz, Philippe Lamarre, Sylvie Cazalens, Patrick Valduriez
Venue: Proceedings of the 2008 international workshop on Data management in peer-to-peer systems (2008)

In peer-to-peer data management systems query allocation is a critical issue for the good operation of the system. This task is challenging because participants may prefer to perform some queries than others. Microeconomic mechanisms aim at dealing with this, but, to the best of our knowledge, none of them has ever proposed experimental validations that, beyond query load or response time, use measures that are outside the microeconomic scope. The contribution of this paper is twofold. We present a virtual money-based query allocation process that is suitable for large-scale super peer systems. We compare a non microeconomic mediation with micro-economic ones from a satisfaction point of view. The experimental results show that the providers' invoice phase is as much important as the providers' selection phase for a virtual money-based mediation.
Continuous Reverse k-Nearest-Neighbor Monitoring
Authors: Wei Wu, Fei Yang, Chee Yong Chan, Kian-Lee Tan
Venue: Proceedings of the The Ninth International Conference on Mobile Data Management (2008)

The processing of a Continuous Reverse k-Nearest-Neighbor (CRkNN) query on moving objects can be divided into two sub tasks: continuous filter, and continuous refinement. The algorithms for the two tasks can be completely independent. Existing CRkNN solutions employ Continuous k-Nearest-Neighbor (CkNN) queries for both continuous filter and continuous refinement. We analyze the CkNN based solution and point out that when k>1 the refinement cost becomes the system bottleneck. We propose a new continuous refinement method called CRange-k. In CRange-k, we transform the continuous verification problem into a Continuous Range-k query, which is also defined in this paper, and process it efficiently. Experimental study shows that the CRkNN solution based on our CRange-k refinement method is more efficient and scalable than the state-of-the-art CRkNN solution.
OXADMs: The Comparison with the Existing Device
Authors: Mohammad Syuhaimi Ab-Rahman, Mohd Faisal Ibrahim
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

This paper introduces a new optical device model named as an optical cross add and drop multiplexer (OXADM) which has potential use in CWDM metro area networks. The device uses the concepts of combination of optical add/drop multiplexing and optical cross connect between two main transmission lines in order to implement the wavelength routing operation. MEMS optical switches are integrated in the device to make it re-configurable. With excellent features, the device is particularly designed to improve network efficiency, flexibility and survivability. The device can be used in point to point, ring or mesh network topology to provide functionality such as routing, supervision, transport, multiplexing and restoration of client digital signals processed predominantly in the optical domain. The wavelengths on each optical trunk can be switched between each other while implementing add and drop functions simultaneously. We do a comparison between OXADM with the previous devices such as, OXC, TRN and OXN. The limitation occurs in OXADM as compare with OXC is also studied analytically in the respect of scalability (in term number of ports and operating wavelengths).
The effects of national culture on ERP implementation: a study of Colombia and Switzerland
Authors: M. A. Palomino Murcia, E. A. Whitley
Venue: Enterprise Information Systems (2007)

This research explores the effects of national culture, as understood by Hofstede's concepts of power distance, individualist/collectivist and uncertainty avoidance. The study is based on case studies of ERP implementation in Colombia and Switzerland and interviews and document analysis methods were employed. Evidence is found on the ways the three dimensions impact on ERP implementation. It is concluded that although the two countries differ markedly in each dimension, there was no evidence of specific individualist/collectivist effects. The implications of this are discussed.
Benefits of interactive display environments in the software development process
Authors: Mathias Frisch, Raimund Dachselt
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

Models become increasingly important for software development processes. Though there is a multitude of software modeling tools available, the handling of diagrams is still difficult. To overcome these problems we propose the usage of novel visualization and interaction techniques for the software development process, including multi-touch displays, the integration of diagrams drawn by hand and the interaction through zoomable user interfaces.
Smart Differential Pressure Sensor with Bluetooth Communication Interface
Authors: Steffan Pavel, Michal Pavlik, Radimir Vrba
Venue: Proceedings of the Third International Conference on Systems (2008)

This paper presents design and assembly of mixed electronic circuitry for measured signal processing of the capacitive difference pressure sensor, as well as analysis of the obtained results. The smart pressure sensor provides values of measured pressure via 4 - 20 mA current loop output. The loop current is also used for sensor circuitry supplying. This means that current consumption of the whole sensor electronics should be less than 3.5 mA even in extended industrial temperature range from –40 to +125 °C.
Variation-aware gate sizing and clustering for post-silicon optimized circuits
Authors: Cheng Zhuo, David Blaauw, Dennis Sylvester
Venue: Proceeding of the 13th international symposium on Low power electronics and design (2008)

As technology is aggressively scaled, nano-regime VLSI designs are becoming increasingly susceptible to process variations. Unlike pre-silicon optimization, post-silicon techniques can tune the individual die to better meet the power-delay constraints. This paper proposes a variation-aware methodology for the simultaneous gate sizing and clustering for post-silicon tuning with adaptive body biasing. The proposed methodology uses an accurate table look-up model and fully explores the interaction between gate sizing and optimal body bias based clustering. In addition, it is suitable for industrial test cases with tens of thousands gates. Our optimization methodology includes a body bias distribution alignment strategy to mitigate the impact of critical gates. In this way, the cluster's body bias voltage is not simply determined by only a few critical gates. We also prove the linear dependence between the mean of the body bias probability distribution and the gate size. Based on this, we further investigate a simultaneous sizing and re-clustering algorithm for better leakage savings. A circuit re-balancing and gate snapping scheme is then suggested to map the solution to a standard cell library. Compared with arecently-reported method, the proposed methodology can obtain on average 25.5% leakage saving at nearly the same run time.
Two New Methods for Accurate Test Set Relaxation via Test Set Replacement
Authors: Stelios Neophytou, Maria K. Michael
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This papaer presents two different techniques for relaxing a given test set by maximizing the number of unspecified bits in the test set, without compromising the fault coverage or increasing the test set size. The first method replaces each pattern in the test set with another targeting as few faults as necessary. The second method iterates among faults and enforces detection of a fault only by the test resulting in the largest specified bits reduction. Experimental results show increased reduction rates, even when the input test set has been compacted or already contains unspecified bits, when compared to existing methods. The effectiveness of the proposed methods is demonstrated for two popular test set embedding schemes, using the obtained test sets.
Innovation, design, and simplicity at google
Authors: Marissa Mayer
Venue: ACM SIGCSE Bulletin (2008)

This talk will cover the philosophies of innovation and design at Google, complete with examples of how these philosophies have affected and produced various Google services. Other topics to be covered include: how Google approaches building products with simplicity, its pragmatic and experimental approach to launching products, and a discussion of the academic computer science skills that large, distributed, web-based systems like Google require.
2008 Special Issue: Embodied models of delayed neural responses: Spatiotemporal categorization and predictive motor control in brain based devices
Authors: Jeffrey L. McKinstry, Anil K. Seth, Gerald M. Edelman, Jeffrey L. Krichmar
Venue: Neural Networks (2008)

In order to respond appropriately to environmental stimuli, organisms must integrate over time spatiotemporal signals that reflect object motion and self-movement. One possible mechanism to achieve this spatiotemporal transformation is to delay or lag neural responses. This paper reviews our recent modeling work testing the sufficiency of delayed responses in the nervous system in two different behavioral tasks: (1) Categorizing spatiotemporal tactile cues with thalamic ''lag'' cells and downstream coincidence detectors, and (2) Predictive motor control was achieved by the cerebellum through a delayed eligibility trace rule at cerebellar synapses. Since the timing of these neural signals must closely match real-world dynamics, we tested these ideas using the brain based device (BBD) approach in which a simulated nervous system is embodied in a robotic device. In both tasks, biologically inspired neural simulations with delayed neural responses were critical for successful behavior by the device.
On clustering phenomenon in mobile partitioned networks
Authors: Michal Piórkowski, Natasa Sarafijanovic-Djukic, Matthias Grossglauser
Venue: Proceeding of the 1st ACM SIGMOBILE workshop on Mobility models (2008)

According to different kinds of connectivity, we can distinguish three types of mobile ad-hoc networks: dense, sparse and clustered networks. This paper is about modeling mobility in clustered networks, where nodes are concentrated into clusters of dense connectivity, and in between there exists sparse connectivity. The dense and sparse networks are extensively studied and modeled, but not much attention is paid to the clustered networks. In the sparse and clustered networks, an inherently important aspect is the mobility model, both for the design and evaluation of routing protocols. We propose a new mobility model for clustered networks, called Heterogeneous Random Walk. This model is simple, mathematically tractable and most importantly it captures the phenomenon of emerging clusters, observed in real partitioned networks, in an elegant way. We provide a closed-form expression for the stationary distribution of node position and we give a recipe for the "perfect simulation". Moreover, based on the real mobility trace we provide strong evidence for the main macroscopic characteristics of clustered networks captured by the proposed mobility model. For the very first time in the literature we show evidence for the correlation between the spatial speed distribution and the cluster formation. We also present the results of the analysis of real cluster dynamics caused by nodes' mobility.
Finding candidate spots for replica servers based on demand fluctuation
Authors: Masato Asahara, Akio Shimada, Hiroshi Yamada, Kenji Kono
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Many service providers distribute various kinds of content over the Internet. They often use replica servers to provide stable service. To position them appropriately, service providers must predict the demands for their services and provide computing capacity sufficient for servicing the demands. Unfortunately, predicting demands is difficult because demand for a service usually fluctuates. Our research group is developing ExaPeer, an infrastructure that apportions computing capacity to services running on hundreds or thousands of trusted machines all over the Internet. In this paper, we describe ExaPeer&#x2019;s approach to dynamically selecting candidate spots for replica servers. The runtime system in ExaPeer detects fluctuations in demand and then dynamically selects candidate spots on which replica servers should be placed to best meet the demand. Experimental results demonstrate that the candidate spots selected by ExaPeer work better than manually selected ones even if the scale of demand changes rapidly.
Certification of directional derivatives computed by automatic differentiation
Authors: Mauricio Araya-Polo, Laurent Hascoët
Venue: Proceedings of the 7th WSEAS International Conference on Applied Mathematics (2005)

Automatic Differentiation (AD) tools assume differentiability of the function implemented by the given program. However, due to switches in the control flow, most programs are only piecewise differentiable. Thereby, sometimes the derivatives are wrong, unfortunately this fact is overlook by everyday use of AD. There exist extended models of AD that return useful generalized derivatives for some classes of piecewise differentiable functions, but there is little hope of doing so for all cases. In contrast, our goal is to evaluate, along with the derivative, the size of the differentiable neighborhood around the current input. This "safe neighborhood" is essential to use the derivatives consistently. We investigate several models to compute this neighborhood and study their complexity. We propose one model of acceptable cost. We present a first implementation and experiments made with our AD tool tapenade.