ppxscal/embedding_network huggingface dataset:
Combination of partially non-distinct beliefs: The cautious-adaptive rule
Authors: Abdelaziz Kallel, Sylvie Le Hégarat-Mascle
Venue: International Journal of Approximate Reasoning (2009)

The combination rule is critical in an evidence based fusion process. The conjunctive rule is most common eventhough when the cognitive independence - distinctness - assumption is often questionable. A new combination rule is tested here in both discrete and continuous cases, accounting for a partial non-distinctness between evidences. It is based on 'generalized discounting', that we define for separable basic belief assignments (bbas) or basic belief densities (bbds), to be applied to the source correlation derived from the cautious rule. This correlation can be specified in both considered cases of consonant bbas/bbds (as proposed by Dubois et al.) and separable bbas/bbds (as proposed by Denoeux). Then, the so-called 'cautious-adaptive' rule varies between the conjunctive rule and the cautious one, depending on the discounting level. In the Gaussian case with standard deviation @s, the evidence non-distinctness will be parameterized by a factor @r@?[0,1] dividing @s. It leads to the generalized discounting needed in the cautious-adaptive formulation.
Computational Theory of Iterative Methods, Volume 15
Authors: Ioannis Argyros
Venue: Studies In Computational Mathematics (2007)

The book is designed for researchers, students and practitioners interested in using fast and efficient iterative methods to approximate solutions of nonlinear equations. The following four major problems are addressed. Problem 1: Show that the iterates are well defined. Problem 2: concerns the convergence of the sequences generated by a process and the question of whether the limit points are, in fact solutions of the equation. Problem 3: concerns the economy of the entire operations. Problem 4: concerns with how to best choose a method, algorithm or software program to solve a specific type of problem and its description of when a given algorithm succeeds or fails. The book contains applications in several areas of applied sciences including mathematical programming and mathematical economics. There is also a huge number of exercises complementing the theory. - Latest convergence results for the iterative methods - Iterative methods with the least computational cost- Iterative methods with the weakest convergence conditions- Open problems on iterative methods
Loss functions with interactions and practical application
Authors: Matei Demetrescu, Adrian Paris, Constantin Tarcolea
Venue: Proceedings of the 10th WSEAS international conference on Mathematical and computational methods in science and engineering (2008)

Robust Design is one of the most important tools in manufacturing science. Taguchi's approach to optimization of manufacturing processes is made actual by the key concept of quality loss function. This paper reviews models of multivariate quality loss functions with interactions. A practical example is developed using a multivariate, nonquadratic loss function.
Representing Qualitative Trajectories by Autonomous Mobile Robots
Authors: J. C. Peris, J. Plana, M. T. Escrig
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)

Description of trajectories has been usually dealt in quantitative terms by means of mathematical formulas. Human beings do not use formulas to describe the trajectories of objects in movement, for instance, for shooting or catching a ball. Common sense reasoning about the physical world has been commonly solved by qualitative models. In this paper, we are going to qualitatively describe trajectories of objects in movement, at constant speed and in a 2D space, by an AiboTM robot.
A Generation Method of Exceptional Scenarios from a Normal Scenario
Authors: Atsushi Ohnishi
Venue: Proceeding of the 2006 conference on Knowledge-Based Software Engineering: Proceedings of the Seventh Joint Conference on Knowledge-Based Software Engineering (2006)

This paper proposes a method to generate exceptional scenarios from a normal scenario written with a scenario language. This method includes (1) generation of exceptional plans and (2) generation of exceptional scenario by a user's selection of these plans. The proposed method enables users to decrease the omission of the possible exceptional scenarios in the early stages of development. The method will be illustrated with some examples.
Unpacking Organizational Ambidexterity: Dimensions, Contingencies, and Synergistic Effects
Authors: Qing Cao, Eric Gedajlovic, Hongping Zhang
Venue: Organization Science (2009)

