ppxscal/embedding_network huggingface dataset:
Learning Using a Self-building Associative Frequent Network
Authors: Jin-Guk Jung, Mohammed Nazim Uddin, Geun-Sik Jo
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

In this paper, we propose a novel framework, called a frequent network, to discover frequent itemsets and potentially frequent patterns by logical inference. We also introduce some new terms and concepts to define the frequent network, and we show the procedure of constructing the frequent network. We then describe a new method LAFN (Learning based on Associative Frequent Network) for mining frequent itemsets and potentially patterns, which are considered as a useful pattern logically over the frequent network. Finally, we present a useful application, classification with these discovered patterns from the proposed framework, and report the results of the experiment to evaluate our classifier on some data sets.
Association Mining in Large Databases: A Re-examination of Its Measures
Authors: Tianyi Wu, Yuguo Chen, Jiawei Han
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

In the literature of data mining and statistics, numerous interestingness measures have been proposed to disclose succinct object relationships of association patterns. However, it is still not clear when a measure is truly effective in large data sets. Recent studies have identified a critical property, null-(transaction) invariance, for measuring event associations in large data sets, but many existing measures do not have this property. We thus re-examine the null-invariant measures and find interestingly that they can be expressed as a generalized mathematical mean, and there exists a total ordering of them. This ordering provides insights into the underlying philosophy of the measures and helps us understand and select the proper measure for different applications.
Caching Invalidation Strategies for Supporting 'Weak' Location Dependent Queries
Authors: Yilin Wang, Edward Chan, Wenzhong Li, Sanglu Lu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems Workshops (2008)

Caching technique has been widely used to accelerate data access for Location Dependent Information Services (LDISs) in mobile environments. Many existing LDISs focuse primarily on finding the nearest object. However, for some applications, closest location information is not strictly necessary. In this paper, we study caching invalidation strategies for 'weak' location dependent queries which require only loosen location constraints. First, we introduce a weak location dependent caching scheme to handle such queries. Then, we propose an efficient strategy based on weak valid scope to facilitate cache invalidation. Finally, we evaluate our strategies by simulations. Experimental results show that better cache hit ratios and lower communication cost can be achieved using this scheme.
Enabling XPath Optional Axes Cardinality Estimation Using Path Synopses
Authors: Yury Soldak, Maxim Lukichev
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

The effective support for XML query languages is becoming increasingly important with the emergence of new applications that access large volumes of XML data. The efficient query execution, especially in the distributed case, requires estimating of the path expression cardinalities. In this paper, we propose two novel techniques for the cardinality estimation of the simple path expressions with optional axes (following/preceding): the document order grouping (DG) and the neighborhood grouping (NG). Both techniques summarize the structure of source XML data in compact graph structures (path synopses) and use these summaries for cardinality estimation. We experimentally evaluated accuracy of the techniques, size of the summaries and studied performance of the prototypes. The wide range of source data was used in order to study the behavior of the structures and the area of techniques application.
Mean-Shift-Based Color Tracking in Illuminance Change
Authors: Yuji Hayashi, Hironobu Fujiyoshi
Venue: RoboCup 2007: Robot Soccer World Cup XI (2008)

The mean-shift algorithm is an efficient technique for tracking 2D blobs through an image. Although it is important to adapt the mean-shift kernel to handle changes in illumination for robot vision at outdoor site, there is presently no clean mechanism for doing this. This paper presents a novel approach for color tracking that is robust to illumination changes for robot vision. We use two interleaved mean-shift procedures to track the spatial location and illumination intensity of a blob in an image. We demonstrate that our method enables efficient real-time tracking of the multiple color blobs against changes in illumination, where the illuminace ranges from 58 to 1,300 lx.
The role of fund management institutions in the development of socially responsible investments: an analysis of the Spanish case
Authors: Maria Rosario Balaguer Franch, Maria Angeles Fernandez Izquierdo, Maria Jesus Munoz Torres
Venue: International Journal of Electronic Finance (2008)

Socially Responsible Investment (SRI) refers to investment practices that take into account financial, social and environmental aspects. The objective of this paper is to identify the factors which may influence fund management companies in making a decision to manage and/or market SRI funds and the variables that can determine whether or not this company has an explicit Corporate Social Responsibility (CSR) policy. The results confirm our initial hypothesis that there is a positive relation between fund management companies' internal policy on CSR and the fact that they manage and/or market SRI mutual funds.
Design of a low power and low latency MAC protocol with node grouping and transmission pipelining in wireless sensor networks
Authors: Ching-Wen Chen, Chuan-Chi Weng, Chang-Jung Ku
Venue: Computer Communications (2008)

