ppxscal/embedding_network huggingface dataset:
Search Better and Gain More: Investigating New Graph Structures for Multi-Agent Negotiations
Authors: Samir Aknine
Venue: Proceeding of the 2006 conference on ECAI 2006: 17th European Conference on Artificial Intelligence August 29 -- September 1, 2006, Riva del Garda, Italy (2006)

Combined negotiation in multi-agent systems is a hard task since it involves several levels of difficulty. In order to improve their payoff, first agents behave in a strategic manner while bargaining since they need to deal with various types of behaviors. Second agents have to react to the proposals of other agents in finding the optimal solutions for their negotiation. This paper tackles the problem of winner determination in combined multi-agent negotiations and addresses two fundamental issues. The first contribution of this work is a winner determination algorithm, which finds an optimal solution, which is a combination of several bids selected from a set of bids at one iteration of a combined negotiation. In addition, the problem of dynamically revising these optimal solutions with regards to changes on bids is considered. These changes occur in multi-agent negotiation processes having several iterations and which use multi-phased protocols. To date no work addresses this problem. The second contribution of this work is an iterative algorithm for updating the optimal solutions to avoid integral and repetitive reapplication of the winner determination algorithm. The results of the experiments carried out using our algorithms have confirmed the importance and the originality of our approach based on the use of shared and unshared item graphs.
Improving the development of context-dependent Java applications with ContextJ
Authors: Malte Appeltauer, Robert Hirschfeld, Hidehiko Masuhara
Venue: International Workshop on Context-Oriented Programming (2009)

Context-oriented programming languages ease the design and implementation of context-dependent applications. ContextJ is a context-oriented extension to the Java programming language. In this paper, we assess the applicability of ContextJ language abstractions for the development of a graphical user interface-based application. We present a text editor that has been implemented with ContextJ based on the Qt Jambi framework and discuss possible extensions to ContextJ to improve its applicability.
The evolution of e-banking: a study of Indian and Kenyan technology awareness
Authors: Richard Nyangosi, J. S. Arora, Sumanjeet Singh
Venue: International Journal of Electronic Finance (2009)

Banking through electronic channels has gained increasing popularity in recent years. This system, popularly known as 'e-banking', provides alternatives for faster delivery of banking services to a wide range of customers. This study aims to collect customers' opinions regarding the importance of e-banking and the adoption levels of various e-banking technologies in India and Kenya. The study also highlights the trends of e-banking indicators in India and Kenya. Further, it segregates the data collected into an Indian and a Kenyan customer basis, to identify differences in their attitudes towards the emergence of e-banking. The overall result indicates that customers in both countries have developed positive attitudes and they attach much importance to the emergence of e-banking.
Rough Set Semantics for Three-Valued Logics
Authors: Seiki Akama, Tetsuya Murai
Venue: Proceeding of the 2005 conference on Advances in Logic Based Intelligent Systems: Selected Papers of LAPTEC 2005 (2005)

Rough set was introduced by Pawlak to represent coarse information and is related to a semantic basis for non-classical logics. In this paper, we proposed rough set semantics and show that it can be used as a natural semantics for some three-valued logics. As a case study, we deal with three-valued logics of Lukasiewicz and Kleene.
Generating example data for dataflow programs
Authors: Christopher Olston, Shubham Chopra, Utkarsh Srivastava
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

While developing data-centric programs, users often run (portions of) their programs over real data, to see how they behave and what the output looks like. Doing so makes it easier to formulate, understand and compose programs correctly, compared with examination of program logic alone. For large input data sets, these experimental runs can be time-consuming and inefficient. Unfortunately, sampling the input data does not always work well, because selective operations such as filter and join can lead to empty results over sampled inputs, and unless certain indexes are present there is no way to generate biased samples efficiently. Consequently new methods are needed for generating example input data for data-centric programs. We focus on an important category of data-centric programs, dataflow programs, which are best illustrated by displaying the series of intermediate data tables that occur between each pair of operations. We introduce and study the problem of generating example intermediate data for dataflow programs, in a manner that illustrates the semantics of the operators while keeping the example data small. We identify two major obstacles that impede naive approaches, namely (1) highly selective operators and (2) noninvertible operators, and offer techniques for dealing with these obstacles. Our techniques perform well on real dataflow programs used at Yahoo! for web analytics.
Assessing the Impact of A Structured Argumentation Board on the Quality of Students' Argumentative Writing Skills
Authors: Ole C. Brudvik, Khai Seng Hong, Yam San Chee, Libo Guo
Venue: Proceeding of the 2006 conference on Learning by Effective Utilization of Technologies: Facilitating Intercultural Understanding (2006)

