ppxscal/embedding_network huggingface dataset:
Graph Drawing Contest Report
Authors: Ugur Dogrusoz, Christian A. Duncan, Carsten Gutwenger, Georg Sander
Venue: Graph Drawing: 16th International Symposium, GD 2008, Heraklion, Crete, Greece, September 21-24, 2008. Revised Papers (2009)

This report describes the $15^{\mbox{\scriptsize th}}$ Annual Graph Drawing Contest, held in conjunction with the 2008 Graph Drawing Symposium in Heraklion, Crete, Greece. The purpose of the contest is to monitor and challenge the current state of graph-drawing technology.
Exploring evolutionary biologists' use and perceptions of semantic metadata for data curation
Authors: Hollie C. White
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

The wide acceptance of social networking tools in online environments is prompting scientists to engage in metadata creation in not only for organizing their own digital records, but also for contributing to data and journal repositories. Understanding the behaviors and practices of these communities can help us create more effective metadata structures within our information systems.
A comprehensive study on backup-bandwidth reprovisioning after network-state updates in survivable telecom mesh networks
Authors: Lei Song, Jing Zhang, Biswanath Mukherjee
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The capacity of a telecom fiber is very high and continues to increase, due to the advances in wavelength-division multiplexing (WDM) technology. Thus, a fiber-link failure may cause huge data (and revenue) loss. Reprovisioning (or re-optimization) of backup (or protection) bandwidth is an effective approach to improve network survivability while preventing existing services from unnecessary interruption. Most research works to date focus on applying backup-resource reprovisioning when a network failure occurs, or at some particular intervals over a certain time period. A network's state changes when any one of the following four events occurs: 1) a new connection arrives; 2) an existing connection departs; 3) a network failure occurs (e.g., a fiber cut); or 4) a failed network component (e.g., a fiber cut) is repaired. Moreover, backup-bandwidth rearrangement can also be triggered when resource overbuild (RO) [1] exceeds a predefined threshold or blocking occurs. In this study, we investigate the benefits of performing backup reprovisioning for part of (or all) the existing connections after network-state updates to improve network robustness as well as backup-bandwidth utilization in survivable telecom mesh networks. We study the effect of different backup reprovisioning periods (assuming no failure occurrence), which represents a tradeoff between capacity optimization and computation/reconfiguration overhead. We also examine the performance of an RO-threshold-triggered backup-reprovisioning approach. A wavelength-convertible network model and shared-path-protected routing strategy are assumed in this study. We consider a link-vector model in which a vector is associated with each link in the network, indicating the amount of backup bandwidth to be reserved on the link to protect against possible failures on other links. Our simulation results demonstrate that our approaches achieve better backup-capacity utilization and network robustness, compared to a conventional scheme which reprovisions backup paths for connections only when a network failure occurs.
About normal forms for hyperedge replacement grammars
Authors: Silviu Dumitrescu
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper we are studying normal forms concerning to hyperedge replacement grammars. In context freeness of these grammars we can transform each of it into an equivalent grammar without λ productions and without rewritings. After that, in a nondeterministic way, we'll create equivalent grammars in Chomsky Normal Form or Greibach Normal Form. Both normal forms are inspired by string grammars.
Technical Section: Scaffolded learning with mixed reality
Authors: John Quarles, Samsun Lampotang, Ira Fischler, Paul Fishwick, Benjamin Lok
Venue: Computers and Graphics (2009)

Scaffolding is a widely used educational practice in which directed instruction gradually decreases as student competence increases-resulting in increased independent learning. This research introduces and evaluates an MR-based system for technology-mediated scaffolding in anesthesia education. Through merging real and virtual objects, the system addresses a vital problem in merging abstract and concrete knowledge. To evaluate the system, a user study was conducted (n=130). Results suggest that MR's merging of real and virtual spaces can offer (1) a unique level of educational scaffolding, and (2) an improved learning-transfer from abstract to concrete domains. To classify the presented system, the virtuality continuum is extended to include scaffolding. The presented scaffolding-space continuum classifies technology-mediated scaffolding tools along three orthogonal continuums: (1) virtuality, (2) information (e.g. abstract, concrete), and (3) interaction. Using these 3 orthogonal continuums, effective engineering approaches for technology-mediated educational scaffolding are described.
Lack of equal access to ICTs by women: an e-governance issue
Authors: Johanna Ekua Awotwi, George Owusu
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This paper will explore the inadequacy of women's participatory role in governance due to lack of access to ICTs in Ghana using Ghana in West Africa as a Case Study. It will point out the recognition of women's limitations through international declarations; the usual obstacles that face women in the ICT industry; examine the Ghana government's gender policies, and also offer suggestions as to how to empower women, already marginalized in society, to gain from the new age of technology.
Optimal recursive clustering of likelihood functions for multiple object tracking
Authors: Séverine Dubuisson, Jonathan Fabrizio
Venue: Pattern Recognition Letters (2009)

