ppxscal/embedding_network huggingface dataset:
When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures
Authors: David C. Parkes
Venue: Proceedings of the 35th Conference on Current Trends in Theory and Practice of Computer Science (2009)

Computational mechanism design (CMD) seeks to understand how to design game forms that induce desirable outcomes in multi-agent systems despite private information, self-interest and limited computational resources. CMD finds application in many settings, in the public sector for wireless spectrum and airport landing rights, to Internet advertising, to expressive sourcing in the supply chain, to allocating computational resources. In meeting the demands for CMD in these rich domains, we often need to bridge from the theory of economic mechanism design to the practice of deployable, computational mechanisms. A compelling example of this need arises in dynamic combinatorial environments, where classic analytic approaches fail and heuristic, computational approaches are required. In this talk I outline the direction of self-correcting mechanisms, which dynamically modify decisions via "output ironing" to ensure truthfulness and provide a fully computational approach to mechanism design. For an application, I suggest heuristic mechanisms for dynamic auctions in which bids arrive over time and supply may also be uncertain.
Practice project management in website design: an experiential learning simulation
Authors: Mei-Fen Chen
Venue: ACM SIGGRAPH ASIA 2008 educators programme (2008)

The current literature suggests that experiential learning is a necessary component of formal instruction in higher education. The purpose of this project is to detail research how to blend experiential learning principles with project management into a real case of website design practice for the new age of electronic learning. Based on the conceptualization in experiential learning and Internet technology development, a teaching and learning project flows in the practice of web design development is designed to facilitate students in this process. A cohort group of students in Web Design class join this experimental scenario to implement the assigned project of creating a new website design. A total of six learning objectives were initiated, evaluated, and interpreted: creativity, skill sets, productivity, team work, deadlines, and client skills.
Ensembled support vector machines for human papillomavirus risk type prediction from protein secondary structures
Authors: Sun Kim, Jeongmi Kim, Byoung-Tak Zhang
Venue: Computers in Biology and Medicine (2009)

Infection by the human papillomavirus (HPV) is regarded as the major risk factor in the development of cervical cancer. Detection of high-risk HPV is important for understanding its oncogenic mechanisms and for developing novel clinical tools for its diagnosis, treatment, and prevention. Several methods are available to predict the risk types for HPV protein sequences. Nevertheless, no tools can achieve a universally good performance for all domains, including HPV and nor do they provide confidence levels for their decisions. Here, we describe ensembled support vector machines (SVMs) to classify HPV risk types, which assign given proteins into high-, possibly high-, or low-risk type based on their confidence level. Our approach uses protein secondary structures to obtain the differential contribution of subsequences for the risk type, and SVM classifiers are combined with a simple but efficient string kernel to handle HPV protein sequences. In the experiments, we compare our approach with previous methods in accuracy and F1-score, and present the predictions for unknown HPV types, which provides promising results.
Has Computational Linguistics Become More Applied?
Authors: Kenneth Church
Venue: Proceedings of the 10th International Conference on Computational Linguistics and Intelligent Text Processing (2009)

Where the field has been and where it is going? It is relatively easy to know where we have been, but harder (and more valuable) to know where we are going. The title of this paper, borrowed from Hull, Jurafsky and Martin (2008), suggests that applications have become more important, and that industrial laboratories will become increasingly prestigious.
The Neurophysiological Bases of Cognitive Computation Using Rough Set Theory
Authors: Andrzej W. Przybyszewski
Venue: Transactions on Rough Sets IX (2008)

A popular view is that the brain works in a similar way to a digital computer or a Universal Turing Machine by processing symbols. Psychophysical experiments and our amazing capability to recognize complex objects (like faces) in different light and context conditions argue against symbolic representation and suggest that concept representation related to similarities may be a more appropriate model of brain function. In present work, by looking into anatomical and neurophysiological basis of how we classify objects shapes, we propose to describe computational properties of the brain by rough set theory (Pawlak, 1992 [1]). Concepts representing objects physical properties in variable environment are weak (not precise), but psychophysical space shows precise object categorizations. We estimate brain expertise in classifications of the object's components by analyzing single cell responses in the area responsible for simple shape recognition ([2]). Our model is based on the receptive field properties of neurons in different visual areas: thalamus, V1 and V4 and on feedforward (FF) and feedback (FB) interactions between them. The FF pathways combine properties extracted in each area into a vast number of hypothetical objects by using "driver logical rules", in contrast to "modulator logical rules" of the FB pathways. The FB pathways function may help to change weak concepts of objects physical properties into their crisp classification in psychophysical space.
Brief paper: Identification of a modified Wiener-Hammerstein system and its application in electrically stimulated paralyzed skeletal muscle modeling
Authors: Er-Wei Bai, Zhijun Cai, Shauna Dudley-Javorosk, Richard K. Shields
Venue: Automatica (Journal of IFAC) (2009)

