ppxscal/embedding_network huggingface dataset:
Experiments with Adaptive Transfer Rate in Reinforcement Learning
Authors: Yann Chevaleyre, Aydano Machado Pamponet, Jean-Daniel Zucker
Venue: Knowledge Acquisition: Approaches, Algorithms and Applications: Pacific Rim Knowledge Acquisition Workshop, PKAW 2008, Hanoi, Vietnam, December 15-16, 2008, Revised Selected Papers (2009)

Transfer algorithms allow the use of knowledge previously learned on related tasks to speed-up learning of the current task. Recently, many complex reinforcement learning problems have been successfully solved by efficient transfer learners. However, most of these algorithms suffer from a severe flaw: they are implicitly tuned to transfer knowledge between tasks having a given degree of similarity. In other words, if the previous task is very dissimilar (resp. nearly identical) to the current task, then the transfer process might slow down the learning (resp. might be far from optimal speed-up). In this paper, we address this specific issue by explicitly optimizing the transfer rate between tasks and answer to the question : "can the transfer rate be accurately optimized, and at what cost ?". We show that this optimization problem is related to the continuum bandit problem. We then propose a generic adaptive transfer method (AdaTran), which allows to extend several existing transfer learning algorithms to optimize the transfer rate. Finally, we run several experiments validating our approach.
Enabling enterprise mashups over unstructured text feeds with InfoSphere MashupHub and SystemT
Authors: David E. Simmen, Frederick Reiss, Yunyao Li, Suresh Thalamati
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Enterprise mashup scenarios often involve feeds derived from data created primarily for eye consumption, such as email, news, calendars, blogs, and web feeds. These data sources can test the capabilities of current data mashup products, as the attributes needed to perform join, aggregation, and other operations are often buried within unstructured feed text. Information extraction technology is a key enabler in such scenarios, using annotators to convert unstructured text into structured information that can facilitate mashup operations. Our demo presents the integration of SystemT, an information extraction system from IBM Research, with IBM's InfoSphere MashupHub. We show how to build domain-specific annotators with SystemT's declarative rule language, AQL, and how to use these annotators to combine structured and unstructured information in an enterprise mashup.
SMIL State: an architecture and implementation for adaptive time-based web applications
Authors: Jack Jansen, Dick C. Bulterman
Venue: Multimedia Tools and Applications (2009)

In this paper we examine adaptive time-based web applications (or presentations). These are interactive presentations where time dictates which parts of the application are presented (providing the major structuring paradigm), and that require interactivity and other dynamic adaptation. We investigate the current technologies available to create such presentations and their shortcomings, and suggest a mechanism for addressing these shortcomings. This mechanism, SMIL State, can be used to add user-defined state to declarative time-based languages such as SMIL or SVG animation, thereby enabling the author to create control flows that are difficult to realize within the temporal containment model of the host languages. In addition, SMIL State can be used as a bridging mechanism between languages, enabling easy integration of external components into the web application. Finally, SMIL State enables richer expressions for content control. This paper defines SMIL State in terms of an introductory example, followed by a detailed specification of the State model. Next, the implementation of this model is discussed. We conclude with a set of potential use cases, including dynamic content adaptation and delayed insertion of custom content such as advertisements.
Reflective techniques in extensible languages
Authors: John H. Reppy
Venue:  (2008)

An extensible programming language allows programmers to use the language to modify one or more of the language's syntactic, static-semantic, and/or dynamic-semantic properties. This dissertation presents Mython, a variant of the Python language, which affords extensibility of all three language properties. Mython achieves extensibility through a synthesis of reflection, staging, and compile-time evaluation. This synthesis allows language embedding, language evolution, domain-specific optimization, and tool development to be performed in the Mython language. This work argues that using language-development tools from inside an extensible language is preferable to using external tools. The included case study shows that users of an embedded differential equation language are able to work with both the embedded language and embedded programs in an interactive fashion&mdash;simplifying their work flow, and the task of specifying the embedded language.
Exploitation of the wikipedia category system for enhancing the value of LCSH
Authors: Yoji Kiyota, Hiroshi Nakagawa, Satoshi Sakai, Tatsuya Mori, Hidetaka Masuda
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

This paper addresses an approach that integrates two different types of information resources: the Web and libraries. Our method begins from any keywords in Wikipedia, and induces related subject headings of LCSH through the Wikipedia category system.
Accurate electron mobility extraction in nMOSFETs by RF split CV
Authors: G. Hyvert, F. Calmon, T. Nguyen, A. Poncet, C. Plossu
Venue: Microelectronic Engineering (2009)

