ppxscal/embedding_network huggingface dataset:
Constraint-based mining of episode rules and optimal window sizes
Authors: Nicolas Méger, Christophe Rigotti
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

Episode rules are patterns that can be extracted from a large event sequence, to suggest to experts possible dependencies among occurrences of event types. The corresponding mining approaches have been designed to find rules under a temporal constraint that specifies the maximum elapsed time between the first and the last event of the occurrences of the patterns (i.e., a window size constraint). In some applications the appropriate window size is not known, and furthermore, this size is not the same for different rules. To cope with this class of applications, it has been recently proposed in [2] to specifying the maximal elapsed time between two events (i.e., a maximum gap constraint) instead of a window size constraint. Unfortunately, we show that the algorithm proposed to handle the maximum gap constraint is not complete. In this paper we present a sound and complete algorithm to mine episode rules under the maximum gap constraint, and propose to find, for each rule, the window size corresponding to a local maximum of confidence. We show that the extraction can be efficiently performed in practice on real and synthetic datasets. Finally the experiments show that the notion of local maximum of confidence is significant in practice, since no local maximum are found in random datasets, while they can be found in real ones.
Testing database transactions with AGENDA
Authors: Yuetang Deng, Phyllis Frankl, David Chays
Venue: Proceedings of the 27th international conference on Software engineering (2005)

AGENDA is a tool set for testing relational database applications. An earlier prototype was targeted to applications consisting of a single query and included components for populating a database with data suitable for testing the application, generating inputs to the query, and checking relatively simple aspects of the results of executing the query. This paper describes substantial extensions to AGENDA, allowing it to test transactions with multiple queries and with complex intended behavior. The paper introduces a technique for checking complex properties of the database state transition performed by the transaction under test, as well as an improved input generation heuristic. Results of using AGENDA to test three applications with seeded faults are presented.
Evaluating navigational surrogate formats with divergent browsing tasks
Authors: Andruid Kerne, Steven M. Smith, Hyun Choi, Ross Graeber, Daniel Caruso
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Navigational surrogates are representations that stand for information resources within search engine result sets, e?commerce sites, and digital libraries. They also form the basis of personal collections of media, such as web pages. Our hypothesis is that the formats of individual surrogates and collections play an important role in how people use collections. We are particularly interested in processes of information discovery, in which ideas are iteratively reformulated in the context of working with information.To investigate how the representation of navigational surrogates affects how people work with information, we have created a collection of undergraduate psychology curriculum resources in 3 alternative formats: a linear list of textual elements, a spatialized set of textual elements, and a spatialized set of labeled images that have been composited. To evaluate navigation with these surrogate formats during information discovery, we designed divergent browsing tasks, that is, tasks that require assembling information from multiple diverse sources. A within-subjects evaluation indicates that users prefer the spatial labeled images format, and navigate more effectively with it.
A New Active Contour Method Based on Elastic Interaction
Authors: Yang Xiang, Albert C. S. Chung, Jian Ye
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

Image segmentation is defined as partitioning an image into non-overlapping regions based on the intensity or texture. The active contour methods provide an effective way for segmentation, in which the boundary of an object (usually with large image gradient value) is detected by an evolving curve. But, these methods have limitations due to the fact that real images may have objects with complex geometric structures and shapes, and are often corrupted by noise. Developing more robust and accurate active contour methods has been an active research area since the idea of the methods was proposed. In this paper, we propose a new active contour method and apply the method to medical image segmentation. This new method uses a long-ranged interaction between image boundaries and the moving curves, which is inspired by the elastic interaction between line defects in solids (dislocations). The new method is moreefficient and effective, especially in detecting thin, weak and blurred structures such as the images of blood vessels.
Stability and bifurcation analysis on a discrete-time neural network
Authors: Zhaohui Yuan, Dewen Hu, Lihong Huang
Venue: Journal of Computational and Applied Mathematics (2005)

Using techniques developed by Kuznetsov to discrete-time systems, we study the stability of the equilibrium (0, 0) and Neimark-Sacker bifurcation (also called Hopf bifurcation for map) of a discrete-time neural network system. The obtained results are less restrictive and improve upon the existing ones on Neimark-Sacker bifurcation of discrete-time neural network with special classes of transfer functions. The theoretical analyses are verified by numerical simulations. Our results have potential applications in neural networks.
A MULTIMEDIA INTERACTIVE CULTURAL SIMULATION: LEARNING TO ANALYZE AND CONSTRUCT ARGUMENTS
Authors: Beth Adelson, Evelyn Schlusselberg
Venue: ACM SIGCHI Bulletin (1991)

