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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

199 篇 会议
10 册 图书
7 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

132 篇 工学
- 116 篇 计算机科学与技术...
- 58 篇 软件工程
- 27 篇 信息与通信工程
- 23 篇 电气工程
- 9 篇 控制科学与工程
- 5 篇 电子科学与技术（可...
- 5 篇 生物工程
- 4 篇 生物医学工程（可授...
- 3 篇 仪器科学与技术
- 3 篇 化学工程与技术
- 2 篇 材料科学与工程（可...
- 2 篇 动力工程及工程热...
- 1 篇 机械工程
- 1 篇 光学工程
39 篇 理学
- 30 篇 数学
- 6 篇 生物学
- 6 篇 统计学（可授理学、...
- 5 篇 系统科学
- 4 篇 物理学
- 2 篇 化学
- 1 篇 地球物理学
- 1 篇 地质学
14 篇 管理学
- 12 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
- 3 篇 工商管理
6 篇 医学
- 5 篇 临床医学
- 3 篇 基础医学(可授医学...
2 篇 经济学
- 2 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 教育学
- 1 篇 教育学
1 篇 艺术学

主题

21 篇 evolutionary com...
11 篇 optimization
10 篇 computation theo...
10 篇 computational mo...
8 篇 algorithms
8 篇 heuristic algori...
7 篇 signal processin...
6 篇 convergence
6 篇 genetic algorith...
6 篇 machine learning
6 篇 clustering algor...
6 篇 data structures
5 篇 statistics
5 篇 resource managem...
5 篇 servers
5 篇 algorithm design...
5 篇 artificial intel...
5 篇 edge computing
4 篇 computer science
4 篇 theory of comput...

机构

2 篇 univ bonn bonn
2 篇 univ manitoba de...
2 篇 hunan univ coll ...
2 篇 college of infor...
2 篇 bangladesh univ ...
2 篇 department of el...
2 篇 qingdao univ col...
2 篇 peng cheng labor...
2 篇 suny coll new pa...
2 篇 polytechnic inst...
2 篇 univ jember jemb...
2 篇 college of compu...
2 篇 national univers...
2 篇 school of commun...
2 篇 dipartimento di ...
2 篇 key laboratory o...
2 篇 beijing universi...
2 篇 college of compu...
2 篇 zhejiang univ te...
1 篇 ramrao adik inst...

作者

3 篇 jiang fan
3 篇 slamin
2 篇 wang lei
2 篇 wu yuan
2 篇 rahman md. saidu...
2 篇 li kenli
2 篇 mutzel petra
2 篇 leung carson kai...
2 篇 yu jie
2 篇 li hao
2 篇 jiao licheng
2 篇 li keqin
2 篇 pazdor adam g. m...
2 篇 peddle aaron m.
2 篇 zhang qi
2 篇 peng jiwu
1 篇 frangu laurentiu
1 篇 becchetti luca
1 篇 ha yajun
1 篇 jizhao yin

语言

211 篇 英文
3 篇 其他
2 篇 中文

检索条件"任意字段=16th International Conference and Workshops on Algorithms and Computation"

共 216 条记录，以下是121-130 订阅

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

详细简洁

排序：

Fully decentralized computation of aggregates over data streams

Fully decentralized computation of aggregates over data stre...

引用

1st international Workshop on Novel Data Stream Pattern Mining Techniques, StreamKDD'10, Held in Conjunction with the 16th ACM SIGKDD conference on Knowledge Discovery and Data Mining

作者： Becchetti, Luca Bordino, Ilaria Leonardi, Stefano Rosen, Adi DIS Sapienza Università di Roma Roma Italy LRI Université Paris-Sud CNRS Paris France

ISBN: (纸本)9781450302265

In several emerging applications, data is collected in massive streams at several distributed points of observation. A basic and challenging task is to allow every node to monitor a neighbourhood of interest by issuing continuous aggregate queries on the streams observed in its vicinity. this class of algorithms is fully decentralized and diffusive in nature: collecting all data at few central nodes of the network is unfeasible in networks of low capability devices or in the presence of massive data sets. the main difficulty in designing diffusive algorithms is to cope with duplicate detections. these arise both from the observation of the same event at several nodes of the network and/or receipt of the same aggregated information along multiple paths of diffusion. In this paper, we consider fully decentralized algorithms that answer locally continuous aggregate queries on the number of distinct events, total number of events and the second frequency moment in the scenario outlined above. the proposed algorithms use in the worst case or on realistic distributions sublinear space at every node. We also propose strategies that minimize the communication needed to update the aggregates when new events are observed. We finally present experimental analysis providing evidence for the efficiency and accuracy of our algorithms on realistic simulated scenarios. © 2010 ACM.

关键词： Aggregates

来源：评论

学校读者我要写书评

暂无评论

16th international conference on Wireless algorithms, Systems, and Applications, WASA 2021

16th International Conference on Wireless Algorithms, System...

引用

16th international conference on Wireless algorithms, Systems, and Applications, WASA 2021

ISBN: (纸本)9783030861292

the proceedings contain 159 papers. the special focus in this conference is on Wireless algorithms, Systems, and Applications. the topics include: A Light-Weight Deployment Methodology for DNN Re-training in Resource-Constraint Scenarios;dynamic Edge computation Offloading and Scheduling for Model Task in Energy Capture Network;a Priority Task Offloading Scheme Based on Coherent Beamforming and Successive Interference Cancellation for Edge Computing;improving WiFi Fingerprint Positioning through Smartphone Built-In Sensors Based Trajectory Estimation;gray Failures Detection for Shared Bicycles;a Robust IoT Device Identification Method with Unknown Traffic Detection;temporal Networks Based Industry Identification for Bitcoin Users;Rewarding and Efficient Data Sharing in EHR System with Coalition Blockchain Assistance;low-Cost Wi-Fi Fingerprinting Indoor Localization via Generative Deep Learning;CDVT: A Cluster-Based Distributed Video Transcoding Scheme for Mobile Stream Services;a Node Preference-Aware Delegated Proof of Stake Consensus Algorithm With Reward and Punishment Mechanism;Communication-efficient Federated Learning via Quantized Clipped SGD;fat Topic: Improving Latency in Content-Based Publish/Subscribe Systems on Apache Kafka;practical Bandwidth Allocation for Video QoE Fairness;ECCR: Edge-Cloud Collaborative Recovery for Low-Power Wide-Area Networks Interference Mitigation;available Time Aware Offloading for Dependent Tasks with Cooperative Edge Servers;DNN Inference Acceleration with Partitioning and Early Exiting in Edge Computing;deep Reinforcement Learning Based Collaborative Mobile Edge Caching for Omnidirectional Video Streaming;TS-Net: Device-Free Action Recognition with Cross-Modal Learning;dual Attention Network Based on Knowledge Graph for News Recommendation;SDC Error Detection by Exploring the Importance of Instruction Features;URTracker: Unauthorized Reader Detection and Localization Using COTS RFID;camDist: Camera Based Distance Estimation w

关键词：

来源：评论

学校读者我要写书评

暂无评论

On computing reachability sets of process rewrite systems

On computing reachability sets of process rewrite systems

引用

16th international conference on Rewriting Technique and Application (RAT 2005)

作者： Bouajjani, A Touili, T Univ Paris 07 LIAFA F-75251 Paris France

ISBN: (纸本)3540255966

We consider the problem of symbolic reachability analysis of a class of term rewrite systems called Process Rewrite Systems (PRS). A PRS can be seen as the union of two mutually interdependent sets of term rewrite rules: a prefix rewrite system (or, equivalently, a pushdown system), and a multiset rewrite system (or, equivalently, a Petri net). these systems are natural models for multithreaded programs with dynamic creation of concurrent processes and recursive procedure calls. We propose a generic framework based on tree automata allowing to combine (finite-state automata based) procedures for the reachability analysis of pushdown systems with (linear arithmetics/semilinear sets based) procedures for the analysis of Petri nets in order to analyze PRS models. We provide a construction which is parametrized by such procedures and we show that it can be instantiated to (1) derive procedures for constructing the (exact) reachability sets of significant classes of PRS, (2) derive various approximate algorithms, or exact semi-algorithms, for the reachability analysis of PRS obtained by using existing symbolic reachability analysis techniques for Petri nets and counter automata.

关键词： computation theory

来源：评论

学校读者我要写书评

暂无评论

Proceedings. 16th IEEE international conference on Tools with Artificial Intelligence

Proceedings. 16th IEEE International Conference on Tools wit...

引用

international conference on Tools for Artificial Intelligence (ICTAI)

the following topics are dealt with: data mining; optimization; search algorithms; satisfiability; machine learning; software engineering; information retrieval; scheduling; intelligent image analysis; evolutionary computation; agent-based system; knowledge representation; unsupervised learning; knowledge management.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Lightweight threshold Private Set Intersection via Oblivious Transfer 16th

Lightweight Threshold Private Set Intersection via Oblivious...

引用

16th international conference on Wireless algorithms, Systems, and Applications (WASA)

作者： Zhao, Shengnan Ma, Ming Song, Xiangfu Jiang, Han Yan, Yunxue Xu, Qiuliang Shandong Univ Sch Software Jinan 250101 Peoples R China Key Lab Shandong Prov Software Engn Jinan 250101 Peoples R China

ISBN: (纸本)9783030861377;9783030861360

As a significant basis for privacy-preserving applications of Secure Multiparty computation (MPC), Private Set Intersection (PSI) has long been a question of great interest in a wide range of field, such as ad conversion rates and private contact tracing. threshold PSI (t-PSI), a variant of PSI, allows two parties to learn the intersection of two sets only if the cardinality of intersection is larger (or lesser) than a threshold t. In this paper, we give a generic t-PSI construction that relies heavily on Oblivious Transfer (OT). Without resorting to the relatively expensive homomorphic calculation approaches from public-key mechanism, two kinds of t-PSI protocols could be efficiently implemented based on our proposed construction, i.e., t(<=) PSI and t(>)-PSI. Specially, we construct two efficient protocols named secret-sharing private equality test (ss)PEQT and membership text (PMT)-P-ss, which enable PSI to scale to a wide range of practical applications. the experimental simulation results show that our protocols are efficient and computation friendly.

关键词： Secure Multiparty computation Private Set Intersection (PSI) threshold PSI Private Membership Test

来源：评论

学校读者我要写书评

暂无评论

16th international Euro-Par conference on Parallel Processing, Euro-Par 2010

16th International Euro-Par Conference on Parallel Processin...

引用

16th international Euro-Par conference on Parallel Processing, Euro-Par 2010

ISBN: (纸本)9783642152764

the proceedings contain 104 papers. the special focus in this conference is on Parallel Processing. the topics include: A parallel implementation of the Jacobi-Davidson eigensolver and its application in a plasma turbulence code;scheduling parallel eigenvalue computations in a quantum chemistry code;Scalable parallelization strategies to accelerate NuFFT data translation on multicores;multicore and Manycore Programming;javaSymphony: A programming and execution environment for parallel and distributed many-core architectures;scalable producer-consumer pools based on elimination-diffraction trees;productivity and performance: Improving consumability of hardware transactional memory through a real-world case study;exploiting fine-grained parallelism on cell processors;optimized on-chip-pipelined mergesort on the cell/B.E.;transactional mutex locks;Near-optimal placement of MPI processes on hierarchical NUMA architectures;parallel enumeration of shortest lattice vectors;A parallel GPU algorithm for mutual information based 3D nonrigid image registration;Multi-GPU and multi-CPU parallelization for interactive physics simulations;Long DNA sequence comparison on multicore architectures;adaptive fault tolerance for many-core based space-borne computing;Maestro: Data orchestration and tuning for openCL devices;multithreaded Geant4: Semi-automatic transformation into scalable thread-parallel software;parallel exact time series motif discovery;optimized dense matrix multiplication on a many-core architecture;exceptions for algorithmic skeletons;a language-based tuning mechanism for task and pipeline parallelism;A study of a software cache implementation of the OpenMP memory model for multicore and manycore architectures;Programming CUDA-based GPuS to simulate two-layer shallow water flows;theory and algorithms for parallel computation;analysis of multi-organization scheduling algorithms;Area-maximizing schedules for series-parallel DAGs;parallel Selection by Regular Sampling;a

关键词：

来源：评论

学校读者我要写书评

暂无评论

16th international Euro-Par conference on Parallel Processing, Euro-Par 2010

16th International Euro-Par Conference on Parallel Processin...

引用

16th international Euro-Par conference on Parallel Processing, Euro-Par 2010

ISBN: (纸本)9783642152900

关键词：

来源：评论

学校读者我要写书评

暂无评论

Computing Approximate Pure Nash Equilibria in Digraph k-Coloring Games 16

Computing Approximate Pure Nash Equilibria in Digraph k-Colo...

引用

16th international conference on Autonomous Agents and Multiagent Systems (AAMAS)

作者： Carosi, Raffaello Flammini, Michele Monaco, Gianpiero Gran Sasso Sci Inst Laquila Italy Univ Laquila Gran Sasso Sci Inst Laquila Italy Univ Laquila DISIM Laquila Italy

ISBN: (纸本)9781510855076

We investigate approximate pure Nash equilibria in digraph k-coloring games, where we are given an unweighted directed graph together with a set of k colors. Vertices represent agents and arcs capture their mutual unidirectional interests. the strategy set of each agent v consists of the k colors and the payoff of v in a given state or coloring is given by the number of outgoing neighbors with a color different from the one of v. Such games form some of the basic payoff structures in game theory, model lots of real-world scenarios with selfish agents and extend or are related to several fundamental class of games. It is known that the problem of understanding whether the game admits a pure Nash equilibrium is NP-complete. therefore we focus on designing polynomial time algorithms that return approximate Nash equilibria. Informally, we say that a coloring is a gamma-Nash equilibrium (for some gamma >= 1) if no agent can strictly improve her payoff by a multiplicative factor of gamma by changing color. We first propose a deterministic polynomial time algorithm that, for any k >= 3, returns a k-coloring that is a Delta(o) (G)-Nash equilibrium, where Delta(o) (G) is the maximum outdegree of the digraph. We then provide our two main results: i) By exploiting the constructive version of the well known Lovasz Local Lemma, we show a randomized algorithm with polynomial expected running time that, given any constant k >= 2, computes a constant-Nash equilibrium for a broad class of digraphs, i.e., for digraphs where, for any v 2 V, delta(v)(0) (G) = Omega(ln Delta(o) (G) ln Delta(i) (G)) where Delta(o) (G) (resp. Delta(i) (G)) is the maximum outgoing (resp. maximum ingoing) degree of G, and delta(v)(o) (G) is the outgoing degree of agent v. ii) For generic digraphs, we show a deterministic polynomial time algorithm that computes a (1+epsilon)-Nash equilibrium, for any epsilon > 0, by using O(log n/epsilon) colors.

