ppxscal/embedding_network huggingface dataset:
Training structural SVMs when exact inference is intractable
Authors: Thomas Finley, Thorsten Joachims
Venue: Proceedings of the 25th international conference on Machine learning (2008)

While discriminative training (e.g., CRF, structural SVM) holds much promise for machine translation, image segmentation, and clustering, the complex inference these applications require make exact training intractable. This leads to a need for approximate training methods. Unfortunately, knowledge about how to perform efficient and effective approximate training is limited. Focusing on structural SVMs, we provide and explore algorithms for two different classes of approximate training algorithms, which we call undergenerating (e.g., greedy) and overgenerating (e.g., relaxations) algorithms. We provide a theoretical and empirical analysis of both types of approximate trained structural SVMs, focusing on fully connected pairwise Markov random fields. We find that models trained with overgenerating methods have theoretic advantages over undergenerating methods, are empirically robust relative to their undergenerating brethren, and relaxed trained models favor non-fractional predictions from relaxed predictors.
Combining Voxel-based Morphometry with Artifical Neural Network Theory in the Application Research of Diagnosing Alzheimer's Disease
Authors: Chengzhong Huang, Bin Yan, Hua Jiang, Dahui Wang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

The purpose of our study was to explore the automatic method of detecting the gray matter loss of Alzheimer’s disease (AD) patients with magnetic resonance imaging (MRI). In this paper, we tried to combine voxel-based morphometry(VBM) with Artificial Neural Network(ANN) in diagnosing Alzheimer’s disease(AD). Firstly, the features were obtained by VBM method, and then principal component analysis(PCA) was used for feature dimensionality reduction to improve its efficiency. Then, a single three-layer, feed-forward ANN with a back-propagation algorithm was used as a classifier. Finally, the performance of the neural network was evaluated by validation protocol. By taking 20 features into account, which were obtained by VBM. The overall predictive capability of Back-Propagation Neural Network in differentiating AD from normal controls reached 100%. The network kept the accuracy of classification consistently. Also, the result will be slightly better with the process of PCA. In conclusion, the results of this study confirmed that the method of combination VBM with ANN could be used in the early diagnosis of AD.
On the complexity of checking self-duality of polytopes and its relations to vertex enumeration and graph isomorphism
Authors: Hans Raj Tiwary, Khaled Elbassioni
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

We study the complexity of determining whether a polytope given by its vertices or facets is combinatorially isomorphic to its polar dual. We prove that this problem is Graph Isomorphism hard, and that it is Graph Isomorphism complete if and only if Vertex Enumeration is Graph Isomorphism easy. To the best of our knowledge, this is the first problem that is not equivalent to Vertex Enumeration and whose complexity status has a non-trivial impact on the complexity of Vertex Enumeration irrespective of whether checking Self-duality turns out to be strictly harder than Graph Isomorphism or equivalent to Graph Isomorphism. The constructions employed in the proof yield a class of self-dual polytopes that are interesting on their own. In particular, this class of self-dual polytopes has the property that the facet-vertex incident matrix of the polytope is transposable if and only if the matrix is symmetrizable as well. As a consequence of this construction, we also prove that checking self-duality of a polytope, given by its facet-vertex incidence matrix, is Graph Isomorphism complete, thereby answering a question of Kaibel and Schwartz.
An E-Government Platform Based on Multi-Tier Architecture
Authors: Xiaoyuan Zhang, Guoqiang Han, Bin Li, Kun Zou, Wen Li
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

With the development of dynamic e-government and the network, the application system becomes more complicated. Traditional e-government system will have an inherent scalability problem as the number of applications increases continuously. To solve this problem, an e-government platform based on multi-tier architecture is presented. By integrating applications, resources and system modules, the platform provides an effective mechanism to reduce the development and communication cost. This paper intensively discusses the design rationale and practical solutions of the platform, including structured data models, a secure data exchange model, uniform interface specifications, a topic based publish/subscribe communication mechanism and an asynchronous execution mechanism. The security of the platform is also evaluated by formal logic method.
Outlier-robust clustering using independent components
Authors: Christian Böhm, Christos Faloutsos, Claudia Plant
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

