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

Codesign Lessons Learned from Implementing Graph matching on Multithreaded Architectures

COMPUTER 2015年第8期48卷 46-55页

作者： Halappanavar, Mahantesh Pothen, Alex Azad, Ariful Manne, Fredrik Langguth, Johannes Khan, Arif Pacific NW Natl Lab Fundamental & Computat Sci Directorate Richland WA 99352 USA Purdue Univ Comp Sci W Lafayette IN 47907 USA Lawrence Livermore Natl Lab Computat Res Div Livermore CA USA Univ Bergen Comp Sci N-5020 Bergen Norway Simula Res Lab Oslo Norway Purdue Univ Dept Comp Sci W Lafayette IN 47907 USA

Executing irregular, data-intensive workloads on multithreaded architectures can result in performance losses and scalability problems. Codesigning algorithms and architectures can realize high performance on irregular applications. A codesign study reveals four key lessons learned from implementing matching algorithms on various platforms.

关键词： graph theory multi-threading parallel architectures codesign algorithm graph matching algorithm irregular-data-intensive workload execution multithreaded architectures performance loss scalability problem Algorithm design and analysis Computer architecture Computer graphics Irregular applications Multithreading Parallel programming algorithm design graph matching irregular applications matching algorithms multithreaded architectures parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Is it Time for Wilderness Medicine Fellowships to Join the National Resident matching Program Specialties matching Service?

引用

WILDERNESS & ENVIRONMENTAL MEDICINE 2021年第1期32卷 12-18页

作者： Spano, Susanne J. Univ Calif San Francisco Fresno Fresno CA 93701 USA

Introduction-The national resident matching program specialties matching service (SMS) fills fellowship positions for 66 subspecialties. Wilderness medicine (WM) fellowships currently do not participate in SMS;instead, WM uses an offer date to fill positions. To be successful, at least 75% of the available positions within a subspecialty must be within the SMS match. Methods-All 13 civilian WM fellowship directors recruiting for academic year (AY) 2019 to 2020 and WM fellowship alumni were surveyed regarding future participation in the SMS. Estimation of the performance of SMS for WM was calculated using data published by the national resident matching program. Results-Fellowship directors from all 13 civilian WM fellowships and 60 fellowship alumni participated in the survey. SMS was supported by 62% (n=8) of fellowship directors and 55% (n=33) of fellows. Willingness to pay SMS fees was 54% (n=7) among fellowship directors and 60% (n=36) among fellows. Of matched applicants, 85% (n=51) obtained their top choice program. SMS, if implemented, was perceived to have no impact on matching a top choice program by 53% (n=31);however, 34% (n=20) believed SMS would improve the chance of an applicant matching higher. The match success of SMS for specialties with fewer than 30 programs is 74%. Of the 20 WM fellowship positions in AY 2019 to 2020, 16 were matched, for a success rate of 80%. Conclusions-There is insufficient support (<75%) at this time to institute an SMS match for WM. The offer date performed similarly to SMS for filling fellowship positions in AY 2019 to 2020.

关键词： graduate medical education matching algorithms emergency medicine/education family medicine/education surveys and questionnaires United States

来源：评论

学校读者我要写书评

暂无评论

BIST Design for Analog Cell matching

BIST Design for Analog Cell Matching

引用

17th IEEE European Test Symposium (ETS)

作者： Duarte, Candido Cavadas, Henrique Coke, Pedro Malheiro, Luis Tavares, Vitor Grade de Oliveira, Pedro Guedes Univ Porto INESC TEC Campus FEUPRua Dr Roberto Frias 378 P-4200465 Oporto Portugal Univ Porto Fac Engn Microelect Students Grp P-4200465 Oporto Portugal

ISBN: (纸本)9781467306973

This work addresses a built-in self-test methodology for circuit cell identification under specific matching conditions. The proposed technique is applied to the CMOS realization of a reduced-KII network, which is a system model of the biological olfactory cortex. This model behaves as an associative memory, a useful tool for information and adaptive processes. Based on a mixed-signal approach, the test strategy makes proper use of the circuits comprising the network structure, and provides self reconfiguration as well. Both testing procedures and design of essential building blocks are described in this paper. Simulation results are presented for a reduced-KII network comprising 128-cells, sequentially tested for matching in terms of offsets and their dynamic performances.

关键词： adaptive processes design for testability matching algorithms mixed-signal BIST neuromorphic circuits

来源：评论

学校读者我要写书评

暂无评论

Fair matching algorithm: Fixed-length frame scheduling in all-photonic networks

