收费全文 | 6391篇 |
免费 | 284篇 |
国内免费 | 56篇 |
化学 | 4257篇 |
晶体学 | 43篇 |
力学 | 229篇 |
综合类 | 2篇 |
数学 | 836篇 |
物理学 | 676篇 |
无线电 | 688篇 |
2024年 | 10篇 |
2023年 | 61篇 |
2022年 | 235篇 |
2021年 | 342篇 |
2020年 | 252篇 |
2019年 | 274篇 |
2018年 | 250篇 |
2017年 | 199篇 |
2016年 | 336篇 |
2015年 | 241篇 |
2014年 | 245篇 |
2013年 | 610篇 |
2012年 | 391篇 |
2011年 | 410篇 |
2010年 | 265篇 |
2009年 | 230篇 |
2008年 | 282篇 |
2007年 | 292篇 |
2006年 | 244篇 |
2005年 | 204篇 |
2004年 | 184篇 |
2003年 | 155篇 |
2002年 | 160篇 |
2001年 | 68篇 |
2000年 | 65篇 |
1999年 | 51篇 |
1998年 | 36篇 |
1997年 | 46篇 |
1996年 | 42篇 |
1995年 | 39篇 |
1994年 | 47篇 |
1993年 | 33篇 |
1992年 | 36篇 |
1991年 | 30篇 |
1990年 | 47篇 |
1989年 | 26篇 |
1988年 | 25篇 |
1987年 | 30篇 |
1986年 | 27篇 |
1985年 | 33篇 |
1984年 | 20篇 |
1983年 | 18篇 |
1982年 | 25篇 |
1981年 | 20篇 |
1980年 | 14篇 |
1979年 | 18篇 |
1978年 | 11篇 |
1977年 | 12篇 |
1976年 | 9篇 |
1975年 | 7篇 |
In this article, we will present a new set of hybrid polynomials and their corresponding moments, with a view to using them for the localization, compression and reconstruction of 2D and 3D images. These polynomials are formed from the Hahn and Krawtchouk polynomials. The process of calculating these is successfully stabilized using the modified recurrence relations with respect to the n order, the variable x and the symmetry property. The hybrid polynomial generation process is carried out in two forms: the first form contains the separable discrete orthogonal polynomials of Krawtchouk–Hahn (DKHP) and Hahn–Krawtchouk (DHKP). The latter are generated as the product of the discrete orthogonal Hahn and Krawtchouk polynomials, while the second form is the square equivalent of the first form, it consists of discrete squared Krawtchouk–Hahn polynomials (SKHP) and discrete polynomials of Hahn–Krawtchouk squared (SHKP). The experimental results clearly show the efficiency of hybrid moments based on hybrid polynomials in terms of localization property and computation time of 2D and 3D images compared to other types of moments; on the other hand, encouraging results have also been shown in terms of reconstruction quality and compression despite the superiority of classical polynomials.
相似文献We perceive big data with massive datasets of complex and variegated structures in the modern era. Such attributes formulate hindrances while analyzing and storing the data to generate apt aftermaths. Privacy and security are the colossal perturb in the domain space of extensive data analysis. In this paper, our foremost priority is the computing technologies that focus on big data, IoT (Internet of Things), Cloud Computing, Blockchain, and fog computing. Among these, Cloud Computing follows the role of providing on-demand services to their customers by optimizing the cost factor. AWS, Azure, Google Cloud are the major cloud providers today. Fog computing offers new insights into the extension of cloud computing systems by procuring services to the edges of the network. In collaboration with multiple technologies, the Internet of Things takes this into effect, which solves the labyrinth of dealing with advanced services considering its significance in varied application domains. The Blockchain is a dataset that entertains many applications ranging from the fields of crypto-currency to smart contracts. The prospect of this research paper is to present the critical analysis and review it under the umbrella of existing extensive data systems. In this paper, we attend to critics' reviews and address the existing threats to the security of extensive data systems. Moreover, we scrutinize the security attacks on computing systems based upon Cloud, Blockchain, IoT, and fog. This paper lucidly illustrates the different threat behaviour and their impacts on complementary computational technologies. The authors have mooted a precise analysis of cloud-based technologies and discussed their defense mechanism and the security issues of mobile healthcare.
相似文献Wireless sensor networks (WSNs) have become an important component in the Internet of things (IoT) field. In WSNs, multi-channel protocols have been developed to overcome some limitations related to the throughput and delivery rate which have become necessary for many IoT applications that require sufficient bandwidth to transmit a large amount of data. However, the requirement of frequent negotiation for channel assignment in distributed multi-channel protocols incurs an extra-large communication overhead which results in a reduction of the network lifetime. To deal with this requirement in an energy-efficient way is a challenging task. Hence, the Reinforcement Learning (RL) approach for channel assignment is used to overcome this problem. Nevertheless, the use of the RL approach requires a number of iterations to obtain the best solution which in turn creates a communication overhead and time-wasting. In this paper, a Self-schedule based Cooperative multi-agent Reinforcement Learning for Channel Assignment (SCRL CA) approach is proposed to improve the network lifetime and performance. The proposal addresses both regular traffic scheduling and assignment of the available orthogonal channels in an energy-efficient way. We solve the cooperation between the RL agents problem by using the self-schedule method to accelerate the RL iterations, reduce the communication overhead and balance the energy consumption in the route selection process. Therefore, two algorithms are proposed, the first one is for the Static channel assignment (SSCRL CA) while the second one is for the Dynamic channel assignment (DSCRL CA). The results of extensive simulation experiments show the effectiveness of our approach in improving the network lifetime and performance through the two algorithms.
相似文献