Significant ambiguity remains in the literature regarding the conceptualization of organizational ambidexterity. We unpack this construct into one with two dimensions we term the balance dimension of ambidexterity (BD) and the combined dimension of ambidexterity (CD). BD corresponds to a firm's orientation to maintain a close relative balance between exploratory and exploitative activities, whereas CD corresponds to their combined magnitude. We reason that these dimensions are conceptually distinct, and rely on different causal mechanisms to enhance firm performance. We find that over and above their independent effects, concurrent high levels of BD and CD yield synergistic benefits. We also find that BD is more beneficial to resource-constrained firms, whereas CD is more beneficial to firms having greater access to internal and/or external resources. These results indicate that managers in resource-constrained contexts may benefit from a focus on managing trade-offs between exploration and exploitation demands, but for firms that have access to sufficient resources, the simultaneous pursuit of exploration and exploitation is both possible and desirable.
Pedagogical Agents as Learning Companions: Building Social Relations with Learners
Authors: Yanghee Kim
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This study examined the potential of pedagogical agents as learning companions (PALs) to build social relations with learners and, consequently, to motivate learning. The study investigated the impact of PAL affect (positive vs. negative vs. neutral), PAL gender (male vs. female), and learner gender (male vs. female) on learners' social judgments, motivation, and learning in a controlled experiment. Participants were 142 college students in a computer-literacy course. Overall, the results indicated the interaction effects of PAL affect, PAL gender, and learner gender on learners' social judgments (p <.001). PAL affect impacted learners' social judgments (p <.001) and motivation (p <.05). PAL gender influenced motivation (p <.01) and recall of learning (p <.05). Learner gender influenced recall of learning (p <.01). The implications of the findings are discussed.
Short communication: An evaluation metric for image segmentation of multiple objects
Authors: Mark Polak, Hong Zhang, Minghong Pi
Venue: Image and Vision Computing (2009)

It is important to be able to evaluate the performance of image segmentation algorithms objectively. In this paper, we define a new error measure which quantifies the performance of an image segmentation algorithm for identifying multiple objects in an image. This error measure is based on object-by-object comparisons of a segmented image and a ground-truth (reference) image. It takes into account the size, shape, and position of each object. Compared to existing error measures, our proposed error measure works at the object level, and is sensitive to both over-segmentation and under-segmentation. Hence, it can serve as a useful tool for comparing image segmentation algorithms and for tuning the parameters of a segmentation algorithm.
Atomic mechanism of flat-band voltage shifts at La2O3, Al2O3 and Nb2O5 capping layers
Authors: L. Lin, J. Robertson
Venue: Microelectronic Engineering (2009)

We provide the first fully atomistic model of the origin of the flat band voltage shifts due to La- and Al-based capping layers, which are frequently used to control the flat band voltage in high K metal gate stacks. Supercells with substitutional La, Sr, Al or Nb at an HfO"2-SiO"2 interface create dipole layers which shift the flat band voltage in the observed direction. The shift only occurs for substitutions at the interface, not distributed over the HfO"2 layer. The shift is due to an image charge effect combining the metal electronegativity and oxygen density.
Artistically conveying peripheral information with the InfoCanvas
Authors: Todd Miller, John Stasko
Venue: Proceedings of the working conference on Advanced visual interfaces (2002)

The Internet and World Wide Web have made a tremendous amount of information available to people today. Taking advantage of and managing this information, however, is becoming increasingly challenging due to its volume and the variety of sources available. We attempt to reduce this overload with the InfoCanvas, an ambient display of a personalized, information-driven, visual collage. Through a web-based interface, people identify information of interest, associate a pictorial representation with it, and place the representation on a virtual canvas. The end result is an information collage, displayed on a secondary monitor or net appliance, that allows people to keep tabs on information in a calm, unobtrusive manner. This paper presents details on how a person can create and manage information with the InfoCanvas, and how we provide such capabilities.
Family communication: phone conversations with children
Authors: Rafael Ballagas, Joseph 'Jofish' Kaye, Morgan Ames, Janet Go, Hayes Raffle
Venue: Proceedings of the 8th International Conference on Interaction Design and Children (2009)

We interviewed and observed families in their homes to understand how they communicate across generations and across distances. The phone is still the most common way for keeping children in touch with distant relatives. However, many children can't talk on the phone by themselves until 7 or 8 years old. This paper examines the challenges children have with phone conversations, and looks at how families are currently working around these issues. These findings can help inform the design of future family communications technologies.
Dirac&#x2019;s Type Sufficient Conditions for Hamiltonicity and Pancyclicity
Authors: Ahmed Ainouche
Venue: Graphs and Combinatorics (2009)

Let G&#x00a0;=&#x00a0;(V, E) be a any simple, undirected graph on n&#x00a0;&#x2265;&#x00a0;3 vertices with the degree sequence $$d_{1} = \delta \leq \cdots \leq d_{n}$$. We consider the class $${\mathcal{D}}(n, \theta)$$of graphs satisfying the condition $$d_{\theta} \geq \frac{n}{2}$$where $$\theta, 1 \leq \theta \leq \delta + 2$$, is a positive integer. It is known that $$G \in {\mathcal{D}}(n, \theta)$$is hamiltonian if &#x03b8; &#x2264;&#x00a0;&#x03b4;. In this paper, we give a necessary and sufficient condition, easy to check, ensuring that $$G \in {\mathcal{D}}(n, \theta)$$is nonhamiltonian and we characterize all the exceptional sub-classes. we prove that $$G \in {\mathcal{D}}(n, \theta)$$is either bipartite or contains cycles of all lengths from 3 to c(G), the length of a longest cycle in G.
Capturing custom link semantics among heterogeneous artifacts and tools
Authors: Hazeline U. Asuncion, Richard N. Taylor
Venue: Proceedings of the 2009 ICSE Workshop on Traceability in Emerging Forms of Software Engineering (2009)