In this short paper we describe an application with an interactive multimedia interface designed to help students develop analytic and argument construction skills in the context of a college level French curriculum. Using the application helps students': bull; French language comprehension. bull; Abilities to generate extended pieces of French text. bull; Psychological and sociological analytical skills: Not only are these skills an important part of a general education, they are central to the kind of cultural adaptation that is part of learning, in a deep sense, a foreign language. bull; Abilities to identify and structure central points when generating arguments.
A Simple Protocol Offering Both Atomic Consistent Read Operations and Sequentially Consistent Read Operations
Authors: Michel Raynal, Matthieu Roy, Ciprian Tutu
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

A concurrent object is an object that can be concurrently accessed by several processes. Two well known consistency criteria for such objects are atomic consistency (also called linearizability) and sequential consistency. Both criteria require that all the operations on the concurrent objects can be totally ordered in such a way that each read operation obtains the last value written into the corresponding object. They differ in the meaning of the word "last" that refers to physical time for atomic consistency, and to logical time for sequential consistency. This paper investigates the merging of these consistency criteria in a multiprocess program. The proposed combination offers two read operations to the processes, namely, an atomic read operation and a sequentially consistent read operation. While the first provides a process with the last "physical" value of an object, the second provides it with a value that is approximate with respect to real-time but whose semantics is perfectly welldefined. A protocol that implements the combination on top of an asynchronous distributed system is described. The protocol provides a better understanding of the similarities and differences between these consistency criteria. Moreover, the protocol is generic in the sense that it can be tailored to provide only one of these consistency criteria.
Semi-Supervised Adapted HMMs for Unusual Event Detection
Authors: Dong Zhang, Daniel Gatica-Perez, Samy Bengio, Iain McCowan
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We address the problem of temporal unusual event detection. Unusual events are characterized by a number of features (rarity, unexpectedness, and relevance) that limit the application of traditional supervised model-based approaches. We propose a semi-supervised adapted Hidden Markov Model (HMM) framework, in which usual event models are first learned from a large amount of (commonly available) training data, while unusual event models are learned by Bayesian adaptation in an unsupervised manner. The proposed framework has an iterative structure, which adapts a new unusual event model at each iteration. We show that such a framework can address problems due to the scarcity of training data and the difficulty in pre-defining unusual events. Experiments on audio, visual, and audio-visual data streams illustrate its effectiveness, compared with both supervised and unsupervised baseline methods.
Architecture of a Multi-Context FPGA Using Reconfigurable Context Memory
Authors: Weisheng Chong, Sho Ogata, Masanori Hariyama, Michitaka Kameyama
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 3 - Volume 04 (2005)

Dynamically-programmable gate arrays (DPGAs) promise lower-cost implementations than conventional FPGAs since they efficiently reuse limited hardware resources in time. One of typical DPGA architectures is a multi-context one. Multi-context FPGAs (MC-FPGAs) have multiple memory bits per configuration bit forming configuration planes for fast switching between contexts. The additional memory planes cause significant overhead in area and power consumption. To overcome the overhead, a fine-grained reconfigurable architecture called reconfigurable context memory (RCM) is presented based on the fact that there are redundancy and regularity in configuration bits between different contexts. Switch blocks are efficiently implemented by using RCM as context decoders and routing switches. By using the RCM in logic blocks, an adaptive multi-context logic block table is introduced where the size of look-up tables and the number of different configuration planes of look-up tables are adaptively determined at each logic block. Moreover, non-volatile ferroelectric-based functional pass-gates are used as components of the RCM to achieve compactness and low static power. Under a constraint of the same number of contexts, an area of the proposed MC-FPGA is 45% of that of the conventional MC-FPGA. In the functional-pass-gate-based evaluation, the area of the proposed MC-FPGA is reduced to 37% of the conventional MC-FPGA one.
Tightening: curvature-limiting morphological simplification
Authors: Jason Williams, Jarek Rossignac
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

Given a planar set S of arbitrary topology and a radius r, we show how to construct an r-tightening of S, which is a set whose boundary has a radius of curvature everywhere greater than or equal to r and which only differs from S in a morphologically-defined tolerance zone we call the mortar. The mortar consists of the thin or highly curved parts of S, such as corners, gaps, and small connected components, while the boundary of a tightening consists of minimum-length loops through the mortar. Tightenings are defined independently of shape representation, and it may be possible to find them using a variety of algorithms. We describe how to approximately compute tightenings for sets represented as binary images using constrained, level-set curvature flow.
A new method for important points extraction
Authors: Dimitar Tyanev, Yulka Petkova
Venue: Proceedings of the 5th international conference on Computer systems and technologies (2004)

