ppxscal/embedding_network huggingface dataset:
Parallel OLAP query processing in database clusters with data replication
Authors: Alexandre A. Lima, Camille Furtado, Patrick Valduriez, Marta Mattoso
Venue: Distributed and Parallel Databases (2009)

We consider the problem of improving the performance of OLAP applications in a database cluster (DBC), which is a low cost and effective parallel solution for query processing. Current DBC solutions for OLAP query processing provide for intra-query parallelism only, at the cost of full replication of the database. In this paper, we propose more efficient distributed database design alternatives which combine physical/virtual partitioning with partial replication. We also propose a new load balancing strategy that takes advantage of an adaptive virtual partitioning to redistribute the load to the replicas. Our experimental validation is based on the implementation of our solution on the SmaQSS DBC middleware prototype. Our experimental results using the TPC-H benchmark and a 32-node cluster show very good speedup.
Lévy-frailty copulas
Authors: Jan-Frederik Mai, Matthias Scherer
Venue: Journal of Multivariate Analysis (2009)

A parametric family of n-dimensional extreme-value copulas of Marshall-Olkin type is introduced. Members of this class arise as survival copulas in Levy-frailty models. The underlying probabilistic construction introduces dependence to initially independent exponential random variables by means of first-passage times of a Levy subordinator. Jumps of the subordinator correspond to a singular component of the copula. Additionally, a characterization of completely monotone sequences via the introduced family of copulas is derived. An alternative characterization is given by Hausdorff's moment problem in terms of random variables with compact support. The resulting correspondence between random variables, Levy subordinators, and copulas is studied and illustrated with several examples. Finally, it is used to provide a general methodology for sampling the copula in many cases. The new class is shown to share some properties with Archimedean copulas regarding construction and analytical form. Finally, the parametric form allows us to compute different measures of dependence and the Pickands representation.
Building Accountability Middleware to Support Dependable SOA
Authors: Kwei-Jay Lin, Mark Panahi, Yue Zhang, Jing Zhang, Soo-Ho Chang
Venue: IEEE Internet Computing (2009)

The Intelligent Accountability Middleware Architecture (Llama) project supports dependable service-oriented architecture (SOA) monitoring, runtime diagnosis, and reconfiguration. At its core, Llama implements an accountability service bus that users can install on existing service-deployment infrastructures. It collects and monitors service execution data from a key subset of services; enables Llama users to incorporate others' advanced diagnosis models and algorithms into the framework; and provides enterprise service bus extensions for collecting service profiling data, thus making process problems transparent to diagnose. Finally, experimental results indicate that using Llama contributes a modest amount of system overhead.
Based on Kalman Filter the Mobile Manipulator Non-calibration Free Dynamic Target Tracking Technology Research
Authors: Lingyu Sun, Minglu Zhang
Venue: Proceedings of the 2009 International Conference on Electronic Computer Technology (2009)

This paper presents the un-calibrated vision servo control algorithm to track the target with mobile manipulator. Color histogram distance calculation methods and shape matching method are discussed to recognize the target .The on-line estimation algorithm for Image Jacobian matrix model is designed based on the Kalman filter. With this Image Jacobian on-line estimator, the visual feedback controller is designed for the tasks of tracking target by un-calibrated vision sensor. The efficiency of un-calibrated vision servo control algorithm has been verified by experiments on Hebut-Ⅱmobile robot.
Project FIND: an integrated information and modeling system for management
Authors: John S. McGeachie, Donald L. Kreider
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

Project FIND (Forecasting Institutional Needs for Dartmouth) has been established at Dartmouth College to make institutional data readily accessible to administrative officers and faculty members through the facilities of the Dartmouth Time-Sharing System (DTSS). A concomitant goal is to develop models of the operation of the institution to facilitate long-range planning by providing quantitative estimates of the effects of policy changes.
Peripheral tangible interaction by analytic design
Authors: Darren Edge, Alan F. Blackwell
Venue: Proceedings of the 3rd International Conference on Tangible and Embedded Interaction (2009)