In this paper, we propose a method to track multiple deformable objects in sequences (with a static camera) in and beyond the visible spectrum by combining Gabor filtering and clustering. The idea is to sample moving areas between two frames by randomly positioning samples over high magnitude area of a motion likelihood function. These points are then clustered to obtain one class for each moving object. The novelty in our method is in using cluster information from the previous frame to classify new samples in the current frame: we call that a recursive clustering. This makes our method robust to occlusions, objects entering and leaving the field of view, objects stopping and starting, and moving objects getting really close to each other.
Geo-information Services to Rural Extension Community for Rural Development Planning - A Framework
Authors: D. Sudharsan, J. Adinarayana, A. K. Tripathy
Venue: Proceedings of the 2009 International Conference on Advanced Geographic Information Systems & Web Services (2009)

This study focuses on developing a new approach to provide geo-information service to the rural extension community, using open source Geospatial Information Communication Technology (GeoICT) tools such as PrimaGIS, GRASS, Deegree -Web Map Service (WMS) and GeoVISTA Studio and Plone as a Content Management System (CMS). Our goal is to give a cost effective and robust geo-information service to the rural extension community. The proposed Rural Information System (RIS) integrates (1) Land Information System (LIS) (2) Agriculture Information System (AIS) (3) Watershed Information System (WIS) and Wireless Sensor Network (WSN) for providing dynamic weather, agriculture information as a part of Indo-Japan GeoICT and Sensor Network project. This approach will enhance the informatics culture in Indian districts. In addition, integrating Multi Criteria Spatial Decision Support System (MC-SDSS) into the model enhances judicial decision making spatial querying entity. Plans are also afoot to provide, a prototype RIS is under development.
Keynote lecture II: Tyflos: a wearable system-prototype for assisting visually impaired
Authors: Nikolaos G. Bourbakis
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Human eyes receive more than 75% of the total information accessible to the human senses. "There are approximately 45 million blind individuals world-wide according to the World Health Report. Vision loss can be very traumatic, leading to frustration and depression. According to the American Foundation for the Blind (AFB), the rate of unemployment among legally blind individuals of working age residing in the United States (58%) is much greater than that of individuals with no functional limitations (18%). Employment opportunities and independence are scarce for visually impaired individuals. This is unfortunate in view of the fact that ingenious devices [IEEE Spectrum] and information technology (IT) strategies can be developed to help people overcome these barriers and to pursue educational opportunities that will allow them to become productive members of society." In this talk technological efforts are presented that have the same goal assisting and increasing the visual impaired people's independence in their working and living environment, and reducing their social neglect ness. In particular, the research effort (called Tyflos) is presented here that is an IT- based wearable system-prototype. It consists of a pair of dark glasses on which two tiny vision cameras, an ear speaker and a microphone are attached. The cameras are connected with a portable computer that carries intelligent software programs. The cameras, under the user's command, capture images from the surrounding and convert them via software programs into audio or vibrations. The current versions of Tyflos is used as 1) a reader by reading books or the blind user via audio conversion and 2) a navigation by converting 3D images into vibrations for navigation.
Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings
Authors: Pilu Crescenzi, Miriam Ianni, Federico Greco, Gianluca Rossi, Paola Vocca
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

In this paper, we study the problem of ecologically coloring a graph. Intuitively, an ecological coloring of a graph is a role assignment to the nodes of the graph, such that two nodes surrounded by the same set of roles must be assigned the same role (Borgatti and Everett, 1992). We prove that, for any simple undirected graph G with nG distinct neighborhoods and for any integer k with 1 ≤ k ≤ nG, G admits an ecological coloring which uses exactly k roles, and that this coloring can be computed in polynomial time. Our result strongly contrasts with the NP-completeness result of the regular coloring problem, where it is required that two nodes with the same role must be surrounded by the same set of roles (Fiala and Paulusma, 2005). Hence, we conclude that not only the ecological coloring is easier to understand as a model of social relationships (Borgatti and Everett, 1994), but it is also feasible from a computational complexity point of view.
FastRoute 4.0: global router with efficient via minimization
Authors: Yue Xu, Yanheng Zhang, Chris Chu
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

