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

40th International Convention on Information and Communication Technology, Electronics and Microelectronics (MIPRO)

作者： Brcic, Mario Hlupic, Nikica Fac Elect Engn & Comp Zagreb Croatia

ISBN: (纸本)9789532330922

The development of optimization algorithms for combinatorial problems is a complicated process, both guided and validated by the computational experiments over the different scenarios. Since the number of experiments can be very large and each experiment can take substantial execution time, distributing the load over the cloud speeds up the whole process significantly. In this paper we present the system used for experimental validation and comparison of stochastic combinatorial optimization algorithms, applied in the specific case of project scheduling problems.

关键词： Databases Optimization Cloud computing algorithm design and analysis Computer architecture Scheduling Tools

来源：评论

学校读者我要写书评

暂无评论

Composite Iterative algorithm and Architecture for q-th Root Calculation

Composite Iterative Algorithm and Architecture for <i>q</i>-...

引用

20th IEEE Symposium on Computer Arithmetic (ARITH)

作者： Vazquez, Alvaro Bruguera, Javier D. INRIA CNRS ENSL INRIA UCBL Lab LIP Paris France Univ Santiago de Compostela Ctr Invest Tecnol Informac Dept Elect & Comp Sci Santiago Spain

ISBN: (纸本)9780769543185

An algorithm for the q-th root extraction, q being any integer, is presented in this paper. The algorithm is based on an optimized implementation of X-1/q = 2((1/q) log2(X)) by a sequence of parallel and/or overlapped operations: (1) reciprocal, (2) digit-recurrence logarithm, (3) left-to-right carry-free multiplication and (4) on-line exponential. A detailed error analysis and two architectures are proposed, for low precision q and for higher precision q. The execution time and hardware requirements are estimated for single precision floating-point computations for several radices;this helps to determine which radices result in the most efficient implementations. The architectures proposed improve the features of other architectures for q-th root extraction.

关键词： algorithm design and analysis Approximation methods Equations Integer rooting Mathematical model Piecewise linear approximation Table lookup composite iterative algorithm digit recurrence logarithm elementary function evaluation error analysis error analysis floating point arithmetic high-radix digit-by-digit algorithms iterative methods left-to-right carry-free multiplication on-line algorithms online exponential overlapped operation parallel operation q-th root calculation single precision floating point computation

来源：评论

学校读者我要写书评

暂无评论

Situation Assessment Using Cellular Automata Paradig

引用

IEEE Aerospace and Electronic Systems Magazine 1992年第1期7卷 32-37页

作者： Glickstein, Ira Stiles, Peter IBM Federal Sector Division Owego NY United States

The cellular automata (CA) concept is introduced, and it is shown how it is applied to situation assessment in connection with digital map-based tasks. The demonstration system makes use of 11480 virtual processors. Although the use of the CA paradigm was motivated by projections of future availability of massively parallel hardware, the CA algorithms have run efficiently on ordinary serial computers.

关键词： Parallel processing Routing Hardware design engineering Power engineering and energy Artificial intelligence algorithm design and analysis Crops Concurrent computing Testing

来源：评论

学校读者我要写书评

暂无评论

A novel image restoration algorithm using neural network based on variational PDE model

A novel image restoration algorithm using neural network bas...

引用

4th International Conference on Communications, Circuits and Systems (ICCCAS 2006)

作者： Wu Yadong Zhang Hongying Univ Elect Sci & Technol China Sch Engn & Comp Sci Chengdu 610054 Sichuan Peoples R China Univ Elect Sci & Technol China Sch Commun & Informat Engn Chengdu Sichuan Peoples R China

ISBN: (纸本)0780395840

The variational partial differential equation (PDE) model is introduced into image restoration framework using neural network. A novel image restoration algorithm based on harmonic diffusion equation is given. And, the convergence of this restored algorithm is also analyzed. The proposed algorithm could deblur the degraded image while preserve edges. Experimental results show that the presented algorithm is superior to the traditional restoration algorithm in preserving image edges, and has a better restoration effect.

关键词： Image restoration Neural networks Laplace equations Degradation Nonlinear equations Atmospheric modeling Hopfield neural networks algorithm design and analysis Convergence Computer science

来源：评论

学校读者我要写书评

暂无评论

A Novel Method for Informative Frame Selection in Wireless Capsule Endoscopy Video

A Novel Method for Informative Frame Selection in Wireless C...

引用

33rd Annual International Conference of the IEEE Engineering-in-Medicine-and-Biology-Society (EMBS)

作者： Fan, Yichen Meng, Max Q. -H. Li, Baopu Chinese Univ Hong Kong Dept Elect Engn Hong Kong Hong Kong Peoples R China

