ppxscal/embedding_network huggingface dataset:
mBrace: action-based performance monitoring of multi-tier web applications
Authors: Andrej van der Zee, Alexandre Courbot, Tatsuo Nakajima
Venue: Proceedings of the Third Workshop on Dependable Distributed Data Management (2009)

Standard monitoring tools and web application middleware offer very limited support for detailed performance analysis of HTTP request-based, multi-tier web applications. They measure resource usage system-wide or per command name, but are unable to isolate usage per action specific to the target application. This inablity has several causes: first, many HTTP requests are executed by one application or script concurrently, making it hard to isolate them, and second, different types of actions are often handled by one application or script, hindering type-based distinction. Moreover, SQL queries, a common cause of web applications performance problems, cannot be backtracked to the HTTP request that triggered them. As a result, debugging performance problems of web applications is hard and requires time and effort of highly-skilled people. This paper describes mBrace, a work-in-progress effort that takes advantage of the hardware performance monitoring unit and uses minimal system and framework instrumentation in order to provide efficient and request-based performance analysis of multi-tier web applications.
A Complete Approximation Algorithm for Shortest Bounded-Curvature Paths
Authors: Jonathan Backer, David Kirkpatrick
Venue: Proceedings of the 19th International Symposium on Algorithms and Computation (2008)

We address the problem of finding a polynomial-time approximation scheme for shortest bounded-curvature paths in the presence of obstacles. Given an arbitrary environment $\mathcal{E}$ consisting of polygonal obstacles, two feasible configurations, a length ℓ, and an approximation factor &epsilon;, our algorithm either (i) verifies that every feasible bounded-curvature path joining the two configurations is longer than ℓ or (ii) constructs such a path &Pi; whose length is at most (1 + &epsilon;) times the length of the shortest such path. The run time of our algorithm is polynomial in n (the total number of obstacle vertices and edges in $\mathcal{E}$), m (the bit precision of the input), &epsilon; -1, and ℓ. For general polygonal environments, there is no known upper bound on the length, or description, of a shortest feasible bounded-curvature path as a function of n and m. Furthermore, even if the length and description of a shortest path are known to be linear in n and m, finding such a path is known to be NP-hard [14]. Previous results construct (1 + &epsilon;) approximations to the shortest &epsilon;-robust bounded-curvature path [11,3] in time that is polynomial in n and &epsilon; -1. (Intuitively, a path is &epsilon;-robust if it remains feasible when simultaneously twisted by some small amount at each of its environment contacts.) Unfortunately, &epsilon;-robust solutions do not exist for all problem instances that admit bounded-curvature paths. Furthermore, even if a &epsilon;-robust path exists, the shortest bounded-curvature path may be arbitrarily shorter than the shortest &epsilon;-robust path. In effect, these earlier results confound two distinct sources of problem difficulty, measured by &epsilon; -1 and ℓ. Our result is not only more general, but it also clarifies the critical factors contributing to the complexity of bounded-curvature motion planning.
A vehicle for research: using street sweepers to explore the landscape of environmental community action
Authors: Paul M. Aoki, R. J. Honicky, Alan Mainwaring, Chris Myers, Eric Paulos, Sushmita Subramanian, Allison Woodruff
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Researchers are developing mobile sensing platforms to facilitate public awareness of environmental conditions. However, turning such awareness into practical community action and political change requires more than just collecting and presenting data. To inform research on mobile environmental sensing, we conducted design fieldwork with government, private, and public interest stakeholders. In parallel, we built an environmental air quality sensing system and deployed it on street sweeping vehicles in a major U.S. city; this served as a research vehicle"by grounding our interviews and affording us status as environmental action researchers. In this paper, we present a qualitative analysis of the landscape of environmental action, focusing on insights that will help researchers frame meaningful technological interventions.
A novel discrete particle swarm clustering algorithm for data clustering
Authors: R. Karthi, S. Arumugam, K. RameshKumar
Venue: Proceedings of the 2nd Bangalore Annual Compute Conference (2009)

In this paper, a novel Discrete Particle Swarm Clustering algorithm (DPSC) for data clustering has been proposed. The particle positions and velocities are defined in a discrete form and an efficient approach is developed to move the particles for constructing new clustering solutions. DPSC algorithm has been applied to solve the data clustering problems by considering two performance metrics, such as TRace Within criteria (TRW) and Variance Ratio Criteria (VRC). The result obtained by the proposed algorithm has been compared with the published results of Combinatorial Particle Swarm Optimization (CPSO) algorithm and Genetic Algorithm (GA). The performance analysis demonstrates the effectiveness of the proposed algorithm in solving the partitional data clustering problems.
Semi-fragile watermark for visual content authentication
Authors: Chamidu Atupelage, Koichi Harada
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

