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

New algorithms for κ-face cover, κ-feedback vertex set, and κ-disjoint cycles on plane and planar graphs

28th International Workshop on Graph-Theoretic Concepts in computer science, WG 2002

作者： Kloks, Ton Lee, C.M. Liu, Jiping Department of Computer Science and Information Engineering Chung Cheng University Ming-Shiung Chiayi 621 Taiwan Department of Mathematics and Computer Science University of Lethbridge AB T1K 3M4 Canada

ISBN: (纸本)3540003312

We present new fixed parameter algorithms for the face cover problem on plane graphs. We show that if a plane graph has a face cover with at most κfaces then its treewidth is bounded by O( √κ). An approximate tree decomposition can be obtained in linear time, and this is used to find an algorithm computing the face cover number in time O(c√κn) for some constant c. Next we show that the problem is in linear time reducible to a problem kernel of O(κ2) vertices, and this kernel can be used to obtain an algorithm that runs in time O(c √κ +n) for some other constant c. For the κ-disjoint cycles problem and the κ-feedback vertex set problem on planar graphs we obtain algorithms that run in time O(c√κ log κn) for some constant c. For the κ-feedback vertex set problem we can further reduce the problem to a problem kernel of size O(κ3) and obtain an algorithm that runs in time O(c√κ log κ+n) for some constant c 1. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

New algorithms for k-face cover, k-feedback vertex set, and k-disjoint cycles on plane and planar graphs

引用

28th International Workshop on Graph-Theoretic Concepts in computer science, WG 2002

作者： Kloks, Ton Lee, C.M. Liu, Jiping Department of Computer Science and Information Engineering Chung Cheng University Ming-Shiung Chiayi621 Taiwan Department of Mathematics and Computer Science The University of Lethbridge AlbertaT1K 3M4 Canada

ISBN: (纸本)3540003312

We present new fixed parameter algorithms for the face cover problem on plane graphs. We show that if a plane graph has a face cover with at most k faces then its treewidth is bounded by O[formula presented]. An approximate tree decomposition can be obtained in linear time, and this is used to find an algorithm computing the face cover number in time O[image found] for some constant c. Next we show that the problem is in linear time reducible to a problem kernel of O(k2) vertices, and this kernel can be used to obtain an algorithm that runs in time O[formula presented] for some other constant c. For the k-disjoint cycles problem and the kfeedback vertex set problem on planar graphs we obtain algorithms that run in time O[formula presented] for some constant c. For the k-feedback vertex set problem we can further reduce the problem to a problem kernel of size O(k3) and obtain an algorithm that runs in time O[image found] for some constant c 1. © Springer-Verlag Berlin Heidelberg 2002.

关键词： Trees (mathematics)

来源：评论

学校读者我要写书评

暂无评论

Contractible edges in minimally k-connected graphs

引用

Electronic Notes in Discrete mathematics 2002年 11卷 20-29页

作者： Ando, Kiyoshi Kaneko, Atsushi Kawarabayashi, Ken-ichi Department of Information and Communication Engineering The University of Electro-Communications Chofu City Tokyo 182-8585 1-5-1 Chofugaoka Japan Department of Computer Science and Communication Engineering Kogakuin University Shinjuku-ku Tokyo 163-8677 1-24-2 Nishi-Shinjuku Japan Department of Mathematics Faculty of Science and Technology Keio University Kohoku-ku Yokohama 223-8522 3-14-1 Hiyoshi Japan

An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. In this paper, we prove that a (K1 + C4)-free minimally k-connected graph has a k-contractible... 详细信息

An edge of a k-connected graph is said to be k-contractible if the contraction of the edge results in a k-connected graph. In this paper, we prove that a (K₁ + C₄)-free minimally k-connected graph has a k-contractible edge, if around each vertex of degree k, there is an edge which is not contained in a triangle. This implies previous two results, one due to Thomassen and the other due to Kawarabayashi. © 2002.

关键词： contractible edge k-connected graph minimally k-connected

来源：评论

学校读者我要写书评

暂无评论

Process languages for rooted eager bisimulation

Process languages for rooted eager bisimulation

引用

11th International Conference on Concurrency Theory, CONCUR 2000

作者： Ulidowski, Irek Yuen, Shoji Department of Mathematics and Computer Science University of Leicester University Road Leicester LE1 7RH United Kingdom Department of Information Engineering Nagoya University Furo-cho Chikusa-ku Nagoya 464-8603 Japan

ISBN: (纸本)3540678972

We present a general class of process languages for rooted eager bisimulation preorder and prove its congruence result. Also, we present classes of process languages for the rooted versions of several other weak preorders. The process languages we propose are defined by the Ordered SOS method which combines the traditional SOS approach, based on transition rules, with the ordering on transition rules. This new feature specifies the order of application of rules when deriving transitions of process terms. We support and illustrate our results with examples of process operators and process languages which benefit from the OSOS formulation. © Springer-Verlag Berlin Heidelberg 2000.

