ppxscal/embedding_network huggingface dataset:
Symbolic OBDD representations for mechanical assembly sequences
Authors: Tianlong Gu, Zhoubo Xu, Zhifei Yang
Venue: Computer-Aided Design (2008)

Assembly sequence planning is one typical combinatorial optimization problem, where the size of parts involved is a significant and often prohibitive difficulty. The compact storage and efficient evaluation of all the feasible assembly sequences is one crucial concern. Ordered binary decision diagram (OBDD) is a canonical form to represent and manipulate the Boolean functions efficiently, and appears to give improved results for large-scale combinatorial optimization problems. In this paper, subassemblies, assembly states and assembly tasks are represented as Boolean characteristic functions, and the symbolic OBDD representation of assembly sequences is proposed. In this framework, the procedures to transform directed graph and AND/OR graph into OBDDs are presented. The great advantage of OBDD-based scheme is that the storage space of OBDD-based representation of all the feasible assembly sequences does not increase with the part count of assembly dramatically so quickly as that of both directed graph and AND/OR graph do. We undertake many experimental tests using Visual C++ and CUDD package. It was shown that the OBDD scheme represented all the feasible assembly sequences correctly and completely, and outperforms either directed graph or AND/OR graph in storage efficiency.
An Empirical Study into Use of Dependency Injection in Java
Authors: Hong Yul Yang, Ewan Tempero, Hayden Melton
Venue: Proceedings of the 19th Australian Conference on Software Engineering (2008)

Over the years many guidelines have been offered as to how to achieve good quality designs. We would like to be able to determine to what degree these guidelines actually help. To do that, we need to be able to determine when the guidelines have been followed. This is often difficult as the guidelines are often presented as heuristics or otherwise not completely specified. Nevertheless, we believe it is important to gather quantitative data on the effectivenessof design guidelines wherever possible.In this paper, we examine the use of “Dependency Injection,” which is a design principle that is claimed to increase software design quality attributes such as extensibility, modifiability, testability, and reusability. We develop operational definitions for it and analysis techniques for detecting its use. We demonstrate these techniques by applying them to 34 open source Java applications.
Changing the corporate IT development model: tapping the power of grassroots computing
Authors: L. Cherbakov, A. Bravery, B. D. Goodman, A. Pandya, J. Baggett
Venue: IBM Systems Journal (2007)

The recent rise of grassroots computing among both professional programmers and knowledge workers highlights an alternative approach to software development in the enterprise: Situational applications are created rapidly by teams or individuals who best understand the business need, but without the overhead and formality of traditional information technology (IT) methods. Corporate IT will be increasingly challenged to facilitate the development, integration, and management of both situational and enterprise applications. In this paper, we describe the emerging prevalence of situational application development and the changing role of IT. We also describe the experience at IBM in building, deploying, and managing the IBM Situational Applications Environment that enables employees to take responsibility for some of their own solutions. Finally, we discuss ways in which the situational application development paradigm may evolve in coming years to benefit enterprises, the demands that it will put on IT departments, and possible ways to address these challenges.
Specification and runtime workflow support in the ASKALON Grid environment
Authors: Radu Prodan
Venue: Scientific Programming (2007)

We describe techniques to support the runtime execution of scientific workflows in the ASKALON Grid environment. We present a formal model and three middleware services that support in combination the effective execution in heterogeneous and dynamic Grid environments: performance prediction, scheduling, and enactment engine. We validate our techniques with concrete experimental results for two real-world applications executed in the Austrian Grid environment.
A freespace crossbar for multi-core processors
Authors: Michel N. Victor, Aris K. Silzars, Edward S. Davidson
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

A new package-level interconnect is described that adapts carbon nanoemissive display technology to create an inexpensive package-level freespace crossbar with single-cycle source-to-target latency. Interconnections are made using filamentary electron beams as the data transmission medium. The beams are electrostatically steered, enabling very large, low latency inter-chip crossbar networks. The crossbar and associated package are built entirely from existing technology. This paper describes the operation of the crossbar and presents a conceptual design for a processor that uses the crossbar.
Project based learning of embedded systems
Authors: Danco Davcev, Biljana Stojkoska, Slobodan Kalajdziski, Kire Trivodaliev
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

