... geometry The accelerator head design was based on the head design of the Varian Trilogy series linear accelerator, with a millennium MLC. Trang 17Chapter 1Radiation Therapy The field of radiation therapy ... parameters are available for the selection among various cross section databases for bremsstrahlung interactions, Compton scattering, pair production, and elastic scattering Many of the parameters ... external beam radiotherapy prior to the advent of IMRT, any manipulation of the dose delivery in an attempt to achieve a greater conformality with the target would rely on the increase of the number
Ngày tải lên: 29/10/2016, 15:54
... et al., 2014) In Salhi et al (2014), a mathematical formulation for the MDHFVRP was introduced An efficient Variable Neighborhood Search (VNS), which incorporates different operators and a local ... vehicles , each with capacity , is available at each depot Each vehicle, when used by a depot to perform a single route, incurs a nonnegative fixed cost and variable cost available vehicles at each ... Proposed approach This section describes the general framework of the proposed approach for the MDHFVRP This algorithm is based on a modified genetic algorithm Chu-Beasley (AGCBM) The AGCBM approach
Ngày tải lên: 14/05/2020, 22:26
A hybrid algorithm for the multi-depot vehicle scheduling problem arising in public transportation
... necessary for the deadhead trip from to , and other penalties that the transportation company intends to apply The costs associated to the arcs from or to a depot are In the particular case in ... The algorithm was tested on randomly generated cases as well as benchmark instances In addition, they also applied their algorithm on a set of real world instances that were derived from data ... into account two new constraints: the duration of the route and the time of vehicle recharging The authors propose a new mathematical formulation and use of the ant colony algorithm as a solution
Ngày tải lên: 14/05/2020, 22:40
A memetic algorithm for the integral OBP/OPP problem in a logistics distribution center
... clients, detailing the precise specification of articles in the storage site, defining the dates at which each request has to be available in the dispatch area (deadlines) These dates are defined ... On the other hand, if the goods reach the dispatch areas earlier than necessary, new costs arise because of the inefficient use of those areas, blocking the flow of activities and increasing their ... instance BD(0) At each row we enumerate the articles requested by the corresponding client , as well as their amounts The last column indicates the deadline of each request The other parameters are
Ngày tải lên: 27/05/2020, 03:22
DSpace at VNU: A new algorithm for identifying the flavour of B-s(0) mesons at LHCb
... decay These calibrations also serve as a test of the new algorithm in data, to evaluate the performance of the tagger and to compare it to that of the previous SSK algorithm used in LHCb mass ... expectations of a well-calibrated algorithm, p0− hηi = 0 and p1= 1 The fitted values above are considered as the nominal results of the calibration After calibration of the mistag probability, the ... passing the preselection; and the transverse momentum of the B0 s candidate The track impact parametersignificance is used to quantify the probability that a track originates from the same primary
Ngày tải lên: 16/12/2017, 14:55
Finite Element Method - A general algorithm for compressble and incompressible flows - the charateristic - based split (cbs) _03
... discretization along the characteristics After integration by parts, the expressions for K, and f, are Jn and The weak form of the density-pressure equation is In the above, the pressure and AU,* ... contains the nodal values of p E and again the matrices are similar to those previously obtained (assuming that pE and T can be suitably scaled in the conduction term) Trang 12Characteristic-based ... The above equation is fully self-adjoint in the variable A p (or A p ) which is the unknown Now a standard Galerkin-type procedure can be optimally used for spatial approximation It is clear
Ngày tải lên: 02/05/2018, 13:56
A grasp +vnd algorithm for the multiple traveling repairmen problem with distance constraints
... which are the average values calculated from Table 1 Similarly, the results are described in Table 6, which are the average values calculated from Table 3 to 5 for all instances in Type 2 In Table ... vertices are visited, the algorithm stops and the initial solution is returned The size of RCL is a parameter of the GRASP that controls the balance between greediness and randomness The GRASP for ... depot Therefore, one hundred and fifty instances are selected in the dataset 1 The numerical analysis was performed on a set of benchmark problems for Capacitated VRP in [27] As testing our algorithm
Ngày tải lên: 30/01/2020, 02:09
A mathematical model for the product mixing and lot-sizing problem by considering stochastic demand
... previous stage At the second stage, the variables of decision are related to with the machines to be used, the amount of available time in each process and the annual demand for each item The demand ... 242 Variables Accounts receivable associated with the sales of item [$] Accounts payable associated with the purchase of raw material for item [$] Binary variable equal to 1 if the machine ... on the assets needs to maximize the EVA, 0, otherwise Activation variable (binary) for the cost The first stage maximization formulation is stated taking into account equation (1) and (2) The
Ngày tải lên: 14/05/2020, 22:17
A modified tabu search algorithm for the single-machine scheduling problem using additive manufacturing technology
... scheduling additive manufacturing At a first attempt, the search on the database previously indicated showed more than thirty thousand papers available, from 2001 to date For all the research themes ... job swap These kinds of swap are hardly applicable to the AM scheduling problem (that has a matrix schema); therefore, it is necessary to give a definition of what a swap (or move) is for an AM ... (2018) For this reason, here a modification of the original mathematical model and a modified tabu search algorithm will be presented to be compared with the genetic algorithm that was used in the
Ngày tải lên: 14/05/2020, 22:54
A highly efficient exact algorithm for the uncapacitated multiple allocation p-hub center problem
... external load of each measuring factor of each latent variable (Hair et al., 2012, 2014) Researchers gave a rule of thumb to retain the variables for which Cronbach Alpha values are > 0.70 (Hair ... and capabilities to sustainable competitive advantage Strategic Management Journal, 14(8), 607-618 Hair, J.F., Jr, Black, W., Babin, B., Anderson, R & Tatham, R (2006) Multivariate Data Analysis, ... coordination and integration, capacity development and teamwork; At that time, Vietnam chemical companies are able to get competitive advantages and outstanding performance Hence, Vietnam chemical companies
Ngày tải lên: 26/05/2020, 23:01
A Hybrid Multi-objective PSO-SA Algorithm for the Fuzzy Rule Based Classifier Design Problem with the Order Based Semantics of Linguistic Terms
... evolutionary algorithm has the advantages and the disadvantages There are some hybrid mechanisms proposed to tackle the disadvantages of a specific algorithm by making use of the advantages of the others ... optimal semantic parameter values for each dataset feature When having the optimal semantic parameter values, they are used as the inputs of the fuzzy rule genetic selection algorithm to achieve a ... GSA algorithm There are also many other MOEAs that can be used instead of those based on the GSA algorithm, the particle swarm optimization algorithm (PSO), for instance They are examined intensively,
Ngày tải lên: 23/01/2021, 18:40
Báo cáo hóa học: " A Generalized Algorithm for the Generation of Correlated Rayleigh Fading Envelopes in Wireless Channels" ppt
... earlier, the variances of the complex Gaussian random variables at the output of the Rayleigh simulator may have arbitrary values, depending on the variances of the Gaussian random variables at ... Instead, they are positioned at the peaks of a triangle If the receiver antenna is far enough from the transmitter antennas, we can assume that all signals from the receiver arrive at the transmitter ... because, in our considered case, Dk j are the actual distances between the kth transmitter antenna and the jth transmitter antenna, for k, j = 1, , Further, we assume that the variance σ of the...
Ngày tải lên: 23/06/2014, 00:20
Báo cáo toán học: "A Decomposition Algorithm for the Oriented Adjacency Graph of the Triangulations of a Bordered Surface with Marked Point" potx
... is an oriented adjacency graph derived from the signed adjacency matrix associated to an ideal triangulation, defined as follows: Definition We associate to each ideal triangulation T the (generalized) ... comes from a fork and a diamond, see Figure 13 Note that the direction of the fork and the diamond can change, so there are subcases In all of these cases replace the neighborhoods by the one in ... edges a, b are in the same triangle; (2) edges a, c are in the same triangle In the first case, edges c, d are in the same triangle In this case, apply the same replacement as in Figure 36 In the...
Ngày tải lên: 08/08/2014, 14:23
Báo cáo hóa học: " Research Article A Scheduling Algorithm for Minimizing the Packet Error Probability in Clusterized TDMA Networks" pptx
... the solution to the relaxed problem and the vector of dual variables (3) If the obtained primal solution is found to be unsatisfactory, then the dual variables are updated, and we iterate again ... be the main optimization objective While the PER is a more relevant measure, the SINR is often preferred in the literature due to the lack of a tractable analytical solution for the PER for a ... Structures and Network Algorithms, SIAM, Philadelphia, Pa, USA, 1983 D P Bertsekas, Nonlinear Programming, Athena Scientific, 1999 D P Bertsekas, The auction algorithm for assignment and other network...
Ngày tải lên: 21/06/2014, 22:20
A Reliable Randomized Algorithm for the Closest-Pair Problem (DUPLICATE GROUPING)
... duplicate-grouping algorithms of Section 2.1 rearrange the elements stably, the whole algorithm is stable The hashing scheme of Bast and Hagerup is conservative The justification that the other parts of the algorithm ... multidimensional case, the divide-and-conquer algorithm of Bentley and Shamos w7x and the incremental algorithm of Schwarz et al w30x are applicable Assuming d to be constant, all the algorithms ... of the analysis, we use an approach completely different from that of Rabin, which enables us to show that the algorithm can also be run with very few random bits Further, the analysis of the algorithm...
Ngày tải lên: 21/04/2015, 15:39
A fast algorithm for mining the longest frequent itemset
... What Kinds of Patterns Can Be Mined? There are various types of data stores on which data mining can be performed, such as relational databases, data warehouses, transactional databases, spatial ... old, and have a good job Data discrimination is a comparison of the general characteristics of one class of data with the general characteristics of other contrasting data classes Like data characterization, ... classification is also a two-step process In the first step, a sample database is given, known as training data, and each tuple in the database has a class label indicating the predefined class...
Ngày tải lên: 16/09/2015, 12:35
Báo cáo y học: " Derivation and preliminary validation of an administrative claims-based algorithm for the effectiveness of medications for rheumatoid arthritis"
... algorithm s performance VARA data were used only to capture the DAS28, the CDAI and other clinical characteristics measured at the baseline and outcome VARA visits; all other data used for the analysis ... VARA participants to the national the Medical SAS files present in the administrative database from the Veterans Health Administration (VHA) from 2002-2010 to obtain medical and pharmacy claims ... follow-up at one year, VARA and administrative data were used to create a gold standard and claims-based effectiveness algorithm The gold standard outcome was low disease activity (LDA, disease activity...
Ngày tải lên: 25/10/2012, 10:45
A WEB APPLICANTION FOR THE TOURISM INDUSTRY IN HANOI by Dinh Huu Son
... involves the transmission of payment transaction data, and associated remittance advice data, from a payee to their bank, for onforwarding (via banks and/or value-added network operators) to the payee's ... interface for service suppliers to update their own database So, there is no immediate link from the application’s database and the database of the suppliers 1.7 Organization of the research • ... payment card vouchers These mechanisms have various characteristics, such as the extent to which the parties are identified, the traceability of the transaction, and the taxability of the transaction...
Ngày tải lên: 07/04/2013, 23:51
An efficient genetic algorithm for the p median
... the performance of the algorithm on the Alberta, Galvão, and Koerkel problems Problem No n p Optimal Alberta Alberta Alberta Alberta Alberta Alberta Alberta Alberta Alberta Alberta Alberta Galvão ... Another measure of ADE’s performance is the average deviation between the average of the best solution values and the optimal values in 10 replications: 0.11% In other words, the average of the ... Despite the combinatorial nature of the problem, optimal algorithms can solve some instances of the p-median problem with reasonable effort A typical approach is to combine Lagrangian relaxation...
Ngày tải lên: 08/08/2013, 08:38
Tài liệu Machinery''''s Handbook 27th Edition A REFERENCE BOOK FOR THE MECHANICAL ENGINEER, docx
... a = aa = a a = ⎛ a ⎝ b⎠ b3 a × a × a = aaa = a a × b = ab a b = ( ab ) = ⎛ 1⎞ = a – -⎝ a a3 a2 a3 = a2 + = a5 ( a2 )3 = a2 × = ( a3 )2 = a6 a4 ÷ a3 = a4 – = a a + b = ( a + b ) ( a – ab ... Addition:When adding two complex numbers, the real parts and imaginary parts are added separately, the real parts added to real parts and the imaginary to imaginary parts Thus, Copyright 2004, Industrial ... a0 = a – b = ( a – b ) ( a + ab + b ) a2 – b2 = ( a + b ) ( a – b ) ( a + b ) = a + 3a b + 3ab + b a a 3 3 3 a – b = ( a – b ) + 3ab ( a – b ) a a = a 2 a + b = ( a + b ) – 3ab ( a + b ) a b...
Ngày tải lên: 15/12/2013, 03:15