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

您好，读者！请登录

内蒙古大学图书馆

首页
概况
党建
资源
服务
科研支持
- 论文收录引用证明
- 科技查新
知识产权
档案馆
帮助

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入0个字，您还可以输入200个字

全部搜索
期刊论文
图书
学位论文
标准
纸本馆藏
外文资源发现
数据库导航
超星发现

高级检索

时间限定

出版年份：

文献类型

图书期刊文献学位论文多媒体

馆藏选择

电子馆藏纸本馆藏

核心期刊

全部期刊 SCI 收录期刊 SSCI 收录期刊 EI 收录期刊 CSCD 收录期刊 CSSCI 收录期刊

语言

中文英文

文献类型

期刊文献图书学位论文标准纸本馆藏

帮助

文字说明：

T=题名（书名、题名），A=作者（责任者），K=主题词，P=出版物名称，PU=出版社名称，O=机构（作者单位、学位授予单位、专利申请人），L=中图分类号，C=学科分类号，U=全部字段，Y=年（出版发行年、学位年度、标准发布年）

检索规则说明：

AND代表“并且”；OR代表“或者”；NOT代表“不包含”；(注意必须大写,运算符两边需空一格)

检索范例：

范例一：(K=图书馆学 OR K=情报学) AND A=范并思 AND Y=1982-2016
范例二：P=计算机应用与软件 AND (U=C++ OR U=Basic) NOT K=Visual AND Y=2011-2016

分类表

所选分类

>> <<

限定检索结果

文献类型

9 篇 会议

馆藏范围

9 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

6 篇 理学
- 6 篇 数学
- 2 篇 系统科学
- 1 篇 化学
- 1 篇 地质学
- 1 篇 统计学（可授理学、...
4 篇 工学
- 2 篇 计算机科学与技术...
- 2 篇 软件工程
- 1 篇 信息与通信工程
- 1 篇 控制科学与工程
- 1 篇 化学工程与技术
- 1 篇 轻工技术与工程
1 篇 法学
- 1 篇 社会学

主题

1 篇 discrete event s...
1 篇 computational ge...
1 篇 difference equat...
1 篇 isomers
1 篇 decision trees
1 篇 parameterization

机构

2 篇 bsrm school of e...
1 篇 faculty of mathe...
1 篇 computer science...
1 篇 institute for ch...
1 篇 jashore universi...
1 篇 discrete mathema...
1 篇 polytechnic of b...
1 篇 department of co...
1 篇 national institu...
1 篇 psg college of t...
1 篇 international in...
1 篇 university roma ...
1 篇 american interna...
1 篇 polytechnic of b...
1 篇 department of co...
1 篇 department of co...
1 篇 school of engine...
1 篇 school of engine...
1 篇 computer science...

作者

1 篇 nahi mumtaj
1 篇 ashok pradeesha
1 篇 stella silvia
1 篇 saumik chowdhury
1 篇 devarakonda prad...
1 篇 hristova snezhan...
1 篇 md aminul islam
1 篇 carli raffaele
1 篇 he fei
1 篇 chowdhury saumik
1 篇 nagamochi hirosh...
1 篇 cavone graziana
1 篇 akutsu tatsuya
1 篇 sherin j.a.
1 篇 rayala swaroop a...
1 篇 prahlad narasimh...
1 篇 lisi stefano
1 篇 islam md aminul
1 篇 phogat shiven
1 篇 stefanova kremen...

语言

9 篇 英文

检索条件"任意字段=9th International Conference on Algorithms and Discrete Applied Mathematics, CALDAM 2023"

共 9 条记录，以下是1-10 订阅

全选清除本页清除全部题录导出标记到"检索档案"

详细简洁

排序：

9th international conference on algorithms and discrete applied mathematics, caldam 2023

9th International Conference on Algorithms and Discrete Appl...

引用

9th international conference on algorithms and discrete applied mathematics, caldam 2023

ISBN: (纸本)9783031252105

