ppxscal/embedding_network huggingface dataset:
Survey of Improving Naive Bayes for Classification
Authors: Liangxiao Jiang, Dianhong Wang, Zhihua Cai, Xuesong Yan
Venue: Proceedings of the 3rd international conference on Advanced Data Mining and Applications (2007)

The attribute conditional independence assumption of naive Bayes essentially ignores attribute dependencies and is often violated. On the other hand, although a Bayesian network can represent arbitrary attribute dependencies, learning an optimal Bayesian network classifier from data is intractable. Thus, learning improved naive Bayes has attracted much attention from researchers and presented many effective and efficient improved algorithms. In this paper, we review some of these improved algorithms and single out four main improved approaches: 1) Feature selection; 2) Structure extension; 3) Local learning; 4) Data expansion. We experimentally tested these approaches using the whole 36 UCI data sets selected by Weka, and compared them to naive Bayes. The experimental results show that all these approaches are effective. In the end, we discuss some main directions for future research on Bayesian network classifiers.
On the Impact of Management Instrumentation Models on Web Server Performance: A JMX Case Study
Authors: Abdelkader Lahmadi, Anca Ghitescu, Laurent Andrey, Olivier Festor
Venue: Proceedings of the 1st international conference on Autonomous Infrastructure, Management and Security: Inter-Domain Management (2007)

JMX (Java Management eXtension) is a Java framework that allows any Java technology-based application or accessible resource to become easily manageable. This standard begins to be widely used within different managed systems which vary from large mainframes to small mobile devices, limited in both resource and computing capacity. Today, little is known about the costs associated with the manageability of a system. In this paper, we analyse the impact of various instrumentation models on the behavior of both the functional and the management plane. We show on a JMX instrumented web server that the service is highly affected by the management activity in driver and component models while a daemon approach limits the management impact on the functional service.
Adaptivity: From Metabolism to Behavior
Authors: Xabier Barandiaran, Alvaro Moreno
Venue: Adaptive Behavior - Animals, Animats, Software Agents, Robots, Adaptive Systems (2008)

In this article, we propose some fundamental requirements for the appearance of adaptivity. We argue that a basic metabolic organization, taken in its minimal sense, may provide the conceptual framework for naturalizing the origin of teleology and normative functionality as it appears in living systems. However, adaptivity also requires the emergence of a regulatory subsystem, which implies a certain form of dynamic decoupling within a globally integrated, autonomous system. Thus, we analyze several forms of minimal adaptivity, including the special case of motility. We go on to explain how an open-ended complexity growth of motility-based adaptive agency, namely, behavior, requires the appearance of the nervous system. Finally, we discuss some implications of these ideas for embodied robotics.
Coherent layer peeling for transparent high-depth-complexity scenes
Authors: Nathan Carr, Radomír Měch, Gavin Miller
Venue: Proceedings of the 23rd ACM SIGGRAPH/EUROGRAPHICS symposium on Graphics hardware (2008)

We present two new image space techniques for efficient rendering of transparent surfaces that exploit partial ordering in the scene geometry. The first technique, called hybrid layer peeling, combines unordered meshes with ordered meshes in an efficient way, and is ideal for scenes such as volumes with embedded transparent meshes. The second technique, called coherent layer peeling, efficiently detects and renders correctly sorted fragment sequences for a given pixel in one iteration, allowing for a smaller number of passes than traditional layer peeling for typical scenes. Although more expensive than hybrid layer peeling by a constant factor, coherent layer peeling applies to a broader class of scenes, including single meshes or collections of meshes. Coherent layer peeling does not require costly clipping or perfect sorting. However, the performance of the algorithm depends on the degree to which the data is sorted. At best, when the data is perfectly sorted, the algorithm renders a correct result in a single iteration. At worst, when the data is sorted in reverse order, the algorithm mimics the performance of layer peeling but with a higher cost per iteration. We conclude with a discussion of a modified form of coherent layer peeling designed for an idealized rasterization architecture that would match layer-peeling in the worst case, while still exploiting correctly sorted sequences when they are present.
Formal Modeling for Product Families Engineering
Authors: Alessandro Fantechi, Stefania Gnesi
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

In this paper we propose a behavioural model, namely the Generalized Extended Modal Transition Systems, as a basis for the formalization of different notions of variability usually present in product families definitions. In particular, a GEMTS is able to define a family of products by telling at any state of the system whether some (and how many) transitions are optional or mandatory for any derived products of the family. The proposed model is compared with previous proposals also based on Labelled Transition Systems, showing its higher generality, but also pointing out weaknesses that still need to be addressed with more expressive models. Hints on the solution of such weaknesses are given by the use of constraints expressed as temporal logic formulae.
An Application of Wavelet Networks in the Carrying Robot Walking
Authors: Xiuxia Yang, Yi Zhang, Changjun Xia, Zhiyong Yang, Wenjin Gu
Venue: Proceedings of the 5th international symposium on Neural Networks: Advances in Neural Networks, Part II (2008)

