ppxscal/embedding_network huggingface dataset:
Towards Indexing Schemes for Self-Tuning DBMS
Authors: Kai-Uwe Sattler, Eike Schallehn, Ingolf Geist
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Index tuning as part of database tuning is the task of selecting and creating indexes with the goal of reducing query processing times. However, in dynamic environments with various ad-hoc queries it is difficult to identify potentially useful indexes in advance. In this paper, based on previous research regarding automatic index creation at runtime we point out the need for new indexing schemes suitable for self-tuning. Based on problems with previous approaches we describe the key concepts, which are sparse and partial indexing, usage-balanced instead of data-balanced structures, and dynamic resource assignment. We illustrate the approach by a simple index structure, which provides adaptability as well as improved access characteristics. Furthermore, we will outline key tasks to introduce according concepts in future DBMS.
Improved signal copy with partially known or unknown array response
Authors: J. Yang, S. Daas, A. Swindlehurst
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Blind adaptive algorithms extract signals that overlap in time and frequency by exploiting their temporal structure, but ignore any available spatial (array response) data. On the other hand, direction-finding based methods compute the signal copy weights using estimates of the signal directions, but ignore information about signal structure. In this paper, we present two simple iterative techniques that attempt to incorporate both temporal and spatial information in estimating the signal waveforms received by an array of sensors. The first technique assumes an initial blind signal estimate is available, and uses least-squares to approximate the array response and refine the signal estimate. The second method is applicable to digitally modulated signals, and uses bit decisions made on an initial signal estimate to recompute the signal copy weight vectors. A theoretical performance analysis of both algorithms is conducted for the high SNR case, and some representative simulation results are included.
Justification of socioscientific claims as the basis for assessing argumentation
Authors: Troy D. Sadler
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This investigation introduces a novel rubric for the assessment of argumentation quality relative to socioscientific issues and presents results from a field test of its application. Forty-five students participated in interviews designed to elicit socioscientific argumentation regarding genetic engineering issues. A five point rubric was developed to assess how well individuals justified the claims they advanced. Implications for the use of this tool for advancing research agendas in the learning sciences will be discussed.
Towards an Architecture of an Image Database
Authors: Ranjan Parekh
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

This paper addresses the problem of searching and retrieval in an image database by considering a layered approach - a "physical" layer which handles physical attributes of image files and a "features" layer which handles color based features of images. Color information is represented both by local and global histogram approaches in the HSV color space and comparison is done using "color moments" of global HSV histograms and Euclidean distances between cellular color values.
A Methodology and Conceptual Framework for Flow-Manufacturing-Oriented ERP Systems
Authors: Jianfu Zhang, Zhijun Wu, Pingfa Feng, Dingwen Yu
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

This paper proposes an activity-based modeling methodology and conceptual framework for an ERP system that oriented to flow manufacturing enterprises. The proposal that activity theory might serve as a model or theory for business process modeling remains an open question. Its purpose is to explore the use of the Activity Theory as a modeling technology to illustrate the proposed methodology. The advantage of this modeling methodology is easy to integrate and extend the especial requirement of the implementation of the middle-sized flow-based enterprises. In this paper, by analyzing the components of an activity and the relationship of the business process modeling, several basic concepts are given and the method of the process modeling is also expressed. Then, a conceptual framework for a flexible integration and extensible ERP system is studied through communicating among different activity units. As a case study, the paper also discusses the process of the information exchange and interface working between the different modules.
System F with type equality coercions
Authors: Martin Sulzmann, Manuel M. T. Chakravarty, Simon Peyton Jones, Kevin Donnelly
Venue: Proceedings of the 2007 ACM SIGPLAN international workshop on Types in languages design and implementation (2007)

We introduce System FC, which extends System F with support for non-syntactic type equality. There are two main extensions: (i) explicit witnesses for type equalities, and (ii) open, non-parametric type functions, given meaning by top-level equality axioms. Unlike System F, FC is expressive enough to serve as a target for several different source-language features, including Haskell's newtype, generalised algebraic data types, associated types, functional dependencies, and perhaps more besides.
Spoof Detection for Preventing DoS Attacks against DNS Servers
Authors: Fanglu Guo, Jiawu Chen, Tzi-cker Chiueh
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

