0
  1. Trang chủ >
  2. Luận Văn - Báo Cáo >
  3. Công nghệ thông tin >

An ant colony optimization approach for phylogenetic tree reconstruction problem

an entity-centric approach for privacy and identity management in cloud computing

an entity-centric approach for privacy and identity management in cloud computing

... protocols: issuing identity to an entity, and verifying identity of an entity Before issuing an identity, IdP chooses a public integer n and a pseudo random C Approach We propose an approach for entity-centric ... effectiveness of the proposed privacy and identity management system, as well as its potential for becoming a standard for privacy and identity management in cloud computing VII.ACKNOWLEDGEMENT This ... Services: They include three agents: SSA, TEA, and ASA The first agent, SSA, maintains a database of information about ABs This information is used for encrypting and decrypting sensitive data and metadata...
  • 7
  • 521
  • 0
Pseudo vector control – an alternative approach for brushless DC motor drives

Pseudo vector control – an alternative approach for brushless DC motor drives

... improve the performance of the Brushless DC Motor drives The vector- control principle in dq synchronously rotating frame is utilized for the generation of current references only, and the motor currents ... proposed Pseudo- vector Control for BLDCM drives III PRINCIPLE OF PSEUDO- VECTOR CONTROL In the conventional square-wave phase current control (Fig 2), for a given torque command, the reference currents ... emphasis the performance of the controlled system, the speed control loop is omitted in the Figs - and the currents are controlled by hysteresis (bang-bang) techniques A Performance of the conventional...
  • 6
  • 732
  • 2
Tài liệu Báo cáo khoa học:

Tài liệu Báo cáo khoa học: "An Approximate Approach for Training Polynomial Kernel SVMs in Linear Time" doc

... We then adopt the mined patterns to rerepresent the training/ testing examples Subsequently, we use the off-the-shelf linear kernel SVM algorithm to perform training and testing Besides, to exponential-scaled ... surprising that the best performance was obtained by the classical polynomial kernel But the limitation is that the slow in training and testing time costs The most efficient method is linear kernel ... expensive than linear kernel The loss function indicates the loss of training error Usually, the hinge-loss is used (Keerthi and Approximate Polynomial Kernel DeCoste, 2005) The factor C in (1) is...
  • 4
  • 416
  • 0
ant colony optimization and constraint programming

ant colony optimization and constraint programming

... book 1.1.1 Constraint programming 1.1.2 Ant colony optimization 1.1.3 Constraint programming with ant colony optimization Chapter Computational ... and www.it-ebooks.info ACO and CP 1.1.2 Ant colony optimization The second part of this book describes ant colony optimization As for other heuristic approaches described in Chapters and 6, ant ... algorithms 1.1.3 Constraint programming with ant colony optimization Algorithms based on ant colony optimization have proven to be very effective for solving many combinatorial optimization problems...
  • 228
  • 580
  • 0
Báo cáo hóa học:

Báo cáo hóa học: "An Artificial Intelligence Approach for Modeling and Prediction of Water Diffusion Inside a Carbon Nanotube'''' potx