We found that neuron model is inadequate owing to its defects such as those inherent in its structure and in its capability of information storage. So we propose an intelligent neurons assemblage model with generalized wavelet basis function network as its excited function. Not only the wavelet neural networks' convergence rate is much faster and its nonlinear approach capability is much better but also its intelligent characteristics, such as the variable-scale adaptive adjustment of structure and the generalized information storage, make it reflect much more faith fully the biological original. Static learning of the inverse dynamics model and adaptive virtual torque control based on Lyapunov stability of the carrying robot walking are demonstrated to prove that the proposed mechanism is valid.
Pro Oracle Application Express, 1 edition
Authors: John Scott, Scott Spendolini
Venue:  (2008)

Application Express, or APEX, is one of the most innovative products to come out of Oracle in years. APEX is an application development framework for developing databasebacked applications. Its easy enough to get started in that power users can quit storing data in random spreadsheets and instead centralize their data in the powerful Oracle database, all without developer help. Developers arent left out, however. Those who choose to can go deep and leverage the full power and flexibility of Oracles database engine. Getting started with APEX is easy. Learning how to take full advantage of APEX is the problem. It was the problem, that is, until this book came along. In Pro Oracle Application Express, authors John Scott and Scott Spendolini open the hood of APEX and expose the full power behind its easytouse GUI interface. They show you what you need to know to produce powerful, professionally polished applications, things such as user-authentication models, approaches to layout and navigation, how to integrate Ajax, how to deal with localization issues such as time zones and translations, how to customize the look and feel of an APEX web site, and much, much more. The authors are wellqualified to write on APEX. John Scott runs ShellPrompt, a hosting service that handles many large-scale APEX applications, some of which he is paid to develop. John is a hardcore APEX developer. His coauthor, Scott Spendolini, is one of the original creators of APEX. Both John and Scott now base their fulltime careers on developing APEX applications. Pro Oracle APEX is your opportunity to learn APEX from the very best.
Symbolic String Verification: An Automata-Based Approach
Authors: Fang Yu, Tevfik Bultan, Marco Cova, Oscar H. Ibarra
Venue: Proceedings of the 15th international workshop on Model Checking Software (2008)

We present an automata-based approach for the verification of string operations in PHP programs based on symbolic string analysis. String analysis is a static analysis technique that determines the values that a string expression can take during program execution at a given program point. This information can be used to verify that string values are sanitized properly and to detect programming errors and security vulnerabilities. In our string analysis approach, we encode the set of string values that string variables can take as automata. We implement all string functions using a symbolic automata representation (MBDD representation from the MONA automata package) and leverage efficient manipulations on MBDDs, e.g., determinization and minimization. Particularly, we propose a novel algorithm for language-based replacement. Our replacement function takes three DFAs as arguments and outputs a DFA. Finally, we apply a widening operator defined on automata to approximate fixpoint computations. If this conservative approximation does not include any bad patterns (specified as regular expressions), we conclude that the program does not contain any errors or vulnerabilities. Our experimental results demonstrate that our approach works quite well in checking the correctness of sanitization operations in real-world PHP applications.
Empirical Analysis of a Large-Scale Hierarchical Storage System
Authors: Weikuan Yu, H. Sarp Oral, R. Shane Canon, Jeffrey S. Vetter, Ramanan Sankaran
Venue: Proceedings of the 14th international Euro-Par conference on Parallel Processing (2008)

To prepare for future peta- or exa-scale computing, it is important to gain a good understanding on what impacts a hierarchical storage system would have on the performance of data-intensive applications, and accordingly, how to leverage its strengths and mitigate possible risks. To this aim, this paper adopts a user-level perspective to empirically reveal the implications of storage organization to parallel programs running on Jaguar at the Oak Ridge National Laboratory. We first describe the hierarchical configuration of Jaguar's storage system. Then we evaluate the performance of individual storage components. In addition, we examine the scalability of metadata- and data-intensive benchmarks over Jaguar. We have discovered that the file distribution pattern can impact the aggregated I/O bandwidth. Based on our analysis, we have demonstrated that it is possible to improve the scalability of a representative application S3D by as much as 15%.
An industrial case study of architecture conformance
Authors: Jacek Rosik, Andrew Le Gear, Jim Buckley, Muhammad Ali Babar
Venue: Proceedings of the Second ACM-IEEE international symposium on Empirical software engineering and measurement (2008)

