ppxscal/embedding_network huggingface dataset:
Targetted Improvements
Authors: Andre Oboler, Simon Lock, Ian Sommerville
Venue: Proceedings of the International Conference on Software Engineering Advances (2007)

In the creative environment where research takes place not everything can be improved. The creative "essence" of research must be undisturbed while "accident" wasted effort is reduced to a minimum. In this paper we discuss the types of knowledge at play in the research environment, introduce a new abstract model of knowledge, and using the model explain how we should focus our effort on research students and on particular types of knowledge transfer in order to gain an over all improvement in our research processes. Just as we teach to facilitate student learning, so too can we supervise, teach and guide to facilitate better and faster researching in our academic computer science departments.
The Crossing Number of Cartesian Products of Complete Bipartite Graphs K2,m with Paths Pn
Authors: Tang Ling, Lv Shengxiang, Huang Yuanqiu
Venue: Graphs and Combinatorics (2007)

Most results on the crossing number of a graph focus on the special graphs, such as Cartesian products of small graphs with paths Pn, cycles Cn or stars Sn. In this paper, we extend the results to Cartesian products of complete bipartite graphs K2,m with paths Pn for arbitrary m&#x00a0;&#x2265;&#x00a0; 2 and n&#x00a0;&#x2265;&#x00a0; 1.
TMR and Partial Dynamic Reconfiguration to mitigate SEU faults in FPGAs
Authors: Cristiana Bolchini, Antonio Miele, Marco D. Santambrogio
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

This paper presents the adoption of the Triple Modular Redundancy coupled with the Partial Dynamic Reconfiguration of Field Programmable Gate Arrays to mitigate the effects of soft errors in such class of device platforms. We propose an exploration of the design space with respect to several parameters (e.g., area and recovery time) in order to select the most convenient way to apply this technique to the device under consideration. The application to a case study is presented and used to exemplify the proposed approach.
Papiercraft: A gesture-based command system for interactive paper
Authors: Chunyuan Liao, François Guimbretière, Ken Hinckley, Jim Hollan
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

Paper persists as an integral component of active reading and other knowledge-worker tasks because it provides ease of use unmatched by digital alternatives. Paper documents are light to carry, easy to annotate, rapid to navigate, flexible to manipulate, and robust to use in varied environments. Interactions with paper documents create rich webs of annotation, cross reference, and spatial organization. Unfortunately, the resulting webs are confined to the physical world of paper and, as they accumulate, become increasingly difficult to store, search, and access. XLibris [Schilit et al. 1998] and similar systems address these difficulties by simulating paper with tablet PCs. While this approach is promising, it suffers not only from limitations of current tablet computers (e.g., limited screen space) but also from loss of invaluable paper affordances. In this article, we describe PapierCraft, a gesture-based command system that allows users to manipulate digital documents using paper printouts as proxies. Using an Anoto [Anoto 2002] digital pen, users can draw command gestures on paper to tag a paragraph, e-mail a selected area, copy selections to a notepad, or create links to related documents. Upon pen synchronization, PapierCraft executes the commands and presents the results in a digital document viewer. Users can then search the tagged information and navigate the web of annotated digital documents resulting from interactions with the paper proxies. PapierCraft also supports real time interactions across mix-media, for example, letting users copy information from paper to a Tablet PC screen. This article presents the design and implementation of the PapierCraft system and describes user feedback from initial use.
Reducing rank-maximal to maximum weight matching
Authors: Dimitrios Michail
Venue: Theoretical Computer Science (2007)

Given a bipartite graph G(V,E), V=A@?@?B where |V|=n,|E|=m and a partition of the edge set into r@?m disjoint subsets E=E"1@?@?E"2@?@?...@?@?E"r, which are called ranks, the rank-maximal matching problem is to find a matching M of G such that |M@?E"1| is maximized and given that |M@?E"1| is maximized, |M@?E"2| is also maximized, and so on. Such a problem arises as an optimization criteria over a possible assignment of a set of applicants to a set of posts. The matching represents the assignment and the ranks on the edges correspond to a ranking of the posts submitted by the applicants. The rank-maximal matching problem and several other optimization variants, e.g. fair matching and maximum cardinality rank-maximal matching, can be solved by a reduction to the weight matching problem in time O(rnmlogn). Recently, Irving et al. developed a combinatorial approach which improves the running time for the rank-maximal matching problem to O(min(n+r,rn)m). They raised the open questions on (a) whether such a running time can be achieved by the weight matching reduction and (b) whether such a running time can be achieved for the other variants of the problem. In this work we show how the reduction to the weight matching problem can also be used to achieve the same running time. Our algorithm is simpler and more intuitive.
Self-organization in manufacturing operations
Authors: Klaus Schild, Stefan Bussmann
Venue: Communications of the ACM (2007)

