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

Finding Story Chains in Newswire Articles

Finding Story Chains in Newswire Articles

13th IEEE International Conference on Information Reuse and Integration (IEEE IRI) / DIM / WICSOC / IEEE EM- RITE / IRI-HI

作者： Zhu, Xianshu Oates, Tim Univ Maryland Baltimore Cty CSEE Dept Baltimore MD 21228 USA

ISBN: (纸本)9781467322843

Massive amounts of information about news events are published on the Internet every day in online newspapers, blogs, and social network messages. While search engines like Google help retrieve information using keywords, the large volumes of unstructured search results returned by search engines make it hard to track the evolution of an event. A story chain is composed of a set of news articles that reveal hidden relationships among different events. Traditional keyword-based search engines provide limited support for finding story chains. In this paper, we propose a random walk based algorithm to find story chains. When breaking news happens, many media outlets report the same event. We have two pruning mechanisms in the algorithm to automatically exclude redundant articles from the story chain and to ensure efficiency of the algorithm. Experimental results show that our proposed algorithm can generate coherent story chains without redundancy.

关键词： Search engines news algorithms algorithm efficiency Complement of an Event redundancy FINDINGS

来源：评论

学校读者我要写书评

暂无评论

A load balanced distributed algorithm to solve the permutation flow shop problem using the Grid

A load balanced distributed algorithm to solve the permutati...

引用

15th IEEE International Conference on Computational Science and Engineering (CSE) / 10th IEEE/IFIP International Conference on Embedded and Ubiquitous Computing (EUC)

作者： Kouki, Samia Jemni, Mohamed Ladhari, Talel Univ Tunis High Sch Sci & Tech Tunis Res Lab LATICE Tunis Tunisia Polytechn Sch Tunisia ROI Combinatorial Optimizat Res Grp La Marsa Tunisia King Saud Univ Coll Engn Dept Ind Engn Princess Fatimah Al Nijriss Res Chair Adv Mfg Tec Riyadh 11421 Saudi Arabia

ISBN: (纸本)9781467351652;9780769549149

This paper deals with solving the permutation flow shop problem (PFSP) which is an NP-hard scheduling problem using grid computing. As the sequential resolution of this problem can be sometimes impossible on a single machine and especially for instances of large data, we are interested in this work by solving the PFSP using parallel programming. In a previous paper, we presented a parallel algorithm for solving the PFSP on the grid called GAUUB. The GAUUB algorithm uses the Branch and Bound method to find optimal solutions of the problem and distributes the tasks among all processors. In this paper, we present a new algorithm called GALB, based on a parallelization strategy ensuring better load balancing between the processors and therefore, better efficiency of the algorithm. Computational results of our new algorithm performed on the grid showed good results and significant improvements of our initial algorithm thanks to our load balancing technique.

关键词： Grid computing distributed algorithms Load balancing Parallel algorithms PROCESSOR Branch and bound methods grids shopping mall Permutation PROBLEM SOLUTION Parallel programming Grid algorithm efficiency optimal solution

来源：评论

学校读者我要写书评

暂无评论

A Novel Parallel Approach of Radix Sort with Bucket Partition Preprocess

A Novel Parallel Approach of Radix Sort with Bucket Partitio...

引用

14th IEEE International Conference on High Performance Computing and Communications (HPCC) / IEEE 9th International Conference on Embedded Software and Systems (ICESS)

作者： Zhang, Keliang Wu, Baifeng Fudan Univ Sch Comp Sci Shanghai 201203 Peoples R China

ISBN: (纸本)9780769547497

Radix sort is an important sorting algorithm which is widely used in applications such as binary search and database. The most important advantage of radix sort is its time complexity is O(n), lower than other sorting algorithms based on comparison operation. However, a factor that hampers its application is long execution time of its loop body. In this paper, based on data level parallelism idea, we present a new parallel radix sort algorithm. In this algorithm, each iteration of loop can be fully parallelized via thounds of concurrent threads, eliminating the original performance bottleneck. Furthermore, it is a scalable algoirthm, which means the performance of algorithm can be linearly improved with the increase of core number of modern many-core processors. Experiment results show the efficiency of the algorihtm.

关键词： radix sorting Sorting algorithm caliber number Binary search algorithm efficiency Loops execution time complexity classes algorithms ALEMBIC buckets

来源：评论

学校读者我要写书评

暂无评论

AN EFFICIENT SIMULATION-BASED OPTIMIZATION algorithm FOR LARGE-SCALE TRANSPORTATION PROBLEMS

