ppxscal/embedding_network huggingface dataset:
Support vector machine for 3D modelling from sparse geological information of various origins
Authors: Alex Smirnoff, Eric Boisvert, Serge J. Paradis
Venue: Computers Geosciences (2008)

Three-dimensional (3D) geological models are a powerful way of visualization, analysis and interpretation of geological information. However, manual modelling with available GIS tools is a challenging and time-consuming task. Here we propose the use of the support vector machine (SVM) in order to automate the creation of such models. We experiment with various input data and hyperparameters in order to demonstrate that the SVM can be efficiently applied in 3D geological reconstructions overcoming some limitations of previously used methods.
Adaptive Edge Enhancement of the Ultrasound Image
Authors: Huan Li, Jun Gao, Dong C. Liu
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

This paper presents an adaptive edge enhancement algorithm for ultrasound imaging. Most of classical edge enhancement techniques take the whole image as a unit and use the spatial or frequency domain edge operators to enhance the region whose grey varies largely. Because of the speckle noises of the ultrasound images, edge operators may enhance the speckles and degrade the contrast resolution of the image. Moreover, classical edge enhancement techniques can enhance the reverberation artifacts which appear like the edge. In this paper we present a segmentation method, i.e. seeking the regions whose edges needs to be enhanced and ruling out the error edges caused either by speckle noises or the reverberation artifacts. Segmentation techniques are based on the texture analysis of the spatial grey level co-occurrence matrix. The proposed enhancement function is a class of modified sigmoid functions. Results show that we can leave speckle/reverberation unchanged and enhance tissue boundaries.
Autocorrelation Function of Sequential M-Bit Words Taken from an N-Bit Shift Register (PN) Sequence
Authors: D. R. Morgan
Venue: IEEE Transactions on Computers (1980)

A closed-form expression is obtained for the autocorrelation function of sequential M-bit, base a digital words formed by serial bits of a single binary PN sequence of length L = 2N - 1. Plots are presented for several values of M and N, showing detailed behavior and limiting curves for the binary case (a= 2).
On the minimization of XPath queries
Authors: S. Flesca, F. Furfaro, E. Masciari
Venue: Journal of the ACM (JACM) (2008)

