ppxscal/embedding_network huggingface dataset:
Modular Argumentation For Modelling Legal Doctrines in Common Law of Contract
Authors: Phan Minh Dung, Phan Minh Thang
Venue: Proceeding of the 2008 conference on Legal Knowledge and Information Systems: JURIX 2008: The Twenty-First Annual Conference (2008)

To create a programming environment in which autonomous agents could be built to resolve contract disputes, we propose an extension of assumption-based argumentation (ABA) into modular assumption-based argumentation (MABA) in which different modules of argumentation representing different knowledge bases for reasoning about beliefs and facts and for representation and reasoning with the legal doctrines could be built and assembled together. A distinct novel feature of modular argumentation in compare with other modular logic-based systems like Prolog is that it allows references to different semantics in the same module at the same time, a feature critically important for application of argumentation in legal domains like contract dispute resolution where the outcomes of court cases often depend on whether credulous or skeptical modes of reasoning were applied by the contract parties. We apply the new framework to model the doctrines of contract breach and mutual mistake.
Implementation of Croatian NERC system
Authors: Božo Bekavac, Marko Tadić
Venue: Proceedings of the Workshop on Balto-Slavonic Natural Language Processing: Information Extraction and Enabling Technologies (2007)

In this paper a system for Named Entity Recognition and Classification in Croatian language is described. The system is composed of the module for sentence segmentation, inflectional lexicon of common words, inflectional lexicon of names and regular local grammars for automatic recognition of numerical and temporal expressions. After the first step (sentence segmentation), the system attaches to each token its full morphosyntactic description and appropriate lemma and additional tags for potential categories for names without disambiguation. The third step (the core of the system) is the application of a set of rules for recognition and classification of named entities in already annotated texts. Rules based on described strategies (like internal and external evidence) are applied in cascade of transducers in defined order. Although there are other classification systems for NEs, the results of our system are annotated NEs which are following MUC-7 specification. System is applied on informative and noninformative texts and results are compared. F-measure of the system applied on informative texts yields over 90%.
An Enhanced Swarm Intelligence Clustering-Based RBF Neural Network Web Text Classifier
Authors: Yong Feng, Zhongfu Wu, Jiang Zhong, Chunxiao Ye, Kaigui Wu
Venue: Proceedings of the 6th International Symposium on Neural Networks: Advances in Neural Networks - Part II (2009)

The central problem in training a radial basis function neural network (RBFNN) is the selection of hidden layer neurons, which includes the selection of the center and width of those neurons. In this paper, we propose an enhanced swarm intelligence clustering (ESIC) method to select hidden layer neurons, and then, training a cosine RBFNN base on gradient descent learning process. Also, the new method is applied for web text classification. Experimental results show that the average Accuracy, Precision and Recall of our ESIC-based RBFNN classifier maintained a better performance than BP, SVM and OLS RBF.
IT Control Objectives for Basel II - The Importance of Governance and Risk Management for Compliance, 1st edition
Venue:  (2007)

IT Control Objectives for Basel II provides a framework for managing operational and information risk in the context of Basel II. It presents an outline of risk under Basel II, the links between operational risk and IT risk, and an approach for managing information risk. This document addresses three groups information risk managers, IT practitioners and financial services experts. The executive summary states that financial services organizations using the framework presented are able to apply recognized IT control objectives and management processes to address the role of IT in operational risk. The book introduces the relevant concepts of governance, risk management and compliance (GRC), outlines the pressures that are intensifying the regulatory focus and describes the approach to risk management as defined in the Basel II framework.
The impact of service quality on perceptions of software product quality
Authors: Kristal R. Ray
Venue:  (2008)

To remain viable, every company must be able to satisfy and retain customers. In the 1970's, it was argued that the best way to achieve this was to produce a quality product. In the 1980's, many organizations moved beyond quality to focus directly on increasing customer satisfaction, as it was believed that it was cheaper to satisfy a customer than to replace one. Recently, quality and satisfaction have been identified as parts of a larger system that focuses on customer loyalty as the key to profitability. In fact, many studies have established the tangible links between customer satisfaction and business outcomes such as market share, revenue, and profitability. Understanding these links can help a company understand where quality needs to be improved to increase satisfaction and loyalty, and how those improvements will pay off. These links may also provide insight into some unexpected relationships that are significantly impacting desired outcomes. Many firms are realizing the complementary role of product and service subsystems in structuring customer experiences. However, in the commercial software environment, little is currently known about the interdependencies between these subsystems, the impact of these on perceived value, and the associated behavioral outcomes on customer loyalty. Better understanding of these relationships can provide strategic insight regarding both product and service investments. While the software quality attributes provide some insight into the customer's perception of software quality, there are other dimensions, which are not currently part of software quality evaluations, which are critically important in the customer's assessment. Understanding and incorporating these will facilitate a more complete assessment of software product quality from the perspective of the customer. This research evaluated software product and service quality, their influence on each other, and the impact of both on customer loyalty. The assessment of software quality utilized in this research is different from traditional measures that focus on indicators such as defect reduction. The findings indicate that the customers' perceptions of the service quality directly influenced not only their service satisfaction, but their perception of product quality. Furthermore, both software and service quality drive the customer's assessment of the solution value, which shows that the assessment of solution value is dependent on experience quality. As a result, effective management of software quality requires extensions to the current measurement paradigms to evaluate overall experience quality and its impact on loyalty. 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
Subgraphs of random k-edge-coloured k-regular graphs
Authors: Paulette Lieby, Brendan d. Mckay, Jeanette c. Mcleod, Ian m. Wanless
Venue: Combinatorics, Probability and Computing (2009)

