首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19篇
  国内免费   1篇
  完全免费   21篇
  自动化技术   41篇
  2019年   2篇
  2018年   3篇
  2017年   1篇
  2016年   4篇
  2014年   9篇
  2013年   3篇
  2012年   7篇
  2011年   3篇
  2010年   1篇
  2009年   1篇
  2008年   2篇
  2007年   2篇
  2006年   3篇
排序方式: 共有41条查询结果,搜索用时 31 毫秒
1.
软件体系结构模型单层化的一致性保障方法   总被引:4,自引:0,他引:4       下载免费PDF全文
杨杰  黄罡  陈湘萍  梅宏  张成志 《软件学报》2006,17(6):1391-1400
在软件体系结构(software architecture,简称SA)设计中,复合构件是具有内部结构的构件,它可以对复杂的SA模型进行层次化的组织.尽管大多数体系结构描述语言都支持复合构件,但常见的SA模型分析与验证工具仅支持单层的SA模型作为输入,且目前的主流构件运行平台都不支持带有内部结构的复合构件模型.因此,有必要将多层的SA模型转化为单层的SA模型(即"单层化")."单层化"的关键在于如何保证"单层化"前后SA模型的一致性.对该问题及其解决方案进行了系统而深入的研究,给出了SA模型一致性的形式化定义.在此基础上,提出了SA模型"单层化"的基本原则以及过程指南,并以一个构件化的邮件客户端为例,验证了该方法的可行性.  相似文献
2.
As a popular approach to dependable service oriented architecture (SOA), a service pool collects a set of services that provide the same functionality by different service providers for achieving desired reliability. However, if the tradeoff between reliability and other important qualities, e.g., performance, has to be considered, the construction and management of a service pool become much more complex. In this paper, an automated approach to this problem is presented. Based on the investigation of service pools in the typical triangle SOA model, two challenges critical to the effectiveness and efficiency of service pools are identified, including which services should be held by a pool and what order these services are invoked in. A set of algorithms are designed to address the two challenges and then a service pool can be automatically constructed and managed for given reliability and performance requirements in polynomial time. The approach is demonstrated on a J2EE based service platform and the comparison results between different pooling algorithms are evaluated.  相似文献
3.
基于正交Legendre矩的虹膜识别算法   总被引:2,自引:0,他引:2       下载免费PDF全文
利用正交Legendre矩实现对虹膜图像的特征提取。根据该算法得到的每一位特征向量都包含了图像中各像素点的灰度信息和位置信息。与基于矩的其他特征提取算法相比,它不仅有良好的鲁棒性,而且还保留了图像的二维信息。实验结果充分表明, 该算法是合理有效的。  相似文献
4.
基于图割与均值漂移算法的脊椎骨自动分割   总被引:2,自引:0,他引:2  
为提高图割算法的效率并减少用户交互量,提出将图割与均值漂移算法结合应用的脊椎骨自动分割方法。该方法利用均值漂移算法产生的区域邻接图代替像素点图,从而大幅减少参与图割算法的顶点和边的数目,并有效利用了均值漂移良好的边界结构保持特性。实验结果表明,该方法有效地结合了两者的优点,提高了算法的精度和速度,并减少了用户交互量。  相似文献
5.
任务空间实时轨迹规划的旋量方法   总被引:2,自引:0,他引:2  
:基于旋量提出了一种任务空间实时轨迹规划的新算法.该算法借鉴了机器人制导的设计思想,以 空间机器人目标捕获为应用背景,可以仅依靠视线测量信息实现多种约束条件下的轨迹规划.首先给出了矢 量的旋量表示方法,在此基础上设计了一种类似于比例导引的新型三维制导律.应用新型三维制导律计算出 运动的法向加速度,并根据安全性的要求计算出线加速度;两者结合完成了轨迹生成的实时算法.生成的轨 迹安全可行,且具有一定的优化特性.仿真结果证明了该规划算法的有效性.  相似文献
6.
半监督拉普拉斯特征映射算法   总被引:1,自引:0,他引:1  
为了使流形学习方法具有半监督的特点,利用流形上某些已知低维信息的数据去学习推测出其它数据的低维信息,扩大流形学习算法的应用范围,把拉普拉斯特征映射算法(Laplacian Eigenmap,LE)与半监督的机器学习相结合,提出一种半监督的拉普拉斯特征映射算法(semi-supervised Laplacian Eigenmap,SSLE),这种半监督的流形学习算法在分类识别等问题上,具有很好的效果.模拟实验和实际例子都表明了SSLE算法的有效性.  相似文献
7.
This paper investigates the challenging issue of assigning given image-level annotations to precise regions on images. We propose a novel label to region assignment (LRA) technique called Fuzzy-based Contextual-cueing Label Propagation (FCLP) with four parts: First, an image is over-segmented into a set of atomic patches and the local visual information of color features and texture features are extracted. Second, fuzzy representation and fuzzy logic are used to model spatial invariants of contextual cueing information, especially for the imprecise position information and ambiguous spatial topological relationships. Third, labels are propagated inter images and intra images in visual space and in contextual cueing space. Finally, the fuzzy C-means clustering based on K-nearest neighbor (KNN-FCM) is utilized to segment the images into semantic regions and associate with corresponding annotations. Experiments on two public datasets demonstrate the effectiveness of the proposed technique.  相似文献
8.
In this paper, an improved hybrid fast mode decision method for H.264/AVC intra coding is proposed, which is based on the analysis of edge filter and more efficient mode selection. In contrast to the conventional fast mode decision methods where multiple neighbor modes are determined by the same filter, a unique filter is applied to each directional mode to eliminate the correlation among neighbor modes. To reduce the complexity, the filters are only applied to the selected pixels that cover most of the block region. After that, the results along prediction residuals of these pixels are summed for fast mode decision. Moreover, local information is also taken into account through Most Probable Mode (MPM) from neighbor-coded blocks. Experimental results demonstrated that better coding performance is achieved as compared with well-known conventional fast mode decision algorithms for H.264/AVC intra coding.  相似文献
9.
Nowadays movement patterns and people’s behavioral models are needed for traffic engineers and city planners. These observations could be used to reason about mobility and its sustainability and to support decision makers with reliable information. The very same knowledge about human diaspora and behavior extracted from these data is also valuable to the urban planner, so as to localize new services, organize logistics systems and to detect changes as they occur in the movement behavior. Moreover, it is interesting to investigate movement in places like a shopping area or a working district either for commercial purposes or for improving the service quality. These kinds of tracking data are made available by wireless and mobile communication technologies. It is now possible to record and collect a large amount of mobile phone calls in a city. Technologies for object tracking have recently become affordable and reliable and hence we were able to collect mobile phone data from a city in China from January 1, 2008 to December 31, 2008. The large amount of phone call records from mobile operators can be considered as life mates and sensors of persons to inform howmany people are present in any given area and how many are entering or leaving. Each phone call record usually contains the caller and callee IDs, date and time, and the base station where the phone calls are made. As mobile phones are widely used in our daily life, many human behaviors can be revealed by analyzing mobile phone data. Through mobile phones, we can learn the information about locations, communications between mobile phone users during their daily lives. In this work, we propose a comprehensive visual analysis system named as MViewer, Mobile phone spatiotemporal data Viewer, which is the first system to visualize and analyze the population’smobility patterns from millions of phone call records. Our system consists of three major components: 1) visual analysis of user groups in a base station; 2) visual analysis of the mobility patterns on different user groups making phone calls in certain base stations; 3) visual analysis of handoff phone call records. Some well-established visualization techniques such as parallel coordinates and pixelbased representations have been integrated into our system. We also develop a novel visualization schemes, Voronoidiagram-based visual encoding to reveal the unique features of mobile phone data. We have applied our system to real mobile phone datasets that are kindly provided by our project partners and obtained some interesting findings regarding people’s mobility patterns.  相似文献
10.
DBSCAN (density-based spatial clustering of applications with noise) is an important spatial clustering technique that is widely adopted in numerous applications. As the size of datasets is extremely large nowadays, parallel processing of complex data analysis such as DBSCAN becomes indispensable. However, there are three major drawbacks in the existing parallel DBSCAN algorithms. First, they fail to properly balance the load among parallel tasks, especially when data are heavily skewed. Second, the scalability of these algorithms is limited because not all the critical sub-procedures are parallelized. Third, most of them are not primarily designed for shared-nothing environments, which makes them less portable to emerging parallel processing paradigms. In this paper, we present MR-DBSCAN, a scalable DBSCAN algorithm using MapReduce. In our algorithm, all the critical sub-procedures are fully parallelized. As such, there is no performance bottleneck caused by sequential processing. Most importantly, we propose a novel data partitioning method based on computation cost estimation. The objective is to achieve desirable load balancing even in the context of heavily skewed data. Besides, We conduct our evaluation using real large datasets with up to 1.2 billion points. The experiment results well confirm the efficiency and scalability of MR-DBSCAN.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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