ppxscal/embedding_network huggingface dataset:
An ACS-based framework for fuzzy data mining
Authors: Tzung-Pei Hong, Ya-Fang Tung, Shyue-Liang Wang, Min-Thai Wu, Yu-Lung Wu
Venue: Expert Systems with Applications: An International Journal (2009)

Data mining is often used to find out interesting and meaningful patterns from huge databases. It may generate different kinds of knowledge such as classification rules, clusters, association rules, and among others. A lot of researches have been proposed about data mining and most of them focused on mining from binary-valued data. Fuzzy data mining was thus proposed to discover fuzzy knowledge from linguistic or quantitative data. Recently, ant colony systems (ACS) have been successfully applied to optimization problems. However, few works have been done on applying ACS to fuzzy data mining. This thesis thus attempts to propose an ACS-based framework for fuzzy data mining. In the framework, the membership functions are first encoded into binary-bits and then fed into the ACS to search for the optimal set of membership functions. The problem is then transformed into a multi-stage graph, with each route representing a possible set of membership functions. When the termination condition is reached, the best membership function set (with the highest fitness value) can then be used to mine fuzzy association rules from a database. At last, experiments are made to make a comparison with other approaches and show the performance of the proposed framework.
Phonetic Spelling and Heuristic Search
Authors: Benno Stein, Daniel Curatolo
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)

We introduce a new approach to spellchecking for languages with extreme phonetic irregularities. The spelling for such languages can be significantly improved if knowledge about pronunciation and sound becomes the central part of the spelling algorithm. However, given a weak phoneme-grapheme-correspondence the standard spelling algorithms, which are rule-based or edit-distance-based, are severely limited in their phonetic capabilities. A production approach to spelling can overcome the limitations---but suffers from its search space size. We describe in this paper the main building blocks to tackle this problem with heuristic search. Our ideas have been operationalized in the SMARTSPELL algorithm, with impressive results related to spelling correction and runtime.
Industrial Process Sensors, 1st edition
Authors: David M. Scott
Venue:  (2007)

As manufacturing processes become more complex, new types of sensors are needed to run them. Typical processes now require measurement of film thickness, particle size, solids concentration, and contamination detection. Industrial Process Sensors explores the physical theory, design, and final implementation of sensors used to control industrial manufacturing processes. Based on the authors experience in the chemical process industry, this book also examines measurement sensitivity and illustrates real-world applications by providing results from actual plant installations of advanced process sensors. 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
Collaboration support by co-ownership of documents
Authors: Michael Prilla, Carsten Ritterskamp
Venue: Proceeding of the 2006 conference on Cooperative Systems Design: Seamless Integration of Artifacts and Conversations -- Enhanced Concepts of Infrastructure for Communication (2006)

The concept of co-ownership well-known from real-life collaboration is a valuable means to support work with documents in groupware systems. In this paper, we present an approach leading to the practical appliance of co-ownership in a groupware system and show how this concept can be used to foster collaboration. Our efforts are supported by a review of related systems and concepts as well as a requirements analysis based on scenarios.
Genetic learning of fuzzy rules based on low quality data
Authors: Luciano Sánchez, Inés Couso, Jorge Casillas
Venue: Fuzzy Sets and Systems (2009)

Genetic fuzzy systems (GFS) are based on the use of genetic algorithms for designing fuzzy systems, and for providing them with learning and adaptation capabilities. In this context, fuzzy sets represent linguistic granules of information, contained in the antecedents and consequents of the rules, whereas the data used in the genetic learning is assumed to be crisp. GFS seldom deal with fuzzy-valued data. In this paper we address this problem, and propose a set of techniques that can be incorporated to different GFS in order to learn a knowledge base (KB) from interval and fuzzy data for regression problems. Details will be given about the representation of non-standard data with fuzzy sets, about the needed changes in the reasoning method of the fuzzy rule-based system, and also about a new generalization of the mean squared error to vague data. In addition, we will show that the learning process requires a genetic algorithm that must be capable of optimizing a multicriteria fitness function, containing both crisp and interval-valued criteria. Lastly, we benchmark our procedures with some machine learning related datasets and a real-world problem of marketing, and the techniques proposed here are shown to improve the generalization properties of other KBs obtained from crisp training data.
Microsoft Expression Web Plain & Simple
Authors: Katherine Murray
Venue:  (2007)

