ppxscal/embedding_network huggingface dataset:
Program Phase Directed Dynamic Cache Way Reconfiguration for Power Efficiency
Authors: Subhasis Banerjee, Surendra G, S. K. Nandy
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Aggressive superscalar processor with deep pipeline and sophisticated speculative execution techniques is pushing the power budget to its limit. It is found that a significant portion of this power is wasted during wrong path execution and non power optimal allocation of power hungry resources. Dynamic reconfiguration of micro-architectural resources can be exploited to bring down this waste at runtime. Lack of architectural method to capture the behavior of a program at runtime makes dynamic reconfiguration a challenge. In this paper we propose a method to characterize program behavior at runtime using conflict miss pattern of a data cache, which in turn identifies different program phases in terms of cache utilization. We use this phase information to enable/disable cache ways dynamically depending on the conflict miss pattern of a program. Using a hardware tracking mechanism we ensure that the program performance (throughput in terms of IPC) does not degrade beyond a tolerable limit. Through simulation we establish that an average improvement of 32% (best case 38%) in cache power saving is achieved at the expense of less than 2% degradation in performance for SPEC-CPU and MEDIA benchmarks. The additional hardware that detects and captures the phase information is outside the critical path of the processor and does not contribute to the overall delay.
Towards graph containment search and indexing
Authors: Chen Chen, Xifeng Yan, Philip S. Yu, Jiawei Han, Dong-Qing Zhang, Xiaohui Gu
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Given a set of model graphs D and a query graph q, containment search aims to find all model graphs g &epsilon; D such that q contains g (q &supe; g). Due to the wide adoption of graph models, fast containment search of graph data finds many applications in various domains. In comparison to traditional graph search that retrieves all the graphs containing q (q &sube; g), containment search has its own indexing characteristics that have not yet been examined. In this paper, we perform a systematic study on these characteristics and propose a contrast subgraph-based indexing model, called cIndex. Contrast subgraphs capture the structure differences between model graphs and query graphs, and are thus perfect for indexing due to their high selectivity. Using a redundancy-aware feature selection process, cIndex can sort out a set of significant and distinctive contrast subgraphs and maximize its indexing capability. We show that it is NP-complete to choose the best set of indexing features, and our greedy algorithm can approximate the one-level optimal index within a ratio of 1-- 1/e. Taking this solution as a base indexing model, we further extend it to accommodate hierarchical indexing methodologies and apply data space clustering and sampling techniques to reduce the index construction time. The proposed methodology provides a general solution to containment search and indexing, not only for graphs, but also for any data with transitive relations as well. Experimental results on real test data show that cIndex achieves near-optimal pruning power on various containment search workloads, and confirms its obvious advantage over indices built for traditional graph search in this new scenario.
Key Management Standards Hit the Fast Track
Authors: Greg Goth
Venue: IEEE Distributed Systems Online (2007)

As enterprises increasingly turn to encryption to meet data-security demands, they need open standards for encryption key management. Three standards bodies--the IEEE, the Internet Engineering Task Force (IETF), and the Organization for the Advancement of Structured Information Standards (OASIS)--have recently chartered working groups on key management. A high degree of consensus within and among the standards bodies might lead to the pre-standard release of products that will be viable for the long term by the end of this year.
Concurrent games with tail objectives
Authors: Krishnendu Chatterjee
Venue: Theoretical Computer Science (2007)

We study infinite stochastic games played by two players over a finite state space, with objectives specified by sets of infinite traces. The games are concurrent (players make moves simultaneously and independently), stochastic (the next state is determined by a probability distribution that depends on the current state and chosen moves of the players) and infinite (proceed for an infinite number of rounds). The analysis of concurrent stochastic games can be classified into: quantitative analysis, analyzing the optimum value of the game and @e-optimal strategies that ensure values within @e of the optimum value; and qualitative analysis, analyzing the set of states with optimum value 1 and @e-optimal strategies for the states with optimum value 1. We consider concurrent games with tail objectives, i.e., objectives that are independent of the finite-prefix of traces, and show that the class of tail objectives is strictly richer than that of the @w-regular objectives. We develop new proof techniques to extend several properties of concurrent games with @w-regular objectives to concurrent games with tail objectives. We prove the positive limit-one property for tail objectives. The positive limit-one property states that for all concurrent games if the optimum value for a player is positive for a tail objective @F at some state, then there is a state where the optimum value is 1 for the player for the objective @F. We also show that the optimum values of zero-sum (strictly conflicting objectives) games with tail objectives can be related to equilibrium values of nonzero-sum (not strictly conflicting objectives) games with simpler reachability objectives. A consequence of our analysis presents a polynomial time reduction of the quantitative analysis of tail objectives to the qualitative analysis for the subclass of one-player stochastic games (Markov decision processes).
Total variation minimizing blind deconvolution with shock filter reference
Authors: James H. Money, Sung Ha Kang
Venue: Image and Vision Computing (2008)

