检索结果-内蒙古大学图书馆

Annual International Conference of the IEEE Engineering in Medicine and Biology Society (EMBC)

作者： L. Kari S. Konstantinidis Department of Computer Science University of Western Ontario London ONT Canada Department of Math. & Computing Science Saint Mary's University Halifax NS Canada

We provide an overview of some current developments on code-related properties of DNA languages. A DNA language is a set of words, each of which is made up of the letters A, C, G, T. Such a word is meant to represent a physical DNA strand. A collection of DNA strands can be stored in-vitro and, either serve the purpose of a database, or undergo a sequence of controlled bio-operations that would constitute a meaningful computation. In both cases, the strands should be chosen in such a way that they would not form unwanted hybridizations with each other and any errors in the nucleotides comprising the strands can be detected. These requirements can be translated in the framework of formal language theory by considering DNA languages whose words satisfy certain combinatorial properties. We consider two types of desirable properties: static and dynamic. The former ensure that no unwanted hybridizations can occur. The latter ensure that, after a permitted bio-operation is applied to the strands, the resulting strands also satisfy the desirable properties.

关键词： DNA computing Sequences Formal languages Encoding In vitro Computer science Databases Concatenated codes Genetics Evolutionary computation

来源：评论

学校读者我要写书评

暂无评论

A Modal Characterization of Nash Equilibrium

A Modal Characterization of Nash Equilibrium

引用

作者： Harrenstein, Paul Meyer, John-Jules Van der Hoek, Wiebe Witteveen, Cees Inst. of Info./Computing Sciences Utrecht University Utrecht Netherlands Computer Science Department University of Liverpool Liverpool United Kingdom Fac. of Elec. Eng. Math./Comp. Sci. Delft University of Technology Delft Netherlands

Multi-agent systems comprise entities whose individual decision making behavior may depend on one another's. Game-theory provides apposite concepts to reason in a math.matically precise fashion about such interactive and interdependent situations. This paper concerns a logical analysis of the game-theoretical notions of Nash equilibrium and its subgame perfect variety as they apply to a particular class of extensive games of perfect information. Extensive games are defined as a special type of labelled graph and we argue that modal languages can be employed in their description. We propose a logic for a multi-modal language and prove its completeness with respect to a class of frames that correspond with a particular class of extensive games. In this multimodal language (subgame perfect) Nash equilibria can be characterized. Finally, we show how this approach can formally be refined by using Prepositional Dynamic Logic (PDL), though we leave completeness as an open question.

关键词： Multi agent systems

来源：评论

学校读者我要写书评

暂无评论

Induction of ordinal decision tree

Induction of ordinal decision tree

引用

Proceedings of 2002 International Conference on Machine Learning and Cybernetics

作者： Lee, John W.T. Liu, Da-Zhong Department of Computing Hong Kong Polytechnic University Hung Hom Hong Kong Sch. of Math. and Computer Science Hebel University Baoding China

ISBN: (纸本)0780375084

In many disciplines, such as social and behavioral sciences, we often have to do ordinal classification by assigning objects to ordinal classes. The fundamental objective of ordinal classification is to create an ordering in the universe of discourse. As such, a decision tree for ordinal classification should aim at producing an ordering which is most consistent with the implicit ordering in the input data. Ordinal classification problems are often dealt with by treating ordinal classes as nominal classes, or by representing the classes as values on a quantitative scale. Such approaches may not lead to the most desirable results since the methods do not fit the type of data, viz. ordinal data, concerned. In this paper, we propose a new measure for assessing the quality of output from an ordinal classification approach. We also propose an induction method to generate an ordinal decision tree for ordinal classification based on this quality perspective. We demonstrate the advantage of our method using results from a set of experiments.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

A graded quadrivalent logic for ordinal preference modelling: Loyola-like approach

引用

Fuzzy Optimization and Decision Making 2002年第1期1卷 93-111页

