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

Abstracts from the 8th International Congress of the Asia Pacific Society of Infection Control (APSIC)

Antimicrobial Resistance & Infection Control 2017年第2期6卷 1-49页

作者： Nantanit Sutthiruk Mari Botti Ana Hutchinson Julie Considine Andrea Driscoll Kumthorn Malathum Cucunawangsih Cucunawangsih Veronica Wiwing Vivien Puspitasari Rathina Kumar Shanmugakani Yukihiro Akeda Kazunori Tomono Takuya Kodera Pitak Santanirand Takayuki Yamanaka Yuho Horikoshi Hiroyuki Moriuchi Hiroyuki Kitajima Alyona Lavrinenko Nurlan Tabriz Margulan Kozhamuratov Yekatherine Serbo Ilya Azizov Dahae Yang Woonhyoung Lee Il Kwon Bae Jae Hyun Lee Hyukmin Lee Jung Ok Kim Seok Hoon Jeong Kyungwon Lee Thiba Peremalo Sharina Hamzah Priya Madhavan Eng Hwa Wong Leslie Than Mohd Nasir Mohd Desa Kee Peng Ng Marionne Geronimo Maria Fe Tayzon Maria Jesusa Maño Angela Chow Pei-Yun Hon Mar-Kyaw Win Brenda Ang Yee-Sin Leo Tina See Rocio Alvarez Marin Nicolas Kieffer Patrice Nordmann Laurent Poirel Marta Aires de Sousa Wison Laochareonsuk Sireekul Petyu Pawin Wanasitchaiwat Sutasinee Thana Chollathip Bunyaphongphan Woranan Boonsomsuk Pakpoom Maneepongpermpoon Silom Jamulitrat Dorairajan Sureshkumar Kalyanaraman Supraja Soundararajan Sharmila Benny Setiawan Nicolaski Lumbuun Haruo Nakayama Toshiko Ota Naoko Shirane Chikako Matuoka Kentaro Kodama Masanobu Ohtsuka Silverose Ann Andales Bacolcol Melecia Velmonte Allan Alde Keithleen Chavez Arlene Joy Esteban Aisa Jensen Lee Shio-ShinJean Tai-Chin Hsieh Huey-Jen Huang Shu-Ju Huang Yu-Huan Huang Pei-Chen Cheng Su-Fang Yu Shih-Ming Tsao Yuan-Ti Lee Chien-Feng Li Min-Chi Lu Nattapol Pruetpongpun Thana Khawcharoenporn Pansachee Damronglerd Nuntra Suwantarat Anucha Apisarnthanarak Sasinuch Rutjanawech Lisa Cushinotto Patty McBride Harding Williams Jr Hans Liu Phan Thi Hang Dinh Pham Phuong Anh Ngai Le Dung Khu Lam Nguyen Roel Beltran Castillo Ram Gopalakrishnan Venkatasubramanian Ramasubramanian Subramanian Sreevidya Ranganathan Jayapradha Atsushi Umetsu Tetsuhiro Noda Kenyuu Hashimoto Akihiro Hayashi Mikie Kabashima Ursula Jadczak Knut Elvelund Marit Johnsen Bente Borgen Egil Lingaas Chia-Hua Mao Fu-Chieh Chang Chang-Pan Liu Ru-Hui Chao Fu-chieh Chang Chang-pan Liu Junpen Pawapotako C Deakin University Melbourne Australia Epworth HealthCare Deakin University Melbourne Australia Eastern Health Deakin University Melbourne Australia Austin Health Deakin University Melbourne Australia Faculty of Medicine Ramathibodi Hospital Mahidol University Bangkok Thailand Ramathibodi Hospital Bangkok Thailand Faculty of Medicine Ramathibodi Hospital Bangkok Thailand Microbiology Department Faculty of Medicine Pelita Harapan University Tangerang Banten Indonesia Department of Microbiology Faculty of Medicine University of Pelita Harapan Tangerang Banten Indonesia Neuro Department Faculty of Medicine Pelita Harapan University Tangerang Banten Indonesia Department of Infection Control and Prevention Graduate School of Medicine Osaka University Osaka Japan Division of Infection Control and Prevention Osaka University Hospital Osaka Japan Research Institute for Microbial Diseases Osaka University Osaka Japan Tohoku Bio-Array Sendai Japan Faculty of Medicine Ramathibodi Hospital Mahidol University Bangkok Thailand Division of Infectious Diseases Department of Pediatrics Tokyo Metropolitan Children’s Medical Center Fuchu Tokyo Japan Department of Pediatrics Nagasaki University Hospital Nagasaki Japan Department of Neonatal Medicine Osaka Medical Center and Research Institute for Maternal and Child Health Osaka Japan Karaganda State Medical University Karaganda Kazakhstan Institute of Antimicrobial Chemotherapy Smolensk Russia Institute of Antimicrobial Chemotherapy Smolensk Russian Federation Department of Laboratory Medicine Kosin University College of Medicine Busan Korea Department of Dental Hygiene Silla University Busan Korea Yeongam-gun Public Health Center Yeongam Korea Department of Laboratory Medicine and Research Institute of Bacterial Resistance Yonsei University College of Medicine Seoul Korea School of Pharmacy Taylor’s University Lakeside Campus Subang Jaya Selangor Darul Ehsan Malaysia School of Medicine Taylor’s Univers