Tangible User Interfaces (TUIs) are commonly accepted as those in which the configuration of physical objects embodies digital system state, providing "graspable" digital media that can be manipulated in the focus of users' attention. In this paper we offer an alternative perspective on the use of tangibility in interaction, in which meaning is created not through precise manipulations of a computationally-interpreted spatial syntax, but through imprecise interactions with independently meaningful, digitally-augmented physical tokens. Users are free to arrange such tokens around the periphery of their workspace, away from their normal centre of attention, ready to selectively and fluidly engage them in loosely related, dispersed episodes of use. We call this concept "peripheral tangible interaction", and in this paper we describe both our analytic approach to designing a personal desktop TUI supporting such an interaction style, and user responses to its analytically-inspired features during extended deployment in a real office context.
Best Basis Selection Using Singular Value Decomposition
Authors: S. Esakkirajan, T. Veerakumar, P. Navaneethan
Venue: Proceedings of the 2009 Seventh International Conference on Advances in Pattern Recognition (2009)

This paper presents a new idea of best basis selection through singular value decomposition. Wavelet and Wavelet Packet Transform are efficient tools to represent the image. Wavelet Packet Transform is a generalization of wavelet transform which is more adaptive than the wavelet transform because it offers a rich library of bases from which the best one can be chosen for a certain class of images with a specified cost function. Wavelet packet decomposition yields a redundant representation of the image. The problem of wavelet packet image coding consists of considering all possible wavelet packet bases in the library, and choosing the one that gives the best coding performance. In this work, Singular Value Decomposition is used as a tool to select the best basis. Experimental results have demonstrated the validity of the approach.
Convex Hodge Decomposition and Regularization of Image Flows
Authors: Jing Yuan, Christoph Schnörr, Gabriele Steidl
Venue: Journal of Mathematical Imaging and Vision (2009)

The total variation (TV) measure is a key concept in the field of variational image analysis. In this paper, we focus on vector-valued data and derive from the Hodge decomposition of image flows a definition of TV regularization for vector-valued data that extends the standard componentwise definition in a natural way. We show that our approach leads to a convex decomposition of arbitrary vector fields, providing a richer decomposition into piecewise harmonic fields rather than piecewise constant ones, and motion texture. Furthermore, our regularizer provides a measure for motion boundaries of piecewise harmonic image flows in the same way, as the TV measure does for contours of scalar-valued piecewise constant images.
Diffusion of Innovations on Random Networks: Understanding the Chasm
Authors: Marc Lelarge
Venue: Proceedings of the 4th International Workshop on Internet and Network Economics (2008)

We analyze diffusion models on sparse random networks with neighborhood effects. We show how large cascades can be triggered by small initial shocks and compute critical parameters: contagion threshold for a random network, phase transition in the size of the cascade.
News Briefs
Authors: Brandi Ortega
Venue: IT Professional (2009)

A brief look at the business, technology, and security news affecting today's IT professional.
Characters of Frequency Response in a Coaxial Bragg Structure with Tapered Ripples
Authors: Xue-Yong Ding, Shi-Chang Zhang
Venue: Proceedings of the 2009 Second International Symposium on Intelligent Information Technology and Security Informatics (2009)

Based on the CST software, numerical simulations are carried out for the frequency response in a coaxial Bragg structure with tapered ripples. Results show that the bandwidth of the frequency response can be either narrowed or expanded, which depends on the tapering angle, and that the residual side-lobes of the frequency response can be effectively suppressed by employing the windowing-function technique. These characters of a tapered coaxial Bragg structure are favorable to improvement of the performance as a reflector or a filter in its application.
Analysis of electromagnetic pollution produced by line frequency coreless induction furnaces
Authors: Angela Iagar, Gabriel Nicolae Popa, Ioan Sora
Venue: WSEAS TRANSACTIONS on SYSTEMS (2009)

This paper presents the electromagnetic pollution produced by the line frequency coreless induction furnaces in the power supply network. We analyzed a furnace with 12.5 t capacity of cast-iron. The measurements have been made in the secondary of the furnace transformer, using the CA8334 three-phase power quality analyser. Experimental results emphasized the presence of harmonics and interharmonics in the phase voltages and harmonics in the currents absorbed from the network. The operation of analyzed furnace also produces unbalance. Further to the harmonic analysis of the signals measured in the furnace installation, we have been proposed some optimization methods for its operation, in such way to comply with the European norms of Electromagnetic Compatibility (EMC).
Urban Land Classification Research Based on Data Field
Authors: Yu Deng, Haijun Wang, Li Wang, Dandan Shan
Venue: Proceedings of the 3rd International Symposium on Advances in Computation and Intelligence (2008)

