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

3rd International Conference on Artificial Intelligence and Computational Intelligence (AICI 2011)

作者： Yang, Min Nanjing Univ Posts & Telecommun Coll Automat Nanjing Jiangsu Peoples R China

ISBN: (纸本)9783642238956

Computing the fundamental matrix is the first step of many computer vision applications including camera calibration, image rectification and structure from motion. A new method for the estimation of the fundamental matrix from point correspondences is presented. The minimization of the geometric error is performed based L-infinity norm minimization framework. A single global minimum exists and it may be found by SOCP (Second-Order Cone Programming), which is a standard technique in convex optimization. In a SOCP a linear function is minimized over the intersection of an affine set and the product of second-order (quadratic) cones. Several efficient primal-dual interior-point methods for SOCP have been developed. Experiments on real images show that this method provides a more accurate estimate of the fundamental matrix and superior to previous approaches, and the method is no need for normalization of the image coordinates.

关键词： Fundamental matrix L-infinity norm minimization Second-Order Cone Programming optimal algorithms Multiview geometry

来源：评论

学校读者我要写书评

暂无评论

Dynamic energy aware task scheduling using run-queue peek

Dynamic energy aware task scheduling using run-queue peek

引用

International Conference on Parallel and Distributed Computing and Networks

作者： Pawaskar, Sachin Ali, Hesham H. Univ Nebraska Dept Comp Sci Omaha NE 68182 USA

ISBN: (纸本)9780889866379

Scheduling dependent tasks is one of the most challenging problems in parallel and distributed systems. It is known to be computationally intractable in its general form as well as several restricted cases. An interesting application of scheduling is in the area of energy awareness for mobile battery operated devices where minimizing the energy utilized is the most important scheduling policy consideration. A number of heuristics have been developed for this consideration. In this paper, we study the scheduling problem for a particular battery model. In the proposed work, we show how to enhance a well know approach of accounting for the slack generated at runtime due to the difference between WCET (Worst Case Execution Time) and AET (Actual Execution Time). Our solution exploits the fact that even though some tasks become available based on the actual periodicity of a task they are not executed because the run queue is determined by the schedule generated in the offline phase I of the algorithm using the conservative EDF (Earliest Deadline First) algorithm. We peek at the task run-queue to find such tasks to eliminate wastage of the slack generated. Based on the outcome of the conducted experiments, the proposed algorithm outperformed or matched the performance of the 2-Phase dynamic task scheduling algorithm all the time.

关键词： scheduling energy awareness heuristics parallel processing optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

Sustainable Programming : A New Paradigm Shift Towards Sustainable Development 7

Sustainable Programming : A New Paradigm Shift Towards Susta...

引用

7th IEEE Pune Section International Conference, PuneCon 2024

作者： Bhadane, Shraddha Unde, Vineet Pathan, Asadkhan Kadam, Atharv Shinde, Gitanjali R. Mahalle, Parikshit N. Vishwakarma Institute of Information Technology Computer Engineering Pune India Vishwakarma Institute of Information Technology Pune India Hod Ai&ds Vishwakarma Institute of Information Technology Pune India

ISBN: (纸本)9798331527822

Technology is an indication of energy use, and specifically, the use of electricity plays a significant role in impacting the environment. As technology continues to advance, the importance of sustainability grows, ensuring that our innovations do not come at the cost of ecological balance. The research aims to discuss green computing and sustainability in data centers based on concepts involving application, facility, and sustainability measures. To solve these challenges, it is suggested that resolutions be made to accelerate the optimal algorithms, adopt an energy-saving language, and adhere to sustainable software development practices. In this context, programming languages are compared in terms of their power consumption, supported by graphics. The outcomes of the experiment demonstrate the potential for energy savings through efficient, sustainably implemented coding and confirm the importance of green software. © 2024 IEEE.

关键词： Data Centers Energy Efficiency Energy-Saving Languages Green Computing optimal algorithms Power Consumption Sustainable Programming

来源：评论

学校读者我要写书评

暂无评论

Comments on “algorithms for Reporting and Counting Geometric Intersections”

引用

IEEE Transactions on Computers 1981年第2期C-30卷 147-148页

作者： Brown, Kevin Q. Carnegie-Mellon University Pittsburgh PA United States

Bentley and Ottmann1 present an algorithm for reporting all K intersections among TV planar line segments in 0((N + K) log N) time and 0(N + K) storage. With a small modification that storage requirement can be reduce... 详细信息

关键词： Computational geometry VLSI design rule checking geometric intersection problems optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

An optimal Algorithm for Finding the Kernel of a Polygon

引用

Journal of the ACM (JACM) 1979年第3期26卷 415-421页

作者： Lee, D.T. Preparata, F.P. University of Illinois Urbana-Champaign Urbana Illinois United States Coordinated Science Laboratory University of Illinois Urbana-Champaign Urbana IL 61801 United States

The kernel K(P) of a simple polygon P wah n verUces is the locus of the points internal to P from which all verUces of P are wslble Equwalently, K(P) is the mtersectmn of appropriate half-planes determined by the polygon's edges Although it is known that to find the intersection of n generic half-planes requires time O(n log n), we show that one can exploit the ordering of the half-planes corresponding to the sequence of the polygon's edges to obtain a kernel finding algorithm which runs m time O(n) and is therefore optimal. © 1979, ACM. All rights reserved.

