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

A fast reliability-algorithm for the circular consecutive-weighted-k-out-of-n:F system

IEEE TRANSACTIONS ON RELIABILITY 1998年第4期47卷 472-474页

作者： Chang, JC Chen, RJ Hwang, FK Natl Chiao Tung Univ Dept Comp Sci & Informat Engn Hsinchu 30050 Taiwan Natl Chiao Tung Univ Dept Appl Math Hsinchu 30050 Taiwan

An O(Tn) algorithm is presented for the circular consecutive-weighted-k-out-of-n:F system, where T less than or equal to min[n, [(k - w(max))/w(min)] + 1];w(max), w(min) are the maximum, minimum weights of all components. This algorithm is simpler and more efficient than the Wu & Chen O(min[n,k] . n) algorithm. When all weights are unity, this algorithm is simpler than other O(k . n) published algorithms.

关键词： consecutive-k-out-of-n : F system consecutive weighted-k-out-of-n : F system computation complexity

来源：评论

学校读者我要写书评

暂无评论

Hybrid Context Aware Recommendation System for E-Health Care by merkle hash tree from cloud using evolutionary algorithm

引用

SOFT COMPUTING 2020年第10期24卷 7149-7161页

作者： Deepa, N. Pandiaraja, P. M Kumarasamy Coll Engn Dept Comp Sci & Engn Karur 639113 Tamil Nadu India

Privacy preservation permits doctors to outsource the huge encrypted reports to the cloud and permits the authenticated patients to have a safe search over the reports without leaking the private information. The doctors in our proposed have used the merkle hash tree for storing the reports of all the patients in the hospital. The existing schemes have used many types of trees like binary tree, red-black tree, spanning tree, B+ tree, etc., for the index generation purpose. Since the security is less and the searching time is high for the above said trees, we have proposed the index generation phase based on the merkle hash tree based on the evolutionary algorithm and it takes less time for searching and highly secure for storing the patient reports. The evolutionary algorithm is used for breeding the new data's through crossover as well as mutation operations to give confinement to new children. When the patient submits the search request for specialized doctor, based on the patient disease our protocol will recommend the specialized doctors and send the recommended doctors information to the patients who have the highest rating in the online social networks. After receiving the recommended results, the patient can have the treatment via online booking appointment, video call or in person based on the appointment booked. After completely cured, the patients can rate the doctors based on the medicine satisfaction, doctors' fees and doctor's response over the call. In this mechanism, we have used the hybrid context aware recommendation system collaborative filtering for rating the doctors based on their performance. After rating the doctors, our protocol has measured the accuracy based on the predicted rating and the true rating. This kind of accuracy metrics is used for ranking the good doctors in the top rank for the patient use. Our proposed work Hybrid Context Aware Recommendation System for E-Health Care (HCARS-EHC) is implemented, and the implementation results

关键词： Privacy Recommendation system Collaborative filtering Communication complexity computation complexity

来源：评论

学校读者我要写书评

暂无评论

AN APPROACH TO THE PROBLEMS OF ROUTING OPTIMIZATION IN THE REGIONS OF INTRICATE SHAPE

引用

INFORMATION PROCESSING LETTERS 1981年第1期13卷 39-43页

作者： STOYAN, YG SMELYAKOV, SV Institute of Machine-Building Problems Ukrainian Academy of Sciences Olminskogo 14 310024 Kharkov-24 U.S.S.R.

An approach is presented to the problems of routing optimization in the regions of intricate geometrical shape. Results presented are implemented when developing the program intended to construct the connecting nets both on the Euclidean and Manhattan lines in the spaces of intricate geometrical shape. Use of the topological model and deformational methods of optimization in the program presented offers significant advantages: 1. Computer-oriented realization of the suggested model requires, to some extent, minimal memory without loss of model completeness or precision. 2. Use of the discrete-continual model of path space enables employment in a single system of the most efficient approaches of discrete and continuous optimization. 3. The possibility of processing the ''real'' coordinates and modular structure of optimization approaches creates conditions conducive to interactive designing. Figure.

关键词： Engineering combinatorial problems computation complexity numerical mathematics

来源：评论

学校读者我要写书评

暂无评论

Fast Intra Mode Prediction for HEVC Based on Distortion Variance

Fast Intra Mode Prediction for HEVC Based on Distortion Vari...

引用

IEEE International Conference on Circuit, Power and Computing Technologies (ICCPCT)

作者： Balaji, L. Raj, V. Logesh Raghavendran, R. Raj, S. Mathan Akash, G. Velammal Inst Technol Dept ECE Madras Tamil Nadu India