来源：评论

学校读者我要写书评

暂无评论

Selective integration of background knowledge in TCBR systems

Selective integration of background knowledge in TCBR system...

引用

19th International Conference on Case-Based Reasoning, ICCBR 2011

作者： Patelia, Anil Chakraborti, Sutanu Wiratunga, Nirmalie Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai-600036 India School of Computing Robert Gordon University Aberdeen AB25 1HG United Kingdom

ISBN: (纸本)9783642232909

This paper explores how background knowledge from freely available web resources can be utilised for Textual Case Based Reasoning. The work reported here extends the existing Explicit Semantic Analysis approach to representation, where textual content is represented using concepts with correspondence to Wikipedia articles. We present approaches to identify Wikipedia pages that are likely to contribute to the effectiveness of text classification tasks. We also study the effect of modelling semantic similarity between concepts (amounting to Wikipedia articles) empirically. We conclude with the observation that integrating background knowledge from resources like Wikipedia into TCBR tasks holds a lot of promise as it can improve system effectiveness even without elaborate manual knowledge engineering. Significant performance gains are obtained using a very small number of features that have very strong correspondence to how humans describe the domain. © 2011 Springer-Verlag.

关键词： Case based reasoning

来源：评论

学校读者我要写书评

暂无评论

50 years of CORDIC: Algorithms, architectures, and applications

引用

IEEE Transactions on Circuits and Systems I: Regular Papers 2009年第9期56卷 1893-1907页

作者： Meher, Pramod K. Valls, Javier Juang, Tso-Bing Sridharan, K. Maharatna, Koushik Department of Communication Systems Institute for Infocomm Research Singapore 138632 Singapore Instituto de Telecomunicaciones y Aplicaciones Multimedia Universidad Politécnica de Valencia 46730 Grao de Gandia Spain Department of Computer Science and Information Engineering National Pingtung Institute of Commerce Pingtung City 900 Taiwan Department of Electrical Engineering Indian Institute of Technology Madras Chennai 600036 India School of Electronics and Computer Science University of Southampton Southampton SO17 1BJ United Kingdom

Year 2009 marks the completion of 50 years of the invention of CORDIC (COordinate Rotation DIgital computer) by Jack E. Volder. The beauty of CORDIC lies in the fact that by simple shift-add operations, it can perform several computing tasks such as the calculation of trigonometric, hyperbolic and logarithmic functions, real and complex multiplications, division, square-root, solution of linear systems, eigenvalue estimation, singular value decomposition, QR factorization and many others. As a consequence, CORDIC has been utilized for applications in diverse areas such as signal and image processing, communication systems, robotics and 3-D graphics apart from general scientific and technical computation. In this article, we present a brief overview of the key developments in the CORDIC algorithms and architectures along with their potential and upcoming applications. © 2009 IEEE.

关键词： Linear systems

来源：评论

学校读者我要写书评

暂无评论

Visualizing and evaluating complexity of textual case bases

引用

9th European Conference on Case-Based Reasoning, ECCBR 2008

作者： Chakraborti, Sutanu Cerviño Beresi, Ulises Wiratunga, Nirmalie Massie, Stewart Lothian, Robert Khemani, Deepak Systems Research Lab. Tata Research Development and Design Centre 54B Hadapsar Industrial Estate Pune India School of Computing Robert Gordon University Aberdeen AB25 1HG United Kingdom Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai-36 India

ISBN: (纸本)3540855017

This paper deals with two relatively less well studied problems in Textual CBR, namely visualizing and evaluating complexity of textual case bases. The first is useful in case base maintenance, the second in making informed choices regarding case base representation and tuning of parameters for the TCBR system, and also for explaining the behaviour of different retrieval/classification techniques over diverse case bases. We present an approach to visualize textual case bases by "stacking" similar cases and features close to each other in an image derived from the case-feature matrix. We propose a complexity measure called GAME that exploits regularities in stacked images to evaluate the alignment between problem and solution components of cases. GAME class , a counterpart of GAME in classification domains, shows a strong correspondence with accuracies reported by standard classifiers over classification tasks of varying complexity. © Springer-Verlag Berlin Heidelberg 2008.

关键词： Case based reasoning

来源：评论

学校读者我要写书评

暂无评论

Internal contextual grammars for mildly context-sensitive languages

引用

Research on Language and Computation 2007年第2期5卷 181-197页

作者： Kuppusamy, Lakshmanan Krishna, Shankara Narayanan Raghavan, Rama Martin-Vide, Carlos School of Technology and Computer Science Tata Institute of Fundamental Research Mumbai 400 005 Homi Bhabha Road India School of Computing Sciences VIT University Vellore 632 014 India Department of Computer Science and Engineering Indian Institute of Technology Bombay Powai Mumbai 400 076 India Department of Mathematics Indian Institute of Technology Madras Chennai 600 036 India Research Group on Mathematical Linguistics Rovira i Virgili University Tarragona 43005 Pl. Imperial Tarraco 1 Spain