We present a preconditioned method for blind image deconvolution. This method uses a pre-processed reference image (via the shock filter) as an initial condition for total variation minimizing blind deconvolution. Using the shock filter gives good information on location of the edges, while using the variational functionals such as Chan and Wong's [T.F. Chan, C.K. Wong, Total variation blind deconvolution, IEEE Transactions on Image Processing 7 (1998), 370-375] allows robust reconstruction of the image and the blur kernel. Comparison between using the L^1 and L^2 norms for the fidelity term is presented, as well as an analysis on the choice of the parameter for the kernel functional. Numerical results indicate the method is robust for both black and non-black background images while reducing the overall computational cost.
Conference Reports
Venue: IEEE Design Test (2007)

1. Latin-American Test Workshop--Victor Champac (National Institute for Astrophysics, Optics, and Electronics)--The 8th IEEE Latin-American Test Workshop was held 11-14 March 2007 in Cuzco, Peru. The technical program included regular papers, embedded tutorials, a panel session, and dedicated tutorials. The first day of the workshop was dedicated to the IEEE Test Technology Educational Program (TTEP). A meeting was also held at LATW for those involved in the ALFA Project.2. Design and Diagnostics of Electronic Circuits and Systems--Patrick Girard (LIRMM), Andrzej Krasnewski (Warsaw University of Technology), Elena Gramatova (Slovak Academy of Sciences), and Adam Pawlak (Silesian University of Technology)--DDECS 2007 was held 11-13 April in Krakow, Poland. The technical program spanned three days of single-track sessions supported by three excellent keynote speeches. The program also included sponsor presentations, as well as the first annual presentation of the Jan Hlavicka Memorial award for outstanding paper by an East European author. In addition, DDECS was once again accompanied by the Challenges in Collaborative Engineering Workshop.
A New Economics Architecture for Manufacturing Grid
Authors: Yong-Li Zhou, Ying-Wu Chen
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

This paper has a discussion and research on building a new economics model for manufacturing grid (MG) based on beneficial drive. It firstly introduces the economics roles into manufacturing gird to express the economic attributes of the resources of MG. It also analyses the relationship between different roles. And paper focuses on building a new economics architecture supporting multi economics models. It adopts the MGeQoS to indicate how to deal with the selection of economics modes, and does the WSDL expression to describe MGeQoS attributes. And paper puts forward a matching service negotiation mechanism of economics model to realize the selection of economics model and do the management and scheduling of resource via the user MGeQoS. Based on these techniques, we present the conception model of MG economics architecture, and finally we build an effective and complete MG economics architecture which can support multi economics models.
Modeling and Verification of Web Services Composition based on CPN
Authors: Hui Kang, Xiuli Yang, Sinmiao Yuan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

As the capability of an individual Web service is limited, it's necessary to create new functionalities with existing Web services. Web services composition is the ability to create a new value-added service by incorporating some existing web services together. An important challenge for Web services composition is how to ensure the correctness and reliability of the WS-BPEL (Web Services Business Process Execution Language) process and the composition. A graphical and formal modeling tool suitable for solving this problem is CPN (Colored Petri net), which provides formal semantics and a number of analysis techniques for modeling and verifying Web services composition. This paper proposes a CPN-based model for Web services composition, describes how to translate WSBPEL to CPN model, and discusses the analysis and verification of services composition. The model enables efficient composition of Web services and validates the correctness of composition by formal verification.
NetMatch
Authors: A. Ferro, R. Giugno, G. Pigola, A. Pulvirenti, D. Skripin, G. D. Bader, D. Shasha
Venue: Bioinformatics (2007)

Summary: NetMatch is a Cytoscape plugin which allows searching biological networks for subcomponents matching a given query. Queries may be approximate in the sense that certain parts of the subgraph-query may be left unspecified. To make the query creation process easy, a drawing tool is provided. Cytoscape is a bioinformatics software platform for the visualization and analysis of biological networks. Availability: The full package, a tutorial and associated examples are available at the following web sites: http://alpha.dmi.unict.it/~ctnyu/netmatch.html, http://baderlab.org/Software/NetMatch Contact: ferro@dmi.unict.it
Modeling of a Polling-Based Access Scheme for 802.11
Authors: Dany Obeid, Sami Sheeshia
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

