ppxscal/embedding_network huggingface dataset:
Modeling Groundwater Quality with Bayesian Techniques
Authors: Khalil Shihab
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Bayesian Techniques are attractive and viable tools for modeling complex stochastic processes in general and the groundwater contamination process in particular. This is mainly because these techniques do not only emphasize the stochastic nature of this process but also the precision and the accuracy of the tested methods used by environmental laboratories. In this work, we describe the development and application of a prototype Dynamic Bayesian Network (DBN) that models groundwater quality in order to assess and predict the impact of pollutants on the water column.
Virtual Clusters
Authors: Ralph Butler, Zach Lowry, Chrisila C. Pettey
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Because of the comparative inexpensiveness of hardware and the availability of open source software, cluster computing has become common for institutions with moderate to large needs for high performance computing. One of the problems with cluster computing, though, is that debugging existing or new system software or analyzing the effects of altering system hardware can require that a cluster be offline for extended periods of time. What is needed is a system for creating virtual clusters that can be used for experimentation. In this paper we present a free system for creating virtual clusters (or comparable systems of machines) that requires very little expertise on the part of the user [6]. It facilitates short term experimentation with customized hardware configurations. An important advantage of our system is that it utilizes open source software such as QEMU [1], VDE [7], TUN/TAP [4], Python [5], and Debian GNU/Linux [2] to build virtual clusters. Another advantage of this system is that a user can easily set up a virtual cluster without having extensive knowledge of or experience with the aforementioned packages. Once the supporting framework has been established, the user merely writes a simple specification of the cluster and then deploys it. The specification language is an extension to XML which we call VCML (Virtual Cluster Markup Language). The specification is then "executed" by a system creation program which parses the spec and performs the operations necessary to deploy the virtual cluster.
Analyzing the Yield of ExScal, a Large-Scale Wireless Sensor Network Experiment
Authors: Sandip Bapat, Vinodkrishnan Kulathumani, Anish Arora
Venue: Proceedings of the 13TH IEEE International Conference on Network Protocols (2005)

Recent experiments have taken steps towards realizing the vision of extremely large wireless sensor networks, the largest of these being ExScal, in which we deployed about 1200 nodes over a 1.3km by 300m open area. Such experiments remain especially challenging because of: (a) prior observations of failure of sensor network protocols to scale, due to network faults and their spatial and temporal variability, (b) complexity of protocol interaction, (c) lack of sufficient data about faults and variability, even at smaller scales, and (d) current inadequacy of simulation and analytical tools to predict sensor network protocol behavior.In this paper, we present detailed data about faults, both anticipated and unanticipated, in ExScal. We also evaluate the impact of these faults on ExScal as well as the design principles that enabled it to satisfy its application requirements despite these faults. We describe the important lessons learnt from the ExScal experiment and suggest services and tools as a further aid to future large scale network deployments.
An HMM Implementation for On-line Handwriting Recognition - Based on Pen-Coordinate Feature and Pen-Direction Feature
Authors: Daiki Okumur, Seiichi Uchida, Hiroaki Sakoe
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

An on-line handwritten character recognition technique based on a new HMM is proposed. In the proposed HMM, not only pen-direction feature but also pen-coordinate feature are separately utilized for describing the shape variation of on-line characters accurately. Specijcally speaking, the proposed HMM outputs a pen-coordinate feature at each inter-state transition and outputs a pen-direction feature at each intra-state transition, i.e., self-transition. Thus, each state of the proposed HMM can specify the starting position and the direction of a line segment by its incoming inter-state transition and intra-state transition, respectively. The results of recognition experiments on 10-stroke Chinese characters show that the proposed HMM outperforms the conventional HMM which does not use the pen-coordinate feature because of its non-stationarity.
A 3Gb/s/wire Global On-Chip Bus with Near Velocity-of-Light Latency
Authors: Peter Caputa, Christer Svensson
Venue: Proceedings of the 19th International Conference on VLSI Design held jointly with 5th International Conference on Embedded Systems Design (2006)

We successfully show the practical feasibility of a purely electrical global on-chip communication link with near velocity-of-light delay. The implemented high-speed link comprises a 5mm long, fully shielded, repeaterless, on-chip global bus reaching 3Gb/s/wire in a standard 0.18 µm CMOS process. Transmission-line-styleinterconnects are achieved by routing signal wires in the thicker top metal M6 layer and utilizing a metal M4 ground return plane to realize near velocity-of-lightdata transmission. The nominal wire delay is measured to 52.8ps corresponding to 32% of the velocity of light in vacuum. A 22% measured worst-case crosstalk induced delay variation is dominated by inductive coupling.
Feedback Control Static Scheduling for Real-Time Distributed Embedded Systems
Authors: Tolga Ayav, Yves Sorel
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

