ppxscal/embedding_network huggingface dataset:
Improvements to the Strong Cyclic Planning Algorithm
Authors: Zhonghua Wen, Wei Huang, Yunfei Jiang, Songqing Xiao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper points out some drawbacks and gives some modifications to the strong cyclic planning algorithm. In particular, a set of states is found by use of adjacency matrix that corresponds to a non-deterministic state-transition system. The set of states is composed of two parts, the first part is the states that are unreachable from the initial states, so the station-action pairs which relate to these states are absolutely useless; the second part is the states which the initial states can not reach without passing any goal state before, the state-action pairs which relate to the second part are useless as well, because they moves the execution away from the goal. So a great many of state-action pairs can be eliminated directly from the universal policy. In addition, there are many repeated computations in function RemoveNonProgress, function WeakPreImage adds some state-action pairs into PreImage, however, many of these state-action pairs are eliminated by function PruneStates later. In the modified algorithm, we design a new function to avoid these repeated computations. Finally, the efficiency of the modified algorithm is illustrated by an example and some experiments.
Evolutionary Algorithm for Large Scale Problems
Authors: Kumara Sastry, Alexandre C. B. Delbem, David E. Goldberg
Venue: Proceedings of the Seventh International Conference on Intelligent Systems Design and Applications (2007)

Evolutionary algorithms (EAs) are a largely used search and optimization technique. They have been successfully applied to a wide variety of problems, overcoming traditional algorithms in performance. However, few EAs and traditional algorithms are able to handle complex combinatorial problems involving a large number of variables (thousands or millions). This paper proposes a new EA, capable of solving combinatorial problems with large number of variables. This algorithm is the result of two extensions from the Extended Compact Genetic Algorithm, a state-of-the-art EA.
The Study of Feature Extraction Using Local Energy of Frequency Bands Based on Wavelet Packet Decomposition
Authors: Fengtao Wang, Jianguo Chen, Xiaojiang Ma
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

A new feature extraction method based on local energy of frequency bands is presented in this paper. Wavelet packet decomposition is studied and the concept of local energy of frequency bands based on wavelet packet decomposition is used to measure the signal energy in selected frequency bands and certain time-interval. The proposed feature extraction method was tested on simulated signals. The results showed that the developed approach was effective.
A Cluster-Based Random Key Pre-distribution Scheme in Large Scale Sensor Networks
Authors: Yi Jiang, Haoshan Shi
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Several random key pre-distribution schemes have been proposed to bootstrap keys for encryption in recent years. In this paper, we present a new random key pre-distribution scheme using clustering according to the probability of node compromise in different deployment regions, which is suitable for large scale networks greatly. In each cluster, the deployment region is divided into multiple hexagons which give a better approximation of the circular wireless transmission coverage of a sensor node, and the qcomposite keys scheme has been improved. The performance analysis shows that the scheme we presented can improve resilience against node capture greater than previous schemes.
Using Requirements Management Tools in Software Product Line Engineering: The State of the Practice
Authors: Danilo Beuche, Andreas Birk, Heinrich Dreier, Andreas Fleischmann, Heidi Galle, Gerald Heller, Dirk Janzen, Isabel John, Ramin Tavakoli Kolagari, Thomas von der Massen, Andreas Wolfram
Venue: Proceedings of the 11th International Software Product Line Conference (2007)

A software product line oriented approach to developing systems has an impact on the development process as a whole. Although the basic idea of product lines is simple, systematic implementation of the approach is a challenging task. In fact, today's software product lines have such complex variability that their handling must be supported by tools, otherwise a systematic approach would not be possible. The same holds for requirements management of product lines. On the basis of specific industrial scenarios the paper derives important requirements that have to be observed if requirements management tools are to be usefully applied to product lines. Current requirements management tools are evaluated on the basis of these requirements in their daily industrial use. The presented requirements can indicate the future direction of tool development and method research.
Multimodalcues for addressee-hood in triadic communication with a human information retrieval agent
Authors: Jacques Terken, Irene Joris, Linda De Valk
Venue: Proceedings of the 9th international conference on Multimodal interfaces (2007)

Over the last few years, a number of studies have dealt with the question of how the addressee of an utterance can be determined from observable behavioural features in the context of mixed human-human and human-computer interaction (e.g. in the case of someone talking alternatingly to a robot and another person). Often in these cases, the behaviour is strongly influenced by the difference in communicative ability of the robot and the other person, and the "salience" of the robot or system, turning it into a situational distractor. In the current paper, we study triadic human-human communication, where one of the participants plays the role of an information retrieval agent (such as in a travel agency where two customers who want to book a vacation, engage in a dialogue with the travel agent to specify constraints on preferable options). Through a perception experiment we investigate the role of audio and visual cues as markers of addressee-hood of utterances by customers. The outcomes show that both audio and visual cues provide specific types of information, and that combined audio-visual cues give the best performance. In addition, we conduct a detailed analysis of the eye gaze behaviour of the information retrieval agent both when listening and speaking, providing input for modelling the behaviour of an embodied conversational agent.
An efficient technique to analyze the impact of bursty TCP traffic in wide-area networks
Authors: Michele Garetto, Don Towsley
Venue: Performance Evaluation (2008)

