ppxscal/embedding_network huggingface dataset:
New laboratory for three-dimensional guided missile simulation
Authors: Louis Bauer
Venue: Proceedings of the February 4-6, 1953, western computer conference (1953)

Project Cyclone at the Reeves Instrument Corporation is under the cognizance of the Bureau of Aeronautics of the Navy. The function of Project Cyclone is primarily the development and operation of a Guided Missile Simulator, and the establishment and operation of a Simulation Laboratory. Problems in other fields are also studied and analyzed using the computing machinery of the Simulation Laboratory. 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
Kernel Methods for Graphs: A Comprehensive Approach
Authors: Francesco Camastra, Alfredo Petrosino
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

The development of learning algorithms for structured data, i.e. data that cannot be represented by numerical vectors, is a relevant challenge in machine learning. Kernel Methods, which is a leading machine learning technology for vectorial data, recently tackled the structured data. In this paper we focus our attention on Kernel Methods that face up to data that can be represented by means of graphs, by providing an in-depth review through a comprehensive approach to the research hints and the main open problems in this area of research.
Map-Oriented Regional Information Management for Data Broadcasting Contents
Authors: Masahiro Ura, Takami Yasuda, Masashi Yamada, Mamoru Endo, Shinya Miyazaki, Koji Nakamura
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

Although regional informatization has advanced due to the Internet, a problem remains: not all people can use such services. Data broadcasting is expected to serve as infrastructure to advance regional informatization, because it is safer and easier to use for all the people including senior citizens than internet infrastructure. We are promoting regional informatization based on data broadcasting. However, there are problems such as only information on each genre can be inspected, so the interface must be improved to present information region-wide. Moreover, published information is not managed uniformly, so maintaining the current state that recycles valuable information is difficult. In this study, we propose a map-oriented information model that focuses on maps as information interfaces.
Perfect Local Computability and Computable Simulations
Authors: Russell Miller, Dustin Mulcahey
Venue: Proceedings of the 4th conference on Computability in Europe: Logic and Theory of Algorithms (2008)

We study perfectly locally computable structures, which are (possibly uncountable) structures ${\mathcal{S}}$ that have highly effective presentations of their local properties. We show that every such ${\mathcal{S}}$ can be simulated, in a strong sense and even over arbitrary finite parameter sets, by a computable structure. We also study the category theory of a perfect cover of ${\mathcal{S}}$, examining its connections to the category of all finitely generated substructures of ${\mathcal{S}}$.
A study of unit bar-visibility graphs
Authors: Lesley Wellington Wiglesworth
Venue:  (2008)

Bar-visibility graphs were introduced in the 1970s as a method to test printed circuit boards. Wismath and independently Tomassia and Tollis provided characterizations in the mid-1980s. Unit bar-visibility graphs are a type of bar-visibility graph in which all bars have the same unit length. This length restriction was motivated by circuits in which all components have near the same length. This dissertation provides general results of unit bar-visibility graphs and then focuses on unit bar-visibility graphs having unit bar layouts with width less than two. Two characterizations of these graphs are provided. One characterization provides information on the unit bar layout of such a graph, and the other is tailored to finding a polynomial time algorithms to determine whether a graph has such a unit bar layout. Finally, Chapter 5 addresses induced subgraphs of grids, a challenging subclass of graphs that will guide the design of a general polynomial time algorithm for recognition of these graphs.
Prediction of nucleotide sequences by using genomic signals
Authors: Paul Cristea, Rodica Tuduce, Valeri Mladenov, Georgi Tsenov, Simona Petrakieva
Venue: Proceedings of the 9th WSEAS International Conference on Neural Networks (2008)

The conversion of symbolic sequences into complex genomic signals allows using signal processing methods for the handling and analysis of nucleotide sequences. This methodology reveals surprizing regularities, both locally and at a global scale, allowing to predict nucleotides in a sequence when knowing the preceding ones. Such experiments have a biologic significance, as they explore the possibility and the efficiency of error correction in processes like replication, transcription and translation.
Lagrange Multiplier Approach to Variational Problems and Applications
Authors: Kazufumi Ito, Karl Kunisch
Venue: Advances In Design And Control (2008)

