ppxscal/embedding_network huggingface dataset:
Feature Extraction for Dynamic Integration of Classifiers
Authors: Mykola Pechenizkiy, Alexey Tsymbal, Seppo Puuronen, David Patterson
Venue: Fundamenta Informaticae (2007)

Recent research has shown the integration of multiple classifiers to be one of the most important directions in machine learning and data mining. In this paper, we present an algorithm for the dynamic integration of classifiers in the space of extracted features (FEDIC). It is based on the technique of dynamic integration, in which local accuracy estimates are calculated for each base classifier of an ensemble, in the neighborhood of a new instance to be processed. Generally, the whole space of original features is used to find the neighborhood of a new instance for local accuracy estimates in dynamic integration. However, when dynamic integration takes place in high dimensions the search for the neighborhood of a new instance is problematic, since the majority of space is empty and neighbors can in fact be located far from each other. Furthermore, when noisy or irrelevant features are present it is likely that also irrelevant neighbors will be associated with a test instance. In this paper, we propose to use feature extraction in order to cope with the curse of dimensionality in the dynamic integration of classifiers. We consider classical principal component analysis and two eigenvector-based class-conditional feature extraction methods that take into account class information. Experimental results show that, on some data sets, the use of FEDIC leads to significantly higher ensemble accuracies than the use of plain dynamic integration in the space of original features.
Competitive analysis of financial games
Authors: R. El-Yaniv
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

In the unidirectional conversion problem an on-line player is given the task of converting dollars to yen over some period of time. Each day, a new exchange rate is announced and the player must decide how many dollars to convert. His goal is to minimize the competitive ratio. defined as sup/sub E/ (P/sub OPT/(E)/P/sub X/E) where E ranges over exchange rate sequences. P/sub OPT/(E) is the number of yen obtained by an optimal off-line algorithm, and Px(E) is the number of yen obtained by the on-line algorithm X. The authors also consider a continuous version of the problem. in which the exchange rate varies over a continuous time interval. The on-line line players a priori information about the fluctuation of exchange rates distinguishes different variants of the problem. For three variants they show that a simple threat-based strategy is optimal for the on-line player and determine its competitive ratio. They also derive and analyze an optimal policy for the on-line player when he knows the probability distribution of the maximum value that the exchange rate will reach. Finally, they consider a bidirectional conversion problem, which the player may trade dollars for yen or yen for dollars.
Review: Review of soil water models and their applications in Australia
Authors: Kemachandra Ranatunga, Eloise R. Nation, David G. Barratt
Venue: Environmental Modelling Software (2008)

Agriculture is the highest consumer of water resources in Australia. Soil water models play a vital role in agriculture in terms of estimating water use, water allocation and current water status at a given scale. This paper reviews widely-used soil water models developed in Australia over the last three to four decades that have been used to simulate soil water status at various temporal and spatial scales. These models are categorised in terms of their complexity. This paper provides an overview of soil water models and the basic modelling techniques employed by each model. Considerable emphasis is given to matching existing data availability with input data requirements for each model to identify the limitations of model application in terms of data availability. A comprehensive review of the application of soil water models is also given, supported by assessments of individual model performance. The limitations and assumptions made under various approaches to soil water modelling are subsequently examined. Research and policy agencies are focusing more and more on incorporating temporal models into spatial modelling frameworks for natural resources and water management purposes. These are consequently being used much more in the process of policy development. Complex models, whose wide-range application is often hampered by a lack of specific data, should have their processes simplified in order to be accommodated into spatial frameworks where appropriate. Biophysical processes within simple models should consider new data sources and understanding so as to gain more accurate predictions.
Unsafe chromium from cotton ginneries and development of a rubberized cotton fabric roller for cotton roller gins
Authors: Gurumurthy Vijayan Iyer, Nikos E. Mastorakis
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

