ppxscal/embedding_network huggingface dataset:
Testing of matrix-poset properties
Authors: Eldar Fischer, Ilan Newman
Venue: Combinatorica (2007)

Combinatorial property testing, initiated by Rubinfeld and Sudan [23] and formally defined by Goldreich, Goldwasser and Ron in [18], deals with the following relaxation of decision problems: Given a fixed property P and an input f, distinguish between the case that f satisfies P, and the case that no input that differs from f in less than some fixed fraction of the places satisfies P. An (&#x03b5;, q)-test for P is a randomized algorithm that queries at most q places of an input f and distinguishes with probability 2/3 between the case that f has the property and the case that at least an &#x03b5;-fraction of the places of f need to be changed in order for it to have the property. Here we concentrate on labeled, d-dimensional grids, where the grid is viewed as a partially ordered set (poset) in the standard way (i.e. as a product order of total orders). The main result here presents an (&#x03b5;, poly(1/&#x03b5;))-test for every property of 0/1 labeled, d-dimensional grids that is characterized by a finite collection of forbidden induced posets. Such properties include the &#x201c;monotonicity&#x201d; property studied in [9,8,13], other more complicated forbidden chain patterns, and general forbidden poset patterns. We also present a (less efficient) test for such properties of labeled grids with larger fixed size alphabets. All the above tests have in addition a 1-sided error probability. This class of properties is related to properties that are defined by certain first order formulae with no quantifier alternation over the syntax containing the grid order relations. We also show that with one quantifier alternation, a certain property can be defined, for which no test with query complexity of O(n 1/4) (for a small enough fixed &#x03b5;) exists. The above results identify new classes of properties that are defined by means of restricted logics, and that are efficiently testable. They also lay out a platform that bridges some previous results.
Testable Specifications of NoTA-based Modular Embedded Systems
Authors: Dragos Truscan, Johan Lindqvist, Johan Lilius, Ivan Porres, Timo Eriksson, Juha Rakkola, Antti Latva-Aho
Venue: Proceedings of the 15th Annual IEEE International Conference and Workshop on the Engineering of Computer Based Systems (2008)

We propose an approach to specifying embedded devices based on the Network on Terminal Architecture (NoTA) and show how the approach allows the specification of NoTA components, including service interfaces, and timing and energy consumption constraints. The purpose of such specifications is two fold: to enable vendors to provide already tested component implementations with respect to specifications, and to allow system designers to test these components in integration. The proposed specifications feature both a graphical notation for facilitating the specification process using dedicated tools and a textual one for exchanging component specifications between system designers and vendors.
A control architecture for a mobile heavy-lift precision manipulator with limited sensory information
Authors: William Becker, Matthew Dicicco, Justin Garretson, Steven Dubowsky
Venue: Robotica (2007)

Mobile robotic manipulators can augment the strength and dexterity of human operators in unstructured environments. Here, the control system for a six degree-of-freedom heavy-lift mobile manipulator for lifting and inserting payloads on the deck of a ship is described. The robotic hardware and the application present several control challenges, including structural resonances, high joint friction that varies with time, limited sensors for measuring the joint friction, complex interaction with the environment, tight tolerances for the insertion tasks, lack of bilateral force feedback of the contact forces, and ship motions. The control system enables an operator to perform insertion tasks using feedback of tactile clues of the manipulator position, and reduces the effects of friction with a combination of sensor-based, adaptive, and model-based methods of friction compensation. The control architecture is validated in simulation and on a laboratory manipulator.
A novel pattern based clustering methodology for time-series microarray data
Authors: Sieu Phan, Fazel Famili, Zoujian Tang, Youlian Pan, Ziying Liu, Junjun Ouyang, Anne Lenferink, Maureen Mc-Court O'connor
Venue: International Journal of Computer Mathematics (2007)

Identification of co-expressed genes sharing similar biological behaviours is an essential step in functional genomics. Traditional clustering techniques are generally based on overall similarity of expression levels and often generate clusters with mixed profile patterns. A novel pattern recognition method for selecting co-expressed genes based on rate of change and modulation status of gene expression at each time interval is proposed in this paper. This method is capable of identifying gene clusters consisting of highly similar shapes of expression profiles and modulation patterns. Furthermore, we develop a quality index based on the semantic similarity in gene annotations to assess the likelihood of a cluster being a co-regulated group. The effectiveness of the proposed methodology is demonstrated by applying it to the well-known yeast sporulation dataset and an in-house cancer genomics dataset.
Performance Evaluation of the SERENA Algorithm to SchEdule RoutEr Nodes Activity in Wireless Ad Hoc and Sensor Networks
Authors: Saoucene Mahfoudh, Pascale Minet
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In wireless ad hoc and sensor networks, an analysis of the node energy consumption distribution shows that the largest part is due to the time spent in the idle state. This result is at the origin of SERENA, an algorithm to SchEdule RoutEr Nodes Activity. SERENA allows router nodes to sleep, while ensuring end-to-end communication in the wireless network. It is a localized and decentralized algorithm assigning time slots to nodes. Any node stays awake only during its slot and the slots assigned to its neighbors, it sleeps the remaining time. Simulation results show that SERENA enables us to maximize network lifetime while increasing the number of user messages delivered. We quantify the slot reuse and evaluate the impact of the frame size on network performance. We then study how to dimension buffers at the router nodes. Finally, we show how SERENA improves the node energy consumption distribution and maximizes the energy efficiency of wireless ad hoc and sensor networks.
Hierarchical motion estimation for side information creation in Wyner-Ziv video coding
Authors: João Ascenso, Fernando Pereira
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Recently, several video coding solutions based on the distributed source coding paradigm have appeared in the literature. Among them, Wyner-Ziv video coding schemes enable to achieve a flexible distribution of the computational complexity between the encoder and decoder, promising to fulfill requirements of emerging applications such as visual sensor networks and wireless surveillance. To achieve a performance comparable to the predictive video coding solutions, it is necessary to increase the quality of the side information, this means the estimation of the original frame created at the decoder. In this paper, a hierarchical motion estimation (HME) technique using different scales and increasingly smaller block sizes is proposed to generate a more reliable estimation of the motion field. The HME technique is integrated in a well known motion compensated frame interpolation framework responsible for the creation of the side information in a Wyner-Ziv video decoder. The proposed technique enables to achieve improvements in the rate-distortion (RD) performance up to 7 dB when compared to H.263+ Intra and 3 dB when compared to H.264/AVC Intra.
Faithful Reconstruction of Application Behavior Based on Event Traces in the LiteOS Operating System
Authors: Qing Cao, Tarek Abdelzaher
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Visibility has been a key challenge for wireless sensor network applications. Deployed on the extremely resource-constrained mote platform, such applications may fail unexpectedly, or exhibit behavior different from their intended goals. To help understand why such problems occur, we design and implement an event trace logger based on the LiteOS operating system, which allows us to partially reconstruct application behavior after execution, such as which path it took for an IF statement, its invocation history of the kernel system calls, and its dynamics across multiple nodes. We plan to demonstrate the usefulness of this event trace logger and its translator using a multi-hop routing application.
Soda pop zombies: soft drink consumption and motion
Authors: Daniel Wigdor, Yuri Ivanov, Christopher R. Wren
Venue: Proceedings of the 2007 workshop on Massive datasets (2007)

In this position paper, we examine a clear inverse correlation of soft drink consumption and overall motion sensor activation within the Massive Dataset. Several hypotheses are posited and tested with the results of a survey of lab members.
Genre, knowledge and digital code in web-based communities: an integrated theoretical framework for shaping digital discursive spaces
Authors: Doreen Starke-Meyerring
Venue: International Journal of Web Based Communities (2008)

Emerging digital discursive spaces, such as wikis, offer new opportunities for knowledge communication. However, participants join such spaces through the lenses of their established discursive practices. These practices, however, interact with the code &ndash; the technological design &ndash; of these spaces, which can reproduce, question, or undermine them, and present alternative opportunities and visions for knowledge communication. Participants, therefore, ultimately face questions about the ways in which tensions between established (genred) practices and alternative practices enabled by code are to be negotiated. Drawing on theories of rhetoric and technology, this article offers an integrated theoretical framework that allows developers of online communities to examine the established rhetorical practices of participants and the ways in which the code of the discursive space may question or facilitate these practices. The paper then illustrates how this framework may be applied to facilitating academic knowledge communication in a wiki space and concludes with implications for decision-making in shaping digital discursive spaces for knowledge communication.
SVM-Based Video Scene Classification and Segmentation
Authors: Yingying Zhu, Zhong Ming
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Video scene classification and segmentation are fundamental steps for multimedia retrieval, indexing and browsing. In this paper, a robust scene classification and segmentation approach based on Support Vector Machine (SVM) is presented, which extracts both audio and visual features and analyzes their inter-relations to identify and classify video scenes. Our system works on content from a diverse range of genres by allowing sets of features to be combined and compared automatically without the use of thresholds. With the temporal behaviors of different scene classes, SVM classifier can effectively classify presegmented video clips into one of the predefined scene classes. After identifying scene classes, the scene change boundary can be easily detected. The experimental results show that the proposed system not only improves precision and recall, but also performs better than the other classification systems using the decision tree (DT), K Nearest Neighbor (K-NN) and Neural Network (NN).
Test Enabled Process Tuning for Adaptive Baseband OFDM Processor
Authors: Muhammad Mudassar Nisar, Abhijit Chatterjee
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

As channel conditions in wireless communications improve, the noise performance of the baseband DSP processor can be degraded to save power without compromising bit error rate. The degradation of baseband signal noise is achieved by degrading the noise performance (reducing the wordlength and supply voltage) of the various baseband signal processing modules in specific proportions defined by a locus, that ensures minimum overall power consumption for a given channel. In the presence of intra-die process variations, this locus is determined by the delay/leakage parameters of each baseband module. In our approach, a path oscillation test applied to each module is used to select the "best" locus of choice and an EVM driven feedback loop is used to dynamically modulate the wordlength/power consumption of each module as dictated by this locus to minimize power and modulate baseband SNR across a range of channel conditions.
Self adaptive animation based on user perspective
Authors: Parag Chaudhuri, George Papagiannakis, Nadia Magnenat-Thalmann
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

In this paper we present a new character animation technique in which the animation adapts itself based on the change in the user&#x2019;s perspective, so that when the user moves and their point of viewing the animation changes, then the character animation adapts itself in response to that change. The resulting animation, generated in real-time, is a blend of key animations provided a priori by the animator. The blending is done with the help of efficient dual-quaternion transformation blending. The user&#x2019;s point of view is tracked using either computer vision techniques or a simple user-controlled input modality, such as mouse-based input. This tracked point of view is then used to suitably select the blend of animations. We show a way to author and use such animations in both virtual as well as augmented reality scenarios and demonstrate that it significantly heightens the sense of presence for the users when they interact with such self adaptive animations of virtual characters.
Calculating wave-generated bottom orbital velocities from surface-wave parameters
Authors: Patricia L. Wiberg, Christopher R. Sherwood
Venue: Computers Geosciences (2008)

Near-bed wave orbital velocities and shear stresses are important parameters in many sediment-transport and hydrodynamic models of the coastal ocean, estuaries, and lakes. Simple methods for estimating bottom orbital velocities from surface-wave statistics such as significant wave height and peak period often are inaccurate except in very shallow water. This paper briefly reviews approaches for estimating wave-generated bottom orbital velocities from near-bed velocity data, surface-wave spectra, and surface-wave parameters; MATLAB code for each approach is provided. Aspects of this problem have been discussed elsewhere. We add to this work by providing a method for using a general form of the parametric surface-wave spectrum to estimate bottom orbital velocity from significant wave height and peak period, investigating effects of spectral shape on bottom orbital velocity, comparing methods for calculating bottom orbital velocity against values determined from near-bed velocity measurements at two sites on the US east and west coasts, and considering the optimal representation of bottom orbital velocity for calculations of near-bed processes. Bottom orbital velocities calculated using near-bed velocity data, measured wave spectra, and parametric spectra for a site on the northern California shelf and one in the mid-Atlantic Bight compare quite well and are relatively insensitive to spectral shape except when bimodal waves are present with maximum energy at the higher-frequency peak. These conditions, which are most likely to occur at times when bottom orbital velocities are small, can be identified with our method as cases where the measured wave statistics are inconsistent with Donelan's modified form of the Joint North Sea Wave Project (JONSWAP) spectrum. We define the ''effective'' forcing for wave-driven, near-bed processes as the product of the magnitude of forcing times its probability of occurrence, and conclude that different bottom orbital velocity statistics may be appropriate for different problems.
Analyzing dynamic call graphs enhanced with program state information for feature location and understanding
Authors: Johannes Bohnet, Juergen Doellner
Venue: Companion of the 30th international conference on Software engineering (2008)

In this paper we present a prototype tool for locating and understanding features in unfamiliar source code of complex C/C++ software systems. The key concepts of the analysis tool are (1) combining dynamic function call graphs with information on the functions' containment within hierarchically structured modules and (2) providing means of gathering program state information on user-defined locations within the call graph. Starting from a typically huge dynamic call graph logged during feature execution, developers narrow their search for functions implementing the feature's core functionality by successively pruning the graph from feature-irrelevant functions. The assessment whether a function contributes to a feature is performed on various levels of abstraction, namely on (1) module containment, (2) on the function's call relations, and (3) on the way it modifies data. Having sorted out feature-irrelevant functions this way, users are able to analyze the remaining, probably highly feature-relevant functions with other heavy-weight analysis techniques, such as debugging techniques, to get a deep understanding of the feature implementation.
From FORTRAN 77 to locality-aware high productivity languages for peta-scale computing
Authors: Hans P. Zima
Venue: Scientific Programming (2007)

When the first specification of the FORTRAN language was released in 1956, the goal was to provide an "automatic programming system" that would enhance the economy of programming by replacing assembly language with a notation closer to the domain of scientific programming. A key issue in this context, explicitly recognized by the authors of the language, was the requirement to produce efficient object programs that could compete with their hand-coded counterparts. More than 50 years later, a similar situation exists with respect to finding the right programming paradigm for high performance computing systems. FORTRAN, as the traditional language for scientific programming, has played a major role in the quest for high-productivity programming languages that satisfy very strict performance constraints. This paper focuses on high-level support for locality awareness, one of the most important requirements in this context. The discussion centers on the High Performance Fortran (HPF) family of languages, and their influence on current language developments for peta-scale computing. HPF is a data-parallel language that was designed to provide the user with a high-level interface for programming scientific applications, while delegating to the compiler the task of generating an explicitly parallel message-passing program. We outline developments that led to HPF, explain its major features, identify a set of weaknesses, and discuss subsequent languages that address these problems. The final part of the paper deals with Chapel, a modern object-oriented language developed in the High Productivity Computing Systems (HPCS) program sponsored by DARPA. A salient property of Chapel is its general framework for the support of user-defined distributions, which is related in many ways to ideas first described in Vienna Fortran. This framework is general enough to allow a concise specification of sparse data distributions. The paper concludes with an outlook to future research in this area.
Information integration in the enterprise
Authors: Philip A. Bernstein, Laura M. Haas
Venue: Communications of the ACM (2008)

A guide to the tools and core technologies for merging information from disparate sources.
Improving suffix array locality for fast pattern matching on disk
Authors: Ranjan Sinha, Simon Puglisi, Alistair Moffat, Andrew Turpin
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

The suffix tree (or equivalently, the enhanced suffix array) provides efficient solutions to many problems involving pattern matching and pattern discovery in large strings, such as those arising in computational biology. Here we address the problem of arranging a suffix array on disk so that querying is fast in practice. We show that the combination of a small trie and a suffix array-like blocked data structure allows queries to be answered as much as three times faster than the best alternative disk-based suffix array arrangement. Construction of our data structure requires only modest processing time on top of that required to build the suffix tree, and requires negligible extra memory.
Exploring Security Countermeasures along the Attack Sequence
Authors: Taketoshi Sakuraba, Bin-Hui Chou, Seiichi Domyo, Kouichi Sakurai
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

A Systematic method exploring security counter-measures is proposed. For each attack, one can consider the moments along the time sequence of the attack, and for each of the moments, one can define approaches of countermeasure design against the attack that is effective at the moment. One could extract new approaches from the existing counter-measures, and think of new countermeasures based on the new approaches against other threats and attacks.
On the power of quantum computation
Authors: D. R. Simon
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

The quantum model of computation is a probabilistic model, similar to the probabilistic Turing Machine, in which the laws of chance are those obeyed by particles on a quantum mechanical scale, rather than the rules familiar to us from the macroscopic world. We present here a problem of distinguishing between two fairly natural classes of function, which can provably be solved exponentially faster in the quantum model than in the classical probabilistic one, when the function is given as an oracle drawn equiprobably from the uniform distribution on either class. We thus offer compelling evidence that the quantum model may have significantly more complexity theoretic power than the probabilistic Turing Machine. In fact, drawing on this work, Shor (1994) has recently developed remarkable new quantum polynomial-time algorithms for the discrete logarithm and integer factoring problems.
Getting Software RITE
Authors: Jeff Patton
Venue: IEEE Software (2008)

Salesforce.com has used the RITE (Rapid Iterative Testing and Evaluation)method to quickly and iteratively improve its software design. RITE has helped the company retain high quality while increasing its rate of delivery using an agile development approach.
Updating an LU Factorization with Pivoting
Authors: Enrique S. Quintana-Ortí, Robert A. Van De Geijn
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

We show how to compute an LU factorization of a matrix when the factors of a leading principle submatrix are already known. The approach incorporates pivoting akin to partial pivoting, a strategy we call incremental pivoting. An implementation using the Formal Linear Algebra Methods Environment (FLAME) application programming interface (API) is described. Experimental results demonstrate practical numerical stability and high performance on an Intel Itanium2 processor-based server.