A software designer often has little control over, or means of checking, whether his design is being adhered to, once the implementation begins. This 'architectural drift', where the original design of the system and the as-implemented design of the system diverge, can cause serious problems for evolution, maintenance and the comprehensibility of a system if it remains undocumented or uncorrected. The earlier such discrepancies can be identified, the better. This paper reports on a case study designed to evaluate a proposed approach for monitoring architectural drift during software development. The proposed approach differs significantly from existing design conformance approaches in that it has been designed for application within a forward engineering context. The findings show the utility of the approach in identifying architectural drift but also illustrate a number of improvements that could be made to the technique to further promote architecture conformance.
Improved Phase Correlation Matching
Authors: Javed Ahmed, M. Noman Jafri
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

Phase correlation based template matching is an efficient tool for translation estimation which is in turn required for the image registration and the object tracking applications. When a template of an object is phase correlated with the search image, the resulting correlation surface is supposed to contain a sharp peak corresponding to the location of the object in the search image. However, the resulting surface also contains various false peaks which are sometimes higher in magnitude than the true peak. In order to solve the problem, we present an efficient and effective preprocessing technique that extends the images with new pixels having decaying values. The technique is compared with two recent methods on cluttered, noisy, blurred, and slightly rotated scenes. The results show that the proposed method outperforms both of them, especially when the object is away from the central region in the image.
Analyzing Gaze During Face-to-Face Interaction
Authors: Stephan Raidt, Gérard Bailly, Frédéric Elisei
Venue: Proceedings of the 7th international conference on Intelligent Virtual Agents (2007)

We present here the analysis of multimodal data gathered during realistic face-to-face interaction of a target speaker with a number of interlocutors. Videos and gaze have been monitored with an experimental setup using coupled cameras and screens with integrated eye trackers. With the aim to understand the functions of gaze in social interaction and to develop a coherent gaze control model for our talking heads we investigate the influence of cognitive state and social role on the observed gaze behavior.
A discontinuous Galerkin method based on a Taylor basis for the compressible flows on arbitrary grids
Authors: Hong Luo, Joseph D. Baum, Rainald Löhner
Venue: Journal of Computational Physics (2008)

A discontinuous Galerkin method based on a Taylor basis is presented for the solution of the compressible Euler equations on arbitrary grids. Unlike the traditional discontinuous Galerkin methods, where either standard Lagrange finite element or hierarchical node-based basis functions are used to represent numerical polynomial solutions in each element, this DG method represents the numerical polynomial solutions using a Taylor series expansion at the centroid of the cell. Consequently, this formulation is able to provide a unified framework, where both cell-centered and vertex-centered finite volume schemes can be viewed as special cases of this discontinuous Galerkin method by choosing reconstruction schemes to compute the derivatives, offer the insight why the DG methods are a better approach than the finite volume methods based on either TVD/MUSCL reconstruction or essentially non-oscillatory (ENO)/weighted essentially non-oscillatory (WENO) reconstruction, and has a number of distinct, desirable, and attractive features, which can be effectively used to address some of shortcomings of the DG methods. The developed method is used to compute a variety of both steady-state and time-accurate flow problems on arbitrary grids. The numerical results demonstrated the superior accuracy of this discontinuous Galerkin method in comparison with a second order finite volume method and a third-order WENO method, indicating its promise and potential to become not just a competitive but simply a superior approach than its finite volume and ENO/WENO counterparts for solving flow problems of scientific and industrial interest.
Assessing Disclosure Risk for Record Linkage
Authors: Chris Skinner
Venue: Proceedings of the UNESCO Chair in data privacy international conference on Privacy in Statistical Databases (2008)

An intruder seeks to match a microdata file to an external file using a record linkage technique. The identification risk is defined as the probability that a match is correct. The nature of this probability and its estimation is explored. Some connections are made to the literature on disclosure risk based on the notion of population uniqueness.
Coverage and connectivity in three-dimensional underwater sensor networks
Authors: S. M. Nazrul Alam, Zygmunt J. Haas
Venue: Wireless Communications Mobile Computing (2008)

Unlike a terrestrial network, an underwater sensor network can have significant height which makes it a three-dimensional network. There are many important sensor network design problems where the physical dimensionality of the network plays a significant role. One such problem is determining how to deploy minimum number of sensor nodes so that all points inside the network is within the sensing range of at least one sensor and all sensor nodes can communicate with each other, possibly over a multi-hop path. The solution to this problem depends on the ratio of the communication range and the sensing range of each sensor. Under sphere-based communication and sensing model, placing a node at the center of each virtual cell created by truncated octahedron-based tessellation solves this problem when this ratio is greater than 1.7889. However, for smaller values of this ratio, the solution depends on how much communication redundancy the network needs. We provide solutions for both limited and full communication redundancy requirements. Copyright &copy; 2008 John Wiley & Sons, Ltd.
Introducing an explicit 2d matrix free Galerkin finite volume method for analyzing structural dynamics on unstructured mesh of linear triangular elements
Authors: Saeed-Reza Sabbagh-Yazdi, Mehdi Esmaeili, Nikos E. Mastorakis
Venue: Proceedings of the WSEAS International Conference on Applied Computing Conference (2008)

