ppxscal/embedding_network huggingface dataset:
From Philosophical to Industrial Logics
Authors: Moshe Y. Vardi
Venue: Proceedings of the 3rd Indian Conference on Logic and Its Applications (2009)

One of the surprising developments in the area of program verification is how ideas introduced by logicians in the early part of the 20th Century ended up yielding by the 21 Century industrial-standard property-specification languages. This development was enabled by the equally unlikely transformation of the mathematical machinery of automata on infinite words, introduced in the early 1960s for second-order logic, into effective algorithms for model-checking tools. This paper attempts to trace the tangled threads of this development.
On Nilpotent Matrices over Bounded Distributive Lattice
Authors: Li-Xia Song
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

In this paper, we study nilpotent matrices over bounded distributive lattice from the point of Graph. We will give some necessary and sufficient conditions for a nilpotent matrix over bounded distributive lattice A: h(A)=m,( h(A)=inf{m|A^m =O}), establish some important properties and give a method on how to determine a matrix is a non-nilpotent matrix.
Multi-state grid resource availability characterization
Authors: Brent Rood, Michael J. Lewis
Venue: Proceedings of the 8th IEEE/ACM International Conference on Grid Computing (2007)

The functional heterogeneity of non-dedicated computational grids will increase with the inclusion of resources from desktop grids, P2P systems, and even mobile grids. Machine failure characteristics, as well as individual and organizational policies for resource usage by the grid, will increasingly vary even more than they already do. Since grid applications also vary as to how well they tolerate the failure of the host on which they run, grid schedulers must begin to predict and consider how resources will transition between availability modes. Toward this goal, this paper introduces five availability states, and characterizes a Condor pool trace that uncovers when, how, and why its resources reside in, and transition between, these states. This characterization suggests resource categories that schedulers can use to make better mapping decisions. Simulations that characterize how a variety of jobs would run on the traced resources demonstrate this approach’s potential for performance improvement. A simple predictor based on the previous day’s behavior indicates that the states and categories are somewhat predictable, thereby supporting the potential usefulness of multi-state grid resource availability characterization.
Recognizing Multiple Objects via Regression Incorporating the Co-occurrence of Categories
Authors: Takahiro Okabe, Yuhi Kondo, Kris M. Kitani, Yoichi Sato
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

Most previous methods for generic object recognition explicitly or implicitly assume that an image contains objects from a single category, although objects from multiple categories often appear together in an image. In this paper, we present a novel method for object recognition that explicitly deals with objects of multiple categories coexisting in an image. Furthermore, our proposed method aims to recognize objects by taking advantage of a scene's context represented by the co-occurrence relationship between object categories. Specifically, our method estimates the mixture ratios of multiple categories in an image via MAP regression, where the likelihood is computed based on the linear combination model of frequency distributions of local features, and the prior probability is computed from the co-occurrence relation. We conducted a number of experiments using the PASCAL dataset, and obtained the results that lend support to the effectiveness of the proposed method.
Managing universal accessibility requirements in software-intensive projects
Authors: Demosthenes Akoumianakis
Venue: Software Process: Improvement and Practice (2009)

This article presents a reference framework and a consolidated overview of techniques aiming to advance universal access project management practices during the design and development of interactive software. The perspective adopted is that universal accessibility is a nonfunctional quality attribute, and as such, it requires suitable process-oriented support &lsquo;sensitive&rsquo; to the technical issues involved. Consequently, a frame of reference for managing universal accessibility in interactive software development projects is described in terms of a generic and configurable development process and a collection of methods addressing specific technical targets across the various stages of the proposed process. The proposed process builds upon the scenario-based perspective on systems development and unfolds stages involved in generating and articulating scenarios from quality attributes relevant to universal accessibility. The techniques presented cover a wide range of technical targets from requirements engineering for universal accessibility to design representations, platform integration, user interface prototyping and evaluation. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Meshfree Approximation Methods with MATLAB
Authors: Gregory F. Fasshauer
Venue:  (2007)

