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

International Journal of Machine Learning and Cybernetics 2017年第1期8卷 1-2页

作者： Xu, Weihua Li, Jinhai Shao, Mingwen Zhang, Wen-Xiu School of Mathematics and Statistics Chongqing University of Technology Chongqing400054 China Faculty of Science Kunming University of Science and Technology KunmingYunnan650500 China College of Computer and Communication Engineering China University of Petroleum QingdaoShandong266580 China Institute for Information and System Sciences School of Mathematics and Statistics Xi’an Jiaotong University Xi’anShaan’xi710049 China

来源：评论

学校读者我要写书评

暂无评论

On symmetries of non-plane trees in a non-uniform model 14

On symmetries of non-plane trees in a non-uniform model

引用

14th Workshop on Analytic Algorithmics and Combinatorics 2017, ANALCO 2017

作者： Cichoń, Jacek Magnery, Abram Szpankowskiz, Wojciech Turowskix, Krzysztof Department of Computer Science Faculty of Fundamental Problems of Technology Wroclaw University of Science and Technology Wroclaw Poland Coordinated Science Lab. Univ. of Illinois at Urbana-Champaign UrbanaIL United States Dept. of Algorithms and System Modeling Gdańsk University of Technology Gdansk Poland Department of Computer Science Purdue University IN47907 United States

ISBN: (纸本)9781611974775

Binary trees come in two varieties: plane trees, often simply called binary trees, and non-plane trees, in which the order of subtrees does not matter. Nonplane trees find many applications;for example in modeling epidemics, in studying phylogenetic trees, and as models in data compression. While binary trees have been studied very extensively, non-plane trees still pose some challenges. Moreover, in most analyses a uniform probabilistic model is assumed;that is, a tree is selected uniformly from among all trees. Such a model limits significantly applications of the analysis. In this paper we study by analytic techniques non-plane trees in a non-uniform model. In our model, we grow the tree on n leaves by selecting randomly a leaf and appending two children to it. We can show that this is equivalent to an alternative model, also used to analyze the averagecase performance of binary search trees, that is more easily amenable to study by recurrences and generating functions. Here, one of the most important questions is the number of symmetries in such trees (i.e., the number of internal nodes with two isomorphic subtrees), or the sizes of such symmetric subtrees. We first present a functional-differential equation characterizing tree symmetries, and then analyze it. In this conference paper we focus on the expected number of symmetries, the size of symmetric subtrees, and the tree entropy. © Copyright by SIAM.

关键词： Entropy

来源：评论

学校读者我要写书评

暂无评论

Rough-Regression Model for Investigating Product Attributes and Purchase Decision

Rough-Regression Model for Investigating Product Attributes ...

引用

International Conference on computer and Communication Engineering, ICCCE

作者： Rasyidah Nazri Mohd Nawi Riswan Efendi Management System Information Department State Polytehcnic of Padang Padang West-Sumatra Indonesia Faculty of Computer Science and Information Technology Universiti Tun Hussein Onn Malaysia Batu Pahat Johor Malaysia Mathematics Department State Islamic University of Sultan Syarif Kasim Riau Pekanbaru Indonesia

Regression models have been widely applied to investigate the causal relationship between independent and dependent attributes with statistical assumptions. On the other hands, not easy to achieve all statistical assumptions using these models, especially for certain areas. This paper presents rough regression model to handle the categorical data types with minimal assumptions. The proposed idea is address to solve the unclassified elements and decisive criteria in data sets. Moreover, the product attributes of Kompas newspaper are investigated and selected using rough-regression model. The result showed that three conditional attributes, namely, price, promotion, and location have positive effect to purchasing decision attribute. Proposed decisive criteria also may help decision makers or marketing management in providing information and planning precisely.

关键词： Rough sets Data models Mathematical model Computational modeling Predictive models Data mining Knowledge discovery

来源：评论

学校读者我要写书评

暂无评论

Modeling on clinical group decision support system for screening and working diagnosis acute respiratory infections

引用