In wireless sensor networks (WSNs), the strategies of periodical sleep and contention to use the channel for transmission are efficient in terms of power consumption and channel utilization. However, contention and sleep cause other power consumption problems, namely the overhearing of the control packets and increased transmission latency. In this paper, we propose the use of node grouping and transmission pipelining to reduce power consumption and transmission delay. In the design of node grouping, there are several groups in a WSN, where nodes in different groups wake up at different time. Each sensor node is initially set to belong to one of these groups. In contrast to the situation in which all nodes hear the control packets during the contention period, node grouping reduce the number of nodes that overhears the control packets at the same time to reduce power consumption, To establish communication between nodes belonging to different groups, we assign a group table to each node. The group table recodes the group indices of all the neighbors of that node. With looking up a group table in a sensor node, a sender can wake up at the group time of the receiver. As a result, two nodes belonging to different groups can communicate with other. With regard to transmission delay of a multi-hop path in WSNs, if a sender transmits data to the receiver and the receiver cannot send the data to the next receiver right now, the transmission delay increases. To reduce the transmission delay, we propose the transmission pipelining method. Transmission pipelining makes the group number of the nodes on a path to be continuous. Therefore, the sensor node is thus able to transmit data to the sink node pipelining. From the simulation results, when the number of groups is 2, the power consumed in transmitting a byte (mJ/byte) and the transmission delay in our proposed design are better than those of SMAC by about 50%. When the number of groups is 4, although the transmission delay is only a little better than that of SMAC, the power consumed in transmitting a byte in our proposed design is much less than the power consumed in SMAC by 75%.
Efficiently Downdating, Composing and Splitting Singular Value Decompositions Preserving the Mean Information
Authors: Javier Melenchón, Elisa Martínez
Venue: Proceedings of the 3rd Iberian conference on Pattern Recognition and Image Analysis, Part II (2007)

Three methods for the efficient downdating, composition and splitting of low rank singular value decompositions are proposed. They are formulated in a closed form, considering the mean information and providing exact results. Although these methods are presented in the context of computer vision, they can be used in any field forgetting information, combining different eigenspaces in one or ignoring particular dimensions of the column space of the data. Application examples on face subspace learning and latent semantic analysis are given and performance results are provided.
The Value of Information Visualization
Authors: Jean-Daniel Fekete, Jarke J. Wijk, John T. Stasko, Chris North
Venue: Information Visualization: Human-Centered Issues and Perspectives (2008)

Researchers and users of Information Visualization are convinced that it has value. This value can easily be communicated to others in a face-to-face setting, such that this value is experienced in practice. To convince broader audiences, and also, to understand the intrinsic qualities of visualization is more difficult, however. In this paper we consider information visualization from different points of view, and gather arguments to explain the value of our field.
Wavelet Extraction of a Pulse from a Periodic Signal
Authors: Carlo Cattani
Venue: Proceeding sof the international conference on Computational Science and Its Applications, Part I (2008)

A method, based on harmonic wavelet decomposition is proposed for the analysis of signals made by a periodic function and by a pulse (bounded function in space domain). It will be shown that, under some general conditions, a function can be represented in terms of harmonic wavelet and Fourier bases, which are orthogonal each other. By a simple projection into each space component we obtain the periodic (or pulse) component of the signal.
Massively parallel genomic sequence search on the Blue Gene/P architecture
Authors: Heshan Lin, Pavan Balaji, Ruth Poole, Carlos Sosa, Xiaosong Ma, Wu-chun Feng
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

This paper presents our first experiences in mapping and optimizing genomic sequence search onto the massively parallel IBM Blue Gene/P (BG/P) platform. Specifically, we performed our work on mpiBLAST, a parallel sequence-search code that has been optimized on numerous supercomputing environments. In doing so, we identify several critical performance issues. Consequently, we propose and study different approaches for mapping sequence-search and parallel I/O tasks on such massively parallel architectures. We demonstrate that our optimizations can deliver nearly linear scaling (93% efficiency) on up to 32,768 cores of BG/P. In addition, we show that such scalability enables us to complete a large-scale bioinformatics problem --- sequence searching a microbial genome database against itself to support the discovery of missing genes in genomes --- in only a few hours on BG/P. Previously, this problem was viewed as computationally intractable in practice.
Fault Tolerance in Continuous Process Control
Authors: William McGill, Steven Smith
Venue: IEEE Micro (1984)