Contextual grammars were introduced by Marcus (Revue Roumaine de Mathematiques Pures et Appliquees 14:525-1534, 1969) based on the basic phenomenon in descriptive linguistics, that of acceptance of a word by a context or conversely. In this paper we present some results which are of interest for the potential application of contextual grammars to natural languages. We introduce some classes of internal contextual grammars, viz. maximum depth-first grammars, maximum lengthwise depth-first grammars, and absorbing right context grammars. The study of these classes is motivated by their potential linguistic relevance for natural languages. In particular, we analyze these variants with respect to the properties of mildly context-sensitive languages. With this aim, we first show that the three basic non-context-free constructions in natural languages can be realized upon using all such variants. Secondly, we state that the membership problem for the family of absorbing right context contextual languages is decidable by a polynomial time algorithm. Finally, we show that absorbing right context grammars produce semilinear languages only. Besides, we show that the non-marked duplication language can be generated by absorbing right context grammars, which is a unique feature not present in any other variant of contextual grammars. © 2007 Springer science+Business Media B.V.

关键词： Contextual grammars Mildly context-sensitive languages Natural languages Non-context-free languages Semilinearity

来源：评论

学校读者我要写书评

暂无评论

Splicing array grammar systems

引用

2nd International Colloquium on Theoretical Aspects of Computing - ICTAC 2005

作者： Subramanian, K.G. Roslin Sagaya Mary, A. Dersanambika, K.S. Department of Mathematics Madras Christian College Chennai - 600 059 India Rovira i Virgili University PI. Imperial Tarraco 1 43005 Tarragona Spain Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai - 600 036 India

ISBN: (纸本)3540291075

Splicing Array Grammar Systems (SAGS) generating pictures of rectangular arrays of symbols are introduced. The components consist of two-dimensional tabled matrix Grammars working in parallel and arrays generated in two different components of the SAGS are allowed to be "cut" and "pasted" according to array splicing domino rules. This model is motivated by the study of Dassow and Mitrana (1996) on string splicing grammar systems. Certain properties of SAGS are obtained. © Springer-Verlag Berlin Heidelberg 2005.

关键词： Computational grammars

来源：评论

学校读者我要写书评

暂无评论

Hexagonal pattern languages

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) 2004年 3322卷 52-64页

作者： Dersanambika, K.S. Krithivasan, K. Martin-Vide, C. Subramanian, K.G. Department of Computer Science and Engineering Indian Institute of Technology Madras Chennai-600 036 India Rovira i Virgili University PI. Imperial Tarraco 1 43005 Tarragona Spain Department of Mathematics Madras Christian College Chennai-600 059 India

Hexagonal tiling systems, hexagonal local picture languages and hexagonal recognizable picture languages are defined in this paper. Hexagonal Wang tiles and systems are also introduced. It is noticed that the family of hexagonal picture languages defined by hexagonal Wang systems coincides with the family of hexagonal picture languages recognized by hexagonal tiling system. Similar to hv-domino systems describing rectangular arrays, we define xyz-domino systems and characterize hexagonal picture languages using this. Unary hexagonal picture languages are also considered and we analyze some of their properties. © Springer-Verlag 2004.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Array-rewriting P systems

引用

Natural Computing 2003年第3期2.0卷 229-249页

作者： Ceterchi, Rodica Mutyam, Madhu Pǎun, Gheorghe Subramanian, K.G. Research Group on Math. Linguistics Rovira i Virgili University 43005 Tarragona Pl. Imperial Tárraco 1 Spain Fac. of Mathematics/Computer Science University of Bucharest 70109 Bucureşti Str. Academiei 14 Romania Dept. of Computer Sci./Engineering Indian Institute of Technology Madras Chennai 600036 India Institute of Mathematics Romanian Academy 70700 Bucureşti P.O. Box 1-764 Romania Department of Mathematics Madras Christian College Tambaram Chennai 600059 India

We consider array languages (sets of pictures consisting of symbols placed in the lattice points of the 2D grid) and the possibility to handle them with P systems. After proving binary normal forms for array matrix grammars (which, even in the case when no appearance checking is used, are known to generate the array languages of arbitrary array grammars), we prove that the P systems with context-free rules (with three membranes and no control on the communication or the use of rules) are computationally universal, able to generate all computable array languages. Some open problems are also formulated. © 2003 Kluwer Academic Publishers.

关键词： Array languages Matrix grammar Membrane computing P system Turing computability

来源：评论

学校读者我要写书评

暂无评论

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年 1741卷 V页

作者： Aggarwal, Alok Rangan, C. Pandu IBM Solutions Research Center Block 1 Indian Institute of Technology New Delhi India Department of Computer Science and Engineering Indian Institute of Technology Chennai India

来源：评论

学校读者我要写书评

暂无评论

Deep sciences for Computing and Communications 1

引用

丛书名： Communications in computer and Information science

1000年

作者： Annie Uthra R. Revathi Appavoo Vimaladevi Madhivanan Kottilingam Kottursamy Gunasekaran Raja Ali Kashif Bashir Utku Kose

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：