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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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 条记录，以下是51-60 订阅

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

详细简洁

排序：

foundations of software science and computation structures - 17th international conference, FOSSACS 2014, Held as Part of the European Joint conferences on theory and Practice of software, ETAPS 2014, Proceedings

引用

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

ISBN: (纸本)9783642548291

the proceedings contain 29 papers. the topics discussed include: analysis of probabilistic basic parallel processes;type reconstruction for the linear π-calculus with composite and equi-recursive types;a semantical and operational account of call-by-value solvability;network-formation games with regular objectives;playing with probabilities in reconfigurable broadcast networks;unsafe order-2 tree languages are context-sensitive;complexity of model-checking call-by-value programs;resource reachability games on pushdown graphs;the complexity of partial-observation stochastic parity games with finite-memory strategies;on negotiation as concurrency primitive II: deterministic cyclic negotiations;on asymmetric unification and the combination problem in disjoint theories;axiomatizing bisimulation equivalences and metrics from probabilistic SOS rules;generalized Eilenberg theorem I: local varieties of languages;and combining bialgebraic semantics and equations.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Description of Interest Regions Based on Combined Local Binary Patterns 9

Description of Interest Regions Based on Combined Local Bina...

引用

2017 9th IEEE international conference on Communication software and Networks (ICCSN 2017)

作者： Yi Yang Fajie Duan Guangyue Niu Hao Zheng State Key Laboratory of Precision Measurement Technology and Instruments Tianjin University

ISBN: (纸本)9781509038237;9781509038220

this paper proposes a novel inherently rotation invariant local descriptor which combined intensity information and gradient information of key feature. the CSLBP shows a better performance than SIFT and do not need large computation. To further enhance its performance and robustness, we calculated the gradient of key feature and computed a combined histogram included intensity and gradient information of sample point. Moreover, our descriptor does not estimate a reference orientation for achieving rotation invariance. We conduct the image matching experiments on Oxford dataset and additional image pairs with large illumination changes to evaluate the performance of our descriptor and existing local descriptors（such as SIFT, GLOH, DAISY, MROGH-S, etc.）. the experimental results demonstrate the effectiveness of our descriptors and their superiority to the state-of-the-art descriptors.

关键词： rotation invariant gradient CS-LBP combined histogram reference orientation SIFT

来源：评论

学校读者我要写书评

暂无评论

Secure Multi-party computation: Information Flow of Outputs and Game theory 6th

Secure Multi-party Computation: Information Flow of Outputs ...

引用

6th international conference on Principles of Security and Trust (POST) Held as Part of the European Joint conferences on theory and Practice of software (ETAPS)

作者： Ah-Fat, Patrick Huth, Michael Imperial Coll London Dept Comp London SW7 2AZ England

ISBN: (纸本)9783662544556;9783662544549

Secure multiparty computation enables protocol participants to compute the output of a public function of their private inputs whilst protecting the confidentiality of their inputs. But such an output, as a function of its inputs, inevitably leaks some information about input values regardless of the protocol used to compute it. We introduce foundations for quantifying and understanding how such leakage may influence input behaviour of deceitful protocol participants as well as that of participants they target. Our model captures the beliefs and knowledge that participants have about what input values other participants may choose. In this model, measures of information flow that may arise between protocol participants are introduced, formally investigated, and experimentally evaluated. these information-theoretic measures not only suggest advantageous input behaviour to deceitful participants for optimal updates of their beliefs about chosen inputs of targeted participants. they also allow targets to quantify the information-flow risk of their input choices. We show that this approach supports a game-theoretic formulation in which deceitful attackers wish to maximise the information that they gain on inputs of targets once the computation output is known, whereas the targets wish to protect the privacy of their inputs.

关键词： Game theory

来源：评论

学校读者我要写书评

暂无评论

7th international conference on Mathematical Aspects of Computer and Information sciences, MACIS 2017

7th International Conference on Mathematical Aspects of Comp...

引用

7th international conference on Mathematical Aspects of Computer and Information sciences, MACIS 2017

ISBN: (纸本)9783319724522