the proceedings contain 34 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: On Locally Identifying Coloring of Graphs;on Structural Parameterizations of Star Coloring;perfectness of G-generalized Join of Graphs;on Coupon Coloring of Cayley Graphs;coloring of a Superclass of 2 K2 -free graphs;the Weak (2, 2)-Labelling Problem for Graphs with Forbidden Induced Structures;short Cycles Dictate Dichotomy Status of the Steiner Tree Problem on Bisplit Graphs;some Insights on Dynamic Maintenance of Gomory-Hu Tree in Cactus Graphs and General Graphs;monitoring Edge-Geodetic Sets in Graphs;optimal Length Cutting Plane Refutations of Integer Programs;cyclability, Connectivity and Circumference;on three Domination-Based Identification Problems in Block Graphs;computational Aspects of Double Dominating Sequences in Graphs;relation Between Broadcast Domination and Multipacking Numbers on Chordal Graphs;cops and Robber on Oriented Graphs with Respect to Push Operation;mind the Gap: Edge Facility Location Problems in theory and Practice;complexity Results on Cosecure Domination in Graphs;latin Hexahedra and Related Combinatorial Structures;algorithms and Complexity of Strongly Stable Non-crossing Matchings;minimum Maximal Acyclic Matching in Proper Interval Graphs;fault-Tolerant Dispersion of Mobile Robots;transitivity on Subclasses of Chordal Graphs;maximum Subgraph Problem for 3-Regular Knödel graphs and its Wirelength;graph Covering Using Bounded Size Subgraphs;axiomatic Characterization of the Toll Walk Function of Some Graph Classes;structural Parameterization of Alliance Problems;resource Management in Device-to-Device Communications;algorithms for k-Dispersion for Points in Convex Position in the Plane;arbitrary-Oriented Color Spanning Region for Line Segments;rectilinear Voronoi Games with a Simple Rectilinear Obstacle in Plane;diverse Fair Allocations: Complexity and algorithms;new Bounds and Constructions

关键词：

来源：评论

学校读者我要写书评

暂无评论

Parameterized Complexity of Coupon Coloring of Graphs 11th

Parameterized Complexity of Coupon Coloring of Graphs

引用

11th international conference on algorithms and discrete applied mathematics, caldam 2025

作者： Ashok, Pradeesha Devarakonda, Pradyun Phogat, Shiven Rayala, Swaroop A. Ram Sherin, J.A. International Institute of Information Technology Bangalore Bengaluru India PSG College of Technology Coimbatore India

ISBN: (纸本)9783031834370

Given a graph G(V, E), a q-coupon coloring of G refers to a coloring f:V→[q] such that the following is true for all v∈V: for all i∈[q], there exists u∈N(v) such that f(u)=i. Given a graph G, the q-Coupon Coloring problem is to decide whether G admits a q-coupon coloring. the q-Coupon Coloring problem is shown to be NP-complete. We initiate the study of parameterized complexity of the q-Coupon Coloring problem. It is implied by existing results that parameterization by q is unlikely to admit FPT algorithms. We study the q-Coupon Coloring problem parameterized by structural parameters including neighborhood diversity, twin cover, distance to clique and treewidth of the graph. We show FPT algorithms when the parameter is neighborhood diversity, twin cover and distance to clique and prove tight lower bounds when the parameter is treewidth. © the Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Parameterization

来源：评论

学校读者我要写书评

暂无评论

Utilization of Encoding, Early Stopping, Hyper Parameter Tuning, and Machine Learning Models for Bank Fraud Detection 9

Utilization of Encoding, Early Stopping, Hyper Parameter Tun...

引用

9th IEEE international Women in Engineering (WIE) conference on Electrical and Computer Engineering, WIECON-ECE 2023

作者： Islam, Md Aminul Nag, Anindya Chowdhury, Saumik Fahim, SM Firoz Ahmed Ghosh, Arjan Mumtaj, Nahi School of Engineering Computing Mathematics Oxford Brookes University Oxford United Kingdom Computer Science & Engineering Discipline Khulna University Khulna9208 Bangladesh Jashore University of Science & Technology Department of Computer Science & Engineering Jashore7408 Bangladesh American International University Bangladesh Department of Computer Science & Engineering Dhaka Bangladesh BSRM School of Engineering Electrical and Electronics BRAC University Dhaka Bangladesh

ISBN: (纸本)9798350319651

An effective fraud detection system must protect millions of clients for a secure banking system, which can be achieved using machine learning and AI. In this article, authors have applied four supervised machine learning models: k-nearest neighbors (KNN), random forest (RF), decision tree, and logistic regression (LR) algorithm to detect bank fraud for a synthetic dataset having 1,00,000 rows and 32 columns. Adequate preprocessing, decoding, rigorous feature engineering, validation, performance evaluation, and explanation have allowed the readers to understand the whole study. the algorithms' accuracy is similar for label encoding, which is not prescribed. Still, a significant AUC of 98% has been achieved in Gradient Boosting Models. Further application of this study can be done in real-life cases of banks, insurance, and finance institutions. © 2023 IEEE.

关键词： Decision trees

来源：评论

学校读者我要写书评

暂无评论