How can we efficiently find a clustering, i.e. a concise description of the cluster structure, of a given data set which contains an unknown number of clusters of different shape and distribution and is contaminated by noise? Most existing clustering methods are restricted to the Gaussian cluster model and are very sensitive to noise. If the cluster content follows a non-Gaussian distribution and/or the data set contains a few outliers belonging to no cluster, then the computed data distribution does not match well the true data distribution, or an unnaturally high number of clusters is required to represent the true data distribution of the data set. In this paper we propose OCI (Outlier-robust Clustering using Independent Components), a clustering method which overcomes these problems by (1) applying the exponential power distribution (EPD) as cluster model which is a generalization of Gaussian, uniform, Laplacian and many other distribution functions, (2) applying the Independent Component Analysis (ICA) for both determining the main directions inside a cluster as well as finding split planes in a top-down clustering approach, and (3) defining an efficient and effective filter for outliers, based on EPD and ICA. Our method is parameter-free and as a top-down clustering approach very efficient. An extensive experimental evaluation shows both the accuracy of the obtained clustering result as well as the efficiency of our method.
Optimizing Text Summarization Based on Fuzzy Logic
Authors: Farshad Kyoomarsi, Hamid Khosravi, Esfandiar Eslami, Pooya Khosravyan Dehkordy, Asghar Tajoddin
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In this paper we first analyze some state of the art methods for text summarization. We discuss what the main disadvantages of these methods are and then propose a new method using fuzzy logic. Comparisons of results show that our method beats most methods which use machine learning as their core
Image denosing based on wavelet support vector regression
Authors: Shaoming Zhang, Ying Chen
Venue: Machine Graphics Vision International Journal (2006)

Denoising is an important application of image processing. We have constructed a denoising system which learns an optimal mapping from the input data to denoised data. The Morlet wavelet was used as the kernel function to construct the wavelet support vector machine. The noised image data is mapped to denoised values by wavelet support vector regression. The result shows that denoising via wavelet support vector regression could perform better than Gaussian smoothing, median filtering and average filtering on the experimental image and it also performs better than Gaussian radial basic function support vector regression.
Graphical Browsing of Email Data: An Empirical Investigation
Authors: Saad Alharbi, Dimitrios Rigas
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents a comparative usability experiment that was performed to test whether information visualization could improve the usability of email clients. An experimental email visualization prototype called LinearVis was developed in order to organize email messages in the inbox. It visualizes messages based on the date of receiving messages with senders’ e-mail addresses. The performance of 30 participants was observed in a standard email client and the proposed prototype. The results showed that information visualization could significantly reduce the time taken for completing tasks as well as the number of actions performed during performing tasks.
Hinged dissections exist
Authors: Timothy G. Abbott, Zachary Abel, David Charlton, Erik D. Demaine, Martin L. Demaine, Scott D. Kominers
Venue: Proceedings of the twenty-fourth annual symposium on Computational geometry (2008)

We prove that any finite collection of polygons of equal area has a common hinged dissection, that is, a chain of polygons hinged at vertices that can be folded in the plane continuously without self-intersection to form any polygon in the collection. This result settles the open problem about the existence of hinged dissections between pairs of polygons that goes back implicitly to 1864 and has been studied extensively in the past ten years. Our result generalizes and indeed builds upon the result from 1814 that polygons have common dissections (without hinges). We also extend our result to edge-hinged dissections of solid 3D polyhedra that have a common (unhinged) dissection, as determined by Dehn's 1900 solution to Hilbert's Third Problem. Our proofs are constructive, giving explicit algorithms in all cases. For a constant number of planar polygons, both the number of pieces and running time required by our construction are pseudopolynomial. This bound is the best possible even for unhinged dissections. Hinged dissections have possible applications to reconfigurable robotics, programmable matter, and nanomanufacturing.
What's Going on in Search Engine Rankings?
Authors: Yasuaki Yoshida, Takanori Ueda, Takashi Tashiro, Yu Hirate, Hayato Yamana
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Many people use search engines every day to retrieve documents from the Web. Although the social influence of search engine rankings has become significant, ranking algorithms are not disclosed. In this paper, we have investigated three major search engine rankings by analyzing two kinds of data. One is the weekly ranking snapshots of top 250 Web pages we collected for almost one year by submitting 1,000 pre-selected queries; the other comprises back-linked Web pages gathered by our own Web crawling. As a result, we have confirmed that (1) several top 10 rankings are mutually similar, however, the following ranked Web pages are almost different, (2) ranking transitions have their own characteristics, and (3) each search engine's ranking has its own correlation with the number of back-linked Web pages.
Fabrication and optimization of bimorph micro probes for the measurement of individual biocells
Authors: Y. H. Cho, D. Collard, L. Buchaillot, F. Conseil, B. J. Kim
Venue: Microsystem Technologies (2005)