You ll work with advanced design technologies and discover the powerful and easy-to-use Web design experience that Expression Web delivers. You'll learn how to create professional-looking Web pages and work with powerful, but easy-to-use design tools and task panes. You ll also learn how to build templates, work with cascading style sheets and other design features that help you precisely control your work, and take advantage of built-in support for today s Web standards. With PLAIN & SIMPLE, you don't have to wade through superfluous details. This easy-to-use book delivers fast, precise information exactly how and when you need it!Covers common tasks for creating standards-compliant, professional-looking Web sites with Expression WebDelivers concise answers in visual format; ideal for beginning-level users of Expression Web 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
Automatic Animation Generation of a Teleoperated Robot Arm
Authors: Khaled Belghith, Benjamin Auder, Froduald Kabanza, Philipe Bellefeuille, Leo Hartman
Venue: Proceeding of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence (2008)

In this paper we describe the Automatic Task Demonstration Generator (ATDG), a system implemented into a software prototype for teaching the operation of a robot manipulator deployed on the International Space Station (ISS). The ATDG combines the use of path planning and camera planning to take into account the complexity of the manipulator, the limited direct view of the ISS exterior, and the unpredictability of lighting conditions in the workspace. The path-planning algorithm not only avoids obstacles in the workspace as is normal for a path-planner, but in addition takes into account the position of corridors for safe operations and the placement of cameras on the ISS. The camera planner is then invoked to find the right arrangement of cameras to follow the manipulator on its trajectory. This allows the on-the-fly production of useful and pedagogical task demonstrations to help the student carry out tasks involving the manipulation of the robot on the ISS. Even if the system has been developed for robotic manipulations, it could be used for any application involving the filming of unpredictable complex scenes.
Betti numbers and minimal free resolutions for multi-state system reliability bounds
Authors: Eduardo Sáenz-de-Cabezón, Henry P. Wynn
Venue: Journal of Symbolic Computation (2009)

Every coherent system has a monomial ideal associated with it and the knowledge of its multigraded Betti numbers provides reliability bounds for the corresponding system, which are the tightest among a certain class of such bounds. Some alternative methods for computing the multigraded Betti numbers are used in this paper and applied in the study of reliability. We obtain special results for well known examples and show that computational commutative algebra techniques can be used beneficially in the reliability analysis of systems of different types.
Selected Contributions in Data Analysis and Classification, 1st edition
Authors: Paula Brito, Paula Brito, Patrice Bertrand, Guy Cucumel, Francisco De Carvalho
Venue:  (2007)

This volume presents recent methodological developments in data analysis and classification. A wide range of topics is covered that includes methods for classification and clustering, dissimilarity analysis, graph analysis, consensus methods, conceptual analysis of data, analysis of symbolic data, statistical multivariate methods, data mining and knowledge discovery in databases. Besides structural and theoretical results, the book presents a wide variety of applications, in fields such as biology, micro-array analysis, cyber traffic, bank fraud detection, and text analysis. Combining new methodological advances with a wide variety of real applications, this volume is certainly of special value for researchers and practitioners, providing new analytical tools that are useful in theoretical research and daily practice in classification and data analysis.
Uses of Data-Logger in Kitchen Science: Producing Panacea of the Ginger-Milk Recipe
Authors: Sun-wai Leo Fung
Venue: Proceeding of the 2007 conference on Supporting Learning Flow through Integrative Technologies (2007)

Ginger-milk is a kind of Chinese domestic dessert made up of ginger juice and hot milk only. However, no one can guarantee that the pudding must be synthesized or can be coagulated successfully every time. This paper aims to report on an attempt of a group of Primary Six students who wanted to find out a recipe of the panacea of making ginger-milk during their investigation activity with the aid of data-loggers. The project was trying to demonstrate the effectiveness of integrating information technology (IT) in facilitating scientific investigations in the school setting. The integration also helped the participating students to understand the relationship between information technology and kitchen science, and how the former supports the science learning and teaching.
Range parameterized types: use-site variance without the existential questions
Authors: Bruno De Fraine
Venue: Proceedings of the 11th International Workshop on Formal Techniques for Java-like Programs (2009)

Use-site variance approaches such as Java wildcards allows to flexibly derive many co- and contravariant types from one generic class definition. Safety is achieved by restricting the access to members of the parameterized types, but the definition of proper access rules is complicated by the possible nesting of types. Existing approaches for use-site variance relate parameterized classes to bounded existential types and employ a conversion of the type parameters to fresh type variables in order to type an operation. This technique only indirectly explains the operations of a parameterized class and confronts the programmer with type variables which are introduced by the compiler for the purpose of type checking. In this paper, we propose a more straightforward, uniform and powerful mechanism to systematically address the access restrictions of parameterized types with use-site variance. Parameterized classes receive two type values for each type parameter, and the operations may be determined by simply substituting these values in covariant resp. contravariant positions. The two type values may be interpreted as the bounds of a type range, and we define a safe and flexible variant subtype relation based on range containment. With the exception of wildcard capture, our approach supports all of the common features of other use-site variance models.
Distributed listening: a parallel processing approach to automatic speech recognition
Authors: Yolanda McMillian, Juan E. Gilbert
Venue: Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers (2008)

