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

Application of Bipolar Fuzzy Sets in Planar Graphs

International Journal of Applied and Computational Mathematics 2017年第2期3卷 773-785页

作者： Akram, Muhammad Samanta, Sovan Pal, Madhumangal Department of Mathematics University of the Punjab New Campus Lahore Pakistan Department of Mathematics JKHS Tamluk India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721 102 India

A bipolar fuzzy set is a generalization of a fuzzy set. In this paper, we apply the concept of bipolar fuzzy sets to multigraphs and planar graphs. We introduce the notions of bipolar fuzzy multigraphs, bipolar fuzzy planar graphs, bipolar fuzzy dual graphs, and investigate some of their interesting properties. We also study isomorphism between bipolar fuzzy planar graphs. © 2016, Springer India Pvt. Ltd.

关键词： Bipolar fuzzy dual graphs Bipolar fuzzy graphs Bipolar fuzzy multigraphs Bipolar fuzzy planar graphs

来源：评论

学校读者我要写书评

暂无评论

Scheduling Algorithm to Select Optimal Programme Slots in Television Channels: A Graph Theoretic Approach

引用

International Journal of Applied and Computational Mathematics 2017年第3期3卷 1931-1950页

作者： Pal, Madhumangal Pal, Anita Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore 721 102 India Department of Mathematics National Institute of Technology Durgapur Mahatma Gandhi Avenue Durgapur 713 209 West Bengal India

In this paper, it is shown that all programmes of all television channels can be modelled as an interval graph. The programme slots are taken as the vertices of the graph and if the time duration of two programme slots have non-empty intersection, the corresponding vertices are considered to be connected by an edge. The number of viewers of a programme is taken as the weight of the vertex. A set of programmes that are mutually exclusive in respect of time scheduling is called a session. We assume that a company sets the objective of selecting the popular programmes in k parallel sessions among different channels so as to make its commercial advertisement reach the maximum number of viewers, that is, a company selects k suitable programme slots simultaneously for advertisement. The aim of the paper is, therefore, to help the companies to select the programme slots, which are mutually exclusive with respect to the time schedule of telecasting time, in such a way that the total number of viewers of the selected programme in k parallel slots rises to the optimum level. It is shown that the solution of this problem is obtained by solving the maximum weight k-colouring problem on an interval graph. An algorithm is designed to solve this just-in-time optimization problem using O(kMn ² ) time, where n and M represent the total number of programmes of all channels and the upper bound of the viewers of all programmes of all channels respectively. The problem considered in this paper is a daily life problem which is modeled by k-colouring problem on interval graph. © 2016, Springer India Pvt. Ltd.

关键词： Design and analysis of algorithms Graph colouring Graph theory Interval graphs Modelling

来源：评论

学校读者我要写书评

暂无评论

SPar: A DSL for High-Level and Productive Stream Parallelism

SPar: A DSL for High-Level and Productive Stream Parallelism

引用

作者： Griebler, Dalvan Danelutto, Marco Torquati, Massimo Fernandes, Luiz Gustavo Av. Ipiranga 6681 - Building 32 Porto Alegre - CEP90619-900 Brazil Department of Computer Science Parallel Programming Models Group Largo Pontecorvo 3 PISA56127 Italy

This paper introduces SPar, an internal C++ Domain-Specific Language (DSL) that supports the development of classic stream parallel applications. The DSL uses standard C++ attributes to introduce annotations tagging the notable components of stream parallel applications: stream sources and stream processing stages. A set of tools process SPar code (C++ annotated code using the SPar attributes) to generate FastFlow C++ code that exploits the stream parallelism denoted by SPar annotations while targeting shared memory multi-core architectures. We outline the main SPar features along with the main implementation techniques and tools. Also, we show the results of experiments assessing the feasibility of the entire approach as well as SPar's performance and expressiveness. © 2017 World Scientific Publishing Company.

关键词： Parallel programming

来源：评论

学校读者我要写书评

暂无评论

Forming the logical conclusion about sufficiency of information of software requirements specification for software quality assessment by ISO 25010:2011

Forming the logical conclusion about sufficiency of informat...

