首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   28篇
  免费   1篇
  国内免费   1篇
电工技术   2篇
化学工业   1篇
建筑科学   2篇
无线电   6篇
一般工业技术   1篇
自动化技术   18篇
  2021年   2篇
  2020年   1篇
  2019年   1篇
  2018年   4篇
  2017年   2篇
  2016年   2篇
  2015年   2篇
  2014年   3篇
  2013年   2篇
  2011年   1篇
  2010年   2篇
  2009年   2篇
  2008年   2篇
  2006年   2篇
  2004年   1篇
  1985年   1篇
排序方式: 共有30条查询结果,搜索用时 31 毫秒
1.
Multimedia Tools and Applications - Image retargeting is the task of making images capable of being displayed on screens with different sizes. This work should be done so that high-level visual...  相似文献   
2.
The Earned Value technique is a crucial technique in analyzing and controlling the performance of a project which allows a more accurate measurement of both the performance and the progress of a project. This paper presents a new fuzzy-based earned value model with the advantage of developing and analyzing the earned value indices, and the time and the cost estimates at completion under uncertainty. As the uncertainty is inherent in real-life activities, the developed model is very useful in evaluating the progress of a project where uncertainty arises. A small example illustrates how the new model can be implemented in reality.  相似文献   
3.
Visual surveillance of a designated air space can be achieved by a randomly distributed camera sensor network spread over a large area. The location and field of view of each battery operated sensor, after a calibration phase, will be known to a central processing node. To increase the lifetime of the network, the density of distributed sensors could be such that a subset of sensors can cover the required air space. As a sensor dies another sensor should be selected to compensate for the dead one and reestablish the complete coverage. This process should be continued until complete coverage is not achievable by the existing sensors. Thereafter, a graceful degradation of the coverage is desirable.The goal is to elongate the lifetime of the network while maintaining a maximum possible coverage of the designated air space. Since the selection of a subset of sensors for complete coverage of the target area is an NP-complete problem, we present a number of heuristics for this case. The proposed methods are categorized in two groups. In one category, the sensors are prioritized based on their visual and communicative properties and the selection is performed according to the prioritizing function. In the other group, we propose traditional evolutionary and swarm intelligence algorithms. The performance of the proposed methods is evaluated through extensive simulations.  相似文献   
4.
Multi-constraint QoS routing using a new single mixed metrics   总被引:1,自引:0,他引:1  
Multi-constraint quality-of-service (QoS) routing has become increasingly important as the Internet evolves to support real-time services. It is well known, however, that optimum multi-constraint QoS routing is computationally complex, and for this reason various heuristics have been proposed for routing in practical situations. Among these methods, those that use a single mixed metric are the most popular. Although mixed metric routing discards potentially useful information, this is compensated for by significant complexity reduction. Exploiting this tradeoff is becoming increasingly important where low complexity designs are desired, such as in battery operated wireless applications. In this paper, novel single mixed metrics for multi-constraint routing are introduced. The proposed techniques have similar complexity compared with existing low complexity methods. Simulation and analytical results are presented which show that it can obtain better performance than comparable techniques in terms of generating feasible routes.  相似文献   
5.
Real-time processing and compression of DNA microarray images.   总被引:1,自引:0,他引:1  
In this paper, we present a pipeline architecture specifically designed to process and compress DNA microarray images. Many of the pixilated image generation methods produce one row of the image at a time. This property is fully exploited by the proposed pipeline that takes in one row of the produced image at each clock pulse and performs the necessary image processing steps on it. This will remove the present need for sluggish software routines that are considered a major bottleneck in the microarray technology. Moreover, two different structures are proposed for compressing DNA microarray images. The proposed architecture is proved to be highly modular, scalable, and suited for a standard cell VLSI implementation.  相似文献   
6.
An optimal algorithm based on branch-and-bound approach is presented in this paper to determine lot sizes for a single item in material requirement planning environments with deterministic time-phased demand and constant ordering cost with zero lead time, where all-units discounts are available from vendors and backlog is not permitted. On the basis of the proven properties of optimal order policy, a tree-search procedure is presented to construct the sequence of optimal orders. Some useful fathom rules have been proven, which make the algorithm very efficient. To compare the performance of this algorithm with the other existing optimal algorithms, an experimental design with various environments has been developed. Experimental results show that the performance of our optimal algorithm is much better than the performance of other existing optimal algorithms. Considering computational time as the performance measure, this algorithm is considered the best among the existing optimal algorithms for real problems with large dimensions (i.e. large number of periods and discount levels).  相似文献   
7.
Strategic reasoning about business models is an integral part of service design. In fast moving markets, businesses must be able to recognize and respond strategically to disruptive change. They have to answer questions such as: what are the threats and opportunities in emerging technologies and innovations? How should they target customer groups? Who are their real competitors? How will competitive battles take shape? In this paper we define a strategic modeling framework to help understand and analyze the goals, intentions, roles, and the rationale behind the strategic actions in a business environment. This understanding is necessary in order to improve existing or design new services. The key component of the framework is a strategic business model ontology for representing and analyzing business models and strategies, using the i* agent and goal oriented methodology as a basis. The ontology introduces a strategy layer which reasons about alternative strategies that are realized in the operational layer. The framework is evaluated using a retroactive example of disruptive technology in the telecommunication services sector from the literature.  相似文献   
8.
Multimedia Tools and Applications - Nowadays, due to widespread usage of the Internet, digital contents are distributed quickly and inexpensively throughout the world. Watermarking techniques can...  相似文献   
9.
An adaptive LSB matching steganography based on octonary complexity measure   总被引:1,自引:0,他引:1  
Adaptive steganography methods tend to increase the security against attacks. Most of adaptive methods use LSB flipping (LSB-F) for embedding part of their algorithms. LSB-F is very much vulnerable against simple steganalysis methods but it allows the adaptive algorithms to be extractable at the receiver side. Use of LSB matching (LSB-M) could increase the security but extraction of data at the receiver is difficult or, in occasions, impossible. There are numerous attacks against LSB-M. In this paper we are proposing an adaptive algorithm which, unlike most adaptive methods, uses LSB-M as its embedding method. The proposed method uses a complexity measure based on a local neighborhood analysis for determination of secure locations of an image. Comparable adaptive methods that use LSB-M suffer from possible changes in the complexity of pixels when embedding is performed. The proposed algorithm is such that when a pixel is categorized as complex at the transmitter and is embedded the receiver will identify it as complex too, and data is correctly retrieved. Better performance of the algorithm is shown by obtaining higher PSNR values for the embedded images with respect to comparable adaptive algorithms. The security of the algorithm against numerous attacks is shown to be higher than LSB-M. Also, it is compared with a recent adaptive method and is proved to be advantageous for most embedding rates.  相似文献   
10.
Fractal coding algorithm has many applications including image compression. In this paper a classification scheme is presented which allows the hardware implementation of the fractal coder. High speed and low power consumption are the goal of the suggested design. The introduced method is based on binary classification of domain and range blocks. The proposed technique increases the processing speed and reduces the power consumption while the qualities of the reconstructed images are comparable with those of the available software techniques. In order to show the functionality of the proposed algorithm, the architecture was implemented on a FPGA chip. The application of the proposed hardware is shown in image compression. The resulted compression ratios, PSNR error, gate count, compression speed and power consumption are compared with the existing designs. Other applications of the proposed design are feasible in certain fields such as mass–volume database coding and also in video coder’s block matching schemes.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号