Based on the common properties of logic formulas:equivalence and satisfiability,the concept of variable minimal formulas with property preservation is introduced.A formula is variable minimal if the resulting sub-formulas with any variable omission will change the given property.Some theoretical results of two classes:variable minimal equivalence(VME) and variable minimal satisfiability(VMS) are studied.We prove that VME is NP-complete,and VMS is in DP and coNP-hard.
Starting with some simple representative quantum programming languages, this paper lays stress on quantum computation, language paradigm, program structure, input/output, exception facility, and especially the recent results of the quantum computation group at Nanjing University, namely the functional quantum programming language NDQFP. All primitive functions and combining forms in NDQFP are given in the appendix.
Internetware is envisioned as a general software paradigm for the application style of resources integration and sharing in the open, dynamic and uncertain platforms such as the Internet. Continuing the agent-based Internetware model presented in a previous paper, in this paper, after an analysis of the behavioral patterns and the technical challenges of environment-driven applications, a software-structuring model is proposed for environment-driven Internetware applications. A series of explorations on the enabling techniques for the model, especially the modeling, management and utilization of context information are presented. Several proto-typical systems have also been built to prove the concepts and evaluate the techniques. These research efforts make a further step toward the Internetware paradigm by providing an initial framework for the construction of context-aware and self-adaptive software application systems in the open network environment.
Lǔ Jian MA XiaoXing TAO XianPing CAO Chun HUANG Yu YU Ping
