A multi-agent decision support system for stock trading

A distributed problem solving system can be characterized as a group of individual cooperating agents running to solve common problems. As dynamic application domains continue to grow in scale and complexity, it becomes more difficult to control the purposeful behavior of agents, especially when unexpected events may occur. This article presents an information and knowledge exchange framework to support distributed problem solving. From the application viewpoint the article concentrates on the stock trading domain; however, many presented solutions can be extended to other dynamic domains. It addresses two important issues: how individual agents should be interconnected so that their resources are efficiently used and their goals accomplished effectively; and how information and knowledge transfer should take place among the agents to allow them to respond successfully to user requests and unexpected external situations. The article introduces an architecture, the MASST system architecture, which supports dynamic information and knowledge exchange among the cooperating agents. The architecture uses a dynamic blackboard as an interagent communication paradigm to facilitate factual data, business rule, and command exchange between cooperating MASST agents. The critical components of the MASST architecture have been implemented and tested in the stock trading domain, and have proven to be a viable solution for distributed problem solving based on cooperating agents     

Delay-dependent state estimation for delayed neural networks

In this letter, the delay-dependent state estimation problem for neural networks with time-varying delay is investigated. A delay-dependent criterion is established to estimate the neuron states through available output measurements such that the dynamics of the estimation error is globally exponentially stable. The proposed method is based on the free-weighting matrix approach and is applicable to the case that the derivative of a time-varying delay takes any value. An algorithm is presented to compute the state estimator. Finally, a numerical example is given to demonstrate the effectiveness of this approach and the improvement over existing ones.     

Recovery of fluorocarbons in Japan as a measure for abating global warming

The objective of this study is to evaluate the potential for recovering fluorocarbons as measures for the abatement of global warming. In this study, we focused on the three different kinds of fluorocarbons: CFCs, HCFCs and HFCs, and targeted refrigerant use because of the availability of relevant data. We first estimated future fluorocarbon emissions from the targeted appliances; we next compared those emissions in the units of CO₂ equivalent to the level of CO₂ emissions in 1990 from a quantitative point of view. As the result of this study, it was found that fluorocarbon emissions in 1999 and 2010 would be equal to approximately 7 and 3% of the level of CO₂ emissions in 1990 respectively. Moreover, if we implement a 100% recovery rate in every recovery route, we can reduce a large amount of emissions which correspond to approximately 2–5% of the level of CO₂ emissions in 1990, even if we take into account the energy-related CO₂ emissions by the transportation and decomposition of fluorocarbons.     

宽带无源光网络(BPON)关键技术的发展与研究

宽带无源光网络（BPON）是实现宽带、多业务接入的理想物理平台，本文介绍了BPON网络的发展，重点讨论了将ATM技术和PON技术相结合的APON系统及其升级系统SuperPON的基本结构和关键技术，对最近兴起的将以太技术和PON技术相结合的EPON系统的基本概念和工作原理也进行了阐述，并对未来BPON技术的发展进行了展望。     

利用框架理论对信号进行重建

在Hilbert空间中讨论了框架的一些重要的性质,定义了一个框架算子,并讨论了该算子的性质。根据实际问题构造了一框架,使信号在此框架下的投影正好为非均匀采样值。给出了一种框架界的估计方法和重建原信号的迭代算法,最后,用仿真验证了此算法的有效性。     

R22替代制冷剂的生产控制评价

本文详细介绍了R2 2替代制冷剂的生产过程控制和整机可靠性评价 ,并介绍了一些具体做法。     

可拓检测的方案生成

以可拓学理论为基础，论述了可拓检测的有关定义和概念，提出了可拓检测的方案生成方法及过程，同时探讨了检测方法的优化和评价方法。     

Adaptive cell division for ray tracing

In ray tracing the two most commonly used data structures are the octree and uniform cell division. The octree structure allows efficient adaptive subdivision of space, while taking care of the spatial coherence of the objects in it; however, the tree structure locating the next node in the path of a ray is complex and time consuming. The cell structure, on the other hand, can be stored in a three-dimensional array, and each cell can be efficiently accessed by specifying three indices. However, such a uniform cell division does not take care of object coherence. The proposed data structure combines the positive features of the above data structures while minimising their disadvantages. The entire object space is implicitly assumed to be a three-dimensional grid of cells. Initially, the entire object space is a single voxel which later undergoes “adaptive cell division.” But, unlike in the octree structure, where each voxel is divided exactly at the middle of each dimension, in adaptive cell division, each voxel is divided at the nearest cell boundary. The result is that each voxel contains an integral number of cells along each axis. Corresponding to the implicit cell division we maintain a three-dimensional array, with each array element containing the voxel number which is used to index into the voxel array. The voxel array is used to store information about the structure of each voxel, in particular, the objects in each voxel. While a ray moves from one voxel to another we always keep track of the cell through which the ray is currently passing. Since only arrays are involved in accessing the next voxel in the path of the ray, the operation is very efficient.