parallel implementation of morphological neural networks for hyperspectral image analysis
High Performance Computing in Remote Sensing - Chapter 8 pps
Ngày tải lên :
12/08/2014, 03:20
... 8.5 details parallel implementations of some of the proposed algorithms, including morphological techniques and neural networks for classification and spectral mixture analysis of hyperspectral ... Parallelization of Automated Morphological Classification (AMC) Algorithm for Homogeneous Clusters The parallel implementation of AMC is based on the definition of an efficient data partitioning scheme for hyperspectral ... divides the image into two PSSPs The values of the MEI index for two pixels of the original hyperspectral image are calculated in parallel by each of the processors, using a square-shaped SE of × pixels...
- 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"
Ngày tải lên :
25/10/2012, 10:45
... independent of RA disease activity As part of a sensitivity analysis, we restricted the cohort to patients without any of these ICD-9 codes as part of a sensitivity analysis As part of two additional ... claims data To test the performance of the effectiveness algorithm and to see whether it was similar for non-biologic RA treatments, we performed a separate analysis of RA patients enrolled in ... perfect, performance of our effectiveness algorithm applied to administrative claims data By way of comparison, the corresponding performance characteristics in administrative data for a number of rheumatology...
- 29
- 581
- 0
An efficient genetic algorithm for the p median
Ngày tải lên :
08/08/2013, 08:38
... ERKUT Figure Population size as a function of n for three different values of p Figure Population size as a function of p for three different values of n 4.4 Initializing the population As discussed ... deviation of the average of the 10 solutions from the optimal solution d The average per-replication duration of the algorithm in seconds 34 ALP, DREZNER AND ERKUT Table Summary of the performance of ... The variance of the population fitness values as a function of the iteration count for OR Library problem #15 is merely a random sample of the set of entire solutions The histograms of the fitness...
- 22
- 605
- 0
A new algorithm for enumeration of minimum cutsets of graph by branch addition
Ngày tải lên :
03/01/2014, 19:35
... DEVELOPMENT OF THE BRANCH ADDITION ALGORITHM FOR V NEW ALGORITHM TO CALCULATE MINIMUM CUTSETS GRAPH WITH SOME INPUT NODES Inputs: n: number of graph nodes m: number of input nodes p: number of output ... a minimum cutset for this output node Then it finds all of node sets with two nodes (the output node and one of its adjacent nodes that it is not an input node) and for each of them deletes all ... START Load Network's Information m= number of input node p = number of output node n = number of graph's nodes u =0, k=0 u = u+1 The Uth output node is considered as output node of graph to calculate...
- 6
- 545
- 0
Reliability evaluation algorithm for complex medium voltage electrical distribution networks based on the shortest path
Ngày tải lên :
03/01/2014, 19:39
... 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 ... repair time for a transformer is much longer than the replacement time, and therefore the difference between the reliability indices for the two cases is significant It can be seen from the analysis ... four types based on the duration of loss of service in this paper They are: (a) healthy nodes with zero duration out of service; (b) nodes with duration out of service equal to the switching/sectionalising...
- 5
- 367
- 0
A dynamic programming algorithm for RNA structure
Ngày tải lên :
12/01/2014, 22:07
... Dynamic Programming Figure 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 ... generalization of the recursions for vx and wx in the presence of gap matrices A non-gap matrix can be obtained by combining two gap matrices together, therefore the recursions for vx and wx add ... coaxial energies for both nested and non-nested structures We adopt the coaxial energies provided by Walter et al (1994) for coaxial stacking of nested structures For coaxial stacking of non-nested...
- 16
- 688
- 0
Tài liệu Dollar Cost Banding - A New Algorithm for Computing Inventory Levels for Army Supply Support Activities pdf
Ngày tải lên :
17/02/2014, 17:20
... School at Fort Knox 49 CHAPTER FIVE Armywide Implementation 55 Approval as Army Policy 55 DCB Implementation 56 Implementation of DCB in ILAP 57 Improved Performance ... Characteristics of the Modified Economic Order Quantity (MEOQ) Formula 100 Tables S.1 Performance and Resource Metrics for Inventory Management xvi 2.1 Performance Metrics for Inventory ... understanding of supply chain performance, the SD PIT developed a suite of metrics that address performance and resource consumption Performance metrics, explained in the left-hand column of Table...
- 132
- 425
- 0
Tài liệu Báo cáo khoa học: "An Improved Redundancy Elimination Algorithm for Underspecified Representations" pdf
Ngày tải lên :
20/02/2014, 12:20
... finegrained deletion of reading sets than graphs A dominance chart for the graph G is a mapping of weakly connected subgraphs of G to sets of splits (see Fig 2), which describe possible ways of constructing ... (G) for the set of equivalence classes Conf(G)/≈R , where Conf(G) is the set of configurations of G The rewrite rule (3) above is an instance of this schema, as are the other three permutations of ... f2 , and C1 any configuration of G of the form C( f1 ( , f2 ( .), )) (where C is the context of the subterm) Then C1 can be R-rewritten into a tree C2 of the form C( f2 ( , f1 ( .), ...
- 8
- 429
- 0
Tài liệu Báo cáo khoa học: "An alternative LR algorithm for TAGs" docx
Ngày tải lên :
20/02/2014, 18:20
... 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 ... yield of the subtree after removal of a certain n u m b e r of its subtrees For convenience, each node of an auxiliary tree (or subtree thereof) that dominates a foot node is paired with a stack of ... that for a grammar of this size, the size of the LR table is prohibitively large The table represented as a collection of unit clauses in Prolog takes over 46 MB for storage The majority of this...
- 7
- 413
- 0
Tài liệu Báo cáo khoa học: "ADP based Search Algorithm for Statistical Machine Translation" docx
Ngày tải lên :
20/02/2014, 18:20
... based on a decomposition of the joint probability for f~ into a product of the probabilities for each word d Pr(flJle~) = p( J[I) " H p(fJl eta), (2) 3=1 where the lengths of the strings are regarded ... the introduction of an additional parameter into the recursion formula for DP In the following, we will explain this method in detail 2.3 Recursion F o r m u l a for D P In the DP formalism, the ... Table Table shows the statistics of the translation performance When different judgements existed for one sentence, the majority vote was accepted For the calculation of the subjective sentence error...
- 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
Ngày tải lên :
20/02/2014, 22:20
... 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 no productions of the form A ~ e/e ... productions of the form S ~-* e/e, A z / y , A ~ z/e, A ~-* e/y, and A , * A A A For proof by induction, we need only show that any full BTG T of degree f > is equivalent to a full BTG T' of degree ... Proceedings of ROCLING-92, 121-146 CHURCH,~ W 1993 Char-align: A program for aligning parallel texts at the character level In Proceedings of the 31st Annual Conference of the Association for Computational...
- 8
- 382
- 0
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt
Ngày tải lên :
20/02/2014, 22:20
... that the number of rewrites necessary to repair the initial guess is no more than the number of ill-formed TNCBs This can never exceed the number of interior nodes of the TNCB formed from n lexical ... 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 as they were ... efficiency of generation, but it is never 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...
- 7
- 410
- 0
Tài liệu Báo cáo khoa học: "AN ALGORITHM FOR IDENTIFYING COGNATES BETWEEN RELATED LANGUAGES" pptx
Ngày tải lên :
21/02/2014, 20:20
... 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 ... alphabet and the jth of the Sese alphabet would b e : sum of ith row x sum of Jth column e[i ,J] - Pot(i,J) = W[I,J] + max(Pot(i+l m,J+l n)) sum of cells giving a matrix of expected sound correspondences: ... measurement of the weight of a character correspondence Several measurements were tested, out of whlcb scores were retained: the weight of a correspondence was redefined as the probabillty of the...
- 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
Ngày tải lên :
21/02/2014, 20:20
... Experimental Machine for Morpheme Extraction" (in Japanese), SIC, Reports of Information Processing Society of Japan, NL75(9) Fukushima, T (19901)) "A Parallel Recognition Algorithm of Context-free ... "Two-level Model for Morphological Analysis" , Proe 8th International Joint Conference on Artificial Intelligence: 683-685 Matsumoto, Y (1986) "A Parallel Parsing System for Natural Language Analysis" , ... indexing for text database, text-tospeech conversion, and so on, because the morpheme extraction process is necessary for these applications The development of various kinds of accelerator hardware for...
- 8
- 504
- 0
Tài liệu Báo cáo khoa học: "A Best-First Search Algorithm for Generating Referring Expressions" pot
Ngày tải lên :
22/02/2014, 02:20
... distractors of the node The reduced set of distractors is not equal to or a superset of the Distractor property of a preceding sibling node (dominance cut-oft) The best-first search is performed by ... description required for excluding the remaining potantial distractors, surpasses the evaluation of the best solution Formalization of the Algorithm The algorithm operates on a tree of nodes which ... atomic descriptor for successors of the root node For successors of interior nodes, it is the descriptor combination following the one chosen at the mother node The generation of boolean combinations...
- 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
Ngày tải lên :
22/02/2014, 02:20
... algorithm for latent semantic analysis In Proceedings of Interspeech 2005 P Kanerva, J Kristoferson, and A Holst 2000 Random indexing of text samples for latent semantic analysis In Proceedings of 22nd ... something of the nature of the rules In performing dimensionality reduction on word bigram data, we force the rules to describe themselves through a more impoverished form than via the collection of ... position of the endpoint of the (normalised) vector over a number of training iterations, or simply length of the (unnormalised) vector, since a long vector is one that is being reinforced by...
- 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
Ngày tải lên :
22/02/2014, 10:20
... to variables of logic unification with a scope of single productions: if one occurrence of a particular tag is instantiated as a result of unification, so are other occurrences of the same tag ... 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 rhs of productions is a trivial ... built The pretenninal category for "gave" in Fig.4 is the result of unification between the lexical category for "gave" in Fig.5 and the first category on the rhs of the production in Fig.3 This...
- 6
- 334
- 0
Báo cáo khoa học: "An Earley Parsing Algorithm for Range Concatenation Grammars" potx
Ngày tải lên :
08/03/2014, 01:20
... 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 ... Υ(c, x) for a given clause c and x a variable or an occurrence of a terminal as the index of x in c The range constraint vector of a clause c captures all information about boundaries forming ... concatenation grammars for translation In Proceedings of COLING, Manchester, England E Bertsch and M.-J Nederhof 2001 On the complexity of some extensions of RCG parsing In Proceedings of IWPT 2001, pages...
- 4
- 354
- 0
Báo cáo khoa học: "An Algorithm For Generating Referential Descriptions With Flexible Interfaces" pdf
Ngày tải lên :
08/03/2014, 21:20
... availability of all descriptors of a referent and the satisfactory expressibility of the chosen set of descriptors They are responsible for three serious deficits negatively influencing the quality of ... neither for a vision system nor for a knowledge-based system is it without costs to determine all descriptors of a certain object - especially for the vision system, the computational effort may ... descriptors of some referent need to be evaluated before descriptors of other referents can be considered The linguistic aspects are largely simplified and even neglected in parts Because of the 'generation...
- 8
- 325
- 0
Báo cáo khoa học: "AN ALGORITHM FOR GENERATION IN UNIFICATION CATEGORIAL GRAMMAR" pdf
Ngày tải lên :
09/03/2014, 01:20
... a small set of unary rules of the form a > ~ where a and I~ are U C G signs Unary rules have several uses These include the treatment of unbounded dependencies, syntactic forms of type-raising ... feature structures of the rule) The behaviour of this clause is just like that of the clause for reduce w h i c h implements the UCG rules of function application On the basis of the generated ... equivalence of two semantic representations This means that not even the axioms of commutativity or associativity are available for testing logical equivalence One of the 1Strictly speaking, we test for...
- 8
- 382
- 0