ppxscal/embedding_network huggingface dataset:
Injecting realistic burstiness to a traditional client-server benchmark
Authors: Ningfang Mi, Giuliano Casale, Ludmila Cherkasova, Evgenia Smirni
Venue: Proceedings of the 6th international conference on Autonomic computing (2009)

The design of autonomic systems often relies on representative benchmarks for evaluating system performance and scalability. Despite the fact that experimental observations have established that burstiness is a common workload characteristic that has deleterious effects on user-perceived performance, existing client-server benchmarks do not provide mechanisms for injecting burstiness into the workload. In this paper, we introduce a new methodology for generating workloads that emulate the temporal surge phenomenon in a controllable way, thus provide a mechanism that enables testing and evaluation of client-server system performance under reproducible bursty workloads. This new methodology allows to inject different amounts of burstiness into the arrival stream using the index of dispersion, a single parameter that is as simple to use as a turnable knob. We exemplify the effectiveness of this new methodology by introducing a new module into the TPC-W, a benchmark that is routinely used for capacity planning of e-commerce systems. This new module injects burstiness into the arrival process of clients in a controllable manner, and hence, enables understanding system performance degradation due to burstiness. Detailed experimentation on a real system shows that this benchmark modification can stress the system under different degrees of burstiness, making a strong case for the usefulness of this modification for capacity planning of autonomic systems.
Resolving Conflicts in Action Descriptions
Authors: Thomas Eiter, Esra Erdem, Michael Fink, Ján Senko
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

We study resolving conflicts between an action description and a set of conditions (possibly obtained from observations), in the context of action languages. In this formal framework, the meaning of an action description can be represented by a transition diagram---a directed graph whose nodes correspond to states and whose edges correspond to transitions describing action occurrences. This allows us to characterize conflicts by means of states and transitions of the given action description that violate some given conditions. We introduce a basic method to resolve such conflicts by modifying the action description, and discuss how the user can be supported in obtaining more preferred solutions. For that, we identify helpful questions the user may ask (e.g., which specific parts of the action description cause a conflict with some given condition), and we provide answers to them using properties of action descriptions and transition diagrams. Finally, we discuss the computational complexity of these questions in terms of related decision problems.
Surrogate regret bounds for proper losses
Authors: Mark D. Reid, Robert C. Williamson
Venue: Proceedings of the 26th Annual International Conference on Machine Learning (2009)

We present tight surrogate regret bounds for the class of proper (i.e., Fisher consistent) losses. The bounds generalise the margin-based bounds due to Bartlett et al. (2006). The proof uses Taylor's theorem and leads to new representations for loss and regret and a simple proof of the integral representation of proper losses. We also present a different formulation of a duality result of Bregman divergences which leads to a simple demonstration of the convexity of composite losses using canonical link functions.
Design and Implementation of the Structure Health Monitoring System for Bridge Based on Wireless Sensor Network
Authors: An Yin, Bingwen Wang, Zhuo Liu, Xiaoya Hu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part III (2009)

For the shortcomings of the traditional wired way for structure health monitoring, a structure health monitoring (SHM) for bridge based on wireless sensor network (WSN) is proposed. The S-Mote node used for the WSN is designed and implemented which meets the specific hardware requirements of the structural health monitoring and supports the TinyOS as its operating system. The SHM system is deployed and tested on the ZhengDian Viaduct Bridge. In this deployment, 6 nodes are distributed over the main span, collecting the ambient vibrations at 100Hz. The collected data agrees with theoretical models and theoretical value of the bridge.
Global Robustly Asymptotically Stability of Cohen-Grossberg Neural Networks with Nonnegative Amplification Function
Authors: Yongsu Kim, Huaguang Zhang, Lili Cui, Xin Zhang
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

The global robust asymptotic stability problem of Cohen-Grossberg neural networks with nonnegative amplification function is considered in this paper. The amplification function condition is assumed to be nonnegative. In the terms of linear matrix inequalities (LMIs), sufficient conditions are obtained by using Lyapunov- Krasovskii method which guarantee the existence and global robustly asymptotic stability of the equilibrium point of the Cohen-Grossberg neural networks with nonnegative amplification function. Finally, a numerical example is provided to verify the effectiveness of the proposed results.
A Multilevel Multiscale Mimetic (M3) Method for an Anisotropic Infiltration Problem
Authors: Konstantin Lipnikov, David Moulton, Daniil Svyatskiy
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

