全文获取类型
收费全文 | 975篇 |
免费 | 149篇 |
国内免费 | 33篇 |
专业分类
化学 | 48篇 |
晶体学 | 1篇 |
力学 | 24篇 |
综合类 | 19篇 |
数学 | 803篇 |
物理学 | 262篇 |
出版年
2024年 | 1篇 |
2023年 | 16篇 |
2022年 | 29篇 |
2021年 | 36篇 |
2020年 | 29篇 |
2019年 | 27篇 |
2018年 | 22篇 |
2017年 | 29篇 |
2016年 | 34篇 |
2015年 | 24篇 |
2014年 | 60篇 |
2013年 | 44篇 |
2012年 | 49篇 |
2011年 | 56篇 |
2010年 | 57篇 |
2009年 | 49篇 |
2008年 | 59篇 |
2007年 | 54篇 |
2006年 | 64篇 |
2005年 | 33篇 |
2004年 | 20篇 |
2003年 | 35篇 |
2002年 | 34篇 |
2001年 | 23篇 |
2000年 | 27篇 |
1999年 | 20篇 |
1998年 | 31篇 |
1997年 | 17篇 |
1996年 | 22篇 |
1995年 | 19篇 |
1994年 | 19篇 |
1993年 | 12篇 |
1992年 | 14篇 |
1991年 | 12篇 |
1990年 | 19篇 |
1989年 | 10篇 |
1988年 | 6篇 |
1987年 | 19篇 |
1986年 | 3篇 |
1985年 | 5篇 |
1984年 | 9篇 |
1983年 | 1篇 |
1982年 | 3篇 |
1978年 | 1篇 |
1975年 | 2篇 |
1973年 | 1篇 |
1968年 | 1篇 |
排序方式: 共有1157条查询结果,搜索用时 0 毫秒
31.
对"联邦滤波器信息分配系数的优选算法"一文的商榷 总被引:6,自引:0,他引:6
介绍了联邦滤波算法和信息分配原理,指出《中国惯性技术学报》第11卷第6期“联邦滤波器信息分配系数的优选算法”一中存在一些问题,说明使用该优选算法进行信息分配,可能使主滤波器方差阵失去正定性;将联邦滤波用于GPS姿态测量,实验表明动态选择信息分配因子,相对于固定信息分配因子的算法并没有明显优势。 相似文献
32.
In a secret sharing scheme, some participants can lie about the value of their shares when reconstructing the secret in order to obtain some illicit benefit. We present in this paper two methods to modify any linear secret sharing scheme in order to obtain schemes that are unconditionally secure against that kind of attack. The schemes obtained by the first method are robust, that is, cheaters are detected with high probability even if they know the value of the secret. The second method provides secure schemes, in which cheaters that do not know the secret are detected with high probability. When applied to ideal linear secret sharing schemes, our methods provide robust and secure schemes whose relation between the probability of cheating and the information rate is almost optimal. Besides, those methods make it possible to construct robust and secure schemes for any access structure. 相似文献
33.
Secret image sharing (SIS), as one of the applications of information theory in information security protection, has been widely used in many areas, such as blockchain, identity authentication and distributed cloud storage. In traditional secret image sharing schemes, noise-like shadows introduce difficulties into shadow management and increase the risk of attacks. Meaningful secret image sharing is thus proposed to solve these problems. Previous meaningful SIS schemes have employed steganography to hide shares into cover images, and their covers are always binary images. These schemes usually include pixel expansion and low visual quality shadows. To improve the shadow quality, we design a meaningful secret image sharing scheme with saliency detection. Saliency detection is used to determine the salient regions of cover images. In our proposed scheme, we improve the quality of salient regions that are sensitive to the human vision system. In this way, we obtain meaningful shadows with better visual quality. Experiment results and comparisons demonstrate the effectiveness of our proposed scheme. 相似文献
34.
R. Malhotra M. R. H. Mandjes W. R. W. Scheinhardt J. L. van den Berg 《Mathematical Methods of Operations Research》2009,70(1):149-169
Feedback fluid queues play an important role in modeling congestion control mechanisms for packet networks. In this paper
we present and analyze a fluid queue with a feedback-based traffic rate adaptation scheme which uses two thresholds. The higher
threshold B
1 is used to signal the beginning of congestion while the lower threshold B
2 signals the end of congestion. These two parameters together allow to make the trade-off between maximizing throughput performance
and minimizing delay. The difference between the two thresholds helps to control the amount of feedback signals sent to the
traffic source. In our model the input source can behave like either of two Markov fluid processes. The first applies as long
as the upper threshold B
1 has not been hit from below. As soon as that happens, the traffic source adapts and switches to the second process, until
B
2 (smaller than B
1) is hit from above. We analyze the model by setting up the Kolmogorov forward equations, then solving the corresponding balance
equations using a spectral expansion, and finally identifying sufficient constraints to solve for the unknowns in the solution.
In particular, our analysis yields expressions for the stationary distribution of the buffer occupancy, the buffer delay distribution,
and the throughput. 相似文献
35.
Quantum state sharing of an arbitrary qudit state by using nonmaximally generalized GHZ state 下载免费PDF全文
We present a scheme for quantum state sharing of an arbitrary qudit state by using nonmaximally entangled generalized Greenberger-Horne-Zeilinger (GHZ) states as the quantum channel and generalized Bell-basis states as the joint measurement basis. We show that the probability of successful sharing an unknown qudit state depends on the joint measurements chosen by Alice. We also give an expression for the maximally probability of this scheme. 相似文献
36.
Two random traffic streams are competing for the service time of a single server (multiplexer). The streams form two queues, primary (queue 1) and secondary (queue 0). The primary queue is served exhaustively, after which the server switches over to queue 0. The duration of time the server resides in the secondary queue is determined by the dynamic evolution in queue 1. If there is an arrival to queue 1 while the server is still working in queue 0, the latter is immediately gated, and the server completes service there only to the gated jobs, upon which it switches back to the primary queue. We formulate this system as a two-queue polling model with a single alternating server and with randomly-timed gated (RTG) service discipline in queue 0, where the timer there depends on the arrival stream to the primary queue. We derive Laplace–Stieltjes transforms and generating functions for various key variables and calculate numerous performance measures such as mean queue sizes at polling instants and at an arbitrary moment, mean busy period duration and mean cycle time length, expected number of messages transmitted during a busy period and mean waiting times. Finally, we present graphs of numerical results comparing the mean waiting times in the two queues as functions of the relative loads, showing the effect of the RTG regime. 相似文献
37.
We consider an M/M/1 queue with a time dependent arrival rate (t) and service rate (t). For a special form of the traffic intensity, we obtain an exact, explicit expression for the probability p
n
(t) that there are n customers at time t. If the service rate is constant (=), this corresponds to (t)=(t)/=(b–at)–2. We also discuss the heavy traffic diffusion approximation to this model. We evaluate our results numerically. 相似文献
38.
Threshold Visual Cryptography Schemes with Specified Whiteness Levels of Reconstructed Pixels 总被引:6,自引:0,他引:6
In 1994, Naor and Shamir introduced an unconditionally secure method for encoding black and white images. This method, known as a threshold visual cryptography scheme (VCS), has the benefit of requiring no cryptographic computation on the part of the decoders. In a
-VCS, a share, in the form of a transparency, is given to ">n users. Any ">k users can recover the secret simply by stacking transparencies, but ">k-1 users can gain no information about the secret whatsoever.In this paper, we first explore the issue of contrast, by demonstrating that the current definitions are inadequate, and by providing an alternative definition. This new definition motivates an examination of minimizing pixel expansion subject to fixing the VCS parameters ">h and ">l. New bounds on pixel expansion are introduced, and connections between these bounds are examined. The best bound presented is tighter than any previous bound. An analysis of connections between (2, ">n) schemes and designs such as BIBD's, PBD's, and (">r, )-designs is performed. Also, an integer linear program is provided whose solution exactly determines the minimum pixel expansion of a (2, ">n)-VCS with specified ">h and >l. 相似文献
39.
本文提出了共享与分布式存储计算机上任意长—维DFT的MIMD并行算法,若N=O(p,q),则算法需要次算术运算。其中,P与N可为任意自然数,分别表示处理机台数与DFT长度.本文算法具有很高的并行效率. 相似文献
40.