This paper presents an implementation of feedback control strategy on distributed static scheduling. The static schedule is created taking into account the average execution times of the tasks. Feedback control algorithm handles the unestimated dynamic behaviors in the system and keeps the performance at a desired level. The approach of feedback control supporting static scheduling yields more flexible scheduling, low scheduling overhead and better resource utilization while preserving the real-time constraints.
Building Information Systems by Orchestrating Open Services
Authors: KhaIid Belhajjame, Genoveva Vargas-Solar, Christine Collet
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

Service oriented computing has gained a considerable momentum as a new paradigm for building enterprise information systems. Notable efforts have been made recently from both researchers and industrials to support the construction of service-based applications, nevertheless several issues still need to be tackled including service definition and adaptation, and services orchestration. This work proposes an approach for bulding and finely orchestrating open and adaptable services. An open service is represented by a workflow that coordinates calls to service provider methods. Thereby component activities and the way they are synchronized are rendered visible. Service adaptability refers to the possibility to modify an open service. Through adaptation operations a service can be customized according to given user (application) requirements. In order to finely orchestrate services, they are associated with energy points. An entry point acts as a gateway for inserting and getting information about the progress of service execution. Defined services and orchestration are verified to ensure a correct behaviour of the resulting application. The paper details our approach for building and orchestrating services, and presents associated architectural choices.
Towards Effective Web Resources Management An Empirical Study and a Web Mining Approach
Authors: Irene S. Y. Kwan
Venue: Proceedings of the The Fifth International Conference on Computer and Information Technology (2005)

The unpredictable workload generated by surfers on an Electronic commerce (EC) site poses challenges to web sites maintenance. Proactive maintenance on web site is important. This depends much on how to best characterize its workload profile. An EC site would consist of a list of core EC processes, the demand on these EC functions forecast is critical for sustaining the site performance within the Service Level Agreements (SLA). The service demand of on-line functions determines the resources utilization that supports the operations. In e-market, online companies must meet customers' expectation on Quality of Services (QoS) to sustain its profit. This paper attempts to propose a model to proactively anticipating performance problems with the waves of changing customers' demand. A web mining approach is applied on the server's log file of an empirical web site. The resulting knowledge would foster the development of better management on web resources of EC sites.
A Corpus for Comparative Evaluation of OCR Software and Postcorrection Techniques
Authors: Stoyan Mihov, Klaus U. Schulz, Christoph Ringlstetter, Veselka Dojchinova, Vanja Nakova
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

We describe a new corpus collected for comparative evaluation of OCR-software and postcorrection techniques. The corpus is freely available for academic groups and use. The major part of the corpus (2306 files) consists of Bulgarian documents. Many of these documents come with Cyrillic and Latin symbols. A smaller corpus with German documents has been added. All original documents represent real-life paper documents collected from enterprises and organizations. Most genres of written language and various document types are covered. The corpus contains the corresponding image files, rich meta-data, textual files obtained via OCR recognition, ground truth data for hundreds of example pages, and alignment software for experiments.
Snapshots in Real-Time Databases Using Database Pointer Transactions
Authors: Dag Nystrom, Mikael Nolin, Christer Norstrom
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

We present 2V-DBP-SNAP, an algorithm that allows hard real-time tasks in an embedded real-time control system to read a snapshot of a number of data elements in a real-time database. Furthermore, 2V-DBP-SNAP allows these data elements to be shared with soft real-time tasks, which access them using a database query language, and with other hard real-time tasks that use database pointers. 2V-DBP-SNAP allows temporal behavior and memory consumption to be accurately predicted. Introducing snapshot transactions is beneficial for embedded control-systems, such as for engine control in an automotive system, since a snapshot of the state of the environment can be collected, e.g., the state of all cylinders in the engine. 2V-DBP-SNAP is lightweight and predictable, both with respect to computational and memory overhead, and is therefore highly suited for resource constrained systems.
Performance Improvement Techniques for Chinese Character Recognition
Authors: Hsi-Jian Lee, Jen. .. Tsan Huang
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

The existence of characters with various font families or italic face will decrease the performance of character recognition significantly. This paper aims to improve the performance of a multi..font Chinese character recognition system. We first obtain the angle in italic..face characters. If the characters of a text line belong to the italic face, we straighten the characters in the text line. Then we determine the font family of the text line. If the family is Ming..font, which has more distinct features than other fonts to be extracted, we recognize the text line by the Ming..font kernel. In post..processing,we use font family information to adjust the recognition results and select the most promising recognition candidate. Experimental results show the effectiveness of the proposed system.
Seven mile boots
Authors: Martin Pichlmair
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

