全文获取类型
收费全文 | 562篇 |
免费 | 59篇 |
国内免费 | 19篇 |
专业分类
化学 | 158篇 |
力学 | 55篇 |
综合类 | 11篇 |
数学 | 297篇 |
物理学 | 119篇 |
出版年
2023年 | 8篇 |
2022年 | 11篇 |
2021年 | 12篇 |
2020年 | 15篇 |
2019年 | 17篇 |
2018年 | 18篇 |
2017年 | 14篇 |
2016年 | 26篇 |
2015年 | 19篇 |
2014年 | 29篇 |
2013年 | 36篇 |
2012年 | 29篇 |
2011年 | 30篇 |
2010年 | 40篇 |
2009年 | 57篇 |
2008年 | 52篇 |
2007年 | 47篇 |
2006年 | 40篇 |
2005年 | 29篇 |
2004年 | 17篇 |
2003年 | 13篇 |
2002年 | 9篇 |
2001年 | 10篇 |
2000年 | 9篇 |
1999年 | 8篇 |
1998年 | 9篇 |
1997年 | 7篇 |
1996年 | 2篇 |
1995年 | 3篇 |
1994年 | 5篇 |
1993年 | 5篇 |
1991年 | 2篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1988年 | 1篇 |
1987年 | 1篇 |
1986年 | 1篇 |
1985年 | 1篇 |
1984年 | 1篇 |
1982年 | 1篇 |
1981年 | 2篇 |
1970年 | 1篇 |
排序方式: 共有640条查询结果,搜索用时 15 毫秒
61.
Hsien-Chung Wu 《Applications of Mathematics》2007,52(1):1-23
The procedures for constructing a fuzzy number and a fuzzy-valued function from a family of closed intervals and two families
of real-valued functions, respectively, are proposed in this paper. The constructive methodology follows from the form of
the well-known “Resolution Identity” (decomposition theorem) in fuzzy sets theory. The fuzzy-valued measure is also proposed
by introducing the notion of convergence for a sequence of fuzzy numbers. Under this setting, we develop the fuzzy-valued
integral of fuzzy-valued function with respect to fuzzy-valued measure. Finally, we provide a Dominated Convergence Theorem
for fuzzy-valued integrals. 相似文献
62.
Malek Adjouadi Nuannuan Zong Melvin Ayala 《Particle & Particle Systems Characterization》2005,22(2):107-118
This study introduces a new algorithm to optimize the pattern recognition of different white blood cell types in flow cytometry. The behavior of parametric data clusters in a multidimensional space is analyzed using the learning system known as Support Vector Machines (SVM). Beckman‐Coulter Corporation supplied flow cytometry data of numerous patients to be used as training and testing sets for the algorithm. Subsequently, the characteristics of the cells provided in these sets were used to train a SVM based classifier. The objective in developing this algorithm was to identify the category of a given blood sample and provide information to medical doctors in the form of diagnostic references for a specific disease state, lymphocytic leukemia. With the application of the hypothesis space, the learning bias and the learning algorithm, the SVM classifier was successfully trained to evaluate misclassification ratios in flow cytometry data in an effort to recognize abnormal blood cell patterns and address the ubiquitous problem of data overlap through the use of the maximal margin classifier. 相似文献
63.
We consider the problem of scheduling n independent jobs on m unrelated parallel machines with sequence-dependent setup times and availability dates for the machines and release dates for the jobs to minimize a regular additive cost function. In this work, we develop a new branch-and-price optimization algorithm for the solution of this general class of parallel machines scheduling problems. A new column generation accelerating method, termed “primal box”, and a specific branching variable selection rule that significantly reduces the number of explored nodes are proposed. The computational results show that the approach solves problems of large size to optimality within reasonable computational time. 相似文献
64.
For weighted sums Σj = 1najVj of independent random elements {Vn, n ≥ 1} in real separable, Rademacher type p (1 ≤ p ≤ 2) Banach spaces, a general weak law of large numbers of the form (Σj = 1najVj − vn)/bn →p 0 is established, where {vn, n ≥ 1} and bn → ∞ are suitable sequences. It is assumed that {Vn, n ≥ 1} is stochastically dominated by a random element V, and the hypotheses involve both the behavior of the tail of the distribution of |V| and the growth behaviors of the constants {an, n ≥ 1} and {bn, n ≥ 1}. No assumption is made concerning the existence of expected values or absolute moments of the {Vn, n >- 1}. 相似文献
65.
When the processing times of jobs are controllable, selected processing times affect both the manufacturing cost and the scheduling performance. A well known example for such a case that this paper specifically deals with is the turning operation on a CNC machine. Manufacturing cost of a turning operation is a nonlinear convex function of its processing time. In this paper, we deal with making optimal machine-job assignments and processing time decisions so as to minimize total manufacturing cost while the makespan being upper bounded by a known value, denoted as ?-constraint approach for a bicriteria problem. We then give optimality properties for the resulting single criterion problem. We provide alternative methods to compute cost lower bounds for partial schedules, which are used in developing an exact (branch and bound) algorithm. For the cases where the exact algorithm is not efficient in terms of computation time, we present a recovering beam search algorithm equipped with an improvement search procedure. In order to find improving search directions, the improvement search algorithm uses the proposed cost bounding properties. Computational results show that our lower bounding methods in branch and bound algorithm achieve a significant reduction in the search tree size that we need to traverse. Also, our recovering beam search and improvement search heuristics achieve solutions within 1% of the optimum on the average while they spent much less computational effort than the exact algorithm. 相似文献
66.
A major problem in achieving significant speed-up on parallel machines is the overhead involved with synchronizing the concurrent processes. Removing the synchronization constraint has the potential of speeding up the computation, while maintaining greater computation flexibility (e.g. differences in processors speed; differences in the data input to processors). We construct asynchronous (AS) finite difference schemes for the solution of PDEs by removing the synchronization constraint. We analyze the numerical properties of these schemes. Based on the analysis, we develop corrected-asynchronous (CA) finite difference schemes which are specifically constructed for an asynchronous processing. We present asynchronous (AS) and corrected-asynchronous (CA) finite difference schemes for the multi-dimensional heat equation. Although our discussion concentrates on the Euler scheme it should serve only as a sample, as it can be extended to other schemes and other PDEs.These schemes are implemented on the shared-memory multi-userSequent Balance machine. Numerical results for one and two dimensional problems are presented. It is shown experimentally that synchronization penalty can be about 50% of run time: in most cases, the asynchronous scheme runs twice as fast as the parallel synchronous scheme. In general, the efficiency of the parallel schemes increases with processor load, with the time-level, and with the problem dimension. The efficiency of the AS may reach 90% and over, but it provides accurate results only for steady-state values. The CA, on the other hand, is less efficient but provides more accurate results for intermediate (non steady-state) values. The results show the potential of developing asynchronous finite deference schemes for steady-state as well as non steadystate problems.This research was partially supported by a grant from The Basic Research Foundation administrated by The Israel Academy of Sciences and Humanities.A reduced version of the paper was presented at the 4th SIAM Conference on Parallel Processing for Scientific Computing, Dec. 11–13, 1989, Chicago, USA.The work by this author was supported by research grant 337 of the Israeli National Council for Research and Development in the years 1990–1991.This research was supported by the National Aeronautics and Space Administration under NASA Contract No. NASI-18107 while the author was in residence at the Institute for Computer Applications in Sciences and Engineering (ICASE), NASA Langley Research Center, Hampton, VA 23665, USA. 相似文献
67.
We address scheduling problems with job-dependent due-dates and general (possibly nonlinear and asymmetric) earliness and tardiness costs. The number of distinct due-dates is substantially smaller than the number of jobs, thus jobs are partitioned to classes, where all jobs of a given class share a common due-date. We consider the settings of a single machine and parallel identical machines. Our objective is of a minmax type, i.e., we seek a schedule that minimizes the maximum earliness/tardiness cost among all jobs. 相似文献
68.
Hoi-Ming Chi Okan K. Ersoy Herbert Moskowitz Jim Ward 《European Journal of Operational Research》2007
Using a supply chain network, we demonstrate the feasibility, viability, and robustness of applying machine learning and genetic algorithms to respectively model, understand, and optimize such data intensive environments. Deployment of these algorithms, which learn from and optimize data, can obviate the need to perform more complex, expensive, and time consuming design of experiments (DOE), which usually disrupt system operations. We apply and compare the behavior and performance of the proposed machine learning algorithms to that obtained via DOE in a simulated Vendor Managed Replenishment system, developed for an actual firm. The results show that the models resulting from the proposed algorithms had strong explanatory and predictive power, comparable to that of DOE. The optimal system settings and profit were also similar to that obtained from DOE. The virtues of using machine learning and evolutionary algorithms to model and optimize data rich environments thus seem promising because they are automatic, involving little human intervention and expertise. We believe and are exploring how they can be made adaptive to improve parameter estimates with increasing data, as well as seamlessly detecting system (and therefore model) changes, thus being capable of recursively updating and reoptimizing a modified or new model. 相似文献
69.
70.
我们考虑平行机排序问题中的这样一类:机器两台,类型一样,但效率不同.其中n个工件在第一台机器上的加工时间分别为p1,p2,…,Pn,在第二台机器上的加工时间分别为αρ1,αρ2,…,αρn,其中0<α≤1.每台机器上的工件总数不受限制.n个工件的权分别为w1,w2,…,wn,我们的目标是如何在这两台机器上安排这n个工件以及如何确定每台机器上工件加工的先后顺序,使得这n个工件的完工时间的总权和 达到最小.该问题记为 .对于这个问题,我们给出一个1.1755近似算法. 相似文献