ppxscal/embedding_network huggingface dataset:
Gem #61: interfacing with C++ constructors
Authors: Javier Miranda, Arnaud Charlet
Venue: ACM SIGAda Ada Letters (2009)

In the previous Gem about generating bindings from C++ headers, we mentioned, without going into details, how to interface with C++ constructors in Ada using the CPP_Constructor pragma. In this Gem we present some common uses of C++ constructors in mixed-language programs in GNAT, and in the next Gem, we will show the use of some powerful Ada 2005 features in conjunction with C++ constructors.
Modification of metal/semiconductor junctions by self-assembled monolayer organic films
Authors: Fahrettin Yakuphanoglu, Salih Okur, Hüseyin Özgener
Venue: Microelectronic Engineering (2009)

Two new metal/molecule/semiconductor contacts, Au/n-Si/TDA/Au and Au/p-Si/ODM/Au, were fabricated to understand effect of organic compounds, tridecylamine and octadecylmercaptan self-assembled monolayer (SAM) films, on electrical charge transport properties of the metal/semiconductor junctions. The morphology of the organic monolayers deposited on Si substrates was investigated by atomic force microscopy. The molecular coverage of ODM deposited on p-Si is poorer than that of TDA on n-Si substrate. The ideality factors of the p-Si/ODM and n-Si/TDA diodes were found to be 1.66 and 1.48, respectively. The electrical results show that the tridecylamine monolayer passivated junction has a lower ideality factor. The ideality factor indicates clear dependence on two different type functional groups R-SH (Thiol) and R-NH"2 (Amin) groups and it increases with different functional groups of organic molecule. The barrier height @f"b value of the n-Si/TDA diode is smaller than that of p-Si/ODM diode, as a result of chain length of the SAM organic molecules. The interface state density D"i"t values of the diodes were determined using conductance technique. The n-Si/TDA diode has the smaller interface state density according to p-Si/ODM diode. We have evaluated that the organic molecules control the electronic parameters of metal/semiconductor diodes and thus, organic modification helps to get one step closer towards to new organic assisted silicon based microelectronic devices.
Database System for Archiving and Managing Remote Sensing Images
Authors: Jianting Shi, Yinan Chen, Chunyuan Liu
Venue: Proceedings of the 2009 First International Workshop on Database Technology and Applications (2009)

This paper discusses the establishment, management and application of remote sensing images database. A system structure for building remote sensing images database is presented and analyzed. This architecture is based on web services technology, rather than traditional Browser/Server or Client/Server model. To process and publish mass remote sensing images on the web, appropriate system framework and software platforms are adopted in order to establish stable website and create web map service. In our system, Oracle is used to store the remote sensing images and GIS data, ArcGIS Server to create web services and accomplish web applications, and ArcSDE to manage the geospatial data. WebGIS applications and enterprise applications are carried out by utilizing and developing the geospatial database. The distributed database system provides a new model to archive and manage geospatial images effectively.
Fault Diagnosis of Bearing Based on Empirical Mode Decomposition and Decision Directed Acyclic Graph Support Vector Machine
Authors: Qiumian Hao, Wang Ziying
Venue: Proceedings of the 2009 International Conference on Computational Intelligence and Natural Computing - Volume 02 (2009)

When faults of bearing happen, vibration signal of rotation machine always behave in complex form of modulation. The EMD can adaptively decompose signal according to the physical meaning of signal. The SVM has been used in many fields including fault diagnosis because of its excellent learning performance and favorable generalization capability. In this paper, energy eigenvector of frequency band is got through EMD. Fault diagnosis of bearings is realized by DDAGSVM. The most excellent model parameters are selected based on LOO. The final results indicate that the method based on EMD and DDAGSVM can effectively discriminate different faulty states of bearings.
BiDi screen: a thin, depth-sensing LCD for 3D interaction using light fields
Authors: Matthew Hirsch, Douglas Lanman, Henry Holtzman, Ramesh Raskar
Venue: ACM Transactions on Graphics (TOG) (2009)

