检索结果-南通市图书馆

Hair Image Generation Using Connected Texels

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2001年第4期16卷 341-350页

作者：张晓鹏陈彦云吴恩华 laboratoryofcomputerscience InstituteofSoftwareThechineseAcademyofSciencesBeijing100080P.R.China

Generation of photo-realistic images of human hair is a challenging topic in computer graphics. The difficulty in solving the Problem in this aspect comes mainly from the extremely large number of hairs and the high complexity of the hair shapes. Regarding to the modeling and rendering of hair-type objects, Kajiya proposed a so-called texel model for producing furry surfaces. However, Kajiya's model could be only used for the generation of short hairs. In this paper, a concise and practical approach is presented to solve the problem of rendering long hairs, and in particular the method of rendering the smooth segmental texels for the generation of long hairs is addressed.

关键词： hair render texel volume rendering realistic image synthesis

Decomposing a Kind of Weakly Invertible Finite Automata with Delay 2

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2003年第3期18卷 354-360页

作者： YAOGang laboratoryofcomputerscience InstituteofSoftwareTheChineseAcademyofSciencesBeijing100080P.R.China

Some properties of a finite automaton composed of two weakly invertible finite automata with delay 1 are given, where each of those two automata has the output set of each state with the same size. And for a weakly invertible finite automaton M with delay 2 satisfying the properties mentioned in this paper, two weakly invertible finite automata with delay 1 are constructed such that M is equivalent to a sub-finite-automaton of the composition of those two. So a method to decompose this a kind of weakly invertible finite automata with delay 2 is presented.

关键词： finite automaton weakly invertible delay composition decomposition

Practical Type Checking of Functions Defined on Context-Free Languages

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2004年第6期19卷 840-847页

作者： Hai-MingChen Yun-MeiDong laboratoryofcomputerscience InstituteofSoftwareTheChineseAcademyofSciencesBeijing100080P.R.China

A type checking method for the functional language LFC is presented. A distinct feature of LFC is that it uses Context-Free (CF) languages as data types to represent compound data structures. This makes LFC a dynamically typed language. To improve efficiency, a practical type checking method is presented, which consists of both static and dynamic type checking. Although the inclusion relation of CF languages is not decidable, a special subset of the relation is decidable, i.e., the sentential form relation, which can be statically checked. Moreover, most of the expressions in actual LFC programs appear to satisfy this relation according to the statistic data of experiments. So, despite that the static type checking is not complete, it undertakes most of the type checking task. Consequently the run-time efficiency is effectively improved. Another feature of the type checking is that it converts the expressions with implicit structures to structured representation. Structure reconstruction technique is presented.

关键词： type checking context-free language algorithm

Towards a Theory of Bisimulation for the Higher-Order Process Calculi

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2004年第3期19卷 352-363页

作者： Yong-JianLi Xin-XinLiu laboratoryofcomputerscience InstituteofSoftwareTheChineseAcademyofSciencesBeijing100080P.R.China

In this paper, a labelled transition semantics for higher-order processcalculi is studied. The labelled transition semantics is relatively clean and simple, andcorresponding bisimulation equivalence can be easily formulated based on it. And the congruenceproperties of the bisimulation equivalence can be proved easily. To show the correspondence betweenthe proposed semantics and the well-established ones, the bisimulation is characterized as a versionof barbed equivalence and a version of context bisimulation.

关键词： higher-order process labelled transition semantics barbed bisimulation context-bisimulation

Probabilistic Belief Logic and Its Probabilistic Aumann Semantics

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2003年第5期18卷 571-579页

作者：曹子宁石纯一 laboratoryofcomputerscience InstituteofSoftwareTheChineseAcademyofSciencesBeijing100080P.R.China DepartmentofComputerScienceandTechnology TsinghuaUniversityBeijing100084P.R.China

In this paper, we present a logic system for probabilistic belief named PBL,which expands the language of belief logic by introducing probabilistic belief. Furthermore, wegive the probabilistic Aumann semantics of PBL. We also list some valid properties of belief andprobabilistic belief, which form the deduction system of PBL. Finally, we prove the soundness andcompleteness of these properties with respect to probabilistic Aumann semantics.

关键词： modal logic probabilistic belief logic aumann semantics probabilisticaumann semantics

A Framed Temporal Logic Programming Language

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Computer Science & Technology 2004年第3期19卷 341-351页

作者： Zhen-HuaDuan MaciejKoutny UniversityofNewcastleuponTyne NewcastleuponTyneNE17RUU.K. XidianUniversity Xi＇an710071P.R.China／／LaboratoryofComputerScienceISCASBeijing100080P.R.China

We discuss the projection temporal logic (PTL), based on a primitiveprojection operator, prj. A framing technique is also presented, using which a synchronizationoperator, await, is defined within the underlying logic. A framed temporal logic programminglanguage (FTLL) is presented. To illustrate how to use both the language and framing technique, someexamples are given.

关键词： temporal logic temporal logic programming frame projection concurrency

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

高阶π-演算的互模拟理论研究

Journal of Computer Science & Technology 2004年第C期19卷 21-22页

作者： Yong-JianLi Xin-XinLiu laboratoryofcomputerscience InstituteofSoftwareTheChineseAcademyofSciencesBeijing100080P.R.China

标签转移系统语义在早期的进程演算中取得了巨大的成功。基于标签转移系统，Milner与Park引入了互模拟的概念来描述进程间的等价性，互模拟从此成为整个进程演算中的理论基石。在经典的CCS进程演算中，标签转移系统用于描述进程的操作... 详细信息

标签转移系统语义在早期的进程演算中取得了巨大的成功。基于标签转移系统，Milner与Park引入了互模拟的概念来描述进程间的等价性，互模拟从此成为整个进程演算中的理论基石。在经典的CCS进程演算中，标签转移系统用于描述进程的操作语义，然后在此基础上，互模拟概念通过如下方式被定义出来：两个进程若互模拟，不仅要满足任何一方的行为都要能够被另外一方匹配。

关键词：进程互模拟 π-演算操作语义系统描述 CCS 高阶等价性匹配

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

上下文无关语言上的函数的实用类型检查

Journal of Computer Science & Technology 2004年第C期19卷 29-29页

作者： Hai-MingChen Yun-MeiDong laboratoryofcomputerscience InstituteofSoftwareChineseAcademyofSciencesBeijing100080P.R.China

本文介绍函数式语言LFC的一种类型检查方法。LFC语言是为支持软件形式规约的获取和检验工作而开发的一个通用的形式规约语言。该语言使用并结合了形式语言和递归函数这两种功能的强大的数学工具。由此，LFC语言在保持很强的表达能力的... 详细信息

本文介绍函数式语言LFC的一种类型检查方法。LFC语言是为支持软件形式规约的获取和检验工作而开发的一个通用的形式规约语言。该语言使用并结合了形式语言和递归函数这两种功能的强大的数学工具。由此，LFC语言在保持很强的表达能力的同时，也使得在规约获取过程中使用机器学习和其他机器辅助技术成为可能。LFC语言的理论基础是一种新的递归函数。

关键词：上下文无关语言递归函数函数式语言机器学习规约通用软件辅助技术检查获取