Digital watermarking was initiated to copyright protection and ownership verification of multimedia data. The evolution of the watermark has focused on different aspects of security issues in multimedia data such as integrity and authenticity. Fragile and semi-fragile watermarking schemes were introduced to accomplish these security requirements. In this paper, we propose semi-fragile watermarking scheme to authenticate visual content of the image. The proposed system provides high security and it facilitates to locate the tampered region in the image. Since the system inherits PKC (public key cryptography), the proposed scheme is considered as public watermarking approach.
Predictive Pricing and Revenue Sharing
Authors: Bobji Mungamuru, Hector Garcia-Molina
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

Predictive pricing (e.g., Google's "Smart Pricing" and Yahoo's "Quality Based Pricing") and revenue sharing are two important tools that online advertising networks can use in order to attract content publishers and advertisers. We develop a simple model of the pay-per-click advertising market to study the market effects of these tools. We then present an algorithm, PricingPolicy, for computing an advertising network's best response i.e., given the predictive pricing and revenue sharing policies used by its competitors, what policy should an advertising network use in response? Using PricingPolicy, we gain insight into the structure of optimal predictive pricing and revenue sharing policies.
Invited talk: image recognition for intelligent interfaces
Authors: Trevor Darrell
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

When interaction concerns the physical world, interfaces should do their best to search for information using direct observation. Image-based interfaces have been tried in the past, but generally required artificial barcode tags to be affixed to each viewed object or surface. Recent advances in computer vision and content-based image retrieval have enabled fast and robust indexing from images of individual objects--CD covers, book jackets, magazine advertisements, etc.--even on relatively low-power platforms such as camera-equipped mobile phones. I'll review the relevant algorithms and design of such systems, and discuss what types of image recognition interfaces are feasible in the near term. I'll describe very recent work on multimodal question answering interfaces, which combine image and text query matching with human-in-the-loop interaction. I'll close with a discussion of the anticipated future progress on category-level visual recognition, and what classes of interfaces it may enable.
An options-based solution to the sequential auction problem
Authors: Adam I. Juda, David C. Parkes
Venue: Artificial Intelligence (2009)

The sequential auction problem is commonplace in open, electronic marketplaces such as eBay. This is the problem where a buyer has no dominant strategy in bidding across multiple auctions when the buyer would have a simple, truth-revealing strategy if there was but a single auction event. Our model allows for multiple, distinct goods and market dynamics with buyers and sellers that arrive over time. Sellers each bring a single unit of a good to the market while buyers can have values on bundles of goods. We model each individual auction as a second-price (Vickrey) auction and propose an options-based, proxied solution to provide price and winner-determination coordination across auctions. While still allowing for temporally uncoordinated market participation, this options-based approach solves the sequential auction problem and provides truthful bidding as a weakly dominant strategy for buyers. An empirical study suggests that this coordination can enable a significant efficiency and revenue improvement over the current eBay market design, and highlights the effect on performance of complex buyer valuations (buyers with substitutes and complements valuations) and varying the market liquidity.
Multi-agent System Service and Ontology Design Methods
Authors: Larry Gloss, Brad Mason, John McDowall
Venue: Proceedings of the 2008 10th IEEE Conference on E-Commerce Technology and the Fifth IEEE Conference on Enterprise Computing, E-Commerce and E-Services (2008)

This paper describes essential service and ontology designconsiderations for a multi-agent system. We will establish acontext of basic information sharing and discovery for a combat search and rescue vignette. FIPA protocols and the OWL-S Task Model will be presented along with the associated work flow processes for our range of service options. A Protégé-based ontology will convey our semantic structure and be used to drive the actual JADE-based demonstration. We will also recommend the necessary agency design requirements for effective MAS management of the work flow process. We will recommend initial ontologies for use across the entire OWL-S Task Model, as well as candidate examples of ontology mediation. We then summarize our findings and offer recommendations for MAS service and ontology design.
Toward Peer-to-Peer Based Semantic Search Engines: An Organizational Approach
Authors: Haizheng Zhang Victor Lesser
Venue:  (2008)

