IT时代的第三种文化产业机遇

人类社会一直存在着并行不悖的科技与人文的两种文化与文化产业。如今,出现了第三种文化与第三种文化产业。第三种文化产业的思想基础是图灵的可计算原理;其物质基础是微处理器智力内核。第三种文化产业将打破两种文化产业界线,用人工智能与智能化工具等现代科技手段,实现人文文化领域中的艺术创作,这是人类文化领域中已经开始的没有硝烟的产业战争。     

Sampling average approximation method for a class of stochastic Nash equilibrium problems

We consider a class of stochastic Nash equilibrium problems (SNEP). Under some mild conditions, we reformulate the SNEP as a stochastic mixed complementarity problem (SMCP). We apply the well-known sample average approximation (SAA) method to solve the SMCP. We further introduce a semismooth Newton method to solve the SAA problems. The comprehensive convergence analysis is given as well. In addition, we demonstrate the proposed approach on a stochastic Nash equilibrium model in the wholesale gas–oil markets.     

Mediating and inducing quantum correlation between two separated qubits by one-dimensional plasmonic waveguide

We investigate the dynamics of quantum correlation between two separated qubits trapped in one-dimensional plasmonic waveguide. It is found that for a class of initial states, the quantum discord shows a sudden change phenomenon during the dynamical evolution. Furthermore, we demonstrate that the quantum discord can be enhanced if a proper product of the plasmon wave number and two qubits distance is chosen. Finally, we find that the non-zero quantum discord between two qubits can be created for the states without initial quantum discord during the time evolution of the system.     

Image mosaicking for polyhedral scene and in particular singly visible surfaces

Image mosaic construction is about stitching together a number of images about the same scene to construct a single image with a larger field of view. The majority of the previous work was rooted at the use of a single image-to-image mapping termed planar homography for representing the imaged scene. However, the mapping is applicable only to cases where the imaged scene is either a single planar surface, or very distant from the cameras, or imaged under a pure rotation of the camera, and that greatly limits the range of applications of the mosaicking methods. This paper presents a novel mosaicking solution for scenes that are polyhedral (thus consisting of multiple surfaces) and that are pictured possibly in closed range of the camera. The solution has two major advantages. First, it requires only a few correspondences over the entire scene, not correspondences over every surface patch in it to work. Second, it conquers a seemingly impossible task—warping image data of surfaces that are visible in only one of the input images, which we refer to as the singly visible surfaces, to another viewpoint to constitute the mosaic there. We also provide a detail analysis of what determines whether a singly visible surface could be mosaicked or not. Experimental results on real image data are presented to illustrate the performance of the method.     

Mining partial periodic correlations in time series

Recently, periodic pattern mining from time series data has been studied extensively. However, an interesting type of periodic pattern, called partial periodic (PP) correlation in this paper, has not been investigated. An example of PP correlation is that power consumption is high either on Monday or Tuesday but not on both days. In general, a PP correlation is a set of offsets within a particular period such that the data at these offsets are correlated with a certain user-desired strength. In the above example, the period is a week (7 days), and each day of the week is an offset of the period. PP correlations can provide insightful knowledge about the time series and can be used for predicting future values. This paper introduces an algorithm to mine time series for PP correlations based on the principal component analysis (PCA) method. Specifically, given a period, the algorithm maps the time series data to data points in a multidimensional space, where the dimensions correspond to the offsets within the period. A PP correlation is then equivalent to correlation of data when projected to a subset of the dimensions. The algorithm discovers, with one sequential scan of data, all those PP correlations (called minimum PP correlations) that are not unions of some other PP correlations. Experiments using both real and synthetic data sets show that the PCA-based algorithm is highly efficient and effective in finding the minimum PP correlations. Zhen He is a lecturer in the Department of Computer Science at La Trobe University. His main research areas are database systems optimization, time series mining, wireless sensor networks, and XML information retrieval. Prior to joining La Trobe University, he worked as a postdoctoral research associate in the University of Vermont. He holds Bachelors, Honors and Ph.D degrees in Computer Science from the Australian National University. X. Sean Wang received his Ph.D degree in Computer Science from the University of Southern California in 1992. He is currently the Dorothean Chair Professor in Computer Science at the University of Vermont. He has published widely in the general area of databases and information security, and was a recipient of the US National Science Foundation Research Initiation and CAREER awards. His research interests include database systems, information security, data mining, and sensor data processing. Byung Suk Lee is associate professor of Computer Science at the University of Vermont. His main research areas are database systems, data modeling, and information retrieval. He held positions in industry and academia: Gold Star Electric, Bell Communications Research, Datacom Global Communications, University of St. Thomas, and currently University of Vermont. He was also a visiting professor at Dartmouth College and a participating guest at Lawrence Livermore National Laboratory. He served on international conferences as a program committee member, a publicity chair, and a special session organizer, and also on US federal funding proposal review panel. He holds a BS degree from Seoul National University, MS from Korea Advanced Institute of Science and Technology, and Ph.D from Stanford University. Alan C. H. Ling is an assistant professor at Department of Computer Science in University of Vermont. His research interests include combinatorial design theory, coding theory, sequence designs, and applications of design theory.     