Let G = G(n) be a randomly chosen k-edge-coloured k-regular graph with 2n vertices, where k = k(n). Such a graph can be obtained from a random set of k edge-disjoint perfect matchings of K2n. Let h = h(n) be a graph with m = m(n) edges such that m2 + mk = o(n). Using a switching argument, we find an asymptotic estimate of the expected number of subgraphs of G isomorphic to h. Isomorphisms may or may not respect the edge colouring, and other generalizations are also presented. Special attention is paid to matchings and cycles. The results in this paper are essential to a forthcoming paper of McLeod in which an asymptotic estimate for the number of k-edge-coloured k-regular graphs for k = o(n5/6) is found.
Optimizing Aspectual Execution Mechanisms for Embedded Applications
Authors: Christine Hundt, Sabine Glesner
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2009)

Applications for small embedded mobile devices are becoming larger and more complex resulting in the need for advanced modularization mechanisms. Aspect-oriented modularization is a promising approach to solve this problem, but the overhead of the existing programming languages restricts their practicability for small devices with limited resources. In this paper, we identify opportunities to optimize the aspectual execution mechanism at different levels within the virtual machine. First experiments show that these optimizations improve the execution time considerably, thus proving that with adequate optimizations, we enable the use of advanced aspect-oriented modularization techniques for small device Java applications.
Line Image Classification by NG×SOM: Application to Handwritten Character Recognition
Authors: Makoto Otani, Kouichi Gunya, Tetsuo Furukawa
Venue: Proceedings of the 7th International Workshop on Advances in Self-Organizing Maps (2009)

A method for generating a self-organizing map of line images is proposed. In the proposed method, called the NG×SOM, a set of data distributions is represented by a product space organized by a set of neural gas networks (NGs) and a self-organizing map (SOM). In this paper, it is assumed that the line images dealt with by the NG×SOM have the same, yet unknown, topology. Thus the task of the NG×SOM is to generate a map of line images with the same topology, in which the images are continuously and naturally morphed from one into another. We applied the NG×SOM to a handwritten character recognition task. The results obtained show that this method is effective, particularly when the number of training data is small.
Extending types to modeling problem-space entities
Authors: William Van Lepthien, Kenneth M. Anderson
Venue: The New Review of Hypermedia and Multimedia (2006)

Structural computing has evolved from Work on open hypermedia to aid in the construction of domain-specific software infrastructure and tools. Part of the premise of structural computing has been that by focusing on the abstraction of structure rather than on a concrete data layer, it should make it easier for developers to use appropriate levels of abstraction to build applications. By using the appropriate level of abstraction, the resulting systems can represent components in ways that closely reflect the problem space, instead of forcing the problem into an implementation-centric paradigm. Our previous work has concentrated on how to accomplish these ends through the abstraction of data--this paper concentrates on the benefits of abstraction of type. As our concern is primarily with modelling the problem space in an application domain, we approach 'type' initially from a problem-space viewpoint, not from a theoretic model. 'Type' is not a monolithic concept: a type may be an interface definition, a set of properties, or a classification. The meaning of a type depends on the individual entity to which the type is being applied, as well as the context in which the typing occurs. The meaning of 'type' in a problem domain may differ greatly from 'type' in an application addressing that domain, and the distinction must be kept clear. Types, like the entities to which they are applied, are not necessarily static. This observation is especially important in applications addressing domains that involve complex activities. This paper proposes a framework for distinguishing among the varieties of 'type' and describes uses for each. In the context of structural programming, we discuss techniques for building context-dependent extensions to existing types (whether interface definitions or classifications) that support applications where both the definitions of types and the classification of items are subject to change. We contextualize this work with respect to related research, and with more general software development concerns.
Control of Constraint Weights for a 2D Autonomous Camera
Authors: Md. Shafiul Alam, Scott D. Goodwin
Venue: Proceedings of the 22nd Canadian Conference on Artificial Intelligence: Advances in Artificial Intelligence (2009)

