Checkpointing Scheme for Relevant Distributed Real-Time Tasks

A checkpointing scheme for relevant distributed real-time tasks which can be scheduled as a DAG is proposed. A typical algorithm, OSA, is selected for DAG scheduling. A new methods based a new structure, Scheduled Cluster Tree, is presented to calculate the slack time of each task in the task cluster. In the checkpointing scheme, the optimal checkpoint intervals which minimize the approximated failure probability are derived formally and validated experimentally. The complexity of approximated failure probability is quite small compared with that of the exact probability. Meanwhile, the consistency of the checkpionting is discussed also.

PANSYSTEMS PHILOSOPHY,PANSYSTEMS MATHEMATICS(PPPM) AND APPLICATIONS TO APTMS:AFFAIROLOGY,PHYSICS,TECHNOLOGY,MEDICINE AND STRATEGICS(Ⅰ)

A new type of philosophy and mathematics from the pansytems view isintroduced here, including the 7 philosophic theories (7PT) and related mathematic researches. Many second/third philosophies are developed within pansvstems framework and related applications to APTMS.

PANSYSTEMS PHILOSOPHY,PANSYSTEMS MATHEMATICS(PPPM)AND APPLICATIONS TO APTMS:AFFAIROLOGY,PHYSICS,TECHNOLOGY,MEDICIEN AND STRATEGICS(Ⅱ)

A new type of philosophy and mathematics from the pansystems view is introduced here, including the 7 philosophy theories (7PT) and related mathematizing researches. Many second/third philosophies are developed within pansystems framework and related applications to APT MS.

PANSYSTEMS ANALYSIS: MATHEMATICS, METHODOLOGY, RELATIVITY AND DIALECTICAL THINKING

Based on new analysis modes and new definitions with relative mathematization and simplification or strengthening forms for concepts of. generalized systems, panderivatives, pansymmetry, panbox principle, pansystems relativity, etc., the framework and related principles of pansystems methodology and pansystems relativity are developed. Related contents include: pansystems with relatively universal mathematizing forms, 200 types of dualities, duality transformation, pansymmetry transformation, pansystems dialectics, the 8-domain method, pansystems mathematical methods, generalized quantification, the principles of approximation-transforming, pan-equivalence theorems, supply-demand analysis, thinking experiment, generalized gray systems, etc.

PANSYSTEMS CLUSTERING ANALYSIS OF COMPLEX SYSTEMS

In this paper, by use of equivalence operators δi and semi-equivalence operators Εi we study the clustering problems of complex systems, present δ (1,3) disconnection principle, dual transformation principle and large-scale systems decomposition principle for analizing and operating complex systems, discuss interconnectivity and disconnectivity of complex systems in detail and present some related theorems. Finally, we discuss the levels of systems according to pansystems clustering approach proposed in this paper.

FIXED PANSYSTEMS THEOREMS AND EIGEN-FUZZY SETS

In this paper, we apply fixed pansystems theorems to study when a fuzzy transformation has a nonzero eigen-fuzzy set. Many necessary conditions and sufficient conditions are obtained. Furthermore, the properties of nonzero eigen-fuzzy sets are investigated, and the results presented in Ref[4] are extended.

Multi-Target Track-Correlation Algorithm of the Graph-Matching-Based Sensor Network

For the problem of track correlation failure under the influence of sensor system deviation in wireless sensor networks,a new track correlation method which is based on relative positional relation chart matching is proposed.This method approximately simulates the track correlation determination process using artificial data,and integrally matches the relative position relation between multiple targets in the common measuring space of various sensors in order to fulfill the purpose of multi-target track correlation.The simulation results show that this method has high correlation accuracy and robustness.

Construction of High Dependable Distributed Access Control Architecture Based on Quorum System

Quorum system is a preferable model to construct distributed access control architecture, but not all quorum system can satisfy the requirements of distributed access control architecture. Aiming at the dependable problem of authorization server in distributed system and combining the requirements of access control, a set of criterions to select and evaluate quorum system is presented. The scheme and algorithm of constructing an authorization server system based on Paths quorum system are designed, and the integrated sys- tem performance under some servers attacked is fully analyzed. Role-based access control on the Web implemented by this scheme is introduced. Analysis shows that with certain node failure probability, the scheme not only has high dependability but also can satisfy the special requirements of distributed access control such as real-time, parallelism, and consistency of security policy.

SOME COMBINATORIAL PROBLEMS ON t-ARY TREES

In the excellent book of D. E. Knuth, an extensive discussion on some combinatorial problems on trees (oriented, ordered, etc)and their applications to computer science have been made. This paper aims at discussing several other combinatorial problems on t-ary trees. t-ary trees may be defined recursively as follows: a

TREE ENUMERATION AND TREE ALGORITHM COMPLEXITY COMPUTATION

Algorithm complexity analysis over tree structures has drawn much attention in recent years. Ph. Flajolet made the complexity analysis for recursive descent algorithm over trees by establishing a complexity measure table for constructions in a formal tree algorithm description language. The so-called concept 'additive complexity algorithm over tree structures' was also introduced, which is parallel to the concept 'additive enumeration problems over trees', and some results that could only be used to recursive algorithms were obtained.

ON SOME ENUMERATION PROBLEMS OF TREES

For t-ary trees (t≥2) and ordered trees, a node with r≥0 nonempty subtrees is called an r-degree node. Considering the class Г_n of t-ary trees with n≥0 nodes and the class Ω_n of ordered trees with n≥0 nodes, the following results are established.

An Improved Method to Detect Remote Sensing Image Targets Captured by Sensor Network

In order to detect targets from the hyper-spectral images captured by unmanned aerial vehicles, the images are moved into a new characteristic space with greater divisibility by making use of the manifold learning theory. On this basis, a furation impulse response （FIR） filter is developed. The output energy can be minimized after images passing through a FIR filter. The target pixel and the background pixel are distinguished according to the restrained conditions. This method can effectively suppress noises and detect sub-pixel targets in the hyper-spectral remote sensing image of unknown background spectrum.

Software Watermarking Scheme Based on Multivariate Public Key Cryptosystem

Software watermarking is an efficient tool to verify the copyright of software. Public key cryptosystem-based watermarking is widely researched. However, the popular public key cryptosystem is not secure under quantum algorithm. This paper proposes a novel soft-ware watermarking scheme based on multivariate public key cryptosystem. The copyright information generated by copyright holder is transformed into copyright numbers using multivariate quadratic polynomial equations inspired by multivariate public key cryptosystem （MPKC）. Every polynomial is embedded into the host program independently. Based on the security performance of MPKC, the robustness and invisibility of the proposed scheme is significantly improved in comparison with the RSA-based watermarking method.

Error Recovery in a Real-Time Multiprocessor System

In this paper,a new scheme for recovering errors due to transient faults in a real-time multiprocessor system is presented.The scheme,called dynamic redundancy at the task level,is implemented in a real-time multitasking environment.Utilizing the facilities in the operating system,the scheme makes backup tasks for the primary tasks as redundancy.The paper introduces an algorithm to gene- rate a fault tolerant schedule for the tasks so that they recover errors as retry or checkpointing does.A reliability model is proposed to evahaste the effectiveness of the scheme.