ppxscal/embedding_network huggingface dataset:
Learning SQL on SQL Server 2005
Authors: Richard Earp, Sikha Bagui
Venue:  (2006)

Anyone who interacts with today's modern databases needs to know SQL (Structured Query Language), the standard language for generating, manipulating, and retrieving database information. In recent years, the dramatic rise in the popularity of relational databases and multi-user databases has fueled a healthy demand for application developers and others who can write SQL code efficiently and correctly. If you're new to databases, or need a SQL refresher, Learning SQL on SQL Server 2005 is an ideal step-by-step introduction to this database query tool, with everything you need for programming SQL using Microsoft's SQL Server 2005-one of the most powerful and popular database engines used today. Plenty of books explain database theory. This guide lets you apply the theory as you learn SQL. You don't need prior database knowledge, or even prior computer knowledge. Based on a popular university-level course designed by authors Sikha Saha Bagui and Richard Walsh Earp, Learning SQL on SQL Server 2005 starts with very simple SQL concepts, and slowly builds into more complex query development. Every topic, concept, and idea comes with examples of code and output, along with exercises to help you gain proficiency in SQL and SQL Server 2005. With this book, you'll learn: Beginning SQL commands, such as how and where to type an SQL query, and how to create, populate, alter and delete tables How to customize SQL Server 2005's settings and about SQL Server 2005's functions About joins, a common database mechanism for combining tables Query development, the use of views and other derived structures, and simple set operations Subqueries, aggregate functions and correlated subqueries, as well as indexes and constraints that can be added to tables in SQL Server 2005 Whether you're an undergraduate computer science or MIS student, a self-learner who has access to the new Microsoft database, or work for your company's IT department, Learning SQL on SQL Server 2005 will get you up to speed on SQL in no time.
The effect of packet dispersion on voice applications in IP networks
Authors: Hanoch Levy, Haim Zlatokrilov
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

Delivery of real time streaming applications, such as voice and video over IP, in packet switched networks is based on dividing the stream into packets and shipping each of the packets on an individual basis to the destination through the network. The basic implicit assumption on these applications is that shipping all the packets of an application is done, most of the time, over a single path along the network. In this work, we present a model in which packets of a certain session are dispersed over multiple paths, in contrast to the traditional approach. The dispersion may be performed by network nodes for various reasons such as load-balancing, or implemented as a mechanism to improve quality, as will be presented in this work. To study the effect of packet dispersion on the quality of voice over IP (VoIP) applications, we focus on the effect of the network loss on the applications, where we propose to use the Noticeable Loss Rate (NLR) as a measure (negatively) correlated with the voice quality. We analyze the NLR for various packet dispersion strategies over paths experiencing memoryless (Bernoulli) or bursty (Gilbert model) losses, and compare them to each other. Our analysis reveals that in many situations the use of packet dispersion reduces the NLR and thus improves session quality. The results suggest that the use of packet dispersion can be quite beneficial for these applications.
Building-block Identification by Simultaneity Matrix
Authors: Chatchawit Aporntewan, Prabhas Chongstitvatana
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

This paper presents a study of building blocks (BBs) in the context of genetic algorithms (GAs). In GAs literature, the BBs are common structures of high-quality solutions. The aim is to identify and maintain the BBs while performing solution recombination. To identify the BBs, we construct an $$\ell \times \ell$$ simultaneity matrix according to a set of $$\ell$$-bit solutions. The matrix element in row i and column j denoted by m ij is the degree of dependency between bit i and bit j. We search for a partition of $${0, \ldots, \ell-1}$$ for the matrix. The main idea of partitioning is to put i and j of which m ij is significantly high in the same partition subset. The partition represents the bit positions of BBs. The partition is exploited in solution recombination so that the bits governed by the same partition subset are passed together. It can be shown that by exploiting the simultaneity matrix the additively decomposable functions can be solved in a polynomial relationship between the number of function evaluations required to reach the optimum and the problem size. A comparison to the Bayesian optimization algorithm (BOA) is made. Empirical results show that the BOA uses less number of function evaluations than that of our algorithm. However, computing the matrix is ten times faster than constructing the Bayesian network.
Minimum Steiner trees, roots of a polynomial, and other magic
Authors: J. Soukup
Venue: Issue 22 (December 1977) (1977)

The paper is a collection of observations and ideas on a surprising similarity between Steiner points on one hand, and roots of a complex polynomial on the other. These ideas can also be used to derive a simple practical method to generate good suboptimal Steiner trees. However, the main purpose of the paper is to point out a vast area of problems still open to further research.
Building data integration queries by demonstration
Authors: Rattapoom Tuchinda, Pedro Szekely, Craig A. Knoblock
Venue: Proceedings of the 12th international conference on Intelligent user interfaces (2007)