This paper addresses the problem of deducing and adjusting constraint weights at run time to guide the movement of the camera in an informed and controlled way in response to the requirements of the shot. This enables the control of weights at the frame level. We analyze the mathematical representation of the cost structure of the search domain so that the constraint solver can search the domain efficiently. Here we consider a simple tracking shot of a single target without occlusion or other environment elements. In this paper we consider only the distance, orientation, frame coherence distance and frame coherence rotation constraints in 2D. The cost structure for 2D suggests the use of a binary search to find the solution camera position.
Competitive Buffer Management with Stochastic Packet Arrivals
Authors: Kamal Al-Bawani, Alexander Souza
Venue: Proceedings of the 8th International Symposium on Experimental Algorithms (2009)

We study a variant of Naor's [23] online packet buffering model: We are given a (non-preemptive) fifo buffer (e.g., in a network switch or a router) and packets that request transmission arrive over time. Any packet has an intrinsic value R and we have to decide whether to accept or reject it. In each time-step, the first packet in the buffer (if any) is transmitted and our benefit of it is equal to its intrinsic value minus the time it spent in the buffer. The objective is to maximize the total benefit. From a worst-case perspective, Fiat et al. [14] gave a threshold algorithm with a competitive ratio equal to the golden ratio ¿ ≈ 1.618. Due to the insensitivity of the algorithms towards the input, it was conjectured that this competitive ratio is too pessimistic for packet sequences occurring in practice.In this paper, we treat this conjecture from an analytical and experimental point of view. In the analytical part, we assume Poisson arrivals and compute a threshold for this algorithm depending on the arrival rate ¿ and the value R of the packets. This also yields bounds on the (expected) competitive ratio of the algorithm. We discover the phenomenon that the ratio converges to one if R grows or ¿ moves away from one. Thus (for fixed R) we have that the largest competitive ratios occur for ¿= 1. In that case, the bound is essentially $R / (R - \sqrt{R})$ and gives values smaller than ¿ for R ¿ 8.In a second, experimental, part of our study, we compared the competitive ratios achieved by the two threshold algorithms on actual network traffic with our theoretical prediction (which assumes Poisson arrivals). It turns out that the prediction and the measured ratios for our threshold are consistent, where the prediction even tends to be pessimistic. Furthermore, the measured ratios with our threshold where substantially smaller than ¿ and even almost everywhere below the ratios achieved with the threshold of [14].
Technology Lessons for the Classroom: Image Management & Multimedia Volume 1
Authors: Rene Fuller and Charlotte Haley, David Hoerger
Venue:  (2007)

These creative and innovative lessons are beneficial for teaching digital graphics and a variety of multimedia topics for grades 8 12. Additional teaching resources include examples, presentations to introduce specific topics, photos for editing, and Web sites. Appropriate for a variety of classes, this collection of teaching resources is classroom tested and created by teachers for teachers. Allows teachers to focus on teaching! Includes 54 lesson plans that cover all Business Image Management & Multimedia skills Fun, dynamic, project-based lesson plans using Microsoft Office, Photoshop, and video applications Many lesson plans cross over to other multimedia classes and disciplines CD includes: All student and Teacher Instruction pages in Word and PDF files. It also includes all necessary resources such as project photos, examples, solutions and PowerPoint presentations for the lessons.
Graphics Interface 2008: Windsor, Ontario, Canada May 28-30, 2008
Authors: Lyn Bartram, Chris Shaw
Venue:  (2009)

This volume, with contributions by top graphics researchers and professionals, is devoted to computer graphics, interactive systems, and human-computer interaction. The paper contributions are from talks given at the annual Graphics Interface conference, now in its 34th year. Graphics Interface occupies a unique niche among conferences in that it seeks to both combine and bridge research topics in and across these areas. Beginning in 1969 as the 'Canadian Man-Computer Communications Seminar' (CMCCS), it is the oldest regularly scheduled computer graphics and human-computer interaction conference. This year, Graphics Interface was held May 28-30, 2008 in Windsor, Ontario. Graphics Interface (GI) 2008 is the oldest regularly-scheduled computer.
Prediction of Exchange Coupling Constant for Mn12 Molecular Magnet Using Dft+U
Authors: Shruba Gangopadhyay, Artëm E. Masunov, Eliza Poalelungi, Michael N. Leuenberger
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