Meshfree approximation methods are a relatively new area of research, and there are only a few books covering it at present. Whereas other works focus almost entirely on theoretical aspects or applications in the engineering field, this book provides the salient theoretical results needed for a basic understanding of meshfree approximation methods. The emphasis here is on a hands-on approach that includes MATLAB routines for all basic operations. Meshfree approximation methods, such as radial basis function and moving least squares method, are discussed from a scattered data approximation and partial differential equations point of view. A good balance is supplied between the necessary theory and implementation in terms of many MATLAB programs, with examples and applications to illustrate key points. Used as class notes for graduate courses at Northwestern University, Illinois Institute of Technology, and Vanderbilt University, this book will appeal to both mathematics and engineering graduate students.
A high performance LDPC decoder for IEEE802.11n standard
Authors: Wen Ji, Yuta Abe, Takeshi Ikenaga, Satoshi Goto
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In this paper, we propose a partially-parallel irregular LDPC decoder for IEEE 802.11n standard. The design is based on a novel sum-delta message passing schedule to achieve high throughput and low area cost design. We further improve the design with pipeline structure and parallel computation. The synthesis result in TSMC 0.18 CMOS technology demonstrates that for (648,324) irregular LDPC code, our decoder achieves 7.5X improvement in throughput, which reaches 402 Mbps at the frequency of 200MHz, with 11% area reduction.
An AES Tightly Coupled Hardware Accelerator in an FPGA-based Embedded Processor Core
Authors: Arif Irwansyah, Vishnu P. Nambiar, Mohamed Khalil-Hani
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 02 (2009)

This paper presents the implementation of a tightly coupled hardware architectural enhancement to the Altera FPGA-based Nios II embedded processor. The goal is to accelerate Advanced Encryption Standard (AES) operations in 128, 192 and 256-bits, for application in a high-performance embedded system implementing symmetric key cryptography. The concept is to augment the embedded processor with a new custom instruction for encryption and decryption operations. In order to show the effectiveness of tightly coupled hardware implementation over coprocessor based approach, we have also realized the design in coprocessor approach using the same AES core. Experimental results show that for the encryption or decryption operations, real implementation with custom instructions and tightly coupled hardware is about 35% faster than the co-processor based hardware.
Power and Profit: Engineering in the Envelope
Authors: Ted Vucurevic
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

A convergence of opportunities and concerns has driven consumer and industrial buying behavior to put increasing value on electronic systems which offer significantly differentiated capabilities in the area of Power Effectiveness. As a direct result of this, engineering teams from Systems through Material Science have been motivated to drive the development of new capabilities that allow effective design of complex, power optimized systems. This keynote will explore the challenges and possible solutions for Engineering in the Envelope of these power optimized systems. 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
A scalable, parallel algorithm for maximal clique enumeration
Authors: Matthew C. Schmidt, Nagiza F. Samatova, Kevin Thomas, Byung-Hoon Park
Venue: Journal of Parallel and Distributed Computing (2009)

The problem of maximal clique enumeration (MCE) is to enumerate all of the maximal cliques in a graph. Once enumerated, maximal cliques are widely used to solve problems in areas such as 3-D protein structure alignment, genome mapping, gene expression analysis, and detection of social hierarchies. Even the most efficient serial MCE algorithms require large amounts of time to enumerate the maximal cliques in networks arising from these problems that contain hundreds, thousands, or larger numbers of vertices. The previous attempts to provide practical solutions to the MCE problem through parallel implementation have had limited success, largely due to a number of challenges inherent to the nature of the MCE combinatorial search space. On the one hand, MCE algorithms often create a backtracking search tree that has a highly irregular and hard-or-impossible to predict structure; therefore, almost any static decomposition of the search tree by parallel processors results in highly unbalanced processor execution times. On the other hand, the data-intensive nature of the MCE problem often makes naive dynamic load distribution strategies that require extensive data movement prohibitively expensive. As a result, good scaling of the overall execution time of parallel MCE algorithms has been reported for only up to a couple hundred processors. In this paper, we propose a parallel, scalable, and memory-efficient MCE algorithm for distributed and/or shared memory high performance computing architectures, whose runtime scales linearly for thousands of processors on real-world application graphs with hundreds and thousands of nodes. Its scalability and efficiency are attributed to the proposed: (a) representation of the search tree decomposition to enable parallelization; (b) parallel depth-first backtracking search to both constrain the search space and minimize memory requirement; (c) least stringent synchronization to minimize data movement; and (d) on-demand work stealing intelligently coupled with work stack splitting to minimize computing elements' idle time. To the best of our knowledge, the proposed parallel MCE algorithm is the first to achieve a linear scaling runtime using up to 2048 processors on Cray XT machines for a number of real-world biological networks.
Exploring awareness needs and information display preferences between coworkers
Authors: A.J. Bernheim Brush, Brian R. Meyers, James Scott, Gina Venolia
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Technology makes it possible to share many different types of information with coworkers. We conducted a large-scale survey (N=549) to better understand current sharing among coworkers, how people stay aware of collocated and remote coworkers, and whether their willingness to share different types of awareness information changes based on the location in which the information is displayed. Contrary to our expectations, the display location did not greatly affect what respondents were willing to share. Our results also suggest considerations for researchers building situated displays, as respondents had concerns about unintended viewers and encouraging people to visit their personal space when they were not present.
Exploring the impact of individualism and uncertainty avoidance in Web-based electronic learning: An empirical analysis in European higher education
Authors: Manuel J. Sánchez-Franco, Francisco J. Martínez-López, Félix A. Martín-Velicia
Venue: Computers Education (2009)