AN EFFICIENT SIMULATION-BASED OPTIMIZATION ALGORITHM FOR LAR...

引用

Winter Simulation Conference (WSC)

作者： Osorio, Carolina Chong, Linsen MIT Cambridge MA 02139 USA

ISBN: (纸本)9781467347792;9781467347808

This paper applies a computationally efficient simulation-based optimization (SO) algorithm suitable for large-scale transportation problems. The algorithm is based on a metamodel approach. The metamodel combines information from a high-resolution yet inefficient microscopic urban traffic simulator with information from a scalable and tractable analytical macroscopic traffic model. We then embed the model within a derivative-free trust region algorithm. We evaluate its performance considering tight computational budgets. We illustrate the efficiency of this algorithm by addressing an urban traffic signal control problem for the full city of Lausanne, Switzerland. The problem consists of a nonlinear objective function with nonlinear constraints. The problem addressed is considered large-scale and complex both in the fields of derivative-free optimization and simulation-based optimization. We compare the performance of the method to a traditional metamodel method.

关键词： Optimization algorithms Metamodels traffic in cities Objective function transport large sizes Scalability macro-traffic model algorithm efficiency traffic signal controller nonlinear constraint Traffic signal control systems algorithms

来源：评论

学校读者我要写书评

暂无评论

Centrality indices computation in dynamic networks

Centrality indices computation in dynamic networks

引用

2012 IEEE 12th International Conference on Computer and Information Technology, CIT 2012

作者： Tabirca, Tatiana Tabirca, Sabin Yang, Laurence T. Department of Computer Science University College Cork Cork Ireland Department of Computer Science St. Francis Xavier University Antigonish NS B2G 2W5 Canada

ISBN: (纸本)9780769548586

The article introduces the notion of dynamic indices as centrality measures to analyse how the importance of nodes changes in future time in dynamic networks. In particular, the dynamic closeness, dynamic graph, dynamic stress and dynamic between ness measures are investigated. We develop some algorithms for computing these indices in the dynamic case when the costs are supposed to be integers. Finally, we present some experimental results exploring the algorithms' efficiency and illustrating the variation of the dynamic between ness index for some sample dynamic networks. © 2012 IEEE.

关键词： dynamic network algorithm efficiency dynamic Indexes

来源：评论

学校读者我要写书评

暂无评论

On the Computation of the Efficient Frontier of the Portfolio Selection Problem

引用

JOURNAL OF APPLIED MATHEMATICS 2012年第unknown期2012卷 105616-1-105616-25页

作者： Calvo, Clara Ivorra, Carlos Liern, Vicente Univ Valencia Dept Matemat Econ & Empresa Valencia Spain

An easy-to-use procedure is presented for improving the e-constraint method for computing the efficient frontier of the portfolio selection problem endowed with additional cardinality and semicontinuous variable constraints. The proposed method provides not only a numerical plotting of the frontier but also an analytical description of it, including the explicit equations of the arcs of parabola it comprises and the change points between them. This information is useful for performing a sensitivity analysis as well as for providing additional criteria to the investor in order to select an efficient portfolio. Computational results are provided to test the efficiency of the algorithm and to illustrate its applications. The procedure has been implemented in Mathematica.

关键词： Frontier Parabolas mathematics computing Sensitivity analysis algorithm efficiency

来源：评论

学校读者我要写书评

暂无评论

Distributed and Parallel Subarray Beamforming for Underwater Real-Time 3-D Acoustic Imaging

Distributed and Parallel Subarray Beamforming for Underwater...

引用

International Conference on Computer Science and Network Technology

作者： Yeqiang Han Fan Zhou Xiang Tian Yaowu Chen Institute of Advanced Digital Technology and Instrumentation Zhejiang University

ISBN: (纸本)9781467329637

In this paper, we propose a distributed and parallel subarray beamforming (DPS) algorithm for performing underwater real-time 3-D acoustic imaging. The principle idea of this algorithm is that the full populated sensor array is subdivided into two stage distributed subarrays and the beamforming is carried out in parallel for each stage subarray. The proposed algorithm overcomes the problems of massive computational load affecting the engineering applications of the conventional beamforming techniques, while achieving the similar resolutions. The memory requirement obtained with the proposed algorithm is reduced by four orders of magnitude and the computational requirement is reduced by two orders of magnitude when compared with the conventional beamforming (CBF). The simulation and the comparisons illustrate the results and the efficiency of the algorithm.

