ppxscal/embedding_network huggingface dataset:
Stigmergy in Multi Agent Reinforcement Learning
Authors: Raghav Aras, Alain Dutech, Francois Charpillet
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

In this paper, we describe how certain aspects of the biological phenomena of stigmergy can be imported into multiagent reinforcement learning (MARL), with the purpose of better enabling coordination of agent actions and speeding up learning. In particular, we detail how these stigmergic aspects can be used to define an inter-agent communication framework.
Efficient dynamic resource specifications
Authors: Kris Bubendorfer, Peter Komisarczuk, Kyle Chard
Venue: Proceedings of the 6th international conference on Mobile data management (2005)

In the effort to reach beyond 3G, researchers have been actively looking at utilizing new models for network based services. Small mobile, pervasive and ubiquitous devices will benefit from networked services and computation provided by utility computing providers and the virtual organizations that lease resources from them. As an additional factor, we believe that it is critical that the mobile, pervasive or ubiquitous devices be able to dynamically manipulate their resource specifications when obtaining services and resources from the utility computing and communication network. This requires a simple, manipulatable, and preferably modular resource specification structure. This paper presents the Resource Description Graph (RDG). The RDG is used to represent available and required resources for hosts and applications in a directed acyclic graph. The RDG has many desirable properties including inherent security, expressiveness, modularity, and composition. We show that the computational time to match RDG resource specifications, thirty resource types and constraints, is less than 1ms --- demonstrating that the RDG is a practical approach to resource specification with a low computational overhead.
NEC: description of the VENIEX system as used for MUC-5
Authors: Kazunori Muraki, Shinichi Doi, Shinichi Ando
Venue: Proceedings of the 5th conference on Message understanding (1993)

NEC Corporation has had years of experience in natural language processing and machine translation[1, 2, 3, 4, 5], and currently markets commercial natural language processing systems. Utilizing dictionaries and parsing engines we have already had, we have developed the VENIEX System (VENus for Information EXtraction) as used for MUC-5 in only three months. Our method is to apply both domain-specific keyword-based analysis and full sentential parsing with general grammar[6, 7]. The keyword dictionary of VENIEX contains about thirty thousand entries, whose semantic structures are sub_ME_Capability frame, and the parsing and discourse processing are controlled with the information given in this semantic structure of keywords. The resulting scores of VENIEX for formal run texts were from 0.7181 (minimum) to 0.7548 (maximum) in Richness-Normalized Error and 48.33 in F-MEASURES (P&R).
Product classification in the internet business: a fuzzy approach
Authors: B. K. Mohanty, B. Bhasker
Venue: Decision Support Systems (2005)

In this paper, a methodology has been introduced as a decision support tool to the consumers in the Internet business. This decision support tool takes into account the multiple attributes of the product, analyses them with respect to the consumer's desire, and finally classifies these products into different hierarchical levels as per the consumer's level of preference. The product attributes, which are in general conflicting, imprecise, and non-commensurable in nature, are well handled here by using the concepts of fuzzy logic. Concepts of linguistic quantifier are used to quantify the qualitatively defined items and also to classify the products into different preference levels as required by the customer. Classification of the products into preference levels in any business, particularly, in the business through the Internet, gives a boost to the customer and helps him in a final product choice. The procedure described here can be used by virtual buying agents for generating a hierarchical classification based on buyer's preference. At the end, a numerical example is illustrated to highlight the procedure.
Associating semantically structured cooking videos with their preparation steps
Authors: Koichi Miura, Motomu Takano, Reiko Hamada, Ichiro Ide, Shuichi Sakai, Hidehiko Tanaka
Venue: Systems and Computers in Japan (2005)

The dramatic growth in the amount of multimedia data in recent years has caused techniques for analyzing those data to become increasingly important. To make use of information contained in multimedia data to the fullest extent, attention has been focused on techniques for processing multiple types of media in an integrated manner. Among the various kinds of videos that exist, the authors selected cooking videos, which are closely related to everyday life, to propose a technique for associating the videos with preparation steps described in related text-based materials referred to simply as textbooks. With educational videos having related textbooks such as cooking program videos, the textbooks are easier to consult than the videos but the videos contain useful visual information that cannot be represented in the textbooks. Therefore, integration of the video and textbook is expected to result in high-order video structuring and indexing. In this paper, the authors first analyze the video structure and define the video blocks that are to be the video units used for association. They also analyze the preparation steps described in the closed captions and textbooks and propose and define an association technique based on keyword extraction. In addition, they show through evaluation experiments that association in terms of video block units or, in other words, video indexing, can be performed with high precision by using the proposed technique. They also show that limiting the subject matter and skillfully incorporating relatively simple elemental techniques enables a practical level of precision to be obtained. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(2): 51&ndash;62, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20131
Homotopy Methods for Solving Variational Inequalities in Unbounded Sets
Authors: Qing Xu, Bo Yu, Guo-Chen Feng
Venue: Journal of Global Optimization (2005)

