On the role of heterogeneous and imperfect information in a laboratory financial market

In this paper, we analyze the behavior of a group of heterogeneously informed investors in an laboratory asset market. Our experimental setting is inspired by Huber et al. (On the benefit of information in markets with heterogeneously informed traders: an experimental study, 2004). However, instead of their system of cumulative and exogenously given information structure, we introduce an information market where the traders can buy an imperfect prediction of the future value of the dividend with a maximum anticipation of four periods. The accuracy of the prediction decreases with the chosen time horizon, whereas its price remains constant. Our results confirm a non-strictly monotonic increasing value of the information.     

乳液聚合阶段Ⅱ动力学研究的进展

本文简述了乳浓聚合动力学研究的进展,着重于澳大利亚Sydney大学Gilbert等在乳液聚合阶段Ⅱ动力学方面的研究概况。介绍了不同水溶性单体的小尺寸种子乳液体系的SmithEwart递推方程的求解方法及其解析解形式和乳液聚合动力学数据的处理。同时讨论了该研究的局限性。     

Normative KGP agents

We extend the logical model of agency known as the KGP model, to support agents with normative concepts, based on the roles an agent plays and the obligations and prohibitions that result from playing these roles. The proposed framework illustrates how the resulting normative concepts, including the roles, can evolve dynamically during the lifetime of the agent. Furthermore, we illustrate how these concepts can be combined with the existing capabilities of KGP agents in order to plan for their goals, react to changes in the environment, and interact with other agents. Our approach gives an executable specification of normative concepts that can be used directly for prototyping applications. Fariba Sadri is a senior lecturer at Imperial College London, from where she received her PhD. Her earlier work concentrated on integrity of deductive databases and temporal reasoning, in particular using the event calculus. In more recent years her work has been on agent technologies and multi-agent systems. She has worked on logic-based agent models, reasoning, dynamic belief revision, and inter-agent communication and negotiation for resources. She was co-awarded an EPSRC grant for research into logic-based multi-agents and was co-investigator in the EU SOCS project. Kostas Stathis is a senior lecturer at Royal Holloway, University of London and he holds a PhD from Imperial College London. His research interests are in the area of computational intelligence in general and in the intersection of computational logic and cognitive systems for social computing applications in particular. His research interests include: representation of human-computer (or computer-computer) interaction as a game; cognitive & autonomous agents; artificial agent societies; agent communication; programmable agents and agent platforms. He is a co-investigator of the EU ArguGRID project and was a co-investigator of the EU SOCS project. Francesca Toni is a senior lecturer at Imperial College London, from where she received her PhD. Her earlier work focused on abductive reasoning. In more recent years, she focused on argumentation, agent models and multi-agent systems. She has worked on computational logic-based agent models, agent reasoning, dynamic belief revision, and inter-agent communication and negotiation for resources. She has been co-ordinator of the EU SOCS project, which developed the KGP model of agency, and is coordinator of the EU ArguGRID project, on the application of argumentative agents within grid systems.     

The effects of flow split ratio and flow rate in manifolds

This paper reports a combined experimental and numerical investigation of three-dimensional steady turbulent flows in inlet manifolds of square cross-section. Predictions and measurements of the flows were carried out using computational fluid dynamics and laser Doppler anemometry techniques respectively. The flow structure was characterized in detail and the effects of flow split ratio and inlet flow rate were studied. These were found to cause significant variations in the size and shape of recirculation regions in the branches, and in the turbulence levels. It was then found that there is a significant difference between the flow rates through different branches. The performance of the code was assessed through a comparison between predictions and measurements. The comparison demonstrates that all important features of the flow are well represented by the predictions.     

Decomposition algorithms for the tree edit distance problem

We study the behavior of dynamic programming methods for the tree edit distance problem, such as [P. Klein, Computing the edit-distance between unrooted ordered trees, in: Proceedings of 6th European Symposium on Algorithms, 1998, p. 91–102; K. Zhang, D. Shasha, SIAM J. Comput. 18 (6) (1989) 1245–1262]. We show that those two algorithms may be described as decomposition strategies. We introduce the general framework of cover strategies, and we provide an exact characterization of the complexity of cover strategies. This analysis allows us to define a new tree edit distance algorithm, that is optimal for cover strategies.     

On the performance of peeling algorithms

The peeling of a d-dimensional set of points is usually performed with successive calls to a convex hull algorithm; the optimal worst-case convex hull algorithm, known to have an O(n^˙ Log (n)) execution time, may give an O(n^˙n^˙ Log (n)) to peel all the set; an O(n^˙n) convex hull algorithm, m being the number of extremal points, is shown to peel every set with an O(n-n) time, and proved to be optimal; an implementation of this algorithm is given for planar sets and spatial sets, but the latter give only an approximate O(n^˙n) performance.     

Polynomial-time approximation schemes for packing and piercing fat objects

We consider two problems: given a collection of n fat objects in a fixed dimension, (1) ( packing) find the maximum subcollection of pairwise disjoint objects, and (2) ( piercing) find the minimum point set that intersects every object. Recently, Erlebach, Jansen, and Seidel gave a polynomial-time approximation scheme (PTAS) for the packing problem, based on a shifted hierarchical subdivision method. Using shifted quadtrees, we describe a similar algorithm for packing but with a smaller time bound. Erlebach et al.'s algorithm requires polynomial space. We describe a different algorithm, based on geometric separators, that requires only linear space. This algorithm can also be applied to piercing, yielding the first PTAS for that problem.     

C_nP_4~4(n=1～7)团簇结构与能量的密度泛函研究

使用分子图形软件设计出多种CnP-4(n =1～ 7)的结构模型 ,并进行B3LYP密度泛函几何构型优化和振动频率计算 .最稳定的CP-4和C2 P-3 都是平面环状结构 .最稳定的CnP-4(n =3 ,5 ,7)结构在直碳链的一端连接 1个磷原子且另一端是P3 C的四元环的平面结构 .最稳定的CnP-4(n =4,6)结构在直碳链的一端连接 1个磷原子且另一端是P3 的三元环的锄状结构 .直碳链可与平面环的磷原子生成大π键 .大多数构型是由C2 ,C3 ,C4子结构以环状或链状方式组成的 .碳原子与磷原子以交替方式排列的结构数量少、能量高 .     

使用《新概念物理教程:力学》的教学探索

简要介绍《新概念物理教程：力学》的知识体系、特色及改革新意．结合南阳师院2000级、2001级两届本科班对新教材的使用情况，制定适合我院学生实际的力学教学大纲，探索一种以知识为载体、以学生为主体、以培养学生科学素质为宗旨的新型教学模式．对教学中遇到的问题提出具体的解决办法，对使用新教材的效果进行调查分析，为力学教材的使用和力学教学改革提供一些参考。     

中外城市战略规划编制比较

对国内的广州，南京，杭州三大城市的战略规划编制进行了分析，并与西方一些发达国家的城市战略规划编制进行了比较．提出中外战略规划在编制内容、成果、期限等方面存在着相同点和不同点，提出研究中外战略规划对中国传统总体规划改革具有多方面的启发和指导意义．