ppxscal/embedding_network huggingface dataset:
Hyperedge replacement languages and pushdown automata
Authors: Silviu Dumitrescu
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

In this paper we are studying the relations between generated and accepted hyperedge replacement languages. In context freeness of hyperedge replacement grammars we can transform each grammar into an equivalent one in Greibach Normal Form (HRGNF). In order to create a pushdown automata for hyperedge replacement languages (PDAH) we build an algorithm to transform the planar structure of a hypergraph into a linear list of labels and finally into a linear list of hypergraphs. With this kind of lists we can build a PDAH from existing HRGNF. For each grammar exists a PDAH which recognize the same language.
Online political marketing in Greece: An evaluation of the 2007 national elections and two case studies
Authors: Constantinos K. Coursaris, Savvas Papagiannidis
Venue: Computers in Human Behavior (2009)

This paper presents findings on the use of Web sites as a political marketing tool in the context of the 2007 Greek national elections. The questions guiding this research are how popular were online campaigns in terms of candidate use of Web sites and which trust and credibility-building Web site design cues were leveraged by candidates. This study also explored differences in online campaign practices both between Greek political parties and between the 2007 national Greek elections and the 2002 federal US elections. The entire population of Greek candidates' Web sites (n=373) was reviewed and evaluated against a framework that consisted of 58 Web site design features reflecting the potential of Web technologies for political marketing. Results indicate that only 18% of Greek candidates had a Web presence in 2007, and on average these online campaigns were quite limited in their implementations of practices such as volunteer recruitment, fundraising, and Web-exclusive activities. On average, these implementations led in certain areas, but more interestingly lagged the US in online political marketing activities such as the provision of electronic paraphernalia, a campaign calendar, a privacy policy, issues statements, and endorsements. Twenty-four Web site design features are recommended for candidates to remain at par within the online political marketing scene in Greece. Findings are complemented by two case studies of Web sites that demonstrate mature use of Web technologies in online political campaigning.
Google Sites & Chrome For Dummies
Authors: Ryan Teeter, Karl Barksdale
Venue: For Dummies (2009)

Curious about Google Sites and how team collaboration Web sites can help you share documents online from various locations? Curious about Googles new Chrome browser? Google Sites & Chrome For Dummies has what you want to know! Today, Google is so much more than another word for search. Google Sites & Chrome For Dummies shows you how to create great collaborative Web sites with Google Sites and surf the Web with the super-fast Google Chrome browser. Find out how they work with other Google Apps, too. Youll learn to: Take advantage of free hosting, free tools, and a simple, straightforward interface with Google Sites Set up a Google account or Google Apps account Create wiki sites that let coworkers collaborate on projects or keep family members up to date Use Google gadgets to keep track of projects, manage calendars and documents, or display photos Integrate documents, spreadsheets, presentations, and other Google Apps into your site Work with Contact List, Google Talk, and Google Chat, and handle e-mail with Gmail Download and install the speedy Google Chrome browser Install browser plug-ins, enable offline access to Google Docs, and manage misbehaving tabs Youll even find instructions and examples to help you plan sites for personal and business use, plus a sample college course site. With advice from Google Sites & Chrome For Dummies, you can make collaboration easy and have the high-speed Web at your fingertips.
Lifting inequalities: a framework for generating strong cuts for nonlinear programs
Authors: Jean-Philippe P. Richard, Mohit Tawarmalani
Venue: Mathematical Programming: Series A and B (2009)

In this paper, we introduce the first generic lifting techniques for deriving strong globally valid cuts for nonlinear programs. The theory is geometric and provides insights into lifting-based cut generation procedures, yielding short proofs of earlier results in mixed-integer programming. Using convex extensions, we obtain conditions that allow for sequence-independent lifting in nonlinear settings, paving a way for efficient cut-generation procedures for nonlinear programs. This sequence-independent lifting framework also subsumes the superadditive lifting theory that has been used to generate many general-purpose, strong cuts for integer programs. We specialize our lifting results to derive facet-defining inequalities for mixed-integer bilinear knapsack sets. Finally, we demonstrate the strength of nonlinear lifting by showing that these inequalities cannot be obtained using a single round of traditional integer programming cut-generation techniques applied on a tight reformulation of the problem.
Background default knowledge and causality ascriptions
Authors: Jean-François Bonnefon, Rui Da Silva Neves, Didier Dubois, Henri Prade
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