Lagrange multiplier theory provides a tool for the analysis of a general class of nonlinear variational problems and is the basis for developing efficient and powerful iterative methods for solving these problems. This comprehensive monograph analyzes Lagrange multiplier theory and shows its impact on the development of numerical algorithms for problems posed in a function space setting. The book is motivated by the idea that a full treatment of a variational problem in function spaces would not be complete without a discussion of infinite-dimensional analysis, proper discretization, and the relationship between the two. The authors develop and analyze efficient algorithms for constrained optimization and convex optimization problems based on the augumented Lagrangian concept and cover such topics as sensitivity analysis, convex optimization, second order methods, and shape sensitivity calculus. General theory is applied to challenging problems in optimal control of partial differential equations, image analysis, mechanical contact and friction problems, and American options for the Black-Scholes model. Audience: This book is for researchers in optimization and control theory, numerical PDEs, and applied analysis. It will also be of interest to advanced graduate students in applied analysis and PDE optimization.
How Many Clusters Are There? --- An Essay on the Basic Notions of Clustering
Authors: Bernd Reusch
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part I (2008)

This lecture starts with two remarks:1Many people, papers, books claim "the number of clusters has to be given in advance"1Even good texts do not provide a formal definition of "cluster" or "clustering"Starting with remark 1 we show, that any formal definition of "clustering" uniquely defines the number of clusters. For remark 2 we prove that relations called "similarities" define nicely "clustering". We also show that every clustering is defined by some similarity, although it may be given only implicitly. Finding clusters given by some similarity is the same problem as the "maximal clique problem". Hence it is NP-complete. It is also very clear that the very old techniques of "reduction of partial automate" is the same. In both areas algorithms are known, for maximal cliques even good heuristics. Coming back to remark 1. The problem that people really address, is the case where the desired similarity is not given explicitly, but by some of its properties. Among these, there may be the number of clusters. Very many of the known algorithms have the following structure:1Generate some similarity Pi1Is it "good"?Yes: Stop here and use Pi for clusteringNo: generate Pi+1 and continue.For generating new similarities many techniques are used: distances, probabilities, etc. and also fuzzy theory. Finally we show that using "representatives" for clustering is not the same as using similarities.
An Energy-Efficient Routing Method of Wireless Sensor Networks
Authors: Sun Ting, Lu Dongxin, Yang Yongtian
Venue: Proceedings of the 7th international conference on Computational Science, Part III: ICCS 2007 (2007)

In wireless sensor networks(WSNs), as sensor nodes are characterized by having specific requirements such as limited energy availability, low memory and reduced processing power, energy efficiency is a key issue in designing the network routing. In the existing clustering-based routing protocols for the WSNs, the cluster-heads are usually selected randomly and do a lot of work, which may cause unbalanced energy consumption and thus short network lifetime. Based on this approach, the paper proposes a method that a cluster-head distributes energy load evenly among its members based on their energy usage by chain. With the chain, in a cluster, different node is selected as Agent Node to send the data to cluster-head at different cluster cycle. The new method balances the nodes' power depletion. Simulation results show that it has better power management performance and can prolong the lifetime of the network.
Ensuring Generality in Euclid's Diagrammatic Arguments
Authors: John Mumma
Venue: Proceedings of the 5th international conference on Diagrammatic Representation and Inference (2008)

This paper presents and compares FG and Eu, two recent formalizations of Euclid's diagrammatic arguments in the Elements. The analysis of FG, developed by the mathematician Nathaniel Miller, and that of Eu, developed by the author, both exploit the fact that Euclid's diagrammatic inferences depend only on the topology of the diagram. In both systems, the symbols playing the role of Euclid's diagrams are discrete objects individuated in proofs by their topology. The key difference between FG and Eu lies in the way that a derivation is ensured to have the generality of Euclid's results. Carrying out one of Euclid's constructions on an individual diagram can produce topological relations which are not shared by all diagrams so constructed. FG meets this difficulty by an enumeration of cases with every construction step. Eu, on the other hand, specifies a procedure for interpreting a constructed diagram in terms of the way it was constructed. After describing both approaches, the paper discusses the theoretical significance of their differences. There is in Eu a context dependence to diagram use, which enables one to bypass the (sometimes very long) case analyses required by FG. 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
Predicting Cytokines Based on Dipeptide and Length Feature
Authors: Wei He, Zhenran Jiang, Zhibin Li
Venue: Proceedings of the 4th international conference on Intelligent Computing: Advanced Intelligent Computing Theories and Applications - with Aspects of Theoretical and Methodological Issues (2008)

Cytokines are crucial intercellular regulators that have important physiological roles in a wide range of disease processes. The identification of new cytokines by computational methods can provide valuable clues in functional studies of uncharacterized proteins without performing extensive experiments. In this study, we developed a new prediction method for the cytokine family based on dipeptide composition and length distribution by using support vector machine (SVM). The cross-validation results demonstrated that cytokines could be correctly identified with an accuracy of 97% at family classification and 90% at subfamily recognition correctly, respectively. In comparison with existing methods in the literature, the present method displayed great competitiveness on identifying cytokines correctly.
On Modeling Proto-Imitation in a Pre-associative Babel
Authors: Elpida Tzafestas
Venue: Proceedings of the 10th international conference on Simulation of Adaptive Behavior: From Animals to Animats (2008)