Automated techniques aid in minimizing the overhead associated with the capture and maintenance of trace links. However, many challenges to automated traceability remain, such as linking heterogeneous artifacts and capturing custom link semantics. In this position paper, we propose a combination of techniques, including prospective link capture, open hypermedia, and rules, in order to address these challenges and complement current automated techniques. Our approach borrows ideas from e-Science, a domain in which tracing data plays a crucial role in the repeatability of experiments.
Experiments on exact crossing minimization using column generation
Authors: Markus Chimani, Carsten Gutwenger, Petra Mutzel
Venue: Journal of Experimental Algorithmics (JEA) (2009)

The crossing number of a graph G is the smallest number of edge crossings in any drawing of G into the plane. Recently, the first branch-and-cut approach for solving the crossing number problem has been presented in Buchheim et al. [2005]. Its major drawback was the huge number of variables out of which only very few were actually used in the optimal solution. This restricted the algorithm to rather small graphs with low crossing number. In this article, we discuss two column generation schemes; the first is based on traditional algebraic pricing, and the second uses combinatorial arguments to decide whether and which variables need to be added. The main focus of this article is the experimental comparison between the original approach and these two schemes. In addition, we evaluate the quality achieved by the best-known crossing number heuristic by comparing the new results with the results of the heuristic.
A Hierarchical Concept-matrix Patterned Multi-Agent Based Automated Text Classification Method for Digital Libraries
Authors: R. Ponnusamy, T. V. Gopal, S. Vaidyanathan
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

In this work a new hierarchical concept-matrix patterned multi-agent based automated classification method is designed and developed in a distributed server environment. Phrase oriented approach is used instead of word based approach. Latent Semantic Analysis is used and its merits compared.
Solving multiagent assignment Markov decision processes
Authors: Scott Proper, Prasad Tadepalli
Venue: Proceedings of The 8th International Conference on Autonomous Agents and Multiagent Systems - Volume 1 (2009)

We consider the setting of multiple collaborative agents trying to complete a set of tasks as assigned by a centralized controller. We propose a scalable method called "Assignment-based decomposition" which is based on decomposing the problem of action selection into an upper assignment level and a lower task execution level. The assignment problem is solved by search, while the task execution is solved through coordinated reinforcement learning. We show that this decomposition of the overall problem into two levels scales well and outperforms the state-of-the-art approaches including pure assignment-level search or pure coordinated reinforcement learning. We also show how this approach enables transfer learning from domains with few agents to domains with many agents.
Autonomic specification of self-protection for distributed MARF with ASSL
Authors: Serguei A. Mokhov, Emil Vassev
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

This paper presents practical results of our endeavor towards formal specification and code generation of the Autonomic Distributed Modular Audio Recognition Framework (AD-MARF) system. We used the Autonomic System Specification Language (ASSL) to design and specify a self-protecting mechanism that must be incorporated by DMARF. Our overall goal is to have an autonomic computing layer covering DMARF by specifying autonomic properties at each of the pattern recognition stages of the same. Here we present results that complement our related work on the self-healing and self-optimizatin autonomic properties.
DCE: A One-on-One Digital Classroom Environment
Authors: Yi-Chan Deng, Sung-Bin Chang, Ben Chang, Tak-Wai Chan
Venue: Proceeding of the 2005 conference on Artificial Intelligence in Education: Supporting Learning through Intelligent and Socially Informed Technology (2005)

This paper describes a platform that supports for one-on-one digital learning. The platform is named “DCE”, which stands for digital classroom environment. It consists of four major modules, curriculum (including activities) module, user data module, communication module, and external interface module. An application example of DCE was described and demonstrated.
Interactive Parallel Analysis on the ALICE Grid with the PROOF Framework
Authors: Marco Meoni
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