This paper deals with a novel structure for single-cell characterization which makes use of bimorph thermal actuators combined with electrical sensor device and integrated micro channel. The goal of this device is to capture and characterize individual biocells or micro particles. After analysis of actuation by numerical modeling and simulation, practical fabrication of prototype probes is realized. Finally, we optimize the dimension of cantilevers and integrated parallel probe systems with microfluidic channels.
Silicon nano-particles in SiO2 sol-gel film for nano-crystal memory device applications
Authors: A. Dima, F. G. Della Corte, C. J. Williams, K. G. Watkins, G. Dearden, N. O'Hare, M. Casalino, I. Rendina, M. Dima
Venue: Microelectronics Journal (2008)

A novel 2-bit nano-silicon based non-volatile memory is proposed to double memory density. The thin film structure exhibits two conduction states (ON and OFF) at different voltages and has a cost-effective structure. The structure utilizes the good electrical properties of fluorinated SiO"2 thin films, together with the bi-stable properties conferred by the nano-silicon particles therein embedded. A polymeric layer of 8-hydroxyquinoline aluminum salt (Alq3) further deposited on the top of the nano-particle layer through chemical evaporation and a silver paste contact determines the final structure. The positive 0-15V scan reveals two discontinuities with an ON/OFF ratio of 10^4-10^5 (2-4V) and OFF/ON of 10^3 (12.5-13.0V). The reverse scan displays again two distinct thresholds, range of 10.5-11.0V (ON/OFF ratio 10^-^3), respectively, 0.5V (OFF/ON ratio 10^-^5-10^-^4).
Predicting fault-prone modules based on metrics transitions
Authors: Yoshiki Higo, Kenji Murao, Shinji Kusumoto, Katsuro Inoue
Venue: Proceedings of the 2008 workshop on Defects in large software systems (2008)

This paper describe a method for identifying fault-prone modules. The method utilizes metrics transitions rather than raw metrics values. Metrics transitions are measured from the source code of consecutive versions, which is archived in software repositories. Metrics transitions should be an good indicator of software quality because they reflect how the software system has evolved. This paper exhibits a case study, which is a comparison between metrics transitions and CK metrics suite. In the case study, the metrics transitions could precisely identify fault-prone modules.
A tree-partitioning technique with applications to expression evaluation and term matching
Authors: S. R. Kosaraju, A. L. Delcher
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

A tree-partitioning technique is proposed and applied to expression evaluation and term matching. It was shown recently that the problem of evaluating an arithmetic expression is in NC/sup 1/, and an O(log N)-depth, O(N/sup 2/ log N)-size circuit for this problem was described. The size is reduced to O(N log/sup k/ N) while O(log N) depth is maintained. An O(log N)-time, O(N)-processor CREW (concurrent read, exclusive write) algorithm for term matching, which improves the previous O(log N)-time, N/sup 2/-processor algorithm, is also presented.
An autonomic network-aware scheduling architecture for grid computing
Authors: Agustín Caminero, Omer Rana, Blanca Caminero, Carmen Carrión
Venue: Proceedings of the 5th international workshop on Middleware for grid computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

Grid technologies have enabled the aggregation of geographically distributed resources, in the context of a particular application. The network remains an important requirement for any Grid application, as entities involved in a Grid system (such as users, services, and data) need to communicate with each other over a network. The performance of the network must therefore be considered when carrying out tasks such as scheduling, migration or monitoring of jobs. Surprisingly, many existing QoS efforts ignore the network and focus instead on processor workload and disk access. Making use of the network in an efficient and fault tolerance manner, in the context of such existing research, leads to a significant number of research challenges. One way to address these problems is to make Grid middleware incorporate the concept of autonomic systems. Such a change would involve the development of "self-configuring" systems that are able to make decisions autonomously, and adapt themselves as the system status changes. We propose an autonomic network-aware scheduling infrastructure that is capable of adapting its behavior to the current status of the environment.
Usefulness of remote sensing for the assessment of growth traits in individual cereal plants grown in the field
Authors: F. Alvaro, L. F. García del Moral, C. Royo
Venue: International Journal of Remote Sensing (2007)

