beamforming for wideband compact antenna arrays in the presence of antenna mutual coupling
Towards efficient proofs of storage and verifiable outsourced database in cloud computing
Ngày tải lên :
09/09/2015, 18:58
... function (the function is specified in the delegation key) value of the plaintext from the corresponding ciphertext, yet without knowing the value of the plaintext We prove security properties of the ... Chapter POS1 The name of proofs of storage scheme proposed in Chapter POS2 The name of proofs of storage scheme proposed in Chapter POS3 The name of proofs of storage scheme proposed in Chapter ... detection probability In comparison, in all of proofs of storage schemes proposed in this dissertation, the proof size is independent on the choices of the subset of blocks to be checked in a verification...
- 220
- 478
- 0
Báo cáo hóa học: " An efficient and secure anonymous authentication scheme for mobile satellite communication systems" doc
Ngày tải lên :
21/06/2014, 00:20
... adopted to proof the mutual authentication and security of the session key in the proposed scheme The construction of the proofs is as followings The proofs are constructed following game-based ... against an insertion attack in which an intruder inserts a verification item into the verification table 3.2 Authentication phase Figure illustrates the proposed authentication phase During the ... the authentication phase, a mobile user U must be authenticated before communicating with another mobile user or accessing the resources in the system In addition, he/she has to ascertain the identity...
- 10
- 285
- 0
An efficient genetic algorithm for the p median
Ngày tải lên :
08/08/2013, 08:38
... genes The similarity index of the population is the average of the individual similarity indices Given the way we generate the initial population, the starting similarity index is 33.3 As figure indicates, ... sizes with the following two properties: Every gene must be present in the initial population Since the GA iterates by creating new combinations of the genes in the original gene pool, an incomplete ... one of the best possible offspring from the genes at hand (In the context of genetics, we can think of the genes that are dropped by the greedy heuristic as recessive genes, and of those maintained...
- 22
- 605
- 0
Tài liệu Báo cáo khoa học: "An Efficient Parallel Substrate for Typed Feature Structures on Shared Memory Parallel Machines" docx
Ngày tải lên :
20/02/2014, 18:20
... machines, these features reduce the overhead of parallelization Note that copying in the procedures makes it possible to support non-determinism in NLP systems For instance, during parsing, intermediate ... on the shared heap Copy TFSs pointed at by the IDs in the message from the shared heap to the local heap of the CSA ((i) in Figure 4.) Process a query using LiAM and the local heap ((ii) in Figure ... explains the inner structure of P S T F S focusing on the execution mechanism of CSAs (See (Taura, 1997) for further detail on CAs) A CSA is implemented by modifying the abstract machine for TFSs...
- 7
- 427
- 0
Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx
Ngày tải lên :
20/02/2014, 21:20
... parse, the heuristic computes a penalty score for each of the features The penalties of the different features are then combined into a single score using a linear combination The weights used in ... using the following formula: penalty = (0.1 * (-loglo(pscore))) The penalty scores of the features are then combined by a linear combination The weights assigned to the features determine the ... then to find the maximal parsable subset of the input string (and its parse) However, in many cases there are several distinct maximal parses, each consisting of a different subset of words of...
- 3
- 346
- 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
... returning the mother Combination is the commutative equivalent of rule application; the linear ordering of the daughters that leads to successful rule application determines the orthography of the ... 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 ... the size of the input We give an informal argument for this The complexity of the test phase is the number of evaluations that have to be made Each node must be tested no more than twice in the...
- 7
- 410
- 0
Bond Markets in Serbia: regulatory challenges for an efficient market potx
Ngày tải lên :
15/03/2014, 09:20
... balancing of accounts of financial assets and liabilities arising on the ground of business transactions involving securities, including the performance of other operations in conformity with the ... development of the financial market, T-bills never reached the stock exchange Instead, they were only traded on the online auctions through the system of the Ministry of Finance In order to eliminate the ... on the Serbian financial market: T-bills issued by the Ministry of Finance of the Republic of Serbia, and NBS bills, issued by the National Bank of Serbia The main idea behind these financial instruments...
- 76
- 356
- 0
Flash: An Efficient and Portable Web Server pot
Ngày tải lên :
16/03/2014, 19:20
... associated with the serving of many HTTP requests, in the context of a single process and a single thread of control As a result, the overheads of context switching and thread synchronization in the MP ... purposes and to improve performance, but the cost of gathering this information across all connections varies in the different models In the MP model, some form of interprocess communication ... data copying within the operating system, degrading performance The extra cost for misaligned data is proportional to the amount of data being copied The problem arises when the OS networking code...
- 14
- 451
- 0
Báo cáo khoa học: "CONSTRAINT PROJECTION: AN EFFICIENT TREATMENT DISJUNCTIVE FEATURE DESCRIPTIONS " ppt
Ngày tải lên :
17/03/2014, 08:20
... divide(P) Hin := the list of the members of H which include variables in X ]-[ex : - the list of the members of H other than the members of ~in For each member R of ]]cx, If not(satisfiable(R)) then ... concerning ¥ The main ideas of CU are (a) it classifies constraint-terms in the input constraint into groups so that they not share a variable and it transforms them into modular constraints separately, ... Descriptions In Proceedings of the 26th Annual Meeting of the Association for Computational Linguistics Hasida, K (1986) Conditioned Unification for Natural Language Processing In Proceedings of the llth...
- 8
- 257
- 0
Báo cáo khoa học: "The Treegram Index An Efficient Technique for Retrieval in Linguistic Treebanks" docx
Ngày tải lên :
17/03/2014, 23:20
... g) for all treegrams g contained in the query q VENONA addresses these problems by the following approach: P r o b l e m A: Processing of a single treegram: (1) Node labels hash to an integer of ... tree (3) For describing a single treegram g, VENONA takes each of g's hashed labels and combines it with the position of its corresponding node in a complete d-ary tree; an integer encoding g's ... indexing to feature terms in this abstract 2The employed algorithm is a generalization of the well-known transformation of trees to binary trees d's value is a configurable parameter of the indexgeneration...
- 2
- 327
- 0
Báo cáo khoa học: "An Efficient Statistical Speech Act Type Tagging System for Speech Translation Systems" potx
Ngày tải lên :
31/03/2014, 04:20
... one expert for each language Therefore, since the work was done by one expert, the inter-coder tagging instability was suppressed to a minimum As the result of the tagging, we obtained 95 common ... With this in mind, the evaluation was done in the following way We counted the number of brackets in the correct answer, denoted as R (reference) We also counted the number of brackets in the tagger's ... to the necessity of controlling politeness in Japanese translations according to the speaker The SA tag for the positive responses did not work either These results suggest that the SA tag information...
- 8
- 238
- 0
Báo cáo khoa học: "GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION ATR" ppt
Ngày tải lên :
31/03/2014, 06:20
... Example of Generalized Charts we first define the chart lexicons In chart parsing, lexicons are the words in the input string, each of which is used as the index for a subset of the edges in the ... derived formulas starting from the fact in which z occupies the first argument position For example, in the chart representing the proof in Figure 1, all the edges corresponding to the formulas on the ... are the terms that occur in the first argument position of any formula; each edge incident from (the start-point of) lexicon x represents the substructure dominating the successive sequence of the...
- 8
- 219
- 0
Báo cáo khoa học: "AN EFFICIENT PARSING ALGORITHM FOR TREE ADJOINING GRAMMARS" potx
Ngày tải lên :
31/03/2014, 18:20
... node Then the neighborhood of the incoming edges in the root node of the innermost tree and the outgoing edges in the foot node (the currently examined node where the invariant contains the information ... out of the erased parts of the original grammar These adjoinings replace the nodes which are not in normal form Since the details of the different steps are of no further interest here, the reader ... once (the father-son relation is only interpreted in the upward direction) In Figure the dotted line from the NP node in describes the elimination of/ 3 by propagation of the information from the...
- 8
- 345
- 0
Báo cáo khoa học: "An Efficient Implementation of a New POP Model" doc
Ngày tải lên :
31/03/2014, 20:20
... created for each node in the training data This nonterminal is called A k Nonterminals of this form are called "interior" nonterminals, while the original nonterminals in the parse trees are called ... the subtrees in the treebank That is, the probability of a subtree t is taken as the number of occurrences of t in the training set, I t I, divided by the total number of occurrences of all subtrees ... nonterminal it contains It easy to see that this is equivalent to reducing the probability of a tree by a factor of four for each pair of nonterminals it contains, resulting in the PCFG reduction in...
- 8
- 468
- 0
Báo cáo khoa học: "An Efficient Method for Determining Bilingual Word Classes" doc
Ngày tải lên :
31/03/2014, 21:20
... in the monolingnal case We maximize the joint probability of a bilingual training corpus (el, f J): = argma = The function nt(FIE) counts how often the words in class F are aligned to words in ... classes and for EUTRANS-II we used 500 classes We chose the number of classes in such a way that the final performance of the translation system was optimal The CPU time for optimization of bilingual ... starting point is a random partition of the training corpus vocabulary This initial partition is improved iteratively by moving a single word from one class to another The algorithm to determine...
- 6
- 288
- 0
Báo cáo toán học: " An efficient implementation of iterative adaptive approach for source localization" pptx
Ngày tải lên :
20/06/2014, 20:20
... the number of the selected principle components in step (b) of Table is equal to the number of the actual sources; for lower SNR, the number of the selected principle components in step (b) of ... [14-16] for resolving the ambiguity The remainder of this article is organized as follows The signal model and the original IAA are introduced in Section The EIAA algorithm is proposed in Section The ... to the algorithms mentioned above, we are only interested in the unambiguous angle solution, which depends on the ratio of interelement spacing of the array to the wavelength In the case that the...
- 6
- 410
- 0
Báo cáo hóa học: " Research Article An Action Recognition Scheme Using Fuzzy Log-Polar Histogram and Temporal Self-Similarity" pptx
Ngày tải lên :
21/06/2014, 07:20
... of the matrix μ(·; σi , σd ) characterize the cornerness σ of a point in a given image The sufficiently large values of the eigenvalues indicate the presence of a corner at a point The larger the ... contained data from all the sequences in the dataset The SVMs were trained on the training set while the evaluation of the recognition performance was performed on the test set Table shows the ... the validation process As the name suggests, this involves using a group of sequences from a single subject in the original dataset as the testing data and the remaining sequences as the training...
- 9
- 391
- 0
Báo cáo hóa học: " Novel Strategy to Fabricate PLA/Au Nanocomposites as an Efficient Drug Carrier for Human Leukemia Cells in Vitro" pdf
Ngày tải lên :
21/06/2014, 08:20
... Daunorubicin As shown in Figures and 2, the AFM images of PLA nanofibers, Au nanoparticles and the blending of the PLA/Au nanocomposites with daunorubicin demonstrate that upon blending of daunorubicin ... revealed that the resistant factor of the reversal index to resistant leukemia cells was 70.14 for K562/A02 in the control group, while the resistant factor in the presence of the PLA/Au nanocomposites ... incubated together for more than 12 h to form the PLA/Au nanocomposites The solution of daunorubicin (3.3 × 10 -4 mol/L) was mixed into the nanocomposites and stored in the dark at 4°C for more than...
- 8
- 336
- 0
Báo cáo hóa học: " Research Article An Implicit Iterative Scheme for an Infinite Countable Family of Asymptotically Nonexpansive Mappings in Banach Spaces" pot
Ngày tải lên :
21/06/2014, 23:20
... limit of the sequence of the sequence {kin }, that is, sup{kin | i sup {kin | i 1, 2, }∞ exists, then by choosing the contraction constant λ and the control n sequence {tn } we can obtain the ... Moreover, the following inequality Tin x − Tin y ≤ bn x − y 2.4 holds for all x, y ∈ K and each i 1, Take an integer r > arbitrarily For each n ≥ 1, define the mapping Sni : K→K by Sni for each ... 1.2, we have x ∈ F Ti for every i 1, 2, In 2.21 , replacing xn with xnj and z with x, respectively, and then taking the limit as j→∞, we obtain by the weak continuity of the duality map J lim...
- 10
- 294
- 0
Báo cáo khoa học: "An efficient micro-method of DNA isolation from mature leaves of four hardwood tree species Acer, Fraxinus, Prunus and Quercus" pdf
Ngày tải lên :
08/08/2014, 14:21
... enabling all steps to be performed in a 1.5 mL Eppendorf type tube, reducing useless handling The time required for a single extraction was about 40 from the beginning to the resuspension in TE ... efficiently formation of insoluble complexes of DNA than the classical combination of one detergent, one reductant, one salt offered by other protocols We found a final concentration of % β-mercaptoethanol ... number of samples in a workday The most laborious step is the grinding step and if numerous samples are extracted, they may be kept on ice or in freezer (-20 °C) until going on with the 65 °C incubation...
- 5
- 389
- 0