The ALICE experiment at CERN LHC is intensively using a PROOF cluster for fast analysis and reconstruction. The current system (CAF - CERN Analysis Facility) consists of 120 CPU cores and about 45TB of local space. PROOF enables interactive parallel processing of data distributed on clusters of computers or multi-core machines. Subsets of selected data are automatically staged onto CAF from the Grid storage systems. However, a cluster of the size of CAF can only hold a fraction of the yearly 3PB data accumulated by ALICE. The impracticability to store and process such data volume in one single computing centre leads to the need to extend the concept of PROOF to the Grid paradigm.
Complex pattern search in sequential data
Authors: Dennis Mcleod
Venue:  (2008)

The need to search for complex and recurring patterns in database sequences, data streams and graphs is shared by many applications. Challenges in this problem include searching through large volumes of data in some database sequences, dealing with real-time data within a limited time frame and complexity of relations between tree-structured data. Feasible methods to search for patterns of interest, for data analysis purposes, will have to address these issues. In this thesis, we investigate the design and optimization of constructs that enable SQL to express complex patterns. In particular we propose the Recursive Sequential Pattern Search algorithm (RSPS) which is inspired by the KMP (Knuth-Morris-Pratt) string matching algorithm. RSPS exploits the inter-dependencies between elements of a sequential pattern to minimize repeated passes over the same data. Moreover we propose another novel algorithm, MCCPS (Multiple Concurrent Conjunctive Pattern Search), to look for complex patterns in single, and multi dimensional data. Performance gains derived from a set of experiments and a sensitivity analysis for RSPS and MCCPS are also discussed. Our results demonstrate dramatic speedup in search, of up to two order of magnitude.
Solving connected row convex constraints by variable elimination
Authors: Yuanlin Zhang, Satyanarayana Marisetti
Venue: Artificial Intelligence (2009)

We propose an algorithm for the class of connected row convex constraints. In this algorithm, we introduce a novel variable elimination method to solve the constraints. This method is simple and able to make use of the sparsity of the problem instances. One of its key operations is the composition of two constraints. We have identified several nice properties of connected row convex constraints. Those properties enable the development of a fast composition algorithm whose complexity is linear to the size of the variable domains. Compared with the existing work including randomized algorithms, the new algorithm has favorable worst case time and working space complexity. Experimental results also show a significant performance margin over the existing consistency based algorithms.
Project Management: A Primer
Authors: Jean-Bertrand Casseus
Venue:  (2007)

Project Management: A Primer introduces the non-technical person to basic Project Management concepts and to a methodology designed to help them understand the phases and activities of a project and the tasks that must be completed for success. While many technical manuals on project management often run 500 to 600 pages long, this book, instead, offers a quick and easy-to-read approach designed specifically for people who do not have a technical background. It is a roadmap to delivering a successful project, on time and on budget. 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
ILE-idol
Authors: Sally Fincher, Stephen Cooper, Michael Kölling, ian Utting
Venue: Proceedings of the 14th annual ACM SIGCSE conference on Innovation and technology in computer science education (2009)

This panel will showcase and compare three leading Initial Learning Environments (ILE): Alice, Greenfoot and Scratch.
A motion location based video watermarking scheme using ICA to extract dynamic frames
Authors: Zhaowan Sun, Ju Liu, Jiande Sun, Xinghua Sun, Jie Ling
Venue: Neural Computing and Applications (2009)

In this paper, we propose a novel video watermarking scheme based on motion location. In the proposed scheme, independent component analysis is used to extract a dynamic frame from two successive frames of original video, and the motion is located by using the variance of 8&#x00a0;&#x00d7;&#x00a0;8 block in the extracted dynamic frame. Then according to the located motion, we choose a corresponding region in the former frame of the two successive frames, where watermark is embedded by using the quantization index modulation algorithm. The procedure above is repeated until each frame of the video (excluding the last one) is watermarked. The simulations show that the proposed scheme has a good performance to resist Gaussian noising, MPEG2 compression, frame dropping, frame cropping, etc.
Outsourcing Management- Implementing Quality and Performance Decision Support
Authors: Ronald Shehane
Venue:  (2007)

Recent increases in government and private sector services contracting has created a significant challenge for decision makers in managing the quality received from outsourced services. This challenge often makes the difference between the survival or failure of these organizations. The recent China toy scare is a reminder of the seriousness of managing the quality of outsourced contracts. Quality management of large service-contracts is a daunting task that involves the evaluation of hundreds of quality measures and consideration of a variety of contract types and services. These contracts often create information overload, conceal critical relationships, and present a dizzying array of information. The use of decision support systems (DSS) to assist quality management can greatly enhance the chances of success. The author presents two case studies of DSS used for quality-management of major outsourced contracts that reveal the successful approaches and theory for solving quality management delimas with outsourced services. This book is addressed to professionals in management, contracting, computer systems support, and researchers interested in contract quality management. 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