With seven-league boots through the Internet - when you take a stroll through the physical world in this wireless LAN footwear, you just might meet people who happen to be spending some time in a chat-room. Their virtual conversations are made audible as spoken text coming out of the boots.
Service Adaptation Using Fuzzy Theory in Context-Aware Mobile Computing Middleware
Authors: Jiannong Cao, Na Xing, Alvin T. S. Chan, Yulin Feng, Beihong Jin
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

Context-aware mobile computing middleware is designed to automatically adapt its behavior to changing environment. To achieve this, an important issue to be addressed is how to effectively select services for adaptation according to the user¿s current context. Existing work does not adequately address this issue. In this paper, we propose a Fuzzy-based Service Adaptation Model (FSAM) that can be used in context-aware middleware. We formulate the service adaptation process by using fuzzy linguistic variables and membership degrees to define the context situations and the rules for adopting the policies of implementing a service. We propose three fitness functions to calculate the fitness degree for each policy based on the distance of fuzzy status between the policy and the current context situation. The decision for service adaptation is achieved by selecting the policy with the largest fitness degree. A context-aware application scenario called Campus Assistant is used to exemplify the proposed service adaptation process and demonstrate its effectiveness.
Realizing Maximum Product Revenue Utilizing a Product Revenue Model
Authors: Martin Coe
Venue: Proceedings of the 18th International Conference on Systems Engineering (2005)

Due to the complexity of product development and countless issues to manage, resources to optimize and objectives to achieve, how can an organization satisfy all? In this paper we discuss a key product development and business objective, maximizing product revenue, and how to achieve it utilizing a product revenue model. A description of the models components, its implementation during the product development lifecycle and the effective control of five key model parameters are described. Correlation between the development and use of this model to achieve objectives and the organizational system by which products are developed is shown.
A Discontinuous Subgrid Eddy Viscosity Method for the Time-Dependent Navier--Stokes Equations
Authors: Songul Kaya, Béatrice Rivière
Venue: SIAM Journal on Numerical Analysis (2005)

In this paper we provide an error analysis of a subgrid scale eddy viscosity method using discontinuous polynomial approximations for the numerical solution of the incompressible Navier--Stokes equations. Optimal continuous in time error estimates of the velocity are derived. The analysis is completed with some error estimates for two fully discrete schemes, which are first and second order in time, respectively.
Adaptive learning among interacting agents: an analysis of the many-agent, long term limit
Authors: Paul Dupuis
Venue:  (2005)

We consider a kind of dynamical system that has a large number of interacting agents, who have a finite number of resources or strategies (called alternatives) from which they can choose in a given time period. The agents' collective choices lead to costs and benefits for each agent in the given period. Agents then adapt, possibly changing their choice of alternative for the next period, based on the information obtained in the current period. The information available to each agent is partial in the sense that an agent may observe the choices, or the effects of the choices, of only some of the other agents. Agents have different initial opinions about the state of the system, and must adapt relatively slowly since the system as a whole is non-stationary. The adaptive behavior of the agents can be described by stochastic approximation algorithms. We are interested in studying the loading of such a system, namely what choices of alternative prevail and whether these are stable asymptotically. We consider a law of large numbers limit to capture the effect of large numbers of agents interacting. Because there are so many agents, the environment is noncooperative; agents do not negotiate among themselves before choosing the next alternative. Mathematically, the system is described by a measure-valued stochastic process, the measure-valued state space being necessary to describe the diversity of agents' opinions. This process is interpolated into continuous time, and we prove existence and uniqueness results for the limit process (after letting the number of users go to infinity and time become continuous). Given suitable conditions, we also establish stability results for the process. Our framework is applicable to any environment that has a large number of interacting agents, who do not necessarily know or agree on the current state of the system. Possible areas of application include discrete choice theory in sociology, island models in economics, traffic assignment problems, and learning in game theory.
Adaptive error-constrained method for LMS algorithms and applications
Authors: Sooyong Choi, Te-Won Lee, Daesik Hong
Venue: Signal Processing (2005)

