ppxscal/embedding_network huggingface dataset:
An Algorithm for Hypergraph Completion According to Hyperedge Replacement Grammars
Authors: Steffen Mazanek, Sonja Maier, Mark Minas
Venue: Proceedings of the 4th international conference on Graph Transformations (2008)

The algorithm of Cocke, Younger, and Kasami is a dynamic programming technique well-known from string parsing. It has been adopted to hypergraphs successfully by Lautemann. Therewith, many practically relevant hypergraph languages generated by hyperedge replacement can be parsed in an acceptable time. In this paper we extend this algorithm by hypergraph completion: If necessary, appropriate fresh hyperedges are inserted in order to construct a derivation. The resulting algorithm is reasonably efficient and can be directly used, among other things, for auto-completion in the context of diagram editors.
The Weakest Failure Detector for Message Passing Set-Agreement
Authors: Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann
Venue: Proceedings of the 22nd international symposium on Distributed Computing (2008)

In the set-agreement problem, n processes seek to agree on at most n ¿ 1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, called the Loneliness detector and denoted $\mathcal{L}$, outputs one of two values, "true" or "false" such that: (1) there is at least one process where $\mathcal{L}$ outputs always "false", and (2) if only one process is correct, $\mathcal{L}$ eventually outputs "true" at this process.
Music Expression Understanding Based on a Joint Semantic Space
Authors: Luca Mion, Giovanni Poli
Venue: Proceedings of the 10th Congress of the Italian Association for Artificial Intelligence on AI*IA 2007: Artificial Intelligence and Human-Oriented Computing (2007)

A paradigm for music expression understanding based on a joint semantic space, described by both affective and sensorial adjectives, is presented. Machine learning techniques were employed to select and validate relevant low level features, and an interpretation of the clustered organization based on action and physical analogy is proposed.
Additive Groves of Regression Trees
Authors: Daria Sorokina, Rich Caruana, Mirek Riedewald
Venue: Proceedings of the 18th European conference on Machine Learning (2007)

We present a new regression algorithm called Groves of trees and show empirically that it is superior in performance to a number of other established regression methods. A Grove is an additive model usually containing a small number of large trees. Trees added to the Grove are trained on the residual error of other trees already in the Grove. We begin the training process with a single small tree in the Grove and gradually increase both the number of trees in the Grove and their size. This procedure ensures that the resulting model captures the additive structure of the response. A single Grove may still overfit to the training set, so we further decrease the variance of the final predictions with bagging. We show that in addition to exhibiting superior performance on a suite of regression test problems, bagged Groves of trees are very resistant to overfitting.
Word segmentation for the Myanmar language
Authors: Tun Thura Thet, Jin-Cheon Na, Wunna Ko Ko
Venue: Journal of Information Science (2008)

This study reports the development of a Myanmar word segmentation method using Unicode standard encoding. Word segmentation is an essential step prior to natural language processing in the Myanmar language, because a Myanmar text is a string of characters without explicit word boundary delimiters. The proposed method has two phases: syllable segmentation and syllable merging. A rule-based heuristic approach was adopted for syllable segmentation, and a dictionary-based statistical approach for syllable merging. Evaluation of test results showed that the method is very effective for the Myanmar language.
Brief paper: A connection between formation infeasibility and velocity alignment in kinematic multi-agent systems
Authors: Dimos V. Dimarogonas, Kostas J. Kyriakopoulos
Venue: Automatica (Journal of IFAC) (2008)

In this paper, a feedback control strategy that achieves convergence of a multi-agent system to a desired formation configuration is proposed for both the cases of agents with single integrator and nonholonomic unicycle-type kinematics. When inter-agent objectives that specify the desired formation cannot occur simultaneously in the state space the desired formation is infeasible. It is shown that under certain assumptions, formation infeasibility forces the agents' velocity vectors to a common value at steady state. This provides a connection between formation infeasibility and flocking behavior for the multi-agent system. We finally also obtain an analytic expression of the common velocity vector in the case of formation infeasibility.
A Collaborative Teaching Approach Using Integrated Electronic Environments for Information Security
Authors: Yu-An Tan, Zuo Wang, Xu-Bo Wu
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

Rapid advancement and new information sources in many academic fields offer expanded opportunities for collaborative teaching. In this paper, we propose a collaborative teaching approach using integrated electronic environments for information security. Taking the security problem of implicit type conversion of C++ program as instance, we present the learning goals objectives, course content, student assignments and discussion of the collaborative teaching approach using integrated electronic environments. The teaching performances suggest that this new proposed teaching approach is very efficacious.
Impact of Al in Cu alloy interconnects on electro and stress migration reliabilities
Authors: Kazuyoshi Maekawa, Kenichi Mori, Naohito Suzumura, Kazuhito Honda, Yukinori Hirose, Koyu Asai, Akira Uedono, Masayuki Kojima
Venue: Microelectronic Engineering (2008)