This paper realizes the hazards of chromium contamination and pollution caused in the use of chrome composite leather-clad (CCLC) rollers commonly used in cotton roller ginning industries and attempts to eliminate the chromium contamination and pollution during the complete process. The cotton roller ginning process is the mechanical separation of cotton fibres from their seeds by means of one or more rollers to which fibres adhere while the seeds are impeded and struck off or pulled loose. Most of the cotton ginning operations are done using roller gins. The CCLC roller coverings contain about 18000 to 30000 mg/kg (ppm) as total chromium of trivalent and hexavalent forms which are toxic to human health. When the seed-cotton is ginned, due to the persistent rubbing of CCLC rollers over the fixed knives, the cotton and its products get contaminated with the total chromium of trivalent and hexavalent forms. Gin and mill workers are exposed to this chromium pollution and are susceptible to health hazards since toxic effects are produced by prolonged contact with airborne or solid or liquid chromium compounds even in small quantities. The three pollutants namely cotton dust, chromium and leather powder and/or other foreign matter, under favorable conditions of sunlight (photo energy), humidity, temperature and air movement interact and produce chrome specific dust (CSD) which is a serious pollutant due to synergistic interacting function. To offset this problem, pollution-free rubberized cotton fabric (RCF) eco-friendly rollers for both the laboratory and commercial studies have been designed, fabricated and used in experiments in rollers gins. This nullifies chromium contamination and pollution during the complete process. Cotton technological parameters are well proven for commercial acceptance.
A Cost Effective Rate Control for Streaming Video Dedicated to Wireless Handheld Devices
Authors: Youn-Sik Hong, Hwa-Seok Lim, Jun-Sik Hong
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

In a recent VoD application, a stationary VoD server delivers video stream to a mobile device, particularly PDA, over wireless. Typically, the sending rate at the server is faster than the playback rate at a handheld device. Therefore, it can’t receive streaming video as possible as the sending rate even if there is no congestion and extremely low BER over wireless. Our objective is to develop a simple cost effective rate control scheme using a buffer level at a mobile device. We classify the buffer at a mobile device into three distinct states depending on its level (occupancy). For each of these states a different rate control scheme is formulated. Since the sending rate increases as the inter-packet delay (IPD) at the sender decreases, we vary IPD to control the rate with its state. Adjustable parameters used in our proposed method are calibrated using our empirical results. These measurements were carried out on a test-bed which reproduces a real prototype of the wired-cum-wireless topology.
Software design using UML for empowering end-users with an external domain specific language
Authors: Uri Shani, Aviad Sela
Venue: Proceedings of the 4th international workshop on End-user software engineering (2008)

Domain Specific Languages (DSL) also known as "small languages" lack the power of a general purpose language (GPL), but are very productive for the purpose they are designed. While "internal" DSLs require and rely on the use of a hosting GPL, "external" DSLs are independent of a GPL and are thus more suitable for the non-programmer - but domain expert - end-user. Empowering this end-user via DSLs is our prime goal as software designers and architects. Our product will be stronger since much of the final tuning of the application can be done by the end-user and will reduce the number of software revisions that require stringent GPL software testing and validations. As software engineers, the design of a DSL as part of our product should fit into the tools of the trade of software development. We adopt UML for this purpose and propose that the design of DSL can be embedded as an extension of the traditional software modeling and design tools. In this paper we present firstly a view of software development process in which DSLs are an integral part, and than how we use UML to design a DSL which, via empowering a domain expert end-user, achieves challenging software delivery requirements with good stability and excellent performance.
Fighting packet loss on IP video streams
Authors: Jose Miguel Piquer, Felipe Lalanne, Cristian Junge
Venue: Proceedings of the 4th international IFIP/ACM Latin American conference on Networking (2007)

Packet loss is a major consideration factor, especially in real-time applications. Since it cannot be avoided, its effect has to be minimized. We propose an end-to-end approach, analyzing different transmission strategies and error concealment methods to minimize image degradation at the receiver. The proposed system uses pixel shuffling techniques for packet transmission and median filtering concealment techniques for diminishing the impact produced by losses.
Modelling and Control of a Wheelchair on Two Wheels
Authors: Salmiah Ahmad, M. O. Tokhi
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Wheelchairs on two wheels are needed for disabled persons to perform some of the essential tasks in their living and work environments. In fact it offers great advantages and efficiency for the user. Besides allowing a disabled to lead independent life, it is expected not to take much space during mobility as compared to when it is on four wheels and thus a wheelchair on two wheels has associated design and development challenges. These include modelling and controller design for the system to perform comparably similar to normal four-wheeled wheelchair. In this paper physical model of a wheelchair on two wheels that mimics double inverted pendulum is designed and a novel fuzzy logic control mechanism is developed and tested with control of the two-wheeled wheelchair.
Prediction of Membrane Protein Types by an Ensemble Classifier Based on Pseudo Amino Acid Composition and Approximate Entropy
Authors: Pei-Ying Zhao, Yong-Sheng Ding
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Membrane proteins have different types. The function of a membrane protein is closely correlated with the type it belongs to. For a given membrane protein, it belongs to the following eight categories [1]: (1) type I, (2) type II, (3) type III, (4) type IV, (5) multipass, (6) lipid-chain-anchored, (7) GPI-anchored, and (8) peripheral. It is important to decide which type it belongs to because it is closely relevant to its biological function and to its interaction process with other molecules in a biological system. In this study, on the basis of the concept of pseudo amino acid (PseAA) composition originally introduced by Chou, the value of approximate entropy (ApEn) of the query membrane protein is used to integrate the complementary information. An ensemble classifier to fuse fifteen powerful individual FKNN (fuzzy K-nearest neighbor) classifiers is presented. Here each basic classifier is trained in PseAA composition of membrane protein sequences with different parameters. The success rates obtained by the ensemble classifier on both the jackknife dataset test and the independent dataset test are quite high, indicating that the ensemble classifier may become a very useful high throughput tool in identifying membrane proteins and their types.
Making place for clutter and other ideas of home
Authors: Laurel Swan, Alex S. Taylor, Richard Harper
Venue: ACM Transactions on Computer-Human Interaction (TOCHI) (2008)