In this paper we describe an analytical technique for the performance evaluation of wide-area networks carrying realistic TCP traffic, such as that produced by a large number of finite-sized connections transferring files whose sizes are taken from a long-tail distribution. The analytical predictions are validated against detailed simulation experiments, and prove to be accurate and robust under a variety of operating conditions. The model also provides original insights into the impact on the network of long-tail flow length distributions, and allows the effectiveness of ''TCP pacing'' in reducing the traffic burstiness to be evaluated analytically. Our contribution is a performance evaluation methodology that could be usefully employed in network dimensioning and engineering.
Technical communique: A graph-theoretic method to find decentralized fixed modes of LTI systems
Authors: Javad Lavaei, Amir G. Aghdam
Venue: Automatica (Journal of IFAC) (2007)

This paper deals with the decentralized pole assignability of interconnected systems by means of linear time-invariant (LTI) controllers. A simple graph-theoretic approach is proposed to identify the distinct decentralized fixed modes (DFMs) of the system, i.e., the unrepeated modes which cannot be moved by means of a LTI decentralized controller. The state-space representation of the system is transformed to the decoupled form using a proper change of coordinates. For any unrepeated mode, a matrix is then computed which resembles the transfer function matrix of the system at some point in the complex plane. A bipartite graph is constructed accordingly in terms of the computed matrix. Now, the problem of verifying if this mode is a DFM of the system reduces to checking if the constructed graph has a complete bipartite subgraph with a certain property. The sole restriction of this work is that it is only capable of identifying the distinct DFMs of a system. However, it is axiomatic that most of the modes of the real-world systems are normally distinct. The primary advantage of the present paper is its simplicity, compared to the existing ones which often require evaluating the rank of several matrices.
Elastic lists for facet browsers
Authors: Moritz Stefaner, Boris Muller
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

In the context of current web and personal information management developments, we argue that facet browsing is an increasingly important interface paradigm. However, current implementations neglect two important aspects of metadata distributions: the relative proportions of metadata occurrences and the unusualness of this proportion compared to a global profile. Based on focus & context visualization techniques, we enhance facet browser user interfaces with "elastic lists" to make the resulting weighted metadata profiles visually accessible and navigable. The principle is currently developed and tested in several domains.
On Error Control in Sequential Machines
Authors: D. Mandelbaum
Venue: IEEE Transactions on Computers (1972)

It is shown that if a machine M con be mapped into a simpler machine M' by a homomorphism, then an error correcting/detecting code can be applied to the states of M such that the parity check bits are generated independently of the information bits that form the state assignment of M. If such a homomorphism does not exist, it is shown how to produce one by altering M if M consists entirely of loops as is the case with a digital computer. The method presented here is a generalization to sequential machines of the separate adder and checker concept used for checking addition. Methods of coding are given. Application to computers is given.
Periscope/SQ: interactive exploration of biological sequence databases
Authors: Sandeep Tata, Willis Lang, Jignesh M. Patel
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Life science laboratories today have to rely on procedural techniques to store and manage large sequence datasets. Procedural techniques are cumbersome to use and are often very inefficient compared to optimized declarative techniques. We have designed and implemented a system called Periscope/SQ that makes it possible to rapidly express complex queries within a declarative framework and take advantage of database-style query optimization. As a result, queries in Periscope/SQ run orders of magnitude faster than typical procedural implementations. We demonstrate the power of Persicope/SQ through an application called Gene-Locator which allows biologists to rapidly explore large genomic sequence databases.
A syntactically-based query reformulation technique for information retrieval
Authors: C. Lioma, I. Ounis
Venue: Information Processing and Management: an International Journal (2008)