ISBN: (纸本)9781509012770

High Efficiency Video Coding (HEVC) is an ongoing standard, which is an extension of H.264/AVC which is the latest coding standard. In HEVC encoder an exhaustive search method is employed to select the best mode for each macro block which consumes more encoding time. Rate and Distortion tradeoff attained for encoding each macroblock introduces more computation complexity. Although, HEVC has better coding efficiency, in regard to AVC it has more number of macroblock modes to identify the best mode. In this paper, a fast mode intra prediction algorithm to predict the best mode for each macro block based on distortion variance is proposed. The distortion variance finds the integer pixel difference between the current macroblock and the reference macroblock. The experimental result shows that the proposed algorithm achieves better encoding time when compared with HM reference model without a drastic increment in bit rate and PSNR or degradation.

关键词： H.265 fast mode decision computation complexity PSNR Time distortion variance

来源：评论

学校读者我要写书评

暂无评论

Fast Mode Decision Algorithm for H. 264/SVC 3

Fast Mode Decision Algorithm for H. 264/SVC

引用

3rd International Conference on Frontiers in Intelligent Computing - Theory and Applications (FICTA)

作者： Balaji, L. Thyagharajan, K. K. Anna Univ Fac Informat & Commun Chennai 600025 Tamil Nadu India Velammal Inst Technol Chennai 601204 Tamil Nadu India RMD Engn Coll Chennai 601206 Tamil Nadu India

ISBN: (纸本)9783319120126;9783319120119

H.264/AVC extension is H.264/SVC which is applicable for environment that demands video streaming. This paper presents an algorithm to reduce computation complexity and maintain coding efficiency by determining the mode quickly. Our algorithm terminates mode search by a probability model for both intra-mode and inter-mode of lower level and higher level layers in a Macro Block (MB). The estimated of Rate Distortion Cost (RDC) for modes among layers is used to determine best mode of each MB. This algorithm achieves about 26.9% of the encoding time when compared with JSVM reference software with minimal degradation in PSNR.

关键词： Scalable Video Coding H. 264 Fast Mode Decision computation complexity Macro Block

来源：评论

学校读者我要写书评

暂无评论

Diminished-1 Fermat Number Transform for Integer Convolutional Neural Networks 4

Diminished-1 Fermat Number Transform for Integer Convolution...

引用

4th IEEE International Conference on Big Data Analytics (ICBDA)

作者： Zhu Baozhou Ahmed, Nauman Peltenburg, Johan Bertels, Koen Al-Ars, Zaid Delft Univ Technol Dept Quantum & Comp Engn Delft Netherlands

ISBN: (纸本)9781728112824

Convolutional Neural Networks (CNNs) are a class of widely used deep artificial neural networks. However, training large CNNs to produce state-of-the-art results can take a long time. In addition, we need to reduce compute time of the inference stage for trained networks to make it accessible for real time applications. In order to achieve this, integer number formats INT8 and INT16 with reduced precision are being used to create Integer Convolutional Neural Networks (ICNNs) to allow them to be deployed on mobile devices or embedded systems. In this paper, Diminished-1 Fermat Number Transform (DFNT), which refers to Fermat Number Transform (FNT) with diminished-1 number representation, is proposed to accelerate ICNNs through algebraic properties of integer convolution. This is achieved by performing the convolution step as diminished-1 point-wise products between DFNT transformed feature maps, which can be reused multiple times in the calculation. Since representing and computing all the integers in the ring of integers modulo Fermat number 2(b) + 1 for FNT requires b + 1 bits, diminished-1 number representation is used to enable exact and efficient calculation. Using DFNT, integer convolution is implemented on a general purpose processor, showing speedup of 2-3x with typical parameter configurations and better scalability without any round-off error compared to the baseline.

关键词： CNNs Diminished-1 representation Fermat Number Transform computation complexity

来源：评论

学校读者我要写书评

暂无评论

A Timing Synchronization Method for OFDM Based Power Line Communication 9

A Timing Synchronization Method for OFDM Based Power Line Co...

引用

2017 9th IEEE International Conference on Communication Software and Networks (ICCSN 2017)

作者： Xiaosheng Liu Jiasheng Liu He Sun Hao Liu Xuanpu Gu School of Electrical Engineering and Automation Harbin Institute of Technology

ISBN: (纸本)9781509038237;9781509038220