In this paper we present a model of generative proto-imitation that replicates external signals without associating with objects, as in higher-level imitation. A mixed population of adults, that have fixed associations objects-signals, and infants, that do not have associations but imitate unconditionally, endowed with a kinship and interaction structure, allows infants to develop signal affinity with their kin in a variety of conditions and within an initial random world, i.e. in a Babel. Our results indicate that the communicative value of imitation can be discovered after the basic apparatus is in place, rather than that communication is the end to which imitation is the means.
10th International Workshop on: Learning Software Organizations ---Methods, Tools, and Experiences---
Authors: Raimund L. Feldmann, Martin Wessner
Venue: Proceedings of the 9th international conference on Product-Focused Software Process Improvement (2008)

Ten years ago, the LSO workshop series was designed as a communication forum that addresses the questions of organizational learning from a software point of view. Today this topic is still current and in high demand. The workshop focuses on existing work on knowledge management and organizational learning as well as on newer developments such as Web 2.0 or Enterprise 2.0. It brings together practitioners and researchers for an open exchange of experience with successes and failures in organizational learning and provides an opportunity to learn about new ideas. Fostering interdisciplinary approaches is one key concern of this workshop series.
Evacuation guide system based on massively multiagent system
Authors: Yuu Nakajima, Shohei Yamane, Hiromitsu Hattori, Toru Ishida
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems: demo papers (2008)

Using ubiquitous devices such as multifunctional cellular phones and PDAs, we can build a large-scale navigation system for evacuation in the metropolis. Although current navigation systems simply broadcast the same instructions over a large area, the required function is to provide individualized instructions to each user. Our approach is to build a navigation system based on multiagent system which assigns one guide agent to each user. In the system, a guide agent can provide personalized navigation instructions depending on its owner's surrounding circumstances. We implemented Mega-Navigation system using massively multiagent platform, called Caribbean/Q. Our Mega-Navigation system, which is currently able to work for evacuation in the city of Kyoto, can catch evacuees' position and offer instructions through GPS-capable cellular phone.
Product design and development framework in collaborative engineering environment
Authors: Ali K. Kamrani, Emad S. Abouel Nasr
Venue: International Journal of Computer Applications in Technology (2008)

Globalisation has created a situation of increased international competition, which puts companies under pressure to compete in the value added to customers. This paper presents an integrated framework for product design and development in distributed and collaborative environments. The proposed system integrates the software tools and resources in the design process to enable geographically dispersed design teams and vendors to collaborate. The early participation of the vendors in the design process is critical to improve quality and reduce development cycle-time. The real-time, automated generation and modification of parametric CAD models are introduced to further assist the system reduce the cycle-time.
Agile Software Development at Scale
Authors: Scott W. Ambler
Venue: Balancing Agility and Formalism in Software Engineering: Second IFIP TC 2 Central and East European Conference on Software Engineering Techniques, CEE-SET 2007, Poznan, Poland, October 10-12, 2007, Revised Selected Papers (2008)

Since 2001 agile software development approaches are being adopted across a wide range of organizations and are now being applied at scale. There are eight factors to consider --- team size, geographical distribution, entrenched culture, system complexity, legacy systems, regulatory compliance, organizational distribution, governance and enterprise focus --- when scaling agile. Luckily a collection of techniques and strategies exist which scale agile approaches, including considering the full development lifecycle, Agile Model Driven Development (AMDD), continuous independent testing, adopting proven strategies, agile database techniques, and lean development governance. It is possible to scale agile approaches, but you will need to look beyond the advice provided by the "agile in the small" literature.
The Impact of Climate Change on Future Land-Use in a Coastal Zone Planning Context
Authors: Henning Sten Hansen
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

Climate change has received much attention during the last decennium and especially various mitigation and adaptation strategies. Particularly the coastal zone will feel the consequences of climate change and the associated effects like sea level rise, increased storminess and flooding. Thus there is an urgent need for local and regional spatial planners to include climate change in their planning efforts. Using modelling and simulation, we can increase our understanding of the future land-use system under influence of a changing climate and accordingly reduce uncertainty concerning decisions. The current paper describes how land-use simulations combined with climate change scenarios can facilitate the definition of adaptation strategies to counteract the consequences of potential climate changes. 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
Quality of Trilateration: Confidence Based Iterative Localization
Authors: Zheng Yang, Yunhao Liu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