In this paper, an accurate capacitance extraction method, based on high frequency measurements (100MHz-1GHz), is used to study the carrier mobility in conventional nMOSFETs and metal/high-k gate stacked nMOSFETs. Simulations have been made to extract the main physical parameters. Effective carrier mobility is extracted, using a split CV methodology and a comparison is drawn between RF (radio frequency) and LF (low frequency) measurements for RF dedicated devices. Several problems encountered during high frequency measurements are also discussed. Finally, a method for using RF split CV with any kind of devices is proposed.
Smart antenna UKM testbed for digital beamforming system
Authors: Mohammad Tariqul Islam, Norbahiah Misran, Baharudin Yatim
Venue: EURASIP Journal on Advances in Signal Processing (2009)

A new design of smart antenna testbed developed at UKM for digital beamforming purpose is proposed. The smart antenna UKM testbed developed based on modular design employing two novel designs of L-probe fed inverted hybrid E-H (LIEH) array antenna and software reconfigurable digital beamforming system (DBS). The antenna is developed based on using the novel LIEH microstrip patch element design arranged into 4 × 1 uniform linear array antenna. An interface board is designed to interface to the ADC board with the RF front-end receiver. The modular concept of the system provides the capability to test the antenna hardware, beamforming unit, and beamforming algorithm in an independent manner, thus allowing the smart antenna system to be developed and tested in parallel, hence reduces the design time. The DBS was developed using a high-performance TMS320C67112™ floating-point DSP board and a 4-channel RF front-end receiver developed in-house. An interface board is designed to interface to the ADC board with the RF front-end receiver. A four-element receiving array testbed at 1.88-2.22 GHz frequency is constructed, and digital beamforming on this testbed is successfully demonstrated.
H∞ control design for fuzzy discrete-time singularly perturbed systems via slow state variables feedback: An LMI-based approach
Authors: Jiuxiang Dong, Guang-Hong Yang
Venue: Information Sciences: an International Journal (2009)

This paper addresses the H"~ control problem via slow state variables feedback for discrete-time fuzzy singularly perturbed systems. At first, a method of evaluating the upper bound of singular perturbation parameter @e with meeting a prescribed H"~ performance bound requirement is given. Subsequently, two methods for designing H"~ controllers via slow state variables feedback are presented in terms of solutions to a set of linear matrix inequalities (LMIs). In particular, one of them can be used to improve the upper bound of the singular perturbation parameter @e. Finally, two numerical examples are given to illustrate the effectiveness of the proposed methods.
Student Plagiarism in an Online World: Problems and Solutions
Authors: Tim Roberts, Tim Roberts
Venue:  (2007)

Twenty years ago, plagiarism was seen as an isolated misdemeanor, restricted to a small group of students. Today it is widely recognized as a ubiquitous, systemic issue, compounded by the accessibility of content in the virtual environment. Student Plagiarism in an Online World: Problems & Solutions describes the legal and ethical issues surrounding plagiarism, the tools and techniques available to combat the spreading of this problem, and real-life situational examples to further the understanding of the scholars, practitioners, educators, and instructional designers who will find this book an invaluable resource.
Towards design principles for effective context- and perspective-based web mining
Authors: Vijay K. Vaishnavi, Art Vandenberg, Yanqing Zhang, Saravanaraj Duraisamy
Venue: Proceedings of the 4th International Conference on Design Science Research in Information Systems and Technology (2009)

A practical and scalable web mining solution is needed that can assist the user in processing existing web-based resources to discover specific, relevant information content. This is especially important for researcher communities where data deployed on the World Wide Web are characterized by autonomous, dynamically evolving, and conceptually diverse information sources. The paper describes a systematic design research study that is based on prototyping/evaluation and abstraction using existing and new techniques incorporated as plug and play components into a research workbench. The study investigates an approach, DISCOVERY, for using (1) context/perspective information and (2) social networks such as ODP or Wikipedia for designing practical and scalable human-web systems for finding web pages that are relevant and meet the needs and requirements of a user or a group of users. The paper also describes the current implementation of DISCOVERY and its initial use in finding web pages in a targeted web domain. The resulting system arguably meets the common needs and requirements of a group of people based on the information provided by the group in the form of a set of context web pages. The system is evaluated for a scenario in which assistance of the system is sought for a group of faculty members in finding NSF research grant opportunities that they should collaboratively respond to, utilizing the context provided by their recent publications.
Constructive solution and the kinetostatics of moves decoupling for an orientation robotomechanism
Authors: Nicolae Bercan, Valentin Petrescu, Radu Bercan
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

