scholarly journals A Study of Update Methods for BoND-Tree Index on Non-ordered Discrete Vector Data

10.29007/3zq4 ◽  
2020 ◽  
Author(s):  
Ramblin Cherniak ◽  
Qiang Zhu ◽  
Sakti Pramanik
Keyword(s):  
Original Work ◽  
Vector Data ◽  
Large Dataset ◽  
Bottom Up ◽  
Data Space ◽  
Tree Index ◽  
Increasing Demand ◽  
Index Tree ◽  
Discrete Domain ◽  
Query Algorithms

There is an increasing demand from numerous applications such as bioinformatics and cybersecurity to efficiently process various types of queries on datasets in a multidimensional Non-ordered Discrete Data Space (NDDS). An NDDS consists of vectors with values coming from a non-ordered discrete domain for each dimension. The BoND-tree index was recently developed to efficiently process box queries on a large dataset from an NDDS on disk. The original work of the BoND-tree focused on developing the index construction and query algorithms. No work has been reported on exploring efficient and effective up- date strategies for the BoND-tree. In this paper, we study two update methods based on two different strategies for updating the index tree in an NDDS. Our study shows that using the bottom-up update method can provide improved efficiency, comparing to the traditional top-down update method, especially when the number of dimensions for a vector that need to be updated is small. On the other hand, our study also shows that the two update methods have a comparable effectiveness, which indicates that the bottom-up update method is generally more advantageous.

A Bottom-Up Distance-Based Index Tree for Metric Space

2006 ◽  
pp. 442-449 ◽  
Author(s):  
Bing Liu ◽  
Zhihui Wang ◽  
Xiaoming Yang ◽  
Wei Wang ◽  
Baile Shi
Keyword(s):  
Metric Space ◽  
Bottom Up ◽  
Index Tree

Improved Top-k Query Processing on Uncertain Data

2013 ◽  
Vol 380-384 ◽  
pp. 2837-2840
Author(s):  
Shuang Zhang ◽  
Shi Xiong Zhang
Keyword(s):  
Theoretical Analysis ◽  
Query Processing ◽  
Uncertain Data ◽  
Experimental Results ◽  
Bottom Up ◽  
Algorithm Efficiency ◽  
The Core ◽  
Query Algorithms

Bottom-up algorithm, which is one of the two probabilistic Top-k query algorithms, was improved. The core of the bottomup algorithm is the iteration on the three courses of bounding, pruning,and refining towards the objects and instances. The main contribution is to change the iteration on instances of objects one by one into iterating all the instances of objects from the superior to the inferior;and to transform the condition and sequence of pruning in order to make the pruning more effective. Theoretical analysis and experimental results show that the algorithm efficiency could be obviously increased by about 20%.

scholarly journals Bottom-up Modular Synthesis of Well-Defined Oligo(arylfuran)s

2021 ◽  
Author(s):  
Yang Chen ◽  
Tongxiang Cao ◽  
Shifa Zhu
Keyword(s):  
De Novo ◽  
Photophysical Properties ◽  
Fluorescence Emission ◽  
Coupling Reaction ◽  
Structural Diversity ◽  
Modular Construction ◽  
Bottom Up ◽  
Charge Delocalization ◽  
Increasing Demand ◽  
Polarity Sensitive

Abstract Oligofurans have attracted great attention in the field of materials over the last decades because of their several advantages, such as strong fluorescence, charge delocalization, and increased solubility. Although unsubstituted or alkyl substituted oligofurans have been well-established, there is an increasing demand for the development of the aryl decorated oligofuran with structural diversity and unrevealed properties. Here we report the first example of bottom-up modular construction of chemically and structurally well-defined oligo(arylfuran)s by de novo synthesis of α,β'-bifuran monomers and subsequent coupling reaction. Moreover, a preliminary study of the photophysical properties demonstrated that the polarity-sensitive fluorescence emission (up to 530 nm) and ultra-high Stokes shifts (up to 244 nm) could be achieved by modulating the aryl groups on the oligo(arylfuran)s. These twisted molecules constitute a new class of oligofuran backbone useful for structure−activities relationship studies and appear to be promising fluorophores.

Sickness, medical welfare and the English poor, 1750-1834

2018 ◽  
Author(s):  
Steven King
Keyword(s):  
Nineteenth Century ◽  
Moral Obligation ◽  
Ordinary People ◽  
Large Dataset ◽  
Early Nineteenth Century ◽  
Bottom Up ◽  
Poor Law ◽  
The Poor

This book explores the welfare experiences of the sick poor between the 1750s and through the so-called crisis of the Old Poor Law ending in the 1830s. It brings together a large dataset of accounts, vestry minutes, bills, contracts and letters by or about the poor to provide a comprehensive and colourful overview of the nature, scale and negotiation of medical welfare. At its core stand the words and lives of the poor themselves, reconstructed in painstaking detail to show that medical welfare became a totemic issue for parochial authorities by the 1830s. The book suggests that the Old Poor Law confronted a rising tide of sickness by the early nineteenth century. While there are spectacular instances of parsimony and neglect in response to such rising need, in most places and at most times, parish officers seem to have felt a moral obligation to the sick. Indeed, we might by and large construct their responses as considerate and generous. To some extent this reflected Christian paternalism, but we also see other factors at play. These include a growing sense that illness, even illness amongst the poor, was and should be remediable and a shared territory of negotiation between paupers, advocates and officials. The result was a canvas of medical welfare with extraordinary colour and depth. By the 1820s, more of the ill-health of ordinary people was captured by the poor law and being doctored or sojourning in an institution became part of pauper and parochial expectation. These trends are brought to vivid life in the words of the poor and their advocates, such that the book genuinely offers a re-interpretation of the Old Poor Law in it slater phases form the bottom up.

