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

International Conference on Wireless and Optical Communications ( WOCC)

作者： Panaya Pengboon Pasu Kaewplung Department of Electrical Engineering Faculty of Engineering Chulalongkom University Bangkok Thailand

ISBN: (纸本)9781467309400;9781467309417;9781467309394

This paper presents an algorithm for the design of the wireless-optical broadband access network (WOBAN) considering the multi-hop wireless connection among subscribers. With our algorithm, we can specify the number of hop in which subscribers can access to optical network units (ONUs) or base stations (BSs). Our algorithm will give the optimum positions, as well as the number, of ONU required in the network, when the number of wireless connection hop is ***, the algorithm can also assign for the shortest routes connecting among subscribers. Noted that the placement, the number of ONU, and the routes connecting among subscribers, will vary with the designed number of hop as well as the constraints of wireless connection such as the limitation of signal power.

关键词： component formatting fiber-to-the-home wireless-optical broadband access network (WOBAN) wireless mesh topology multi-hop connection Wireless connectivity fiber-to-the-home formatting Optical network units Humulus efficient algorithm broadband access Spread spectrum communication access network signal power algorithm design

来源：评论

学校读者我要写书评

暂无评论

An Irregular Approach to Large-Scale Computed Tomography on Multiple Graphics Processors Improves Voxel Processing Throughput

An Irregular Approach to Large-Scale Computed Tomography on ...

引用

High Performance Computing, Networking, Storage and Analysis (SCC), SC Companion:

作者： Edward S. Jimenez Laurel J. Orr Kyle R. Thompson Sandia National Laboratories Albuquerque NM USA

ISBN: (纸本)9781467362184

While much work has been done on applying GPU technology to computed tomography (CT) reconstruction algorithms, many of these implementations focus on smaller datasets that are better suited for medical applications. This paper proposes an irregular approach to the algorithm design which utilizes the GPU hardware's unique cache structure and employs small x-ray image data prefetches on the host to upload to the GPUs while the devices are operating on large contiguous sub-volumes of the reconstruction. This approach will improve the overall cache hit-rates and thus improve the performance of the massively multithreaded environment of the GPU. Overall, utilizing small prefetches of x-ray image data improved the volumetric pixel (voxel) processing rate when compared to utilizing large data prefetches which would minimize data transfers and kernel launches. Additionally, this approach does not sacrifice performance on small datasets and is thus suitable for medical and industrial applications. This work utilizes the CUDA programming environment and Nvidia's Tesla GPUs.

关键词： Graphics Processing Unit algorithm design image data pixel GRAPPER PICK UP Uploading data transmission X-Ray Computed Tomography large sizes graphic images Medical Cache memory PROCESSOR

来源：评论

学校读者我要写书评

暂无评论

The Optimization of Oil-water Well Measure Scheme Based on Quantum-behaved Particle Swarm Optimization

The Optimization of Oil-water Well Measure Scheme Based on Q...

引用

The Eleventh International Conference on Information and Management Sciences(IMS2012) in Celebrating of the 60th Birthday of Prof.Shu-Cherng Fang

作者： Xiaolong Yang~1,Fenglan Wang~2 and Jingang Niu~3 1.Northeast Petroleum University,Daqing,Heilongjiang,163318 2.Daqing Oilfield Company LTD,Daqing,Heilongjiang,163000 3.The 4~(th) Oil Production Factory,Daqing Oilfield Company LTD,Daqing,Heilongjiang,163000)

This paper proposed a solution based on quantum-behaved particle swarm optimization(QPSO) to solve the optimization problem of oil-water well measure *** first,it proposed a new quantum-behaved particle swarm optimization algorithm based on the square potential well from quantum *** according to the construction situation,it took the 0-1 coding of oil-water *** the objective functions and constrains satisfying combination of various measures,it set up fitness function *** the optimization process,it introduced mutation strategy to increase the diversity of *** experimental results show that it obtains satisfactory optimization results with this *** it reveals that quantum intelligent optimization algorithm has broad application prospect in oilfield development projects.

关键词： oil-water wells construction project measure scheme optimization quantum-behaved particle swarm optimization algorithm design

来源：评论

学校读者我要写书评

暂无评论

Development and Application of Online Judge System

Development and Application of Online Judge System

引用

2012 International Symposium on Information Technologies in Medicine and Education(ITME2012)

作者： Jianhua Wu Electrical and Information College Jinan University Zhuhai China Shuangping Chen Rongrong Yang Electrical and Information College Jinan University Zhuhai China

Programming language and algorithm design are core courses in computer *** are the foundation of software ***,in the experiment teaching of courses there are still many *** paper first analyzes those problems,then some advantages are discussed when ACM contest mode is brought in those courses;and last an online judge system is introduced in detail,including system design,implementation and *** results of the system prove that reform experiment teaching can effectively improve the students’ programming ability and study interest.

