ppxscal/embedding_network huggingface dataset:
Optimal position control strategy in manipulators robot using shooting method
Authors: Jaime Estévez, Rubén S. García
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The optimal position control for a robotic manipulator in the coordinate space, is related with the determination of a control law which restricts the movement of the end-effector through of a specific trajectory on a time as short as possible. Its principal application is in finding the optimal trajectories of position in robotic manipulators. This article propose an alternative design method based on Pontryagin maximum principle and the development of the necessary conditions for the employ of the shooting method on a specific trajectory. This method is simulated in a 2-DOF planar robotic manipulator.
Modeling and Simulation of Current Ripple in DC Link Connecting Two PWM Inverters Using Matlab/Simulink
Authors: Taufik, Makbul Anwari
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In this paper, the impacts of PWM carrier signals to DC bus current ripple in a PWM-based Generator-Load system will be investigated. The study is crucial to aid in the determination of the dc bus capacitor in a real-world inverter system. A Simulink model depicting the contribution of the generator current and the load current to the total DC bus current will be described. Results of the computer simulations will also be discussed.
Bayesian Additive Regression Trees-Based Spam Detection for Enhanced Email Privacy
Authors: Saeed Abu-Nimeh, Dario Nappa, Xinlei Wang, Suku Nair
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Spam is considered an invasion of privacy. Its changeable structures and variability raise the need for new spam classification techniques. The present study proposes using Bayesian Additive Regression Trees (BART) for spam classification and evaluates its performance against other classification methods, including Logistic Regression, Support Vector Machines, Classification and Regression Trees, Neural Networks, Random Forests, and Naive Bayes. BART in its original form is not designed for such problems, hence we modify BART and make it applicable to classification problems. We evaluate the classifiers using three spam datasets; Ling-Spam, PU1, and Spambase to determine the predictive accuracy and the false positive rate.
RESERV: A Distributed, Load Balanced Information System for Grid Applications
Authors: Gábor Vincze, Zoltán Novák, Zoltán Pap, Rolland Vida
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Resource information systems are a key component of Computational Grids. Centralized information systems hamper scalability and reliability, and thus, completely distributed resource information systems, based on Distributed Hash Tables have been proposed. In some cases resource distribution might be highly uneven, load balancing of data becomes thus a crucial problem. However, current load balancing schemes cannot handle large amounts of data corresponding to a single resource type. In this paper we propose therefore RESERV, a distributed information system for Grid applications with a novel load balancing approach, able to handle extreme load unbalance.
Proceedings of the fifth on Asia-Pacific conference on conceptual modelling - Volume 79
Authors: Annika Hinze, Markus Kirchberg
Venue: Conferences in Research and Practice in Information Technology Series; Vol. 325 (2008)

This volume contains the papers presented at the Fifth Asia-Pacific Conference on Conceptual Modelling (APCCM 2008) which was held in Wollongong, New South Wales, Australia from January 22 to 25, 2008 as part of the Australasian Computer Science Week (ACSW 2008). On behalf of the program committee we commend these papers to you and hope you find them useful. The Asia-Pacific Conference on Conceptual Modelling series focuses on disseminating the results of innovative research in conceptual modelling and related areas, and provides an annual forum for experts from all areas of computer science and information systems with a common interest in the subject.
Classification using discriminative restricted Boltzmann machines
Authors: Hugo Larochelle, Yoshua Bengio
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Recently, many applications for Restricted Boltzmann Machines (RBMs) have been developed for a large variety of learning problems. However, RBMs are usually used as feature extractors for another learning algorithm or to provide a good initialization for deep feed-forward neural network classifiers, and are not considered as a standalone solution to classification problems. In this paper, we argue that RBMs provide a self-contained framework for deriving competitive non-linear classifiers. We present an evaluation of different learning algorithms for RBMs which aim at introducing a discriminative component to RBM training and improve their performance as classifiers. This approach is simple in that RBMs are used directly to build a classifier, rather than as a stepping stone. Finally, we demonstrate how discriminative RBMs can also be successfully employed in a semi-supervised setting.
Optimal segmentation using tree models
Authors: Robert Gwadera, Aristides Gionis, Heikki Mannila
Venue: Knowledge and Information Systems (2008)

