Search results for "Joins"
showing 10 items of 16 documents
The diamond partial order for strong Rickart rings
2016
The diamond partial order has been first introduced for matrices, and then discussed also in the general context of *-regular rings. We extend this notion to Rickart rings, and state various properties of the diamond order living on the so-called strong Rickart rings. In particular, it is compared with the weak space preorder and the star order; also existence of certain meets and joins under diamond order is discussed.
On the lattice of prefix codes
2002
AbstractThe natural correspondence between prefix codes and trees is explored, generalizing the results obtained in Giammarresi et al. (Theoret. Comput. Sci. 205 (1998) 1459) for the lattice of finite trees under division and the lattice of finite maximal prefix codes. Joins and meets of prefix codes are studied in this light in connection with such concepts as finiteness, maximality and varieties of rational languages. Decidability results are obtained for several problems involving rational prefix codes, including the solution to the primeness problem.
Developing successful cause-related marketing campaigns through social-networks the moderating role of users’ age
2018
This paper joins two streams of literature: caused-related marketing and viral advertising. Three main objectives guide our work: (i) to test whether a transfer of attitudes occurs in a viral cause...
Set similarity joins on mapreduce
2018
Set similarity joins, which compute pairs of similar sets, constitute an important operator primitive in a variety of applications, including applications that must process large amounts of data. To handle these data volumes, several distributed set similarity join algorithms have been proposed. Unfortunately, little is known about the relative performance, strengths and weaknesses of these techniques. Previous comparisons are limited to a small subset of relevant algorithms, and the large differences in the various test setups make it hard to draw overall conclusions. In this paper we survey ten recent, distributed set similarity join algorithms, all based on the MapReduce paradigm. We emp…
Blending pieces of Dupin cyclides for 3D modeling and reconstruction : study in the space of spheres
2013
The thesis deals with the blending of canal surfaces in geometric modeling using pieces of Dupin Cyclides. We try to solve a problem of reconstructing real parts manufactured and controlled by the CEA of Valduc. Using the space of spheres in which we can manipulate both points, spheres and canal surfaces, we simplify some problems. This space is represented by a 4-dimensional quadric in a 5-dimensional space, equipped with the Lorentz form, it is the Lorentz space. In the space of spheres, problems of blending canal surfaces by pieces of Dupin cyclides are simplified in linear problems. We give algorithms to make such blends using the space of spheres and after we come back to 3 dimensions …
Not just BLAST nt: WGS database joins the party
2019
AbstractSince its introduction in 1990 and with over 50k citations, the NCBI BLAST family has been an essential tool of in silico molecular biology. The BLAST nt database, based on the traditional divisions of GenBank, has been the default and most comprehensive database for nucleotide BLAST searches and for taxonomic classification software in metagenomics. Here we argue that this is no longer the case. Currently, the NCBI WGS database contains one billion reads (almost five times more than GenBank), and with 4.4 trillion nucleotides, WGS has about 14 times more nucleotides than GenBank. This ratio is growing with time. We advocate a change in the database paradigm in taxonomic classificat…
The Phagocyte Lattice of Dyck Words
2006
We introduce a new lattice structure on Dyck words. We exhibit efficient algorithms to compute meets and joins of Dyck words.
Robot-Forming - An Incremental Forming Process Using an Industrial Robot by Means of DELMIA Software Package
2013
The purpose of this research is to present an alternative method for manufacturing sheet metal parts using an asymmetric incremental forming process by means of an industrial robot. This method is based on designing, simulating and generating the toolpath for the tool attached to the robot using DELMIA software package. The proposed approach allows users to check for system collisions, robot joins limitations and singularity problems. After a comprehensive simulation of the movements of the robot is performed, the program code can be generated by means of a specific DELMIA function. The program can be used afterwards to control the robot during the experimental work. In order to demonstrate…
Parallel In-Memory Evaluation of Spatial Joins
2019
The spatial join is a popular operation in spatial database systems and its evaluation is a well-studied problem. As main memories become bigger and faster and commodity hardware supports parallel processing, there is a need to revamp classic join algorithms which have been designed for I/O-bound processing. In view of this, we study the in-memory and parallel evaluation of spatial joins, by re-designing a classic partitioning-based algorithm to consider alternative approaches for space partitioning. Our study shows that, compared to a straightforward implementation of the algorithm, our tuning can improve performance significantly. We also show how to select appropriate partitioning parame…