关键词： Systems engineering

来源：评论

学校读者我要写书评

暂无评论

A method of shape control of curve design

A method of shape control of curve design

引用

Geometric Modeling and Processing 2000, GMP 2000

作者： Qi, Duan Chen, T.S. Djidjeli, K. Price, W.G. Twizell, E.H. Department of Mathematics and Physics Shandong University of Technology Jinan250061 China Department of Computer Science and Information Engineering Dayeh University Taiwan Department of Ship Science University of Southampton SouthamptonSO17 1BJ United Kingdom Department of Mathematics and Statistics Brunel University Uxbridge MiddlesexUB8 3PH United Kingdom

ISBN: (纸本)0769505627

Constraining an interpolating curve to be bounded in a given region is an important task in curve design. In (Qi Duan et al., 1999) the rational cubic spline with a linear denominator has been used to control the interpolating curves to be bounded in the given region, but it does not work in some cases. This paper deals with the weighted rational cubic spline with a linear denominator for this kind of constraint, the sufficient condition for controlling the interpolating curves to be bounded in the given region are derived. An example is given which shows that the constraint which cannot be done by the rational spline defined in (Qi Duan et al., 1999) could be achieved by the weighted rational spline. © 2000 IEEE.

关键词： Interpolation

来源：评论

学校读者我要写书评

暂无评论

An approach for high-yield requirements capture for e-commerce and its application

引用

International Journal on Digital Libraries 2000年第4期3.0卷 302-308页

作者： Saleh, K. Probert, R.L. Li, W. Fong, W. American University of Sharjah Department of Computer Science and Mathematics Sharjah P.O. Box 26666 United Arab Emirates University of Ottawa School of Information Technology and Engineering Ottawa ON K1N 6N5 Canada IBM Canada Markham ON L3R 9Z7 3600 Steeles Av. East Canada

Web-based e-commerce software is typically real-time, responsive, and distributed software that must meet high quality requirements. Moreover, because of its Internet-based operating environment, e-commerce software must deal with concurrency, synchronization, and non-deterministic issues (such as delays) primarily caused by the heavy usage load and underlying network conditions. In this paper, we introduce a generic, cost- effective approach to optimize requirements capture (and subsequent development and testing) with respect to functional coverage and customer perception of quality. This high-yield approach is presented and illustrated by application to an e-commerce online shopping system and used to explain the principles of use-case requirements captured in the unified modeling language. © Springer-Verlag 2001.

关键词： Electronic commerce High-yield scenarios Requirements capture approach UML

来源：评论

学校读者我要写书评

暂无评论

Search for Multi-TeV gamma-ray emission from nearby SNRs with the Tibet air shower array The Tibet ASγ Collaboration

引用

AIP Conference Proceedings 2000年第1期515卷 459-466页

作者： M. Amenomori S. Ayabe P. Y. Cao L. K. Ding Z. Y. Feng Y. Fu H. W. Guo M. He K. Hibino N. Hotta Q. Huang A. X. Huo K. Izu H. Y. Jia F. Kajino K. Kasahara Y. Katayose Labaciren J. Y. Li H. Lu S. L. Lu G. X. Luo X. R. Meng K. Mizutani J. Mu H. Nanjo M. Nishizawa M. Ohnishi I. Ohta T. Ouchi J. R. Ren T. Saito M. Sakata T. Sasaki Z. Z. Shi M. Shibata A. Shiomi T. Shirai H. Sugimoto K. Taira Y. H. Tan N. Tateyama S. Torii T. Utsugi C. R. Wang H. Wang H. Y. Wang P. X. Wang X. W. Xu Y. Yamamoto G. C. Yu A. F. Yuan T. Yuda C. S. Zhang H. M. Zhang J. L. Zhang N. J. Zhang X. Y. Zhang Zhaxisangzhu Zhaxiciren W. D. Zhou 1Department of Physics Hirosaki University Hirosaki Japan 2Department of Physics Saitama University Urawa Japan 5Institute of High Energy Physics Academia Sinica Beijing China 9Institute for Cosmic Ray Research University of Tokyo Tanashi Japan 6Department of Physics South West Jiaotong University Chengdu China 3Department of Physics Shangdong University Jinan China 4Department of Mathematics and Physics Tibet University Lhasa China 7Faculty of Engineering Kanagawa University Yokohama Japan 10Department of Physics Konan University Kobe Japan 11Faculty of Systems Engineering Shibaura Institute of Technology Omiya Japan 12Department of Physics Yunnan University Kunming China 13National Center for Science Information Systems Tokyo Japan 8Faculty of Education Utsunomiya University Utsunomiya Japan 14Tokyo Metropolitan College of Aeronautical Engineering Tokyo Japan 15Faculty of Engineering Yokohama National University Yokohama Japan 16Shonan Institute of Technology Fujisawa Japan