In this paper, for solving the finite-dimensional variational inequality problem $$(x-x*)^{T} F(x*)\geq 0, \quad \forall x\in X,$$ where F is a $$C^r (r gt; 1)$$ mapping from X to Rn, X = $$ { x \in R^{n} : g(x) leq; 0}$$ is nonempty (not necessarily bounded) and $${\it g}({\it x}): R^{n} \rightarrow R^{m}$$ is a convex Cr+1 mapping, a homotopy method is presented. Under various conditions, existence and convergence of a smooth homotopy path from almost any interior initial point in X to a solution of the variational inequality problem is proven. It leads to an implementable and globally convergent algorithm and gives a new and constructive proof of existence of solution.
Crawling a country: better strategies than breadth-first for web page ordering
Authors: Ricardo Baeza-Yates, Carlos Castillo, Mauricio Marin, Andrea Rodriguez
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

This article compares several page ordering strategies for Web crawling under several metrics. The objective of these strategies is to download the most "important" pages "early" during the crawl. As the coverage of modern search engines is small compared to the size of the Web, and it is impossible to index all of the Web for both theoretical and practical reasons, it is relevant to index at least the most important pages.We use data from actual Web pages to build Web graphs and execute a crawler simulator on those graphs. As the Web is very dynamic, crawling simulation is the only way to ensure that all the strategies considered are compared under the same conditions. We propose several page ordering strategies that are more efficient than breadth- first search and strategies based on partial Pagerank calculations.
Review of "Artificial Intelligence: An MIT Perspective, vol. 2 by P. H. Winston and R. H. Brown"; MIT Press 1982.
Authors: Ram Nevatia
Venue: Issue 84 (April 1983) (1983)

This is a paperback edition of the original version published in 1979. Vol. 2 is divided in three sections dealing with vision, manipulation and machine design. (Vol. 1 deals with expert problem solving, natural language, and representation and learning.) Each section contains chapters written by various MIT researchers. In general, each chapter describes recent (as of the original date of publication) MIT research in the particular areas. Each section also provides a nice overview and summary by the editors.
Dynamic lexical acquisition in Chinese sentence analysis
Authors: Andi Wu, Joseph Pentheroudakis, Zixin Jiang
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

Dynamic lexical acquisition is a procedure where the lexicon of an NLP system is updated automatically during sentence analysis. In our system, new words and new attributes are proposed online according to the context of each sentence, and then get accepted or rejected during syntactic analysis. The accepted lexical information is stored in an auxiliary lexicon which can be used in conjunction with the existing dictionary in subsequent processing. In this way, we are able to process sentences with an incomplete lexicon and fill in the missing info without the need of human editing. As the auxiliary lexicons are corpus-based, domain-specific dictionaries can be created automatically by combining the existing dictionary with different auxiliary lexicons. Evaluation shows that this mechanism significantly improves the coverage of our parser.
Variable Programming: A Generalized Minimax Problem. Part I: Models and Theory
Authors: Yong-Chang Jiao, Yee Leung, Zongben Xu, Jiang-She Zhang
Venue: Computational Optimization and Applications (2005)

In this two-part series of papers, a new generalized minimax optimization model, termed variable programming (VP), is developed to solve dynamically a class of multi-objective optimization problems with non-decomposable structure. It is demonstrated that such type of problems is more general than existing optimization models. In this part, the VP model is proposed first, and the relationship between variable programming and the general constrained nonlinear programming is established. To illustrate its practicality, problems on investment and the low-side-lobe conformal antenna array pattern synthesis to which VP can be appropriately applied are discussed for substantiation. Then, theoretical underpinnings of the VP problems are established. Difficulties in dealing with the VP problems are discussed. With some mild assumptions, the necessary conditions for the unconstrained VP problems with arbitrary and specific activated feasible sets are derived respectively. The necessary conditions for the corresponding constrained VP problems with the mild hypotheses are also examined. Whilst discussion in this part is concentrated on the formulation of the VP model and its theoretical underpinnings, construction of solution algorithms is discussed in Part II.
Regular embeddings of complete multipartite graphs
Authors: Shao-Fei Du, Jin Ho Kwak, Roman Nedela
Venue: European Journal of Combinatorics (2005)