关键词： Underwater 3-D acoustic imaging Sonar sensor array system Sonar signal processing Distributed and parallel subarray beamforming Conventional beamforming Beamforming subarray sonar signal processing Acoustic images Distribute algorithm efficiency Parallel Lines memory requirements EARTHQUAKE MAGNITUDE Sensor arrays Underwater algorithms

来源：评论

学校读者我要写书评

暂无评论

A COMBINED IMAGE APPROACH TO COMPRESSION OF VOLUMETRIC DATA USING DELAUNAY TETRAHEDRALIZATION

A COMBINED IMAGE APPROACH TO COMPRESSION OF VOLUMETRIC DATA ...

引用

IET Conference on Image Processing

作者： R. Jovanovic R. A. Lorentz Texas A&M University at Qatar

ISBN: (纸本)9781622762675

We present a method for lossy compression of three dimensional gray scale images that is based on a 3D linear spline approximation to the image. We have extended an approach that has previously been successfully applied in two dimensions. In our method, we first select significant points in the data, and use them to create a 3D tetrahedralization. The tetrahedrons of the tetrahedralization are used as cells for a linear interpolation spline that gives an approximation of the original image. The compression is done by storing the positions of the vertices of the tetrahedralization and the values there instead of the value of the approximation at each grid point. We introduce a novel concept of using a smoothed version of the original image to improve the quality of the approximating spline. To increase the efficiency of the algorithm, we combine it with a refinement/decimation technique. We compare our compression technique to JPG2000 3D. We show that our algorithm performs similarly to, and in some cases even outperforms it, for high compression ratios. Our approach gives images that have significantly different properties than ones created using wavelets, and have the potential of being more suitable for some applications. In addition, this type of compression is particularly suitable for visualization.

关键词： Compression Delaunay tetrahedralization lossy compression images compression grid point compression ratio original image spline approximation approximation splines (mathematics) algorithm efficiency wavelets

来源：评论

学校读者我要写书评

暂无评论

Implementation of controller optimization using S-function based metaheuristic algorithms

Implementation of controller optimization using S-function b...

引用

IET International Conference on Information Science and Control Engineering 2012 (ICISCE 2012)

作者： L.K. Letting J.L. Munda Y. Hamam Tshwane University of Technology Pretoria ZA

ISBN: (纸本)9781629939254

This paper presents general technique for implementing metaheuristic algorithms using S-Functions and its application in controller parameter optimization. The proposed method provides a suitable platform for parameter tuning in MATLAB/Simulink and PLECS software platforms. The proposed technique is suitable for exchanging optimization parameters when the objective function is not expressed in closed mathematical form. The S-Function based technique takes advantage of the software framework by embedding function calls of the optimization algorithm in callback methods which are executed at predefined time intervals. This leads to great improvement in algorithm efficiency in terms of simulation speed and ease of implementation. Validity of the proposed method is verified by implementing the particle swarm optimization algorithm (PSO) as an S-Function. The S-Function based PSO algorithm is applied to tune PI controllers for converter control in a doubly fed induction generator (DFIG) wind generation system.

关键词： Metaheuristic S-function Controller Parameter optimization Parameter optimization Controllers Software Frameworks algorithm efficiency Optimization algorithms PI control Time intervals algorithms double-fed induction generator parametric subharmonic oscillator

来源：评论

学校读者我要写书评

暂无评论

Energy-Saving algorithm for Pumping Systems Based on Fuzzy Decision Making

Energy-Saving Algorithm for Pumping Systems Based on Fuzzy D...

引用

IEEE International Conference on Systems, Man, and Cybernetics

作者： Wei Chang Jun-Wei Chang Hsu Yin Wen-June Wang Hsin-Yi Chung Ya-Ching Chang Hsiang-Chieh Chen Department of Electrical Engineering National Central University Industrial Technology Research Institute Taiwan

ISBN: (纸本)9781467317139

In this paper, an energy-saving algorithm to achieve minimum energy consumption and high efficiency for a pumping system is proposed. In the first step, the mathematical model of the pumping system is given. In the second step, one optimal operating condition of pump system is obtained by the proposed energy-saving algorithm. Moreover, a fuzzy decision making is used to make the optimal decision of pumping system operation. Finally, an experimental result is presented to prove the efficiency of the algorithm.

关键词： Pumping systems Curve fitting Fuzzy decision making Energy-saving algorithm Pumping systems energy saving minimum energy consumption algorithm efficiency algorithms Fuzzy Mathematical Model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：