ppxscal/embedding_network huggingface dataset:
Worst Case Reaction Time Analysis of Concurrent Reactive Programs
Authors: Marian Boldt, Claus Traulsen, Reinhard von Hanxleden
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

Reactive programs have to react continuously to their inputs. Here the time needed to react with the according output is important. While the synchrony hypothesis takes the view that the program is infinitely fast, real computations take time. Similar to the traditional Worst Case Execution Time (WCET), the Worst Case Reaction Time (WCRT) of a program determines the maximal time for one reaction. In this paper, we present an algorithm to determine the WCRT of a program written in the synchronous language Esterel. This value gives an upper bound for the execution time when the program is executed on a reactive processor. Specifically, we consider the execution of the Esterel program on the Kiel Esterel Processor (KEP), a reactive processor that can execute Esterel-like instructions. Here the WCRT directly determines an upper bound on the instruction cycles per logical tick. The WCRT also gives a guideline for the execution time when the Esterel program is compiled to software by a simulation-based approach. We have implemented the WCRT analysis algorithm as part of an Esterel compiler for the Kiel Esterel Processor (KEP) and have measured an accuracy of analysis results of about 22% on average.
Persuading Visual Attention through Geometry
Authors: Youngmin Kim, Amitabh Varshney
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Artists, illustrators, photographers, and cinematographers have long used the principles of contrast and composition to guide visual attention. In this paper we introduce geometry modification as a tool to persuasively direct visual attention. We build upon recent advances in mesh saliency to develop techniques to alter geometry to elicit greater visual attention. Eye-tracking-based user studies show that our approach successfully guides user attention in a statistically significant manner. Our approach operates directly on geometry, and therefore produces view-independent results that can be used with existing view-dependent techniques of visual persuasion.
Finding a dominating set on bipartite graphs
Authors: Mathieu Liedloff
Venue: Information Processing Letters (2008)

Finding a dominating set of minimum cardinality is an NP-hard graph problem, even when the graph is bipartite. In this paper we are interested in solving the problem on graphs having a large independent set. Given a graph G with an independent set of size z, we show that the problem can be solved in time O^*(2^n^-^z), where n is the number of vertices of G. As a consequence, our algorithm is able to solve the dominating set problem on bipartite graphs in time O^*(2^n^/^2). Another implication is an algorithm for general graphs whose running time is O(1.7088^n).
Finding separator cuts in planar graphs within twice the optimal
Authors: N. Garg, H. Saran, V. V. Vazirani
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

Building on the works of S.B. Rao (1987, 1992) and J.K. Park and C.A. Phillips (1993), we present a factor 2 approximation algorithm for the problem of finding a minimum cost b-balanced cut in planar graphs, for b/spl les/1/3, if the vertex weights are given in unary (using scaling, a psuedo-approximation algorithm is also presented for the case of binary vertex weights). This problem is of considerable practical significance, especially in VLSI design.
Atomic wavefunction initialization in ab initio molecular dynamics using distributed Lanczos
Authors: C. Bekas, A. Curioni, W. Andreoni
Venue: Parallel Computing (2008)

We present a distributed scheme for initialization from atomic wavefunctions in ab initio molecular dynamics simulations. Good initial guesses for approximate wavefunctions are very important in order to enable practical simulations with thousands of atoms. The new scheme is based on a distributed implementation of the Lanczos algorithm for very large dense eigenproblems. We show that the massively parallel BG/L (Blue Gene/L) supercomputer with its very fast separate network for collective communications is an ideal platform for the parallel Lanczos algorithm. We have implemented the new scheme in the popular plane-wave code CPMD. We showcase the applicability of the distributed initialization by a series of examples on a family of Silicon super cells ranging from 512 to 2048 atoms.
Hierarchical kernel stick-breaking process for multi-task image analysis
Authors: Qi An, Chunping Wang, Ivo Shterev, Eric Wang, Lawrence Carin, David B. Dunson
Venue: Proceedings of the 25th international conference on Machine learning (2008)

The kernel stick-breaking process (KSBP) is employed to segment general imagery, imposing the condition that patches (small blocks of pixels) that are spatially proximate are more likely to be associated with the same cluster (segment). The number of clusters is not set a priori and is inferred from the hierarchical Bayesian model. Further, KSBP is integrated with a shared Dirichlet process prior to simultaneously model multiple images, inferring their inter-relationships. This latter application may be useful for sorting and learning relationships between multiple images. The Bayesian inference algorithm is based on a hybrid of variational Bayesian analysis and local sampling. In addition to providing details on the model and associated inference framework, example results are presented for several image-analysis problems.
Forward selection method with regression analysis for optimal gene selection in cancer classification
Authors: Han-Saem Park, Si-Ho Yoo, Sung-Bae Cho
Venue: International Journal of Computer Mathematics (2007)