In this paper, we classify all regular embeddings of the complete multipartite graphs Kp,...,p for a prime p into orientable surfaces. Also, the same work is done for the regular embeddings of the lexicographical product of any connected arc-transitive graph of prime order q with the complement of the complete graph of prime order p, where q and p are not necessarily distinct. Lots of regular maps found in this paper are Cayley maps.
A model for lumpy demand parts in a multi-location inventory system with transshipments
Authors: Anil Kukreja, Charles P. Schmidt
Venue: Computers and Operations Research (2005)

The inventory system considered in this work is single echelon, N-location and continuous review in which complete pooling of stock is permitted among the locations. A model is developed for slow moving, expensive items that are common to two or more locations. The model developed focuses on parts that have a lumpy demand pattern; that is, the number of units demanded at each demand occasion is a random variable. The motivating case for this research has been a real-life situation presented by a large utility company having 29 power generating plants in five southeastern states. Data analysis from the company reveals that there are a substantial number of parts that have low usage, are expensive, and have a lumpy demand pattern. At present, each location operates independently and maintains enough stock to meet its own requirements. Transshipments take place between locations whenever there is an emergency requirement for a part, but no explicit consideration is given to this effect while deciding on the inventory control policies at different locations. A model, using analytical and simulation techniques, is developed for this situation. Limited experimentation, performed on a set of problems, shows an average savings of about 31% as a result of pooling.
Optimal quiescent vectors for wideband ML beamforming in multipath fields
Authors: Elio D. Di Claudio
Venue: Signal Processing (2005)

In this work, the behavior of the recently developed wideband maximum likelihood steered beamformer (ML-STBF) is analyzed under multipath conditions. In particular, the importance of an optimal choice of the quiescent vector to initialize the ML-STBF is pointed out.Some quiescent vectors, optimized on the basis of the previous analysis, are developed for the joint use with the ML-STBF and compared in simulation. It is shown that their use can significantly improve the output signal-to-noise ratio, the multipath suppression capability and the robustness with respect to focusing errors of the ML-STBF.
The Quality of Service Satisfiability Thesis: Resource and Performance Prediction for Multi-Processor Systems and Random Schedules
Authors: A. D. Parks
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 2 - Volume 03 (2005)

A Quality of Service Satisfiability Thesis is established which provides a very general condition for determining the number of processors needed by a system in order to satisfy the quality of service required by a multi-task random schedule which is presented to the system for servicing. Since "processors" and "schedules" are abstract representations of general servicing "resources" and uncertain task "environments", the thesis has utility for studying and predicting resource requirements and associated performances in a variety of application domains. Uniformly distributed random schedules are used to illustrate the significance of the thesis.
Evaluation of criteria on information retrieval
Authors: Tsunenori Ishioka
Venue: Systems and Computers in Japan (2004)

We investigate van Rijsbergen's F-measure, the break-even point, and 11-point averaged precision, all of which can be translated into one-dimensional scalar quantities from the precision and the recall. These investigations can be done by comparing to the tetrachoric (four-fold) correlation coefficient and phi (four-fold point) coefficient, which are often used as indices of statistical association in a 2 &times; 2 contingency table. The results show that when the fallout rate is less than 0.1, the F1 measure has similar properties to the phi coefficient, the break-even point is almost equivalent to the phi coefficient, and the 11-point averaged precision should be a measure which is larger than the phi coefficient and smaller than a tetrachoric correlation coefficient. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(6): 42&ndash;49, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10583
Automatic Thresholding for Defect Detection
Authors: Hui-Fuang Ng
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Automatic thresholding has been widely used in the machine vision industry for automated visual inspection of defects. A commonly use thresholding technique, the Otsu method, provides satisfactory results for thresholding an image with histogram of bimodal distribution. This method, however, fails if the histogram is unimodal or close to unimodal. For defect detection applications, defects range from no defect, small defect, to large defect, which means the gray-level distributions range from unimodal to bimodal. In this paper, we revised and improved the Otsu method for selecting optimal threshold values for both unimodal and bimodal distributions. We also tested the performance of the revised method on common defect detection applications.
A tabu search algorithm for the quadratic assignment problem
Authors: Alfonsas Misevicius
Venue: Computational Optimization and Applications (2005)