In this article, we examine the containment of clutter in family homes and, from this, outline considerations for design. Selected materials from an ethnographically informed study of home life are used to detail the ways in which families contain their clutter in bowls and drawers. Clutter, within these containers, is found to be made up of a heterogeneous collection of things that, for all manner of reasons, hold an ambiguous status in the home. It is shown that bowls and drawers provide a &ldquo;safe&rdquo; site of containment for clutter, giving the miscellany of content the &ldquo;space&rdquo; to be properly dealt with and classified, or to be left unresolved. The shared but idiosyncratic practices families use to contain their clutter are seen to be one of the ways in which the home, or at least the idea of home, is collectively produced. It is also part of the means by which families come to make their homes distinct and unique. These findings are used to consider what it might mean to design for the home, and to do so in ways that are sensitive to the idiosyncratic systems of household organization. In conclusion, thought is given to how we design for people's ideas of home, and how we might build sites of uncertainty into homes, where physical as well as digital things might coalesce.
Self-monitoring for sensor networks
Authors: Dezun Dong, Yunhao Liu, Xiangke Liao
Venue: Proceedings of the 9th ACM international symposium on Mobile ad hoc networking and computing (2008)

Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry out monitoring operations. Such an assumption, however, is often difficult for a large scale sensor network. In this work, we focus on designing an efficient scheme integrated with good self-monitoring capability as well as providing an infrastructure for various security protocols using local monitoring. To the best of our knowledge, we are the first to present the formal study on finding optimized self-monitoring topology for WSNs. We show the problem is NP-complete even under the unit disk graph (UDG) model, and give the upper bound on the approximation ratio. We further propose two distributed polynomial algorithms with provable approximation ratio to address this issue. Through comprehensive simulations, we evaluate the effectiveness of this design.
Modified Routing Algorithm for AODV in Constrained Conditions
Authors: G. S. Tomar
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

On-demand routing protocol exhibits abnormal behavior during high mobility and multiple data streams sent to a common destination. This may decay the performance of adhoc on demand distance vector routing (AODV). The proposed work is aimed at performance improvement in internet connectivity by applying local congestion methods in routing protocols. This method increases the packet delivery ratio of AODV even in constrained conditions to a satisfactory level, which has been major concern in the routing algorithm in mobile ad hoc networks. The results are also convincing in improvement in normalized routing load and end to end delay. The numerical results of this work are having improvement over existing algorithms upto 27%.
Learning Similarity with Operator-valued Large-margin Classifiers
Authors: Andreas Maurer
Venue: The Journal of Machine Learning Research (2008)

A method is introduced to learn and represent similarity with linear operators in kernel induced Hilbert spaces. Transferring error bounds for vector valued large-margin classifiers to the setting of Hilbert-Schmidt operators leads to dimension free bounds on a risk functional for linear representations and motivates a regularized objective functional. Minimization of this objective is effected by a simple technique of stochastic gradient descent. The resulting representations are tested on transfer problems in image processing, involving plane and spatial geometric invariants, handwritten characters and face recognition.
A value-based approach for documenting design decisions rationale: a replicated experiment
Authors: Davide Falessi, Rafael Capilla, Giovanni Cantone
Venue: Proceedings of the 3rd international workshop on Sharing and reusing architectural knowledge (2008)

