ppxscal/embedding_network huggingface dataset:
Model variables: cleanly supporting abstraction in design by contract: Research Articles
Authors: Yoonsik Cheon, Gary Leavens, Murali Sitaraman, Stephen Edwards
Venue: Software&mdash;Practice Experience (2005)

In design by contract (DBC), assertions are typically written using program variables and query methods. The lack of separation between program code and assertions is confusing, because readers do not know what code is intended for use in the program and what code is only intended for specification purposes. This lack of separation also creates a potential runtime performance penalty, even when runtime assertion checks are disabled, due to both the increased memory footprint of the program and the execution of code maintaining that part of the program's state intended for use in specifications. To solve these problems, we present a new way of writing and checking DBC assertions without directly referring to concrete program states, using &lsquo;model&rsquo;, i.e. specification-only, variables and methods. The use of model variables and methods does not incur the problems mentioned above, but it also allow one to write more easily assertions that are abstract, concise, and independent of representation details, and hence more readable and maintainable. We implemented these features in the runtime assertion checker for the Java Modeling Language (JML), but the approach could also be implemented in other DBC tools. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Selected AI-Related Dissertations
Authors: Susanne M. Humphrey, Bob Krovetz
Venue: Issue 107 (January 1989) (1989)

The following are citations selected by title and abstract as being related to AI, resulting from a computer search, using the BRS Information Technologies retrieval service, of the Dissertation Abstracts International (DAI) database produced by University Microfilms International.The online file includes abstracts, which are not published in this listing, but the citations below do include the DAI reference for finding the abstract in the published DAI. Other elements of the citation are author, university, degree, and, if available, number of pages; title; UM order number and year-month of DAI; and DAI subject category chosen by the author of the dissertation. References are sorted first by the initial DAI subject category and second by the author. In addition the database includes masters abstracts, denoted by MAI (Masters Abstracts International) instead of DAI as the reference to the abstract in the published MAI.Unless otherwise specified, paper or microform copies of dissertations may be ordered from University Microfilms International, Dissertation Copies, Post Office Box 1764, Ann Arbor, MI 48106; telephone for U.S. (except Michigan, Hawaii, Alaska): 1-800-521-3042, for Canada: 1-800-268-6090. Price lists and other ordering and shipping information are in the introduction to the published DAI.
A Serial-parallel robotic architecture for surgical tasks
Authors: Giuseppe Carbone, Marco Ceccarelli
Venue: Robotica (2005)

In this paper the concept of a serial-parallel macro-milli manipulator is presented for medical applications by investigating the feasibility of combining two different robotic structures into one system. The combination of the two structures can be used as a redundant system in which stiffness, singularity and accuracy can be optimized as related to workspace demands and restrictions that are required for a priori selected medical applications. A case study has been experienced at LARM (Laboratory of Robotics and Mechatronics) at the University of Cassino through a new system composed of a commercial Adept COBRA and CaPaMan2bis (Cassino Parallel Manipulator 2bis). The performance of this system is compared with a previous serial-parallel macro-milli robotic system also developed at LARM in Cassino. Experimental tests have been carried out in order to characterize the proposed systems.
Experimental Study on Self-organized and Error Resistant Control of Distributed Autonomous Robotic Systems
Authors: J. Starke, T. Kaga, M. Schanz, T. Fukuda
Venue: International Journal of Robotics Research (2005)

The assignment of distributed mobile autonomous robots to targets, which occurs for instance as an important task in flexible manufacturing environments, is solved by using a self-organization approach motivated by pattern formation principles in biological, chemical, and physical systems. Similar to observations in many natural systems, such as ant tribes, the pattern formation of colored shells or convection patterns in the Rayleigh-B&#233;nard problem of fluid dynamics, the self-organization principles lead to a robust and fault tolerant behavior where the patterns or structures recover from disturbances. The considered problem is the dynamic assignment of a number of robots to given targets where the mobile robots have to move to the targets in order to perform some tasks there. Hereby, each robot uses only local information (i.e., no world coordinate system is necessary). The underlying mathematical problem of the robot-target assignment is the so-called two-index assignment problem from combinatorial optimization. The approach used guarantees always feasible solutions in the assignment of robotic units to targets. As a consequence, for scenarios with only convex obstacles with large enough distances to each other, no spurious states cause the assignment process to fail. The error resistant control method for distributed autonomous robotic systems is demonstrated by several experiments with mobile robots. These results are compared and supplemented with computer simulations.
3D SSD Tracking with Estimated 3D Planes
Authors: Dana Cobzas, Peter Sturm
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

