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

mapping and attenuation of surface waves side scattered by near-surface diffractors

ARABIAN JOURNAL OF GEOSCIENCES 2014年第2期7卷 757-771页

作者： Al-Lehyani, Ayman Fazea Al-Shuhail, Abdullatif Abdulrahman King Fahd Univ Petr & Minerals Dept Earth Sci Dhahran 31261 Saudi Arabia

Near-surface diffractors are one of the problems in land seismic exploration. They can scatter the surface wave energy emanating from the seismic source and contaminate the signal received by seismic receivers. The scattered energy from the near-surface diffractors manifests itself on seismic shot gathers as strong hyperbolic events, called diffractions, masking the weakly reflected body waves. Diffractions present complications to most of surface-wave suppression schemes, especially when they have been scattered by scatterers outside the receiver line. Different methods have been used to eliminate diffractions from seismic data, including geophone arrays, filtering, and inverse scattering. Each of those methods has its own limitations. In this study, we present processing algorithms to map and attenuate near-surface diffractors of surface waves in seismic shot gathers. The mapping algorithm is based on semblance measurements and time-offset relations, while the attenuation algorithm is based on the least-square fitting of a source wavelet. The algorithms are applied on synthetic data from two different models. The first model has three near-surface diffractors, while the second model has three clusters of near-surface diffractors. Each cluster consists of three near-surface diffractors with a different geometry for each cluster. The results show that the proposed algorithms are successful in locating and attenuating most near-surface diffractors, except when the separation between individual diffractors is below the wavelength of the diffracted surface wave.

关键词： Near-surface diffractors Seismic exploration mapping algorithm Seismic noise attenuation Semblance velocity analysis

来源：评论

学校读者我要写书评

暂无评论

New heuristic algorithms for low-energy mapping and routing in 3D NoC

引用

INTERNATIONAL JOURNAL OF COMPUTER APPLICATIONS IN TECHNOLOGY 2013年第1期47卷 1-13页

作者： Liu, Yanhua Ruan, Ying Lai, Zongsheng East China Normal Univ Inst Microelect Circuit & Syst Shanghai 200062 Peoples R China Nantong Univ Jiangsu Prov Key Lab ASIC Design Nantong 226000 Peoples R China

Three Dimensional Network on Chip (3D NoC), which reduces the average number of hops traversed by a packet, can achieve better performance than the traditional 2D NoC. However, when routers deliver packets in 3D NoC, more energy consumption is needed. High-energy consumption and small packaging density will cause excessive heat, which increases vulnerability of the system in performance and reliability. In this paper, we present a low-energy consumption mapping algorithm based on the symmetry of the architecture and construct a deadlock-free routing algorithm using mapping result information. Our proposed algorithms can reduce the total energy consumption of communication and achieve a good system performance under the bandwidth constraints. To evaluate the efficacy of the algorithms, we perform experiments on several benchmarks and compare the proposed algorithms with other existing algorithms. Experimental results show that, for complex benchmarks, our proposed algorithms get better results than others.

关键词： 3D NoC three dimensional network on chip low-energy consumption mapping algorithm deadlock-free routing algorithm

来源：评论

学校读者我要写书评

暂无评论

Efficient genetic based topological mapping using analytical models for on-chip networks

引用

JOURNAL OF COMPUTER AND SYSTEM SCIENCES 2013年第4期79卷 492-513页

作者： Arjomand, Mohammad Amiri, S. Hamid Sarbazi-Azad, Hamid Sharif Univ Technol Dept Comp Engn Tehran Iran

