Agent-based negotiation and decision making for dynamic supply chain formation

Modern businesses are facing the challenge of effectively coordinating their supply chains from upstream to downstream services. It is a complex problem to search, schedule, and coordinate a set of services from a large number of service resources under various constraints and uncertainties. Existing approaches to this problem have relied on complete information regarding service requirements and resources, without adequately addressing the dynamics and uncertainties of the environments. The real-world situations are complicated as a result of ambiguity in the requirements of the services, the uncertainty of solutions from service providers, and the interdependencies among the services to be composed. This paper investigates the complexity of supply chain formation and proposes an agent-mediated coordination approach. Each agent works as a broker for each service type, dedicated to selecting solutions for each service as well as interacting with other agents in refining the decision making to achieve compatibility among the solutions. The coordination among agents concerns decision making at strategic, tactical, and operational level. At the strategic level, agents communicate and negotiate for supply chain formation; at the tactical level, argumentation is used by agents to communicate and understand the preferences and constraints of each other; at the operational level, different strategies are used for selecting the preferences. Based on this approach, a prototype has been implemented with simulated experiments highlighting the effectiveness of the approach.     

A blind watermarking method using maximum wavelet coefficient quantization

This paper proposes a blind watermarking algorithm based on maximum wavelet coefficient quantization for copyright protection. The wavelet coefficients are grouped into different block size and blocks are randomly selected from different subbands. We add different energies to the maximum wavelet coefficient under the constraint that the maximum wavelet coefficient is always maximum in a block. The watermark is embedded the local maximum coefficient which can effectively resist attacks. Also, using the block-based watermarking, we can extract the watermark without using the original image or watermark. Experimental results show that the proposed method is quite robust under either non-geometry or geometry attacks.     

Generalized predictive control of linear systems with actuator arrearage faults

Arrearage phenomenon commonly exists in actuators. With arrearages, the actuator cannot achieve the target suggested by the controller, so the control performance degrades. Deadzones and stuck faults can be considered to be two special classes of arrearages, which are studied widely; however, more general arrearage phenomenon cannot be described and treated by these forms. In this paper, a general formulation is introduced for this phenomenon, which is referred as actuator arrearage faults. Based on this formulation, an improved generalized predictive control scheme is proposed for a class of single-input single-output linear systems. With arrearage faults, the system becomes a stochastic process. Hence, a sufficient condition, which guarantees the output tracking error to be uniformly ultimately bounded in the mean-square sense, is presented in this paper. Simulations are given to illustrate the feasibility and effectiveness of the proposed scheme.     

一种Agent的偏好系统及其建立

受到Agent偏好模型的启发,提出了一个新的描述人们行为的偏好系统称为AF系统,它将Michael Freund的理性偏好推理与Adams提出的经典的归纳逻辑和概率逻辑相结合,即借助经典的逻辑系统,把人们的逻辑推理和以人们的偏好取向为基础的常识性推理以及以主观愿望为基础的意向推理结合在一起成为一个有机系统,并且在这个系统下提出Agent的理性偏好的建立方法以及推理步骤.最后给出一个实例,说明它能根据人们的部分愿望,全面估计人们的偏好走向,而且一旦人们的基本态度有所转向,偏好结构也可做相应调整,无需做根本改动,因此它具有鲁棒性和实用价值.     

一种基于自适应量化嵌入器的隐写方法

感知质量和容量一直是图像隐写算法设计中难以折中的两个要素,如何取得更好的综合性能已吸引了很多研究者的兴趣.提出一种基于自适应量化嵌入器的隐写方法.这一方法通过改变某一载体信号所在子空间的索引来调制秘密信息,自适应特性体现在决定着子空间尺寸的分割码本的设计上.将这种隐写方法用于以2×2图像块为单元的数字图像隐写算法设计中,并将分割码本设计得具备HVS特性以取得较好的折中效果.实验表明,算法在感知质量和容量方面具有较好的综合性能.     

一种实时可靠的移动无线传感器网络贪婪地理路由协议

随着定位装置和定位算法的成熟,基于地理位置信息的贪婪地理路由协议受到广泛的关注与研究.但是,在移动无线传感器网络贪婪地理路由协议中,周期性信标交换条件下采用贪婪转发策略会引起通信暂盲现象,造成数据的丢失.基于右手法则的面遍历算法,对路由空洞的形状不能进行感知,数据转发具有很大的盲目性,转发路径有时比最优路径长很多,造成数据传输时延的增加.针对上述问题提出一种实时可靠的QoS贪婪地理路由协议,该协议通过自适应信标交换算法、基于过渡带思想的贪婪转发策略和基于路标迭代提取和剔除的自适应空洞处理算法,使得数据分组能够实时可靠地传输.NS-2仿真结果表明该协议在不增加控制开销的情况下,能够有效减缓通信暂盲现象,高效地处理路由空洞问题,大大提高协议的实时性和可靠性,可应用于对实时性和可靠性有一定要求的大规模移动无线传感网络.     

基于Bit承诺的合同网模型

在分析现有合同网模型的基础上,针对合同网协商过程中的安全问题,利用Bit承诺协议和RSA算法,给出一个具有安全性的合同网协商模型,保证Agent之间信息的安全传输,防止协作Agent反悔、拒绝履行承诺。该协商模型满足不可否认性和强可验证性,投标价格保密安全,技术简单,通信量小。     

基于粒子系统和音频系统的烟花模拟

针对模糊物体的模拟方法存在着粒子数量绘制巨大、粒子运动状态复杂、计算耗时、实时性及逼真性不够等问题,提出了一种基于粒子系统和音频系统的烟花模拟方法,以三角形格作为绘制烟花粒子的基本图元,结合纹理映射,色彩融合技术来绘制烟花粒子,在显示列表中生成纹理,再结合FMOD引擎技术,加入音频系统,实验结果表明提出的方法增强了模拟的逼真性.