全文获取类型
收费全文 | 302篇 |
免费 | 9篇 |
专业分类
电工技术 | 2篇 |
化学工业 | 57篇 |
金属工艺 | 2篇 |
机械仪表 | 4篇 |
建筑科学 | 10篇 |
能源动力 | 5篇 |
轻工业 | 29篇 |
水利工程 | 4篇 |
无线电 | 13篇 |
一般工业技术 | 34篇 |
冶金工业 | 63篇 |
自动化技术 | 88篇 |
出版年
2023年 | 3篇 |
2022年 | 5篇 |
2021年 | 6篇 |
2020年 | 4篇 |
2019年 | 6篇 |
2018年 | 9篇 |
2017年 | 3篇 |
2016年 | 7篇 |
2015年 | 9篇 |
2014年 | 11篇 |
2013年 | 13篇 |
2012年 | 18篇 |
2011年 | 21篇 |
2010年 | 22篇 |
2009年 | 15篇 |
2008年 | 18篇 |
2007年 | 7篇 |
2006年 | 17篇 |
2005年 | 10篇 |
2004年 | 13篇 |
2003年 | 8篇 |
2002年 | 8篇 |
2001年 | 4篇 |
2000年 | 4篇 |
1999年 | 2篇 |
1998年 | 5篇 |
1997年 | 5篇 |
1996年 | 5篇 |
1995年 | 7篇 |
1994年 | 5篇 |
1993年 | 2篇 |
1990年 | 4篇 |
1989年 | 2篇 |
1988年 | 3篇 |
1984年 | 3篇 |
1981年 | 2篇 |
1978年 | 3篇 |
1974年 | 1篇 |
1964年 | 1篇 |
1961年 | 1篇 |
1959年 | 1篇 |
1957年 | 1篇 |
1955年 | 1篇 |
1954年 | 1篇 |
1953年 | 1篇 |
1951年 | 2篇 |
1950年 | 1篇 |
1949年 | 1篇 |
1948年 | 1篇 |
1947年 | 1篇 |
排序方式: 共有311条查询结果,搜索用时 15 毫秒
1.
Preemptive scheduling problems on parallel machines are classic problems. Given the goal of minimizing the makespan, they are polynomially solvable even for the most general model of unrelated machines. In these problems, a set of jobs is to be assigned to run on a set of m machines. A job can be split into parts arbitrarily and these parts are to be assigned to time slots on the machines without parallelism, that is, for every job, at most one of its parts can be processed at each time. Motivated by sensitivity analysis and online algorithms, we investigate the problem of designing robust algorithms for constructing preemptive schedules. Robust algorithms receive one piece of input at a time. They may change a small portion of the solution as an additional part of the input is revealed. The capacity of change is based on the size of the new piece of input. For scheduling problems, the supremum ratio between the total size of the jobs (or parts of jobs) which may be re-scheduled upon the arrival of a new job j, and the size of j, is called migration factor. We design a strongly optimal algorithm with the migration factor $1-\frac{1}{m}$ for identical machines. Strongly optimal algorithms avoid idle time and create solutions where the (non-increasingly) sorted vector of completion times of the machines is lexicographically minimal. In the case of identical machines this results not only in makespan minimization, but the created solution is also optimal with respect to any ? p norm (for p>1). We show that an algorithm of a smaller migration factor cannot be optimal with respect to makespan or any other ? p norm, thus the result is best possible in this sense as well. We further show that neither uniformly related machines nor identical machines with restricted assignment admit an optimal algorithm with a constant migration factor. This lower bound holds both for makespan minimization and for any ? p norm. Finally, we analyze the case of two machines and show that in this case it is still possible to maintain an optimal schedule with a small migration factor in the cases of two uniformly related machines and two identical machines with restricted assignment. 相似文献
2.
Cleland LG Proudman SM Hall C Stamp LK McWilliams L Wylie N Neumann M Gibson RA James MJ 《Lipids》2003,38(4):419-424
Dietary fish oil supplements have been shown to have benefits in rheumatoid arthritis (RA), other inflammatory diseases, and
in cardiovascular disease. As with any medical advice, variability will exist with regard to adherence and consequent biochemical
or pharmacophysiologic effects. The aim was to explore the utility of plasma phospholipid EPA as a measure of n−3 PUFA intake
and response to standardized therapeutic advice given in an outpatient or office practice setting, to increase dietary n−3
PUFA, including a fish oil supplement. Patients with early RA were given verbal and written advice to alter their dietary
n−3 PUFA intake, including ingestion of 20 mL of bottled fish oil on juice daily. The advice included instructions to increase
n−3 PUFA and to avoid foods rich in n−6 PUFA. Every 3 mon, blood samples were obtained for analysis of plasma phospholipid
FA. Plasma phospholipid EPA was used as the primary index of n−3 PUFA intake. A diverse response was seen, with about one-third
of patients achieving a substantial elevation of plasma phospholipid EPA over the 12-mon study period. A third had little
change, with the remainder achieving intermediate levels. Data obtained longitudinally from individual patients indicated
that substantial elevations of EPA (>5% total plasma phospholipid FA) could be maintained for more than 3 yr. Plasma phospholipid
EPA is a convenient measure of adherence to advice to take a dietary n−3 PUFA-rich fish oil supplement. This measure may prove
a useful adjunct to intention to treat analyses in determining the effect of dietary fish oil supplements on long-term outcomes
in arthritis and other chronic inflammatory diseases. It may also provide a guide to the effectiveness of therapeutic and
preventive messages designed to increase n−3 PUFA intake. 相似文献
3.
4.
Joshua M. Little Jiayue Sun Ali Kamali Amy Chen Asher C. Leff Yang Li Leah K. Borden Thilini U. Dissanayake Deborah Essumang Benita O. Oseleononmen Dongxia Liu Taylor J. Woehl Po-Yen Chen 《Advanced functional materials》2023,33(30):2215222
Assembling 2D-material (2DM) nanosheets into micro- and macro-architectures with augmented functionalities requires effective strategies to overcome nanosheet restacking. Conventional assembly approaches involve external binders and/or functionalization, which inevitably sacrifice 2DM's nanoscale properties. Noble metal ions (NMI) are promising ionic crosslinkers, which can simultaneously assemble 2DM nanosheets and induce synergistic properties. Herein, a collection of NMI–2DM complexes are screened and categorized into two sub-groups. Based on the zeta potentials, two assembly approaches are developed to obtain 1) NMI-crosslinked 2DM hydrogels/aerogels for heterostructured catalysts and 2) NMI–2DM inks for templated synthesis. First, tetraammineplatinum(II) nitrate (TPtN) serves as an efficient ionic crosslinker to agglomerate various 2DM dispersions. By utilizing micro-textured assembly platforms, various TPtN–2DM hydrogels are fabricated in a scalable fashion. Afterward, these hydrogels are lyophilized and thermally reduced to synthesize Pt-decorated 2DM aerogels (Pt@2DM). The Pt@2DM heterostructures demonstrate high, substrate-dependent catalytic activities and promote different reaction pathways in the hydrogenation of 3-nitrostyrene. Second, PtCl4 can be incorporated into 2DM dispersions at high NMI molarities to prepare a series of PtCl4–2DM inks with high colloidal stability. By adopting the PtCl4–graphene oxide ink, various Pt micro-structures with replicated topographies are synthesized with accurate control of grain sizes and porosities. 相似文献
5.
Leah Epstein 《Algorithmica》2010,56(4):505-528
We consider the following generalization of bin packing. Each item has a size in (0,1] associated with it, as well as a rejection
cost, that an algorithm must pay if it chooses not to pack this item. The cost of an algorithm is the sum of all rejection
costs of rejected items plus the number of unit sized bins used for packing all other items.
We first study the offline version of the problem and design an APTAS for it. This is a non-trivial generalization of the
APTAS given by Fernandez de la Vega and Lueker for the standard bin packing problem. We further give an approximation algorithm
of an absolute approximation ratio 3/2, where this value is best possible unless P=NP. 相似文献
6.
Leah Epstein 《Theoretical computer science》2010,411(31-33):2899-2911
In two-dimensional bin packing problems, the input items are rectangles which need to be packed in a non-overlapping manner. The goal is to assign the items into unit squares using an axis-parallel packing. Most previous work on online packing concentrated on items of fixed orientation, which must be assigned such that their bottom side is parallel to the bottom of the bin. In this paper we study the case of rotatable items, which can be rotated by ninety degrees. We give almost tight bounds on the (asymptotic) competitive ratio of bounded space bin packing of rotatable items, and introduce a new unbounded space algorithm. This improves the results of Fujita and Hada. 相似文献
7.
Personalized graphical user interfaces have the potential to reduce visual complexity and improve interaction efficiency by tailoring elements such as menus and toolbars to better suit an individual user's needs. When an interface is personalized to make useful features more accessible for a user's current task, however, there may be a negative impact on the user's awareness of the full set of available features, making future tasks more difficult. To assess this tradeoff we introduce awareness as an evaluation metric to be used in conjunction with performance. We then discuss three studies we have conducted, which show that personalized interfaces tradeoff awareness of unused features for performance gains on core tasks. The first two studies, previously published and presented only in summary, demonstrate this tradeoff by measuring awareness using a recognition test of unused features in the interface. The studies also evaluated two different types of personalized interfaces: a layered interfaces approach and an adaptive split menu approach. The third study, presented in full, focuses on adaptive split menus and extends results from the first two studies to show that different levels of awareness also correspond to an impact on performance when users are asked to complete new tasks. Based on all three studies and a survey of related work, we outline a design space of personalized interfaces and present several factors that could affect the tradeoff between core task performance and awareness. Finally, we provide a set of design implications that should be considered for personalized interfaces. 相似文献
8.
Accurate detection of mediated haptic information in minimally invasive surgery (MIS) is critical for applying appropriate force magnitudes onto soft tissue with the aim of minimising tissue trauma. Force perception in MIS is a dynamic process, with surgeons’ administration of force into tissue revealing information about the remote surgical site which further informs the surgeons’ haptic interactions. The relationship between applied force and material deformation rate provides biomechanical information specifying the deformation distance remaining until a tissue will fail: which is termed distance-to-break (DTB). The current study demonstrates that observers can detect DTB while deforming simulated tissues and stop before reaching the tissues’ failure points. The design of training simulators, control devices and automated robotic systems for applications outside of MIS is discussed.
Practitioner Summary: In MIS, haptic information is critical for applying appropriate forces onto soft tissue to minimise tissue trauma. Observers used force information to detect how far they could deform a virtual tissue before it would break. The design of training simulators, control devices and automated robotic systems is discussed. 相似文献
9.
10.
Following recent interest in the study of computer science problems in a game theoretic setting, we consider the well known
bin packing problem where the items are controlled by selfish agents. Each agent is charged with a cost according to the fraction
of the used bin space its item requires. That is, the cost of the bin is split among the agents, proportionally to their sizes.
Thus, the selfish agents prefer their items to be packed in a bin that is as full as possible. The social goal is to minimize
the number of the bins used. The social cost in this case is therefore the number of bins used in the packing. 相似文献