IOP Conference Series: Materials Science and Engineering 2019年第1期508卷

作者： Muhammad Syaukani Sri Hartati Hari Kusnanto Suryo Guritno Study Program of Information Technology STMIK Indonesia Banjarmasin Indonesia Dept. of Computer Science and Electronics Faculty of Mathematics and Natural Sciences Universitas Gadjah Mada Yogyakarta Indonesia Study Program of Publich Health Interests Health Management Information System Faculty of Medicine Universitas Gadjah Mada Yogyakarta Indonesia

There are cases of patients with Acute Respiratory Infection (ARI) which are not handled quickly and appropriately at emergency department (ED), thus there should be a medium that can assist medical personnel in making decisions. This research proposes the development model of Clinical Group Decision Support systems (CGDSS) named KLISPA models. KLISPA model can accommodate a screening process to the working diagnosis process of ARI by integrating Case Based Reasoning (CBR) and Groups Decision Support system (GDSS). Screening process completed by CBR using Nearest Neighbor method. This process helps medical personnel such as nurses, co asst doctors, and general practitioners to do screening to patients for determining the early solution to the disease. Meanwhile, the working diagnosis solved by GDSS uses the methods of Eckenrode, Extended TOPSIS and BoostVote. This process accommodates the needs of joint decision-making which involves groups of Decision Maker (DM) consisting of pediatrician, child lung specialist doctor, and the radiologist doctor.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The utilization of search engines by students of the Library and Information Science Program at Universitas Padjadjaran

The utilization of search engines by students of the Library...

引用

2018 Workshop on Multidisciplinary and Its Applications: Applied Mathematics, computer Science, Information systems, and Information technology, WMA-Mathcomtech 2018

作者： Kurniasih, Nuning Kurniawati, Nanik Yulianti, Y. Rahim, Robbi Sujito, S. Ikhwan, Afiful Aimang, Hasrat A. Haluti, Farid Putri, Lusi Dwi Napitupulu, Darmawan Faculty of Communication Sciences Library and Information Science Program Universitas Padjadjaran Bandung Indonesia Jakarta Indonesia Sekolah Dasar Negeri 3 Rajapolah Tasikmalaya Indonesia School of Computer and Communication Engineering Universiti Malaysia Perlis Kubang Gajah Malaysia Department of English Language Education IAIN Surakarta Surakarta Indonesia Postgraduate Universitas Muhammadiyah Ponorogo Ponorogo Indonesia Universitas Muhammadiyah Luwuk Luwuk Banggai Indonesia Universitas Lancang Kuning Indonesia Research Center for Quality System and Testing Technology Indonesian Institute of Sciences Indonesia

Search engines have become an integral part of student learning activities. This study aims to see how the use of search engines by students, especially by students of the Library and Information Science Program, faculty of Communication Sciences, Universitas Padjadjaran. This study uses the mixed method. The research data was obtained through questionnaires, in-depth interviews, observations and literature studies. The results of the study showed that in learning activities, the respondents used search engines to find the references for college assignments and thesis writing material. The students also use search engines to meet daily information needs, solve problems, increase knowledge, reduce doubts, clarify things, entertain, fulfill curiosity about others, etc. The retrieval technique used by students is by using keywords/queries, Boolean logic, query strategies in the form of a brief search and using the advanced search feature. This research is expected to contribute to the university in supporting online-based learning facilities for students. © Published under licence by IOP Publishing Ltd.

关键词： Search engines

来源：评论

学校读者我要写书评

暂无评论

Conceptual Framework for Knowledge Flow in Software Development Process

引用

Research Journal of Applied Sciences, Engineering and technology 2017年第12期14卷 450-457页

作者： Marzanah A. Jabar Mustafa S. Khalefa Rusli Hj. Abdulla Salfarina Abdulla Department of Software Engineering and Information System Faculty of Computer Science and Information Technology University Putra Malaysia (UPM) 43400 Selangor Serdang Malaysia

