dataesr/scientific-paragraphs-categorization huggingface dataset:
Our contributions are summarized in the following points: -We propose an on-line algorithm to ensure a load balancing of range partitioned data in a parallel main memory database. -We provide a strategy for maintaining the global load statistics. This strategy does not require any extra communication cost, unlike the state-of-art solutions requiring at least O(logn) additional messages. -We use this strategy to design an algorithm for range queries which remains efficient even in the presence of rapid and continuous change of partition boundaries. -We implement and test our fully decentralized algorithm under extensive experiments over a wide set of scenarios. The remainder of this paper is organized as follows: Section 2 presents an abstraction of a parallel main memory database and some hypothesis.
System Model In this section, we define a simple abstraction of a main-memory parallel database and make some considerations: -Let N = {N 1 , N 2 ,. , N n } be a set of n nodes connected by a fast local area network as in a Shared-Nothing architecture  [51]. We consider a relation divided into n range partitions on the basis of a key attribute, with boundaries R 0 ≤ R 1 ≤. ≤ R n. The node N i manages a range [R i-1 ,R i [. Data is In-memory resident, it is organized row wise. We consider that the nodes are ordered by their ranges, this ordering defines left and right relationships between them. At this level, we ignore the scalability of the environment, which means that there are no nodes that join or leave the cluster. However, our solution is can be easily extended to answer the scalability requirements; -Let C = {C 1 , C 2 ,.
Client Operations A client C j uses its own P ST Cj to localize the targeted node(s) to which insert, delete and search queries are sent. Inserting, deleting or searching for a tuple with a given key k are performed as follows: -The client searches for a node N i so that the key k is between its lower bound Range Query Execution: Range query is a well-known database operation. It returns all the data between two specified values (upper and lower boundary). A straight-forward mechanism for executing sequential range queries is scanning one partition at a time and returning results to the client during or after the scan of each partition  [19]. This mechanism is relatively easy to implement. However, it does not take advantage of the system parallelism that reduces the total query execution time.
The range boundaries are chosen randomly. Each of these clients has its own approximated partition statistics table (P ST C ). Initially the partition boundaries are all initialized by a uniform division of the domain of values according to the number of nodes in the system. Another parameter ("Client throughput") controls the rate at which the client interacts with the system. In addition to this, there is a main program (Master Client) which allows launching nodes and other clients (depending on the chosen scenario) and periodically collects the performances measures such as the overall imbalance ratio, the number of message redirections (addressing errors) and some useful execution traces like number of data transfers between nodes. Left, Right and Alternate clients are mainly used to produce skewed insertion patterns so that partition statistics (node's boundaries and sizes) change continuously during the simulation progress.
If we have applications that tolerate disequilibrium, α can be large, otherwise α should converge to zero to ensure optimal balancing. Simulations were run comparing performance of our LOADBALANCE algorithm and the GLOBALBALANCE procedure of  [41]  and the ADJUSTLOAD procedure of  [18]. The data from Table  2  represents the comparative load balancing results of the three procedures. The comparison parameter is the imbalance ratio which measured here as the ratio between the largest load and the system average load. The load balance ratios delivered by our LOADBALANCE procedure are very consistent, while there is considerable variance in the load balance ratios from the two other procedures. This relative stability ensures a greater reliability and predictability. When the performance of the system is measured by query response time, it is proportional to the largest node load.
The worst-case relative performance of the LOADBAL-ANCE algorithm versus the ADJUSTLOAD procedure is the ratio of the highest load balance ratios obtained for the two algorithms, or 1. 0-(1. 04+2. 41)=0. 57. One can expect to reduce query response time up to 57% as compared to a system using the ADJUSTLOAD and up to 28% compared to a system using the GLOBALBALANCE. Addressing Errors: After a balancing operation, three nodes at least change their partition boundaries and partition sizes due to inter-nodes data migration. The affected nodes have to update their tables. Clients having outdated tables can thus address wrong nodes that have changed their partition boundaries. We measure the total number of times the clients send their requests to the wrong nodes and hence made addressing errors, dur-ing the simulation tests.
1, the ratio between the packet size and the data size before insertion; -Tuple migrated / (data size + packet size): 0. 35, The ratio between the amount of data migrated and the new data size. A first analysis shows that the number of data transferred depends strongly on the size of the inserted packet and on the total number of data already present before insertion. In this case, for the same value of α, there is a correlation between the ratio of the packet size to the data size and the ratio of the number of tuples migrated to the sum of data size and the packet size. In the above experiments, we measure the number of invocations of LOADBALANCE algorithm. We create four imbalance situations: 1) a strong imbalance on the right side of the cluster, where the right half of the set of nodes is much more loaded than the left one.
Many researches have been proposed on search methods in Structured P2P networks, Readers looking for more information are referred to the survey on searching in P2P networks by  [42]. The basic load balancing approach in structured P2P networks or distributed hash tables (DHTs)  [54]  is consistent hashing  [17]. Unfortunately, consistent hashing approach destroys data order by randomizing placement of data items which is not applicable to some applications. For example, to support range searching in a database application, the items need to be in a specific order. SkipNet  [23]  and skip graph  [2]  are data structures for range searching that are not based on DHTs. Both of them are adapted from Skip Lists  [39]. The computational cost of object search in a skip graph and SkipNet networks is O(log n), where n is the number of nodes in the network.
The principal drawbacks of these techniques are the cost of transferring virtual servers between physical nodes and the extra communication required by the virtual servers for dynamic load balancing. Parallel/Distributed databases: a load balance operation in a parallel database is performed as a transaction. Its consequences do not affect other concurrent transactions until all tuples are moved, partition boundaries are updated, and the transaction is committed. Read requests for tuples that are being moved to another node are serviced from existing versions residing at the old node. Write requests for tuples that are being moved either abort, wait, or are forwarded to the new location. The work in  [41]  proposes a multi-reorder operation that finds a sequence of multiple adjacent nodes that have a small average load of any such sequence.
This technique uses partition statistics which include an estimate of the number of tuples stored on each node for every relation in the database. Based on this information the system skew is calculated. The problem that could be noted is the cost of maintaining partition statistics. Work in  [13]  presents an approach to dealing with skew in parallel joins in database systems. The basic idea is that each processor is allocated a subrange of the join attribute value. The values that delineate the boundaries of these ranges need not be equally spaced in the join attribute domain; this allows the values to be chosen so as to equalize the number of tuples mapped to each subrange. The proposed work is interesting, many recent works are based on this work. Combining this work with our concept (approximate partition statistics tables) could significantly improve the cost of maintaining partitioning information in the processing of parallel joins.
SAP HANA is an emergent in-memory, column-oriented, relational database management system. Like any other MMDBS, this system suffers from unbalanced data distribution on main memory. The work in  [32]  proposes that each HANA server returns the query results to the client with its memory and CPU resources consumption status. The client when detecting that the targeted node does not have enough memory resource, it tries to send the current query to other nodes. Balancing a large and dynamic evolution of data distribution has always been an area of interest of many researchers. Load balancing in Cassandra  [40]  is executed during node additions, the load balancing algorithm transfers half the data from the most loaded node to the new node. The load balancing can also be performed manually with a script executed by the user.
This operation unfortunately does not minimize the amount of data transferred between the nodes and does not guarantee the data balancing. Voldemort  [47]  manages load balancing with the same way  3  , its main disadvantages are the centralized execution generally triggered by the user. It uses a static number of partitions and distributes them uniformly on the nodes. Riak 4  uses the notion of vnodes, inspired by the virtual nodes of Chord  [46]. It assigns them to the physical nodes in multiple ways. Load balancing is performed only when adding or deleting nodes. MongoDB  [4]  uses its cluster-balancing module, its balancing strategies is a little bit similar to ours. The balancing module migrates data between different nodes when the ratio of the number of tuples from the largest fragment to the smallest reaches a certain threshold.
However, this operation lacks flexibility outside the threshold parameter. Discussion: the above state-of-art presents the most important existing approaches dealing with the problem of data skew in a range-partitioned data system. These approaches are targeted towards peer-to-peer systems and parallel databases. The conclusion we could make is that the cost of maintaining load statistics is at least O(logn). Our solution considers main memory databases and provides load balancing mechanism to handle the data skew for applications with dominant append operations and range queries. Also, these applications do not require update queries, but mainly insert, delete and search queries like in data warehouses. We provide a strategy for maintaining the global load statistics without any extra communication cost, unlike the state-of-art solutions that require at least O(logn) additional messages.
Conclusion In this paper, we presented OLAPS, an on-line-load balancing algorithm for skewed data in a parallel In-memory database. By the solution we propose, we were targeting applications that require mainly insert, delete and range queries. When the range queries are operating on a range partitioned system suffering from a very high degree of imbalance, the challenge is to efficiently ensure a best performance. In order to reduce the cost of maintaining load statistics as low as possible, we propose to use an approximate partition statistics table PST. Both clients and nodes have an imperfect view about the load distribution across nodes. Based on this table, a node performs a load balancing whenever its data size passes a local threshold. It changes its range and transfers the out-of-range data to its neighbors.
The transfer process continues until the nodes satisfy the threshold. The experiments that we set in our laboratory, show that our solution guarantees an imbalance ratio close to 1, which means that the storage balance is achieved successfully. They show also that the access costs of the read-only clients remain very low, despite the high degree of data skew generated in these experiments. In particular, we have obtained a quasi-null degradation of parallel range query costs over a very dynamic range partitioned database where boundaries continuously change (for load balancing purposes). While the present solution describes an approach for eliminating data skew, one could apply the same techniques to minimize execution skew. Furthermore, we also plan to address the issue of handling data skew in parallel join algorithms using the PST concept.
Human data Two human studies with the NF were provided  (ST&T Consultants, 2009c, unpublished; Jensen et al. , 2015)  one of which reported on safety related endpoints  (ST&T Consultants, 2009c, unpublished). This trial  (ST&T Consultants, 2009c, unpublished)  was an open-label uncontrolled pilot study conducted in 42 subjects of at least 18 years with a history of arthritic-type joint pain or connective tissue disorder with a reduced range of knee motion. The study subjects were instructed to consume for 6 weeks 450 mg/day of the NF. The primary endpoint of the study was to assess a potential effect of the NF on pain, stiffness, and discomfort of knee-associated musculoskeletal disorders. As secondary endpoint the safety of the NF was investigated. Health evaluations of the study subjects were performed at baseline and at weeks 2, 4 and 6.
If the cards had been completely damaged, it would have been possible that Plattner and the other cofounders would not have been able to completely rewrite the software program in the same way as it was before, and since the opportunity costs of becoming consultants were lower than spending more time for the software program (without a funding source), they would have become consultants. In a similar way, another (future) ERP vendor started its operation quite differently, but shifted its focus. Larry Elison, Oracle Corporation's cofounder, initially started to focus on IBM's System R, which is a database system and the first application of SQL. Even though his aim was to have a compatible product with IBM's System R, but his efforts were stopped by IBM, which did not agree to provide him some error codes  [60].
Cell morphology, flagellum length and kinetoplast fluorescence Harvested cells were fixed in 4% paraformaldehyde, washed in PBS and directly loaded on fluorescence slides before mounting with SlowFade Gold antifade mountant with DAPI (Life Technologies, Saint-Aubin, France). Images were captured using a BX51 fluorescence microscope (Olympus, France) and the fluorescence imaging system Cell A (Olympus, France). The software ImageJ 1. 48s was then used for evaluation of cell morphology (area, major and minor axes of the fitted ellipse of each cell), for flagellum length and for kinetoplast fluorescence (max gray value of the kinetoplast).
Annexin V For Annexin V labeling, cells were washed once with PBS and resuspended in 50 µL Binding Buffer (BD Biosciences, France) in which 2. 5 µL of AnnexinV BV421 (BD Biosciences, France) and 2. 5 µL of PI (Sigma-Aldrich, Saint-Louis, MO, USA) at 0. 5 mg/mL were added. Cells were incubated 15 min at room temperature in the dark before adding 200 µL of Binding Buffer. The cells were analyzed by flow cytometry using 488 nm excitation and measuring violet fluorescence emission for Annexin V (450/50 bandpass) and red fluorescence emission for PI (610/20 bandpass) on the BD LSRFortessa™ cell analyzer (BD Biosciences, France). Data were exported and analyzed with Flowjo software for evaluation of the percentage of Annexin V-positive cells and of the FSC median.
Calcein and PI labeling Cells were washed once in PBS and resuspended in 1 mL of PBS with 2 µL of calcein (LIVE/DEAD® Viability/Cytotoxicity Kit for mammalian cells, Molecular Probes, OR, USA) diluted 1/80 in DMSO and 4 µL PI at 0. 5 mg/mL. The mixed sample was then incubated for 15-20 minutes at room temperature, protected from light. The cells were analyzed by flow cytometry using 488 nm excitation and measuring green fluorescence emission for calcein (530/30 bandpass) and red fluorescence emission for PI (610/20 bandpass) on the BD LSRFortessa™ cell analyzer. Data were exported and analyzed with Flowjo software for evaluation of the percentage of calcein-and PI-positive cells and of the FSC median.
DiOC6 fluorescence For monitoring the mitochondrial membrane potential, cells were washed once in PBS before addition of 60 nM DiOC6 (3,3′dihexyloxacarbocyanine iodide) (Sigma-Aldrich, Saint-Louis, MO, USA). Cells were then incubated for 30 min at 26°C, washed in PBS and resuspended in PBS. DiOC6 fluorescence was measured by flow cytometry using 488 nm excitation and measuring green fluorescence emission on the BD LSRFor-tessa™ cell analyzer. Data were exported and analyzed with Flowjo software for evaluation of the percentage of cells with a depolarized or hyperpolarized mitochondrion and of the FSC median.
ACKNOWLEDGEMENTS We thank  Jeremy Mottram  for the construction of the pGL1078 GFP-ATG8 vector and  Ger van Zandbergen  for providing us the vector. We also thank the  CNR Leishmania (Montpellier, France)  for the L. major strain and  Nicolas Fasel  for helpful discussion. This work was supported by the  French Government  under the  « Investissements d'avenir » (Investments for the Future) program  managed by the  Agence Nationale de la Recherche (National Agency for Research)  (reference: Méditerranée Infection  10-IAHU-03 ). It was also supported by the  PHC Germaine de Staël  (project  n°35021RJ ).
UCMSC production Umbilical cords were collected at Nancy Maternity Hospital from new mothers who had signed an informed consent form in compliance with French national legislation regarding human sample collection, manipulation, and personal data protection. The collection protocol was approved by the local ethics committee and the French ministry for research (No. DC-2014-2114). All UCMSCs were produced at clinical-grade in α-MEM culture medium (Macopharma, Mouvaux, France) enriched with 5% platelet lysate (Macopharma, Mouvaux, France) and applying good manufacturing practices. Briefly, UCs were immersed in an antibiotic-antifungal solution composed of gentamicin, amoxicillin, vancomycin, and amphotericin B for 1 h at room temperature. The cord was then cut into thin pieces which were placed in complete medium.
26×1. 26mm, GRAPPA 2, 30 to 40 phases were reconstructed. For the ventricular parameters, a short-axis balanced steady state free precession cine sequence with TR/TE of 2. 3/1. 0ms and a GRAPPA acceleration factor of 3 was used for imaging cardiac function. Additionally, 2 and 4 chamber cine sequence were acquired at rest. Velocity encoding gradient pulse sequences were acquired to assess the regurgitant fraction of the pulmonary valve and were positioned perpendicular to the pulmonary artery. The following parameter were used: through plane direction, maximum encoding velocity 200 cm/s, TR = 28. 35ms, TE = 2ms, α = 30˚, slice thickness = 6 mm, FOV = 192x280, 60 reconstructed phases. Data were reconstructed in magnitude and phase. If flow artefacts were found on the SSFP images level with the ascending aorta, aortic compliance was measured by using magnitude images reconstruction acquired on the same plane as the cine images  [23].
Considering that the heart rate and blood pressure diminished quickly, only two cine datasets were acquired immediately after the cycling stopped. The exercise heart rate was recorded at the time of imaging during each image acquisition. The exercise heart rate was calculated as the mean heart rate value measured during the first cine and the second cine data set acquired during the same exercise stop. The delay between the end of exercise and image acquisition was 20 ±7s. Before and after each exercise stop, the arterial diastolic and systolic blood pressures were measured using a brachial automatic sphygmomanometer (Maglife, Schiller Medical). The exercise blood pressure reported in the result section was the mean systolic and the mean diastolic pressure calculated during an exercise stop.
Data post processing Argus software (Siemens Healthineers, Erlangen, Germany) was used to measure all ventricular parameters, i. e. ejection fraction, end diastolic/systolic volume, stroke volume (SV), cardiac output (CO) at rest and during stress. The segmentation was performed using a semi-automatic method initiated by visually selecting the end diastolic and end systolic frames, and manually tracing the endocardial borders. All data were analyzed by consensus between a junior radiologist and a senior radiologist specialized in CMR with over 10 years of experience. Aortic compliance (AC) data were analyzed using the QIR scientific image analysis software (Universitede Bourgogne, Dijon, France)  [23]. The contours of the aorta were automatically traced for all phases of the cardiac cycle.
Attempts of their identification was performed using elemental EDS analysis, as shown in Figure  2G-I, Figures S12-S19  and Tables S5-S8, supported by a search in a crystallographic database  [31]. Unfortunately, our attempts to isolate these corrosion products and investigate them with X-ray diffraction were unsuccessful due to the small size of their crystals and relatively low number of well-formed corrosion sites. Round-shaped small crystals most likely might be one of the hydrogenated lanthanum carbonates or oxalates, as shown in Figure  2D ,G. The EDS elemental analysis showed high content of lanthanum, oxygen, and carbon within the crystals, while concentration of all other possible elements was much lower: Ni, Co, Mn, Al, Ce, Nd, Pr, Au, as shown in Figures  S5  and S6  and Table  S5.
Ten crystalline La-C-O compounds were found in the Inorganic Crystal Structure Database (ICSD)  [31] , all of which were lanthanum carbonates and oxalates at various levels of hydration, as shown in Table  S10. It is impossible to judge which of those compounds were observed in our samples. La-C-O crystals were relatively small, not exceeding 2 µm in diameter, and they were appearing in a larger formation of 80-100 crystals. Crystals in the shape of bipyramids are most likely rubidium-lanthanum oxide, as shown in Figure  2E ,H. EDS elemental analysis showed simultaneous high content of rubidium, lanthanum, and oxygen within the crystals, with depletion of all other elements possible to be found in this sample: Ni, Co, Mn, Al, Ce, Nd, Pr, Au, as shown in Figures  S14  and S15  and Table  S6.
RbLaO 2 was the only compound found in the ICSD crystallographic database, as shown in Table  S10   [31] , to contain exclusively rubidium, lanthanum, and oxygen  [32]. Rb-La-O crystals observed were well-formed, having 15-20 µm in diameter, and appearing in groups of 5-10. The elongated rectangular crystals are most likely rubidium-cerium oxide, as shown in Figure  2F ,I. High concentration of rubidium, cerium, and oxygen was detected within the crystals with EDS, as shown in Figures  S16  and S17  and Table  S7. Rb 2 CeO 3 was the only compound containing Rb-Ce-O elements  [33]  found in the crystallographic database  [31]. Purity of these crystals may result from inaccessibility of the +IV oxidation state by other lanthanides than cerium. The observed crystals were of various sizes starting from 2-3 µm in length, fully stuck to the surface, up to the crystals of 10-16 µm long, growing perpendicularly to the surface.
Design and patients: We collected prospective data from patients undergoing thyroidectomy by single nodule or multinodular goitre between 2006 and 2016. A total of 417 patients were included. Ultrasounds were classified as suspected of malignancy if they had 2 or more of the following characteristics: hypoechogenicity, microcalcifications, intranodular central hypervascularization, irregular margins and poorly defined edges. Measurements: Ultrasound and fine-needle aspiration accuracy.