A Distributed Index Tree and its Concurrency Control Algorithm

2014 ◽  
Vol 1044-1045 ◽  
pp. 982-985
Author(s):  
Wei Jie Gu ◽  
Yun Liang Wang
Keyword(s):  
Theoretical Analysis ◽  
Concurrency Control ◽  
Control Algorithm ◽  
Control Method ◽  
Experimental Results ◽  
Massive Data ◽  
Time Control ◽  
Distributed Index ◽  
Tree Index ◽  
Index Tree

This paper presents a new distributed index tree named RDB+-Tree and a concurrency control algorithm named VTC-RDB+. In RDB+-Tree, the leaf node is organized for a hash list. The principle of VTC-RDB+ algorithm can be established by utilizing multiple elements which are in favor of concurrency control and by combining with version and time control method. Theoretical analysis and experimental results show that the RDB+-Tree index tree and VTC-RDB+ algorithm can effectively enhance the query and updating performance of the massive data in the distributed circumstance.

A New Robust Top-Down Method for Measurement Uncertainty Estimation of the ED(P)- XRFS Outcomes Carried on a Fluorescence Glass

2018 ◽  
Vol 69 (9) ◽  
pp. 2487-2493
Author(s):  
Ion Pencea ◽  
Mihai Branzei ◽  
Mihai Ovidiu Cojocaru ◽  
Ramona Nicoleta Turcu ◽  
Cristian Predescu ◽  
...  
Keyword(s):  
Measurement Uncertainty ◽  
Robust Statistics ◽  
Uncertainty Budget ◽  
Top Down ◽  
Bottom Up ◽  
Doped Glasses ◽  
Composition Measurement ◽  
Increasing Demand ◽  
New Criterion ◽  
Non Destructive

The rare earths doped glasses have been considered as the best solution to fulfil the increasing demand for cheaper fluorescent taggants. The ensuring a high quality of a spectral taggant batch imposes, among others, an exact chemical composition measurement. The most convenient method for elemental analysis of powdered specimens is Energy Dispersive (Polarised)- X-ray Fluorescence Spectroscopy (ED(P)-XRFS) because it has many advantages: non-destructive, large analytical range, robustness, easy sample preparation, cheaper consumables, less time consuming etc. ED(P)-XRFS has some inherent analytical drawbacks such as: interelements interferences, matrix dependence etc. The only way to overcome the drawbacks is a proper method for the measurement uncertainty (MU) estimation of the outcomes. Consequently, the paper argues that the bottom-up method for MU estimation is feeble as long as the sensitivity coefficients of the factors of uncertainty budget are not well known and documented, which is the habitual case of the ED and WD XRFS bottom-up published methods. The paper substantiates a new robust top-down method for MU estimation of the ED(P)-XRFS outcomes carried on a fluorescence glass. Also, the paper presents a representative case study of appliance of the developed top-down method. The other novelties addressed in the paper are: i. Introducing the robust statistics as further checks for the accuracy of mean and of standard deviation, according to ISO 13583:2015; ii. A new criterion for testing the normal distribution of the mean of a set of fewer outcomes based on Central Limit Theorem and on the central momentum of third orde; iii. The method was implemented for multiple simultaneous outcomes. The top-down method, given in the paper, can be applied to ED- and WD-XRFS routine measurements in industrial laboratories or in material science ones, but it can be adapted, without much effort, to other types of tests e.g. hardness, XRD etc.

Development of 200 kV Scanning-Transmission Electron Microscope

1974 ◽  
Vol 32 ◽  
pp. 410-411
Author(s):  
H. Koike ◽  
S. Sakurai ◽  
K. Ueno ◽  
M. Watanabe
Keyword(s):  
Electron Microscopy ◽  
Electron Microscope ◽  
Scanning Transmission Electron Microscope ◽  
The Other ◽  
Morphological Observation ◽  
Magnetic Domains ◽  
Transmission Electron ◽  
Scanning Transmission ◽  
Backscattered Electron ◽  
Increasing Demand

In recent years, there has been increasing demand for higher voltage SEMs, in the field of surface observation, especially that of magnetic domains, dislocations, and electron channeling patterns by backscattered electron microscopy. On the other hand, the resolution of the CTEM has now reached 1 ∼ 2Å, and several reports have recently been made on the observation of atom images, indicating that the ultimate goal of morphological observation has beem nearly achieved.

The Evolution of an SLPA Program

2009 ◽  
Vol 10 (1) ◽  
pp. 4-11
Author(s):  
Susan Sparks ◽  
Lisa Van Horne
Keyword(s):  
The State ◽  
Online Discussions ◽  
Speech Language Pathology ◽  
Speech Language Pathologists ◽  
Assigned Reading ◽  
Language Pathology ◽  
Strict Compliance ◽  
Increasing Demand

Abstract There is an increasing demand for qualified individuals available in our profession. One answer to this crisis is to hire trained speech-language pathology assistants (SLPAs) to assist speech language pathologists (SLPs). Shoreline Community College's SLPA program was created in response to the shortage of fully trained SLPs. The program is designed in strict compliance with ASHA's guidelines (ASHA, 2004). Students attend lectures remotely, complete assigned reading, take quizzes, engage in in-class and online discussions, turn in assignments, and take exams without ever having to commute to the Shoreline campus. This allows students from across the state to complete their education while continuing to live and work in their communities.

Sign in / Sign up

Export Citation Format

Share Document