mutual coupling analysis for compact transmitting antenna arrays

Towards efficient proofs of storage and verifiable outsourced database in cloud computing

Towards efficient proofs of storage and verifiable outsourced database in cloud computing

... 35 4.4.2 Completeness 36 4.5 Performance Analysis 37 4.6 Security Analysis of MAC scheme S1 37 4.6.1 Security Model ... Definition and Formulation 97 6.3 POS3: An Efficient PDP Scheme 98 6.3.1 Construction of POS3 98 6.3.2 Completeness 100 6.4 Performance Analysis ... of verifications A refined security formulation is given in [BJO09b] Ateniese et al [ABC+ 07] gave an alternative formulation called Provable Data Possession for proofs of storage problem, and...

Ngày tải lên: 09/09/2015, 18:58

220 479 0
Báo cáo hóa học: " An efficient and secure anonymous authentication scheme for mobile satellite communication systems" doc

Báo cáo hóa học: " An efficient and secure anonymous authentication scheme for mobile satellite communication systems" doc

... http://jwcn.eurasipjournals.com/content/2011/1/86 two keys Therefore, the proposed scheme is secure to impersonation attacks 4.3 Performance analysis This subsection provides the performance analysis in terms of communication ... hash function for avoiding complex computations for both mobile users and NCC, (2) it does not require sensitive verification table which may cause NCC to become an attractive target for numerous ... model to provide diversified communication services, thus forming the so-called mobile satellite communication system (MSCS for short) For example, if a mobile user wants to communicate with a...

Ngày tải lên: 21/06/2014, 00:20

10 286 0
An efficient genetic algorithm for the p median

An efficient genetic algorithm for the p median