ISBN: (纸本)9781424441228

Wireless capsule endoscopy (WCE) has been validated to be an important tool in the evaluation of gastrointestinal (GI) tract. Compared with traditional endoscope technologies, its non-invasiveness property meets with great favor of patients. However, from physician's point of view, WCE video suffers from low resolution, limited illumination, irregular movement, more importantly, imbalanced rate of abnormality which brings a lot of challenges for diagnosis. These challenges motivate us to devise an approach to guide the physicians to focus on the informative frames which could be convenient for review of the content of the GI tract. This paper presents a novel approach for automatic selection of the WCE video frames with lumen and coherent motility. We adopt lumen detection based on mean shift to provide robust and reliable selection of lumen. Together with the evaluation of coherent motility, we can provide a full and fast approach to select the informative frames for diagnosis. The experiments on real date are presented to show the performance of our proposed method.

关键词： algorithm design and analysis Endoscopes GI tract Image color analysis Image segmentation Lighting Medical services Vectors WCE video frames coherent motility endoscopes gastrointestinal tract image resolution image sequences informative frame selection l

来源：评论

学校读者我要写书评

暂无评论

Performance prediction using support vector machine for the configuration of optimization algorithms 3

Performance prediction using support vector machine for the ...

引用

3rd International Conference of Cloud Computing Technologies and Applications (CloudTech)

作者： El Afia, Abdellatif Sarhani, Malek Mohammed V Univ ENSIAS Rabat Morocco

ISBN: (纸本)9781538611159

The aim of this paper is to propose a machine learning approach for predicting the performance of each configuration of optimization algorithms. Our approach consists of advocating making the decision of finding the most suitable configuration on a per-instance analysis based on a supervised machine learning model. That is, it consists of building a support vector machine (SVM) model to predict the performance of each configuration on each instance and then to select the adapted setting depending on the instance. Furthermore, feature selection has been used as a pre-processing step to select the relevant features in order to enhance the predictive capacity of SVM. The experiment consists of predicting algorithm performance metrics for two well known optimization problems using SVM in its continuous and binary form depending on the metric of each problem.

关键词： Prediction algorithms Machine learning algorithms Support vector machines Feature extraction Optimization algorithm design and analysis Predictive models

来源：评论

学校读者我要写书评

暂无评论

Mixed Virtual Reference Feedback Tuning - Iterative Feedback Tuning: Method and Laboratory Assessment

Mixed Virtual Reference Feedback Tuning - Iterative Feedback...

引用

20th IEEE International Symposium on Industrial Electronics (ISIE)

作者： Radac, Mircea-Bogdan Grad, Ramona-Bianca Precup, Radu-Emil Petriu, Emil M. Preitl, Stefan Dragos, Claudia-Adina Politehn Univ Timisoara Dept Automat & Appl Informat Timisoara Romania Escuela Ingn Eibar Vitoria Timisoara Romania

ISBN: (纸本)9781424493128

This paper gives a mixed Virtual Reference Feedback Tuning (VRFT) - Iterative Feedback Tuning (IFT) design and tuning method. The performance objectives of VRFT and IFT are discussed comparatively. The parameterization of IFT is employed in the calculation of a convenient unbiased estimate of the Hessian specific to IFT. The VRFT-IFT design and tuning method is applied and assessed in the speed and position control of a laboratory equipment.

关键词： algorithm design and analysis design methodology Filtering Laboratories Noise Transfer functions Tuning

来源：评论

学校读者我要写书评

暂无评论

Anchored Alignment Distance between Rooted Labeled Unordered Trees

Anchored Alignment Distance between Rooted Labeled Unordered...

引用

Federated Conference on Computer Science and Information Systems (FedCSIS)

作者： Yoshino, Takuya Ishizaka, Yuma Hirata, Kouichi Kyushu Inst Technol Grad Sch Comp Sci & Syst Engn Kawazu 680-4 Iizuka Fukuoka 8208502 Japan Kyushu Inst Technol Dept Artificial Intelligence Kawazu 680-4 Iizuka Fukuoka 8208502 Japan

ISBN: (纸本)9788394625375

In this paper, we formulate an anchored alignment distance between rooted labeled unordered trees as the minimum cost of the anchored alignment whose anchoring is constructed from the minimum cost isolated-subtree mapping by adding the pairs of non-mapped leaves, and design the algorithm to compute it. Since this algorithm runs in exponential time with respect to the number of leaves in theoretical, we give experimental results for randomly generated trees and for N-glycan data with small degree as real data to evaluate the anchored alignment distance by comparing with the isolated-subtree distance and the alignment distance.

