ppxscal/embedding_network huggingface dataset:
Reliable impurity trap memory with high charge trap efficiency using ultrathin SiO2 impurity host layer for nonvolatile memory application
Authors: Seungjae Jung, Man Chang, Seonghyun Kim, Joonmyung Lee, Chunhum Cho, Choongman Lee, Hyunsang Hwang
Venue: Microelectronic Engineering (2009)

We demonstrated reliable impurity trap memory (ITM) with high charge trap efficiency by incorporating only 1nm-SiO"2 impurity host layer (IHL) between Al"2O"3 diffusion barrier layer and blocking oxide. While the ITM without IHL showed significant retention degradation as the amount of Ti impurity increased from 0.7 to 3A for enlarging memory window, the ITM with IHL showed stable retention characteristic which is charge loss less than 1V after 10^4s at 85^oC. We postulated that the chemical reaction between Ti and SiO"2 induced three dimensionally-distributed impurity traps in IHL, which could result in the well-discrete stored charges in program mode.
The Components and Impact of Sponsored Search
Authors: Bernard J. Jansen, Theresa B. Flaherty, Ricardo Baeza-Yates, Lee Hunter, Brendan Kitts, Jamie Murphy
Venue: Computer (2009)

Sponsored search advertising has dramatically impacted search engines, consumers, and organizations, and will continue to do so in the foreseeable future.
How efficient networking can support collaborative decision making in enterprises
Authors: Ann-Victoire Pince, Patrick Humphreys
Venue: Proceeding of the 2008 conference on Collaborative Decision Making: Perspectives and Challenges (2008)

In today's global economy, and as a result of the complexity surrounding the working world, new ways of working are emerging. In particular, collaboration and networking gain increasing importance as they enable firms to face the new demands of a global economy. Within this context, it is necessary to understand how new ways of organising influence decision-making processes. This paper (i) explores the connection between networks and decision-making and (ii) tries to define how efficient networking can support reliable collaborative decision making.We argue that effective networking constitutes a fundamental support for decision-making. Our focus is on small and medium-sized companies where networking is particularly relevant because of their restricted means for action and resources. Our findings are based on seven semi-structured interviews, conducted within five French small and medium-sized companies. They confirm the allegation that enterprise decision-making is now embedded in network structures [3] and also offer a good basis for drawing guidelines, enabling effective networking and reliable decision-making.
Decision Processes for Trustworthy Software
Authors: Guenther Ruhe
Venue: Proceedings of the International Conference on Software Process: Trustworthy Software Development Processes (2009)

A recent survey done across different engineering domains has revealed that support of decision-making is one of the key motivations for performing process modeling. Decisions are focal points at all stages of the software development lifecycle. The appropriateness of decisions made about methods, tools, techniques, activities and resources is of pivotal importance for the success (or failure) of a project. The discipline of software engineering decision support studies the processes of facilitating "good decisions". Besides effectiveness and efficiency, transparency is a key characteristic of the "goodness" of decisions.This talk analyzes software engineering decision-making processes with emphasis on its transparency. From empirical studies it was shown that transparency of processes improves trustworthiness into solutions offered. This is especially true for solutions offered from decision support systems with comprehensive and complex computations done to generate candidate decision alternatives. More specifically, we discuss the transparency of decisions for the class of product release decision process. We provide the state-of-the art practice in this area and summarize existing research to address current deficits. Experience from a series of real-world projects in this area is analyzed from the perspective of how transparent processes have contributed to trustworthy software.
Cartesian contour: a concise representation for a collection of frequent sets
Authors: Ruoming Jin, Yang Xiang, Lin Liu
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

In this paper, we consider a novel scheme referred to as Cartesian contour to concisely represent the collection of frequent itemsets. Different from the existing works, this scheme provides a complete view of these itemsets by covering the entire collection of them. More interestingly, it takes a first step in deriving a generative view of the frequent pattern formulation, i.e., how a small number of patterns interact with each other and produce the complexity of frequent itemsets. We perform a theoretical investigation of the concise representation problem and link it to the biclique set cover problem and prove its NP-hardness. We develop a novel approach utilizing the technique developed in frequent itemset mining, set cover, and max k-cover to approximate the minimal biclique set cover problem. In addition, we consider several heuristic techniques to speedup the construction of Cartesian contour. The detailed experimental study demonstrates the effectiveness and efficiency of our approach.
Not-a-Bot: improving service availability in the face of botnet attacks
Authors: Ramakrishna Gummadi, Hari Balakrishnan, Petros Maniatis, Sylvia Ratnasamy
Venue: Proceedings of the 6th USENIX symposium on Networked systems design and implementation (2009)

