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

KTS: a real-time mapping algorithm for NoC-based many-cores

JOURNAL OF SUPERCOMPUTING 2017年第8期73卷 3635-3651页

作者： Queudet, Audrey Abdallah, Nadine Chetto, Maryline CNRS IRCCyN UMR 6597 F-44321 Nantes France Lebanese Univ IUT Saida Sidon Lebanon

Many-core architectures based on network-on-chip (NoC) are scalable and have the ability to meet the increasing performance requirements of complex concurrent applications (real-time video, communications, control, etc.). This paper addresses the mapping problem of hard real-time task sets on NoC-based many-core processors. Our main contribution is a novel static mapping scheme called K-level task splitting (KTS). If a task cannot be allocated on a given core of the NoC because of a too high processing utilization ratio, it gets replicated so that its jobs execute on more than one core without migrating. Synchronization between task replicas could then be ensured by assigning offsets and virtual deadlines to them. KTS's advantage is that data migration is not required, thus involving no overheads due to migrations. The only requirement is that all core clocks be synchronized within the NoC. In this newly proposed algorithm, the schedulability of each task is determined based upon fundamental results relative to the feasibility analysis of asynchronous real-time task sets. The paper describes the principles of task splitting, our algorithm and its properties. We evaluate the efficiency of KTS, demonstrating that it is a good compromise between existing semi-partitioned schemes (with possible migrations) and fully partitioned approaches.

关键词： Many-core real-time systems NoC-based architectures mapping algorithms Real-time scheduling

来源：评论

学校读者我要写书评

暂无评论

Reliable Virtual Network mapping Algorithm With Network Characteristics and Associations

引用

IEEE ACCESS 2021年 9卷 48121-48130页

作者： Zhang, Shunli Jinzhong Univ Dept Informat Technol & Engn Jinzhong 030619 Peoples R China Beijing Univ Posts & Telecommun State Key Lab Networking & Switching Technol Beijing 100876 Peoples R China

In the existing research on reliable virtual network mapping, the relationship between network parameters is insufficiently analyzed, the network topology and historical mapping data are not fully utilized, resulting in a low virtual network mapping success rate and low utilization of the underlying network resources. To resolve this problem, this article proposes a reliable virtual network mapping algorithm based on network features and associations. Firstly, the network features related to reliable virtual network mapping are sorted out, and the underlying node reliability matrix is established based on historical data. Secondly, a Bayesian network-based inference model is constructed. Finally, based on the underlying node reliability matrix and virtual network features, two algorithms named NFA-TS and NFA-LR about reliable virtual network mapping were proposed. Compared with two algorithms named SVNE and VNE-SSM, the proposed algorithm shows the competitive performance on virtual network mapping success rate and the underlying network resource utilization.

关键词： Resource management Inference algorithms Artificial neural networks Telecommunication network reliability Heuristic algorithms Bandwidth Virtualization Virtual network underlying network virtual network mapping mapping algorithms network characteristics associations

来源：评论

学校读者我要写书评

暂无评论

An evaluation of public genomic references for mapping RNA-Seq data from Chinese hamster ovary cells

引用

BIOTECHNOLOGY AND BIOENGINEERING 2015年第11期112卷 2412-2416页

作者： Le, Huong Chen, Chun Goudar, Chetan T. Amgen Inc Drug Subst Technol Proc Dev Thousand Oaks CA 91320 USA

While RNA-Seq is increasingly used as the method of choice for transcriptome analysis of mammalian cell culture processes, no universal genomic reference for mapping RNA-Seq reads from CHO cells has been reported. In previous publications, de novo transcriptomes assembled using these RNA-Seq reads were subsequently used for mapping. Potential caveats with this approach include the incomplete coverage and the non-universal nature of the de novo assemblies, leading to challenges in comparing results across studies. In order to facilitate future RNA-Seq studies in CHO cells, we performed a comprehensive evaluation of four public genomic references for CHO cells hosted by the NCBI Reference Sequence Database (RefSeq), including two annotated genomes released in 2012 and 2014 and their accompanying transcriptomes. Each genome showed significantly higher mapped rates compared to its accompanying transcriptome. Furthermore, higher mapped rates in deep intra-genic regions, especially within exons, were observed for the more recent genome release (2014) compared to the older one (2012), indicating that the 2014 genome was the preeminent reference among the four. Sequential addition of human and mouse genomes increased the total mapped rate to 87.3 and 89.7%, respectively, from 73.5% using the 2014 Chinese hamster genome alone. Thus, the sequential combination of the 2014 RefSeq Chinese hamster genome, the Ensembl human genome (h38), and the Ensembl mouse genome (m38) was suggested as the most effective strategy for mapping RNA-Seq data from CHO cells. Biotechnol. Bioeng. 2015;112: 2412-2416. (c) 2015 Wiley Periodicals, Inc.