discrete Neural Networks with Maximum and Non-instantaneous Impulses with Computer Simulation 9th

Discrete Neural Networks with Maximum and Non-instantaneou...

引用

9th international conference on New Trends of the Applications of Differential Equations in Sciences, NTADES 2022

作者： Hristova, Snezhana Stefanova, Kremena Faculty of Mathematics and Informatics Plovdiv University P. Hilendarski Plovdiv4000 Bulgaria Department of Computer Technologies Plovdiv University P. Hilendarski Plovdiv4000 Bulgaria

ISBN: (纸本)9783031214837

A nonlinear non-instantaneous impulsive difference equations with maximum of the state variable over a past time interval is investigated. the exponential stability concept is studied and some criteria are derived. these results are also applied for a neural networks with switching topology at certain moments and long time lasting impulses. It is considered the general case of time varying connection weights. the equilibrium is defined and exponential stability is studied. the obtained results are illustrated on examples. © 2023, the Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Difference equations

来源：评论

学校读者我要写书评

暂无评论

A Colored Petri Net Tool for the Design of Robotic Palletizing Cells 9

A Colored Petri Net Tool for the Design of Robotic Palletizi...

引用

9th international conference on Control, Decision and Information Technologies, CoDIT 2023

作者： Cavone, Graziana Stella, Silvia Scarabaggio, Paolo Carli, Raffaele Lisi, Stefano Garavelli, Achille Claudio Dotoli, Mariagrazia University Roma Tre Department of Civil Computer Science and Aeronautical Technologies Engineering Italy Polytechnic of Bari Department of Mechanics Mathematics and Management Italy Polytechnic of Bari Department of Electrical and Information Engineering Italy

ISBN: (纸本)9798350311402

Driven by the digital transformation required by Logistics 4.0, the use of automation in warehouses is constantly growing. In particular, robotic palletizers offer significant potential for optimizing warehouse operations, thanks to higher flexibility and throughput than traditional palletizing systems. Despite the availability of several solutions in the market, the optimal deployment of a robotic palletizer in warehouses is not straightforward: a design phase is needed to determine the most convenient configuration that ensures automatic palletizing is fully integrated into the warehouse processes. In this paper, we propose a simulation-based versatile tool for modeling and analysis purposes, aimed at supporting the design of a robotic palletizing cell in a bottom-up fashion. As a core methodology, we employ timed colored Petri nets, which allow - once the analysis on packing requirements and constraints is conducted - to rapidly model the system as a composition of basic subsystems, and implement alternative simulations to evaluate the corresponding performance and effectively benchmark the alternative configurations. the proposed approach is applied to a real case study, showing its effectiveness in identifying the solution that achieves a good compromise between the use of resources and the performance of warehouse operations. © 2023 IEEE.

关键词： discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

One-Sided discrete Terrain Guarding and Chordal Graphs 7th

One-Sided Discrete Terrain Guarding and Chordal Graphs

引用

7th international conference on algorithms and discrete applied mathematics, caldam 2021

作者： Prahlad Narasimhan, Kasthurirangan National Institute of Science Education and Research HBNI Bhubaneswar India

ISBN: (纸本)9783030678982

the Terrain Guarding problem, a variant of the famous Art Gallery problem, has garnered significant attention over the last two decades in Computational Geometry from the viewpoint of complexity and approximability. Both the continuous and discrete versions of the problem were shown to be NP-Hard in [14] and to admit a PTAS [8, 15]. the biggest unsolved question regarding this problem is if it is fixed-parameter tractable with respect to the size of the guard set. In this paper, we present two theorems that establish a relationship between a restricted case of the Annotated Terrain Guarding problem and the Clique Cover problem in chordal graphs. these theorems were proved in [11] for a special class of terrains called orthogonal terrains and were used to present a FPT algorithm with respect to the parameter that we require for discrete Orthogonal Terrain Guarding in [2]. We hope that the results obtained in this paper can, in future work, be used to produce such an algorithm for discrete Terrain Guarding. © 2021, Springer Nature Switzerland AG.

关键词： Computational geometry

来源：评论

学校读者我要写书评

暂无评论

Utilization of Encoding, Early Stopping, Hyper Parameter Tuning, and Machine Learning Models for Bank Fraud Detection

Utilization of Encoding, Early Stopping, Hyper Parameter Tun...

引用

IEEE international WIE conference on Electrical and Computer Engineering (WIECON-ECE)