The development of DNA microarray technology has facilitated in-depth research into cancer classification, and has made it possible to process thousands of genes simultaneously. Since not all genes are crucial for classifying cancer, it is necessary to select informative genes which are associated with cancer. Many gene selection methods have been investigated, but none is perfect. In this paper we investigate methods of finding optimal informative genes for classification of gene expression profiles. We propose a new gene selection method based on the forward selection method with regression analysis in order to find informative genes which predict cancer. The genes selected by this method tend to have information about the cancer that does not overlap with the other genes selected. We have measured the sensitivity, specificity, and recognition rate of the selected genes with the $k$-nearest-neighbour classifier for the colon cancer dataset and the lymphoma dataset. In most cases, the proposed method produces better results than gene selection based on other feature selection methods, yielding a high accuracy of 90.3% for the colon cancer dataset and 72% for the lymphoma dataset.
Fast Fault-Tolerant Time Synchronization for Wireless Sensor Networks
Authors: Sunggu Lee, Ungjin Jang, Junyoung Park
Venue: Proceedings of the 2008 11th IEEE Symposium on Object Oriented Real-Time Distributed Computing (2008)

A wireless sensor network (WSN) typically consists of a large number of small-sized devices that have very low computational capability, small amounts of memory and the need to conserve energy as much as possible (most commonly by entering suspended mode for extended periods of time). Previous approaches for WSN time synchronization do not satisfactorily address all of the requirements of WSN environments. Thus, this paper proposes a new fault-tolerant WSN time sychronization algorithm that is extremely fast (when compared to previous algorithms), achieves a guaranteed level of time synchronization for all nonfaulty nodes, can accommodate nodes that enter suspended mode and then wake up, utilizes very little communication and computation resources (thereby leaving those resources available for use by other applications), operates in a completely decentralized manner and tolerates up to f faulty nodes. The efficacy of the proposed algorithm is shown using analysis and experimentalresults.
The Future of Reputation: Gossip, Rumor, and Privacy on the Internet
Authors: Daniel J. Solove
Venue:  (2007)

Teeming with chatrooms, online discussion groups, and blogs, the Internet offers previously unimagined opportunities for personal expression and communication. But theres a dark side to the story. A trail of information fragments about us is forever preserved on the Internet, instantly available in a Google search. A permanent chronicle of our private livesoften of dubious reliability and sometimes totally falsewill follow us wherever we go, accessible to friends, strangers, dates, employers, neighbors, relatives, and anyone else who cares to look. This engrossing book, brimming with amazing examples of gossip, slander, and rumor on the Internet, explores the profound implications of the online collision between free speech and privacy.Daniel Solove, an authority on information privacy law, offers a fascinating account of how the Internet is transforming gossip, the way we shame others, and our ability to protect our own reputations. Focusing on blogs, Internet communities, cybermobs, and other current trends, he shows that, ironically, the unconstrained flow of information on the Internet may impede opportunities for self-development and freedom. Long-standing notions of privacy need review, the author contends: unless we establish a balancebetweenprivacy and free speech, we may discover that the freedom of the Internet makes us less free. (11/01/2007)
Fair access to scarce resources in ad-hoc grids using an economic-based approach
Authors: Behnaz Pourebrahimi, Koen Bertels
Venue: Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

In ad-hoc Grids where the availability of resources and tasks changes over the time, distributing the tasks among the scarce resources in a balanced way is a challenging task. In this paper, we present how using an economic-based approach, the tasks can be distributed evenly among the scarce resources. Such that all nodes which have tasks to be executed, receive more or less equal utilization from the Grid resources. We consider a continuous double auction protocol as the economic approach to share idle cpu cycles among the nodes in a local ad-hoc Grid. Each node is given a limited budget when joining the Grid. The node can use it to buy required resources or increases its budget by selling idle resources. Consumers and producers of resources determine their bid and ask prices using a dynamic pricing strategy and the auctioneer adopts a discriminatory pricing policy which sets the transaction price individually for each matched buyer-seller pair. We experiment in a network where the resources are scarce and the tasks outnumber the resources. The spread of task utilization at individual nodes and the level of load balancing are measured and compared with a non-economic approach. The results show that economic-based approach provides a fair and balanced basis for access to Grid resources for everyone while in the same time gives a satisfactory level of system performance.
Executable Specifications for Real-Time Distributed Systems
Authors: Arnab Ray, Rance Cleaveland
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

