Controlling the diffusionless Lorenz equations with periodic parametric perturbation

Diffusionless Lorenz equations (DLE) are a simple one-parameter version of the well-known Lorenz model, which was obtained in the limit of high Rayleigh and Prandtl numbers, physically corresponding to diffusionless convection. A simple control method is presented to control chaos by using periodic parameter perturbation in DLE. By using the generalized Melnikov method, the parameter conditions could be obtained to guide the controlled DLE to a low-periodic motion. Moreover, the existence conditions of periodic orbits and homoclinic orbits in the system are given. Some results of the numerical simulation are also explained clearly by a rigorous analysis.     

Chameleon hash without key exposure based on Schnorr signature

Based on the famous Schnorr signature scheme, we propose a new chameleon hash scheme which enjoys all advantages of the previous schemes: collision-resistant, message-hiding, semantic security, and key-exposure-freeness.     

Text categorization based on combination of modified back propagation neural network and latent semantic analysis

This paper proposed a new text categorization model based on the combination of modified back propagation neural network (MBPNN) and latent semantic analysis (LSA). The traditional back propagation neural network (BPNN) has slow training speed and is easy to trap into a local minimum, and it will lead to a poor performance and efficiency. In this paper, we propose the MBPNN to accelerate the training speed of BPNN and improve the categorization accuracy. LSA can overcome the problems caused by using statistically derived conceptual indices instead of individual words. It constructs a conceptual vector space in which each term or document is represented as a vector in the space. It not only greatly reduces the dimension but also discovers the important associative relationship between terms. We test our categorization model on 20-newsgroup corpus and reuter-21578 corpus, experimental results show that the MBPNN is much faster than the traditional BPNN. It also enhances the performance of the traditional BPNN. And the application of LSA for our system can lead to dramatic dimensionality reduction while achieving good classification results.     

Towards capacity and profit optimization of video-on-demand services in a peer-assisted IPTV platform

This paper studies the conditions under which peer-to-peer (P2P) technology may be beneficial in providing IPTV services over typical network architectures. It has three major contributions. First, we contrast two network models used to study the performance of such a system: a commonly used logical “Internet as a cloud” model and a “physical” model that reflects the characteristics of the underlying network. Specifically, we show that the cloud model overlooks important architectural aspects of the network and may drastically overstate the benefits of P2P technology. Second, we propose an algorithm called Zebra that pre-stripes content across multiple peers during idle hours to speed up P2P content delivery in an IPTV environment with limited upload bandwidth. We also perform simulations to measure Zebra’s effectiveness at reducing load on the content server during peak hours. Third, we provide a cost-benefit analysis of P2P video content delivery, focusing on the profit trade-offs for different pricing/incentive models rather than purely on capacity maximization. In particular, we find that under high volume of video demand, a P2P built-in incentive model performs better than any other model, while the conventional no-P2P model generates more profits when the request rate is low. The flat-reward model generally falls in between the usage-based model and the built-in model in terms of profitability except for low request rates. We also find that built-in and flat-reward models are more profitable than the usage-based model for a wide range of subscriber community sizes. Funding for J. Rahe’s research has been provided by AT&T Labs, the State of California under the MICR Oprogram, and by the Toshiba Corporation. Zhen Xiao is partially supported by China MOST project (2006BAH02A10).     

Model checking communicative agent-based systems

Model checking is a formal technique used to verify communication protocols against given properties. In this paper, we propose a new model checking algorithm aims at verifying systems designed as a set of autonomous interacting agents. These software agents are equipped with knowledge and beliefs and interact with each other according to protocols governed by a set of logical rules. We present a tableauased version of this algorithm and provide the soundness, completeness, termination and complexity results. A case study about an agent-based negotiation protocol and its implementation are also described.     

Agent long-term coalition credit

