ppxscal/embedding_network huggingface dataset:
Issues in pattern mining and their resolutions
Authors: Tongyuan Wang, Bipin C. Desai
Venue: Proceedings of the 2nd Canadian Conference on Computer Science and Software Engineering (2009)

Frequent pattern mining over large database is fundamental to many data mining applications. Various approaches have been proposed for pattern mining with respectable computational performance. However, our study has found some fundamental problems, such as overfitting and probability anomaly, which have not been well addressed. We believe that, analysing and resolving these problems would certainly improve the reliability and usefulness of mining approaches. This paper reports the first part of our study of these fundamental problems, how they are interrelated, and how they impact the correctness and reliability of pattern mining. We also present our proposal to reformulate the measure "support", to resolve the probability anomaly, and to quantify the overfitting degrees, followed by a brief introduction and summary of our proposal to resolve other problems under investigations.
Guide to Tactical Perimeter Defense, 1st edition
Authors: Randy Weaver
Venue:  (2007)

Guide to Tactical Perimeter Defense examines the critical defensive technologies needed to secure network perimeters. Written to map to the Security Certified Network Specialist certification (SCO-451), this book includes coverage of network security threats and goals, advanced TCP/IP concepts, router security, intrusion detection, firewall design and configuration, IPSec and virtual private network (VPN) design, and wireless network design and security. 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
Experience of XML-Based Source Code Representation with Parsing Actions
Authors: Kazuaki Maeda
Venue: Proceeding of the 2007 conference on New Trends in Software Methodologies, Tools and Techniques: Proceedings of the sixth SoMeT_07 (2007)

This paper describes PALEX, a new source code representation in XML which contains parsing actions and lexical formatting information. Once a compiler finishes analyzing source code, it can record a list of parsing actions (shift, reduce and reading a token) during a compiling process. PALEX contains the recorded parsing actions and also lexical formatting information, white spaces and comments. It has two features as a source code representation in XML. The first is that it is independent of programming languages. The second is that the original source code can be restored from the PALEX code. For a prototype implementation, the Java compiler GCJ was modified. Syntax rules and lexical definitions are prepared for development of software tools which read the PALEX code and play back the parsing actions. An experiment was designed and the result shows that the size of the generated PALEX code is very large. However, the XML-based source code representation together with parsing actions offsets the cost of the large storage space.
A new target detection algorithm: spectra sort encoding
Authors: Qinjun Wang, Qizhong Lin, Mingxiao Li, Qingjiu Tian
Venue: International Journal of Remote Sensing (2009)

A new target detection algorithm named the spectra sort encoding (SSE) algorithm is presented in this paper. It has two steps. Firstly, relative error (cErr) between the reference and image spectra is calculated. When cErr is greater than the relative error defined by the user (rErr), the current pixel is regarded as none-target and encoded as zero. Otherwise, the second step is executed to confirm whether or not the current pixel is target. In this second step, the similarity between reference and image spectra is calculated by sorting them respectively. When the similarity is greater than the identification error (the least error limits between reference and image spectra) defined by the user, the current pixel is encoded as one; otherwise, it is encoded as zero. A detailed description is provided of the backgrounds and principles of SSE, and its accuracy is evaluated using multiple categories. Experiments indicated that when the identification error is 15%, the mean accuracy of SSE is 95%, which is 41.9% higher than that of constrained energy minimization (CEM) and 46.9% higher than that of spectrally second-order derivative (SSD). Results of target detection experiments using Enhanced Thematic Mapper Plus (ETM+) and Hyperion images revealed that it could be used in both multispectral and hyperspectral remote sensing.
Optimization of copper treatments in organic viticulture by using a web-based decision support system
Authors: Tsvi Kuflik, Daniele Prodorutti, Andrea Frizzi, Yochai Gafni, Shoham Simon, Ilaria Pertot
Venue: Computers and Electronics in Agriculture (2009)

This paper presents Coptimizer, a model-driven decision support system designed to help growers to optimize and track the use of copper-based fungicides against grapevine downy mildew in European organic viticulture, where the use of only a fixed amount of copper per year per hectare is permitted. Copper is a preventive fungicide allowed in organic agriculture that is active only at the application site (i.e. it is non-systemic), so that new plant growth results in unprotected tissues. In areas where disease incidence is high, organic farmers usually apply weekly copper treatments at the risk of exceeding the fixed threshold. The capability of Coptimizer for not exceeding the copper threshold was evaluated in simulation using historical data and tested in two experiments under field conditions during 2008. The results show that by using Coptimizer growers could be able to maintain the same level of protection as that gained by traditional application schedule while applying only half the amount of the fungicide.
Symposium on Point-Based Graphics 2007
Authors: Mario Botsch, Renato Pajarola, Baoquan Chen, Matthais Zwicker
Venue:  (2007)

