ppxscal/embedding_network huggingface dataset:
Design and analysis of robust controllers
Authors: V. I. George, C. P. Kurian
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

In this paper, we address the problem of analyzing and designing robust controller given plants whose dynamic contains significant uncertainty. The proposed work comprises an H* controller design problem for a class of stable/unstable plants and selecting suitable weighting functions W/sub 1/ and W/sup 2/ which satisfies both robust performance and robust stability. We modify the above controller design by making use of the theory of H* parameter space method. And we compare the performance characteristics of the control system.
An Architecture for an XML-Template Engine Enabling Safe Authoring
Authors: Falk Hartmann
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Existing template languages and engines do not give guarantees about the results of the instantiation process. As this is a possible source of errors and the reason for additional testing efforts, the proposed architecture that allows guarantees about the instantiated template will increase the quality of applications incorporating template engines, like Web Content Management Systems and UML tools. The implementation of this architecture for the generation of XML documents using template techniques concludes the article.
Enabling 1,000,000-entity simulations on distributed Linux clusters
Authors: Gene Wagenbreth, Ke-Thia Yao, Dan M. Davis, Robert F. Lucas, Thomas D. Gottschalk
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The Information Sciences Institute and Caltech are enabling USJFCOM and the Institute for Defense Analyses to conduct entity-level simulation experiments using hundreds of distributed computer nodes on Linux Clusters as a vehicle for simulating millions of JSAF entities. Included below is the experience with the design and implementation of the code that increased scalability, thereby enabling two orders of magnitude growth and the effective use of DoD high-end computers. A typical JSAF experiment generates several terabytes of logged data, which is queried in near-real-time and for months afterward. The amount of logged data and the desired database query performance mandated the redesign of the original logger system's monolithic database, making it distributed and incorporating several advanced concepts. System procedures and practices were established to reliably execute the global-scale simulations, effectively operate the distributed computers, efficiently process and store terabytes of data, and provide straightforward access to the data by analysts.
Determination of process durations on virtual construction sites
Authors: Hans-Joachim Bargstädt, Arno Blickling
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The paper analyses the application of 3D gaming technologies in the simulation of processes associated with human resources and machinery on construction sites in order to determine process costs. It addresses the problem of detailing in process simulation. The authors outline special boundary conditions for the simulation of cost-relevant resource processes on virtual construction sites. The approach considers different needs for detailing in process simulation during the planning and building phase. For simulation of process costs on a construction site (contractors' view) the level of detail has to be high. A prototype for determination of process durations (and hereby process costs) developed at the Bauhaus University Weimar is presented as a result of ongoing researches on detailing in process simulation. It shows the method of process cost determination on a high level of detail (game between excavator and truck) through interaction with the virtual environment of the site.
Cross-layer protocol design for real-time multimedia applications over 802.11 b networks
Authors: S. A. Khayam, S. Karande, M. Krappel, H. Radha
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

Inherent vulnerability of the wireless medium renders it more susceptible to errors and losses than classical wired media. In this paper, we evaluate the suitability of protocols and strategies across different layers of the stack to provide real-time services over 802.11b wireless LANs. More specifically, within the context of cross-layer design, we compare the performance of UDP with UDP lite - a proposed framework, which improves bandwidth utilization by delivering partially damaged packets to the realtime application. First, we study the high-level end-to-end throughput improvement achieved by making cross-layer modifications to support a UDP lite framework. We compare the quality of perceived media rendered by UDP (dropped packets only) and UDP lite (dropped and corrupted packets). This formulates one of the key findings of this study, that is, although UDP lite improves the overall high-level throughput by relaying corrupted packets to the real-time application, it fails to provide significant enhancement in perceived media quality. This can, in part, be attributed to the bursty nature of errors and losses that we observed at the application layer regardless of the selected transport protocol. Finally, we compare the error-recovery/concealment overhead required by UDP and UDP lite in order to deliver lossless multimedia. We conclude that the overhead required by UDP lite is considerably lower than UDP, since the received corrupted packets that are delivered by UDP lite (but not by UDP) facilitate error-recovery.
Simulation analysis of truck driver scheduling rules
Authors: Eric C. Ervin, Russell C. Harris
Venue: Proceedings of the 36th conference on Winter simulation (2004)

2004 brought a landmark event in the changes to regulations governing hours of service for truck drivers. This paper describes an effort utilizing modeling and simulation for evaluating the impact of the new 2004 Hours of Service (HOS) rules in scheduling and dispatching one of the largest random over-the-road (OTR) trucking fleets in North America. The model was comprehensive and enterprise-wide in nature, modeling unique order-to-delivery process characteristics for over 120,000 freight lanes and the continuous nature of the driver's work day. Model results provided quantification of the 2004 HOS impact on fleet utilization, cycle times and customer service. Results of the model were used to guide company strategy related to drivers, customers and operations. With five months of actual business performance collected regarding the new HOS in 2004, a post-mortem analysis has provided insight regarding the quality of simulation model forecasts done in 2003.
Kernel-based Template Alignment
Authors: Igor Guskov
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

This paper introduces a novel kernel-based method for template tracking in video sequences. The method is derived for a general warping transformation, and its application to affine motion tracking is further explored. Our approach is based on maximization of the multi-kernel Bhattacharyya coefficient with respect to the warp parameters. We explicitly compute the gradient of the similarity functional, and use a quasi-Newton procedure for optimization. Additionally, we consider a simple extension of the method that employs an illumination model correction to allow tracking under varying lighting conditions. The resulting tracking procedure is evaluated on a number of examples including large templates tracking non-rigidly moving textured areas.
Uncontrollability set for multi-input dynamical systems depending on parameters
Authors: A. A. Mailybaev
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Linear multi-input dynamical systems smoothly depending on parameters are considered. The generic (typical) structure of the uncontrollability set, consisting of parameter values corresponding to uncontrollable systems, is described. A construction perturbation theory for numerical analysis of the uncontrollability set is developed. As an example, the uncontrollability set is found for a mechanical system depending on three parameters.
The Inferior Temporal Lobe Mediates Distracter-Resistant Visual Search of Patients with Spatial Neglect
Authors: Radek Ptak, Nathalie Valenza
Venue: Journal of Cognitive Neuroscience (2005)

Although impaired visual search is a core deficit of patients with spatial neglect, current evidence is not conclusive about the mechanisms underlying this failure. We present evidence from 14 neglect patients searching for a target defined by two perceptual features that visual search is mediated by mechanisms of attentional competition. Participants were tested in three search conditions with constant target and distracter positions: Distracters did not share any feature with the target; distracters shared one feature with the target; two distracters shared one feature and one distracter shared the other feature with the target (mixed condition). Whereas search performance of healthy participants was comparable across conditions, neglect patients had a significant contralesional slowing in the mixed condition compared with the other two conditions. A detailed lesion analysis revealed that involvement of the parietal lobe did not predict the degree of distractibility in visual search. In contrast, neglect patients with high distractibility had more frequent damage to the inferior temporal lobe, suggesting a preliminary role of this region for competitive attentional processes involved in visual search of spatial neglect patients.
Feature Extraction of Clusters Based on FlexDice
Authors: Tomotake NAKAMURA, Yoko KAMIDOI, Shinichi WAKABAYASHI, Noriyoshi YOSHIDA
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

We have developed a fast clustering method FlexDice for large high-dimensional data sets[10]. General clustering methods including FlexDice may be able to find data groups consisting of similar data objects, but they have difficult problems of setting some input parameters to suitable values and showing features of clustering results intelligibly. Then, in order to construct a clustering system with user-friendly interface, we propose a feature extraction method for clustering results. We find a feature of clustering results by using FlexDice again and extracting clusters which differ widely from the distribution of data objects in each attribute with ordinary clusters.
The Mean-Partition Problem
Authors: Fei-Hwang Chang, Frank K. Hwang, Uriel G. Rothblum
Venue: Journal of Global Optimization (2006)

In mean-partition problems the goal is to partition a finite set of elements, each associated with a d-vector, into p disjoint parts so as to optimize an objective, which depends on the averages of the vectors that are assigned to each of the parts. Each partition is then associated with a d × p matrix whose columns are the corresponding averages and a useful approach in studying the problem is to explore the mean-partition polytope, defined as the convex hull of the set of matrices associated with feasible partitions.
Online MDL-Markov analysis of a discussion process in CSCL
Authors: Maomi Ueno, Toshio Okamoto
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

An online visualization system of a discussion process in computer-supported collaborative learning (CSCL) has been developed to assist learners by enabling them to monitor the actual states of their discussion and allowing them to improve their learning community. The unique features of this system are 1) the learners have to select the most suitable category that represents his/her message content from the choices presented in the developed BBS and 2) the proposed system estimates the structure of the Markov from the stored categories' data sequences and visualizes the structure online. We demonstrate the effectiveness of this system using actual data and provide some evaluations. The results show that the proposed system motivates the learners and improves their methods of discussion.
An advanced simulation tool-set for video transmission performance evaluation
Authors: Ku-Lan Kao, Chih-Heng Ke, Ce-Kuen Shieh
Venue: Proceeding from the 2006 workshop on ns-2: the IP network simulator (2006)

