ppxscal/embedding_network huggingface dataset:
The Compiler Design Handbook: Optimizations and Machine Code Generation, Second Edition, 2nd edition
Authors: Y. N. Srikant, Priti Shankar
Venue:  (2007)

Current computer architectures pose challenges that exceed the capabilities of traditional compilation techniques. Presenting the latest information on optimizations and code generation, The Compiler Design Handbook, Second Edition features 14 new chapters that cover such topics as just-in-time compilation, energy aware compiler optimizations, garbage collection, optimizations for memory hierarchy, profiling and applications, static analysis for secure information flow, compilation for embedded systems, worst-case execution time analysis, software protection, and techniques for debugging software. Chapters on register allocation, software pipelining, and type systems also feature new material.
Configuration Management of Massively Scalable Systems
Authors: Marcin Jarzab, Jacek Kosinski, Krzysztof Zielinski
Venue: Proceeding of the 2005 conference on Software Engineering: Evolution and Emerging Technologies (2005)

The number of computational elements in massively scalable systems can easily reach several hundred of processors. The exploitation of such systems creates new challenges. The paper presents the contemporary technology of massively scalable computer systems configuration management. This problem has been put in context of modern hardware resources virtualization techniques. The paper refers to solutions provided in this area by SUN Microsystems to show real existing solutions which are used and practically tested by the authors of this paper.
Assembling Composite Web Services from Autonomous Components
Authors: Jyotishman Pathak, Samik Basu, Vasant Honavar
Venue: Proceeding of the 2007 conference on Emerging Artificial Intelligence Applications in Computer Engineering: Real Word AI Systems with Applications in eHealth, HCI, Information Retrieval and Pervasive Technologies (2007)

Web services are fast emerging as the technology of choice to build distributed information systems in multiple domains including e-Business and e-Science. An important challenge is to develop methodologies and tools that enable (semi-) automatic composition of services by taking into account the functional, non-functional and behavioral requirements of the service developer. This paper presents the fundamental concepts and issues related to service composition and provides a representative sample of existing work proposed by the AI planning and formal methods communities to address some of the challenges in service composition. It also provides a brief introduction to an iterative and incremental technique for modeling composite Web services proposed by the authors.
Clustering Hungarian verbs on the basis of complementation patterns
Authors: Kata Gábor, Enikő Héja
Venue: Proceedings of the 45th Annual Meeting of the ACL: Student Research Workshop (2007)

Our paper reports an attempt to apply an unsupervised clustering algorithm to a Hungarian treebank in order to obtain semantic verb classes. Starting from the hypothesis that semantic metapredicates underlie verbs' syntactic realization, we investigate how one can obtain semantically motivated verb classes by automatic means. The 150 most frequent Hungarian verbs were clustered on the basis of their complementation patterns, yielding a set of basic classes and hints about the features that determine verbal subcategorization. The resulting classes serve as a basis for the subsequent analysis of their alternation behavior.
Semantics for Evidence-Based Argumentation
Authors: Nir Oren, Timothy J. Norman
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

The identification of consistent sets of arguments is one of the most important concerns in the development of computational models of argument. Such extensions drive the defeasible reasoning process. In this paper we present a novel framework that offers a semantics for argumentation-based reasoning grounded in an intuitive notion of evidence. In building this model of evidence-based argumentation, we first show how evidential support for and attack against one argument by multiple arguments can be represented. Secondly, we propose a new set of extensions, referred to as the evidential preferred, e-stable, and e-grounded extensions. These extensions are similar to those in Dung's original model, but are modified to cater for the notion of evidence. Our approach involves defining a new notion of attack, and showing how acceptability and admissibility follow on from it. These extensions capture the notion that an argument cannot be accepted unless it is supported by evidence, and will therefore increase the utility of argumentation as part of a reasoning system.
Multiple routing configurations for fast IP network recovery
Authors: Amund Kvalbein, Audun Fosselie Hansen, Tarik Čičic, Stein Gjessing, Olav Lysne
Venue: IEEE/ACM Transactions on Networking (TON) (2009)