The Domain Name System (DNS) is a critical element of the Internet infrastructure. Even a small part of the DNS infrastructure being unavailable for a very short period of time could potentially upset the entire Internet and is thus totally unacceptable. Unfortunately, because DNS queries and responses are mostly UDP-based, it is vulnerable to spoofing-based denial of service (DoS) attacks, which are difficult to defeat without incurring significant collateral damage. The key to thwart this type of DoS attacks is spoof detection, which enables selective discarding of spoofed DNS requests without jeopardizing the quality of service to legitimate requests. This paper presents spoof detection strategies for protecting DNS servers from DoS attacks. These strategies create some form of cookies for a DNS server to check if each incoming request is indeed from where the request packet says it is from. We have implemented them as a firewall module called DNS guard. Measurements on the current DNS guard prototype show that it can deliver up to 80K requests/sec to legitimate users in the presence of DoS attacks at the rate of 250K requests/sec.
P2P-based Trust Model for E-Commerce
Authors: Cheng Su, Hong Zhang, Fang-ming Bi
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

In an open distributed environment, traditional centralized trust mechanism for e-commerce becomes difficult to adapt to it. The existing P2P trust models are propitious to this environment, but they can not directly be used in e-commerce as taking no consideration for characteristics of e-commerce. This paper combines P2P trust model and e-transaction characteristics, presents a new P2P-based trust model for e-commerce. By computing interactive experiences, recommendations of other peers, risk factors and the transaction context, the model evaluates every peer's globe trustworthiness in order to guide transaction participants. Results of Simulation experiments show that, compared with some current trust models, the new model is effective against malicious behavior.
Robust Model Selection Using Cross Validation: A Simple Iterative Technique for Developing Robust Gene Signatures in Biomedical Genomics Applications
Authors: Ramasubbu Venkatesh, Charles Rowland, Hongjin Huang, Olivia T. Abar, John Sninsky
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

The iterative technique proposed in this paper provides an effective way to select a robust model in wide data settings such as in genomics and gene expression studies where number of markers >> number of samples. This technique can be quite useful when an independent test set is not available and crossvalidation is used as a validation step. It removes many of the ambiguities surrounding the final model selection process giving a computationally simple and transparent way to choose a robust model. The robust model selection is mainly accomplished by utilizing the fold frequencies of markers selected in repeated crossvalidation experiments in a direct and effective manner. The technique, both in terms of feature selection and classification is not method specific and therefore can be used with different sets of feature selection and classification methods. The usefulness of this technique extends even to situations where independent test set is available. Using this technique will allow one to squeeze extra performance out of the feature selection procedure and increase the odds of replication in an independent test set. Frequently only one test set is available and in this case use of this technique will help avoid repeated use of the test set. Availability of techniques such as one described in this study can be of great practical value in developing biomedical genomic applications e.g., molecular diagnostic tests. The technique was successfully applied to a complex real world data set and significant improvements were demonstrated in terms of compactness, accuracy and generalizability of the model.
Cache coherence tradeoffs in shared-memory MPSoCs
Authors: Mirko Loghi, Massimo Poncino, Luca Benini
Venue: ACM Transactions on Embedded Computing Systems (TECS) (2006)

Shared memory is a common interprocessor communication paradigm for single-chip multiprocessor platforms. Snoop-based cache coherence is a very successful technique that provides a clean shared-memory programming abstraction in general-purpose chip multiprocessors, but there is no consensus on its usage in resource-constrained multiprocessor systems on chips (MPSoCs) for embedded applications. This work aims at providing a comparative energy and performance analysis of cache-coherence support schemes in MPSoCs. Thanks to the use of a complete multiprocessor simulation platform, which relies on accurate technology-homogeneous power models, we were able to explore different cache-coherent shared-memory communication schemes for a number of cache configurations and workloads.
Optimal partitioning of nodes to space-sharing parallel tasks
Authors: Silvia M. Figueira
Venue: Parallel Computing (2006)

This paper focuses on the execution of distributed applications on parallel platforms, such as MPPs or homogeneous clusters. These applications are usually formed by individual tasks, which are each mapped to the nodes available in the parallel platform. When these tasks can execute simultaneously, it may be necessary to space-share the nodes available within the application. In this case, partitioning the nodes among the space-sharing tasks is key in obtaining the best performance. This paper presents a polynomial algorithm to provide an optimal partitioning of nodes to parallel tasks, enabling them to execute simultaneously in minimum time.
BUILDING A SMART MEETING ROOM: FROM INFRASTRUCTURE TO THE VIDEO GAP (RESEARCH AND OPEN ISSUES)
Authors: Alejandro Jaimes, Jun Miyazaki
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