Presenting an advanced simulation tool-set for video transmission performance evaluation is the objective of this paper. This tool-set integrates NS-2 with Evalvid plus a new coding mechanism: Multiple Description Coding (MDC). Using the integrated NS-2 simulator, researchers can easily evaluate specific transmission performance of a variety of videos varying in codec or coding mechanisms. Researchers can analyze their own design, such as their own improved network protocols or QoS control schemes, in a realistic simulation environment without delving into the simulator itself. Besides, by using the tool-set, researchers can acquire video transmission quality not only with former evaluation metrics, but also with real recombined video, which can be played out and observed. In conclusion, researchers who utilize our evolved simulation tool-set will benefit from speedily verifying their video transmission over wireless network designs.
An oscillatory neural model of multiple object tracking
Authors: Yakov Kazanovich, Roman Borisyuk
Venue: Neural Computation (2006)

An oscillatory neural network model of multiple object tracking is described. The model works with a set of identical visual objects moving around the screen. At the initial stage, the model selects into the focus of attention a subset of objects initially marked as targets. Other objects are used as distractors. The model aims to preserve the initial separation between targets and distractors while objects are moving. This is achieved by a proper interplay of synchronizing and desynchronizing interactions in a multilayer network, where each layer is responsible for tracking a single target. The results of the model simulation are presented and compared with experimental data. In agreement with experimental evidence, simulations with a larger number of targets have shown higher error rates. Also, the functioning of the model in the case of temporarily overlapping objects is presented.
Chronicles of teaching: using computer-based communication to tell stories and reflect about teaching
Authors: Wayne A. Nelson, Randall E. Smith
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