As the Internet takes an increasingly central role in our communications infrastructure, the slow convergence of routing protocols after a network failure becomes a growing problem. To assure fast recovery from link and node failures in IP networks, we present a new recovery scheme called Multiple Routing Configurations (MRC). Our proposed scheme guarantees recovery in all single failure scenarios, using a single mechanism to handle both link and node failures, and without knowing the root cause of the failure. MRC is strictly connectionless, and assumes only destination based hop-by-hop forwarding. MRC is based on keeping additional routing information in the routers, and allows packet forwarding to continue on an alternative output link immediately after the detection of a failure. It can be implemented with only minor changes to existing solutions. In this paper we present MRC, and analyze its performance with respect to scalability, backup path lengths, and load distribution after a failure. We also show how an estimate of the traffic demands in the network can be used to improve the distribution of the recovered traffic, and thus reduce the chances of congestion when MRC is used.
A unified exact method for solving different classes of vehicle routing problems
Authors: Roberto Baldacci, Aristide Mingozzi
Venue: Mathematical Programming: Series A and B (2009)

This paper presents a unified exact method for solving an extended model of the well-known Capacitated Vehicle Routing Problem (CVRP), called the Heterogenous Vehicle Routing Problem (HVRP), where a mixed fleet of vehicles having different capacities, routing and fixed costs is used to supply a set of customers. The HVRP model considered in this paper contains as special cases: the Single Depot CVRP, all variants of the HVRP presented in the literature, the Site-Dependent Vehicle Routing Problem (SDVRP) and the Multi-Depot Vehicle Routing Problem (MDVRP). This paper presents an exact algorithm for the HVRP based on the set partitioning formulation. The exact algorithm uses three types of bounding procedures based on the LP-relaxation and on the Lagrangean relaxation of the mathematical formulation. The bounding procedures allow to reduce the number of variables of the formulation so that the resulting problem can be solved by an integer linear programming solver. Extensive computational results over the main instances from the literature of the different variants of HVRPs, SDVRP and MDVRP show that the proposed lower bound is superior to the ones presented in the literature and that the exact algorithm can solve, for the first time ever, several test instances of all problem types considered.
E-Learning in 2009: Are We Winning the Battle but Losing the War?
Authors: Jane Bozarth
Venue: eLearn (2009)

As the news about the economy grows ever bleaker, organizations are finally forced to take a hard look at travel and other expenses associated with traditional classroom training. Jane Bozarth predicts this will bring several changes to the e-learning horizon.
Towards Data-Driven Design of a Peer Collaborative Agent
Authors: Gahgene Gweon, Carolyn Rosé, Regan Carey, Zachary Zaiss
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

The research literature investigating the construction of tutorial dialogue and learning companion environments present parallel experiences in attempting to emulate what has been observed to be effective in human-human scenarios. We argue that what is needed as a next step is a careful investigation using controlled experimentation to construct a causal model of how specific features of an agent's behavior influence an individual student's behavior and learning. We outline our research agenda and results from a recent study illustrating our methodology.
Xen worlds: leveraging virtualization in distance education
Authors: Benjamin R. Anderson, Amy K. Joines, Thomas E. Daniels
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

The Xen Worlds project at Iowa State University was designed to provide a virtualized lab environment for the Information Assurance program. The large number of off-campus students, and a desire for high levels of security, drove many of the requirements for the Xen Worlds environment. Some of the requirements established for the project were: The environment needed to be equally accessible and easy to use for both on- and off-campus students. It needed to be isolated from the outside world and other students. The system had to be equally usable for students with limited computing and network resources. Costs had to be kept to a minimum. The Xen Worlds environment has now been used to support several courses at both the undergraduate and graduate level. This virtual environment was equally accessible to on- and off-campus students on a 24/7 basis and supported numerous assignments in support of established curriculum requirements. Finally, surveys of students who used the Xen Worlds environment show that students have a favorable view of the project and view it as a useful and convenient learning tool.
Collaboration: Bad Words and Strong Documents
Authors: Michael Buckland
Venue: Proceeding of the 2006 conference on Cooperative Systems Design: Seamless Integration of Artifacts and Conversations -- Enhanced Concepts of Infrastructure for Communication (2006)

The use of communications technologies and artifacts in cooperative systems and the integration of cooperative systems in organization settings can be seen as a special case of the broader use of communications and artifacts in society. The broader system is of interest to those concerned with the documents and documentation. In this talk we will address two themes: 1. Language is cultural and evolves within communities of discourse. Every little community evolves its own dialect through metaphor and negotiation. Collaboration between individuals from different communities necessarily involves some dissonance, both in terms of what words mean (denote) and what they imply (connote) and, therefore, what words will be effective and socially acceptable. These issues extend broadly across the classification, categorization, and naming practices which form an important part of the infrastructure of collaborative activities. 2. Documents have enormous social power. My passport is more powerful than I am: It can cross frontiers without me, but I cannot cross frontiers without it. Analysis of the character and role of documents leads to an expansive functional definition of document which converges with the notion of artefact in the design of cooperative systems. These two related issues will be examined from the perspective of the study of documents and documentation.
Asking the Right Question: Forcing Commitment in Examination Dialogues
Authors: Trevor J. M. Bench-Capon, Sylvie Doutre, Paul E. Dunne
Venue: Proceeding of the 2008 conference on Computational Models of Argument: Proceedings of COMMA 2008 (2008)

