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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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

分类表

所选分类

>> <<

限定检索结果

文献类型

7 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

5 篇 工学
- 5 篇 计算机科学与技术...
- 2 篇 软件工程
2 篇 理学
- 2 篇 数学
- 1 篇 地质学
1 篇 艺术学
- 1 篇 音乐与舞蹈学

主题

1 篇 random forest
1 篇 midi
1 篇 tonality
1 篇 algorithms
1 篇 discrete optimiz...
1 篇 computer communi...
1 篇 discrete event s...
1 篇 computational ge...
1 篇 discrete fourier...
1 篇 computer graphic...
1 篇 surrogate models
1 篇 program processo...
1 篇 visualization
1 篇 discrete mathema...
1 篇 black-box optimi...
1 篇 numeric computin...
1 篇 radial basis fun...
1 篇 web application
1 篇 algorithm analys...
1 篇 hyperparameter t...

机构

1 篇 university of te...
1 篇 university of te...
1 篇 univ amsterdam
1 篇 zhejiang normal ...
1 篇 ecole polytech f...
1 篇 national institu...
1 篇 st josephs univ ...
1 篇 politecn milan m...
1 篇 agh univ sci & t...
1 篇 macao polytechni...

作者

1 篇 was jaroslaw
1 篇 moss fabian c.
1 篇 ding-zhu du
1 篇 regis rommel g.
1 篇 law k. l. eddie
1 篇 harasim daniel
1 篇 prahlad narasimh...
1 篇 wen yuqiang
1 篇 zhao zhang
1 篇 lidong wu
1 篇 affatato giovann...
1 篇 kulakowski konra...
1 篇 wen xu

语言

8 篇 英文

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

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

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

详细简洁

排序：

8th international conference on algorithms and discrete applied mathematics, caldam 2022

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

引用

8th international conference on algorithms and discrete applied mathematics, caldam 2022

ISBN: (纸本)9783030950170

the proceedings contain 24 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: On cd-Coloring of { P5, K4} -free Chordal Graphs;an Output-Sensitive Algorithm for All-Pairs Shortest Paths in Directed Acyclic Graphs;covering a Graph with Densest Subgraphs;coresets for (k, ) -Median Clustering Under the Fréchet Distance;bounds and algorithms for Geodetic Hulls;voronoi Games Using Geodesics;approximation and Parameterized algorithms for Balanced Connected Partition Problems;algorithms for Online Car-Sharing Problem;algebraic algorithms for Variants of Subset Sum;chromatic Bounds for Some Subclasses of (P3∪ P2) -free graphs;hardness and Approximation Results for Some Variants of Stable Marriage Problem;on Fair Division with Binary Valuations Respecting Social Networks;parameterized Intractability of Defensive Alliance Problem;on the Approximability of Path and Cycle Problems in Arc-Dependent Networks;approximation algorithms in Graphs with Known Broadcast Time of the Base Graph;list Homomorphisms to Separable Signed Graphs;some Position Problems for Graphs;comparability Graphs Among Cover-Incomparability Graphs;Complexity of Paired Domination in AT-free and Planar Graphs;the Complexity of Star Colouring in Bounded Degree Graphs and Regular Graphs;on Conflict-Free Spanning Tree: algorithms and Complexity;B0 -VPG Representation of AT-free Outerplanar Graphs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

midiVERTO: A Web Application to Visualize Tonality in Real Time 8th

midiVERTO: A Web Application to Visualize Tonality in Real T...

引用

8th Biennial international conference on mathematics and Computation in Music (MCM)

作者： Harasim, Daniel Affatato, Giovanni Moss, Fabian C. Ecole Polytech Fed Lausanne Lausanne Switzerland Politecn Milan Milan Italy Univ Amsterdam Amsterdam Netherlands

ISBN: (纸本)9783031070150;9783031070143

this paper presents a web application for visualizing the tonality of a piece of music-the organization of its chords and scales-at a high level of abstraction and with coordinated playback. the application applies the discrete Fourier transform to the pitch-class domain of a user-specified segmentation of a MIDI file and visualizes the Fourier coefficients' trajectories. Since the coefficients indicate different musical properties, such as triadicity and diatonicity, the application isolates aspects of a piece's tonality and shows their development in time. the aim of the application is to bridge a gap between mathematical music theory, musicology, and the general public by making the discrete Fourier transform as applied to the pitch-class domain accessible without requiring advanced mathematical knowledge or programming skills up front.

关键词： Web application Visualization discrete Fourier transform Tonality MIDI

来源：评论

学校读者我要写书评

暂无评论

Hyperparameter Tuning of Random Forests Using Radial Basis Function Models 8th

Hyperparameter Tuning of Random Forests Using Radial Basis F...

引用

8th Annual international conference on Machine Learning, Optimization and Data science (LOD)

作者： Regis, Rommel G. St Josephs Univ Philadelphia PA 19131 USA

ISBN: (纸本)9783031255984;9783031255991

this paper considers the problem of tuning the hyperparameters of a random forest (RF) algorithm, which can be formulated as a discrete black-box optimization problem. Although default settings of RF hyperparameters in software packages work well in many cases, tuning these hyperparameters can improve the predictive performance of the RF. When dealing with large data sets, the tuning of RF hyperparameters becomes a computationally expensive black-box optimization problem. A suitable approach is to use a surrogate-based method where surrogates are used to approximate the functional relationship between the hyperparameters and the overall out-of-bag (OOB) prediction error of the RF. this paper develops a surrogate-based method for discrete black-box optimization that can be used to tune RF hyperparameters. Global and local variants of the proposed method that use radial basis function (RBF) surrogates are applied to tune the RF hyperparameters for seven regression data sets that involve up to 81 predictors and up to over 21K data points. the RBF algorithms obtained better overall OOB RMSE than discrete global random search, a discrete local random search algorithm and a Bayesian optimization approach given a limited budget on the number of hyperparameter settings to consider.

