全文获取类型
收费全文 | 1812篇 |
免费 | 411篇 |
国内免费 | 153篇 |
专业分类
化学 | 334篇 |
晶体学 | 4篇 |
力学 | 53篇 |
综合类 | 169篇 |
数学 | 761篇 |
物理学 | 1055篇 |
出版年
2024年 | 3篇 |
2023年 | 26篇 |
2022年 | 54篇 |
2021年 | 45篇 |
2020年 | 51篇 |
2019年 | 62篇 |
2018年 | 45篇 |
2017年 | 47篇 |
2016年 | 64篇 |
2015年 | 51篇 |
2014年 | 102篇 |
2013年 | 106篇 |
2012年 | 87篇 |
2011年 | 105篇 |
2010年 | 100篇 |
2009年 | 129篇 |
2008年 | 125篇 |
2007年 | 120篇 |
2006年 | 113篇 |
2005年 | 93篇 |
2004年 | 69篇 |
2003年 | 85篇 |
2002年 | 77篇 |
2001年 | 56篇 |
2000年 | 52篇 |
1999年 | 94篇 |
1998年 | 83篇 |
1997年 | 36篇 |
1996年 | 37篇 |
1995年 | 53篇 |
1994年 | 29篇 |
1993年 | 34篇 |
1992年 | 23篇 |
1991年 | 11篇 |
1990年 | 17篇 |
1989年 | 21篇 |
1988年 | 11篇 |
1987年 | 16篇 |
1986年 | 9篇 |
1985年 | 9篇 |
1984年 | 6篇 |
1983年 | 8篇 |
1982年 | 2篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1973年 | 1篇 |
1972年 | 1篇 |
排序方式: 共有2376条查询结果,搜索用时 31 毫秒
931.
932.
We experimentally and theoretically demonstrate 40 Gb/s all-optical logic NOR and OR gates based on a semiconductor optical amplifier (SOA) and a blue shifted optical bandpass filter (OBF). Two kinds of data formats are discussed, namely return-to-zero (RZ) format and nonreturn-to-zero (NRZ) format. The logic NOR and OR functions of RZ format are realized at the OBF detuning of −0.22 nm and −0.44 nm, respectively. The logic NOR function of NRZ format is realized at the OBF detuning of −0.24 nm. The simulation is in good agreement with the experimental results when the linewidth enhancement factor is 5.5. The simulation also shows that the SOA with large linewidth enhancement factor is preferred to achieve NOR and OR functions with good performance. The input data signal is of good pulsewidth-tolerance for NOR function, whereas not for OR function. The high Q factor could be obtained at narrow pulses injection. 相似文献
933.
C.S. Sobrinho J.W.M. Menezes W.B. Fraga A.F.G.F. Filho H.H.B. Rocha K.D.A. Sabóia 《Optics Communications》2008,281(5):1056-1064
In this paper we propose the operation of an all-optical logical gate based in a symmetric nonlinear directional coupler (NLDC) operating with a pulse position modulation (PPM). The performance of a symmetric NLDC realizing two-input AND/OR logical functions, which can be applied in transmission and processing of signals in all-optical form in TDM systems, is examined. This integrated symmetric NLDC logical gate operates with two ultrashort soliton light pulses (2 ps), which are modulated in agreement with the technique of pulse position modulation (PPM). Initially, we evaluate the effect resulting of an increment in the PPM coding parameter offset (ε), for the temporal position of the output pulse, considering the anomalous group-velocity dispersion (GVD), nonlinear self phase modulation (SPM) and without loss propagation regime of input pulses, in the cores 1 and 2 of the NLDC. In this situation, we analyze the four possible situations for the two-input logical gate, modulating the 1 and 2 input pulses through temporal displacement and allowing a variation in the coding parameter offset. We can conclude that is possible to get AND/OR logical operations for the cores 1 or 2, without to insert PPM error, since a phase control (Δ?) exists applied in agreement with the logical level of the input pulse in the core 1. Finally we define the truth table, considering the adequate phase difference and coding parameter offset for the stable operation of the AND/OR logical gate based in the symmetric NLDC. 相似文献
934.
Graciela Domenech Hector Freytes Christian de Ronde 《International Journal of Theoretical Physics》2008,47(1):168-174
Kochen–Specker theorem rules out the non-contextual assignment of values to physical magnitudes. Here we enrich the usual
orthomodular structure of quantum mechanical propositions with modal operators. This enlargement allows to refer consistently
to actual and possible properties of the system. By means of a topological argument, more precisely in terms of the existence
of sections of sheaves, we give an extended version of Kochen–Specker theorem over this new structure. This allows us to prove
that contextuality remains a central feature even in the enriched propositional system.
Graciela Domenech is a fellow of the Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET). Hector Freytes
is a fellow of the Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET). 相似文献
935.
936.
本文报道了由七种长链季铵盐制得的高氯酸根离子选择电极,测定了这些电极的Nernst响应范围和检测下限,并研究了各种阴离子的干扰。通过大量实验测得,随着季铵盐分子中取代烷基碳链的增长,电极电势响应范围增宽、检测下限降低、抗外部阴离子干扰能力增强。若取代烷基碳链过长,则季铵盐纯化困难,在膜相中溶解度降低,不适于电极的研制。根据用上述七种选择电极在相同水相条件下测得的数据表明,阴离子的干扰次序为:PA~->ClO_4~->BF_4~->SCN~->I~->ClO_3~->N_3~->N_3~->CN~-~Br~->H_2PO_4~->F~->Cl~-。这些数据对阴离子选择电极研制与相转移催化反应研究均有现实意义。 相似文献
937.
Yutaka Miyazaki 《Mathematical Logic Quarterly》2001,47(3):341-362
We present here a Kripke‐style semantics for propositional orthomodular logics that is based on the representation theorem for orthomodular lattices by D.J. Foulis ([2]), in which a sort of semigroups is employed. This semantics can characterize the logics above the orthomodular logic by some elementary conditions. 相似文献
938.
Each information system (or data table) leads to a hierarchy of binary relations on the object set in a natural way; these relational systems can serve as frames for the semantics of modal logics. While relations of indiscernibility and their logics have been frequently studied, the situation in the case of relations which distinguish objects is much less clear. In this paper, we present complete logical systems for relations of complementarity derived from information systems. 相似文献
939.
Vladimir V. Rybakov Mehmet Terziler Vitaliy Remazki 《Mathematical Logic Quarterly》2000,46(2):207-218
We study the problem of finding a basis for all rules admissible in the intuitionistic propositional logic IPC. The main result is Theorem 3.1 which gives a basis consisting of all rules in semi‐reduced form satisfying certain specific additional requirements. Using developed technique we also find a basis for rules admissible in the logic of excluded middle law KC. 相似文献
940.
In this paper we prove a bounded translation of intuitionistic propositional logic into basic propositional logic. Our new theorem, compared with the translation theorem in [1], has the advantage that it gives an effective bound on the translation, depending on the complexity of formulas. 相似文献