引用

IEEE Ukraine Conference on Electrical and computer Engineering (UKRCON)

作者： Tetiana Hovorushchenko Computer Engineering & System Programming Department Khmelnitsky National University Khmelnitsky Ukraine

The aim of this study is the development of the method of generating and filling the template of ontology for the quality of the concrete software and method of forming the logical conclusion about the sufficiency of information of software requirements specification (SRS) for software quality assessment (by ISO 25010:2011). The first time proposed method of generating and filling the template of ontology for the quality of the concrete software leaves in the relevant ontology only measures, which are available in the SRS for the concrete software. It provides forming the ontology for the quality of the concrete software. The first time developed method of forming the logical conclusion about the sufficiency of the SRS information for software quality assessment provides the conclusion about the sufficiency or insufficiency of the SRS information for software quality assessment by ISO 25010:2011. If the SRS information is insufficient, this method: provides the conclusion for which characteristics and sub-characteristics the information is insufficient; creates the sorted list of missing measures as the recommended priority of their addition in the SRS; evaluates the veracity of software quality assessment based on the available in the SRS measures.

关键词： Software quality Ontologies Software measurement Concrete ISO Standards

来源：评论

学校读者我要写书评

暂无评论

Solution of rectangular fuzzy games

引用

OPSEARCH 2017年第3期44卷 211-226页

作者： Prasun Kumar Nayak Madhumangal Pal Bankura Christian College Bankura India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Midnapore India

A solution of m×n rectangular fuzzy game with payoff as imprecise numbers instead of crisp real numbers namely interval and triangular fuzzy numbers is considered here. Solution of such fuzzy games with pure strategies and the algebraic method to solve 2×2 fuzzy game without saddle point by using mixed strategies is also discussed. Here the m×n payoff matrix is reduced to 2×2 payoff matrix by dominance method. In this paper, we discuss a saddle point solution from an uncertain payoff matrix. Moreover solution method for fuzzy games has also been developed. Numerical example is provided to illustrate the method.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Multi-item EPQ model with learning effect on imperfect production over fuzzy-random planning horizon

引用

Journal of Management Analytics 2017年第1期4卷 80-110页

作者： Amalesh Kumar Manna Barun Das Jayanta Kumar Dey Shyamal Kumar Mondal Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar UniversityMidnapore-721102WBIndia Department of Mathematics Sidho-Kanho-Birsha UniversityPuruliaWBIndia Department of Mathematics Mahishadal Raj CollegeMahishadal721628WBIndia

Uncertainty is certain in the world of *** study revisits an economic production quantity(EPQ)model with shortages for stock-dependent demand of the items with reworking and disposing of the imperfect ones over a random planning horizon under the joint effect of inflation and time value of money,where the expected time length is imprecise in *** of learning effect has been incorporated to reduce the defective *** total expected profit over the random planning horizon is maximized subject to the imprecise space *** possibility,necessity and credibility measures have been introduced to defuzzify the *** simulation-based genetic algorithm is used to make decision for the above EPQ model in different measures of *** model is illustrated through an *** analysis shows the impacts of different parameters on the objective function in the model.

关键词： imperfect production rework shortage learning effect random planning horizon genetic algorithm

来源：评论

学校读者我要写书评

暂无评论

MAPA: An Automatic Memory Access Pattern Analyzer for GPU Applications

引用

ACM SIGPLAN Notices 2017年第8期52卷 443-444页

作者： Jo, Gangwon Jung, Jaehoon Park, Jiyoung Lee, Jaejin Center for Manycore Programming Department of Computer Science and Engineering Seoul National University Seoul08826 Korea Republic of

Various existing optimization and memory consistency management techniques for GPU applications rely on memory access patterns of kernels. However, they suffer from poor practicality because they require explicit user interventions to extract kernel memory access patterns. This paper proposes an automatic memory-access-pattern analysis framework called MAPA. MAPA is based on a source-level analysis technique derived from traditional symbolic analyses and a run-time pattern selection technique. The experimental results show that MAPA properly analyzes 116 real-world OpenCL kernels from Rodinia and Parboil. © 2017 ACM.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