关键词： RNA-Seq mapping algorithms genome transcriptome CHO cells cell culture

来源：评论

学校读者我要写书评

暂无评论

Allocation and mapping based reliability analysis of multistage interconnection networks

引用

IEEE TRANSACTIONS ON COMPUTERS 1996年第5期45卷 600-606页

作者： Mohapatra, P Yu, CS Das, CR GOLDSTAR CO LTD INFORMAT TECHNOL R&D LABSEOUL 137140SOUTH KOREA PENN STATE UNIV DEPT COMP SCI & ENGNUNIVERSITY PKPA 16802

Task allocation using cubic partitioning of multistage interconnection networks (MINs) offers several advantages over random allocation of resources. The objective of this paper is to analyze MIN reliability considering the cubic allocation algorithm. A comprehensive analytical model is derived for predicting reliability of MIN-based systems where tasks are allocated using the buddy strategy. System reliability with the free list allocation policy is computed via simulation, it is shown that the system reliability is dependent on the allocation algorithm and the free list policy is superior to the buddy scheme in this respect. Two types of mapping algorithms known as conventional and bit reversal are used on a baseline MIN to show that the same allocation algorithm can result in different reliability and performance. A performance-related reliability measure is analyzed using probability of acceptance as the performance measure to demonstrate the trade-offs between performance and reliability.

关键词： allocation-based reliability cubic allocation schemes mapping algorithms multistage interconnection network performance-related reliability reliability

来源：评论

学校读者我要写书评

暂无评论

mapping the EORTC QLQ-C30 and QLQ-H&N35, onto EQ-5D-5L and HUI-3 indices in patients with head and neck cancer

引用

HEAD AND NECK-JOURNAL FOR THE SCIENCES AND SPECIALTIES OF THE HEAD AND NECK 2020年第9期42卷 2277-2286页

作者： Noel, Christopher W. Stephens, Robert F. Su, Jie (Susie) Xu, Wei Krahn, Murray Monteiro, Eric Goldstein, David P. Giuliani, Meredith Hansen, Aaron R. de Almeida, John R. Univ Toronto Univ Hlth Network Princess Margaret Canc Ctr Dept Otolaryngol Head & Neck Surg Toronto ON Canada Univ Toronto Fac Med Toronto ON Canada Univ Hlth Network Dept Biostat Toronto ON Canada Univ Toronto Sinai Hlth Syst Dept Otolaryngol Head & Neck Surg Toronto ON Canada Univ Toronto Univ Hlth Network Princess Margaret Canc Ctr Dept Radiat Oncol Toronto ON Canada Univ Toronto Univ Hlth Network Princess Margaret Canc Ctr Dept Med Oncol Toronto ON Canada

Background We sought to develop mapping functions that use EORTC responses to approximate health utility (HU) scores for patients with head and neck cancer (HNC). Methods In total, 209 outpatients with HNC completed the EORTC QLQ-C30 & QLQ-H&N35 (EORTC), EQ-5D-5L and the HUI-3. Results of the EORTC were mapped onto both EQ-5D-5L and HUI-3 scores using ordinary least squares regression and two-part models. Results The OLS model mapping EORTC onto the EQ-5D-5L performed best (adjusted R-2 = .75, 10-fold cross-validation RMSE = 0.064, MAE 0.050). The HUI-3 model mapping onto EORTC through OLS was more limited (adjusted R-2 = .5746, 10-fold cross cross-validation RMSE = 0.168, MAE 0.080). The EQ-5D-5L model was able to discriminate between certain clinical indices of disease severity on subgroup analysis. Conclusion The EORTC to EQ-5D-5L mapping algorithm has good predictive validity and may enable researchers to translate EORTC scores into HU scores for head and neck patients with cancer.

关键词： cross walking head and neck cancer (HNC) health state utility values (HSUVs) health-related quality of life (HRQoL) mapping algorithms multi-attribute utility instruments (MAUIs) preference-based measures QALYs

来源：评论

学校读者我要写书评

暂无评论

The Rapid Prediction of Focal Wavefront Origins Integration With a 3-Dimensional mapping System

引用

JACC-CLINICAL ELECTROPHYSIOLOGY 2020年第12期6卷 1478-1487页

作者： Saluja, Deepak Bar-on, Tal Hayam, Gal Kassotis, John Kostis, William J. Coromilas, James Columbia Univ Dept Med New York NY 10032 USA Biosense Webster Yokneam Israel Rutgers Robert Wood Johnson Med Sch Dept Med New Brunswick NJ USA