One of the challenges in designing distributed, embedded systems is the paucity of formal, executable specification notations that provide support for both real-time and asynchronous communication. This paper describes a timed architecture design language (Timed Architecture Interaction Diagrams or TAID) that, by virtue of its formal, executable semantics, combines the benefits of synchronous specification notations with the advantages of traditional architecture description languages. In addition, TAID provides support for a variety of temporal inter-process communication (IPC) primitives as a native feature of the language, so that the encapsulated communication behavior (captured by real-time ''buses'' in TAID) may be re-used across designs and serve as specifications for more detailed model implementations.
A Holistic Approach to SoC Verification
Authors: Alicia Strang, David Potts, Shankar Hemmady
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Semiconductor designs are continuously growing in complexity. It is no longer practical to view large swaths of waveforms at one time. Data flow and bus transactions must be presented to engineers in way that will stimulate their creative juices and empower an intuitive understanding of the big picture without unnecessarily cluttering the debug environment. Over time, as technologies enable advanced viewing, navigating and packetizing the waveforms, we migrate to a more artistic approach for understanding complex semiconductor systems. Test environments are bound to grow more complex. Intuitive, visual presentations will support a holistic approach for comprehending and systematically working with increasing complexity instead of getting buried deep into unnecessary details – a need-to-know basis description of the underlying design details.This paper scratches the surface on what such holistic verification solutions will look like by citing examples from existing commercial EDA technologies as well as in-house home-brewed solutions. Examples include design visualization environments that employ hierarchy of signals, color-coding, advanced packet bundling and exploding packet views to foster right-brained thought. Potential future improvements to EDA tools are suggested to show how transaction level models and verification sessions can be presented to give an intuitive feel of the SoC design.
Histogram Matrix: Log File Visualization for Anomaly Detection
Authors: Adrian Frei, Marc Rennhard
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

In today's IT environments, there is an ever increasing demand for log file analysis solutions. Log files often contain important information about possible incidents, but inspecting the often large amounts of textual data is too time-consuming and tedious a task to perform manually. To address this issue, we propose a novel log file visualization technique called Histogram Matrix (HMAT). HMAT visualizes the content of a log file in order to enable a security administrator to efficiently spot anomalies. The system uses a combination of graphical and statistical techniques and allows even non-experts to interactively search for anomalous log messages. Contrary to other approaches, our proposal does not only work on certain special kinds of log files, but instead works on almost every textual log file. Additionally, the system allows to automatically generate security events if an anomaly is detected, similar to anomaly-based intrusion detection systems. This paper introduces HMAT, demonstrates its functionality using log files from a variety of services in real environments, and identifies strengths and limitations of the technique.
Complex Medical Engineering, 1 edition
Authors: J.L. Wu, K. Ito, S. Tobimatsu, T. Nishida, H. Fukuyama
Venue:  (2007)

In the twenty-first century, applications in medicine and engineering must acquire greater safety and flexibility if they are to yield better products at higher efficiency. To this end, complex science and technology must be integrated in medicine and engineering. Complex medical engineering (CME) is a new field that merges medical science and technology, and includes biomedical robotics and biomechatronics, complex virtual technology in medicine, information and communication technology in medicine, complex technology in rehabilitation, cognitive neuroscience and technology, and complex bioinformatics. Experts from academia, industry, and government research laboratories who have pioneered CME ideas and technologies describe its concept and research approach and discuss related hardware and software, science and technology, and medicine and engineering. This book will be invaluable to scientists, researchers, and graduates in the emerging field of CME.
Water turbidity estimation using a hand-held spectropolarimeter to determine surface reflection polarization in visible, near and short-wave infrared bands
Authors: M. Shibayama, K. Kanda, K. Sugahara
Venue: International Journal of Remote Sensing (2007)

This letter describes a radiometric technique to evaluate the turbidity (suspended solids concentration, SSC) of terrestrial waters (e.g. irrigation canals, creeks, ponds, streams and small rivers) using a hand-held spectropolarimeter. A field experiment was conducted using a container of water with different turbidity levels. The intensity and degree of polarization of sunlight reflected from the water were measured in visible, near and short-wave infrared bands. The intensity of the reflected light and its non-polarized component were divided by the incident sunlight intensity to derive the radiant coefficient (Q, %), and the non-polarized radiant coefficient (Qnp, %), respectively. The Q and Qnp in several wavelength bands were regressed against measured values of SSC. The multiple regression model using multi-band Qnp is superior to a similar model using multi-band Q because the Qnp model does not need viewing angles as explanatory variables, whereas the model using Q requires these angles. A result from preliminary testing in real streams is also presented.
SGR: A Shared Generic Routing Support for Ad Hoc Ubiquitous Computing Environments
Authors: Yangwoo Ko, Dongman Lee
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

