首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   11篇
  免费   0篇
化学   3篇
力学   1篇
数学   4篇
物理学   3篇
  2021年   2篇
  2015年   1篇
  2013年   1篇
  2012年   3篇
  2011年   1篇
  2006年   1篇
  2005年   1篇
  2002年   1篇
排序方式: 共有11条查询结果,搜索用时 31 毫秒
1.
Transport in Porous Media - To improve the understanding of gas transport processes in tight rocks (e.g., shales), systematic flow tests with different gases were conducted on artificial micro- to...  相似文献   
2.
Suppose that Alice and Bob make local two-outcome measurements on a shared entangled quantum state. We show that, for all positive integers d, there exist correlations that can only be reproduced if the local Hilbert-space dimension is at least d. This establishes that the amount of entanglement required to maximally violate a Bell inequality must depend on the number of measurement settings, not just the number of measurement outcomes. We prove this result by establishing a lower bound on a new generalization of Grothendieck’s constant.  相似文献   
3.
We study the problem of monotonicity testing over the hypercube. As previously observed in several works, a positive answer to a natural question about routing properties of the hypercube network would imply the existence of efficient monotonicity testers. In particular, if any set of source-sink pairs on the directed hypercube (with all sources and all sinks distinct) can be connected with edge-disjoint paths, then monotonicity of functions $f:\{ 0,1\} ^n \to \mathcal{R}$ can be tested with O(n/∈) queries, for any totally ordered range $\mathcal{R}$ . More generally, if at least a µ(n) fraction of the pairs can always be connected with edge-disjoint paths then the query complexity is O(n/(µ(n))). We construct a family of instances of Ω(2 n ) pairs in n-dimensional hypercubes such that no more than roughly a $\frac{1} {{\sqrt n }}$ fraction of the pairs can be simultaneously connected with edge-disjoint paths. This answers an open question of Lehman and Ron [16], and suggests that the aforementioned appealing combinatorial approach for deriving query-complexity upper bounds from routing properties cannot yield, by itself, query-complexity bounds better than ≈ n 3/2. Additionally, our construction can also be used to obtain a strong counterexample to Szymanski’s conjecture about routing on the hypercube. In particular, we show that for any δ > 0, the n-dimensional hypercube is not $n^{\tfrac{1} {2} - \delta }$ -realizable with shortest paths, while previously it was only known that hypercubes are not 1-realizable with shortest paths. We also prove a lower bound of Ω(n/∈) queries for one-sided non-adaptive testing of monotonicity over the n-dimensional hypercube, as well as additional bounds for specific classes of functions and testers.  相似文献   
4.
We prove that the Banach algebra formed by the space of compact operators on a Hilbert space endowed with the Schur product is a quotient of a uniform algebra (also known as a Q-algebra). Together with a similar result of Pérez-García for the trace class, this completes the answer to a long-standing question of Varopoulos.  相似文献   
5.
Sequential selection has been solved in linear time by Blum et al. [M.B. Blum, R.W. Floyd, V.R. Pratt, R.L. Rivest, R.E. Tarjan, Time bounds for selection, J. Comput. System Sci. 7 (4) (1972) 448–461]. Running this algorithm on a problem of size N with N>M, the size of the main-memory, results in an algorithm that reads and writes O(N) elements, while the number of comparisons is also bounded by O(N). This is asymptotically optimal, but the constants are so large that in practice sorting is faster for most values of M and N.This paper provides the first detailed study of the external selection problem. A randomized algorithm of a conventional type is close to optimal in all respects. Our deterministic algorithm is more or less the same, but first the algorithm builds an index structure of all the elements. This effort is not wasted: the index structure allows the retrieval of elements so that we do not need a second scan through all the data. This index structure can also be used for repeated selections, and can be extended over time. For a problem of size N, the deterministic algorithm reads N+o(N) elements and writes only o(N) elements and is thereby optimal to within lower-order terms.  相似文献   
6.
The study of quantum-mechanical violations of Bell inequalities is motivated by the investigation, and the eventual demonstration, of the nonlocal properties of entanglement. In recent years, Bell inequalities have found a fruitful re-formulation using the language of multiplayer games originating from Computer Science. This paper studies the nonlocal properties of entanglement in the context of the simplest such games, called XOR games. When there are two players, it is well known that the maximum bias—the advantage over random play—of players using entanglement can be at most a constant times greater than that of classical players. Recently, Pérez-García et al. (Commun. Mathe. Phys. 279:455, 2008) showed that no such bound holds when there are three or more players: the use of entanglement can provide an unbounded advantage, and scale with the number of questions in the game. Their proof relies on non-trivial results from operator space theory, and gives a non-explicit existence proof, leading to a game with a very large number of questions and only a loose control over the local dimension of the players’ shared entanglement. We give a new, simple and explicit (though still probabilistic) construction of a family of three-player XOR games which achieve a large quantum-classical gap (QC-gap). This QC-gap is exponentially larger than the one given by Pérez-García et. al. in terms of the size of the game, achieving a QC-gap of order ${\sqrt{N}}$ with N 2 questions per player. In terms of the dimension of the entangled state required, we achieve the same (optimal) QC-gap of ${\sqrt{N}}$ for a state of local dimension N per player. Moreover, the optimal entangled strategy is very simple, involving observables defined by tensor products of the Pauli matrices. Additionally, we give the first upper bound on the maximal QC-gap in terms of the number of questions per player, showing that our construction is only quadratically off in that respect. Our results rely on probabilistic estimates on the norm of random matrices and higher-order tensors which may be of independent interest.  相似文献   
7.
In this study we have explored the potential of PUVB (8-MOP + UVB) therapy for the reduction of luminal narrowing after arterial injury. In 15 rabbits, balloon dilation of iliac arteries was performed. In 20 arteries, dilation was combined with the delivery of pulsed ultraviolet light B (UVB) irradiation with 10 arteries being previously subjected to sensitizer infusion. Changes in vessel diameter, proliferation and extracellular matrix protein content at 6 weeks were evaluated by means of angiography and histomorphometry-immunohistochemistry. We found that PUVB, applied at the time of dilation, induced reduction in late loss (LL) at 6 weeks (percutaneous transluminal angioplasty vs UVB vs PUVB: 0.64 +/- 0.15 mm vs 0.61 +/- 0.05 mm vs 0.29 +/- 0.05 mm; p = 0.018). The same holds true for constrictive remodeling (0.53 +/- 0.15 mm vs 0.45 +/- 0.06 mm vs 0.15 +/- 0.05 mm; p = 0.016). In the irradiation groups, LL was independent of acute gain (AG), as opposed to the control. Collagen content increased significantly after PUVB in media and adventitia, without increased cellular proliferation in all vessel layers. Thus, PUVB at the time of dilation reduced luminal narrowing at follow-up without effecting proliferation. This effect was independent of AG and was associated with increased collagen content in media and adventitia.  相似文献   
8.
Using confocal microscopy, we study the flow of a model soft glassy material: a concentrated emulsion. We demonstrate the micro-macro link between in situ measured movements of droplets during the flow and the macroscopic rheological response of a concentrated emulsion, in the form of scaling relationships connecting the rheological "fluidity" with local standard deviation of the strain-rate tensor. Furthermore, we measure correlations between these local fluctuations, thereby extracting a correlation length which increases while approaching the yielding transition, in accordance with recent theoretical predictions.  相似文献   
9.
10.
Caraway (Carum carvi L.) essential oil is a candidate for botanical herbicides. A hypothesis was formulated that the sand-applied maltodextrin-coated caraway oil (MCEO) does not affect the growth of maize (Zea mays L.). In the pot experiment, pre-emergence application of five doses of MCEO was tested on four maize cultivars up to the three-leaf growth stage. The morphological analyses were supported by the measurements of relative chlorophyll content (SPAD), two parameters of chlorophyll a fluorescence, e.g., Fv/Fm and Fv/F0, and fluorescence emission spectra. The analyzed MCEO contained 6.5% caraway EO with carvone and limonene as the main compounds, constituting 95% of the oil. The MCEO caused 7-day delays in maize emergence from the dose of 0.9 g per pot (equal to 96 g m−2). Maize development at the three-leaf growth stage, i.e., length of roots, length of leaves, and biomass of shoots and leaves, was significantly impaired already at the lowest dose of MCEO: 0.4 g per pot, equal to 44 g m−2. A significant drop of both chlorophyll a fluorescence parameters was noted, on average, from the dose of 0.7 g per pot, equal to 69 g m−2. Among the tested cultivars, cv. Rywal and Pomerania were less susceptible to the MCEO compared to the cv. Kurant and Podole. In summary, maize is susceptible to the pre-emergence, sand-applied MCEO from the dose of 44 g m−2.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号