The reliability of Cu interconnects was successfully improved by applying a CuAl alloy seed. However, the effect of additive Al on the reliability is not fully understood. In order to reveal the reliability improvement mechanism, Cu films using CuAl alloy seed were investigated in detail. As stress induced voiding (SIV) as well as electromigration is caused by migration of vacancies and/or Cu atoms, the measured activation energy value of electromigration using CuAl indicates that the fast diffusion paths are Cu grain boundaries. The analysis using high lateral resolution scanning type secondary ion mass spectrometry (nano-SIMS) clarifies that additive Al in ECP-Cu film is mainly localized at grain boundaries. Furthermore, positron annihilation was used to probe vacancy-type defects in Cu films. The CuAl films before recrystallization contain larger and higher density vacancy-type defects. Whereas, the recrystallized CuAl films after annealing above 250^oC contain smaller and lower density defects. Furthermore, CuAl films with annealing above 350^oC contain less Al inside the grains. These results represent that Al atoms in Cu films with annealing above 350^oC are exhausted from inside grains to the grain boundaries, and the spewed Al atoms existing at Cu grain boundary effectively prevents the diffusion of Cu and/or vacancies.
A Hierarchy of Twofold Resource Allocation Automata Supporting Optimal Web Polling
Authors: Ole-Christoffer Granmo, B. John Oommen
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

We consider the problem of polling web pages as a strategy for monitoring the world wide web. The problem consists of repeatedly polling a selection of web pages so that changes that occur over time are detected. In particular, we consider the case where we are constrained to poll a maximum number of web pages per unit of time. Thus, the issue at stake is one of determining which web pages are to be polled, and we attempt to do it in a manner that maximizes the number of changes detected. We solve the problem by first modelling it as a Stochastic Non-linear Fractional Knapsack Problem. We then present a completely new on-line Learning Automata (LA) system, namely, the Hierarchy of Twofold Resource Allocation Automata (H-TRAA), whose primitive component is a Twofold Resource Allocation Automaton (TRAA). Both the TRAA and the H-TRAA have been proven to be asymptotically optimal. Finally, we demonstrate empirically that H-TRAA provides orders of magnitude faster convergence compared to the LAKG which represents the state-of-the-art. Further, in contrast to the LAKG, H-TRAA scales sub-linearly. Based on these results, we believe that the H-TRAA has a tremendous potential to handle demanding real-world applications, particularly those which deal with the world wide web.
A Real-Time Fortran Executive
Authors: Daniel Crowl
Venue: IEEE Micro (1985)

This executive provides its users with sophisticated real-time functions without requiring them to do a lot of complicated assembly language interfacing. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Determining the top-k nodes in social networks using the Shapley value
Authors: N. Rama Suri, Y. Narahari
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

In this paper, we consider the problem of selecting, for any given positive integer k, the top-k nodes in a social network, based on a certain measure appropriate for the social network. This problem is relevant in many settings such as analysis of co-authorship networks, diffusion of information, viral marketing, etc. However, in most situations, this problem turns out to be NP-hard. The existing approaches for solving this problem are based on approximation algorithms and assume that the objective function is sub-modular. In this paper, we propose a novel and intuitive algorithm based on the Shapley value, for efficiently computing an approximate solution to this problem. Our proposed algorithm does not use the sub-modularity of the underlying objective function and hence it is a general approach. We demonstrate the efficacy of the algorithm using a co-authorship data set from e-print arXiv (www.arxiv.org), having 8361 authors.
Weighted Logics for Nested Words and Algebraic Formal Power Series
Authors: Christian Mathissen
Venue: Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part II (2008)

Nested words, a model for recursive programs proposed by Alur and Madhusudan, have recently gained much interest. In this paper we introduce quantitative extensions and study nested word series which assign to nested words elements of a semiring. We show that regular nested word series coincide with series definable in weighted logics as introduced by Droste and Gastin. For this, we establish a connection between nested words and series-parallel-biposets. Applying our result, we obtain a characterization of algebraic formal power series in terms of weighted logics. This generalizes a result of Lautemann, Schwentick and Thérien on context-free languages.
The impact of time controlled reading on software inspection effectiveness and efficiency: a controlled experiment
Authors: Kai Petersen, Kari Rönkkö, Claes Wohlin
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

