收费全文 | 1962篇 |
免费 | 118篇 |
国内免费 | 53篇 |
化学 | 1298篇 |
晶体学 | 12篇 |
力学 | 78篇 |
综合类 | 2篇 |
数学 | 176篇 |
物理学 | 273篇 |
无线电 | 294篇 |
2024年 | 3篇 |
2023年 | 12篇 |
2022年 | 38篇 |
2021年 | 57篇 |
2020年 | 73篇 |
2019年 | 106篇 |
2018年 | 95篇 |
2017年 | 81篇 |
2016年 | 147篇 |
2015年 | 92篇 |
2014年 | 136篇 |
2013年 | 228篇 |
2012年 | 157篇 |
2011年 | 145篇 |
2010年 | 122篇 |
2009年 | 100篇 |
2008年 | 130篇 |
2007年 | 68篇 |
2006年 | 72篇 |
2005年 | 33篇 |
2004年 | 50篇 |
2003年 | 24篇 |
2002年 | 21篇 |
2001年 | 11篇 |
2000年 | 7篇 |
1999年 | 6篇 |
1998年 | 6篇 |
1997年 | 4篇 |
1996年 | 6篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 3篇 |
1991年 | 2篇 |
1990年 | 4篇 |
1989年 | 6篇 |
1988年 | 6篇 |
1987年 | 6篇 |
1986年 | 5篇 |
1985年 | 7篇 |
1984年 | 5篇 |
1983年 | 4篇 |
1981年 | 2篇 |
1980年 | 3篇 |
1979年 | 2篇 |
1973年 | 3篇 |
1972年 | 2篇 |
1970年 | 9篇 |
1969年 | 4篇 |
1937年 | 2篇 |
1927年 | 3篇 |
In recent years, cloud computing provides a spectacular platform for numerous users with persistent and alternative varying requirements. In the cloud environment, security and service availability are the two most significant factors during the data encryption process. For providing optimal service availability, it is necessary to establish a load balancing technique that is capable of balancing the request from diverse nodes present in the cloud. This paper aims in establishing a dynamic load balancing technique using the APMG approach. Here in this paper, we integrated adaptive neuro-fuzzy interference system-polynomial neural network as well as memory-based grey wolf optimization algorithm for optimal load balancing. The memory-based grey wolf optimization algorithm is employed to enhance the precision of ANFIS-PNN and to maximize the locations of the membership functions respectively. Also, two significant factors namely the turnaround time and CPU utilization involved in optimal load balancing scheme are evaluated. Finally, the performance evaluation of the proposed MG-ANFIS based dynamic load balancing approach is compared with various other load balancing approaches to determine the system performances.
相似文献Preserving privacy of vehicle movement is an important challenge in road networks; as trajectory data with spatiotemporal information may reveal much individual information. One of the main threats is revealing history location of vehicle trajectories while it stops and again moves toward the destination. Generally, vehicles stop at mostly two places; the first one is traffic light (signal system)/traffic jam and second is at parking locations such as office, shopping mall, home, hospital etc. While existing works only consider social spots. To cope with this issue, we present a new multiple mix zones de-correlation privacy model in which the degree of de-correlation between parking locations and traffic light/traffic jam places. Further, we consider multiple mix zones method to replace parking locations and traffic light/traffic jam places by de-correlation mix zone region. This paper presents an improved privacy traffic monitoring system for road network applications via a proposed security scheme. Specifically, the proposed model analyzes the monitored scene and deployed mix zones parking location and traffic light/traffic jam places. Our method achieved a high privacy level and anonymity solution for trajectory model; moreover, it also balances the service quality and privacy protection. Finally, we performed experiments on real-world data and showed the effectiveness of our method in comparison to existing methods.
相似文献Location-based services (LBSs) allow users to ask location-dependent queries and receive information based on their location. A group of users can send a group-nearest-neighbor (GNN) query in order to receive a Point Of Interest (POI). This POI in turn shows a point which is the minimum distance from all members of the group. To benefit from these services, it is important to preserve the location privacy of each group user from others in the group (Intragroup location privacy) as well as from anyone outside of the group, including the LBS, (Intergroup location privacy). It may also be necessary to protect the location privacy of the resulting POI from the LBS and other possible attackers. In this paper, we propose two different privacy-preserving protocols for finding the exact answer to a GNN query among a set of returned POIs. The first protocol assumes a semi-honest model while the second one works in a malicious model. The proposed protocols are based on the Anonymous Veto network and Burmester–Desmedt key establishment protocols. The security analysis shows that the proposed protocols provide both Intragroup and Intergroup location privacy; they also protect the location privacy of the resulting POI and are resistant to collusion and multi-point aggregate distance attacks. The performed analyses indicate that they incur a constant computation cost per user and are efficient in terms of computation and communication costs.
相似文献In vehicular communications, periodic one-hop broadcast of beacons allows cooperative awareness for vehicles. To avoid congestion in the shared channel used for transmission of beacons, a joint beacon frequency and power control protocol based on game theory is presented in this paper. The existence, uniqueness and stability of the Nash Equilibrium (NE) of the game is proved mathematically. An algorithm is devised to find the equilibrium point in a distributed manner and its stability and convergence has been validated using simulation. The algorithm converges to the NE from any initial frequency and power and it can provide both fairness in power and weighted fairness in frequency. The protocol has per vehicle parameters, hence, every vehicle can control its share of the bandwidth according to its dynamics or safety application requirements while the whole usage of bandwidth is controlled at a desired level.
相似文献