ppxscal/embedding_network huggingface dataset:
Flexible reference-counting-based hardware acceleration for garbage collection
Authors: José A. Joao, Onur Mutlu, Yale N. Patt
Venue: Proceedings of the 36th annual international symposium on Computer architecture (2009)

Languages featuring automatic memory management (garbage collection) are increasingly used to write all kinds of applications because they provide clear software engineering and security advantages. Unfortunately, garbage collection imposes a toll on performance and introduces pause times, making such languages less attractive for high-performance or real-time applications. Much progress has been made over the last five decades to reduce the overhead of garbage collection, but it remains significant. We propose a cooperative hardware-software technique to reduce the performance overhead of garbage collection. The key idea is to reduce the frequency of garbage collection by efficiently detecting and reusing dead memory space in hardware via hardware-implemented reference counting. Thus, even though software garbage collections are still eventually needed, they become much less frequent and have less impact on overall performance. Our technique is compatible with a variety of software garbage collection algorithms, does not break compatibility with existing software, and reduces garbage collection time by 31% on average on the Java DaCapo benchmarks running on the production build of the Jikes RVM, which uses a state-of-the-art generational garbage collector.
A visual proof of amortised-linear resizable arrays
Authors: Don Blaheta
Venue: ACM SIGCSE Bulletin (2009)

We demonstrate visually why doubling capacity is the better strategy when resizing arrays. The visual proof makes simple amortised analysis more accessible to a CS2 audience.
A weight-coded genetic algorithm for the capacitated arc routing problem
Authors: Matthew J.W. Morgan, Christine L. Mumford
Venue: Proceedings of the 11th Annual conference on Genetic and evolutionary computation (2009)