###############################################################################################################################################################################################################################################################
A method to implement effective My-page service system using three-dimensional vectors
Authors: Masayuki Kessoku, Kazuhiko Tsuda, El-Sayed Atlam, Kazuhiro Morita, Masao Fuketa, Jun-ichi Aoe
Venue: International Journal of Computer Applications in Technology (2009)

This paper proposes a method to construct My-page, which is an effective one-to-one-marketing method for internet service providers. In conventional methods, customer preference and market information are managed with two-dimensional vectors of customer and preference category axes. In this proposed method, we add time axis to make it three-dimensional vectors in order to manage the preference transitions and the market trends. One of the problems of three-dimensional vectors is its huge volume of information. In order to solve this problem, the three-dimensional vector was compressed using the MPEG algorithm. As a result, the amount of data could be compressed to less than 5&#37;, and the problem was solved. Furthermore, we have found a few trend leaders in the groups, which confirm that there is a possibility to make appropriate recommendations to the other group member based on the transitions of the trend leaders.
Pairwise Spin-Contamination Correction Method and DFT Study of MnH and H2 Dissociation Curves
Authors: Satyender Goel, Artëm E. Masunov
Venue: Proceedings of the 9th International Conference on Computational Science (2009)

A clear advantage of broken symmetry (BS) unrestricted density functional theory DFT is qualitatively correct description of bond dissociation process, but its disadvantage is that spin-polarized Slater determinant is no longer a pure spin state (a.k.a. spin contamination). We propose a new approach to eliminate the spin-contamination, based on canonical Natural Orbitals (NO). We derive an expression to extract the energy of the pure singlet state given in terms of energy of BS DFT solution, the occupation number of the bonding NO, and the energy of the higher state built on these bonding and antibonding NOs (as opposed to self-consistent Kohn-Sham orbitals). Thus, unlike spin-contamination correction schemes by Noodleman and Yamaguchi, spin-correction is introduced for each correlated electron pair individually and thus expected to give more accurate results. We validate this approach on two examples, a simple diatomic H2 and transition metal hydride MnH.
Exploring schema repositories with schemr
Authors: Kuang Chen, Jayant Madhavan, Alon Halevy
Venue: Proceedings of the 35th SIGMOD international conference on Management of data (2009)

Schemr is a schema search engine, and provides users the ability to search for and visualize schemas stored in a metadata repository. Users may search by keywords and by example -- using schema fragments as query terms. Schemr uses a novel search algorithm, based on a combination of text search and schema matching techniques, as well as a structurally-aware scoring metric. Schemr presents search results in a GUI that allows users to explore which elements match and how well they do. The GUI supports interactions, including panning, zooming, layout and drilling-in. We demonstrate schema search and visualization, introduce Schemr as a new component of the information integration toolbox, and discuss its benefits in several applications.
Short Note: An immersed boundary method for restricted diffusion with permeable interfaces
Authors: Huaxiong Huang, Kazuyasu Sugiyama, Shu Takagi
Venue: Journal of Computational Physics (2009)

@?@?@?
Plenary lecture 5: synthesis and applications of some nanostructured materials
Authors: Tarek Abdel-Fattah
Venue: Proceedings of the 1st WSEAS international conference on Nanotechnology (2009)

Nanostructure materials possess novel properties characteristic of neither the molecular nor the bulk solid state with sized dependent behavior. Nanoporous materials can be synthesized either by bottom-up technique or top-bottom technique. The resultants, nonoporous materials, are characterized by well-defined pore and/or cavities size in nanometer scale, with unique molecular sieving capabilities and ultrahigh surface area: suitable as hosts and templates for fabrication of nanoscale devices and nanomaterials. Supported nanoporous materials play a very important role in catalysis. We will describe synthesis and characterization of improved heterogeneous catalysts for ring-opening polymerization based on metal-substituted hexagonal nanoporous silica. We will discuss the fundamental principle for designing synthesis and characterization of nanoporous adsorbents for environmental remediation. For example, lead ions in soils and stormwater run-off from small arms firing range (SAFR) is a concern of national proportion. Various adsorption technologies have been studied to solve the problem of lead species releases to the environment. Also, we will present a study to support worldwide research efforts to obtain drinking water with arsenic levels below 10 part per billion (ppb), using different adsorbents modified with iron species. Using template technique, we synthesized carbon nanotubes and novel multi-wall metal oxides nanotubes, such as metal oxides like hafnium oxide (hafnia, HfO2), zirconium oxide (zirconia, ZrO2) and semiconducting zinc oxide (ZnO). These metal oxide tubes are important materials that can be used as gas sensors, catalysts, optoelectronics, and high-k dielectrics in microelectronics.
3D morphing using strain field interpolation
Authors: Han-Bing Yan, Shi-Min Hu, Ralph R. Martin
Venue: Journal of Computer Science and Technology (2007)

