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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

156 篇 会议
43 册 图书
14 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

146 篇 工学
- 138 篇 计算机科学与技术...
- 100 篇 软件工程
- 13 篇 电气工程
- 13 篇 信息与通信工程
- 10 篇 控制科学与工程
- 5 篇 土木工程
- 3 篇 化学工程与技术
- 2 篇 建筑学
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 材料科学与工程（可...
- 1 篇 测绘科学与技术
- 1 篇 轻工技术与工程
- 1 篇 航空宇航科学与技...
- 1 篇 农业工程
- 1 篇 生物医学工程（可授...
56 篇 理学
- 52 篇 数学
- 6 篇 统计学（可授理学、...
- 4 篇 化学
- 4 篇 生物学
- 3 篇 系统科学
- 1 篇 物理学
- 1 篇 大气科学
- 1 篇 地球物理学
10 篇 管理学
- 9 篇 图书情报与档案管...
2 篇 医学
- 2 篇 基础医学(可授医学...
- 1 篇 临床医学
1 篇 教育学
- 1 篇 教育学
1 篇 文学
- 1 篇 新闻传播学
1 篇 农学
- 1 篇 作物学

主题

22 篇 theory of comput...
22 篇 software enginee...
16 篇 software enginee...
15 篇 logics and meani...
13 篇 mathematical log...
12 篇 programming lang...
11 篇 semantics
10 篇 artificial intel...
10 篇 computation by a...
9 篇 computer softwar...
8 篇 computer system ...
8 篇 programming tech...
8 篇 data structures
8 篇 data structures ...
7 篇 system analysis
6 篇 computer communi...
6 篇 mathematics of c...
5 篇 model checking
5 篇 algorithm analys...
4 篇 discrete mathema...

机构

4 篇 max planck inst ...
3 篇 max planck inst ...
3 篇 univ leicester d...
3 篇 university of ox...
2 篇 department of co...
2 篇 univ sci & tech ...
2 篇 univ london impe...
2 篇 univ bologna dip...
2 篇 cwi dept softwar...
2 篇 univ warwick dep...
2 篇 rwth aachen univ...
2 篇 queen mary univ ...
2 篇 rhein westfal th...
2 篇 tel aviv univ sc...
2 篇 univ oxford dept...
2 篇 imdea software i...
2 篇 the university o...
2 篇 university of ca...
2 篇 univ paris 07 li...
2 篇 univ london quee...

作者

3 篇 zavattaro g
3 篇 uustalu tarmo
3 篇 chistikov dmitry
3 篇 o'hearn p
2 篇 ulidowski irek
2 篇 rabinovich alexa...
2 篇 james worrell
2 篇 busi n
2 篇 sagiv mooly
2 篇 naoki kobayashi
2 篇 anna ingólfsdótt...
2 篇 luca aceto
2 篇 haase christoph
2 篇 furio honsell
2 篇 kurz alexander
2 篇 aceto luca
2 篇 pfenning frank
2 篇 boneva i
2 篇 plump detlef
2 篇 mogens nielsen

语言

204 篇 英文
5 篇 其他
4 篇 中文

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

共 213 条记录，以下是51-60 订阅

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

详细简洁

排序：

3-Dimensional Characteristic of Electric Field and Potential Induced by Internal Charging Effects in Typical PCB 11th

引用

11th international Space conference on Protection of Materials and structures from Space Environment (ICPMSE)

作者： Tang, Xiao-Jin Yi, Zhong Zhang, Chao Liu, Ye-Nan Wang, Zhi-Hao Meng, Li-Fei Huang, Jian-Guo Beijing Inst Spacecraft Environm Engn Beijing Peoples R China Sci & Technol Reliabil & Environm Engn Lab Beijing Peoples R China

ISBN: (纸本)9783319193090;9783319193083

To assess satellite internal charging effects more accurately, a 3-D computation method is developed to study the internal charging problems with realistic geometry and grounding configuration. the method includes two steps: 3-D electron transport simulation and internal electric field computation. the transport simulation is carried out by a self-developed software based on GEANT4. And 3-D internal electric field is calculated through solving a set of electrostatic equations by COMSOL Multiphysics. In this work, the 3-D characteristics of electric field and potential in a typical PCB irradiated by an electron beam through an aluminum shield are demonstrated. this PCB is partially grounded by a rectangular circuit and the electron beam uses the GEO space-like spectrum with flux in the worst case. According to these conditions, the 3-D field and potential distributions in charging stationary state can be computed. Finally, the following conclusions are drawn: distributions of dose and charge deposition rate have remarkable edge effects. Severe distortion of electric field can arise around edges of partial grounding, especially at corners. the degree of field distortion decreases significantly with the increase of the distance from the grounding surface.

关键词： 3-Dimensional simulation Internal charging Internal electric field GEANT4

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Synchronizing Automata over Nested Words 19th

Synchronizing Automata over Nested Words

引用

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 Martyugin, Pavel Shirmohammadi, Mahsa Max Planck Inst Software Syst MPI SWS Kaiserslautern Germany Max Planck Inst Software Syst MPI SWS Saarbrucken Germany Ural Fed Univ Inst Math & Comp Sci Ekaterinburg Russia Univ Oxford Oxford England

ISBN: (纸本)9783662496305;9783662496299

We extend the concept of a synchronizing word from deterministic finite-state automata (DFA) to nested word automata (NWA): A well-matched nested word is called synchronizing if it resets the control state of any configuration, i.e., takes the NWA from all control states to a single control state. We show that although the shortest synchronizing word for an NWA, if it exists, can be (at most) exponential in the size of the NWA, the existence of such a word can still be decided in polynomial time. As our main contribution, we show that deciding the existence of a short synchronizing word (of at most given length) becomes PSPACE-complete (as opposed to NP-complete for DFA). the upper bound makes a connection to pebble games and Strahler numbers, and the lower bound goes via small-cost synchronizing words for DFA, an intermediate problem that we also show PSPACE-complete. We also characterize the complexity of a number of related problems, using the observation that the intersection nonemptiness problem for NWA is EXP-complete.

关键词： Polynomial approximation

来源：评论

学校读者我要写书评

暂无评论

Measuring Code Behavioral Similarity for Programming and software Engineering Education 16

Measuring Code Behavioral Similarity for Programming and Sof...

引用

38th IEEE/ACM international conference on software Engineering Companion (ICSE)

作者： Li, Sihan Xiao, Xusheng Bassett, Blake Xie, Tao Tillmann, Nikolai Univ Illinois Champaign IL 61820 USA NEC Labs Amer Princeton NJ USA Microsoft Res One Microsoft Way Redmond WA USA

ISBN: (纸本)9781450342056

In recent years, online programming and software engineering education via information technology has gained a lot of popularity. Typically, popular courses often have hundreds or thousands of students but only a few course staff members. Tool automation is needed to maintain the quality of education. In this paper, we envision that the capability of quantifying behavioral similarity between programs is helpful for teaching and learning programming and software engineering, and propose three metrics that approximate the computation of behavioral similarity. Specifically, we leverage random testing and dynamic symbolic execution (DSE) to generate test inputs, and run programs on these test inputs to compute metric values of the behavioral similarity. We evaluate our metrics on three real-world data sets from the PEX4FUN platform (which so far has accumulated more than 1.7 million game-play interactions). the results show that our metrics provide highly accurate approximation to the behavioral similarity. We also demonstrate a number of practical applications of our metrics including hint generation, progress indication, and automatic grading.

关键词： Measurement software engineering Programming profession Education Testing Automation

来源：评论

学校读者我要写书评

暂无评论

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

Foundations of Software Science and Computation Structures -...

引用

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

ISBN: (纸本)9783642370748

the proceedings contain 28 papers. the topics discussed include: pattern graphs and rule-based models: the semantics of kappa;history-register automata;fatal attractors in parity games;bounded context-switching and reentrant locking;reachability of communicating timed processes;modular bisimulation theory for computations and values;checking bisimilarity for attributed graph transformation;checking bisimilarity for attributed graph transformation;preorders on monads and coalgebraic simulations;a proof system for compositional verification of probabilistic concurrent processes;partiality and recursion in higher-order logic;some sahlqvist completeness results for coalgebraic logics;cut elimination in nested sequents for intuitionistic modal logics;on monadic parametricity of second-order functionals;and separation logic for non-local control flow and block scope variables.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：