The Tibet air-shower array operating at Yangbajing (4300 m above sea level) is sensitive to gamma-ray air showers at energies as low as 3 TeV. The observation of the Moon’s shadow has provided a direct check of the angular resolution, the energy estimation and the systematic pointing error of this air-shower array. Using these data, we have searched for multi-TeV gamma-ray emission from 27 SNRs located within 10 kpc distance in the declination band of −10° to +70°. The signal from the Crab Nebula was detected at 5.5 σ level. The intensity observed is (4.61±0.90)×10−12 cm−2 s−1 TeV−1 at 3 TeV. No significant DC excess was found from any of these SNRs except from the Crab Nebula.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Detection of TeV gamma rays from Mrk 501 at high flaring state of activity in 1997 with the Tibet air shower array

引用

AIP Conference Proceedings 2000年第1期515卷 139-143页

作者： M. Amenomori S. Ayabe P. Y. Cao L. K. Ding Z. Y. Fen Y. Fu H. W. Guo M. He K. Hibino N. Hotta Q. Huang A. X. Huo K. Izu H. Y. Jia F. Kajino K. Kasahara Y. Katayose J. Y. Li H. Lu S. L. Lu G. X. Luo X. R. Meng K. Mizutani J. Mu H. Nanjo M. Nishizawa M. Ohnishi I. Ohta T. Ouchi J. R. Ren T. Saito M. Sakata T. Sasaki Z. Z. Shi M. Shibata A. Shiomi T. Shirai H. Sugimoto K. Taira Y. H. Tan N. Tateyama S. Torii T. Utsugi C. R. Wang H. Wang X. W. Xu Y. Yamamoto G. C. Yu A. F. Yuan T. Yuda C. S. Zhang H. M. Zhang J. L. Zhang N. J. Zhang X. Y. Zhang W. D. Zhou 1Department of Physics Hirosaki University Hirosaki Japan 2Department of Physics Saitama University Urawa Japan 3Department of Physics Shangdong University Jinan China 5Institute of High Energy Physics Academia Sinica Beijing China 6Department of Physics South West Jiaotong University Chengdu China 4Department of Mathematics and Physics Tibet University Lhasa China 7Faculty of Engineering Kanagawa University Yokohama Japan 8Faculty of Education Utsunomiya University Utsunomiya Japan 9Institute for Cosmic Ray Research University of Tokyo Tanashi Japan 10Department of Physics Konan University Kobe Japan 11Faculty of Systems Engineering Shibaura Institute of Technology Omiya Japan 12Department of Physics Yunnan University Kunming China 13National Center for Science Information Systems Tokyo Japan 14Tokyo Metropolitan College of Aeronautical Engineering Tokyo Japan 15Faculty of Engineering Yokohama National University Yokohama Japan 16Shonan Institute of Technology Fujisawa Japan Tibet ASγ Collaboration

The BL Lac object Mrk 501 came into a high flaring state in 1997, brightest in the sky at TeV energies. Using the air shower data obtained with a high density part of the Tibet II array, being operating at Yangbajing since 1996, we searched for γ-ray signals from this source during the period from February to August in 1997. The result shows a 3.7σ excess for showers with its mode energy 3 TeV for the whole period and 4.7σ excess for the period from April 7 to June 16. The estimated energy spectrum of γ rays is consistent with those obtained by imaging atmospheric Cherenkov detectors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Preface

Lecture Notes in Computer Science (including subseries Lectu...

引用

Lecture Notes in computer science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) 1999年 1711卷 V页

作者： Zhong, Ning Skowron, Andrzej Ohsuga, Setsuo Department of Computer Science and Systems Engineering Yamaguchi University Tokiwa-Dai 2557 Ube Japan Institute of Mathematics Warsaw University Banacha 2 Warsaw Poland School of Science and Engineering Department of Information and Computer Science Waseda University 3-4-1 Okubo Shinjuku-ku Tokyo Japan

来源：评论

学校读者我要写书评

暂无评论

Frameworks for mining binary relations in data 1st

Frameworks for mining binary relations in data

引用

1st International Conference on Rough Sets and Current Trends in Computing, RSCTC 1998

作者： Lin, T.Y. Zhong, N. Dong, J.J. Ohsuga, S. Department of Mathematics and Computer Science San Jose State University San JoseCA95192 United States Department of Electric Engineering and Computer Science University of California BerkeleyCA94720 United States Department of Computer Science and Systems Engineering Yamaguchi University Tokiwa-Dai 2557 Ube755 Japan Department of Information and Computer Science Waseda University 3-4-1 Okubo ShinjukuTokyo169 Japan

This paper extends the notion of information tables and concept hierarchies of equivalence relations to binary relations. So extended rough set theory and attribute oriented generalization techniques can be used to mi... 详细信息

ISBN: (纸本)3540646558

关键词： Rough set theory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：