An adaptive error-constrained least mean square (AECLMS) algorithm is derived and proposed using adaptive error-constrained optimization techniques. This is accomplished by modifying the cost function of the LMS algorithm using augmented Lagrangian multipliers. Theoretical analyses of the proposed method are presented in detail. The method shows improved performance in terms of convergence speed and misadjustment. This proposed adaptive error-constrained method can easily be applied to and combined with other LMS-type stochastic algorithms. Therefore, we also apply the method to constant modulus criterion for blind method and backpropagation algorithm for multilayer perceptrons. Simulation results show that the proposed method can accelerate the convergence speed by 2 to 20 times depending on the complexity of the problem.
Combination of an optimization model for hardware selection with data determination methods
Authors: A.-W. Scheer
Venue: ACM SIGSIM Simulation Digest (1977)

The selection of an EDP configuration often fixes a firm to a single manufacturer for a long time and the capabilities of the chosen computer will continually influence the firm's organization. Only few approaches exist to give assistance to the investors by developing useful decision models based on the investment theory /11, 12/. The hardware selection methods /4, 13/ used up to now, like benchmark tests, don't meet these demands. In this paper an investment model based on mathematical programming is developed which considers the aspects of investment for hardware selection.
On Unavoidable Sets of Word Patterns
Authors: Alexander Burstein, Sergey Kitaev
Venue: SIAM Journal on Discrete Mathematics (2005)

We introduce the notion of unavoidable (complete) sets of word patterns, which is a refinement for that of words, and study certain numerical characteristics for unavoidable sets of patterns. In some cases we employ the graph of pattern overlaps introduced in this paper, which is a subgraph of the de Bruijn graph and which we prove to be Hamiltonian. In other cases we reduce a problem under consideration to known facts on unavoidable sets of words. We also give a relation between our problem and the extensively studied universal cycles and prove that there exists a universal cycle for word patterns of any length over any alphabet. The Stirling numbers of the second kind and the M&ouml;bius function appear in our results.
Signaling cost and performance of SIGMA: A seamless handover scheme for data networks: Research Articles
Authors: Shaojian Fu, Mohammed Atiquzzaman, Liran Ma, Yong-Jin Lee
Venue: Wireless Communications Mobile Computing (2005)

Mobile IP has been developed to handle mobility of Internet hosts at the network layer. Mobile IP (MIP), however, suffers from a number of drawbacks such as requirement of infrastructure change, high handover latency, high packet loss rate, and conflict with network security solutions. In this paper, we describe and evaluate the performance of SIGMA, a Seamless IP diversity-based Generalized Mobility Architecture. SIGMA utilizes multihoming to achieve seamless handover of mobile hosts, and is designed to solve many of the drawbacks of MIP, including requirement for changes in infrastructure. We first evaluate the signaling cost of SIGMA and compare with that of hierarchical Mobile IPv6 (an enhancement of Mobile IP) by analytical modeling, followed by comparison of handover performance of SIGMA and Mobile IPv6 enhancements. Criteria for performance evaluation include handover latency, packet loss, throughput, and network friendliness. Our results indicate that in most cases SIGMA has a lower signaling cost than Hierarchical Mobile IPv6. Moreover, for a typical network configuration, SIGMA has a higher handover performance over Mobile IP. Copyright &copy; 2005 John Wiley & Sons, Ltd.
An adaptation framework for new media artworks
Authors: Anis Ouali, Brigitte Kerhervé, Paul Landon
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we are interested in adaptation mechanisms for the design, creation and experimentation of adaptive and interactive new media artworks. Through a concrete case study, we propose an adaptation framework that combines semantic and physical adaptation and that can be specialized to the specific needs of various new media artists. This adaptation framework is supported by an adaptation engine, the kernel of the software architecture we are currently building. We have validated our adaptation framework through the implementation of a prototype of the adaptation engine. This prototype integrates the management of various types of metadata and allows a representation of adaptation scenarios as policies of the form event-condition-action.We present how we used our adaptation engine to reconstruct and experiment the adaptation model of The Man of the Crowd, an existing adaptive new media installation, where the artist introduces a semantic adaptation of the video content displayed on four screens, according to the relative position of the viewer in the artistic installation.
Finding Reducts Without Building the Discernibility Matrix
Authors: Marcin Korze, Szymon Jaroszewicz
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

We present algorithms for fast generation of short reducts which avoid building the discernibility matrix explicitly. We show how information obtained from this matrix can be obtained based only on the distributions of attribute values. Since the size of discernibility matrix is quadratic in the number of data records, not building the matrix explicitly gives a very significant speedup and makes it possible to find reducts even in very large databases. Algorithms are given for both absolute and relative reducts. Experiments show that our approach outperforms other reduct finding algorithms. Furthermore it is shown that many heuristic reduct finding algorithms using the discernibility matrix in fact select attributes based on their Gini index. A new definition of conditional Gini index is presented, motivated by reduct finding heuristics.