A large fraction of email spam, distributed denial-of-service (DDoS) attacks, and click-fraud on web advertisements are caused by traffic sent from compromised machines that form botnets. This paper posits that by identifying human-generated traffic as such, one can service it with improved reliability or higher priority, mitigating the effects of botnet attacks. The key challenge is to identify human-generated traffic in the absence of strong unique identities. We develop NAB ("Not-A-Bot"), a system to approximately identify and certify human-generated activity. NAB uses a small trusted software component called an attester, which runs on the client machine with an untrusted OS and applications. The attester tags each request with an attestation if the request is made within a small amount of time of legitimate keyboard or mouse activity. The remote entity serving the request sends tshe request and attestation to a verifier, which checks the attestation and implements an application-specific policy for attested requests. Our implementation of the attester is within the Xen hypervisor. By analyzing traces of keyboard and mouse activity from 328 users at Intel, together with adversarial traces of spam, DDoS, and click-fraud activity, we estimate that NAB reduces the amount of spam that currently passes through a tuned spam filter by more than 92%, while not flagging any legitimate email as spam. NAB delivers similar benefits to legitimate requests under DDoS and click-fraud attacks.
The Mouth Articulatory Modelling and Phonosemantic Conceptualization as In-Formation of Human Language
Authors: Alexei Medvedev
Venue: Proceeding of the 2009 conference on Information Modelling and Knowledge Bases XX (2009)

The work claims the trilateral unity (sameness) of sound, thought, and mouth gesture in human speech. This fundamental principle allows modelling of the world's objects by analogy in their --mostly spatial --traits and the mouth gestures for the articulation of sounds. The phonosemes --a newly introduced term for the sounds of human speech as bearers of intrinsic meaning --appear to be universal across all human languages and comprise the multilingual diversity of word formation as various instances of the primordial conceptualization of knowledge as the in-formation, a sort of Mentalese.
Determination of the failure moments of a system as equilibrium points
Authors: Ilie Mitran
Venue: Proceedings of the 15th american conference on Applied mathematics (2009)

In the literature of specialty there are known many methods of analyzing the optimum moment to replace the equipments: prediction methods, min-max methods and methods concerning the use of renewal strategies (these are methods of probabilistic type that are also using elements of operational calculations). This work presents a modern viewing synthesis concerning the main problems about the optimal replacement timing, using a mathematical model based on probabilities and differential calculus. Practically, it is based on the graph associated to an operation / disturbance process, part of a system composed of several subsystems. It is built the system of equations with finite differences being associated to the corresponding system of differential equations. Laplace transformations are applied in order to find the solution of the system practically this represents the unavailabilities of the system components. The failure points of the system are easily obtained, being solutions of equations represented by the system reliability and components unavailabilities.
Identifying performance bottlenecks based on the local parameter tuning
Authors: Teruyoshi Zenmyo
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

In performance tuning of computing systems, identifying bottlenecks which limit the performance of the system is essential. A variety of factors can cause the bottleneck, and therefore, identification and removal of the bottleneck becomes complicated. This paper proposes a technique which supports identifying the bottleneck together with its cause. In the proposed technique, each component in the target system is automatically tuned by adjusting configuration parameters. The effect and the applicability of the parameter tuning are locally analyzed at each component to diagnose whether the bottleneck exists in the tuned component or not. The diagnosis results are collected from each component in the target system, and then, the bottleneck in the whole system can be identified. The bottleneck caused by resource shortages can be identified based on the applicability of the parameter tuning. The effect of the parameter tuning is useful to identify the bottleneck caused by the other external factors. Therefore, the cause of the bottleneck can be classified as either resource shortages or the other factors.
Clique: perceptually based, task oriented auditory display for gui applications
Authors: Gary Bishop
Venue:  (2008)

