检索结果-内蒙古大学图书馆

作者： Yu, Huilin University of Miami

学位级别：Ph.D.

Health disparity is an important public health policy concern as it is related to the social inequalities in population health, not only for the persons experiencing them, but also for the entire population in the society. People experiencing poorer health status will negatively impact the overall health of the nation and this inequality is costly as well as burdensome to healthcare system. Health disparities studies allow us to identify and understand disparities, eventually design intervention strategies that could be more effective in reducing disparities. This thesis is mainly focused on building new statistical models for disparity studies in response to the complex data types which we encounter today. We propose tree-based models to unveil the distribution of disparities in a population through the hierarchical interaction between individual level variables (like clinical variables or genetic variables) and social determinants of health (like SES, education level etc). Precision medicine has the potential to revolutionize medicine because clinical decisions can in theory be made in a manner that is more customized to an individual patient. It’s not surprising then that there has been growing interest in trying to identify and reduce disparities using precision medicine constructs. Central to this paradigm is the search for what we term disparity subtypes. We will take the tree-based models we developed as well as another framework known as peeling and develop a new statistical framework for the identification of disparity subtypes. Even though much of disparity science has traditionally focused on social determinants of health, the move towards an integrative framework together with biological determinants requires that researchers must be able to find a common language and framework for connecting the two. Additionally, as biological data increases, so does the contextual information that researchers are collecting. Thus it’s imperative to be able to quantify

关键词： disparity estimation tree-based algorithm individual and environmental factor interaction

来源：评论

学校读者我要写书评

暂无评论

algorithmic Solutions for RFID Tag Anti-Collision Problem in Supply Chain Management

引用

Procedia Computer Science 2019年 151卷 929-934页

作者： Kamalendu Pal Department of Computer Science City University of London London ECV 0HB United Kingdom

The Radio Frequency IDentification (RFID) is a wireless communication technology that enables automatic identification, tracking and data collection from any tagged object in a supply chain operating environment. A simple RFID system uses radio signals to transmit data via a tiny portable device, called a tag, which is read by an RFID reader and processed by the corporate information system (IS) to meet the needs of business management. One of the important performance issues in this system is to resolve RFID tag collision. Tag collision happens when two or more tags reflects-back their individual identification radio signals to the reader at the same time thus confusing the reader identification process. Different algorithmic solutions on tag collision are available. They are generally in two main categories of anti-collision problems: ALOHA-based solutions and tree-based solutions. However, ALOHA-based algorithms suffer from a time-related starvation problem. The well-known tree-based algorithms are Binary tree (BT) and Query tree (QT). In addition, QT algorithms are very efficient in memory utilization in comparison to other algorithmic solutions. This paper presents simulation-based experimental results on the performance of some well-known BT-based algorithms: simple Binary Search algorithm (BSA), Dynamic Binary Search algorithm (DBSA), and Backtrack Binary algorithm (BBA).

关键词： Radio Frequency Identification Wireless Communication Supply Chain Management Tag Collision ALOHA-based algorithm tree-based algorithm

来源：评论

学校读者我要写书评

暂无评论

Fast Winding Numbers for Soups and Clouds

引用

ACM TRANSACTIONS ON GRAPHICS 2018年第4期37卷 1-12页

作者： Barill, Gavin Dickson, Neil G. Schmidt, Ryan Levin, David I. W. Jacobson, Alec Univ Toronto Toronto ON Canada Side Effects Software Inc Toronto ON Canada Gradientspace Toronto ON Canada UofT 40 St George St Toronto ON M5S 2E4 Canada

Inside-outside determination is a basic building block for higher-level geometry processing operations. Generalized winding numbers provide a robust answer for triangle meshes, regardless of defects such as self-intersections, holes or degeneracies. In this paper, we further generalize the winding number to point clouds. Previous methods for evaluating the winding number are slow for completely disconnected surfaces, such as triangle soups or-in the extreme case-point clouds. We propose a tree-based algorithm to reduce the asymptotic complexity of generalized winding number computation, while closely approximating the exact value. Armed with a fast evaluation, we demonstrate the winding number in a variety of new applications: voxelization, signing distances, generating 3D printer paths, defect-tolerant mesh booleans and point set surfaces.

关键词： generalized winding number inside-outside segmentation tree-based algorithm robust geometry processing

来源：评论

学校读者我要写书评

暂无评论

RFID Anti-Collision Technology in Big Data Environment

引用

INTERNATIONAL JOURNAL OF ONLINE ENGINEERING 2018年第5期14卷 42-57页

作者： Chen, Buying Xingtai Polytech Coll Informat Engn Dept Xingtai Peoples R China

Along with the rapid development of Web of Things, the RFID technology is widely applied in every field, but today, the great challenge we face is how to avoid information conflict and collision in the process of acquisition and treatment of massive information. It is the keystone of the study. This paper conducts a comparative analysis on different tree-based algorithms as improved, and integrated with multiple sub-cycle response mechanism, a Multi-Response Collision tree algorithm is proposed. And beyond that, this paper simulates and analyzed this algorithm and other improved ones. The results reveal that, compared to other algorithms, MRCT algorithm features a better performance, less recognition cycles, least query time slots on average, and ceiling throughput rate.