In this paper, a novel matrix free Finite Volume Method based on Galerkin assumptions is introduced for solution of weak form of Cauchy equilibrium equations on unstructured mesh of linear triangular elements. The developed shape function free Galerkin Finite Volume structural solver explicitly computes displacements in Cartezian coordinate directions for the two dimensional solid mechanic problems with arbitrary geometry under either static or dynamic loads. The accuracy of the introduced algorithm is demonstrated by comparison of computed results of two cantilever beams under static concentrated and uniformly distributed loads with analytical solution. The performance of the solver is presented in terms of convergence behavior of the method. In order to present the applicability of the introduced method to solve dynamic problems, the computed displacements of a storage tank frame structure under oscillating hydrostatic load is compared with the reported data in the literature.
Artificial Ants to Extract Leaf Outlines and Primary Venation Patterns
Authors: Robert J. Mullen, Dorothy Monekosso, Sarah Barman, Paolo Remagnino, Paul Wilkin
Venue: Proceedings of the 6th international conference on Ant Colony Optimization and Swarm Intelligence (2008)

This paper presents preliminary results on an investigation into using artificial swarms to extract and quantify features in digital images. An ant algorithm has been developed to automatically extract the outlines and primary venation patterns from digital images of living leaf specimens via an edge detection method. A qualitative and quantitative analysis of the results is carried out herein. The artificial swarms are shown to converge onto the edges within the leaf images and statistical accuracy, as measured against ground truth images, is shown to increase in accordance with the swarm convergence. Visual results are promising, however limitations due to background noise need to be addressed for the given application. The findings in this study present potential for increased robustness in using swarm based methods, by exploiting their stigmergic behaviour to reduce the need for parameter fine-tuning with respect to individual image characteristics.
Scalaris: reliable transactional p2p key/value store
Authors: Thorsten Schütt, Florian Schintke, Alexander Reinefeld
Venue: Proceedings of the 7th ACM SIGPLAN workshop on ERLANG (2008)

We present Scalaris, an Erlang implementation of a distributed key/value store. It uses, on top of a structured overlay network, replication for data availability and majority based distributed transactions for data consistency. In combination, this implements the ACID properties on a scalable structured overlay. By directly mapping the keys to the overlay without hashing, arbitrary key-ranges can be assigned to nodes, thereby allowing a better load-balancing than would be possible with traditional DHTs. Consequently, Scalaris can be tuned for fast data access by taking, e.g. the nodes' geographic location or the regional popularity of certain keys into account. This improves Scalaris' lookup speed in datacenter or cloud computing environments. Scalaris is implemented in Erlang. We describe the Erlang software architecture, including the transactional Java interface to access Scalaris. Additionally, we present a generic design pattern to implement a responsive server in Erlang that serializes update operations on a common state, while concurrently performing fast asynchronous read requests on the same state. As a proof-of-concept we implemented a simplified Wikipedia frontend and attached it to the Scalaris data store backend. Wikipedia is a challenging application. It requires - besides thousands of concurrent read requests per seconds - serialized, consistent write operations. For Wikipedia's category and backlink pages, keys must be consistently changed within transactions. We discuss how these features are implemented in Scalaris and show its performance.
Micro rotary swaging: process limitations and attempts to their extension
Authors: Bernd Kuhfuss, Eric Moumi, Volker Piwek
Venue: Microsystem Technologies (2008)

In this paper experimental investigations on micro components that are made by rotary swaging are presented and discussed. At first rotary swaging with its most important process variations is explained basically for the macro scale. Afterwards the fundamental changes of the forming of microcomponents are indicated as well as the smaller machines used henceforth. In this context, the shown process limitations and potential errors are very important. The change in microstructure after rotary swaging is shown in selected geometry and materials. The paper concludes with the planned experimental and analytic investigations as well as the machine design modifications for extension of the process limits of micro rotary swaging.
Study of the Influence of Noise in the Values of a Median Associative Memory
Authors: Humberto Sossa, Ricardo Barrón, Roberto A. Vázquez
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper we study how the performance of a median associative memory is influenced when the values of its elements are altered by noise. To our knowledge this kind of research has not been reported until know. We give formal conditions under which the memory is still able to correctly recall a pattern of the fundamental set of patterns either from a non-altered or a noisy version of it. Experiments are also given to show the efficiency of the proposal.