In this paper we present a weight coded genetic algorithm (GA) based approach to the capacitated arc routing problem (CARP). In comparison to metaheuristic algorithms, simple constructive heuristic algorithms often produce poor quality solutions to the CARP. Using a novel weight coding model in conjunction with a series of standard CARP heuristics, acting as a solution engine, we demonstrate how these simple heuristic procedures can be `duped' into producing better solutions to the CARP. The algorithm is tested on a set of problem instances drawn from the literature. Initial results for our GA show that it is possible to reliably produce an uplift in solution quality of between 7.3% and 14.3% above the standard heuristics, the GA identifying 47 optimum or best known solutions from the 57 problem instances tested.
Graph of Microworlds: A Framework for Assisting Progressive Knowledge Acquisition in Simulation-based Learning Environments
Authors: Tomoya Horiguchi, Tsukasa Hirashima
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

A framework for assisting a learner's progressive knowledge acquisition in simulation-based learning environments (SLEs) is proposed. In SLE, usually a learner is first given a simple situation to acquire basic knowledge, then given more complicated situation to refine it. Such change of situation often causes the change of the model to be used. Our GMW (graph of microworlds) framework effifiently assists a learner in such 'progressive' knowledge acquisition by adaptively giving her/him microworlds. A node of GMW has the description of a microworld which includes the model, its modeling assumptions (which can explain why the model is valid in the situation) and the tasks through which one can understand the model. The GMW, therefore, can adaptively provide a learner with the microworld and the relevant tasks to understanding it. An edge has the description of the difference/change between microworlds. The GMW, therefore, can provide the relevant tasks which encourage a learner to transfer to the next microworld and can explain how/why the behavioral change of the model is caused by the change of the situation in model-based way. This capability of GMW greatly helps a learner progressively refine, that is, reconstruct her/his knowledge in a concrete context.
Patterns of eye gaze during rapid serial visual presentation
Authors: Oscar de Bruijn, Robert Spence
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

The technique of Rapid Serial Visual Presentation (RSVP), comparable with the riffling of a book's pages to acquire an impression of its contents, has considerable application potential, especially where display space is at a premium. The design of RSVP applications, however, is not straightforward in view of the many, and often conflicting, design decisions that must be taken. Specifically, it is suspected that many of these decisions will impact on the ability of users to effectively perceive the displayed content as far as carrying out a task is concerned. This paper presents an exploratory study in which we investigated the impact of a number of design decisions on users' eye movements. Four RSVP modes were implemented that represent alternative design decisions. Two of these modes were modeled after existing e-commerce applications, and two have been the subject of our ongoing research for some time. For each RSVP mode, a set of images was presented to two participants who were required to respond to the appearance of a pre-viewed target image. In the course of these presentations we recorded the participants' eye movements in order to elicit information concerning potential perceptual difficulties. We propose a novel graphical characterization of RSVP modes, which is appropriate to their correlation with recorded eye gaze patterns, offer an interpretation of the experimental data, and provide a motivation for further research into RSVP.
Gray Hat Python: Python Programming for Hackers and Reverse Engineers
Authors: Justin Seitz
Venue:  (2009)

Python is fast becoming the programming language of choice for hackers, reverse engineers, and software testers because it's easy to write quickly, and it has the low-level support and libraries that make hackers happy. But until now, there has been no real manual on how to use Python for a variety of hacking tasks. You had to dig through forum posts and man pages, endlessly tweaking your own code to get everything working. Not anymore. Gray Hat Python explains the concepts behind hacking tools and techniques like debuggers, trojans, fuzzers, and emulators. But author Justin Seitz goes beyond theory, showing you how to harness existing Python-based security tools - and how to build your own when the pre-built ones won't cut it. You'll learn how to: Automate tedious reversing and security tasks Design and program your own debugger Learn how to fuzz Windows drivers and create powerful fuzzers from scratch Have fun with code and library injection, soft and hard hooking techniques, and other software trickery Sniff secure traffic out of an encrypted web browser session Use PyDBG, Immunity Debugger, Sulley, IDAPython, PyEMU, and more The world's best hackers are using Python to do their handiwork. Shouldn't you?
A multi-relational approach to spatial classification
Authors: Richard Frank, Martin Ester, Arno Knobbe
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

Spatial classification is the task of learning models to predict class labels based on the features of entities as well as the spatial relationships to other entities and their features. Spatial data can be represented as multi-relational data, however it presents novel challenges not present in multi-relational problems. One such problem is that spatial relationships are embedded in space, unknown a priori, and it is part of the algorithm's task to determine which relationships are important and what properties to consider. In order to determine when two entities are spatially related in an adaptive and non-parametric way, we propose a Voronoi-based neighbourhood definition upon which spatial literals can be built. Properties of these neighbourhoods also need to be described and used for classification purposes. Non-spatial aggregation literals already exist within the multi-relational framework, but are not sufficient for comprehensive spatial classification. A formal set of additions to the multi-relational data mining framework is proposed, to be able to represent spatial aggregations as well as spatial features and literals. These additions allow for capturing more complex interactions and spatial occurrences such as spatial trends. In order to more efficiently perform the rule learning and exploit powerful multi-processor machines, a scalable parallelized method capable of reducing the runtime by several factors is presented. The method is compared against existing methods by experimental evaluation on a real world crime dataset which demonstrate the importance of the neighbourhood definition and the advantages of parallelization.
Translating Wigmore Diagrams
Authors: Glenn Rowe, Chris Reed
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

In the early 20th century, J.H. Wigmore described a new method for analysing and laying out arguments in legal cases. His proposal was the first system of argument diagramming, and it is still in use in jurisprudence today. Wigmore diagrams offer a rich ontology of argumentation concepts which in some respects are close to ideas in other, more modern systems of argument analysis and argument diagramming --whilst in other areas, is much richer and more specific than alternatives. The features of Wigmore analyses might reasonably be expected to contribute to modern, computational approaches to argument, both in the legal domain and more broadly. This paper explores some of the key issues in representing Wigmore analyses and translating between them and other systems of analysis such as those founded upon Toulmin models and scheme-based models.
Optimistic initialization and greediness lead to polynomial time learning in factored MDPs
Authors: István Szita, András Lőrincz
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

In this paper we propose an algorithm for polynomial-time reinforcement learning in factored Markov decision processes (FMDPs). The factored optimistic initial model (FOIM) algorithm, maintains an empirical model of the FMDP in a conventional way, and always follows a greedy policy with respect to its model. The only trick of the algorithm is that the model is initialized optimistically. We prove that with suitable initialization (i) FOIM converges to the fixed point of approximate value iteration (AVI); (ii) the number of steps when the agent makes non-near-optimal decisions (with respect to the solution of AVI) is polynomial in all relevant quantities; (iii) the per-step costs of the algorithm are also polynomial. To our best knowledge, FOIM is the first algorithm with these properties.
Adobe Dreamweaver CS3 Illustrated, 1st edition
Authors: Sherry Bishop
Venue:  (2007)

Part of the Illustrated Series, this text covers the fundamental concepts of Adobe Dreamweaver CS3 with a strong emphasis on design. Fully revised to include coverage of the latest version of Dreamweaver, this title takes users from learning all the basic functions to fully understanding how to get Web sites up and running.
Supporting middle school students' construction of evidence-based arguments: impact of and student interactions with computer-based argumentation scaffolds
Authors: Jennifer C. Richardson, Krista D. Glazewski
Venue:  (2008)

Middle school students have difficulty creating evidence-based arguments (EBAs) during problem-based learning (PBL) units due to challenges (a) adequately representing the unit's central problem (Ge Land, 2004; Liu Bera, 2005), (b) determining and obtaining the most relevant evidence (Pedersen Liu, 2002-2003), and (c) synthesizing gathered information to construct a sound argument (Cho Jonassen, 2002). I designed and developed the Connection Log to support middle school students in this process. This study addressed (1) the Connection Log's impact on (a) argument evaluation ability, and (b) group argument quality and (2) how and why middle school science students used the Connection Log.Four sections of a 7th-grade science class participated. Student groups selected a stakeholder position related to the Human Genome Project (HGP) and needed to decide on and promote a plan to use $3 million to further their position as pertains to the HGP.I randomly assigned one higher-achieving and one lower-achieving class to Connection Log or no Connection Log conditions. Students completed an argument evaluation test, and impact on argument evaluation ability was determined using nested ANOVA. Two graduate students, blind to treatment conditions, rated group arguments, and impact on group argument quality was determined using nested MANOVA.To determine how and why students used the Connection Log, I videotaped and interviewed one small group from each class in the experimental condition. I coded transcripts and generated themes, triangulating the two data sources with informal observations during all class sessions and what students wrote in the Connection Log.I detected no significant differences on claim, evidence, or connection of claim to evidence ratings of debate performances. However, students used the Connection Log to counter different difficulties, and I found a significant main effect of the Connection Log on argument evaluation ability, as well as a significant simple main effect of the Connection Log on argument evaluation ability of lower-achieving students. Implications include the Connection Log's potential to facilitate the creation of evidence-based arguments and the importance of (a) supporting English as a New Language students&rsquo; efforts and (b) redundancy in communication.
Helping students with information fragmentation, assimilation and notetaking
Authors: Yolanda Jacobs Reimer, Melissa Bubnash, Matthew Hagedal, Peter Wolf
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

The problem of information fragmentation is especially acute for today's college students who manage and assimilate information in various forms while completing many of their academic tasks, and who must do so within the confines of standard software applications. The goal of this research is to provide students with a novel information assimilation and notetaking tool that helps them more efficiently manage their electronic information and overcome some of the fragmentation challenges they routinely experience. Our Global Information Gatherer prototype allows students to view, edit and store files of different types from within a single interface, and provides an integrated web browser and notetaking functionality.
Coarse-to-Fine Image Reconstruction Based on Weighted Differential Features and Background Gauge Fields
Authors: Bart Janssen, Remco Duits, Luc Florack
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

We propose an iterative approximate reconstruction method where we minimize the difference between reconstructions from subsets of multi scale measurements. To this end we interpret images not as scalar-valued functions but as sections through a fibered space. Information from previous reconstructions, which can be obtained at a coarser scale than the current one, is propagated by means of covariant derivatives on a vector bundle. The gauge field that is used to define the covariant derivatives is defined by the previously reconstructed image. An advantage of using covariant derivatives in the variational formulation of the reconstruction method is that with the number of iterations the accuracy of the approximation increases. The presented reconstruction method allows for a reconstruction at a resolution of choice, which can also be used to speed up the approximation at a finer level. An application of our method to reconstruction from a sparse set of differential features of a scale space representation of an image allows for a weighting of the features based on the sensitivity of those features to noise. To demonstrate the method we apply it to the reconstruction from singular points of a scale space representation of an image.
Improved Deterministic Algorithms for Weighted Matching and Packing Problems
Authors: Qilong Feng, Yang Liu, Songjian Lu, Jianxin Wang
Venue: Proceedings of the 6th Annual Conference on Theory and Applications of Models of Computation (2009)

For the weighted rD-Matching problem, we present a deterministic parameterized algorithm with time complexity O *(4(r ¿ 1)k ), improving the previous best upper bound O *(4 rk ). In particular, the algorithm can be applied to solve the unweighted 3D-Matching problem with time O *(16 k ), improving the previous best result O *(21.26 k ). For the weighted r-Set Packing problem, we present a deterministic parameterized algorithm with time complexity O *(2(2r ¿ 1)k ), improving the previous best result O *(22rk ). The algorithm, when applied to the unweighted 3-Set Packing problem, has running time O *(32 k ), improving the previous best result O *(43.62 k ). Moreover, for the weighted rD-Matching and weighted r-Set Packing problems, we get a kernel of size O(k r ).
Mining periodic patterns in spatio-temporal sequences at different time granularities
Authors: Sezin Karli, Yucel Saygin
Venue: Intelligent Data Analysis (2009)

With the advancement of technology, it is now easy to collect the location information of mobile users over time. Spatio-temporal data mining techniques were proposed in the literature for the extraction of patterns from spatio-temporal data. However, current techniques can only extract patterns of the finest time granularity, and therefore overlooks potential patterns available at coarser time granularities. In this work, we propose two techniques to allow mining at different time granularities. Experimental results show that the proposed techniques are indeed effective and efficient for mining periodic spatio-temporal patterns at different time granularities.
Application of Discontinuous Galerkin Methods for Reaction-Diffusion Systems in Developmental Biology
Authors: Jianfeng Zhu, Yong-Tao Zhang, Stuart A. Newman, Mark Alber
Venue: Journal of Scientific Computing (2009)

Nonlinear reaction-diffusion systems which are often employed in mathematical modeling in developmental biology are usually highly stiff in both diffusion and reaction terms. Moreover, they are typically considered on multidimensional complex geometrical domains because of complex shapes of embryos. We overcome these computational challenges by combining discontinuous Galerkin (DG) finite element methods with Strang type symmetrical operator splitting technique, on triangular meshes. This allows us to avoid directly solving a coupled nonlinear system, as is necessary with the standard implicit schemes. Numerical solutions of two reaction-diffusion systems, the well-studied Schnakenberg model, which has been applied to several problems in developmental biology, and a new biologically based system for skeletal pattern formation in the vertebrate limb, are presented to demonstrate effects of various domain geometries on the resulting biological patterns.
Design and evaluation of road pricing: state-of-the-art and methodological advances
Authors: Theodore Tsekeris, Stefan Voβ
Venue: Netnomics (2009)

This article provides an in-depth review of the state-of-the-art and describes methodological advances in the design and evaluation of road network pricing schemes. A number of paradigm shifts from the two polar cases of the marginal social cost pricing of road traffic congestion and revenue-maximizing road toll pricing are analyzed, as induced by the need to address realistic design complexities and constraints. The crucial role of the joint consideration of pricing strategies with optimal capacity provision and several network management measures is manifested and an integrated evaluation framework is suggested to incorporate a wide range of road pricing impacts into the scheme design process.
Concurrent design of product modules structure and global supply chain configurations
Authors: H. A. ElMaraghy, N. Mahmoudi
Venue: International Journal of Computer Integrated Manufacturing (2008)

'Supply chain management' deals with the coordination and integration of the interactions among its members. It encompasses integration of functional and geographical considerations as well as tactical and operational decisions. In this paper, the effect of product modules structure on the corresponding globally distributed supply chain configuration is studied. The currency exchange rates affect the overall allocation cost (production, inventory, and transportation). An integer linear decision support model is developed to determine the optimal location of global supply chain nodes, by simultaneously considering the currency exchange rate at various sites and the optimal modular product structure to be used in order to minimise the total cost. An automobile wiper system was used to illustrate the use of the model and the effect of including the currency exchange rate, varying the product modular structure and employing postponement strategies in a global supply chain configuration. The application of this approach is also useful in managing the challenges arising from prevailing trade barriers, financial systems in different regions as well as protecting intellectual property.
A perception-based estimation of uncertainty and its application to financial portfolios
Authors: Yuji Yoshida
Venue: Proceedings of the 7th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics (2008)

A risk-minimizing portfolio model under uncertainty with randomness and fuzziness is discussed. By a perception-based extension of estimations for fuzzy random variables, the risk-minimizing portfolio problem is developed. In the uncertainty model, the randomness and fuzziness are evaluated respectively by the probabilistic expectation and mean values with evaluation weights and λ-mean functions. The means, variances and the measurements of fuzziness for fuzzy numbers/fuzzy random variables are applied in the possibility case and the necessity case, and a risk estimation is derived from both random factors and fuzzy factors in the model. By quadratic programming approach, we derive a solution of the risk-minimizing portfolio problem. It is shown that the solution is a tangency portfolio. A numerical example is given to illustrate our idea.
Note: A note on the minimum bounded edge-partition of a tree
Authors: Shane Dye
Venue: Discrete Applied Mathematics (2009)

Minimum bounded edge-partition divides the edge set of a tree into the minimum number of disjoint connected components given a maximum weight for any component. It is an adaptation of the uniform edge-partition of a tree. An optimization algorithm is developed for this NP-hard problem, based on repeated bin packing of inter-related instances. The algorithm has linear running time for the class of 'balanced trees' common for the stochastic programming application which motivated investigation of this problem. Fast 2-approximation algorithms are formed for general instances by replacing the optimal bin packing with almost any bin packing heuristic. The asymptotic worst-case ratio of these approximation algorithms is never better than the absolute worst-case ratio of the bin packing heuristic used.