Biomass determination usually involves destructive and tedious measurements. This study was conducted to evaluate the usefulness of the Normalized Difference Vegetation Index (NDVI) and the Simple Ratio (SR), calculated from the spectra of individual plants, for the assessment of leaf area per plant (LAP), green area per plant (GAP) and plant dry weight (W) at different growth stages. Two varieties of four cereal species (barley, bread wheat, durum wheat and triticale) were sown in a field experiment at a density of 25 plants m-2. The spectra were captured on three plants per plot on eight occasions from the beginning of jointing to heading using a narrow-bandwidth visible-near-infrared portable field spectroradiometer adapted for measurements at plant level. Strong associations were found between NDVI and SR and growth traits, both indices being better estimators of GAP and W than of LAP. Exponential models fitted to NDVI data were more useful for a wide number of situations than the linear models fitted to SR data. However, SR was able to discriminate between genotypes within a species. The accuracy of the reflectance measurements was comparable to that obtained by destructive measurements of growth traits, in which differences between varieties of over 24% were needed to be statistically significant. However, differences in SR of only 18% were statistically significant (P
Rank and biclique partitions of the complement of paths
Authors: Elizabeth D. Boyer
Venue: Journal of Graph Theory (1998)

The problem was posed of determining the biclique partition number of the complement of a Hamiltonian path (Monson, Rees, and Pullman, Bull. Inst. Combinatorics and Appl. 14 (1995), 17&ndash;86). We define the complement of a path P, denoted $\overline{P}$, as the complement of P in Km,n where P is a subgraph of Km,n for some m and n. We give an exact formula for the biclique partition number of the complement of a path. In particular, we solve the problem posed in [9]. We also summarize our more general results on biclique partitions of the complement of forests. &copy; 1998 John Wiley & Sons, Inc. J Graph Theory 27: 111&ndash;122, 1998
OSS: Efficient Compiler Approach for Selecting Optimal Strip Size on the Imagine Stream Processor
Authors: Jing Du, Canqun Yang, Fujiang Ao, Xuejun Yang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Strip-mining technique is critical for improving performance of large-scale scientific applications on Imagine. In this paper, we present a model-guided strip size selection approach (OSS) for finding the optimal strip size to minimize the execution time. Our strategy consists of a detailed analytical model that characterizes the effect of strip size on program behavior. Then according to the model analysis, we design a simple strip size selection strategy, that is, the optimal strip size is 512 words. Our experimental results show that when the optimal strip size is used, the execution time is close to the experimentally best. It is certain that our strategy can efficiently exploit the tremendous potential of Imagine.
An Effort-Based Approach to Measure Completeness of an Entity-Relationship Model
Authors: Tauqeer Hussain, Mian M. Awais
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

For developing good quality information systems, the need of developing good quality conceptual models cannot be over emphasized. Completeness is an important characteristic that determines the quality of a conceptual model. To measure completeness, metrics called Completeness Index (CI) and Fuzzy Completeness Index (FCI) have been proposed in research. These metrics correspond to the extent functional dependencies are represented in a conceptual model. In this paper, we propose an approach that takes into account the effort required to make a conceptual model complete. The higher the effort, the less is the degree of completeness. A metric Effort-based Completeness Index ECI is proposed accordingly. Although metrics previously proposed have an implicit relationship with the required effort, ECI provides the basis to explicitly relate completeness with the effort. Also, the method of computing ECI is simpler. In the proposed approach, first the effort based upon number of changes required to introduce a functional dependency in a given model is computed. Then the total effort for all functional dependencies in the problem domain determines ECI. In this paper, ECI is calculated for different conceptual models and compared with corresponding CI and FCI values. It is illustrated that the proposed approach can easily be applied to practical problems in which alternative designs of the same problem are to be compared objectively in order to identify the one having better quality.
Querying business processes with BP-QL
Authors: Catriel Beeri, Anat Eyal, Simon Kamenkovich, Tova Milo
Venue: Information Systems (2008)

We present in this paper BP-QL, a novel query language for querying business processes. The BP-QL language is based on an intuitive model of business processes, an abstraction of the emerging BPEL (business process execution language) standard. It allows users to query business processes visually, in a manner very analogous to how such processes are typically specified, and can be employed in a distributed setting, where process components may be provided by distinct providers. We describe here the query language as well as its underlying formal model. We consider the properties of the various language components and explain how they influenced the language design. In particular we distinguish features that can be efficiently supported, and those that incur a prohibitively high cost, or cannot be computed at all. We also present our implementation which complies with real life standards for business process specifications, XML, and Web services, and is used in the BP-QL system.
Local likelihood modeling of temporal text streams
Authors: Guy Lebanon, Yang Zhao
Venue: Proceedings of the 25th international conference on Machine learning (2008)

Temporal text data is often generated by a time-changing process or distribution. Such a drift in the underlying distribution cannot be captured by stationary likelihood techniques. We consider the application of local likelihood methods to generative and conditional modeling of temporal document sequences. We examine the asymptotic bias and variance and present an experimental study using the RCV1 dataset containing a temporal sequence of Reuters news stories.