关键词： Vegetation Cost function algorithm design and analysis Computer science Electronic mail Bioinformatics Time complexity algorithm design and analysis electronic mail complexity classes computer science Cost functions Bioinformatics vegetation Unordered Exponential time Alignment

来源：评论

学校读者我要写书评

暂无评论

Leveraging Tenant Flexibility in Resource Allocation for Virtual Networks 23

Leveraging Tenant Flexibility in Resource Allocation for Vir...

引用

23rd International Conference on Computer Communication and Networks (ICCCN)

作者： Zhang, Sheng Qian, Zhuzhong Wu, Jie Lu, Sanglu Nanjing Univ State Key Lab Novel Software Technol Nanjing Peoples R China Temple Univ Dept Comp & Informat Sci Philadelphia PA 19122 USA

ISBN: (纸本)9781479935727

Virtual networks that allow tenants to explicitly specify their computing as well as networking resources are recently proposed to be better interfaces between cloud providers and tenants. Many virtual networks have time-varying resource demands, as evidenced in prior studies [1-3]. New opportunities emerge when such variation is exploited. In this paper, we design a novel resource demand model for tenants to flexibly trade off between application performance and cost, and propose a work-conserving allocation algorithm, WCA, for deploying virtual networks with time-varying resource demands. WCA places virtual nodes in a first-fit fashion, and places virtual links through path-splitting. In each physical node or link, by opportunistically sharing physical resources among multiple variable parts of resource demands, physical utilization can be improved, and more virtual networks can be deployed concurrently. Our evaluation results show that WCA achieves a 4% higher physical resource utilization and rejects 18% less virtual network requests than a state-of-the-art algorithm [4].

关键词： algorithm design and analysis Capacity planning Computational modeling Data models Resource management Substrates Virtual machining Virtual networks algorithm design and analysis virtual machines data models management of resources Capacity planning tenants water conservation areas Computational modeling Resource utilization Substrates virtual machining resource requirements

来源：评论

学校读者我要写书评

暂无评论

Efficient Spectrum Allocation in Multiband CSMA Networks

Efficient Spectrum Allocation in Multiband CSMA Networks

引用

IEEE Wireless Communications and Networking Conference (WCNC)

作者： Subramanian, S. Shea, J. M. Pasiliao, E. L. Carvalho, M. M. Dixon, W. E. Univ Florida Dept Elect & Comp Engn Gainesville FL 32611 USA Univ Florida Dept Mech & Aerosp Engn Gainesville FL 32611 USA Univ Florida Res & Engn Educ Facil Shalimar FL 32579 USA US Air Force Res Lab Munit Directorate Eglin AFB FL 32542 USA Florida Inst Technol Dept Comp Sci Melbourne FL 32901 USA

ISBN: (纸本)9781479930838

We consider the problem of assigning a group of users with different rate requirements to a set of frequency bands, which may have different bandwidths, when the users access the channel via carrier-sense multiple access (CSMA). For example, in systems that employ dynamic spectrum access (DSA), secondary users may interleave their transmissions into space-time-frequency slots left open by primary users. The set of primary users that are active at a given time may leave a set. of available channels that have unequal bandwidths. The use of CSMA by the secondary users reduces the need to coordinate transmissions among the users allocated to a particular frequency band, but it also results in potential collisions, which reduce the overall data rate that can be accommodated in the band. This is especially true when the presence of a finite sensing delay is considered. In this paper, we consider the layer problem of allocating users to the available frequency bands to minimize the bandwidth used (to accommodate other groups of secondary users), while taking into account the CSMA interactions of assigning multiple users to a band. We formulate this as a new form of bin packing problem, in which the size of the bin depends on the number of users that are assigned to the bin. A near optimal solution to this problem is found numerically using the Gurobi solver, and the performance is compared with the suboptimal first-fit algorithm, which has complexity that is appropriate for online implementation. Simulation results are provided to compare the optimal and online algorithms in terms of efficiency in allocating the bandwidth to the users and their complexity.

关键词： bandwidth allocation bin packing carrier sense multiple access multiuser channels radio spectrum management DSA Gurobi solver bandwidth usage minimization bin packing problem carrier-sense multiple access data rate reduction dynamic spectrum access finite sensing delay frequency band multiband CSMA network multiple user assignment potential collision space-time-frequency spectrum allocation efficiency suboptimal first-fit algorithm user allocation algorithm design and analysis Bandwidth Channel capacity Markov processes Multiaccess communication Optimized production technology Time complexity carrier sense multiple access bin packing Frequency bands bandwidth allocation Consumers Optimized production technology Bandwidth algorithm design and analysis Multi access systems Radio spectrum management multiuser channels complexity classes dynamic strain aging Channel capacity Markov chain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：