Giving workpieces an active role in searching for processing steps by available machines in a manufacturing system.
Ad-hoc top-k query answering for data streams
Authors: Gautam Das, Dimitrios Gunopulos, Nick Koudas, Nikos Sarkas
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

A top-k query retrieves the k highest scoring tuples from a data set with respect to a scoring function defined on the attributes of a tuple. The efficient evaluation of top-k queries has been an active research topic and many different instantiations of the problem, in a variety of settings, have been studied. However, techniques developed for conventional, centralized or distributed databases are not directly applicable to highly dynamic environments and on-line applications, like data streams. Recently, techniques supporting top-k queries on data streams have been introduced. Such techniques are restrictive however, as they can only efficiently report top-k answers with respect to a pre-specified (as opposed to ad-hoc) set of queries. In this paper we introduce a novel geometric representation for the top-k query problem that allows us to raise this restriction. Utilizing notions of geometric arrangements, we design and analyze algorithms for incrementally maintaining a data set organized in an arrangement representation under streaming updates. We introduce query evaluation strategies that operate on top of an arrangement data structure that are able to guarantee efficient evaluation for ad-hoc queries. The performance of our core technique is augmented by incorporating tuple pruning strategies, minimizing the number of tuples that need to be stored and manipulated. This results in a main memory indexing technique supporting both efficient incremental updates and the evaluation of ad-hoc top-k queries. A thorough experimental study evaluates the efficiency of the proposed technique.
The politeness effect: Pedagogical agents and learning outcomes
Authors: Ning Wang, W. Lewis Johnson, Richard E. Mayer, Paola Rizzo, Erin Shaw, Heather Collins
Venue: International Journal of Human-Computer Studies (2008)

Pedagogical agent research seeks to exploit Reeves and Nass's media equation theory, which holds that users respond to interactive media as if they were social actors. Investigations have tended to focus on the media used to realize the pedagogical agent, e.g., the use of animated talking heads and voices, and the results have been mixed. This paper focuses instead on the manner in which a pedagogical agent communicates with learners, i.e., on the extent to which it exhibits social intelligence. A model of socially intelligent tutorial dialog was developed based on politeness theory, and implemented in an agent interface within an online learning system called virtual factory teaching system. A series of Wizard-of-Oz studies was conducted in which subjects either received polite tutorial feedback that promotes learner face and mitigates face threat, or received direct feedback that disregards learner face. The polite version yielded better learning outcomes, and the effect was amplified in learners who expressed a preference for indirect feedback, who had less computer experience, and who lacked engineering backgrounds. These results confirm the hypothesis that learners tend to respond to pedagogical agents as social actors, and suggest that research should focus less on the media in which agents are realized, and place more emphasis on the agent's social intelligence.
New products Exhibited at the National Computer Conference June 5-8, Anaheim, California
Venue: Computer (1978)

Rair Microcomputers. New microcomputer from Rair's Black Box range is a fully integrated system with priority interrupts and DMA, integral single or dual minifloppy disk drives, and serial I/O ports operating at up to 19,200 baud, housed with its power supply in a desktop cabinet. Software includes operating system, Basic interpreter, and Fortran and Cobol compilers. 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
The Case for Multi-Tag RFID Systems
Authors: Leonid Bolotnyy, Gabriel Robins
Venue: Proceedings of the International Conference on Wireless Algorithms,Systems and Applications (2007)

Radio Frequency Identification (RFID) is a promis- ing technology for automated non-line-of-sight object identification. However, factors such as object occlu- sions, metal / liquid opaqueness, environmental con- ditions, and radio noise degrade the overall availabil- ity, reliability, and dependability of RFID systems. We show that simply increasing the number of read- ers does not adequately address these issues. Instead, we propose tagging each object with multiple tags, and provide definitive experimental data showing that this strategy dramatically improves the effectiveness of RFID systems in the face of radio noise and other in- terfering factors. We solidify the case for multi-tag RFID systems by addressing obstacles to reliable ob- ject detection, and analyzing how multi-tags improve tag detection, even in the presence of (radio-opaque) metals and liquids. We discuss applications that will benefit considerably from multi-tags, and propose care- ful RFID system design through the deployment of appropriate types of multi-tags and anti-collision al- gorithms. We also analyze the economics of multi-tag RFID systems and argue that the benefits of multi-tags can substantially outweigh the costs in many current applications, and that this trend will become even more pronounced in the future.
VOLTINT: A Matlab®-based program for semi-automated processing of geochemical data acquired by voltammetry
Authors: Gwendolyn Bristow, Martial Taillefert
Venue: Computers Geosciences (2008)