The magnitude of data available on the web prompts the need for an easy to use query interface that enables users to integrate data from multiple web sources in an intelligent fashion. Past work in the area of databases has resulted in different query interface systems that simplify query formulation. While these approaches reduce the user's effort to compose queries, the user is still required to pick data sources to use and the interaction is not guaranteed to yield a non-empty result set. We introduce a novel approach that exploits the structure of the relational data source(s) to formulate a set of constraints. These constraints are used in conjunction with partial plans to produce an intelligent query interface that (a) does not require the user to know details about data sources or existing values (b) suggests valid inputs to the user (c) creates consistent queries that always return values.
On the Wiberg Algorithm for Matrix Factorization in the Presence of Missing Components
Authors: Takayuki Okatani, Koichiro Deguchi
Venue: International Journal of Computer Vision (2007)

This paper considers the problem of factorizing a matrix with missing components into a product of two smaller matrices, also known as principal component analysis with missing data (PCAMD). The Wiberg algorithm is a numerical algorithm developed for the problem in the community of applied mathematics. We argue that the algorithm has not been correctly understood in the computer vision community. Although there are many studies in our community, almost every one of which refers to the Wiberg study, as far as we know, there is no literature in which the performance of the Wiberg algorithm is investigated or the detail of the algorithm is presented. In this paper, we present derivation of the algorithm along with a problem in its implementation that needs to be carefully considered, and then examine its performance. The experimental results demonstrate that the Wiberg algorithm shows a considerably good performance, which should contradict the conventional view in our community, namely that minimization-based algorithms tend to fail to converge to a global minimum relatively frequently. The performance of the Wiberg algorithm is such that even starting with random initial values, it converges in most cases to a correct solution, even when the matrix has many missing components and the data are contaminated with very strong noise. Our conclusion is that the Wiberg algorithm can also be used as a standard algorithm for the problems of computer vision.
Modelling and simulation of human decision-making in manufacturing systems
Authors: Gert Zülch
Venue: Proceedings of the 38th conference on Winter simulation (2006)

The simulation of manufacturing processes mainly focuses on the structure of machinery resources and the flow of material, but the inclusion of the personnel in the simulation model is only slowly gaining in importance. When personnel resources are modelled, merely the operative tasks are represented. However, as a result of modern manufacturing concepts, worker decisions at a workshop level are becoming more and more important. This article deals with various concepts for the modelling of human decisions in manufacturing systems, namely from human decision makers as passive resources over the modelling of decisions based on global rules to the modelling of active decision makers with individual, locally valid decisionmaking rules. Each of these various types of modelling will be elucidated using an application example.
Windows XP Hacks
Authors: Preston Gralla
Venue:  (2003)

Now power users can rejoice! Windows XP Hacks offers tips, tools, and know-how to bend Windows XP to your will. The book delves into XP topics such as controlling the control panel, changing unchangeable icons, removing uninstallable XP components, stopping pop-up ads, taking a bite out of cookies, speeding up file downloads, protecting yourself with firewalls and proxy servers, and more. Users of both Windows XP Home Edition and Windows XP Pro Edition will find smart, timesaving, fun, and useful hacks for virtually every feature in their operating system. Even if you're not a power user yet, this book will have you well on your way.
Extending model driven architecture benefits to requirements engineering
Authors: Salah Kabanda, Mathew Adigun
Venue: Proceedings of the 2006 annual research conference of the South African institute of computer scientists and information technologists on IT research in developing countries (2006)

This work focuses on developing a requirement engineering model (RSPL) based on a Model Driven Architecture (MDA) and Web-tier Application Framework (WAF), to support automatic and interactive requirements generation when creating families of systems. In realizing the model, two goals were targeted namely (i) to construct a RE model that support automatic transformation of domain features into actor-specific requirements; and (ii) to design and implement an interactive web based tool for requirements engineering. The result obtained is twofold: (i) adopting MDA during RE for a product line reduced costs and development time; (ii) tool implementation based on WAF ensured that support for different client types was possible. In conclusion, the study is a contribution to a recently advocated idea that requirements generation could be model-driven. The result shows that the idea is promising with respect to requirement reuse and improving communication barriers among members of a system development team.
James-Stein estimators for time series regression models
Authors: Motohiro Senda, Masanobu Taniguchi
Venue: Journal of Multivariate Analysis (2006)