Single-molecule magnets are perspective materials for molecular spintronic applications. Predictions of magnetic coupling in these systems have posed a long standing problem, as calculations of this kind require a balanced description of static and dynamic electron correlation. The large size of these systems limits the choice of theoretical methods used. Two methods feasible to predict the exchange coupling parameters are broken symmetry Density Functional Theory (BSDFT) and DFT with empirical Hubbard U parameter (DFT+U). In this contribution we apply DFT+U to study Mn-based molecular magnets using Vanderbilt Ultrasoft Pseudopotential plane wave DFT method, implemented in Quantum ESPRESSSO code. Unlike most previous studies, we adjust U parameters for both metal and ligand atoms using two dineuclear molecular magnets [Mn2O2(phen)4]2 + and [Mn2O2(OAc)(Me4dtne)]3 + as the benchmarks. Next, we apply this methodology to Mn12 molecular wheel. Our study finds antiparallel spin alignment in weakly interacting fragments of Mn12, in agreement with experimental observations.
Error Rate in Multimodal Mobility Systems
Authors: Christopher J. Pavlovski, Stella Mitchell, Braam Smith, Richard Xu
Venue: Proceeding of the 2006 conference on Advances in Intelligent IT: Active Media Technology 2006 (2006)

In this paper we present the results of a trial undertaken with a platform that supports multimodal applications for 3G cellular phones. A novel aspect of our work is multimodal interaction capable of supporting natural language speech and text data entry. The focus of our research is to understand user behavior in response to errors encountered whilst interacting with mobile applications that furnish a multimodal user interface. We observed an increase in the user's propensity to alternate between UI modes when encountering errors, as well as increased termination rates even though an alternative mode was available to complete tasks. Given the multiplicity of user interfaces, mutlimodal solutions provide a novel way to improve user response to errors. By analyzing how users respond to errors in multimodal applications we wish to develop a capability for error self-recovery in order to reduce the termination rate upon error. This paper presents the components of our platform and key results of our trial.
Assessing value of SW architecture
Authors: Pasi Ojala
Venue: Proceedings of the 2nd conference on European computing conference (2008)

During the last decades software architecture has become increasingly important for companies creating competitive product structures. Recently more and more attention has also been focused on the costs, cost-effectiveness, productivity and value of software development and products. This study outlines concepts, principles and process of implementing a value assessment for SW architecture. The main purpose of this study is to collect experiences whether the value assessment for product architecture is useful for companies, works in practice, and what are the strengths and weaknesses of using it. This is done by implementing value assessment in a case company step by step to see which phases possibly work and which phases possibly do not work. The practical industrial case shows that proposed value assessment for product architecture is useful and supports companies trying to find value in product architecture.
Letters: A novel view of the variational Bayesian clustering
Authors: Takashi Takekawa, Tomoki Fukai
Venue: Neurocomputing (2009)

We prove that the evaluation function of variational Bayesian (VB) clustering algorithms can be described as the log likelihood of given data minus the Kullback-Leibler (KL) divergence between the prior and the posterior of model parameters. In this novel formalism of VB, the evaluation functions can be explicitly interpreted as information criteria for model selection and the KL divergence imposes a heavy penalty on the posterior far from the prior. We derive the update process of the variational Bayesian clustering with finite mixture Student's t-distribution, taking the penalty term for the degree of freedoms into account.
Statistical Dependency of Image Wavelet Coefficients: Full Bayesian Model for Neural Networks
Authors: Xingming Long, Jing Zhou
Venue: Proceedings of the 6th International Symposium on Neural Networks on Advances in Neural Networks (2009)

A novel method based Full Bayesian Model for Neural Network (FBMNN) to study the statistical dependency of wavelet coefficients is presented. To overcome the ignorance of the relationship between wavelet coefficients, we introduce the FBMNN to model joint probability density distribution (JPDF) of Child and Parent wavelet coefficients. According to the characteristics of the suggested FBMNN-JPDF model, its parameters are estimated by reversible jump MCMC (rjMCMC) algorithm. Finally, a practical application on denoising image by using the FBMNN-JPDF model is demonstrated and the result shows that the suggested method can express wavelet coefficients dependency efficiently.
Soil environmental quality assessment in sustainable rehabilitation of mine waste area: establishing an integrated indicator-based system
Authors: Xiang Zhu, Yingyi Chen, Daoliang Li
Venue: WSEAS Transactions on Information Science and Applications (2009)

Soil environmental quality is the capacity of a soil to function, within ecosystem and land use boundaries, to sustain biological productivity, maintain environmental quality, and promote plant, animal and human health'. In the long-term, vegetative rehabilitation of mining wastes aims at, as far as possible, the proper ecological integration of the reclaimed area into the surrounding landscape, which is sustainable and requires minimal maintenance. This article presents here an indicator-based system of soil environmental quality that evaluates sustainable rehabilitation of mine waste through a set of 2 subindicators, chemical fertility and stocks of organic matter, and further combines them into a single general Indicator of Soil Quality (GISQ). The design and calculation of the indicators were based on sequences of multivariate analyses. Principal component analysis (PCA) was used to assess soil quality overall. A GISQ combined the different subindicators providing a global assessment of soil environmental quality. Our findings provide evidence that selected indicators can provide a definitive, quantitative assessment of soil environmental quality and lend credence to the value of our approach in quantifying relationships between soil function and indicators for specific areas.