Reading techniques help to guide reviewers during individual software inspections. In this experiment, we completely transfer the principle of statistical usage testing to inspection reading techniques for the first time. Statistical usage testing relies on a usage profile to determine how intensively certain parts of the system shall be tested from the users' perspective. Usage-based reading applies statistical usage testing principles by utilizing prioritized use cases as a driver for inspecting software artifacts (e.g., design). In order to reflect how intensively certain use cases should be inspected, time budgets are introduced to usage-based reading where a maximum inspection time is assigned to each use case. High priority use cases receive more time than low priority use cases. A controlled experiment is conducted with 23 Software Engineering M.Sc. students inspecting a design document. In this experiment, usage-based reading without time budgets is compared with time controlled usage-based reading. The result of the experiment is that time budgets do not significantly improve inspection performance. In conclusion, it is sufficient to only use prioritized use cases to successfully transfer statistical usage testing to inspections.
Development of Advanced Cyber Education System Based on Grid
Authors: Jongbae Moon, Chongam Kim, Yoonhee Kim, Kum Won Cho
Venue: Proceedings of the 2008 International Conference on Convergence and Hybrid Information Technology (2008)

Modern aerodynamics has been revolutionized by Computational Fluid Dynamics (CFD) while most courses are taught with a traditional lecture approach complimented with some combination of homework, labs, and exams. In this paper, we introduce an advanced cyber education system for aerospace engineering, which is named e-AIRS. e-AIRS, an abbreviation of 'e-Science Aerospace Integrated Research System', is a Grid based portal system to support the aerodynamics engineering processes on the e-Science environment. The web portal interface is implemented as a portlet component model on top of the Gridsphere Framework, and these portlets can be reusable. The system provides CFD simulations, remote experimental service, and collaborative and integrative study between computation and experiment through the web. The system helps students to understand the full simulation process of aerodynamics engineering. We conducted a survey of about 150 students at the Seoul National University and Konkuk University in Korea. According to the survey, 94 percent said the system helped to understand the whole process of CFD, and more than 90 percent of the students said e-AIRS portal provided a good functionality, convenience, and user interface.
Processing group parameters in the real-time specification for Java
Authors: A. J. Wellings, M. S. Kim
Venue: Proceedings of the 6th international workshop on Java technologies for real-time and embedded systems (2008)

The Real-Time Specification for Java (RTSJ) supports Processing Groups. However this typically requires the underlying operating system to provide group budgets, which is not widespread practice. As the RTSJ attempts to define its semantics for multiprocessor systems, the issue of the meaning and implementability of the ProcessingGroupParameters class needs to be re-examined. This paper reviews the possible options. It proposes that Processing Groups be directly represented with various subclasses providing different implementation mechanisms. The relationship between Processing Groups and the implementation of non-bound asynchronous event handlers is also explored.
Prostate Cancer Probability Maps Based on Ultrasound RF Time Series and SVM Classifiers
Authors: Mehdi Moradi, Parvin Mousavi, Robert Siemens, Eric Sauerbrei, Alexander Boag, Purang Abolmaesumi
Venue: Proceedings of the 11th international conference on Medical Image Computing and Computer-Assisted Intervention - Part I (2008)

We describe a very efficient method based on ultrasound RF time series analysis and support vector machine classification for generating probabilistic prostate cancer colormaps to augment the biopsy process. To form the RF time series, we continuously record ultrasound RF echoes backscattered from tissue while the imaging probe and the tissue are stationary in position. In an in-vitro study involving 30 prostate specimens, we show that the features extracted from RF time series are significantly more accurate and sensitive compared to two other established categories of ultrasound-based tissue typing methods. The method results in an area under ROC curve of 0.95 in 10-fold cross-validation.
Email-Based Identification and Authentication: An Alternative to PKI?
Authors: Simson L. Garfinkel
Venue: IEEE Security and Privacy (2003)

Email-Based Identification and Authentication (EBIA) is an emerging alternative to Public Key Infrastructure (PKI). Although EBIA has obvious weaknesses, it can still provide functional security when used within a limited context. This article presents background on personal identifiers and authentication techniques, shows why the misuse of the Social Security Number (SSN) as an authenticator has led in part to the emergence of identity theft, argues why EBIA overcomes many of the problems inherent in the use of SSNs without imposing the cost or usability burden associated with PKI, and presents best practices for using EBIA in a business or government context.
Harnessing checker hierarchy for reliable microprocessors
Authors: Manoj Franklin
Venue:  (2007)