A model is defined that predicts an agent's ascriptions of causality (and related notions of facilitation and justification) between two events in a chain, based on background knowledge about the normal course of the world. Background knowledge is represented by nonmonotonic consequence relations. This enables the model to handle situations of poor information, where background knowledge is not accurate enough to be represented in, e.g., structural equations. Tentative properties of causality ascriptions are explored, i.e., preference for abnormal factors, transitivity, coherence with logical entailment, and stability with respect to disjunction and conjunction. Empirical data are reported to support the psychological plausibility of our basic definitions.
Evaluation of detection algorithms for MAC layer misbehavior: theory and experiments
Authors: Alvaro A. Cárdenas, Svetlana Radosavac, John S. Baras
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

We revisit the problem of detecting greedy behavior in the IEEE 802.11 MAC protocol by evaluating the performance of two previously proposed schemes: DOMINO and the Sequential Probability Ratio Test (SPRT). Our evaluation is carried out in four steps. We first derive a new analytical formulation of the SPRT that considers access to the wireless medium in discrete time slots. Then, we introduce an analytical model for DOMINO. As a third step, we evaluate the theoretical performance of SPRT and DOMINO with newly introduced metrics that take into account the repeated nature of the tests. This theoretical comparison provides two major insights into the problem: it confirms the optimality of SPRT, and motivates us to define yet another test: a nonparametric CUSUM statistic that shares the same intuition as DOMINO but gives better performance. We finalize the paper with experimental results, confirming the correctness of our theoretical analysis and validating the introduction of the new nonparametric CUSUM statistic.
Applying Finite State Morphology to Conversion Between Roman and Perso-Arabic Writing Systems
Authors: Jalal Maleki, Maziar Yaesoubi, Lars Ahrenberg
Venue: Proceeding of the 2009 conference on Finite-State Methods and Natural Language Processing: Post-proceedings of the 7th International Workshop FSMNLP 2008 (2009)

This paper presents a method for converting back and forth between the Perso-Arabic and a romanized writing system for Persian. Given a word in one writing system, we use finite state transducers to generate morphological analysis for the word that is subsequently used to regenerate the orthography of the word in the other writing system. The system has been implemented in XFST and LEXC.
A Rewriting Semantics for Maude Strategies
Authors: Narciso Martí-Oliet, José Meseguer, Alberto Verdejo
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Intuitively, a strategy language is a way of taming the nondeterminism of a rewrite theory. We can think of a strategy language S as a rewrite theory transformation R@?S(R) such that S(R) provides a way of executing R in a controlled way. One such theory transformation for the Maude strategy language is presented in detail in this paper. Progress in the semantic foundations of Maude's strategy language has led us to study some general requirements for strategy languages. Some of these requirements, like soundness and completeness with respect to the rewrites in R, are absolute requirements that every strategy language should fulfill. Other more optional requirements, that we call monotonicity and persistence, represent the fact that no solution is ever lost. We show that the Maude strategy language satisfies all these four requirements.
SyCo: a collaborative learning tool for generating ideas in private and in public
Authors: Chrisovalantis Kefalidis, Georgia Lazakidou, Symeon Retalis
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

In this paper a synchronous computer supported collaborative learning tool called SyCo is presented. It was designed to facilitate students in performing tasks according to the principles of various collaborative learning strategies, such as Jigsaw and eARMA. SyCo innovates because during the collaborative learning process it allows each student to have a private space to think and draw their ideas before presenting them to their peer-students in the public space. Thus, within SyCo peers can move into and out of a shared space, work privately, copy and paste parts of their own work that had been sketched in their private space in order to share them with others.
A case for compiler-driven superpage allocation
Authors: Joshua Magee, Apan Qasem
Venue: Proceedings of the 47th Annual Southeast Regional Conference (2009)

Most modern microprocessor-based systems provide support for superpages both at the hardware and software level. Judicious use of superpages can significantly cut down the number of TLB misses and improve overall system performance. However, indiscriminate superpage allocation results in page fragmentation and increased application footprint, which often outweigh the benefits of reduced TLB misses. Previous research has explored policies for smart allocation of superpages from an operating systems perspective. This paper presents a compiler-based strategy for automatic and profitable memory allocation via superpages. A significant advantage of a compiler-based approach is the availability of data-reuse information within an application. Our strategy employs data-locality analysis to estimate the TLB demands of a program and uses this metric to determine if the program will benefit from superpage allocation. Apart from its obvious utility in improving TLB performance, this strategy can be used to improve the effectiveness of certain data-layout transformations and can be a useful tool in benchmarking and empirical tuning. We demonstrate the effectiveness of this strategy with experiments on an Intel Core 2 Duo with a two-level TLB.
Predicting evidence of understanding by monitoring user's task manipulation in multimodal conversations
Authors: Yukiko I. Nakano, Yoshiko Arimoto, Kazuyoshi Murata, Yasuhiro Asa, Mika Enomoto, Hirohiko Sagawa
Venue: Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions (2007)