We propose enhancements to the IEEE 802.11e protocol in order to provide fairness for non-real time applications while providing QoS for real-time traffic. The enhancements are based on a contention-free polling access scheme. The M/M/1 and M/G/1 queuing systems are used to model the 802.11e and our proposed scheme respectively. Preliminary analytical results show that the proposed scheme reduces delay for both types of traffic.
Computing Education for the Developing Asian Countries
Authors: J. A. ,  Jr. Jordan
Venue: Computer (1980)

After a survey identified regional needs, the Asian Institute of Technology established graduate programs emphasizing application development and management of computing resources.
A structural alignment kernel for protein structures
Authors: Jian Qiu, Martial Hue, Asa Ben-Hur, Jean-Philippe Vert, William Stafford Noble
Venue: Bioinformatics (2007)

Motivation: This work aims to develop computational methods to annotate protein structures in an automated fashion. We employ a support vector machine (SVM) classifier to map from a given class of structures to their corresponding structural (SCOP) or functional (Gene Ontology) annotation. In particular, we build upon recent work describing various kernels for protein structures, where a kernel is a similarity function that the classifier uses to compare pairs of structures. Results: We describe a kernel that is derived in a straightforward fashion from an existing structural alignment program, MAMMOTH. We find in our benchmark experiments that this kernel significantly out-performs a variety of other kernels, including several previously described kernels. Furthermore, in both benchmarks, classifying structures using MAMMOTH alone does not work as well as using an SVM with the MAMMOTH kernel. Availability: http://noble.gs.washington.edu/proj/3dkernel Contact: noble@gs.washington.edu
The Data Mining System Based on Multi-agent under the Circumstance of E-commerce
Authors: Qin Cen, Jianmin Zhao, Xinzhong Zhu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

The development of computer science and network technology, and the rapid emergence of e-commerce bring limitless business opportunity to trade company. For the trade company, any consumer-related information is very valuable, but searching for the enormous amount of data restricts the development of e-commerce. The combination of data mining technology with multi- Agent technology can decrease the amount of data transmission, lighten network load, improve mining performance and effectively guarantee the security of the data. This paper has introduced the performance of every Agent in detail and the basic thoughts of the mining method adopted. Furthermore, in view of the business backgrounds and characteristics of e-commerce trade, we design the data mining system based on Multi-Agent under the circumstance of e-commerce. It can achieve the goal of mining data accurately and effectively, and offer the personalized service to users, and improve operational efficiency for system.
Solution methods for a new class of simple model neurons
Authors: Mark D. Humphries, Kevin Gurney
Venue: Neural Computation (2007)

Izhikevich (2003) proposed a new canonical neuron model of spike generation. The model was surprisingly simple yet able to accurately replicate the firing patterns of different types of cortical cell. Here, we derive a solution method that allows efficient simulation of the model.
Traffic-aware stress testing of distributed real-time systems based on UML models using genetic algorithms
Authors: Vahid Garousi, Lionel C. Briand, Yvan Labiche
Venue: Journal of Systems and Software (2008)

This paper presents a model-driven, stress test methodology aimed at increasing chances of discovering faults related to network traffic in distributed real-time systems (DRTS). The technique uses the UML 2.0 model of the distributed system under test, augmented with timing information, and is based on an analysis of the control flow in sequence diagrams. It yields stress test requirements that are made of specific control flow paths along with time values indicating when to trigger them. The technique considers different types of arrival patterns (e.g., periodic) for real-time events (common to DRTSs), and generates test requirements which comply with such timing constraints. Though different variants of our stress testing technique already exist (that stress different aspects of a distributed system), they share a large amount of common concepts and we therefore focus here on one variant that is designed to stress test the system at a time instant when data traffic on a network is maximal. Our technique uses genetic algorithms to find test requirements which lead to maximum possible traffic-aware stress in a system under test. Using a real-world DRTS specification, we design and implement a prototype DRTS and describe, for that particular system, how the stress test cases are derived and executed using our methodology. The stress test results indicate that the technique is significantly more effective at detecting network traffic-related faults when compared to test cases based on an operational profile.
A Damage- and Fault-Tolerant Input/Output Network
Authors: T. B. Smith
Venue: IEEE Transactions on Computers (1975)