UniMorph 4.0: Universal Morphology

arXiv

引用

arXiv 2022年

作者： Batsuren, Khuyagbaatar Goldman, Omer Khalifa, Salam Habash, Nizar Kieras, Witold Bella, Gábor Leonard, Brian Nicolai, Garrett Gorman, Kyle Ate, Yustinus Ghanggo Ryskina, Maria Mielke, Sabrina Budianskaya, Elena El-Khaissi, Charbel Pimentel, Tiago Gasser, Michael Lane, William Raj, Mohit Coler, Matt Samame, Jaime Rafael Montoya Camaiteri, Delio Siticonatzi Sagot, Benoît Rojas, Esaú Zumaeta Francis, Didier López Oncevay, Arturo Bautista, Juan López Villegas, Gema Celeste Silva Hennigen, Lucas Torroba Ek, Adam Guriel, David Dirix, Peter Bernardy, Jean-Philippe Scherbakov, Andrey Bayyr-Ool, Aziyana Anastasopoulos, Antonios Zariquiey, Roberto Sheifer, Karina Ganieva, Sofya Cruz, Hilaria Karahóǧa, Ritván Markantonatou, Stella Pavlidis, George Plugaryov, Matvey Klyachko, Elena Salehi, Ali Angulo, Candy Baxi, Jatayu Krizhanovsky, Andrew Krizhanovsky, Natalia Salesky, Elizabeth Vania, Clara Ivanova, Sardana White, Jennifer Maudslay, Rowan Hall Valvoda, Josef Zmigrod, Ran Czarnowska, Paula Nikkarinen, Irene Salchak, Aelita Bhatt, Brijesh Straughn, Christopher Liu, Zoey Washington, Jonathan North Pinter, Yuval Ataman, Duygu Wolinski, Marcin Suhardijanto, Totok Yablonskaya, Anna Stoehr, Niklas Dolatian, Hossep Nuriah, Zahroh Ratan, Shyam Tyers, Francis M. Ponti, Edoardo M. Aiton, Grant Arora, Aryaman Hatcher, Richard J. Kumar, Ritesh Young, Jeremiah Rodionova, Daria Yemelina, Anastasia Andrushko, Taras Marchenko, Igor Mashkovtseva, Polina Serova, Alexandra Prud'hommeaux, Emily Nepomniashchaya, Maria Giunchiglia, Fausto Chodroff, Eleanor Hulden, Mans Silfverberg, Miikka McCarthy, Arya D. Yarowsky, David Cotterell, Ryan Tsarfaty, Reut Vylomova, Ekaterina National University of Mongolia Mongolia Bar-Ilan University Israel Johns Hopkins University United States University of Trento Italy University of York United Kingdom Carnegie Mellon University United States Brian Leonard Consulting United States Indiana University United States University of British Columbia Canada Dharmsinh Desai University India New York University Abu Dhabi United Arab Emirates Inria France University of Cambridge United Kingdom University of Gothenburg Sweden University of Oregon United States Australian National University Australia ILSP Athena RC Greece University of Groningen Netherlands KU Leuven Belgium University of Louisville United States University of Edinburgh United Kingdom Pontificia Universidad Católica del Perú Peru Universidad Católica Sedes Sapientiae Filial Atalaya Institute of Philology The Siberian Branch The Russian Academy of Sciences Russia Moscow State University Russia Boston College United States Higher School of Economics Russia Institute of Linguistics Russian Academy of Sciences Russia STKIP Weetebula Indonesia Institute for System Programming Russian Academy of Sciences Russia University at Buffalo United States Karelian Research Centre The Russian Academy of Sciences Russia Swarthmore College United States New York University United States Northeastern Illinois University United States University of Helsinki Finland Tuvan State University Russia Georgetown University United States Charles Darwin University Australia Institute of Computer Science Polish Academy of Sciences Poland Universitas Indonesia Indonesia Stony Brook University United States Dr. Bhimrao Ambedkar University India Mila/McGill University Montreal Canada University of Colorado Boulder United States Graduate Center City University of New York United States George Mason University United States Ben-Gurion University of the Negev Israel ETH Zürich Switzerland University of Melbourne Australia