The aim of this paper is to develop animated agents that can control multimodal instruction dialogues by monitoring user's behaviors. First, this paper reports on our Wizard-of-Oz experiments, and then, using the collected corpus, proposes a probabilistic model of fine-grained timing dependencies among multimodal communication behaviors: speech, gestures, and mouse manipulations. A preliminary evaluation revealed that our model can predict a instructor's grounding judgment and a listener's successful mouse manipulation quite accurately, suggesting that the model is useful in estimating the user's understanding, and can be applied to determining the agent's next action.
Stability of central finite difference schemes on non-uniform grids for the Black--Scholes equation
Authors: K. J. in 't Hout, K. Volders
Venue: Applied Numerical Mathematics (2009)

This paper deals with stability in the numerical solution of the Black-Scholes partial differential equation. We investigate the semi-discretization on non-uniform grids with central, second-order finite difference schemes. Our stability analysis concerns the important question of whether, for the obtained semi-discrete matrices A, the norm @?e^t^A@? of the matrix exponential of tA (t>=0) can be bounded suitably. Even though the considered semi-discretization of the Black-Scholes equation is widely known in the literature, a rigorous stability analysis for non-uniform grids appears to be lacking. In most cases, the matrices A are non-normal and an analysis based solely on the eigenvalues of A does not provide adequate estimates. In the present paper, we prove rigorous useful upper bounds on @?e^t^A@? for general non-uniform grids. Here we consider scaled spectral norms as well as the maximum norm. Our theoretical estimates are illustrated by ample numerical experiments, and practical conclusions about the stability of the schemes on non-uniform grids are derived. The results in this paper can directly be used in obtaining stability results also for time discretization schemes and are significant to a variety of applications beyond the Black-Scholes model.
Origins and Successors of the Compact Disc: Contributions of Philips to Optical Storage, 1st edition
Authors: J.B.H. Peek, J.W.M Bergmans, J.A.M.M. van Haaren, F.J.C.M. Toolenaar, S.G. Stan
Venue: Philips Research Book Series (2009)

In March 1979, a prototype of a Compact Disc (CD) digital audio system was publicly presented and demonstrated to an audience of about 300 journalists at Philips in Eindhoven, The Netherlands. This milestone effectively marked the beginning of the digital entertainment era. In the years to follow, the CD-audio system became an astonishing worldwide success, and was followed by successful derivatives such as CD-ROM, CD-RW, DVD, and recently Blu-ray Disc. Today, around the thirtieth anniversary of the milestone, it is taken for granted that media content is stored and distributed digitally, and the analog era seems long gone. This book retraces the origins of the CD system and the subsequent evolution of digital optical storage, with a focus on the contributions of Philips to this field. The book contains perspectives on the history and evolution of optical storage, along with reproductions of key technical contributions of Philips to the field.
Ranking the importance of alerts for problem determination in large computer systems
Authors: Guofei Jiang, Haifeng Chen, Kenji Yoshihira, Akhilesh Saxena
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

The complexity of large computer systems has raised unprecedented challenges for system management. In practice, operators often collect large volume of monitoring data from system components and set up many rules to check data and trigger alerts. However, the alerts from various rules usually have different problem reporting accuracy because their thresholds are often manually set based on operators' experience and intuition. Meantime, due to system dependencies, a single problem may trigger many alerts at the same time in large systems and the critical question is which alert should be analyzed first in the following problem determination process. In this paper, we propose a novel peer review mechanism to rank the importance of alerts and the top ranked alerts are more likely to be true positives. After comparing a metric value against its threshold to generate alerts, we also compare the value with the equivalent thresholds from many other rules to determine the importance of alerts. Our approach is evaluated with a real test bed system and experimental results are also included to demonstrate its effectiveness.
Use of XACML Policies for a Network Access Control Service
Authors: Gabriel López, Óscar Cánovas, Antonio F. Gómez-Skarmeta
Venue: Proceeding of the 2005 conference on Applied Public Key Infrastructure: 4th International Workshop: IWAP 2005 (2005)