This paper further studied the theory of urban land classification based on data field starting from the practice of the urban Land classification work, relying on the basic principles of data field and proposed "the urban land classification methods based on data field". It's basic idea is: first, determining the type of the classification factors based on the way and space features of their impact on land. Subsequently, determining the approach of anisotropy and overlay of the radius of influence and the range of radiation according to the inherent characteristics of different classification factors. Finally, calculating different types of factors in different calculation method to obtain a total score of these classification units under specific form of role. In this paper pointed out the implementation steps of this method, and successfully proved that the method is practical and scientific by giving an example.
Understanding the intent behind mobile information needs
Authors: Karen Church, Barry Smyth
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2009)

Mobile phones are becoming increasingly popular as a means of information access while on-the-go. Mobile users are likely to be interested in locating different types of content. However, the mobile space presents a number of key challenges, many of which go beyond issues with device characteristics such as screen-size and input capabilities. In particular, changing contexts such as location, time, activity and social interactions are likely to impact on the types of information needs that arise. In order to offer personalized, effective mobile services we need to understand mobile users in more detail. Thus we carried out a four-week diary study of mobile information needs, looking in particular at the goal/intent behind mobile information needs, the topics users are interested in and the impact of mobile contexts such as location and time on user needs.
Towards movement-aware access control
Authors: Maria Luisa Damiani, Claudio Silvestri
Venue: Proceedings of the SIGSPATIAL ACM GIS 2008 International Workshop on Security and Privacy in GIS and LBS (2008)

The objective of spatially-aware access control models is to regulate the access to protected objects based on position information. In that last years, increasing attention has been paid to spatially-aware access control models for mobile and pervasive applications. Following the experience of design of the GEO-RBAC model, in this paper we want to look at those models with a critical eye and point out open conceptual and architectural challenges. In this paper, we first discuss architectural issues related to the development of a multi-domain access control system based on GEO-RBAC. Then we present the guidelines of a novel and space-centric modeling framework which aims at overcoming the conceptual limitations of the present model and similar solutions.
A Non-parametric Approach to Pair-Wise Dynamic Topic Correlation Detection
Authors: Yang Song, Lu Zhang, C. Lee Giles
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We introduce dynamic correlated topic models (DCTM) for analyzing discrete data over time. This model is inspired by the hierarchical Gaussian process latent variable models (GP-LVM). DCTM is essentially a non-linear dimension reduction technique which is capable of (1) detecting topic evolution within a document corpus,(2) discovering topic correlations between document corpora, and (3) monitoring topic and correlation trends dynamically. Unlike generative aspect models such like LDA, DCTM demonstrates a much faster converging rate with better model fitting to the data. We empirically assess our approach using 268,231 scientific documents, from the year 1988 to 2005. Posterior inferences suggest that DCTM is useful for capturing topic and correlation dynamics, as well as predicting their trends.
The quality framework of e-government development
Authors: W. Chutimaskul, S. Funilkul, V. Chongsuphajaisiddhi
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

e-Government is employed as a tool for supporting better government administration and public services. The success of e-Government is depending on its quality and usage. The higher e-Government quality, then better administration and services are provided. However, many e-Governments are developed without fully supporting the real government needs and sufficient quality. This paper pointes out three well-known quality aspects, i.e. process quality, information quality and service quality that can be embedded into e-Government. The imperial work on proving e-Government quality is addressed. In addition, the sustainable e-Government development containing four main components, i.e. stakeholder, development methodology, information and communication technology, and environment, is discussed. Integrating the above concepts, the quality framework of e-Government development to guarantee governmental and citizens' usage and satisfaction is established.
A hill-jump algorithm of Hopfield neural network for shortest path problem in communication network
Authors: Rong-Long Wang, Shan-Shan Guo, Kozo Okazaki
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2009)

In this paper, we present a hill-jump algorithm of the Hopfield neural network for the shortest path problem in communication networks, where the goal is to find the shortest path from a starting node to an ending node. The method is intended to provide a near-optimum parallel algorithm for solving the shortest path problem. To do this, first the method uses the Hopfield neural network to get a path. Because the neural network always falls into a local minimum, the found path is usually not a shortest path. To search the shortest path, the method then helps the neural network jump from local minima of energy function by using another neural network built from a part of energy function of the problem. The method is tested through simulating some randomly generated communication networks, with the simulation results showing that the solution found by the proposed method is superior to that of the best existing neural network based algorithm.
Stakeholder involvement, motivation, responsibility, communication: How to design usable security in e-Science
Authors: Ivan Flechais, M. Angela Sasse
Venue: International Journal of Human-Computer Studies (2009)