We transform an LCD into a display that supports both 2D multi-touch and unencumbered 3D gestures. Our BiDirectional (BiDi) screen, capable of both image capture and display, is inspired by emerging LCDs that use embedded optical sensors to detect multiple points of contact. Our key contribution is to exploit the spatial light modulation capability of LCDs to allow lensless imaging without interfering with display functionality. We switch between a display mode showing traditional graphics and a capture mode in which the backlight is disabled and the LCD displays a pinhole array or an equivalent tiled-broadband code. A large-format image sensor is placed slightly behind the liquid crystal layer. Together, the image sensor and LCD form a mask-based light field camera, capturing an array of images equivalent to that produced by a camera array spanning the display surface. The recovered multi-view orthographic imagery is used to passively estimate the depth of scene points. Two motivating applications are described: a hybrid touch plus gesture interaction and a light-gun mode for interacting with external light-emitting widgets. We show a working prototype that simulates the image sensor with a camera and diffuser, allowing interaction up to 50 cm in front of a modified 20.1 inch LCD.
Early years learning with digital technologies: the relationship between research and design
Authors: Rosamund Sutherland, Sarah Eagle, Claire O'Malley, Andrew Manches, Dan Sutch
Venue: Proceedings of the 8th international conference on International conference for the learning sciences - Volume 3 (2008)

The overall aim of this symposium is to focus on the relationship between research and design of technologies for early years learning. Presentations will centre around two studies, one concerned with understanding the role that digital technologies play in shaping interactions between parents and young children in the home and the other with understanding the role of digital manipulatives in early years learning of numeracy in school. It will be argued that whereas a common theme emerging from these studies is the importance of shared physical and social interaction within early years learning, digital technologies for this age group tend to be designed for individual use. Participants will be invited to offer explanations for this emphasis on individual learning and discussion will focus on alternative approaches to design that might take into account the intimacy of the interaction between young children and adults.
Program Self-reference in Constructive Scott Subdomains
Authors: John Case, Samuel E. Moelius,  Iii
Venue: Proceedings of the 5th Conference on Computability in Europe: Mathematical Theory and Computational Practice (2009)

Intuitively, a recursion theorem asserts the existence of self-referential programs. Two well-known recursion theorems are Kleene's Recursion Theorem (krt) and Rogers' Fixpoint Recursion Theorem (fprt). Does one of these two theorems better capture the notion of program self-reference than the other? In the context of the partial computable functions over the natural numbers ( ), fprt is strictly weaker than krt, in that fprt holds in any effective numbering of in which krt holds, but not vice versa. It is shown that, in this context, the existence of self-reproducing programs (a.k.a. quines) is assured by krt, but not by fprt. Most would surely agree that a self-reproducing program is self-referential. Thus, this result suggests that krt is better than fprt at capturing the notion of program self-reference in .A generalization of krt to arbitrary constructive Scott subdomains is then given. (For fprt, a similar generalization was already known.) Surprisingly, for some such subdomains, the two theorems turn out to be equivalent. A precise characterization is given of those constructive Scott subdomains in which this occurs. For such subdomains, the two theorems capture the notion of program self-reference equally well.
Adaptive Anytime Motion Planning for Robust Robot Navigation in Natural Environments
Authors: Mihail Pivtoraiko
Venue: Proceedings of the 2009 Advanced Technologies for Enhanced Quality of Life (2009)

The problem of robot navigation is treated under constraints of limited perception horizon in complex, cluttered, natural environments. We propose a solution based on our previous work in fast constrained motion planning, where arbitrary mobility constraints could be satisfied while the planning problem is reduced to unconstrained heuristic search in state lattices. By trading off optimality, we improve planner run-times and increase robustness through achieving anytime planning quality, such that it becomes possible to integrate the planner within the high speed navigation framework. We show that using a planner in navigation works well and fast enough for real vehicle implementation, while it presents a number of important benefits over state-of-the-art in navigation.
Relative Pareto minimizers for multiobjective problems: existence and optimality conditions
Authors: Truong Q. Bao, Boris S. Mordukhovich
Venue: Mathematical Programming: Series A and B (2009)

