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

4th International Conference on Parallel and Distributed Computing, Applications and Technologies (PDCAT 2003)

作者： Li, KL Li, QH Wang-Hui Jiang, SY Huazhong Univ Sci & Technol Sch Comp Sci & Technol Wuhan 430074 Peoples R China

ISBN: (纸本)0780378407

The knapsack problem is very important in cryptosystem and in number theory. This paper proposes a new parallel algorithm for the knapsack problem where the method of divide and conquer is adopted. Basing on an EREW-SIMD machine with shared memory, the proposed algorithm utilizes O(2(n/4))(1-epsilon) processors, 0less than or equal to epsilon less than or equal to 1, and O(2(n)) memory to find a solution for the n-element knapsack problem in time O(2(n/4) (2(n/4))epsilon). Thus the cost of the proposed parallel algorithm is O(2(n)), which is optimal, and an improved result over the past researches. Keywords: Knapsack problem, parallel algorithm, optimal algorithm, memory conflicts.

关键词： knapsack problem parallel algorithm optimal algorithm memory conflicts

来源：评论

学校读者我要写书评

暂无评论

On the macroscopic optimization of multicell wireless systems with multiuser detection and multiple antennas - Uplink analysis

引用

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS 2005年第4期4卷 1388-1393页

作者： Lau, VKN Hong Kong Univ Sci & Technol Dept Elect & Elect Engn Kowloon Hong Kong Peoples R China

In this paper, we consider a system with K single-antenna client users, n(B) base stations (each base station has n(R) antennas), as well as a centralized controller. A client user could be associated with, a single base station at any time. All the base stations operate at the same frequency and have optimal multiuser detection per base station which cancels intracell interference only. We consider a general problem of uplink macroscopic resource management where the centralized controller dynamically determines an appropriate association mapping of the K users with respect to the n(B) base stations over a macroscopic time scale. We propose a novel analytical framework for the above macroscopic scheduling problems. A simple rule is to associate a user with the strongest base station (camp-on-the-strongest-cell), and this has been widely employed in conventional cellular systems. However, based on the optimization framework, we found that this conventional approach is in fact not optimal when multiuser detection is employed at the base station. We show that the optimal macroscopic scheduling algorithm is of exponential complexity, and we propose a simple greedy algorithm as a feasible solution.

关键词： genetic algorithm macroscopic scheduling multicell scheduling multiple antenna multiuser detection optimal algorithm proportional fairness utility functions

来源：评论

学校读者我要写书评

暂无评论

Process to determine optimal cooling pattern design of austenitic stainless steel bloom by continuous casting

Process to determine optimal cooling pattern design of auste...

引用

AISTech 2005 - Iron and Steel Technology Conference Proceedings

作者： Kim, Young-Mo Jung, Young-Jin Kim, Dai-Ryoung Hyoja-dong san 32 Pohang city KyoungBook Korea Republic of Dongchong-dong 1 Pohang city KyoungBook Korea Republic of KyoungBook Nat'l University Sangyuk-dong 1370 Buk-Gu Daegu city Korea Republic of

No abstract available

关键词： Austenitic Stainless Steel Bloom Continuous Casting Heat Transfer optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

On the continuous Fermat-Weber problem

引用

OPERATIONS RESEARCH 2005年第1期53卷 61-76页

作者： Fekete, SP Mitchell, JSB Beurer, K Braunschweig Univ Technol Inst Math Optimizat D-38106 Braunschweig Germany SUNY Stony Brook Dept Appl Math & Stat Stony Brook NY 11794 USA SAP AG D-69190 Walldorf Germany

We give the first exact algorithmic study of facility location problems that deal with finding a median for a continuum of demand points. In particular, we consider versions of the "continuous k-median (Fermat-Weber) problem" where the goal is to select one or more center points that minimize the average distance to a set of points in a demand region. In such problems, the average is computed as an integral over the relevant region, versus the usual discrete sum of distances. The resulting facility location problems are inherently geometric, requiring analysis techniques of computational geometry. We provide polynomial-time algorithms for various versions of the L-1 l-median (Fermat-Weber) problem. We also consider the multiple-center version of the L-1 k-median problem, which we prove is NP-hard for large k.

关键词： P-CENTER PROBLEM EUCLIDEAN 1-CENTER PROBLEM K-CENTER PROBLEM LOCATIONPROBLEM 2-CENTER PROBLEM RECTANGULAR DISTANCES FORBIDDEN REGIONS optimal algorithm SIMPLEPOLYGON LINEAR TIME

来源：评论

学校读者我要写书评

暂无评论

optimal Parallel algorithm for the Knapsack Problem Without Memory Conflicts

Optimal Parallel Algorithm for the Knapsack Problem Without ...

引用

The Fourth International Conference on Parallel and Distributed Computing, Applications and Technologies

作者： Kenli LI Qinghua LI Wang-Hui Shengyi JIANG School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan430074China National High Performance Computing Center(Wuhan)

The knapsack problem is very important in cryptosystem and in number *** paper proposes a new parallel algorithm for the knapsack problem where the method of divide and conquer is *** on an EREW-SIMD machine with shared memory,the proposed algorithm utilizes O(2) processors,0≤ε≤1,and O(2) memory to find a solution for the n-element knapsack problem in time O(2(2)).Thus the cost of the proposed parallel algorithm is O(2),which is optimal,and an improved result over the past researches.

关键词： Knapsack problem parallel algorithm optimal algorithm memory conflicts

来源：评论

学校读者我要写书评

暂无评论

