ppxscal/embedding_network huggingface dataset:
Note: A note on models for graph representations
Authors: Amos Korman, Shay Kutten
Venue: Theoretical Computer Science (2009)

This paper is intended more to ask questions than give answers. Specifically, we consider models for labeling schemes, and discuss issues regarding the number of labels consulted vs. the sizes of the labels. Recently, quite a few papers studied methods for representing network properties by assigning informative labels to the vertices of a network. Consider a graph function f on pairs of vertices (for example, f can be the distance function). In an f-labeling scheme, the labels are constructed in such a way so that given the labels of any two vertices u and v, one can compute the function f(u,v) (e.g. the graph distance between u and v) just by looking at these two labels. Some very involved lower bounds for the sizes of the labels were proven. Also, some highly sophisticated labeling schemes were developed to ensure short labels. In this paper, we demonstrate that such lower bounds are very sensitive to the number of vertices consulted. That is, we show several constructions of such labeling schemes that beat the lower bounds by large margins. Moreover, as opposed to the strong technical skills that were needed to develop the traditional labeling schemes, most of our schemes are almost trivial. The catch is that in our model, one needs to consult the labels of three vertices instead of two. That is, a query about vertices u and v can access also the label of some third vertex w (w is determined by the labels of u and v). More generally, we address the model in which a query about vertices u and v can access also the labels of c other vertices. We term our generalized model labeling schemes with queries. The main importance of this model is theoretical. Specifically, this paper may serve as a first step towards investigating different tradeoffs between the amount of labels consulted and the amount of information stored at each vertex. As we show, if all vertices can be consulted then the problem almost reduces to the corresponding sequential problem. On the other hand, consulting just the labels of u and v (or even just the label of u) reduces the problem to a purely distributed one. Therefore, in a sense, our model spans a range of intermediate notions between the sequential and the distributed settings. In addition to the theoretical interest, we also show cases that schemes constructed for our model can be translated to the traditional model or to the sequential model, thus, simplifying the construction for those models as well. For implementing query labeling schemes in a distributed environment directly, we point at a potential usage for some new paradigms that became common recently, such as P2P and overlay networks.
A game theoretic algorithm to compute local stabilizing solutions to HJBI equations in nonlinear H∞ control
Authors: Yantao Feng, Brian D. O. Anderson, Michael Rotkowitz
Venue: Automatica (Journal of IFAC) (2009)

In this paper, an iterative algorithm to solve Hamilton-Jacobi-Bellman-Isaacs (HJBI) equations for a broad class of nonlinear control systems is proposed. By constructing two series of nonnegative functions, we replace the problem of solving an HJBI equation by the problem of solving a sequence of Hamilton-Jacobi-Bellman (HJB) equations whose solutions can be approximated recursively by existing methods. The local convergence of the algorithm and local quadratic rate of convergence of the algorithm are guaranteed and a proof is given. Numerical examples are also provided to demonstrate the effectiveness of the proposed algorithm. A game theoretical interpretation of the algorithm is given.
Heterogeneous Information Processing and Integration in Enterprise Management Information Systems
Authors: Peng Gong, Chi Yang, Dongping Shi, Zengguang Zhang, Yunlei Chen
Venue: Computer Supported Cooperative Work in Design IV: 11th International Conference, CSCWD 2007, Melbourne, Australia, April 26-28, 2007. Revised Selected Papers (2008)

To realize the heterogeneous XML information processing and integration in Enterprise Management Information Systems, this paper introduces a new application based on popular XML-Global-as-View (XGAV) integrating method. As the combination of GAV and XML data processing, XGAV makes use of some standards of XML, such as XML schema and XSLT, to describe Global-as-view formally. The motivation of this work is to enhance the efficiency and accuracy of XML data integrating with the unified document description of XML Schema. Our defined mapping among XML Schemas of multi documents using XSLT is given. Combined with above contributions, the architecture of Shanhua Information System is designed for both research and industry purposes. The algorithm for realizing important mapping mechanism is also given for heterogeneous XML data integration in Shanhua Information System. Finally, the performance yielded from Shanhua Information System is shown and analyzed.
Water Quality Prediction Using LS-SVM and Particle Swarm Optimization
Authors: Yunrong Xiang, Liangzhong Jiang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