Template matching is one of the most important problems in the vision industry. This problem is solving by many different ways, but along with the requirements of high reliability, there are high requirements of run-time decreasing. One of the ways to speed-up the processing is to reduce the number of points (pixels) which take part into the calculations. We propose a new method for important points extraction, based on the equipotential surfaces. By the properly potential threshold these surfaces give a possibility to extract the elements of searched subset of points, which are in conformity with the criterion of D-optimality. The successful fulfillment of this extraction can be made by the properly conditions. For this purpose we propose a method for nonlinear interval transformation of the color function. This transformation leads to the image contrast improvement and thence to the more easily determination of the coordinates (x,y), corresponding to the intersected points of the relief with the surface of the properly chosen potential.
An XML-based document suite
Authors: Dietmar Rösner, Manuela Kunze
Venue: Proceedings of the 19th international conference on Computational linguistics - Volume 2 (2002)

We report about the current state of development of a document suite and its applications. This collection of tools for the flexible and robust processing of documents in German is based on the use of XML as unifying formalism for encoding input and output data as well as process information. It is organized in modules with limited responsibilities that can easily be combined into pipelines to solve complex tasks. Strong emphasis is laid on a number of techniques to deal with lexical and conceptual gaps that are typical when starting a new application.
Factors That Influence Efficiency in Performing ENT Cases: A Qualitative and Quantitative Analysis
Authors: Fatma Pakdil, Timothy N. Harwood
Venue: Journal of Medical Systems (2005)

The aim of this study was to assess procedures with high turnover time to procedure time ratios, estimate the effect of productivity changes on case efficiency, and determine causative factors. We specifically focused on suspension direct microlaryngoscopy (SML) (CPT 31526) cases because significantly greater productivity was possible for these cases in terms of ratios. After determining process times, we developed economic scenarios that employed time-reductions, and then assessed involved staff opinions using brainstorming and cause--effect methods. Improving all process times by 30% achieved up to a 50% improvement in revenue and the return on investment in additional scope equipment occurred within 2 months.
An Incremental Learning Strategy for Support Vector Regression
Authors: Wenjian Wang
Venue: Neural Processing Letters (2005)

Support vector machine (SVM) provides good generalization performance but suffers from a large amount of computation. This paper presents an incremental learning strategy for support vector regression (SVR). The new method firstly formulates an explicit expression of ||W||2 by constructing an orthogonal basis in feature space together with a basic Hilbert space identity, and then finds the regression function through minimizing the formula of ||W||2 rather than solving a convex programming problem. Particularly, we combine the minimization of ||W||2 with kernel selection that can lead to good generalization performance. The presented method not only provides a novel way for incremental SVR learning, but opens an opportunity for model selection of SVR as well. An artificial data set, a benchmark data set and a real-world data set are employed to evaluate the method. The simulations support the feasibility and effectiveness of the proposed approach.
Web Services for Information Retrieval
Authors: Joao Ferreira, Alberto Rodrigues da Silva, Jose Delgado
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

The idea developed in this paper is the creation of standard information retrieval modules in a distributed manner in order to create testing systems to validate methods and algorithms. An investigator in information retrieval can construct a retrieval test system just by integrating different modules and manipulating the input variables of each module.
Understanding entertainment: story and gameplay are one
Authors: Jesse Schell
Venue: Computers in Entertainment (CIE) (2005)

Stories and games, which historically have been considered radically different experiences with different principles of construction, actually have many underlying commonalities. Although we view stories as passive and linear, and games as active and nonlinear, during both types of experience, a participant (or guest) is mentally active, and having a linear experience. The way to gauge the quality of the guest's experience is through a system of interest curves, which measure interest over time, and interest is shown to be made of three components: inherent interest, poetry of presentation, and psychological proximity. Finally, this paper introduces the idea of indirect control, which is a method of secretly controlling the desires of a guest, allowing a designer to imbue a non-linear interactive experience with structures typically used in traditional storytelling.
Low-power branch prediction techniques for VLIW architectures: a compiler-hints based approach
Authors: M. Monchiero, G. Palermo, M. Sami, C. Silvano, V. Zaccaria, R. Zafalon
Venue: Integration, the VLSI Journal (2005)