Orthogonal frequency division multiplexing(OFDM) is one important technologies of power line communication(PLC). This paper presents a new timing synchronization method for OFDM system which can be used in PLC. The proposed timing method is performed by calculating the correlation between the received signal and a local training sequence which is the same as the training sequence of OFDM signal. Compared to Park's method, the proposed method achieves higher accuracy of timing synchronization in both AWGN channel and PLC channel. In addition, it has less computation. Finally, the feasibility of the proposed method is verified by experiments which are operated on 220 V AC PLC in the laboratory environment.

关键词： OFDM timing synchronization computation complexity power line communication

来源：评论

学校读者我要写书评

暂无评论

Design and Implementation of A Special Purpose Embedded System for Neural Machine Interface

Design and Implementation of A Special Purpose Embedded Syst...

引用

IEEE International Conference on Computer Design

作者： Zhang, Xiaorong Huang, He Yang, Qing Univ Rhode Isl Dept Elect Comp & Biomed Engn Kingston RI 02881 USA

ISBN: (纸本)9781424489350

Our previous study has shown the potential of using a computer system to accurately decode electromyographic (EMG) signals for neural controlled artificial legs. Because of computation complexity of the training algorithm coupled with real time requirement of controlling artificial legs, traditional embedded systems generally cannot be directly applied to the system. This paper presents a new design of an FPGA-based neural-machine interface for artificial legs. Both the training algorithm and the real time controlling algorithm are implemented on an FPGA. A soft processor built on the FPGA is used to manage hardware components and direct data flows. The implementation and evaluation of this design are based on Altera Stratix II GX EP2SGX90 FPGA device on a PCI Express development board. Our performance evaluations indicate that a speedup of around 280X can be achieved over our previous software implementation with no sacrifice of computation accuracy. The results demonstrate the feasibility of a self-contained, low power, and high performance real-time neural-machine interface for artificial legs.

关键词： FPGA-based neural machine interface PCI express development board artificial limbs computation complexity computer system direct data flow electromyographic signal electromyography embedded systems field programmable gate arrays microprocessor chips neural controlled artificial leg neurophysiology peripheral interfaces soft processor software implementation special purpose embedded system training algorithm

来源：评论

学校读者我要写书评

暂无评论

A Gibbs Sampler Approach for Optimal Distributed Monitoring of Multi-channel Wireless Networks

A Gibbs Sampler Approach for Optimal Distributed Monitoring ...

引用

54th Annual IEEE Global Telecommunications Conference (GLOBECOM)

作者： Arora, Pallavi Xia, Na Zheng, Rong Univ Houston Dept Comp Sci Houston TX 77204 USA Hefei Univ Technol Dept Comp & Informat Sci Hefei 230009 Anhui Peoples R China

ISBN: (纸本)9781424492688

Wireless monitoring employing distributed sniffers has been shown to complement wire side monitoring using SNMP and base station logs since it reveals detailed PHY (e.g., signal strength, spectrum density) and MAC behaviors (e.g, collision, retransmissions), as well as timing information (e.g., back-off time), which are often essential for network diagnosis. Due to hardware limitations, wireless sniffers typically can only collect information on one channel at a time. Thus, it is important to determine the optimal channel allocation of sniffer nodes to maximize the information collected. In this paper, we propose a Gibbs sampler approach for optimal distributed monitoring of multi-channel wireless networks with provable convergence. Simulation studies show that in general the proposed method has low computation complexity while achieving optimal or near optimal solutions.

关键词： Convergence Cooling Gibbs sampler approach IEEE 802.11 Standards MAC behaviors Monitoring PHY Peer to peer computing SNMP Schedules Wireless communication access protocols base station computation complexity multichannel wireless networks network diagnosis optimal distributed monitoring radio networks

来源：评论

学校读者我要写书评

暂无评论

computational complexity optimization in H.264 video coding

Computational complexity optimization in H.264 video coding

引用

IEEE International Conference on Multimedia and Expo (ICME 2007)

作者： Kwon, David Nyeongkyu Samsung Electronics

ISBN: (纸本)9781424410163

H.264 is well known for the best compression performance with high computational complexity. In order to be more viable in computationally constraint environments, it needs a performance optimization scheme, proposed in the paper based on trade-off between the computational complexity and distortion. computationally intensive modules are empirically identified and analyzed in terms of computational complexity and distortion in the H.264 video coding framework. Operating modes are extracted in the complexity-distortion space through an exhaustive search. It is shown that the proposed optimization scheme can reduce the coding computing complexity while the degradation of visual quality is almost negligible.

关键词： component computation complexity optimization Lagrangian optimization motion compensated hybrid video coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：