In this paper we introduce and study enhanced notions of relative Pareto minimizers for constrained multiobjective problems that are defined via several kinds of relative interiors of ordering cones and occupy intermediate positions between the classical notions of Pareto and weak Pareto efficiency/minimality. Using advanced tools of variational analysis and generalized differentiation, we establish the existence of relative Pareto minimizers for general multiobjective problems under a refined version of the subdifferential Palais-Smale condition for set-valued mappings with values in partially ordered spaces and then derive necessary optimality conditions for these minimizers (as well as for conventional efficient and weak efficient counterparts) that are new in both finite-dimensional and infinite-dimensional settings. Our proofs are based on variational and extremal principles of variational analysis; in particular, on new versions of the Ekeland variational principle and the subdifferential variational principle for set-valued and single-valued mappings in infinite-dimensional spaces.
Brushless Direct Current Motor Control System Based on Digital Signal Processor
Authors: Miao Gao, Yanpeng Wang
Venue: Proceedings of the 2009 WASE International Conference on Information Engineering - Volume 01 (2009)

A speed regulating system is introduced for the permanent magnet brushless DC motor (PM-BLDCM). The digital signal processor (DSP) ADMCF328 is the core of the control system. Its special inside circuit for motor control reduces the hardware circuit, and its high data processing capacity makes the control convenient and exact.
Mediating Performance through Virtual Agents
Authors: Gabriella Giannachi, Marco Gillies, Nick Kaye, David Swapp
Venue: Proceedings of the 9th International Conference on Intelligent Virtual Agents (2009)

