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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

116 篇 期刊文献
64 篇 会议
1 篇 学位论文

馆藏范围

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

日期分布

学科分类号

140 篇 工学
- 108 篇 计算机科学与技术...
- 42 篇 电气工程
- 24 篇 信息与通信工程
- 18 篇 软件工程
- 17 篇 控制科学与工程
- 9 篇 机械工程
- 5 篇 电子科学与技术（可...
- 4 篇 仪器科学与技术
- 3 篇 材料科学与工程（可...
- 2 篇 交通运输工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 测绘科学与技术
- 1 篇 航空宇航科学与技...
- 1 篇 生物工程
45 篇 理学
- 34 篇 数学
- 5 篇 统计学（可授理学、...
- 4 篇 生物学
- 3 篇 物理学
- 3 篇 化学
- 3 篇 系统科学
42 篇 管理学
- 37 篇 管理科学与工程(可...
- 4 篇 工商管理
- 3 篇 图书情报与档案管...
- 2 篇 公共管理
6 篇 经济学
- 5 篇 应用经济学
5 篇 医学
- 2 篇 临床医学
- 2 篇 公共卫生与预防医...
1 篇 哲学
1 篇 法学
- 1 篇 法学
1 篇 教育学
- 1 篇 心理学(可授教育学...
1 篇 军事学
1 篇 艺术学

主题

181 篇 approximate algo...
9 篇 optimization
8 篇 minimum enclosin...
7 篇 exact algorithm
5 篇 kernel methods
5 篇 dynamic programm...
4 篇 submodular
4 篇 support vector m...
4 篇 approximation al...
4 篇 support vector m...
3 篇 social network a...
3 篇 core sets
3 篇 computational ge...
3 篇 social networks
3 篇 betweenness cent...
3 篇 heuristics
3 篇 iterative learni...
3 篇 directed graphs
3 篇 motif discovery
3 篇 optimal control

机构

3 篇 zhengzhou inst a...
3 篇 southwest jiaoto...
3 篇 xidian univ stat...
3 篇 hong kong univ s...
2 篇 georgia state un...
2 篇 college of infor...
2 篇 department of co...
2 篇 beijing normal u...
2 篇 univ technol syd...
2 篇 univ hong kong d...
2 篇 univ paris sacla...
2 篇 china jiliang un...
2 篇 suny stony brook...
2 篇 xidian univ sch ...
2 篇 telecom paris ip...
2 篇 shanghai jiao to...
2 篇 univ new brunswi...
2 篇 jiangxi univ fin...
2 篇 beijing institut...
2 篇 xidian univ sch ...

作者

4 篇 zheng danyang
4 篇 bifet albert
4 篇 abdessalem talel
4 篇 wang yongqing
4 篇 wang meng
4 篇 cui jiangtao
4 篇 li hui
4 篇 chehreghani most...
4 篇 cao xiaojun
3 篇 chen lei
3 篇 xu hong-wei
2 篇 liu bo
2 篇 yongqing wang
2 篇 zhang xudong
2 篇 li dan
2 篇 soh sieteng
2 篇 liu xiaorong
2 篇 chang liang
2 篇 guoren wang
2 篇 liu lei

语言

171 篇 英文
9 篇 其他
1 篇 德文
1 篇 法文
1 篇 意大利文
1 篇 中文

检索条件"主题词=approximate algorithm"

共 181 条记录，以下是131-140 订阅

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

详细简洁

排序：

Minimum Cost Stable Outcome in Exchange Networks

Minimum Cost Stable Outcome in Exchange Networks

引用

IEEE Global Conference on Communications (GLOBECOM) / Workshop on Wireless Networking and Control for UAV

作者： Yan, Ruidong Zhu, Yuqing Li, Deying Wang, Yongcai Chen, Wenping Renmin Univ China Sch Informat Beijing 100872 Peoples R China Calif State Univ Los Angeles Dept Comp Sci Los Angeles CA 90032 USA

ISBN: (纸本)9781538647271

One significant problem in exchange networks is finding the equilibrium. To solve this problem, the concept of stable outcome has been developed. However, there are few effective methods to solve it from the point of graph theory. In this paper, we propose a minimum cost stable outcome (MCSO) problem, which is to find a stable outcome whose total transaction cost is minimized Two algorithms have been designed to solve this problem on unit and general profit networks respectively. For unit profit networks, we use minimum cost edge cover based method to give the optimal solution. For general profit networks, we develop an approximate algorithm and prove that performance ratio is no more than twice the optimal value. Moreover, we provide the probabilistic analysis. At last, extensive experiments have been conducted on synthetic and real-life datasets. Experimental results validate the performance of the proposed algorithms.

关键词： Social Exchange Network Stable Outcome Edge Cover approximate algorithm Game Theory

来源：评论

学校读者我要写书评

暂无评论

Optimal Iterative Learning Control for Nonlinear Discrete-time Systems

Optimal Iterative Learning Control for Nonlinear Discrete-ti...

引用

International Conference on Key Engineering Materials and Computer Science (KEMCS 2011)

作者： Xu Hong-wei China Jiliang Univ Coll Mech & Elect Engn Hangzhou Zhejiang Peoples R China

ISBN: (纸本)9783037852118

In this paper, the problem about optimal iterative learning control of general nonlinear discrete-time systems has been studied. Based on the sufficient conditions of the existence of optimal iterative learning control in general nonlinear discrete-time systems, in view of the practical application, propose an approximate iterative algorithm, and prove the approximate iterative control restraining to the optimum control.

关键词： Iterative Learning Control general nonlinear discrete-time systems approximate algorithm Optimal Control

来源：评论

学校读者我要写书评

暂无评论

Optimal Iterative Learning Control for Nonlinear Discrete-Time Systems 1

引用

Pacific-Asia Conference on Knowledge Engineering and Software Engineering

作者： Xu, Hong-wei China Jiliang Univ Coll Mech & Elect Engn Hangzhou Zhejiang Peoples R China

ISBN: (数字)9783642253492

ISBN: (纸本)9783642253485

关键词： Iterative Learning Control general nonlinear discrete-time systems approximate algorithm Optimal Control

来源：评论

学校读者我要写书评

暂无评论

k-Collective Influential Facility Placement over Moving Object 20

k-Collective Influential Facility Placement over Moving Obje...

引用

20th IEEE International Conference on Mobile Data Management (IEEE MDM)

作者： Li, Dan Li, Hui Wang, Meng Cui, Jiangtao Xidian Univ State Key Lab Integrated Serv Networks Xian Shaanxi Peoples R China Xidian Univ Sch Cyber Engn Xian Shaanxi Peoples R China Xian Polytech Univ Sch Comp Sci Xian Shaanxi Peoples R China Xidian Univ Sch Comp Sci & Technol Xian Shaanxi Peoples R China

ISBN: (纸本)9781728133638

In this paper we propose and study the problem of k-Collective influential facility placement over moving object. Specifically, given a set of candidate locations, a group of moving objects, each of which is associated with a collection of reference points, as well as a budget k, we aim to mine a group of k locations, the combination of whom can influence the most number of moving objects. We show that this problem is NP-hard and present a basic hill-climb algorithm, namely GreedyP. We prove this method with (1 - 1/e) approximation ratio. One core challenge is to identify and reduce the overlap of the influence from different selected locations to maximize the marginal benefits. Therefore, the GreedyP approach may be very costly when the number of moving objects is large. In order to address the problem, we also propose another GreedyPS algorithm based on FM-sketch technique, which maps the moving objects to bitmaps such that the marginal benefit can be easily observed through bit-wise operations. Through this way, we are able to save more than a half running time while preserving the result quality. Experiments on real datasets verify the efficiency and effectiveness for both algorithms we propose in this paper.

关键词： moving objects location selection submodular approximate algorithm

来源：评论

学校读者我要写书评

暂无评论

Bus Frequency Optimization: When Waiting Time Matters in User Satisfaction 25th

Bus Frequency Optimization: When Waiting Time Matters in Use...

引用

25th International Conference on Database Systems for Advanced Applications (DASFAA)

作者： Mo, Songsong Bao, Zhifeng Zheng, Baihua Peng, Zhiyong Wuhan Univ Sch Comp Sci Wuhan Hubei Peoples R China RMIT Univ Melbourne Vic Australia Singapore Management Univ Singapore Singapore

ISBN: (纸本)9783030594152;9783030594169

Reorganizing bus frequency to cater for the actual travel demand can save the cost of the public transport system significantly. Many, if not all, existing studies formulate this as a bus frequency optimization problem which tries to minimize passengers' average waiting time. However, many investigations have confirmed that the user satisfaction drops faster as the waiting time increases. Consequently, this paper studies the bus frequency optimization problem considering the user satisfaction. Specifically, for the first time to our best knowledge, we study how to schedule the buses such that the total number of passengers who could receive their bus services within the waiting time threshold is maximized. We prove that this problem is NP-hard, and present an index-based algorithm with (1 - 1/e) approximation ratio. By exploiting the locality property of routes in a bus network, we propose a partition-based greedy method which achieves a (1 - rho)(1 - 1/e) approximation ratio. Then we propose a progressive partition-based greedy method to further improve the efficiency while achieving a (1 - rho)(1 - 1/e - epsilon) approximation ratio. Experiments on a real city-wide bus dataset in Singapore verify the efficiency, effectiveness, and scalability of our methods.

关键词： Bus frequency scheduling optimization User waiting time minimization approximate algorithm

来源：评论

学校读者我要写书评

暂无评论

A Cross-Covariance based Background Subspace Learning Method for Foreground Detection 2

A Cross-Covariance based Background Subspace Learning Method...

引用

2017 IEEE 2nd Information Technology, Networking, Electronic and Automation Control Conference (ITNEC 2017)

作者： Ming Qin Dahua Zhang Lihua Li Jing Huang Information and Communication Department China Electric Power Research Institute People's Public Security University of China Legislative Reference Service Department National Library of China

ISBN: (纸本)9781509064151;9781509064144

Foreground detection in complex scenarios is a challenging task. In this work, we propose to detect foreground by incrementally learning a cross-covariance based subspace. In our method, we first introduce the cross-covariance based two dimensional principal component analysis(2 DPCA) algorithm into foreground detection field for better background ***, we extend the conventional cross-covariance based 2 DPCA algorithm into an incremental one, which helps to model background in an adaptive way. Moreover, we consider the sparse and the continuous characteristics of the foreground, and formulate them as a fused lasso problem. By adding the fused lasso regularization into the proposed subspace learning process,we integrate the background recovery and the foreground estimation into a single optimization framework. Finally, we design an efficient approximate algorithm which solves the optimization problem effectively. We compare our method with the state of the art methods on multiple challenging video sequences. The experimental results demonstrate the effectiveness and the advantages of the proposed method.

关键词： cross-covariance background subspace learning foreground detection approximate algorithm

来源：评论

学校读者我要写书评

暂无评论

FRAIM: A Feature Importance-Aware Incentive Mechanism for Vertical Federated Learning 1

引用

23rd International Conference on algorithms and Architectures for Parallel Processing (ICA3PP)

作者： Tan, Lei Yang, Yunchao Hu, Miao Zhou, Yipeng Wu, Di Sun Yat Sen Univ Sch Comp Sci & Engn Guangzhou 510006 Peoples R China Guangdong Key Lab Big Data Anal & Proc Guangzhou 510006 Peoples R China Macquarie Univ Sch Comp Fac Sci & Engn Sydney NSW 2109 Australia

ISBN: (数字)9789819708086

ISBN: (纸本)9789819708079;9789819708086

Federated learning, a new distributed learning paradigm, has the advantage of sharing model information without revealing data privacy. However, considering the selfishness of organizations, they will not participate in federated learning without compensation. To address this problem, in this paper, we design a feature importance-aware vertical federated learning incentive mechanism. We first synthesize a small amount of data locally using the interpolation method at the organization and send it to the coordinator for evaluating the contribution of each feature to the learning task. Then, the coordinator calculates the importance value of each feature in the dataset for the current task using the Shapley value method according to the synthetic data. Next, we formulate the process of organization participation in the federation as a feature importance maximization problem based on reverse auction which is a knapsack auction problem. Finally, we design an approximate algorithm to solve the proposed optimization problem and the solution of the approximation algorithm is shown to be 1/2 -approximate to the optimal solution. Furthermore, we prove that the proposed mechanism is truthfulness, individual rationality, and computational efficiency. The superiority of our proposed mechanism is verified through experiments on real-world datasets.

关键词： Vertical federated learning Incentive mechanism Feature importance Reverse auction approximate algorithm

来源：评论

学校读者我要写书评

暂无评论

An Approach to Find Maximal Disjoint Paths with Reliability and Delay Constraints

An Approach to Find Maximal Disjoint Paths with Reliability ...

引用

23rd International Conference on Advanced Information Networking and Applications Workshops

作者： Loh, Ruen-Chze Soh, Sieteng Lazarescu, Mihai Curtin Univ Technol Dept Comp Perth WA Australia

ISBN: (纸本)9781424440009

Recently, multipaths solutions have been proposed to improve the quality-of-service (QoS) in communication networks (CN). Peng and Shen algorithm (PSA) was proposed to generate lambda DP/DC - the maximum edge-disjoint-path-set with minimal cost subject to a delay constraint, for lambda >= 2. This paper introduces a different and equally important problem, lambda DP/DR, to obtain the maximal edge-disjoint-path-set with maximum reliability subject to a given delay constraint, for lambda >= 1. lambda DP/DR is applicable to time critical applications that require non-compromised time delay while demanding maximum system reliability. In this paper we show how lambda DP/DR is different from lambda DP/DC, and propose an approximate algorithm similar to the Lagrange-relaxation based PSA to solve the problem. Our simulations on three randomly generated CNs show that our polynomial time algorithm produced lambda DP/DR with comparable optimality to that obtained using the NP-hard brute-force approach.

关键词： approximate algorithm Lagrange relaxation multi-constrained edge disjoint paths network delay network reliability

来源：评论

学校读者我要写书评

暂无评论

DyBED: An Efficient algorithm for Updating Betweenness Centrality in Directed Dynamic Graphs

DyBED: An Efficient Algorithm for Updating Betweenness Centr...

引用

IEEE International Conference on Big Data (Big Data)

作者： Chehreghani, Mostafa Haghir Bifet, Albert Abdessalem, Talel Univ Paris Saclay LTCI Telecom ParisTech Paris France

ISBN: (纸本)9781538650356

An important index widely used to analyze social and information networks is betweenness centrality. In this paper, given a dynamic and directed graph G and a vertex r in G, we present the DyBED algorithm that updates the (approximate) betweenness centrality of r, when an update operation (vertex/edge insertion/deletion) occurs in G. Our algorithm first during pre-processing computes two subsets of the vertex set of G, called RF(r) and RT (r). The Cartesian product of these two sets defines the sample space of our algorithm. In other words, each sample is a pair, whose first element belongs to RF(r) and second element belongs to RT (r). Then after each update operation, DyBED updates the sets RF(r) and RT (r), the sampled pairs, the information stored for each sample and accordingly, the betweenness centrality of r. We theoretically and empirically evaluate DyBED and show that it yields significant improvement over existing work. In particular, our extensive experiments reveal that DyBED is orders of magnitude faster than most efficient existing algorithms.

关键词： Social network analysis directed graphs dynamic graphs betweenness centrality approximate algorithm

来源：评论

学校读者我要写书评

暂无评论

Top-d Rank Aggregation in Web Meta-search Engine (Extended Abstract)

Top-<i>d</i> Rank Aggregation in Web Meta-search Engine (Ext...

引用

4th International Frontiers of algorithmics Workshop

作者： Fang, Qizhi Xiao, Han Zhu, Shanfeng Ocean Univ China Dept Math Qingdao 266100 Peoples R China Fudan Univ Sch Comp Sci Shanghai Peoples R China Fudan Univ Shanghai Key Lab Intelligent Informat Proc Shanghai 200433 Peoples R China

ISBN: (纸本)9783642145520

In this paper, we consider the rank aggregation problem for information retrieval over Web making use of a kind of metric, the coherence, which considers both the normalized Kendall-tau distance and the size of overlap between two partial rankings. In general, the top-d coherence aggregation problem is defined as: given collection of partial rankings Pi = {tau(1), tau(2), ... , tau(K)} how to find a final ranking pi with specific length d, which maximizes the total coherence Phi(pi, Pi) = Sigma(K)(i=1) Phi(pi, tau(i)) The corresponding complexity and algorithmic issues are discussed in this paper. Our main technical contribution is a polynomial time approximation scheme (PTAS) for a restricted top-d coherence aggregation problem.

关键词： Rank aggregation Kendall-tau distance coherence NP-hard approximate algorithm PTAS

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共19页 << < 10 11 12 13 14 15 16 17 18 19 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：