ppxscal/embedding_network huggingface dataset:
Proceedings of the 5th ACM international workshop on Web information and data management
Venue: Workshop On Web Information And Data Management (2003)

The 2003 International Workshop on Web Information and Data Management (WIDM 2003) is the fifth in a series of workshops on Web Information and Data Management held in conjunction with the International Conference on Information and Knowledge Management (CIKM). The objective of the workshop is to bring together researchers, industrial practitioners, and developers to study how web information can be extracted, stored, analyzed, and processed to provide useful knowledge to the end users for various advanced database applications. WIDM 2003 has received sponsorship from both ACM SIGIR and ACM SIGMIS.The call for papers resulted in the submission of 54 papers from 18 countries around the world. All papers were thoroughly reviewed by the program committee and external reviewers. The program committee accepted 15 full papers and 10 short papers for the two-days' program. The authors of these papers are from 12 countries. The 25 accepted papers were divided into 7 sessions: "Web Data Extraction and Structure Mining", "XML Data Modeling and Storage", "Tools for Integrating and Querying Web Information", "Web Clustering and Usage Mining", "XML and Information Integration", "Intelligent Web Information Access", and "Query and View Processing." In addition, the WIDM 2003 program also includes an invited talk on "Business-Aware Management: the Next Frontier for Web Services" by Dr Fabio Casati from Palo Alto HP Labs.The workshop would not be a success without the support from the Centre for Advanced Information Systems of the Nanyang Technological University, Singapore. The center provided both the manpower and computing resources to host the workshop web site. Zehua Liu, a graduate student at the Nanyang Technological University, did a wonderful job running the ConfMan paper submission and review system. We would like express our appreciation to his assistance.We are also indebted to the CIKM 2003's organizing committee for its support. We are particularly thankful to Eun-Kyo Park for managing the proceedings coordination as well as financial and registration matters, and to Il-Yeol Song for coordinating WIDM 2003 with the other workshops.
A hierarchy machine: learning to optimize from nature and humans
Authors: Martin Pelikan, David E. Goldberg
Venue: Complexity (2003)

This article proposes a competent hierarchical optimization method called the hierarchical Bayesian optimization algorithm (hBOA). hBOA extends the Bayesian optimization algorithm (BOA) by incorporating three important features for robust and scalable optimization of hierarchical problems: proper decomposition, chunking, and preservation of alternative solutions. Additionally, the article proposes a class of difficult hierarchical problems called hierarchical traps, hBOA is shown to provide a scalable solution to the class of hierarchically decomposable problems and anything easier. Specifically, hBOA can solve hierarchical traps and other nearly decomposable problems in approximately O(n1.55 log n) to O(n2) function evaluations, where n is the number of decision variables in the problem.
Grid-computing portals and security issues
Authors: Ali Raza Butt, Sumalatha Adabala, Nirav H. Kapadia, Renato J. Figueiredo, José A. B. Fortes
Venue: Journal of Parallel and Distributed Computing (2003)

Computational grids provide computing power by sharing resources across administrative domains. This sharing, coupled with the need to execute untrusted code from arbitrary users, introduces security hazards. Grid environments are built on top of platforms that control access to resources within a single administrative domain, at the granularity of a user. In wide-area multidomain grid environments, the overhead of maintaining user accounts is prohibitive, and securing access to resources via user accountability is impractical. Typically, these issues are handled by implementing checks that guarantee the safety of applications, so that they can run in shared user accounts. This work shows that safety checks--language-based, compile-time, link-time or load-time--currently implemented in most grid environments are either inadequate or limit allowed grid users and applications. A survey of various grid systems is presented, highlighting the problems and limitations of current grid environments. A runtime process monitoring technique is also proposed. The approach allows setting-up an execution environment that supports the full legitimate use allowed by the security policy of a shared resource. For shell-based applications, performance measurements of the proposed scheme show up to 2.14 times less overheads as compared to the case where all applications including the shell are monitored.
Consumer search in electronic markets: an experimental analysis of travel services
Authors: Anssi Öörni
Venue: European Journal of Information Systems (2003)

Electronic markets are frequently touted to be highly efficient. The prevailing hypothesis is that very low information search costs will enable buyers to expand their product information search and comparison beyond what is feasible in conventional markets. The aim of this paper is to evaluate the relative efficiency of product search in current travel service markets. We report the results of our analysis based on an experimental setting with 92 subjects. Our conclusions tend to disagree with previous predictions about the efficiency of electronic markets. The electronic markets observed were found to be at best as efficient as their conventional counterparts. Our results suggest that poor availability of product information and a lack of systems integration severely limit the efficiency of consumer search in present electronic markets.
On quasilinear spaces of convex bodies and intervals
Authors: Svetoslav Markov
Venue: Journal of Computational and Applied Mathematics (2004)

