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

A framework for a consistent and reproducible evaluation of manual review for patient matching algorithms

JOURNAL OF THE AMERICAN MEDICAL INFORMATICS ASSOCIATION 2022年第12期29卷 2105-2109页

作者： Gupta, Agrayan K. Kasthurirathne, Suranga N. Xu, Huiping Li, Xiaochun Ruppert, Matthew M. Harle, Christopher A. Grannis, Shaun J. Indiana Univ Indianapolis IN USA Regenstrief Inst Hlth Care Ctr Biomed Informat Indianapolis IN USA Indiana Univ Sch Med Dept Family Med Indianapolis IN USA Univ New South Wales Black Dog Inst Sydney NSW Australia Indiana Univ Sch Med Dept Biostat Indianapolis IN USA Univ Florida Hlth Dept Med Gainesville FL USA Univ Florida Precis & Intelligent Syst Med PrismaP Gainesville FL USA Univ Florida Coll Med Dept Hlth Outcomes & Biomed Informat Gainesville FL USA

Healthcare systems are hampered by incomplete and fragmented patient health records. Record linkage is widely accepted as a solution to improve the quality and completeness of patient records. However, there does not exist a systematic approach for manually reviewing patient records to create gold standard record linkage data sets. We propose a robust framework for creating and evaluating manually reviewed gold standard data sets for measuring the performance of patient matching algorithms. Our 8-point approach covers data preprocessing, blocking, record adjudication, linkage evaluation, and reviewer characteristics. This framework can help record linkage method developers provide necessary transparency when creating and validating gold standard reference matching data sets. In turn, this transparency will support both the internal and external validity of recording linkage studies and improve the robustness of new record linkage strategies.

关键词： JAMIA manual review gold standard patient matching matching algorithms

来源：评论

学校读者我要写书评

暂无评论

Synchronous Distributed Greedy Weighted Graph matching algorithms For Wireless Sensor Networks 4

Synchronous Distributed Greedy Weighted Graph Matching Algor...

引用

4th International Conference on Computer Science and Engineering (UBMK)

作者： Ersin, Ismail Ileri, Can Umut Dagdeviren, Orhan Ege Univ Int Comp Inst Izmir Turkey

ISBN: (纸本)9781728139647

Wireless Sensor Networks (WSN) consist of devices that can communicate with each other without using any fixed infrastructure. These devices can gather necessary information from the environment via their sensors and share collected data with each others. WSNs can be modelled with graphs (G (V, E)) where V is the set of vertices (nodes) and E is the set of edges. Graph theoretical structures such as graph matching can be used to solve various problems such as backup assignment in WSNs. With this aim, we first design a synchronous distributed weighted graph matching algorithm based on Hoepman's algorithm. After this the synchronous algorithm is improved by using overhearing method to design ICO algorithm. Proposed ICO algorithm aims to decrease the transmitted message count for graph matching operation by applying in-network processing. These algorithms are tested on various settings having different node counts and degrees in TOSSIM simulator by comparing with each other. The results of these extensive tests reveal us that ICO is more effective in terms of energy consumption and transmitted bytes.

关键词： matching algorithms Hoepman Wireless Sensor Networks Distributed algorithms

来源：评论

学校读者我要写书评

暂无评论

Method for rapidly generating urban damage scenarios under non-uniform ground motion input based on matching algorithms and time history analyses

引用

SOIL DYNAMICS AND EARTHQUAKE ENGINEERING 2022年 152卷 107055-107055页

作者： Chen, Xianan Lin, Xuchuan Zhang, Lingxin Skalomenos, Konstantinos A. China Earthquake Adm Inst Engn Mech Key Lab Earthquake Engn & Engn Vibrat 29 Xuefu Rd Harbin 150080 Peoples R China Univ Birmingham Dept Civil Engn Birmingham W Midlands England

Due to the rapid urbanization, the built environment becomes more complex and denser, making cities especially vulnerable to strong earthquakes. It is important to simulate seismic disaster scenarios of buildings and critical infrastructures accurately in a reasonable time for the development of urban disaster prevention strategies and decision-making frameworks for post-earthquake emergence rescue. In this study, a novel methodology is established to rapidly generate detailed seismic disaster scenarios that virtually illustrate the damage distribution of buildings in city level without executing time history analysis. The non-uniform distribution of ground motions is taken into account for a large area. The large city is divided into small areas, and a scenario database is generated by performing massive nonlinear time history analyses through the city-level simulation platform recently developed by the authors. The proposed method selects and composes the best matching disaster scenarios by assessing the scenario database within a very short time using matching algorithms. Three matching algorithms, including the single wave matching algorithm, multiple waves splicing matching algorithm and multiple waves combination matching algorithm, are applied to form disaster scenario for any given input ground motion. The performance and effectiveness of the three matching algorithms are examined and a case study on simulation of a large city is presented. The results show that the matching algorithms are all feasible, and the multiple waves splicing matching algorithm is the most efficient. The proposed methodology not only produces reasonably similar results and findings to those obtained by the nonlinear time history analysis directly, but also can reduce the computing time by over 98%.