In this paper there is presented a constructive solution to a trimobil oriented robotomechanism that has the coupling grade equal to three, moved be tendons, with decoupling motions, proposed by the authors, for which it is provided the structural, cinematic and static analyze. It is presented a new variant of oriented robotomechanism, made of a proper orientation mechanism (A) and a decoupling mechanism (B) made itself of differential mechanisms and monomobile mechanisms with tendons. The results obtained are useful to the inventors and designers who are working in the industrial robots' area.
BASH: A backhaul-aided seamless handoff scheme for Wireless Mesh Networks
Authors: Yan He, Dmitri Perkins
Venue: Proceedings of the 2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks (2008)

Wireless Mesh Networks (WMNs) are comprised of mesh routers whose relatively small transmission range may result infrequent handoffs, leading to high packet delays and loss rates and limiting the performance of real-time applications over WMNs. In this work, we propose BASH - a backhaul-aided seamless handoff scheme. Our scheme takes advantage of the wireless backhaul feature of WMNs and allows a mobile station to probe the neighboring mesh routers by accessing the backhaul channel. After the probe request, the mobile station is able to switch back to its primary communication channel and resume its ongoing communication without waiting for the probe responses. The currently associated mesh router of the mobile station collects the probe responses and selects the new mesh route on behalf of the mobile station. Our works show that by utilizing the wireless backhaul, BASH (1) reduces the probing latency and, thus, the Layer-2 handoff latency; (2) allows partial overlap of the Layer-2 and Layer-3 handoffs, reducing the overall handoff latency; and (3) shortens the authentication latency by utilizing the transitivity of trust relationship. The experimental results show that BASH achieves an average Layer-2 handoff of 8.7ms, which supports the real-time applications during the handoff.
Four techniques for online handling of out-of-vocabulary words in Arabic-English statistical machine translation
Authors: Nizar Habash
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

We present four techniques for online handling of Out-of-Vocabulary words in Phrase-based Statistical Machine Translation. The techniques use spelling expansion, morphological expansion, dictionary term expansion and proper name transliteration to reuse or extend a phrase table. We compare the performance of these techniques and combine them. Our results show a consistent improvement over a state-of-the-art baseline in terms of BLEU and a manual error analysis.
Technical communique: When is a Mittag-Leffler function a Nussbaum function?
Authors: Yan Li, YangQuan Chen
Venue: Automatica (Journal of IFAC) (2009)

In this communique, we present a new family of Nussbaum functions expressed by Mittag-Leffler functions under certain conditions.
Analyzing Computer Mediated and Face-to-Face Interactions: Implications for Active Support
Authors: Wouter van Diggelen, Maarten Overdijk, Jerry Andriessen
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

In this paper, we argue that co-constructive activities of learners are not solely confined to the problem at hand or to the process of collaboration, but that they are also directed at the pre-defined structural features of the tool. Although these features are defined in advance, they become meaningful in interaction. Learners re-construct these structures in activity through a process of appropriation during which 'new' structures emerge that guide the collaborative learning activities. It is hypothesized that the learner-external artefact interactions may be an additional source for modelling problem-solving discussions. We will support our line of reasoning with observations of computer mediated interactions from a study that we carried out in a real-life classroom setting.
A new inequality of Ostrowski-Grüss type and applications to some numerical quadrature rules
Authors: Marek Niezgoda
Venue: Computers Mathematics with Applications (2009)

In this paper we derive some Gruss and Ostrowski-Gruss type inequalities for functions in L^p-spaces. As applications, we provide some new estimates for the error in some numerical integration rules. In particular, we deal with the mid-point and trapezoid quadrature rules.
Global alignment of protein–protein interaction networks by graph matching methods
Authors: Mikhail Zaslavskiy, Francis Bach, Jean-Philippe Vert
Venue: Bioinformatics (2009)

Motivation: Aligning protein–protein interaction (PPI) networks of different species has drawn a considerable interest recently. This problem is important to investigate evolutionary conserved pathways or protein complexes across species, and to help in the identification of functional orthologs through the detection of conserved interactions. It is, however, a difficult combinatorial problem, for which only heuristic methods have been proposed so far. Results: We reformulate the PPI alignment as a graph matching problem, and investigate how state-of-the-art graph matching algorithms can be used for that purpose. We differentiate between two alignment problems, depending on whether strict constraints on protein matches are given, based on sequence similarity, or whether the goal is instead to find an optimal compromise between sequence similarity and interaction conservation in the alignment. We propose new methods for both cases, and assess their performance on the alignment of the yeast and fly PPI networks. The new methods consistently outperform state-of-the-art algorithms, retrieving in particular 78% more conserved interactions than IsoRank for a given level of sequence similarity. Availability: All data and codes are freely and publicly available upon request. Contact: jean-philippe.vert@mines-paristech.fr
An industry survey of autonomic infrastructure
Authors: Michael Keith Nunez, Gary Mueller
Venue: Proceedings of the 6th international conference industry session on Autonomic computing and communications industry session (2009)

