標(biāo)題: Titlebook: Vector Analysis; Klaus J?nich Textbook 20011st edition Springer-Verlag New York 2001 Derivative.Vector field.calculus.differential equatio [打印本頁] 作者: INFER 時(shí)間: 2025-3-21 19:07
書目名稱Vector Analysis影響因子(影響力)
書目名稱Vector Analysis影響因子(影響力)學(xué)科排名
書目名稱Vector Analysis網(wǎng)絡(luò)公開度
書目名稱Vector Analysis網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱Vector Analysis被引頻次
書目名稱Vector Analysis被引頻次學(xué)科排名
書目名稱Vector Analysis年度引用
書目名稱Vector Analysis年度引用學(xué)科排名
書目名稱Vector Analysis讀者反饋
書目名稱Vector Analysis讀者反饋學(xué)科排名
作者: 全部 時(shí)間: 2025-3-21 21:14 作者: 浪費(fèi)物質(zhì) 時(shí)間: 2025-3-22 03:17
Undergraduate Texts in Mathematicshttp://image.papertrans.cn/v/image/980819.jpg作者: GUILE 時(shí)間: 2025-3-22 05:18 作者: 驚呼 時(shí)間: 2025-3-22 09:12 作者: CHOP 時(shí)間: 2025-3-22 16:47 作者: 釘牢 時(shí)間: 2025-3-22 17:50
Manifolds-with-Boundary,The classical version of Stokes’s theorem deals with the con-nection between “surface integrals” and “l(fā)ine integrals.” A three-dimensional version, called Gauss’s integral theorem, makes a statement about the relationship between “volume integrals” and surface integrals.作者: 運(yùn)氣 時(shí)間: 2025-3-23 00:08
,The Intuitive Meaning of Stokes’s Theorem,The actual definition of the Cartan (or exterior) derivative . : Ω.. → Ω.. will be postponed until the next chapter, and the proof of Stokes’s theorem that ... = ... until the chapter after that. In the present chapter I’ll try to sketch how one could intuitively come up with the idea of the exterior derivative and conjecture Stokes’s theorem.作者: 做方舟 時(shí)間: 2025-3-23 02:04
The Wedge Product and the Definition of the Cartan Derivative,To define the Cartan derivative we use a tool from multilinear algebra, the exterior, or “wedge,” product of alternating multilinear forms.作者: 和平主義者 時(shí)間: 2025-3-23 09:36 作者: 一罵死割除 時(shí)間: 2025-3-23 10:21 作者: lymphoma 時(shí)間: 2025-3-23 15:40
De Rham Cohomology,We turn now from classical vector analysis to a completely different aspect of the calculus of differential forms. Consider the de Rham complex.of a manifold M. The property . ο . = 0 means that.for every ., so we can take the quotient of these two vector spaces.作者: Minuet 時(shí)間: 2025-3-23 18:02 作者: BLAZE 時(shí)間: 2025-3-24 00:42 作者: exacerbate 時(shí)間: 2025-3-24 05:58 作者: 玉米棒子 時(shí)間: 2025-3-24 09:33 作者: 表狀態(tài) 時(shí)間: 2025-3-24 14:44 作者: 切掉 時(shí)間: 2025-3-24 15:19 作者: jet-lag 時(shí)間: 2025-3-24 20:06 作者: 流利圓滑 時(shí)間: 2025-3-24 23:44
Klaus J?nichr of page faults incurred by an optimal offline algorithm .. The bound is tight up to a small additive constant. Based on these expressions for .’s cost, we obtain nearly tight upper and lower bounds on .’s competitiveness, given any characteristic vector .. The resulting ratios range between?1 and 作者: 賄賂 時(shí)間: 2025-3-25 05:48
Klaus J?nichMDPs was not even known to be decidable..Our algorithms exploit the following basic fact: we show that for any BMDP, its maximum (minimum) .-reachability probabilities are given by the . (GFP) solution . of a corresponding monotone max (min) Probabilistic Polynomial System of equations (max/min-PPS)作者: uveitis 時(shí)間: 2025-3-25 10:50
Klaus J?nichlic happens-before relation there is one in a certain normal form. Finally, we reduce the existence of such a normal-form computation to a language emptiness problem. Altogether, this yields a PS. algorithm for checking robustness against Power. We complement it by a matching lower bound to show PS.作者: Electrolysis 時(shí)間: 2025-3-25 12:49
Klaus J?nichlocal scheduling policies..Our price of anarchy results also imply improved approximation algorithms for the underlying optimization problem of routing over a tree. This problem is well motivated from applications of routing in supercomputers and data center networks where average sojourn time is an作者: Myelin 時(shí)間: 2025-3-25 17:36
Klaus J?nichtechnique for in service automatic calibrationof the modulated frequency synthesizer by ensuring that the digitalemphasis filter and analog loop filter characteristics are matched.The automatic calibration circuit operates while the transmitter is inservice and compensates for process and temperatur作者: 減少 時(shí)間: 2025-3-25 20:37 作者: 祝賀 時(shí)間: 2025-3-26 02:46
Klaus J?nich, encryption with special properties/quantum cryptography, various types of hashing, as well as public-key cryptography and authentication.978-3-540-70582-6978-3-540-70583-3Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: 有抱負(fù)者 時(shí)間: 2025-3-26 05:38 作者: SPASM 時(shí)間: 2025-3-26 11:28
Klaus J?nichuch as fingerprint identification and speakerverification, have received considerable attention over the past 25years, and some issues like face recognition and978-1-4613-7038-3978-1-4615-4519-4Series ISSN 1566-0710 作者: aqueduct 時(shí)間: 2025-3-26 14:13
Klaus J?nich over atomic constants, and let as the only polymorphic construct. We present a synthesis of recent results which characterize this “toy” language‘s expressive power as well as its type reconstruction (or type inference) problem. More specifically: (1) Core-ML can express exactly the ELEMENTARY quer作者: 閃光你我 時(shí)間: 2025-3-26 19:40
Klaus J?nich may yield more than one output for some inputs, an inconvenience in some applications. In principle, multiple output values can be treated in one of the following ways: (1) Consider any input leading to multiple outputs in error. (2) Select the shortest output and consider the input in error if tie作者: 碎石 時(shí)間: 2025-3-26 23:38 作者: HALO 時(shí)間: 2025-3-27 02:31 作者: 留戀 時(shí)間: 2025-3-27 06:19
Klaus J?nich logarithmic communication complexity for randomized protocols with a one-sided error probability of 1/3 but which has linear communication complexity for deterministic protocols. The result is true for .?=?.. players, where . is the number of bits on each players’ forehead. This separates the analo作者: Accolade 時(shí)間: 2025-3-27 10:14
Klaus J?nichand Programming, ICALP 2008, held in Reykjavik, Iceland, in July 2008. The 126 revised full papers presented together with 4 invited lectures were carefully reviewed and selected from a total of 407 submissions. The papers are grouped in three major tracks on algorithms, automata, complexity and gam作者: 最初 時(shí)間: 2025-3-27 17:01 作者: staging 時(shí)間: 2025-3-27 19:50
Klaus J?nichation, where the objective of the controller is to maximize (or minimize) the probability of eventually reaching a population that contains an object of a desired (or undesired) type, we give algorithms for approximating the supremum (infimum) reachability probability, within desired precision ., in作者: MOTIF 時(shí)間: 2025-3-28 00:18
Klaus J?niche features a relaxed memory model providing very weak guarantees with respect to the ordering and atomicity of memory accesses..Due to these weaknesses, some programs that are correct under sequential consistency (SC) show undesirable effects when run under Power. We say that these programs are not 作者: motor-unit 時(shí)間: 2025-3-28 03:01 作者: 逃避現(xiàn)實(shí) 時(shí)間: 2025-3-28 09:27
Klaus J?nichformal language theory. This theory was initiated around 196O-apart from some scattered work done earlier in connection with free groups-by M. P. Schutzenberger to whom also belong some of the main results. So far there is no book in existence concerning this theory. This lack has had the unfortunat作者: Heterodoxy 時(shí)間: 2025-3-28 10:31
Klaus J?nichcs requires that the person to be identified be physicallypresent at the point-of-identification and relies on `something whichyou are or you do‘ to provide better security, increased efficiency,and improved accuracy. Automated biometrics deals with physiologicalor behavioral characteristics such as作者: 小教堂 時(shí)間: 2025-3-28 17:28
Klaus J?nichdressed when higher performance and lower poweris desired. The first area is the device technology. Scaling ofdevices has realized steady improvements for many years. The secondarea is improved circuit design techniques. The final area is at thearchitectural level. This monograph focuses on the prob作者: 鋸齒狀 時(shí)間: 2025-3-28 21:12 作者: 小故事 時(shí)間: 2025-3-29 01:10 作者: 者變 時(shí)間: 2025-3-29 05:01 作者: 枯萎將要 時(shí)間: 2025-3-29 07:54
0172-6056 he integral theorems of Gauss, Stokes, and Green. Modern vector analysis distills these into the Cartan calculus and a general form of Stokes‘ theorem. This essentially modern text carefully develops vector analysis on manifolds and reinterprets it from the classical viewpoint (and with the classica作者: PATHY 時(shí)間: 2025-3-29 11:28
The Tangent Space,r-algebraic (easy) problems whenever possible. Recall that locally at ., the linear approximation of a map .: ?. → ?. is the .., ?. → ?. of . at .. The differential is characterized by ., where ., and given by the Jacobian matrix. But how can a differentiable map .: . → . between. . be characterized作者: 值得尊敬 時(shí)間: 2025-3-29 16:00
The Concept of Orientation,on is reversed: the differences Δ.. = ... ? .. in the Riemann sums Σ. (..)Δ.. are positive or negative according to whether the partition points are increasing or decreasing. The same thing happens with line integrals.where . is a curve in ?., and with contour integrals ... (.) . in complex function作者: 腐敗 時(shí)間: 2025-3-29 19:51 作者: 樹木中 時(shí)間: 2025-3-30 00:43 作者: Inculcate 時(shí)間: 2025-3-30 05:38
Textbook 20011st editionl theorems of Gauss, Stokes, and Green. Modern vector analysis distills these into the Cartan calculus and a general form of Stokes‘ theorem. This essentially modern text carefully develops vector analysis on manifolds and reinterprets it from the classical viewpoint (and with the classical notation作者: abduction 時(shí)間: 2025-3-30 10:29 作者: ventilate 時(shí)間: 2025-3-30 15:42 作者: rheumatism 時(shí)間: 2025-3-30 18:57
