ppxscal/embedding_network huggingface dataset:
Distributed Association Rules Mining Based on Pruned Concept Lattices
Authors: Yong Xu, Sen-xin Zhou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

The common association rules mining methods in multiple databases were inefficient due either to larger amount of candidate itemsets for communication overhead or higher times of database scan. Based on discussing the relation between the concept of pruned concept lattice and the representation of frequent itemsets, the Closed Frequent Itemsets of pruned concept lattice was defined. UMPCL, an approximately association rules mining method in horizontally partitioned databases based on multiple PCLs, was proposed. The main ideas of this method are using a frequent concept to represent some few of frequent itemsets to decrease the number of frequent itemsets and rules, and using a slightly lower support for pruning concept lattices before been merged to decrease the size of exchanged messages. The theoretic analysis and experiment show that such method is efficient. Key Word: Data Mining; Association rules; Pruned concept lattice; Distributed
On combinations of propositional dynamic logic and doxastic modal logics
Authors: Renate A. Schmidt, Dmitry Tishkovsky
Venue: Journal of Logic, Language and Information (2008)

We prove completeness and decidability results for a family of combinations of propositional dynamic logic and unimodal doxastic logics in which the modalities may interact. The kind of interactions we consider include three forms of commuting axioms, namely, axioms similar to the axiom of perfect recall and the axiom of no learning from temporal logic, and a Church---Rosser axiom. We investigate the influence of the substitution rule on the properties of these logics and propose a new semantics for the test operator to avoid unwanted side effects caused by the interaction of the classic test operator with the extra interaction axioms.
Multilevel thresholding for image segmentation through a fast statistical recursive algorithm
Authors: S. Arora, J. Acharya, A. Verma, Prasanta K. Panigrahi
Venue: Pattern Recognition Letters (2008)

A novel algorithm is proposed for segmenting an image into multiple levels using its mean and variance. Starting from the extreme pixel values at both ends of the histogram plot, the algorithm is applied recursively on sub-ranges computed from the previous step, so as to find a threshold level and a new sub-range for the next step, until no significant improvement in image quality can be achieved. The method makes use of the fact that a number of distributions tend towards Dirac delta function, peaking at the mean, in the limiting condition of vanishing variance. The procedure naturally provides for variable size segmentation with bigger blocks near the extreme pixel values and finer divisions around the mean or other chosen value for better visualization. Experiments on a variety of images show that the new algorithm effectively segments the image in computationally very less time.
Drawing the Line between Fair Use and Plagiarism for Digital Documents
Authors: Rosa G. Paredes, J. Alfredo Sanchez, Antonio Razo
Venue: Proceedings of the Eighth Mexican International Conference on Current Trends in Computer Science (2007)

CCP (Center for Counter Plagiarism) is a tool designed to aid in the process of verifying digital documents in order to ensure their originality and appropriate usage of references. In this paper we describe the design of an interface for CCP that aims to reduce the burden of determining whether plagiarism exists by locating identical copies in the web as well as noting text that seems original. The main contribution of CCP is a simple yet meaningful graphical user interface that helps in the decision making process when drawing the line between fair use and plagiarism. We also analyze and discuss the preliminary results of performance and usability tests run on CCP.
Experimental study on bioluminescence tomography with multimodality fusion
Authors: Yujie Lv, Jie Tian, Wenxiang Cong, Ge Wang
Venue: Journal of Biomedical Imaging (2007)

To verify the influence of a priori information on the nonuniqueness problem of bioluminescence tomography (BLT), the multimodality imaging fusion based BLT experiment is performed by multiview noncontact detection mode, which incorporates the anatomical information obtained by the microCT scanner and the background optical properties based on diffuse reflectance measurements. In the reconstruction procedure, the utilization of adaptive finite element methods (FEMs) and a priori permissible source region refines the reconstructed results and improves numerical robustness and efficiency. The comparison between the absence and employment of a priori information shows that multimodality imaging fusion is essential to quantitative BLT reconstruction.
On application-level load balancing in FastReplica
Authors: Jangwon Lee, Gustavo de Veciana
Venue: Computer Communications (2007)