Traditional teaching, usually based on lectures and tutorials fosters the idea of instruction-driven learning model where students are passive listeners. Besides this approach, Project Based Learning (PBL) as a different learning paradigm is standing behind constructivism learning theory, where learning from real-world situations is put on the first place. The purpose of this paper is to present our approach in learning embedded systems at our University. It is based on combination of traditional (face-to-face) learning and PBL. Our PBL represents an interdisciplinary project based on wireless sensor monitoring of real-world environment (greenhouse). The students use UML that was shown as an excellent tool for developing such a projects. From the student perspective, we found that this high level of interdisciplinary is very valuable from the point of view of facing the students with real-life problems.
Annotating historical archives of images
Authors: Xiaoyue Wang, Lexiang Ye, Eamonn Keogh, Christian Shelton
Venue: Proceedings of the 8th ACM/IEEE-CS joint conference on Digital libraries (2008)

Recent initiatives like the Million Book Project and Google Print Library Project have already archived several million books in digital format, and within a few years a significant fraction of world's books will be online. While the majority of the data will naturally be text, there will also be tens of millions of pages of images. Many of these images will defy automation annotation for the foreseeable future, but a considerable fraction of the images may be amiable to automatic annotation by algorithms that can link the historical image with a modern contemporary, with its attendant metatags. In order to perform this linking we must have a suitable distance measure which appropriately combines the relevant features of shape, color, texture and text. However the best combination of these features will vary from application to application and even from one manuscript to another. In this work we propose a simple technique to learn the distance measure by perturbing the training set in a principled way. We show the utility of our ideas on archives of manuscripts containing images from natural history and cultural artifacts.
Implantable biomimetic electronics as neural prostheses for lost memory function
Authors: Theodore W. Berger
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