关键词： Random forest Hyperparameter tuning discrete optimization Black-box optimization Surrogate models Radial basis functions

来源：评论

学校读者我要写书评

暂无评论

Delay and Loss Rate Analysis of the Log Commitment Process in Raft 24

Delay and Loss Rate Analysis of the Log Commitment Process i...

引用

24th IEEE international conference on High Performance Computing and Communications, 8th IEEE international conference on Data Science and Systems, 20th IEEE international conference on Smart City and 8th IEEE international conference on Dependability in Sensor, Cloud and Big Data Systems and Application, HPCC/DSS/SmartCity/DependSys 2022

作者： Wen, Yuqiang Law, K. L. Eddie Macao Polytechnic University Faculty of Applied Sciences China

ISBN: (纸本)9798350319934

Consensus algorithms are crucial in attaining consistency among data saved at different locations across distributed and decentralized computing systems. For consensus algorithms to work properly on the Internet, the designs must provide sustainable performance over different adverse networking conditions, including packet loss events, the extra delay incurred during deliveries, etc. In this paper, we shall analyze the performance of the log replication process in the Raft consensus algorithm through a generalized network emulation conceptual switch model. though there are other approaches, e.g., testbed experiments and discrete event simulation (DES), to validate the algorithmic performance of the log replication process, many among them usually associate different packet loss rates with the overall throughput performance. Our proposed model can associate the loss rates with the expected wait durations until commitments or confirmations (leader elections or data storage) in Raft. Furthermore, we analyze the bounds on the mean and variance of these successive log replication confirmation durations. Compared to DES simulations, our analysis results are closely matched, and the efficiency is improved, e.g., on the same computing machine, it took about 11,148 seconds to run a batch of DES simulations with a 0.9 packet loss rate, and it took only 44 seconds to generate all bounding results in the range of [0, 0.9] through the derived expressions. In a distributed system with one leader and 30 followers using the regular Raft algorithm, through our analysis, increasing packet loss rate from 0.001 to 0.1 can lead to a 39.4% increase in the average log replication confirmation time. this indicates that the network packet loss rate significantly impacts the performance of consensus algorithms such as Raft. Our proposed model can provide performance measures for analyzing novel consensus protocols on the Internet in future. © 2022 IEEE.

关键词： discrete event simulation

来源：评论

学校读者我要写书评

暂无评论

5th international conference on algorithms and discrete applied mathematics, caldam 2019

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

引用

5th international conference on algorithms and discrete applied mathematics, caldam 2019

ISBN: (纸本)9783030115081

the proceedings contain 23 papers. the special focus in this conference is on algorithms and discrete applied mathematics. the topics include: On rectangle intersection graphs with stab number at most two;dominating induced matching in some subclasses of bipartite graphs;localized query: Color spanning variations;a lower bound for the radio number of graphs;improved descriptional complexity results on generalized forbidding grammars;on selecting leaves with disjoint neighborhoods in embedded trees;the balanced connected subgraph problem;covering and packing of triangles intersecting a straight line;h-free coloring on graphs with bounded tree-width;the induced star partition of graphs;the relative signed clique number of planar graphs is 8;bumblebee visitation problem;on graphs with minimal eternal vertex cover number;on chordal and perfect plane triangulations;fault-tolerant additive weighted geometric spanners;maintaining the visibility graph of a dynamic simple polygon;on the bitprobe complexity of two probe adaptive schemes storing two elements;on m-Bonacci-sum graphs;linear time algorithm to check the singularity of block graphs;b-coloring of the mycielskian of regular graphs;drawing bipartite graphs in two layers with specified crossings.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Two Concurrent algorithms of discrete Potential Field Construction

Two Concurrent Algorithms of Discrete Potential Field Constr...

引用

8th international conference, PPAM 2009

作者： Kulakowski, Konrad Was, Jaroslaw AGH Univ Sci & Technol Inst Automat PL-30059 Krakow Poland

ISBN: (纸本)9783642144028

Increasing demand for computational power in contemporary constructions has cleated the need to build faster CPUs and construct, more efficient, algorithm In this context, especially the concurrent algorithms seem to be very promising Depending on the number of available CPUs they may offer significant reductions in computation time In tins article two concurrent algorithms of potential field generation are proposed they present, two different, approaches to problem domain partitioning called by the authors respectively as tearing and niblling is shown that depending on the problem topology either Tear algorithm or Nibble algorithm is faster Conclusions are summed up in form of experimental results presenting how the algorithms work practice However algorithms construct, a discrete potential field according some specific scheme, there should be no major problems with generalization them to other potential held schemes

关键词： Program processors

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Optimization and Applications 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Zhao Zhang Lidong Wu Wen Xu Ding-Zhu Du

ISBN: (数字)9783319126913

ISBN: (纸本)9783319126906

this book constitutes the refereed proceedings of the 8th international conference on Combinatorial Optimization and Applications, COCOA 2014, held on the island of Maui, Hawaii, USA, in December 2014. the 56 full papers included in the book were carefully reviewed and selected from 133 submissions. Topics covered include classic combinatorial optimization; geometric optimization; network optimization; optimization in graphs; applied optimization; CSoNet; and complexity, cryptography, and games.

关键词： Algorithm Analysis and Problem Complexity discrete mathematics in Computer Science Numeric Computing algorithms Computer Communication Networks Computer Graphics

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共1页 << < 1 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：