Electrical muscle stimulation demonstrates potential for restoring functional movement and preventing muscle atrophy after spinal cord injury (SCI). Control systems used to optimize delivery of electrical stimulation protocols depend upon mathematical models of paralyzed muscle force outputs. While accurate, the Hill-Huxley-type model is very complex, making it difficult to implement for real-time control. As an alternative, we propose a modified Wiener-Hammerstein system to model the paralyzed skeletal muscle dynamics under electrical stimulus conditions. Experimental data from the soleus muscles of individuals with SCI was used to quantify the model performance. It is shown that the proposed Wiener-Hammerstein system is at least comparable to the Hill-Huxley-type model. On the other hand, the proposed system involves a much smaller number of unknown coefficients. This has substantial advantages in identification algorithm analysis and implementation including computational complexity, convergence and also in real-time model implementation for control purposes.
A virtual screening study of the acetylcholine binding protein using a relaxed-complex approach
Authors: Arneh Babakhani, Todd T. Talley, Palmer Taylor, J. A. McCammon
Venue: Computational Biology and Chemistry (2009)

The nicotinic acetylcholine receptor (nAChR) is a member of the ligand-gated ion channel family and is implicated in many neurological events. Yet, the receptor is difficult to target without high-resolution structures. In contrast, the structure of the acetylcholine binding protein (AChBP) has been solved to high resolution, and it serves as a surrogate structure of the extra-cellular domain in nAChR. Here we conduct a virtual screening study of the AChBP using the relaxed-complex method, which involves a combination of molecular dynamics simulations (to achieve receptor structures) and ligand docking. The library screened through comes from the National Cancer Institute, and its ligands show great potential for binding AChBP in various manners. These ligands mimic the known binders of AChBP; a significant subset docks well against all species of the protein and some distinguish between the various structures. These novel ligands could serve as potential pharmaceuticals in the AChBP/nAChR systems.
SPECrate2006: Alternatives Considered, Lessons Learned
Authors: John L. Henning
Venue: Proceedings of the 2009 SPEC Benchmark Workshop on Computer Performance Evaluation and Benchmarking (2009)

Since 1992, SPEC has used multiple identical benchmarks to measure multi-processor performance. This "Homogeneous Capacity Method" (aka "SPECrate") has been criticized on the grounds that real workloads are not homogeneous. Nevertheless, SPECrate provides a useful window into how systems perform when stressed by multiple requests for similar resources. This paper reviews SPECrate's history, and several performance lessons learned using it: (1) a 4:1 performance gain for startup of a benchmark when I/O was reconfigured; (2) a benchmark that improved up to 2:1 when a TLB data structure was re-sized; and (3) a benchmark that improved by 52% after a change to NUMA page allocation. The SPEC CPU workloads usefully exposed several opportunities for performance improvement.
Bayesian parameter estimation of sinusoids with simulated annealing
Authors: D. Üstündag, M. Cevri
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

In this paper, we consider Bayesian analysis proposed by Bretthorst for estimating parameters from noisy data and combined it with a simulated annealing algorithm to obtain a global maximum of the posterior probability density of frequencies. Thus, this analysis offers different approach to finding parameter values through a directed, but random, search of the parameter space. For this purpose, we developed a Mathematica code of this Bayesian approach and used it for estimating parameters of sinusoids corrupted by random noise. The simulations results support the effectiveness of the method.
Human video textures
Authors: Matthew Flagg, Atsushi Nakazawa, Qiushuang Zhang, Sing Bing Kang, Young Kee Ryu, Irfan Essa, James M. Rehg
Venue: Proceedings of the 2009 symposium on Interactive 3D graphics and games (2009)

This paper describes a data-driven approach for generating photorealistic animations of human motion. Each animation sequence follows a user-choreographed path and plays continuously by seamlessly transitioning between different segments of the captured data. To produce these animations, we capitalize on the complementary characteristics of motion capture data and video. We customize our capture system to record motion capture data that are synchronized with our video source. Candidate transition points in video clips are identified using a new similarity metric based on 3-D marker trajectories and their 2-D projections into video. Once the transitions have been identified, a video-based motion graph is constructed. We further exploit hybrid motion and video data to ensure that the transitions are seamless when generating animations. Motion capture marker projections serve as control points for segmentation of layers and nonrigid transformation of regions. This allows warping and blending to generate seamless in-between frames for animation. We show a series of choreographed animations of walks and martial arts scenes as validation of our approach.
RISS: a generalized minicomputer relational data base management system
Authors: Dennis McLeod, Monte Meldman
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