The proliferation of wireless and mobile devices has fostered the demand of context aware applications. Location is one of the most significant contexts. Multilateration, as a basic building block of localization, however, have not yet overcome the challenges of (1) poor ranging measurement; (2) dynamic and noisy environments; (3) fluctuations in wireless communications. Hence, they often suffer poor accuracy and can hardly be employed in practical applications. In this study, we propose Quality of Trilateration (QoT) that quantifies the geometric relationship of objects and the ranging noise. Based on QoT, we design a confidence based iterative localization scheme, in which nodes dynamically select trilaterations with the highest quality for localization. To validate this design, a wireless sensor network prototype is deployed and results show that QoT well represents trilateration accuracy, and the proposed scheme significantly improve localization performances.
Query processing for graph-structured data
Authors: Jeffrey Xu Yu
Venue:  (2007)

Graph-structured data is enjoying an increasing popularity among Web technology and new data management and archiving techniques. Numerous applications work with graphs and need to query reachability among nodes in graphs. A 2-hop cover can compactly represent the whole edge transitive closure of a graph in O (|V| &middot; |E| 1/2) space, providing a time- and space-efficient solution to reachability query processing. We study fast computation and maintenance of 2-hop covers for any kind of graphs. Besides, we study efficient processing of graph pattern queries, which consists of multiple reachability conditions. Our work processes graph pattern queries efficiently by a join/semi-join approach. We can find an optimal join/semi-join order to process graph pattern queries with manageable overhead. We have conducted extensive experiments to confirm the efficiency our approach.
Model-Based Quality Assurance of Automotive Software
Authors: Jan Jürjens, Daniel Reiß, David Trachtenherz
Venue: Proceedings of the 11th international conference on Model Driven Engineering Languages and Systems (2008)

Software in embedded (e.g. automotive) systems requires a high level of reliability. Model-based development techniques are increasingly used to reach this goal, but so far there is relatively little published knowledge on the comparative benefits in using different assurance techniques. We investigate different and potentially complementary model-based software quality assurance methods (namely simulation and white-box testing vs. model-checking) at the hand of an application to the software component of a door control unit. We draw conclusions with regards to suitable application use cases.
A New Rough Set Reduct Algorithm Based on Particle Swarm Optimization
Authors: Benxian Yue, Weihong Yao, Ajith Abraham, Hongbo Liu
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

Finding appropriate features is one of the key problems in the increasing applications of rough set theory, which is also one of the bottlenecks of the rough set methodology. Particle Swarm Optimization (PSO) is particularly attractive for this challenging problem. In this paper, we attempt to solve the problem using a particle swarm optimization approach. The proposed approach discover the best feature combinations in an efficient way to observe the change of positive region as the particles proceed through the search space. We evaluate the performance of the proposed PSO algorithm with Genetic Algorithm (GA). Empirical results indicate that the proposed algorithm could be an ideal approach for solving the feature reduction problem when other algorithms failed to give a better solution.
Security Flaw in Simple Generalized Group-Oriented Cryptosystem Using ElGamal Cryptosystem
Authors: Chuan-Ming Li, Tzonelih Hwang, Narn-Yih Lee
Venue: Informatica (2007)

A generalized group-oriented cryptosystem (GGOC) based on ElGamal cryptosystem was proposed by Yang et al. in 2003. This study shows that if the authorized decryption sets of users are not properly predetermined in Yang et al.'s GGOC, an unauthorized decryption set of users can recover the encrypted message without difficulty. This study also presents an improved protocol to resist such an attack.
YIELDS: A Yet Improved Limited Discrepancy Search for CSPs
Authors: Wafa Karoui, Marie-José Huguet, Pierre Lopez, Wady Naanaa
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

In this paper, we introduce a Yet ImprovEd Limited Discrepancy Search (YIELDS), a complete algorithm for solving Constraint Satisfaction Problems. As indicated in its name, YIELDS is an improved version of Limited Discrepancy Search (LDS). It integrates constraint propagation and variable order learning. The learning scheme, which is the main contribution of this paper, takes benefit from failures encountered during search in order to enhance the efficiency of variable ordering heuristic. As a result, we obtain a search which needs less discrepancies than LDS to find a solution or to state a problem is intractable. This method is then less redundant than LDS.The efficiency of YIELDS is experimentally validated, comparing it with several solving algorithms: Depth-bounded Discrepancy Search, Forward Checking, and Maintaining Arc-Consistency. Experiments carried out on randomly generated binary CSPs and real problems clearly indicate that YIELDS often outperforms the algorithms with which it is compared, especially for tractable problems.