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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

499 篇 会议
13 篇 期刊文献
7 册 图书

馆藏范围

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

日期分布

学科分类号

328 篇 工学
- 249 篇 计算机科学与技术...
- 176 篇 软件工程
- 95 篇 电气工程
- 37 篇 控制科学与工程
- 21 篇 机械工程
- 19 篇 信息与通信工程
- 14 篇 生物医学工程（可授...
- 14 篇 生物工程
- 10 篇 电子科学与技术（可...
- 8 篇 材料科学与工程（可...
- 6 篇 核科学与技术
- 5 篇 石油与天然气工程
- 4 篇 仪器科学与技术
- 4 篇 交通运输工程
- 2 篇 光学工程
- 2 篇 土木工程
61 篇 理学
- 29 篇 数学
- 14 篇 物理学
- 14 篇 生物学
- 6 篇 系统科学
- 4 篇 统计学（可授理学、...
28 篇 管理学
- 16 篇 管理科学与工程(可...
- 9 篇 图书情报与档案管...
- 5 篇 工商管理
- 3 篇 公共管理
12 篇 农学
- 12 篇 作物学
5 篇 医学
4 篇 法学
- 2 篇 法学
- 2 篇 社会学
3 篇 经济学
- 3 篇 应用经济学
2 篇 教育学
- 2 篇 教育学
1 篇 文学

主题

48 篇 programming
38 篇 logic gates
31 篇 logic programmin...
28 篇 programming prof...
28 篇 software enginee...
25 篇 linear programmi...
23 篇 software
15 篇 computational mo...
14 篇 java
14 篇 logic
14 篇 probabilistic lo...
12 篇 computer program...
11 篇 optimization
11 篇 detectors
11 篇 dynamic programm...
11 篇 testing
10 篇 object oriented ...
10 篇 fuzzy logic
10 篇 parallel program...
10 篇 data models

机构

3 篇 nasa ames resear...
3 篇 george mason uni...
3 篇 carnegie mellon ...
3 篇 stillman school ...
3 篇 imperial coll lo...
2 篇 mayo fdn rochest...
2 篇 iran univ sci & ...
2 篇 univ copenhagen ...
2 篇 chalmers univers...
2 篇 university of fe...
2 篇 school of comput...
2 篇 ludwig maximilia...
2 篇 texas tech unive...
2 篇 tu wien austria
2 篇 graz university ...
2 篇 katholieke univ ...
2 篇 graduate school ...
2 篇 zagazig universi...
2 篇 iran university ...
2 篇 agh university o...

作者

5 篇 toni francesca
4 篇 eiter thomas
4 篇 azzolini damiano
4 篇 gupta gopal
3 篇 hanbong lee
3 篇 gavanelli marco
3 篇 riguzzi fabrizio
3 篇 coblenz michael
3 篇 satoh ken
3 篇 džeroski sašo
2 篇 lucarini stephen
2 篇 thevapalan andre
2 篇 liu yanhong a.
2 篇 m.a. farahat
2 篇 lavrac nada
2 篇 v. kodaganallur
2 篇 rose emma
2 篇 osaka naotoshi
2 篇 radoslaw klimek
2 篇 gebser martin

语言

504 篇 英文
15 篇 其他

检索条件"任意字段=39th International Conference on Logic Programming"

共 519 条记录，以下是141-150 订阅

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

详细简洁

排序：

Problem C: GPU Accelerated logic Re -simulation (Invited Talk) 20

Problem C: GPU Accelerated Logic Re -simulation (Invited Tal...

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Zhang, Yanqing Ren, Haoxing Keller, Ben Khailany, Brucek NVIDIA Corp Santa Clara CA 95051 USA

ISBN: (纸本)9781665423243

logic "re" -simulation can be defined as gate level simulation where the input waveforms at every primary input and pseudo primary input (such as register/RAM outputs) are known. Such waveforms could come from the unit's RTL simulation trace or Automatic Test Pattern Generation (ATPG) vectors. this type of simulation is useful in doing functional verification on gate level netlists and power analysis, since we can take the known trace on all primary and pseudo -primary inputs, re -simulate the trace using propagation of signals through timing-aware gate -level combinational logic, and verify that results at the primary and pseudo-primary outputs match the reference RTL simulation results. However, gate level simulation is usually much slower than RTL simulation. thus, there is motivation for faster solutions. In this contest, we ask contestants to use Graphic Processing Units (GPUs) to speedup the re-simulation task.

关键词： Graphics processing unit

来源：评论

学校读者我要写书评

暂无评论

From language access to language justice: Creating a participatory values statement for collective action 21

From language access to language justice: Creating a partici...

引用

39th ACM international conference on the Design of Communication: Building Coalitions. Worldwide, SIGDOC 2021

作者： Cardinal, Alison Rose, Emma Gonzales, Laura Bhattacharya, Anindita Byram, Luke Coble, Kenny Gamboa, Perla Parra, Diana Pritchard, Faaluaina Rodriguez Paz, Elsie Liao, Peggy Snow, Megan Safarova, Bara Yerena, Anaid University of Washington Tacoma United States University of Florida United States Tacoma Area Commission on Disabilities United States City of Tacoma United States Washington Department of Labor and Industries United States Tacoma Community House United States Asia Pacific Cultural Center United States Providence Health and Services United States None Provided United States

ISBN: (纸本)9781450386289

In this experience report, we describe the work of a coalition of community experts and academics who are collaborating to work towards language justice for communities who speak languages other than English in the Puget Sound region. To illustrate this effort, we describe our experience designing a customizable values statement through participatory design. this values statement can be modified and used in government agencies and organizations to help orient language access plans, programs, and processes towards language justice. We begin by defining language justice and describe how this orientation defines the coalition's overall goals. We then outline the participatory design methods we used to collaboratively iterate three versions of the values statement. First, we describe the workshop we conducted to collectively identify the barriers to language access in the region. Based on these critiques, we decided to design a values statement as a concrete deliverable that could work towards language justice via organizational change. To illustrate the process, we show the four iterations and describe four pivotal moments in the design process that led to significant revisions. these include the need to create a statement highlighting language justice instead of language access;the need to revise the values statement to be organizationally effective for its audience;the need to invite a disability expert to create an inclusive statement;and the need to draw attention to the intersectionality of oppression. Finally, we reflect the impact of the statement in the region and speculate about its future use. © 2021 ACM.

关键词： Computer programming

来源：评论

学校读者我要写书评

暂无评论

A GENERIC ALLOCATION ALGORIthM FOR OPTIMAL 6DOF MOTION CONTROL INCLUDING INTERACTION EFFECTS AND PHYSICAL LIMITATIONS 39

A GENERIC ALLOCATION ALGORITHM FOR OPTIMAL 6DOF MOTION CONTR...

引用

ASME 39th international conference on Ocean, Offshore and Arctic Engineering (OMAE)

作者： van Daalen, Ed Maritime Res Inst Netherlands POB 28 NL-6700 AA Wageningen Netherlands

ISBN: (纸本)9780791884317

In this paper we consider the allocation problem within the context of optimal motion control for floating or submerged bodies. the purpose of our research is to develop an allocation algorithm which allows for (1) multiple bodies with up to six modes for each body, (2) arbitrary actuator types - azimuthing thrusters, propeller-rudder systems etc., (3) arbitrary objective functions, (4) interaction effects such as forbidden zones, and (5) physical limitations such as saturation. Some ideas presented in [1, 2] were generalised to more widely applicable concepts. Each body has an arbitrary number of actuators, each actuator has an arbitrary number of degrees of freedom. Interaction effects are modelled by means of state-dependent effectivity coefficients. Coupled states, such as propeller thrust and torque, are modelled as linearised constraints. the constrained optimization problem is solved with a combination of Sequential Quadratic programming and Steepest Descent methods. the Python implementation is coupled with MARIN's extensible modelling framework (XMF). We demonstrate the generic allocation algorithm for an underwater vehicle with multiple actuator types, physical limitations and coupled states and for a surface vessel with two propeller-rudder systems and a bow tunnel thruster. the results show that the allocation algorithm is able to handle complex configurations with specific physical limitations and coupled modes while adopting a generic approach.

关键词： Tunnels Motion control Algorithms Actuators Vessels Degrees of freedom Torque thrust Underwater vehicles Modeling Propellers Optimization Quadratic programming

来源：评论

学校读者我要写书评

暂无评论

NONLINEAR OPTIMAL CONTROL OF A DEEP BOREHOLE TRAJECTORY DESIGN 39

NONLINEAR OPTIMAL CONTROL OF A DEEP BOREHOLE TRAJECTORY DESI...

引用

ASME 39th international conference on Ocean, Offshore and Arctic Engineering (OMAE)

作者： Gulyayev, Valery Glazunov, Sergii Andrusenko, Olena Natl Transport Univ Kiev Ukraine

ISBN: (纸本)9780791884317

In modern oil/gas producing industry, vertical, 2D and 3D directed, and multilateral (branched) boreholes are drilled. their trajectories are designed depending on the petroleum deposit depth and structure, properties of mining rocks, their hardness, heterogeneity, fracturing anisotropy, permeability, and so on. therefore, the borehole cost and its productivity are determined by the length, smoothness, and configuration of its trajectory. To enhance efficiency of a borehole and to reduce cost of its drivage, to enlarge rate and volume of the reservoir depletion, it is proposed to use methods of optimal control for the best tracking of its trajectory. through application of the differential geometry correlations, the mathematic model of the borehole outline in the form of nonlinear ordinary differential equations system is elaborated. Different objective functions, representing total integral curvature of the borehole axis line, its length, and cost of its drivage, are selected;additional constraints, separating allowed and forbidden zones of passing, are chosen. the functions of the trajectory curvature and torsion are used as controlling variables. the continuous correlations of the model are discretized and, further, the techniques of nonlinear programming and optimal control are employed. On the basis of the method of objective function gradient (antigradient) projection on the linearized constraint planes, the step-by-step algorithm of approaching to the optimal trajectory is elaborated. To correct the spoilt constraints, at every step of calculations, the Newton method is used. the elaborated approach is applied to optimization of deep curvilinear borehole outlines. the results of numerical analysis are discussed. It is shown that smoothing the hole trajectory permits also to diminish the contact and frictional interaction between the drill string and bore-hole wall and, by this, to decrease the resistance forces acting on the string during tripping in/out oper

关键词： String Permeability Drill strings Numerical analysis Trajectories (Physics) Nonlinear programming Fracture (Process) Reservoirs Differential equations Algorithms Geometry Design Optimal control Wear Mining Probability Rocks Optimization Newton's method Torsion Petroleum Anisotropy

来源：评论

学校读者我要写书评

暂无评论

Modeling Techniques for logic Locking 20

Modeling Techniques for Logic Locking

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Sweeney, Joseph Heule, Marijn J. H. Pileggi, Lawrence Carnegie Mellon Univ Dept Elect & Comp Engn Pittsburgh PA 15213 USA Carnegie Mellon Univ Dept Comp Sci Pittsburgh PA 15213 USA

ISBN: (纸本)9781665423243

logic locking is a method to prevent intellectual property (IP) piracy. However, under a reasonable attack model, SAT-based methods have proven to be powerful in obtaining the secret key. In response, many locking techniques have been developed to specifically resist this form of attack. In this paper, we demonstrate two SAT modeling techniques that can provide many orders of magnitude speed up in discovering the correct key. Specifically, we consider relaxed encodings and symmetry breaking. To demonstrate their impact, we model and attack a state-of-the-art logic locking technique, Full-Lock. We show that circuits previously unbreakable within 15 days of run time can be solved in seconds. Consequently, in assessing the strength of any given locking, it is imperative that these modeling techniques be considered. To remedy this vulnerability in the considered locking technique, we demonstrate an extended version, logic-enhanced Banyan locking, that is resistant to our proposed modeling techniques.

关键词： logic locking IP piracy satisfiability miter-based SAT attack

来源：评论

学校读者我要写书评

暂无评论

QuickWalk: Quick Trust Assessment for Vehicular Social Networks

QuickWalk: Quick Trust Assessment for Vehicular Social Netwo...

引用

39th IEEE international conference on Computer Communications (IEEE INFOCOM)

作者： Shen, Ziyi He, Shuyu Yang, Qing Univ North Texas Dept Comp Sci & Engn Denton TX 76203 USA

ISBN: (纸本)9781728186955

To avoid transmitting untrustworthy information within a vehicular network, we propose a quick trust assessment algorithm, called QuickWalk, to evaluate the trust relation between any pair of vehicles in the network. Leveraging on the trust evaluation results, vehicles will only receive and process information from trustworthy peers. the key of this solution is to construct a vehicular social network (VSN) in which vehicles connect and communicate with each other, in the form of sharing/exchanging information. As such, the trust relation between an information provider and a consumer can be modeled and computed from their social connections. the QuickWalk algorithm is designed based on the three-valued subjective logic trust model, and is able to offer a faster trust evaluation within a VSN. Simulation results not only validate the correctness of the QuickWalk algorithm but also confirm that QuickWalk outperforms the state-of-the-art solution, by offering a smaller execution time while assessing vehicles' trust in a VSN.

关键词： Trust assessment vehicular social network information dissemination subjective logic

来源：评论

学校读者我要写书评

暂无评论

Detecting State Transitions of a Markov Source: Sampling Frequency and Age Trade-off

Detecting State Transitions of a Markov Source: Sampling Fre...

引用

39th IEEE international conference on Computer Communications (IEEE INFOCOM)

作者： Champati, Jaya Prakash Skoglund, Mikael Gross, James KTH Royal Inst Technol EECS Informat Sci & Engn Stockholm Sweden

ISBN: (纸本)9781728186955

We consider a finite-state Discrete-Time Markov Chain (DTMC) source that can be sampled for detecting the events when the DTMC transits to a new state. Our goal is to study the trade-off between sampling frequency and staleness in detecting the events. We argue that, for the problem at hand, using Age of Information (AoI) for quantifying the staleness of a sample is conservative and therefore, introduce age penalty for this purpose. We study two optimization problems: minimize average age penalty subject to an average sampling frequency constraint, and minimize average sampling frequency subject to an average age penalty constraint;both are Constrained Markov Decision Problems. We solve them using linear programming approach and compute Markov policies that are optimal among all causal policies. Our numerical results demonstrate that the computed Markov policies not only outperform optimal periodic sampling policies, but also achieve sampling frequencies close to or lower than that of an optimal clairvoyant (non-causal) sampling policy, if a small age penalty is allowed.

关键词： Linear programming

来源：评论

学校读者我要写书评

暂无评论

NNgSAT: Neural Network guided SAT Attack on logic Locked Complex Structures 20

NNgSAT: Neural Network guided SAT Attack on Logic Locked Com...

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Azar, Kimia Zamiri Kamali, Hadi Mardani Homayoun, Houman Sasan, Avesta George Mason Univ Fairfax VA 22030 USA Univ Calif Davis Davis CA 95616 USA

ISBN: (纸本)9781665423243

the globalization of the IC supply chain has raised many security threats, especially when untrusted parties are involved. this has created a demand for a dependable logic obfuscation solution to combat these threats. Amongst a wide range of threats and countermeasures on logic obfuscation in the 2010s decade, the Boolean satisfiability (SAT) attack, or one of its derivatives, could break almost all state-of-the-art logic obfuscation countermeasures. However, in some cases, particularly when the logic locked circuits contain complex structures, such as big multipliers, large routing networks, or big tree structures, the logic locked circuit is hard-to-be-solved for the SAT attack. Usage of these structures for obfuscation may lead a strong defense, as many SAT solvers fail to handle such complexity. However, in this paper, we propose a neural-network-guided SAT attack (NNgSAT), in which we examine the capability and effectiveness of a message-passing neural network (MPNN) for solving these complex structures (SAT-hard instances). In NNgSAT, after being trained as a classifier to predict SAT/UNSAT on a SAT problem (NN serves as a SAT solver), the neural network is used to guide/help the actual SAT solver for finding the SAT assignment(s). By training NN on conjunctive normal forms (CNFs) corresponded to a dataset of logic locked circuits, as well as fine-tuning the confidence rate of the NN prediction, our experiments show that NNgSAT could solve 93.5% of the logic locked circuits containing complex structures within a reasonable time, while the existing SAT attack cannot proceed the attack flow in them.

关键词： logic Obfuscation Neural Network the SAT Attack

来源：评论

学校读者我要写书评

暂无评论

Information Leakage from FPGA Routing and logic Elements 20

Information Leakage from FPGA Routing and Logic Elements

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Giechaskiel, Ilias Szefer, Jakub Yale Univ New Haven CT USA

ISBN: (纸本)9781665423243

Information leakage in FPGAs poses a danger whenever multiple users share the reconfigurable fabric, for example in multi-tenant Cloud FPGAs, or whenever a potentially malicious IP module is synthesized within a single user's design on an FPGA. In such scenarios, capacitive crosstalk between so-called long routing wires has been previously shown to be a security vulnerability in both Xilinx and Intel FPGAs. Specifically, both static and dynamic values on long wires have been demonstrated to affect the delays of the adjacent long wires, and such delay changes have been exploited to steal sensitive information such as bits of cryptographic keys. While long-wire leakage is now well-understood and can be defended against, this work presents two other, new types of information leaks that pose similar risks, but which have not been studied in the past, and for which existing defenses do not work. First, this paper shows that other types of routing resources (namely medium wires) are also vulnerable to crosstalk, with changes in their delays also measurable fully on-chip. Second, this work introduces a novel source of information leaks that originates from logic elements within the FPGA Configurable logic Blocks (CLBs) and is likely not the result of the capacitive crosstalk effects investigated in prior work. To understand the potential impact of the two new leakage sources, this paper experimentally characterizes and compares them in four families of Xilinx FPGAs, and discusses potential countermeasures in the context of existing attacks and defenses.

关键词： FPGA security information leakage wire leakage routing resources logic resources crosstalk covert channels side channels

来源：评论

学校读者我要写书评

暂无评论

Routability-Aware Pin Access Optimization for Monolithic 3D Designs 39

Routability-Aware Pin Access Optimization for Monolithic 3D ...

引用

39th IEEE/ACM international conference On Computer Aided Design (ICCAD)

作者： Wang, Run-Yi Chang, Yao-Wen Natl Taiwan Univ Grad Inst Elect Engn Taipei 10617 Taiwan Natl Taiwan Univ Dept Elect Engn Taipei 10617 Taiwan

ISBN: (纸本)9781665423243

With the increasing design complexity (especially, the increasing number of design rules), pin access for detailed routing has attracted much attention. Monolithic 3D design (M3D for short) has emerged as a promising technology to alleviate this pin access challenge by providing redundant pins and free routing tracks. this paper addresses the problem of pin access optimization for M3D designs to improve routability during detailed routing. Unlike existing work that uses integer linear programming (ILP) to maximize the total number of pre-routed nets on free routing tracks without considering the influence of a net on pin access congestion, we present new pin access congestion estimation based on the probability of pin access conflicts and a novel weighted ILP formulation. A dynamic programming algorithm is proposed to refine detailed placement to obtain a better initial solution. Experimental results show that our algorithm achieves significant routability improvements.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：