This book frames a peer-to-peer information retrievalproblem as a multi-agent framework and attacks itfrom an organizational perspective by exploringvarious adaptive, self-organizing topologicalorganizations, designing appropriatecoordination strategies, and exploiting learningtechniques to create more accurate routing policy forlarge-scale agent organizations. In addition, areinforcement-learning based approach is developed inthis thesis to take advantage of the run-timecharacteristics of P2P IR systems, includingenvironmental parameters, bandwidth usage, andhistorical information about past search sessions. Inthe learning process, agents refine their contentrouting policies by constructing relatively accuraterouting tables based on a Q-learning algorithm.Experimental results show that this learningalgorithm considerably improves the performance ofdistributed search sessions in P2P IR systems.The book is addressed to researchers andpractitioners in information retrieval and searchengine, content-based routing areas.
Associated evolution of a support vector machine-based classifier for pedestrian detection
Authors: X. B. Cao, Y. W. Xu, D. Chen, H. Qiao
Venue: Information Sciences: an International Journal (2009)

Support vector machine (SVM) has become a dominant classification technique used in pedestrian detection systems. In such systems, classifiers are used to detect pedestrians in some input frames. The performance of a SVM classifier is mainly influenced by two factors: the selected features and the parameters of the kernel function. These two factors are highly related and therefore, it is desirable that the two factors can be analyzed simultaneously, which are usually not the case in the previous work. In this paper, we propose an evolutionary method to simultaneously optimize the feature set and the parameters for the SVM classifier. Specifically, adaptive genetic operators were designed to be suitable for the feature selection and parameter tuning. The proposed method is used to train a SVM classifier for pedestrian detection. Experiments in real city traffic scenes show that the proposed approach leads to higher detection accuracy and shorter detection time.
Collaborative research and e-learning platform for a distributed project
Authors: Eleonora Bilotta, Pietro Pantano, Jose Sepulveda, Rocco Servidio
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

The CoMSON project is a distributed European research project that combines research efforts from both academia and industry. This project is distributed among eight institutions across Europe. The aim of this project is to implement an experimental simulation platform (in software code) for devices in micro and nano-electronics with an integrated e-learning system. This project has two main goals. First, to train graduate students and post-docs in mathematical modelling, through the creation of this simulation platform, and second the delivery of this simulation platform to be used as a training tool for new recruits. In this paper we describe the information system architecture created to provide the partners with a strong collaborative and development research environment. This architecture provides a framework with three main goals: information sharing, collaboration in research and, training. This scheme easily allows users to access, update and interact with information and with other researchers within all the stages of the project.
Application of Expressive Speech in TTS System with Cepstral Description
Authors: Jiří Přibil, Anna Přibilová
Venue: Verbal and Nonverbal Features of Human-Human and Human-Machine Interaction: COST Action 2102 International Conference, Patras, Greece, October 29-31, 2007. Revised Papers (2008)

Expressive speech synthesis representing different human emotions has been in the interests of researchers for a longer time. Recently, some experiments with storytelling speaking style have been performed. This particular speaking style is suitable for applications aimed at children as well as special applications aimed at blind people. Analyzing human storytellers' speech, we designed a set of prosodic parameters prototypes for converting speech produced by the text-to-speech (TTS) system into storytelling speech. In addition to suprasegmental characteristics (pitch, intensity, and duration) included in these speech prototypes, also information about significant frequencies of spectral envelope and spectral flatness determining degree of voicing was used.
A new method for bottleneck detection
Authors: Sankar Sengupta, Kanchan Das, Robert P. VanTil
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper presents a new method to identify and rank the bottlenecks in a manufacturing system. The proposed method is based on performance related data that are easy to capture, offers low computational burden and less prone to be in error due to its simplicity. The proposed method analyzes inter-departure time from different machines to identify and rank the bottlenecks. In a follow-up paper the authors plan to present a method to allocate loss of production to different machines based on analysis of inter-departure time. This paper also proposes a set of rules that may be used to improve data integrity. The proposed method may be used to analyze both steady state as well as non-steady state data and can be extended easily to analysis of a job shop.
Electrothermoelastic modeling of MEMS gripper
Authors: Mohammad Mayyas, Harry Stephanou
Venue: Microsystem Technologies (2009)