While speech recognition systems have come a long way in the last thirty years, there is still room for improvement. Although readily available, these systems are sometimes inaccurate and insufficient. The research presented here outlines a technique called Distributed Listening which demonstrates noticeable improvements to existing speech recognition methods. The Distributed Listening architecture introduces the idea of multiple, parallel, yet physically separate automatic speech recognizers called listeners. Distributed Listening also uses a piece of middleware called an interpreter. The interpreter resolves multiple interpretations using the Phrase Resolution Algorithm (PRA). These efforts work together to increase the accuracy of the transcription of spoken utterances.
Semi-Stable Semantics
Authors: Martin Caminada
Venue: Proceeding of the 2006 conference on Computational Models of Argument: Proceedings of COMMA 2006 (2006)

In this paper, we examine an argument-based semantics called semi-stable semantics. Semi-stable semantics is quite close to traditional stable semantics in the sense that every stable extension is also a semi-stable extension. One of the advantages of semi-stable semantics is that there exists at least one semi-stable extension. Furthermore, if there also exists at least one stable extension, then the semi-stable extensions coincide with the stable extensions. This, and other properties, make semi-stable semantics an attractive alternative for the more traditional stable semantics, which until now has been widely used in fields such as logic programming and answer set programming.
A cut-off phenomenon in location based random access games with imperfect information
Authors: Hazer Inaltekin, Mung Chiang, H. Vincent Poor
Venue: Proceedings of the 4th Annual International Conference on Wireless Internet (2008)

This paper analyzes the behavior of selfish transmitters under imperfect location information. The scenario considered is that of a wireless network consisting of selfish nodes that are randomly distributed over the network domain according to a known probability distribution, and that are interested in communicating with a common sink node using common radio resources. In this scenario, the wireless nodes do not know the exact locations of their competitors but rather have belief distributions about these locations. Firstly, properties of the packet success probability curve as a function of the node-sink separation are obtained for such networks. Secondly, a monotonicity property for the best-response strategies of selfish nodes is identified. That is, for any given strategies of competitors of a node, there exists a critical node-sink separation for this node such that its best-response is to transmit when its distance to the sink node is smaller than this critical threshold, and to back off otherwise. Finally, necessary and sufficient conditions for a given strategy profile to be a Nash equilibrium are provided.
On traced monoidal closed categories
Authors: Masahito Hasegawa
Venue: Mathematical Structures in Computer Science (2009)

The structure theorem of Joyal, Street and Verity says that every traced monoidal category <private-char><inline-graphic mime-subtype="gif" xlink="S0960129508007184_char1"/></private-char> arises as a monoidal full subcategory of the tortile monoidal category Int<private-char><inline-graphic mime-subtype="gif" xlink="S0960129508007184_char1"/></private-char>. In this paper we focus on a simple observation that a traced monoidal category <private-char><inline-graphic mime-subtype="gif" xlink="S0960129508007184_char1"/></private-char> is closed if and only if the canonical inclusion from <private-char><inline-graphic mime-subtype="gif" xlink="S0960129508007184_char1"/></private-char> into Int<private-char><inline-graphic mime-subtype="gif" xlink="S0960129508007184_char1"/></private-char> has a right adjoint. Thus, every traced monoidal closed category arises as a monoidal co-reflexive full subcategory of a tortile monoidal category. From this, we derive a series of facts for traced models of linear logic, and some for models of fixed-point computation. To make the paper more self-contained, we also include various background results for traced monoidal categories.
The Mortar-Discontinuous Galerkin Method for the 2D Maxwell Eigenproblem
Authors: Annalisa Buffa, Ilaria Perugia, Tim Warburton
Venue: Journal of Scientific Computing (2009)

We consider discontinuous Galerkin (DG) approximations of the Maxwell eigenproblem on meshes with hanging nodes. It is known that while standard DG methods provide spurious-free and accurate approximations on the so-called k-irregular meshes, they may generate spurious solutions on general irregular meshes. In this paper we present a mortar-type method to cure this problem in the two-dimensional case. More precisely, we introduce a projection based penalization at non-conforming interfaces and prove that the obtained DG methods are spectrally correct. The theoretical results are validated in a series of numerical experiments on both convex and non convex problem domains, and with both regular and discontinuous material coefficients.
Note: Domination, radius, and minimum degree
Authors: Michael A. Henning, Simon Mukwembi
Venue: Discrete Applied Mathematics (2009)

