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

21th Iranian Conference on Biomedical Engineering

作者： Mousavi, Azin Ehsani, Hossein Rostami, Mostafa Amirkabir Univ Technol Biomed Engn Sch Mot Anal Lab Biomech Dept Tehran Iran

ISBN: (纸本)9781479974184

providing an efficient mathematical model of the skeletal muscles which takes both computational efficiency and accuracy into account is a crucial factor in the simulations of multiple-muscle problems. Previous studies stated that ignoring the elastic characteristics of the tendon can reduce the time cost of simulations at the expense of introducing some minor errors if the ratio of tendon slack length to muscle optimum length is less than or equal to unity. The purpose of this paper was to test the precision, efficiency and numerical stability of this criterion for the muscles of the human body in their usual length excursions. In this regard two muscles of the upper extremity (Brachioradialis (BRD) long head of biceps (BICL)) and one from the lower extremity (soleus (SOL)) of the human body have been chosen. Two variations of a general Hill-based musculotendon model have been considered in this study. In the first one, using a nonlinear spring the elastic properties of the tendon has been incorporated into the model and in the second one, ignoring this properties, a constant length for the tendon has been assumed. The mean absolute error between the force profiles of the two models for BRD, BICL and SOL were 4.2, 12 and 13.1 respectively. Also rigid-tendon model was 7.3 to 9.5 times faster than compliant-tendon model using the implicit integrator. For BRD the outcomes of the two models, have similar trends and the discrepancies between the force profiles are negligible. However, the results obtained from the compliant-tendon model illustrate some numerical stability problems. In the second muscle, i.e. BICL, likewise BRD the trends of the force profiles are the same;however, the disparity among the outcomes of the two models have escalated. Likewise BRD, the rigid-tendon model required less computational time. Inspecting the results obtained for SOL, one can easily spot the significant differences between the outcomes of the two models. Considering the tendon slac

关键词： musculoskeletal simulation Hill-based musculotendon model computational efficiency tendon compliance

来源：评论

学校读者我要写书评

暂无评论

Manifold Coordinate Representations of Hyperspectral Imagery: Improvements in Algorithm Performance and computational efficiency 30

Manifold Coordinate Representations of Hyperspectral Imagery...

引用

30th IEEE International Geoscience and Remote Sensing Symposium (IGARSS) on Remote Sensing - Global Vision for Local Action

作者： Bachmann, Charles M. Ainsworth, Thomas L. Fusina, Robert A. Topping, Rusty Gates, Tell USN Res Lab Remote Sensing Div Coastal Sci & Interpretat Sect Code 7232 4555 Overlook Ave SW Washington DC 20375 USA Celestech Inc Phoenix AZ 85048 USA

ISBN: (纸本)9781424495665

Several years ago, NRL first demonstrated a computationally efficient framework for optimizing a set of intrinsic manifold coordinates for high-dimensional data such as hyperspectral imagery (HIS). Since that time, NRL has continued to improve the fidelity of the representation to describe the details of the nonlinear structure in even greater detail. In addition, working closely with CelesTech, several improvements have been made that increase the computational efficiency, accelerating processing speeds from hours to minutes.

关键词： algorithm performance computational efficiency geophysical image processing high-dimensional data hyperspectral imagery manifold coordinate representations nonlinear structure remote sensing

来源：评论

学校读者我要写书评

暂无评论

computational efficiency of timed tissue P systems with cell division

引用

Journal of computational and Theoretical Nanoscience 2016年第6期13卷 3629-3635页

作者： Niu, Yunyun Zhang, Kan Xiao, Jianhua School of Information Engineering China University of Geosciences in Beijing Beijing100083 China School of Electronic Engineering and Computer Science Peking University Beijing100871 China Research Center of Logistics Nankai University Tianjin300071 China

Tissue P system is inspired by cell inter-communication in tissues. Tissue P system with cell division contains two types of rules, communication rule and division rule. Both of them in traditional tissue P system with cell division are executed in one time unit. However, from a biological point of view both the transport across a membrane and the mitosis are depend on several uncertain factors. So we investigate the timed tissue P systems by removing the restriction. It is constructed by adding a time mapping to the rules to specify the execution time for each rule. Our work focuses on the computational efficiency of timed tissue P system. Recognizer timed tissue P systems with cell division are constructed to attack two famous NP-complete problems, the vertex cover problem and the partition problem. For each problem, an uniform and time-free solution can be obtained. The execution time of the computational processes involved can vary arbitrarily and the output produced is always the same. Copyright © 2016 American Scientific Publishers. All rights reserved.

关键词： computational efficiency

来源：评论

学校读者我要写书评

暂无评论

On a sorting rule to improve computational efficiency of connection admission control algorithms for ATM networks

On a sorting rule to improve computational efficiency of con...

引用

IEEE Global Telecommunications Conference

作者： Bianchi, G POLITECN MILAN DEPT ELETTR & INFORMAZI-20133 MILANITALY

