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

AFRICON Conference

作者： Amanuel Zewge Yvonne Dittrich Rahel Bekele Computing Department Adama Science and Technology University Adama Ethiopia Software system Section IT University of Copenhagen Copenhagen Denmark Information system Addis Ababa University Addis Ababa Ethiopia

Most of the information and Communication technology for Development initiatives introduced to communities in developing countries fails to deliver its promises due to the lack of intended beneficiary involvement. Participatory Design assumes to be effective as long as its nature of participations and methods are contextualized to a given settings. To this end, we discuss the implication of considering local (rural community) culture of participation practices, and propose a procedure to be followed in the early phases of information system development process. Finally we argue that, such adaption could advance the Participatory Action Research methodology.

关键词： Context Agriculture Stakeholders Collaborative work information systems Design methodology Cultural differences

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: OSGA: genetic-based open-shop scheduling with consideration of machine maintenance in small and medium enterprises

引用

Annals of Operations Research 2015年第1期229卷 743-758页

作者： Shahaboddin Shamshirband Mohammad Shojafar A. A. Rahmani Hosseinabadi Maryam Kardgar M. H. N. Md. Nasir Rodina Ahmad Department of Computer System and Technology Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Department of Information Engineering Electronics and Telecommunications (DIET) Sapienza University of Rome Rome Italy Young Research Club Behshahr Branch Islamic Azad University Behshahr Iran Department of Software Engineering Faculty of Computer Science and Information Technology University of Malaya (UM) Kuala Lumpur Malaysia

The problem of open-shop scheduling includes a set of activities which must be performed on a limited set of machines. The goal of scheduling in open-shop is the presentation of a scheduled program for performance of the whole operation, so that the ending performance time of all job operations will be minimised. The open-shop scheduling problem can be solved in polynomial time when all nonzero processing times are equal, becoming equivalent to edge coloring that has the jobs and workstations as its vertices and that has an edge for every job-workstation pair with a nonzero processing time. For three or more workstations, or three or more jobs, with varying processing times, open-shop scheduling is NP-hard. Different algorithms have been presented for open-shop scheduling so far. However, most of these algorithms have not considered the machine maintenance problem. Whilst in production level, each machine needs maintenance, and this directly influences the assurance reliability of the system. In this paper, a new genetic-based algorithm to solve the open-shop scheduling problem, namely OSGA, is developed. OSGA considers machine maintenance. To confirm the performance of OSGA, it is compared with DGA, SAGA and TSGA algorithms. It is observed that OSGA performs quite well in terms of solution quality and efficiency in small and medium enterprises (SMEs). The results support the efficiency of the proposed method for solving the open-shop scheduling problem, particularly considering machine maintenance especially in SMEs’.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Review of the Applications of Bio-inspired Flower Pollination Algorithm

引用

Procedia Computer Science 2015年 62卷 435-441页

作者： Haruna Chiroma Nor Liyana Mohd Shuib Sanah Abdullahi Muaz Adamu I. Abubakar Lubabatu Baballe Ila Jaafar Zubairu Maitama Federal College of Education (Technical) Department of Computer Science Gombe Nigeria University of Malaya Department of Artificial Intelligence Kuala Lumpur Malaysia University of Malaya Department of Information System Kuala Lumpur Malaysia Bayero University Kano Faculty of Computer Science and Information Technology Department of Software Engineering Kano Nigeria International Islamic University Malaysia Faculty of Information and Communication Technology Kuala Lumpur Malaysia Bayero University Kano Faculty of Engineering Department of Machatronics Engineering Kano Nigeria Bayero University Kano Faculty of Computer Science and Information Technology Department of Information Technology Kano Nigeria

The Flower Pollination Algorithm (FPA) is a novel bio-inspired optimization algorithm that mimics the real life processes of the flower pollination. In this paper, we review the applications of the Single Flower Pollination Algorithm (SFPA), Multi-objective Flower Pollination Algorithm an extension of the SFPA and the Hybrid of FPA with other bio-inspired algorithms. The review has shown that there is still a room for the extension of the FPA to Binary FPA. The review presented in this paper can inspire researchers in the bio-inspired algorithms research community to further improve the effectiveness of the PFA as well as to apply the algorithm in other domains for solving real life, complex and nonlinear optimization problems in engineering and industry. Further research and open questions were highlighted in the paper.