Agent trust researches become more and more important because they will ensure good interactions among the software agents in large-scale open systems. Moreover, individual agents often interact with long-term coalitions such as some E-commerce web sites. So the agents should choose a coalition based on utility and trust. Unfortunately, few studies have been done on agent coalition credit and there is a need to do it in detail. To this end, a long-term coalition credit model (LCCM) is presented. Furthermore, the relationship between coalition credit and coalition payoff is also attended. LCCM consists of internal trust based on agent direct interactions and external reputation based on agent direct observation. Generalization of LCCM can be demonstrated through experiments applied in both cooperative and competitive domain environment. Experimental results show that LCCM is capable of coalition credit computation efficiently and can properly reflect various factors effect on coalition credit. Another important advantage that is a useful and basic property of credit is that LCCM can effectively filter inaccurate or lying information among interactions.     

Volatility model based on multi-stock index for TAIEX forecasting

Conventional time series models have been applied to handle many forecasting problems, such as financial, economic and weather forecasting. In stock markets, correct stock predictions will bring a huge profit for stock investors. However, conventional time series models produce forecasts based on some strict statistical assumptions about data distributions, and, therefore, they are not very proper to forecast financial datasets. This paper proposes a new forecasting model using adaptive learning techniques to predict TAIEX (Taiwan Stock Exchange Capitalization Weighted Stock index) with multi-stock indexes (NASDAQ stock index and Dow Jones stock index). In verification, this paper employs seven year period of TAIEX stock index, from 1997 to 2003, as experimental datasets, and the root mean square error (RMSE) as evaluation criterion. The performance comparison results show that the proposed model outperforms the listing methods in forecasting Taiwan stock market. Besides, from statistical test results, it is showed that the volatility of Dow Jones and the NASDAQ affect TAIEX significantly.     

Towards supporting multiple virtual private computing environments on computational Grids

Grid computing now becomes a practical computing paradigm and solution for distributed systems and applications. Currently increasing resources are involved in Grid environments and a large number of applications are running on computational Grids. Unfortunately Grid computing technologies are still far away from reach of inexperienced application users, e.g., computational scientists and engineers. A software layer is required to provide an easy interface of Grids to end users.To meet this requirement HEAVEN (Hosting European Application Virtual ENvironment) upperware is proposed to build on top of Grid middleware. This paper presents HEAVEN philosophy of virtual computing for Grids – a combinational idea of simulation and emulation approaches. The concept of Virtual Private Computing Environment (VPCE) is thereafter proposed and defined. The design and current implementation of HEAVEN upperware are discussed in detail. Use case of Ag2D application justifies the philosophy of HEAVEN virtual computing methodology and the design/implementation of HEAVEN upperware.     

巷道监控图像中的人脸肤色区域分割

煤矿巷道监控图像中脸部分割的难度比较大.在典型监控角度方向采集了巷道中矿工的监控图像;在HSV颜色模型的各分量中分析了矿工脸部肤色的统计特征;在色度分量空间,采用上限和下限阈值的方法分割出肤色区域像素和相似色度的背景像素;对脸部区域的二值图像进行平滑处理和分割,大幅度降低背景像素的影响,缩小脸部区域的范围.实验结果表明,此方法计算简单、速度快,能成功地分割巷道监控图像中的脸部区域.     

基于图像块等级模型的多重认证水印算法

提出了一种新的用于灵活图像认证的多重水印嵌入算法.不同于传统的块独立水印算法中每个图像块只嵌入一个水印信息,算法对每个图像块嵌入多重水印信息.提出了两个通用的图像块等级模型,形成图像块内部的等级结构,对每个图像块以及图像块内部的各等级子块进行独立的水印生成和嵌入.将图像特征值映射为混沌系统的初值,并将图像块的编号映射为混沌系统的迭代次数,经过混沌迭代生成图像块水印,再将水印信号替代图像块中选定像素点的最低有效位,完成水印的嵌入.实验结果表明,该算法可对图像进行多重认证,对篡改区域进行精确的检测与定位,并能选择不同的定位精度.