移动代理者安全体系的研究

针对移动代理者自身的安全问题,提出了保护移动代理得安全的层化保护体系,该体系共分3层：状态保护层、方法保护层和封装保护层,对于方法的保护,提出将一个方法分散到多个主机平台中执行的碎片法代理者保护方案。     

Modelling Calculi with Name Mobility using Graphs with Equivalences

In the theory of graph rewriting, the use of coalescing rules, i.e., of rules which besides deleting and generating graph items, can coalesce some parts of the graph, turns out to be quite useful for modelling purposes, but, at the same time, problematic for the development of a satisfactory partial order concurrent semantics for rewrites. Rewriting over graphs with equivalences, i.e., (typed hyper)-graphs equipped with an equivalence over nodes provides a technically convenient replacement of graph rewriting with coalescing rules, for which a truly concurrent semantics can be easily defined. The expressivity of such a formalism is tested in a setting where coalescing rules typically play a basic role: the encoding of calculi with name passing as graph rewriting systems. Specifically, we show how the (monadic fragment) of the solo calculus, one of the dialect of those calculi whose distinctive feature is name fusion, can be encoded as a rewriting system over graph with equivalences.     

Efficient Graph-Based Algorithms for Discovering and Maintaining Association Rules in Large Databases

In this paper, we study the issues of mining and maintaining association rules in a large database of customer transactions. The problem of mining association rules can be mapped into the problems of finding large itemsets which are sets of items brought together in a sufficient number of transactions. We revise a graph-based algorithm to further speed up the process of itemset generation. In addition, we extend our revised algorithm to maintain discovered association rules when incremental or decremental updates are made to the databases. Experimental results show the efficiency of our algorithms. The revised algorithm is a significant improvement over the original one on mining association rules. The algorithms for maintaining association rules are more efficient than re-running the mining algorithms for the whole updated database and outperform previously proposed algorithms that need multiple passes over the database. Received 4 August 1999 / Revised 18 March 2000 / Accepted in revised form 18 October 2000     

非线性系统研究动态与展望

本文对近几年非线性控制系统的进展情况作了综合报导。文章共分三个部分:第一部分强调:什么是反馈意义下的非线性系统;第二部分介绍了近几年非线性控制系统研究中较集中的八个方面的问题;第三部对非线性控制理论今后主要研究动向作了预测。     

Using digital technologies to redress inequities for English language learners in the English speaking mathematics classroom

This study examined the question, ‘What is the impact of a digital math intervention on secondary ELL students’ mathematical capabilities and perceptions of their future possibilities?’ The hypothesis was that through its direct effect on increasing students’ math ability and its indirect effect on increasing students’ perceived math self-efficacy, the digital intervention affects students’ perceptions of their functionings and future possibilities. A path analysis, with qualitative data nested into the design, was used to analyze the conceptualized relationships. The study was conducted with 50 ninth-and-10th-grade Hispanic students in a Colorado high school, over 6 months. The primary finding was that through its direct effect on increasing students’ math ability and its indirect effect on increasing students’ perceived math self-efficacy, the digital intervention improved students’ perceptions of their functionings and future possibilities. What this study specifically underscores is the importance of taking a coherent and purposeful approach toward the design of digital student-directed educational technology, especially for ELL students who may have specific learning needs.     

Using geometric Poisson exponentially weighted moving average control schemes in a compound Poisson production environment

In this study, the variable to be controlled over time is the number of defects. Meanwhile, the underlying distribution of defects is the geometric Poisson distribution, a Poisson distribution compounded by a geometric distribution. For production process control, the exponentially weighted moving average (EWMA) control scheme based on the geometric Poisson process is addressed. Performance of the EWMA control scheme is assessed not only by both in-control and out-of-control average run lengths (ARL’s), but also by higher moments of the run length (RL) distribution. The run length distribution properties can be obtained from the probability transition matrix and implemented using the computer programs developed in this study. With proper ARL and variance of RL selected, any small shift in mean can be detected via the geometric Poisson EWMA control scheme.     

Uncertainty measures for rough formulae in rough logic: An axiomatic approach

Rough set theory, initiated by Pawlak, is a mathematical tool in dealing with inexact and incomplete information. Various types of uncertainty measure such as accuracy measure, roughness measure, etc, which aim to quantify the imprecision of a rough set caused by its boundary region, have been extensively studied in the existing literatures. However, a few of these uncertainty measures are explored from the viewpoint of formal rough set theory, which, however, help to develop a kind of graded reasoning model in the framework of rough logic. To solve such a problem, a framework of uncertainty measure for formulae in rough logic is presented in this paper. Unlike the existing literatures, we adopt an axiomatic approach to study the uncertainty measure in rough logic, concretely, we define the notion of rough truth degree by some axioms, such a notion is demonstrated to be adequate for measuring the extent to which any formula is roughly true. Then based on this fundamental notion, the notions of rough accuracy degree, roughness degree for any formula, and rough inclusion degree, rough similarity degree between any two formulae are also proposed. In addition, their properties are investigated in detail. These obtained results will be used to develop an approximate reasoning model in the framework of rough logic from the axiomatic viewpoint.     

A perturbation approach for a type of inverse linear programming problems

We consider an inverse linear programming (LP) problem in which the parameters in both the objective function and the constraint set of a given LP problem need to be adjusted as little as possible so that a known feasible solution becomes the optimal one. We formulate this problem as a linear complementarity constrained minimization problem. With the help of the smoothed Fischer–Burmeister function, we propose a perturbation approach to solve the inverse problem and demonstrate its global convergence. An inexact Newton method is constructed to solve the perturbed problem and numerical results are reported to show the effectiveness of the approach.     

An adaptive neural network switching control approach of robotic manipulators for trajectory tracking

In this paper, an adaptive neural network (NN) switching control strategy is proposed for the trajectory tracking problem of robotic manipulators. The proposed system comprises an adaptive switching neural controller and the associated robust compensation control law. Based on the Lyapunov stability theorem and average dwell-time approach, it is shown that the proposed control scheme can guarantee tracking performance of the robotic manipulators system, in the sense that all variables of the closed-loop system are bounded and the effect due to the external disturbance and approximate error of radical basis function (RBF) NNs on the tracking error can be converged to zero in an infinite time. Finally, simulation results on a two-link robotic manipulator show the feasibility and validity of the proposed control scheme.     

An elaboration likelihood model based longitudinal analysis of attitude change during the process of IT acceptance via education program

The principal objective of this study was to gain insight into attitude changes occurring during IT acceptance from the perspective of elaboration likelihood model (ELM). In particular, the primary target of this study was the process of IT acceptance through an education program. Although the Internet and computers are now quite ubiquitous, and thus many people can come to an acceptance of IT organically – including acceptance of such products as new released online services or software, some software – most notably programming languages and spreadsheets – may require education programs, and the efficacy of that education may determine the rate of acceptance. Thus, education programs for such IT may be regarded as not only teaching and training how to use the product from a technical standpoint, but also as a process by which program participants are persuaded to have a positive attitude towards accepting the new IT. This study adopted an ELM based longitudinal approach to capture the changes in the roles of persuasion routes and attitude during IT acceptance – in this case, the education program. To validate empirically the suggested model, junior students majoring in business administration, all of whom were taking an Excel class, were surveyed twice – just after mid-term and just after their final exam. These data were analysed via partial least-square method to deduce some possible implications. Our results supported all the hypotheses put forward.