Modeling of multiphase flow and transport in highly heterogeneous porous media must capture a broad range of coupled spatial and temporal scales. Recently, a hierarchical approach dubbed the Multilevel Multiscale Mimetic (M3) method, was developed to simulate two-phase flow in porous media. The M3 method is locally mass conserving at all levels in its hierarchy, it supports unstructured polygonal grids and full tensor permeabilities, and it can achieve large coarsening factors. In this work we consider infiltration of water into a two-dimensional layered medium. The grid is aligned with the layers but not the coordinate axes. We demonstrate that with an efficient temporal updating strategy for the coarsening parameters, fine-scale accuracy of prominent features in the flow is maintained by the M3 method.
New exact solutions for a Benjamin-Bona-Mahony equation
Authors: Maria S. Bruzón, Maria I. Gandarias
Venue: Proceedings of the 7th WSEAS international conference on System science and simulation in engineering (2008)

In this paper, the family of Benjamin-Bona-Mahony equation with strong nonlinear dispersive B(m, n) is considered. We apply the classical Lie method of infinitesimals. We obtain for special values of the parameters of this equation, many exact solutions expressed by various single and combined nondegenerative Jacobi elliptic function solutions and their degenerative solutions (soliton, kink and compacton). By applying the G′/G-expansion method we derive new travelling wave solutions.
Multi Lingual Character Recognition Using Hierarchical Rule Based Classification and Artificial Neural Network
Authors: Anupam Shukla, Ritu Tiwari, Anand Ranjan, Rahul Kala
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

Optical Character Recognition is one of the rapidly growing areas of Artificial Intelligence due to its vast applicability. The technique is used to recognize characters printed on paper or elsewhere. The optical character recognition gains more importance when there are multiple languages present. The complexity of the problem increases for the addition of every language. The identification of character is both difficult and important in the presence of multiple languages. In this paper we propose a technique for multi lingual character identification. The algorithm uses the characteristics of the language to find out the language first. This is done using a rule-based approach. Then we apply neural network of the particular language to find out the exact character. We have coded and tested this using English capital letters, English small letters and Hindi letters. We got an appreciable accuracy using test cases of all languages. This proves the efficiency of the algorithm.
Short communication: Data mining based intelligent analysis of threatening e-mail
Authors: S. Appavu, R. Rajaram, M. Muthupandian, G. Athiappan, K. S. Kashmeera
Venue: Knowledge-Based Systems (2009)

This paper proposed a decision tree based classification method to detect e-mails that contain terrorism information. The proposed classification method is an incremental and user-feedback based extension of a decision tree induction algorithm named Ad Infinitum. We show that Ad Infinitum algorithm is a good choice for threatening e-mail detection as it runs fast on large and high dimensional databases, is easy to tune and is highly accurate, outperforming popular algorithms such as Decision Trees, Support Vector Machines and Naive Bayes. In particular, we are interested in detecting fraudulent and possibly criminal activities from such e-mails.
WDM Optical Network Design- Using Limited Traffic Grooming Resources
Authors: Osama Awwad
Venue:  (2007)

While a single fiber strand in wavelength division multiplexing (WDM) has over a terabit-per-second bandwidth and a wavelength channel has over a gigabit-per-second transmission speed, the network may still be required to support traffic requests at rates that are lower than the full wavelength capacity. To avoid assigning an entire lightpath to a small request, many researchers have looked at adding traffic grooming to the routing and wavelength assignment (RWA) problem. In this work, we consider the RWA problem with traffic grooming (GRWA) for mesh networks under static and dynamic lightpath connection requests. The GRWA problem is NP-Complete since it is a generalization of the RWA problem which is known to be NP-Complete. We propose an integer linear programming (ILP) model that accurately depicts the GRWA problem. Because it is very hard to find a solution for large networks using ILP, we solve the GRWA problem by proposing two novel heuristics. The strength of the proposed heuristics stems from their simplicity, efficiency and applicability to large-scale networks. The book is addressed to professionals in optical communcation networks like professors, students and engineers. 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
The design of the force.com multitenant internet application development platform
Authors: Craig D. Weissman, Steve Bobrowski
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Force.com is the preeminent on-demand application development platform in use today, supporting some 55,000+ organizations. Individual enterprises and commercial software-as-a-service (SaaS) vendors trust the platform to deliver robust, reliable, Internet-scale applications. To meet the extreme demands of its large user population, Force.com's foundation is a metadatadriven software architecture that enables multitenant applications. The focus of this paper is multitenancy, a fundamental design approach that can dramatically improve SaaS application management. This paper defines multitenancy, explains its benefits, and demonstrates why metadata-driven architectures are the premier choice for implementing multitenancy.
Unsupervised creation of small world networks for the preservation of digital objects
Authors: Charles L. Cartledge, Michael L. Nelson
Venue: Proceedings of the 9th ACM/IEEE-CS joint conference on Digital libraries (2009)