This paper deals with the study of a water quality prediction model through application of LS-SVM in Liuxi River in Guangzhou. To overcome the shortcomings of traditional BP algorithm as being slow to converge and easy to reach extreme minimum value, least squares support vector machine (LS-SVM) combined with particle swarm optimization (PSO) is used to time series prediction. The LS-SVM can overcome some shortcoming in the Multilayer Perceptron (MLP) and the PSO is used to tune the LS-SVM parameters automatically. It enhances the efficiency and the capability of prediction. Through simulation testing the model shows high efficiency in forecasting the water quality of the Liuxi River.
Electrically driven optical proximity correction based on linear programming
Authors: Shayak Banerjee, Praveen Elakkumanan, Lars W. Liebmann, Michael Orshansky
Venue: Proceedings of the 2008 IEEE/ACM International Conference on Computer-Aided Design (2008)

Conventional optical proximity correction (OPC) tools aim to minimize edge placement errors (EPE) due to the optical and resist process by moving mask edges. However, in low-k1 lithography, especially at 45nm and beyond, printing perfect polygons is practically impossible to achieve. In addition, prohibitively high mask complexity is incurred, leading to high mask cost. Given the impossibility of perfect printing, we argue that aiming to reduce the error of electrical discrepancy between the ideal and the printed contours is a more reasonable strategy. In fact, we show that contours with non-minimal EPE may result in closer match to the desired electrical performance. Towards achieving this objective, we developed a new electrically driven OPC (ED-OPC) algorithm. The tool combines lithography simulation with accurate electrical modeling of resist contours to predict the on/off current through a transistor gate. The computation of mask edge movements is cast as a linear program based on optical and electrical sensitivities. The objective is to minimize the error in saturation current between printed and target shapes. This optimization is then solved with fast runtime. The results on industrial 45nm SOI layouts using high-NA immersion lithography models show up to a 5% improvement in accuracy of timing over conventional OPC. This is achieved at less than 26% runtime overheads, while also lowering mask complexity by up to 43%. The results confirm that better timing accuracy can be achieved despite larger edge placement error.
Business and industry in the 70's find computer-aided instruction a practical answer to training problems
Authors: Eugene G. Kerr
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

When one reads the technical literature of an industry or business or attends their national meetings, he is faced with subjects such as "Real Time Systems," "Data Base Systems," "Management Information Systems" and "Teleprocessing Networks." Clearly the focus of many industries and business concerns is the application of "on-line" computing technology to their varied operational problems. A recent survey of business and industrial computer users indicates that the majority of medium and large scale computer users have on-line or teleprocessing systems scheduled in their short range plans. 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
Iterative SNR estimation using a priori information
Authors: Nie Yuanfei, Ge Jianhua, Wang Yong
Venue: Digital Signal Processing (2009)

A class iterative signal-to-noise ratio (SNR) estimation algorithm is proposed in this paper. The data samples are governed by a given distribution with a priori. The expectation maximization (EM) algorithm is applied to iteratively maximize the likelihood function so as to realize the SNR estimation. Cramer-Rao bounds (CRB) with different a priori are compared for binary phase shift keying and orthogonal phase shift keying systems, which show the potential of the SNR estimator in turbo-like systems. In high-order modulations, simulation results show that the reduced-complexity iterative method with equal a priori has better performance in middle or high SNR region than the foregone ones. Moreover, the new method with feedback information is the best when its iteration number is 4 and extrinsic information larger than 0.4. These methods are applied in the bit-interleaved coded modulation with iterative decode (BICM-ID) system to validate the effect of the proposed methods.
Future management concerns regarding office automation
Authors: Gary D. Beamer
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

The last few years I have become less interested in the vendor shows and I began wondering why? As I thought about going to a show a year ago I went through the usual process of mentally listing my chores and setting priorities. Well, the usual did not happen. I found that the most pressing activity was management awarness. I was already armed with knowledge of tools and correct procedures for procurement, but I had not adequately staffed management. They were not ready to buy. Why was I running off to another show then? I didn't. I set about putting together some ideas to help me reach management, not with the intention of pushing them into an undesirable situation, but searching for a way to gain their understanding. I am still working on it, and here are some of my thoughts.
Expressions of Solutions of Linear Partial Differential Equations Using Algebraic Operators and Algebraic Convolution
Authors: Liepa Bikulčienė, Zenonas Navickas
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

An operator --- algebraic algorithm of solution of linear partial differential equations suitable to be realized using computers is presented in this article; furthermore, examples of application are given as well.
A novel approach for classifying customer complaints through graphs similarities in argumentative dialogues
Authors: Boris A. Galitsky, María P. González, Carlos I. Chesñevar
Venue: Decision Support Systems (2009)

