Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks

Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes.     

An Improved Immune Genetic Algorithm for Solving the Optimization Problems of Computer Communication Networks

1　IntroductionIndesigningacomputercommunicationnet work ,thenetworkaveragedelayisanimportantpa rameterinthenetworkperformance .Inthispaper,weonlyconsiderM /M/1networks,whichmeansthatthemessageprocessingtimeisaprobabilisticdensityfunctionwithnegativepower,thegroupar rivalandsendingisofPoissiondistributionwithasinglequeue .Supposethatthenetworktopologicalstructureandtheestimatesoftheexternaltrafficrequirementsaregiven ,howtoselecttheoptimalroutestobeusedbythecommunicatingnodesinthenetworksoast…     

Compile-time copy elimination

Single-assignment and functional languages have value semantics that do not permit side-effects. This lack of side-effects makes automatic detection of parallelism and optimization for data locality in programs much easier. However, the same property poses a challenge in implementing these languages efficiently. This paper describes an optimizing compiler system that solves the key problem of aggregate copy elimination. The methods developed rely exclusively on compile-time algorithms, including interprocedural analysis, that are applied to an intermediate data flow representation. By dividing the problem into update-in-place and build-in-place analysis, a small set of relatively simple techniques—edge substitution, graph pattern matching, substructure sharing and substructure targeting—was found to be very powerful. If combined properly and implemented carefully, the algorithms eliminate unnecessary copy operations to a very high degree. No run-time overhead is imposed on the compiled programs.     

用APACHE+PHP+MYSQL实现网站自动更新

在分析建立自动更新网站必要性的基础上,较详细地说明了如何利用APACHE+PHP+MYSQL工具实现网站自动更新中的权限控制、资料上传、自动更新,并给出了网页的部分源代码.     

遗传算法的改进及其在电力系统无功优化中的应用

针对无功优化的动态、多目标、多约束以及非线性特点,提出了基于简单遗传算法的改进算法,在简单遗传算法的基础上,添加了自适应控制和适应度排序思想,并对算法终止准则进行了改进。以IEEE14节点标准测试系统为例对该算法进行了有效性验证。仿真结果表明,该方法对电力系统的无功优化效果良好。     

基于CPX8216硬件平台的GPRS板间切换的实现

GPRS全称通用分组无线业务,它在改进了现有GSM系统后能实现高速的数据传输。首先对GPRS系统做了简单介绍,然后在此基础上详细介绍了GPRS的板间切换在CPX8216硬件平台上的实现方法。     

频域吸收边界条件的构造理论

在频域中推导了适用于差分类数值方法的吸收边界条件的构造方法，并通过选取不同参数导出了几种现有的吸收边界条件。在计算了一般形式的吸收边界条件的反射系数之后，提出了一种简单实用的自适应吸收边界条件。     

Efficient return algorithms for associated plasticity with multiple yield planes

A new return method for implicit integration of linear isotropic yield criteria is presented. The basic idea is to perform all the manipulations in the principal stress space and thereby achieve very simple formulae for calculating the plastic corrector stresses, based on the constant gradient of such criteria. The return formulae are in closed form and no iteration is required. The method accounts for three types of stress return: return to a single yield plane, to a discontinuity line at the intersection of two yield planes and to a discontinuity point at the intersection between three or more yield planes. The infinitesimal and the consistent elastoplastic constitutive matrix are calculated for each type of stress return, as are the conditions to ascertain which type of return is required. The method is exemplified with the Mohr–Coulomb yield criterion. Copyright © 2005 John Wiley & Sons, Ltd.     

Protecting against key-exposure: strongly key-insulated encryption with optimal threshold

Key-insulated encryption schemes use a combination of key splitting and key evolution to protect against key exposure. Existing schemes, however scale poorly, having cost proportional to the number t of time periods that may be compromised by the adversary, and thus are practical only for small values of t. Yet in practice t might be large. This paper presents a strongly key-insulated encryption scheme with optimal threshold. In our scheme, t need not be known in advance and can be as large as one less than the total number of periods, yet the cost of the scheme is not impacted. This brings key-insulated encryption closer to practice. Our scheme is based on the Boneh-Franklin identity-based encryption (IBE) scheme [9], and exploits algebraic properties of the latter. Another contribution of this paper is to show that (not strongly) key-insulated encryption with optimal threshold and allowing random-access key updates (which our scheme and all others known allow) is equivalent to a restricted form of IBE. This means that the connection between key-insulated encryption and IBE is not accidental. Supported in part by NSF grants CCR-0098123, ANR-0129617 and CCR-0208842, and by an IBM Faculty Partnership Development Award. Supported in part by an NSF graduate fellowship.