首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   261篇
  免费   4篇
  国内免费   8篇
化学   63篇
力学   15篇
综合类   2篇
数学   173篇
物理学   20篇
  2024年   1篇
  2023年   8篇
  2022年   5篇
  2021年   3篇
  2020年   2篇
  2019年   5篇
  2018年   9篇
  2017年   4篇
  2016年   4篇
  2015年   3篇
  2014年   12篇
  2013年   15篇
  2012年   18篇
  2011年   16篇
  2010年   13篇
  2009年   19篇
  2008年   13篇
  2007年   22篇
  2006年   13篇
  2005年   6篇
  2004年   10篇
  2003年   6篇
  2002年   6篇
  2001年   3篇
  2000年   5篇
  1999年   5篇
  1998年   9篇
  1997年   4篇
  1996年   10篇
  1995年   9篇
  1994年   3篇
  1993年   1篇
  1991年   2篇
  1987年   1篇
  1985年   1篇
  1983年   1篇
  1982年   2篇
  1981年   1篇
  1980年   1篇
  1979年   1篇
  1978年   1篇
排序方式: 共有273条查询结果,搜索用时 15 毫秒
1.
设珮犠(狋):犚犖+ →犚犱是犖指标犱维广义Wiener过程,对任意紧集犈1,…,犈犿犚犖> ,该文研究了犿项代数和珮犠(犈1)…珮犠(犈犿)的Hausdorff维数,Packing维数和正的Lebesgue测度及内点的存在性. 其结果包含并推广了布朗单的结果.  相似文献   
2.
PACKINGPAIRSBYQUINTUPLES:THECASEOFZEROCONGRUENCEMOD4YINJIANXINGAbstract:LetD(v)denotethemaximumnumberofquintuplesofav-setofpo...  相似文献   
3.
We address the problem of packing a given set of rectangles into the minimum size square. We consider three versions of the problem, arising when the rectangles (i) are squares; (ii) have a fixed orientation; (iii) can be rotated by 90. For each case we study lower bounds, and analyze their worst-case performance ratio. In addition, we evaluate through computational experiments their average performance on instances from the literature.  相似文献   
4.
In this paper we address a two-dimensional (2D) orthogonal packing problem, where a fixed set of small rectangles has to be placed on a larger stock rectangle in such a way that the amount of trim loss is minimized. The algorithm we propose hybridizes a placement procedure with a genetic algorithm based on random keys. The approach is tested on a set of instances taken from the literature and compared with other approaches. The computation results validate the quality of the solutions and the effectiveness of the proposed algorithm.  相似文献   
5.
The nanogranular nature of C-S-H   总被引:6,自引:0,他引:6  
Despite its ubiquitous presence as binding phase in all cementitious materials, the mechanical behavior of calcium-silicate-hydrates (C-S-H) is still an enigma that has deceived many decoding attempts from experimental and theoretical sides. In this paper, we propose and validate a new technique and experimental protocol to rationally assess the nanomechanical behavior of C-S-H based on a statistical analysis of hundreds of nanoindentation tests. By means of this grid indentation technique we identify in situ two structurally distinct but compositionally similar C-S-H phases heretofore hypothesized to exist as low density (LD) C-S-H and high density (HD) C-S-H, or outer and inner products. The main finding of this paper is that both phases exhibit a unique nanogranular behavior which is driven by particle-to-particle contact forces rather than by mineral properties. We argue that this nanomechanical blueprint of material invariant behavior of C-S-H is a consequence of the hydration reactions during which precipitating C-S-H nanoparticles percolate generating contact surfaces. As hydration proceeds, these nanoparticles pack closer to center on-average around two characteristic limit packing densities, the random packing limit (η=64%) and the ordered face-centered cubic (fcc) or hexagonal close-packed (hcp) packing limit (η=74%), forming a characteristic LD C-S-H and HD C-S-H phase.  相似文献   
6.
Given a treeG = (V, E) and a weight function defined on subsets of its nodes, we consider two associated problems. The first, called the rooted subtree problem, is to find a maximum weight subtree, with a specified root, from a given set of subtrees.The second problem, called the subtree packing problem, is to find a maximum weight packing of node disjoint subtrees chosen from a given set of subtrees, where the value of each subtree may depend on its root.We show that the complexity status of both problems is related, and that the subtree packing problem is polynomial if and only if each rooted subtree problem is polynomial. In addition we show that the convex hulls of the feasible solutions to both problems are related: the convex hull of solutions to the packing problem is given by pasting together the convex hulls of the rooted subtree problems.We examine in detail the case where the set of feasible subtrees rooted at nodei consists of all subtrees with at mostk nodes. For this case we derive valid inequalities, and specify the convex hull whenk 4.Research supported in part by Nato Collaborative Research Grant CRG 900281, Science Program SC1-CT91-620 of the EEC, and contract No 26 of the programme Pôle d'attraction interuniversitaire of the Belgian government.  相似文献   
7.
Seymour (1981) proved that the cut criterion is necessary and sufficient for the solvability of the edge-disjoint paths problem when the union of the supply graph and the demand graph is planar and Eulerian. When only planarity is required, Middendorf and Pfeiffer (1993) proved the problem to be NP-complete. For this case, Korach and Penn (1992) proved that the cut criterion is sufficient for the existence of a near-complete packing of paths. Here we generalize this result by showing how a natural strengthening of the cut criterion yields better packings of paths.Analogously to Seymour's approach, we actually prove a theorem on packing cuts in an arbitrary graph and then the planar edge-disjoint paths case is obtained by planar dualization. The main result is derived from a theorem of Seb (1990) on the structure of ±1 weightings of a bipartite graph with no negative circuits.Research partially supported by the Hungarian National Foundation for Scientific Research Grants OTKA 2118 and 4271.  相似文献   
8.
Qu Q  Hu X  Zhu X  Gao S  Xu Q  Wang Y  Wang X 《Journal of separation science》2004,27(14):1229-1232
This paper introducesa novel method for packing Capillary Electrochromatography Columns (CEC). Using vacuum packing methodology, silica particles as small as 1 microm were successfully packed into the capillary columns with 75 microm inner diameter. The columns are verystable and show no noticeable loss in efficiency after 200 sample injections. The performance of these vacuum packed capillary columns was evaluated with a mixture of aromatic and non-aromatic compounds. A 24 cm long capillary column can produce peak efficiencies of around 45,000 plates for benzene.  相似文献   
9.
The Brazilian agriculture activities have consumed about 288,000 tons of pesticides per year conditioned in about 107,000,000 packing with weight of approximately 23,000 tons. The discharge of empty plastic packing of pesticides can be an environmental concern causing problems to human health, animals, and plants if done without inspection and monitoring. The objective of this work is to study the ionizing radiation effect in the main pesticides used in Brazil for plastic packing decontamination. Among the commercial pesticides, chlorpyrifos has significant importance because of its wide distribution and extensive use and persistence. The radiation-induced degradation of chlorpyrifos in liquid samples and in polyethylene pack was studied by gamma radiolysis. Packing of high-density polyethylene (HDPE) three layer coextruded, named COEX, contaminated with chlorpyrifos, were irradiated using both a multipurpose Co-60 gamma irradiator and a gamma source with 5000 Ci total activity Gamma cell type. The chemical analysis of the chlorpyrifos was made using a gas chromatography associated to the Mass Spectrometry—GCMS from Shimadzu Model QP 5000. Gamma radiation was efficient for removing chlorpyrifos from the plastic packing, in all studied cases.  相似文献   
10.
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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