The least squares (LS) estimator seems the natural estimator of the coefficients of a Gaussian linear regression model. However, if the dimension of the vector of coefficients is greater than 2 and the residuals are independent and identically distributed, this conventional estimator is not admissible. James and Stein [Estimation with quadratic loss, Proceedings of the Fourth Berkely Symposium vol. 1, 1961, pp. 361-379] proposed a shrinkage estimator (James-Stein estimator) which improves the least squares estimator with respect to the mean squares error loss function. In this paper, we investigate the mean squares error of the James-Stein (JS) estimator for the regression coefficients when the residuals are generated from a Gaussian stationary process. Then, sufficient conditions for the JS to improve the LS are given. It is important to know the influence of the dependence on the JS. Also numerical studies illuminate some interesting features of the improvement. The results have potential applications to economics, engineering, and natural sciences.
SPH Simulation of transition to turbulence for planar shear flow subjected to a streamwise magnetic field
Authors: Fangming Jiang, Mónica S. A. Oliveira, Antonio C. M. Sousa
Venue: Journal of Computational Physics (2006)

Active flow control of electrically conducting fluids finds growing importance in the metallurgical industry. A magnetic field applied in the streamwise direction of electrically conducting fluid flow restrains the velocity fluctuations in the transverse plane and the transition to turbulence may be delayed. The smoothed particle hydrodynamic (SPH) methodology is employed to interpret this concept. To this purpose, the onset of turbulence is related to the transitional organization of the SPH fluid particle structure or to the temporal history of the turbulence-related quantities during the early stages of the transition to turbulence. The results put in evidence the ability of a streamwise magnetic field on controlling the transition to turbulence of an electrically conducting fluid flow, i.e., the transition to turbulence may be distinctly delayed in the fluid flow subjected to a streamwise magnetic field. Furthermore, if the applied streamwise magnetic field is strong enough, the Reynolds stress in the streamwise direction may be dominant over the transverse counterpart, and turbulence is anisotropic as only in the streamwise direction of the fluid flow, the Reynolds stress is detectable.
Multiscale queueing analysis
Authors: Vinay J. Ribeiro, Rudolf H. Riedi, Richard G. Baraniuk
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

This paper introduces a new multiscale framework for estimating the tail probability of a queue fed by an arbitrary traffic process. Using traffic statistics at a small number of time scales, our analysis extends the theoretical concept of the critical time scale and provides practical approximations for the tail queue probability. These approximations are non-asymptotic; that is, they apply to any finite queue threshold. While our approach applies to any traffic process, it is particularly apt for long-range-dependent (LRD) traffic. For LRD fractional Brownian motion, we prove that a sparse exponential spacing of time scales yields optimal performance. Simulations with LRD traffic models and real Internet traces demonstrate the accuracy of the approach. Finally, simulations reveal that the marginals of traffic at multiple time scales have a strong influence on queueing that is not captured well by its global second-order correlation in non-Gaussian scenarios.
Unlimited vocabulary speech recognition for agglutinative languages
Authors: Mikko Kurimo, Antti Puurula, Ebru Arisoy, Vesa Siivola, Teemu Hirsimäki, Janne Pylkkönen, Tanel Alumäe, Murat Saraclar
Venue: Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics (2006)

It is practically impossible to build a word-based lexicon for speech recognition in agglutinative languages that would cover all the relevant words. The problem is that words are generally built by concatenating several prefixes and suffixes to the word roots. Together with compounding and inflections this leads to millions of different, but still frequent word forms. Due to inflections, ambiguity and other phenomena, it is also not trivial to automatically split the words into meaningful parts. Rule-based morphological analyzers can perform this splitting, but due to the handcrafted rules, they also suffer from an out-of-vocabulary problem. In this paper we apply a recently proposed fully automatic and rather language and vocabulary independent way to build sub-word lexica for three different agglutinative languages. We demonstrate the language portability as well by building a successful large vocabulary speech recognizer for each language and show superior recognition performance compared to the corresponding word-based reference systems.
Behavioral inhibition and prefrontal cortex in decision-making
Authors: Masamichi Sakagami, Xiaochuan Pan, Bob Uttl
Venue: Neural Networks (2006)

Every day we make innumerable decisions; some require no effort at all whereas others require considerable deliberation and weighing of various options. Despite the importance of decision-making in our lives and increased research interest, the specific neural mechanisms underlying decision-making remain unclear. We propose that the brain has at least two cortical pathways that independently generate a decision about appropriate behavior in given circumstances. These two pathways are extensions of the dorsal and ventral streams of the visual processing pathways. The parieto-premotor (extended dorsal) pathway makes decisions about motor actions in a largely autonomous and automatic fashion whereas the temporo-ventrolateral prefrontal (extended ventral) pathway is involved primarily in deliberate decisions and inhibitory control over behavior through the inhibitory function of the ventrolateral prefrontal cortex.
A comprehensive review of methods for simulation output analysis
Authors: Christos Alexopoulos
Venue: Proceedings of the 38th conference on Winter simulation (2006)