At FXPAL Japan we have built an (experimental) Smart Conference Room (SCR) that contains multiple cameras, microphones, displays, and capture devices. Based on our experience, in this paper we discuss research and open issues in constructing SCRs like the one built at FXPAL for the purpose of automatic content analysis. Our discussion is grounded on a novel conceptual meeting model that consists of physical (from layout to cameras), conceptual (meeting types, actors), sensory (audio-visual capture), and content (syntax and semantics) components. We also discuss storage, retrieval, and deployment issues.
A generic prototype for storing and querying XML documents in RDBMS using model mapping methods
Authors: Saeed Hassan Hisbani
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

In this paper a generic prototype for storing and querying XML data in any RDBMS using model mapping methods is proposed. In this prototype the latest researched model mapping method SUCXENT and free of cost available technologies MySQL, PhpMyAdmin and PHP classes are used as the examples. Otherwise being a generics solution any model mapping strategy to translate XML document into relational schema, any RDBMS as backend and any programming language for processing and front end can be used. As the proposed prototype is using SUCXENT so it will be proved to be an efficient solution with respect to Query processing specially recursive XML queries and updating. Instead of XPath, XQuery query processor is used for the querying of XML data as it is going to be standard XML query language.
Self-aware framework for adaptive augmented reality
Authors: Eduardo E. Veas, Kiyoshi Kiyokawa, Haruo Takemura
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

In the dynamic environments of UAR, software is expected to be modifiable to accommodate for new user needs, expectations, and changing environments. Reflective middleware provides, in a certain way, an open implementation and presents an efficient alternative to deal with highly dynamic environments. The present article describes an implementation of Reflective Middleware based on an object oriented metamodel and its application in the field of AR. Along the way, it introduces support services that deterministically apply to every component, even those yet to be engineered. These services have been defined as Generic Services, the process of creating generic services is demonstrated with various examples, showing their advantages as regards to issues of code reduction and flexibility.
What applying of the ODP viewpoints teaches us about tool-chains
Authors: Lea Kutvonen
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

For some time, we have focused our research on the generic B2B middleware services for managing inter- enterprise communities of autonomous business ser- vices. In contrast to some earlier papers where the rela- tionships between the Pilarcos concepts and their coun- terparts from the ODP-RM are shown, this paper ap- proaches the management system for inter-enterprise communities itself as the ODP system of interest. The lessons learned underline a number of research chal- lenges we are currently working with, especially for the B2B middleware repositories, their federations, and service development tools relying on the federated repos- itories.
Mobile Advertising: a Framework for the Appraisal of the Campaigns
Authors: Andrea Rangone, Filippo Maria Renga
Venue: Proceedings of the International Conference on Mobile Business (2006)

In the article, the most important elements making up a mobile marketing solution are pointed out, trying to underline all significant requirements needed to be satisfied. Moreover is provided a possible set of indicators for measuring how well the requirements are met. The argumentation is completed by the results obtained during three mobile marketing campaigns carried out in Finland, Germany and Italy.
Code Design as an Optimization Problem: from Mixed Integer Programming to an Improved High Performance Randomized GRASP like Algorithm and from This One to an Improved Genetic Algorithm
Authors: Jose Barahona da Fonseca
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

We begin to show that the design of optimum codes is a very difficult task by a set of preliminary brute force experiments where we generate all the possible optimum codes of a given length and minimum Hamming distance and then estimate the probability of finding one of these codes filling randomly the matrix that defines the code. Then we develop a novel approach to the code design problem based on the well known optimization technique of Mixed Integer Programming. Unfortunately the GAMS optimization software package limitation of 10 indexes imposes a limit of a maximum length 5 in the code to be designed. We show some results confirmed by the literature with this MIP model. Finally we develop a high performance randomized algorithm that surprisingly has much better runtimes than the MIP model.
Using simulation for launch team training and evaluation
Authors: Cary J. Peaden
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper describes some of the history and uses of simulation systems and processes for the National Aeronautics and Space Administration's (NASA's) training and evaluation of launch, mission control, and mission management teams. It documents some of the types of simulations that are used at Kennedy Space Center (KSC) today. It provides an initial baseline and some recommendations for further research into simulation for launch team training and evaluation in the near future. A theme of this paper is that the use of simulation for the training and evaluation of launch teams is very important, and NASA should learn from and expand on these types of simulations especially as it prepares to develop new launch vehicles and processes under the Exploration program.
Detection and localization of multiple sources via Bayesian predictive densities
Authors: C.-M. Cho, P. M. Djuric
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A new approach based on a Bayesian inference scheme and unitary subspace decomposition is proposed to detect and estimate coherent and noncoherent signals. The authors assume that the signal vectors are random Gaussian vectors with zero mean and unknown covariance matrix and the prior of the direction-of-arrivals is a uniform distribution. Under these assumptions, the Bayesian estimator for the directional parameters coincides with the maximum likelihood estimator. In the detection part, the proposed detection criterion outperforms the minimum description length (MDL) principle and Akaike's information criterion (AIC) particularly for a small number of sensors and/or snapshots, and/or low SNR. This is achieved without additional computational complexity. Simulation results that demonstrate the performance of the proposed solution are included.
A Fast Algorithm for the Quasi-Synchronous Window
Authors: Xiaofeng Yuan, Shuhong Chen, Hualong Xu, Zhijie Zhou
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

