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

Application specific router architectures for NoCs: An efficiency and power consumption analysis

MECHATRONICS 2012年第5期22卷 531-537页

作者： Najjari, Noushin Sarbazi-Azad, Hamid Sharif Univ Technol Kish Isl Iran Sharif Univ Technol Tehran Iran Inst Res Fundamental Sci Tehran Iran

Networks on chip (NoC) have been proposed as a solution to mitigate complex on-chip communication problems. NoCs are composed of intellectual properties (IP) which are interconnected by on-chip switching fabrics. A step in the design process of NoCs is hardware virtualization which is mapping the IP cores onto the tiles of a chip. The communication among the IP cores greatly affects the performance and power consumption of NoCs which itself is deeply related to the placement of IPs onto the tiles of the network. Different mapping algorithms have been proposed for NoCs which allocate a set of IPs to given network topologies. In these mapping algorithms, there is a restriction which limits IPs to be mapped only onto single routers. This, results in heavy traffic loads on routers connected to high communicating processing cores. In order to increase the performance of the NoCs and decrease their energy consumption, a new mapping method is proposed here that makes efficient use of the network area and its components. This new mapping methodology and placement aims to assign a proper number of routers to IP(s) implemented inside a chip to maximize performance and minimize power consumption. The mapping algorithm attaches more than one processing core onto routers where ever the communication process is less than computation. (C) 2011 Elsevier Ltd. All rights reserved.

关键词： Network-on-chip Irregular networks mapping algorithms Chip area Power consumption Performance

来源：评论

学校读者我要写书评

暂无评论

AREA OPTIMIZATION OF DATA-FLOW-GRAPH mappingS

引用

PARALLEL COMPUTING 1992年第3期18卷 297-311页

作者： ROBIC, B KOLBEZEN, P SILC, J Department of Computer Science Jožef Stefan Institute Jamova 39 Ljubljana Slovenia

The problem of area efficient mapping of dataflow program graphs onto a data-driven hexagonally connected array is examined. A particular mapping scheme is analyzed to show that, in general, it results in a low area utilization. An optimization method for reducing the hosting area, called graph compaction, is introduced. The method was inspired by dynamic physical systems. Two possible implementations, based on Iterative Improvement and Simulated Annealing algorithms are given. Several measures are defined for evaluating the quality of the graph compaction. Using basic mapping scheme augmented with graph compaction, bigger graphs can be mapped on a given array and the communication delay is reduced. The experimental results justify the use of graph compaction as an improvement of the main mapping scheme.

关键词： HEXAGONALLY CONNECTED DATA-DRIVEN ARRAY mapping algorithms OPTIMIZATION METHODS ITERATIVE IMPROVEMENT SIMULATED ANNEALING

来源：评论

学校读者我要写书评

暂无评论

Assessing the external validity of algorithms to estimate EQ-5D-3L from the WOMAC

引用

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

作者： Kiadaliri, Aliasghar A. Englund, Martin Lund Univ Clin Epidemiol Unit Dept Clin Sci Lund Orthopaed Lund Sweden Kerman Univ Med Sci Inst Futures Studies Hlth Hlth Serv Management Res Ctr Kerman Iran Boston Univ Sch Med Clin Epidemiol Res & Training Unit Boston MA 02215 USA Skane Univ Hosp Clin Epidemiol Unit Klinikgatan 22 SE-22185 Lund Sweden

Background: The use of mapping algorithms have been suggested as a solution to predict health utilities when no preference-based measure is included in the study. However, validity and predictive performance of these algorithms are highly variable and hence assessing the accuracy and validity of algorithms before use them in a new setting is of importance. The aim of the current study was to assess the predictive accuracy of three mapping algorithms to estimate the EQ-5D-3L from the Western Ontario and McMaster Universities Osteoarthritis Index (WOMAC) among Swedish people with knee disorders. Two of these algorithms developed using ordinary least squares (OLS) models and one developed using mixture model. Methods: The data from 1078 subjects mean (SD) age 69.4 (7.2) years with frequent knee pain and/or knee osteoarthritis from the Malmo Osteoarthritis study in Sweden were used. The algorithms' performance was assessed using mean error, mean absolute error, and root mean squared error. Two types of prediction were estimated for mixture model: weighted average (WA), and conditional on estimated component (CEC). Results: The overall mean was overpredicted by an OLS model and underpredicted by two other algorithms (P < 0.001). All predictions but the CEC predictions of mixture model had a narrower range than the observed scores (22 to 90 %). All algorithms suffered from overprediction for severe health states and underprediction for mild health states with lesser extent for mixture model. While the mixture model outperformed OLS models at the extremes of the EQ-5D-3D distribution, it underperformed around the center of the distribution. Conclusions: While algorithm based on mixture model reflected the distribution of EQ-5D-3L data more accurately compared with OLS models, all algorithms suffered from systematic bias. This calls for caution in applying these mapping algorithms in a new setting particularly in samples with milder knee problems than original sample. Asses