作者： Fortemps, Philippe Slowiński, Roman Department of Math. and O.R Mons Institute of Technology Rue de Houdain 9 B-7000 Mons Belgium Institute of Computing Science Poznań University of Technology Piotrowo 3A PL-60-965 Poznań Poland

We extend a quadrivalent logic of Belnap to graded truth values in order to handle graded relevance of positive and negative arguments provided in preferential information concerning ranking of a finite set of alternatives. This logic is used to design the preference modelling and exploitation phases of decision aiding with respect to the ranking problem. The graded arguments are presented on an ordinal scale and their aggregation leads to preference model in form of four graded outranking relations (true, false, unknown and contradictory). The exploitation procedure combines the min-scoring procedure with the leximin rule. Aggregation of positive and negative arguments as well as exploitation of the resulting outranking relations is concordant with an advice given by St. Ignatius of Loyola (1548) "how to make a good choice". © 2002 Kluwer Academic Publishers.

关键词： Decision making

来源：评论

学校读者我要写书评

暂无评论

Parametric sensitivity in building fuzzy decision trees: An experimental analysis

Parametric sensitivity in building fuzzy decision trees: An ...

引用

Proceedings of 2002 International Conference on Machine Learning and Cybernetics

作者： Wang, Xi-Zhao Zhao, Ming-Hua Yeung, Daniel So School of Math. and Computer Science Hebei University Baoding Hebei China Department of Computing Hong Kong Polytechnic University Hung Hom Kowloon Hong Kong

ISBN: (纸本)0780375084

Fuzzy Decision Tree (FDT) induction is an extraction technique of fuzzy rules, which has been widely used in handling ambiguous classification problems related to human's thought and sense. The entire process of building FDT is based on a specified parameter (called significant level) which seriously affects the computation of fuzzy entropy and classification result of FDT. Since the value of this parameter is usually given in terms of human experience while building a FDT, it is very difficult to determine its optimal value. This paper makes an attempt to give some guidelines for how to automatically choose the optimal value of this parameter by analyzing analytic expression between this parameter and fuzzy entropy and further by investigating the decision tree's sensitivity to the parameter perturbation.

关键词： Learning systems

来源：评论

学校读者我要写书评

暂无评论

A note on proximity spaces and connection based mereology 01

A note on proximity spaces and connection based mereology

引用

Formal Ontology in Information Systems: Collected Papers from the Second International Conference

作者： Vakarelov, Dimiter Düntsch, Ivo Bennett, Brandon Laboratory for Applied Logic Fac. of Math. and Computer Science Sofia University blvd James Bouchier 5 1126 Sofia Bulgaria Faculty of Informatics University of Ulster Newtownabbey BT 370QB United Kingdom School of Computing University of Leeds Leeds LS2 9JT United Kingdom Department of Computer Science Brock University St. Catherines Ont. L2S 3AI Canada

ISBN: (纸本)1581133774

Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann has demonstrated the fruitfulness of the methods of continuous lattices to obtain a topological representation theorem for his formalisation of Whiteheadian ontological theory of space;similar results have been obtained by Roeper. In this note, we prove a topological representation theorem for a connection based class of systems, using methods and tools from the theory of proximity spaces. The key novelty is a new proximity semantics for connection relations.

关键词： Information science

来源：评论

学校读者我要写书评

暂无评论

Bisimilarity in term graph rewriting

引用

作者： Ariola, Zena M. Klop, Jan Willem Plump, Detlef Comp./Information Science Department University of Oregon Eugene OR 97401 United States Dept. of Math. and Computer Science Vrije Universiteit 1081 HV Amsterdam Netherlands Computing Science Institute Katholieke Universiteit Nijmegen Postbus 9010 6500 GL Nijmegen Netherlands Fb. Mathematik und Informatik Universität Bremen Postfach 33 04 40 28334 Bremen Germany