关键词： Flower Pollination Algorithm Single Objective Flower Pollination Algorithm Multi-objective Flower Pollination Algorithm Hybrid Flower Pollination Algorithm

来源：评论

学校读者我要写书评

暂无评论

26th Annual Computational Neuroscience Meeting (CNS*2017): Part 3 Antwerp, Belgium. 15-20 July 2017 Abstracts

引用

BMC NEUROSCIENCE 2017年第SUPPL 1期18卷 95-176页

作者： [Anonymous] Department of Neuroscience Yale University New Haven CT 06520 USA Department Physiology & Pharmacology SUNY Downstate Brooklyn NY 11203 USA NYU School of Engineering 6 MetroTech Center Brooklyn NY 11201 USA Departament de Matemàtica Aplicada Universitat Politècnica de Catalunya Barcelona 08028 Spain Institut de Neurobiologie de la Méditerrannée (INMED) INSERM UMR901 Aix-Marseille Univ Marseille France Center of Neural Science New York University New York NY USA Aix-Marseille Univ INSERM INS Inst Neurosci Syst Marseille France Laboratoire de Physique Théorique et Modélisation CNRS UMR 8089 Université de Cergy-Pontoise 95300 Cergy-Pontoise Cedex France Department of Mathematics and Computer Science ENSAT Abdelmalek Essaadi’s University Tangier Morocco Laboratory of Natural Computation Department of Information and Electrical Engineering and Applied Mathematics University of Salerno 84084 Fisciano SA Italy Department of Medicine University of Salerno 84083 Lancusi SA Italy Dipartimento di Fisica Università degli Studi Aldo Moro Bari and INFN Sezione Di Bari Italy Data Analysis Department Ghent University Ghent Belgium Coma Science Group University of Liège Liège Belgium Cruces Hospital and Ikerbasque Research Center Bilbao Spain BIOtech Department of Industrial Engineering University of Trento and IRCS-PAT FBK 38010 Trento Italy Department of Data Analysis Ghent University Ghent 9000 Belgium The Wellcome Trust Centre for Neuroimaging University College London London WC1N 3BG UK Department of Electronic Engineering NED University of Engineering and Technology Karachi Pakistan Blue Brain Project École Polytechnique Fédérale de Lausanne Lausanne Switzerland Departement of Mathematics Swansea University Swansea Wales UK Laboratory for Topology and Neuroscience at the Brain Mind Institute École polytechnique fédérale de Lausanne Lausanne Switzerland Institute of Mathematics University of Aberdeen Aberdeen Scotland UK Department of Integrativ

来源：评论

学校读者我要写书评

暂无评论

Corrigendum to “ G 2 B-spline interpolation to a closed mesh” [Comput Aided Des 43 (2011) 145–160]

引用

Computer-Aided Design 2015年 59卷 155-157页

作者： Yang Lu Kan-Le Shi Jun-Hai Yong Sen Zhang Hai-Chuan Song School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education of China Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

A G 2 interpolation method to a closed mesh was proposed by Shi et al. in [1]. This note points out that their method has two theoretical defects, which may lead to the failure of G 2 continuity. We fix these def... 详细信息

关键词： Mesh interpolation Coons B-spline surface G 2 -continuity

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Horizontal global solar radiation estimation using hybrid SVM-firefly and SVM-wavelet algorithms: a case study

引用

Natural Hazards 2015年第3期102卷 1613-1614页

作者： Mohammadi, Kasra Shamshirband, Shahaboddin Danesh, Amir Seyed Zamani, Mazdak Sudheer, Ch. Department of Mechanical and Industrial Engineering University of Massachusetts Amherst USA Department of Computer System and Technology Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Department of Software Engineering Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Department of Computer Science Kean University Union USA Department of Civil and Environmental Engineering ITM University Gurugaon India

来源：评论

学校读者我要写书评

暂无评论

RETRACTED ARTICLE: Day of the year-based prediction of horizontal global solar radiation by a neural network auto-regressive model

引用

Theoretical and Applied Climatology 2015年第3期125卷 679-689页

