ppxscal/embedding_network huggingface dataset:
Optimized expected information gain for nonlinear dynamical systems
Authors: Alberto Giovanni Busetto, Cheng Soon Ong, Joachim M. Buhmann
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

This paper addresses the problem of active model selection for nonlinear dynamical systems. We propose a novel learning approach that selects the most informative subset of time-dependent variables for the purpose of Bayesian model inference. The model selection criterion maximizes the expected Kullback-Leibler divergence between the prior and the posterior probabilities over the models. The proposed strategy generalizes the standard D-optimal design, which is obtained from a uniform prior with Gaussian noise. In addition, our approach allows us to determine an information halting criterion for model identification. We illustrate the benefits of our approach by differentiating between 18 published biochemical models of the TOR signaling pathway, a model selection problem in systems biology. By generating pivotal selection experiments, our strategy outperforms the standard Aoptimal, D-optimal and E-optimal sequential design techniques.
Simultaneous Packing and Covering in Sequence Spaces
Authors: Konrad J. Swanepoel
Venue: Discrete Computational Geometry (2009)

We adapt a construction of Klee (1981) to find a packing of unit balls in &#x2113; p (1&#x2264;p<&#x221e;) which is efficient in the sense that enlarging the radius of each ball to any R>21&#x2212;1/p covers the whole space. We show that the value 21&#x2212;1/p is optimal.
NMACA: a novel methodology for message authentication code algorithms
Authors: Khaled Alghathbar, Alaaeldin M. Hafez, Fahad Bin Muhaya, Hanan A. Mahmoud Abd Alla
Venue: Proceedings of the 8th Wseas international conference on Telecommunications and informatics (2009)

For objects stored in long-term digital archives, checking the integrity of the information stored is a prime necessity in the field of secure storage systems. Objects in a digital archive may include documents, images, databases, ..., etc. In a long-term archive those objects could be transferred in many various ways. In many cases, users are required to verify the authentication of the archived information. The goal of all authentication algorithmic techniques is to verify that information in the archive is authentic and has not been unintentionally or maliciously altered. Integrity checks not only detect malicious attacks but also identify data corrupted information. Keyed hash functions whose specific purpose is message authentication are called message authentication code (MAC) algorithms. Many iterated MACs can be described as iterated hash functions. In this case, the MAC key is fed as an input to the compression function, and be involved in the compression function f at every stage. Recently, powerful new attacks on hash functions such MD5 and SHA-1, among others, suggest introducing more secure hash functions. In this paper, we propose a new family of algorithms that use an input MAC key to the compression function in permuting the order of message words and shifting operation in the compression function. The new technique can be working in conjunction with a wide range of message authentication algorithm. Using MD5 algorithm as a model, a new MD5-MAC algorithm is presented. The proposed algorithm uses the MAC key in building the hash functions by defining the order for accessing source words and defining the number of bit positions for left shifts.
Partial characterizations of circular-arc graphs
Authors: F. Bonomo, G. Durán, L. N. Grippo, M. D. Safe
Venue: Journal of Graph Theory (2009)

A circular-arc graph is the intersection graph of a family of arcs on a circle. A characterization by forbidden induced subgraphs for this class of graphs is not known, and in this work we present a partial result in this direction. We characterize circular-arc graphs by a list of minimal forbidden induced subgraphs when the graph belongs to any of the following classes: P4 -free graphs, paw-free graphs, claw-free chordal graphs and diamond-free graphs. &copy; 2009 Wiley Periodicals, Inc. J Graph Theory 61: 289&ndash;306, 2009
System Administration for Oracle E-Business Suite
Authors: Roel Hogendoorn
Venue:  (2007)

This book explains in the purpose and concepts of System Administration in the Oracle e-Business Suite. It is explained via step-by-step examples, with lots of screenshots. Most parts of System Administration is not difficult, as long as you have good examples. And this book is packed with clear examples that you can easily copy for your purpose. The content is valid both for Oracle eBS R11i and R12.
A framework for evaluating the computational aspects of mobile phones
Authors: Rafael Perez
Venue:  (2008)