Screen reading is the prevalent approach for presenting graphical desktop applications in audio. The primary function of a screen reader is to describe what the user encounters when interacting with a graphical user interface (GUI). This straightforward method allows people with visual impairments to hear exactly what is on the screen, but with significant usability problems in a multitasking environment. Screen reader users must infer the state of on-going tasks spanning multiple graphical windows from a single, serial stream of speech. In this dissertation, I explore a new approach to enabling auditory display of GUI programs. With this method, the display describes concurrent application tasks using a small set of simultaneous speech and sound streams. The user listens to and interacts solely with this display, never with the underlying graphical interfaces. Scripts support this level of adaption by mapping GUI components to task definitions. Evaluation of this approach shows improvements in user efficiency, satisfaction, and understanding with little development effort. To develop this method, I studied the literature on existing auditory displays, working user behavior, and theories of human auditory perception and processing. I then conducted a user study to observe problems encountered and techniques employed by users interacting with an ideal auditory display: another human being. Based on my findings, I designed and implemented a prototype auditory display, called Clique, along with scripts adapting seven GUI applications. I concluded my work by conducting a variety of evaluations on Clique. The results of these studies show the following benefits of Clique over the state of the art for users with visual impairments (1-5) and mobile sighted users (6): (1) Faster, accurate access to speech utterances through concurrent speech streams. (2) Better awareness of peripheral information via concurrent speech and sound streams. (3) Increased information bandwidth through concurrent streams. (4) More efficient information seeking enabled by ubiquitous tools for browsing and searching. (5) Greater accuracy in describing unfamiliar applications learned using a consistent, task-based user interface. (6) Faster completion of email tasks in a standard GUI after exposure to those tasks in audio.
Extending the boundary of spreadsheet programming: Lessons learned from Chinese governmental projects
Authors: Xingliang Yu, Jing Li, Hua Zhong
Venue: Proceedings of the 2009 ICSE Workshop on Software Engineering Foundations for End User Programming (2009)

Spreadsheet is one of the most commonly used end user programming environments. As such, there has been significant effort made by researchers and the industry to develop techniques and tools to improve spreadsheets. In the course of developing spreadsheet-based applications in Chinese governmental projects, we found that enabling end-user to program on the all-in-one, hard-to-validate Chinese spreadsheet is a very challenging task. To do so, we construct system on MS Excel, and provide additional, yet customized, script language for end-user programming.
X3DOM: a DOM-based HTML5/X3D integration model
Authors: Johannes Behr, Peter Eschler, Yvonne Jung, Michael Zöllner
Venue: Proceedings of the 14th International Conference on 3D Web Technology (2009)

We present a model that allows to directly integrate X3D nodes into HTML5 DOM content. This model tries to fulfill the promise of the HTML5 specification, which references X3D for declarative 3D scenes but does not define a specific integration mode. The goal of this model is to ease the integration of X3D in modern web applications by directly mapping and synchronizing live DOM elements to a X3D scene model. This is a very similar approach to the current SVG integration model for 2D graphics. Furthermore, we propose a framework that includes a new X3D Profile for the DOM integration. This profile should make implementation simple, but in addition we show that the current X3D runtime model still scales well. A detailed discussion includes DOM integration issues like events, namespaces and scripting. We finally propose an implementation framework that should work with multiple browser frontends (e.g. Firefox and WebKit) and different X3D runtime backends. We hope to connect the technologies and the X3D/ W3C communities with this proposal and outline a model, how an integration without plugins could work. Moreover, we hope to inspire further work, which could lead to a native X3D implementation in browsers similar to the SVG implementations today.
Hybrid Branching
Authors: Tobias Achterberg, Timo Berthold
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

State-of-the-art solvers for Constraint Satisfaction Problems (CSP), Mixed Integer Programs (MIP), and satisfiability problems (SAT) are usually based on a branch-and-bound algorithm. The question how to split a problem into subproblems (branching) is in the core of any branch-and-bound algorithm. Branching on individual variables is very common in CSP, MIP, and SAT. The rules, however, which variable to choose for branching, differ significantly. In this paper, we present hybrid branching, which combines selection rules from all three fields.
Automatically finding patches using genetic programming
Authors: Westley Weimer, ThanhVu Nguyen, Claire Le Goues, Stephanie Forrest
Venue: Proceedings of the 2009 IEEE 31st International Conference on Software Engineering (2009)

Automatic program repair has been a longstanding goal in software engineering, yet debugging remains a largely manual process. We introduce a fully automated method for locating and repairing bugs in software. The approach works on off-the-shelf legacy applications and does not require formal specifications, program annotations or special coding practices. Once a program fault is discovered, an extended form of genetic programming is used to evolve program variants until one is found that both retains required functionality and also avoids the defect in question. Standard test cases are used to exercise the fault and to encode program requirements. After a successful repair has been discovered, it is minimized using structural differencing algorithms and delta debugging. We describe the proposed method and report experimental results demonstrating that it can successfully repair ten different C programs totaling 63,000 lines in under 200 seconds, on average.
Brief paper: H∞ filtering for rectangular discrete-time descriptor systems
Authors: João Y. Ishihara, Marco H. Terra, B. M. Espinoza
Venue: Automatica (Journal of IFAC) (2009)