The number of vias generated during the global routing stage is a critical factor for the yield of final circuits. However, most global routers only approach the problem by charging a cost for vias in the maze routing cost function. In this paper, we present a global router that addresses the via number optimization problem throughout the entire global routing flow. We introduce the via aware Steiner tree generation, 3-bend routing and layer assignment with careful ordering to reduce via count. We integrate these three techniques into FastRoute 3.0 and achieve significant reduction in both via count and runtime.
Lest we remember: cold-boot attacks on encryption keys
Authors: J. Alex Halderman, Seth D. Schoen, Nadia Heninger, William Clarkson, William Paul, Joseph A. Calandrino, Ariel J. Feldman, Jacob Appelbaum Edward W. Felten
Venue: Communications of the ACM (2009)

Contrary to widespread assumption, dynamic RAM (DRAM), the main memory in most modern computers, retains its contents for several seconds after power is lost, even at room temperature and even if removed from a motherboard. Although DRAM becomes less reliable when it is not refreshed, it is not immediately erased, and its contents persist sufficiently for malicious (or forensic) acquisition of usable full-system memory images. We show that this phenomenon limits the ability of an operating system to protect cryptographic key material from an attacker with physical access to a machine. It poses a particular threat to laptop users who rely on disk encryption: we demonstrate that it could be used to compromise several popular disk encryption products without the need for any special devices or materials. We experimentally characterize the extent and predictability of memory retention and report that remanence times can be increased dramatically with simple cooling techniques. We offer new algorithms for finding cryptographic keys in memory images and for correcting errors caused by bit decay. Though we discuss several strategies for mitigating these risks, we know of no simple remedy that would eliminate them.
Global convergence of quasi-Newton methods based on adjoint Broyden updates
Authors: Sebastian Schlenkrich, Andrea Walther
Venue: Applied Numerical Mathematics (2009)

In this paper we introduce a quasi-Newton method for the solution of systems of non-linear equations based on the nested application of adjoint Broyden updates. In combination with a suitable line search this method yields convergence of the iteration under the same requirements on F as Newton's method. The successive use of adjoint Broyden updates yields even local r-linear convergence of the iteration and provides the requirements for the local convergence analysis that gives q-superlinear convergence of the iteration.
Office 2008 for Mac Step by Step
Authors: Joan Preppernau
Venue:  (2008)

The smart way to learn the latest version of Microsoft Office for Mac one step at a time! Work at your own pace through the easy numbered steps and master the fundamental skills for working with the core programs Word 2008, Excel 2008, PowerPoint 2008, and Entourage 2008 and the new user interface. With this learn-by-doing tutorial, you'll teach yourself how to create professional-quality documents, powerful spreadsheets, and compelling slide presentations. You'll also discover how to get your Web site up and running, how to take notes electronically, and how to manage your e-mail communications and workday. With STEP BY STEP, you can take just the lessons you need or work from cover to cover. Either way, you drive the instruction building and practicing the skills you need, just when you need them!Key Book Benefits Covers the fundamentals of working with Word 2008, Excel 2008, PowerPoint 2008, and Entourage 2008 for the Macintosh. Introduces the new Microsoft Office user interface Features easy-to-follow lessons and hands-on skill-building exercises.
Consistent phrase relevance measures
Authors: Wen-tau Yih, Christopher Meek
Venue: Proceedings of the 2nd International Workshop on Data Mining and Audience Intelligence for Advertising (2008)

Measuring the relevance between a document and a phrase is fundamental to many information retrieval and matching tasks including on-line advertising. In this paper, we explore two approaches for measuring the relevance between a document and a phrase aiming to provide consistent relevance scores for both in and out-of document phrases. The first approach is a similarity-based method which represents both the document and phrase as term vectors to derive a real-valued relevance score. The second approach takes as input the relevance estimates of some in-document phrases and uses Gaussian Process Regression to predict the score of a target out-of-document phrase. While both of these two approaches work well, the best result is given by a Gaussian Process Regression model, which is significantly better than the similarity-based approach and 10% better than a baseline similarity method using bag-of-word vectors.
Sharing of input-output devices using bluetooth
Authors: Carlos Jonathan Ferreira-Rodríguez, Mario Reyes-Ayala, Edgar Alejandro Andrade González, José Alfredo Tirado Méndez
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In this paper, the bluetooth technique is employed to share several standard input-output devices The elimination of wires to use the serial and parallel ports, increases the flexibility in the office. The module presented could be not visible to the users. It is also possible to built local networks for home or other places with similar size.
A Novel Genetic Algorithm with Orthogonal Prediction for Global Numerical Optimization
Authors: Jun Zhang, Jing-Hui Zhong, Xiao-Min Hu
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