In this paper, we present a new technique based on strain fields to carry out 3D shape morphing for applications in computer graphics and related areas. Strain is an important geometric quantity used in mechanics to describe the deformation of objects. We apply it in a novel way to analyze and control deformation in morphing. Using position vector fields, the strain field relating source and target shapes can be obtained. By interpolating this strain field between zero and a final desired value we can obtain the position field for intermediate shapes. This method ensures that the 3D morphing process is smooth. Locally, volumes suffer minimal distortion, and no shape jittering or wobbling happens: other methods do not necessarily have these desirable properties. We also show how to control the method so that changes of shape (in particular, size changes) vary linearly with time.
The Study on Reasonability of Retrospective Power
Authors: Jun Qian, Chun-quan Ou, Tao Wang, Ping-yan Chen
Venue: Proceedings of the 2009 Second International Conference on Information and Computing Science - Volume 04 (2009)

There is an increasingly concern with the use of retrospective power. Some researchers suggested calculating the retrospective power after conducting hypothesis testing, particularly in meta-analysis. They considered that retro-spective power can be used to determine whether the sample size is sufficient in an experiment and that the combination of retrospective power and prior power can enhance the power of current and future studies. Furthermore, the commonly used statistical software packages, such as SPSS and SAS, provide retrospective power analysis in some modules. However, some pointed out the abuse of retrospective power. In this study, we used Monte Carlo technique to estimate the retrospective power in t-test and ANOVA to address this issue. We found that four styles of retrospective powers, including observed power, plug-in power, unbiased power and median power, are highly positive correlated. They dispersed distribute in the range of (0.05, 1). The width of 25th-75th percentages achieved 0.38-0.54, the standard deviations 0.25-0.30 for 0.7 of the statistical power. However, they all monotonously decreased in respect to P value. The retrospective powers were negatively correlated with P values with Pearson coefficients ranged from -0.753 to -0.831 (p
Generating Empirically Optimized Composed Matrix Kernels from MATLAB Prototypes
Authors: Boyana Norris, Albert Hartono, Elizabeth Jessup, Jeremy Siek
Venue: Proceedings of the 9th International Conference on Computational Science: Part I (2009)

The development of optimized codes is time-consuming and requires extensive architecture, compiler, and language expertise, therefore, computational scientists are often forced to choose between investing considerable time in tuning code or accepting lower performance. In this paper, we describe the first steps toward a fully automated system for the optimization of the matrix algebra kernels that are a foundational part of many scientific applications. To generate highly optimized code from a high-level MATLAB prototype, we define a three-step approach. To begin, we have developed a compiler that converts a MATLAB script into simple C code. We then use the polyhedral optimization system Pluto to optimize that code for coarse-grained parallelism and locality simultaneously. Finally, we annotate the resulting code with performance-tuning directives and use the empirical performance-tuning system Orio to generate many tuned versions of the same operation using different optimization techniques, such as loop unrolling and memory alignment. Orio performs an automated empirical search to select the best among the multiple optimized code variants. We discuss performance results on two architectures.
Plenary lecture 2: agent based semantic analysis
Authors: George Rzevski
Venue: Proceedings of the 8th WSEAS international conference on Artificial intelligence, knowledge engineering and data bases (2009)

The speaker will describe a new method for semantic analysis of text using multi-agent technology. The problem of semantic analysis is reformulated as the allocation of meanings to words and software agents are given the task to negotiate the matching. A comprehensive ontology contains general knowledge on text understanding, language oriented rules and specific knowledge on the problem domain. Every word in the text under consideration is given the opportunity to autonomously and practically search for its own meaning consulting knowledge available in ontology. To simplify the process of extracting meanings, the method includes an initial morphological and syntactic analysis of the text, followed by semantic analysis. After that, a pragmatics program implements user-defined applications using the semantics descriptor, which has been generated during semantic analysis. The method has been commercially applied to abstract selection.
Medical image segmentation with transform and moment based features and incremental supervised neural network
Authors: Zafer Iscan, Ayhan Yüksel, Zümray Dokur, Mehmet Korürek, Tamer Ölmez
Venue: Digital Signal Processing (2009)

In this study, a novel incremental supervised neural network (ISNN) is proposed for the segmentation of medical images. Performance of the ISNN is investigated for tissue segmentation in medical images obtained from various imaging modalities. Two feature extraction methods based on transform and moments are comparatively investigated to segment the tissues in medical images. Two-dimensional (2D) continuous wavelet transform (CWT) and the moments of the gray-level histogram (MGH) are computed in order to form the feature vectors of ultrasound (US) bladder and phantom images, X-ray computerized tomography (CT) and magnetic resonance (MR) head images. In the 2D-CWT method, feature vectors are formed by the intensity of one pixel of each wavelet-plane of different energy bands. The MGH represents the tissues within the sub-windows by using the spatial variation of image intensities. In this study, the ISNN and Grow and Learn (GAL) network are employed for the segmentation task. It is observed that the ISNN has significantly eliminated the disadvantages of the GAL network in the segmentation of the medical images.
VL-PATSy: Facilitating vicarious learning via intelligent resource provision
Authors: Richard Cox, Jianxiong Pang
Venue: Proceeding of the 2007 conference on Artificial Intelligence in Education: Building Technology Rich Learning Contexts That Work (2007)

This paper describes an adaptive system called VL-PATSy, an extension to an existing system (PATSy) that adds a mechanism for serving vicarious learning (VL) resources. Vicarious learning is the notion that people can and will learn through being given access to the learning experiences of others. The VL resources represent an innovative form of learner support for a complex cognitive task (clinical reasoning). The VL resources are delivered in response to system-detected reasoning impasse events or in response to student demand in timely and context-sensitive ways. A three tier XML-oriented, rule-based architecture was chosen as an efficient and lightweight implementation solution and a design pattern approach was utilised.
Density-based clustering of data streams at multiple resolutions
Authors: Li Wan, Wee Keong Ng, Xuan Hong Dang, Philip S. Yu, Kuan Zhang
Venue: ACM Transactions on Knowledge Discovery from Data (TKDD) (2009)

In data stream clustering, it is desirable to have algorithms that are able to detect clusters of arbitrary shape, clusters that evolve over time, and clusters with noise. Existing stream data clustering algorithms are generally based on an online-offline approach: The online component captures synopsis information from the data stream (thus, overcoming real-time and memory constraints) and the offline component generates clusters using the stored synopsis. The online-offline approach affects the overall performance of stream data clustering in various ways: the ease of deriving synopsis from streaming data; the complexity of data structure for storing and managing synopsis; and the frequency at which the offline component is used to generate clusters. In this article, we propose an algorithm that (1) computes and updates synopsis information in constant time; (2) allows users to discover clusters at multiple resolutions; (3) determines the right time for users to generate clusters from the synopsis information; (4) generates clusters of higher purity than existing algorithms; and (5) determines the right threshold function for density-based clustering based on the fading model of stream data. To the best of our knowledge, no existing data stream algorithms has all of these features. Experimental results show that our algorithm is able to detect arbitrarily shaped, evolving clusters with high quality.
Six Ways of Integrating Symmetries within Non-overlapping Constraints
Authors: Magnus Ågren, Nicolas Beldiceanu, Mats Carlsson, Mohamed Sbihi, Charlotte Truchet, Stéphane Zampelli
Venue: Proceedings of the 6th International Conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2009)

This paper introduces six ways for handling a chain of lexicographic ordering (lex-chain) constraint between the origins of identical orthotopes (e.g., rectangles, boxes, hyper-rectangles) subject to the fact that they should not pairwise overlap. While the first two ways deal with the integration of a lex-chain constraint within a generic geometric constraint kernel, the four latter ways deal with the conjunction of a lex-chain constraint and a non-overlapping or a cumulative constraint. Experiments on academic two and three dimensional placement problems as well as on industrial problems show the benefit of such a strong integration of symmetry breaking constraints and non-overlapping ones.
Sizes of induced subgraphs of ramsey graphs
Authors: Noga Alon, JÓzsef Balogh, Alexandr Kostochka, Wojciech Samotij
Venue: Combinatorics, Probability and Computing (2009)

An n-vertex graph G is c-Ramsey if it contains neither a complete nor an empty induced subgraph of size greater than c log n. Erdős, Faudree and Sós conjectured that every c-Ramsey graph with n vertices contains Ω(n5/2) induced subgraphs, any two of which differ either in the number of vertices or in the number of edges, i.e., the number of distinct pairs (|V(H)|, |E(H)|), as H ranges over all induced subgraphs of G, is Ω(n5/2). We prove an Ω(n2.3693) lower bound.