A fast algorithm based on the central limit theorem is proposed for the quasi-synchronous window in this paper. Based on analysis of the quasi-synchronous window, a probability model is established for the purpose of obtaining the window coefficients. By the means of applying the central limit theorem to the model, it has been proved theoretically that a specific Gaussian window is capable of approximating the quasi-synchronous window accurately while the number of signal cycles is sufficiently large. Parameters of the Gaussian window are analyzed in detail.. and some important formulas are given. By approximating the quasi-synchronous window with the specific Gaussian window, computational burden is decreased significantly. Computer simulations demonstrate that the algorithm outperforms both the current FFT based algorithm and the convolution based algorithm remarkably in terms of computational speed, especially when the number of signal cycles is large. In addition, it has been verified that precision of the fast algorithm is perfect.
A meshless Galerkin method for Dirichlet problems using radial basis functions
Authors: Yong Duan, Yong-Ji Tan
Venue: Journal of Computational and Applied Mathematics (2006)

In this paper, a numerical method is given for partial differential equations, which combines the use of Lagrange multipliers with radial basis functions. It is a new method to deal with difficulties that arise in the Galerkin radial basis function approximation applied to Dirichlet (also mixed) boundary value problems. Convergence analysis results are given. Several examples show the efficiency of the method using TPS or Sobolev splines.
Increasing representational fluency with visualization tools
Authors: Mike Stieff, Michelle McCombs
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

The present article reports on the use of one visualization tool, Connected Chemistry, to increase chemistry student's representational fluency, or use of accepted chemical representations and reasoning from submicroscopic perspectives. The tool was embedded in a unit on the particulate nature of matter and implemented in three high school classrooms. Analysis of learning via pre-post test measures revealed a significant increase in representational fluency among all Connected Chemistry students compared to students learning from more traditional lecture-and-text method; however, comparable improvements in declarative knowledge were not evident.
Salient region detection and tracking in video
Authors: Ying Li, Yu-Fei Ma, Hong-Jiang Zhang
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

A new approach to automatically detect and track salient regions in generic videos is presented in this paper. Specifically, given a starting video frame, we first detect its salient regions based on extracted color and orientation maps; then we track these regions for the rest of frames within a short period of time. The extracted salient region information could be used to evaluate the frame importance so as to provide guidance in keyframe extraction for video summarization purpose. Experiments on four test video sequences have yielded encouraging results.
Performance measures for service systems with a random arrival rate
Authors: Samuel G. Steckley, Shane G. Henderson, Vijay Mehrotra
Venue: Proceedings of the 37th conference on Winter simulation (2005)

It is commonly assumed that the arrival process of customers to a service system is a nonhomogeneous Poisson process. Call center data often refute this assumption, and several authors have postulated a doubly-stochastic Poisson process for arrivals instead. We develop approximations for both the long-run fraction of calls answered quickly, and the distribution of the fraction of calls answered quickly within a short period. We also perform a computational study to evaluate the approximations and improve our understanding of such systems.
Partial geometries pg (s, t, 2) with an abelian Singer group and a characterization of the van Lint-Schrijver partial geometry
Authors: S. De Winter
Venue: Journal of Algebraic Combinatorics: An International Journal (2006)

Let $${\mathcal{S}}$$ be a proper partial geometry pg(s,t,2), and let G be an abelian group of automorphisms of $${\mathcal{S}}$$ acting regularly on the points of $${\mathcal{S}}$$ . Then either t¿2±od s+1 or $${\mathcal{S}}$$ is a pg(5,5,2) isomorphic to the partial geometry of van Lint and Schrijver (Combinatorica 1 (1981), 63---73). This result is a new step towards the classification of partial geometries with an abelian Singer group and further provides an interesting characterization of the geometry of van Lint and Schrijver.