parallel implementation of the orasis algorithm for remote sensing data analysis
High Performance Computing in Remote Sensing - Chapter 8 pps
... The application of these specialized hardware platforms for remote sensing data analysis are extensively covered in several chapters of the present volume and therefore are out of the scope of ... on the development of applications On the other hand, we believe that the main drawbacks of homogeneous platforms for their incorporation to a remote sensing data processing development are r The ... out before The most interesting ones are the group of models that are based on the use of Rothermel’s equations [1] The main equations provided by the model allow the calculation of the rate of...
- 32
- 327
- 0
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"
... capture the DAS28, the CDAI and other clinical characteristics measured at the baseline and outcome VARA visits; all other data used for the analysis were from the administrative claims data To ... 1.2 unit improvement in their DAS28 The PPV of the administrative data- based effectiveness algorithm was 75%, and the NPV was 90% The sensitivity of the effectiveness algorithm was 75%, and its ... on the prevalence in the population, and more reflective of the test itself, lessening the impact of any unique features of the VA population Moreover, we might expect that the PPV and NPV of the...
- 29
- 581
- 0
An efficient genetic algorithm for the p median
... responsible for the performance of the heuristic Given any two parents, it generates one of the best possible offspring from the genes at hand (In the context of genetics, we can think of the genes ... the average of the best solution values and the optimal values in 10 replications: 0.11% In other words, the average of the best solutions over the 10 replications is 100.11% of the optimal These ... similar to the Teitz and Bart algorithm, to generate neighborhood solutions and uses them within the context of simulated annealing The authors test the performance of their algorithm on the OR Library...
- 22
- 605
- 0
A new algorithm for enumeration of minimum cutsets of graph by branch addition
... order of minimum cutset is the other advantage of this method The most important advantage of the new algorithm is less time consuming compared with the other minimum cutset enumeration algorithms ... should be performed and in each repetition of the algorithm, only one of them is considered as output node of the graph i≤L Yes Yes k ≤ n-m-1 Yes u
- 6
- 545
- 0
Reliability evaluation algorithm for complex medium voltage electrical distribution networks based on the shortest path
... and the replacement of transformers The reliability indices for the system shown in Fig were computed The customer data, equipment outage data, branch data and reliability parameters are from the ... with every node of OBNs, the node set of every separate subsystem can be obtained The structural parameters of each network are therefore formed based on the primary network search for upstream ... out of service after a failure event, and to form the separate subsystems If there exists a tie switch in the subsystem, add the tie switch parameters to the subsystem Identify the classes of...
- 5
- 367
- 0
A dynamic programming algorithm for RNA structure
... Recursion for vx truncated at y(0) Figure General recursion for vx in the nested algorithm Each line gives the formal score of one of the diagrams in Figure The diagram on the left is calculated as the ... introduced in the previous section The key point of the pseudoknot algorithm is the use of gap matrices in addition to the wx and vx matrices Looking at the graphical representation of one of the simplest ... improve the accuracy of this thermodynamic implementation of the pseudoknot algorithm, to have more accurate, experimentally, based determinations of these parameters Table provides a list of the...
- 16
- 688
- 0
Tài liệu Dollar Cost Banding - A New Algorithm for Computing Inventory Levels for Army Supply Support Activities pdf
... requests for which there is stock available at the time of the request Resource Metrics INVENTORY INVESTMENT • Dollar value of the requisition objective (RO): the value of the maximum quantity of an ... increase in the operational availability of the M1A1 tank fleet at Fort Knox One of the reasons for this improvement was an increase in the percentage of repair jobs for which all the required ... the SSA The unit parts clerk passes the request to the SSA If the SSA is unable to issue the requested item from on-hand assets, the SSA passes a requisition for the desired part further up the...
- 132
- 425
- 0
Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspecified Representations" pdf
... change the set of configurations of the chart, but may further reduce the chart size The overall runtime for the algorithm is O(n2 S), where S is the number of splits in Ch and n is the number of ... analysed the extent to which our algorithm eliminated the redundancy of the USRs in the corpus We computed dominance charts for all USRs, ran the algorithm on them, and counted the number of configurations ... of our algorithm is above 86 % of the upper bound The median number of configurations for the USRs in the whole data set is 56, and the median number of equivalence classes is 3; again, the median...
- 8
- 429
- 0
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
... subtree Formally, items are completed if they are of the form [t,T ~ Rt •] or of the form [ ( t , N ) , N -+ a •] The main concept needed for the construction of the L R table is that of LR states These ... matching of the elementary tree with regard to the part to the "north-west" of the adjunction Our new algorithm recognizes exactly the strings in the language For the running example, the set of LR ... matches the part to the "south" of the adjunction to the part to the "north-east" Then, after reading c', the information that would indicate 950 Figure 4: Example of the construction for CS(R1),...
- 7
- 413
- 0
Tài liệu Báo cáo khoa học: "ADP based Search Algorithm for Statistical Machine Translation" docx
... for D P In the DP formalism, the search process is described recursively Assuming a total length I of the target string, Q1(c, i, j, e) is the probability of the best partial path ending in the ... groups of words by the correct category label Then, our search algorithm translated the transformed sentences In the last step, a simple rule-based algorithm replaced the category labels by the ... not there is another string with an even higher score than the produced output Nevertheless, it is quite interesting to compare the score of the algorithm' s output and the score of the sample translation...
- 8
- 480
- 0
Tài liệu Báo cáo khoa học: "An Algorithm for Simultaneously Bracketing Parallel Texts by Aligning Words" ppt
... Singleton-Rebalancing Algorithm We now introduce an algorithm for further improving the bracketing accuracy in cases of singletons Consider the following bracketing produced by the algorithm of the previous ... and e E L2(G), then G' contains a single production of the form S' ~ e/ c, where S' is the start symbol of G' and does not appear on the right-hand side of any production of G' ; otherwise G' contains ... gives the bracketing algorithm no diso'iminative leverage; such pairs ~c~ounted for less than 2% of the input data A random sample of the b ~ k e t e d sentence pairs was then drawn, and the bracket...
- 8
- 382
- 0
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
... necessary for correctness or even tractability The Complexity of the Generator The theoretical complexity of the generator is O (n4), where n is the size of the input We give an informal argument for ... ill-formed At the destination site of the movement (whether conjunction or adjunction), a new well-formed node is created The ancestors of the new well-formed node will be at least as well-formed ... third items of the TNCB triple are the child TNCBs The value of a TNCB is the sign that is formed from the combination of its children, or INCONSISTENT, representing the fact that they cannot...
- 7
- 410
- 0
Tài liệu Báo cáo khoa học: "AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES" pptx
... characters in the same positions in the two words are scored as possible correspondences Thus for instance, the first pass of the algorithm having matched the "m" of "mata" to the "n" of "nas", Titla ... in the performance of the algorithm to date was brought by a redefinition of the cognatlon index Once the individual character matches o f a word p a i r have been identified from its matrix of ... potential of a character correspondence the sum of its weight and of the highest potential of all possible character correspondences to its right, i.e dences between the ith character of the Tltla...
- 4
- 422
- 0
Tài liệu Báo cáo khoa học: "A HARDWARE ALGORITHM FOR HIGH SPEED MORPHEME EXTRACTION AND ITS IMPLEMENTATION" pptx
... with the combinations of various candidates For example, " ~ ~", one of the extracted morphemes, is composed of the 2nd candidate at the 1st position, the 1st candidate at the 2nd position and the ... examples of S t e p for P r o c e d u r e In Fig 5(a), the current address for the dictionary is at the morpheme " ~ " In Fig 5(b), the address is at the morpheme " ~ $ ; ]~" In Fig 5(a), all of the ... corresponds to the position in the text The other dimension corresponds to the candidate level Candidates on the same level form one stream For example, in Fig 6(a), the character at the 3rd position...
- 8
- 504
- 0
Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot
... done for the nodes whose score of the description generated so far, augmented by the minimal value of the description required for excluding the remaining potantial distractors, surpasses the ... surpasses the evaluation of the best solution Formalization of the Algorithm The algorithm operates on a tree of nodes which are implemented as structured objects, with the following properties, ... redundant It subsumes the target set It further reduces the distractors of the node The reduced set of distractors is not equal to or a superset of the Distractor property of a preceding sibling...
- 4
- 672
- 3
Tài liệu Báo cáo khoa học: "Generalized Hebbian Algorithm for Incremental Singular Value Decomposition in Natural Language Processing" potx
... finding the first N eigenvectors with the Generalized Hebbian Algorithm The algorithm converges on the exact eigen decomposition of the data with a probability of one The essence of these algorithms ... technique, in that the algorithm converges on the singular value decomposition of the dataset, rather than at any one point having the best solution possible for the data it has seen so far The method ... accurate as the direction of the singular vectors settles These approximations will therefore not interfere with the accuracy of the final result, though they might interfere with the rate of convergence...
- 8
- 362
- 0
Tài liệu Báo cáo khoa học: "AN EXTENDED LR PARSING ALGORITHM FOR GRAMMARS USING FEATURE-BASED SYNTACTIC CATEGORIES " pot
... results in the instantiation of the lhs through the tags The category for the constituent "gave boys" is obtained by unifying the instantiated Ihs and the first category of the rhs of the same ... from the preceding example that upon the completion of all the constituents on the rhs of a production, the GOTO table entry for the lhs is consulted Whether a category appears on the lhs or the ... is the case of the LR parsing algorithm with atomic categories The NEXT-S procedure constructs next states for the lhs category of each production, rather than the categories to the right of...
- 6
- 334
- 0
Báo cáo khoa học: "An Earley Parsing Algorithm for Range Concatenation Grammars" potx
... component of the ith element of φ, that is xi (resp yi ) In order to instantiate a clause of the grammar, we need to find ranges for all variables in the clause and for all occurrences of terminals For ... rules The deduction rules are shown in Fig The first rule scans the yields of terminating clauses Initialize introduces clauses with the dot on the left of the righthand side Complete moves the ... c depending on whether the item is predicted or completed, i.e., they either have the form [A, ρ, C , p] where ρ, C is a range constraint vector of dimension dim(A), or the form [A, φ, c] where...
- 4
- 354
- 0
Báo cáo khoa học: "An Algorithm For Generating Referential Descriptions With Flexible Interfaces" pdf
... influence existing algorithms, namely the instant availability of all descriptors of a referent and the satisfactory expressibility of the chosen set of descriptors They are responsible for three serious ... check the suitability of the descriptor proposed in the global context: the descriptor does not contribute further to the identification task (it must be an attribute) [S 10], the need of further ... encouraging the selection of descriptors whose images are candidates of filling empty slots in the expression built so far The algorithm enables one to control the processing aspect of building the referential...
- 8
- 325
- 0
Báo cáo khoa học: "AN ALGORITHM FOR GENERATION IN UNIFICATION CATEGORIAL GRAMMAR" pdf
... sketch of the algorithm Below we present the basic algorithm which implements the informal description given above We give the algorithm in Prolog for convenience because various refinements to the ... information indicating the resulting phonology and order of constituents is contained within the feature structures of the rule) The behaviour of this clause is just like that of the clause for ... called If the argument is generated before the phonology is instantiated, then unnecessary generations with the wrong word order can be prevented Therefore, we freeze the value of the phonology...
- 8
- 382
- 0
Tìm thêm: xác định các mục tiêu của chương trình khảo sát các chuẩn giảng dạy tiếng nhật từ góc độ lí thuyết và thực tiễn khảo sát chương trình đào tạo của các đơn vị đào tạo tại nhật bản khảo sát chương trình đào tạo gắn với các giáo trình cụ thể xác định thời lượng học về mặt lí thuyết và thực tế tiến hành xây dựng chương trình đào tạo dành cho đối tượng không chuyên ngữ tại việt nam điều tra đối với đối tượng giảng viên và đối tượng quản lí điều tra với đối tượng sinh viên học tiếng nhật không chuyên ngữ1 khảo sát các chương trình đào tạo theo những bộ giáo trình tiêu biểu nội dung cụ thể cho từng kĩ năng ở từng cấp độ xác định mức độ đáp ứng về văn hoá và chuyên môn trong ct mở máy động cơ rôto dây quấn các đặc tính của động cơ điện không đồng bộ hệ số công suất cosp fi p2 đặc tuyến mômen quay m fi p2 đặc tuyến dòng điện stato i1 fi p2 động cơ điện không đồng bộ một pha sự cần thiết phải đầu tư xây dựng nhà máy từ bảng 3 1 ta thấy ngoài hai thành phần chủ yếu và chiếm tỷ lệ cao nhất là tinh bột và cacbonhydrat trong hạt gạo tẻ còn chứa đường cellulose hemicellulose chỉ tiêu chất lượng 9 tr 25