Sequence data are abundant in application areas such as computational biology, environmental sciences, and telecommunications. Many real-life sequences have a strong segmental structure, with segments of different complexities. In this paper we study the description of sequence segments using variable length Markov chains (VLMCs), also known as tree models. We discover the segment boundaries of a sequence and at the same time we compute a VLMC for each segment. We use the Bayesian information criterion (BIC) and a variant of the minimum description length (MDL) principle that uses the Krichevsky-Trofimov (KT) code length to select the number of segments of a sequence. On DNA data the method selects segments that closely correspond to the annotated regions of the genes.
Neighbor detection and crosstalk elimination in self-reconfigurable robots
Authors: David Johan Christensen, David Brandt, Ulrik Pagh Schultz, Kasper Stoy
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

This paper addresses two issues concerning communication between neighbor modules in self-reconfigurable robots. The first issue is automatic neighbor detection that is due to modules self-reconfiguring, whereby the local communication network topology dynamically changes. The second issue is crosstalk between non-neighbor modules, where data packages send through an infrared communication channel are received by a non-neighbor module because of reflections. In this paper, we proposed algorithmic solutions to automatic neighbor detection and crosstalk elimination. The algorithms are simple, distributed, self-organizing and robust. For validation, they are implemented and evaluated on the physical ATRON system. In conclusion, the algorithms are efficient and effective and we argue that these algorithmic contributions may be applicable on other systems as well.
Feature Selection for Document Type Classification
Authors: Kazem Taghva, Jason Vergara
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we report on the identification of document type using a k-dependence Bayesian categorization engine. In particular, we show that the use of font and capitalization as features improves precision and recall.
A Set Associative Cache Model with Energy Saving
Authors: S. Subha
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper proposes a method to save energy in set associative cache. The method gathers the time of access of each memory address by profiling. Additional information about next access to a way is maintained in the cache ways. All the ways of the cache are put in either disable mode or low energy mode as supported by the cache. At each time unit, the cache ways are searched enabling the way that is going to be accessed next. If no way is going to be accessed in the next time unit, the generated address is placed respecting the replacement algorithm in the cache using the address mapping function. During this mapping all the ways of the mapped set are enabled as in a traditional set associative cache. The proposed method was simulated on SPEC2000 benchmarks with average energy savings of 19% and performance degradation of about 10% .
Orthopaedic tissue engineering and bone regeneration
Authors: Glenn Dickson, Fraser Buchanan, David Marsh, Eileen Harkin-Jones, Uel Little, Mervyn McCaigue
Venue: Technology and Health Care (2007)

Orthopaedic tissue engineering combines the application of scaffold materials, cells and the release of growth factors. It has been described as the science of persuading the body to reconstitute or repair tissues that have failed to regenerate or heal spontaneously. In the case of bone regeneration 3-D scaffolds are used as a framework to guide tissue regeneration. Mesenchymal cells obtained from the patient via biopsy are grown on biomaterials in vitro and then implanted at a desired site in the patient's body. Medical implants that encourage natural tissue regeneration are generally considered more desirable than metallic implants that may need to be removed by subsequent intervention. Numerous polymeric materials, from natural and artificial sources, are under investigation as substitutes for skeletal elements such as cartilage and bone. For bone regeneration, cells (obtained mainly from bone marrow aspirate or as primary cell outgrowths from bone biopsies) can be combined with biodegradable polymeric materials and/or ceramics and absorbed growth factors so that osteoinduction is facilitated together with osteoconduction; through the creation of bioactive rather than bioinert scaffold constructs. Relatively rapid biodegradation enables advantageous filling with natural tissue while loss of polymer strength before mass is disadvantageous. Innovative solutions are required to address this and other issues such as the biocompatibility of material surfaces and the use of appropriate scaffold topography and porosity to influence bone cell gene expression.
New algorithms for finding irreducible polynomials over finite fields
Authors: V. Shoup
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

An algorithm is presented for finding an irreducible polynomial of specified degree over a finite field. It is deterministic and runs in polynomial time for fields of small characteristics. A proof is given of the stronger result, that the problem of finding irreducible polynomials of specified degree over a finite field K is deterministic-polynomial-time reducible to the problem of factoring polynomials over the prime field of K.
Hierarchical Route Representation, Indexing, and Search
Authors: Qiong Zhang
Venue: IEEE Pervasive Computing (2008)