With sales reaching $4.4 billion dollars in the first half of 2006 in the United States alone, and an estimated 80% of the world receiving coverage for their wireless phones in that year, interest in these devices as more than mere communicators has greatly increased. In the mid-to-late 1990s, digital cameras began to be incorporated into cellphones, followed shortly thereafter by Global Positioning System (GPS) hardware allowing location-based services to be offered to customers. Since then the use of mobile phone hardware for non-communication purposes has continued to expand. Some models, such as the Motorola V3M, have been specifically geared toward the storage and display of music and visual media, as well as receiving Internet broadcasts. It is perhaps surprising, therefore, that relatively little has been done from an academic standpoint to provide a qualitative and comprehensive method of evaluating the performance of mobile phones regarding their ability to function as computing devices. While some manuals do offer comparisons of Application Programming Interfaces (APIs) that aid in the development of cellphone applications, little documentation exists to provide objective measurements of performance parameters. This dissertation proposes a framework for evaluating the performance of mobile phones from a computational angle, focusing on three criteria: the processing power of the Central Processing Unit (CPU), data transfer capabilities, and the performance of the phone&rsquo;s GPS functionality for the appropriation of geographic location data. Power consumption has always been a major source of interest in the study of computer systems, and the limited hardware resources of mobile devices such as laptop computers, Personal Data Assistants (PDAs) and cellular telephones makes this a key concern. The power consumption factors associated with operation are therefore considered alongside the three core criteria being studied in this framework. In addition to framework design, software tools for the evaluation of cellphones were also developed, and these were applied to a test case of the Sanyo SCP-7050 model. This provides an example of the utility of the framework in evaluating existing phone models and a foundation for the assessment of new models as they are released.
NN-based algorithm for control valve stiction quantification
Authors: H. Zabiri, A. Maulud, N. Omar
Venue: WSEAS Transactions on Systems and Control (2009)

Control valve stiction is the most commonly found valve problem in the process industry. Quantification of the actual amount of stiction present in a loop is an important step that may help in scheduling the optimum maintenance work for the valves. In this paper, a Neural-network based stiction quantification algorithm is developed. It is shown that the performance of the proposed quantification algorithm is comparable to other method whereby accurate estimation of the stiction amount can be achieved even in the presence of random noise. Its robustness towards external oscillating disturbances is also investigated.
Legislative Information Websites: Designing Beyond Transparency
Authors: Anne L. Washington, Jeffrey C. Griffith
Venue: Proceeding of the 2007 conference on Legal Knowledge and Information Systems: JURIX 2007: The Twentieth Annual Conference (2007)

Since the 1990s many legislatures have made their documents and activities available to the public through the Internet. While this initial phase of transparency met some needs, it is no longer sufficient simply to make legislative documents available electronically. Legislative systems that seek to be authoritative must meet the highest possible standard in at least five key areas: 1) accuracy 2) timeliness 3) completeness 4) clarity and 5) context. This paper applies these criteria to the evaluation and design of legislative websites. First, an evaluation of the European Parliament and the United States Congress systems reveals how some of these standards are being met. Second, a case study illustrates how the five criteria have been built into the XML design of U.S. congressional legislative data. In conclusion, we discuss the implications for legislature transparency.
Growing with Technology Activities in Action: Green Level, 1st edition
Authors: Gary B. Shelly, Thomas J. Cashman, Rachel Biheller Bunin
Venue:  (2007)

This unique educational software provides a wealth of additional activities to supplement the Growing with Technology series as well as empowers teachers with no programming skills to easily create even more multimedia activities for their students with existing activities templates.
Global Exponential Stability of FCNNs with Bounded Uncertain Delays
Authors: Guozheng Wang, Qianhong Zhang, Zhenguo Luo
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this paper, fuzzy cellular neural networks with bounded uncertain delays are investigated. By constructing Lyapunov functional method, applying inequality technique and the homeomorphism theory, we derive some new sufficient conditions to guarantee existence, uniqueness of the equilibrium point and its global exponential stability for fuzzy cellular neural networks. The results of this paper are new and they complement previously known results.
Conducting and Optimizing Eclipse Attacks in the Kad Peer-to-Peer Network
Authors: Michael Kohnen, Mike Leske, Erwin P. Rathgeb
Venue: Proceedings of the 8th International IFIP-TC 6 Networking Conference (2009)

