首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   2178篇
  免费   75篇
  国内免费   96篇
化学   99篇
晶体学   5篇
力学   57篇
综合类   19篇
数学   1724篇
物理学   445篇
  2025年   1篇
  2024年   9篇
  2023年   29篇
  2022年   80篇
  2021年   106篇
  2020年   78篇
  2019年   50篇
  2018年   50篇
  2017年   55篇
  2016年   54篇
  2015年   46篇
  2014年   67篇
  2013年   164篇
  2012年   87篇
  2011年   125篇
  2010年   97篇
  2009年   157篇
  2008年   144篇
  2007年   135篇
  2006年   116篇
  2005年   77篇
  2004年   69篇
  2003年   67篇
  2002年   59篇
  2001年   58篇
  2000年   65篇
  1999年   49篇
  1998年   42篇
  1997年   49篇
  1996年   26篇
  1995年   17篇
  1994年   25篇
  1993年   16篇
  1992年   13篇
  1991年   9篇
  1990年   10篇
  1989年   2篇
  1988年   5篇
  1987年   6篇
  1986年   9篇
  1985年   12篇
  1984年   8篇
  1982年   2篇
  1981年   1篇
  1979年   1篇
  1975年   1篇
  1967年   1篇
排序方式: 共有2349条查询结果,搜索用时 15 毫秒
61.
62.
63.
64.
    
The satisfiability (SAT) problem is a core problem in computer science. Existing studies have shown that most industrial SAT instances can be effectively solved by modern SAT solvers while random SAT instances cannot. It is believed that the structural characteristics of different SAT formula classes are the reasons behind this difference. In this paper, we study the structural properties of propositional formulas in conjunctive normal form (CNF) by the principle of structural entropy of formulas. First, we used structural entropy to measure the complex structure of a formula and found that the difficulty solving the formula is related to the structural entropy of the formula. The smaller the compressing information of a formula, the more difficult it is to solve the formula. Secondly, we proposed a λ-approximation strategy to approximate the structural entropy of large formulas. The experimental results showed that the proposed strategy can effectively approximate the structural entropy of the original formula and that the approximation ratio is more than 92%. Finally, we analyzed the structural properties of a formula in the solution process and found that a local search solver tends to select variables in different communities to perform the next round of searches during a search and that the structural entropy of a variable affects the probability of the variable being flipped. By using these conclusions, we also proposed an initial candidate solution generation strategy for a local search for SAT, and the experimental results showed that this strategy effectively improves the performance of the solvers CCAsat and Sparrow2011 when incorporated into these two solvers.  相似文献   
65.
    
This paper proposes a method for solving optimisation problems involving piecewise quadratic functions. The method provides a solution in a finite number of iterations, and the computational complexity of the proposed method is locally polynomial of the problem dimension, i.e., if the initial point belongs to the sufficiently small neighbourhood of the solution set. Proposed method could be applied for solving large systems of linear inequalities.  相似文献   
66.
    
Finding the critical factor and possible “Newton’s laws” in financial markets has been an important issue. However, with the development of information and communication technologies, financial models are becoming more realistic but complex, contradicting the objective law “Greatest truths are the simplest.” Therefore, this paper presents an evolutionary model independent of micro features and attempts to discover the most critical factor. In the model, information is the only critical factor, and stock price is the emergence of collective behavior. The statistical properties of the model are significantly similar to the real market. It also explains the correlations of stocks within an industry, which provides a new idea for studying critical factors and core structures in the financial markets.  相似文献   
67.
    
Insomnia is a common sleep disorder that is closely associated with the occurrence and deterioration of cardiovascular disease, depression and other diseases. The evaluation of pharmacological treatments for insomnia brings significant clinical implications. In this study, a total of 20 patients with mild insomnia and 75 healthy subjects as controls (HC) were included to explore alterations of electroencephalogram (EEG) complexity associated with insomnia and its pharmacological treatment by using multi-scale permutation entropy (MPE). All participants were recorded for two nights of polysomnography (PSG). The patients with mild insomnia received a placebo on the first night (Placebo) and temazepam on the second night (Temazepam), while the HCs had no sleep-related medication intake for either night. EEG recordings from each night were extracted and analyzed using MPE. The results showed that MPE decreased significantly from pre-lights-off to the period during sleep transition and then to the period after sleep onset, and also during the deepening of sleep stage in the HC group. Furthermore, results from the insomnia subjects showed that MPE values were significantly lower for the Temazepam night compared to MPE values for the Placebo night. Moreover, MPE values for the Temazepam night showed no correlation with age or gender. Our results indicated that EEG complexity, measured by MPE, may be utilized as an alternative approach to measure the impact of sleep medication on brain dynamics.  相似文献   
68.
    
Two-dimensional fuzzy entropy, dispersion entropy, and their multiscale extensions (MFuzzyEn2D and MDispEn2D, respectively) have shown promising results for image classifications. However, these results rely on the selection of key parameters that may largely influence the entropy values obtained. Yet, the optimal choice for these parameters has not been studied thoroughly. We propose a study on the impact of these parameters in image classification. For this purpose, the entropy-based algorithms are applied to a variety of images from different datasets, each containing multiple image classes. Several parameter combinations are used to obtain the entropy values. These entropy values are then applied to a range of machine learning classifiers and the algorithm parameters are analyzed based on the classification results. By using specific parameters, we show that both MFuzzyEn2D and MDispEn2D approach state-of-the-art in terms of image classification for multiple image types. They lead to an average maximum accuracy of more than 95% for all the datasets tested. Moreover, MFuzzyEn2D results in a better classification performance than that extracted by MDispEn2D as a majority. Furthermore, the choice of classifier does not have a significant impact on the classification of the extracted features by both entropy algorithms. The results open new perspectives for these entropy-based measures in textural analysis.  相似文献   
69.
    
Individuals with subjective cognitive decline (SCD) are at high risk of developing preclinical or clinical state of Alzheimer’s disease (AD). Resting state functional magnetic resonance imaging, which can indirectly reflect neuron activities by measuring the blood-oxygen-level-dependent (BOLD) signals, is promising in the early detection of SCD. This study aimed to explore whether the nonlinear complexity of BOLD signals can describe the subtle differences between SCD and normal aging, and uncover the underlying neuropsychological implications of these differences. In particular, we introduce amplitude-aware permutation entropy (AAPE) as the novel measure of brain entropy to characterize the complexity in BOLD signals in each brain region of the Brainnetome atlas. Our results demonstrate that AAPE can reflect the subtle differences between both groups, and the SCD group presented significantly decreased complexities in subregions of the superior temporal gyrus, the inferior parietal lobule, the postcentral gyrus, and the insular gyrus. Moreover, the results further reveal that lower complexity in SCD may correspond to poorer cognitive performance or even subtle cognitive impairment. Our findings demonstrated the effectiveness and sensitiveness of the novel brain entropy measured by AAPE, which may serve as the potential neuroimaging marker for exploring the subtle changes in SCD.  相似文献   
70.
Recently F. M. Dekking conjectured the form of the subword complexity function for the Fibonacci–Thue–Morse sequence. In this note we prove his conjecture by purely computational means, using the free software Walnut.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号