In the paper, we consider the problem of distributing large-size content to a fixed set of nodes. In contrast with the most existing end-system solutions to this problem, FastReplica [L. Cherkasova, J. Lee, FastReplica: efficient large file distribution within content delivery network, in: 4th USENIX Symposium on Internet Technologies and Systems (USITS), 2003] does not attempt to build a 'good' overlay structure, but simply uses a fixed mesh overlay structure. This can significantly reduces the overheads incurred in probing, building and maintaining the overlay structure, otherwise. However, FastReplica is oblivious to heterogeneous and dynamic environments. To remedy this problem, we propose an application-level load balancing idea: putting more data on 'good' paths and less on 'bad' ones. Our goal is to study (1) how to make FastReplica adaptive to dynamic environments and (2) how much performance gain can be achieved by exploring the application-level load balancing idea in FastReplica. Toward this end, we provide a theoretical analysis of a simplified model, which provides the insights serving as a basis to develop an implementation of this concept. Then, we present a performance evaluation on a wide-area testbed with a prototype implementation, showing that addition of application-level load balancing in FastReplica can achieve significant speedups by exploiting heterogeneous paths and dynamically adapting to bursty traffic.
Design of fuzzy logic controllers for optimal performance
Authors: Mohamed B. Trabia, William E. McCarthy
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (1998)

Fuzzy logic controllers are gaining a wide recognition in many industrial applications since they are generally robust under varying operating conditions. However, it may be difficult to design a good controller when observations about the system are scarce or when the system has large number of inputs and outputs. These limitations may result in a system with less than optimal performance. This paper presents an algorithm for optimizing the performance of a fuzzy logic controller using nonlinear programming techniques. As an example, this method is applied to the problem of designing a fuzzy logic controller for the navigation of an autonomous vehicle. The results of the computer simulation and comparison with other techniques for designing fuzzy logic controller are presented and discussed.
Broadcast Power Saving Feature for 802.11 Networks
Authors: George Calcev, Steve Emeott, Hrishikesh Gossain
Venue: Proceedings of the Third IEEE International Conference on Wireless and Mobile Computing, Networking and Communications (2007)

feature for IEEE 802.11 based ad hoc networks. In the proposed solution, nodes operating in ad hoc power-save mode are allowed to send short broadcast frames during the Announcement Traffic Indication Message (ATIM) window that occurs during a beacon interval. This is different than the legacy method of forwarding broadcast frames, wherein nodes first announce their intent to transmit a broadcast frame in the ATIM window and then send one or more frames shortly after ATIM window ends. The proposed scheme is helpful since the overhead of transmitting a broadcast ATIM is close to the duration of a short broadcast frame. Simulations show that the proposed scheme provides a substantial reduction in battery consumption compared to the legacy ad hoc power- save operations. Index Terms--Power save, ad hoc mode, 802.11
Proceedings of the 2007 workshop on Automating service quality: Held at the International Conference on Automated Software Engineering (ASE)
Venue: Automated Software Engineering (2007)

Contemporary large-scale, distributed systems are composed from many interdependent artifacts, such as network/bus interconnects, many coordinated local and remote end systems, and multiple layers of software. The composition of these systems demand multiple, simultaneous, predictable performance characteristics, such as end-to-end latency and throughput along with other service concerns, such as reliability, fault tolerance and security. All of these issues become highly volatile in large-scale distributed systems due to the dynamic interplay of the many interconnected parts that are constructed from smaller parts. Automated or partially-automated approaches promise to improve the overall Quality of Service (QoS) provided by the components in these systems. The goal of this one day workshop is to provide a forum for practitioners and researchers to present and discuss emerging techniques and tools for automatically or semi-automatically modeling, specifying and delivering guarantees of service quality in distributed environments. To begin the workshop, a keynote talk will be offered by Dr. Calton Pu of the Georgia Institute of Technology. Presented papers include Position papers describing emerging research opportunities and Works in Progress papers presenting preliminary research and results. Paper topics included: &bull; Model-driven approaches in service provisioning across all phases of the software lifecycle &bull; Domain-specific modeling languages and model transformations for service provisioning &bull; Modeling and analysis of tradeoffs along different service dimensions (i.e., security, reliability, quality, response guarantees) &bull; Role of aspect-oriented program transformation techniques &bull; Reflection and meta-programming as techniques for adaptive provisioning &bull; Tools, models, techniques targeting service guarantees for specific middleware platforms &bull; Frameworks and pattern languages for automating service quality &bull; Certification issues in service quality automation
Simultaneous 4 gestures 6 DOF real-time two-hand tracking without any markers
Authors: Markus Schlattman, Reinhard Klein
Venue: Proceedings of the 2007 ACM symposium on Virtual reality software and technology (2007)

In this paper we present a novel computer vision based handtracking method, which is capable of simultaneously tracking 6+4 degrees of freedom (DOFs) of each human hand in real-time (25 frames per second) with the help of 3 (or more) off-the-shelf consumer cameras. '6+4 DOF' means that the system can track the global pose (6 continuous parameters for translation and rotation) of 4 different gestures. Different studies discovered the need for two-handed interaction to enable an intuitive 3D Human-Computer-Interaction. Previously, using both hands as at least 6 DOF input devices involved the use of either datagloves or markers. Applying our two-hand-tracking we evaluated the use of both hands as input devices for two applications: fly-through exploration of a virtual world and a mesh editing application.
Entropy-like proximal algorithms based on a second-order homogeneous distance function for quasi-convex programming
Authors: Shaohua Pan, Jein-Shan Chen
Venue: Journal of Global Optimization (2007)