This paper focuses on design of qualitative discourse-based methods for effective assessment of students' quality of argumentation. We advance a method for qualitative assessment of students' argument which we through discourse-based methods evaluate the speaker's stance in the argument, the speaker's thematic development of the content and criteria for layout. Our research program takes a design-based research approach focusing on the design and evaluation of Web-based learning environments that support the teaching and development of student's critical thinking skills and disposition through development of the skills of sound argumentation. The purpose of the research is to develop materials and strategies to support argumentation in the classroom with a Web-based tool for group argumentation, and to support the teachers' developing skills for teaching argumentation. Data was collected pre and post and during a four week intervention. Students causal argumentation essay were collected both pre and post. The paper presents the method with an analysis of one student's causal argumentation essays before and after the intervention.
Effective automatic parallelization and locality optimization using the polyhedral model
Authors: P. Sadayappan
Venue:  (2008)

Multicore processors have now become mainstream. The difficulty of programming these architectures to effectively tap the potential of multiple processing units is wellknown. Among several ways of addressing this issue, one of the very promising and simultaneously hard approaches is Automatic Parallelization. This approach does not require any effort on part of the programmer in the process of parallelizing a program. The Polyhedral model for compiler optimization is a powerful mathematical framework based on parametric linear algebra and integer linear programming. It provides an abstraction to represent nested loop computation and its data dependences using integer points in polyhedra. Complex execution-reordering, that can improve performance by parallelization as well as locality enhancement, is captured by affine transformations in the polyhedral model. With several recent advances, the polyhedral model has reached a level of maturity in various aspects&mdash;in particular, as a powerful intermediate representation for performing transformations, and code generation after transformations. However, an approach to automatically find good transformations for communication-optimized coarse-grained parallelization together with locality optimization has been a key missing link. This dissertation presents a new automatic transformation framework that solves the above problem. Our approach works by finding good affine transformations through a powerful and practical linear cost function that enables efficient tiling and fusion of sequences of arbitrarily nested loops. This in turn allows simultaneous optimization for coarse-grained parallelism and locality. Synchronization-free parallelism and pipelined parallelism at various levels can be extracted. The framework can be targeted to different parallel architectures, like general-purpose multicores, the Cell processor, GPUs, or embedded multiprocessor SoCs. The proposed framework has been implemented into a new end-to-end transformation tool, PLUTO, that can automatically generate parallel code from regular C program sections. Experimental results from the implemented system show significant performance improvement for single core and multicore execution over state-of-the-art research compiler frameworks as well as the best native production compilers. For several dense linear algebra kernels, code generated from Pluto beats, by a significant margin, the same kernels implemented with sequences of calls to highly-tuned libraries supplied by vendors. The system also allows empirical optimization to be performed in a much wider context than has been attempted previously. In addition, Pluto can serve as the parallel code generation backend for several high-level domain-specific languages.
A New 40-nm FPGA and ASIC Common Platform
Authors: Dan Mansur
Venue: IEEE Micro (2009)

Altera's Stratix IV FPGAs and Hardcopy IV ASICs provide a 40-nm common platform that offers several innovative architectural improvements, including adaptive body bias and flexible 10-Gbps transceivers. The resulting combination of high density, high performance, low power, and lower cost allows new and more complex systems previously unattainable with FPGA-based designs. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Reverse triangle inequalities for potentials
Authors: I. E. Pritsker, E. B. Saff
Venue: Journal of Approximation Theory (2009)

We study the reverse triangle inequalities for suprema of logarithmic potentials on compact sets of the plane. This research is motivated by the inequalities for products of supremum norms of polynomials. We find sharp additive constants in the inequalities for potentials, and give applications of our results to the generalized polynomials. We also obtain sharp inequalities for products of norms of the weighted polynomials w^nP"n,deg(P"n)@?n, and for sums of potentials with external fields. An important part of our work in the weighted case is a Riesz decomposition for the weighted farthest-point distance function.
Comparison study for Level set and Direct Lagrangian methods for computing Willmore flow of closed planar curves
Authors: Michal Bene&#x0161;, Karol Mikula, Tom&#x00e1;&#x0161; Oberhuber, Daniel &#x0160;ev&#x010d;ovi&#x010d;
Venue: Computing and Visualization in Science (2009)