Our research specifically focuses on the effects of the national cultural background of educators on the acceptance and usage of ICT, particularly the Web as an extensive and expanding information base that provides the ultimate in resource-rich learning. Most research has been used North Americans as subjects. For this reason, we interviewed European educators from diverse cultures; in particularly, we analysed the cultural differences and their moderating effects on acceptance-based relationships between European universities: European Nordic culture in contrast to European-Mediterranean culture. The empirical results provided strong support for the hypotheses. Cultural differences have a significant impact on attitudes and behaviours towards using Web-based applications. The Nordic culture is driven more by instrumental factors and intrinsic enjoyment-based factors. On the other hand, the PSG-Mediterranean culture (Portugal, Spain and Greece) seems to regard the Web more as a means to a social end.
Tracked motion-based dental occlusion surface estimation for crown restoration
Authors: Jing-Jing Fang, Tai-Hong Kuo
Venue: Computer-Aided Design (2009)

This study presents a modelling method to generate individual occlusal surfaces utilizing the coupler points of opposing teeth as tracked from his/her chewing movements. An optical tracking device is used to track and collect discrete data from an individual's chewing movements. Accurate registration between the optical tracking system and the upper and lower dental casts is performed by use of a specially-designed tracking plate. A personalized occlusal surface is built from the extracted coupler points according to registered rigid body movements. The proposed theory-based modelling outcome provides crucial information for customized false teeth fabrication and, with higher analysis, could be used for diagnosis and biomechanical studies. The presented system overcomes many of the deficiencies and provides an alternative tool of the widely used conventional mechanical articulators in present-day dental clinics.
Weight Uniform Accuracy Estimates of Finite Difference Method for Poisson Equation, Taking into Account Boundary Effect
Authors: V. L. Makarov, L. I. Demkiv
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

Poisson equation in polyhedral domain &Omega;&thinsp;&sub;&thinsp;R n , n&thinsp;=&thinsp;2,3 with boundary &Gamma;, when Dirichlet conditions are given on all faces or on all but one where Neimann conditions are given, is considered. Traditional difference schemes with semi-constant steps along axes precisely approximate Dirichlet conditions hence it is expected that their accuracy order increases approaching to corresponding part of boundary &gamma;. This paper is dedicated to quantitative investigation of this boundary effect. It is also shown that analogous boundary effect in the mesh knots takes place also for finite-element method (super convergence).
Bayesian hidden Markov model for DNA sequence segmentation: A prior sensitivity analysis
Authors: Darfiana Nur, David Allingham, Judith Rousseau, Kerrie L. Mengersen, Ross McVinish
Venue: Computational Statistics Data Analysis (2009)

The sensitivity to the specification of the prior in a hidden Markov model describing homogeneous segments of DNA sequences is considered. An intron from the chimpanzee @a-fetoprotein gene, which plays an important role in embryonic development in mammals, is analysed. Three main aims are considered: (i) to assess the sensitivity to prior specification in Bayesian hidden Markov models for DNA sequence segmentation; (ii) to examine the impact of replacing the standard Dirichlet prior with a mixture Dirichlet prior; and (iii) to propose and illustrate a more comprehensive approach to sensitivity analysis, using importance sampling. It is obtained that (i) the posterior estimates obtained under a Bayesian hidden Markov model are indeed sensitive to the specification of the prior distributions; (ii) compared with the standard Dirichlet prior, the mixture Dirichlet prior is more flexible, less sensitive to the choice of hyperparameters and less constraining in the analysis, thus improving posterior estimates; and (iii) importance sampling was computationally feasible, fast and effective in allowing a richer sensitivity analysis.
A balanced scheduler for grid computing
Authors: A. J. Sánchez Santiago, A. J. Yuste, J. E. Muñoz Expósito, S. García Galá, S. Bruque
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