OBJECTIVES This study assessed the accuracy of an algorithm that predicts the origin of focal arrhythmias using a limited number of data points. BACKGROUND Despite advances in technology, ablations can be time--consuming, and activation mapping continues to have inherent limitations. The authors developed an algorithm that can predict the origin of a focal wavefront using the location and activation timing information in 2 pairs of sampled points. This algorithm was incorporated into an electroanatomic mapping (EAM) system to assess its accuracy in a 3-dimensional clinical environment. METHODS EAM data from patients who underwent successful ablation of a focal wavefront using the CARTO3 system were loaded onto an offline version of the software modified to contain the algorithm. Prediction curves were retrospectively generated. Predictive accuracy, defined as the distance between true and predicted origin wavefront origins, was measured. RESULTS Seventeen wavefronts in as many patients (2 with atrial tachycardia, 3 with orthodromic re-entrant tachycardia, 8 with premature ventricular complex and/or ventricular tachycardia, 4 with focal pulmonary vein isolation breakthroughs) were studied. Thirty-three origin predictions were attempted (1.9 +/- 0.4 per patient) using 132 points. Predictions were successfully calculated in 31 of 33 (93.9%) attempts and were accurate to within 5.7 +/- 6.9 mm. Individual prediction curves were accurate to within 3.0 +/- 4.7 mm. CONCLUSIONS Focal wavefront origins may be accurately predicted in 3 dimensions using a novel algorithm incorporated into an EAM system. (C) 2020 by the American College of Cardiology Foundation.

关键词： arrhythmia conduction velocity electroanatomic mapping mapping algorithms wavefronts

来源：评论

学校读者我要写书评

暂无评论

Exploring structure-selectivity relationships of biogenic amine GPCR antagonists using similarity searching and dynamic compound mapping

引用

MOLECULAR DIVERSITY 2008年第1期12卷 25-40页

作者： Vogt, Ingo Ahmed, Hany E. A. Auer, Jens Bajorath, Juergen Rhein Freidrich Wilhelms Univ Bonn Program Unit Chem Biol & Med Chem LIMES InstB IT Dept Life Sci Informat D-53113 Bonn Germany

We design and analyze compound selectivity sets of antagonists with differential selectivity against seven biogenic amine G-protein coupled receptors. The selectivity sets consist of a total of 267 antagonists and contain a spectrum of in part closely related molecular scaffolds. Each set represents a different selectivity profile. Using these compound sets, a systematic computational analysis of structure-selectivity relationships is carried out with different 2D similarity methods including fingerprints, recursive partitioning, clustering, and dynamic compound mapping. Screening calculations are performed in a background database containing nearly four million molecules. Fingerprint searching and compound mapping are found to enrich target-selective antagonists over family-selective ones. Dynamic compound mapping effectively discriminates database compounds from GPCR antagonists and consistently retains target-selective antagonists during the final dimension extension levels. Furthermore, the widely used MACCS key fingerprint displays a strong tendency to distinguish between target- and family-selective GPCR antagonists. Taken together, the results indicate that different types of 2D similarity methods are capable of distinguishing closely related molecules having different selectivity. The reported compound benchmark system is made freely available in order to enable selectivity-oriented analyses using other computational approaches.

关键词： compound selectivity GPCR antagonists 2D similarity methods mapping algorithms structure-selectivity relationships database mining

来源：评论

学校读者我要写书评

暂无评论

mapping the University of Washington Quality of life questionnaire onto EQ-5D and HUI-3 indices in patients with head and neck cancer

引用

HEAD AND NECK-JOURNAL FOR THE SCIENCES AND SPECIALTIES OF THE HEAD AND NECK 2020年第3期42卷 513-521页

作者： Stephens, Robert F. Noel, Christopher W. Su, Jie (Susie) Xu, Wei Krahn, Murray Monteiro, Eric Goldstein, David P. Giuliani, Meredith Hansen, Aaron R. de Almeida, John R. Univ Toronto Fac Med Toronto ON Canada Univ Toronto Princess Margaret Canc Ctr Dept Otolaryngol Head & Neck Surg Univ Hlth Network 610 Univ Ave3-955 Toronto ON M5G 2M9 Canada Univ Hlth Network Dept Biostat Toronto ON Canada Univ Toronto Dept Otolaryngol Head & Neck Surg Sinai Hlth Syst Toronto ON Canada Univ Toronto Princess Margaret Canc Ctr Dept Radiat Oncol Univ Hlth Network Toronto ON Canada Univ Toronto Princess Margaret Canc Ctr Dept Med Oncol Univ Hlth Network Toronto ON Canada