The paper introduces a dynamic branch prediction scheme suitable for energy-aware Very Long Instruction Word (VLIW) processors. The proposed technique is based on a compiler hint mechanism to filter the accesses to the branch predictor blocks. We define a configurable hint instruction which anticipates some static information about the upcoming branch to reduce the hardware involved in the prediction, thus, the energy consumption. To analyze the effectiveness of the proposed low-power branch prediction scheme, we combined it with some well-known dynamic branch prediction techniques suitable for VLIW processors. The analyzed branch predictors are characterized by simple hardware implementations, matching the low-power characteristics of the target VLIW processors. Experimental results have been carried out on Lx, an industrial 4-issue VLIW architecture.
Application of fuzzy Naive Bayes and a real-valued genetic algorithm in identification of fuzzy model
Authors: Yongchuan Tang, Yang Xu
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

We present a method to identify a fuzzy model from data by using the fuzzy Naive Bayes and a real-valued genetic algorithm. The identification of a fuzzy model is comprised of the extraction of "if-then" rules that is followed by the estimation of their parameters. The involved parameters include those which determine the membership function of fuzzy sets and the certainty factors of fuzzy if-then rules. In our method, as long as the fuzzy partition in the input-output space is given, the certainty factor of each rule is computed with the fuzzy conditional probability of the consequent conditioned on the antecedent by using the fuzzy Naive Bayes, which is a generalization of Naive Bayes. The fuzzy model involves the rules characterized by the highest values of certainty factors. The certainty factor of each rule is the fuzzy conditional probability, and it reflects the inner relationship between the antecedent and the consequent. In order to improve the accuracy of the fuzzy model, the real-valued genetic algorithm is incorporated into our identification process. This process concerns the optimization of the membership functions occurring in the rules. We just involve the parameters of membership function of the fuzzy sets into the real-valued genetic algorithm, since the certainty factor of each rule can be computed automatically. The performance of the model is shown for the backing-truck problem and the prediction of Mackey-Glass time series.
Average Cell Orientation, Shape and Size Estimated from Tissue Images
Authors: Peter J. W. Iles, David A. Clausi, Shannon M. Puddister, G. Wayne Brodland
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Four computer vision algorithms to measure the average orientation, shape and size of cells in images of biological tissue are proposed and tested. These properties, which can be embodied by an elliptical 'composite cell' are crucial for biomechanical tissue models. To automatically determine these properties is challenging due to the diverse nature of the image data, with tremendous and unpredictable variability in illumination, cell pigmentation, cell shape and cell boundary visibility. First, a simple edge detection routine is performed on the raw images to locate cell edges and remove pigmentation variation. The edge map is then converted into the magnitude spatialfrequency domain where the spatial patterns of the cells appear as energy impulses. Four candidate methods that analyze the spatialfrequency data to estimate the properties of the composite cell are presented and compared. These methods are: Least Squares Ellipse Fitting, Correlation, Area Moments and Gabor Filters. Robustness is demonstrated by successful application on a wide variety of real images.
Cryptanalysis of Huang-Chang partially blind signature scheme
Authors: Fangguo Zhang, Xiaofeng Chen
Venue: Journal of Systems and Software (2005)

Partially blind signature is an extension of blind signature that allows a signer to sign a partially blinded message that include pre-agreed information such as expiry date or collateral conditions in the resulting signatures. It is more useful than blind signature in many applications, such as electronic cash (e-cash) system. Recently, Huang and Chang proposed a new design of efficient partially blind signature scheme. However, in this paper, we show that Huang-Chang partially blind signature scheme is not secure, this scheme does not meet the basic property of a partially blind signature, partial blindness: a malicious user (requester) can prepare a special public information a' and then remove the original information a from the signer's signature to obtain a signature with this special information.
Review of "Approches Formelles De La Semantique Naturelle (Formal Approaches to Natural Semantics) by A. Borillo, M. Borillo, L. Farinas del Cerro & J. Virbel"; Laboratoire de Langages et Systemes Informatiques Toulouse, France 1982
Authors: James Reggia, Vicki Roy
Venue: Issue 88 (April 1984) (1984)

This paperback book is a collection of presentations made at the Linguistics Summer School for Computer Scientists at Toulouse, France in September, 1981. It attempts to fill a perceived educational gap in the interdisciplinary area between computer science (especially Al) and human communication (read "traditional linguistics"). All but two of the papers are written in French, with topics ranging from the theoretical/philosophical to descriptions of implemented programs. We summarize two representative papers in this book, and then make some general comments.