We consider two classes of proximal-like algorithms for minimizing a proper lower semicontinuous quasi-convex function f(x) subject to non-negative constraints $$x \geq 0$$ . The algorithms are based on an entropy-like second-order homogeneous distance function. Under the assumption that the global minimizer set is nonempty and bounded, we prove the full convergence of the sequence generated by the algorithms, and furthermore, obtain two important convergence results through imposing certain conditions on the proximal parameters. One is that the sequence generated will converge to a stationary point if the proximal parameters are bounded and the problem is continuously differentiable, and the other is that the sequence generated will converge to a solution of the problem if the proximal parameters approach to zero. Numerical experiments are done for a class of quasi-convex optimization problems where the function f(x) is a composition of a quadratic convex function from $${\mathbb{R}}^ n$$ to $$\mathbb{R}$$ and a continuously differentiable increasing function from $${\mathbb{R}}$$ to $${\mathbb{R}}$$ , and computational results indicate that these algorithms are very promising in finding a global optimal solution to these quasi-convex problems.
Temporal characteristics of top-down modulations during working memory maintenance: An event-related potential study of the n170 component
Authors: Kartik K. Sreenivasan, Jennifer Katz, Amishi P. Jha
Venue: Journal of Cognitive Neuroscience (2007)

We investigated the top-down influence of working memory (WM) maintenance on feedforward perceptual processing within occipito-temporal face processing structures. During event-related potential (ERP) recordings, subjects performed a delayed-recognition task requiring WM maintenance of faces or houses. The face-sensitive N170 component elicited by delay-spanning task-irrelevant grayscale noise probes was examined. If early feedforward perceptual activity is biased by maintenance requirements, the N170 ERP component elicited by probes should have a greater N170 amplitude response during face relative to house WM trials. Consistent with this prediction, N170 elicited by probes presented at the beginning, middle, and end of the delay interval was greater in amplitude during face relative to house WM. Thus, these results suggest that WM maintenance demands may modulate early feedforward perceptual processing for the entirety of the delay duration. We argue based on these results that temporally early biasing of domain-specific perceptual processing may be a critical mechanism by which WM maintenance is achieved.
Role of word of mouth in online store loyalty
Authors: Dinesh K. Gauri, Amit Bhatnagar, Raghav Rao
Venue: Communications of the ACM (2008)

Comparing online store ratings with other e-store loyalty factors.
A multi-stage approach to clustering and imputation of gene expression profiles
Authors: Dorothy S. V. Wong, Frederick K. Wong, Graham R. Wood
Venue: Bioinformatics (2007)

Motivation: Microarray experiments have revolutionized the study of gene expression with their ability to generate large amounts of data. This article describes an alternative to existing approaches to clustering of gene expression profiles; the key idea is to cluster in stages using a hierarchy of distance measures. This method is motivated by the way in which the human mind sorts and so groups many items. The distance measures arise from the orthogonal breakup of Euclidean distance, giving us a set of independent measures of different attributes of the gene expression profile. Interpretation of these distances is closely related to the statistical design of the microarray experiment. This clustering method not only accommodates missing data but also leads to an associated imputation method. Results: The performance of the clustering and imputation methods was tested on a simulated dataset, a yeast cell cycle dataset and a central nervous system development dataset. Based on the Rand and adjusted Rand indices, the clustering method is more consistent with the biological classification of the data than commonly used clustering methods. The imputation method, at varying levels of missingness, outperforms most imputation methods, based on root mean squared error (RMSE). Availability: Code in R is available on request from the authors. Contact: dwong@efs.mq.edu.au
Instrumentation of Time-Shared Systems
Authors: J. E. Shemer, J. B. Robertson
Venue: Computer (1972)

Frequently designers of computer systems have few (if any) convenient means of investigating system per- formance during actual operation. This kind of analy- sis must, of course, take into account user demands and characteristics of the host system's hardware/software complement. Moreover such studies are complicated because they typically involve a large number of variables which, because of their random nature, do not exhibit unique values. The problem is not only to identify criteria which characterize the manner in which the system is used but also to select parameters which are readily measurable. This presentation describes the approaches employed in characterizing and instrumenting the usage and servicing capacity of two operating systems designed for use on Xerox Sigma computer systems. These operating systems are the Batch Time-sharing Monitor (BTM) and the Universal Time-sharing System (UTS). The performance monitors are designed with emphasis on sampling, sorting and ordering of statistical data. Examples of performance monitoring data are presented which were obtained from actual measurements.
Lateralization of the posterior parietal cortex for internal monitoring of self-versus externally generated movements
Authors: Kenji Ogawa, Toshio Inui
Venue: Journal of Cognitive Neuroscience (2007)

