全文获取类型
收费全文 | 65篇 |
免费 | 0篇 |
专业分类
化学工业 | 16篇 |
能源动力 | 1篇 |
轻工业 | 1篇 |
石油天然气 | 1篇 |
无线电 | 18篇 |
一般工业技术 | 3篇 |
冶金工业 | 14篇 |
原子能技术 | 1篇 |
自动化技术 | 10篇 |
出版年
2022年 | 3篇 |
2017年 | 2篇 |
2015年 | 1篇 |
2014年 | 3篇 |
2013年 | 4篇 |
2012年 | 5篇 |
2011年 | 2篇 |
2010年 | 3篇 |
2009年 | 2篇 |
2008年 | 1篇 |
2007年 | 1篇 |
2006年 | 2篇 |
2005年 | 3篇 |
2004年 | 3篇 |
2002年 | 2篇 |
2001年 | 1篇 |
2000年 | 2篇 |
1998年 | 3篇 |
1997年 | 3篇 |
1995年 | 3篇 |
1994年 | 1篇 |
1993年 | 2篇 |
1992年 | 1篇 |
1990年 | 2篇 |
1989年 | 1篇 |
1977年 | 3篇 |
1976年 | 1篇 |
1972年 | 1篇 |
1968年 | 2篇 |
1967年 | 1篇 |
1966年 | 1篇 |
排序方式: 共有65条查询结果,搜索用时 0 毫秒
61.
A. N. Krasilov A. I. Lyakhov D. M. Ostrovsky E. M. Khorov 《Automation and Remote Control》2013,74(9):1460-1473
To improve data transmission robustness in the Wi-Fi Mesh standard, a deterministic channel access method was added to the basic random access method, which enabled the stations to get a contention-free access in the previously reserved time intervals. This mechanism can be conveniently used for transmission of the real-time multimedia streams which require quality-of-service support. However, the packet transmission in the reserved time intervals is affected by random noise and interference, and the time-consuming reservation procedure does not allow one to change on-the-fly the amount of reserved channel resources. A method for dynamic channel reservation which takes into account these aspects of the deterministic channel access mechanism and meets the quality-of-service requirements was proposed. 相似文献
62.
A private information retrieval scheme allows a user to retrieve a data item of his choice from a remote database (or several copies of a database) while hiding from the database owner which particular data item he is interested in. We consider the question of private information retrieval in the so-called ``commodity-based' model, recently proposed by Beaver for practically oriented service-provider Internet applications. We present simple and modular schemes allowing us to reduce dramatically the overall communication involving users, and substantially reduce their computation, using off-line messages sent from service-providers to databases and users. The service-providers do not need to know the database contents nor the future user's requests; all they need to know is an upper bound on the data size. Our solutions can be made resilient against collusions of databases with more than a majority (in fact, all-but-one) of the service-providers. Received 21 September 1998 and revised 21 December 1999 Online publication 19 May 2000 相似文献
63.
64.
In general, chemical processes (CP) are designed with the use of inaccurate mathematical models. Therefore, it is important to create a chemical process that guarantees satisfaction of all design specifications either exactly or with some probability. The paper considers the issue of chemical process optimization when at the operation stage the design specification should be met with some probability and the control variables can be changed. We developed a new formulation of the two-stage optimization problem (TSOP) with chance constraints. On the basis of this formulation and approximate transformation of chance constraints into deterministic ones the iteration method of solving the TSOP with chance constraints is devised. 相似文献
65.