Fair Matching algorithm: Fixed-length frame scheduling in al...

引用

6th IASTED International Conference on Wireless and Optical Communications

作者： Saberi, Nahid Coates, Mark McGill Univ Dept Elect & Comp Engn Montreal PQ Canada

ISBN: (纸本)0889865639

Internal switches in all-photonic networks do not perform data conversion into the electronic domain, thereby eliminating a potential capacity bottleneck, but they introduce network scheduling challenges. In this paper we focus on scheduling fixed-length frames in all-photonic star-topology networks. We describe the Fair matching (FMA) and Equal Share (ESA) algorithms, novel scheduling procedures that result in max-min fair allocation of extra demand and achieve zero rejection for admissible demands. We analyze through simulation the delay and throughput performance.

关键词： scheduling star topology max-min fairness matching algorithms optical networks

来源：评论

学校读者我要写书评

暂无评论

matching Alignment

Matching Alignment

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Farag, Michael Nazer, Bobak Boston Univ ECE Dept Boston MA 02215 USA

ISBN: (纸本)9781467377041

The ergodic interference alignment scheme allows each user in a K-user interference channel to attain half its interference-free rate at any signal-to-noise ratio (SNR). However, this comes at the cost of extraordinarily long delays, since each channel matrix must be paired with a complementary matrix that can cancel out its off-diagonal terms. In this paper, we investigate the opposite approach. Rather than waiting for perfect matches, we simply try to pair together the available channel matrices to attain the highest possible sum rate. We show that this problem is closely connected to the problem of maximum weight matching, which allows us to efficiently evaluate the numerical performance of our scheme.

关键词： ergodic interference alignment matching algorithms

来源：评论

学校读者我要写书评

暂无评论

Impacts of climate-resilient push-pull technology on farmers' income in selected counties in Kenya and Tanzania: propensity score matching approach

引用

AGRICULTURE & FOOD SECURITY 2023年第1期12卷 15页

作者： Ouya, Fredrick O. Murage, Alice W. Pittchar, Jimmy O. Chidawanyika, Frank Pickett, John A. Khan, Zeyaur R. Int Ctr Insect Physiol & Ecol Icipe POB Mbita Point 30 Nairobi 40305 Kenya Kenya Agr & Livestock Res Org KALRO POB 57811-00200 Nairobi Kenya Univ Free State Dept Zool & Entomol POB 339 ZA-9300 Bloemfontein South Africa Cardiff Univ Cardiff CF10 3AT Wales

BackgroundAgricultural research and technology adoption play a key role in improving productivity and therefore generate impact on household livelihoods. The push-pull technology developed by the International Centre of Insect Physiology and Ecology and collaborators/partners has been recognized for its multiple roles in productivity improvement and income generation. However, the subsequent impacts after its adaptation to drier agro-ecologies have not been ascertained. An ex-post study was conducted to evaluate the impact of the climate-resilient push-pull technology on farmers' *** study was conducted in eight counties in Kenya and Mara region in Tanzania, involving 486 farmers;half were climate-resilient push-pull technology adopters. The study adopted the propensity score matching (PSM) technique in order to correct the self-selection bias in *** the results, education of the farmer, household size, Tropical Livestock Unit and group membership positively and significantly influenced adoption. The average treatment effect on the treated was positive for all the matching methods;USD 455.8 for Nearest Neighbor matching, USD 474.2 for the Kernel matching and USD 439.1 for the Radius/Caliper matching. The balancing test for self-selection bias showed that none of the observed covariates was significant after matching. The results demonstrate that adopting climate-resilient push-pull technology has a positive impact on the adopter farmers' income. Adopter farmers were able to earn much more in terms of gross *** positive change in income for adopters was attributable to the technology. With increased incomes, farmers were able to access alternative foodstuff, hence had more food security and diversity than those without. Efforts to expand dissemination and adoption of climate-resilient push-pull technology will have positive impacts on adopting families and hence to the economy.

关键词： Gross margin matching algorithms Propensity score matching Push-pull technology

来源：评论

学校读者我要写书评

暂无评论

Privacy-Preserving Maximum matching on General Graphs and its Application to Enable Privacy-Preserving Kidney Exchange 22

Privacy-Preserving Maximum Matching on General Graphs and it...

引用

ACM Conference on Data and Application Security and Privacy (CODASPY)

作者： Breuer, Malte Meyer, Ulrike Wetzel, Susanne Rhein Westfal TH Aachen Aachen Germany Stevens Inst Technol Hoboken NJ 07030 USA