作者： Gani, Abdullah Mohammadi, Kasra Shamshirband, Shahaboddin Khorasanizadeh, Hossein Seyed Danesh, Amir Piri, Jamshid Ismail, Zuraini Zamani, Mazdak Department of Computer System and Technology Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Faculty of Mechanical Engineering University of Kashan Kashan Iran Department of Software Engineering Faculty of Computer Science and Information Technology University of Malaya Kuala Lumpur Malaysia Department of Water Engineering Soil and Water College University of Zabol Zabol Iran Advanced Informatics School Universiti Teknologi Malaysia Johor Bahru Malaysia

The availability of accurate solar radiation data is essential for designing as well as simulating the solar energy systems. In this study, by employing the long-term daily measured solar data, a neural network auto-regressive model with exogenous inputs (NN-ARX) is applied to predict daily horizontal global solar radiation using day of the year as the sole input. The prime aim is to provide a convenient and precise way for rapid daily global solar radiation prediction, for the stations and their immediate surroundings with such an observation, without utilizing any meteorological-based inputs. To fulfill this, seven Iranian cities with different geographical locations and solar radiation characteristics are considered as case studies. The performance of NN-ARX is compared against the adaptive neuro-fuzzy inference system (ANFIS). The achieved results prove that day of the year-based prediction of daily global solar radiation by both NN-ARX and ANFIS models would be highly feasible owing to the accurate predictions attained. Nevertheless, the statistical analysis indicates the superiority of NN-ARX over ANFIS. In fact, the NN-ARX model represents high potential to follow the measured data favorably for all cities. For the considered cities, the attained statistical indicators of mean absolute bias error, root mean square error, and coefficient of determination for the NN-ARX models are in the ranges of 0.44–0.61 kWh/m2, 0.50–0.71 kWh/m2, and 0.78–0.91, respectively.

关键词：

来源：评论

学校读者我要写书评

暂无评论

25th Annual Computational Neuroscience Meeting CNS-2016, Seogwipo City, South Korea, July 2-7, 2016 Abstracts

引用

BMC NEUROSCIENCE 2016年第1期17卷 1-112页

作者： [Anonymous] Computational Neurobiology Laboratory The Salk Institute for Biological Studies San Diego USA UNIC CNRS Gif sur Yvette France The European Institute for Theoretical Neuroscience (EITN) Paris France ATR Computational Neuroscience Laboratories Kyoto Japan Krembil Research Institute University Health Network Toronto Canada Department of Physiology University of Toronto Toronto Canada Department of Medicine (Neurology) University of Toronto Toronto Canada Department of Physics University of New Hampshire Durham USA Department of Neurophysiology Nencki Institute of Experimental Biology Warsaw Poland Department of Theory Wigner Research Centre for Physics of the Hungarian Academy of Sciences Budapest Hungary Department of Mathematical Sciences KAIST Daejoen Republic of Korea Department of Mathematics University of Houston Houston USA Department of Biochemistry & Cell Biology and Institute of Biosciences and Bioengineering Rice University Houston USA Department of Biology and Biochemistry University of Houston Houston USA Grupo de Neurocomputación Biológica Dpto. de Ingeniería Informática Escuela Politécnica Superior Universidad Autónoma de Madrid Madrid Spain Department of Biological Sciences University of Southern California Los Angeles USA Center for Neuroscience Korea Institute of Science and Technology Seoul South Korea Department of Neurology Albert Einstein College of Medicine Bronx USA Center for Neuroscience KIST Seoul South Korea Department of Neuroscience University of Science and Technology Daejon South Korea Systems Neuroscience Group QIMR Berghofer Medical Research Institute Herston Australia Department of Psychology Yonsei University Seoul South Korea Department of Psychiatry Kyung Hee University Hospital at Gangdong Seoul South Korea Department of Psychiatry Veterans Administration Boston Healthcare System and Harvard Medical School Brockton USA Department of Electrical and Electronic Engineering The University of Melbourne Parkvil