关键词： component Programming language algorithm design Experiment teaching ACM Online judge

来源：评论

学校读者我要写书评

暂无评论

Spatial-dependent waveform design for colocated uniform linear array multiple-input multiple-output radar

引用

IET RADAR SONAR AND NAVIGATION 2011年第5期5卷 545-550页

作者： Jindong, Z. Kerang, W. Xiaohua, Z. Nanjing Univ Sci & Technol Sch Elect Engn & Optoelect Technol Nanjing 210094 Jiangsu Peoples R China

Multiple-input multiple-output (MIMO) radars have attracted considerable attention for their ability to transmit multiple waveforms. These waveforms affect the range, Doppler and spatial performance. Recently, the concept of ambiguity function, which is an important mathematical tool for analysing and designing radar signals, has been extended to the MIMO radar case. In this study, the authors investigate the range and spatial properties of colocated MIMO radar based on range-spatial ambiguity function. Owing to spatial dependence of the matched filter output of MIMO radar, the spatial detection region is divided into multiple sections by spatial resolution. A new algorithm for designing orthogonal frequency-hopping waveforms according to the spatial section where the target may appear is proposed. This algorithm improves the peak sidelobe level of the matched filter output.

关键词： algorithm design filter output RADAR SIGNALS matched filters MIMO radar waveforms ambiguity function SPACE DEPENDENCE multiple input multiple output systems

来源：评论

学校读者我要写书评

暂无评论

Model-based object tracking in wireless sensor networks

引用

WIRELESS NETWORKS 2011年第2期17卷 549-565页

作者： Chen, Chao-Chun Liao, Chien-Han So Taiwan Univ Dept Comp Sci & Informat Engn Tainan Taiwan Moxa Inc Ind Wireless Div Taipei Taiwan

Tracking moving objects is one of the most common requirements in wireless sensor network applications. Most tracking schemes predict a target's location based on a single object movement model and periodically activate nearby sensors to monitor the target. However, in most real-world situations, a target exhibits multiple movement patterns. Thus, multiple movement models are required to accurately describe the target's movement. This paper proposes a tracking framework, called model-based object tracking system (MOTS), that allows a sensor network to adaptively apply the most suitable tracking mechanism to monitor the target under various circumstances. To fairly and accurately evaluate all tracking modules, this study further develops a monitoring-cost evaluator to evaluate the monitoring cost of the inactive tracking modules, and then designs three tracking module selection strategies, the Greedy Strategy, Min-Max Strategy, and Weighted Moving Average Strategy, to select the most effective tracking module to monitor the target in each period. A set of experiments is conducted to evaluate MOTS and compare it against existing tracking systems. The obtained results reveal that the cost efficiency of MOTS is considerably better than that of existing tracking systems.

关键词： Object tracking Sensor network Movement model Prediction Selection strategy algorithm design Simulation

来源：评论

学校读者我要写书评

暂无评论

On the Influence of the Number of Objectives on the Hardness of a Multiobjective Optimization Problem

引用

IEEE TRANSACTIONS ON EVOLUTIONARY COMPUTATION 2011年第4期15卷 444-455页

作者： Schuetze, Oliver Lara, Adriana Coello Coello, Carlos A. CINVESTAV IPN Dept Comp Sci Mexico City 07300 DF Mexico

In this paper, we study the influence of the number of objectives of a continuous multiobjective optimization problem on its hardness for evolution strategies which is of particular interest for many-objective optimization problems. To be more precise, we measure the hardness in terms of the evolution (or convergence) of the population toward the set of interest, the Pareto set. Previous related studies consider mainly the number of nondominated individuals within a population which greatly improved the understanding of the problem and has led to possible remedies. However, in certain cases this ansatz is not sophisticated enough to understand all phenomena, and can even be misleading. In this paper, we suggest alternatively to consider the probability to improve the situation of the population which can, to a certain extent, be measured by the sizes of the descent cones. As an example, we make some qualitative considerations on a general class of uni-modal test problems and conjecture that these problems get harder by adding an objective, but that this difference is practically not significant, and we support this by some empirical studies. Further, we address the scalability in the number of objectives observed in the literature. That is, we try to extract the challenges for the treatment of many-objective problems for evolution strategies based on our observations and use them to explain recent advances in this field.

关键词： algorithm design evolutionary computation many-objective optimization multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Representing a Functional Curve by Curves with Fewer Peaks

引用

DISCRETE & COMPUTATIONAL GEOMETRY 2011年第2期46卷 334-360页

作者： Chen, Danny Z. Wang, Chao Wang, Haitao Univ Notre Dame Dept Comp Sci & Engn Notre Dame IN 46556 USA