The prevailing model for digital preservation is that archives should be similar to a "fortress": a large, protective infrastructure built to defend a relatively small collection of data from attack by external forces. Such projects are a luxury, suitable only for limited collections of known importance and requiring significant institutional commitment for sustainability. In previous research, we have shown the web infrastructure (i.e., search engine caches, web archives) refreshes and migrates web content in bulk as side-effects of their user-services, and these results can be mined as a useful, but passive preservation service. Our current research involves a number of questions resulting from removing the implicit assumption that web-based data objects must passively await curatorial services: What if data objects were not tethered to repositories? What are the implications if the content were actively seeking out and injecting itself into the web infrastructure (i.e., search engine caches, web archives)? All of this leads to our primary research question: Can we create objects that preserve themselves more effectively than repositories or web infrastructure can?
Programming with Microsoft Visual Basic 2008, 4th edition
Authors: Diane Zak
Venue:  (2009)

Programming with Microsoft Visual Basic 2008, Fourth Edition by the best-selling author, Diane Zak, is designed for a first course in programming. Using the most recent version of the software, Visual Basic 2008, this book teaches individuals how to use Visual Basic applications as they would in a real world setting. Students with no previous programming experience learn how to plan and create their own interactive windows applications. GUI design skills and Object-Oriented Programming concepts are emphasized throughout the book.
On-time Support with Supplementary Figures in Tutoring of Mathematical Exercises
Authors: Yosuke Murase, Tomoko Kojiri, Toyohide Watanabe
Venue: Proceeding of the 2005 conference on Towards Sustainable and Scalable Educational Innovations Informed by the Learning Sciences: Sharing Good Practices of Research, Experimentation and Innovation (2005)

The objective of our research is to support for solving mathematical exercise in the collaborative learning environment. To promote the exchange of more varied opinions toward the correct answer, it is necessary for the support system to offer a communication means, recognize the learning situation, and provide appropriate advice according to the learning situation. In mathematical exercises, it is effective to propose a diagram to the learning group as form of advice. In this work, we construct a system that proposes supplementary figures in order to enable the group to derive the next step in a problem according to the current learning situation. In our system, a diagram which a learner draws is converted into an internal model. Then, supplementary figures according to the learning situation are generated by selecting and applying a rule for drawing diagrams that corresponds to the internal model. In this paper, we explain the overall framework for generating supplementary figures and show the results of an experiment to evaluate the system.
On the sampling and recovery of bandlimited functions via scattered translates of the Gaussian
Authors: Th. Schlumprecht, N. Sivakumar
Venue: Journal of Approximation Theory (2009)