Increasing the reliability of continuous process control systems means choosing a fault tolerance technique that matches computer hardware capabilities, as well as applications.
Telecommuting and corporate culture: Implications for the mobile enterprise
Authors: Anthony T. Hoang, Robert C. Nickerson, Paul Beckman, Jamie Eng
Venue: Information-Knowledge-Systems Management (2008)

Enterprise mobility includes at home work often called telecommuting. Although telecommuting has been highly touted for a number of years, its adoption has seen varying levels of success. Earlier studies indicated that corporate culture might be a deterrent to the acceptance of the practice. The purpose of this research is to re-investigate the impact of corporate culture on telecommuting. This paper reports the results of a survey of business professionals and managers regarding perceptions of corporate culture toward telecommuting. The main conclusion of the paper is that corporate culture is still a deterrent to telecommuting in many organizations. The results have implications for management, workers, and organizations moving toward a more mobile enterprise.
XML Retrieval by Improving Structural Relevance Measures Obtained from Summary Models
Authors: M. S. Ali, Mariano P. Consens, Shahan Khatchadourian
Venue: Focused Access to XML Documents: 6th International Workshop of the Initiative for the Evaluation of XML Retrieval, INEX 2007 Dagstuhl Castle, Germany, December 17-19, 2007. Selected Papers (2008)

In XML retrieval, there is often more than one element in the same document that could represent the same focused result. So, a key challenge for XML retrieval systems is to return the set of elements that best satisfies the information need of the end-user in terms of both content and structure. At INEX, there have been numerous proposals for how to incorporate structural constraints and hints into ranking. These proposals either boost the score of or filter out elements that have desirable structural properties. An alternative approach that has not been explored is to rank elements by improving their structural relevance. Structural relevance is the expected relevance of a list of elements, based on a graphical model of how users browse elements within documents. In our approach, we use summary graphs to describe the process of a user browsing from one part of a document to another.In this paper, we develop an algorithm to structurally score retrieval scenarios using structural relevance. The XML retrieval system identifies the candidate scenarios. We apply structural relevance with a given summary model to identify the most structurally relevant scenario. This results in improved system performance. Our approach provides a consistent way to apply different user models to ranking. We also explore the use of score boosting using these models.
Virtual campus
Authors: Baki Koyuncu, Pinar Kocabasoglu
Venue: Proceedings of the 8th WSEAS International Conference on Multimedia systems and signal processing (2008)

A menu driven general purpose software package was developed to present a virtual university campus by using web based software techniques. 360 degree panoramic views are generated by image stitching and inclusion of hot spots. Virtual campus tour was formed with QuickTime movies and also in the web by using Adobe Dreamweaver. Visitors had the flexibility to start from anywhere in the campus and go to any destination by using keys on the keyboard.
Plot Query Processing with Wavelets
Authors: Mehrdad Jahangiri, Cyrus Shahabi
Venue: Proceedings of the 20th international conference on Scientific and Statistical Database Management (2008)

Plots are among the most important and widely used tools for scientific data analysis and visualization. With a plot (a.k.a. range group-by query) data are divided into a number of groups, and at each group, they are summarized over one or more attributes for a given arbitrary range. Wavelets, on the other hand, allow efficient computation of (individual) exact and approximate aggregations. With the current practice, to generate a plot over a wavelet-transformed dataset, one aggregate query is executed per each plot point; hence, for large plots (containing numerous points) a large number of aggregate queries are submitted to the database. On the contrary, we redefine a plot as a range group-by query and propose a wavelet-based technique that exploits I/O sharing across plot points to evaluate the plot efficiently and progressively. The intuition behind our approach comes from the fact that we can decompose a plot query into two sets of 1) aggregate queries, and 2) reconstruction queries. Subsequently, we exploit and extend our earlier related studies to effectively compute both quires in the wavelet domain. We also show that our technique is not only efficient as an exact algorithm but also very effective as an approximation method where either the query time or the storage space is limited.
Self-Tested Data Flow Logic: A New Approach
Authors: Richard Illman
Venue: IEEE Design Test (1985)

The article describes a new approach to the self-testing and testability analysis of the types of logic structure encounteredin the data flow paths of computers. The main purpose of the new methodology is to avoid the costs associated with manualor automatic test pattern generation. Instead of relying upon an automated process of scanning through a gatelevel descriptionof the logic, this is an analytical approach applied to a block-level functional description of the logic structure. Thisapproach allows a hybrid test technique to be adopted, based on both random and pseudoexhaustive test styles, and gives faultcoverage figures in excess of 99.5 percent. The methodology is suitable only for highly structured and well-partitioned logicdesigns. 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
Visual Analytics for Supporting Entity Relationship Discovery on Text Data
Authors: Hanbo Dai, Ee-Peng Lim, Hady Wirawan Lauw, Hweehwa Pang
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