This paper presents the process of creation of virtual agents used in a virtual reality performance. The performance aimed to investigate how drama and performance could inform the creation of virtual agents and also how virtual reality could raise questions for drama and performance. The virtual agents were based on the performance of 2 actors. This paper describes the process of preparing the actors, capturing their performances and transferring them to the virtual agents. A second set of agents was created using non-professional `naïve performers' rather than actors.
Hierarchical control policy for dynamic resource management in grid virtual organization
Authors: Chunlin Li, Layuan Li
Venue: The Journal of Supercomputing (2009)

This paper proposes a hierarchical control system in grid virtual organization. The hierarchical system can be decomposed into multiple application groups, which can be further decomposed into multiple applications. At the top of the hierarchy, the global controller controls the gross allocation of resources to the groups. At the next level down, the group controller coordinates the local deployments of all applications that consume the local allocation of resources. At the lowest level, the local controllers adjust the local resource usages to optimize the utility of single application. The hierarchical control system considers all applications and coordinates all layers of grid architecture upon any changes. According to different time granularity, we adopt a different control scheme. The global control considers all applications and coordinates three layers of grid architecture in response to large system changes at coarse time granularity, while local control adapts a single application to small changes at fine granularity. This paper adopts utility-driven cross layer optimization for grid applications to find a system wide optimization and solves the cross-layer optimization by using pricing based decomposition. A set of hierarchical utility functions is used to measure the performance of the grid system that follows the system, group and application hierarchy. This paper uses total utility to measure the overall quality of grid system. The experiments are conducted to test the performance of the hierarchical control algorithms.
Rebuilding the Oxford Dictionary of English as a semantic network
Authors: James McCracken
Venue: Proceedings of the Workshop on Enhancing and Using Electronic Dictionaries (2004)

This paper describes a project to develop a lexicon for use both as an electronic dictionary and as a database for a range of NLP tasks. It proposes that a lexicon for such open-ended application may be derived from a human-user dictionary, retaining and enhancing the richness of its editorial content but abandoning its entry-list structure in favour of networks of relationships between discrete lexical objects, where each object represents a discrete lexeme-meaning unit.
Online Tree Node Assignment with Resource Augmentation
Authors: Joseph Wun-Tat Chan, Francis Y. Chin, Hing-Fung Ting, Yong Zhang
Venue: Proceedings of the 15th Annual International Conference on Computing and Combinatorics (2009)

Given a complete binary tree of height h, the online tree node assignment problem is to serve a sequence of assignment/release requests, where an assignment request, with an integer parameter 0 ≤ i ≤ h, is served by assigning a (tree) node at level (or height) i and a release request is served by releasing a specified assigned node. The node assignments have to guarantee that no node is assigned to two assignment requests unreleased, and every leaf-to-root path of the tree contains at most one assigned node. With assigned node reassignments allowed, the target of the problem is to minimize the number of assignments/reassigments, i.e., the cost, to serve the whole sequence of requests. This online tree node assignment problem is fundamental to many applications, including OVSF code assignment in WCDMA networks, buddy memory allocation and hypercube subcube allocation.Most of the previous results focus on how to achieve good performance when the same amount of resource is given to both the online and the optimal offline algorithms, i.e., one tree. In this paper, we focus on resource augmentation, where the online algorithm is allowed to use more trees than the optimal offline algorithm. By using different approaches, we give (1) a 1-competitive online algorithm, which uses (h + 1)/2 trees, and is optimal because (h + 1)/2 trees are required by any online algorithm to match the cost of the optimal offline algorithm with one tree; (2) a 2-competitive algorithm with 3h/8 + 2 trees; (3) an amortized (4/3 + ¿)-competitive algorithm with (11/4 + 4/(3¿)) trees, for any ¿ where 0 < ¿ ≤ 4/3.
Image Analysis and Machine Learning: How to Foster a Stronger Connection?
Authors: Stan Matwin
Venue: Proceedings of the 15th International Conference on Image Analysis and Processing (2009)

In this talk I am trying to answer the question stated in its title. I discuss some of the challenges encountered in the use of Machine Learning in image analysis, including examples from our own work. In particular, I look at examples of successful recent research that uses advanced Machine Learning for specific image analysis tasks. I try to generalize lessons learned from this successful research. I argue that some of the reasons for these successes are consistent with the current research trends in Machine Learning. These new approaches resolve some of the difficulties encountered in the past between the two fields, e.g. in the area of feature selection. I look further at some of the recent research trends in Machine Learning (e.g. Active Learning), which might be interesting in image analysis and processing. I also speculate that the new research in cognitive neuroscience might provide interesting cues to Artificial Intelligence in general, and to Computer Vision and image analysis in particular.
Comparison of Static Code Analysis Tools
Authors: Matti Mantere, Ilkka Uusitalo, Juha Roning
Venue: Proceedings of the 2009 Third International Conference on Emerging Security Information, Systems and Technologies (2009)

In this paper we compare three static code analysis tools. The tools represent three different approaches in the field of static analysis: Fortify SCA is a non-annotation based heuristic analyzer, Splint represents an annotation based heuristic analyzer, and Frama-C an annotation based correct analyzer. The tools are compared by analysing their performance when checking a demonstration code with intentionally implemented errors.
ISP-Driven Managed P2P Framework for Effective Real-Time IPTV Service
Authors: Seil Jeon, Younghan Kim, Jonghwa Yi, Shingak Kang
Venue: Proceedings of the 9th International Conference on Smart Spaces and Next Generation Wired/Wireless Networking and Second Conference on Smart Spaces (2009)

Over the years, in attempts to overcome client-server based limitations, a variety of Peer-to-Peer (P2P) technologies have been developed. This feature can contribute to robustness and scalability. However, it introduces network-oblivious traffic because of network-unaware peer selection. As P2P users have increased, so does the damage this problem causes. To solve this problem, various P2P model based on collaboration between ISP and P2P users have been recently suggested and then reduced network-oblivious traffic by removing biased peer selection. However, previous schemes have mainly focused on reducing traffic, which does improve network performance. In order to support effective real-time IPTV services, it should be required to not only reduce network-oblivious traffic, but it should also improve user performance such as delay and jitter because IPTV is an application sensitive to delay and jitter. In fact, the reduction of network-oblivious traffic improves user performance but it cannot always guarantee optimum performance experienced by real-time streaming service users. In this paper, we propose an ISP-driven managed P2P framework and peer selection mechanism for real-time IPTV user. For the evaluation, we use a QualNet 4.0 simulator and show proposed mechanism provides the performance effectively. Ultimately, we confirmed that ISPs should reflect the delay information of organized P2P network as well as the link traffic between each peer for effective real-time IPTV services.
Study on Interest-Based Association Rules Algorithm
Authors: Tieli Sun, Zhenghong Liu, Yanji Liu, Zhiying Li
Venue: Proceedings of the 2009 Asia-Pacific Conference on Information Processing - Volume 02 (2009)

Support and confidence are often used to evaluate if a rule is a strong rule or not in association rules mining. But a lot of redundant and even deceivable rules will be mine in the methodboth theoretically and practically .The paper adopts a new threshold—interest that it is correlative coefficientin the statistics. The result is more accurate and clear if interest is taken as the weighting rule by Comparison.
A Self-Organized Multiagent System for Intrusion Detection
Authors: Esteban J. Palomo, Enrique Domínguez, Rafael M. Luque, Jose Muñoz
Venue: Agents and Data Mining Interaction: 4th International Workshop, ADMI 2009, Budapest, Hungary, May 10-15,2009, Revised Selected Papers (2009)

This paper describes a multiagent system with capabilities to analyze and discover knowledge gathered from distributed agents. These enhanced capabilities are obtained through a dynamic self-organizing map and a multiagent communication system. The central administrator agent dynamically obtains information about the attacks or intrusions from the distributed agents and maintains a knowledge pool using a proposed growing self-organizing map. The approach integrates traditional mathematical and data mining techniques with a multiagent system. The proposed system is used to build an intrusion detection system (IDS) as a network security application. Finally, experimental results are presented to confirm the good performance of the proposed system.
Substructure discovery using minimum description length and background knowledge
Authors: Diane J. Cook, Lawrence B. Holder
Venue: Journal of Artificial Intelligence Research (1993)

The ability to identify interesting and repetitive substructures is an essential component to discovering knowledge in structural data. We describe a new version of our SUBDUE substructure discovery system based on the minimum description length principle. The SUBDUE system discovers substructures that compress the original data and represent structural concepts in the data. By replacing previously-discovered substructures in the data, multiple passes of SUBDUE produce a hierarchical description of the structural regularities in the data. SUBDUE uses a computationally-bounded inexact graph match that identifies similar, but not identical, instances of a substructure and finds an approximate measure of closeness of two substructures when under computational constraints. In addition to the minimumdescription length principle, other background knowledge can be used by SUBDUE to guide the search towards more appropriate substructures. Experiments in a variety of domains demonstrate SUBDUE's ability to find substructures capable of compressing the original data and to discover structural concepts important to the domain.
Community-Based Interoperability Utility for SMEs An Introduction of the Commius Prototype
Authors: Thomas Burkhart, Dirk Werth, Peter Loos
Venue: Proceedings of the 2009 IEEE Conference on Commerce and Enterprise Computing (2009)

The European Commius Project aims at enabling Small and Medium Enterprises (SMEs) to collaborate easily on the level of system, semantic and process interoperability by just the use of e-mail communication. This will be achieved by enrichment of incoming e-mails, depending on their contents (semantic interoperability), with additional information. Furthermore, recommendations of expedient further steps will be provided to process the e-mail (process interoperability). This demo-paper will give a short overview of a prototype developed in the course of the Commius Project.