Algebraic systems abstracting properties of convex bodies and intervals, with respect to addition and multiplication by scalars, known as quasilinear spaces, are studied axiomatically. We discuss special quasilinear spaces with group structure called quasivector spaces. We show that every quasivector space is a direct sum of a vector space and a symmetric quasivector space. A complete characterization of symmetric quasivector spaces in the finite dimensional case is given, which permits to reduce computation in quasilinear spaces to computation in familiar vector spaces.
Design and Development of a Multimedia Educational Tool for Interactive Visualization and Three-Dimensional Perception of Vibrational Spectra Data of Molecules
Authors: Nickolas D. Charistos, Vasilios I. Teberekidis, Constantinos A. Tsipis, Michael P. Sigalas
Venue: Education and Information Technologies (2003)

In this paper the design and development of 3DNormalModes, an educational tool for interactive visualization and three dimensional perception of vibrational spectra data of molecules is presented. The details of the architecture of the tool and its functionality are described. Means of application in chemical education at university level are discussed. A pilot study summarizes the strengths, the educational value and the possible extensions of the system.
Improvement and evaluation of autonomous load distribution method
Authors: Yugo Ito, Shin-Ichi Miyazaki, Yoshinobu Higami, Shin-Ya Kobayashi
Venue: Artificial intelligence and security in computing systems (2003)

We have proposed "Autonomous Load Distribution Method(ALD)" as one of the load distribution algorithm for multi-computer system. The ALD method requires that node information is reliable in order to distribute load suitably. In this paper, we propose the new ALD method that is appended receiver-initiated function, and apply it on a workstation cluster to compare it with the original method.
An analysis of Gray versus binary encoding in genetic search
Authors: Uday K. Chakraborty, Cezary Z. Janikow
Venue: Information Sciences: an International Journal (2003)

This paper employs a Markov model to study the relative performance of binary and Gray coding in genetic algorithms. The results indicate that while there is not much difference between the two for all possible functions, Gray coding does not necessarily improve performance for functions which have fewer local optima in the Gray representation than in binary.
Fast Unimodular Counting
Authors: John Mount
Venue: Combinatorics, Probability and Computing (2000)

This paper describes methods for counting the number of nonnegative integer solutions of the system Ax = b when A is a nonnegative totally unimodular matrix and b an integral vector of fixed dimension. The complexity (under a unit cost arithmetic model) is strong in the sense that it depends only on the dimensions of A and not on the size of the entries of b. For the special case of &lsquo;contingency tables&rsquo; the run-time is 2O(&radic;dlogd) (where d is the dimension of the polytope). The method is complementary to Barvinok's in that our algorithm is effective on problems of high dimension with a fixed number of (non-sign) constraints, whereas Barvinok's algorithms are effective on problems of low dimension and an arbitrary number of constraints.
Local maximum stable sets in bipartite graphs with uniquely restricted maximum matchings
Authors: Vadim E. Levit, Eugen Mandrescu
Venue: Discrete Applied Mathematics (2003)

A maximum stable set in a graph G is a stable set of maximum size. S is a local maximum stable set of G, and we write S ∈ Ψ (G), if S is a maximum stable set of the subgraph spanned by S U N(S), where N(S) is the neighborhood of S. A matching M is uniquely restricted if its saturated vertices induce a subgraph which has a unique perfect matching, namely M itself. Nemhauser and Trotter Jr. (Math. Programming 8(1975) 232-248), proved that any S ∈ Ψ(G) is a subset of a maximum stable set of G. In Levit and Mandrescu (Discrete Appl. Math., 124 (2002) 91-101) we have shown that the family Ψ(T) of a forest T forms a greedoid on its vertex set. In this paper, we demonstrate that for a bipartite graph G, Ψ(G) is a greedoid on its vertex set if and only if all its maximum matchings are uniquely restricted.
Analytical model of a T-connected three-phase transformer
Authors: Guy Olivier, Radu Cojocaru, Anthony Lefèvre
Venue: Mathematics and Computers in Simulation (2003)

Three-phase transformers usually consist of three sets of windings connected in Wye, delta or zigzag on three individual cores or on a single three-phase one. Two single-phase transformers can also be used in a less than well-known way called the T-connection. Depending on the actual connection, as in conventional three-phase transformers, secondary voltages are in phase or displaced by ±30°. Due to the reduced number of windings, the T-connected transformer can be economically produced. However, since it is an asymmetrical connection, the short-circuit impedances of the individual phases are not identical, leading to unbalanced load voltages and short-circuit currents. An analytical model of the T-connected transformer has been developed to evaluate the effects of the impedance unbalance. This model based on single-phase short-circuit tests can be used to determine voltage unbalances, active and reactive transformer losses and short-circuit impedances.
Sensitivity Analysis for Scheduling Problems
Authors: Nicholas G. Hall, Marc E. Posner
Venue: Journal of Scheduling (2004)