We prove sharp bounds concerning domination number, radius, order and minimum degree of a graph. In particular, we prove that if G is a connected graph of order n, domination number @c and radius r, then 23r@?@c@?n-43r+23. Equality is achieved in the upper bound if, and only if, G is a path or a cycle on n vertices with n=4(mod6). Further, if G has minimum degree @d>=3 and r>=6, then using a result due to Erdos, Pach, Pollack, and Tuza [P. Erdos, J. Pach, R. Pollack, Z. Tuza, Radius, diameter, and minimum degree. J. Combin. Theory B 47 (1989), 73-79] we show that @c@?n-23(r-6)@d.
Validation of Watershed Regions by Scale-Space Statistics
Authors: Tomoya Sakai, Atsushi Imiya
Venue: Proceedings of the Second International Conference on Scale Space and Variational Methods in Computer Vision (2009)

This paper shows a potential use of scale space for statistical validation of watershed regions of a greyscale image. The watershed segmentation has difficulty in distinguishing valid watershed regions associated with real structures of the image from invalid random regions due to background noise. In this paper, a hierarchy of watershed regions is established by following merging process of the regions in a Gaussian scale space. The distribution of annihilation scales (lives) of the regional minima is investigated to statistically judge the regions as being valid or not. Recursive validation using the hierarchy prevents oversegmentation due to the randomness.
Low-latency anonymity systems: statistical attacks and new applications
Authors: Brian Levine
Venue:  (2008)

In this dissertation, we study low-latency anonymity protocols and systems. Such systems enable anonymous communication where latency is not tolerated well, such as browsing the web, but also introduce new vulnerabilities not present in systems that hide timing information. We examine one such vulnerability, the profiling attack, as well as possible defenses to such an attack. We also examine the feasibility of using low-latency anonymity techniques to support a new application, Voice over IP (VoIP). First, we show that profiling attacks on low-latency anonymity systems are feasible. The attack we study is based upon pre-constructing profiles of communication and identifying the sender of encrypted, anonymized traffic on the basis of these profiles. Second, we present results from a large-scale measurement study and the application of this attack to the measured data. These results indicate that profiling is practical across sets of thousands of possible initiators and that such profiles remain valid for weeks at a time. Third, we evaluate defenses against the profiling attack and their effects upon system performance. We then demonstrate the feasibility of supporting anonymous VoIP; specifically, we show supporting measurement data and outline the changes current anonymity systems would require to carry such traffic. We also show how such systems are potentially more vulnerable to known attacks and start to examine the tradeoffs between VoIP performance and anonymity inherent in such systems.
Unified OTP Cryptosystem with Authentication and Secrecy
Authors: Osamu Atsumi, Shogo Hayashida, Rikio Maruta
Venue: Proceeding of the 2006 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the fifth SoMeT_06 (2006)

A Unified OTP Cryptosystem with Authentication and Secrecy, which is theoretically unbreakable and inherently high speed, is newly proposed in this paper. The system is featured in the use of One Time Pad (here-in-after called as OTP) made from intrinsic random number sequences derived from the natural phenomenon. The other unique feature of the proposed system is to establish cryptograph communication path between each user and an authentication server (here-in-after called as Auth Server), not between users directly. Authentication is first established between a user who initiates communication and Auth Server through internet, and then encrypted message transmission will follow. The other user who wants to receive delivered messages also establishes authentication with Auth Server in the same way and encrypted message reception will follow. The two users do not need to share any secret key for establishing a secure communication channel in the proposed system. Therefore, any key information leak from one party does not jeopardize authentication and communication capabilities of the others. This proposed cryptosystem belongs to the stream-cipher method whose security level was considered low as compared to the block-cipher method. With the use of OTP made from intrinsic random number sequences derived from the natural phenomenon, the system becomes theoretically unbreakable, and the drawback mentioned above is completely removed. Because of the bit-by-bit encryption process, the system is very simple and shows ultimate low latency. The simplicity allows realization of the system without special LSI functions but with small scale software only. With the merits described above, the unified authentication and secrecy process can be easily applied to e-commerce applications using mobile phones which are very sensitive to the increase of complexity and power consumption. Authors examined a possible enhancement of the existing e-commerce systems to allow mobile phones as the terminal device.