the proceedings contain 36 papers. the special focus in this conference is on Mathematical Aspects of Computer and Information sciences. the topics include: Integrating algebraic and SAT solvers;isabelle formalization of set theoretic structures and set comprehensions;jordan canonical form with parameters from frobenius form with parameters;knowledge-based interoperability for mathematical software systems;on interval methods with zero rewriting and exact geometric computation;sparse rational function interpolation with finitely many values for the coefficients;virtual theories – A uniform interface to mathematical knowledge bases;on real roots counting for non-radical parametric ideals;on the bit-size of non-radical triangular sets;balancing expression dags for more efficient lazy adaptive evaluation;rapidly convergent integrals and function evaluation;stirling numbers, Lambert W and the Gamma function;the potential and challenges of CAD with equational constraints for SC-square;new small 4-designs with nonabelian automorphism groups;on classifying steiner triple systems by their 3-rank;right-justified characterization for generating regular pattern avoiding permutations;experimental study of the Ehrhart interpolation polytope;on testing isomorphism of graphs of bounded eigenvalue multiplicity;a simple streaming bit-parallel algorithm for swap pattern matching;epidemic intelligence statistical modelling for biosurveillance;certification using Newton-invariant subspaces;mining acute stroke patients’ data using supervised machine learning;parallel and robust empirical risk minimization via the median trick;leakage-resilient riffle shuffle;ordinary pairing-friendly genus 2 hyperelliptic curves with absolutely simple Jacobians;Statistical testing of PRNG: Generalized gambler’s ruin problem;subtleties in security definitions for predicate encryption with public index;code-based key encapsulation from McEliece’s cryptosystem.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Development of advanced experimental technology on reproducing floor response of high-rise buildings subjected to ground motions 7

Development of advanced experimental technology on reproduci...

引用

7th international conference on Advances in Experimental Structural Engineering, AESE 2017

作者： Chen, Pei-Ching Lai, Chin-Ta Tsai, Keh-Chyuan National Taiwan University of Science and Technology Taiwan No.43 Keelung Rd. Sec.4 Da'an Dist. Taipei10607 Taiwan National Center for Research on Earthquake Engineering Taiwan No. 200 Sec. 3 HsinHai Rd. Da'an Dist. Taipei10667 Taiwan National Taiwan University Taiwan No. 1 Sec. 4 Roosevelt Rd. Da'an Dist. Taipei10617 Taiwan

ISBN: (纸本)9788885701021

the responses of high-rise buildings are mostly dominated by the first few vibration modes;therefore, the corresponding floor responses at high levels have long predominant periods. Damages of nonstructural components located in high-rise buildings generally cause functional loss due to the long-period acceleration after earthquakes. Typically, shaking table testing is regarded as one of the effective experimental tools to investigate the dynamic responses of structures and nonstructural components for earthquake engineering researches. However, it may be difficult to reproduce high-floor responses by using typical seismic shaking tables due to the actuator stroke limitation. In this study, a proof-of-concept passive transfer system incorporating various modern control schemes is proposed in order to reproduce high-floor responses without changing the hardware and software layout of an existing shaking table. A set of friction pendulums is adopted as the transfer system since its vibration frequency barely depends on the curvature. three control algorithms are designed and validated through an outer-loop control approach, including proportional-integral-derivative control, inverse feedforward control, and linear-quadratic-integral control with Kalman filter. Accelerometers and displacement transducers are installed on the top of the transfer system to measure the signals for the control computation. the roof responses of a 34-story building in Kaohsiung city subjected to various historical earthquakes are used as reference accelerations in the validating tests. Experimental results demonstrate these aforementioned methods reproduce the high-floor responses successfully. © 2017 international conference on Advances in Experimental Structural Engineerin. All rights reserved.

关键词： High-rise buildings Long-period response reproduction Outer-loop control Transfer system

来源：评论

学校读者我要写书评

暂无评论

Improved Private Set Intersection Against Malicious Adversaries 36th

Improved Private Set Intersection Against Malicious Adversar...

引用

36th Annual international conference on the theory and Applications of Cryptographic Techniques (EUROCRYPT)

作者： Rindal, Peter Rosulek, Mike Oregon State Univ Corvallis OR 97331 USA

ISBN: (纸本)9783319566207;9783319566191

Private set intersection (PSI) refers to a special case of secure two-party computation in which the parties each have a set of items and compute the intersection of these sets without revealing any additional information. In this paper we present improvements to practical PSI providing security in the presence of malicious adversaries. Our starting point is the protocol of Dong, Chen & Wen (CCS 2013) that is based on Bloom filters. We identify a bug in their malicious-secure variant and show how to fix it using a cut-and-choose approach that has low overhead while simultaneously avoiding one the main computational bottleneck in their original protocol. We also point out some subtleties that arise when using Bloom filters in malicious-secure cryptographic protocols. We have implemented our PSI protocols and report on its performance. Our improvements reduce the cost of Dong et al.'s protocol by a factor of 14 - 110x on a single thread. When compared to the previous fastest protocol of De Cristofaro et al., we improve the running time by 8 - 24x. For instance, our protocol has an online time of 14 s and an overall time of 2.1 min to securely compute the intersection of two sets of 1 million items each.