The main goal of this paper is to present results of comparison study for the level set and direct Lagrangian methods for computing evolution of the Willmore flow of embedded planar curves. To perform such a study we construct new numerical approximation schemes for both Lagrangian as well as level set methods based on semi-implicit in time and finite/complementary volume in space discretizations. The Lagrangian scheme is stabilized in tangential direction by the asymptotically uniform grid point redistribution. Both methods are experimentally second order accurate. Moreover, we show precise coincidence of both approaches in case of various elastic curve evolutions provided that solving the linear systems in semi-implicit level set method is done in a precise way, redistancing is performed occasionally and the influence of boundary conditions on the level set function is eliminated.
Multi-Region Probabilistic Histograms for Robust and Scalable Identity Inference
Authors: Conrad Sanderson, Brian C. Lovell
Venue: Proceedings of the Third International Conference on Advances in Biometrics (2009)

We propose a scalable face matching algorithm capable of dealing with faces subject to several concurrent and uncontrolled factors, such as variations in pose, expression, illumination, resolution, as well as scale and misalignment problems. Each face is described in terms of multi-region probabilistic histograms of visual words, followed by a normalised distance calculation between the histograms of two faces. We also propose a fast histogram approximation method which dramatically reduces the computational burden with minimal impact on discrimination performance. Experiments on the "Labeled Faces in the Wild" dataset (unconstrained environments) as well as FERET (controlled variations) show that the proposed algorithm obtains performance on par with a more complex method and displays a clear advantage over predecessor systems. Furthermore, the use of multiple regions (as opposed to a single overall region) improves accuracy in most cases, especially when dealing with illumination changes and very low resolution images. The experiments also show that normalised distances can noticeably improve robustness by partially counteracting the effects of image variations.
Evaluating the security of machine learning algorithms
Authors: J. D. Tygar
Venue:  (2008)

Two far-reaching trends in computing have grown in significance in recent years. First, statistical machine learning has entered the mainstream as a broadly useful tool set for building applications. Second, the need to protect systems against malicious adversaries continues to increase across computing applications. The growing intersection of these trends compels us to investigate how well machine learning performs under adversarial conditions. When a learning algorithm succeeds in adversarial conditions, it is an algorithm for secure learning. The crucial task is to evaluate the resilience of learning systems and determine whether they satisfy requirements for secure learning. In this thesis, we show that the space of attacks against machine learning has a structure that we can use to build secure learning systems. This thesis makes three high-level contributions. First, we develop a framework for analyzing attacks against machine learning systems. We present a taxonomy that describes the space of attacks against learning systems, and we model such attacks as a cost-sensitive game between the attacker and the defender. We survey attacks in the literature and describe them in terms of our taxonomy. Second, we develop two concrete attacks against a popular machine learning spam filter and present experimental results confirming their effectiveness. These attacks demonstrate that real systems using machine learning are vulnerable to compromise. Third, we explore defenses against attacks with both a high-level discussion of defenses within our taxonomy and a multi-level defense against attacks in the domain of virus detection. Using both global and local information, our virus defense successfully captures many viruses designed to evade detection. Our framework, exploration of attacks, and discussion of defenses provides a strong foundation for constructing secure learning systems.
On certain classes of meromorphically multivalent functions associated with the generalized hypergeometric function
Authors: M. K. Aouf, M. F. Yassen
Venue: Computers Mathematics with Applications (2009)