This paper represents a first attempt at a systematic study of sensitivity analysis for scheduling problems. Because schedules contain both combinatorial and temporal structures, scheduling problems present unique issues for sensitivity analysis. Some of the issues that we discuss have not been considered before. Others, while studied before, have not been explored in the context of scheduling. The applicability of these issues is illustrated using well-known scheduling models. We provide fast methods to determine when a previously optimal schedule remains optimal. Other methods restore an optimal schedule after a parameter change. The value of studying the sensitivity of an optimal sequence instead of the sensitivity of an optimal schedule is demonstrated. We show that, for some problems, sensitivity analysis results depend on the positions of jobs with changed parameters. We identify scheduling problems where performing additional or different computations during optimization facilitates sensitivity analysis. To improve the robustness of an optimal schedule, selection among multiple optimal schedules is considered. We discuss which types of sensitivity analysis questions are intractable because the scheduling problem itself is intractable. We also study how heuristic error bounds vary when the data of a scheduling problem is continuously modified. Although we focus on scheduling problems, several of the issues we discuss and our classification scheme can be extended to other optimization problems.
Multiresolution Wavelet Based Adaptive Numerical Dissipation Control for High Order Methods
Authors: B. Sjögreen, H. C. Yee
Venue: Journal of Scientific Computing (2004)

The recently developed essentially fourth-order or higher low dissipative shock-capturing scheme of Yee, Sandham, and Djomehri &lsqb;25&rsqb; aimed at minimizing numerical dissipations for high speed compressible viscous flows containing shocks, shears and turbulence. To detect non-smooth behavior and control the amount of numerical dissipation to be added, Yee et al. employed an artificial compression method (ACM) of Harten &lsqb;4&rsqb; but utilize it in an entirely different context than Harten originally intended. The ACM sensor consists of two tuning parameters and is highly physical problem dependent. To minimize the tuning of parameters and physical problem dependence, new sensors with improved detection properties are proposed. The new sensors are derived from utilizing appropriate non-orthogonal wavelet basis functions and they can be used to completely switch off the extra numerical dissipation outside shock layers. The non-dissipative spatial base scheme of arbitrarily high order of accuracy can be maintained without compromising its stability at all parts of the domain where the solution is smooth. Two types of redundant non-orthogonal wavelet basis functions are considered. One is the B-spline wavelet (Mallat and Zhong &lsqb;14&rsqb;) used by Gerritsen and Olsson &lsqb;3&rsqb; in an adaptive mesh refinement method, to determine regions where refinement should be done. The other is the modification of the multiresolution method of Harten &lsqb;5&rsqb; by converting it to a new, redundant, non-orthogonal wavelet. The wavelet sensor is then obtained by computing the estimated Lipschitz exponent of a chosen physical quantity (or vector) to be sensed on a chosen wavelet basis function. Both wavelet sensors can be viewed as dual purpose adaptive methods leading to dynamic numerical dissipation control and improved grid adaptation indicators. Consequently, they are useful not only for shock-turbulence computations but also for computational aeroacoustics and numerical combustion. In addition, these sensors are scheme independent and can be stand-alone options for numerical algorithms other than the Yee et al. scheme.
Consumer Vehicle Telematics &mdash; An Emerging Market Where Web Services
Authors: W. Millar, R. J. Collingridge, D. A. Ward
Venue: BT Technology Journal (2004)

This paper examines how Web Services can be used to provide a shared infrastructure in an emerging area of consumer communications, namely consumer vehicle telematics. The paper reviews the key advantages which Web Services offer from a service provider's viewpoint &mdash; namely openness, reuse and ease of integration with legacy systems. The paper then goes on to examine why the consumer vehicle telematics industry is an area where point solutions have been developed. It then explores why legislation, changes in industry dynamics and the growing use of electronics in vehicles make the use of Web Services, in the software platform supporting the applications, an attractive proposition. Using a scenario-driven approach, it is shown how Web Services can be employed to provide reusable components which can make applications available for vehicle manufacturers, vehicle dealers, legislators and third-party service providers. These applications can be used to provide information to drivers, occupants and vehicles themselves. The paper also presents a brief review of the emerging competitive environment.
Call control with k rejections
Authors: R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos
Venue: Journal of Computer and System Sciences (2003)