The main aim of this study to merge knowledge flow activities with software development process Past models of flow of knowledge lacked in terms of software development and lacked on sharing right knowledge and lacked in-depth exploration of context modeling, which made those models less applicable. In addition now it attracts much consideration, attention in the knowledge management field. In a knowledge-based organization, knowledge workers need to acquire a variety of knowledge (information) about their tasks. Therefore; many organizations have built knowledge support plat forms to assist workers in meeting their knowledge-needs. These platforms help workers to identify and share knowledge in order to speed up organization innovation and improve employee Productivity. This research proposes a conceptual framework of context oriented flow of knowledge in software development aspects. In this framework, the context is seen as an inseparable element of flow of knowledge, which is regarding the creation, transformation as well as application of knowledge items. One of the main challenges is how to exploring knowledge flow, sharing knowledge in software development process. The main goal for this research to provide a framework to solve this challenge. In this research used questionnaire instrument with 21 people as they are from software development process environment, also in this study want to improve all factors, task, type of knowledge, nature of knowledge used in software development process during the flow of knowledge. Finally in this study validate the framework using experts review, 4 experts from academic and industrial result was great shows all phases in software development process and factors when active, moreover in this research verified the component by using cronpach alpha methods the result was good in acceptable rang 0.711.

关键词： Artifacts knowledge flow knowledge flow element knowledge flow with software process roles software development process

来源：评论

学校读者我要写书评

暂无评论

The evolutionary optimization approach for voltage profile estimation in a radial distribution network with a decreased number of measurements

The evolutionary optimization approach for voltage profile e...

引用

International Conference on Electrical Machines, Drives and Power systems (ELMA)

作者： Marinko Barukčić Marko Vukobratović Dino Masle Dalibor Buljić Željko Herderić Faculty of Electrical Engineering Computer Science and Information Technology Osijek Croatian Transmission System Operator Ltd

The procedure for estimation of voltage profile in a radial distribution network considering decreased number of measurements is presented in the text. The proposed procedure is based on hypothesis that feeder voltage profile in case of the limited number of feeder measurements can be successfully estimated using evolutionary optimization approach. The procedure consists of two main steps. In the first step, the location of the voltage measurements are determined with aim to have as small as possible the number of the locations. This is done by applying the analytical mathematical procedure. After the measurement locations are defined, in the second procedure step the optimization aims to estimate whole voltage profile is performed employing the evolutionary algorithm. The proposed procedure is tested on two test radial distribution feeders to verify the proposed procedure.

关键词： Voltage measurement Optimization Estimation Matrix decomposition Admittance Electronic mail Eigenvalues and eigenfunctions

来源：评论

学校读者我要写书评

暂无评论

A method for mining top-rank- k frequent closed itemsets

A method for mining top-rank- k frequent closed itemsets

引用

作者： Nguyen, Loan T.T. Trinh, Truc Nguyen, Ngoc-Thanh Vo, Bay Division of Knowledge and System Engineering for ICT Ton Duc Thang University Ho Chi Minh City Viet Nam Faculty of Information Technology Ton Duc Thang University Ho Chi Minh City Viet Nam VOV College Ho Chi Minh City Viet Nam Faculty of Computer Science and Management Wroclaw University of Science and Technology Wrocaw Poland Faculty of Information Technology Ho Chi Minh City University of Technology Viet Nam

Mining frequent closed itemsets (FCIs) is important in mining non-redundant (minimal) association rules. Therefore, many algorithms have been developed for mining FCIs with reduced mining time and memory usage. For mining FCIs, algorithms use the minimum support threshold, minSup, to prune itemsets. However, using a fixed minSup is not suitable for mining top-rank-k FCIs. A large threshold will lead to a small number of generated FCIs, leading to insufficient FCIs to query when k is large. On the other hand, a small minSup will generate a huge number of generated FCIs, leading to large runtimes and high memory usage. In this paper, we propose a method for mining top-rank-k FCIs without using a fixed minimum support threshold. A strategy is first used to eliminate 1-items that cannot generate FCIs belonging to top-rank-k FCIs. Next, based on the set of candidate 1-items, we propose TRK-FCI, a DCI-Plus-based algorithm, for mining top-rank-k FCIs. In the process of mining top-rank-k FCIs, TRK-FCI automatically increases minSup according to the mined FCIs, efficiently pruning itemsets that cannot belong to top-rank-k FCIs. We also modify the dynamic bit vector (DBV) structure and apply it to reduce memory usage and runtime in the TRK-FCI-DBV algorithm. Experimental results show that TRK-FCI-DBV is more efficient than TRK-FCI for various databases. © 2017 - IOS Press and the authors. All rights reserved.