关键词： mapping algorithms WOMAC EQ-5D-3L Knee pain Knee osteoarthritis External validity

来源：评论

学校读者我要写书评

暂无评论

Simple Robust and Adaptive Tracking Control for Mobile Robots

引用

IFAC-PapersOnLine 2015年第11 11期48卷 143-149页

作者： Pyrkin, Anton A. Bobtsov, Alexey A. Kolyubin, Sergey A. Faronov, Maxim V. Borisov, Oleg I. Gromov, Vladislav S. Vlasov, Sergey M. Nikolaev, Nikolay A. Department of Control Systems and Informatics ITMO University St. Petersburg Russia Department of Engineering Cybernetics Norwegian University of Science and Technology TrondheimNO-7491 Norway Laboratory “Control of Complex Systems” Institute for Problems of Mechanical Engineering St. Petersburg Russia

The problem of simple adaptive and robust control is studied for the case of parametric and dynamic dimension uncertainties: only the maximum possible relative degree of the plant model is known. The control approach “consecutive compensator” is investigated. To illustrate the eficiency of proposed approach an example with the mobile robot motion control using computer vision system is considered. Some remarks about mapping algorithms using stereo cameras and laser scanner for implementation in new home robots are considered. © 2015

关键词： Visual servoing Computer control systems Conformal mapping Mobile robots Robust control Stereo image processing Adaptive tracking control Computer vision system Control approach mapping algorithms Mobile robot motion Relative degrees Robust and adaptive control Simple adaptive

来源：评论

学校读者我要写书评

暂无评论

An application of ISPAHAN to the typological classification of some Italian upper Paleolithic end-scrapers

引用

PATTERN RECOGNITION LETTERS 1983年第3期1卷 181-186页

作者： Bietti, A. Burani, A. Zanello, L. Univ Rome Inst Phys Rome Italy Univ Rome Inst Anthropol Ist Italiano Paleontol Umana Rome Italy