Network-on-Chips are now the popular communication medium to support inter-IP communications in complex on-chip systems with tens to hundreds IP cores. Higher scalability (compared to the traditional shared bus and point-to-point interconnects), throughput, and reliability are among the most important advantages of NoCs. Moreover, NoCs can well match current CAD methodologies mainly relying on modular and reusable structures with regularity of structural pattern. However, since NoCs are resource-limited, determining how to distribute application load over limited on-chip resources (e.g. switches, buffers, virtual channels, and wires) in order to improve the metrics of interest and satisfy the application requirements becomes a challenging research issue known as topological mapping problem. This paper introduces a topological mapping strategy for direct networks. The Multi-Objective Genetic algorithm (MOGA) is used to obtain optimal Pareto-front of topological mapping solutions for an arbitrary network topology using a deadlock-free routing algorithm. Considered cost functions are the network latency and power consumption which are accurately estimated through two accurate analytical models. Before using the proposed analytical models in our MOGA method, we validate them through extensive simulation experiments, and compare their accuracy to some known models already proposed in the literature. We then quantitatively and qualitatively compare our analytical model based mapping method to two other methods: a genetic-based and a heuristic. Experimental evaluations using real workloads confirm that the proposed method is cost-efficient and can be used as a powerful tool for NoC design space exploration. Compared to the traditional mapping strategies, our mapping mechanism has the following advantages: (1) it greatly shortens the design period by using analytical models for fast and accurate predictions;(2) it can give a set of solutions, using MOGA, in terms of Pareto-

关键词： Network-on-Chip mapping algorithm Analytical modeling Genetic algorithm Performance On-chip power

来源：评论

学校读者我要写书评

暂无评论

Comparing the mapping between EQ-5D-5L, EQ-5D-3L and the EORTC-QLQ-C30 in non-small cell lung cancer patients

引用

HEALTH AND QUALITY OF LIFE OUTCOMES 2016年第1期14卷 1-15页

作者： Khan, Iftekhar Morris, Steve Pashayan, Nora Matata, Bashir Bashir, Zahid Maguirre, Joe Univ Surrey Clin Trials Unit Guildford England Univ Surrey Dept Hlth Econ Guildford England UCL Dept Appl Hlth Res London England Liverpool Heart & Chest Hosp Liverpool Merseyside England Univ Birmingham Canc Sch Birmingham W Midlands England

Background: Several mapping algorithms have been published with the EORTC-QLQ-C30 for estimating EQ-5D-3L utilities. However, none are available with EQ-5D-5L. Moreover, a comparison between mapping algorithms in the same set of patients has not been performed for these two instruments simultaneously. In this prospective data set of 100 non-small cell lung cancer (NSCLC) patients, we investigate three mapping algorithms using the EQ-5D-3L and EQ-5D-5L and compare their performance. Methods: A prospective non-interventional cohort of 100 NSCLC patients were followed up for 12 months. EQ-5D-3L, EQ-5D-5L and EORTC-QLQ-C30 were assessed monthly. EQ-5D-5L was completed at least 1 week after EQ-5D-3L. A random effects linear regression model, a beta-binomial (BB) and a Limited Variable Dependent Mixture (LVDM) model were used to determine a mapping algorithm between EQ-5D-3L, EQ-5D-5L and QLQ-C30. Simulation and cross validation and other statistical measures were used to compare the performances of the algorithms. Results: mapping from the EQ-5D-5L was better: lower AIC, RMSE, MAE and higher R-2 were reported with the EQ-5D-5L than with EQ-5D-3L regardless of the functional form of the algorithm. The BB model proved to be more useful for both instruments: for the EQ-5D-5L, AIC was -485, R-2 of 75 %, MAE of 0.075 and RMSE was 0.092. This was -385, 69 %, 0.099 and 0.113 for EQ-5D-3L respectively. The mean observed vs. predicted utilities were 0.572 vs. 0.577 and 0.515 vs. 0.523 for EQ-5D-5L and EQ-5D-3L respectively, for OLS;for BB, these were 0.572 vs. 0.575 and 0.515 vs. 0.518 respectively and for LVDMM 0.532 vs 0.515 and 0.569 vs 0.572 respectively. Less over-prediction at poorer health states was observed with EQ-5D-5L. Conclusions: The BB mapping algorithm is confirmed to offer a better fit for both EQ-5D-3L and EQ-5D-5L. The results confirm previous and more recent results on the use of BB type modelling approaches for mapping. It is recommended that in studies where

关键词： Root Mean Square Error NSCLC Patient mapping algorithm Poor Health State Mean Absolute Error

来源：评论

学校读者我要写书评

暂无评论

A Distributed Workflow mapping Method Oriented Homogeneous Activity

引用

INTERNATIONAL JOURNAL OF GRID AND DISTRIBUTED COMPUTING 2016年第3期9卷 99-107页