The design of many thermal Microelectromechanical (MEMS) actuators is often based on finite element analysis, but lacks analytical insight. In this paper we report a novel electro-thermal microgripper and a comprehensive thermal modeling of a general 5 lineshape microbeam&#x2019;s actuator using 1-D steady state heat equations. Because of the variety of microgripper fabrication technologies and their applications, different thermal boundary conditions are considered for lifted off and attached grippers. Parametric and nonparametric electrothermomechanical identification models for silicon on insulator microgripper, fabricated on 100&#x00a0;&#x03bc;m device layer, are obtained.
Introducing age-based parameters into simulations of crowd dymanics
Authors: D. J. Kaup, Thomas L. Clarke Rex Oleson, Linda Malone, Florian G. Jentsch
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Very few crowds consist of individuals who are exactly the same. Defining variables, such as age, and how they affect an individual's movement, could increase realism in simulations of crowd movement. In this paper, we present and discuss how age variations of individuals can be included in crowd simulations. Starting with the Helbing, Molnar, Farkas, and Vicsek model (HMFV), we modeled age differences by modifying the strength of the existing social forces. We created simulation scenarios with the varied strengths and used multiple approaches for validation, including experts' subjective validation and experimental validation via comparison of model predictions with observed crowd movements. The results indicated that individual characteristics such as age can be modeled by social forces Future extensions of our work would be to include individuals, small subgroups, and/or large groups of people to model multicultural crowd behavior.
Some computer network interconnection issues
Authors: A. M. McKenzie
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

During the past four years, my work at Bolt Beranek and Newman has been devoted to the operation and use of the ARPA Communication Network. Further, my only direct experience with computer communication networks is this involvement. It would therefore be brash to present myself as an expert on digital communications, and I do not presume to do so. On the other hand, the ARPA experiment of constructing a communications system specifically tailored to the needs of computers and their users has been extremely successful, and at the same time has pointed out a number of areas where methods of computer communication can stand improvement. It is this background of experience which has inspired the following observations.
Greenhouse temperature and humidity intelligent control system
Authors: Sun Rong-Gao, Wan Zhong, Sun De-Chao
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

The article based on embedded database of greenhouse temperature and humidity control system intelligent. Put forward by embedded database system set up in an ideal environment for data greenhouse temperature and humidity control, greenhouse crops in the process of growth under control. To address the growth of greenhouse crops in the process of temperature and humidity controlled environment is not ideal, at the same time improve the efficiency of control and cost-effective system. The article focuses on the structure of the control system, hardware, software design and system control strategy. The control system has a simple hardware structure, cost-effective, easy to use and maintenance, temperature and humidity data, and other advantages of good stability.
Visualization of Feature Survival in Platform-Based Embedded Systems Development for Improved Understanding of Scope Dynamics
Authors: Krzysztof Wnuk, Björn Regnell, Lena Karlsson
Venue: Proceedings of the 2008 Requirements Engineering Visualization (2008)

36290041
Diaphony of Uniform Samples over Hemisphere and Sphere
Authors: I. T. Dimov, S. S. Stoilova, N. Mitev
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

The sampling of certain solid angle is a fundamental operation in realistic image synthesis, where the rendering equation describing the light propagation in closed domains is solved. In this work we consider the problem for generation of uniformly distributed random samples over hemisphere and sphere. Using two algorithms we obtain samples in orthogonal spherical triangle and spherical quadrangle. Our aim is to prove uniform distribution of the obtained samples. The importance of the uniformly distributed samples is determined by the effectiveness of the algorithms for numerical solution of the rendering equation. We use numerical characteristic for uniform distribution of points, called diaphony. The diaphony of these samples is calculated numerically. Analysis and comparison of the obtained results are made.
Theoretical and Empirical Analysis of the Learning Rate and Momentum Factor in Neural Network Modeling for Stock Prediction
Authors: Jinchuan Ke, Xinzhe Liu, Guan Wang
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

Neural Network training requires a large number of learning epochs. An appropriate learning rate is important to the overall performance of the training. Under a weight-update algorithm, a low learning rate would make the network learning slowly, and a high learning rate would make the weights and error function diverge. To optimize the model parameters, this paper presents theoretical and empirical analysis of learning rate in neural network modeling for its application in stock price prediction, an increasing learning rate approach is suggested for practice. The effect of momentum factor is also investigated to speed up the convergence for network training.
An evolutionary approach for achieving scalability with general regression neural networks
Authors: Kenan Casey, Aaron Garrett, Joseph Gay, Lacey Montgomery, Gerry Dozier
Venue: Natural Computing: an international journal (2009)

In this paper, we present an approach to overcome the scalability issues associated with instance-based learners. Our system uses evolutionary computational techniques to determine the minimal set of training instances needed to achieve good classification accuracy with an instance-based learner. In this way, instance-based learners need not store all the training data available but instead store only those instances that are required for the desired accuracy. Additionally, we explore the utility of evolving the optimal feature set used by the learner for a given problem. In this way, we attempt to deal with the so-called "curse of dimensionality" associated with computational learning systems. To these ends, we introduce the Evolutionary General Regression Neural Network. This design uses an estimation of distribution algorithm to generate both the optimal training set as well as the optimal feature set for a general regression neural network. We compare its performance against a standard general regression neural network and an optimized support vector machine across four benchmark classification problems.