The recent enthusiasm in grid computing has given rise to a large amount of research on resource scheduling techniques for tasks in a workflow. Most of the work on resource scheduling is aimed to minimize the total response time for the entire workflow. In this paper we propose a new balanced scheduler that resolves a workflow using the idle cycles of each resource of the Grid. The workflow is based on iterative tasks that usually appear in optimization problems. Experimental results using balanced load scheduler show that it is possible to obtain an improved use of the resources in the Grid thorugh assigning more tasks to the resources that have more idle cycles. This strategy enables to adapt the length of a task to the computing capacity of each resource at any given moment. Furthermore, this scheduling strategy enables to execute all the tasks in a shorter time.
Course Web Sites and Student Engagement: ...a Statistical Inquiry
Authors: Marc Mayerson
Venue:  (2008)

How do course Web sites affect student engagement with the curriculum? Are there discernable correlations with educational theories of learning and engagement? What are the claims and goals of educational technologists? In this pioneering study, Dr. Marc Mayerson correlates nationally recognized standards of student engagement with course Web site design, content, and experience. Come along with six UCLA professors as they each use the Internet and course Web sites in their own unique way. Find out what students had to say about what they liked and didn't like. Read the survey results of 600 students and their engagement with both the Web site and their studies. Did course Web sites spark more interest in the subjects? Did they spark more study time? Did they deliver meaningful content not available in books and lectures? Do course Web sites really deliver what their proponents say they can?
An adaptive lighting system using the simulated annealing algorithm
Authors: Ovidiu Grigore, Inge Gavat, Corina Grigore, Marius Cotescu
Venue: Proceedings of the 8th conference on Simulation, modelling and optimization (2008)

In the frame of our European project, ALADIN, light is intended to be a support for the elderly, in order to enhance their daily performance. The performance is appreciated by activity specific values of psychophysiological parameters that can be modified by light. This paper presents and discusses the implementation of a light controller using the Simulated Annealing algorithm and analyses the test results obtained by running the system on two subjects.
Dreamweaver CS4 Digital Classroom, Pap/Cdr edition
Authors: Jeremy Osborn, Aquent Creative Team
Venue:  (2008)

Dreamweaver CS4 Digital Classroom is like having a personal instructor guiding readers through each lesson, while they work at their own pace. This book includes 13 self-paced lessons that let readers discover essential skills and explore new features and capabilities of Adobe Dreamweaver CS4. Each lesson is presented in full color with step-by-step instructions. Learning is reinforced with video tutorials and lesson files on a companion DVD that were developed by the same team of Adobe Certified Instructors and Dreamweaver experts who have created many of the official training titles for Adobe Systems. Each video tutorial is approximately five minutes long and demonstrates and explains the concepts and features covered in the lesson. This training package demonstrates how to design, develop, and maintain a fully functioning Web site. Coverage includes applying style sheets, using dynamic HTML, adding style with images and multimedia, publishing and maintaining a web site, using hyperlinks to navigate throughout a website or link to other sites on the Internet, and using databases to create dynamic websites. Jam-packed with information, this book takes users from the basics through intermediate level topics and helps readers find the information they need in a clear, approachable manner.
Reconstruction of the corrosion boundary for the Laplace equation by using a boundary collocation method
Authors: Fenglian Yang, Liang Yan, Ting Wei
Venue: Mathematics and Computers in Simulation (2009)

In this paper, we consider the identification of a corrosion boundary for the two-dimensional Laplace equation. A boundary collocation method is proposed for determining the unknown portion of the boundary from the Cauchy data on a part of the boundary. Since the resulting matrix equation is badly ill-conditioned, a regularized solution is obtained by employing the Tikhonov regularization technique, while the regularization parameter is provided by the generalized cross-validation criterion. Numerical examples show that the proposed method is reasonable and feasible.
Feature Level Fused Ear Biometric System
Authors: Badrinath G.S., Phalguni Gupta
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

In this paper, a feature-level fusion approach for improving the efficiency of ear image verification is proposed. SIFT is used to extract the features on a ear images at different pose, which is then merged according to a fusion rule to produce a single feature called the Fused Template. The similarity of SIFT extracted features of the live image and the enrolled user template in the database is measured by their Euclidean distance. IITK database is used to validate the performance of the proposed method. Comparing to non-fusion approach the fusion approach performs better in verification.
A look at making the ADP procurement process more efficient: temporary regulation 46
Authors: Roger J. Gorg, George N. Baird, Judith A. Parks
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

This paper represents the view of the authors and in no way is to be taken as an official Government or General Services Administration position on the subject matter. It represents the authors' experience in acquiring a computer system under existing Federal Procurement Regulations.