We introduce a new semantics for value-based argumentation frameworks (VAFs) --the uncontested semantics --whose principal motivation is as a mechanism with which to refine the nature of objective acceptance with respect to a given audience. The objectively accepted arguments of a VAF w.r.t. an audience R, are those considered justified by all subscribing to the audience, R, regardless of the specific value orderings that individuals may hold. In particular we examine how the concept of uncontested acceptance may be used in examination dialogues. The proposed semantics bear some aspects in common with the recently proposed ideal semantics for standard --i.e. value--free --argumentation frameworks. In this paper we consider applications of the new semantics to a specific “real” example and examine its relationship to the ideal semantics as well as analysing some basic complexity-theoretic issues.
A look at Portable Document Format vulnerabilities
Authors: Sami Rautiainen
Venue: Information Security Tech. Report (2009)

Portable Document Format (PDF) developed by Adobe Systems Inc. is a flexible and popular document distribution and delivery file format, and it is supported within various operating systems and devices. This article provides insight for some of the security issues within the format itself as well as an outlook of the vulnerabilities found from various versions of Adobe's own PDF viewer implementation. 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
Large, durable and low-cost reflectance standard for field remote sensing applications
Authors: I. D. Sanches, M. P. Tuohy, M. J. Hedley, M. R. Bretherton
Venue: International Journal of Remote Sensing (2009)

The development of the Canopy Pasture Probe (CAPP), for acquisition of in situ pasture canopy reflectance factor, required a suitable large reflectance standard. Spectralon® has been successfully used worldwide as a reflectance standard, but large panels (greater than 20 cm diameter) suitable for use with the CAPP are very expensive. In this context, a large, durable and low cost reflectance standard has been evaluated for use with an Analytical Spectral Devices FieldSpec® Pro FR spectroradiometer attached to the CAPP. In this study various ceramic tiles, barium sulphate powders, white paint and a Kodak card were tested. The material which best suited the requirements for a reflectance standard was the white ceramic tile sourced from Argentina. This tile produced around 80% total reflectance with reasonable uniformity over the spectral range analysed (400-2400 nm); and the vegetation spectra acquired using this tile as reference sample were very similar in shape to the vegetation spectra acquired using spectralon® as a white reference.
Putting the "scalability" into database scalability services
Authors: Bruce M. Maggs
Venue:  (2008)

Applications deployed on the Internet are immediately accessible to a vast population of potential users, and as a result they tend to experience unpredictable and widely fluctuating demand. System administrators currently face a provisioning dilemma to address this demand: whether to (1) waste money by heavily overprovisioning systems, or (2) risk loss of availability during times of high demand. This problem is largely solved for static Web content, but existing approaches do not apply well to dynamic content produced by data-intensive Web applications for which a central database server limits scalability. To address this problem, we design and build a Database Scalability Service (DBSS), which can offer scalability to data-intensive Web applications as a third-party service much like Content Delivery Networks currently scale static Web content. The key challenge in building a DBSS is to enable the DBSS to off-load database requests from a content provider's central database server while ensuring that the DBSS uses up-to-date, consistent data as the database is updated. In addition, a DBSS faces the additional problems of maintaining high quality of service for each content provider as well as guaranteeing the privacy of a content provider's data. In this thesis, we focus on the scalability-related aspects of a DBSS. We design and evaluate a DBSS, called Ferdinand, that uses a multi-tiered caching architecture, with a local database cache at each Ferdinand server and a shared, collaborative cache distributed among Ferdinand's nodes. Ferdinand maintains the consistency of the database caches using a fully distributed publish/subscribe system, notifying each cache of database updates without placing additional administrative load on the central database server. Our primary technique to efficiently maintain cache consistency is to specialize the publish/subscribe system for each Web application, using an offline analysis of the Web application and its database requests. We use compiler-like techniques to advance the state-of-the-art in this offline analysis, allowing us to better understand how a Web application is affected by updates to its database. Overall, we show that our multi-tiered cache design and scalable consistency management are both critical at maximizing Ferdinand's scalability, and that the Ferdinand DBSS can scale the throughput of data-intensive Web applications by more than a factor of 10.
Social recommender systems for web 2.0 folksonomies
Authors: Stefan Siersdorfer, Sergej Sizov
Venue: Proceedings of the 20th ACM conference on Hypertext and hypermedia (2009)

