全文获取类型
收费全文 | 770篇 |
免费 | 18篇 |
国内免费 | 23篇 |
专业分类
电工技术 | 2篇 |
综合类 | 15篇 |
化学工业 | 6篇 |
金属工艺 | 14篇 |
机械仪表 | 19篇 |
建筑科学 | 80篇 |
矿业工程 | 3篇 |
能源动力 | 3篇 |
轻工业 | 4篇 |
石油天然气 | 1篇 |
武器工业 | 3篇 |
无线电 | 64篇 |
一般工业技术 | 45篇 |
冶金工业 | 1篇 |
原子能技术 | 1篇 |
自动化技术 | 550篇 |
出版年
2023年 | 4篇 |
2022年 | 11篇 |
2021年 | 14篇 |
2020年 | 6篇 |
2019年 | 9篇 |
2018年 | 8篇 |
2017年 | 16篇 |
2016年 | 25篇 |
2015年 | 20篇 |
2014年 | 27篇 |
2013年 | 51篇 |
2012年 | 44篇 |
2011年 | 72篇 |
2010年 | 27篇 |
2009年 | 48篇 |
2008年 | 53篇 |
2007年 | 66篇 |
2006年 | 60篇 |
2005年 | 21篇 |
2004年 | 33篇 |
2003年 | 25篇 |
2002年 | 21篇 |
2001年 | 14篇 |
2000年 | 19篇 |
1999年 | 11篇 |
1998年 | 15篇 |
1997年 | 11篇 |
1996年 | 12篇 |
1995年 | 6篇 |
1994年 | 8篇 |
1993年 | 9篇 |
1992年 | 5篇 |
1991年 | 7篇 |
1990年 | 5篇 |
1989年 | 3篇 |
1988年 | 5篇 |
1987年 | 1篇 |
1986年 | 2篇 |
1985年 | 2篇 |
1984年 | 5篇 |
1983年 | 3篇 |
1982年 | 1篇 |
1981年 | 1篇 |
1980年 | 2篇 |
1979年 | 2篇 |
1978年 | 1篇 |
排序方式: 共有811条查询结果,搜索用时 15 毫秒
1.
Recommendation systems aim to recommend items or packages of items that are likely to be of interest to users. Previous work on recommendation systems has mostly focused on recommending points of interest (POI), to identify and suggest top-k items or packages that meet selection criteria and satisfy compatibility constraints on items in a package, where the (packages of) items are ranked by their usefulness to the users. As opposed to prior work, this paper investigates two issues beyond POI recommendation that are also important to recommendation systems. When there exist no sufficiently many POI that can be recommended, we propose (1) query relaxation recommendation to help users revise their selection criteria, or (2) adjustment recommendation to guide recommendation systems to modify their item collections, such that the users׳ requirements can be satisfied.We study two related problems, to decide (1) whether the query expressing the selection criteria can be relaxed to a limited extent, and (2) whether we can update a bounded number of items, such that the users can get desired recommendations. We establish the upper and lower bounds of these problems, all matching, for both combined and data complexity, when selection criteria and compatibility constraints are expressed in a variety of query languages, for both item recommendation and package recommendation. To understand where the complexity comes from, we also study the impact of variable sizes of packages, compatibility constraints and selection criteria on the analyses of these problems. Our results indicate that in most cases the complexity bounds of query relaxation and adjustment recommendation are comparable to their counterparts of the basic recommendation problem for testing whether a given set of (resp. packages of) items makes top-k items (resp. packages). In other words, extending recommendation systems with the query relaxation and adjustment recommendation functionalities typically does not incur extra overhead. 相似文献
2.
Ed Lowry 《Computer Standards & Interfaces》1991,13(1-3):105-108
Maximizing the satisfaction of a value in an engineering design is usually limited by tradeoffs in which other values become unacceptably sacrificed. In a few cases, however, the maximization is limited by a boundary between what is mathematically possible and what is not. Round wheels, vertical pillars, and binary memory elements are examples of optimum engineering structures which result from such mathematical limits. It is proposed that optimum characteristics of a language data model result similarly by minimizing the variety of primitive data objects, the complexity of those objects, and the number of objects needed to represent data states. Reducing these measures is needed to combine both rich data structure and powerful operations in one language. The minimizations lead to a narrow range of designs for language semantics in which the potential advantages of specialization is small compared with the advantages of commonality. Universal language for support of technical literacy appears to be an appropriate scope of generality in language design. 相似文献
3.
Abstract. This paper is concerned with the problem of joint determination of the state dimension and autoregressive order of models with Markov‐switching parameters. A model selection procedure is proposed which is based on optimization of complexity‐penalized likelihood criteria. The efficacy of the procedure is evaluated by means of Monte Carlo experiments. 相似文献
4.
《Journal of Computer and System Sciences》2014,80(2):427-449
Belief revision has been extensively studied in the framework of propositional logic, but just recently revision within fragments of propositional logic has gained attention. Hereby it is not only the belief set and the revision formula which are given within a certain language fragment, but also the result of the revision has to be located in the same fragment. So far, research in this direction has been mainly devoted to the Horn fragment of classical logic. Here we present a general approach to define new revision operators derived from known operators, such that the result of the revision remains in the fragment under consideration. Our approach is not limited to the Horn case but applicable to any fragment of propositional logic where the models of the formulas are closed under a Boolean function. Thus we are able to uniformly treat cases as dual Horn, Krom and affine formulas, as well. 相似文献
5.
《控制理论与应用(英文版)》2014,(3)
正The 34th Chinese Control Conference and SICE Annual Conference 2015(CCCSICE2015)is organized by the Technical Committee on Control Theory(TCCT)of Chinese Association of Automation(CAA)and the Society of Instrument and Control Engineers(SICE)of Japan,and locally organized by Hangzhou Dianzi University(HDU). 相似文献
6.
7.
8.
We present an algorithm for combining the elements of subsequences of a sequence with an associative operator. The subsequences are given by a sliding window of varying size. Our algorithm is greedy and computes the result with the minimal number of operator applications. 相似文献
9.
10.