Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms




НазваниеTitle: Enhancing global sls-resolution with loop cutting and tabling mechanisms
страница1/27
Дата07.10.2012
Размер0.68 Mb.
ТипДокументы
  1   2   3   4   5   6   7   8   9   ...   27


Accession number:2004508718395

Title:Enhancing global SLS-resolution with loop cutting and tabling mechanisms

Authors:Shen, Yi-Dong (1); You, Jia-Huai (2); Yuan, Li-Yan (2)

Author affiliation:(1) Laboratory of Computer Science, Institute of Software, Chinese Academy of Sciences, Beijing 100080, China; (2) Department of Computing Science, University of Alberta, Edmonton, Alta. T6G 2H1, Canada

Corresponding author:Shen, Y.-D.

(ydshen@ios.ac.cn)

Source title:Theoretical Computer Science

Abbreviated source title:Theor Comput Sci

Volume:328

Issue:3

Issue date:December 3, 2004

Publication year:2004

Pages:271-287

Language:English

ISSN:03043975

CODEN:TCSCDI

Document type:Journal article (JA)

Publisher:Elsevier

Abstract:Global SLS-resolution is a well-known procedural semantics for top-down computation of queries under the well-founded model. It inherits from SLDNF-resolution the linearity property of derivations, which makes it easy and efficient to implement using a simple stack-based memory structure. However, like SLDNF-resolution it suffers from the problem of infinite loops and redundant computations. To resolve this problem, in this paper we develop a new procedural semantics, called SLTNF-resolution, by enhancing Global SLS-resolution with loop cutting and tabling mechanisms. SLTNF-resolution is sound and complete w.r.t. the well-founded semantics for logic programs with the bounded-term-size property, and is superior to existing linear tabling procedural semantics such as SLT-resolution. © 2004 Elsevier B. V. All rights reserved.

Number of references:38

Main heading:Semantics

Controlled terms:Algorithms - Computational methods - Logic programming - Mathematical models - Problem solving - Query languages

Uncontrolled terms:Global SLS resolution - Loop cutting - Tabling - The well-founded semantics

Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.3 Database Systems - 723.4 Artificial Intelligence - 903.2 Information Dissemination - 921 Mathematics

Treatment:Theoretical (THR)

DOI:10.1016/j.tcs.2004.07.028

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.




Accession number:2004488687441

Title:Evaluation algorithms of a new kind of recursive functions

Authors:Chen, Hai-Ming (1)

Author affiliation:(1) Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Chen, H.-M.

(chm@ios.ac.cn)

Source title:Ruan Jian Xue Bao/Journal of Software

Abbreviated source title:Ruan Jian Xue Bao

Volume:15

Issue:9

Issue date:September 2004

Publication year:2004

Pages:1277-1291

Language:Chinese

ISSN:10009825

CODEN:RUXUEW

Document type:Journal article (JA)

Publisher:Chinese Academy of Sciences

Abstract:Recursive functions on context-free languages (CFRF) are a kind of new recursive functions proposed especially for describing non-numerical algorithms used on computers. An important research aspect of this kind of functions is the exploration of evaluation algorithms. The paper summarizes the author's research on this issue. Beginning by a discussion on possible combinations of calculation and parsing, it presents a comprehensive introduction to the major algorithms in an order in which the applicable ranges of the algorithms increase (this is also the order that the algorithms were devised). The introduction emphasizes on a new, efficient, and general evaluation algorithm, i.e. the tree-oriented evaluation algorithm. The paper also explains the evaluation method for the many-sorted recursive functions extended from CFRF. The algorithms of CFRF are realized on computers, and are validated by practice.

Abstract type:(Edited Abstract)

Number of references:23

Main heading:Recursive functions

Controlled terms:Algorithms - Computers - Context free grammars - Context free languages - Evaluation - Trees (mathematics)

Uncontrolled terms:Evaluation algorithms - Nonnumerical algorithms - Tree oriented evaluation

Classification code:721.1 Computer Theory, Includes Formal Logic, Automata Theory, Switching Theory, Programming Theory - 723.1.1 Computer Programming Languages - 723.5 Computer Applications - 921 Mathematics

Treatment:Applications (APP); General review (GEN); Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.




Accession number:2004248214256

Title:Research and implementation on improving kernel premempablity of Linux

Authors:Zhao, Hui-Bin (1); Li, Xiao-Qun (1); Sun, Yu-Fang (1)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Zhao, H.-B.