ISBN: (纸本)0780325109

It is well known that the cell loss probability suffered by different connections offered to the same ATM network link is, in general, different. Therefore, most of the connection admission control (CAC) schemes proposed for ATM networks have a computational complexity depending on the number of connections offered to a link. We propose to reduce this complexity by adopting a sorting rule among connections. In particular, we compare the expected cell loss probability of a pair of different traffic sources, when they are offered to a bufferless network node along with an arbitrary background traffic. We find a necessary and sufficient condition on the source parameters which, when satisfied, guarantees that the cell loss suffered by one source always bounds the one suffered by the other, for any distribution of the background traffic. This condition defines a partial sorting on the set of traffic sources offered to a node, according to which a small set of 'bounding' connections can be defined. The CAC scheme may be then implemented to monitor only the connections belonging to this set. We show that, assuming random traffic parameters, the resulting computational complexity of the CAC scheme depends only on the logarithm of the number of connections offered to each network link.

关键词： telecommunication congestion control network links network node computational efficiency Traffic cell loss complexity classes sorting programs

来源：评论

学校读者我要写书评

暂无评论

computational efficiency-Based Adaptive Tracking Control for Robotic Manipulators with Unknown Input Bouc-Wen Hysteresis

引用

SENSORS 2019年第12期19卷 2776页

作者： Xie, Kan Lai, Yue Li, Weijun Guangdong Univ Technol Sch Automat Guangzhou 510006 Guangdong Peoples R China Guangdong Key Lab IoT Informat Technol Guangzhou 510006 Guangdong Peoples R China Minist Educ Key Lab Guangzhou 510006 Guangdong Peoples R China State Key Lab Precis Elect Mfg Technol & Equipmen Guangzhou 510006 Guangdong Peoples R China

In order to maintain robotic manipulators at a high level of performance, their controllers should be able to address nonlinearities in the closed-loop system, such as input nonlinearities. Meanwhile, computational efficiency is also required for real-time implementation. In this paper, an unknown input Bouc-Wen hysteresis control problem is investigated for robotic manipulators using adaptive control and a dynamical gain-based approach. The dynamics of hysteresis are modeled as an additional control unit in the closed-loop system and are integrated with the robotic manipulators. Two adaptive parameters are developed for improving the computational efficiency of the proposed control scheme, based on which the outputs of robotic manipulators are driven to track desired trajectories. Lyapunov theory is adopted to prove the effectiveness of the proposed method. Moreover, the tracking error is improved from ultimately bounded to asymptotic tracking compared to most of the existing results. This is of important significance to improve the control quality of robotic manipulators with unknown input Bouc-Wen hysteresis. Numerical examples including fixed-point and trajectory controls are provided to show the validity of our method.

关键词： sensing and control computational efficiency robotic manipulators hysteresis adaptive control

来源：评论

学校读者我要写书评

暂无评论

Video classification with Densely extracted HOG/HOF/MBH features: an evaluation of the accuracy/computational efficiency trade-off

引用

INTERNATIONAL JOURNAL OF MULTIMEDIA INFORMATION RETRIEVAL 2015年第1期4卷 33-44页

作者： Uijlings, J. Duta, I. C. Sangineto, E. Sebe, Nicu Univ Edinburgh Edinburgh Midlothian Scotland Univ Trento DISI Trento Italy

The current state-of-the-art in video classification is based on Bag-of-Words using local visual descriptors. Most commonly these are histogram of oriented gradients (HOG), histogram of optical flow (HOF) and motion boundary histograms (MBH) descriptors. While such approach is very powerful for classification, it is also computationally expensive. This paper addresses the problem of computational efficiency. Specifically: (1) We propose several speedups for densely sampled HOG, HOF and MBH descriptors and release Matlab code;(2) We investigate the trade-off between accuracy and computational efficiency of descriptors in terms of frame sampling rate and type of Optical Flow method;(3) We investigate the trade-off between accuracy and computational efficiency for computing the feature vocabulary, using and comparing most of the commonly adopted vector quantization techniques: k-means, hierarchical k-means, Random Forests, Fisher Vectors and VLAD.

关键词： Video classification HOG HOF MBH computational efficiency

来源：评论

学校读者我要写书评

暂无评论

A simple technique to improve computational efficiency of meshless methods

A simple technique to improve computational efficiency of me...

引用

International Conference on Advances in computational Modeling and Simulation (ACMS)

作者： Zhang, Xiaohua Zhang, Ping Zhang, Lin China Three Goeges Univ Coll Sci Yichang 443002 Peoples R China Dalian Maritme Univ Dept Appl Math Dalian 710072 Peoples R China