With the recent growth in popularity of low cost, relatively powerful minicomputers, it is clear that associated data base management systems are required. Nearly all of the minicomputer systems that are currently available commercially have at most rudimentary data base management capabilities. Consequently, in this paper we discuss the design and implementation of a minicomputer relational data base management system: the Relational Inquiry and Storage System (RISS). RISS provides a "naive" user interface, to allow nonprogrammers to deal routinely with a data base without the aid of a programmer, as well as an applications program interface. These interfaces facilitate data base access, modification, and restructure. RISS is a generalized and context-adaptable system, but it maintains a degree of efficiency guaranteeing cost-effective operation.
Non-facial and non-verbal affective expression in appearance-constrained robots for use in victim management: robots to the rescue!
Authors: Cindy L. Bethel, Christine Bringes, Robin R. Murphy
Venue: Proceedings of the 4th ACM/IEEE international conference on Human robot interaction (2009)

This video presents a visual summary of large-scale, complex human study in Human-Robot Interaction (HRI) designed to evaluate whether humans would view interactions with two non-anthropomorphic robots more positively and calming when the robots were operated in an emotive mode versus a standard, non-emotive mode. The video presents actual participants' reactions, the study design, and images from search and rescue operations.
A New Paradigm in Image Indexing and Retrieval Using Composite Bitplane Signatures
Authors: Simon So, Clement Leung
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

A scheme based on Bitplane Signatures for fast image searching is presented. It makes use of Composite Bitplanes obtained from overlaying Bitplane Signatures to form Composite Bitplane Signatures. For large image databases, a hierarchical structure of Composite Bitplane Signatures can be used to provide ranked images without the need to compare and traverse all the images in the database as many existing retrieval methods do. To search a particular signature embedded in a Composite Bitplane Signature, we rank all the signatures not by the number of matched bits but by the least difference of 1 bits from the query signature. Experiments are performed using 1000 images to observe the behavior of Composite Bitplane Signatures under wavelets, and we have also determined the most suitable number of images for insertion into a composite bitplane signature for its efficient operation.
Short communication: Parallelisation of storage cell flood models using OpenMP
Authors: Jeffrey Neal, Timothy Fewtrell, Mark Trigg
Venue: Environmental Modelling Software (2009)

This paper describes the implementation and benchmarking of a parallel version of the LISFLOOD-FP hydraulic model based on the OpenMP Application Programming Interface. The motivation behind the study was that reducing model run time through parallelisation would increase the utility of such models by expanding the domains over which they can be practically implemented, allowing previously inaccessible scientific questions to be addressed. Parallel speedup was calculated for 13 models distributed over seven study sites and implemented on one, two, four and in selected cases eight processor cores. The models represent a range of previous applications from large area, coarse resolution models of the Amazon, to fine resolution models of urban areas, to orders of magnitude smaller models of rural floodplains. Parallel speedups were greater for larger model domains, especially for models with over 0.2-0.4 million cells where parallel efficiencies of up to 0.75 on four and eight cores were achieved. A key advantage of using OpenMP and an explicit rather than implicit model was the ease of implementation and minimal code changes required to run simulations in parallel.
Using association rules and particle swarm optimization approach for part change
Authors: Her-Shing Wang, Wei-Chang Yeh, Pei-Chiao Huang, Wei-Wen Chang
Venue: Expert Systems with Applications: An International Journal (2009)

This study proposed on applying the Association Rule to the corporate maintenance center database, to investigate common dysfunctions associated with proper product using the products as instructed, so as to alter product design including part change or redesign. Hence, it will increase product value and avoid risks associated with new product development including the spending of excessive time on product development, excessive development costs, and the creation of redundant products. Additionally, considering each performance factor for example, including cost, quality, delivery date, and so on, we construct a supplier evaluation and planning model, which uses Particle Swarm Optimization to identify the optimal solution to the problem of variable combination, to provide a basis for decision making. This study researched the utilization of currently available data by the corporation and analyzed this data to make it valuable, as well as identifying the most common failures so as to maximize the efficacy of alterations. The modern businesses must deal with vast quantities of information every day, and all wish to identify appropriate methods of dealing with highly competitive markets, and also use the evaluation of changes in product design to identify the approach that is cheapest and most profitable.
How the data processing industry has failed education
Authors: Thomas J. Cashman
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Many attribute the greatness of the United States as an industrial nation to the system of private and public education which has evolved in our country. Those of us in education like to point with pride to the fact that our system of education is designed to provide each individual in our society with the opportunity to make maximum use of his abilities and to actively pursue the career of his choice whether on the semi-skilled, technical, or professional level.
A generalised model of e-trading for gradual secret release fair exchange protocol
Authors: Debajyoti Konar, Chandan Mazumdar
Venue: International Journal of Electronic Security and Digital Forensics (2009)