Mircoprocessors are becoming increasingly susceptible to soft errors due to the current trends of semiconductor technology scaling. Traditional fault-tolerant multi-threading architectures provide good fault tolerance by re-executing all the computations. However, such a full re-execution significantly increases the demand on the processor resources, resulting in severe performance degradation. To address this problem, this dissertation presents Active Verification Management (AVM) approaches that utilize a checker hierarchy to increase its performance with a minimal effect on the overall reliability. Based on a simplified queueing model, AVM employs a filter checker which prioritizes the verification candidates so as to selectively do verification. This dissertation proposes three filter checkers&mdash;based on (1) result usage, (2) result bitwidth, and (3) result anomaly&mdash;that exploit correctness-criticality metrics and anomaly speculation. Binary Correctness Criticality (BCC) and Likelihood of Correctness Criticality (LoCC) are metrics that quantify whether an instruction is important for reliability or how likely an instruction is correctness-critical, respectively. Based on the BCC, a result-usage-based filter checker mitigates the verification workload by bypassing instructions that are unnecessary for correct execution. Computing the LoCC is accomplished by exploiting information redundancy of compressing computationally useful data bits. Numerical significance hints let the result-bitwidth-based filter checker guide a verification priority effectively before the re-execution process starts. Extensive measurements prove that the LoCC yields quite a wide distribution of values, indicating that it has the potential to differentiate diverse degrees of correctness-criticality. A result-anomaly-based filter checker exploits a value similarity property, which is defined by a frequent occurrence of partially identical values. Based on the biased distribution of similarity distance measure, this dissertation further investigates another application to exploit similar values for soft error tolerance with anomaly speculation. Extensive measurements show that the majority of instructions produce values that are different from the previous result value only in a few bits.Experimental results show that the proposed schemes accelerate the processor to be 180% faster than traditional fully-fault-tolerant processor, with a minimal impact on the overall soft error rate. With no AVM, congestion at the checker badly affects performance, to the tune of 57%, when compared to that of a non-fault-tolerant processor. These results explain that the proposed AVM has the potential to solve the verification congestion problem when perfect fault coverage is not needed.
Visualized Technique for Trend Analysis of News Articles
Authors: Masahiro Terachi, Ryosuke Saga, Zhongqi Sheng, Hiroshi Tsuji
Venue: Proceedings of the 21st international conference on Industrial, Engineering and Other Applications of Applied Intelligent Systems: New Frontiers in Applied Artificial Intelligence (2008)

In order to visualize keyword trends in texts of news articles, this paper proposes a method named FACT-Graph by extending co-occurrence graph. The method uses four classes of keywords, considers three patterns of class transitions, and expresses three types of co-occurrence relationships between two analysis periods. Classes of keywords are characterized by the shapes of their nodes, the transition patterns of keyword classes are shown by the colors of the nodes, and the co-occurrences relationships between two keywords are represented by the types of edges their nodes have. FACT-Graph is applied to a sample of 220,000 newspaper articles and is found to be effective in visualizing keyword trends embedded in volumes of text data.
Pipe Network 3D Visualization Service Architecture
Authors: Liutong Xu, Guanhui Geng, Min Shi, Suping Lin
Venue: Proceedings of the 2008 IEEE Congress on Services - Part I (2008)

The visualization of pipe network has become one of the essential characteristics of urban pipe network management system. But for the distribution of related resources (e.g., data storage, modeling platform, etc.) and complex structure, the design and implementation of a pipe network visualization application is always a challenge. This contribution presents a service view in design and deployment phase to cope with the questions mentioned above, which takes separate resources as individual services and then make an integration to present Pipe network 3D visualization service architecture with those services. With this architecture, service providers will be able to assemble a pipe network 3D visualization service that serves the needs of a company (or authority) responsible for some particular underground pipe network systems. This paper presents the pipe network visualization service architecture and a developed pipe network visualization service prototype.
Identity Theft: Much Too Easy? A Study of Online Systems in Norway
Authors: André N. Klingsheim, Kjell J. Hole
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Governments and commercial companies connect more and more computer systems to the Internet, giving people easier access to services. Many of these online services handle personal information. Leakage of such information can facilitate large-scale identity theft. This paper determines how personal information leaks from online systems of national importance, discusses proof of concept software to demonstrate the seriousness of the problem, and suggests how to improve the situation.
Note: On hamiltonian colorings for some graphs
Authors: Yufa Shen, Wenjie He, Xue Li, Donghong He, Xiaojing Yang
Venue: Discrete Applied Mathematics (2008)

For a connected graph G and any two vertices u and v in G, let D(u,v) denote the length of a longest u-v path in G. A hamiltonian coloring of a connected graph G of order n is an assignment c of colors (positive integers) to the vertices of G such that |c(u)-c(v)|+D(u,v)>=n-1 for every two distinct vertices u and v in G. The valuehc(c) of a hamiltonian coloring c is the maximum color assigned to a vertex of G. The hamiltonian chromatic numberhc(G) of G is min{hc(c)} taken over all hamiltonian colorings c of G. In this paper we discuss the hamiltonian chromatic number of graphs G with max{D(u,v)|u,v@?V(G),u