关键词： Noncooperative games: computation Game theory for practical applications

来源：评论

学校读者我要写书评

暂无评论

Practical Homomorphic Encryption Over the Integers for Secure computation in the Cloud 16th

Practical Homomorphic Encryption Over the Integers for Secur...

引用

16th IMA international conference on Cryptography and Coding, IMACC 2017

作者： Dyer, James Dyer, Martin Xu, Jie School of Computer Science University of Manchester Manchester United Kingdom School of Computing University of Leeds Leeds United Kingdom

ISBN: (纸本)9783319710440

We present novel homomorphic encryption schemes for integer arithmetic, intended primarily for use in secure single-party computation in the cloud. these schemes are capable of securely computing arbitrary degree polynomials homomorphically. In practice, ciphertext size and running times limit the polynomial degree, but this appears sufficient for most practical applications. We present four schemes, with increasing levels of security, but increasing computational overhead. Two of the schemes provide strong security for high-entropy data. the remaining two schemes provide strong security regardless of this assumption. these four algorithms form the first two levels of a hierarchy of schemes which require linearly decreasing entropy. We have evaluated these four algorithms by computing low-degree polynomials. the timings of these computations are extremely favourable by comparison with even the best of existing methods, and dramatically out-perform running times of directly comparable schemes by a factor of up to 1000, and considerably more than that for fully homomorphic schemes, used in the same context. the results clearly demonstrate the practical applicability of our schemes. © 2017, Springer international Publishing AG.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

theory and Applications of Satisfiability Testing – SAT 2013 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Matti Järvisalo Allen Van Gelder

ISBN: (数字)9783642390715

ISBN: (纸本)9783642390708

this book constitutes the refereed proceedings of the 16th international conference on theory and Applications of Satisfiability Testing, SAT 2013, held in Helsinki, Finland in July 2013. the 21 regular papers, 5 short papers, and 5 tool papers presented together with 3 invited talks were carefully reviewed and selected from 71 submissions (850 regular, 15 short and 16 tool papers). the focus of the papers in on following topics: maximum satisfiability, encodings and applications, solver techniques and algorithms, clique-width and SAT, propositional proof complexity, parameterized complexity.

关键词： Logics and Meanings of Programs computation by Abstract Devices Algorithm Analysis and Problem Complexity Mathematical Logic and Formal Languages Artificial Intelligence Information and Communication, Circuits

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：