Automating customer complaints processing is a major issue in the context of knowledge management technologies for most companies nowadays. Automated decision-support systems are important for complaint processing, integrating human experience in understanding complaints and the application of machine learning techniques. In this context, a major challenge in complaint processing involves assessing the validity of a customer complaint on the basis of the emerging dialogue between a customer and a company representative. This paper presents a novel approach for modelling and classifying complaint scenarios associated with customer-company dialogues. Such dialogues are formalized as labelled graphs, in which both company and customer interact through communicative actions, providing arguments that support their points. We show that such argumentation provides a complement to perform machine learning reasoning on communicative actions, improving the resulting classification accuracy.
State transition analysis to detect malicious program behavior
Authors: Xin Tang, Constantine Manikopoulos, Sotirios G. Ziavras
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

In this paper, we present a new method to detect malicious program behavior in general based on computer audit data. Ilgun, et al. have proposed USTAT (State Transition Analysis Tool for UNIX), a rule-based state transition analysis approach to solve this problem. Also, Hofmeyr and Forrest have used the N-grams method to classify program behavior traces. Here we propose an improved method that uses state transition probabilities to classify audit data. This method is more flexible and dynamic, and could be applied to a wider range of data.
Downstream performance prediction for a manufacturing system using neural networks and six-sigma improvement techniques
Authors: A. B. Johnston, L. P. Maguire, T. M. McGinnity
Venue: Robotics and Computer-Integrated Manufacturing (2009)

Intelligent techniques have been applied in a range of industrial environments [Meziane F, Vadera S, Kobbacy K, Proudlove N. Intelligent systems in manufacturing: current developments and future prospects. Integrated Manuf Syst 2000;11(4):218-38; Stephanopoulos G, Han C. Intelligent systems in process engineering: a review. Comput Chem Eng, 1996;20 (6-7):743-91; Johnston AB, Maguire LP, McGinnity TM. Using business improvement techniques to inform the optimisation of production cycle time: an industrial case study. Proceedings of the IEEE SMC UK-RI Chapter conference 2004 on intelligent cybernetic systems. September 7-8, 2004 ISSN:1744-9189; Proudlove NC, Vadera S, Kobbacy KAH. Intelligent management systems in operations: A review. J Oper Res Soc, 1998;49(7):682-99] although their implementation is not the first choice of many process engineers. In contrast process engineers in a diverse range of manufacturing environments regularly deploy business improvement techniques, such as the six-sigma methodology. Such techniques aim to control and subsequently identify the relationship between the process inputs and outputs so that a process engineer can more accurately predict how the process output shall perform based on the system inputs. Factors such as cost reduction, automatic process control or simply process prediction may be the defining factors in establishing prediction models. In this paper the authors use as a case study the manufacture of hard disc drives, from the developing of the read-write head to the recording media and the overall construction of the hard disc drive with its controlling mechanisms. Each of these stages are separate and complex-processing elements and integral to the functionality of the end product. In addition each of these stages of manufacturing may take days or weeks to complete and be processed in separate facilities and/or countries. This paper reports on the application of intelligent system techniques to improve the downstream performance prediction within this manufacturing environment. The application is guided by a six-sigma methodology to obtain improved performance. The results highlight that significant downstream prediction accuracy can be obtained using this hybrid approach.
Hybrid Content and Tag-based Profiles for Recommendation in Collaborative Tagging Systems
Authors: Daniela Godoy, Analía Amandi
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

Collaborative tagging systems have grown in popularity over the Web in the last years on account of their simplicity to categorize and retrieve content using open-ended tags. The increasing number of users providing information about themselves through social tagging activities caused the emergence of tag-based profiling approaches, which assume that users expose their preferences for certain contents through tag assignments. On the other hand, numerous content-based profiling techniques have been developed to address the problem of obtaining accurate models of user information preferences in order to assist users with information-related tasks such as Web browsing or searching. In this paper we propose a hybrid user profiling strategy that takes advantage of both content-based profiles describing long-term information interests that a recommender system can acquired along time and interests revealed through tagging activities, with the goal of enhancing the interaction of users with a collaborative tagging system. Experimental results of using hybrid profiles for tag recommendation are reported and possible applications of these profiles for obtaining personalized recommendations in collaborative tagging systems are discussed.
Power and energy characteristics of continuous waves/pulsed CO2laser application in CNG-DI ignition
Authors: N. Mariun, N. Md. Saad, M. F. Abas, N. Khan, S. Abdullah
Venue: Proceedings of the 6th conference on Applications of electrical engineering (2007)