This paper deals with the H"~ recursive estimation problem for general rectangular time-variant descriptor systems in discrete time. Riccati-equation based recursions for filtered and predicted estimates are developed based on a data fitting approach and game theory. In this approach, the nature determines a state sequence seeking to maximize the estimation cost, whereas the estimator tries to find an estimate that brings the estimation cost to a minimum. A solution exists for a specified @c-level if the resulting cost is positive. In order to present some computational alternatives to the H"~ filters developed, they are rewritten in information form along with the respective array algorithms.
Multiagent learning in large anonymous games
Authors: Ian A. Kash, Eric J. Friedman, Joseph Y. Halpern
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 2 (2009)

In large systems, it is important for agents to learn to act effectively, but sophisticated multi-agent learning algorithms generally do not scale. An alternative approach is to find restricted classes of games where simple, efficient algorithms converge. It is shown that stage learning efficiently converges to Nash equilibria in large anonymous games if best-reply dynamics converge. Two features are identified that improve convergence. First, rather than making learning more difficult, more agents are actually beneficial in many settings. Second, providing agents with statistical information about the behavior of others can significantly reduce the number of observations needed.
A multimodal technique for an embedded fingerprint recognizer in mobile payment systems
Authors: V. Conti, C. Militello, F. Sorbello, S. Vitabile
Venue: Mobile Information Systems (2009)

The development and the diffusion of distributed systems, directly connected to recent communication technologies, move people towards the era of mobile and ubiquitous systems. Distributed systems make merchant-customer relationships closer and more flexible, using reliable e-commerce technologies. These systems and environments need many distributed access points, for the creation and management of secure identities and for the secure recognition of users. Traditionally, these access points can be made possible by a software system with a main central server. This work proposes the study and implementation of a multimodal technique, based on biometric information, for identity management and personal ubiquitous authentication. The multimodal technique uses both fingerprint micro features (minutiae) and fingerprint macro features (singularity points) for robust user authentication. To strengthen the security level of electronic payment systems, an embedded hardware prototype has been also created: acting as self-contained sensors, it performs the entire authentication process on the same device, so that all critical information (e.g. biometric data, account transactions and cryptographic keys), are managed and stored inside the sensor, without any data transmission. The sensor has been prototyped using the Celoxica RC203E board, achieving fast execution time, low working frequency, and good recognition performance.
Query generation for retrieving data from distributed semistructured documents using a metadata interface
Authors: Guija Choe, Young-Kwang Nam, Joseph Goguen, Guilian Wang
Venue: Computer Languages, Systems and Structures (2009)

We describe a method for generating queries for retrieving data from distributed heterogeneous semistructured documents, and its implementation in the metadata interface DDXMI (distributed document XML metadata interchange). The proposed system generates local queries appropriate to local schemas from a user query over the global schema. The system constructs mappings between global schema and local schemas (extracted from local documents if not given), path substitution, and node identification for resolving the heterogeneity among nodes with the same label that often exist in semistructured data. The system uses Quilt as its XML query language. An experiment is reported over three local semistructured documents: 'thesis', 'reports', and 'journal' documents with 'article' global schema. The prototype was developed under Windows system with Java and JavaCC.
SPARTAN: A software tool for Parallelization Bottleneck Analysis
Authors: Mayank Agarwal, Matthew I. Frank
Venue: Proceedings of the 2009 ICSE Workshop on Multicore Software Engineering (2009)

The multicore era has brought to an end the trend of doubling single-thread performance with each generation of microprocessors. To continue scaling programmers must parallelize existing single-threaded applications. A lack of tools makes identifying program features and data-dependence relationships that bottleneck parallel performance a cumbersome ad-hoc task. This paper presents SPARTAN, a tool that analyzes single-threaded applications, and points out the data-dependences that are likely to pose bottlenecks to parallel performance. In addition SPARTAN ranks the bottlenecks by giving an estimate of their impact on performance, so that these can be fixed in an appropriate order. We validate SPARTAN by showing improved parallel speedup on a benchmark application when the identified bottlenecks are removed.