In recent years, research in teacher education has focused on ways to promote reflection by beginning teachers. The research project described in this paper elicits the help of hypermedia computer technology to encourage and facilitate communication among teacher education students, as they develop abilities to view classroom situations from multiple perspectives, suggest alternative explanations of classroom events, and use theoretical principles to support or evaluate decisions.
An Accurate and Convenient Undo Mechanism for Refactorings
Authors: Katsuhisa Maruyama
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Refactoring makes existing source code more understandable and reusable without changing observable behavior. Therefore, applying refactorings to existing source code and reversing the effects of past refactorings are inseparable from tool support to software development and maintenance. This paper proposes a powerful undo mechanism that uses a chain of past refactorings for each source file and determines which refactoring is undoable by monitoring the last refactoring in every chain. The proposed undo mechanism can make an undesired refactoring accurately undone although the refactoring has affected multiple source files. Moreover, it permits a programmer to compatibly execute operations of refactoring undo and editorial undo/redo without the limitation of manual edit of files. A running implementation of the mechanism has been integrated into our developed refactoring browser.
Monitoring the Security Health of Software Systems
Authors: Ashish Aggarwal, Pankaj Jalote
Venue: Proceedings of the 17th International Symposium on Software Reliability Engineering (2006)

Detecting security bugs during the development cycle of a software is extremely difficult as effective testing approaches for such bugs do not exist. Applications are often deployed without being tested for security vulnerabilities even though the application domain demands highly secure software. Hence there is a need to develop systems which can monitor such applications for security violations and take immediate actions if any violation occurs. In this paper we describe an approach for monitoring the security health of a software system. Our methodology involves an agent based approach which communicates with the health monitoring system running as an independent process. We make this agent a part of the application(binary) and modify the binary at appropriate locations to transfer the control to the agent attached. The agent sends critical information regarding the execution to the monitoring system. The monitoring system analyzes the data and takes suitable actions. Currently our system monitors the following security bugs - buffer overflow, race conditions( Time of Check to Time to Use vulnerability), random number vulnerability and can be extended for other vulnerabilities also.
Counting formulas associated with some random matrix averages
Authors: Peter J. Forrester, Alex Gamburd
Venue: Journal of Combinatorial Theory Series A (2006)

