標題: Titlebook: High-Latitude Space Plasma Physics; Bengt Hultqvist,Tor Hagfors Book 1983 Springer Science+Business Media New York 1983 Plasma.earth.plane [打印本頁] 作者: CRUST 時間: 2025-3-21 19:10
書目名稱High-Latitude Space Plasma Physics影響因子(影響力)
書目名稱High-Latitude Space Plasma Physics影響因子(影響力)學(xué)科排名
書目名稱High-Latitude Space Plasma Physics網(wǎng)絡(luò)公開度
書目名稱High-Latitude Space Plasma Physics網(wǎng)絡(luò)公開度學(xué)科排名
書目名稱High-Latitude Space Plasma Physics被引頻次
書目名稱High-Latitude Space Plasma Physics被引頻次學(xué)科排名
書目名稱High-Latitude Space Plasma Physics年度引用
書目名稱High-Latitude Space Plasma Physics年度引用學(xué)科排名
書目名稱High-Latitude Space Plasma Physics讀者反饋
書目名稱High-Latitude Space Plasma Physics讀者反饋學(xué)科排名
作者: onlooker 時間: 2025-3-21 20:33 作者: thrombus 時間: 2025-3-22 01:52
The Role of the Auroral Ionosphere in Magnetospheric Substormsects such as the strengthening of electrojets and the motion and intensification of auroral forms were central elements in the development of the concept of the substorm (see, e.g., Akasofu, 1968). The purpose of this paper is not to discuss the obvious ionospheric manifestations of a substorm. Inst作者: 不公開 時間: 2025-3-22 06:04
Characteristics of the Polar Cap at Ionospheric Levels and Present Understanding of the Physical Proents between various authors concerning these systems is given. In particular is attention focused on the relationship between the interplanetary magnetic field and the various current systems proposed. A short presentation is also given of the various techniques used in deriving the polar cap E-fie作者: Firefly 時間: 2025-3-22 08:56
The Low Altitude Cleft: Plasma Entry and Magnetospheric Topologyr the confirmation of “relatively uninhibited access” of magnetosheath plasma to the earth’s magnetosphere, in a region referred to as the polar cusp, we can pose the following question. Have we advanced our knowledge of the detailed access mechanism and place of entry of solar wind plasma into the 作者: 才能 時間: 2025-3-22 14:03
Incoherent-Scatter Radar Measurements of Electric Field and Plasma in the Auroral Ionosphererties of the auroral-zone ionosphere. This paper summarizes Chatanika radar measurements of electric fields and currents, and their relation to E-region ionization and conductivity. Several outstanding questions are discussed that pertain to electric-field coupling between the ionosphere and magneto作者: 同步信息 時間: 2025-3-22 19:39 作者: 木訥 時間: 2025-3-23 00:02 作者: 犬儒主義者 時間: 2025-3-23 05:10 作者: Postmenopause 時間: 2025-3-23 06:32
Dependence of the High-Latitude Ionospheric Fields and Plasma Characteristics on the Properties of ty (1961), the interplanetary magnetic field (IMF) modulated the transfer of energy from the solar wind to the magnetosphere. In particular, it was evident that the transfer function for the solar-terrestrial interaction was dependent on the direction of the IMF with respect to magnetopause field lin作者: 不愿 時間: 2025-3-23 11:43
Solar Wind-Magnetosphere Energy Coupling shown that the energy coupling function ε and the three-dimensional current distribution derived from the IMS Alaska meridian chain data have provided a new insight into the entire energy transfer chain process from the magnetopause to the ionosphere. A number of suggestions are made for better und作者: 解決 時間: 2025-3-23 16:33 作者: 周年紀念日 時間: 2025-3-23 18:32
Cold Plasma Distribution Above a Few Thousand Kilometers at High Latitudesvailable before. The unique combination of coplanar orbits which simultaneously sample the low altitude ionospheric and atmospheric signatures (DE-2) and the high altitude phenomena of the inner magnetosphere (DE-1) furnishes new measurements of the coupling of plasmas and fields between these funda作者: Stricture 時間: 2025-3-23 23:31
The Hot Ion Composition, Energy, and Pitch Angle Characteristics Above the Auroral Zone Ionospheree auroral acceleration regions although some inferences about the gross characteristics of the ion source regions were possible from observations of precipitating hot 0. ions (Johnson et al., 1975). The initial, and still the most comprehensive, ion composition measurements in and above the auroral 作者: frenzy 時間: 2025-3-24 05:21
The Hot Electrons in and Above the Auroral Ionosphere: Observations and Physical Implicationstion. The mystery is nowhere more intriguing than where it surrounds the electrons that are the prime cause of the excitation. There is now widespread agreement that photon emission is controlled directly by the energy flux carried by electrons into the atmosphere (Omholt, 1959; Bryant et al., 1970;作者: 背景 時間: 2025-3-24 07:25 作者: 機密 時間: 2025-3-24 13:42
High Latitude Electromagnetic Plasma Wave Emissions with auroras. As long ago as 1933, Burton and Boardman (1933) detected bursts of very-low-frequency (VLF) “static” at high latitudes that occurred simultaneously with flashes of auroral light. Later a variety of investigations using ground VLF radio receivers at high latitudes firmly established th作者: GRIEF 時間: 2025-3-24 16:40
pproximation, shape preserving, and localization properties. Section 2 contains some preliminaries on the Choquet integral. In Sect. 3, we obtain quantitative estimates in uniform and pointwise approximation for the following mixed type operators: max-product Bernstein–Kantorovich–Choquet operator, 作者: 喃喃而言 時間: 2025-3-24 22:34
T. Hagforsper half-plane is considered, as well as related Hilbert spaces of entire functions. Both the Hardy space and the spaces of entire functions admit dissipative imaginary shifts. The dissipative property implies that the weight function has an analytic extension to a half-plane which contains the uppe作者: adulterant 時間: 2025-3-25 01:59
Kerstin Fredgahms for these problems in terms of the amount of locality in the input sequence. We define a measure for locality that is based on Denning’s working set model and express the performance of well known algorithms in term of this parameter. This introduces parameterized-style analysis to online algori作者: Encapsulate 時間: 2025-3-25 06:26 作者: Epidural-Space 時間: 2025-3-25 10:58 作者: 溫順 時間: 2025-3-25 12:18 作者: HIKE 時間: 2025-3-25 19:19 作者: 大方不好 時間: 2025-3-25 20:34
James F. Vickrey,Michael C. Kelleyy applications this resource is shared or its usage involves a cost. In this work we introduce the Minimum Cache Usage problem, which is an extension to the classic paging problem that accounts for the efficient use of cache resources by paging algorithms. In this problem, the cost of a paging algor作者: parsimony 時間: 2025-3-26 03:00
R. A. Greenwaldsack problem) in which an upper bound . is imposed on the number of items selected. This problem is of fundamental importance and is known to have a broad range of applications in various fields. It is well known that, there is no . (FPTAS) for the .-dimensional knapsack problem when ., unless P . N作者: kidney 時間: 2025-3-26 05:34 作者: ASSAY 時間: 2025-3-26 10:02
Maha Ashour-Abdalla,Hideo Okudat two of the computers in a given network arranged as a two-dimensional grid structure want to communicate. The central authority can then, for every request, either grant it by establishing one of the possible connections in the grid, or reject the request. Thereby, the requests have to be answered作者: humectant 時間: 2025-3-26 14:20
Gordon Rostokerbut also a positive weight. The cost of a bin is 1, and this cost is shared among the items being in the bin, proportionally to their weights. A packing is a Nash equilibrium (NE) if no item can decrease its cost by moving to another bin, and OPT means a packing where the items are packed optimally 作者: 大笑 時間: 2025-3-26 17:31
S.-I. Akasofubut also a positive weight. The cost of a bin is 1, and this cost is shared among the items being in the bin, proportionally to their weights. A packing is a Nash equilibrium (NE) if no item can decrease its cost by moving to another bin, and OPT means a packing where the items are packed optimally 作者: 吵鬧 時間: 2025-3-26 22:26
Stanley W. H. Cowleyinput is an undirected graph . and ordered pairs (..,..), where .?∈?{1,2,…,.}. The goal is to find an orientation of . that minimizes the sum over every .?∈?{1,2,…,.} of the distance from .. to ....In the . the input is the same, however the goal is to find for every .?∈?{1,2,…,.} a path between .. 作者: MOT 時間: 2025-3-27 03:42
Charles R. Chappellonsecutively processed items generates cost. A reordering buffer of capacity . items can be used to preprocess the input sequence in order to decrease the number of color changes. The goal is to find a scheduling strategy that, using the reordering buffer, minimizes the number of color changes in th作者: Melatonin 時間: 2025-3-27 05:33 作者: 繁殖 時間: 2025-3-27 13:25
Duncan A. Bryantrequests. Our algorithm will batch the requests into . groups where the . group contains requests .. To process the requests of group ., our algorithm will place the . servers at the .-median centers of the first . requests. When a new request of this group arrives, the algorithm will simply assign 作者: bacteria 時間: 2025-3-27 16:51
H. Balsiger of competitive algorithms for dynamic problems, where objects can also depart from the instance. In this work, we give a general framework to obtain so called robust online algorithms for a variety of dynamic problems: these online algorithms achieve an asymptotic competitive ratio of . with migrat作者: Panacea 時間: 2025-3-27 20:37
T. A. Potemrapoints in the Euclidean space. In order to reduce communication costs, the positions of the servers can be adapted by a limited distance . per round for each server. The costs are measured similar to the classical Page Migration Problem, i.e., answering a request induces costs proportional to the di作者: 制定法律 時間: 2025-3-27 22:39
Donald A. Gurnett set cover. For min-sum set cover, Feige, Lovàsz and Tetali [.] showed that the greedy algorithm has an approximation guarantee of 4, and obtaining a better approximation ratio is NP-hard. For precedence-constrained min-sum set cover, McClintock, Mestre and Wirth [.] proposed an .-approximation algo作者: periodontitis 時間: 2025-3-28 03:53 作者: 是剝皮 時間: 2025-3-28 09:33 作者: FER 時間: 2025-3-28 10:48
The Hot Ion Composition, Energy, and Pitch Angle Characteristics Above the Auroral Zone Ionosphere. The ISEE-1 spacecraft, launched in October, 1977, has recently been providing ion composition data at a few R. in the auroral regions as a result of its gradual increase in orbital inclination (to 55° latitude in June, 1981) (Sharp et al., 1982b). Some ion composition measurements have also been m作者: venous-leak 時間: 2025-3-28 16:51
The Hot Electrons in and Above the Auroral Ionosphere: Observations and Physical Implicationsuch as auroral arcs and the more irregular and variable structures that occur during auroral breakup. In view of its overriding importance, the present discussion will concentrate on this issue, even though other important areas such as the electrons that produce pulsating aurora will remain untouch作者: Mingle 時間: 2025-3-28 19:47 作者: 永久 時間: 2025-3-29 01:38
High Latitude Electromagnetic Plasma Wave Emissionsthe whistler mode. The first satellite investigation of auroral hiss was reported by Gurnett (1966) who showed that auroral hiss is closely correlated with intense fluxes of precipitating auroral electrons. This relationship was subsequently confirmed and refined by a number of low-altitude satellit作者: 狗窩 時間: 2025-3-29 03:26
t operators, which approximate uniformly . in each compact subinterval of [0, +.) with the order ., where . arbitrary fast. Also, shape preserving and localization results for max-product Bernstein–Kantorovich–Choquet operators are obtained. Section 4 contains quantitative approximation results for 作者: landmark 時間: 2025-3-29 10:22 作者: amnesia 時間: 2025-3-29 15:23
Kerstin Fredgaads to a better performance. We obtain similar separation for list update algorithms. Lastly, we show that, surprisingly, certain randomized algorithms which are superior to MTF in the classical model are not so in the parameterized case, which matches experimental results.作者: Estimable 時間: 2025-3-29 16:33
R. A. Wolf,R. W. Spiro can be .(1?+?.)-approximated..We demonstrate the applicability of our approach on two classes of integer programs, namely, totally unimodular integer programs and integer programs with two variables per inequality. Further, for combinatorial optimization problems our method yields polynomial time a作者: 憲法沒有 時間: 2025-3-29 23:30
Asgeir Brekkeonic number), we show that for every .>?0 there is a polynomial time .-approximation algorithm for our problem. Our analysis of the greedy algorithm shows that when applied to covering a bipartite graph using copies of . . bicliques, it returns a feasible solution whose cost is at most . where . den作者: 我正派 時間: 2025-3-30 01:10 作者: 有偏見 時間: 2025-3-30 04:59
Richard Vondrakow a lower bound of 1.20 on the competitive ratio of any deterministic algorithm..We extend our techniques and analyze the competitive ratio of greedy with respect to the ?. norm. We show that the greedy algorithm performs within at most 2-Ω(1/.) of the optimum. We also show a lower bound of 2???.(l作者: 機密 時間: 2025-3-30 11:58 作者: 他去就結(jié)束 時間: 2025-3-30 13:28 作者: 省略 時間: 2025-3-30 17:25 作者: disciplined 時間: 2025-3-30 23:22
Maha Ashour-Abdalla,Hideo Okudam..Our results show that, without additional information, the central authority cannot perform satisfactorily well, and we establish a lower bound linear in |.| for the number of advice bits needed for near-optimal solutions, where |.| denotes the number of edges in the grid. Furthermore, concerning作者: CARK 時間: 2025-3-31 01:27 作者: 過份艷麗 時間: 2025-3-31 06:15 作者: JOT 時間: 2025-3-31 11:05
Stanley W. H. Cowleysum 2-paths orientation problem to the min-sum 2 edge-disjoint paths problem. The implications of this reduction are: (i) an .-hardness proof for the min-sum 2-paths orientation problem yields an .-hardness proof for the min-sum 2 edge-disjoint paths problem, and (ii) any approximation algorithm for作者: Hypopnea 時間: 2025-3-31 17:22 作者: NOCT 時間: 2025-3-31 19:46
R. G. Johnsone use of our algorithm on two examples from the literature. The first shows how to make the speedup of the .-median on a line problem in an online settings. The second shows how to improve the running time for a DP used to reduce the amount of bandwidth needed when paging mobile wireless users.作者: 煩躁的女人 時間: 2025-4-1 00:18
Duncan A. Bryantimized when servers are located at the .-median of the requests that have not yet arrived (unprocessed requests). But our algorithm instead uses the .-median of the requests seen so far as a proxy. Using existing analysis techniques, we obtain only a large bound on the difference between .-median of作者: bile648 時間: 2025-4-1 05:17 作者: 怎樣才咆哮 時間: 2025-4-1 06:47
T. A. Potemraemand ., i.e., that consecutive requests come from points in the Euclidean space with distance bounded by some constant .. We show constant lower bounds on the competitiveness in this setting (independent of ., but dependent on ., . and .)..On the positive side, we present a deterministic online alg