作者： Md Aminul Islam Anindya Nag Saumik Chowdhury SM Firoz Ahmed Fahim Arjan Ghosh Nahi Mumtaj School of Engineering Computing and Mathematics Oxford Brookes University Oxford UK Computer Science & Engineering Discipline Khulna University Khulna Bangladesh Department of Computer Science & Engineering Jashore University of Science & Technology Jashore Bangladesh Department of Computer Science & Engineering American International University Bangladesh Dhaka Bangladesh BSRM School of Engineering Electrical and Electronics BRAC University Dhaka Bangladesh

关键词：

来源：评论

学校读者我要写书评

暂无评论

Enumerating naphthalene isomers of tree-like chemical graphs 7

Enumerating naphthalene isomers of tree-like chemical graphs

引用

7th international conference on Bioinformatics Models, Methods and algorithms, BIOINFORMATICS 2016 - Part of 9th international Joint conference on Biomedical Engineering Systems and Technologies, BIOSTEC 2016

作者： He, Fei Hanai, Akiyoshi Nagamochi, Hiroshi Akutsu, Tatsuya Discrete Mathematics Department of Applied Mathematics and Physics Graduate School of Informatics Kyoto University Kyoto606-8501 Japan Institute for Chemical Research Kyoto University Gokasho Uji Kyoto611-0011 Japan

ISBN: (纸本)9789897581700

In this paper, we consider the problem of enumerating naphthalene isomers, where enumeration of isomers is important for drug design. A chemical graph G with no other cycles than naphthalene rings is called tree-like, and becomes a tree T possibly with multiple edges if we contract each naphthalene ring into a single virtual atom of valence 8. We call tree T the tree representation of G. there may be more than one tree-like chemical graphs whose tree representations equal to T, which are called naphthalene isomers of T. We present an efficient algorithm that enumerates all naphthalene isomers of a given tree representation. Our algorithm first counts the number of all the naphthalene isomers using dynamic programming, and then for each k, generates the k-th isomer by backtracking the counting computation. In computational experiment, we compare our method with MolGen, a state-of-the-art enumeration tool, and it is observed that our program enumerates the same number of naphthalene isomers within extremely shorter time, which proves that our algorithm is effectively built. Copyright © 2016 by SCITEPRESS - Science and Technology Publications, Lda. All rights reserved.

关键词： Isomers

来源：评论

学校读者我要写书评

暂无评论

9th international conference on Monte Carlo and Quasi Monte Carlo Methods in Scientific Computing, MCQMC 2010

9th International Conference on Monte Carlo and Quasi Monte ...

引用

9th international conference on Monte Carlo and Quasi Monte Carlo Methods in Scientific Computing, MCQMC 2010

ISBN: (纸本)9783642274398

the proceedings contain 42 papers. the special focus in this conference is on Methods in Scientific Computing. the topics include: Markov bridges, bisection and variance reduction;upper bounds in discrepancy theory;entropy, randomization, derandomization, and discrepancy;asymptotic equivalence between boundary perturbations and discrete exit times;stochastic approximation of functions and applications;on figures of merit for randomly-shifted lattice rules;a study of the efficiency of exact methods for diffusion simulation;polynomial lattice point sets;liberating the dimension for function approximation and integration;a component-by-component construction for the trigonometric degree;scrambled polynomial lattice rules for infinite-dimensional integration;geometric and statistical properties of pseudorandom number generators based on multiple recursive transformations;computing Greeks using multilevel path simulation;weight Monte Carlo method applied to acceleration oriented traffic flow model;new inputs and methods for Markov chain quasi-Monte Carlo;extensions of Atanassov's methods for halton sequences;applicability of subsampling bootstrap methods in Markov chain Monte Carlo;QMC computation of confidence intervals for a sleep performance model;options pricing for several maturities in a jump-diffusion model;enumerating quasi-Monte Carlo point sequences in elementary intervals;spatial/angular contributon maps for improved adaptive Monte Carlo algorithms;hybrid function systems in the theory of uniform distribution of sequences;an intermediate bound on the star discrepancy;parallel quasi-Monte Carlo integration by partitioning low discrepancy sequences;quasi-Monte Carlo progressive photon mapping;value Monte Carlo algorithms for estimating the solution to the coagulation equation;numerical simulation of the drop size distribution in a spray;nonasymptotic bounds on the mean square error for MCMC estimates via renewal techniques;exact simulation of occupation times;ra

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

全选清除本页清除全部题录导出标记到“检索档案”

共1页 << < 1 > >>

检索报告对象比较合并检索0

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

电话和邮箱必须正确填写，我们会与您联系确认。

联系人：

所在院系：

联系邮箱：

联系电话：

内蒙古自治区呼和浩特市赛罕区大学西街235号邮编: 010021

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：