Background There is no mechanism to predict health utility (HU) values from the University of Washington Quality of Life Questionnaire (UWQoL) scores. We sought to develop a mapping algorithm capable of using UWQoL data to approximate HU scores. Methods Outpatients with head and neck cancer completed the UWQoL, EQ-5D, and the Health Utilities Index-Mark 3 (HUI-3). Results of the UWQoL were mapped onto both EQ-5D and HUI-3 scores using ordinary least-squares regression models. Two-part models were explored. The predictive power of the model was assessed using 10-fold cross-validation. Results A total of 209 patients were recruited. The reduced model converting UWQoL data into EQ-5D scores performed best (adjusted R-2 = 0.628, root mean square error = 0.076). Both models demonstrated construct validity by discriminating between clinical indices of disease severity. Conclusions The abovementioned algorithms enable researchers to perform health economic evaluations with existing UWQoL data in cases where prospectively collected HU values are not available.

关键词： cross-walking EQ-5D head and neck cancer (HNC) health state utility values (HSUVs) health utilities index mark 3 health-related quality of life (HRQoL) mapping algorithms multi-attribute utility instruments (MAUIs) preference-based measures QALYs University of Washington Quality of life questionnaire

来源：评论

学校读者我要写书评

暂无评论

mapping PedsQL™ scores to CHU9D utility weights for children with chronic conditions in a multi-ethnic and deprived metropolitan population

引用

QUALITY OF LIFE RESEARCH 2023年第7期32卷 1909-1923页

作者： Kelly, Clare B. Soley-Bori, Marina Lingam, Raghu Forman, Julia Cecil, Lizzie Newham, James Wolfe, Ingrid Fox-Rushby, Julia Inst Women & Childrens Hlth Kings Hlth Partners London England Kings Coll London Sch Life Course & Populat Sci Dept Populat Hlth London England Univ New South Wales Sch Womens & Childrens Hlth Sydney Australia Kings Coll London Sch Life Course & Populat Sci Dept Womens & Childrens Hlth London England Northumbria Univ Fac Hlth & Life Sci Newcastle Upon Tyne England Guys & St ThomasNHS Fdn Trust Kings Coll London NIHR Biomed Res Ctr London England Kings Coll London Fac Life Sci & Med Sch Life Course & Populat Sci Guys Campus London SE1 1UL England

PurposeThe Child Health Utility-9 Dimensions (CHU9D) is a patient-reported outcome measure to generate Quality-Adjusted Life Years (QALYs), recommended for economic evaluations of interventions to inform funding decisions. When the CHU9D is not available, mapping algorithms offer an opportunity to convert other paediatric instruments, such as the Paediatric Quality of Life Inventory (TM) (PedsQL), onto the CHU9D *** study aims to validate current PedsQL to CHU9D mappings in a sample of children and young people of a wide age range (0 to 16 years of age) and with chronic conditions. New algorithms with improved predictive accuracy are also *** from the Children and Young People's Health Partnership (CYPHP) were used (N = 1735). Four regression models were estimated: ordinal least squared, generalized linear model, beta-binomial and censored least absolute deviations. Standard goodness of fit measures were used for validation and to assess new *** previous algorithms perform well, performance can be enhanced. OLS was the best estimation method for the final equations at the total, dimension and item PedsQL scores levels. The CYPHP mapping algorithms include age as an important predictor and more non-linear terms compared with previous *** new CYPHP mappings are particularly relevant for samples with children and young people with chronic conditions living in deprived and urban settings. Further validation in an external sample is required.

关键词： Health-related quality of life Patient reported outcomes mapping algorithms Children and young people

来源：评论

学校读者我要写书评

暂无评论

A mapping ALGORITHM FOR PARALLEL SPARSE CHOLESKY FACTORIZATION

引用

SIAM JOURNAL ON SCIENTIFIC COMPUTING 1993年第5期14卷 1253-1257页

作者： POTHEN, A SUN, CG CORNELL UNIV CORNELL THEORY CTRADV COMP RES INSTITHACANY 14853

A task-to-processor mapping algorithm is described for computing the parallel multifrontal Cholesky factorization of irregular sparse problems on distributed-memory multiprocessors. The performance of the mapping algorithm is compared with the only general mapping algorithm previously reported. Using this mapping, the distributed multifrontal algorithm is nearly as efficient on a collection of problems with irregular sparsity structure as it is for the regular grid problems.

关键词： SPARSE CHOLESKY FACTORIZATION CLIQUE TREE DISTRIBUTED-MEMORY MULTIPROCESSOR mapping algorithms MULTIFRONTAL METHOD PARALLEL COMPUTING

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：