Given a set of connection requests (calls) in a communication network, the call control problem is to accept a subset of the requests and route them along paths in the network such that no edge capacity is violated, with the goal of rejecting as few requests as possible. We investigate the complexity of parameterized versions of this problem, where the number of rejected requests is taken as the parameter. For the variant with pre-determined paths, the problem is fixed-parameter tractable in arbitrary graphs if the link capacities are bounded by a constant, but W[2]-hard if the link capacities are arbitrary. If the paths are not pre-determined, no FPT algorithm can exist even in series-parallel graphs unless P = N P. Our main results are new FPT algorithms for call control in tree networks with arbitrary edge capacities and in trees of rings with unit edge capacities in the case that the paths are not pre-determined.
CALL FOR PAPERS: Special issue on Dependent Type Theory Meets Programming Practice
Authors: Gilles Barthe, Peter Dybjer, Peter Thiemann
Venue: Journal of Functional Programming (2001)

Modern programming languages rely on advanced type systems that detect errors at compile-time. While the benefits of type systems have long been recognized, there are some areas where the standard systems in programming languages are not expressive enough. Language designers usually trade expressiveness for decidability of the type system. Some interesting programs will always be rejected (despite their semantical soundness) or be assigned uninformative types.There are several remedies to this situation. Dependent type systems, which allow the formation of types that explicitly depend on other types or values, are one of the most promising approaches. These systems are well-investigated from a theoretical point of view by logicians and type theorists. For example, dependent types are used in proof assistants to implement various logics and there are sophisticated proof editors for developing programs in a dependently typed language.To the present day, the impact of these developments on practical programming has been small, partially because of the level of sophistication of these systems and of their type checkers. Only recently, there have been efforts to integrate dependent systems into intermediate languages in compilers and programming languages. Additional uses have been identified in high-profile applications such as mobile code security, where terms of a dependently typed lambda calculus to encode safety proofs.A special issue of the Journal of Functional Programming will be devoted to the interplay between dependent type theory and programming practice. We welcome technical contributions in the field, as well as position papers that:&bull; make researchers in programming languages aware of new developments and research directions on the theory side;&bull; point out to theorists practical uses of advanced type systems and urge them to address theoretical problems arising in emerging applications.Authors who are concerned about the appropriateness of a topic are welcome to contact the guest editors. Manuscripts should be unpublished works and not submitted elsewhere. Revised and enhanced versions of papers published in conference proceedings that have not appeared in archival journals are eligible for submission. All submissions will be reviewed according to the usual standards of scholarship and originality.Submissions should be sent to Gilles Barthe (Gilles.Barthe@inria.fr), with a copy to Nasreen Ahmad (nasreen@dcs.gla.ac.uk). Submitted articles should be sent in postscript format, preferably gzipped and uuencoded. In addition, please send, as plain text, title, abstract and contact information.The submission deadline is December 1st, 2001.
Optimal turning gait of a six-legged robot using a GA-fuzzy approach
Authors: Dilip Kumar Pratihar, Kalyanmoy Deb, Amitabha Ghosh
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2000)

This paper describes a new method for generating the turning-gait of a six-legged robot using a combined genetic algorithm (GA)-Fuzzy approach. The main drawback of the traditional methods of gait generation is their high computational load. Thus, there is still a need for the development of a computationally tractable algorithm that can be implemented online to generate stable gait of a multilegged robot. In the proposed genetic-fuzzy system, the fuzzy logic controllers (FLCs) are used to generate the stable gait of a hexapod and a GA is used to improve the performance of the FLCs. The effectiveness of the proposed algorithm is tested on a number of turning-gait generation problems of a hexapod that involve translation as well as rotation of the vehicle. The hexapod will have to take a sharp circular turn (either clockwise or counter-clockwise) with minimum number of ground legs having the maximum average kinematic margin. Moreover, the stability margin should lie within a certain range to ensure static stability of the vehicle. Each leg of a six-legged robot is controlled by a separate FLC and the performance of the controllers is improved by using a GA. It is to be noted that the actual optimization is done off-line and the hexapod can use these optimized FLCs to navigate in real-world scenarios. As an FLC is computationally less expensive, the proposed algorithm will be faster compared with the traditional methods of gait-generation, which include both graphical as well as analytical methods. The GA-tuned FLCs are found to perform better than the author-defined FLCs.
Query expansion using associated queries
Authors: Bodo Billerbeck, Falk Scholer, Hugh E. Williams, Justin Zobel
Venue: Proceedings of the twelfth international conference on Information and knowledge management (2003)

Hundreds of millions of users each day use web search engines to meet their information needs. Advances in web search effectiveness are therefore perhaps the most significant public outcomes of IR research. Query expansion is one such method for improving the effectiveness of ranked retrieval by adding additional terms to a query. In previous approaches to query expansion, the additional terms are selected from highly ranked documents returned from an initial retrieval run. We propose a new method of obtaining expansion terms, based on selecting terms from past user queries that are associated with documents in the collection. Our scheme is effective for query expansion for web retrieval: our results show relative improvements over unexpanded full text retrieval of 26%--29%, and 18%--20% over an optimised, conventional expansion approach.