全文获取类型
收费全文 | 1736篇 |
免费 | 247篇 |
国内免费 | 224篇 |
专业分类
电工技术 | 96篇 |
综合类 | 131篇 |
化学工业 | 102篇 |
金属工艺 | 10篇 |
机械仪表 | 71篇 |
建筑科学 | 24篇 |
矿业工程 | 11篇 |
能源动力 | 22篇 |
轻工业 | 133篇 |
水利工程 | 7篇 |
石油天然气 | 4篇 |
武器工业 | 6篇 |
无线电 | 348篇 |
一般工业技术 | 150篇 |
冶金工业 | 8篇 |
原子能技术 | 15篇 |
自动化技术 | 1069篇 |
出版年
2024年 | 19篇 |
2023年 | 50篇 |
2022年 | 71篇 |
2021年 | 89篇 |
2020年 | 77篇 |
2019年 | 72篇 |
2018年 | 62篇 |
2017年 | 68篇 |
2016年 | 87篇 |
2015年 | 113篇 |
2014年 | 117篇 |
2013年 | 143篇 |
2012年 | 113篇 |
2011年 | 152篇 |
2010年 | 81篇 |
2009年 | 90篇 |
2008年 | 114篇 |
2007年 | 112篇 |
2006年 | 107篇 |
2005年 | 94篇 |
2004年 | 82篇 |
2003年 | 63篇 |
2002年 | 65篇 |
2001年 | 53篇 |
2000年 | 28篇 |
1999年 | 12篇 |
1998年 | 13篇 |
1997年 | 6篇 |
1996年 | 11篇 |
1995年 | 8篇 |
1994年 | 4篇 |
1993年 | 4篇 |
1992年 | 3篇 |
1991年 | 5篇 |
1990年 | 5篇 |
1989年 | 2篇 |
1988年 | 1篇 |
1987年 | 2篇 |
1986年 | 1篇 |
1985年 | 2篇 |
1981年 | 1篇 |
1980年 | 1篇 |
1979年 | 2篇 |
1977年 | 1篇 |
1971年 | 1篇 |
排序方式: 共有2207条查询结果,搜索用时 31 毫秒
1.
《Food Control》2015
Cookies and biscuits are a recognized source of trans fatty acids (TFA). Aware of its consumption worldwide, an update on TFA content was taken in 2012, in a total of 50 samples commercialized in Portugal. Despite the absence of specific Portuguese legislation, TFA amounts in cookies and biscuits are generally low, with TFA amounts lower than 0.1 g per 100 g, and an average of 0.6% in the extracted fat in 49 of the 50 samples analyzed. Unfortunately, one sample presented 27% of TFA in the lipids, highlighting that the problem is still present. Also, a high prevalence of saturated fatty acids was observed, as high as 92.4% in the fat (53.0% on average). This fact is also a major health concern, particularly when the reformulation of these products in the last years (2006–2012) was effective regarding TFA reduction but seemed to have occurred at expenses of increasing SFA, thus reducing the potential beneficial effect achievable by replacing with cis-unsaturated fats, as generally recommended. 相似文献
2.
During restructuring processes, due to mergers and acquisitions, banks frequently face the problem of having redundant branches competing in the same market. In this work, we introduce a new Capacitated Branch Restructuring Model which extends the available literature in delocation models. It considers both closing down and long term operations׳ costs, and addresses the problem of resizing open branches in order to maintain a constant service level. We consider, as well, the presence of competitors and allow for ceding market share whenever the restructuring costs are prohibitively expensive.We test our model in a real life scenario, obtaining a reduction of about 40% of the network size, and annual savings over 45% in operation costs from the second year on. We finally perform a sensitivity analysis on critical parameters. This analysis shows that the final design of the network depends on certain strategic decisions concerning the redundancy of the branches, as well as their proximity to the demand nodes and to the competitor׳s branches. At the same time, this design is quite robust to changes in the parameters associated with the adjustments on service capacity and with the market reaction. 相似文献
3.
Given a collection of n locations and a symmetric measure of distance (difference) between each pair of locations, we seek to identify (select) a subset of p locations so as to achieve two distinct objectives. The first objective is to use the selected locations as centers (medians) of p groups that would partition the entire collection and minimize the total distance between the locations and their respective group medians. The second objective is to maximize the minimum distance (diversity) among the selected locations themselves. We study this problem as a multi-objective optimization problem and propose an iterative algorithm to obtain its non-dominated frontier. At each iteration we construct and solve a 0–1 integer programming problem. Through a computational experiment we show that this algorithm is computationally effective for small to medium size instances of the problem. We also propose a Lagrangian heuristic algorithm for solving larger instances of this problem. 相似文献
4.
5.
In this paper we study the optimization issues of ring networks employing novel parallel multi‐granularity hierarchical optical add‐drop multiplexers (OADMs). In particular, we attempt to minimize the number of control elements for the off‐line case. We present an integer linear programming formulation to obtain the lower bound in optimization, and propose an efficient heuristic algorithm called global bandwidth resource assignment that is suitable for the design of large‐scale OADM networks. 相似文献
6.
M. J. O’Sullivan C. G. Walker M. L. O’Sullivan T. D. Thompson A. B. Philpott 《Telecommunication Systems》2006,33(4):353-376
The problem of designing fibre-optic networks for local-access telecommunications generates (at least) three non-trivial subproblems.
In the first of these subproblems one must determine how many fibre-optic cables (fibres) are required at either end of a
street. In the next subproblem a minimum-cost network must be designed to support the fibres. The network must also provide
distinct paths from either end of the street to the central exchange(s). Finally, the fibre-optic cables must be placed in
protective covers. These covers are available in a number of different sizes, allowing some flexibility when covering each
section of the network. In this paper we describe a dynamic programming (DP) formulation for finding a minimum-cost (protective)
covering for the network (the third of the subproblems). This problem is a generalised set covering problem with side constraints
and is further complicated by the introduction of fixed and variable welding costs. The DP formulation selects covers along
each arc (in the network), but cannot exactly model the fixed costs and so does not guarantee optimality. We also describe
an integer programming (IP) formulation for assessing the quality of the DP solutions. The cost of the networks constructed
by the IP model is less than those designed using the DP model, but the saving is not significant for the problems examined
(less than 0.1%). This indicates that the DP model will generally give very good solutions. Furthermore, as the problem dimensions
grow, DP gives significantly better solution times than IP. 相似文献
7.
8.
多协议标记交换(MPLS)技术是综合利用网络第二层交换技术的有效性和第三层IP路由的灵活性等优点而产生的多层交换技术。通过在传统的IP包里加入标记,使路由转发依赖于标记,大大地提高IP包的转发速度,同时可使传统IP网络具有服务质量(QoS)能力。现主要分析MPLS体系结构,指出MPLS的一些应用。 相似文献
9.
10.
啤酒标签用铝箔力学性能研究 总被引:3,自引:2,他引:1
分析研究了连续铸轧坯料的合金成分,冶金组织和热处理工艺对啤酒标用铝箔力学性能的影响,选定成形性优良的合金系列,并优化铸轧工艺和热处理工艺是提高铝箔力学性能的关键。 相似文献