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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

62 篇 期刊文献
25 篇 会议

馆藏范围

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

日期分布

学科分类号

67 篇 工学
- 41 篇 计算机科学与技术...
- 22 篇 电气工程
- 8 篇 控制科学与工程
- 6 篇 软件工程
- 4 篇 信息与通信工程
- 3 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 材料科学与工程（可...
- 2 篇 水利工程
- 2 篇 测绘科学与技术
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 仪器科学与技术
- 1 篇 动力工程及工程热...
- 1 篇 电子科学与技术（可...
- 1 篇 地质资源与地质工...
- 1 篇 石油与天然气工程
39 篇 理学
- 19 篇 数学
- 15 篇 统计学（可授理学、...
- 6 篇 地球物理学
- 5 篇 生物学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 地理学
- 1 篇 系统科学
- 1 篇 生态学
7 篇 管理学
- 6 篇 管理科学与工程(可...
- 2 篇 图书情报与档案管...
4 篇 医学
- 3 篇 临床医学
3 篇 经济学
- 3 篇 应用经济学
2 篇 农学

主题

87 篇 sampling algorit...
3 篇 markov chain mon...
2 篇 probability dens...
2 篇 fuzzy logic
2 篇 conditional bit ...
2 篇 cube method
2 篇 co-simulation
2 篇 deep learning
2 篇 random graph
2 篇 design centering
2 篇 motion planning
2 篇 control system
2 篇 multi-layer perc...
2 篇 probabilistic de...
2 篇 kernel principal...
2 篇 shapley value
2 篇 randomized algor...
2 篇 alignment
2 篇 graph theory
2 篇 enumeration

机构

2 篇 univ padua dept ...
2 篇 free univ berlin...
2 篇 tech univ munich...
2 篇 departments of e...
2 篇 petr gas univ co...
2 篇 univ elect sci &...
2 篇 humboldt univ in...
1 篇 aramco asia aram...
1 篇 wyle sci technol...
1 篇 slovak univ tech...
1 篇 lehigh univ dept...
1 篇 suzhou univ sci ...
1 篇 duke univ durham...
1 篇 zhejiang univ de...
1 篇 univ complutense...
1 篇 jiangnan univ sc...
1 篇 univ toulouse 3 ...
1 篇 univ elect sci &...
1 篇 univ helsinki de...
1 篇 univ michigan me...

作者

4 篇 chauvet guillaum...
3 篇 mai jan-frederik
3 篇 scherer matthias
2 篇 sobolewski js
2 篇 paraschiv nicola...
2 篇 bodirsky manuel
2 篇 xia hu
2 篇 payne wh
2 篇 fu yan
2 篇 kang mihyun
2 篇 castro javier
2 篇 groepl clemens
2 篇 gomez daniel
1 篇 zhao zhenjiang
1 篇 wang haogang
1 篇 seidman dn
1 篇 parida laxmi
1 篇 feydy jean
1 篇 dissanayake gami...
1 篇 hofert marius

语言

81 篇 英文
5 篇 其他
1 篇 中文

检索条件"主题词=Sampling Algorithm"

共 87 条记录，以下是71-80 订阅

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

详细简洁

排序：

Estimating Normalizing Constants for Log-Concave Distributions: algorithms and Lower Bounds 2020

Estimating Normalizing Constants for Log-Concave Distributio...

引用

52nd Annual ACM SIGACT Symposium on Theory of Computing (STOC)

作者： Ge, Rong Lee, Holden Lu, Jianfeng Duke Univ Durham NC 27708 USA

ISBN: (纸本)9781450369794

Estimating the normalizing constant of an unnormalized probability distribution has important applications in computer science, statistical physics, machine learning, and statistics. In this work, we consider the problem of estimating the normalizing constant Z = f(Rd) e(-f(x)) dx to within a multiplication factor of 1 +/- epsilon for a mu-strongly convex and L-smooth function f, given query access to f(x) and del f(x). We give both algorithms and lowerbounds for this problem. Using an annealing algorithm combined with a multilevel Monte Carlo method based on underdamped Langevin dynamics, we show that (O) over tilde (d(4/3)kappa+d(7/6)kappa(7/6)/epsilon(2)) queries to del f are sufficient, where kappa = L/mu is the condition number. Moreover, we provide an information theoretic lowerbound, showing that at least d(1-o(1))/epsilon(2-o(1)) queries are necessary. This provides a first nontrivial lowerbound for the problem.

关键词： Langevin Monte Carlo multilevel Monte Carlo normalizing constant partition function log-concave distribution sampling algorithm

来源：评论

学校读者我要写书评

暂无评论

odeN: Simultaneous Approximation of Multiple Motif Counts in Large Temporal Networks 21

odeN: Simultaneous Approximation of Multiple Motif Counts in...

引用

30th ACM International Conference on Information and Knowledge Management (CIKM)

作者： Sarpe, The Vandin, Fabio Univ Padua Dept Informat Engn Padua Italy

ISBN: (纸本)9781450384469

Counting the number of occurrences of small connected subgraphs, called temporal motifs, has become a fundamental primitive for the analysis of temporal networks, whose edges are annotated with the time of the event they represent. One of the main complications in studying temporal motifs is the large number of motifs that can be built even with a limited number of vertices or edges. As a consequence, since in many applications motifs are employed for exploratory analyses, the user needs to iteratively select and analyze several motifs that represent different aspects of the network, resulting in an inefficient, time-consuming process. This problem is exacerbated in large networks, where the analysis of even a single motif is computationally demanding. As a solution, in this work we propose and study the problem of simultaneously counting the number of occurrences of multiple temporal motifs, all corresponding to the same (static) topology (e.g., a triangle). Given that for large temporal networks computing the exact counts is unfeasible, we propose odeN, a sampling-based algorithm that provides an accurate approximation of all the counts of the motifs. We provide analytical bounds on the number of samples required by odeN to compute rigorous, probabilistic, relative approximations. Our extensive experimental evaluation shows that odeN enables the approximation of the counts of motifs in temporal networks in a fraction of the time needed by state-of-the-art methods, and that it also reports more accurate approximations than such methods.

关键词： temporal motifs sampling algorithm temporal networks randomized algorithm

来源：评论

学校读者我要写书评

暂无评论

Semi-constrained Path Planning for Industrial Robot with External Axis

Semi-constrained Path Planning for Industrial Robot with Ext...

引用

Chinese Automation Congress (CAC)

作者： Sun, Yu Meng, Xiangqun Yu, Miaocheng Tang, Houjun Shanghai Jiao Tong Univ Dept Elect Engn Shanghai Peoples R China Shanghai Fangling Comp Software Co Ltd Shanghai Peoples R China

ISBN: (纸本)9781728176871

To solve the problem that the working space of the industrial robot is limited by the arm length, and the flexibility is limited by the number of joints, the robot system with external axes is necessary. This paper proposes a novel sampling-based path planning method to control the industrial robot and external axes simultaneously. An external axis space is proposed for sampling external axis value to solve task-constrained path planning problems in practical industrial applications. The configuration space of a robot system with external axes is decoupled to extract task space independent of external axis space, based on the semi-constrained characteristic of typical Cartesian curve tracking tasks. The task space is defined by the position and orientation parameter of the robot's end-effector. As a result, a sampling space, which meets the task-constraint, can he found. Analytical Inverse Kinematics (IK) algorithm is used to map the samples back to the task-constrained configuration space without iterative modifications. Simulation studies on practical path planning tasks under constraints prove the effectiveness of the proposed method.

关键词： industrial robot external axis task-constrained path planning sampling algorithm

来源：评论

学校读者我要写书评

暂无评论

Approximation-guided Fairness Testing through Discriminatory Space Analysis 24

Approximation-guided Fairness Testing through Discriminatory...

引用

39th ACM/IEEE International Conference on Automated Software Engineering (ASE)

作者： Zhao, Zhenjiang Toda, Takahisa Kitamura, Takashi Univ Electrocommun Tokyo Japan Nat Inst Adv Ind Sci & Technol AIST Tokyo Japan

ISBN: (数字)9798400712487

ISBN: (纸本)9798400712487

As machine learning (ML) systems are increasingly used in various fields, including tasks with high social impact, concerns about their fairness are growing. To address these concerns, individual fairness testing (IFT) has been introduced to identify individual discriminatory instances (IDIs) that indicate the violation of individual fairness in a given ML classifier. In this paper, we propose a black-box testing algorithm for IFT, named AFT (short for Approximation-guided Fairness Testing). AFT constructs approximate models based on decision trees, and generates test cases by sampling paths of the decision trees. Our evaluation by experiments confirms that AFT outperforms the state-of-the-art black-box IFT algorithm ExpGA both in efficiency (by 3.42 times) and diversity of IDIs identified by algorithms (by 1.16 times).

关键词： Machine Learning algorithmic Fairness Fairness Testing Decision Tree sampling algorithm

来源：评论

学校读者我要写书评

暂无评论

Preliminary Evaluation of Bollinger Deadband Filtering Using Upper and Lower Bands 11

Preliminary Evaluation of Bollinger Deadband Filtering Using...

引用

11th IEEE/IAS International Conference on Industry Applications (IEEE INDUSCON)

作者： Torrisi, Nunzio Marco Univ Fed ABC Santo Andre Brazil

ISBN: (纸本)9781479955510

In this paper, the author investigates the use of the Bollinger Bandslmtheory to compute the deadband sampling algorithm of unbounded variables. In this scenario the dead band algorithm has to be adapted to compute the filtering using a new dynamically preset interval derived from the Bollinger Bands theory for financial applications. The number of filtered samples and the integral absolute error are adopted as metrics to compare performance results of the new original deadband proposed, named Bollinger Deadband, with the results of the classic absolute deadband algorithm. The signals adopted for the simulation are based on the pseudo periodic time series. For these signals the effectiveness of the Bollinger deadband is explored as alternative sampling method when the signal limits are unknown a priori.

关键词： sampling algorithm Bollinger Bands Dead band Networking

来源：评论

学校读者我要写书评

暂无评论

A Fill Estimation algorithm for Sparse Matrices and Tensors in Blocked Formats 32

A Fill Estimation Algorithm for Sparse Matrices and Tensors ...

引用

27th International Heterogeneity in Computing Workshop in conjunction with 32nd IEEE International Parallel and Distributed Processing Symposium (IPDPS)

作者： Ahrens, Willow Xu, Helen Schiefer, Nicholas MIT Comp Sci & Artificial Intelligence Lab 77 Massachusetts Ave Cambridge MA 02139 USA

ISBN: (纸本)9781538643686

Many sparse matrices and tensors from a variety of applications, such as finite element methods and computational chemistry, have a natural aligned rectangular nonzero block structure. Researchers have designed high-performance blocked sparse operations which can take advantage of this sparsity structure to reduce the complexity of storing the locations of nonzeros. The performance of a blocked sparse operation depends on how well the block size reflects the structure of nonzeros in the tensor. Sparse tensor structure is generally unknown until runtime, so block size selection must be efficient. The fill is a quantity which, for some block size, relates the number of nonzero blocks to the number of nonzeros. Many performance models use the fill to help choose a block size. However, the fill is expensive to compute exactly. We present a sampling-based algorithm called PHIL to estimate the fill of sparse matrices and tensors in any format. We provide theoretical guarantees for sparse matrices and tensors, and experimental results for matrices. The existing state-of-the-art fill estimation algorithm, which we will call OSKI, runs in time linear in the number of elements in the tensor. The number of samples PHIL needs to compute a fill estimate is unrelated to the number of nonzeros and depends only on the order (number of dimensions) of the tensor, desired accuracy of the estimate, desired probability of achieving this accuracy, and number of considered block sizes. We compare PHIL and OSKI on a suite of 42 matrices. On most inputs, PHIL estimates the fill at least 2 times faster and often more than 20 times faster than OSKI. PHIL consistently produced accurate estimates-in all cases that we tested PHIL was faster and/or more accurate than OSKI. Finally, we find that PHIL and OSKI produce comparable speedups in multicore blocked sparse matrix-vector multiplication (SpMV) when the block size was chosen using fill estimates in a model due to Vuduc et al.

关键词： Fill Estimation Sparse Matrix Sparse Tensor Block Sparse Block Size Selection Randomized algorithm sampling algorithm Autotuning Performance Engineering Performance Model Numerical Linear Algebra Phil

来源：评论

学校读者我要写书评

暂无评论

Design of Resistance Touch Screen Based on S3C6410 Embedded System

Design of Resistance Touch Screen Based on S3C6410 Embedded ...

引用

International Conference on Mechatronics Engineering and Computing Technology (ICMECT)

作者： Wang Ying Ge Ribo Li Meihua Dalian Univ Technol City Inst Dalian Peoples R China

ISBN: (纸本)9783038351153

This design uses Samsung ARM11 S3C6410 microprocessor and 4 wires resistive touch screen as the hardware foundation. Based on the hardware structure, the touch screen application is developed. System performance has been improved by means of the algorithm optimization of the sampled data and software filtration method, and lead to a strong practicability. In the end, three-point calibration algorithm is introduced for the offset problem of the screen coordinates, then the calibration matrix is decided by the selection of three-point, and then using software implementation to realize the calibration of point-to-point mapping relation, and finally make it more accurate in practical applications.

关键词： Embedded resistive touch screen sampling algorithm three-point calibration

来源：评论

学校读者我要写书评

暂无评论

A Design Centering Methodology for Probabilistic Design Space 16

A Design Centering Methodology for Probabilistic Design Spac...

引用

16th IFAC Symposium on Advanced Control of Chemical Processes (ADCHEM)

作者： Kusumo, Kennedy P. Morrissey, James Mitchell, Hamish Shah, Nilay Chachuat, Benoit Imperial Coll London Dept Chem Engn Sargent Ctr Proc Syst Engn London England

The use of mathematical models for design space characterization has become commonplace in pharmaceutical quality-by-design, providing a systematic risk-based approach to assurance of quality. This paper presents a methodology to complement sampling algorithms by computing the largest box inscribed within a given probabilistic design space at a desired reliability level. Such an encoding of the samples yields an operational envelope that can be conveniently communicated to process operators as independent ranges in process parameters. The first step involves training a feed-forward multi-layer perceptron as a surrogate of the sampled probability map. This surrogate is then embedded into a design centering problem, formulated as a semi-infinite program and solved using a cutting-plane algorithm. Effectiveness and computational tractability are demonstrated on the case study of a batch reactor with two critical process parameters. Copyright (C) 2021 The Authors.

关键词： quality-by-design probabilistic design space sampling algorithm design centering multi-layer perceptron

来源：评论

学校读者我要写书评

暂无评论

Generating labeled planar graphs uniformly at random

Generating labeled planar graphs uniformly at random

引用

30th International Colloquium on Automata, Languages and Programming (ICALP 2003)

作者： Bodirsky, Manuel Groepl, Clemens Kang, Mihyun Free Univ Berlin Inst Informat D-14195 Berlin Germany Humboldt Univ Inst Informat Abt Algorithmen & Komplexitat 1 D-10099 Berlin Germany

ISBN: (纸本)3540404937

We present a deterministic polynomial time algorithm to sample a labeled planar graph uniformly at random. Our approach uses recursive formulae for the exact number of labeled planar graphs with n vertices and m edges, based on a decomposition into 1-, 2-, and 3-connected components. We can then use known sampling algorithms and counting formulae for 3-connected planar graphs. (c) 2007 Elsevier B.V. All rights reserved.

关键词： labeled planar graph enumeration decomposition sampling algorithm dynamic programming graph theory

来源：评论

学校读者我要写书评

暂无评论

Primary Frequency Regulation for A Multi-Terminal HVDC Network via Periodically sampling Control

Primary Frequency Regulation for A Multi-Terminal HVDC Netwo...

引用

第30届中国控制与决策会议

作者： Jinrong Li Hong Zhou Zhiwei Liu Hongxiao Zhang Department of Automation Wuhan University College of Automation Huazhong University of Science and Technology

In this paper,the problem of primary frequency regulation is investigated for large networks,including various AC areas interconnected by a multi-terminal high-voltage direct current(HVDC) *** control schemes are proposed to guarantee frequency consensus and adapted to the discrete situation in power grid *** first sampling algorithm modifies the power injections from each AC area into the DC grid as a function of sampling frequency deviations of neighbouring AC areas to share reserves among *** second intermittent sampling control has the capability of decreasing the working frequency of the sensors and controllers as an extension of the sampling *** both schemes,corresponding sufficient and necessary conditions for stabilizing the HVDC system asymptotically are further *** the numerical examples are given to illustrate the theoretical analysis.

关键词： Primary frequency regulation Power reserves Multi-terminal HVDC system sampling algorithm Intermittent control

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共9页 << < 1 2 3 4 5 6 7 8 9 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：