Scheduling electric power production at a wind farm

We present a model for scheduling power generation at a wind farm, and introduce a particle swarm optimization algorithm with a small world network structure to solve the model. The solution generated by the algorithm defines the operational status of wind turbines for a scheduling horizon selected by a decision maker. Different operational scenarios are constructed based on time series data of electricity price, grid demand, and wind speed. The computational results provide insights into management of a wind farm.     

An exactly solved model of three-dimensional surface growth in the anisotropic KPZ regime

We generalize the surface growth model of Gates and Westcott to arbitrary inclination. The exact steady growth velocity is of saddle type with principal curvatures of opposite sign. According to Wolf, this implies logarithmic height correlations, which we prove by mapping the steady state of the surface to world lines of free fermions with chiral boundary conditions.     

Lobachevsky triangle altitudes theorem as the Jacobi identity in the Lie algebra of quadratic forms on symplectic plane

An isomorphism between the Lobachevsky and de Sitter’s world geometries with the symplectic geometry and the Lie algebra of binary quadratic forms is used to derive the altitudes concurrence for the Lobachevsky and de Sitter triangles.     

Optimal complex networks spontaneously emerge when information transfer is maximized at least expense: A design perspective

Complex networks with multiple nodes and diverse interactions among them are ubiquitous. We suggest that optimal networks spontaneously emerge when “information” transfer is maximized at the least expense. We support our hypothesis by evolving optimal topologies for a particle swarm optimizer (PSO), a population‐based stochastic algorithm. Results suggest that (1) an optimum topology emerges at the phase transition when connectivity is high enough to transfer information but low enough to prevent premature convergence, and (2) Small World (SW) networks are a compromise between higher performance and resistance to mutation. The graph characteristics of the optimal PSO networks in the SW regime are similar to that of the visual cortices of cat and macaque, thereby suggesting similar design principles. © 2006 Wiley Periodicals, Inc. Complexity 11:26–35, 2006     

Thin-layer chromatography with high-boiling mobile phases.1. Investigation of the flow of the high-boiling mobile phases

This paper considers some aspects of a new TLC technique using a molten mobile phase which is solid under ambient conditions. The flow of high-boiling mobile phase at elevated temperature in thin-layer chromatography has been investigated and it is shown that the equation Z_f² = kt is not applicable to migration of the high boiling mobile phase front. The flow stability of the high-boiling mobile phase is noted. It is suggested on the basis of studies of concentration profiles of the solidified mobile phases by scanning photometers that the shape of the mobile phase concentration profile be taken into account in calculation of R_f Values.     

外资评级机构进入中国能否发挥“鲶鱼效应”?

近年来,中国信用评级行业逐步对外开放。我国监管部门相继批准标普、惠誉等具有国际影响力的外资评级机构进入我国市场。在此背景下,本文采用博弈模型分析了外资评级机构进入中国市场对本土评级机构评级质量的影响。研究发现,高声誉外资评级机构进入中国市场能够起到激励本土评级机构公正评级并促进评级行业形成良性循环的作用。本文研究结论为我国信用评级行业对外开放以及引入更多具有国际影响力的外资评级机构提供了理论支撑。     

基于图像空间相关性与纹理的HEVC块划分快速算法

为降低高效率视频编码(HEVC)帧内编码算法复杂度,提出一种基于视频内容空间相关性和纹理复杂度的块划分快速算法.首先,通过分析视频测试序列相邻编码树单元(CTU)之间的划分深度范围的相关性,提出CTU最有可能深度范围(MPDR)的概念及计算方法.其次,通过检测相邻CTU之间的边缘方向分析邻近CTU间的纹理差异,并决定当前待编码CTU的划分深度范围是采用MPDR,还是采用标准规定的0～3.最后,通过统计分析得到纹理复杂的阈值计算式,在每个编码单元(CU)编码之前,通过比较像素方差与阈值来分析该CU的纹理复杂程度,并判断是否可以跳过该深度块的编码计算而直接划分.实验结果表明,与HM13.0原有算法相比,本文算法以编码比特率增加0.84％、峰值信噪比下降0.04 dB为代价,能够将编码时间减少20％左右.     

Effects of Different Connectivity Topologies in Small World Networks on EEG-Like Activities

Based on our previously pulse-coupled integrate-and-fire neuron model in small world networks, we investigate the effects of different connectivity topologies on complex behavior of electroencephalographic-like signals produced by this model. We show that several times series analysis methods that are often used for analyzing complex behavior of electroencephalographic-like signals, such as reconstruction of the phase space, correlation dimension, fractal dimension, and the Hurst exponent within the rescaled range analysis (R/S). We find that the different connectivity topologies lead to different dynamical behaviors in models of integrate-and-fire neurons.     

一种有效的不确定数据流Top-K查询算法

Top-K查询处理是不确定性数据管理中一项重要技术。本文在分析不确定性数据模型和可能世界模型的基础上,定义了不确定数据流元组的查询语义,提出了基于记录向量的Top-K查询算法,该算法根据K值,计算并返回分值最高前K个结果,其查询结果评价综合考虑了查询结果在可能世界语义下的概率大小。实验结果表明,与CSQ和SCSQ算法相比,本算法更具高效性和实用性。     

Virtual world continuance intention

Virtual worlds face stiff competition and the threat of a high user attrition rate. While considerable research has investigated factors for continued use of virtual worlds, there has been little attention on how users’ embodiment in virtual worlds (i.e., avatars) affect this important cognitive decision. We developed a research model drawing on self-awareness theory and presence, to explain how user continuance intention may be influenced by avatars, in particular self-similar ones. Through a survey with 209 virtual world users, we tested our research model using structural equation modeling. Results indicate that avatar-self similarity positively affects continuance intention through self-awareness and self-presence. The findings verify that avatar characteristics influence post-adoption behavior and emphasize the importance of user autonomy in design.