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

5th International Conference on Hybrid Artificial Intelligence Systems

作者： Bahig, Hatem M. Kotb, Yasser Ain Shams Univ Fac Sci Dept Math Div Comp Sci Cairo Egypt

ISBN: (纸本)9783642138027

Online visualization systems have come to be heavily used in education, particularly for online learning. Most e-learning systems, including interactive learning systems, have been designed to simplify understanding the ideas of some main problems or in general overall course materials. This paper presents a novel interactive visualization system for one of the most important operation in public-key cryptosystems. This operation is modular exponentiation using addition chains. An addition chain for a natural number e is a sequence 1 = a(0) < a(1) < ... < a(r) = e of numbers such that for each 0 < i <= r, a(i) = a(j) + a(k) for some 0 <= k <= j < i. Finding an addition chain with minimal length is NP-hard problem. The proposed system visualizes how to generate addition chains with minimal length using depth-first branch and bound technique and how to compute the Modular exponentiation using addition chains.

关键词： addition chain branch and bound algorithm public-key cryptosystem visualization

来源：评论

学校读者我要写书评

暂无评论

Improving Relevance Feedback for Content Based Medical Image Retrieval

Improving Relevance Feedback for Content Based Medical Image...

引用

International Conference on Information Communication and Embedded Systems (ICICES)

作者： Rajalakshmi, T. Minu, R. I. Jerusalem Coll Engn Dept Comp Sci & Engg Madras Tamil Nadu India

ISBN: (纸本)9781479938346

Content-Based Image Retrieval (CBIR) refers to techniques that retrieve images based on their content, as opposed to based on metadata. A CBIR system performs indexing and retrieval tasks using features like color, texture and shape computed from images as opposed to using the whole images. In the medical field, content based image retrieval is used to aid radiologist to retrieve of images with similar contents. CBIR methods are usually developed for specific features of images, so that those methods are not readily applicable across different kinds of medical images. Content-Based Medical Image Retrieval (CBMIR) refers to techniques that retrieve images from medical image databases. A CBMIR system using the medical image features like Haralick features, Zernike moments, histogram intensity features and run-length features. In this study, CBMIR system With improved feature selection method is developed using a hybrid approach of "branch and bound algorithm" and "artificial bee colony algorithm" using the breast cancer, Brain tumor and thyroid images and classification is performed using Fuzzy based Relevance Vector Machine (FRVM) to form groups of relevant image features The Euclidean distance measurement is used to assess the similarity between query images and database images. A Relevance feedback method using diverse density algorithm is used to improve the performance of content-based medical image Retrieval. An improved feature selection method is used to reduces the existing system dimensionality curse problem and improve the performance of the system.

关键词： CBMIR Haralick feature Histogram intensity Run-length features Zernike moments branch and bound algorithm Artificial colony algorithm Fuzzy relevance vector machine classifier Diverse density algorithm

来源：评论

学校读者我要写书评

暂无评论

Timetable Optimization Model with Considering Regenerative Braking Power for Urban Rail

Timetable Optimization Model with Considering Regenerative B...

引用

Chinese Automation Congress (CAC)

作者： Cai, Juanjuan Xun, Jing Xiao, Xiao Liu, Xiaoqing Ji, Xiangyu Beijing Jiaotong Univ Sch Elect & Informat Engn Beijing 100044 Peoples R China Beijing Jiaotong Univ State Key Lab Rail Traff Control & Safety Beijing 100044 Peoples R China Natl Engn Lab Urban Rail Transit Commun & Operat Beijing 100070 Peoples R China Beijing Metro Operat Adm Corp Ltd Beijing 100068 Peoples R China Acad Railway Sci Beijing Engn Consult Co Ltd Beijing 100081 Peoples R China

ISBN: (纸本)9781728176871

Along with China's economic growth and the urbanization is sped up. Energy conservation in urban rail transit (URT) has attracted widespread attention. Timely use of regenerative energy (URE) is an imperative way to save electricity. Regenerative braking, also known as feedback braking, is a braking technology used on electric vehicles to convert kinetic energy of train into electrical energy when the train is braking. Other trains could use these regenerative energy by accelerating in a cooperative way. In order to maximize the URE, this paper proposes a new approach that uses the train's electric power to gauge the available energy, and analyzes the operation process of a train to optimize the time when the train left the station. First, we defined 4 operating Modes of energy utilization, and codified an integer programming model. Second, we used a branch and bound algorithm to figure out the excellent result. Finally, we used the data on the operation of the Yanfang Line, Beijing Metro assessed the model. The simulation results illustrated that compared with the original timetable, the method can significantly improve the URE by 77.5%.