We present a tracking method where full camera position and orientation is tracked from intensity differences in a video sequence. The camera pose is calculated based on plane equations, and hence does not depend on point correspondences. The plane based formulation also allows additional constraints to be naturally added, e.g. perpendicularity between walls, floor and ceiling surfaces, co-planarity of wall surfaces etc. A particular feature of our method is that the full 3D pose change is directly computed from temporal image differences without making a commitment to a particular intermediate (e.g. 2D feature) representation. We experimentally compared our method with regular 2D SSD tracking and found it more robust and stable. This is due to 3D consistency being enforced even in the low level registration of image regions. This yields better results than first computing (and hence committing to) 2D image features and then from these compute 3D pose.
Interconnect delay minimization through interlayer via placement in 3-D ICs
Authors: Vasilis F. Pavlidis, Eby G. Friedman
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

The dependence of the propagation delay of the interlayer 3-D interconnects on the vertical through via location and length is investigated. For a variable vertical through via location, with fixed vertical length, the optimum vertical through via location that minimizes the propagation delay of an interconnect line connecting two circuits on different planes is determined. The optimum vertical through via location and length or, equivalently, the number of physical planes traversed by the vertical through via, are determined for varying the placement of the connected circuits. Design expressions for the optimal via locations and lengths have been developed to support placement and routing algorithms for 3-D ICs.
Evolutionary Search for Faces from Line Drawings
Authors: Jianzhuang Liu, Xiaoou Tang
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2005)

Single 2D line drawing is a straightforward method to illustrate 3D objects. The faces of an object depicted by a line drawing give very useful information for the reconstruction of its 3D geometry. Two recently proposed methods for face identification from line drawings are based on two steps: finding a set of circuits that may be faces and searching for real faces from the set according to some criteria. The two steps, however, involve two combinatorial problems. The number of the circuits generated in the first step grows exponentially with the number of edges of a line drawing. These circuits are then used as the input to the second combinatorial search step. When dealing with objects having more faces, the combinatorial explosion prevents these methods from finding solutions within feasible time. This paper proposes a new method to tackle the face identification problem by a variable-length genetic algorithm with a novel heuristic and geometric constraints incorporated for local search. The hybrid GA solves the two combinatorial problems simultaneously. Experimental results show that our algorithm can find the faces of a line drawing having more than 30 faces much more efficiently. In addition, simulated annealing for solving the face identification problem is also implemented for comparison.
Flash Memory Built-In Self-Diagnosis with Test Mode Control
Authors: Jen-Chieh Yeh, Yan-Ting Lai, Yuan-Yuan Shih, Cheng-Wen Wu, Chien-Hung Ho, Yen-Tai Lin
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

The objective of this paper is to present a cost-effective fault diagnosis methodology for flash memory. Flash memory is enjoying a rapid market growth. The research for flash memory testing is mainly to reduce the test cost and improve the production yield. In this paper, we propose a fault diagnosis flow for flash memory. We also propose a flexible built-in self-diagnosis (BISD) design with enhanced test mode control, which reduces the test time and diagnostic data shift-out cycles by using parallel programming and erasure and employing a parallel shift-out mechanism. The area overhead of our BISD circuit is only about 0.5% for a 256Mb commodity flash memory chip. Experimental results from industrial chips show that the proposed diagnosis methodology has high accuracy in distinguishing the fault type.
A new NAND-type flash memory package with smart buffer system for spatial and temporal localities
Authors: Jung-Hoon Lee, Gi-Ho Park, Shin-Dug Kim
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2005)

This research is to design a high performance NAND-type flash memory package with a smart buffer cache that enhances the exploitation of spatial and temporal locality. The proposed buffer structure in a NAND flash memory package, called as a smart buffer cache, consists of three parts, i.e., a fully-associative victim buffer with a small page size, a fully-associative spatial buffer with a large page size, and a dynamic fetching unit. This new NAND-type flash memory package can achieve dramatically higher performance and lower power consumption compared with any conventional NAND-type flash memory module. Our results show that the NAND flash memory package with a smart buffer cache can reduce the miss ratio by around 70% and the average memory access time by around 67%, over the conventional NAND flash memory configuration. Also, the average miss ratio and the average memory access time of the package module with smart buffer cache for a given buffer space (e.g., 3 KB) can achieve better performance than package modules with a conventional direct-mapped buffer with eight times (e.g., 32 KB) or than a fully-associative configuration with twice as much space (e.g., 8 KB).
Tangible UIs for media control: probes into the design space
Authors: Andreas Butz, Michael Schmitz, Antonio Krüger, Harald Hullmann
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