关键词： Data structures

来源：评论

学校读者我要写书评

暂无评论

foundations of software science and computation structures : Second international conference, Fossacs '99 Held as Part of the Joint European conferences on theory and Practice of software, Etaps '99, Amsterdam, the Netherlands, March 22-28, 1999 : Proceedings

引用

2016年

作者： wolfgang thomas

foundations of software science and computation structures : Second international conference, Fossacs '99 Held as Part of the Joint European conferences on theory and Practice of software, Etaps '99, Amsterdam, the Netherlands, March 22-28, 1999 : Proceedings by Fossacs '99 (1999 : Amsterdam, Netherlands); thomas, Wolfgang, 1947-; international Joint conference on theory; Practice of software Development (9th : 1999 : Amsterdam, Netherlands); published by Berlin ; New York : Springer

关键词： amsterdam, computation computer software conference, conferences system analysis

来源：评论

学校读者我要写书评

暂无评论

A theory of Slicing for Probabilistic Control Flow Graphs 19th

A Theory of Slicing for Probabilistic Control Flow Graphs

引用

19th 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)

作者： Amtoft, Torben Banerjee, Anindya Kansas State Univ Manhattan KS 66506 USA IMDEA Software Inst Madrid Spain

ISBN: (纸本)9783662496305;9783662496299

We present a theory for slicing probabilistic imperative programs-containing random assignment and "observe" statements-represented as control flow graphs whose nodes transform probability distributions. We show that such a representation allows direct adaptation of standard machinery such as data and control dependence, postdominators, relevant variables, etc. to the probabilistic setting. We separate the specification of slicing from its implementation: first we develop syntactic conditions that a slice must satisfy;next we prove that any such slice is semantically correct;finally we give an algorithm to compute the least slice. A key feature of our syntactic conditions is that they involve two disjoint slices such that the variables of one slice are probabilistically independent of the variables of the other. this leads directly to a proof of correctness of probabilistic slicing.

关键词： Syntactics

来源：评论

学校读者我要写书评

暂无评论

Shortest Paths in One-Counter Systems 19th

Shortest Paths in One-Counter Systems

引用

19th 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)

作者： Chistikov, Dmitry Czerwinski, Wojciech Hofman, Piotr Pilipczuk, Michal Wehar, Michael Max Planck Inst Software Syst MPI SWS Kaiserslautern Germany Max Planck Inst Software Syst MPI SWS Saarbrucken Germany Univ Warsaw Inst Informat Warsaw Poland ENS Cachan LSV Paris France CNRS Paris France Univ Buffalo Dept Comp Sci & Engn Buffalo NY USA

ISBN: (纸本)9783662496305;9783662496299

We show that any one-counter automaton with n states, if its language is non-empty, accepts some word of length at most O(n(2)). this closes the gap between the previously known upper bound of O(n(3)) and lower bound of Omega(n(2)). More generally, we prove a tight upper bound on the length of shortest paths between arbitrary configurations in one-counter transition systems (weaker bounds have previously appeared in the literature).

关键词： Graph theory

来源：评论

学校读者我要写书评

暂无评论

On Freeze LTL with Ordered Attributes 19th

On Freeze LTL with Ordered Attributes

引用

19th 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)

作者： Decker, Normann thoma, Daniel Univ Lubeck Inst Software Engn & Programming Languages Lubeck Germany

ISBN: (纸本)9783662496305;9783662496299

this paper is concerned with Freeze LTL, a temporal logic on data words with registers. In a (multi-attributed) data word each position carries a letter from a finite alphabet and assigns a data value to a fixed, finite set of attributes. the satisfiability problem of Freeze LTL is undecidable if more than one register is available or tuples of data values can be stored and compared arbitrarily. Starting from the decidable one-register fragment we propose an extension that allows for specifying a dependency relation on attributes. this restricts in a flexible way how collections of attribute values can be stored and compared. this conceptual dimension is orthogonal to the number of registers or the available temporal operators. the extension is strict. Admitting arbitrary dependency relations, satisfiability becomes undecidable. Tree-like relations, however, induce a family of decidable fragments escalating the ordinal-indexed hierarchy of fast-growing complexity classes, a recently introduced framework for non-primitive recursive complexities. this results in completeness for the class F is an element of(0). We employ nested counter systems and show that they relate to the hierarchy in terms of the nesting depth.

关键词： Temporal logic

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：