关键词： regenerative energy urban mass transit timetable optimization branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An algorithm for Scheduling a No-Wait Robotic Production System with Multi-Type Parts

An Algorithm for Scheduling a No-Wait Robotic Production Sys...

引用

3rd International Conference on Wireless Communications, Networking and Mobile Computing (WiCOM 2007)

作者： Che Ada Yan Pengyu Yang Naiding Chu Chengbin Northwestern Polytech Univ Sch Management Xian 710072 Peoples R China Univ Technol Troyes Inst Charles Delaunay F-10010 Troyes France

ISBN: (纸本)9781424413119

An exact algorithm is proposed to solve a scheduling problem of a robotic production system in which multi-type parts are processed and parts are not allowed to wait on the machines. Finding an optimal schedule in such a production system is equivalent to finding two types of correlative sequences: parts input sequence and robot moves sequence. We show that the entering times of parts are the decision variables of the problem. We formulate our problem using the notion of prohibited intervals and solve it by enumerating intervals for linear functions of the decision variables, which is accomplished with a branch and bound procedure. Computational results on randomly generated test instances indicate that the algorithm is effective.

关键词： robotic production system multi-type parts no-wait cyclic scheduling branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Improved Differential Characteristic Searching Methods 2

Improved Differential Characteristic Searching Methods

引用

2nd International Conference on Cyber Security and Cloud Computing (CS Cloud)

作者： Chen, Jiageng Miyaji, Atsuko Su, Chunhua Teh, Jesen Cent China Normal Univ Comp Sch Wuhan Peoples R China Japan Adv Inst Sci & Technol Sch Informat Sci Nomi Japan Japan Sci & Technol Agcy Kawaguchi Ctr Crest Kawaguchi Saitama Japan Osaka Univ Grad Sch Engn Suita Osaka 565 Japan Univ Sains Malaysia Informat Secur Lab George Town Malaysia

ISBN: (纸本)9781467393003

The success probability of differential and linear cryptanalysis against block ciphers heavily depend on finding differential or linear paths with high statistical bias compared with uniform random distribution. For large number of rounds, it is not a trivial task to find such differential or linear paths. Matsui first investigated this problem and proposed a solution based on a branch and bound algorithm in 1994. Since then, the research on finding good concrete differential or linear path did not receive much attention. In this paper, we revisit the differential attack against several S-Box based block ciphers by carefully studying the differential characteristics. Inspired by Matsui's algorithm, we provide an improved solution with the aid of several searching strategies, which enable us to find by far the best differential characteristics for the two investigated ciphers (LBlock, TWINE) efficiently. Furthermore, we provide another way to evaluate the security of ciphers against differential attack by comparing the strength of the ciphers from differential characteristic's point of view, and we also investigate the accuracy when using the active S-Box to evaluate the security margin against differential attack, which is the common method adapted when new ciphers are designed.

关键词： Differential Path branch and bound algorithm Active S-box LBlock TWINE

来源：评论

学校读者我要写书评

暂无评论

An Efficient Heuristic algorithm for the Traveling Salesman Problem

引用

8th International Heinz Nixdorf Symposium on Advanced Manufacturing and Sustainable Logistics

作者： Azimi, Parham Daneshvar, Peyman Islamic Azad Univ Qazvin Branch Tehran Iran Islamic Azad Univ Naragh Branch Tehran Iran

ISBN: (纸本)9783642124617

This paper presents a new heuristic algorithm based on combining branch and bound algorithm and a dynamic simulation model for the traveling salesman problem. The approach uses the simulation results for creating the best tours within the branch and bound tree. The most advantage of this approach lies in the learning profcedure both in simulation process and B&B algorithm. In order to test the efficiency of the proposed algorithm, several computational experiments were conducted over middle-scale and large-scale problems. As the computational results show the algorithm can be used easily in practice with reasonable accuracy and speed.

关键词： Traveling salesman problem simulation mathematical programming branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

Portfolio optimization of small scale fund using mean-absolute deviation model

引用

International Journal of Theoretical and Applied Finance 2003年第4期6卷 403-418页

作者： Konno, Hiroshi Department of Industrial Engineering Chuo University Bunkyo-ku Tokyo 112 1-13-27 Kasuga Japan

The purpose of this paper is to show that we are now able to apply standard portfolio optimization methods to the management of small and medium scale fund, where transaction cost and minimal transaction unit constraints are not negligible. Unit transaction cost is usually larger when the amount of investment is smaller. Also, rounding of portfolio to the nearest integer multiple of minimal transaction unit will have non negligible effect on the risk-return structure of the portfolio. We will show that the use of mean-absolute deviation model enables one to handle concave transaction cost and minimal transaction unit constraints in an efficient manner using branch and bound algorithm. Also, we will show that the minimal transaction cost rebalancing problem can be solved by using the same algorithm.