In a student project over the summer of 2004 teams of computer science and product design students worked together to develop new forms of interfaces for media control in living room contexts. In this paper we describe the design process from collecting first ideas of design choices and iteratively evolving (low- fidelity) prototypes to fully functional products, partially even meeting mass production requirements. We discuss how the interdisciplinary collaboration influenced the creative process in such a way, that the solutions were more realistic than purely design- informed solutions and more inspired than purely technology- informed ones. We experienced that the combination of skills lead to a much more focused design process, which produced fully functional prototypes in a short time. The resulting designs include one interface installed in the room, two autonomous interaction objects which can be freely moved around, and a two- handed inter- face. While these are only small spotlights into a large design space, they nicely show the possible diversity. We also learned that fully functional and aesthetically pleasing prototypes can be developed with technologically relatively simple means.
An agent system for ontology sharing on WWW
Authors: Kotaro Nakayama, Takahiro Hara, Shojiro Nishio
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Semantic Web Services (SWS), a new generation WWW technology, will facilitate the automation of Web service tasks, including automated Web service discovery, execution, composition and mediation by using XML based metadata and ontology. There have been several efforts to build knowledge representation languages for Web Services. However, only few attempts have so far been made to develop applications based on SWS. Especially, front-end agent systems for users are one of the urgent research areas. The purpose of this paper is to introduce our new integrated front-end agent system for ontology management and SWS management.
Neuro-fuzzy knowledge processing in intelligent learning environments for improved student diagnosis
Authors: Regina Stathacopoulou, George D. Magoulas, Maria Grigoriadou, Maria Samarakou
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

In this paper, a neural network implementation for a fuzzy logic-based model of the diagnostic process is proposed as a means to achieve accurate student diagnosis and updates of the student model in Intelligent Learning Environments. The neurofuzzy synergy allows the diagnostic model to some extent "imitate" teachers in diagnosing students' characteristics, and equips the intelligent learning environment with reasoning capabilities that can be further used to drive pedagogical decisions depending on the student learning style. The neuro-fuzzy implementation helps to encode both structured and non-structured teachers' knowledge: when teachers' reasoning is available and well defined, it can be encoded in the form of fuzzy rules; when teachers' reasoning is not well defined but is available through practical examples illustrating their experience, then the networks can be trained to represent this experience. The proposed approach has been tested in diagnosing aspects of student's learning style in a discovery-learning environment that aims to help students to construct the concepts of vectors in physics and mathematics. The diagnosis outcomes of the model have been compared against the recommendations of a group of five experienced teachers, and the results produced by two alternative soft computing methods. The results of our pilot study show that the neuro-fuzzy model successfully manages the inherent uncertainty of the diagnostic process; especially for marginal cases, i.e. where it is very difficult, even for human tutors, to diagnose and accurately evaluate students by directly synthesizing subjective and, some times, conflicting judgments.
A Neural Approach for Fast Simulation of Flight Mechanics
Authors: Giorgio Valmorbida, Wen-Chi Lu, Felix Mora-Camino
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

Flight simulators have been part of aviation history since its beginning. With the development of modern aeronautics industry, flight simulators have gained an important place and the industry devoted to their manufacture has become significant. In the case of transportation aircraft, accurate mathematical models based on extensive experimental data have been developed by their manufacturers to optimise their aerodynamic and propulsive characteristics and to design efficient flight control systems. However, in the case of small general aviation aircraft this kind of knowledge is not commonly available and the design of accurate flight simulators can result in a tedious try and modify process until the simulator presents a qualitative behaviour close to the one of the real aircraft. This communication proposes through the use of neural networks a method to perform a direct estimation of the aerodynamic forces acting on aircraft. Artificial Neural networks appear to be an appropriate numerical technique to achieve the mapping of these continuous relationships and detailed aerodynamics and thrust models should become no more mandatory to produce accurate flight simulation software.
The image importance approach to human vision based image quality characterization
Authors: Anthony J. Maeder
Venue: Pattern Recognition Letters (2005)