In order to improve computational efficiency of meshless methods based on Galerkin weak form, in the paper a simple technique is proposed, that is, the nodal influence domain of meshless methods is extended to arbitrary shape. Specifically, circle and rectangle nodal influence domains which are primarily used in meshless methods are generalized to arbitrary convex polygon. When the dimensionless size of the nodal influence domain approaches to 1, the Gauss quadrature point only contributes to these nodes in whose background cell the Gauss quadrature point is located. Thus, the band width of stiff matrix decreases obviously. Meanwhile, the node search process is not needed. The results obtained using the current technique have been compared with those obtained using the finite element method and meshless method with rectangle nodal influence domain, and they present that the provided technique not only has high calculation accuracy, but also enhances computational efficiency of meshless methods greatly. In addition, the technique simplifies imposition of essential boundary conditions as that of the finite element method. (C) 2011 Published by Elsevier Ltd. Selection and/or peer-review under responsibility of Kunming University of Science and Technology

关键词： meshless method nodal influence domain computational efficiency

来源：评论

学校读者我要写书评

暂无评论

Benchmarking Data efficiency and computational efficiency of Temporal Action Localization Models

Benchmarking Data Efficiency and Computational Efficiency of...

引用

IEEE/CVF International Conference on Computer Vision (ICCV)

作者： Warchocki, Jan Oprescu, Teodor Wang, Yunhan Damacus, Alexandru Misterka, Paul Bruintjes, Robert-Jan Lengyel, Attila Strafforello, Ombretta van Gemert, Jan Delft Univ Technol Comp Vis Lab Delft Netherlands

ISBN: (纸本)9798350307443

In temporal action localization, given an input video, the goal is to predict which actions it contains, where they begin, and where they end. Training and testing current state-of-the-art deep learning models requires access to large amounts of data and computational power. However, gathering such data is challenging and computational resources might be limited. This work explores and measures how current deep temporal action localization models perform in settings constrained by the amount of data or computational power. We measure data efficiency by training each model on a subset of the training set. We find that TemporalMaxer outperforms other models in data-limited settings. Furthermore, we recommend TriDet when training time is limited. To test the efficiency of the models during inference, we pass videos of different lengths through each model. We find that TemporalMaxer requires the least computational resources, likely due to its simple architecture.

关键词： action recognition computational efficiency data efficiency temporal action localization

来源：评论

学校读者我要写书评

暂无评论

Improving computational efficiency of Prognostics Algorithms in Resource-Constrained Settings

Improving Computational Efficiency of Prognostics Algorithms...

引用

IEEE Aerospace Conference (AERO)

作者： Jarvis, Katelyn J. Teubert, Christopher Okolo, Wendy A. Kulkarni, Chetan S. NASA Ames Res Ctr Moffett Field CA 94035 USA

ISBN: (数字)9781665437608

ISBN: (纸本)9781665437608

The field of prognostics and health management provides quantitative methods for monitoring and predicting the health of physical systems. Prognostic algorithms are useful in that they can be employed to assess the current state of a system, propagate the system state throughout time, and predict potential anomalies or failures that may occur. However, effective prognosis can be challenging to achieve in resource-constrained settings due to computational limitations and high computational latency, leading to obsolete predictions. Thus, computationally efficient and accurate algorithms are necessary for some prognostics applications. In this work, we implement three new algorithmic approaches to prediction (sampling methods, variable prediction time step, variable prediction sample size) with the goal of improving computational efficiency while minimizing decrease in model accuracy. To quantitatively analyze our results, we examine a use-case of degradation of a Lithium-ion battery. Notably, through this work it was found that none of the sampling approaches had a significant impact on computational efficiency or model accuracy in predicting EOD of the battery. However, our results show that prediction accuracy is highly dependent on the time step used, and that an appropriate time step can optimize both model accuracy and simulation efficiency. Finally, implementing a variable sample size also affected prediction, and our results show that tuning both the magnitude and timing of the sample size adjustment in an application-specific manner may prove useful in some applications. Taken together, our findings highlight the challenge of performing prognostics in resource-constrained settings, and illustrate the potential of developing new prediction algorithms to improve computational efficiency of prognosis.

关键词： Lithium-ion batteries Degradation computational modeling Predictive models Prediction algorithms computational efficiency Timing

来源：评论

学校读者我要写书评

暂无评论

On the computational efficiency of Training Neural Networks 28

On the Computational Efficiency of Training Neural Networks

引用

28th Conference on Neural Information Processing Systems (NIPS)

作者： Livni, Roi Shalev-Shwartz, Shai Shamir, Ohad Hebrew Univ Jerusalem Jerusalem Israel Weizmann Inst Sci Rehovot Israel

It is well-known that neural networks are computationally hard to train. On the other hand, in practice, modern day neural networks are trained efficiently using SGD and a variety of tricks that include different activation functions (e.g. ReLU), over-specification (i.e., train networks which are larger than needed), and regularization. In this paper we revisit the computational complexity of training neural networks from a modern perspective. We provide both positive and negative results, some of them yield new provably efficient and practical algorithms for training certain types of neural networks.

关键词： computational efficiency

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：