关键词： branch and bound algorithm Concave transaction cost Mean-absolute deviation model Minimal transaction unit constraint Small fund

来源：评论

学校读者我要写书评

暂无评论

Improved Model for Strategic-loading-station Location Problem under Incomplete Information

Improved Model for Strategic-loading-station Location Proble...

引用

International Conference on Advanced Materials and Computer Science

作者： Ren Qi-liang Li Ming-ming Li Qing Chen Jin Shan Li Bo Chongqing Jiaotong Univ Sch Traff & Transportat Chongqing 400074 Peoples R China

ISBN: (纸本)9783037850978

In order to realize scientific planning the layout of strategic loading station, the strategic-loading station location problem was proposed, which is related to determine the location of each stay with station and the transportation plan on the precise of satisfying the general location constraints and problem related special constraints. Based on theory of capacitated facility location with multiple souring in two stage supply chain, one mixed integer linear programming model was established which took whole logistic cost embedding transportation and location costs as objective. When confronted with small and medium size problem, this model could be exactly solved by optimization software using branch and bound algorithm, and when the problem size was big, this model could be heuristically solved by genetic algorithm which used 0-1 and priority-based combined encoding method to represent solution, cost-based and random-generated combined method to generate initial solution, solution repaired strategy and penalty method and special fitness function to deal illegal individual, and greedy based method to heuristically solve transshipment problem. At last, according to computational tests on randomly generated data demonstrated the practical feasibility of this method. With the increasingly fierce market competition of various modes of transportation, building strategic- loading-station locations becomes an important measure to realize the innovation in organizing railway transportation of goods,which plays an important role in highlighting the advantage and market position of railway in the middle and long distance transportation of bulk cargo,achieving the centralization of transportation business, speeding up the speed of vehicles' turnover rate and the cargo's delivery, realizing the win-win situation between railways and shippers. Strategic- loading-stations is not only the key point of railway transportation system but also the cement between the feeders and car

关键词： strategic loading station location model branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

An Exact Solution Approach to the Type-II Transfer Line Balancing Problem 10th

An Exact Solution Approach to the Type-II Transfer Line Bala...

引用

10th IFAC Triennial Conference on Manufacturing Modelling, Management and Control (MIM)

作者： Telemeci, Yasin Ersin Azizoglu, Meral Middle East Tech Univ Dept Ind Eng TR-06800 Ankara Turkey

In this study, we consider Type II Transfer Line Balancing problem that assigns the operations to the blocks and blocks to the workstations to minimize the cycle time. A mixed integer programming model is developed, and a branch and bound algorithm is proposed for the exact solutions. The efficiency of the branch and bound algorithm is enhanced by lower and upper bounding procedures. The computational results have revealed the satisfactory behavior of the model and branch and bound algorithm on moderate size problem instances. Copyright (C) 2022 The Authors.

关键词： Transfer Lines Type-II Transfer Line Balancing Mathematical Model branch and bound algorithm

来源：评论

学校读者我要写书评

暂无评论

LTS: Discriminative Subgraph Mining by Learning from Search History

LTS: Discriminative Subgraph Mining by Learning from Search ...

引用

IEEE 27th International Conference on Data Engineering (ICDE 2011)

作者： Jin, Ning Wang, Wei Univ N Carolina Dept Comp Sci Chapel Hill NC 27515 USA

ISBN: (纸本)9781424489589

Discriminative subgraphs can be used to characterize complex graphs, construct graph classifiers and generate graph indices. The search space for discriminative subgraphs is usually prohibitively large. Most measurements of interestingness of discriminative subgraphs are neither monotonic nor anti-monotonic with respect to subgraph frequencies. Therefore, branch-and-bound algorithms are unable to mine discriminative subgraphs efficiently. We discover that search history of discriminative subgraph mining is very useful in computing empirical upper-bounds of discrimination scores of subgraphs. We propose a novel discriminative subgraph mining method, LTS (Learning To Search), which begins with a greedy algorithm that first samples the search space through subgraph probing and then explores the search space in a branch and bound fashion leveraging the search history of these samples. Extensive experiments have been performed to analyze the gain in performance by taking into account search history and to demonstrate that LTS can significantly improve performance compared with the state-of-the-art discriminative subgraph mining algorithms.

关键词： Accuracy algorithm design and analysis Chemical compounds Classification algorithms Frequency estimation History Kernel branch and bound algorithm data mining discriminative subgraph mining method graph classifier graph indices graph theory greedy algorithm greedy algorithms learning (artificial intelligence) learning to search pattern classification

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：