关键词： Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

Web services of transformation data based on OpenEHR into Health Level Seven (HL7) standards 2

Web services of transformation data based on OpenEHR into He...

引用

2nd International Conference on Informatics and Computing, ICIC 2017

作者： Muslim, Aries Puspitodjati, Sulistyo Benny Mutiara, Achmad Oswari, Teddy Department of Information System Gunadarma University Jakarta Indonesia Department of Informatics Engineering Gunadarma University Jakarta Indonesia Faculty of Computer Scienc and Information Technology Gunadarma University Jakarta Indonesia Department of Management Gunadarma University Jakarta Indonesia

ISBN: (纸本)9781538629840

To minimize the differences between the data standards of Healthcare Information system (HIS) then it needs a system that is using a standardized international health among others OpenEHR health information standards from Europe and the HL7 health information standards comes from America. In OpenEHR, all of a patient's health data to be stored in the history of life, are independent vendors, and centered on one person. HL7 (Health Level Seven) is one of many ANSI standard which has been accredited by SDO (Standards Developing Organizations). HL7 does not develop healthcare or hospital software application, but it only develops the concepts, methodology, specification, and standard, so exchanging data among different application is possible to be done. Conceptually, this exchanging data method is known as Electronic Data Interchange (EDI). As an embodiment to provide standardization of HIS based on Health Level Seven, it is achieved by building a web service of HIS based on HL7. This web service will be expected to make a standardizing the health data based on HL7, so that the process of data exchange or health information becomes more structured. © 2017 IEEE.

关键词： Electronic data interchange

来源：评论

学校读者我要写书评

暂无评论

Generative adversarial network based on chaotic time series

arXiv

引用

arXiv 2019年

作者： Naruse, Makoto Matsubara, Takashi Chauvet, Nicolas Kanno, Kazutaka Yang, Tianyu Uchida, Atsushi Department of Information Physics and Computing Graduate School of Information Science and Technology University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo113-8656 Japan Department of Mathematical Engineering and Information Physics Faculty of Engineering University of Tokyo 7-3-1 Hongo Bunkyo-ku Tokyo113-8656 Japan Department of Computational Science Graduate School of System Informatics Kobe University 1- 1 Rokkodai Nada Kobe Hyogo657-8501 Japan Department of Information and Computer Sciences Saitama University 255 Shimo-Okubo Sakura-ku Saitama Saitama338-8570 Japan

Generative adversarial network (GAN) is gaining increased importance in artificially constructing natural images and related functionalities wherein two networks called generator and discriminator are evolving through adversarial mechanisms. Using deep convolutional neural networks and related techniques, high-resolution, highly realistic scenes, human faces, among others have been generated. While GAN in general needs a large amount of genuine training data sets, it is noteworthy that vast amounts of pseudorandom numbers are required. Here we utilize chaotic time series generated experimentally by semiconductor lasers for the latent variables of GAN whereby the inherent nature of chaos can be reflected or transformed into the generated output data. We show that the similarity in proximity, which is a degree of robustness of the generated images with respects to a minute change in the input latent variables, is enhanced while the versatility as a whole is not severely degraded. Furthermore, we demonstrate that the surrogate chaos time series eliminates the signature of generated images that is originally observed corresponding to the negative autocorrelation inherent in the chaos sequence. We also discuss the impact of utilizing chaotic time series in retrieving images from the trained generator. Copyright © 2019, The Authors. All rights reserved.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：