关键词： RFID anti-collision tree-based algorithm Manchester code

来源：评论

学校读者我要写书评

暂无评论

Ramification algorithm for graphene sample-defect localization 25

Ramification algorithm for graphene sample-defect localizati...

引用

Conference on Automatic Target Recognition XXV

作者： Sokolnikov, Andre Visual Solut & Applicat South Bend IN 46615 USA

ISBN: (纸本)9781628415926

Recent development of a new 2D material graphene necessitates sample characterization (in particular localization and distribution of defects). The presence of defects is unavoidable, however, it is possible to determine and predict defect distribution in graphene samples prior to the actual device making. A ramification algorithm is used for the above purpose.

关键词： graphene adaptive modeling prediction modeling tree-based algorithm 2D systems

来源：评论

学校读者我要写书评

暂无评论

Multisensor fusion with the ramification algorithm 25

Multisensor fusion with the ramification algorithm

引用

Conference on Automatic Target Recognition XXV

作者： Sokolnikov, Andre Visual Solut & Applicat South Bend IN 46615 USA

The present approach combines data fusion from several sensor types to enhance the overall detection and classification performance. The fusion of different sensors is implemented at data and feature levels that resul... 详细信息

ISBN: (纸本)9781628415926

关键词： Automatic Target Recognition adaptive modeling prediction modeling tree-based algorithm multisensor fusion ramification algorithm

来源：评论

学校读者我要写书评

暂无评论

Matrix superposition structure with a tree-based principle

Matrix superposition structure with a tree-based principle

引用

Conference on Automatic Target Recognition XXIV

作者： Sokolnikov, Andre Visual Solut & Applicat South Bend IN USA

ISBN: (纸本)9781628410273

If we assume that a natural image can be modeled as a succession of a multilevel system, we can develop an optimal routine of a matrix superposition. Each matrix separates the fundamental elements by a set of optimal criteria. The matrix superposition is then characterized by a tree-based principle which is applied adaptively. We will also demonstrate how the missing data constrains may be overcome by collecting additional measurements.

关键词： Automatic Target Recognition adaptive modeling prediction modeling tree-based algorithm

来源：评论

学校读者我要写书评

暂无评论

An Effective Temporary ID based Query tree algorithm for RFID Tag Anti-collision

An Effective Temporary ID Based Query Tree Algorithm for RFI...

引用

International Workshop on Internet of Things (IOT Workshop 2012)

作者： Tian, Yun Chen, Gongliang Li, Jianhua Shanghai Jiao Tong Univ Sch Informat Secur Engn Shanghai 200030 Peoples R China

ISBN: (纸本)9783642324260

This paper proposes an effective temporary ID based query tree algorithm (TID QTA) for RFID tag anti-collision. Tags with 96-bit UID are mainly concerned. In TID QTA, a 16-bit sequence is selected from tag ID as its TID and query tree algorithm is implemented based on TID. If two tags have the same TID, they will renew their TIDs by selecting another 16 bits from their IDs. The simulation results show that the average number of transmitted bits for one tag identification in TID QTA is the fewest among QTA and its variants.

关键词： anti-collision tree-based algorithm temporary ID tag identification

来源：评论

学校读者我要写书评

暂无评论

A tree-based algorithm for determining the effects of solvation on the structure of salivary gland tripeptide NH₃⁺-D-PHE-D-GLU-GLY-COO^-

引用

BIOPHYSICAL JOURNAL 2003年第3期85卷 1503-1511页

作者： Metwally, E Ismail, HA Davison, JS Mathison, R Univ Calgary Dept Physiol & Biophys Calgary AB Canada

A D-enantiomeric analog of the submandibular gland rat-1 tripeptide FEG (Seq: NH3+-Phe-Glu-Gly-COO-) called feG (Seq: NH3+- D-Phe-D-Glu-Gly-COO-) was examined by molecular dynamics simulations in water. Previous in vacuo simulations suggested a conformation consisting predominantly of interactions between the Phe side chain and glutamylcarboxyl group and a carboxyl/amino termini interaction. The solvated peptide was simulated using two approaches which were compared - a single 400-ns simulation and a "simulation tree.'' The "tree'' approach utilized 45 10-ns simulations with different conformations used as initial structures for given trajectories. We demonstrate that multiple short duration simulations are able to describe the same conformational space as that described by longer simulations. Furthermore, previously described in vacuo interactions were confirmed with amendments: the previously described head-to-tail arrangement of the amino and carboxyl termini, was not observed;the interaction between the glutamyl carboxyl and Phe side chain describes only one of a continuum of conformations present wherein the aromatic residue remains in close proximity to the glutamyl carbonyl group, and also interacts with either of the two available carboxyl groups. Finally, utilizing only two separate 10-ns trajectories, we were able to better describe the conformational space than a single 60-ns trajectory, realizing a threefold decrease in the computational complexity of the problem.

关键词： .trajectories solvation solvated conformations Phe conformational space duration carboxyl submandibular tree-based algorithm Gland Tripeptide tripeptide FEG vacuo single ns simulation tree

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：