... operators For example, for a problem with (n, p) = (100, 20), the algorithm terminates if 448 successive children fail in improving the best solution (For all of our test problems, we had n > 2p √ For ... effort ADE is very fast with an average per-replication time of 18.4 seconds for the 40 test problems The per-replication times range from 0.1 seconds for (n, p) = (100, 5) to 2.2 minutes for ... could improve the performance on some problems by slowing down convergence We made no effort to customize the algorithm to the problems on hand, and used the same formulas for the population size...

Ngày tải lên: 08/08/2013, 08:38

22 606 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

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

... := O; forall z E F d o c r e a t e uarae-concat¢~atoT'-Rmb age~| J~f i; N, ~= s*lve(x); i := i + 1; forellend for j := to i d o R := R U ( W a i t - l o r - r e s u l t ( J ~ f j ) ) ; forend ... Association for Computational Linguistics T Kasami 1965 An efficient recognition and syntax algorithm for context-free languages Technical Report AFCRL-65-758, Air Force Cambrige Research Lab., Bedford, ... in a natural way, as it is designed for efficient support for data sharing and destructive operations on shared heaps by parallel agents Application and Performance Evaluation This section describes...

Ngày tải lên: 20/02/2014, 18:20

7 428 0
Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx

Tài liệu Báo cáo khoa học: "AN INTEGRATED HEURISTIC SCHEME FOR PARTIAL PARSE EVALUATION" docx

... The features are designed to be general and, for the most part, grammar and domain independent For each parse, the heuristic computes a penalty score for each of the features The penalties of the ... have indicated that, in most cases, a less fragmented analysis is more desirable We therefore use the sum of the number of fragments in the analysis as an additional feature We have recently augmented ... optimization techniques for this task The fragmentation of the parse analysis The statistical score of the disambiguated parse tree The Parse Quality Heuristic The penalty scheme for skipped words...

Ngày tải lên: 20/02/2014, 21:20

3 346 0
Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt

Tài liệu Báo cáo khoa học: "An Efficient Generation Algorithm for Lexicalist MT" ppt

... fourth transformation (move) which improves ill-formed TNCBs The fifth is used to establish the well-formedness of undetermined nodes In the diagrams, we use a cross to represent ill-formed nodes ... ill-formed In other words, a maximal TNCB is a largest well-formed component of a TNCB (2) The dog (3) The big dog 262 Since TNCBs are tree-like structures, if a T N C B is undetermined or ill-formed ... whether it is well-formed or ill-formed Now, since the determiner and adjectives all modify the same noun, most grammars will allow us to construct the phrases: • maximal iff it is well-formed and its...

Ngày tải lên: 20/02/2014, 22:20

7 411 0
Bond Markets in Serbia: regulatory challenges for an efficient market potx

Bond Markets in Serbia: regulatory challenges for an efficient market potx

... intuitive interpretation, conforms to stylized facts, and can be used for forecasting, we use it as a starting point to formulate a model specification suitable for analyzing the term structure ... shapes of the forward curve The N-S model can replicate stylized facts with ease and is well suited for forecasting Moreover, variations of this model are often used by central banks to form inflationary ... voluntary basis The bonds were issued in paper format and thus were liable to forgery and theft The non-electronic format of bonds proved to be complicated for trading and clearing procedures as well...

Ngày tải lên: 15/03/2014, 09:20

76 356 0
Flash: An Efficient and Portable Web Server pot

Flash: An Efficient and Portable Web Server pot

... loaded from disk Information gathering - Web servers use information about recent requests for accounting purposes and to improve performance, but the cost of gathering this information across ... basic steps described below are similar for HTTP/1.1 requests, and for other operating systems, like Windows NT The basic sequential steps for serving a request for static content are illustrated ... SPED architecture performs well for cached workloads but its performance deteriorates quickly as disk activity increases This confirms our earlier reasoning about the performance tradeoffs associated...

Ngày tải lên: 16/03/2014, 19:20

14 451 0
Báo cáo khoa học: "CONSTRAINT PROJECTION: AN EFFICIENT TREATMENT DISJUNCTIVE FEATURE DESCRIPTIONS " ppt

Báo cáo khoa học: "CONSTRAINT PROJECTION: AN EFFICIENT TREATMENT DISJUNCTIVE FEATURE DESCRIPTIONS " ppt

... is caused by keeping information about daughter nodes Such information can be abandoned if it is assumed that we want only information about mother nodes That is, transformation (43) is more ... Clause Grammar for Language Analysis A Survay of the Formalism and a Comparison with Augmented Transition Networks Artificial Intelligence, 13:231-278 Pollard, C J and Sag, I A (1987) Information- ... transformed into normal constraints As for goal-irrelevant constraints, only their satisfiability is examined, because they are no longer used and examining satisfiability is easier than transforming...

Ngày tải lên: 17/03/2014, 08:20

8 257 0
Báo cáo khoa học: "The Treegram Index An Efficient Technique for Retrieval in Linguistic Treebanks" docx

Báo cáo khoa học: "The Treegram Index An Efficient Technique for Retrieval in Linguistic Treebanks" docx

... forms, feature terms should be used (2) V E N O N A deals only with treegrams of a maximal degree d; if a tree is of greater degree, it will be transformed automatically to a d-ary tree (3) For ... variables, the index has to contain all matching treegrams for that subtree (c) It is quite expensive to intersect the tree sets T(DB, g) for all treegrams g contained in the query q VENONA addresses ... g's structure completes this representation: Structure is at least as essential for tree retrieval as label information P r o b l e m B V E N O N A uses only one treegram per node v: the treegram...

Ngày tải lên: 17/03/2014, 23:20

2 327 0
Báo cáo khoa học: "An Efficient Statistical Speech Act Type Tagging System for Speech Translation Systems" potx

Báo cáo khoa học: "An Efficient Statistical Speech Act Type Tagging System for Speech Translation Systems" potx

... (wi, li, ai, i ) where wi represents a surface wordform, and each vector represents the following additional information for w i canonical form and part of speech of wi (linguistic feature) ... work involved three experts for the Japanese corpus and two experts for the English corpus The result was checked and corrected by one expert for each language Therefore, since the work was done ... probabilities: for a word sequence break at both ends of an SA unit and for a n o n break inside the unit Notice that the probabilities of the former type adjust an unfairly high probability estimation for...

Ngày tải lên: 31/03/2014, 04:20

8 238 0
Báo cáo khoa học: "GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION ATR" ppt

Báo cáo khoa học: "GENERALIZED CHART ALGORITHM: AN EFFICIENT PROCEDURE FOR COST-BASED ABDUCTION ATR" ppt

... uniform criteria for syntax, semantics and pragmatics Hopefully, several techniques, independently developed in these areas, e.g., stochastic parsing, example-based/corpus-based techniques for ... relation The subscript $c of a formula A represents the cost of assuming formula A A is easy to assume when c is small, while A is difficult to assume when c is large For instance, the cost of interpreting ... from the consideration of head-driven derivation, the index of a formula is determined to be the first argument of that formula All formulas with the same index are derived the first time that index...

Ngày tải lên: 31/03/2014, 06:20

8 219 0
Báo cáo khoa học: "AN EFFICIENT PARSING ALGORITHM FOR TREE ADJOINING GRAMMARS" potx

Báo cáo khoa học: "AN EFFICIENT PARSING ALGORITHM FOR TREE ADJOINING GRAMMARS" potx

... to analyze TAGs as well As for the context-free analysis with CKY, the grammar is required in normal form as a precondition for the TAG parser Therefore, first the two form is defined and the idea ... transformed in two form so that condition can be satisfied easier This transformation is accomplished by the constructive proof for the theorem that for each TAG (or TAG with Constraints for which ... case is O(n3), because a CKY analysis has to at least be done 287 FORM TRANS- As precondition of the new parsing algorithm, the TAG has to be transformed into a normal form which contains only trees...

Ngày tải lên: 31/03/2014, 18:20

8 345 0
Báo cáo khoa học: "An Efficient Implementation of a New POP Model" doc

Báo cáo khoa học: "An Efficient Implementation of a New POP Model" doc

... 85.6 Experiments For our experiments we used the standard division of the WSJ (Marcus et al 1993), with sections through 21 for training (approx 40,000 sentences) and section 23 for testing (2416 ... that for n=1, SL-DOP is equal to the PCFG-reduction of Bod (2001) (which we also called Likelihood-DOP) while LS-DOP is equal to Simplicity-DOP Table shows the results for sentences 100 words for ... Collins, M 2000 Discriminative Reranking for Natural Language Parsing, Proceedings ICML2000, Stanford, Ca Collins M and N Duffy, 2002 New Ranking Algorithms for Parsing and Tagging: Kernels over...

Ngày tải lên: 31/03/2014, 20:20

8 468 0
Báo cáo khoa học: "An Efficient Method for Determining Bilingual Word Classes" doc

Báo cáo khoa học: "An Efficient Method for Determining Bilingual Word Classes" doc

... criterion is met: FOR EACH word e: FOR EACH class E: [Determine the change of LP((E, 9v), rig) if e is moved to E Move e to the class with the largest improvement FOR EACH 'word f: FOR EACH class ... mono-lingually classes for the target language (English) and afterwards optimizing classes for the source language (Eq (11) and Eq (12)) For EUTRANS-I we used 60 classes and for EUTRANS-II we used ... performance of the translation system was optimal The CPU time for optimization of bilingual word classes on an Alpha workstation was under 20 seconds for EUTRANS-I and less than two hours for...

Ngày tải lên: 31/03/2014, 21:20

6 289 0
Báo cáo toán học: " An efficient implementation of iterative adaptive approach for source localization" pptx

Báo cáo toán học: " An efficient implementation of iterative adaptive approach for source localization" pptx

... performed K times for all angles {θ1,θ2, ,θK} This is computationally extravagant, because in general we are only interested in the angle set where the actual sources are located Moreover, for ... while EIAA shows sharper peaks The performances of IAA and EIAA are compared via histograms over 1000 trials in Figure 3, where SNR = dB for (a-c) and SNR = 10 dB for (d-f) The thresholds in Table ... http://asp.eurasipjournals.com/content/2012/1/7 Page of Figure Performance comparison of IAA and EIAA (a-c) For SNR = dB; (d-f) for SNR = 10 dB (a, d) Angle error difference power power angle angle...

Ngày tải lên: 20/06/2014, 20:20

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

Báo cáo hóa học: " Research Article An Action Recognition Scheme Using Fuzzy Log-Polar Histogram and Temporal Self-Similarity" pptx

... force the hyperplane to pass through the origin that restricts the solution For computational purposes it is more convenient to solve SVM in its dual formulation This can be accomplished by forming ... maxima points, therefore only the maxima points of values greater than predetermined threshold are eligible to be nominated for being corners The nominated points are then checked for whether their ... set of visual words before they are fed into the classification module Another thread of research is concerned with analyzing patterns of motion to recognize human actions For instance, in [17],...

Ngày tải lên: 21/06/2014, 07:20

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

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

... at 4°C for more than 12 h to form the PLA/Au nanocomposites conjugated with dauborubicin Atomic Force Microscopy Study In a relevant atomic force microscopy study (AFM), μL from the aforementioned ... ultrasonic treatment for about 20 Then, Au (2.80 × 10 -7 mol/L) and PLA nanofiber gel aqueous solutions (1.3 × 10 -3 g/L) were mixed and incubated together for more than 12 h to form the PLA/Au nanocomposites ... incubated for 48 h in a 5% CO2 incubators at 37°C, and then 20 μL of mg/mL MTT was added to the wells and incubated for an additional h Subsequently, it was centrifuged at 1,000 rpm for 10 and...

Ngày tải lên: 21/06/2014, 08:20

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

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

... 2.1 for all x, y ∈ K, where the sequence {kin } ⊂ 1, ∞ and limn→∞ kin for each i For each n 1, 2, , let bn sup{kin | i 1, 2, } and assume sup bn | n 1, 2, < ∞, lim bn max{bn , b} for ... the weak∗ topology For instance, every lp -space < p < ∞ has a weakly continuous generalized duality map for ϕ t tp−1 t ϕ x dx The following property may be seen in many For each t ≥ 0, let ... x−y 1.5 for all x, y ∈ K Shahzad and Udomene studied the following implicit and explicit iterative schemes for an asymptotically nonexpansive mapping T with the sequence {kn } in a uniformly smooth...

Ngày tải lên: 21/06/2014, 23:20

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

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

... (1991) 340-344 [5] Lefort F., Douglas G.C., Occurrence and detection of triploid oaks by microsatellite analysis, in: Douglas G.C, Lefort F (Eds.), Strategies for Improvement of Forest Species Proceedings ... ng DNA template A initial denaturation at 94 °C was followed by 35 cycles (50 °C for1 min, 72 °C for 30 s, 92 °C for min) terminated by an final extension at 72 °C PCR products were checked on ... sufficient for PCR and RFLP purposes In of It gave consistent and reliable results for all sources of from in vitro cultures, from say green house and in the field grown trees DNA quality is suitable for...

Ngày tải lên: 08/08/2014, 14:21

5 389 0
w