关键词： Urban earthquake disaster Building structures Ground motion database Seismic disaster scenario matching algorithms

来源：评论

学校读者我要写书评

暂无评论

matching algorithms to assist in designing with reclaimed building elements

引用

ENVIRONMENTAL RESEARCH: INFRASTRUCTURE AND SUSTAINABILITY 2023年第3期3卷 035005-035005页

作者： Tomczak, A. Haakonsen, S. M. Luczkowski, M. Norwegian Univ Sci & Technol Dept Civil & Environm Engn Hogskoleringen 7a N-7491 Trondheim Norway Norwegian Univ Sci & Technol Dept Struct Engn Richard Birkelands Vei 1A N-7491 Trondheim Norway

Reuse of building components is one of the recommended circular strategies to reduce the environmental impact of new buildings. However, reclaimed building components are more difficult to design with than new products. While new products can be made to match exact needs, the salvaged components have predefined dimensions and quality limitations. Following the Design Science Research methodology, we attempt to answer how the reuse design can be aided by a digital design tool. The developed matching algorithms suggest the optimal assignment of available elements for the desired configuration, considering user-defined constraints and optimisation criteria. In the test cases, we seek to optimise the global warming potential of timber framing elements, defined by life cycle assessment, though the tool is not limited to this objective. The implementation includes greedy algorithms, bipartite graphs, and mixed integer linear programming. The usefulness of the proposed solution is evaluated on simulated sets of building elements in terms of embodied emission reduction and speed of the calculation. The paper contributes with methodologies, algorithms, and test cases to assess their performance. Practitioners can apply the proposed solution to reduce the time of designing with salvaged materials, which can lead to the popularisation of the circular design.

关键词： reuse circular economy disassembly building components matching algorithms

来源：评论

学校读者我要写书评

暂无评论

Impacts of On-Demand Shuttle System Parameters on its Metrics: A Microsimulation Study

引用

Transportation Research Procedia 2025年 86卷 491-499页

作者： Oytun Arslan Silja Hoffmann Chair of Intelligent Multimodal Transport Systems University of the Bundeswehr Munich Neubiberg 85577 Germany

The essence of an on-demand shuttle system is an intelligent matching algorithm, where vehicles and passenger requests are matched to each other in an optimized way. Many studies have touched upon this issue by using macroscopic simulation or agent-based simulation. Modelling on-demand shuttle systems in microsimulation can be very advantageous since it is in general a good means to analyze traffic management measures and new mobility concepts. The aim of this paper is to model an on-demand shuttle system in microsimulation environment and analyze the impact of its system parameters which are fleet size, vehicle capacity, maximum waiting time and maximum detour ratio on some metrics such as served requests ratio, shared rides ratio, average waiting time and average detour time.

关键词： on-demand shuttle system microsimulation matching algorithms dispatching

来源：评论

学校读者我要写书评

暂无评论

Relational Attribute Integrated matching Analysis (RAIMA): A Framework for the Design of Self-Adaptive Egocentric Social Networks

引用

IEEE SYSTEMS JOURNAL 2011年第1期5卷 80-90页

作者： Rahnama, Hossein Sadeghian, Alireza Madni, Asad M. Ryerson Univ Dept Comp Sci Toronto ON M5B 2K3 Canada

An emerging research in pervasive computing is the inference of social context to facilitate and mediate communications among proximate people. Understanding users' needs through information reasoning and leveraging principles of social networks play an important role in the emergence of innovative computer-mediated social networks. This paper introduces a generic social networking framework for the analysis and visualization of mobile and spontaneous social networks. The proposed framework is capable of analyzing social scores in order to provide decision support to users in the form of egocentric social graphs. As part of the framework, we introduce a matching algorithm that its efficiency is compared to commonly used "Stable Marriage matching" algorithms in opportunistic social networks. We show the performance of the algorithm as social profile attributes increase in a network.

关键词： Ad hoc networks context awareness matching algorithms network visualization social networks

来源：评论

学校读者我要写书评

暂无评论

matching from the first iteration: An iterative switching algorithm for an input queued switch

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2008年第1期16卷 206-217页

作者： Mneimneh, Saad CUNY Hunter Coll Dept Comp Sci New York NY 10021 USA CUNY Grad Ctr New York NY 10021 USA