关键词： computational complexity kernel of polygon optimal algorithms simple polygon

来源：评论

学校读者我要写书评

暂无评论

Stochastic optimization with averaging of trajectories

引用

Stochastics 1992年第2-3期39卷 107-118页

A recursive stochastic optimization procedure under dependent disturbances is studied. It is based on the Polyak-Ruppert algorithm with trajectory averaging. Almost sure convergence of the algorithm is proved as well as asymptotic normality of the delivered estimates. It is shown that the presented algorithm attains the highest possible asymptotic convergence rate for stochastic approximation algorithms

关键词： Stochastic optimization stochastic approximation optimal algorithms asymptotic normality

来源：评论

学校读者我要写书评

暂无评论

HIGHER ORDER ILC VERSUS ALTERNATIVES APPLIED TO CHAIN CONVEYOR SYSTEMS

引用

IFAC Proceedings Volumes 2002年第1期35卷 31-36页

作者： T. Al-Towaim P. Lewin E. Rogers Dept. of Electronics and Computer Science University of Southampton Southampton SO17 1BJ UK

The norm optimal approach, both in its basic form and the extension to predictive action, where the predicted errors on a number of future trials are explicitly included in the cost function for controller design, is now a well established area in iterative learning control in terms of the underlying theory. By the fact that it includes the predicted errors on future trials in the cost function, predictive iterative learning control is clearly a higher order law. Hence it is now appropriate to ask if, in practical situations, predictive norm optimal iterative learning control can deliver significantly improved performance over its norm optimal alternative to merit the extra computational and hardware costs associated with its application. This is the area addressed in this paper using a somewhat new application area in the form of chain conveyor systems.

关键词： iterative learning control optimal algorithms comaprative studies

来源：评论

学校读者我要写书评

暂无评论

Extensions to the Weber problem

引用

COMPUTERS & OPERATIONS RESEARCH 2022年 143卷 1页

作者： Church, Richard L. Drezner, Zvi Tamir, Arie Univ Calif Santa Barbara Emeritus Dept Geog Santa Barbara CA 93106 USA Calif State Univ Fullerton Coll Business & Econ Fullerton CA 92634 USA Tel Aviv Univ Emeritus Sch Math Sci Tel Aviv Israel

One of the classics in the field of Location Science is the book on the theory of industrial location by Weber (1909). Weber used a simple construct comprised of a 3-point triangle to describe important issues, including where raw materials for manufacturing are sourced. Virtually all of the research conducted in the last 50 years related to Weber's construct has overlooked major elements of his work. This includes the issue of sourcing needed raw materials, which can be limited, as an integral part the location problem. This paper explores one form of raw material sourcing first described by Weber in which each raw material source is limited by a fixed capacity. We show that most instances of this location problem are non-convex as well as propose a solution procedure. We also explore a related problem where the facility itself can be of limited capacity and not all demands can be served. These two models can serve as building blocks for a greater exploration of many of the important problem facets proposed by Weber in his seminal work.

关键词： Weber problem continuous location optimal algorithms

来源：评论

学校读者我要写书评

暂无评论

Lower Information Bounds for an Adaptive Control Problem

引用

IFAC Proceedings Volumes 1992年第14期25卷 191-196页

作者： A. Juditsky A. Nazin IRISA/INRIA Campus de Beaulieu 35042 Rennes France Institute for Control Science Profsoyuznaya 65 117342 Moscow Russia

An adaptive tracking problem is considered for a linear stochastic SISO control plant. Several information bounds are obtained under a variety of conditions imposed on the disturbances and control strategies.

关键词： adaptive control optimal algorithms lower bounds efficient control strategies

来源：评论

学校读者我要写书评

暂无评论

ON PARALLEL PREFIX COMPUTATION

引用

Parallel Processing Letters 1994年第4期4卷 429-436页

作者： SANJEEV SAXENA P.C.P. BHATT V.C. PRASAD Computer Science and Engineering Indian Institute Of Technology Kanpur 208 016 India Micro-elec. and Comp.Sys.Lab. Electrical Enginnering Department McGill University 3480 University Street Montreal (Quebec) H3A 2A7 Canada On leave from: Computer Science and Engineering Indian Institute Of Technology Delhi New Delhi 110 016 INDIA Electrical Engineering Indian Institute Of Technology Delhi New Delhi 110 016 India

We prove that prefix sums of n integers of at most b bits can be found on a COMMON CRCW PRAM in time with a linear time-processor product. The algorithm is optimally fast, for any polynomial number of processors. In particular, if the time taken is . This is a generalisation of previous result. The previous time algorithm was valid only for O(log n)-bit numbers. Application of this algorithm to r-way parallel merge sort algorithm is also considered. We also consider a more realistic PRAM variant, in which the word size, m, may be smaller than b (m≥log n). On this model, prefix sums can be found in optimal time.

关键词： Parallel prefix parallel algorithm optimal algorithms shared memory model sorting CRCW model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：