XPath expressions define navigational queries on XML data and are issued on XML documents to select sets of element nodes. Due to the wide use of XPath, which is embedded into several languages for querying and manipulating XML data, the problem of efficiently answering XPath queries has received increasing attention from the research community. As the efficiency of computing the answer of an XPath query depends on its size, replacing XPath expressions with equivalent ones having the smallest size is a crucial issue in this direction. This article investigates the minimization problem for a wide fragment of XPath (namely X P&lsqb;&sext;&rsqb;), where the use of the most common operators (child, descendant, wildcard and branching) is allowed with some syntactic restrictions. The examined fragment consists of expressions which have not been specifically studied in the relational setting before: neither are they mere conjunctive queries (as the combination of &ldquo;//&rdquo; and &ldquo;&ast;&rdquo; enables an implicit form of disjunction to be expressed) nor do they coincide with disjunctive ones (as the latter are more expressive). Three main contributions are provided. The &ldquo;global minimality&rdquo; property is shown to hold: the minimization of a given XPath expression can be accomplished by removing pieces of the expression, without having to re-formulate it (as for &ldquo;general&rdquo; disjunctive queries). Then, the complexity of the minimization problem is characterized, showing that it is the same as the containment problem. Finally, specific forms of XPath expressions are identified, which can be minimized in polynomial time.
Can nano-photonic silicon circuits become an INTRA-chip interconnect technology?
Authors: Eli Yablonovitch
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

Surprisingly, nano-photonic silicon has already emerged as a commercial INTER-chip optical communications technology. This was made possible by Silicon-on-Insulator (SOI), technology, which integrates many of the optical communications components directly in silicon CMOS chips. Intel and Luxtera have both announced > 10Gb/sec optical modulators, integrated into Silicon. All the other customarily required opto-electronic components; detectors, waveguides, splitters, couplers, filters, etc., are fully executed in CMOS designs, as well. Continuous wave optical power is provided from off-chip, just as dc power is currently provided from off-chip. The initial commercial applications are optical 10Gb/s Ethernet, Infiniband, and other INTER-chip, communications applications. The question to be addressed in this talk, is whether silicon nano-photonics can now make the final jump, to INTRA-chip optical interconnects?
Declarative information extraction using datalog with embedded extraction predicates
Authors: Warren Shen, AnHai Doan, Jeffrey F. Naughton, Raghu Ramakrishnan
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

In this paper we argue that developing information extraction (IE) programs using Datalog with embedded procedural extraction predicates is a good way to proceed. First, compared to current ad-hoc composition using, e.g., Perl or C++, Datalog provides a cleaner and more powerful way to compose small extraction modules into larger programs. Thus, writing IE programs this way retains and enhances the important advantages of current approaches: programs are easy to understand, debug, and modify. Second, once we write IE programs in this framework, we can apply query optimization techniques to them. This gives programs that, when run over a variety of data sets, are more efficient than any monolithic program because they are optimized based on the statistics of the data on which they are invoked. We show how optimizing such programs raises challenges specific to text data that cannot be accommodated in the current relational optimization framework, then provide initial solutions. Extensive experiments over real-world data demonstrate that optimization is indeed vital for IE programs and that we can effectively optimize IE programs written in this proposed framework.
A Shared Parts Model for Document Image Recognition
Authors: M. Das Gupta, P. Sarkar
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

We address document image classification by visual ap- pearance. An image is represented by a variable-length list of visually salient features. A hierarchical Bayesian net- work is used to model the joint density of these features. This model promotes generalization from a few samples by sharing component probability distributions among differ- ent categories, and by factoring out a common displace- ment vector shared by all features within an image. The Bayesian network is implemented as a factor graph, and parameter estimation and inference are both done by loopy belief propagation. We explain and illustrate our model on a simple shape classification task. We obtain close to 90% accuracy on classifying journal articles from memos in the UWASH-II dataset, as well as on other classification tasks on a home-grown data set of technical articles.
Objectrank: authority-based keyword search in databases
Authors: Andrey Balmin, Vagelis Hristidis, Yannis Papakonstantinou
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

The ObjectRank system applies authority-based ranking to keyword search in databases modeled as labeled graphs. Conceptually, authority originates at the nodes (objects) containing the keywords and flows to objects according to their semantic connections. Each node is ranked according to its authority with respect to the particular keywords. One can adjust the weight of global importance, the weight of each keyword of the query, the importance of a result actually containing the keywords versus being referenced by nodes containing them, and the volume of authority flow via each type of semantic connection. Novel performance challenges and opportunities are addressed. First, schemas impose constraints on the graph, which are exploited for performance purposes. Second, in order to address the issue of authority ranking with respect to the given keywords (as opposed to Google's global PageRank) we precompute single keyword ObjectRanks and combine them during run time. We conducted user surveys and a set of performance experiments on multiple real and synthetic datasets, to assess the semantic meaningfulness and performance of ObjectRank.
Automatic 3D facial segmentation and landmark detection
Authors: Mauricio P. Segundo, Chaua Queirolo, Olga R. P. Bellon, Luciano Silva
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

This paper presents our methodology for face and facial features detection to improve 3D face recognition in a presence of facial expression variation. Our goal was to develop an automatic process to be embedded in a face recognition system, using only range images as input. To do that, our approach combines traditional image segmentation techniques for face segmentation and detect facial features by combining an adapted method for 2D facial features extraction with the surface curvature information. The experiments were performed in a large, well-known face image database available on the Biometric Experimentation Environment (BEE), including 4,950 images. The results confirms that our method is efficient for the proposed application.
Pors: proofs of retrievability for large files
Authors: Ari Juels, Burton S. Kaliski,  Jr.
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety. A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes. In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work. We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.
The MCMC Approach for Solving the Pareto/NBD Model and Possible Extensions
Authors: Shao-Hui Ma, Jin-Lan Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

Though the Pareto/NBD (developed by Schmittlein et al. 1987) is a powerful model for customer base analysis, it is difficult to implement especially in terms of parameter estimation. In this paper, the authors propose a MCMC algorithm for model estimation, and a Monte Carlo simulative approach to calculate key results of the model. The outcome of the method is a measure in which value is operationalized as a probability distribution, in contrast to previous studies has actually computed a spot estimation. The algorithm is applied into two direct marketing datasets and gets close parameter estimates with MLE. By implementing MC simulation, the study also shows a good interval predictive performance of the Pareto/NBD. Further more, the authors propose three possible extensions to the Pareto/NBD model and derive a GG/NBD model as a generalization to the Pareto/NBD.
HMPI - hybrid MPI
Authors: F. I. Massetto, L. M. Sato
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

This paper presents the HMPI, a runtime system to integrate several MPI implementations, used to develop high performance applications that must run both in nodes with several operating systems and clusters of clusters infrastructures. HMPI has two different approaches to achieve this integration, using connection pools and HMPI daemons.
Assessment of phylogenomic and orthology approaches for phylogenetic inference
Authors: B. E. Dutilh, V. van Noort, R. T. J. M. van der Heijden, T. Boekhout, B. Snel, M. A. Huynen
Venue: Bioinformatics (2007)

Motivation: Phylogenomics integrates the vast amount of phylogenetic information contained in complete genome sequences, and is rapidly becoming the standard for reliably inferring species phylogenies. There are, however, fundamental differences between the ways in which phylogenomic approaches like gene content, superalignment, superdistance and supertree integrate the phylogenetic information from separate orthologous groups. Furthermore, they all depend on the method by which the orthologous groups are initially determined. Here, we systematically compare these four phylogenomic approaches, in parallel with three approaches for large-scale orthology determination: pairwise orthology, cluster orthology and tree-based orthology. Results: Including various phylogenetic methods, we apply a total of 54 fully automated phylogenomic procedures to the fungi, the eukaryotic clade with the largest number of sequenced genomes, for which we retrieved a golden standard phylogeny from the literature. Phylogenomic trees based on gene content show, relative to the other methods, a bias in the tree topology that parallels convergence in lifestyle among the species compared, indicating convergence in gene content. Conclusions: Complete genomes are no guarantee for good or even consistent phylogenies. However, the large amounts of data in genomes enable us to carefully select the data most suitable for phylogenomic inference. In terms of performance, the superalignment approach, combined with restrictive orthology, is the most successful in recovering a fungal phylogeny that agrees with current taxonomic views, and allows us to obtain a high-resolution phylogeny. We provide solid support for what has grown to be a common practice in phylogenomics during its advance in recent years. Contact: dutilh@cmbi.ru.nl Supplementary information: Supplementary data are available at Bioinformatics online.
Application of Fuzzy Automata on Target Tracking
Authors: QingE Wu, Tuo Wang, YongXuan Huang, JiSheng Li
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

For better target tracking, this paper presents a new viewpoint that is the states fusion of various fuzzy automata, and mainly discusses the algorithm of the fusion on the states of the fuzzy automata in detail. The recurrent neural network architecture corresponding to fuzzy automata is provided for the states fusion of fuzzy automata and the sim- ulation results are given. The simulation results show the target tracking based on the states fusion of the fuzzy au- tomata is better than single state information of the fuzzy automata relatively. Finally, some problems and develop- ment trends on the fuzzy automata and the neural networks are presented for future researches.
Test Roles in Diagnosis and Silicon Debug
Authors: Anis Uzzaman, Fidel Muradali, Takashi Aikyo, Robert Aitken, Tom Jackson, Rajesh Galivanche, Takeshi Onodera
Venue: Proceedings of the 16th Asian Test Symposium (2007)

Test catches defective parts. Traditional DFT makes test-related activities more cost effective. Debug and diagnosis discovers why a design or part did not work. Yield relates to how many good parts can be shipped thus how many dollars can be received. As one would expect, all these areas are related. The issue becomes: Can information from one operation be geared to better another? This panel specifically considers how test/DFT can aid in debug & diagnosis. The discussion is then extended to capture the impact on yield management in riskier contemporary and future processes. Over the past few decades, each of the above domains have gone through cycles of research, development, maturity and overhaul to adapt to changes in the process & product environment. In fact, because increasing degrees of uncertainty is introduced with modern nanometer processes, debug & diagnosis and yield management are becoming more recognized and valued portions of the product creation flow. To forward this, test and DFT functions are experiencing re-development. In building, executing and sustaining a competence, key issues include time & information. That is, the problem must be understood, solved in for the short term and solved for the long term. In addition, solution scope must be properly framed and, if possible, adaptable to unexpected changes in the process and tooling environments. It is well recognized that information availability and access are pillars of a debug/diagnosis solution. DFT structures, design automation tooling, test programs, ATE applications and physical failure analysis are means to a bulk of this data. The follow through is the assimilation of this data into a yield management and test quality system. As the topic is broad, panel of test experts will focus on practical experiences concerning the use of test, crafted DFT or test environments to facilitate debug and diagnosis. Precise developments in tying debug/diagnosis to yield management will also be discussed.
A note of an O(n3/logn) time algorithm for all pairs shortest paths
Authors: Yijie Han
Venue: Information Processing Letters (2008)

We improve the all pairs shortest path algorithm given by Takaoka to time complexity O(n^3/logn). Our improvement is achieved by using a smaller table and therefore saves time for the algorithm.
Computer Graphics and the Practice of Architecture
Authors: D. R. Fullenwider
Venue: IEEE Computer Graphics and Applications (1981)

By tying together a number of systems to create an integrated design and drafting facility, a large architectural firm enhanced the productivity of its designers and engineers.
An Efficient Organization or Large Frequency-Dependent Files for Binary Searcking
Authors: C. V. Ramamoorthy, Yeh-Hao Chin
Venue: IEEE Transactions on Computers (1971)

The efficient organization of a very large file to facilitate search and retrieval operations is an important but very complex problem. In this paper we consider the case of a large file in which the frequency of use of its component subfiles are known. We develop the organization of the file so that the average number of entries to locate individual items in it by means of binary search is minimized. The algorithm iteratively partitions the file into "saturated" subfiles, and with each successive iteration the average number of entries to locate an item is reduced until no more improvement is possible. Next, we extend the method to solve the realistic problem of designing an optimal memory hierarchy to hold the file in a computer system. The sizes of various memory components and location of various items of the frequency-dependent file are determined so that the average time to locate an item (over the totality of items) in the memory hierarchy is minimized for a given total cost of the memory system. A number of examples are given to elucidate the methods. Also, the characteristics and results of a Fortran implementation of the algorithms on the CDC 6600 are described.
Topological Description of Rough Set Models
Authors: Taihe Fan, Daowu Pei
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

In this paper, it is proved that there is a one-one corre- spondence between rough set models induced by reflexive and transitive relations and rough set models induced by topological spaces with finite character. The topological properties of the models are systematically investigated.
Assertion-based repair of complex data structures
Authors: Bassem Elkarablieh, Ivan Garcia, Yuk Lai Suen, Sarfraz Khurshid
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Programmers have long used assertions to characterize properties of code. An assertion violation signals a corruption in the programstate. At such a state, it is standard to terminate the program, debug it if possible, and re-execute it. We propose a new view: instead of terminating the program, use the violated assertion as a basis of repairing the state of the program and let it continue. We present a novel algorithm to repair complex data structures. Given a structure that violates an assertion that represents its integrity constraints, our algorithm performs a systematic search based on symbolic execution to repair the structure, i.e., mutate it such that the resulting structure satisfies the given constraints. Heuristics to prune search and minimize mutations enable efficient and effective repair. Experiments using libraries and applications, such as a naming architecture and a database engine, show that our prototype efficiently repairs complex structures while enabling systems to recover from potentially crippling errors.
Test Inspected Unit or Inspect Unit Tested Code?
Authors: Atul Gupta, Pankaj Jalote
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Code inspection and unit testing are two popular fault-detecting techniques at unit level. Organizations where inspections are done generally supplement it with unit testing, as both are complementary. A natural question is the order in which the two techniques should be exercised as this may impact the overall effectiveness and efficiency of the veri- fication process. In this paper, we present a controlled experiment comparing the two execution-orders, namely, code inspection followed by unit testing (CI-UT) and unit testing followed by code inspection (UT-CI), performed by a group of fresh software engineers in a company. The subjects inspected program-units by traversing a set of usage scenarios and applied unit testing by writing JUnit tests for the same. Our results showed that unit testing can be more effective, as well as more efficient, if applied after code inspection whereas the later is unaffected of the executionorder. Overall results suggest that sequence CI-UT performs better than UT-CI in time-constrained situations.