ISBN: (纸本)9781450392204

To this day, there are still some countries where the exchange of kidneys between multiple incompatible patient-donor pairs is restricted by law. Typically, legal regulations in this context are put in place to prohibit coercion and manipulation in order to prevent a market for organ trade. Yet, in countries where kidney exchange is practiced, existing platforms to facilitate such exchanges generally lack sufficient privacy mechanisms. In this paper, we propose a privacy-preserving protocol for kidney exchange that not only addresses the privacy problem of existing platforms but also is geared to lead the way in overcoming legal issues in those countries where kidney exchange is still not practiced. In our approach, we use the concept of secret sharing to distribute the medical data of patients and donors among a set of computing peers in a privacy-preserving fashion. These computing peers then execute our new Secure Multi-Party Computation (SMPC) protocol among each other to determine an optimal set of kidney exchanges. As part of our new protocol, we devise a privacy-preserving solution to the maximum matching problem on general graphs. We have implemented the protocol in the SMPC benchmarking framework MP-SPDZ and provide a comprehensive performance evaluation. Furthermore, we analyze the practicality of our protocol when used in a dynamic setting where patients and donors arrive and depart over time) based on a data set from the United Network for Organ Sharing.

关键词： Kidney Exchange Privacy Secure Multi-Party Computation matching algorithms

来源：评论

学校读者我要写书评

暂无评论

Adaptive context for generic pattern matching in ad hoc social networks

Adaptive context for generic pattern matching in ad hoc soci...

引用

3rd IEEE International Symposium on Control, Communications and Signal Processing (ISCCSP 2008)

作者： Rahnama, Hossein Madni, Asad M. Sadeghian, Alireza Mawson, Chris Gajderowicz, Bart Ryerson Univ Toronto ON Canada Deakin Univ Dept Elect Engn Geelong Vic Australia

ISBN: (纸本)9781424416875

Efficient pattern matching algorithms in ad hoc networks can have significant benefits in generating real-time context and eliminate the need for a centralized arbiter. In our paper we demonstrate a generic and customizable architecture for achieving efficient pattern matching in mobile ad hoc networks. A major limitation of current ad hoc matching algorithms is that they are tailored for a specific! design scenario and are unable to adapt to new scenarios. In this paper we present a novel architecture for the development of an ad hoc generic matching engine which is customizable to varying scenarios through a web service. We show how customizable semantics can play an important role in decision making, selection of a desired attribute and notifying a message in a volatile network. We also show how our system is adaptable to various scenarios, and focus on social interaction to verify our results.

关键词： context awreness matching algorithms ad hoc networks visuaization

来源：评论

学校读者我要写书评

暂无评论

matching with preferences over colleagues solves classical matching

引用

GAMES AND ECONOMIC BEHAVIOR 2010年第2期68卷 773-780页

作者： Kominers, Scott Duke Harvard Univ Sch Business Soldiers Field Boston MA 02163 USA Harvard Univ Dept Econ Boston MA 02163 USA

In this note, we demonstrate that the problem of "many-to-one matching with (strict) preferences over colleagues" is actually more difficult than the classical many-to-one matching problem, "matching without preferences over colleagues." We give an explicit reduction of any problem of the latter type to a problem of the former type. This construction leads to the first algorithm which finds all stable matchings in the setting Of "matching Without preferences over colleagues," for any set of preferences. Our construction directly extends to generalized matching settings. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Many-to-one matching Stability matching algorithms

来源：评论

学校读者我要写书评

暂无评论

Deal or no deal? Some reflections on the 'Baker-Thompson rule,' 'matching,' and 'market design'

引用

JOURNAL OF CULTURAL ECONOMY 2020年第5期13卷 652-662页

作者： Thompson, Grahame F. Open Univ Fac Arts & Social Sci Milton Keynes Bucks England

This article raises the issue of why the idea of a 'deal' has become so prevalent in the discussion of political matters and policy proposals associated with future economic developments. It does this by linking the deal with several features of market design. Principal amongst these are game theory and matching algorithms. The Barker-Thompson Rule is presented as an example of a particular type of market construction operating in a game theoretic context, while the 'matching engine' is explored in a variety of contexts where it is argued to have become a standardized technique indicating to a possible reshaping of the economic terrain more generally. The consequences of these developments and trends are the emergence of a 'dealing culture' that threatens to overwhelm other forms of decision-making and consume the policy-making environment with the immediacy of its dealing logic.

关键词： Market design cooperative game theory matching algorithms a 'dealing culture' airport cost game CDOs

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：