全文获取类型
收费全文 | 3301篇 |
免费 | 624篇 |
国内免费 | 582篇 |
专业分类
电工技术 | 114篇 |
综合类 | 328篇 |
化学工业 | 22篇 |
金属工艺 | 17篇 |
机械仪表 | 91篇 |
建筑科学 | 39篇 |
矿业工程 | 43篇 |
能源动力 | 6篇 |
轻工业 | 35篇 |
水利工程 | 23篇 |
石油天然气 | 16篇 |
武器工业 | 17篇 |
无线电 | 415篇 |
一般工业技术 | 73篇 |
冶金工业 | 68篇 |
原子能技术 | 6篇 |
自动化技术 | 3194篇 |
出版年
2024年 | 10篇 |
2023年 | 37篇 |
2022年 | 82篇 |
2021年 | 73篇 |
2020年 | 91篇 |
2019年 | 58篇 |
2018年 | 85篇 |
2017年 | 119篇 |
2016年 | 117篇 |
2015年 | 171篇 |
2014年 | 252篇 |
2013年 | 199篇 |
2012年 | 277篇 |
2011年 | 329篇 |
2010年 | 267篇 |
2009年 | 283篇 |
2008年 | 326篇 |
2007年 | 291篇 |
2006年 | 220篇 |
2005年 | 196篇 |
2004年 | 202篇 |
2003年 | 147篇 |
2002年 | 128篇 |
2001年 | 112篇 |
2000年 | 77篇 |
1999年 | 54篇 |
1998年 | 60篇 |
1997年 | 53篇 |
1996年 | 26篇 |
1995年 | 29篇 |
1994年 | 32篇 |
1993年 | 26篇 |
1992年 | 13篇 |
1991年 | 14篇 |
1990年 | 5篇 |
1989年 | 7篇 |
1988年 | 3篇 |
1987年 | 5篇 |
1986年 | 7篇 |
1985年 | 9篇 |
1984年 | 2篇 |
1982年 | 2篇 |
1981年 | 3篇 |
1980年 | 1篇 |
1978年 | 1篇 |
1975年 | 1篇 |
1963年 | 1篇 |
1959年 | 1篇 |
1956年 | 2篇 |
1955年 | 1篇 |
排序方式: 共有4507条查询结果,搜索用时 15 毫秒
1.
《Journal of dairy science》2022,105(3):2708-2717
Each cow in a group has different nutritional requirements even if the group is formed by cows of similar age, number of lactations, and lactation stage. Common dairy farm management setup does not support formulating a diet that accurately matches individual nutritional requirements for each cow; therefore, a proportion of cows in the group will be overfed and another proportion underfed. Overfeeding and underfeeding cows increases the risk of metabolic diseases, decreases milk production, and increases nutrient waste. Consequently, profitability of dairy farms and the environment are negatively affected. Nutritional grouping is a management strategy that aims to allocate lactating cows homogeneously according to their nutritional requirements. Groups of cows with more uniform nutritional requirements facilitates the formulation of more accurate diets for the group. Current availability of large data streams on dairy farms facilitates the design of algorithms to implement nutritional grouping. Our review summarizes important factors to consider when grouping cows, describes nutritional grouping approaches, and summarizes benefits of implementing nutritional grouping in dairy farms. 相似文献
2.
针对基于位置服务中连续查询情况下,用户自身属性信息很容易被攻击者获取,并通过关联获得用户位置隐私的情况,提出了一种利用粒子群聚类加速相似属性用户寻找,并由相似属性匿名实现用户位置泛化的隐私保护方法。该方法利用位置隐私保护中常用的可信中心服务器,通过对发送到中心服务器中的查询信息进行粒子群属性聚类,在聚类的过程中加速相似属性用户的寻找过程,由相似属性用户完成位置泛化,以此实现位置隐私保护。实验结果证明,这种基于粒子群属性聚类的隐私保护方法具有高于同类算法的隐私保护能力,以及更快的计算处理速度。 相似文献
3.
To improve the convertibility of reconfigurable manufacturing system (RMS), the concept of delayed reconfigurable manufacturing system (D-RMS) was proposed. RMS and D-RMS are both constructed around part family. However, D-RMS may suffer from ultra-long system problem with unacceptable idle machines using generic RMS part families. Besides, considering the complex basic system structure of D-RMS, machine selection of D-RMS should be addressed, including dedicated machine, flexible machine, and reconfigurable machine. Therefore, a system design method for D-RMS based on part family grouping and machine selection is proposed. Firstly, a part family grouping method is proposed for D-RMS that groups the parts with more former common operations into the same part family. The concept of longest relative position common operation subsequence (LPCS) is proposed. The similarity coefficient among the parts is calculated based on LPCS. The reciprocal value of the operation position of LPCS is adopted as the characteristic value. The average linkage clustering (ALC) algorithm is used to cluster the parts. Secondly, a machine selection method is proposed to complete the system design of D-RMS, including machine selection rules and the dividing point decision model. Finally, a case study is given to implement and verify the proposed system design method for D-RMS. The results show that the proposed system design method is effective, which can group parts with more former common operations into the same part family and select appropriate machine types. 相似文献
4.
In this paper we demonstrate that it is possible to enrich query answering with a short data movie that gives insights to the original results of an OLAP query. Our method, implemented in an actual system, CineCubes, includes the following steps. The user submits a query over an underlying star schema. Taking this query as input, the system comes up with a set of queries complementing the information content of the original query, and executes them. For each of the query results, we execute a set of highlight extraction algorithms that identify interesting patterns and values in the data of the results. Then, the system visualizes the query results and accompanies this presentation with a text commenting on the result highlights. Moreover, via a text-to-speech conversion the system automatically produces audio for the constructed text. Each combination of visualization, text and audio practically constitutes a movie, which is wrapped as a PowerPoint presentation and returned to the user. 相似文献
5.
The generic model query language GMQL is designed to query collections of conceptual models created in arbitrary graph-based modelling languages. Querying conceptual models means searching for particular model subgraphs that comply with a predefined pattern query. Such a query specifies the structural and semantic properties of the model fragment to be returned. In this paper, we derive requirements for a generic model query language from the literature and formally specify the language’s syntax and semantics. We conduct an analysis of GMQL׳s theoretical and practical runtime performance concluding that it returns query results within satisfactory time. Given its generic nature, GMQL contributes to a broad range of different model analysis scenarios ranging from business process compliance management to model translation and business process weakness detection. As GMQL returns results with acceptable runtime performance, it can be used to query large collections of hundreds or thousands of conceptual models containing not only process models, but also data models or organizational charts. In this paper, we furthermore evaluate GMQL against the backdrop of existing query approaches thereby carving out its advantages and limitations as well as pointing toward future research. 相似文献
6.
专家发现是实体检索领域的一个研究热点,针对经典专家发现模型存在索引术语独立性假设与检索性能低的缺陷,提出一种基于贝叶斯网络模型的专家发现方法。该方法模型采用四层网络结构,能够实现图形化的概率推理,同时运用词向量技术能够实现查询术语的语义扩展。实验结果显示该模型在多个评价指标上均优于经典专家发现模型,能够有效实现查询术语语义扩展,提高专家检索性能。 相似文献
7.
针对连续查询位置服务中构造匿名区域未考虑语义位置信息导致敏感隐私泄露问题,通过设计[(K,θ)]-隐私模型,提出一种路网环境下面向连续查询的敏感语义位置隐私保护方案。该方案利用Voronoi图将城市路网预先划分为独立的Voronoi单元,依据用户的移动路径和移动速度,选择具有相似特性的其他[K-1]个用户,构建匿名用户集;利用匿名用户集用户设定的敏感语义位置类型和语义安全阈值,以及用户所处语义位置的Voronoi单元,构建满足[(K,θ)]-隐私模型的语义安全匿名区域,可以同时防止连续查询追踪攻击和语义推断攻击。实验结果表明,与SCPA算法相比,该方案在隐私保护程度上提升约15%,系统开销上降低约20%。 相似文献
8.
The operational planning of distribution network for automotive industry is complex with many conditions to consider, including heterogeneous fleet, enforcing the feasibility of 3D-packing of pallets into vehicles to address the vehicle's capacity in terms of weight and volume, compatibility of orders in a vehicle, returning empty pallets from assembly-plants backwards to suppliers, and delivery time windows. A mathematical model (MILP) is proposed that takes account of these conditions to minimise total transportation costs. The network structure can be a combination of direct shipment and milk-run for both forward and reverse flow of pallets. The model is solved optimally for small-size problems. For solving larger problems, a heuristic algorithm (in two versions) is proposed that uses a similarity measure to generate a reasonable list of orders. Best/first-fit strategies are employed to generate a feasible solution with the aid of a relaxed version of the proposed MILP. Improvement heuristics are also designed. Unlike most of existing constructive heuristics, our aim for developing the heuristic approach is to force routing decision, with all of its considerations, being made optimal. We also use the proposed best-fit strategy in the body of grouping evolution strategy (GES) algorithm to attain an effective meta-heuristic approach. The effectiveness of heuristics is tested on generated instances which demonstrates they are optimal for small-size problems. They are also tested on the data of daily auto-parts shipments gathered from the largest Iranian automobile company. Results demonstrate there exists a significant potential for cost saving through milk-run strategy compared with the direct shipping strategy. 相似文献
9.
Automatic feature recognition aids downstream processes such as engineering analysis and manufacturing planning. Not all features can be defined in advance; a declarative approach allows engineers to specify new features without having to design algorithms to find them. Naive translation of declarations leads to executable algorithms with high time complexity. Database queries are also expressed declaratively; there is a large literature on optimizing query plans for efficient execution of database queries. Our earlier work investigated applying such technology to feature recognition, using a testbed interfacing a database system (SQLite) to a CAD modeler (CADfix). Feature declarations were translated into SQL queries which are then executed.The current paper extends this approach, using the PostgreSQL database, and provides several new insights: (i) query optimization works quite differently in these two databases, (ii) with care, an approach to query translation can be devised that works well for both databases, and (iii) when finding various simple common features, linear time performance can be achieved with respect to model size, with acceptable times for real industrial models. Further results also show how (i) lazy evaluation can be used to reduce the work performed by the CAD modeler, and (ii) estimating the time taken to compute various geometric operations can further improve the query plan. Experimental results are presented to validate our main conclusions. 相似文献
10.