Let @l be a positive number, and let (x"j:j@?Z)@?R be a fixed Riesz-basis sequence, namely, (x"j) is strictly increasing, and the set of functions {R@?t@?e^i^x^"^j^t:j@?Z} is a Riesz basis (i.e., unconditional basis) for L"2[-@p,@p]. Given a function f@?L"2(R) whose Fourier transform is zero almost everywhere outside the interval [-@p,@p], there is a unique sequence (a"j:j@?Z) in @?"2(Z), depending on @l and f, such that the function I"@l(f)(x)@?@?j@?Za"je^-^@l^(^x^-^x^"^j^)^^^2,x@?R, is continuous and square integrable on (-~,~), and satisfies the interpolatory conditions I"@l(f)(x"j)=f(x"j), j@?Z. It is shown that I"@l(f) converges to f in L"2(R), and also uniformly on R, as @l->0^+. In addition, the fundamental functions for the univariate interpolation process are defined, and some of their basic properties, including their exponential decay for large argument, are established. It is further shown that the associated interpolation operators are bounded on @?"p(Z) for every p@?[1,~].
Cocoa Programming for Mac OS X For Dummies, 2nd edition
Authors: Erick Tejkowski
Venue: For Dummies (2009)

Cocoa programming is not only the favored development environment for Mac OS X, its also a primary tool for creating iPhone and iPod Touch software. That makes this a great time to learn Cocoa, and Cocoa Programming for Mac OS X For Dummies is the ideal place to start! This book gives you a solid foundation in Cocoa and the unusual syntax of Objective-C. Youll learn whats new in Cocoa frameworks and create an application step by step. For example, you can: See how Xcode underlies your applications as the main component of Apples IDE Examine the basics of the Objective-C language, the elements of a Cocoa interface, and object-oriented programming Use Xcode and Interface Builder Spruce up your apps with audio, video, Internet features, stylized text, and more Create applications with the stunning graphics for which Macs are famous See how to build apps with multiple documents and even executables that arent traditional Mac apps Use all the exciting new Cocoa features Work with Cocoa numbers, arrays, Booleans, and dates Build document-based applications Simplify with key-value coding The better you understand Cocoa programming, the better the applications you can create for Mac OS X, iPhone, and iPod Touch. Cocoa Programming for Mac OS X For Dummies makes it easy and fun!
Letters: Accommodation in motoneuron models with passive dendrite: Response to linearly rising currents
Authors: Marcus Fraga Vieira, Leonardo Abdala Elias
Venue: Neurocomputing (2009)

The biophysical properties of cat motoneuron (MN) models with passive dendrite and different sizes have been extensively tested. However, the behavior of these models in relation to accommodation has not been tested yet. The experimental data reported have shown that MNs accommodate to a very limited degree, exhibiting, in some extension, breakdown of accommodation phenomenon. One possible explanation for the latter behavior would be the presence of persistent sodium conductance. The accommodation can be evaluated by observing threshold latency (TL) curve and the accommodation coefficient (I/I"0)"s, obtained from the response to linearly rising currents. The simulation results have showed that the models exhibit breakdown of accommodation phenomenon and much similar accommodation coefficients, despite their type: 1.463, 1.456 and 1.418 to S, FR and FF MN models, respectively. According to these data, all the MN models can be classified as slowly accommodating. Our data suggests that accommodation coefficients cannot be associated to the size or to the type of the MN, and persistent sodium conductance might not be necessary to explain breakdown of accommodation phenomenon in MN soma at all.
Choquet integral with respect to Łukasiewicz filters, and its modifications
Authors: Dana Hlinná, Martin Kalina, Pavol Král'
Venue: Information Sciences: an International Journal (2009)

In many decision problems a set of actions is evaluated with respect to a set of points of view, called criteria. This paper follows two aims - first to compare the so-called level-dependent Choquet integral introduced recently by Greco et al. with another transformation of Choquet integral, proposed by Havranova and Kalina. The other aim of this paper is to look for an appropriate utility function in a given setting. We illustrate our approach on a practical example, utilizing the level-dependent Choquet integral.
P2P case storage and retrieval with an unspecified ontology
Authors: Shlomo Berkovsky, Tsvi Kuflik, Francesco Ricci
Venue: Artificial Intelligence Review (2007)

Traditional approaches for similarity-based retrieval of structured data, such as Case-Based Reasoning (CBR), have been largely implemented using centralized storage systems. In such systems, when the cases contain both numeric and free-text attributes, similarity-based retrieval cannot exploit standard speedup techniques based on multi-dimensional indexing, and the retrieval is implemented by an exhaustive comparison of the case to be solved with the whole set of stored cases. In this work, we review current research on Peer-to-Peer (P2P) and distributed CBR techniques and propose a novel approach for storage of the case-base in a decentralized Peer-to-Peer environment using the notion of Unspecified Ontology to improve the performance of the case retrieval stage and build CBR systems that can scale up to large case-bases. We develop an algorithm for efficient retrieval of approximated most-similar cases, which exploits inherent characteristics of the unspecified ontology in order to improve the performance of the case retrieval stage in the CBR problem solving cycle. The experiments show that the algorithm successfully retrieves cases close to the most-similar cases, while reducing the number of cases to be compared. Hence, it improves the performance of the retrieval stage. Moreover, the distributed nature of our approach eliminates the computational bottleneck and single point of failure of the centralized storage systems.
Whole Body Interaction with Geospatial Data
Authors: Florian Daiber, Johannes Schöning, Antonio Krüger
Venue: Proceedings of the 10th International Symposium on Smart Graphics (2009)

Common Geographic Information Systems (GIS) require a high degree of expertise from its users, making them difficult to be operated by laymen. This paper describes novel approaches to easily perform typical basic spatial tasks within a GIS: e.g. pan-, zoom- and selection-operations by using multi-touch gestures in combination with foot gestures. We are interested in understanding how non-expert users interact with such multi-touch surfaces. We provide a categorization and a framework of multi-touch hand gestures for interacting with a GIS. This framework is based on an initial evaluation. We present results of a more detailed in situ-study mainly focusing on multi-user multi-touch interaction with geospatial data. Furthermore we extend our framework using a combination of multi-touch gestures with a small set of foot gestures to solve geospatial tasks.