A damage-and fault-tolerant input/output (I/O) network is presented as an alternative to I/O buses. Such a network differs most significantly from telecommunications networks (such as the ARPA net) in that the nodes of this net are very simple and do not perform such tasks as message or packet switching and buffering. Data routing through the net is directly controlled by a centralized processor with control algorithms being implemented in software. Descriptions of both the network hardware and the most vital points of the control software are provided. It is believed that this network construction represents both an economically viable alternative to data buses and a significant improvement in reliability and survivability, particularly in those applications where physical damage to elements of the I/O system is a possibility, such as in aircraft, shipboard, rapid transit, and industrial situations.
Communication Modelling of the Spidergon NoC with Virtual Channels
Authors: M. Moadeli, A. Shahrabi, W. Vanderbauwhede, M. Ould-Khaoua
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

The spidergon scheme is a commercial NoC (Network On-Chip) proposed recently to address the demand for a fixed and optimized topology to realize cost effective multi-processor SoC (MPSoC) development [12]. The increasing diversity of the applications quality of service requirements may, however, inhibit employing a particular architecture for a wide range of applications, unless the performance it delivers is improved. A traditional approach to enhance the performance of the interconnect networks has been employing the virtual channels. In this paper, we present an analytical model to evaluate the performance of the spidergon NoC and to study the effect of employing virtual channels. Results obtained through simulation experiments show that the model exhibits a good degree of accuracy in predicting average message latency under various working conditions.
Energy-Efficient Scheduling for Parallel Applications Running on Heterogeneous Clusters
Authors: Ziliang Zong, Xiao Qin, Xiaojun Ruan, Kiranmai Bellam, Mais Nijim, Mohamed Alghamdi
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

High performance clusters have been widely used to provide amazing computing capability for both commercial and scientific applications. However, huge power consumption has prevented the further application of large-scale clusters. Designing energy-efficient scheduling algorithms for parallel applications running on clusters, especially on the high performance heterogeneous clusters, is highly desirable. In this regard, we propose a novel scheduling strategy called energy efficient task duplication schedule (EETDS for short), which can significantly conserve power by judiciously shrinking communication energy cost when allocating parallel tasks to heterogeneous computing nodes. We present the preliminary simulation results for Gaussian and FFT parallel task models to prove the efficiency of our algorithm.
Virtual Machines Applied to WSN's: The state-of-the-art and classification
Authors: Nuno Costa, Antonio Pereira, Carlos Serodio
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

In the last few years, various middleware solutions have been proposed for bridging the gap between the complexity of the applications and the low hardware abstraction in order to program and manage the sensor nodes of the wireless sensor networks. The proposed middleware range from market and data-centric approaches to message oriented middleware. This survey discusses the representative state-of-the-art virtual machine (VM) class of middleware for WSNs highlighting the state of the research.
Model-driven data acquisition in sensor networks
Authors: Amol Deshpande, Carlos Guestrin, Samuel R. Madden, Joseph M. Hellerstein, Wei Hong
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Declarative queries are proving to be an attractive paradigm for ineracting with networks of wireless sensors. The metaphor that "the sensornet is a database" is problematic, however, because sensors do not exhaustively represent the data in the real world. In order to map the raw sensor readings onto physical reality, a model of that reality is required to complement the readings. In this paper, we enrich interactive sensor querying with statistical modeling techniques. We demonstrate that such models can help provide answers that are both more meaningful, and, by introducing approximations with probabilistic confidences, significantly more efficient to compute in both time and energy. Utilizing the combination of a model and live data acquisition raises the challenging optimization problem of selecting the best sensor readings to acquire, balancing the increase in the confidence of our answer against the communication and data acquisition costs in the network. We describe an exponential time algorithm for finding the optimal solution to this optimization problem, and a polynomial-time heuristic for identifying solutions that perform well in practice. We evaluate our approach on several real-world sensor-network data sets, taking into account the real measured data and communication quality, demonstrating that our model-based approach provides a high-fidelity representation of the real phenomena and leads to significant performance gains versus traditional data acquisition techniques.
Logical Information Systems: from Taxonomies to Logics
Authors: Sebastien Ferre, Olivier Ridoux
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Dynamic taxonomies have been proposed as a solution for combining querying and navigation, offering both expressivity and interactivity. Navigation is based on the filtering of a multidimensional taxonomy w.r.t. query answers, which helps users to focus their search. We show that properties that are commonly used only in queries can be integrated in taxonomies, and hence in navigation, by the use of so-called logics. Hand-designed taxonomies and concrete domains (e.g., dates, strings) can be combined so as to form complex taxonomies. For instance, valued attributes can be handled, and different roles between documents and locations can be distinguished. Logical Information Systems (LIS) are characterized by the combination of querying and navigation, and the systematic use of logics.