The explicit documentation of the rationale of design decisions is a practice generally encouraged but rarely implemented in industry because of a variety of inhibitors. Known methods for Design Decisions Rationale Documentation (DDRD) are aimed to maximize the benefits for practitioners who should utilize the DDRD by imposing the burden on the developers of documenting all the potentially useful information. In our view, the adoption of a tailored DDRD, consisting only of the required set of information, would mitigate the effects of DDRD inhibitors. This paper focuses on confirming empirically the feasibility of a value-based approach for documenting the rationale behind design decisions, and the importance of different DDRD information categories. In this context, this work describes a replicated experiment carried out at the University Rey Juan Carlos of Madrid (Spain) aimed to validate previous results from an analogous study conducted at the University of Roma Tor Vergata (Italy). Results confirm that the level of utility related to the same category of DDRD information significantly changes depending on its purpose.
The edge chromatic number of a directed-mixed multigraph
Authors: Leonid S. Mel'nikov, Vadim G. Vizing
Venue: Journal of Graph Theory (1999)

We consider colorings of the directed and undirected edges of a mixed multigraph G by an ordered set of colors. We color each undirected edge in one color and each directed edge in two colors, such that the color of the first half of a directed edge is smaller than the color of the second half. The colors used at the same vertex are all different. A bound for the minimum number of colors needed for such colorings is obtained. In the case where G has only directed edges, we provide a polynomal algorithm for coloring G with a minimum number of colors. An unsolved problem is formulated. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 31: 267&ndash;273, 1999 Both authors carried out this work during their visit to Odensse University in March, 1995.
A Reusable Component-Based Library for GUI Regression Testing
Authors: Hao Chen, Beiji Zou, Naizheng Bian, Lili Pan
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The widespread use of Graphical user interfaces (GUIs) makes the GUIs construction more and more complicated. It makes the GUIs testing become a challenging problem. In this paper, a framework of component-based library (CBL) for GUI regression testing is proposed. Test components, which encapsulate associated properties, operations and meta-information, are defined as reusable object. Three key processes of CBL are introduced in detail. The first process is the CBL organization structure based on message mechanism. The second process is the test components regeneration guidelines for GUI testing. The third process is to divide test procedure into several phases to improve the testing efficiency. The phases include message segment capture phase, component abstract phase, regenerate test component phase and component-driven testing phase. Experimental results show that CBL model can performance well and the proposed reusable component for GUI regression testing can regenerate a large number of test cases automatically and efficiently.
Dynamic Weighted Majority: An Ensemble Method for Drifting Concepts
Authors: J. Zico Kolter, Marcus A. Maloof
Venue: The Journal of Machine Learning Research (2007)

We present an ensemble method for concept drift that dynamically creates and removes weighted experts in response to changes in performance. The method, dynamic weighted majority (*DWM*), uses four mechanisms to cope with concept drift: It trains online learners of the ensemble, it weights those learners based on their performance, it removes them, also based on their performance, and it adds new experts based on the global performance of the ensemble. After an extensive evaluation---consisting of five experiments, eight learners, and thirty data sets that varied in type of target concept, size, presence of noise, and the like---we concluded that *DWM* outperformed other learners that only incrementally learn concept descriptions, that maintain and use previously encountered examples, and that employ an unweighted, fixed-size ensemble of experts.
Efficient out-of-core algorithms for linear relaxation using blocking covers
Authors: C. E. Leiserson
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

When a numerical computation fails to fit in the primary memory of a serial or parallel computer, a so-called "out-of-core" algorithm must be used which moves data between primary and secondary memories. In this paper, we study out-of-core algorithms for sparse linear relaxation problems in which each iteration of the algorithm updates the state of every vertex in a graph with a linear combination of the states of its neighbors. We give a general method that can save substantially on the I/O traffic for many problems. For example, our technique allows a computer with M words of primary memory to perform T=/spl Omega/(M/sup 1/5/) cycles of a multigrid algorithm for a two-dimensional elliptic solver over an n-point domain using only /spl Theta/(nT/M/sup 1/5/) I/O transfers, as compared with the naive algorithm which requires /spl Omega/(nT) I/O's.
Dynamic label placement for improved interactive exploration
Authors: Thierry Stein, Xavier Décoret
Venue: Proceedings of the 6th international symposium on Non-photorealistic animation and rendering (2008)

This work presents a novel approach for dynamically rendering annotations attached to a 3D scene. We formulate the problem as a general optimization under constraints, accounting for certain desirable properties. To approximately solve the NP-hard optimization problem in real-time, we present a particular heuristic that greedily places labels while maintaining constraints. Typical greedy label placement algorithms do not pay particular attention to the order of placement and, as a result, suffer from the fundamental limitation that successive labels get progressively more difficult to place. We use algorithmic and mathematical tools that compensate for the drawback of typical greedy approaches. In addition, they are well suited for GPU implementation, because they are completely image based. As a result, we can place tens of labels in real-time, as demonstrated in this paper.