In this communication we show some of the results obtained applying the interactive system ISPAHAN to a specific archaeological problem, i.e. the classification of some very characteristic stone tools of the upper Paleolithic: the end-scrapers. Following a general project already presented in the 1980 Symposium "Pattern Recognition in Practice" we have analyzed two samples of end-scrapers: one coming from S. E. Italy (Apulia) and the other from Central Italy (Latium) both approximately dated from 8000 to 9000 years B. C. Being a classification problem, the supervised decision logic of [SPAHAN has not been employed at this stage, but the use of simple t-tests, transformations like the principal component analysis and especially some mapping algorithms have proved very useful in our case, even for a possible better choice of the features considered.

关键词： Classification upper Paleolithic end-scrapers ISPAHAN t-tests mapping algorithms

来源：评论

学校读者我要写书评

暂无评论

Inhibitors of Cathepsins K and S Identified Using the DynaMAD Virtual Screening Algorithm

引用

CHEMMEDCHEM 2010年第1期5卷 61-64页

作者： Stumpfe, Dagmar Sisay, Mihiret T. Frizler, Maxim Vogt, Ingo Guetschow, Michael Bajorath, Juergen Univ Bonn Dept Life Sci Informat B IT Program Unit Med Chem & Chem BiolLIMES D-53113 Bonn Germany Univ Bonn Inst Pharmazeut D-53121 Bonn Germany

A mapping algorithm that operates in high-dimensional chemical reference spaces was applied to search for cathepsin K and S inhibitors. So far only a few cathepsin inhibitors lack a strong electrophilic group, which in most cases binds covalently to the catalytic cysteine. By testing only 10 of ~3.7x10 ⁶ source compounds, we identified two with micromolar potency and scaffolds distinct from known cathepsin inhibitors that inhibit both cathepsins K and S, but not L;both molecules lack a reactive electrophilic group. (Chemical Equation Presented). © 2010 Wiley-VCH Verlag GmbH & Co. KGaA.

关键词： cathepsins cysteine proteases inhibitors mapping algorithms molecular similarity virtual screening

来源：评论

学校读者我要写书评

暂无评论

UNTANGLED: A Game Environment for Discovery of Creative mapping Strategies

引用

ACM TRANSACTIONS ON RECONFIGURABLE TECHNOLOGY AND SYSTEMS 2013年第3期6卷 13-13页

作者： Mehta, Gayatri Crawford, Carson Luo, Xiaozhong Parde, Natalie Patel, Krunalkumar Rodgers, Brandon Sistla, Anil Kumar Yadav, Anil Reisner, Marc Univ N Texas Denton TX 76203 USA Univ Nebraska Lincoln NE 68583 USA Johns Hopkins Univ Baltimore MD 21218 USA

The problem of creating efficient mappings of dataflow graphs onto specific architectures (i.e., solving the place and route problem) is incredibly challenging. The difficulty is especially acute in the area of Coarse-Grained Reconfigurable Architectures (CGRAs) to the extent that solving the mapping problem may remove a significant bottleneck to adoption. We believe that the next generation of mapping algorithms will exhibit pattern recognition, the ability to learn from experience, and identification of creative solutions, all of which are human characteristics. This manuscript describes our game UNTANGLED, developed and fine-tuned over the course of a year to allow us to capture and analyze human mapping strategies. It also describes our results to date. We find that the mapping problem can be crowdsourced very effectively, that players can outperform existing algorithms, and that successful player strategies share many elements in common. Based on our observations and analysis, we make concrete recommendations for future research directions for mapping onto CGRAs.

关键词： Design algorithms Performance Reconfigurable architectures placement mapping algorithms game domain-specific custom architectures design automation

来源：评论

学校读者我要写书评

暂无评论

Run-time mapping of multiple communicating tasks on MPSoC platforms

引用

Procedia Computer Science 2010年第1期1卷 1019-1026页

作者： Amit Kumar Singh Wu Jigang Akash Kumar Thambipillai Srikanthan School of Computer Engineering Nanyang Technological University Singapore Department of Electrical and Computer Engineering National University of Singapore Singapore

Multi-task supported processing elements (PEs) are required in a Multiprocessor System-on-Chip platform for better scalability, power consumption etc. Efficient utilization of PEs needs intelligent mapping of tasks onto them. The job becomes more challenging when the workload of tasks is dynamic. These scenarios require tasks to be mapped at run-time. This paper presents a run-time mapping technique for efficiently mapping the tasks of applications on the multitasking resources. The technique tries to map the communicating tasks onto the same processing resource and also the tasks of an application close to each other in order to reduce the communication overhead. For an evaluated scenario, the presented technique reduces total execution time by 22%, average channel load by 47% and power dissipation by 48% when compared to state-of-the-art run-time mapping techniques.

关键词： Multiprocessor system-on-chip (MPSoC) Network-on-chip (NoC) mapping algorithms

来源：评论

学校读者我要写书评

暂无评论

Location and Time Optimizations for Traveling Clients 16

Location and Time Optimizations for Traveling Clients

引用

IEEE 16th International Conference on Mobile Data Management MDM

作者： Tegtmeyer, John Madria, Sanjay Missouri Univ Sci & Technol Dept Comp Sci Rolla MO 65409 USA

ISBN: (纸本)9781479999729

Given a set of users with unique locations, and a closed region defined as a set of points, the optimal location algorithm determines the best location to meet between the users and their current trajectories. The algorithm is designed to find the location between the users that can be reached by a certain time taking into account traffic conditions, while making travel times and distances between users as fair as possible. The user's locations are periodically updated to ensure that their current path and velocity are consistent to what is expected while they are on route. Thus, the algorithm can adjust meeting locations based on developing traffic conditions.

关键词： Geo-Location Trajectory mapping algorithms Travel Areas

来源：评论

学校读者我要写书评

暂无评论

Relating Concept Theory to Computer Science 24

Relating Concept Theory to Computer Science

引用

24th International Conference on Information Modelling and Knowledge Bases

作者： Locuratolo, Elvira Palomaki, Jari CNR ISTI I-56124 Pisa Italy Tampere Univ Technol Pori Dept Informat Technol FI-28101 Pohjoisranta Finland

ISBN: (纸本)9781614994725;9781614994718

An algorithm is introduced in concept theory to design concept structures related to object classes/categories supported by computer systems. Although concept theory has a formal background, these algorithms are not yet available. The approach is supported by a methodology which starts from algorithms of object decomposition proposed in computer science and reaches an algorithm of concept construction related to class/categories of objects.

关键词： Concept intension extension partitioning conceptual modeling database models mapping algorithms preservation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：