The interest in policy specification languages is increasing thanks to the proliferation of authorization solutions that need to define their resource access policies by means of them. These solutions define their own policy syntax, usually based on XML, which involves the definition of non-interoperable policies and non-heterogeneous environments. XACML has been defined with that purpose and is getting more and more acceptance for those type of environments as a valid alternative to proprietary policies. In this paper, we present the definition of the whole policies set needed in an authorization scenario, specifically, the NAS-SAML, which defines a network access control service based on SAML and the AAA architecture. We present the XACML documents representing those policies and the entities involved in the their management life cycle.
Exponential Asymptotic Stability of a Two-Unit Standby Redundant Electronic Equipment System under Human Failure
Authors: Xing Qiao, Zhaoxing Li, Dan Ma
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this paper, we deal with the exponential asymptotic stability of a two-unit standby redundant electronic equipment system under human failure. First we prove that the positive contraction c 0-semigroup {T(t)} t ¿ 0 which is generated by the operator corresponding to these equations is a quasi-compact operator. Then by using that 0 is an eigenvalue of the operator with algebraic index one and the c 0-semigroup {T(t)} t ¿ 0 is contraction, we deduce that the spectral bound of the operator is zero. By using the above results we obtain easily the exponential asymptotic stability of the solution of the redundant system.
Network Experiments Manual for Peterson/Davie Computer Networks 4/e, 2nd edition
Authors: Emad Aboelela
Venue:  (2007)

Networking technologies and concepts are often difficult to explain, even through careful description and well thought out examples. One method for making this information "stick" is to create an environment where networking professionals and students can visualize how networks work, utilizing a software tool that simulates the functions within a network. The tool itself is highly useful in that it provides a virtual environment for an assortment of desirable features such as modeling a network based on specified criteria and predicting its performance.The Network Simulation Experiments Manual takes this instructional tool a step further and provides detailed experiments on core networking topologies for use in this simulation environment. Various scenarios are presented within each topology and review questions, a lab report, and exercises accompany each assignment as well. The manual also comes with directions for downloading the free easy-to-install software, the OPNET IT Guru Academic Edition. This software provides a virtual environment for modeling, analyzing, and predicting the performance of IT infrastructures, including applications, servers, and networking technologies. *The experiments in this manual are closely tied to Peterson/Davie: Computer Networks, 4E, a best-selling Morgan Kaufmann title*Software download based on an award-winning product made by OPNET Technologies, Inc., whose software is used by thousands of commercial and government organizations worldwide, and by over 500 universities*Useful experimentation for professionals in the workplace who are interested in learning & demonstrating the capability of evaluating different commercial networking products 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
Linear regression with nonstationary variables and constraints on its parameters
Authors: A. S. Korkhin
Venue: Cybernetics and Systems Analysis (2009)

The problem of estimating parameters of a linear regression with allowance for inequality constraints on the parameters is considered in the special case when its variables have a trend. A parameter estimation algorithm is described. The consistency of parameter estimates is proved and their asymptotic distribution is found. Consistent estimates are proposed for the mean-square error matrix of estimates of regression parameters and noise dispersion under rather general assumptions on the law of noise distribution.
Validating power architecture™ technology-based MPSoCs through executable specifications
Authors: Jayanta Bhadra, Ekaterina Trofimova, Magdy S. Abadir
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Multiprocessor systems-on-chip (MPSoC) pose a considerable validation challenge due to their size and complexity. We approach the problem of MPSoC validation through a tool that employs a reusable abstract executable specification written in C++. The tool effectively leverages a simulation-based, trace-driven mechanism. Traces are computed by simulating a system level register-transfer level (RTL) implementation of an MPSoC. The tool then analyzes the traces for correctness by checking them across executions of the abstract executable specification. We have effectively used the tool on various live MPSoC design projects based on the Power Architecture technology (The Power Architecture and Power.org wordmarks and the Power and Power.org logos and related marks are trademarks and service marks licensed by Power.org.). We demonstrate the effectiveness of the technique through results from these projects where we uncovered a number of design errors not found by any other technique.
Congestion management in delay tolerant networks
Authors: Guohua Zhang, Jing Wang, Yonghe Liu
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

In delay tolerant networks, custody transfer can provide certain degree of reliability as a custodian node cannot discard a message unless its life time expires or the custody is transferred to another node after a commitment. This creates a challenging decision making problem at a node in determining whether to accept a custody transfer: on one hand, it is beneficial to accept a large number of messages as it can potentially advance the messages toward their ultimate destinations and network utilization can be maximized; on the other hand, if the receiving node over-commits itself by accepting too many messages, it may find itself setting aside an excessive amount of storage and thereby preventing itself from receiving further potentially important, high yield (in terms of network utilization) messages. To solve this problem, in this paper, we apply the concept of revenue management, and employ dynamic programming to develop a congestion management strategy for delay tolerant networks. For a class of network utility functions, we show that the optimal solution is completely distributed in nature where only the local information such as available storage space of a node is required. This is particularly important given the nature of delay tolerant networks where global information is often not available and the network is inherently dynamic. Our simulation results show that the proposed congestion management scheme is effective in avoiding congestion and balancing network load among the nodes.