Tabu search approach based algorithms are among the widest applied to various combinatorial optimization problems. In this paper, we propose a new version of the tabu search algorithm for the well-known problem, the quadratic assignment problem (QAP). One of the most important features of our tabu search implementation is an efficient use of mutations applied to the best solutions found so far. We tested this approach on a number of instances from the library of the QAP instances--QAPLIB. The results obtained from the experiments show that the proposed algorithm belongs to the most efficient heuristics for the QAP. The high efficiency of this algorithm is also demonstrated by the fact that the new best known solutions were found for several QAP instances.
Stand up and take your place: identifying narrative elements in narrative adventure and role-play games
Authors: Bride Mallon, Brian Webb
Venue: Computers in Entertainment (CIE) (2005)

This article reports results from a series of empirical studies exploring narrative dimensions of adventure and role-play in computer-game design. It identifies aspects of narrative employed in such games, considers the significance of narrative structures and devices in increasing user-engagement, and reflects on game-design implications.Because not all approaches identified in traditional narrative theory can be applied to the new, interactive media, a phenomenological, reader-response methodology was used in the studies to identify narrative considerations appropriate to game-players' experiences. In two model focus-group studies, evaluative responses to games played in a controlled environment were analyzed. From the factors identified as affecting engagement, those with narrative aspects were isolated and their significance assessed. Among the factors identified are characterization, identification, agency, motivation, plot, linearity, and authorial control. Also considered is the disruption of primal narrative features of narrative--causality, temporality, and linearity--within a hyper-structure, and a number of design techniques and strategies to resolve such tensions and promote user engagement are suggested.
Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Venue: ACM International Conference Proceeding Series; Vol. 71 (2004)

The Second Symposium on Geometry Processing continues the series started last year in Aachen. The increase in the number of submissions (18%) shows that the interest in the area continues to grow. The number of accepted papers has remained the same; only 29% of the submitted papers were accepted this year. Several changes were introduced to the review process in 2004. Practically all papers were reviewed by four reviewers. Once the reviews were completed, the committee members were able to access all other reviews and discuss acceptance and rejection recommendations. In a few cases, these through discussions resulted in signifi cant changes in the decisions.
Automated optimization of key WCDMA parameters: Research Articles
Authors: Albert Höglund, Kimmo Valkealahti
Venue: Wireless Communications Mobile Computing (2005)

This paper validates the feasibility of automated optimization of key wideband code division multiple access (WCDMA) radio resource management parameters using control methods. The parameters are regularly adjusted in order to improve performance. The parameters examined in this study include the total cell transmission power target, the received total interference target, the downlink radio link power maximums, the handover windows and the pilot channel powers. The control was based on expert-defined rules, which applied specific trade-off policies and statistics of poor quality calls, blocking, packet queuing, power and interference levels and terminal measurements to qualify the parameter values. The approach was validated using a dynamic WCDMA system simulator with a deployment of macro and micro cells on a city region. Results on automated optimization of single parameters on cell level and results on simultaneous multi-parameter optimization on cell-cluster level are presented in this paper. The use of the automated parameter optimization methods was shown to result in a significant increase of capacity in comparison to the default parameter settings. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Accurate Eigenvalues and SVDs of Totally Nonnegative Matrices
Authors: Plamen Koev
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

We consider the class of totally nonnegative (TN) matrices---matrices all of whose minors are nonnegative. Any nonsingular TN matrix factors as a product of nonnegative bidiagonal matrices. The entries of the bidiagonal factors parameterize the set of nonsingular TN matrices.We present new O(n3) algorithms that, given the bidiagonal factors of a nonsingular TN matrix, compute its eigenvalues and SVD to high relative accuracy in floating point arithmetic, independent of the conventional condition number. All eigenvalues are guaranteed to be computed to high relative accuracy despite arbitrary nonnormality in the TN matrix.We prove that the entries of the bidiagonal factors of a TN matrix determine its eigenvalues and SVD to high relative accuracy.We establish necessary and sufficient conditions for computing the entries of the bidiagonal factors of a TN matrix to high relative accuracy, given the matrix entries.In particular, our algorithms compute all eigenvalues and the SVD of TN Cauchy, Vandermonde, Cauchy--Vandermonde, and generalized Vandermonde matrices to high relative accuracy.