农作物智能数据库设计系统的研究

数据库是计算机智能决策支持系统的核心。文章介绍了智能数据库设计系统的结构,并以农作物中的水稻作物数据库为例,提出了具体的设计方法,分析了智能数据库管理的功能。     

Module Checking

In computer system design, we distinguish between closed and open systems. A closed system is a system whose behavior is completely determined by the state of the system. An open system is a system that interacts with its environment and whose behavior depends on this interaction. The ability of temporal logics to describe an ongoing interaction of a reactive program with its environment makes them particularly appropriate for the specification of open systems. Nevertheless, model-checking algorithms used for the verification of closed systems are not appropriate for the verification of open systems. Correct model checking of open systems should check the system with respect to arbitrary environments and should take into account uncertainty regarding the environment. This is not the case with current model-checking algorithms and tools. In this paper we introduce and examine the problem of model checking of open systems (module checking, for short). We show that while module checking and model checking coincide for the linear-time paradigm, module checking is much harder than model checking for the branching-time paradigm. We prove that the problem of module checking is EXPTIME-complete for specifications in CTL and 2EXPTIME-complete for specifications in CTL*. This bad news is also carried over when we consider the program-complexity of module checking. As good news, we show that for the commonly-used fragment of CTL (universal, possibly, and always possibly properties), current model-checking tools do work correctly, or can be easily adjusted to work correctly, with respect to both closed and open systems.     

Network State Estimation and Prediction for Real-Time Traffic Management

Advanced Traveler Information Systems (ATIS) and Advanced Traffic Management Systems (ATMS) have the potential to contribute to the solution of the traffic congestion problem. DynaMIT is a real-time system that can be used to generate guidance for travelers. The main principle on which DynaMIT is based is that information should be consistent, and user optimal. Consistency implies that the traffic conditions experienced by the travelers are consistent with the condition assumed in generating the guidance. To generate consistent user optimal information, DynaMIT performs two main functions: state estimation and prediction. A demand simulator and a supply simulator interact to perform these tasks. A case study demonstrates the value of the system.     

Synthesis with rational environments

Synthesis is the automated construction of a system from its specification. The system has to satisfy its specification in all possible environments. The environment often consists of agents that have objectives of their own. Thus, it makes sense to soften the universal quantification on the behavior of the environment and take the objectives of its underlying agents into an account. Fisman et al. introduced rational synthesis: the problem of synthesis in the context of rational agents. The input to the problem consists of temporal logic formulas specifying the objectives of the system and the agents that constitute the environment, and a solution concept (e.g., Nash equilibrium). The output is a profile of strategies, for the system and the agents, such that the objective of the system is satisfied in the computation that is the outcome of the strategies, and the profile is stable according to the solution concept; that is, the agents that constitute the environment have no incentive to deviate from the strategies suggested to them. In this paper we continue to study rational synthesis. First, we suggest an alternative definition to rational synthesis, in which the agents are rational but not cooperative. We call such problem strong rational synthesis. In the strong rational synthesis setting, one cannot assume that the agents that constitute the environment take into account the strategies suggested to them. Accordingly, the output is a strategy for the system only, and the objective of the system has to be satisfied in all the compositions that are the outcome of a stable profile in which the system follows this strategy. We show that strong rational synthesis is 2ExpTime-complete, thus it is not more complex than traditional synthesis or rational synthesis. Second, we study a richer specification formalism, where the objectives of the system and the agents are not Boolean but quantitative. In this setting, the objective of the system and the agents is to maximize their outcome. The quantitative setting significantly extends the scope of rational synthesis, making the game-theoretic approach much more relevant. Finally, we enrich the setting to one that allows coalitions of agents that constitute the system or the environment.     

Expert-driven genetic algorithms for simulating evaluation functions

In this paper we demonstrate how genetic algorithms can be used to reverse engineer an evaluation function’s parameters for computer chess. Our results show that using an appropriate expert (or mentor), we can evolve a program that is on par with top tournament-playing chess programs, outperforming a two-time World Computer Chess Champion. This performance gain is achieved by evolving a program that mimics the behavior of a superior expert. The resulting evaluation function of the evolved program consists of a much smaller number of parameters than the expert’s. The extended experimental results provided in this paper include a report on our successful participation in the 2008 World Computer Chess Championship. In principle, our expert-driven approach could be used in a wide range of problems for which appropriate experts are available.     

THE IMPORTANCE OF NEUTRAL EXAMPLES FOR LEARNING SENTIMENT

Most research on learning to identify sentiment ignores "neutral" examples, learning only from examples of significant (positive or negative) polarity. We show that it is crucial to use neutral examples in learning polarity for a variety of reasons. Learning from negative and positive examples alone will not permit accurate classification of neutral examples. Moreover, the use of neutral training examples in learning facilitates better distinction between positive and negative examples.     

The specification logic νZ

This paper introduces a wide-spectrum specification logic νZ. The minimal core logic is extended to a more expressive specification logic which includes a schema calculus similar (but not equivalent) to Z, new additional schema operators, and extensions to programming and program development logics.     

Determination of breakdown rates and defect densities in SiO2

Breakdowns in SiO₂ have been classified as defect related, due to wear-out and intrinsic. However, techniques to ascertain defect densities and breakdown rates at defects have not been available, nor has the distinction between wear-out and defect- related or intrinsic breakdowns been clearly demonstrated. A particular problem has been the inability to distinguish defect types, i.e. defects having different breakdown rates. Another source of confusion has been the tacit assumption that breakdown field histograms obtained from ramp breakdown tests are independent of the ramp rate, which cannot be valid for finite breakdown rates. We obtained relationships specifying the statistics of breakdown, including the effect of defects. These actually derive from results describing a Markov death process and depend on the time integrals of breakdown rates in defect-free regions and at defects and on parameters describing the defect distributions. For Poisson distributions of the defect, these parameters are the mean number of defects per device for each defect type. Any breakdown test is described by the same relations since the nature of the test enters only through the time integral of the breakdown rates. If a wear-out mechanism is operative, then the breakdown rates will depend on the time explicitly, i.e. not only via the time dependences of the applied field and temperature. procedures for obtaining defect densities and breakdown rates follow from the derived dependence on these quantities of the expectation value of the fraction of devices broken down. Ramp tests at various ramp rates are advantageous for this purpose. The field dependence of the breakdown rates can be extracted directly from the experimental data and no a priori form for this dependence need be assumed. Experimental results obtained from multiple ramp breakdown tests will be presented. The field dependence of the breakdown rates is found to vary significantly from a simple exponential dependence. Following Klein, the effect of fluctuations on the breakdown rates will be considered qualitatively to rationalize their observed field dependence. No explicit time dependence of the breakdown rates is indicated over the range of field covered by the data, implying the absence of wear-out.