Whereas in language words of high frequency are generally associated with low content [Bookstein, A., & Swanson, D. (1974). Probabilistic models for automatic indexing. Journal of the American Society of Information Science, 25(5), 312-318; Damerau, F. J. (1965). An experiment in automatic indexing. American Documentation, 16, 283-289; Harter, S. P. (1974). A probabilistic approach to automatic keyword indexing. PhD thesis, University of Chicago; Sparck-Jones, K. (1972). A statistical interpretation of term specificity and its application in retrieval. Journal of Documentation, 28, 11-21; Yu, C., & Salton, G. (1976). Precision weighting - an effective automatic indexing method. Journal of the Association for Computer Machinery (ACM), 23(1), 76-88], shallow syntactic fragments of high frequency generally correspond to lexical fragments of high content [Lioma, C., & Ounis, I. (2006). Examining the content load of part of speech blocks for information retrieval. In Proceedings of the international committee on computational linguistics and the association for computational linguistics (COLING/ACL 2006), Sydney, Australia]. We implement this finding to Information Retrieval, as follows. We present a novel automatic query reformulation technique, which is based on shallow syntactic evidence induced from various language samples, and used to enhance the performance of an Information Retrieval system. Firstly, we draw shallow syntactic evidence from language samples of varying size, and compare the effect of language sample size upon retrieval performance, when using our syntactically-based query reformulation (SQR) technique. Secondly, we compare SQR to a state-of-the-art probabilistic pseudo-relevance feedback technique. Additionally, we combine both techniques and evaluate their compatibility. We evaluate our proposed technique across two standard Text REtrieval Conference (TREC) English test collections, and three statistically different weighting models. Experimental results suggest that SQR markedly enhances retrieval performance, and is at least comparable to pseudo-relevance feedback. Notably, the combination of SQR and pseudo-relevance feedback further enhances retrieval performance considerably. These collective experimental results confirm the tenet that high frequency shallow syntactic fragments correspond to content-bearing lexical fragments.
A Novel WSRF and Multi-Agent based Distributed System Resource Management Scheme
Authors: ZhiHui Lv, ShiYong Zhang, Jie Wu, WeiMing Fu, YiPing Zhong
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

From the analysis of some hard drawbacks faced with network management and system resource management today, a novel WSRF and Multi-Agent-based System Resource Management Scheme, is introduced in this paper. In this infrastructure, we emphasize on heterogeneous resource and service status monitoring and management issue; we further propose a novel WSRF-WSDM and Multi-agent based Distributed System Resource Management Scheme- WSDM-RMS. And then we describe WSDM-RMS Object Modeling Design architecture. As part of experiment work, we discuss MUSE-JMX based system management scheme implementation- WSDM-RMS-Platform, including Manager Layer, WSDM-Gateway Layer, and Agent Layer, and then analyze the experiment results. At last, from our research experiences and related survey, we analyze the prospective research direction and challenges in this field.
Storage Technology: Capabilities and Limitations
Authors: A. S. Hoagland
Venue: Computer (1979)

The disk remains the primary form of mass storage. Despite competing technologies, improvements in disk technology will ensure its widespread use throughout the remainder of the century.
Extending prerendered-interface voting software to support accessibility and other ballot features
Authors: Ka-Ping Yee
Venue: Proceedings of the USENIX Workshop on Accurate Electronic Voting Technology (2007)

This work builds on the prerendered user interface (PRUI) approach for high-assurance voting software with a new design that supports synchronized audio and visual output, as well as concurrent input from a touchscreen and an alternate input device. This new design offers access for voters with a range of disabilities while retaining the benefits of PRUI voting systems: the user interface can be independently designed and audited, and the software needing verification is much smaller and simpler. This paper discusses the challenges of supporting accessibility in this architecture, explains how these challenges were addressed, and describes the resulting design. To demonstrate the feasibility of this approach and to establish a point of reference for the simplicity of voting machine software, this design has been implemented as a program called Pvote, in 460 lines of Python.
Computational Geometry A Survey
Authors: D. T. Lee
Venue: IEEE Transactions on Computers (1984)

We survey the state of the art of computational geometry, a discipline that deals with the complexity of geometric problems within the framework of the analysis of algorithms. This newly emerged area of activities has found numerous applications in various other disciplines, such as computer-aided design, computer graphics, operations research, pattern recognition, robotics, and statistics. Five major problem areas convex hulls, intersections, searching, proximity, and combinatorial optimizations are discussed. Seven algorithmic techniques incremental construction, plane-sweep, locus, divide-and-conquer, geometric transformation, prune-and-search, and dynamization are each illustrated with an example. A collection of problem transformations to establish lower bounds for geo-metric problems in the algebraic computation/decision model is also included.
Access control for the services oriented architecture
Authors: Jun Li, Alan H. Karp
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

Federated Identity Management (FIdM) is being applied to Services Oriented Architecture (SOA) deployments that cross enterprise boundaries. Though federation is essential in order to address the distributed nature of SOA, these FIdM solutions have been found to be inflexible, unscalable, and difficult to use, manage, and upgrade. We contend that a major reason for these difficulties is that FIdM addresses the wrong aspect of the problem. Specifically, FIdM does not address the federation of access policies. What is needed is a system for Federated Access Management (FAccM). This paper demonstrates the benefits of FAccM over FIdM for SOA deployments and shows how FAccM can be implemented using the existing web services standards.
Lattice-Nyström method for Fredholm integral equations of the second kind with convolution type kernels
Authors: Josef Dick, Peter Kritzer, Frances Y. Kuo, Ian H. Sloan
Venue: Journal of Complexity (2007)