作者： Yang, Fei Zhu, Yinzhou Beijing Inst Petrochem Technol Dept Comp Beijing Peoples R China Beihang Univ Comp Sci & Engn Dept Beijing 100191 Peoples R China

Workflow model based-on homogeneous activity needs to be transformed into basic workflow model in order to run in distributed environment. A workflow model mapping algorithm oriented homogeneous activity is proposed which can generate independent basic workflow fragments for homogeneous activities of different configuration modes using different processing mechanisms, and then form the basic workflow model based on the assembly of these workflow fragments. The algorithm provides a complete set of virtual mapping mechanism to solve it effectively focusing on the problem of the topological relationship of redundant activities difficult to describe in the dynamic selection model of homogeneous activity.

关键词： Workflow Homogeneous Activity Serial Mode Parallel Mode mapping algorithm

来源：评论

学校读者我要写书评

暂无评论

Dynamic Resource Allocation algorithm based on Service Component 5

Dynamic Resource Allocation Algorithm based on Service Compo...

引用

5th International Conference on Computer Science and Network Technology (ICCSNT)

作者： Niu Yuanyuan Hu Hongchao Cheng Guozhen Henan Agr Broadcasting & Televis Sch Zhengzhou Henan Peoples R China Natl Digital Switching Syst Engn Technol R&D Ctr Zhengzhou Henan Peoples R China

ISBN: (纸本)9781509021291

Current network architecture suffers overloading due to extensive resource utility. This paper proposes a resource mapping algorithm upon service layer of service-based network: the unit of service component requests resource as well as limits;an agent is embedded in the component to surveil the utility of network resource. If network resource violates the limits, agent will punish the component. Our validation shows that mapping algorithms upon nodes and links can layout resource efficiently;when the resource is used by a component which exceeds its authority, punishment will be executed rapidly for impartiality.

关键词： service-based network resource allocation mapping algorithm utility function

来源：评论

学校读者我要写书评

暂无评论

Multiprocessor Task Programming and Flexible Load Balancing for Time-stepping Methods on Heterogeneous Cloud Infrastructures

Multiprocessor Task Programming and Flexible Load Balancing ...

引用

IEEE Conference on SmartWorld, Ubiquitous Intelligence and Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Cloud and Big Data Computing, Internet of People and Smart City Innovation

作者： Rauber, Thomas Ruenger, Gudula Univ Bayreuth Bayreuth Germany Tech Univ Chemnitz Chemnitz Germany

ISBN: (纸本)9781728140346

This article considers the execution of CSE applications on cloud infrastructures with heterogeneous hardware elements. For an efficient and reliable execution of long-running, time-consuming CSE applications, we pursue a programming model of multiprocessor-tasks (M-Tasks) which can be flexibly mapped onto the resources of the heterogeneous cloud infrastructure, thus supporting scalability. To capture the heterogeneity, we introduce variants of M-tasks and types for M-task as well as for hardware resources. Especially, we propose a two-stage procedure consisting of an offline mapping algorithm for typed M-tasks variants onto the typed hardware resources and an online execution protocol. The online execution protocol accompanies the actual execution by a monitoring of the execution time and the execution success as well as a bookkeeping for the successful and efficient execution of M-tasks. The approach is especially suited for time-stepping methods, since an adaptation of the execution strategy can be performed between time steps in case of failure or inefficient execution.

关键词： multiprocessor-task heterogeneous hardware Cloud infrastructure mapping algorithm execution protocol

来源：评论

学校读者我要写书评

暂无评论

Generation of OWL Ontologies from Confinement Models 1st

引用

1st Conference on Creativity in Intelligent Technologies and Data Science (CIT and DS)

作者： Zhukova, Irina Kultsova, Marina Litovkin, Dmitry Kozlov, Dmitry Volgograd State Tech Univ Volgograd Russia

ISBN: (纸本)9783319237664;9783319237657

This paper presents an approach to integration between conceptual model, such as confinement model (CM), and ontology encoded in OWL language. A new method for generation of OWL-ontology from confinement models was developed on the basis of mapping the components of CM into basic components of OWL-ontology. The proposed method and mapping algorithm were implemented in form of software tool and applied for generation of ontology from CM in the domain of human resource management. It is planned to integrate it with CBR-based intelligent decision support system in human resource management.