This article proposes a system to represent, index, and search routes based on raw GPS traces collected from numerous drivers. After segmenting GPS traces and aligning them with actual street segments, the system represents each route at multiple levels. It uses a geographical tree along with an inverted index and range trees to index routes to support efficient full-text search under varying conditions.
Scaling Components
Venue: Queue (2006)

Building software components and then integrating them with applications built by others has always been one of the most difficult challenges for any development team. In today's Web environment, developers are now being asked to build components that can be dynamically plugged into any application anywhere on the Web. In a conversation with Queuecast host Mike Vizard, David Johnson, CTO of IPCommerce, a company that specializes in distributed payment systems, explains how his company is rising to that very challenge. 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
An Infrastructure for Developing Pervasive Learning Environments
Authors: Sabine Graf, Kathryn MacCallum, Tzu-Chien Liu, Maiga Chang, Dunwei Wen, Qing Tan, Jon Dron, Fuhua Lin, Nian-Shing Chen, Rory McGreal, Kinshuk
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

This paper presents an infrastructure for developing problem-based pervasive learning environments. Building such environments necessitates having many autonomous components dealing with various tasks and heterogeneous distributed resources. Our proposed infrastructure is based on a multi-agent system architecture to integrate various components of the environments. The infrastructure includes a location- and context-awareness service, a question and answer service, an adaptive mechanism; problem based ubiquitous learning models, social networking issues, and the evaluation of multimedia inputs. Furthermore, student modeling issues among components are considered. The design of the infrastructure as well as its components is discussed. This paves the way towards the development of pervasive learning applications.
Bringing context to the foreground: designing for creative engagement in a novel still camera application
Authors: Maria Håkansson, Lalya Gaye
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

Sensor-based interaction has enabled a variety of new creative practices. With ubiquitous computing, designing for creative user experience with sensor-based devices benefits from new opportunities as well as new challenges. We propose a design approach where surrounding context information is brought to the foreground to become a resource for interaction, available at hand and in real time to the users. We illustrate this approach with our project context photography as a design case. Context photography consists of taking still pictures that capture not only incoming light but also some of the additional context surrounding the scene, with real-time context information visually affecting the pictures as they are taken. Based on the design and use of our context camera prototypes, this paper brings insight into implications of our approach to the design of sensor-based ubiquitous computing systems for creative purposes.
Generalized output regulation for a class of nonlinear systems via the robust control approach
Authors: L. E. Ramos-Velasco, S. Čelikovsky, V. López-Morales, V. Kučera
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

We address the problem of generalized output regulation for nonlinear systems in the presence of unknown parameters in the full information case. We generalize the classical output regulation problem in order to expand the class of reference or disturbance signals. Under appropriate sufficient conditions, a state feedback regulator is built for a class of nonlinear systems where the term including the unknown parameter is assumed to satisfy a matching condition. Our study of the above problem, further referred to as the so-called generalized output regulation problem, combines the approach based on the well-known notion of the regulator equation with the classical concept of the invariant distribution and on the Lyapunov theory.
Recognising online spatial activities using a bioinformatics inspired sequence alignment approach
Authors: Daniel E. Riedel, Svetha Venkatesh, Wanquan Liu
Venue: Pattern Recognition (2008)

In this paper we address the problem of recognising embedded activities within continuous spatial sequences obtained from an online video tracking system. Traditionally, continuous data streams such as video tracking data are buffered with a sliding window applied to the buffered data stream for activity detection. We introduce an algorithm based on Smith-Waterman (SW) local alignment from the field of bioinformatics that can locate and accurately quantify embedded activities within a windowed sequence. The modified SW approach utilises dynamic programming with two dimensional spatial data to quantify sequence similarity and is capable of recognising sequences containing gaps and significant amounts of noise. A more efficient SW formulation for online recognition, called Online SW (OSW), is also developed. Through experimentation we show that the OSW algorithm can accurately and robustly recognise manually segmented activity sequences as well as embedded sequences from an online tracking system. To benchmark the classification performance of OSW we compare the approach to dynamic time warping (DTW) and the discrete hidden Markov model (HMM). Results demonstrate that OSW produces higher precision and recall than both DTW and the HMM in an online recognition context. With accurately segmented sequences the SW approach produces results comparable to DTW and superior to the HMM. Finally, we confirm the robust property of the SW approach by evaluating it with sequences containing artificially incorporated noise.
A Computing Model for Marketable Quality and Profitability of Corporations: Model Evaluation Based on Two Different Sources Data
Authors: Valbona Barolli, Heihachiro Fukuda, Leonard Barolli, Makoto Takizawa
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications (2008)

