全文获取类型
收费全文 | 63篇 |
免费 | 3篇 |
专业分类
金属工艺 | 7篇 |
机械仪表 | 11篇 |
建筑科学 | 4篇 |
轻工业 | 5篇 |
水利工程 | 1篇 |
无线电 | 3篇 |
一般工业技术 | 6篇 |
自动化技术 | 29篇 |
出版年
2023年 | 2篇 |
2020年 | 2篇 |
2015年 | 4篇 |
2014年 | 1篇 |
2013年 | 4篇 |
2012年 | 2篇 |
2011年 | 5篇 |
2010年 | 2篇 |
2009年 | 4篇 |
2008年 | 3篇 |
2007年 | 8篇 |
2006年 | 4篇 |
2005年 | 1篇 |
2004年 | 6篇 |
2003年 | 4篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1999年 | 1篇 |
1997年 | 4篇 |
1995年 | 1篇 |
1993年 | 1篇 |
1984年 | 1篇 |
1978年 | 1篇 |
排序方式: 共有66条查询结果,搜索用时 15 毫秒
1.
2.
一种基于四叉树结构的排料算法 总被引:5,自引:0,他引:5
提出了一种利用四叉树结构来描述矩形物体排料过程的算法。为了确保排料布局的合理性,满足工业上的一刀切要求,需采用组合规则和邻接规则来合成矩形块,这样做还可减少废料碎片、降低算法复杂度、提高板材利用率。 相似文献
3.
4.
K. Heinke Schlünzen David Grawe Ingo Schlüter 《Journal of Wind Engineering & Industrial Aerodynamics》2011,99(4):217-225
Obstacles considerably influence boundary layer processes. Their influences have been included in mesoscale models (MeM) for a long time. Methods used to parameterise obstacle effects in a MeM are summarised in this paper using results of the mesoscale model METRAS as examples. Besides the parameterisation of obstacle influences it is also possible to use a joint modelling approach to describe obstacle induced and mesoscale changes. Three different methods may be used for joint modelling approaches: The first method is a time-slice approach, where steady basic state profiles are used in an obstacle resolving microscale model (MiM, example model MITRAS) and diurnal cycles are derived by joining steady-state MITRAS results. The second joint modelling approach is one-way nesting, where the MeM results are used to initialise the MiM and to drive the boundary values of the MiM dependent on time. The third joint modelling approach is to apply multi-scale models or two-way nesting approaches, which include feedbacks from the MiM to the MeM. The advantages and disadvantages of the different approaches and remaining problems with joint Reynolds-averaged Navier-Stokes modelling approaches are summarised in the paper. 相似文献
5.
Optimal packing using the multiple mating method 总被引:1,自引:0,他引:1
A new method for the solution of the packing problem is presented. The method introduces a mating concept to the problem. The mating allows one or more objects to be positioned relative to the other by applying mating conditions that are derived from the geometric features among them. Once mated, objects within a mating pair or a mating group are treated as one object and do not need to be positioned separately. In addition, overlap calculation among objects within the mating group is not necessary. The algorithm thus brings a significant reduction in search space and the overall time taken to converge. 相似文献
6.
为了探讨紧密纺集聚区牵伸倍数对成纱质量的影响,在自行改造的EJM128K-SM型细纱机上进行了纺纱试验.集聚区牵伸倍数采用1.03倍~1.10倍,测试了CJ 14.6 tex紧密纱的毛羽、强伸性能及条干均匀度指标.结果表明:集聚区牵伸倍数对成纱质量有影响,随着集聚区牵伸倍数增大,紧密纱毛羽增多;集聚区牵伸倍数过大或过小,紧密纱断裂强力、强力CV、断裂伸长率等强伸性能指标较差,成纱条干均匀度也会有轻微的恶化.综合分析,纺CJ 14.6 tex紧密纱,集聚区牵伸倍数以1.05倍为宜. 相似文献
7.
8.
We present an algorithm for finding a solution to the two-dimensional translational approximate multiple containment problem: find translations for k polygons which place them inside a polygonal container so that no point of any polygon is more than 2ε inside of the boundary of any other polygon. The polygons and container may be nonconvex. The value of ε is an input to the algorithm. In industrial applications the containment solution acts as a guide to a machine cutting out
polygonal shapes from a sheet of material. If ε is chosen to be a fraction of the cutter's accuracy, then the solution to the approximate containment problem is sufficient
for industrial purposes.
Given a containment problem, we characterize its solution and create a collection of containment subproblems from this characterization.
We solve each subproblem by first restricting certain two-dimensional configuration spaces until a steady state is reached,
and then testing for a solution inside the configuration spaces. If necessary, we subdivide the configuration spaces to generate
new subproblems. The running time of our algorithm is , where s is the largest number of vertices of any polygon generated by a restriction operation. In the worst case s can be exponential in the size of the input, but, in practice, it is usually not more than quadratic.
Received June 24, 1994; revised August 22, 1995. 相似文献
9.
10.