Autonomic Computing is in the initial stage of definition and development. A key step in the development of autonomic systems is the building and adoption of standard middleware or infrastructure. Infrastructure provides the plumbing and support structure for autonomic systems. Key infrastructure components for autonomic systems include hardware and software sensors, standard communication links, protocols including packet and payload, metadata standards, knowledge engines, and a generally agreed upon knowledge taxonomy and structuring of knowledge. This paper describes the current infrastructure options being applied on a virtual storage project at Sun Microsystems. It describes the choices made and the advantages and disadvantages of those choices. Toward the end of the paper there is a brief discussion of current roadblocks to advancement of autonomic systems in the industry.
A Bag of Strings Representation for Image Categorization
Authors: Julien Ros, Christophe Laurent, Jean-Michel Jolion
Venue: Journal of Mathematical Imaging and Vision (2009)

This paper presents an architecture well suited for natural images classification or visual object recognition applications. The method proposes to integrate a spatial representation into the well known "bag of local signatures" approach. For this purpose, it combines the power of a string representation which provides an ordered view of local features with the vectorial histogram representation allowing to recognize efficiently and quickly an image by using a machine learning classifier. To reach this goal, we propose to represent an image by a set of strings of local signatures obtained by tracking the detected salient points along image edges. We propose here to conjointly use the Hölder exponents and the direction of minimal regularity of the bidimensional signal singularities to compute a signature describing precisely a region of interest centered on an interest point. As we will see, an alphabet of strings is easily obtained by using a typical self organizing map architecture. As a consequence, a "bag of strings" representation is used, providing a compact representation encoding both local signatures and spatial information. This representation is particularly well suited to train a support vector machine classifier used for the last classification step. This architecture obtains good classification rates on different well known datasets.
Proceedings of the Fifth International Workshop on Data Management on New Hardware
Venue: Data Management On New Hardware (2009)

The aim of this one-day workshop is to bring together researchers who are interested in optimizing database performance on modern computing infrastructure by designing new data management techniques and tools.
Feature extraction for pulmonary crackle representation via wavelet networks
Authors: Mete Yeginer, Yasemin P. Kahya
Venue: Computers in Biology and Medicine (2009)

In this study, wavelet networks have been used to parameterize and quantify pulmonary crackles with an aim to depict the waveform with a small set of meaningful parameters. Complex Morlet wavelets are used at the nodes of both single and double-node networks to model the waveforms with the double-node rendering smaller modeling error. The features extracted from the model parameters have been compared with the conventional time domain features in a two-class clustering experiment with nearly 90% matching between the clusters of different parameter sets and with the model parameters forming clusters more closely distributed around their means and better separated from each other. Moreover, using simulated crackles embedded on real respiratory sounds, features extracted from wavelet networks have been shown to be more robust to background vesicular sounds compared to conventional parameters which are very sensitive to noise.
A note on non-closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) states
Authors: Jian-Liang Xu, Yun-Xia Liu, Tsunehiro Yoshinaga
Venue: Journal of Computer Science and Technology (2006)

1-inkdot alternating pushdown automaton is a slightly modified alternating pushdown automaton with the additional power of marking at most 1 tape-cell on the input (with an inkdot) once. This paper investigates the closure property of sublogarithmic space-bounded 1-inkdot alternating pushdown automata with only existential (universal) states, and shows, for example, that for any function L(n) such that L(n) ≥ log log n and L(n) = o(log n), the class of sets accepted by weakly (strongly) L(n) space-bounded 1-inkdot two-way alternating pushdown automata with only existential (universal) states is not closed under concatenation with regular sets, length-preserving homomorphism, and Kleene closure.
Technical solutions for integrated trading on spot, futures and bonds stock markets
Authors: Vlad Diaconita, Ion Lungu, Adela Bara
Venue: WSEAS Transactions on Information Science and Applications (2009)

This article is an extended version of a paper presented in the WSEAS MCBE09 conference [10] in which we will present in more detail practical solution for building an integration tier between an online trading platform and two stock exchange markets, in a SOA like architecture. Our solution is constructed using XML, Java and PL/SQL and not third-party costly solutions. This open source approach, even if it is more difficult to develop and implement at first, helps a company to control the solution. The system will not be tied to SOA vendors that are usually keeping their software as secret as possible, demanding that they will develop, an additional costs, all the future developments. We are using XML for communication, not only because of the constraints given by the systems we integrate, but also because it is the natural choice in a SOA like solution. XML it's being used to enable web services and similar, often custom, RPC functionality to allow greater access to data across multiple systems within an organization and allowing the possibility of future systems to be created from collections of such RPC functionality [5, 6].