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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

179 篇 会议
36 册 图书
13 篇 期刊文献

馆藏范围

226 篇 电子文献
2 种 纸本馆藏

日期分布

学科分类号

166 篇 工学
- 155 篇 计算机科学与技术...
- 118 篇 软件工程
- 16 篇 电气工程
- 16 篇 信息与通信工程
- 15 篇 控制科学与工程
- 5 篇 土木工程
- 3 篇 建筑学
- 2 篇 力学（可授工学、理...
- 2 篇 机械工程
- 2 篇 光学工程
- 2 篇 电子科学与技术（可...
- 1 篇 仪器科学与技术
- 1 篇 测绘科学与技术
- 1 篇 化学工程与技术
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
75 篇 理学
- 70 篇 数学
- 8 篇 统计学（可授理学、...
- 6 篇 物理学
- 5 篇 系统科学
- 4 篇 生物学
- 2 篇 化学
- 1 篇 大气科学
13 篇 管理学
- 10 篇 图书情报与档案管...
- 4 篇 管理科学与工程(可...
2 篇 法学
- 2 篇 社会学
2 篇 文学
- 2 篇 新闻传播学
2 篇 医学
- 2 篇 基础医学(可授医学...
1 篇 经济学
- 1 篇 应用经济学
1 篇 教育学
- 1 篇 教育学
1 篇 农学

主题

17 篇 theory of comput...
14 篇 software enginee...
13 篇 mathematical log...
13 篇 semantics
13 篇 artificial intel...
11 篇 computation by a...
10 篇 logics and meani...
10 篇 algorithm analys...
9 篇 programming lang...
9 篇 computer softwar...
8 篇 software enginee...
8 篇 model checking
8 篇 data structures
7 篇 system analysis
6 篇 data structures ...
6 篇 mathematics of c...
5 篇 computer system ...
5 篇 programming tech...
5 篇 differentiation ...
4 篇 computability an...

机构

8 篇 univ leicester d...
6 篇 univ london impe...
4 篇 max planck inst ...
4 篇 rhein westfal th...
3 篇 imperial coll lo...
3 篇 max planck inst ...
3 篇 university of tw...
3 篇 university of ox...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 rhein westfal th...
2 篇 univ bologna dip...
2 篇 fakultät für inf...
2 篇 cnrs
2 篇 cwi dept softwar...
2 篇 univ warwick dep...
2 篇 univ oxford dept...
2 篇 univ london impe...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...

作者

4 篇 pattinson dirk
3 篇 ulidowski irek
3 篇 edalat abbas
3 篇 kurz alexander
3 篇 zavattaro g
3 篇 uustalu tarmo
3 篇 heckel reiko
3 篇 phillips iain
2 篇 rabinovich alexa...
2 篇 james worrell
2 篇 hu liqiang
2 篇 busi n
2 篇 carlos martín-vi...
2 篇 yoshida nobuko
2 篇 schroeder lutz
2 篇 sagiv mooly
2 篇 noll thomas
2 篇 naoki kobayashi
2 篇 haase christoph
2 篇 katoen joost-pie...

语言

219 篇 英文
5 篇 其他
5 篇 中文

检索条件"任意字段=7th International Conference on Foundations of Software Science and Computation Structures"

共 228 条记录，以下是41-50 订阅

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

详细简洁

排序：

Minimisation of event structures 39

Minimisation of event structures

引用

39th IARCS Annual conference on foundations of software Technology and theoretical Computer science, FSTTCS 2019

作者： Baldan, Paolo Raffaetà, Alessandra University of Padova Italy Ca' Foscari University of Venice Italy

ISBN: (纸本)9783959771313

Event structures are fundamental models in concurrency theory, providing a representation of events in computation and of their relations, notably concurrency, conflict and causality. In this paper we present a theory of minimisation for event structures. Working in a class of event structures that generalises many stable event structure models in the literature, (e.g., prime, asymmetric, flow and bundle event structures) we study a notion of behaviour-preserving quotient, taking hereditary history preserving bisimilarity as a reference behavioural equivalence. We show that for any event structure a uniquely determined minimal quotient always exists. We observe that each event structure can be seen as the quotient of a prime event structure, and that quotients of general event structures arise from quotients of (suitably defined) corresponding prime event structures. this gives a special relevance to quotients in the class of prime event structures, which are then studied in detail, providing a characterisation and showing that also prime event structures always admit a unique minimal quotient. © Paolo Baldan and Alessandra Raffaetà;licensed under Creative Commons License CC-BY.

关键词： Equivalence classes

来源：评论

学校读者我要写书评

暂无评论

Structure Preserved Graph Reordering for Fast Graph Processing Without the Pain

Structure Preserved Graph Reordering for Fast Graph Processi...

引用

IEEE international conference on High Performance Computing and Communications (HPCC)

作者： Baofu Huang Zhidan Liu Kaishun Wu College of Computer Science and Software Engineering Shenzhen University China

ISBN: (纸本)9781728176505

By optimizing the data layout ahead-of-time, graph reordering can effectively improve the memory access locality in graph processing. the reordered graphs derived by sophisticated graph reordering approaches can greatly speedup the executions of most graph algorithms, while they incur huge computation overheads. Although lightweight approaches indeed reduce the reordering costs, they cannot achieve the best speedup performances. this is because they merely operate vertices of high-degrees and inadvertently destroy the community structures hidden in the graph. In this paper, we thus propose Sorder to balance the speedup performance and the reordering overhead. Sorder achieves better locality by preserving structural properties of graphs. Specifically, it mainly exploits neighborhood relations to renumber vertices and preferentially reorders vertices of high-degree ahead of the other vertices. We further enhance the design with the hypernode concept, which gathers neighboring vertices of low-degree to form a virtual vertex. therefore, Sorder can consecutively rearrange more neighboring vertices, such that protecting the community structures. Extensive experiments with 5 representative graph algorithms and 7 real-world graphs demonstrate that Sorder can achieve comparable speedup performance as Gorder, the state-of-the-art approach, while significantly reducing the reordering overhead.

关键词： Pain High performance computing conferences Layout

来源：评论

学校读者我要写书评

暂无评论

A New Method Based on PFC3D and Hierarchical Modeling for Pile Foundation Analysis 5th

A New Method Based on PFC3D and Hierarchical Modeling for Pi...

引用

5th GeoChina international conference on Civil Infrastructures Confronting Severe Weathers and Climate Changes: From Failure to Sustainability, 2018

作者： Zhao, Honghua Zhang, Jin Qiu, Peng Ji, Shunying State Key Laboratory of Structural Analysis for Industrial Equipment Department of Engineering Mechanics International Research Center for Computational Mechanics Dalian University of Technology Dalian116023 China

ISBN: (纸本)9783319956442

By developing a hierarchical modeling method, using discrete element analysis software PFC3D, a pile foundation model is built. According to the idea of finite element method, using smaller particles for concerned part and use larger particles for the part which is close to the model boundary. By adjusting the micromechanical parameters of the particles, the macroscopic mechanical properties of the soils constituted by different particle diameters are kept constant, which is verified by the triaxial test. this method can be applied to study the soil-structures interaction problems with DEM method by saving computation cost. © 2019, Springer international Publishing AG, part of Springer Nature.

关键词： Pile foundations

来源：评论

学校读者我要写书评

暂无评论

18th international conference on foundations of software science and computation structures, FOSSACS 2015 Held as Part of the European Joint conferences on theory and Practice of software, ETAPS 2015

18th International Conference on Foundations of Software Sci...

引用

18th international conference on foundations of software science and computation structures, FoSSaCS 2015 Held as Part of the European Joint conferences on theory and Practice of software, ETAPS 2015

ISBN: (纸本)9783662466773

the proceedings contain 38 papers. the special focus in this conference is on Semantics of Programming Languages, Categorical Models, Temporal Logics and Timed Systems. the topics include: Synthesis of strategies and the Hoare logic of angelic nondeterminism;game semantics and normalization by evaluation;a categorical semantics for linear logical frameworks;coalgebraic trace semantics via forgetful logics;on the total variation distance of semi-Markov chains;decidable and expressive classes of probabilistic automata;compositional metric reasoning with probabilistic process calculi;fragments of ml decidable by nested data class memory automata;step-indexed logical relations for probability;robust multidimensional mean-payoff games are undecidable;three variables suffice for real-time logic;on presburger arithmetic extended with modulo counting quantifiers;programming and reasoning with guarded recursion for coinductive types;the computational contents of ramified corecurrence and on the mints hierarchy in first-order intuitionistic logic.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Differential Calculus with Imprecise Input and Its Logical Framework 21st

Differential Calculus with Imprecise Input and Its Logical F...

引用

21st international conference on foundations of software science and computation structures (FOSSACS) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Edalat, Abbas Maleki, Mehrdad Imperial Coll London Dept Comp London SW7 2RH England Inst Res Fundamental Sci IPM Tehran Iran

ISBN: (纸本)9783319893662;9783319893655

We develop a domain-theoretic Differential Calculus for locally Lipschitz functions on finite dimensional real spaces with imprecise input/output. the inputs to these functions are hyper-rectangles and the outputs are compact real intervals. this extends the domain of application of Interval Analysis and exact arithmetic to the derivative. A new notion of a tie for these functions is introduced, which in one dimension represents a modification of the notion previously used in the one-dimensional framework. A Scott continuous sub-differential for these functions is then constructed, which satisfies a weaker form of calculus compared to that of the Clarke sub-gradient. We then adopt a Program Logic viewpoint using the equivalence of the category of stably locally compact spaces with that of semi-strong proximity lattices. We show that given a localic approximable mapping representing a locally Lipschitz map with imprecise input/output, a localic approximable mapping for its sub-differential can be constructed, which provides a logical formulation of the sub-differential operator.

关键词： Imprecise input/output Interval analysis Exact computation Lipschitz maps Clarke gradient Domain theory Stone duality

来源：评论

学校读者我要写书评

暂无评论

A categorical account of replicated data types 39

A categorical account of replicated data types

引用

39th IARCS Annual conference on foundations of software Technology and theoretical Computer science, FSTTCS 2019

作者： Gadducci, Fabio Melgratti, Hernán Roldán, Christian Sammartino, Matteo Dipartimento di Informatica Università di Pisa Italy Departamento de Computación Universidad de Buenos Aires Argentina ICC-CONICET-UBA Buenos Aires Argentina Department of Computer Science University College London United Kingdom

ISBN: (纸本)9783959771313

Replicated Data Types (rdts) have been introduced as a suitable abstraction for dealing with weakly consistent data stores, which may (temporarily) expose multiple, inconsistent views of their state. In the literature, rdts are commonly specified in terms of two relations: visibility, which accounts for the different views that a store may have, and arbitration, which states the logical order imposed on the operations executed over the store. Different flavours, e.g., operational, axiomatic and functional, have recently been proposed for the specification of rdts. In this work, we propose an algebraic characterisation of rdt specifications. We define categories of visibility relations and arbitrations, show the existence of relevant limits and colimits, and characterize rdt specifications as functors between such categories that preserve these additional structures. © Fabio Gadducci, Hernán Melgratti, Christian Roldán, and Matteo Sammartino;licensed under Creative Commons License CC-BY.

关键词： Specifications

来源：评论

学校读者我要写书评

暂无评论

Facilitating Evolutionary Algorithm Analysis with Persistent Data structures 16th

引用

16th international conference on Computer Aided Systems theory (EUROCAST)

作者： Pitzer, Erik Affenzeller, Michael Univ Appl Sci Upper Austria Dept Software Engn Softwarepk 11 A-4232 Hagenberg Austria Johannes Kepler Univ Linz Inst Formal Models & Verificat Altenbergerstr 68 A-4040 Linz Austria

ISBN: (纸本)9783319747187;9783319747170

Evolutionary algorithm analysis is often impeded by the large amounts of intermediate data that is usually discarded and has to be painstakingly reconstructed for real-world large-scale applications. In the recent past persistent data structures have been developed which offer extremely compact storage with acceptable runtime penalties. In this work two promising persistent data structures are explored in the context of evolutionary computation with the hope to open the door to simplified analysis of large-scale evolutionary algorithm runs.

关键词： Evolutionary algorithms

来源：评论

学校读者我要写书评

暂无评论

Distributed Pseudorandom Functions for General Access structures in NP 19th

Distributed Pseudorandom Functions for General Access Struct...

引用

19th international conference on Information and Communications Security (ICICS)

作者： Liang, Bei Mitrokotsa, Aikaterini Chalmers Univ Technol Gothenburg Sweden

ISBN: (纸本)9783319895000;9783319894997

Distributed pseudorandom functions (DPRFs) originally introduced by Naor, Pinkas and Reingold (EUROCRYPT '99) are pseudorandom functions (PRFs), whose computation is distributed to multiple servers. Although by distributing the function computation, we avoid single points of failures, this distribution usually implies the need for multiple interactions with the parties (servers) involved in the computation of the function. In this paper, we take distributed pseudorandom functions (DPRFs) even further, by pursuing a very natural direction. We ask if it is possible to construct distributed PRFs for a general class of access mechanism going beyond the threshold access structure and the access structure that can be described by a polynomial-size monotone span programs. More precisely, our contributions are two-fold and can be summarised as follows: (i) we introduce the notion of single round distributed PRFs for a general class of access structure (monotone functions in NP), (ii) we provide a provably secure general construction of distributed PRFs for every mNP access structure from puncturable PRFs based on indistinguishable obfuscation.

关键词： Distributed pseudorandom functions Puncturable PRFs Function secret sharing

来源：评论

学校读者我要写书评

暂无评论

Adaptive Pattern Matching with Reinforcement Learning for Dynamic Graphs 25

Adaptive Pattern Matching with Reinforcement Learning for Dy...

引用

25th IEEE international conference on High Performance Computing, Data and Analytics (HiPC)

作者： Kanezashi, Hiroki Suzumura, Toyotaro Garcia-Gasulla, Dario Oh, Min-hwan Matsuoka, Satoshi Tokyo Inst Technol Meguro Ku 2-12-1 Ookayama Tokyo 1528550 Japan IBM TJ Watson Res Ctr 1101 Kitchawan Rd Yorktown Hts NY 10598 USA Barcelona Supercomp Ctr 29-31 Carrer Jordi Girona Barcelona Spain Columbia Univ 500 W 120th St New York NY 10027 USA RIKEN Ctr Computat Sci Chuo Ku 7-1-26 Minatojima Minamimachi Kobe Hyogo 6500047 Japan

ISBN: (纸本)9781538683866

Graph pattern matching algorithms to handle million-scale dynamic graphs are widely used in many applications such as social network analytics and suspicious transaction detections from financial networks. On the other hand, the computation complexity of many graph pattern matching algorithms is expensive, and it is not affordable to extract patterns from million-scale graphs. Moreover, most real-world networks are time-evolving, updating their structures continuously, which makes it harder to update and output newly matched patterns in real time. Many incremental graph pattern matching algorithms which reduce the number of updates have been proposed to handle such dynamic graphs. However, it is still challenging to recompute vertices in the incremental graph pattern matching algorithms in a single process, and that prevents the real-time analysis. We propose an incremental graph pattern matching algorithm to deal with time-evolving graph data and also propose an adaptive optimization system based on reinforcement learning to recompute vertices in the incremental process more efficiently. then we discuss the qualitative efficiency of our system with several types of data graphs and pattern graphs. We evaluate the performance using million-scale attributed and time-evolving social graphs. Our incremental algorithm is up to 10.1 times faster than an existing graph pattern matching and 1.95 times faster with the adaptive systems in a computation node than naive incremental processing.

关键词： Data science Big Data Systems and software Big Data Algorithms and Analytics Network theory (graphs) Pattern matching Data mining Iterative learning control

来源：评论

学校读者我要写书评

暂无评论

Streaming for aibohphobes: Longest palindrome with mismatches 37

Streaming for aibohphobes: Longest palindrome with mismatche...

引用

37th IARCS Annual conference on foundations of software Technology and theoretical Computer science, FSTTCS 2017

作者： Grigorescu, Elena Azer, Erfan Sadeqi Zhou, Samson Department of Computer Science Purdue University West Lafayette United States School of Informatics and Computing Indiana University Bloomington United States

ISBN: (纸本)9783959770552

A palindrome is a string that reads the same as its reverse, such as "aibohphobia" (fear of palindromes). Given a metric and an integer d > 0, a d-near-palindrome is a string of Hamming distance at most d from its reverse. We study the natural problem of identifying the longest d-near-palindrome in data streams. the problem is relevant to the analysis of DNA databases, and to the task of repairing recursive structures in documents such as XML and JSON. We present the first streaming algorithm for the longest d-near-palindrome problem that returns a d-near-palindrome whose length is within a multiplicative (1 + )-factor of the longest d-near-palindrome. Our algorithm also returns the set of mismatched indices in the d-near-palindrome, and uses Odlog(1+log7 n) bits of space, and Odlog(1+log6 n) update time per arrival symbol. We show that for d = o(n), any randomized algorithm with multiplicative approximation (1 + ) that succeeds with probability at least 1 - 1/n requires (d log n) space. We further obtain a streaming algorithm that returns a d-near-palindrome whose length is within an additive E-error of the longest d-near-palindrome. the algorithm uses OdnlogE6 n bits of space and OdnlogE5 n update time. As before, we show that any randomized streaming algorithm that solves the longest d-near-palindrome problem for additive error E with probability at least 1 -n1 , usesdn E space. Finally, we give an exact two-pass algorithm that solves the longest d-near-palindrome problem using O d2 n log6 n bits of space. © Elena Grigorescu, Erfan Sadeqi Azer, and Samson Zhou.

关键词： Hamming distance

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：