全文获取类型
收费全文 | 928篇 |
免费 | 162篇 |
国内免费 | 10篇 |
专业分类
化学 | 50篇 |
晶体学 | 1篇 |
力学 | 10篇 |
综合类 | 70篇 |
数学 | 565篇 |
物理学 | 404篇 |
出版年
2023年 | 17篇 |
2022年 | 40篇 |
2021年 | 84篇 |
2020年 | 42篇 |
2019年 | 29篇 |
2018年 | 14篇 |
2017年 | 59篇 |
2016年 | 57篇 |
2015年 | 21篇 |
2014年 | 63篇 |
2013年 | 98篇 |
2012年 | 48篇 |
2011年 | 37篇 |
2010年 | 39篇 |
2009年 | 52篇 |
2008年 | 58篇 |
2007年 | 49篇 |
2006年 | 47篇 |
2005年 | 38篇 |
2004年 | 32篇 |
2003年 | 28篇 |
2002年 | 32篇 |
2001年 | 21篇 |
2000年 | 19篇 |
1999年 | 14篇 |
1998年 | 10篇 |
1997年 | 2篇 |
1996年 | 6篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 1篇 |
1991年 | 5篇 |
1989年 | 1篇 |
1987年 | 3篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 8篇 |
1983年 | 10篇 |
1982年 | 9篇 |
1981年 | 1篇 |
排序方式: 共有1100条查询结果,搜索用时 265 毫秒
81.
82.
Jan Camenisch 《Discrete Applied Mathematics》2006,154(2):175-188
We propose the concept of fine-grained forward-secure signature schemes. Such signature schemes not only provide non-repudiation w.r.t. past time periods the way ordinary forward-secure signature schemes do but, in addition, allow the signer to specify which signatures of the current time period remain valid when revoking the public key. This is an important advantage if the signer produces many signatures per time period as otherwise the signer would have to re-issue those signatures (and possibly re-negotiate the respective messages) with a new key.Apart from a formal model for fine-grained forward-secure signature schemes, we present practical schemes and prove them secure under the strong RSA assumption only, i.e., we do not resort to the random oracle model to prove security. As a side-result, we provide an ordinary forward-secure scheme whose key-update time is significantly smaller than that of known schemes which are secure without assuming random oracles. 相似文献
83.
In this article, we introduce a novel Bayesian approach for linking multiple social networks in order to discover the same real world person having different accounts across networks. In particular, we develop a latent model that allows us to jointly characterize the network and linkage structures relying on both relational and profile data. In contrast to other existing approaches in the machine learning literature, our Bayesian implementation naturally provides uncertainty quantification via posterior probabilities for the linkage structure itself or any function of it. Our findings clearly suggest that our methodology can produce accurate point estimates of the linkage structure even in the absence of profile information, and also, in an identity resolution setting, our results confirm that including relational data into the matching process improves the linkage accuracy. We illustrate our methodology using real data from popular social networks such as Twitter , Facebook , and YouTube . 相似文献
84.
In this paper, intelligent reflecting surface (IRS) technology is employed to enhance physical layer security (PLS) for spectrum sharing communication systems with orthogonal frequency division multiplexing (OFDM). Aiming to improve the secondary users’ secrecy rates, a design problem for jointly optimizing the transmission beamforming of secondary base station (SBS), the IRS’s reflecting coefficient and the channel allocation is formulated under the constraints of the requirements of minimum data rates of primary users and the interference between users. As the scenario is highly complex, it is quite challenging to address the non-convexity of the optimization problem. Thus, a deep reinforcement learning (DRL) based approach is taken into consideration. Specifically, we use dueling double deep Q networks (D3QN) and soft Actor–Critic (SAC) to solve the discrete and continuous action space optimization problems, respectively, taking full advantage of the maximum entropy RL algorithm to explore all possible optimal paths. Finally, simulation results show that our proposed approach has a great improvement in security transmission rate compared with the scheme without IRS and OFDM, and our proposed D3QN-SAC approach is more effective than other approaches in terms of maximum security transmission rate. 相似文献
85.
Inspired by the promising potential of re-configurable intelligent surface (RIS)-aided transmission in achieving the vision of 6th Generation (6G) network, we analyze the security model for a vehicular-to-infrastructure (V2I) network by considering multiple RISs (M-RIS) on buildings to act as passive relays at fixed distances from a source. In addition, multiple eavesdroppers are presented in the vicinity of the intended destination. Our aim is to enhance the secrecy capacity (SC) and to minimize secrecy outage probability (SOP) in presence of multiple eavesdroppers with the help of M-RIS in V2I communications. We propose a key-less physical layer security using beam-forming by exploiting M-RIS. The proposed approach assumes the concept of detecting eavesdroppers before the information can be transmitted via beam-forming by utilizing M-RIS. The results reveal that with consideration of M-RIS and beam-forming, the achievable SC and SOP performance is significantly improved while imposing minimum power consumption and fewer RIS reflectors. 相似文献
86.
Massive multiple-input-multiple-output (Massive MIMO) significantly improves the capacity of wireless communication systems. However, large-scale antennas bring high hardware costs, and security is a vital issue in Massive MIMO networks. To deal with the above problems, antenna selection (AS) and artificial noise (AN) are introduced to reduce energy consumption and improve system security performance, respectively. In this paper, we optimize secrecy energy efficiency (SEE) in a downlink multi-user multi-antenna scenario, where a multi-antenna eavesdropper attempts to eavesdrop the information from the base station (BS) to the multi-antenna legitimate receivers. An optimization problem is formulated to maximize the SEE by jointly optimizing the transmit beamforming vectors, the artificial noise vector and the antenna selection matrix at the BS. The formulated problem is a nonconvex mixed integer fractional programming problem. To solve the problem, a successive convex approximation (SCA)-based joint antenna selection and artificial noise (JASAN) algorithm is proposed. After a series of relaxation and equivalent transformations, the nonconvex problem is approximated to a convex problem, and the solution is obtained after several iterations. Simulation results show that the proposed algorithm has good convergence behavior, and the joint optimization of antenna selection and artificial noise can effectively improve the SEE while ensuring the achievable secrecy rate. 相似文献
87.
建立了安检流程的网络流模型,模型中包含了不稳定的乘客到达情形、嫌疑乘客以及反馈机制。分析了安检过程中的瓶颈所在,并给出了相应的优化方案,包括整个安检过程的通行规则,A区和B区内部预检节点与普通节点的适当比例等。仿真结果显示,为了充分利用安检资源并兼顾预检乘客的利益,通行规则应采用连通方案。依照统计数据中计算出的各种参数,在A区预检节点和普通节点比例设置为2∶2,B区预检节点和普通节点比例设置为3∶5的情况下,旅客平均等待时间最短,等待时间的标准差也最小,同时高峰期的通行量也相对较优。进一步分析了不同的文化背景及机场情况。对于美国人和瑞士人,通过改变预检乘客的选择概率来满足他们不同的行为偏好。仿真结果说明,预检乘客选择哪类节点进行安检对平均等待时间、等待时间的标准差和高峰期通行量的影响不大。分析了插队情形,插队对平均等待时间和高峰期通行量几乎没有影响,但当插队比例非常大时,旅客等待时间标准差会增加,影响乘客到达的准确性。最后,针对具体情况提出了一些合理的建议,并给出了进一步的研究计划。 相似文献
88.
89.
Dominic Brenner Andreas Dellnitz Wilhelm Rödder 《The Journal of mathematical sociology》2017,41(2):84-103
To detect and study cohesive subgroups of actors is a main objective in social network analysis. What are the respective relations inside such groups and what separates them from the outside. Entropy-based analysis of network structures is an up-and-coming approach. It turns out to be a powerful instrument to detect certain forms of cohesive subgroups and to compress them to superactors without loss of information about their embeddedness in the net: Compressing strongly connected subgroups leaves the whole net’s and the (super-)actors’ information theoretical indices unchanged; i.e., such compression is information-invariant. The actual article relates on the reduction of networks with hundreds of actors. All entropy-based calculations are realized in an expert system shell. 相似文献
90.
In this research, we develop and introduce a theoretical and mathematical forecasting framework of immigrant integration using immigrant density as a single driver. First, we introduce the integration concepts we aim at forecasting. Thereafter, we introduce a theoretical and mathematical model of the relationship between integration and immigrant density. Based on this model, we develop a methodological forecasting framework. We test the framework using immigrant integration data from Spain. We produce the forecasts, and conduct the proper evaluation of them. Finally, we conclude with a brief discussion of the wider implications of our results. 相似文献