To conduct content analysis over text data, one may look out for important named objects and entities that refer to real world instances, synthesizing them into knowledge relevant to a given information seeking task. In this paper, we introduce a visual analytics tool called ER-Explorer to support such an analysis task. ER-Explorer consists of a data model known as TUBE and a set of data manipulation operations specially designed for examining entities and relationships in text. As part of TUBE, a set of interestingness measures is defined to help exploring entities and their relationships. We illustrate the use of ER-Explorer in performing the task of finding associations between two given entities over a text data collection.
Online learning for batch machining control
Authors: V. Marinescu, I. C. Constantin, A. Epureanu, M. Banu, F. B. Marin
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

Batch manufacturing is a widely used technique in today economy. The conceptual change of the way in which the manufacturing machines are controlled is the most important aspect in which is possible to conform with the market demands so their reconfigurability would not affect competitiveness. The problem to be solved in this paper consists in a control method development for predictive control based on prediction of the controlled variables deviation values in respect with their programmed values. The basic idea is to use the data set obtained by monitoring the process during the manufacturing of the previous workpieces and during the current workpiece in order to predict the controlled variable value. The method proposed consists in determining of the causal relation between one controlled variable and the monitored variables and then predicting its value in order to compensate the deviation from the program.
Global E-Government Readiness Report 2004: Towards Access and Opportunity
Authors: Staff
Venue: I-WAYS - The Journal of E-Government Policy and Regulation (2005)

The United Nations prepares this annual report on e-Government for consideration in a much wider context. These are the "disparities" in access to ICT-related developments that are likely to become larger at the current rate of technological advancement. The challenge for development today, the UN believes, "is to find ways and means to surmount the inequality in developments from new technologies. This requires re-visitation of the ways countries think about ICT and e-Government. It needs innovative approaches to government and the public sector, business and the citizen, culture and society. A holistic approach is required which fully exploits the centrality of ICT for the vision of a future knowledge society." The 2004 report focuses on the question of what defines "access," that governs it and where are the countries of the world in terms of their provision of access opportunities. Presented below are excerpts from the report. The full text is available at http://www.unpan.org/e-government4.asp. 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
A simulation environment for estimation of the performance of RSA cages
Authors: M. Gammuto, S. Martelli, C. Trozzi, L. Bragonzoni, A. Russo
Venue: Computers in Biology and Medicine (2008)

Roentgen stereophotogrammetric analysis (RSA) is an important technique for in vivo evaluation of joint kinematics and surgical outcome. However, its accuracy is highly affected by the experimental set-up. In this paper we present a new software environment for assessing the impact of calibration cage design on the accuracy of the reconstruction of 3D points, which can be easily used for preliminary evaluations also by non-expert users. The paper presents methods of the simulator and preliminary results in a clinical standard and custom environment. The software was realized using MATLAB and developed for the PC/Windows operating system. It is freeware under request to authors.
The complexity of unions of disjoint sets
Authors: Christian Glaßer, Alan L. Selman, Stephen Travers, Klaus W. Wagner
Venue: Journal of Computer and System Sciences (2008)

This paper is motivated by the open question whether the union of two disjoint NP-complete sets always is NP-complete. We discover that such unions retain much of the complexity of their single components. More precisely, they are complete with respect to more general reducibilities. Moreover, we approach the main question in a more general way: We analyze the scope of the complexity of unions of m-equivalent disjoint sets. Under the hypothesis that NE
Automatic Generation of Web Service Workflow Using a Probability Based Process-Semantic Repository
Authors: Dong Yuan, Miao Du, Haiyang Wang, Lizhen Cui
Venue: Proceedings of the APWeb/WAIM 2007 DBMAN, WebETrends, PAIS and ASWAN international workshops on Advances in Web and Network Technologies, and Information Management (2007)

Workflow management system has been utilized in the web service environment to make mass of different web services work cooperatively. In this paper, the authors propose a novel automatic generation method of web service workflow and build an e-travel system, which could generate travel process automatically according to passenger's requirements. The e-travel system is a dynamic and self-adaptive virtual travel agency, which uses a probability based process-semantic repository as the foundation. This paper will carefully discuss the process-semantic repository and the automatic generation algorithm of web service workflow based on it. At last, some experiments are presented to evaluate the efficiency of the e-travel system with the process-semantic repository.