We present a survey of confluence properties of (acyclic) term graph rewriting. Results and counterexamples are given for different kinds of term graph rewriting;besides plain applications of rewrite rules, extensions with the operations of collapsing and copying, and both operations together are considered. Collapsing and copying together constitute bisimilarity of term graphs. We establish sufficient conditions for - and counterexamples to - confluence, confluence modulo bisimilarity, and the Church-Rosser property modulo bisimilarity. Moreover, we address rewriting modulo bisimilarity, that is, rewriting of bisimilarity classes of term graphs. © 2000 Academic Press.

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

Quasiperiodic patterns generated by mixing lattices derived from a dodecahedral star and an icosahedral star

引用

Acta Crystallographica Section A: Foundations of Crystallography 1999年第3期55卷 508-511页

作者： Soma, T. Watanabe, Y. Japan Sci. and Technol. Corporation Kawaguchi-shi Saitama 332 4-1-8 Honcho Japan Dept. of Math. and Computing Science University of the South Pacific Suva Fiji Department of Information Systems Teikyo Heisei University Ichihara Chiba 290-0193 2289 Uruido Japan

A 3D quasiperiodic pattern by projection from an nD lattice can be defined by an orthonormal n × n lattice matrix which produces basis vectors in pattern space with a prescribed arrangement and basis vectors in perpendicular or test space satisfying the quasicrystallographic condition. A 16 × 16 lattice matrix is derived which produces basis vectors in pattern space as a combination or mixing of dually positioned dodecahedral star and icosahedral star. It is shown that the mixed star constitutes a eutactic star. Since the module generated by the mixed eutactic star is totally irrational, patterns generated by projection using the lattice matrix are quasicrystallographic and the equilateral pattern is generated for 1 : 1 mixing. © 1999 International Union of Crystallography.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Extended conjugate gradient algorithm for the diffusion equation

引用

International Journal of Computer math.matics 1999年第1期72卷 81-99页

作者： Reju, Sunday A. Ibiejugba, Matthew A. Evans, David J. Math. and Comp. Science Department Federal University of Technology Minna Nigeria Department of Mathematics University of Ilorin Ilorin Nigeria Department of Computing Nottingham Trent University Nottingham United Kingdom

In this study, both the kinetic and diffusive behaviors of the parabolic control problem of integral quadratic cost functional solvable by the Extended Conjugate Gradient Method (ECGM) were examined. Using a Hamiltonian formulation as a solution to this problem, temperature was obtained as the rate of change with time of the source.

关键词： Algorithms

来源：评论

学校读者我要写书评

暂无评论

Genetic micro-rollback self-recovery synthesis

Genetic micro-rollback self-recovery synthesis

引用

Congress on Evolutionary Computation

作者： K. Sookhanaphibarn C. Lursinsap Dept. of Math. & Comput. Sci. Chulalongkorn Univ. Bangkok Thailand Advanced Virtual and Intelligent Computing Laboratory Department of Mathematics and Computer Science Chulalongkom University Bangkok Thailand

Self-recovery micro-rollback synthesis (SMS) has currently become an important issue in high level synthesis. The problem of SMS combines the problem of functional unit scheduling and assignment with the problem of checkpoint insertion and microprogram optimization. It has been shown that these problems are NP-complete. The most studied problem is functional unit scheduling and assignment. Several heuristic techniques, including as soon as possible (ASAP), as last as possible (ALAP), integer programming, spring elasticity model, graph based mobility model, and genetic algorithm, are proposed. However, there are few studies on self-recovery micro-rollback synthesis and the technique of solution space searching by genetic algorithm has not been attempted. We study the feasibility of the genetic algorithm for the problem of SMS constrained on: the number of functional units, control steps, number of checkpoints, and the functional unit areas.

关键词： High level synthesis Circuit faults Genetic algorithms Space technology Very large scale integration Algorithm design and analysis Laboratories math.matics Computer science Processor scheduling

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：