We consider Fredholm integral equations of the second kind of the form f(x)=g(x)+@!k(x-y)f(y)dy, where g and k are given functions from weighted Korobov spaces. These spaces are characterized by a smoothness parameter @a>1 and weights @c"1>=@c"2>=.... The weight @c"j moderates the behavior of the functions with respect to the jth variable. We approximate f by the Nystrom method using n rank-1 lattice points. The combination of convolution and lattice group structure means that the resulting linear system can be solved in O(nlogn) operations. We analyze the worst case error measured in sup norm for functions g in the unit ball and a class of functions k in weighted Korobov spaces. We show that the generating vector of the lattice rule can be constructed component-by-component to achieve the optimal rate of convergence O(n^-^@a^/^2^+^@d), @d>0, with the implied constant independent of the dimension d under an appropriate condition on the weights. This construction makes use of an error criterion similar to the worst case integration error in weighted Korobov spaces, and the computational cost is only O(nlognd) operations. We also study the notion of QMC-Nystrom tractability: tractability means that the smallest n needed to reduce the worst case error (or normalized error) to @? is bounded polynomially in @?^-^1 and d; strong tractability means that the bound is independent of d. We prove that strong QMC-Nystrom tractability in the absolute sense holds iff @?"j"="1^~@c"j"~@?"j"="1^d@c"j/log(d+1)
Multi-access system with many users: Stability and metastability
Authors: N. D. Vvedenskaya, Yu. M. Suhov
Venue: Problems of Information Transmission (2007)

A model of random multi-access system with an ALOHA-type protocol is analyzed when the number N of users is large and the system is overloaded. In the limit as N ¿ ¿, the behavior of the system is described by a nonrandom dynamical system. We give a condition for the dynamical system to have an attractive fixed point and outline cases of several fixed points. The presence of several fixed points indicates that the finite system may exhibit a metastability phenomenon.
Fast State Minimization of Incompletely Specified Sequential Machines
Authors: P. K. Gupta
Venue: IEEE Transactions on Computers (1973)

Existing techniques for finding minimum state covers of an incompletely specified sequential machine are streamlined to yield a single minimum cover with significantly less computation. The factor by which computation is reduced is directly proportional to the complexity of the machine.
A Study on the Improved Collaborative Filtering Algorithm for Recommender System
Authors: Hee Choon Lee, Seok Jun Lee, Young Jun Chung
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

The purpose of this study is to suggest an algorithm of a recommender system to increase the customer's desire of purchasing, by automatically recommending goods transacted on e-commerce to customers. The recommender system has various filtering techniques according to the methods of recommendation. In this study, researchers study collaborative filtering among recommender systems. The accuracy of customer's preference prediction is compared with the accuracy of customer's preference prediction of the existing collaborative filtering algorithm, and the suggested new algorithm. At first, the accuracy of a customer's preference prediction of neighborhood based algorithm as automated collaborative filtering algorithm firstly & correspondence mean algorithm, is compared. It is analyzed by using MovieLens 100K dataset and 1 Million dataset in order to experiment with the prediction accuracy of the each algorithm. For similarity weight used in both algorithms it is discovered Pearson's correlation coefficient and vector similarity which are generally used were utilized, and as a result of analysis, we show that the accuracy of the customer's preference prediction of correspondence mean algorithm is superior. Pearson's correlation coefficient and vector similarity used in two algorithms are calculated by using the preference rating of two customers' co-rated movies, and it shows that similarity weight is overestimated, where the number of co-rated movies is small. Therefore, it is intended to increase the accuracy of customer's
An input method using discrete fitness values for interactive GA
Authors: Miho Ohsaki, Hideyuki Takagi, Kimiko Ohya
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

This paper proposes a new input method for human operators of an interactive GA to reduce their psychological burden. This method utilizes discrete fitness values to reduce the psychological stress involved in the input procedure. The advantage and disadvantage of the proposed method are evaluated and discussed. We conducted simulations to investigate the influence of quantization noise stemming from the use of discrete fitness values on convergence. Results show that the quantization noise does not significantly worsen convergence in practical use. The proposed method and a variation of the method which combines both discrete and continuous fitness values are evaluated using two subjective tests involving the task of drawing faces. The results of the subjective tests indicate that our proposed method and its variation can significantly reduce the psychological stress level of human interactive GA operators. The experimental results of the proposed method are discussed on its universality.