Recent progress has resulted in the development of advanced techniques to acquire geochemical information in situ in aquatic systems. Among these techniques, voltammetry has generated significant interest for its ability to detect several important redox-sensitive chemical species in a fast, reliable, and automated manner. Many research groups worldwide have now adopted these techniques for geochemical measurements in various marine and freshwater systems, including water column, sediment, microbial mat, and groundwater, with a high spatial and temporal resolution. Unfortunately, the ability to conduct multiple measurements with great spatial and temporal resolutions generates large data sets that are difficult to integrate manually. We report a new computer program, voltammetric integration software (VOLTINT), that can integrate large voltammetric data sets semi-automatically. This program implemented in Matlab^(R) is based on a graphical user interface to visualize and identify voltammetric signals. The program differentiates between voltammetric techniques and derives or integrates voltammetric signals to produce output data files containing the redox potentials, current intensities, and, when appropriate, peak surface areas of each electrochemical species that can be detected. VOLTINT was developed with the intention of integrating voltammetric data obtained with potentiostats from a specific company Analytical Instrument Systems, Inc. (AIS). However, the scripts can be easily altered to process any ASCII file containing voltammetric data. The details of the program are presented, and examples provided along with recommendations regarding the analysis of voltammetric data in the context of this program. VOLTINT is available free of charge to anyone who is interested in integrating multiple voltammetric data files in a fast and reliable manner.
Verifying Security Properties of Cryptoprotocols: A Novel Approach
Authors: Mohamed Saleh, Mourad Debbabi
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

We model security protocols as a game tree using concepts of game semantics. Using this model we ascribe semantics to protocols written in the standard simple arrow notation. According to the semantics, a protocol is interpreted as a set of strategies over a game tree that represents the type of the protocol. Moreover, in order to specify properties of the model, a logic that deals with games and strategies is developed. A tableau-based proof system is given for the logic, which can serve as a basis for a model checking algorithm. This approach allows us to model a wide range of security protocol types and verify different properties instead of using a variety of methods as is currently the practice. Furthermore, the analyzed protocols are specified using only the simple arrow notation heavily used by protocol designers and by practitioners.
LM2 A Logic Machine Minicomputer
Authors: T. H. Kehl
Venue: Computer (1975)

In 1963 Clark and Molnar1developed the LINC computer (Laboratory Instrument Computer), principally for use in biomedical research. Several of the features of this machine (autoindexing, LINC tapes, 12-bit word, data break) later appeared in the PDP-5 and, still later, in the PDP-8. It is probably fair to give Clark and Molnar credit for thus starting the minicomputer revolution.
Statistical segmentation of regions of interest on a mammographic image
Authors: Mouloud Adel, Monique Rasigni, Salah Bourennane, Valerie Juhan
Venue: EURASIP Journal on Advances in Signal Processing (2007)

This paper deals with segmentation of breast anatomical regions, pectoral muscle, fatty and fibroglandular regions, using a Bayesian approach. This work is a part of a computer aided diagnosis project aiming at evaluating breast cancer risk and its association with characteristics (density, texture, etc.) of regions of interest on digitized mammograms. Novelty in this paper consists in applying and adapting Markov random field for detecting breast anatomical regions on digitized mammograms whereas most of previous works were focused on masses and microcalcifications. The developed method was tested on 50 digitized mammograms of the mini-MIAS database. Computer segmentation is compared to manual one made by a radiologist. A good agreement is obtained on 68% of the mini-MIAS mammographic image database used in this study. Given obtained segmentation results, the proposed method could be considered as a satisfying first approach for segmenting regions of interest in a breast.
Key Feature and Rule-based Intrusion Detection for Wireless Sensor Networks
Authors: Haiguang Chen, Huafeng Wu, Xi Zhou, Chuanshan Gao
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

Wireless Sensor Networks (WSNs) have a wide application. However, they are of interest to adversaries and are susceptible to some types of attacks for they are deployed in unprotected environments. In this paper we use key feature and rule-based intrusions detection for WSNs. In our scheme, we investigate different defense rules and key features in WSNs to build efficient, accurate and effective Intrusion Detection Systems (IDSs). We also propose a moving window function method to gather the current activity data. The scheme fits the demands and restrictions of WSNs. The scheme does not need any cooperation among other monitor nodes. Simulation results show that we proposed IDSs is efficient and accurate.
Algorithms for Computing Minimal Unsatisfiable Subsets of Constraints
Authors: Mark H. Liffiton, Karem A. Sakallah
Venue: Journal of Automated Reasoning (2008)

