全文获取类型
收费全文 | 4656篇 |
免费 | 709篇 |
国内免费 | 109篇 |
专业分类
化学 | 739篇 |
晶体学 | 1篇 |
力学 | 87篇 |
综合类 | 74篇 |
数学 | 792篇 |
物理学 | 914篇 |
无线电 | 2867篇 |
出版年
2024年 | 106篇 |
2023年 | 386篇 |
2022年 | 772篇 |
2021年 | 749篇 |
2020年 | 572篇 |
2019年 | 315篇 |
2018年 | 231篇 |
2017年 | 240篇 |
2016年 | 258篇 |
2015年 | 189篇 |
2014年 | 237篇 |
2013年 | 254篇 |
2012年 | 133篇 |
2011年 | 131篇 |
2010年 | 109篇 |
2009年 | 115篇 |
2008年 | 90篇 |
2007年 | 85篇 |
2006年 | 71篇 |
2005年 | 67篇 |
2004年 | 48篇 |
2003年 | 34篇 |
2002年 | 40篇 |
2001年 | 24篇 |
2000年 | 43篇 |
1999年 | 31篇 |
1998年 | 16篇 |
1997年 | 23篇 |
1996年 | 16篇 |
1995年 | 21篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1992年 | 11篇 |
1991年 | 5篇 |
1990年 | 3篇 |
1989年 | 3篇 |
1988年 | 6篇 |
1987年 | 3篇 |
1986年 | 9篇 |
1985年 | 2篇 |
1984年 | 2篇 |
1983年 | 1篇 |
1981年 | 1篇 |
1979年 | 3篇 |
1977年 | 2篇 |
1971年 | 1篇 |
1969年 | 1篇 |
1959年 | 5篇 |
排序方式: 共有5474条查询结果,搜索用时 15 毫秒
161.
生存核的计算是控制理论中的一个重要研究方向.给出了一种计算一般离散控制系统生存核的新算法.基于机器学习的方法,给出了逼近生存核的算法.并在一定条件下,证明了此算法的收敛性.此算法在一定程度上避免了计算量随控制空间的维数增长而指数增长的问题.最后,给出具体的实际例子来说明算法的有效性. 相似文献
162.
Hans-Jörg SchützRainer Kolisch 《European Journal of Operational Research》2012,218(1):239-250
We consider a problem where different classes of customers can book different types of service in advance and the service company has to respond immediately to the booking request confirming or rejecting it. The objective of the service company is to maximize profit made of class-type specific revenues, refunds for cancellations or no-shows as well as cost of overtime. For the calculation of the latter, information on the underlying appointment schedule is required. In contrast to most models in the literature we assume that the service time of clients is stochastic and that clients might be unpunctual. Throughout the paper we will relate the problem to capacity allocation in radiology services. The problem is modeled as a continuous-time Markov decision process and solved using simulation-based approximate dynamic programming (ADP) combined with a discrete event simulation of the service period. We employ an adapted heuristic ADP algorithm from the literature and investigate on the benefits of applying ADP to this type of problem. First, we study a simplified problem with deterministic service times and punctual arrival of clients and compare the solution from the ADP algorithm to the optimal solution. We find that the heuristic ADP algorithm performs very well in terms of objective function value, solution time, and memory requirements. Second, we study the problem with stochastic service times and unpunctuality. It is then shown that the resulting policy constitutes a large improvement over an “optimal” policy that is deduced using restrictive, simplifying assumptions. 相似文献
163.
Decision makers select employees for a project to match a particular set of goals pertaining to the multiple criteria mix of skills and competencies needed. Cognitive style influences how a person gathers and evaluates information and consequently, provides skills and competencies toward problem solving. The proposed fuzzy set-based model facilitates the manager’s selection of employees who meet the project goal(s) for the preferred cognitive style. The paper presents background information on cognitive styles and fuzzy logic with an algorithm developed based on belief in the fuzzy probability of a cognitive style fitting a defined goal. An application is presented with analysis and conclusions stated. 相似文献
164.
A new family of proximity graphs: Class cover catch digraphs 总被引:1,自引:0,他引:1
Jason DeVinney 《Discrete Applied Mathematics》2006,154(14):1975-1982
Motivated by issues in machine learning and statistical pattern classification, we investigate a class cover problem (CCP) with an associated family of directed graphs—class cover catch digraphs (CCCDs). CCCDs are a special case of catch digraphs. Solving the underlying CCP is equivalent to finding a smallest cardinality dominating set for the associated CCCD, which in turn provides regularization for statistical pattern classification. Some relevant properties of CCCDs are studied and a characterization of a family of CCCDs is given. 相似文献
165.
本文研究了由高斯核的方差在算法中引起的一些误差,利用再生核的一些特殊性质对这些误差进行分析.这些误差在分析算法的收敛速度时起到了重要的作用. 相似文献
166.
Discrete support vector machines (DSVM), originally proposed for binary classification problems, have been shown to outperform
other competing approaches on well-known benchmark datasets. Here we address their extension to multicategory classification,
by developing three different methods. Two of them are based respectively on one-against-all and round-robin classification schemes, in which a number of binary discrimination problems are solved by means of a variant of DSVM. The
third method directly addresses the multicategory classification task, by building a decision tree in which an optimal split
to separate classes is derived at each node by a new extended formulation of DSVM. Computational tests on publicly available
datasets are then conducted to compare the three multicategory classifiers based on DSVM with other methods, indicating that
the proposed techniques achieve significantly higher accuracies.
This research was partially supported by PRIN grant 2004132117. 相似文献
167.
A random forest application to contact‐state classification for robot programming by human demonstration 下载免费PDF全文
This paper addresses the non‐parametric estimation of the stochastic process related to the classification problem that arises in robot programming by demonstration of compliant motion tasks. Robot programming by demonstration is a robot programming paradigm in which a human operator demonstrates the task to be performed by the robot. In such demonstration, several observable variables, such as velocities and forces can be modeled, non‐parametrically, in order to classify the current state of a contact between an object manipulated by the robot and the environment in which it operates. Essential actions in compliant motion tasks are the contacts that take place, and therefore, it is important to understand the sequence of contact states made during a demonstration, called contact classification. We propose a contact classification algorithm based on the random forest algorithm. The main advantage of this approach is that it does not depend on the geometric model of the objects involved in the demonstration. Moreover, it does not rely on the kinestatic model of the contact interactions. The comparison with state‐of‐the‐art contact classifiers shows that random forest classifier is more accurate. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献
168.
169.
基于主题模型的半监督网络文本情感分类研究 总被引:1,自引:0,他引:1
针对网络评论文本的情感分类问题中存在的数据的不平衡性、无标记性和不规范性问题,提出一种基于主题的闽值调整的半监督学习模型,通过从非结构化文本中提取主题特征,对少量标注情感的文本训练分类器并优化指标调整闽值,达到识别用户评论的情感倾向的目的。仿真研究证明阈值调整的半监督模型对数据非平衡性和无标记性具有较强的适应能力。在实证研究中,对酒店评论文本数据构建的文本情感分类器显示该模型可以有效预测少数类评论样本的情感极性,证实了基于主题模型的闽值调整半监督网络评论文本情感分类模型在实际问题中的适用性与可行性。 相似文献
170.
机器算法中存在许多不同类型和方式的运行模式,而在诸多算法之中,集成学习的算法是一种基于统计理论以计算机实现的良好机器学习方法.阐述了集成学习的基本思想和实现步骤,运用Bagging集成学习算法试图建立一个个人信用评估模型,以期取得更好的预测结果.运用信息增益法筛选指标,采用V折交叉确认法,利用UCI的信用数据对单个分类器、Bagging集成分类器模型的分类精度和稳健性进行试验比较.结果表明,Bagging-决策树有效的提高了样本的精确性,在个人信用评估的分析中占有较强的优势. 相似文献