Moments of secular and inverse secular coefficients, averaged over random matrices from classical groups, are related to the enumeration of non-negative matrices with prescribed row and column sums. Similar random matrix averages are related to certain configurations of vicious random walkers and to the enumeration of plane partitions. The combinatorial meaning of the average of the characteristic polynomial of random Hermitian and Wishart matrices is also investigated, and consequently several simple universality results are derived.
Concealed Data Aggregation for Reverse Multicast Traffic in Sensor Networks: Encryption, Key Distribution, and Routing Adaptation
Authors: Dirk Westhoff, Joao Girao, Mithun Acharya
Venue: IEEE Transactions on Mobile Computing (2006)

Routing in wireless sensor networks is different from that in commonsense mobile ad-hoc networks. It mainly needs to support reverse multicast traffic to one particular destination in a multihop manner. For such a communication pattern, end-to-end encryption is a challenging problem. To save the overall energy resources of the network, sensed data needs to be consolidated and aggregated on its way to the final destination. We present an approach that 1) conceals sensed data end-to-end by 2) still providing efficient and flexible in-network data aggregation. The aggregating intermediate nodes are not required to operate on the sensed plaintext data. We apply a particular class of encryption transformations and discuss techniques for computing the aggregation functions "average” and "movement detection.” We show that the approach is feasible for the class of "going down” routing protocols. We consider the risk of corrupted sensor nodes by proposing a key predistribution algorithm that limits an attacker's gain and show how key predistribution and a key-ID sensitive "going down” routing protocol help increase the robustness and reliability of the connected backbone.
Quasireform of English Spelling
Authors: Neville Holmes
Venue: Computer (2006)

Using the computer to change our spelling without changing the Spelling.
Towards a Maturity Model for Learning Organizations - the Role of Knowledge Management
Authors: Lena Aggestam
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Organizations of today must learn how to learn in order to become competitive. How an organization reaches maturity clearing this area is not clear. This paper presents an initial version of a maturity model aiming to set directions for how to become a Learning Organization, and to assist people when discussing where in this process the organization finds itself in. Future work consists of detailing the model and develops guidelines for how to measure maturity.
Dynamic simulation of a push - pull distribution system
Authors: Payman Jula, Mark S. Zschocke
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper presents the methodology of the development and the results of a simulation model used to capture the complexities of sulphur distribution system run by Sultran Ltd. in Western Canada. Sulphur is a valuable by-product of natural gas which should be continuously transported from the gas plants to avoid plant shutdowns. The sulphur is routed via rail to port terminals, where ships with variable demands arrive. The empty cars are then assigned back to gas plants for reloading. This closed-loop rail transportation system is challenging to simulate due to the push-pull nature of the system, the high degree of variability, as well as the interdependency of simulated elements. The problem becomes even more challenging when we consider many tactical and operational policies. The developed model is used to study the results of different operations management policies and help the mangers make appropriate decisions.
Using monte carlo simulation to choose among alternative statistical definitions
Authors: David M. Northcutt
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We frequently need to come to agreement with our customers about the formulas that will be used to calculate various statistics relating to the measurement of contractual terms and conditions. In many cases there is only one generally accepted operational definition, but in other cases, such as computing percentiles, there are multiple definitions that can be considered. This presentation looks at work I have done using Monte Carlo simulation to compare two different formulas for estimating a population percentile from small samples; the application is the analysis of benchmarking data. This work compares two different percentile calculations by comparing the performance of both approaches under multiple probability models with respect to estimation of the 10th, 25th, 50th, 75th, and 90th percentiles. In addition, a non-parametric confidence interval generation method for each of these percentiles was also examined to determine how well it performed relative to its stated 95% confidence level. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Performance evaluation of backoff algorithms in 802.11 ad-hoc networks
Authors: T. Razafindralambo, F. Valois
Venue: Proceedings of the 3rd ACM international workshop on Performance evaluation of wireless ad hoc, sensor and ubiquitous networks (2006)

Understanding the performances of backoff algorithms in multi-hop ad hoc networks is a key feature to design efficient medium access protocols. The 802.11 binary exponential backoff algorithm and all the enhancements done to this algorithm have been studied in depth in a single hop context. Very few analytical studies are carried out on 802.11 backoff algorithms in a multi-hop context due to the difficulty of modeling. In this paper we propose an analytical study, based on a stochastic process algebra, of four backoff algorithms on two multi-hop scenarios. Performances of each backoff algorithms are computed from efficiency and fairness point of view