Much research in the area of constraint processing has recently been focused on extracting small unsatisfiable "cores" from unsatisfiable constraint systems with the goal of finding minimal unsatisfiable subsets (MUSes). While most techniques have provided ways to find an approximation of an MUS (not necessarily minimal), we have developed a sound and complete algorithm for producing all MUSes of an unsatisfiable constraint system. In this paper, we describe a relationship between satisfiable and unsatisfiable subsets of constraints that we subsequently use as the foundation for MUS extraction algorithms, implemented for Boolean satisfiability constraints. The algorithms provide a framework with which many related subproblems can be solved, including relaxations of completeness to handle intractable instances, and we develop several variations of the basic algorithms to illustrate this. Experimental results demonstrate the performance of our algorithms, showing how the base algorithms run quickly on many instances, while the variations are valuable for producing results on instances whose complete results are intractably large. Furthermore, our algorithms are shown to perform better than the existing algorithms for solving either of the two distinct phases of our approach.
Face Recognition Based on Curvefaces
Authors: Jiulong Zhang, Zhiyu Zhang, Wei Huang, Yanjun Lu, Yinghui Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

A new method called curvefaces was firstly presented for face recognition, which is based on curvelet transform. Curvelet is the latest multiscale geometric analysis tool. Contrast to wavelet transform, curvelet transform directly takes edges as the basic representation elements and is anisotropic with strong direction. It is a multiresolution, band pass and directional function analysis method which is useful to represent the image edges and the curved singularities in images more efficiently. It yields a more sparse representation of the image than wavelet and ridgelet transform. In face recognition, the curvelet coefficients can better represent the main features of the faces. The support vector machine (SVM) can then be used to classify the images. SVM is based on the statistical learning theory and is especially valid for small sample set and can get high recognition rate. Multi-class SVM is employed in this paper. The simulation shows that the proposed method is better than wavelet based method.
Eigenstructure Assignment Based Flight Control for Advanced Fighter: An Optimization Based Approach
Authors: Yong Fan, Jihong Zhu, Chunning Yang, Zengqi Sun
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

An intelligent optimization approach is proposed for eigenstructure assignment (EA) via neural network (NN) adjusting the components of output vector autonomously. The Basic idea is to minimize the L2 norm of error between the desired vector and achievable vector using the designing freedom provided by EA technique. Besides, close-loop eigenvalues are also optimised within desired regions on the left-half complex plane according to the design objective to ensure both closed-loop stability and dynamical performance. With the proposed approach, additional closed-loop specifications such as decoupling of different modes and robustness can also be easily achieved. As a demonstration, application of the proposed approach to the designing of flight control law for an advanced fighter is discussed. The simulation results show good closed loop performance and validate the proposed intelligent optimization approach of EA technique.
A distributed, utility-based architecture for task assignment in tactical WSNS
Authors: Kangyuan Zhu, Stephen D. Patek
Venue: ACM SIGBED Review (2007)

This paper develops an architecture for task assignment in wireless sensor networks in support of tactical operations. Our approach is based on a mathematical framework, which, based on multi-attribute utility theory, allows mobile end-users to easily express the value (utility) that they would attach to sensor information based on features associated with the data. We have applied the utility-based architecture framework in the design of a distributed task assignment algorithm for a simple pursuit-evasion (patrol) scenario. Simulation studies based on this scenario show that in terms of mission-level objectives utility-based task assignment can significantly improve upon a baseline solution, in which each sensor indiscriminately reports all data to all available users.
Development recording support system stage adaptable (DRESS-SA) proposal based on a web service concept
Authors: Ai Muranishi, Kimio Shintani, Aki Kono, Hirohide Haga, Shigeo Kaneda
Venue: Proceedings of the sixth conference on IASTED International Conference Web-Based Education - Volume 2 (2007)

Recently, the diversification of children's education is advancing in Japan. Nursery schools are required to provide childcare that adapts to the features of each child's advancement. Furthermore nursery school teachers have to keep such documents as development records that assess each child's development status. However, these documents are written on paper. In this paper, we propose a development recording system called DRESS-SA that computerizes the recording of children's development. By using digitalized features, DRESS-SA provides growth stages adaptable to each child. By using DRESS-SA, teachers can recognize each child's development features more accurately and use the records for everyday childcare activities. This paper also proposes an extended version of DRESS-SA as a "web service" on the Internet. DRESS-SA provides APIs through which other clients can use the accumulated data of each nursery's DRESSSA. The Web service version of DRESS-SA provides a flexible application development platform for development recording systems.