In this article, we propose a generalised model of e-trading for the development of gradual secret release fair exchange protocols. Based on the model, the methodology is narrated to implement e-trading protocols that ensure fairness in true sense without using an additional trusted third party for which either party has to pay. The model provides the scope to include the correctness of the product, money atomicity and customer's anonymity properties within e-trading protocol. We conclude this article by indicating the area of applicability for the proposed model.
Tip Prefetching: Dealing with the Bit Rate Variability of Video Streams
Authors: Dong-Young Lee, Heon Y. Yeom
Venue: Proceedings of the 1999 IEEE International Conference on Multimedia Computing and Systems - Volume 02 (1999)

The bit rate variability of video streams is a difficult obstacle to make an efficient VOD server. It is a nuisance especially for deterministic systems, where resources are reserved to guarantee quality of service. We propose a novel way to deal with it, tip prefetching. Its main idea is prefetching parts of largest blocks in the buffer, leveling the amount of data being read from disks in each round. We also suggest a performance model, a method for deciding the prefetching horizon, and an adaptive scheme which adjusts the prefetching horizon according to the condition of the system. Our simulation results show that tip prefetching services up to 81\% more streams with the saved resource. Tip prefetching is a simple but powerful technique for deterministic VOD system servicing VBR streams.
Partial Order Reduction for State/Event LTL
Authors: Nikola Beneš, Lubos Brim, Ivana Černá, Jiri Sochor, Pavlina Vařeková, Barbora Zimmerova
Venue: Proceedings of the 7th International Conference on Integrated Formal Methods (2009)

Software systems assembled from a large number of autonomous components become an interesting target for formal verification due to the issue of correct interplay in component interaction. State/event LTL [1,2] incorporates both states and events to express important properties of component-based software systems.The main contribution of the paper is a partial order reduction technique for verification of state/event LTL properties. The core of the partial order reduction is a novel notion of stuttering equivalence which we call state/event stuttering equivalence. The positive attribute of the equivalence is that it can be resolved with existing methods for partial order reduction. State/event LTL properties are, in general, not preserved under state/event stuttering equivalence. To this end we define a new logic, called weak state/event LTL, which is invariant under the new equivalence.
Impact of piracy on innovation at software firms and implications for piracy policy
Authors: Jeevan Jaisingh
Venue: Decision Support Systems (2009)

In this paper, we look at how innovation in the presence of piracy is affected by the policy choice of alliances such as the Business Software Alliance (BSA). Surprisingly, we find that a stricter piracy policy, that increases the perceived cost to using pirated software for end-users, may in some cases lead to an increase in piracy, and a decrease in product quality. The implication for a social planner is that in a monopoly market, an increase in the policy variable, could act as a disincentive for innovation. In a competitive market an increase in the policy variable provides an incentive for innovation.
DNA duplex cage structures with icosahedral symmetry
Authors: N. E. Grayson, A. Taormina, R. Twarock
Venue: Theoretical Computer Science (2009)

A construction method for duplex cage structures with icosahedral symmetry made out of single-stranded DNA molecules is presented and applied to an icosidodecahedral cage. It is shown via a mixture of analytic and computer techniques that there exist realisations of this graph in terms of two circular DNA molecules. These blueprints for the organisation of a cage structure with a noncrystallographic symmetry may assist in the design of containers made from DNA for applications in nanotechnology.
On the Pheromone Update Rules of Ant Colony Optimization Approaches for the Job Shop Scheduling Problem
Authors: Dong Do Duc, Huy Q. Dinh, Huan Hoang Xuan
Venue: Proceedings of the 11th Pacific Rim International Conference on Multi-Agents: Intelligent Agents and Multi-Agent Systems (2008)

Ant Colony Optimization (ACO) system is an intelligent multi-agent system of the interacting artificial ants to solve the combinatorial optimization problems. Applying ACO approach in the typical NP-hard problem like job shop scheduling (JSS) problem is still an impressive and attractive challenge with the community. This paper proposes two improvements of ACO algorithm based on the convergence property of pheromone trails. Our improvements are better in both terms of accuracy and running time than the state-of-the-art Max-Min ant system by the simulation with the standard data sets.