... transformed data sets achieve better performance and faster convergence in general There are many transformation procedures that can be applied to a data set [22] In this study, the all data sets (i.e., ... Jang in 1991 [13, 14] More information regarding the architecture and the performance of ANFIS can be found in the literature [12] In what follows, first, performance of an MD simulation of water ... with the aid of the ANFIS approach, where Y is defined as the values of the flow rate of water molecules and X stands for the corresponding time values The Fuzzy Logic Toolbox embedded in MATLAB 7.0...
  • 5
  • 424
  • 0
ANT COLONY OPTIMIZATION METHODS AND APPLICATIONS pot

ANT COLONY OPTIMIZATION METHODS AND APPLICATIONS pot

... lengths between the nest and the food source 2 14 Ant Colony Optimization Ant Colony Optimization - Methods and Applications Some ant colony techniques aimed at dynamic optimization have been ... crossover and a repulsive operator based on multi-optimum for the worst ant colony; Ant Colony Optimization - Methods and Applications Chooses one of the worst ant colonies to kill and sends the new colony ... components 6 18 Ant Colony Optimization Ant Colony Optimization - Methods and Applications Fig Every ant constructs a complete solution which includes n dimensions CANDO: charged ants for continuous...
  • 352
  • 364
  • 0
Báo cáo sinh học:

Báo cáo sinh học: "A combinatorial optimization approach for diverse motif finding applications" pdf

... in the basic motif finding case above, employing the same LP formulation and DEE techniques Subtle motifs Another widely studied formulation of motif finding is the 'subtle' motifs formulation ... solution for the original SP-based motif finding problem This is interesting, since the motif finding formulation is known to be NP-hard [27], and nevertheless our approach runs in polynomial time for ... methods for motif finding (e.g., [15,18]), our combinatorial formulation naturally incorporates amino acid substitution Page of 13 (page number not for citation purposes) Algorithms for Molecular...
  • 13
  • 257
  • 0
Báo cáo sinh học:

Báo cáo sinh học: " Jane: a new tool for the cophylogeny reconstruction problem" ppt

... the graphical user interface but can be set in the command-line version of Jane Values of these parameters were systematically evaluated and the best values found are used as defaults Jane can ... Merkle and Middendorf have demonstrated the value of time zone information by applying Tarzan to several host-parasite problems in the literature In this paper, we describe a new approach to the cophylogeny ... in either Tarzan or a Nexusbased format A file must specify the host and parasite trees and the tip associations Optionally, the file can specify time zones or time zone ranges as well as regions...
  • 10
  • 551
  • 0
An ant colony optimization approach for phylogenetic tree reconstruction problem

An ant colony optimization approach for phylogenetic tree reconstruction problem

... 20 3.1.1 3.1.2 Ant S y s te m 22 3.1.3 Ant Colony S y s te m 24 3.1.4 3.2 Double bridge experim ents 20 Max-Min Ant S ystem 25 Ant Colony Optimization M eta-h ... per hand On the other hand in ACO, local search, the number of ants and candidate list are other important factors when solving a combinatorial optimization problem by ACO (see (Uorigo and Stutzle, ... the path of a single ant) can be converted to a BD tree code of /V-leaves tree In ACO performance, at each iteration all given ants build the path concurrently Thereby guarantcing that the indirect...
  • 66
  • 279
  • 0
Tiểu luận môn LẬP TRÌNH SYMBOLIC VÀ ỨNG DỤNG Tìm hiểu Ant Colony Optimization

Tiểu luận môn LẬP TRÌNH SYMBOLIC VÀ ỨNG DỤNG Tìm hiểu Ant Colony Optimization

... Ant Colony Optimization 01 – 2013 ĐẠI HỌC QUỐC GIA TP HỒ CHÍ MINH TRƯỜNG ĐẠI HỌC CÔNG NGHỆ THÔNG TIN LẬP TRÌNH SYMBOLIC ỨNG DỤNG Tìm hiểu Ant Colony Optimization thực với ... end return paths; end proc Ant Colony Optimization Dưới mã Maple Ant Colony Optimization Ant Colony Optimization 2.4.Thủ tục thuật toán Ant System Khi ta có thủ tục tìm đường cho thuật toán kiến ... hưởng lớn tới kết thuật toán Ant Colony Optimization III TỔNG KẾT Bài thu hoạch tìm hiểu vài thuật toán phương pháp Ant Colony Optimization cụ thể Ant System Max-Min Ant System cho toán Traveling...
  • 40
  • 1,082
  • 2
Dynamic job shop scheduling using ant colony optimization algorithm based on a multi agent system

Dynamic job shop scheduling using ant colony optimization algorithm based on a multi agent system

... scheme ACO ant colony optimization ACS ant colony system AC2 ant colony control Ai accessible operation list ANTS approximate non-deterministic tree search AS ant system AS rank the rank -based AS ... natural MAS, namely an ant colony, has found that autonomous agents like ants can find the shortest route from their nest to a food source based on the pheromone strength on their ways Each ant affects ... as a Gantt Chart, which is a two-dimensional chart showing time along the horizontal axis and the resources along the vertical axis Each rectangle on the chart represents an operation of a job, ...
  • 189
  • 366
  • 0
A hybridized approach for solving group shop problems (GSP)

A hybridized approach for solving group shop problems (GSP)

... that is both scalable in its applications and robust in its performance over a wide range of GSP instances To facilitate the design of a new GSP A Hybridized Approach for Solving Group Shop Problems ... summary of these parameters: 15 A Hybridized Approach for Solving Group Shop Problems Table 2.2: Parameters for Specifying Job Characteristics Parameters Characteristics β1 • β1 = pmtn indicates ... a particular problem instance IX S AVG The average solution value obtained for all the computational runs of a particular problem instance TAVG The average computational time required to obtained...
  • 135
  • 182
  • 0
A new solution approach for the inventory routing problem using vehicle routing problem constructive heuristic

A new solution approach for the inventory routing problem using vehicle routing problem constructive heuristic

... reader that it refers to a set of MVRPD demand points that emanate from the same IRP customer i and that all share the same geographical location Cumulated quantities Given the nature of the inventory ... deterministic and dynamic demand, and have a finite capacity for holding local inventory Holding costs are however considered at the central warehouse, as well as at the different retailers The authors ... were added to the model Mullaseril et al (1997) gave a real-world application to the SDVRP They fo17 2.2 Vehicle Routing Problem studies cused on an arc -routing problem (Capacitated Rural Postman...
  • 109
  • 483
  • 0
An inexact SQP newton method for convex SC1 minimization problems

An inexact SQP newton method for convex SC1 minimization problems

... AN INEXACT SQP NEWTON METHOD FOR CONVEX SC1 MINIMIZATION PROBLEMS CHEN YIDI NATIONAL UNIVERSITY OF SINGAPORE 2008 An Inexact SQP Newton Method for Convex SC1 Minimization Problems Chen Yidi 2008 ... Department: Mathematics Thesis Title: An Inexact SQP Newton Method for Convex SC Minimization Problems Abstract The convex SC minimization problems model many problems as special cases One particular ... experiments, we compare our inexact SQP Newton method, which is referred as Inexact- SQP in the numerical results, with the exact SQP Newton and the inexact smoothing Newton method of Gao and Sun [7], which...
  • 34
  • 251
  • 0
An Efficient Ant Colony Algorithm for DNA Motif Finding

An Efficient Ant Colony Algorithm for DNA Motif Finding

... Pevzner, Finding composite regulatory patterns in DNA sequences, Bioinformatics S1, 2002, 354-363 H Hoang Xuan, D Do Duc, N Manh Ha: An efficient two-phase ant colony optimization algorithm for the ... expanded by a random to the next vertex based on heuristics information and pheromone trail The ACO algorithm uses Nant artificial ants, in each iteration, each ant finds a solution by a randomized ... its power, but each algorithm has its own advantages and disadvantages Experiments prove that ACOMotif algorithm is superior in comparison with existing algorithms, and R-ACOMotif version allows...
  • 12
  • 222
  • 0

Xem thêm

Từ khóa: Báo cáo quy trình mua hàng CT CP Công Nghệ NPVchuyên đề điện xoay chiều theo dạngNghiên cứu sự hình thành lớp bảo vệ và khả năng chống ăn mòn của thép bền thời tiết trong điều kiện khí hậu nhiệt đới việt namNghiên cứu tổ chức pha chế, đánh giá chất lượng thuốc tiêm truyền trong điều kiện dã ngoạiNghiên cứu tổ hợp chất chỉ điểm sinh học vWF, VCAM 1, MCP 1, d dimer trong chẩn đoán và tiên lượng nhồi máu não cấpGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitGiáo án Sinh học 11 bài 13: Thực hành phát hiện diệp lục và carôtenôitĐỒ ÁN NGHIÊN CỨU CÔNG NGHỆ KẾT NỐI VÔ TUYẾN CỰ LY XA, CÔNG SUẤT THẤP LPWANPhối hợp giữa phòng văn hóa và thông tin với phòng giáo dục và đào tạo trong việc tuyên truyền, giáo dục, vận động xây dựng nông thôn mới huyện thanh thủy, tỉnh phú thọTrả hồ sơ điều tra bổ sung đối với các tội xâm phạm sở hữu có tính chất chiếm đoạt theo pháp luật Tố tụng hình sự Việt Nam từ thực tiễn thành phố Hồ Chí Minh (Luận văn thạc sĩ)Phát hiện xâm nhập dựa trên thuật toán k meansNghiên cứu về mô hình thống kê học sâu và ứng dụng trong nhận dạng chữ viết tay hạn chếNghiên cứu khả năng đo năng lượng điện bằng hệ thu thập dữ liệu 16 kênh DEWE 5000BT Tieng anh 6 UNIT 2Tranh tụng tại phiên tòa hình sự sơ thẩm theo pháp luật tố tụng hình sự Việt Nam từ thực tiễn xét xử của các Tòa án quân sự Quân khu (Luận văn thạc sĩ)Giáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vậtGiáo án Sinh học 11 bài 14: Thực hành phát hiện hô hấp ở thực vậtĐổi mới quản lý tài chính trong hoạt động khoa học xã hội trường hợp viện hàn lâm khoa học xã hội việt namTÁI CHẾ NHỰA VÀ QUẢN LÝ CHẤT THẢI Ở HOA KỲ