Research on optimized algorithm in the PMD adaptive compensation

Research on optimized algorithm in the PMD adaptive compensa...

引用

Conference on Optical Transmission, Switching and Subsystems II

作者： Li, TJ Wang, MG Jian, SS Chen, Y Cao, JH Cai, LB Zhao, J Beijing Jiaotong Univ Inst Lightwave Technol Beijing 100044 Peoples R China

ISBN: (纸本)0819455792

Dynamic programming, the ordinary adaptive compensation in the operational research, is used to resolve extremum of functions under the constraint condition. In this paper, it is introduced that, fundamentals, methods and steps about the first-order PMD compensation by dynamic programming. The result shows that, for the first-order PMD compensation, dynamic programming is used to carry out optimized design, and the result is satisfied. Beginning with recursive relation of PMD vectors in the fiber and the compensation devices, mathematical model of the first-order PMD compensation is established. Through optimized algorithm using dynamic programming, simulation and experiment for PMD adaptive compensation are both implemented. Some optimized algorithms once used in the PMD adaptive compensation have slow speed to approximate the optimal value and tends to become the local optimal solution;but if optimized algorithm using dynamic programming can approximate the global optimal solution directly. Therefore, it has the advantage of fast optimized speed. On this basis, the image of optimal solution is given and analyzed. PMD compensation scheme, based on PMD compensation vector, is proposed. The algorithm principle of adjusting control and the direction of improvement are also put forward. These results are benefit for dynamic adaptive compensation of PMD.

关键词： optical communication PMD optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Robust Tuning of PID Controller Using Bacterial-Foraging-Based Optimization

引用

JOURNAL OF ADVANCED COMPUTATIONAL INTELLIGENCE AND INTELLIGENT INFORMATICS 2005年第6期9卷 669-676页

作者： Kim, Dong Hwa Cho, Jae Hoon Hanbat Natl Univ Dept Instrumentat & Control Engn 16-1 San Duckmyong Dong Yuseong Gu Seoul 305719 South Korea

We propose a design approach to PID controllers with resistance to external disturbance in motor-controlled systems using a bacterial foraging-based optimal algorithm. PID controllers are used to operate AC motor drives because of their practical implementation and simple structure. Inexperienced personnel find it difficult, however, to achieve optimal PID gain because this is manually tuned by trial and error in industrial environments full of disturbances. To design disturbance-resistance tuning, we use disturbance-resistance conditions based on H-infinity and calculcate response the performance based on bacterial foraging for the PID controller as an integral of time-weighted squared error. Hence, parameters for the PID controller are selected by our bacterial foraging-based optimal algorithm to obtain the required response.

关键词： PID control disturbance control bacterial algorithm optimal algorithm motor control

来源：评论

学校读者我要写书评

暂无评论

A randomized time-work optimal parallel algorithm for finding a minimum spanning forest

引用

SIAM JOURNAL ON COMPUTING 2002年第6期31卷 1879-1895页

作者： Pettie, S Ramachandran, V Univ Texas Dept Comp Sci Austin TX 78712 USA

We present a randomized algorithm to find a minimum spanning forest (MSF) in an undirected graph. With high probability, the algorithm runs in logarithmic time and linear work on an exclusive read exclusive write (EREW) PRAM. This result is optimal w.r.t. both work and parallel time, and is the first provably optimal parallel algorithm for this problem under both measures. We also give a simple, general processor allocation scheme for tree-like computations.

关键词： parallel algorithm minimum spanning tree optimal algorithm EREW PRAM

来源：评论

学校读者我要写书评

暂无评论

Fast optimal and suboptimal any-time algorithms for CDMA multiuser detection based on branch and bound

引用

IEEE TRANSACTIONS ON COMMUNICATIONS 2004年第4期52卷 632-642页

作者： Luo, J Pattipati, KR Willett, P Levchuk, GM Univ Maryland Syst Res Inst College Pk MD 20742 USA Univ Connecticut Dept Elect Engn Storrs CT 06269 USA Aptima Inc Woburn MA 01801 USA

A fast optimal algorithm based on the branch-and-bound (BBD) method is proposed for the joint detection of binary symbols of K users in a synchronous code-division multiple-access channel with Gaussian noise. Relationships between the proposed algorithms (depth-first BBD and fast BBD) and both the decorrelating decision-feedback (DF) detector and sphere-decoding algorithm are clearly drawn. It turns out that decorrelating DF detector corresponds to a, "one-pass" depth-first BBD;sphere decoding is, in fact, a type of depth-first BBD, but one that can be improved considerably via tight upper bounds and user ordering, as in the fast BBD. A fast "any-time" suboptimal algorithm is also available by simply picking the "current-best" solution in the BBD method. Theoretical results are given on the computational complexity and the performance of the "current-best" suboptimal solution.

关键词： branch and bound (BBD) code-division multiple access (CDMA) multinser detection optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

Compound Genetics Annealing optimal algorithm for Realization of Locus Deduction of a Plane Link

引用

Journal of Southeast University(English Edition) 2002年第4期18卷 310-314页

作者：林晓通林晓辉黄卫王宁生南京航空航天大学机电学院南京210016 东南大学机械工程系南京210096

A compound algorithm of genetic annealing is designed for optimizing the luffing mechanism locus of a plane link by means of random optimal algorithm, genetic and annealing algorithm. The computing experiment shows that the algorithm has much better steady convergence performance of optimal process and can hunt out the global optimal solution by biggish probability for objective function of multi peak value. 

关键词： genetic annealing algorithm luffing mechanism optimal algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：