This paper proposes a novel orthogonal predictive local search (OPLS) to enhance the performance of the conventional genetic algorithms. OPLS operation predicts the most promising direction for the individuals to explore their neighborhood. It uses the orthogonal design method to sample orthogonal combinations to make the prediction. The resulting algorithm is termed the orthogonal predictive genetic algorithm (OPGA). OPGA has been tested on eleven numerical optimization functions in comparison with some typical algorithms. The results demonstrate the effectiveness of the proposed algorithm for achieving better solutions with a faster convergence speed.
Multiscale Bayesian texture segmentation using neural networks and Markov random fields
Authors: Tae Hyung Kim, Il Kyu Eom, Yoo Shin Kim
Venue: Neural Computing and Applications (2009)

This paper presents a wavelet-based texture segmentation method using multilayer perceptron (MLP) networks and Markov random fields (MRF) in a multi-scale Bayesian framework. Inputs and outputs of MLP networks are constructed to estimate a posterior probability. The multi-scale features produced by multi-level wavelet decompositions of textured images are classified at each scale by maximum a posterior (MAP) classification and the posterior probabilities from MLP networks. An MRF model is used in order to model the prior distribution of each texture class, and a factor, which fuses the classification information through scales and acts as a guide for the labeling decision, is incorporated into the MAP classification of each scale. By fusing the multi-scale MAP classifications sequentially from coarse to fine scales, our proposed method gets the final and improved segmentation result at the finest scale. In this fusion process, the MRF model serves as the smoothness constraint and the Gibbs sampler acts as the MAP classifier. Our texture segmentation method was applied to segmentation of gray-level textured images. The proposed segmentation method shows better performance than texture segmentation using the hidden Markov trees (HMT) model and the HMTseg algorithm, which is a multi-scale Bayesian image segmentation algorithm.
Firmware testing and test data selection
Authors: Helmut K. Berg
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Loosely stated, program verification is the task of systematically demonstrating that a program achieves its intended purpose, i.e., the task of proving the absence of errors from a program. This task may be considered as a backward mapping from a given program to a statement of the requirements for that program. There exist two fundamental approaches to establishing such mappings. A program may be exercised for a specific set of input values; the successful completion of program execution constitutes a necessary condition for the correctness of that program. A more rigorous approach is to provide an argument that a program satisfies its requirements for all legitimate input values, thus constituting a necessary and sufficient condition for the correctness of that program. In this paper, we are concerned with the first of these two fundamental approaches.
Efficient Multidimensional Packet Classification with Fast Updates
Authors: Yeim-Kuan Chang
Venue: IEEE Transactions on Computers (2009)

Packet classification has continued to be an importantresearch topic for high-speed routers in recent years. In this paper, we propose a new packet classification scheme based on the binary range and prefix searches. The basic data structure of the proposed packet classification scheme for multidimensional rule tables is a hierarchical list of sorted ranges and prefixes that allows the binary search to be performed on the list at each level to find the best matched rule. We also propose a set of heuristics to further improve the performance of the proposed algorithm. We test our schemes by using rule tables of various sizes generated by ClassBench and compare them with the existing schemes, EGT, EGT-PC, and HyperCuts. The performance results show that in a test using a 2D segmentation table, the proposed scheme not only performs better than the EGT, EGT-PC, and HyperCuts in classification speed and memory usage but also achieves faster table update operations that are not supported in the existing schemes.
Predicting RNA secondary structure based on the class information and Hopfield network
Authors: Quan Zou, Tuo Zhao, Yang Liu, Maozu Guo
Venue: Computers in Biology and Medicine (2009)

One of the models for RNA secondary structure prediction is to view it as maximum independent set problem, which can be approximately solved by Hopfield network. However, when predicting native molecules, the model is not always accurate and the heuristic method of Hopfield network is not always stable. It is because that the class information is lost and the accuracy is not determined by the number of base pairs only. Secondary structures of non-coding RNAs are believed conservative on the same class. However, software and web servers nowadays for RNA secondary structure prediction do not consider the class information. In this paper, we involve class information in the initialization of Hopfield network. When the initialization is improved, the promising experimental result shows the efficacy and superiority of our proposed methods.
A state- and time-dependent error occurrence-rate software reliability model with imperfect debugging
Authors: J. G. Shanthikumar
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

In this paper, assuming a state- and time-dependent software failure rate and imperfect debuggings, we develop a simple binomial model for software error occurrences. Maximum likelihood estimates for the required parameters of this model are also derived. It is established that the Jelinski-Moranda, imperfect debugging and non-homogeneous Poisson process models are all special cases of ours.