In this paper, we study the problems of (approximately) representing a functional curve in 2-D by a set of curves with fewer peaks. Representing a function (or its curve) by certain classes of structurally simpler functions (or their curves) is a basic mathematical problem. Problems of this kind also find applications in applied areas such as intensity-modulated radiation therapy (IMRT). Let f be an input piece-wise linear functional curve of size n. We consider several variations of the problems. (1) Uphill-downhill pair representation (UDPR): Find two nonnegative piecewise linear curves, one nondecreasing (uphill) and one nonincreasing (downhill), such that their sum exactly or approximately represents f. (2) Unimodal representation (UR): Find a set of unimodal (single-peak) curves such that their sum exactly or approximately represents f. (3) Fewer-peak representation (FPR): Find a piecewise linear curve with at most k peaks that exactly or approximately represents f. Furthermore, for each problem, we consider two versions. For the UDPR problem, we study its feasibility version: Given epsilon > 0, determine whether there is a feasible UDPR solution for f with an approximation error epsilon;its min-epsilon version: Compute the minimum approximation errror c* such that there is a feasible UDPR solution for f with error c*. For the UR problem, we study its min-k version: Given epsilon > 0, find a feasible solution with the minimum number k* of unimodal curves for f with an error epsilon;its min-epsilon version: given k > 0, compute the minimum error epsilon* such that there is a feasible solution with at most k unimodal curves for f with error epsilon*. For the FPR problem, we study its min-k version: Given epsilon > 0, find one feasible curve with the minimum number k* of peaks for f with an error epsilon;its min-epsilon version: given k >= 0, compute the minimum error epsilon* such that there is a feasible curve with at most k peaks for f with error epsilon*. Litt

关键词： Curve approximation Curve simplification Curves with fewer peaks algorithm design

来源：评论

学校读者我要写书评

暂无评论

algorithmic Folding Complexity

引用

GRAPHS AND COMBINATORICS 2011年第3期27卷 341-351页

作者： Cardinal, Jean Demaine, Erik D. Demaine, Martin L. Imahori, Shinji Ito, Tsuyoshi Kiyomi, Masashi Langerman, Stefan Uehara, Ryuhei Uno, Takeaki Univ Libre Bruxelles Dept Informat B-1050 Brussels Belgium MIT Comp Sci & Artificial Intelligence Lab Cambridge MA 02139 USA Nagoya Univ Grad Sch Engn Dept Computat Sci & Engn Nagoya Aichi 4648603 Japan

How do we most quickly fold a paper strip (modeled as a line) to obtain a desired mountain-valley pattern of equidistant creases (viewed as a binary string)? Define the folding complexity of a mountain-valley string as the minimum number of simple folds required to construct it. We first show that the folding complexity of a length-n uniform string (all mountains or all valleys), and hence of a length-n pleat (alternating mountain/valley), is O(lg(2) n). We also show that a lower bound of the complexity of the problems is Omega(lg(2) n/lg lg n). Next we show that almost all mountain-valley patterns require Omega(n/lg n) folds, which means that the uniform and pleat foldings are relatively easy problems. We also give a general algorithm for folding an arbitrary sequence of length n in O(n/lg n) folds, meeting the lower bound up to a constant factor.

关键词： algorithm design Origami

来源：评论

学校读者我要写书评

暂无评论

A randomized algorithm for two servers in cross polytope spaces

引用

THEORETICAL COMPUTER SCIENCE 2011年第7期412卷 563-572页

作者： Bein, Wolfgang Iwama, Kazuo Kawahara, Jun Larmore, Lawrence L. Oravec, James A. Univ Nevada Sch Comp Sci Ctr Adv Study Algorithms Las Vegas NV 89154 USA Kyoto Univ Sch Informat Kyoto 6068501 Japan

It has been a long-standing open problem to determine the exact randomized competitiveness of the 2-server problem, that is, the minimum competitiveness of any randomized online algorithm for the 2-server problem. For deterministic algorithms the best competitive ratio that can be obtained is 2 and no randomized algorithm is known that improves this ratio for general spaces. For the line, Bartal et al. (1998) [2] give a 155/78 competitive algorithm, but their algorithm is specific to the geometry of the line. We consider here the 2-server problem over Cross Polytope Spaces M-24. We obtain an algorithm with competitive ratio of and show that this ratio is best possible. This algorithm gives the second non-trivial example of metric spaces with better than 2-competitive ratio. The algorithm uses a design technique called the knowledge state technique a method not specific to M-24. (C) 2010 Elsevier B.V. All rights reserved.

关键词： Online algorithms Randomized algorithms Cross polytope spaces Server problem algorithm design algorithm engineering

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：