This work was arranged to develop the scientific database and integrate the application of lasers in high voltage engineering. The design and experimental studies on continuous wave (CW)/repetitively pulsed CO2 laser was carried out in detail to determine the laser characteristics between various design parameters and the effect of varying one parameters on others. The thresholds and steady state input voltage and power across the laser tube are determined. The maximum and minimum output energy and power of the laser system are also presented as function of the pulse repetition rate and discharge current. The CO2 laser system was operated at 10.6 µm wavelengths range of infrared electromagnetic spectrum. This study is presented due to the wide applications of CO2 lasers in industry and for this project for CNG-DI ignition.
Approximation Algorithms on Multiprocessor Task Scheduling
Authors: Huang Jingui, Li Rongheng
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

Multiprocessor task scheduling problem has become increasingly interesting, for both theoretical study and practical applications. Theoretical study of the problem has made significant progress recently. However, it seems not to imply practical algorithms for the problem yet. In this paper, the offline version of the Multiprocessor scheduling problem on m-processor system is discussed for the case of not only the unit process time tasks but also the arbitrary processing time tasks. Some approximation algorithms are proposed by using the Split Scheduling, the First Fit and the Large Width First techniques. The approximation ratios here are better than the best results existed in the current literature.
Ontology-based document-driven memory for e-Learning
Authors: Emil M. Popa, Daniel Hunyadi, Iulian Pah
Venue: Proceedings of the 8th conference on Applied informatics and communications (2008)

E-learning leads to evolutions in the way of designing a course. Diffused through the web, the course content cannot be the direct transcription of a face to face course content. A course can be seen as an organization in which different actors are involved. These actors produce documents, information and knowledge that they often share. We present in this paper an ontology-based document-driven memory which is particularly adapted to an e-learning situation. The utility of a shared memory is reinforced in this kind of situation, because the interactions do not usually occur in the same place and in the same time. First we precise our conception of e-learning and we analyze actors needs. Then we present the main features of our learning organizational memory and we focus on the ontologies on which it is based. We consider two kinds of ontologies: the first one is generic and concerns the domain of training; the second one is related to the application domain and is specific to a particular training program. We present our approach for building these ontologies and we show how they can be merged.
Optimising topical query decomposition
Authors: Marcin Sydow, Francesco Bonchi, Carlos Castillo, Debora Donato
Venue: Proceedings of the 2009 workshop on Web Search Click Data (2009)

Topical query decomposition (TQD) is a paradigm recently introduced in [1], which, given a query, returns to the user a set of queries that cover the answer set of the original query. The TQD problem was studied as a variant of the set-cover problem and solved by means of a greedy algorithm. This paper aims to strengthen the original formulation by introducing a new global objective function, and thus formalising the problem as a combinatorial optimisation one. Such a reformulation defines a common framework allowing a formal evaluation and comparison of different approaches to TQD. We apply simulated annealing, a sub-optimal meta-heuristic, to the problem of topical query decomposition and we show, through a large experimentation on a data sample extracted from an actual query log, that such meta-heuristic achieves better results than the greedy algorithm.
A runtime system for software lock elision
Authors: Amitabha Roy, Steven Hand, Tim Harris
Venue: Proceedings of the 4th ACM European conference on Computer systems (2009)

The advent of multi-core processors means that exploiting parallelism is key to increasing the performance of programs. Many researchers have studied the use of atomic blocks as a way to simplify the construction of scalable parallel programs. However, there is a large body of existing lock-based code, and typically it is incorrect to simply replace lock-based critical sections with atomic blocks. Some problems include the need to do IO within critical sections; the use of primitives such as condition variables; and the sometime reliance on underlying lock properties such as fairness or priority inheritance. In this paper we investigate an alternative: a software runtime system that allows threads to speculatively execute lock-based critical sections in parallel. Execution proceeds optimistically, dynamically detecting conflicts between accesses by concurrent threads. However, if there are frequent conflicts, or if there are attempts to perform operations that cannot be done speculatively, then execution can fall back to acquiring a lock. Conversely, implementations of atomic blocks must typically serialise all operations that cannot be performed speculatively. Our runtime system has been designed with the requirements of systems code in mind: in particular it does not require that programs be written in type-safe languages, nor does it require any form of garbage collection. Furthermore, we never require a thread holding a lock to wait for a thread that has speculatively acquired it. This lets us retain any useful underlying properties of a given lock implementation, e.g. fairness or priority inheritance.