An iterative switching algorithm for an input queued switch consists of a number of iterations in every time step, where each iteration computes a disjoint matching. If input i is matched to output j in a given iteration, a packet (if any) is forwarded from i to j in the corresponding time step. Most of the iterative switching algorithms use a Request Grant Accept (RGA) arbitration type (e.g. iSLIP). Unfortunately, due to this particular type of arbitration, the matching computed in one iteration is not necessarily maximal (more input and output ports can still be matched). This is exactly why multiple iterations are needed. However, multiple iterations make the time step larger and reduce the speed of the switch. We present a new iterative switching algorithm (based on the RGA arbitration) called pi-RGA with the underlying assumption that the number of iterations is possibly limited to one, hence reducing the time step and allowing the switch to run at a higher speed. We prove that pi-RGA achieves throughput and delay guarantees with a speedup of 2 and one iteration under a constant burst traffic model, which makes pi-RGA as good as any maximal matching algorithm in the theoretical sense. We also show by simulation that pi-RGA achieves relatively high throughput in practice under uniform and non-uniform traffic patterns with one iteration and no speedup.

关键词： input queued switch iterative switching algorithms matching algorithms number of iterations speedup

来源：评论

学校读者我要写书评

暂无评论

On some matching problems under the color-spanning model

引用

THEORETICAL COMPUTER SCIENCE 2019年 786卷 26-31页

作者： Bereg, Sergey Ma, Feifei Wang, Wencheng Zhang, Jian Zhu, Binhai Univ Texas Dallas Dept Comp Sci Richardson TX 75080 USA Chinese Acad Sci Inst Software State Key Lab Comp Sci Beijing 100080 Peoples R China Montana State Univ Gianforte Sch Comp Bozeman MT 59717 USA

Given a set of n points Q in the plane, each colored with one of the k given colors, a color-spanning set S subset of Q is a subset of k points with distinct colors. The minimum diameter color-spanning set (MDCS) is a color-spanning set whose diameter is minimum. Somehow symmetrically, the largest closest pair color-spanning set (LCPCS) is a color-spanning set whose closest pair is the largest. Both MDCS and LCPCS have been shown to be NP-complete, but whether they are fixed-parameter tractable (FPT) when k is a parameter is open. Motivated by this question, we consider the FPT tractability of some matching problems under this color-spanning model, where 2k is the parameter. We show that the following three problems are polynomially solvable (hence FPT): (1) MinSum matching Color-Spanning Set, (2) MaxMin matching Color-Spanning Set, and (3) MinMax matching Color-Spanning Set. For the k-Multicolored Independent matching problem, namely, computing a matching of 2k vertices in a graph such that the vertices of the edges in the matching do not share edges, we show that it is W[1]-hard. Finally, motivated by this problem, which is related to the parameterized independent set problem, we are able to prove that LCPCS is W[1]-hard. (C) 2018 Elsevier B.V. All rights reserved.

关键词： (Fixed-parameter) computational geometry matching algorithms FPT algorithms Color-spanning model NP-completeness

来源：评论

学校读者我要写书评

暂无评论

matching CANNY EDGELS TO COMPUTE THE PRINCIPAL COMPONENTS OF OPTIC FLOW

引用

IMAGE AND VISION COMPUTING 1988年第2期6卷 129-136页

作者： CASTELOW, DA MURRAY, DW SCOTT, GL BUXTON, BF UNIV SUSSEX BRIGHTON BN1 9RHE SUSSEXENGLAND

A relaxation algorithm for the computation of optic flow at edge elements (edgels) is presented. Flow is estimated only at intensity edges of the image. Edgels, extracted from an intensity image, are used as the basis for the algorithm. A matching strength or weight surface is computed around each edgel and neighbourhood support is obtained to enhance the matching strength. A principal moments method is used to determine the flow from this weight surface. The output of the algorithm is, for each edgel a pair of orthogonal components of the estimate of the flow. Associated with each component is a confidence measure. Examples of the output of the algorithm are given, and tests of its accuracy are discussed.

关键词： optic flow matching algorithms Canny edgels

来源：评论

学校读者我要写书评

暂无评论

Automatic ontology matching using application semantics

引用

AI MAGAZINE 2005年第1期26卷 21-31页

作者： Gal, A Modica, G Jamil, H Eyal, A Technion Israel Inst Technol Fac Ind Engn & Management IL-32000 Haifa Israel

We propose the use of application semantics to enhance the process of semantic reconciliation. Application semantics involves those elements of business reasoning that affect the way concepts are presented to users: their layout, and so on. In particular, we pursue in this article the notion of precedence, in which temporal constraints. determine the order in which concepts are presented to the user. Existing matching algorithms use either syntactic means (such as term matching and domain matching) or model semantic means, the use of structural information that is provided by the specific data model to enhance the matching process. The novelty of our approach lies in proposing a class of matching techniques that takes advantage of ontological structures and application semantics. As an example, the use of precedence to reflect business rules has not been applied elsewhere, to the best of our knowledge. We have tested the process for a variety of web sites in domains such as car rentals and airline reservations, and we share our experiences with precedence and its limitations.

关键词： .precedence HTML matches data sources Application Semantics data model airline matching process business rules temporal constraints matching algorithms schemata matching techniques Ontology matching use of application semantic reconciliation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：