检索结果-南通市图书馆

ESKD-A New Structure of Expert System Based on Knowledge Discovery

在线全文

学校读者我要写书评

暂无评论

International Journal of Minerals,Metallurgy and Materials 2000年第1期14卷 63-71页

作者： Bingru Yang Fasheng liu Jiangtao Shen information Engineering School, university of science and technology {4., {4., 100083, china information Engineering School University of Science and Technology Beijing Beijing 100083 China

A new structure of ESKD (expert system based on knowledge discovery system KD (D&K)) is first presented on the basis of KD (D&K)-a synthesized knowledge discovery system based on double-base (database and knowledge base) cooperating mechanism. With all new features, ESKD may form a new research direction and provide a great probability for solving the wealth of knowledge in the knowledge base. The general structural frame of ESKD and some sub-systems among ESKD have been described, and the dynamic knowledge base based on double-base cooperating mechanism has been emphased on. According to the result of demonstrative experi- ment, the structure of ESKD is effective and feasible.

关键词： knowledge discovery expert system dynamic knowledge base, double-base cooperating mechanism

Entropy number and non-linear approximations on multivariate Besov space by manifolds of finite pseudo-dimension

在线全文

学校读者我要写书评

暂无评论

Progress in Natural science:Materials International 2006年第3期16卷 260-265页

作者： LONG Jingfan and FANG Gensun (School of Mathematical sciences, beijing Normal university, beijing 100875, {4. Department of computer science, information technology Institute, beijing 100101, {4.) [a]School of Mathematical sciences Beijing Normal University Beijing China [b]Department of computer science Information Technology Institute Beijing China

We determine the asymptotic order of entropy number and optimal non -linear approximations of anisotropic periodic Besov class of Bpθr(Td') (1≤p≤∞,1≤0≤∞) by manifolds of finite pseudo-dimension in the metric Lq... 详细信息

关键词： Pseudo-dimension anisotropic Besov class of functions entropy number nonlinear width.

Competent predicate abstraction in model checking

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2011年第2期54卷 258-267页

作者： LI Li1,2,3, SONG XiaoYu4. GU Ming2,3 & LUO XiangYu2,3 1Department of computer science & technology, tsinghua university, {4. 100084, china 2Key Laboratory for information System Security, Ministry of Education of china, {4. 100084, china 3School of Software, tsinghua university, {4. 100084, china 4.epartment of ECE, Portland State university, Portland, Oregon 97207, USA 1. Department of computer science & technology Tsinghua University Beijing 100084 China2. Key Laboratory for Information System Security Ministry of Education of China Beijing 100084 China3. School of Software Tsinghua University Beijing 100084 China4. Department of ECE Portland State University Portland Oregon 97207 USA

The paper presents a new approach to computing the abstract state and a maximum weight heuristic method for finding the shortest counter-example in verification of imperative programs. The strategy is incorporated in a verification system based on the counterexample-guided abstraction refinement method. The proposed method slashes both the size of the abstract state space and the number of invokes of a decision procedure. A number of benchmarks are employed to evaluate the effectiveness of the approach.

关键词： program model checking predicate abstraction weight heuristic

Generalized gradient projection neural networks for nonsmooth optimization problems

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2010年第5期53卷 990-1005页

作者： LI GuoCheng 1 , SONG ShiJi 2 ? & WU Cheng 2 1 Department of Mathematics, beijing information science and technology {4., beijing 100192, china 2 Department of Automation, tsinghua university, beijing 100084, china 1. Department of Mathematics Beijing Information Science and Technology University Beijing 100192 China2. Department of Automation Tsinghua University Beijing 100084 China

Generalized gradient projection neural network models are proposed to solve nonsmooth convex and nonconvex nonlinear programming problems over a closed convex subset of R n . By using Clarke’s generalized gradient, the neural network modeled by a differential inclusion is developed, and its dynamical behavior and optimization capabilities both for convex and nonconvex problems are rigorously analyzed in the framework of nonsmooth analysis and the differential inclusion theory. First for nonconvex optimization problems, the quasi convergence results similar to those achieved by previous work are proved. For convex optimization problems, the global convergence results are proved, i.e. any trajectory of the neural network converges to an asymptotically stable equilibrium point, which is an optimal solution of the primal problem whenever it exists. This result remains valid even if the initial condition is chosen outside the feasible set. In addition, an asymptotic control result involving a Tykhonov like regularization shows that any trajectory of the revised neural network can be forced to converge toward a particular optimal solution of the primal problem. Finally, two simulation optimization algorithms for solving the optimization and control problems are designed respectively, and three typical simulation experiments are illustrated to present the accuracy and efficiency of theoretical convergence results of this paper.

关键词： nonsmooth optimization problem generalized gradient projection networks differential inclu sions convergence

Self-healing routing: failure,modeling and analysis

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(information sciences) 2011年第3期54卷 609-622页

作者： XU MingWei 1,2 , LI Qi 1,2 , YANG Yuan 1,2 , HOU MeiJia 1,2 & PAN LingTao 1,2 1 Department of computer science, tsinghua university, beijing {4., china 2 tsinghua National Laboratory for information science and technology (TNList), beijing {4., china 1. Department of computer science Tsinghua University Beijing 100084 China2. Tsinghua National Laboratory for Information Science and Technology (TNList) Beijing 100084 China

Network failures occur frequently, and self-healing ability of existing routing protocols cannot guarantee fast route convergence under these failures without impacting packet forwarding. During routing convergence, network routes may be incorrect and even routing black holes and loops occur, which will result in extensive packet loss and thus influence network performance. To solve this problem, several improved routing solutions have been proposed. In this paper, we propose the concept and model of self-healing routing and analyze the key problems in current intra-domain and inter-domain self-healing routing protocols after briefly reviewing the characteristics of network failures. We classify the different self-healing solutions into two categories based on their design principles: routing restoration and routing protection, and systematically analyze these different typical solutions. Finally, we discuss several key issues in self-healing routing and propose a hybrid protection and restoration based routing scheme.

关键词： failure intra-domain routing inter-domain routing self-healing routing

Buffer planning for application-specific networks-on-chip design

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science in china(Series F) 2009年第4期52卷 547-558页

作者： YIN ShouYi1,2,LIU LeiBo1,2 & WEI ShaoJun1,2 1 Institute of Microelectronics,tsinghua university,beijing 100084.china 2 National Laboratory for information science and {4.,tsinghua university,beijing 100084.china Institute of Microelectronics Tsinghua University Beijing 100084 China National Laboratory for information science and technology Tsinghua University Beijing 100084 China

Networks-on-chip （NoC） is a promising communication architecture for next generation SoC. The size of buffer used in on-chip routers impacts the silicon area and power consumption of NoC dominantly. It is important to plan the total buffer-size and each router buffer-allocation carefully for an efficient NoC design. In this paper, we propose two buffer planning algorithms for application-specific NoC design. More precisely, given the traffic parameters and performance constraints of target application, the proposed algorithms automatically determine minimal buffer budget and assign the buffer depth for each input channel in different routers. The experimental results show that the proposed algorithms can significantly reduce total buffer usage and guarantee the performance requirements.

关键词： buffer planning networks-on-chip (NoC) design automation optimization

(2,n)secret sharing scheme for gray and color images based on Boolean operation

在线全文

学校读者我要写书评

暂无评论

science china(information sciences) 2012年第5期55卷 1151-1161页

作者： DONG Lin 1,WANG DaoShun 1,LI ShunDong 2 & DAI YiQi 1 1 Department of computer science and technology,tsinghua university,{4. 2 School of computer science,Shaanxi Normal university,Xi'an 710062,china 1. Department of computer science and technology Tsinghua University Beijing 100084 China2. School of Computer Science Shaanxi Normal University Xi’an 710062 China

Traditional secret sharing (SS) schemes can reconstruct the secret precisely,but have high com-putation *** secret sharing (VSS) schemes use human visual system to reconstruct the secret without cryptographic computation,but have pixel expansion and loss of *** et *** a (2,n)-SS scheme for binary images based on Boolean operation,which has low computation complexity,no pixel expansion and the contrast is 1/*** this paper,we first construct an r runs (2,n)-SS scheme to improve the contrast of Wang et al.'s binary (2,n)-SS *** we present two approaches to construct r runs (2,n)-SS schemes for grayscale image and color *** two approaches are both based on Boolean operation,while one approach uses halftone technology and the other uses bit level *** proposed schemes have low computation complexity and almost ideal contrast.

关键词： secret sharing scheme Boolean operation halftone contrast

Quasi-secure quantum dialogue using single photons

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

science china(Physics,Mechanics & Astronomy) 2007年第5期50卷 558-562页

作者： YANG YuGuang1,2 & WEN QiaoYan31 college of computer science and technology, {4. university of technology, {4. 100022, china 2 State Key Laboratory of information Security, Graduate university of the Chinese Academy of sciences, {4. 10004., china 3 School of science, {4. university of Posts and Telecommunications, {4. 100876, china college of computer science technology Beijing University of Technology Beijing 100022 China State Key Laboratory of information Security Graduate University of the Chinese Academy of Sciences Beijing 100049 China School of science Beijing University of Posts Telecommunications Beijing 100876 China

A quasi-secure quantum dialogue protocol using single photons was proposed. Different from the previous entanglement-based protocols, the present protocol uses batches of single photons which run back and forth between the two parties. A round run for each photon makes the two parties each obtain a classical bit of information. So the efficiency of information transmission can be increased. The present scheme is practical and well within the present-day technology.

关键词： quantum dialogue, single photon, quantum secure direct communication

Development and application of ergodicity model with FRCM and FLAR for hydrological process

在线全文

学校读者我要写书评

暂无评论

science china(Technological sciences) 2009年第2期52卷 379-386页

作者： WANG HongRui1, FENG QiLei2, LIN Xin3 & ZENG WenYi4.1 college of Water science, Key Laboratory for Water and Sediment sciences of the Ministry of Education, beijing Normal {4., beijing 100875, china 2 School of science, beijing Institute of Education, beijing 100011, china 3 School of Mathematical sciences, beijing Normal {4., beijing 100875, china 4.college of information science and technology, beijing Normal {4., beijing 100875, china 1. college of Water science Key Laboratory for Water and Sediment Sciences of the Ministry of Education Beijing Normal University Beijing 100875 China 2. School of science Beijing Institute of Education Beijing 100011 China 3. School of Mathematical sciences Beijing Normal University Beijing 100875 China 4. college of information science and technology Beijing Normal University Beijing 100875 China

In this paper, a new ergodic property analysis model of hydrological process is proposed based on fuzzy-rough c-means clustering (FRCM), autocorrelogram, and fuzzy least absolute regression (FLAR). A precipitation time series (1951―2004. from Shanghai Hydrology Station is then analyzed with the model. The results show that the precipitation time series of April, May, June, and September has er-godic property. We conclude that in the long run, the precipitation of April, May, June, and September will not keep decreasing; it will converge to its mean value in some period.

关键词： hydrological process ergodic autocorrelogram fuzzy-rough c-means clustering fuzzy least absolute regression