检索结果-南通市图书馆

Wuhan university Journal of Natural sciences 2004年第5期9卷 561-568页

作者： ZHANG Wei-feng 1,2.3 , XU Bao-wen 2.3,4 , ZHOU Xiao-yu 2.3,4 1. department of computer {2. and engineering, nanjing university of Posts and Telecommunications, nanjing 2.0003, jiangsu, china 2. department of computer science and engineering, southeast university, nanjing 210096, jiangsu, china 3. jiangsu Institute of Software Quality, nanjing 210096 jiangsu, china 4. The State Key Laboratory of Software engineering, Wuhan university, Wuhan 430072. Hubei, china department of computer {2. and engineering Nanjing University of Posts and Telecommunications Nanjing Jiangsu China department of computer {2. and engineering Southeast University Najing Jiangsu China jiangsu Institute of Software Quality Nanjing Jiangsu China The State Key Laboratory of Software engineering Wuhan University Wuhan Hubei China

Web search engines are very useful information service tools in the Internet. The current web search engines produce search results relating to the search terms and the actual information collected by them. Since the selections of the search results cannot affect the future ones, they may not cover most people’s interests. In this paper, feedback information produced by the user’s accessing lists will be represented by the rough set and can reconstruct the query string and influence the search results. And thus the search engines can provide self-adaptability. Key words WWW - search engine - query reconstruction - feedback CLC number TP 311. 135.4 Foundation item: Supported by the National Natural science Fundation of china (60373066). National Grand Fundamental Research 973 Program of china (2.02.B312.0). Opening Foundation of State Key Laboratory of Software engineering in Wuhan university, Opening Foundation of jiangsu Key Laboratory of computer Information Processing Technology in Soochow universityBiography: ZHANG Wei-feng (1975-), male, Ph.D. research direction: artificial intelligence, search engine, data mining, network language.

关键词： WWW search engine query reconstruction feedback

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

A Classification Method for Web Information Extraction

A Classification Method for Web Information Extraction

引用

The First Conference on Web Information System and Applications(WISA 2.04)

作者： LI Xiang-yang~1, ZHANG Ya-fei~1, LU Jian-jiang~(1,2., XU Bao-wen~2.1. Institute of Communications engineering, People’s Liberation Army university of {2. and Techndogy. nanjing 2.0007, jiangsu, china 2. department of computer science and engineering. southeast university, nanjing 210096, jiangsu, china

Web information extraction is viewed as a classification process and a competing classification method is presented to extract Web information directly through classification. Web fragments are represented with three general features and the similarities between fragments are then defined on the bases of these features. Through competitions of fragments for different slots in information templates, the method classifies fragments into slot classes and filters out noise information. Far less annotated samples are needed as compared with rule-based methods and therefore it has a strong portability. Experiments show that the method has good performance and is superior to DOM-based method in information extraction.

关键词： information extraction competing classification feature extraction wrapper induction

来源： cnki会议评论

在线全文

cnki会议

学校读者我要写书评

暂无评论

Constructing Three-Dimension Space Graph for Outlier Detection Algorithms in Data Mining

引用

Wuhan university Journal of Natural sciences 2004年第5期9卷 585-589页

作者： ZHANG Jing 1,2., SUN Zhi-hui 1 1.department of computer {2. and engineering, southeast university, nanjing 210096, jiangsu, china 2.department of Electricity and Information engineering, jiangsu university, Zhenjiang 2.2.01, jiangsu, china department of computer {2. and engineering Southeast University Nanjing 210096 Jiangsu China

Outlier detection has very important applied value in data mining literature. Different outlier detection algorithms based on distinct theories have different definitions and mining processes. The three-dimensional space graph for constructing applied algorithms and an improved GridOf algorithm were proposed in terms of analyzing the existing outlier detection algorithms from criterion and theory. Key words outlier - detection - three-dimensional space graph - data mining CLC number TP 311. 13 - TP 391 Foundation item: Supported by the National Natural science Foundation of china (70371015)Biography: ZHANG Jing (1975-), female, Ph. D, lecturer, research direction: data mining and knowledge discovery.

关键词： outlier detection three-dimensional space graph data mining

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Web Application Comprehension Based on Dependence Analysis

引用

Wuhan university Journal of Natural sciences 2004年第5期9卷 731-734页

作者： WU Jun-hua 1,2., XU Bao-wen 1 , JIANG Ji-xiang 1 1.department of computer {2. and engineering, southeast university, nanjing 210096, jiangsu, china 2.College of computer {2. and engineering, nanjing {12. of Technology, nanjing 2.0009, jiangsu , china department of computer {2. and engineering Southeast University Nanjing Jiangsu China College of computer science and {2. Najing University of Technology Nanjing Jiangsu China

Many research indicate a lot of money and time are spent on maintaining and modifying program delivered. So the policies to support program comprehension are very important. Program comprehension is a crucial and difficult task. Insufficient design, illogical code structure, short documents will enhance the comprehensive difficulty. Developing Web application is usually a process with quick implementation and delivery. In addition, generally a Web application is coded by combining mark language statements with some embedded applets. Such programming mode affects comprehension of Web applications disadvantageously. This paper proposes a method to improving understanding Web by dependence analysis and slice technology. Key words Web application comprehension - program dependence - hyper graph - pogram slicing CLC number TP 311 Foundation item: Supported in part by the Young Scientist’s Fund of NSFC (60373066, 6030302.). National Grand Fundamental Research 973 Program of china (2.02.B312.00) and National Research Foundation for the Doctoral Program of Higher Education of chinaBiography: WU Jun-hua (1965-), female, Ph. D. research direction: software {2..

关键词： Web application comprehension program dependence hyper graph pogram slicing

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

TENSILE　PROPERTIES　AND　CREEP　RESISTANCE　OF　Fe_3Al－BASED　ALLOYS　CONTAINING　NIOBIUM

引用

Acta Metallurgica Sinica(English Letters) 1996年第2期9卷 135-139页

作者： ZHANG Zhonghua SUN Yangshan GUO Jun(department of Materials science and {2., southeast university, nanjing 210096,china) southeast Univ Nanjing China

Small amount(0.5-0.8at.%) of niobium addition to the multicomponent alloys based on Fe3Al(Fe-2.Al-5Cr-0.5Mo-0.05Zr-0.05B-0.1Ce) results in the microstructural refinement and the increase in the yield strength at temperatures up to 600℃,but is not beneficial to room temperature *** of microanalysis indicate that the addition of niobium causes the formation of precipitates with complex compositions which strengthen both matrix and grain boundaries and enhance the creep resistance of the alloys.

关键词： Fe_3Al,Nb,tensile property creep

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Heuristic for no-wait flow shops with makespan minimization based on total idle-time increments

引用

science in china(Series F) 2008年第7期51卷 896-909页

作者： LI XiaoPing1,2.& WU Cheng3 1 School of computer science & {2., southeast university, nanjing 210096, china 2.Key Laboratory of computer Network and Information Integration (southeast university), Ministry of Education, nanjing 210096, china 3 department of Automation, Tsinghua university, Beijing 100084, china School of computer science & {2. Southeast University Key Laboratory of computer Network and Information Integration (southeast {2.) Ministry of Education department of Automation Tsinghua University

No-wait flow shops with makespan minimization are classified as NP-hard. In this paper, the optimization objective is equivalently transformed to total idle-time minimization. The independence relationship between tasks is analyzed, and objective increment properties are established for the fundamental operators of the heuristics. The quality of the new schedules generated during a heuristic is judged only by objective increments and not by the traditional method, which computes and compares the objective of a whole schedule. Based on objective increments, the time complexity of the heuristic can be decreased by one order. A seed phase is presented to generate an initial solution according to the transformed objective. Construction and improvement phases are introduced by experimental analysis. The FCH （fast composite heuristic） is proposed and compared with the most effective algorithms currently available for the considered problem. Experimental results show that the effectiveness of the FCH is similar to that of the best methods but requires far less computation time. The FCH can also be efficient in real time scheduling and rescheduling for no-wait flow shops.

关键词： no-wait flow shops heuristic makespan Tabu search

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Restrictive mechanism of flow control among non-cooperative Internet users

引用

science china(Information sciences) 2011年第1期54卷 12-22页

作者： TAO Jun1,2.ZHONG Xiao1,2.& LU YiFei1,2.1Key Laboratory of computer Network and Information Integration,southeast {2., Ministry of Education,nanjing 210096,china 2.chool of computer science and engineering,southeast {2.,nanjing 210096,china Key Laboratory of computer Network and Information Integration Southeast University Ministry of Education School of computer science and {2. Southeast University

The flow and congestion control methods based on one-shot game model with non-cooperative game theory can explain the non-cooperative behavior of Internet ***,the low effciency of equilibrium solutions affects their *** the behavior of flow and congestion control based on infinitely repeated game models is addressed;the repeated and infinitely repeated flow and congestion control game model is presented; the existence and optimization of the Nash equilibrium point are proved;the discount factor in repeated game is discussed;the punishment and threat strategy to users'misbehavior is studied in N-users infinitely flow control game;the punishment restrictive method of users'behavior is designed in infinitely and finitely games;finally,a flow control algorithm based on repeated game,FCAR,is provided based on the conclusions of repeated game *** results of experiment and simulation show that FCAR algorithm could regularize and restrict users' misbehavior *** algorithm can also make non-cooperative Internet users achieve cooperation in order to optimize the utility of the whole flow and congestion control system.

关键词： Nash equilibrium utility infinitely and finitely repeated game flow and congestion control

来源：

同方期刊数据库评论

在线全文

同方期刊数据库

学校读者我要写书评

暂无评论

A new sequential learning algorithm for RBF neural networks

引用

science china(Technological sciences) 2004年第4期47卷 447-460页

作者： YANG Ge1, LV Jianhong1 & LIU Zhiyuan2.1. department of Power engineering,{2., nanjing 210096, china 2. department of Power engineering, nanjing Institute of Technology, nanjing 2.0013, china department of Power engineering Southeast University department of Power engineering Nanjing Institute of Technology

Due to their inherent imperfections, it is hard to use the static neural networks for nonlinear time-varying process modeling and prediction, and the minimal resource allocation network (MRAN) is difficult to be realized for its too many regulation parameters. A new sequential learning algorithm for radial basis function (RBF) neural networks based on local projection named Local Projection Network (LPN) is proposed in this paper. The results of validation for several benchmark problems with the new algorithm show that the presented LPN not only has the same level as M-RAN in network size and precision of the outputs, but also has fewer regulation parameters and is more predictable.

关键词： radial basis functions, local projection network, minimal resource allocation network, learning algorithm.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Study on impurity desorption induced by femtosecond pulse laser based on a stochastic process model

引用

science china(Technological sciences) 2006年第1期49卷 78-88页

作者： CHI Yinsheng1, LIN Xiaohui1, ZHUANG Ping1 & CHEN Yunfei1,2.1. department of Mechanical engineering,{2., nanjing 210096, china 2. Key Laboratory of MEMS of china Educational Ministry,{2., nanjing 210096, china department of Mechanical engineering Southeast University

With the advantages on non-equilibrium heating and desorption induced by electronic transition, the femtosecond pulse laser introduces a new way for solving the problem of impurity pollution adsorbed on a solid thin film in micro-electro-mechanical systems (MEMS). A model based on stochastic processes was established for stimulated desorption induced by the femtosecond pulse laser to interpret the interaction of the opti-cally excited hot electrons with the adsorbed molecules in a metal substrate. Numerical simulation results reveal a time-dependent desorption probability of adsorbed molecules and indicate that how key parameters of femtosecond pulse laser, such as incident laser energy flux, pulse duration, and wavelength of pulse, have a great effect on the desorption probability.

关键词： desorption, femtosecond pulse laser, stochastic process.

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

PRIMAL PERTURBATION SIMPLEX ALGORITHMS FOR LINEAR PROGRAMMING

引用

Journal of Computational Mathematics 2000年第6期18卷 587-596页

作者： Ping-qi Pan (department of Applied Mathematics, southeast university,{2., china.) 东南大学江苏南京 210096

In this paper, we propose two new perturbation simplex variants. Solving linear programming problems without introducing artificial variables, each of the two uses the dual pivot rule to achieve primal feasibility, and then the primal pivot rule to achieve optimality. The second algorithm, a modification of the first, is designed to handle highly degenerate problems more efficiently. Some interesting results concerning merit of the perturbation are established. Numerical results from preliminary tests are also reported. [ABSTRACT FROM AUTHOR]

关键词： linear programming perturbation primal simplex algorithm partially revised tableau

来源：

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

欢迎您,

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案：

请选择收藏分类：

通借通还

欢迎您,

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

在线全文

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：