ppxscal/embedding_network huggingface dataset:
Data mining in constrained random verification
Authors: Li-C. Wang
Venue:  (2008)

Functional verification is one of the most time-consuming steps in a typical design process. If a design bug is not discovered in the early stages through verification it can lead to a number of problems including silicon re-spins and costly product recalls. Since all but the most simplistic designs are likely to have many functional bugs, verification is going to remain a crucial part of the design process for the foreseeable future.Although functional verification cannot be completely replaced, its efficiency in terms of time and resources spend can be greatly improved by using advanced verification techniques like constrained-random and formal verification. Since simulation-based verification continues to be the dominant verification methodology, in this dissertation we investigate various ways we can improve the performance of simulation-based techniques. We especially focus on constrained-random verification.During simulation-based verification tremendous amounts of data is generated. In most cases even storing the generated data becomes a problem and this data is discarded to save storage space without performing detailed analysis. Instead of simply discarding the data, we are trying to develop scalable methods for analyzing this data to extract knowledge that can be used to increase the efficiency of functional verification. For this purpose, we turn our attention to data mining (and machine learning) community that has developed very successful techniques for a large variety of applications like customer behavior analysis, image processing and recommendation systems.The dissertation contains three different approaches for solving three different but related verification problems. First one is developing a simplified view of a design using simulation data. This approximate but simple view can then be used to generate tests for reaching certain coverage points. The second problem is extracting constraints that can be used to guide constrained-random verification to exercise certain functionality we are interested in. For the third problem we develop a model of our verification effort in the form of a support vector model. This model is then used for a number of applications like redundant test filtering.Although we borrow a large number of concepts from data mining, many of the existing techniques has to be modified to work with applications in functional verification. In some cases, like Boolean learning, we develop novel algorithms which take into account unique constraints posed by our applications. In others, we use algorithms such as association rule mining and support vector analyzes by considerably modifying them. All of the proposed techniques are shown to work by performing experiments on industrial designs like OpenSparc T1 Micro-processor.
Comparison between the electrical properties of atomic layer deposited thin ZrO2 films processed from cyclopentadienyl precursors
Authors: Salvador Dueñas, Helena Castán, Héctor García, Alfonso Gómez, Luis Bailón, Kaupo Kukli, Jaakko Niinistö, Mikko Ritala, Markku Leskelä
Venue: Microelectronic Engineering (2009)