The Universal Morphology (UniMorph) project is a collaborative effort providing broad-coverage instantiated normalized morphological inflection tables for hundreds of diverse world languages. The project comprises two major thrusts: a language-independent feature schema for rich morphological annotation and a type-level resource of annotated data in diverse languages realizing that schema. This paper presents the expansions and improvements made on several fronts over the last couple of years (since McCarthy et al. (2020)). Collaborative efforts by numerous linguists have added 67 new languages, including 30 endangered languages. We have implemented several improvements to the extraction pipeline to tackle some issues, e.g. missing gender and macron information. We have also amended the schema to use a hierarchical structure that is needed for morphological phenomena like multiple-argument agreement and case stacking, while adding some missing morphological features to make the schema more inclusive. In light of the last UniMorph release, we also augmented the database with morpheme segmentation for 16 languages. Lastly, this new release makes a push towards inclusion of derivational morphology in UniMorph by enriching the data and annotation schema with instances representing derivational processes from MorphyNet. Copyright © 2022, The Authors. All rights reserved.

关键词： Morphology

来源：评论

学校读者我要写书评

暂无评论

Transportation Problem with Multi-choice Cost and Demand and Stochastic Supply

引用

Journal of the Operations Research Society of China 2016年第2期4卷 193-204页

作者： Sankar Kumar Roy Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar UniversityMidnaporeWest Bengal 721102India

This paper analyzes the multi-choice stochastic transportation problem where the cost coefficients of the objective function and the demand parameters of the constraints follow multi-choice *** that the supply parameters of the constraints in a transportation problem(TP)follow logistic *** main objective of this paper is to select an appropriate choice from the multi-choices for the cost coefficients of the objective function and the demand of the constraints in the TP by introducing Lagrange’s interpolating polynomial in such a way that the total cost is minimized and satisfies the required *** stochastic programming,the stochastic supply constraints of the TP are transformed into deterministic ***,a non-linear deterministic model is *** Lingo software,the optimal solution of the proposed problem is *** illustrate the methodology,a real-life problem on the TP is considered.

关键词： Transportation problem Multi-choice programming Lagrange’s interpolating polynomial Stochastic programming

来源：评论

学校读者我要写书评

暂无评论

Coordinating particle swarm optimization, ant colony optimization and k-opt algorithm for traveling salesman problem 3rd

Coordinating particle swarm optimization, ant colony optimiz...

引用

3rd International Conference on Mathematics and Computing, ICMC 2017

作者： Khan, Indadul Maiti, Manas Kumar Maiti, Manoranjan Department of Computer Science Chandrakon Vidyasagar Mahavidyalaya Paschim-Medinipur West Bengal721201 India Department of Mathematics Mahishadal Raj College Mahishadal Purba-MedinipurWest Bengal721628 India Department of Applied Mathematics with Oceanology and Computer Programming Vidyasagar University Paschim-Medinipur West Bengal India

ISBN: (纸本)9789811046414

In this paper combining the features of swap sequence and swap operation based Particle Swarm Optimization (PSO), Ant Colony Optimization (ACO) and K-Opt operation a hybrid algorithm is proposed to solve well known Traveling Salesman Problem (TSP). Interchange of two cities of a path of a TSP is known as swap operation and a sequence of such operations is called swap sequence. Using swap operation and swap sequence PSO operations are redefined to solve TSP. Here ACO is used a small number of iterations to generate initial swarm of PSO. Then PSO operations are made on this swarm a sufficient number of times to find optimal path. During PSO iterations if a particle does not change its position for a predefined number of iterations then K-Opt operation is made on it a finite number of times to improve its position. The algorithm is tested with bench mark test problems from TSPLIB and it is observed that algorithm is more efficient with respect to accuracy as well as execution time to solve standard TSPs (Symmetric as well as Asymmetric) compared to existing algorithms. Details of the proposed algorithm along with swap operation, swap sequence and K-opt operation for the algorithm are elaborately discussed for the readers. © Springer Nature Singapore Pte Ltd. 2017.

关键词： Ant colony optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：