One of the most evident characteristics of an ad hoc ubiquitous computing environment is the dynamism of connections. Due to the mobility of nodes, paths between communicating peers change over time and hence should be discovered continually. Applications also dynamically discover available services and replace connections to provide contextually more appropriate services. In such an environment, the reduction of discovery cost and the reflection of context are main design factors. In order to avoid discovery cost being paid by both application and routing layer and to delay a service binding until forwarding time, we propose a shim layer called shared generic routing (or SGR) that discovers paths by accommodating application layer labels as well as IP addresses as routing targets and manages forwarding states. On top of SGR, IP and application layer routing can be efficiently implemented. Through simulation, we show that SGR can effectively remove duplicated discovery efforts.
Sugeno integral in a finite Boolean algebra
Authors: Agnès Rico
Venue: Fuzzy Sets and Systems (2008)

The aim of this paper is to provide a representation theorem of the Sugeno integral when the evaluation scale is a finite Boolean algebra. This result is a generalisation of a result proved when the evaluation scale is totally ordered. A major difficulty is the renunciation of the comonotonic functions which have to be replaced by the co-included functions. So we need to care about the properties satisfied by the Sugeno integral when the evaluation scale is a finite totally ordered set. To begin we show that, when the scale is totally ordered, the co-included functions are solely needed to characterise the Sugeno integral and that they are less constraining than the comonotonic functions classically used. Next we focus on finite Boolean algebra, and in this new context we define the Sugeno integral and we present the properties still satisfied. To end this article, we present a representation theorem of the Sugeno integral on a finite Boolean algebra.
Estimating spatial patterns of rainfall interception from remotely sensed vegetation indices and spectral mixture analysis
Authors: S. M. de Jong, V. G. Jetten
Venue: International Journal of Geographical Information Science (2007)

Rainfall interception by vegetation is an important factor in the water balance. Consequently, rainfall interception should also be an important factor in models simulating processes such as evaporation, transpiration, surface runoff, soil erosion, and crop growth. In practice, however, it is difficult to make quantitative assessments of the spatial and temporal distribution of rainfall interception loss at the catchment level, for instance, and to make these values available as model input. In this paper, we present a novel method using earth observation images to estimate local quantitative values of rainfall interception loss. Leaf Area Index (LAI) and fractional vegetation cover per grid cell are important process variables for rainfall interception. These two variables are estimated from images using spectral vegetation indices and using spectral mixture analysis, respectively. Relations between canopy storage capacity and LAI exist for several plant species and vegetation types, but limited data are found on crops, and more research is needed in this field. The new method is explained and illustrated for a study area in southern France with a variety of land-cover types. It is found to be a valuable and practical approach to quantitatively assess spatial patterns of interception loss for given rainfall events.
One-to-one and One-to-many node-disjoint Routing Algorithms for WK-Recursive networks
Authors: Saeedeh Bakhshi, Hamid Sarbazi-Azad
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

Recently, routing with disjoint paths has received much attention to provide more performance and fault tolerance. On the other hand, WK-recursive mesh network has been studied extensively due to its favorable properties such as high degree of stability and resilience. The connectivity of a network is an important measure of fault tolerance, while the diameter represents the worst-case transmission delay between two arbitrary nodes. In this paper, we proposeone-to-one and one-to-many disjoint routings mechanisms for WK-recursive mesh networks tofurther exhibit the performance and fault tolerance of such networks.
An Approach to Designing an Efficient Service Delivery Infrastructure
Authors: Dan R. Herold
Venue: Proceedings of the Fifth IEEE Workshop on Engineering of Autonomic and Autonomous Systems (2008)

Provisioning new and additional capacity into data intensive compute environments under unpredictable business demands and varying workload fluctuation has become exceedingly difficult using manual processes. Compute environments today must adapt to new variable provisioning requirements in order meet modern business goals, reduced infrastructure costs, elimination of repetitive administration tasks, and focusing employee talent towards critical business needs. This paper discusses an approach to designing a compute environment enabling the ability to rapidly provision and re-provision compute resources to meet real-time demands.The approach presented is distributed, scalable, and secure and may be used in consideration for design of both existing and future data center application environments. This approach has been implemented and proven in several modern day computing environments.