ppxscal/embedding_network huggingface dataset:
Web Accessibility - Automatic/Manual Evaluation and Authoring Tools
Authors: Helen Petrie, Christopher Power, Gerhard Weber
Venue: Proceedings of the 11th international conference on Computers Helping People with Special Needs (2008)

This paper provides an introduction to automatic and manual evaluation methods for analysis of web accessibility. The first topic examines the recent results in advances in authoring, including modifications to existing CMS systems and new development toolkits. Next, the session explores the accessibility of specialized content such as graphics and interface components. The last topic in the session covers the results of the Web Accessibility Benchmarking Cluster of European Union supported projects (WAB-Cluster). Authors discuss technologies needed for automatic as well as manual evaluation.
Ensembling Classifiers Using Unsupervised Learning
Authors: Marek Bundzel, Peter Sinčák
Venue: Proceedings of the 9th international conference on Artificial Intelligence and Soft Computing (2006)

This paper describes a method for production of an ensemble of general classifiers using unsupervised learning. The method uses the `divide and conquer' strategy. Using competitive learning the feature space is divided into subregions where the classifiers are constructed. The structure of the ensemble starts from a single member and new members are being added during the training. The growth of the ensemble is self determined until the ensemble reaches the desired accuracy. The overall response of the ensemble to an input pattern is represented by the output of a winning member for the particular pattern. The method is generic, i.e. it is not bound to a specific type of classifier and it is suitable for parallel implementation. It is possible to use the method for data mining. A basic wide margin linear classifier is used in the experiments here. Experimental results achieved on artificial and real world data are presented and compared to the results of Gaussian SVM. Parallel implementation of the method is described.
Rules of Emotions: A Linguistic Interpretation of an Emotion Model for Affect Sensing from Texts
Authors: Mostafa Al Shaikh, Helmut Prendinger, Ishizuka Mitsuru
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

This paper aims to interpret the cognitive theory of emotions known as the OCC emotion model from the computational linguistic standpoint. Since the OCC emotions are associated with several cognitive variables, in this paper we explain how the values could be assigned to those by analyzing and processing natural language components.
An Agent-Based Approach for Range Image Segmentation
Authors: Smaine Mazouzi, Zahia Guessoum, Fabien Michel, Mohamed Batouche
Venue: Massively Multi-Agent Technology: AAMAS Workshops, MMAS 2006, LSMAS 2006, and CCMMS 2007 Hakodate, Japan, May 9, 2006 Honolulu, HI, USA, May 15, 2007 Selected and Revised Papers (2008)

In this paper an agent-based segmentation approach is presented and evaluated. The approach consists in using a high number of autonomous agents for the segmentation of a range image in its different planar regions. The moving agents perform cooperative and competitive actions on the image pixels allowing a robust extraction of regions and an accurate edge detection. An artificial potential field, created around pixels of interest, allows the agents to be gathered around edges and noise regions. The results obtained with real images are compared to those of some typical methods for range image segmentation. The comparison results show the potential of the proposed approach for scene understanding in range images regarding both segmentation efficiency, and detection accuracy.
Simulating the effects of sanctioning for the emergence of cooperation in a public goods game
Authors: Ana L. C. Bazzan, Sílvio R. Dahmen, Alexandre T. Baraviera
Venue: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3 (2008)

Several explanations have been proposed in order to explain why, in public goods games, cooperation does not collapse. In these games free-riders enjoy the benefits of other individuals who contribute in benefit of a community. In the present work we address a public goods game where individuals have the choice between contributing to a sanctioning institution and to a sanction-free one. In the former there is a possible sanction for those who do not contribute. Our results show that individuals who contribute to a sanctioning institution are better off after several repetitions of the game, despite the costs associated with sanctioning. This reproduces results found in experiments with human subjects, which point to advantages of sanctioning measures as a factor for the stabilization of cooperation.
Fuzzy model in urban planning
Authors: Jasna Pleho, Zikrija Avdagic
Venue: Proceedings of the 9th WSEAS International Conference on Fuzzy Systems (2008)

This paper presents application of a fuzzy logic in urban planning. Urban environment quality evaluation is an important part of environmental planning and management. Traditional theory does not give as good evaluation as the fuzzy set theory, which provides the basis for urban planning. Most information related to environmental evaluation has the spatial component, which is why GIS is widely used in the evaluation of the environment. Integration of the GIS and fuzzy set theory has been used lately in evaluation of urban environment quality. Fuzzy set theory is used in analysis of the environment because of its ability to manage imprecise, insecure and ambiguous data.
Generators for the l-Torsion Subgroup of Jacobians of Genus Two Curves
Authors: Christian Robenhagen Ravnshøj
Venue: Proceedings of the 2nd international conference on Pairing-Based Cryptography (2008)

We give an explicit description of the matrix representation of the Frobenius endomorphism on the Jacobian of a genus two curve on the subgroup of l-torsion points. By using this description, we can describe the matrix representation of the Weil-pairing on the subgroup of l-torsion points explicitly. Finally, the explicit description of the Weil-pairing provides us with an efficient, probabilistic algorithm to find generators of the subgroup of l-torsion points on the Jacobian of a genus two curve. 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
Problems with Evaluation of Unsupervised Empirical Grammatical Inference Systems
Authors: Menno Zaanen, Jeroen Geertzen
Venue: Proceedings of the 9th international colloquium on Grammatical Inference: Algorithms and Applications (2008)

Empirical grammatical inference systems are practical systems that learn structure from sequences, in contrast to theoretical grammatical inference systems, which prove learnability of certain classes of grammars. All current empirical grammatical inference evaluation methods are problematic, i.e. dependency on language experts, appropriateness and quality of an underlying grammar of the data, and influence of the parameters of the evaluation metrics. Here, we propose a modification of an evaluation method to reduce the ambiguity of results.
On the Constructive Dedekind Reals: Extended Abstract
Authors: Robert S. Lubarsky, Michael Rathjen
Venue: Proceedings of the international symposium on Logical Foundations of Computer Science (2007)

In order to built the collection of Cauchy reals as a set in constructive set theory, the only Power Set-like principle needed is Exponentiation. In contrast, the proof that the Dedekind reals form a set has seemed to require more than that. The main purpose here is to show that Exponentiation alone does not suffice for the latter, by furnishing a Kripke model of constructive set theory, CZF with Subset Collection replaced by Exponentiation, in which the Cauchy reals form a set while the Dedekind reals constitute a proper class.
BayesRule: A Markov-Blanket based procedure for extracting a set of probabilistic rules from Bayesian classifiers
Authors: Estevam R. Hruschka,  Jr., M. do Carmo Nicoletti, Vilma A. de Oliveira, Gláucia M. Bressan
Venue: International Journal of Hybrid Intelligent Systems (2008)

A Bayesian network (BN) is a formalism for representing and reasoning about uncertain domains. In BNs the knowledge is represented by a combination of a graph-based structure and probability theory. A particular type of BN known as Bayesian Classifier (BC) aims at classifying a given instance into a discrete class. BCs have been intensively used for knowledge modeling in many different applications and have been the focus of many works related to data mining. Data mining tasks are usually applied to real domains having large number of variables. In such domains, the classifiers tend to be large and complex and consequently are not so easily understood by human beings. This paper proposes an approach for promoting the understandability of the knowledge represented by a BC, by translating it into a more convenient and easily understandable form of representation, that of classification rules. The proposed method named BayesRule uses the concept of Markov-Blanket to obtain a reduced set of rules in relation to both, the number of rules and the number of conditions in the antecedent of a rule. Experiments using seven knowledge domains show that the reduced set of rules extracted from a BC can be smaller and still maintain the BC classification accuracy.
Cooperative Scenario Building in Environmental Planning: Agents, Roles, Architectures
Authors: Domenico Camarda
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

The new complexity of planning knowledge implies innovation of planning methods, in both substance and procedure. In this concern, an increasing number of experiences on multi-agent interactions is today located within processes of spatial and environmental planning. Case studies have not been deliberately set up using formalized and/or predefined multi-agent-system layouts. Therefore, a multi-agent approach and supporting system (MAS) emerged in a bottom-up fashion, driven by the needs demanded by the activities carried out. However, such approaches have not been formalized properly to date. The present paper aims at scanning experiences on the setting up of cooperative multi-agent systems, in order to investigate the potentials of that approach on the interaction of the agents in planning processes.
Revisiting the Karnin, Greene and Hellman Bounds
Authors: Yvo Desmedt, Brian King, Berry Schoenmakers
Venue: Proceedings of the 3rd international conference on Information Theoretic Security (2008)

The algebraic setting for threshold secret sharing scheme can vary, dependent on the application. This algebraic setting can limit the number of participants of an ideal secret sharing scheme. Thus it is important to know for which thresholds one could utilize an ideal threshold sharing scheme and for which thresholds one would have to use non-ideal schemes. The implication is that more than one share may have to be dealt to some or all parties. Karnin, Greene and Hellman constructed several bounds concerning the maximal number of participants in threshold sharing scheme. There has been a number of researchers who have noted the relationship between k-arcs in projective spaces and ideal linear threshold secret schemes, as well as between MDS codes and ideal linear threshold secret sharing schemes. Further, researchers have constructed optimal bounds concerning the size of k-arcs in projective spaces, MDS codes, etc. for various finite fields. Unfortunately, the application of these results on the Karnin, Greene and Hellamn bounds has not been widely disseminated. Our contribution in this paper is revisiting and updating the Karnin, Greene, and Hellman bounds, providing optimal bounds on the number of participants in ideal linear threshold secret sharing schemes for various finite fields, and constructing these bounds using the same tools that Karnin, Greene, and Hellman introduced in their seminal paper. We provide optimal bounds for the maximal number of players for a t out of n ideal linear threshold scheme when t = 3, for all possible finite fields. We also provide bounds for infinitely many t and infinitely many fields and a unifying relationship between this problem and the MDS (maximum distance separable) codes that shows that any improvement on bounds for ideal linear threshold secret sharing scheme will impact bounds on MDS codes, for which there is a number of conjectured (but open) problems.
Application of Tikhonov Regularization to Super-Resolution Reconstruction of Brain MRI Images
Authors: Xin Zhang, Edmund Y. Lam, Ed X. Wu, Kenneth K. Wong
Venue: Medical Imaging and Informatics: 2nd International Conference, MIMI 2007, Beijing, China, August 14-16, 2007 Revised Selected Papers (2008)

This paper presents an image super-resolution method that enhances spatial resolution of MRI images in the slice-select direction. The algorithm employs Tikhonov regularization, using a standard model of imaging process and reformulating the reconstruction as a regularized minimization task. Our experimental result shows improvements in both signal-to-noise ratio and visual quality.
Context-Adaptive User Interface in Ubiquitous Home Generated by Bayesian and Action Selection Networks
Authors: Han-Saem Park, In-Jee Song, Sung-Bae Cho
Venue: Proceedings of the 5th international conference on Ubiquitous Intelligence and Computing (2008)

Recent home theater system requires for users to control various devices such as TV, audio equipment, DVD and video players, and set-top box simultaneously. To obtain the services that a user wants in this situation, user should know the functions and positions of the buttons in several remote controllers. Since it is usually difficult to manipulate them and the number of the devices that we can control increases, we get to confuse more as the ubiquitous home environment is realized. Moreover, there are a lot of mobile and stationary controller devices in ubiquitous computing environment, so that user interface should be adaptive in selecting the functions that user wants and in adjusting the features of UI to fit in a specific controller. To implement the user and controller adaptive interface, we model the ubiquitous home environment and use the modeled context and device information. We have used Bayesian network to get the degree of necessity in each situation. Action selection network uses predicted user situation and necessary devices, and it selects necessary functions in current situation. Selected functions are used to construct adaptive interface for each controller using presentation template. For experiments, we have implemented ubiquitous home environment and generated controller usage log in this environment. We have confirmed the BN predicted user requirements effectively as evaluating the inferred results of controller necessity based on generated scenario. Finally, comparing the adaptive home UI with the fixed one by 14 subjects, we confirm that the generated adaptive UI is more useful for general tasks than the fixed UI.
Circular choosability via combinatorial Nullstellensatz
Authors: Serguei Norine, Tsai-Lien Wong, Xuding Zhu
Venue: Journal of Graph Theory (2008)

A p-list assignment L of a graph G assigns to each vertex v of G a set ${{L}}({{v}})\subseteq \{{{0}}{{,}} {{1}}{{,}}\ldots{{,}}\, {{p}}-{{1}}\}$ of permissible colors. We say G is L-(P, q)-colorable if G has a (P, q)-coloring h such that h(v) &epsis; L(v) for each vertex v. The circular list chromatic number $\chi_{{{c}}{{,}}{{l}}}({{G}})$ of a graph G is the infimum of those real numbers t for which the following holds: For any P, q, for any P-list assignment L with $|{{L}}({{v}})| \geq {{tq}}$, G is L-(P, q)-colorable. We prove that if G has an orientation D which has no odd directed cycles, and L is a P-list assignment of G such that for each vertex v, $|{{L}}({{v}})| = {{d}}^+_{{D}}({{v}})({{2}}{{q}}-{{1}})+{{1}}$, then G is L-(P, q)-colorable. This implies that if G is a bipartite graph, then $\chi_{{{c}}{{,}}{{l}}}({{G}})\leq {{2}}\lceil {{mad}}({{G}})/{{2}}\rceil$, where ${{\rm mad}}({{G}})$ is the maximum average degree of a subgraph of G. We further prove that if G is a connected bipartite graph which is not a tree, then $\chi_{{{c}}{{,}}{{l}}}({{G}})\leq { {mad}}({{G}})$. &copy; 2008 Wiley Periodicals, Inc. J Graph Theory 59: 190&ndash;204, 2008
Object Modelling in the SystemB Industrial Project
Authors: Helen Treharne, Edward Turner, Steve Schneider, Neil Evans
Venue: Proceedings of the 1st international conference on Abstract State Machines, B and Z (2008)

The SystemB project is a two year project at the University of Surrey, funded by AWE plc, and is concerned with bridging the areas of formal methods and object modelling. The project is focused on the CSP ¿ B integrated formal method and increasing its level of tool support so that CSP ¿ B models of Executable UML (xUML) systems can be constructed automatically. The CSP ¿ B models will subject the xUML model to formal analysis prior to generating executable code. We are currently developing a CSP ¿ B model generator within the xUML toolsuite provided by Kennedy Carter Ltd. xUML is used within AWE and we will initially focus on reasoning about xUML state machines. Actions within xUML state machines are defined using the Action Specification Language (ASL). ASL is more low level than the Object Constraint Language; they can execute concurrently, and can also be used in operation definitions. Hence it is a challenge to model formally. In the extended abstract we provide an overview of one ASL to AMN translation pattern being developed and highlight the role of B in the project.
Calculating Invariants as Coreflexive Bisimulations
Authors: Luís S. Barbosa, José N. Oliveira, Alexandra Silva
Venue: Proceedings of the 12th international conference on Algebraic Methodology and Software Technology (2008)

Invariants, bisimulations and assertions are the main ingredients of coalgebra theory applied to software systems. In this paper we reduce the first to a particular case of the second and show how both together pave the way to a theory of coalgebras which regards invariant predicates as types. An outcome of such a theory is a calculus of invariants' proof obligation discharge, a fragment of which is presented in the paper.The approach has two main ingredients: one is that of adopting relations as "first class citizens" in a pointfree reasoning style; the other lies on a synergy found between a relational construct, Reynolds' relation on functions involved in the abstraction theorem on parametric polymorphism and the coalgebraic account of bisimulations and invariants. This leads to an elegant proof of the equivalence between two different definitions of bisimulation found in coalgebra literature (due to B. Jacobs and Aczel Mendler, respectively) and to their instantiation to the classical Park-Milner definition popular in process algebra.
Various Aspects of Finite Quantum Automata
Authors: Mika Hirvensalo
Venue: Proceedings of the 12th international conference on Developments in Language Theory (2008)

Determining the birth date of computer science is a very complicated task and certainly reliant to the standpoint chosen. Some may point out the work of Kurt Gödel [18], Alan Turing [31], and Alonso Church [11], thus locating the appearance of computer science to 1930's. Some want to mention Charles Babbage's engines, some Gottfried Leibniz' Calculus Ratiocinator, and some refer back to the Euclidean algorithm.
Jump-Starting Software Product Lines with Clone Detection
Authors: Andrew Mark Dalgarno
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

Clone detection, the systematic identification ofidentical or near-identical code fragments, is apowerful tool for launching a software product linefrom an existing code base and for maintaining asoftware product line once it is in operation.This session illustrates the concept of clonedetection and places it in a product line context.
Neural Networks and Quantum Neurology: Speculative Heuristic Towards the Architecture of Psychism
Authors: Javier Monserrat
Venue: Proceedings of the 2nd international work-conference on The Interplay Between Natural and Artificial Computation, Part I: Bio-inspired Modeling of Cognitive Tasks (2007)

A new line of investigation known as quantum neurology has been born in recent years. One of its objectives is to accomplish a better explanation of psychism. It basically explains the unity of consciousness, its holistic character, and the indeterminism of its responses. How is this "phenomenological explicandum" explained in classical neurological architecture? After commenting on the properties of classical architecture, we focus on the proposal of Edelman, since we consider it as probably one of the better proposals explaining psychism. The discussion of Edelman's proposal, from the viewpoint of the problem about the "physical support" of psychism in classical physics, allows us to evaluate the strengths of his proposal, as well as the remaining insufficiencies in his explanation. The "heuristic" way of quantum neurology offers a new approach to the "phenomenological explicandum" that does not contradict, but completes classical architecture. The discussion regarding the Hameroff-Penrose hypothesis allows us to propose that the psycho-bio-physical ontology would have an architecture with three levels (or sub-architectures) and two (or three) interface systems among them. This hypothetical architecture permits us to reflect on the production of ontologies, architectures, and functional logics (real and artificial). In any case, the new quantum neurology would suggest new formulations of the psycho-bio-physical ontology by means of the graph theory (classical neurology) and of topology (quantum neurology). 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
Iris Localization Scheme Based on Morphology and Gaussian Filtering
Authors: Feng Gui, Lin Qiwei
Venue: Proceedings of the 2007 Third International IEEE Conference on Signal-Image Technologies and Internet-Based System (2007)

One of the basic techniques in iris recognition system is iris localization. To find a fast, effective and exact iris localization algorithm is the key step of iris recognition. After analyzing the principle, strong points and short points of some common used iris localization methods, a morphological theory based iris localization algorithm was proposed in this paper. Based on the concept of all the object can be regarded as the subset in Euclidean space, and this subset can totally reflect the shape, volume, texture and grey value of the object, so we can apply the morphology operation to identify the feature in different eye area. The proposed iris localization algorithm is as follow: iris image preprocessing at first, where we apply a suitable Gauss filter to lessen the influence of noise. Then apply the morphology operation to extract the inner and outer iris edge, determine the iris area. The proposed algorithm was tested using CASIA iris database(V1.0). And the experimental result shown the method was superior in processing speed under the same localization precision.