全文获取类型
收费全文 | 19113篇 |
免费 | 2540篇 |
国内免费 | 575篇 |
专业分类
化学 | 1659篇 |
晶体学 | 66篇 |
力学 | 407篇 |
综合类 | 222篇 |
数学 | 2676篇 |
物理学 | 3746篇 |
无线电 | 13452篇 |
出版年
2024年 | 38篇 |
2023年 | 188篇 |
2022年 | 425篇 |
2021年 | 672篇 |
2020年 | 654篇 |
2019年 | 467篇 |
2018年 | 454篇 |
2017年 | 736篇 |
2016年 | 861篇 |
2015年 | 919篇 |
2014年 | 1560篇 |
2013年 | 1535篇 |
2012年 | 1433篇 |
2011年 | 1437篇 |
2010年 | 1004篇 |
2009年 | 951篇 |
2008年 | 1107篇 |
2007年 | 1175篇 |
2006年 | 987篇 |
2005年 | 916篇 |
2004年 | 814篇 |
2003年 | 698篇 |
2002年 | 510篇 |
2001年 | 457篇 |
2000年 | 383篇 |
1999年 | 301篇 |
1998年 | 268篇 |
1997年 | 197篇 |
1996年 | 212篇 |
1995年 | 190篇 |
1994年 | 122篇 |
1993年 | 105篇 |
1992年 | 84篇 |
1991年 | 70篇 |
1990年 | 42篇 |
1989年 | 43篇 |
1988年 | 30篇 |
1987年 | 25篇 |
1986年 | 22篇 |
1985年 | 24篇 |
1984年 | 34篇 |
1983年 | 12篇 |
1982年 | 14篇 |
1981年 | 12篇 |
1980年 | 9篇 |
1979年 | 7篇 |
1978年 | 6篇 |
1977年 | 4篇 |
1976年 | 4篇 |
1973年 | 4篇 |
排序方式: 共有10000条查询结果,搜索用时 390 毫秒
1.
An efficient edge based data structure has been developed in order to implement an unstructured vertex based finite volume algorithm for the Reynolds-averaged Navier–Stokes equations on hybrid meshes. In the present approach, the data structure is tailored to meet the requirements of the vertex based algorithm by considering data access patterns and cache efficiency. The required data are packed and allocated in a way that they are close to each other in the physical memory. Therefore, the proposed data structure increases cache performance and improves computation time. As a result, the explicit flow solver indicates a significant speed up compared to other open-source solvers in terms of CPU time. A fully implicit version has also been implemented based on the PETSc library in order to improve the robustness of the algorithm. The resulting algebraic equations due to the compressible Navier–Stokes and the one equation Spalart–Allmaras turbulence equations are solved in a monolithic manner using the restricted additive Schwarz preconditioner combined with the FGMRES Krylov subspace algorithm. In order to further improve the computational accuracy, the multiscale metric based anisotropic mesh refinement library PyAMG is used for mesh adaptation. The numerical algorithm is validated for the classical benchmark problems such as the transonic turbulent flow around a supercritical RAE2822 airfoil and DLR-F6 wing-body-nacelle-pylon configuration. The efficiency of the data structure is demonstrated by achieving up to an order of magnitude speed up in CPU times. 相似文献
2.
The ways in which environmental priorities are framed are varied and influenced by political forces. One technological advance--the proliferation of government open data portals (ODPs)--has the potential to improve governance through facilitating access to data. Yet it is also known that the data hosted on ODPs may simply reflect the goals and interests of multiple levels of political power. In this article, I use traditional statistical correlation and regression techniques along with newer natural language processing and machine learning algorithms to analyze the corpus of datasets hosted on government ODPs (total: 49,066) to extract patterns that relate scales of governance and political liberalism/conservatism to the priorities and meaning attached to environmental issues. I find that state-level and municipal-level ODPs host different categories of environmental datasets, with municipal-level ODPs generally hosting more datasets pertaining to services and amenities and state-level ODPs hosting more datasets pertaining to resource protection and extraction. Stronger trends were observed for the influences of political conservatism/liberalism among state-level ODPs than for municipal-level ODPs. 相似文献
3.
4.
By leveraging the secret data coding using the remainder storage based exploiting modification direction (RSBEMD), and the pixel change operation recording based on multi-segment left and right histogram shifting, a novel reversible data hiding (RHD) scheme is proposed in this paper. The secret data are first encoded by some specific pixel change operations to the pixels in groups. After that, multi-segment left and right histogram shifting based on threshold manipulation is implemented for recording the pixel change operations. Furthermore, a multiple embedding policy based on chess board prediction (CBP) and threshold manipulation is put forward, and the threshold can be adjusted to achieve adaptive data hiding. Experimental results and analysis show that it is reversible and can achieve good performance in capacity and imperceptibility compared with the existing methods. 相似文献
5.
6.
The study examined a decision tree analysis using social big data to conduct the prediction model on types of risk factors related to cyberbullying in Korea. The study conducted an analysis of 103,212 buzzes that had noted causes of cyberbullying and data were collected from 227 online channels, such as news websites, blogs, online groups, social network services, and online bulletin boards. Using opinion-mining method and decision tree analysis, the types of cyberbullying were sorted using SPSS 25.0. The results indicated that the total rate of types of cyberbullying in Korea was 44%, which consisted of 32.3% victims, 6.4% perpetrators, and 5.3% bystanders. According to the results, the impulse factor was also the greatest influence on the prediction of the risk factors and the propensity for dominance factor was the second greatest factor predicting the types of risk factors. In particular, the impulse factor had the most significant effect on bystanders, and the propensity for dominance factor was also significant in influencing online perpetrators. It is necessary to develop a program to diminish the impulses that were initiated by bystanders as well as victims and perpetrators because many of those bystanders have tended to aggravate impulsive cyberbullying behaviors. 相似文献
7.
Mining high utility itemsets (HUIs) from transaction databases considers such factors as the unit profit and quantity of purchased items. Two-phase tree-based algorithms transform a database into compressed tree structures and generate candidate patterns through a recursive pattern-growth procedure. This procedure requires a lot of memory and time to construct conditional pattern trees. To address this issue, this study employs two compressed tree structures, namely, Utility Count Tree and String Utility Tree, to enumerate valid patterns and thus promote fast utility computation. Furthermore, the study presents an algorithm called single-phase utility computation (SPUC) that leverages these two tree structures to mine HUIs in a single phase by incorporating novel pruning strategies. Experiments conducted on both real and synthetic datasets demonstrate the superior performance of SPUC compared with IHUP, UP-Growth, and UP-Growth+ algorithms. 相似文献
8.
9.
10.
以用户为中心的可见光通信协作传输是近年来出现的新架构,这导致虚拟小区之间出现重叠。为避免导频污染问题,每个虚拟小区中的光接入点(AP)或者虚拟小区中选择相同AP的用户发送的训练序列应该是正交的。针对可见光通信中以用户为中心的协作网络,研究训练资源的正交分配问题,提出了一种新的导频分配算法,联合导频分配和用户选择问题,以期最大限度地增加虚拟小区内可被接入的用户数。分析和仿真结果表明,该导频分配方案可以有效改善导频污染问题,提高训练资源利用率,并且相比已有的导频分配方案,性能有所改进。 相似文献