A1 Functional advantages of cell-type heterogeneity in neural circuits Tatyana O. Sharpee A2 Mesoscopic modeling of propagating waves in visual cortex Alain Destexhe A3 Dynamics and biomarkers of mental disorders Mitsuo Kawato F1 Precise recruitment of spiking output at theta frequencies requires dendritic h-channels in multi-compartment models of oriens-lacunosum/moleculare hippocampal interneurons Vladislav Sekulić, Frances K. Skinner F2 Kernel methods in reconstruction of current sources from extracellular potentials for single cells and the whole brains Daniel K. Wójcik, Chaitanya Chintaluri, Dorottya Cserpán, Zoltán Somogyvári F3 The synchronized periods depend on intracellular transcriptional repression mechanisms in circadian clocks. Jae Kyoung Kim, Zachary P. Kilpatrick, Matthew R. Bennett, Kresimir Josić O1 Assessing irregularity and coordination of spiking-bursting rhythms in central pattern generators Irene Elices, David Arroyo, Rafael Levi, Francisco B. Rodriguez, Pablo Varona O2 Regulation of top-down processing by cortically-projecting parvalbumin positive neurons in basal forebrain Eunjin Hwang, Bowon Kim, Hio-Been Han, Tae Kim, James T. McKenna, Ritchie E. Brown, Robert W. McCarley, Jee Hyun Choi O3 Modeling auditory stream segregation, build-up and bistability James Rankin, Pamela Osborn Popp, John Rinzel O4 Strong competition between tonotopic neural ensembles explains pitch-related dynamics of auditory cortex evoked fields Alejandro Tabas, André Rupp, Emili Balaguer-Ballester O5 A simple model of retinal response to multi-electrode stimulation Matias I. Maturana, David B. Grayden, Shaun L. Cloherty, Tatiana Kameneva, Michael R. Ibbotson, Hamish Meffin O6 Noise correlations in V4 area correlate with behavioral performance in visual discrimination task Veronika Koren, Timm Lochmann, Valentin Dragoi, Klaus Obermayer O7 Input-location dependent gain modulation in cerebellar nucleus neurons Maria Psarrou, Maria Schilstra, Neil Davey, Benjamin Torben-Ni

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parameter Estimation of Point Projection on NURBS Curves and Surfaces

Parameter Estimation of Point Projection on NURBS Curves and...

引用

IEEE International Conference on Computer-Aided Design and Computer Graphics

作者： Hai-Chuan Song Kan-Le Shi Jun-Hai Yong Xin Qiao Yang Lu Key Laboratory for Information System Security Ministry of Education of China Beijing P.R. China Department of Computer Science and Technology Tsinghua University Beijing P.R. China Tsinghua National Laboratory for Information Science and Technology Beijing P.R. China School of Software Tsinghua University Beijing P.R. China

This paper proposes an algorithm for estimation of point projection parameters, based on pruning on the explicit convex hull of the squared distance function. The explicit expression of the squared distance function is deduced. According to the special requirement of point projection, the convex hull of the squared distance function is incrementally constructed. In each step, regions that obviously contain no projection points are eliminated from the base curve or surface, by intersecting the current nearest distance line with the convex hull. When the user-defined tolerances are satisfied, iteration algorithms are used to get the precise projection points. Experimental results show that compared with existing algorithms using clipping circle/sphere or line/plane, this algorithm possesses higher elimination rate and computation speed.

关键词： Splines (mathematics) Surface topography Surface reconstruction Surface treatment Estimation Indexes

来源：评论

学校读者我要写书评

暂无评论

Solving Under-constrained Assembly Problems Incrementally Using a Kinematic Method

引用

Computer-Aided Design and Applications 2014年第4期11卷 417-425页

作者： Liu, Yong Song, Hai-Chuan Yong, Jun-Hai School of Software Tsinghua University Beijing 100084 China Department of Computer Science and Technology Tsinghua University Beijing 100084 China Key Laboratory for Information System Security Ministry of Education of China Beijing 100084 China Tsinghua National Laboratory for Information Science and Technology Beijing 100084 China

In this paper, an incremental method is proposed for solving under-constrained assembly problems under interactive environment. During an assembling process, a designer adds or removes some constraints, changes the design parameters, or maneuvers some bodies frequently. For each operation, we identify and solve the affected biconnected subgraph in the constraint graph using the cut-joint method. A strategy is provided to construct the joint reference frames from the former assembly configuration. After solving the biconnected subgraph, rigid transformation is utilized to propagate the changes until all subgraphs are visited. Examples are provided to illustrate the effectiveness of the method proposed in the paper. © 2014 CAD Solutions, LLC.

关键词： Kinematics

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：