Characterization of image quality is an elusive concept which has been approached in various ways, from quantitative methods based on signal and information theory, to subjective psychovisual or task related assessment. The productive application of these approaches depends closely on the purpose for which the image quality indication is needed, and in many cases the different approaches provide contradictory indications. No satisfactory model has been proposed which caters for a wide range of different purposes, nor for widely differing image properties. This paper describes a flexible approach based on the concept of image importance, which blends several methods together in a form which can be tuned to suit different applications which offers reasonable correlation with subjective results.
An enhanced recursive frequency splitting broadcasting algorithm for near video-on-demand services
Authors: Yu-Wei Chen
Venue: Information Processing Letters (2004)

This work presents a novel method for enhancing the recursive frequency splitting broadcasting algorithm proposed by Tseng et al. The proposed method outperforms the previous broadcasting methods in terms of the maximum waiting time, for the same number of channels.
Low-coordination topologies for redundancy in sensor networks
Authors: Rajagopal Iyengar, Koushik Kar, Suman Banerjee
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

Tiny, low-cost sensor devices are expected to be failure-prone and hence in many realistic deployment scenarios for sensor networks these nodes are deployed in higher than necessary densities to meet operational goals. In this paper we address the question of how nodes should be managed in such dense sensor deployments so that the network topology formed by the active sensors is able to provide connected-coverage to the entire area of interest and at the same time increase the lifetime of the network. In particular, we propose and study distributed, low-coordination node wakeup schemes to efficiently construct multiple independent (node-disjoint) sensor network topologies to achieve good fault tolerance. We propose and evaluate different distributed, random and pattern-based wakeup policies for sensor nodes to construct connected-covered topologies. Through analysis and simulations we demonstrate that in dense sensor deployment scenarios, these policies can construct near-optimal topologies (within 2.7% of the optimal) with zero coordination between nodes, as long as location information is available at the individual sensor nodes.Based on these observations, we develop and evaluate a few simple distributed, wakeup based topology construction algorithms that can realize similar performance bounds in realistic sensor deployments, with varying node densities. These algorithms differ in terms of the required level of coordination and the use of sensor location information, and generate connected-covered topologies efficiently, with very low message-exchange overhead.
Distributing the Encryption and Decryption of a Block Cipher
Authors: Keith M. Martin, Rei Safavi-Naini, Huaxiong Wang, Peter R. Wild
Venue: Designs, Codes and Cryptography (2005)

In threshold cryptography, the goal is to distribute the computation of basic cryptographic primitives across a number of nodes in order to relax trust assumptions on individual nodes, as well as to introduce a level of fault-tolerance against node compromise. Most threshold cryptography has previously looked at the distribution of public key primitives, particularly threshold signatures and threshold decryption mechanisms. In this paper, we look at the application of threshold cryptography to symmetric primitives, and in particular the encryption or decryption of a symmetric key block cipher. We comment on some previous work in this area and then propose a model for shared encryption / decryption of a block cipher. We will present several approaches to enable such systems and will compare them.
Design and evaluation of mProducer: a mobile authoring tool for personal experience computing
Authors: Chao-Ming (James) Teng, Chon-In Wu, Yi-Chao Chen, Hao-hua Chu, Jane Yung-jen Hsu
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

Personal experience computing is about computing support for recording, storing, retrieving, editing, analyzing, and sharing of personal experiences. In this paper, we present our design, implementation and evaluation of a mobile authoring tool called mProducer. mProducer enables a user to generate personal experience content using a mobile device anytime, anywhere. To address challenges in both limited system resources and user interface constraints on a mobile device, mProducer provides several innovative system techniques and UI designs. (1) The Storage Constrained Uploading (SCU) algorithm uploads large multimedia data to remote servers, in order to alleviate the problem of limited storage on a mobile device. (2) Sensor-Assisted Automated Editing utilizes a tilt sensor on the mobile device to automate the detection and removal of blurry frames resulting from excessive amount of camera shaking. This sensor-based solution requires small processing overhead, and it is considered a good alternative to computational-expensive image processing techniques for detecting shaking artifacts. (3) Map-based content management interface incorporates a GPS receiver on a mobile device to record location meta-data for each recording captured by a user, and enables easy, intuitive content navigation on a small screen. (4) Keyframe-based editing enables a user to edit content using only keyframes. We have conducted user studies to evaluate overall editing experience, user satisfaction in the editing quality, task performance time, ease-of-use, and learnability. The results of user studies have shown that keyframe-based editing works best with a storyboard interface. In general, users have found mProducer to be both fun and easy to use on a mobile device.