Electrical characterization of zirconium oxide (ZrO"2) based metal-oxide-semiconductor (MOS) structures has been carried out. ZrO"2 films have been atomic layer deposited (ALD) by using novel cyclopentadienyl-based precursors, which have recently revealed themselves as very adequate in terms of thermal stability and high permittivity of the dielectrics deposited. Our results demonstrate good quality of the films, especially when mixed alkylamido-cyclopentadienyl precursors are used on SiO"2/Si substrates. Conduction mechanisms in these MIS capacitors were studied, with moderately or highly-doped silicon used as substrate.
A Computational Method for Obtaining Stackelberg Solutions to Noncooperative Two-Level Programming Problems through Evolutionary Multi-Agent Systems
Authors: Kosuke Kato, Masatoshi Sakawa, Takeshi Matsui, Hidenori Ohtsuka
Venue: Proceedings of the Third KES International Symposium on Agent and Multi-Agent Systems: Technologies and Applications (2009)

In management or public decision making, there often exist two decision makers (DMs) in the situation where one of them has the priority in decision over another. Such decision making situations are often formulated as two-level programming problems. Under the assumption that these DMs know the objective function and constraints for the other DM and do not have motivation to cooperate mutually, the Stackelberg solution is adopted as a reasonable solution. However, for even two-level linear programming problems as the simplest case, the problem solved to obtain Stackelberg solutions is a nonconvex programming problem with complex structures and is known as an NP-hard problem. In this paper, we propose an efficient approximate solution method for two-level programming problems based on an evolutionary multi-agent system.
Fostering Learning Communities based on Task Context
Authors: Niels Pinkwart
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This paper presents an approach to establish and support learning communities. Based on task context information (which is extracted from multiple sources) and relying on the documents users created as primary source of information, the concept of a “peer recommender system” is presented which internally makes use of a mixture of different similarity measures --including, e.g., archive distance measurements and ontology based techniques.
How to Cheat at Securing Your Network
Authors: Ido Dubrawsky
Venue: How To Cheat (2007)

Most System Administrators are not security specialists. Keeping the network secure is one of many responsibilities, and it is usually not a priority until disaster strikes. How to Cheat at Securing Your Network is the perfect book for this audience. The book takes the huge amount of information available on network security and distils it into concise recommendations and instructions, using real-world, step-by-step instruction. The latest addition to the bestselling "How to Cheat..." series of IT handbooks, this book clearly identifies the primary vulnerabilities of most computer networks, including user access, remote access, messaging, wireless hacking, media, email threats, storage devices, and web applications. Solutions are provided for each type of threat, with emphasis on intrusion detection, prevention, and disaster recovery. .Get an Introduction to AAASee how AAA is made up of three distinct but interdependent parts: access control, authentication, and auditing..Understand the Types of AttacksLearn about active attacks: network-based, application-based, and mixed threat, as well as passive attacks, password attacks, and code attacks. .Address Remote Access ProblemsTechnologies such as RAS servers, NAS, VPN, authentication servers like RADIUS, TACACS, and TACACS+, and others were designed to address the RAS problems. .Review Wireless TechnologiesUnderstand WAP and IEEE 802/11 WLAN wireless security methods..Web Servers are Critical Network ComponentsMake sure that they are as safe as possible and know the issues regarding Web services..Know the Differences Between Device-Based and Media-Based SecuritySee how wireless, modems, RAS, PBXs, and VPNs allow remote access to a computer or network..See the Concepts and Processes of OS and NOS HardeningTrack, evaluate, and install the appropriate OS patches, updates, service packs, and hotfixes in your system environment..Understand the Basics of CryptographySee how confidentiality, integrity, and authentication will help you..See the Components of a PKI SystemLean how CAs maintain and issue digital certificates, RAs handle the verification process, and more. 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
Making agents gaze naturally - does it work?
Authors: Ivo van Es, Dirk Heylen, Betsy van Dijk, Anton Nijholt
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

We investigated the effects of varying eye gaze behavior of an embodied conversational agent on the quality of human-agent dialogues. In an experiment we compared three versions of an agent: one with gaze behavior that is typically found to occur in human-human dialogues, one with gaze that is fixed most of the time, and a third version with random gaze behavior. The versions were found to yield significant differences in efficiency of the dialogues and in user satisfaction, amongst others.
TestFrame: An Approach to Structured Testing, 1st edition
Authors: Chris C. Schotanus
Venue:  (2009)

Over 12 years ago Logica started the development of TestFrame, a test method which enables organizations to develop and execute their tests in a structured way. Since then many new techniques have been developed, such as, most recently, "Service Oriented Architectures (SOAs)" or "Software as a Service (SaaS)" , requiring updates to test procedures and processes that seemed well-established. These trends have prompted Logica to update and renew the TestFrame method. Chris Schotanus new book takes into account the recent developments and his presentation is focused on supporting daily test practice. Every step within this structured test method is dealt with exhaustively, providing the reader with the necessary details for successful software testing. Yet his book will not only help test personnel to improve effectivity, it will also serve as a way to improve efficiency through its strong focus on reuse. This makes TestFrame the practical guide to testing information systems for everyone involved in software testing test developers, test managers, and staff charged with quality assurance.
Regional thermal and terrain modelling of the Afar Depression from MODIS multi-temporal monthly night LST data
Authors: George Ch. Miliaresis
Venue: International Journal of Remote Sensing (2009)

Multi-temporal MODIS thermal imagery isolates geothermal from seasonal land surface temperature (LST) variability in Afar Depression and identifies localized LST thermal anomalies during the September 2005 seismo-volcanic crisis. The interpretation of the monthly night annual imagery sequences and time series analysis proved that in the northern and the central parts, LST is maximized throughout the year. The two regions lie along the NW-SE trending Red Sea Propagator, which is the on-land southern termination of the Red Sea Rift. Linear regression analysis proved that LST variation is terrain elevation dependent. Terrain segmentation outlined 5 terrain classes. The localized geothermal activity during the September 2005 seismic-volcanic crisis activity in both Erta Ale and Dabbahu vicinity was revealed by combined terrain-LST modelling. The LST statistics of the segmented terrain classes revealed that in September 2005, a regional minor increase in LST also affected the four classes with positive elevation.
E-government evaluation: Citizen's perspective in developing countries
Authors: Sarmad Alshawi, Hamid Alalwany
Venue: Information Technology for Development (2009)

Like the evaluation of all other information systems initiatives, the evaluation of e-government in both theory and practice has proven to be important and complex. The complexity of evaluation is mostly due to the multiple perspectives involved, the difficulties of quantifying benefits, and the social and technical context of use. The importance of e-government evaluation is due to the enormous investment put in by governments for delivering e-government services and to the considerable pace of growing in the e-government field. However, despite the importance of the evaluation of e-government services, the literature shows that e-government evaluation is still an immature area in terms of development and management. This work is part of a research effort that aims to develop a rigorous and holistic evaluation framework for e-government systems. The main aim of this article is to develop evaluation criteria for an effective, adaptable, and reflective assessment of e-government systems from the citizen's perspective. Developing countries suffer from poor citizen utilization of their e-government initiatives, and the adoption of such criteria would positively contribute in enhancing government understanding of the factors that influence citizen utilization of e-government systems. Moreover, the criteria also can be used as means for providing valuable feedback for the planning of future e-government initiatives. &copy; 2009 Wiley Periodicals, Inc. Anastasia Papazafeiropoulou is the accepting Guest Editor for this article.
Set Cover Feature Selection for Text Categorisation and spam detection
Authors: Elias F. Combarro, Jose Ranilla, Manuel Roberto Berdasco, Elena Montanes, Irene Diaz
Venue: International Journal of Advanced Intelligence Paradigms (2009)

In this paper the performance of the Set Cover (SC) Feature Selection (FS) method for Text Categorisation (TC) and Spam Detection problems is studied. Several variants of the original method are presented either to overcome the drawback of the unbalanced problems which are usually present in TC or to increase the efficiency. The behaviour of the algorithm is tested on several collections. The experiments show these methods provide a great reduction in the dimensionality of the problem either keeping the effectiveness of the classification or causing just a slight decrease.
Rational Algebraic Curves: A Computer Algebra Approach, 1st edition
Authors: J. Rafael Sendra, Franz Winkler, Sonia Prez-Diaz
Venue:  (2007)

The central problem considered in this book is the determination of rational parametrizability of an algebraic curve, and, in the positive case, the computation of a good rational parametrization. This amounts to determining the genus of a curve, i.e. its complete singularity structure, computing regular points of the curve in small coordinate fields, and constructing linear systems of curves with prescribed intersection multiplicities. Various optimality criteria for rational parametrizations of algebraic curves are discussed. This book is mainly intended for graduate students and researchers in constructive algebraic curve geometry.
Negotiation criteria for multiagent resource allocation
Authors: Karthik Iyer, Michael n. Huhns
Venue: The Knowledge Engineering Review (2009)

Negotiation in a multiagent system is a topic of active interest for enabling the allocation of scarce resources among autonomous agents. This paper presents a discussion of the research on negotiation criteria, which puts in context the contributions to resource allocation from the fields of economics, mathematics, and multiagent systems. We group the criteria based on how they relate to each other as well as their historical origin. In addition, we present three new criteria: verifiability, dimensionality, and topology. The criteria are organized into five categories. The allocation category contains criteria concerning fairness and envy-freeness with respect to how resources are allocated to agents. The protocol category covers criteria for stability, strategy-proofness, and communication costs. The procedure category includes criteria about the complexity of allocation procedures. The resource category has criteria for the properties that various resources can take and how they affect allocation. The paper concludes with a discussion of the criteria for agent utility functions. The overall objectives of this paper are (1) to create a starting point for protocol engineering by future negotiation designers and (2) to enumerate the criteria and their measures that enable negotiation and allocation mechanisms to be compared objectively.
Fast algorithm for detecting the most unusual part of digital images with application to medical databases
Authors: Kostadin Koroutchev, E. Korutcheva
Venue: Proceedings of the 10th WSEAS international conference on Mathematical methods, computational techniques and intelligent systems (2008)

In this paper we introduce a fast algorithm that can detect the most unusual part of a digital image. The most unusual part of a given shape is defined as a part of the image that has the maximal distance to all non interesting shapes with the same form. The method is tested on two and three-dimensional images and have shown very good results without any predefined model. The results can be used to scan large image databases, as for example medical databases.
Design space exploration for 3-D cache
Authors: Yuh-Fang Tsai, Feng Wang, Yuan Xie, Narayanan Vijaykrishnan, Mary Jane Irwin
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

As technology scales, interconnects have become a major performance bottleneck and a major source of power consumption for sub-micro integrated circuit (IC) chips. One promising option to mitigate the interconnect challenges is 3-D ICs, in which a stack of multiple device layers are put together on the same chip. In this paper, we explore the architectural design of cache memories using 3-D circuits. We present a delay and energy model 3-D cache delay-energy estimation tool (3D-Cacti) to explore different 3-D design options of partitioning a cache. The tool allows partitioning of a cache across different device layers at various levels of granularity. The tool has been validated by comparing its results with those obtained from circuit simulation of custom 3-D layouts. We also explore the effects of various cache partitioning parameters and 3-D technology parameters on delay and energy to demonstrate the utility of the tool.
Robot trajectory optimization using approximate inference
Authors: Marc Toussaint
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to first compute an optimal (deterministic) trajectory and then solve a local linear-quadratic-gaussian (LQG) perturbation model to handle the system stochasticity. We present a new algorithm for this approach which improves upon previous algorithms like iLQG. We consider a probabilistic model for which the maximum likelihood (ML) trajectory coincides with the optimal trajectory and which, in the LQG case, reproduces the classical SOC solution. The algorithm then utilizes approximate inference methods (similar to expectation propagation) that efficiently generalize to non-LQG systems. We demonstrate the algorithm on a simulated 39-DoF humanoid robot.
Motion perception and the scene statistics of motion
Authors: Risto Miikkulainen, Wilson S. Geisler
Venue:  (2008)

Motion coding in the brain undoubtedly reflects the statistics of retinal image motion occurring in the natural environment. Measuring the statistics of motion in natural scenes is an important tool for building our understanding of how the brain works. Unfortunately, there are statistics that are either impossible or prohibitively difficult to measure. For this reason, it is useful to measure scene statistics in artificial movies derived from simulated environments. This is a novel and important methodological approach that allows us to ask questions about optimal coding that are impossible otherwise. This dissertation describes a course of research that develops this research methodology, the simulated scene statistical approach.This dissertation applied the artificial scene statistical approach to understanding the visual statistics of motion during navigation through forest environments. An environmental model of forest scenes was developed based on previously measured range and surface texture statistics. Spatiotemporal power spectra were measured in both simulated and natural scenes for the task of first person motion through a forest environment. These image statistics measurements helped validate the environmental model.Next, the environmental model was used to simulate across-domain statistics to study the ideal aperture size of motion sensors. It was found that across a variety of different scene conditions, the optimal aperture size of motion sensors increases with the speed to which the sensor is tuned. This is an important constraint for understanding both how the brain encodes motion as well as for designing computer motion detectors.This theoretical research inspired a psychophysical experiment estimating the receptive-field size of human foveal motion discrimination. It was found that for narrow-band stimuli the ideal aperture size increases with spatial frequency, but is unchanging with respect to velocity or temporal frequency. This dissertation shows an approach to the study of vision that has applications in psychophysics, neuroscience and computer vision. The emphasis on accurate and validated environmental models for simulating scene statistics can help improve our understanding of the structure and function of the human visual system and also help us build more accurate and robust computer vision systems.
On Newton-type methods for multiple roots with cubic convergence
Authors: H. H. H. Homeier
Venue: Journal of Computational and Applied Mathematics (2009)

We introduce two families of Newton-type methods for multiple roots with cubic convergence. A further Newton-type method for multiple roots with cubic convergence is presented that is related to quadrature. We also provide numerical tests that show that these new methods are competitive to other known methods for multiple roots.
A Parallel Computing Model for the Acceleration of a Finite Element Software
Authors: Pierre Montleau, Jose Maria Cela, Serge Moto Mpong, André Godinass
Venue: Proceedings of the 4th International Symposium on High Performance Computing (2009)

This paper presents the OpenMP parallelization of the Finite Element code LAGAMINE. It is a non-linear great deformations code for solid mechanics. The parallelization approach uses coarse grain: for the element loop, to build the stiffness matrix and for the direct solver, to compute the LU factorisation. Application is proposed to a stamping simulation.
Facade Structure Parameterization Based on Similarity Detection from Single Image
Authors: Hong-Ping Yan, Chun Liu, André Gagalowicz, Cédric Guiard
Venue: Proceedings of the 4th International Conference on Computer Vision/Computer Graphics CollaborationTechniques (2009)

In this paper, we reverse engineer facade design from single rectified image of existing building facade by the use of similarity and hierarchy features of man-made objects. The inferred design is encoded into parametric grammar rules, named as ArchSys, which draw a compact and semantically meaningful characterization of the building structure and can be considered to support the design of other architectures. Combining with Gradient-based Mutual Information measure, we propose a rough-fine template-based similarity detection method to extract the structure patterns in a hierarchical way, which reduces computation time while increases robustness of the whole system. Our approach can be applied to various architectural typologies to detect not only symmetrical features but also similar patterns in one facade image. A feedback loop is built to refine the facade structure analysis and rule sets' parameters. Experimental results illustrate that our method is of robustness and general applications.