The rapidly increasing popularity of Web 2.0 knowledge and content sharing systems and growing amount of shared data make discovering relevant content and finding contacts a difficult enterprize. Typically, folksonomies provide a rich set of structures and social relationships that can be mined for a variety of recommendation purposes. In this paper we propose a formal model to characterize users, items, and annotations in Web 2.0 environments. Our objective is to construct social recommender systems that predict the utility of items, users, or groups based on the multi-dimensional social environment of a given user. Based on this model we introduce recommendation mechanisms for content sharing frameworks. Our comprehensive evaluation shows the viability of our approach and emphasizes the key role of social meta knowledge for constructing effective recommendations in Web 2.0 applications.
Practical Intrusion Analysis: Prevention and Detection for the Twenty-First Century, 1st edition
Authors: Ryan Trost
Venue:  (2009)

Practical Intrusion Analysis provides a solid fundamental overview of the art and science of intrusion analysis. Nate Miller, Cofounder, Stratum Security The Only Definitive Guide to New State-of-the-Art Techniques in Intrusion Detection and Prevention Recently, powerful innovations in intrusion detection and prevention have evolved in response to emerging threats and changing business environments. However, security practitioners have found little reliable, usable information about these new IDS/IPS technologies. In Practical Intrusion Analysis, one of the fields leading experts brings together these innovations for the first time and demonstrates how they can be used to analyze attacks, mitigate damage, and track attackers. Ryan Trost reviews the fundamental techniques and business drivers of intrusion detection and prevention by analyzing todays new vulnerabilities and attack vectors. Next, he presents complete explanations of powerful new IDS/IPS methodologies based on Network Behavioral Analysis (NBA), data visualization, geospatial analysis, and more. Writing for security practitioners and managers at all experience levels, Trost introduces new solutions for virtually every environment. Coverage includes Assessing the strengths and limitations of mainstream monitoring tools and IDS technologies Using Attack Graphs to map paths of network vulnerability and becoming more proactive about preventing intrusions Analyzing network behavior to immediately detect polymorphic worms, zero-day exploits, and botnet DoS attacks Understanding the theory, advantages, and disadvantages of the latest Web Application Firewalls Implementing IDS/IPS systems that protect wireless data traffic Enhancing your intrusion detection efforts by converging with physical security defenses Identifying attackers geographical fingerprints and using that information to respond more effectively Visualizing data traffic to identify suspicious patterns more quickly Revisiting intrusion detection ROI in light of new threats, compliance risks, and technical alternatives Includes contributions from these leading network security experts: Jeff Forristal, a.k.a. Rain Forest Puppy, senior security professional and creator of libwhisker Seth Fogie, CEO, Airscanner USA; leading-edge mobile security researcher; coauthor of Security Warrior Dr. Sushil Jajodia, Director, Center for Secure Information Systems; founding Editor-in-Chief, Journal of Computer Security Dr. Steven Noel, Associate Director and Senior Research Scientist, Center for Secure Information Systems, George Mason University Alex Kirk, Member, Sourcefire Vulnerability Research Team
Application of artificial intelligence techniques to economic planning
Authors: Ioan-Gheorghe Ratiu, Claudia-Georgeta Carstea, Doru Plesea, Lucian Patrascu
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

In this article the relevance of computer science to economic planning is presented. An algorithm for constructing a balanced economic plan is presented and found to be of time order N log (N) in the complexity of the economy. The time taken to perform a complete plan optimization in natural units for a part of economy is estimated. The experimental results confirm the initial complexity analysis of the algorithm. Our conclusions are that automated resource allocation by computer constitutes a third economic alternative to market allocation or bureaucratic allocation.
Numerical solution of nonlinear Volterra-Fredholm integro-differential equations via direct method using triangular functions
Authors: E. Babolian, Z. Masouri, S. Hatamzadeh-Varmazyar
Venue: Computers Mathematics with Applications (2009)

An effective direct method to determine the numerical solution of the specific nonlinear Volterra-Fredholm integro-differential equations is proposed. The method is based on new vector forms for representation of triangular functions and its operational matrix. This approach needs no integration, so all calculations can be easily implemented. Some numerical examples are provided to illustrate the accuracy and computational efficiency of the method.