The talk presents results of a multi-disciplinary project that is developing a microchip-based neural prosthesis for the hippocampus, a region of the brain responsible for the formation of long-term memories. Damage to the hippocampus is frequently associated with epilepsy, stroke, and dementia (Alzheimer's disease), and is considered to underlie the memory deficits related to these neurological conditions. The essential goals of Dr. Bergers multi-laboratory effort include: 1. experimental study of neuron and neural network function - how does the hippocampus encode information? 2. formulation of biologically realistic models of neural system dynamics - can that encoding process be described mathematically to realize a predictive model of how the hippocampus responds to any event? 3. microchip implementation of neural system models - can the mathematical model be realized as a set of electronic circuits to achieve parallel processing, rapid computational speed, and miniaturization? 4. creation of hybrid neuron-silicon interfaces - can structural and functional connections between electronic devices and neural tissue be achieved for long-term, bi-directional communication with the brain? By integrating solutions to these component problems, we are realizing a microchip-based model of hippocampal nonlinear dynamics that can perform the same function as part of the hippocampus. Through bi-directional communication with other neural tissue that normally provides the inputs and outputs to/from a damaged hippocampal area, the biomimetic model could serve as a neural prosthesis. A proof-of-concept is presented in which the CA3 region of the hippocampal slice is surgically removed, and is replaced by a microchip model of CA3 nonlinear dynamics the "hybrid" hippocampal circuit displays normal physiological properties. Major strides also have been made in creating "hybrid electro-biological" systems in the behaving animal, and these are described as well.
A survey on querying encrypted XML documents for databases as a service
Authors: Ozan Ünay, Taflan I. Gündem
Venue: ACM SIGMOD Record (2008)

"Database as a service" paradigm has gained a lot of interest in recent years. This has raised questions about the security of data in the servers. Firms outsourcing their XML databases to untrusted parties started to look for new ways to securely store data and efficiently query them. In this paper, encrypted XML documents, their crypto index structures and query processing using these structures are investigated. A comparison of various algorithms in the literature is given.
Ad-hoc aggregations of ranked lists in the presence of hierarchies
Authors: Nilesh Bansal, Sudipto Guha, Nick Koudas
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

A variety of web sites and web based services produce textual lists at varying time granularities ranked according to several criteria. For example, Google Trends produces lists of popular query keywords which can be visualized according to several criteria. At Flickr, lists of popular tags used to tag the images uploaded can be visualized as a cloud based on their popularity. Identification of the k most popular terms can be easily conducted by utilizing well known rank aggregation algorithms. In this paper we take a different approach to information discovery from such ranked lists. We maintain the same rank aggregation framework but we elevate terms at a higher level by making use of popular term hierarchies commonly available. Under such a transformation we show that typical early stopping certificates available for rank aggregation algorithms are no longer applicable. Based on this observation, in this paper, we present a probabilistic framework for early stopping in this setting. We introduce a relaxed version of the rank aggregation problem involving a deterministic stopping condition with user specified precision. We introduce an algorithm pH -- RA for the solution of this problem. In addition we introduce techniques to improve the performance of pH -- RAeven further via precomputation utilizing a sparse set system. Through a detailed experimental evaluation using synthetic and real datasets we demonstrate the efficiency of our framework.
An occlusion metric for selecting robust camera configurations
Authors: Xing Chen, James Davis
Venue: Machine Vision and Applications (2008)

Vision based tracking systems for surveillance and motion capture rely on a set of cameras to sense the environment. The exact placement or configuration of these cameras can have a profound affect on the quality of tracking which is achievable. Although several factors contribute, occlusion due to moving objects within the scene itself is often the dominant source of tracking error. This work introduces a configuration quality metric based on the likelihood of dynamic occlusion. Since the exact geometry of occluders can not be known a priori, we use a probabilistic model of occlusion. This model is extensively evaluated experimentally using hundreds of different camera configurations and found to correlate very closely with the actual probability of feature occlusion.
Efficient mining of frequent closed XML query pattern
Authors: Jian-Hua Feng, Qian Qian, Jian-Yong Wang, Li-Zhu Zhou
Venue: Journal of Computer Science and Technology (2007)

Previous research works have presented convincing arguments that a frequent pattern mining algorithm should not mine all frequent but only the closed ones because the latter leads to not only more compact yet complete result set but also better efficiency. Upon discovery of frequent closed XML query patterns, indexing and caching can be effectively adopted for query performance enhancement. Most of the previous algorithms for finding frequent patterns basically introduced a straightforward generate-and-test strategy. In this paper, we present SOLARIA*, an efficient algorithm for mining frequent closed XML query patterns without candidate maintenance and costly tree-containment checking. Efficient algorithm of sequence mining is involved in discovering frequent tree-structured patterns, which aims at replacing expensive containment testing with cheap parent-child checking in sequences. SOLARIA* deeply prunes unrelated search space for frequent pattern enumeration by parent-child relationship constraint. By a thorough experimental study on various real-life data, we demonstrate the efficiency and scalability of SOLARIA* over the previous known alternative. SOLARIA* is also linearly scalable in terms of XML queries' size.
WaveScape: a practical robust display with a 3D gesture interface
Authors: W. Matthew Vieta, Matthew Bell
Venue: Proceedings of the 2008 workshop on Immersive projection technologies/Emerging display technologiges (2008)

WaveScape demonstrates a practical, gesture-based 3D interface that allows groups of unencumbered users to interact with content on a display at distances of up to 15ft. The challenges faced with a large scale deployment of a gesture-based interface in public are many. The system must be easy to produce, compact, and easy to install. The system must behave well in a variety of lighting conditions, and must operate for months with supervision. Furthermore, a public environment brings with it unique UI challenges; interfaces must be created which can be learned in just a few seconds. WaveScape addresses these challenges with a combination of unique hardware and software.
An Architecture for the Automatic Derivation of Imaging Equations for the Visualisation of Carotid Arterial Plaques
Authors: Matthew Burley, Kamal Bechkoum, Gillian Pearce
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

We present an architecture for the automated derivation of physical laws with specific reference to the generation of imaging equations for the analysis of carotid arterial plaques. Our computational approach is based upon an examination of the physical model in terms of information theory; the result, combined with an alternative notation for representing mathematical expressions is intended to facilitate the development of a system which will operate with maximum autonomy in deriving equations to map from data between multivariate domains.
Information system design and integrated enterprise modelling through a key-problem framework
Authors: Virginie Goepp, François Kiefer, Oscar Avila
Venue: Computers in Industry (2008)

In today's highly competitive global economy enterprise integration (EI) can take a major role in performance improvement. The more the scope of EI is enlarged, the more users, which are not integration experts, are involved. This fact generates communication problems. For the information system (IS), which remains the main integration vehicle, the situation is obviously similar. In this paper, it is proposed to analyse how an IS design approach, based on a key-problem framework, enables both to involve efficiently users and improve the design of a model of an integrated enterprise. These two points are developed through a cross-analysis of the works related to EI in both the enterprise modelling and information system design fields. They are then discussed and illustrated on a real case of integration of customer support, maintenance and design processes in a SME company that manufactures salt spreader components for snow clearing vehicles.
Design and fabrication using nanoimprint lithography of a nanofluidic device for DNA stretching applications
Authors: E. Abad, S. Merino, A. Retolaza, A. Juarros
Venue: Microelectronic Engineering (2008)

In this work, we present the design and fabrication of a sealed micro/nanofluidic chip for DNA stretching applications, based on the use of the high-throughput nanoimprint lithography (NIL) technology combined with a conventional anodic bonding of the silicon base and Pyrex cover. Using the developed fabrication process sub-100nm width nanochannels have been obtained. The complete chip, including microchannels for fluid transport and nanochannels for DNA stretching and visualization has been fabricated and packaged to facilitate the contact with the macroscopic world.
Delta Compression for Information Push Services
Authors: Junze Wang, Yi Guo, Benxiong Huang, Jianhua Ma, Yijun Mo
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

With remarkable advances in mobile calculation and wireless communications, users expect to access the Internet anytime, anywhere. However, in environments with limited network bandwidth, the traditional pull based approach for information diffusion can not handle the great amount of demand. The researchers put their sights on information push services, expect to reduce communication load and distribute Internet links in a more efficient way. On the other side, with the advances in intelligent devices and the demand of data exchange, more and more XML documents will be pushed to clients in the future. Unfortunately, XML is verbose and it needs more communication resource when been pushing. In this paper, we focus on the delta compression which can be adopted in push services, and present a new delta compression, Jdelta. Jdelta is able to improve the compression ratio when deal with XML documents, more effective than any other compression scheme, and, more effective in saving the resource of communication.
Evolvability from learning algorithms
Authors: Vitaly Feldman
Venue: Proceedings of the 40th annual ACM symposium on Theory of computing (2008)

Valiant has recently introduced a framework for analyzing the capabilities and the limitations of the evolutionary process of random change guided by selection. In his framework the process of acquiring a complex functionality is viewed as a substantially restricted form of PAC learning of an unknown function from a certain set of functions. Valiant showed that classes of functions evolvable in his model are also learnable in the statistical query (SQ) model of Kearns and asked whether the converse is true. We show that evolvability is equivalent to learnability by a restricted form of statistical queries. Based on this equivalence we prove that for any fixed distribution D over the instance space, every class of functions learnable by SQs over D is evolvable over D. Previously, only the evolvability of monotone conjunctions of Boolean variables over the uniform distribution was known. On the other hand, we prove that the answer to Valiant's question is negative when distribution-independent evolvability is considered. To demonstrate this, we develop a technique for proving lower bounds on evolvability and use it to show that decision lists and linear threshold functions are not evolvable in a distribution-independent way. This is in contrast to distribution-independent learnability of decision lists and linear threshold functions in the statistical query model.
Swing - A Novel Mechanism Inspired by Shim6 Address-Switch Conception to Limit the Effectiveness of DoS Attacks
Authors: Xiangbin Cheng, Jun Bi, Xing Li
Venue: Proceedings of the Seventh International Conference on Networking (2008)

Denial-of-Service (DoS) attacks play a significant role among all the network security issues today. In this paper, we present a mechanism (called Swing) to limit the effectiveness of DoS attacks. Inspired by the address-switch conception of the newly proposed shim6 protocol, Swing tries to protect servers from attacks by using a new strategy. In the mechanism, when a DoS attack is detected, the server will automatically change its address to get rid of the attack. Meanwhile, existing connections from normal clients will be kept using an address-switch protocol like shim6. A p2p network is included in the mechanism to help clients establish new connections to the server under attack situations, and side equipments are deployed near the server to monitor and reshape the network flow. This mechanism suggests a new kind of strategy to defend DoS attacks, and provides a resilient and effective solution.
Complexity of DNF minimization and isomorphism testing for monotone formulas
Authors: Judy Goldsmith, Matthias Hagen, Martin Mundhenk
Venue: Information and Computation (2008)

We investigate the complexity of finding prime implicants and minimum equivalent DNFs for Boolean formulas, and of testing equivalence and isomorphism of monotone formulas. For DNF related problems, the complexity of the monotone case differs strongly from the arbitrary case. We show that it is DP-complete to check whether a monomial is a prime implicant for an arbitrary formula, but the equivalent problem for monotone formulas is in L. We show PP-completeness of checking if the minimum size of a DNF for a monotone formula is at most k, and for k in unary, we show that the complexity of the problem drops to coNP. In Christopher Umans [Christopher Umans, The minimum equivalent DNF problem and shortest implicants, Journal of Computer and System Sciences 63 (4) (2001) 597-611] a similar problem for arbitrary formulas was shown to be @?"2^p-complete. We show that calculating the minimum equivalent DNF for a monotone formula is possible in output-polynomial time if and only if P=NP. Finally, we disprove a conjecture from Steffen Reith [Steffen Reith, On the complexity of some equivalence problems for propositional calculi, in: Proceedings of the 28th International Symposium on Mathematical Foundations of Computer Science (MFCS), vol. 2747, Lecture Notes in Computer Science, Springer, 2003, pp. 632-641] by showing that checking whether two formulas are isomorphic has the same complexity for arbitrary formulas as for monotone formulas.