Making use of a linear operator, which is defined here by means of the Hadamard product (or convolution), involving the generalized hypergeometric function, we introduce two novel subclasses @W"p","q","s(@a"1;A,B,@l) and @W"p","q","s^+(@a"1;A,B,@l) of meromorphically multivalent functions of order @l(0@?@l
Analyzing CS competencies using the SOLO taxonomy
Authors: Claus Brabrand, Bettina Dahl
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

We have used the SOLO Taxonomy to analyze 5,608 competencies stemming from 734 courses from the faculties of science at Aarhus University and University of Southern Denmark. Both faculties have formulated learning outcomes using this taxonomy. This has made it possible to systematically analyze competencies and compare different science subjects. In this talk, we will explain the analysis and outline our main findings.
A GA-Tabu algorithm for scheduling in-line steppers in low-yield scenarios
Authors: Chie-Wun Chiou, Muh-Cherng Wu
Venue: Expert Systems with Applications: An International Journal (2009)

This paper presents a scheduling algorithm for an in-line stepper in low-yield scenarios, which mostly appear in cases when new process/production is introduced. An in-line stepper is a bottleneck machine in a semiconductor fab. Its interior comprises a sequence of chambers, while its exterior is a dock equipped with several ports. The transportation unit for entry of each port is a job (a group of wafers), while that for each chamber is a piece of wafer. This transportation incompatibility may lead to a capacity-loss, in particular in low-yield scenarios. Such a capacity-loss could be alleviated by effective scheduling. The proposed scheduling algorithm, called GA-Tabu, is a combination of a genetic algorithm (GA) and a tabu search technique. Numerical experiments indicate that the GA-Tabu algorithm outperforms seven benchmark ones. In particular, the GA-Tabu algorithm outperforms a prior GA both in solution quality and computation efforts.
Voice Over WLANS: The Complete Guide
Authors: Michael Finneran
Venue:  (2007)

Wireless local area networks (WLANs) have traditionally been used to transport only data, but are now being used to carry voice traffic as well as provided new combined voice and data services. Voice over WLANs also offers more flexibility than wired networks (changes to a WLAN don't require changes to installed wiring) and greater capacity than wired networks. This book provides a solid overview of voice over WLANs/VoIP (voice over internet protocol) technology, including voice coding, packet loss, delay and "jitter," and "echo" control. It shows how to combine both WLAN and VoIP technology to create effective voice over WLAN systems. * Gives complete details on integrating voice and data services on WLANs, including wide area networks* Explores quality of service (QoS) and security issues* Step-by-step descriptions of how to plan and implement voice over WLAN networks The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Weights Updated Voting for Ensemble of Neural Networks Based Incremental Learning
Authors: Jianjun Liu, Shengping Xia, Weidong Hu, Wenxian Yu
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

In this paper, an ensemble of neural networks based incremental learning algorithm with weights updated voting is described. The algorithm defines the class kernel function of the training database of the component neural network in the ensemble. The voting weights are updated based on the distance between the test instance and the kernel function. This method can adaptively update the voting weights according to the classification performance of the component neural network on the test pattern and it is more optimal than the stable weights voting strategy. Experimental results show that the ensemble of neural networks based incremental learning algorithm with weights updated voting is more promising than that with stable weights voting rule.
Solving the Response Time Variability Problem by means of Multi-start and GRASP metaheuristics
Authors: Albert Corominas, Alberto García-Villoria, Rafael Pastor
Venue: Proceeding of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence (2008)

The Response Time Variability Problem (RTVP) is an NP-hard scheduling optimization problem that has recently appeared in the literature. This problem has a wide range of real-life applications in, for example, manufacturing, hard real-time systems, operating systems and network environments. The RTVP occurs whenever models, clients or jobs need to be sequenced to minimize variability in the time between the instants at which they receive the necessary resources. The RTVP has been already solved in the literature with a multi-start and a GRASP algorithm. We propose an improved multi-start and an improved GRASP algorithm to solve the RTVP. The computational experiment shows that, on average, the results obtained with our proposed algorithms improve on the best obtained results to date.
A Distributed Information System Architecture for Collaborative Design
Authors: Andrew Feller, Teresa Wu, Dan Shunk
Venue: Proceeding of the 2006 conference on Integrated Intelligent Systems for Engineering Design (2006)

Improving and streamlining the communication and decision processes used in Collaborative Product Development (CPD) requires a robust Distributed Information System that can enable intelligent notification, coordination and negotiation processes. In this chapter we review existing research and industry practice related to CPD information systems and propose an information framework called the Virtual Environment for Product Development (VE4PD) that is based on the integration of Web services and agent technologies to manage the CPD process. The VE4PD architecture is designed to support CPD functions such as design synchronization, timely notification, distributed control, role based security, support for distributed intelligent agents, and varying design rule standards. An implementation system including intelligent agents for design negotiation is also described that validates the application approach.
Using Legal Definitions to Increase the Accessibility of Legal Documents
Authors: Laurens Mommers, Wim Voermans
Venue: Proceeding of the 2005 conference on Legal Knowledge and Information Systems: JURIX 2005: The Eighteenth Annual Conference (2005)

Access to legal documents has been hampered by the lack of attention for specific user groups accessing such documents. In this article, we focus on one of these user groups (legal professionals), who can benefit from specific types of cross-lingual information retrieval for, e.g., comparative law research. We propose to use legal definitions as anchor points in legal documents. Through the body of EU legislation, these anchor points can support a network of concepts between different jurisdictions. A model is presented containing the different entity types and relations types for building such a network, which can be implemented in the WordNet architecture.