e-Science projects face a difficult challenge in providing access to valuable computational resources, data and software to large communities of distributed users. On the one hand, the raison d'etre of the projects is to encourage members of their research communities to use the resources provided. On the other hand, the threats to these resources from online attacks require robust and effective security to mitigate the risks faced. This raises two issues: ensuring that (1) the security mechanisms put in place are usable by the different users of the system, and (2) the security of the overall system satisfies the security needs of all its different stakeholders. A failure to address either of these issues can seriously jeopardise the success of e-Science projects. The aim of this paper is to firstly provide a detailed understanding of how these challenges can present themselves in practice in the development of e-Science applications. Secondly, this paper examines the steps that projects can undertake to ensure that security requirements are correctly identified, and security measures are usable by the intended research community. The research presented in this paper is based on four case studies of e-Science projects. Security design traditionally uses expert analysis of risks to the technology and deploys appropriate countermeasures to deal with them. However, these case studies highlight the importance of involving all stakeholders in the process of identifying security needs and designing secure and usable systems. For each case study, transcripts of the security analysis and design sessions were analysed to gain insight into the issues and factors that surround the design of usable security. The analysis concludes with a model explaining the relationships between the most important factors identified. This includes a detailed examination of the roles of responsibility, motivation and communication of stakeholders in the ongoing process of designing usable secure socio-technical systems such as e-Science.
Norm statistics and the complexity of clustering problems
Authors: Beth Novick
Venue: Discrete Applied Mathematics (2009)

In this paper we introduce a new class of clustering problems. These are similar to certain classical problems but involve a novel combination of @?"p-statistics and @?"q norms. We discuss a real world application in which the case p=2 and q=1 arises in a natural way. We show that, even for one dimension, such problems are NP-hard, which is surprising because the same 1-dimensional problems for the 'pure' @?"2-statistic and @?"2 norm are known to satisfy a 'string property' and can be solved in polynomial time. We generalize the string property for the case p=q. The string property need not hold when q@?p-1 and we show that instances may be constructed, for which the best solution satisfying the string property does arbitrarily poorly. We state some open problems and conjectures.
Securing Enterprise Applications: Service-Oriented Security (SOS)
Authors: Csilla Farkas, Michael N. Huhns
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)

Some of the characteristics that make service-oriented architectures appealing for enterprise applications also make them vulnerable to security breaches. The vulnerabilities are primarily due to the openness of the service-execution environment, to the dynamic run-time selection and composition of services, and to the autonomy of the individual services. In this paper, we describe these vulnerabilities and discuss ways of mitigating them. Such ways include software agent technology and distributed database transaction semantics.
A compositional query algebra for second-order logic and uncertain databases
Authors: Christoph Koch
Venue: Proceedings of the 12th International Conference on Database Theory (2009)

World-set algebra is a variable-free query language for uncertain databases. It constitutes the core of the query language implemented in MayBMS, an uncertain database system. This paper shows that world-set algebra captures exactly second-order logic over finite structures, or equivalently, the polynomial hierarchy. The proofs also imply that world-set algebra is closed under composition, a previously open problem.
Brief paper: On using least-squares updates without regressor filtering in identification and adaptive control of nonlinear systems
Authors: Miroslav Krstic
Venue: Automatica (Journal of IFAC) (2009)

In continuous-time system identification and adaptive control the least-squares parameter estimation algorithm has always been used with regressor filtering, which adds to the dynamic order of the identifier and affects its performance. We present an approach for designing a least-squares estimator that uses an unfiltered regressor. We also consider a problem of adaptive nonlinear control and present the first least-squares-based adaptive nonlinear control design that yields a complete Lyapunov function. The design is presented for linearly parametrized nonlinear control systems in 'normal form'. A scalar linear example is included which adds insight into the key ideas of our approach and allows showing that, for linear systems, our Lyapunov-LS design with unfiltered regressor, presented in the note for unnormalized least-squares, can also be extended to normalized least-squares.
Improving multikey Quicksort for sorting strings with many equal elements
Authors: Eunsang Kim, Kunsoo Park
Venue: Information Processing Letters (2009)

Bentley and Sedgewick proposed multikey Quicksort with 'split-end' partitioning for sorting strings. But it can be slow in case of many equal elements because it adopted 'split-end' partitioning that moves equal elements to the ends and swaps back to the middle. We present 'collect-center' partitioning to improve multikey Quicksort in that case. It moves equal elements to the middle directly like the 'Dutch National Flag Problem' partitioning approach and it uses two inner loops like Bentley and McIlroy's. In case of many equal elements such as DNA sequences, HTML files, and English texts, multikey Quicksort with 'collect-center' partitioning is faster than multikey Quicksort with 'split-end' partitioning.