The Kad network is a structured P2P network used for file sharing. Research has proved that Sybil and Eclipse attacks have been possible in it until recently. However, the past attacks are prohibited by newly implemented security measures in the client applications. We present a new attack concept which overcomes the countermeasures and prove its practicability. Furthermore, we analyze the efficiency of our concept and identify the minimally required resources.
Divergence-free reconstruction of magnetic fields and WENO schemes for magnetohydrodynamics
Authors: Dinshaw S. Balsara
Venue: Journal of Computational Physics (2009)

In a pair of earlier papers the author showed the importance of divergence-free reconstruction in adaptive mesh refinement problems for magnetohydrodynamics (MHD) and the importance of the same for designing robust second order schemes for MHD. Second order accurate divergence-free schemes for MHD have shown themselves to be very useful in several areas of science and engineering. However, certain computational MHD problems would be much benefited if the schemes had third and higher orders of accuracy. In this paper we show that the reconstruction of divergence-free vector fields can be carried out with better than second order accuracy. As a result, we design divergence-free weighted essentially non-oscillatory (WENO) schemes for MHD that have order of accuracy better than second. A multi-stage Runge-Kutta time integration is used to ensure that the temporal accuracy matches the spatial accuracy. While this is achieved quite simply up to third order in time, going beyond third order is most simply achieved by using the ADER-WENO schemes that are detailed in a companion paper. (ADER stands for Arbitrary Derivative Riemann Problem.) Accuracy analysis is carried out and it is shown that the schemes meet their design accuracy for smooth problems. Stringent tests are also presented showing that the schemes perform well on those tests.
Ontology-based relevance analysis for automatic reference tracking
Authors: Mahalakshmi G. Suryanarayanan, Sendhilkumar Selvaraju, Alagu Irulappan, Preethan Mirinda, Gnanasekaran
Venue: International Journal of Computer Applications in Technology (2009)

Automatic reference tracking involves recursive tracking of bibliographic references listed under the 'References' section of any research article. The objective of reference tracking is to aid the research of the scholars. Therefore, analysing the relevance of the tracked publication with respect to the seed paper is of utmost importance. This paper tries to address the issue of ontology-based relevance analysis of research publications. In comparison, this experiment attempts to calculate the relevance based on 'WordNet'. The observations substantiate the claim of using domain ontology instead of 'WordNet' for various reasons summarises in the paper.
Minimising Speaker Verification Utterance Length through Confidence Based Early Verification Decisions
Authors: Robbie Vogt, Sridha Sridharan
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

This paper presents a novel approach of estimating the confidence interval of speaker verification scores. This approach is utilised to minimise the utterance lengths required in order to produce a confident verification decision. The confidence estimation method is also extended to address both the problem of high correlation in consecutive frame scores, and robustness with very limited training samples. The proposed technique achieves a drastic reduction in the typical data requirements for producing confident decisions in an automatic speaker verification system. When evaluated on the NIST 2005 SRE, the early verification decision method demonstrates that an average of 5---10 seconds of speech is sufficient to produce verification rates approaching those achieved previously using an average in excess of 100 seconds of speech.
A global optimization algorithm for generalized semi-infinite, continuous minimax with coupled constraints and bi-level problems
Authors: Angelos Tsoukalas, Berç Rustem, Efstratios N. Pistikopoulos
Venue: Journal of Global Optimization (2009)

We propose an algorithm for the global optimization of three problem classes: generalized semi-infinite, continuous coupled minimax and bi-level problems. We make no convexity assumptions. For each problem class, we construct an oracle that decides whether a given objective value is achievable or not. If a given value is achievable, the oracle returns a point with a value better than or equal to the target. A binary search is then performed until the global optimum is obtained with the desired accuracy. This is achieved by solving a series of appropriate finite minimax and min-max-min problems to global optimality. We use Laplace's smoothing technique and a simulated annealing approach for the solution of these problems. We present computational examples for all three problem classes.
Delay-constrained high throughput protocol for multi-path transmission over wireless multimedia sensor networks
Authors: Shuang Li, Raghu Neelisetti, Cong Liu, Alvin Lim
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Real-time multimedia transport has stringent QoS requirements, such as bandwidth, delay, jitter, and loss ratio. Wireless sensor networks are useful for streaming multimedia data in infrastructure-free and hazardous environments. However, these networks are composed of nodes with constrained bandwidth and energy. In QoS routing for wired networks, multipath routing is widely used. Some existing ad hoc routing algorithms also provide multipath routing. Directed diffusion has been commonly used for wireless sensor networks because of its energy efficiency and scalability. However, the basic protocol only routes packets through a single path, which barely meets the throughput requirement of multimedia data. Instead, we propose a multipath algorithm based on directed diffusion that reinforces multiple routes with high link quality and low latency. We use the NS-2 simulation tool with video trace generated by Multiple Description Coding (MDC) to evaluate the performance. The results show that our algorithm gives better throughput and delay performance than standard directed diffusion.
How to Analyze Free Text Descriptions for Recommending TV Programmes?
Authors: Bernd Ludwig, Stefan Mandl
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