Internal monitoring or state estimation of movements is essential for human motor control to compensate for inherent delays and noise in sensorimotor loops. Two types of internal estimation of movements exist: self-generated movements, and externally generated movements. We used functional magnetic resonance imaging to investigate differences in brain activity for internal monitoring of self-versus externally generated movements during visual occlusion. Participants tracked a sinusoidally moving target with a mouse cursor. On some trials, vision of either target (externally generated) or cursor (self-generated) movement was transiently occluded, during which subjects continued tracking by estimating current position of either the invisible target or cursor on screen. Analysis revealed that both occlusion conditions were associated with increased activity in the presupplementary motor area and decreased activity in the right lateral occipital cortex compared to a control condition with no occlusion. Moreover, the right and left posterior parietal cortex (PPC) showed greater activation during occlusion of target and cursor movements, respectively. This study suggests lateralization of the PPC for internal monitoring of internally versus externally generated movements, fully consistent with previously reported clinical findings.
Beauty in Chaos
Authors: Gary Singh
Venue: IEEE Computer Graphics and Applications (2007)

This issue's cover features art by Stefano Menicagli. In this article, Menicagli describes his work and his process.
A Classification of Service Composition Mismatches to Support Service Mediation
Authors: Xitong Li, Yushun Fan, Feng Jiang
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

On building a service-oriented architecture for Grid systems, more and more researches have been focused on service composition. Services, however, are not always exactly compatible and much effort has to be addressed to mediate incompatible services, which is an unavoidable problem and recognized as service composition mismatches. To address it, a classification of composition mismatches is significant and helpful to divide the whole problem into different sub-problems which require corresponding mediators to deal with. However, there exist very few classification approaches specific to such problem and a comprehensive classification is still lacking. In this paper, a classification of most kinds of composition mismatches is introduced. Besides that, several basic protocol mismatch patterns are presented, which can be viewed as basic constructs of existing protocol mismatches. Finally, conclusions and the future work are drawn up.
An Exercise in Automatic Program Verification
Authors: W. Polak
Venue: IEEE Transactions on Software Engineering (1979)

This paper describes in some detail the computer-aided proof of a permutation program obtained using the Stanford Pascal verifier. We emphasize the systematic way in which a proof can be developed from an intuitive understanding of the program. The paper fillustrates the current state of the art in automatic program verification.
A model for understanding collaborative information behavior in context: A study of two healthcare teams
Authors: Madhu C. Reddy, Bernard J. Jansen
Venue: Information Processing and Management: an International Journal (2008)

Collaborative information behavior is an essential aspect of organizational work; however, we have very limited understanding of this behavior. Most models of information behavior focus on the individual seeker of information. In this paper, we report the results from two empirical studies that investigate aspects of collaborative information behavior in organizational settings. From these studies, we found that collaborative information behavior differs from individual information behavior with respect to how individuals interact with each other, the complexity of the information need, and the role of information technology. There are specific triggers for transitioning from individual to collaborative information behavior, including lack of domain expertise. The information retrieval technologies used affect collaborative information behavior by acting as important supporting mechanisms. From these results and prior work, we develop a model of collaborative information behavior along the axes of participant behavior, situational elements, and contextual triggers. We also present characteristics of collaborative information system including search, chat, and sharing. We discuss implications for the design of collaborative information retrieval systems and directions for future work.
SPACER
Authors: Arijit Chakravarty, Jonathan M. Carlson, Radhika S. Khetani, Charles E. DeZiel, Robert H. Gross
Venue: Bioinformatics (2007)

Motivation: Many transcription factors bind to sites that are long and loosely related to each other. De novo identification of such motifs is computationally challenging. In this article, we propose a novel semi-greedy algorithm over the space of all IUPAC degenerate strings to identify the most over-represented highly degenerate motifs. Results: We present an implementation of this algorithm, named SPACER (Separated Pattern-based Algorithm for cis-Element Recognition) and demonstrate its effectiveness in identifying ‘gapped’ and highly degenerate motifs. We compare SPACER's performance against ten motif finders on 42 experimentally defined regulons from Bacillus subtilis, Escherichia coli and Saccharomyces cerevisiae. These motif finders cover a wide range of both enumerative and statistical approaches, including programs specifically designed for prokaryotic and ‘gapped’ motifs. Availability: A Java 1.4 implementation is freely available on the Web at http://genie.Dartmouth.edu/SPACER/ Contact: robert.h.gross@dartmouth.edu Supplementary information: Supplementary data are available at Bioinformatics online.