In this paper, we introduce and evaluate a computing model for marketable quality and profitability of corporations. We discuss the model prediction of the turning and transitionperiods based on data from two different sources. By applying these real data of some leading manufacturing corporations in Japan, we analyze the model accuracy. From the analysis, we conclude that even there are somedifferences between two sources data, the proposed modelgive a good approximation and prediction of the turningand transition periods of Japanese economy.
Closure, 2-factors, and cycle coverings in claw-free graphs
Authors: Zdeněk Ryjáček, Akira Saito, R. H. Schelp
Venue: Journal of Graph Theory (1999)

In this article, we study cycle coverings and 2-factors of a claw-free graph and those of its closure, which has been defined by the first author (On a closure concept in claw-free graphs, J Combin Theory Ser B 70 (1997), 217&ndash;224). For a claw-free graph G and its closure cl(G), we prove: (1) V(G) is covered by k cycles in G if and only if V(cl(G)) is covered by k cycles of cl(G); and (2) G has a 2-factor with at most k components if and only if cl(G) has a 2-factor with at most k components. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 109&ndash;117, 1999
Condition numbers and error bounds in convex programming
Authors: A. Coulibaly, J. -P. Crouzeix
Venue: Mathematical Programming: Series A and B (2008)

After a brief survey on condition numbers for linear systems of equalities, we analyse error bounds for convex functions and convex sets. The canonical representation of a convex set is defined. Other representations of a convex set by a convex function are compared with the canonical representation. Then, condition numbers are introduced for convex sets and their convex representations.
Goal-Oriented, B-Based Formal Derivation of Security Design Specifications from Security Requirements
Authors: Riham Hassan, Shawn Bohner, Sherif El-Kassas, Mohamed Eltoweissy
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper proposes a requirements-driven security engineering approach for analyzing application-specific security requirements that are formally derived into security design preserving security requirements properties. The approach adopts the KAOS framework to formally construct a complete and consistent security requirements model that is extended using the B method to produce security design and further implementation while preserving requirements properties. This unique treatment of secure software engineering is systematic, constructive and considers security early in development.
Construction algorithms for k-connected m-dominating sets in wireless sensor networks
Authors: Yiwei Wu, Yingshu Li
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a k-Connected m-Dominating Set (kmCDS) is necessary for fault tolerance and routing flexibility. Some approximation algorithms have been proposed to construct a kmCDS. However, most of them only consider some special cases where k = 1,2 or k ≤ m, or are not easy to implement, or have high message complexity. In this paper, we propose a novel distributed algorithm LDA with low message complexity to construct a kmCDS for general k and m whose size is guaranteed to be within a small constant factor of the optimal solution when the maximum node degree is a constant. We also propose one centralized algorithm ICGA with a constant performance ratio to construct a kmCDS. Theoretical analysis as well as simulation results are shown to evaluate the proposed algorithms.
Experimental investigation along with simulation analysis of small rod-plate air gaps with or without a Barrier: the ground effect
Authors: Athanasios Maglaras, Leandros Maglaras
Venue: Proceedings of the 5th WSEAS/IASME International Conference on Systems Theory and Scientific Computation (2005)

The rod - plate air gaps are of great importance in High Voltage Applications. The rod - plate air gap with the plate grounded has been investigated enough, whole a study of the case with the rod grounded is missed. In present paper both arrangements of rod - plate air gap with the rod or the plate grounded are experimentally investigated and analysed with the aid of special simulation software, using the Finite Element Method. Values of the field strength in the gap, when stressed by the breakdown voltage, are recorded and analyzed. The results show that the distribution of the field along the axis of the gap is strongly affected by the geometry of the electrodes and the arrangement of the gap, and especially by the grounded electrode (Ground Effect). A dielectric plate, Called barrier, placed between the electrodes, is electrically charged when the stressed voltage is higher than the corona onset voltage on the rod. The maximum value of the voltage on the barrier is equal, less or greater than the rod voltage depending on the position of the barrier, the grounded electrode, and the polarity of the voltage. The charged barrier influences the distribution of the field and the breakdown voltage, vindicating a special relation between them. The simulation and experimental results are compared.