This paper presents an approach to exploit free text de-scriptions of TV programmes as available from EPG data sets for a recommendation system that takes the content of programmes into account Our research is sponsored by Software-Offensive Bayern. Ferdinand Herrmann, Heike Ott, Kristina Makedonska, and Sebastian von Mammen provided valuable help implementing major parts of the presented system. The paper focusses on classifying free text descriptions in relation to natural language user queries.
Text extraction from images captured via mobile and digital devices
Authors: Yi Zhang, Kok Kiong Tan
Venue: International Journal of Computational Vision and Robotics (2009)

The paper presents the development of a human-machine interactive software application, specifically useful for text extraction from images, which are captured using mobile and digital devices with cameras. This software is the principal part of a full application, which is being developed to translate the text in such a captured image to another language. The full application will comprise of two stages: a processing stage (which is the part of concern in this paper) and a recognition stage. In the processing stage, an intelligent and adaptive algorithm will yield the essential information from the raw image. This paper will focus mainly on the development of the processing stage. In the recognition stage, the extracted text will be interpreted and translated through an optical character recognition (OCR) engine, which is widely available. The effectiveness of the proposed algorithm in meeting the challenges behind the processing of such images will be highlighted with real images.
Multi-focal learning and its application to customer service support
Authors: Yong Ge, Hui Xiong, Wenjun Zhou, Ramendra Sahoo, Xiaofeng Gao, Weili Wu
Venue: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining (2009)

In this study, we formalize a multi-focal learning problem, where training data are partitioned into several different focal groups and the prediction model will be learned within each focal group. The multi-focal learning problem is motivated by numerous real-world learning applications. For instance, for the same type of problems encountered in a customer service center, the problem descriptions from different customers can be quite different. The experienced customers usually give more precise and focused descriptions about the problem. In contrast, the inexperienced customers usually provide more diverse descriptions. In this case, the examples from the same class in the training data can be naturally in different focal groups. As a result, it is necessary to identify those natural focal groups and exploit them for learning at different focuses. The key developmental challenge is how to identify those focal groups in the training data. As a case study, we exploit multi-focal learning for profiling problems in customer service centers. The results show that multifocal learning can significantly boost the learning accuracies of existing learning algorithms, such as Support Vector Machines (SVMs), for classifying customer problems.
Learning Performance of Tikhonov Regularization Algorithm with Strongly Mixing Samples
Authors: Jie Xu, Bin Zou
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

The generalization performance is the main purpose of machine learning theoretical research. The previous bounds describing the generalization ability of Tikhonov regularization algorithm are almost all based on independent and identically distributed (i.i.d.) samples. In this paper we go far beyond this classical framework by establishing the bound on the generalization ability of Tikhonov regularization algorithm with exponentially strongly mixing observations. We then show that Tikhonov regularization algorithm with exponentially strongly mixing observations is consistent.
K3b 1.x compact
Authors: Markus Priemer
Venue:  (2007)

The official manual describes how to create CDs and DVDs with K3b. 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
Stimulating physical and social activity through open-ended play
Authors: Tilde Bekker, Janienke Sturm
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

In this paper, we describe our design research on tangible play objects that stimulate social and physical play. We illustrate our work by describing a design case about an open-ended play object for children called the ColorFlare. The ColorFlare is an object that detects the player's movements and provides light feedback and that can communicate with other ColorFlares. A user test is described that examined how children use the ColorFlare to collaboratively create various (physical) games. We relate our research to definitions of embodied interaction, for example by describing how children allocate meaning to the interaction behavior of the play objects and jointly create diverse games during the play sessions.