(hbzhao@sonata.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers

Abbreviated source title:Jisuanji Xuebao

Volume:27

Issue:2

Issue date:February 2004

Publication year:2004

Pages:244-251

Language:Chinese

ISSN:02544164

CODEN:JIXUDT

Document type:Journal article (JA)

Publisher:Science Press

Abstract:Using an open source system, Linux, as the supporting OS is more and more popular in many fields, and it is regarded as a potential aspect by many users to improve Linux performance to satisfy the real-time requirements. Inspired mostly by some real time improvements of Linux, the article gives rise to three methods to improve the prempatibility of Linux kernel: tasked interrupt handling, modified mutex mechanism and mutex protocol support. The authors also describe the implementation under version of 2.2 series. The modification is a successful effort to decrease the grain of kernel trap and increase the precision of schedule.

Abstract type:(Edited Abstract)

Number of references:7

Main heading:Computer operating systems

Controlled terms:Distributed database systems - Network protocols - Real time systems

Uncontrolled terms:Kernel Premempablity - Linux - Mutex - Open source system - Priority ceiling protocol - Priority inheritance protocol

Classification code:722 Computer Systems and Equipment - 722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.3 Database Systems

Treatment:Experimental (EXP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.




Accession number:2004318296854

Title:Fuzzy dynamic pre-emptive scheduling algorithms

Authors:Jin, Hong (1); Wang, Hong-An (1); Wang, Qiang (1); Fu, Yong (1); Wang, Hui (1)

Author affiliation:(1) Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Corresponding author:Jin, H.

(hjin@iel.iscas.ac.cn)

Source title:Jisuanji Xuebao/Chinese Journal of Computers

Abbreviated source title:Jisuanji Xuebao

Volume:27

Issue:6

Issue date:June 2004

Publication year:2004

Pages:812-818

Language:Chinese

ISSN:02544164

CODEN:JIXUDT

Document type:Journal article (JA)

Publisher:Science Press

Abstract:Aiming to uncertain task characteristics, it is presented to apply fuzzy theory to dynamic preemptive scheduling. Making use of linguistic fuzzy sets for describing uncertain characteristics and different priority levels, the principle of maximum membership function for determining task priority level, and the policy of scheduling tasks with high priority lever first for increasing the scheduling success ratio of critical tasks, it realizes the preemptive scheduling of tasks with uncertain characteristics. Compared to the classical EDF and LSF, the simulations show that the proposed approach can improve the scheduling success ratio of critical tasks and reduce their mean missed deadline rate, meanwhile, mean switching number among tasks gets decreased greatly compared to LSF and is close to EDF. The proposed method can be applied to control task scheduling in computer-controlled systems, and used for reference in real-time scheduling research with uncertain characteristic or limited priority level.

Number of references:10

Main heading:Real time systems

Controlled terms:Computer control systems - Fuzzy sets - Membership functions - Scheduling

Uncontrolled terms:Dynamic preemptive scheduling algorithm - Linguistic fuzzy set - Priority level - Real time scheduling - Scheduling policy - Uncertain task

Classification code:722.4 Digital Computers and Systems - 731.1 Control Systems - 921 Mathematics

Treatment:Applications (APP)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.




Accession number:2004498707828

Title:Manifold-guaranteed out-of-core simplification based on vertex clustering

Authors:Cai, Kangying (0); Sun, Hanqiu (0); Wu, Enhua (0)

Corr. author affiliation:Lab. of Comp. Sci., Inst. of Software, Chinese Acad. of Sci., Beijing 100080, China

Source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao/Journal of Computer-Aided Design and Computer Graphics

Abbreviated source title:Jisuanji Fuzhu Sheji Yu Tuxingxue Xuebao

Volume:16

Issue:10

Issue date:October 2004

Publication year:2004

Pages:1346-1354

Language:Chinese

ISSN:10039775

CODEN:JFTXFX

Document type:Journal article (JA)

Publisher:Institute of Computing Technology, Beijing, China

Abstract:In this paper we propose a manifold-guaranteed out-of-core simplification algorithm based on vertex clustering, referred to as MAG-Simp. All the manifold parts generated by vertex-clustering strategy are categorized into three types, triangle segments, inherent non-manifold edges and inherent non-manifold vertices. All the three types of non-manifold parts can be converted into manifold by simple operations. Our MAG-Simp algorithm does not require the input with manifold topology while the manifold topology of the resultant models could be guaranteed. Both the efficiency and simplicity of vertex clustering strategy and the quality of the simplified model are maintained.

Number of references:19

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.




Accession number:2004398380408

Title:An efficient multicast protocol in mobile IPv6 networks

Authors:Sun, Limin (1); Liao, Yong (1); Zheng, Jianping (1); Yichuan, Wu (1); Ma, Jian (2)

Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China; (2) Nokia Research Center, China, Beijing, China

Corresponding author:Sun, L.

(slm@iscas.ac.cn)

Source title:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004

Abbreviated source title:2004 IEEE Wireless Commun. Networking Conf.

Volume:1

Monograph title:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004

Issue date:2004

Publication year:2004

Pages:155-159

Language:English

ISBN-10:0780383443

ISBN-13:9780780383449

Document type:Conference article (CA)

Conference name:2004 IEEE Wireless Communications and Networking Conference, WCNC 2004

Conference date:March 21, 2004 - March 25, 2004

Conference location:Atlanta, GA, United states

Conference code:63498

Publisher:Institute of Electrical and Electronics Engineers Inc.

Abstract:Mobile IPv6 provides two basic schemes called remote subscription and home subscription to provide multicast service for mobile hosts. Those two algorithms have complementary advantages. In this paper, we propose a new scheme called previous network subscription, which can provide low handover delay for real time multicast applications. We also propose a new multicast routing protocol called RHMoM (Region based Hierarchical Mobile Multicast) by combining the previous network subscription and the home subscription. RHMoM uses two kinds of agent and employs the region based hierarchical architecture to limit the reconstruction frequency of the multicast tree and optimize the delivery path. The simulation results show that RHMoM has better performance than other mobile multicast solutions in mobile IPv6 network.

Number of references:11

Main heading:Telecommunication networks

Controlled terms:Algorithms - Multicasting - Network protocols - Packet networks - Packet switching - Synchronization

Uncontrolled terms:Hierarchial architecture - IPv6 - Mobile multicast protocol - Previous network subscription

Classification code:716 Telecommunication; Radar, Radio and Television - 717 Optical Communication - 718 Telephone Systems and Related Technologies; Line Communications - 723 Computer Software, Data Handling and Applications - 731.1 Control Systems - 921 Mathematics

Treatment:Theoretical (THR)

Database:Compendex

Compilation and indexing terms, Copyright 2009 Elsevier Inc.




Accession number:2004488478332

Title:A transaction model for long running business processes

Authors:Wang, Jinling (1); Jin, Beihong (1); Li, Jing (1)

Author affiliation:(1) Institute of Software, Chinese Academy of Sciences, Beijing, China

Corresponding author:Wang, J.

(jlwang@otcaix.iscas.ac.cn)

Source title:ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems

Abbreviated source title:ICEIS Proc. Sixth Int. Conf. Enterp. Inf. Syst.

Monograph title:ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems

Issue date:2004

Publication year:2004

Pages:267-274

Language:English

ISBN-10:9728865007

ISBN-13:9789728865009

Document type:Conference article (CA)

Conference name:ICEIS 2004 - Proceedings of the Sixth International Conference on Enterprise Information Systems

Conference date:April 14, 2004 - April 17, 2004

Conference location:Porto, Portugal

Conference code:63846

Sponsor:I2S Informatica Sistemas Servicos; Oni; Associacao Comercial do Porto; Camara Municipal do Porto; Sogrape

Publisher:Inst. for Syst. and Technol. of Inf., Control and Commun. (INSTICC)

Abstract:Many business processes in the enterprise applications are both long running and transactional in nature, but currently no transaction model can provide full transaction support for such long running business processes. In this paper, we proposed a new transaction model - PP/T model. It can provide full transaction support for the long running business processes, so that application developers can focus on the business logic, with the underlying platform providing the required transactional semantics. Simulation results show that the model has good performance in processing the long running business processes.
  1   2   3   4   5   6   7   8   9   ...   27

Похожие:

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconGlobal warming projected water cycle changes over the Mediterranean, East and West: a comparison study of a super-high resolution global model with cmip3

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconTitle: sens-u: Remote human in loop health-monitoring system at home

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconResolution Of The Problem Of Boat People: The Case For a global Initiative

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms icon1. Title of Sub-programme: Enhancing Capacity in Basic Science Research and Training for Sustainable Development. 2

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconTitle: Determining the refractive index structure constant using high-resolution radiosonde data

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconProject Number: s-295 Title: Enhancing Food Safety Through Control of Food-borne Disease Agents Duration: October 1, 2000 to September 30, 2005

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconTitle: Solving global unconstrained optimization problems by symmetry-breaking

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconReferences: (a) imo resolution A. 741(18), International Management Code for the Safe Operation of Ships and for Pollution Prevention, 1993, as amended, including by imo resolution msc. 273(85), 2008

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconMonroe 2-Orleans boces sls eBook Collection

Title: Enhancing global sls-resolution with loop cutting and tabling mechanisms iconPeriod and sca gemstone cutting

Разместите кнопку на своём сайте:
Библиотека


База данных защищена авторским правом ©lib.znate.ru 2014
обратиться к администрации
Библиотека
Главная страница