PLS流量工程故障恢复路径算法

提出一种适合MPLS保护切换和再路由--备份路径预有效恢复机制的备份路径优化算法.该算法引入故障说明,针对指定的保护对象计算恢复路径,同时,对链路的带宽进行分割,在链路可用带宽中指定备份路径可用带宽.通过算法优化,备份路径可以充分利用工作路径上的资源,降低带宽资源消耗,在保证网络提供连续服务能力的同时,提高网络资源的利用率,优化网络的运行性能.     

模糊自整定PID的船舶蒸汽动力负荷控制

船舶蒸汽动力装置自动控制的首要任务是机组的负荷控制。传统的PID控制算法由于具有结构简单、易于实现、可消除静差等优点得到了广泛的应用,但它受控制对象的影响较大,只有在各参数整定良好的前提下才能得到满意的控制效果。根据上述情况,结合船舶蒸汽动力单元工况变化频繁的特点,提出一种基于输出响应的自适应PID算法,以提高控制系统适应负荷变化的能力。方法在保留传统定值PID控制算法优点的同时,引入模糊控制在线整定PID控制参数,改善了机组的负荷控制特性,具有一定的工程应用价值.     

双酚A型聚碳酸酯快速拉伸过程的分子动力学模拟

本文采用用分子动力学方法研究了双酚A型聚碳酸酯的快速拉伸过程.采用COMPASS力场和NPT系综研究了应力应/变关系、能量/应变关系等.应力-应变曲线的研究结果显示,前"屈服点"和后"屈服点"分别为0.14和0.17,应变≤0.05为"弹性区域".0.14<ε_(xx)<1.05的区域为"塑性区域",ε_(xx)>1.05属于"硬化"区.能量-应力关系的研究结果显示,在应力-应变呈线性关系的"弹性区域",体系的总势能及各势能分量随应变增大发生不规则的波动.为了从能量的角度解释PBC-PC在外部拉伸条件下的应变情况,本文还研究了体系总能量与各能量分项,与应变的关系,对链结构与能量分项的关系进行了讨论.     

舰船电子装备综合诊断中的IETM设计与应用技术研究

交互式电子技术手册是装备保障信息化技术研究和应用的热点之一,IETM不仅作为一种电子手册,实现了技术手册的数字化,而且它具有交互功能,实现了技术手册的智能化;更为重要的是.IETM的数据格式采用了国际通用的成熟标准,从根本上为实现数据的互操作性和共享性,实现数据的网络集成化提供了可能;本文结合舰船电子装备IETM通用要求和实施要点,介绍了武器装备IETM通用开发平台中涉及的关键技术及应用方向,阐述了IETM数据的标准化技术、多数据源导入技术、IETM动态数据交换技术、故障分析技术等关键技术,提出了适应武器装备维修保障需求的IETM通用开发平台解决方案.     

基于AUML的Agent建模方案研究

AUML(Agent UML)是Agent建模普遍采用的方法,其通过对UML的扩展来支持Agent的建模.通过借鉴面向对象的系统分析方法,给出了AUML建模方案,并详细描述了AUML的建模机制和各类图的扩展.以编队指挥系统为例,从分析系统用例,分析和识别最初的Agent类型,责任识别,提取Agent之间的关系及精化Agent,确定交互直至Agent信息的配置,建立了一整套基于AUML的Agent建模方案.