关键词： confinement system confinement model OWL-ontology conceptual modeling mapping algorithm human resource management

来源：评论

学校读者我要写书评

暂无评论

Conversion of the Seattle Angina Questionnaire into EQ-5D utilities for ischemic heart disease: a systematic review and catalog of the literature

引用

CLINICOECONOMICS AND OUTCOMES RESEARCH 2014年第1期6卷 253-268页

作者： Wijeysundera, Harindra C. Farshchi-Zarabi, Sara Witteman, William Bennell, Maria C. Sunnybrook Hlth Sci Ctr Div Cardiol Schulich Heart Ctr Toronto ON Canada Univ Toronto Inst Hlth Policy Management & Evaluat Toronto ON Canada St Michaels Hosp Inst Clin Evaluat Sci Toronto ON Canada St Michaels Hosp Li Ka Shing Knowledge Inst Toronto ON Canada Ctr Hosp Univ Quebec Charlesbourg PQ Canada

Background: There is a paucity of preference-based (utility) measures of health-related quality of life for patients with ischemic heart disease (IHD);in contrast, the Seattle Angina Questionnaire (SAQ) is a widely used descriptive measure. Our objective was to perform a systematic review of the literature to identify IHD studies reporting SAQ scores in order to apply a mapping algorithm to convert these to preference-based scores for secondary use in economic evaluations. Methods: Relevant articles were identified in MEDLINE (Ovid), EMBASE (Ovid), Cochrane Library (Wiley), HealthStar (Ovid), and PubMed from inception to 2012. We previously-developed and validated a mapping algorithm that converts SAQ descriptive scores to-European-Quality of Life-5 Dimensions (EQ-5D) utility scores. In the current study, this mapping algorithm was used to estimate EQ-5D utility scores from SAQ scores. Results: Thirty-six studies met the inclusion criteria. The studies were categorized into three groups, ie, general IHD (n=13), acute coronary syndromes (n= 4), and revascularization (n=19). EQ-5D scores for patients with general IHD were in the range of 0.605-0.843 at baseline, and increased to 0.649-0.877 post follow-up. EQ-5D scores for studies of patients with recent acute coronary syndromes increased from 0.706-0.796 at baseline to 0.795-0.942 post follow-up. The revascularization studies had EQ-5D scores in the range of 0.616-0.790 at baseline, and increased to 0.653-0.928 after treatment;studies that focused only on coronary artery bypass grafting increased from 0.643-0.788 at baseline to 0.653-0.928 after grafting, and studies that focused only on percutaneous coronary intervention increased in score from 0.616-0.790 at baseline to 0.668-0.897 after treatment. Conclusion: In this review, we provide a catalog of estimated health utility scores across a wide range of disease severity and following various interventions in patients with IHD. Our catalog of EQ-5D scores can be use

来源：评论

学校读者我要写书评

暂无评论

A Visual Tool for DNA Repeats Screening 37

A Visual Tool for DNA Repeats Screening

引用

37th Annual International Conference of the IEEE-Engineering-in-Medicine-and-Biology-Society (EMBC)

作者： Pop, Petre G. Vaida, Mircea F. Tech Univ Cluj Napoca Cluj Napoca Romania

ISBN: (纸本)9781424492701

DNA sequence analysis has been developing to reveal some hidden structure, to distinguish coding from noncoding regions in DNA sequence, and to explore structural similarity among DNA sequences. DNA repeats are associated with human disease, seems to play a role in genome organization and evolution and are important in regulatory processes. A lot of the methods for finding repeated sequences use signal processing techniques which implies distances, similarities and consensus sequences to generate candidate sequences. This paper presents results obtained using a mapping algorithm and a custom dot-plot analysis combined with image processing techniques, to isolate the position of DNA patterns with different lengths.

关键词： DNA diseases genomics image processing molecular biophysics DNA patterns DNA repeats screening DNA sequence analysis consensus sequences custom dot-plot analysis genome organization hidden structure image processing techniques mapping algorithm noncoding regions signal processing techniques visual tool algorithm design and analysis Bioinformatics Feature extraction Genomics Hamming distance Signal processing algorithms

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：