This paper reviews statistical methods for analyzing output data from computer simulations. Specifically, it focuses on the estimation of steady-state system parameters. The estimation techniques include the replication/deletion approach, the regenerative method, the batch means method, and methods based on standardized time series.
Construction of deletion correcting codes using generalized Reed---Solomon codes and their subcodes
Authors: Dongvu Tonien, Reihaneh Safavi-Naini
Venue: Designs, Codes and Cryptography (2007)

A code is n-deletion correcting if it is possible to correct any n deletion of symbols having occurred in transmission of codewords. In this paper, we present explicit constructions of n-deletion correcting codes for arbitrary values of n using generalized Reed---Solomon codes and their subcodes.
FE Analysis of a PZT-actuated adaptive beam with vibration damping using a parallel R-L shunt circuit
Authors: C. H. Nguyen, S. J. Pietrzko
Venue: Finite Elements in Analysis and Design (2006)

This paper presents the simulation of adaptive structures with shunt circuits via the finite element method (FEM). The experiment configuration consists in an aluminium cantilever beam actuated by a PZT patch, whose flexural vibration is transmitted to a collocated PZT sensor, which is connected to a parallel R-L shunt circuit damping the vibration. First, starting from the piezoelectric constitutive equations, analytical formulations using FEM are defined for the actuator/beam/sensor vibrating system. Together with the corresponding sensor compliance, the connected shunt circuit is implicitly represented through an equivalent electrical load impedance. Optimal tuned values of the resistor and inductor for the shunt circuit are calculated at selected harmonic resonance vibration frequencies, and further related FE data input and boundary conditions are developed. Extensive numerical results are then obtained in using the FEM code ANSYS Multiphysics, which has piezoelectric coupling capabilities as well as electric finite elements to be used in the R-L circuit simulation. Calculated reduction levels of the beam vibration amplitude, due to the shunt circuit with optimal tuned R-L values, attain high values. Finally, an alternative method to simulating implicitly the R-L circuit consists in applying a shunt-equivalent voltage input as supplementary boundary condition to the sensor. In this method, numerical results are obtained by using the FEM code FEMLAB, with its ability of data transfer into the MATLAB script.
Scheduling over nonstationary wireless channels with finite rate sets
Authors: Matthew Andrews, Lisa Zhang
Venue: IEEE/ACM Transactions on Networking (TON) (2006)

We consider a wireless basestation transmitting high-speed data to multiple mobile users in a cell. The channel conditions between the basestation and the users are time-varying and user-dependent. Our objective is to design a scheduler that determines which user to schedule at each time step. Previous work on this problem has typically assumed that the channel conditions are governed by a stationary stochastic process. In this setting, a popular algorithm known as Max-Weight has been shown to have good performance.However, the stationarity assumption is not always reasonable. In this paper, we study a more general worst-case model in which the channel conditions are governed by an adversary and are not necessarily stationary. In this model, we show that the nonstationarities can cause Max-Weight to have extremely poor performance. In particular, even if the set of possible transmission rates is finite, as in the CDMA 1xEV-DO system, Max-Weight can produce queue sizes that are exponential in the number of users. On the positive side, we describe a set of tracking algorithms that aim to track the performance of a schedule maintained by the adversary. For one of these tracking algorithms, the queue sizes are only quadratic.We discuss a number of practical issues associated with the tracking algorithms. We also illustrate the performance of Max-Weight and the tracking algorithms using simulation.
A computational approach for argumentative discourse in multi&dash;agent decision making environments
Authors: Nikos Karacapilidis, Dimitris Papadias
Venue: AI Communications (1998)

This paper describes a Group Decision Support System for cooperative or non&dash;cooperative argumentative discourses. The system provides agents means of expressing and weighing their individual arguments and preferences, in order to argue for or against the selection of a certain choice. It supports defeasible and qualitative reasoning in the presence of ill&dash;structured information. Argumentation is performed through a set of discourse acts which call a variety of procedures for the propagation of information in the corresponding discussion graph. The system incorporates Case Based Reasoning to resolve current issues by using previous similar situations. Cases are not mere representations of past data, but flexible entities associated with the underlying viewpoint of an agent and the evolution of the corresponding discussion. The paper provides an object&dash;oriented description of the elements involved, and illustrates their dependencies through a comprehensive example.