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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

565 篇 会议
7 篇 期刊文献
2 册 图书

馆藏范围

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

日期分布

学科分类号

176 篇 工学
- 173 篇 计算机科学与技术...
- 108 篇 电气工程
- 28 篇 软件工程
- 5 篇 控制科学与工程
- 4 篇 信息与通信工程
- 1 篇 力学（可授工学、理...
- 1 篇 材料科学与工程（可...
- 1 篇 电子科学与技术（可...
59 篇 理学
- 59 篇 数学
- 2 篇 物理学
- 2 篇 系统科学
- 2 篇 统计学（可授理学、...
19 篇 经济学
- 18 篇 理论经济学
- 1 篇 应用经济学
12 篇 管理学
- 8 篇 管理科学与工程(可...
- 7 篇 工商管理
- 4 篇 图书情报与档案管...
1 篇 法学
- 1 篇 社会学

主题

290 篇 scientific compu...
91 篇 computer science
64 篇 cloud computing
51 篇 computational mo...
36 篇 polynomials
34 篇 algorithm design...
28 篇 algebra
27 篇 computer archite...
25 篇 mathematics
25 篇 testing
22 篇 software algorit...
22 篇 complexity theor...
21 篇 electronic mail
20 篇 monitoring
20 篇 standards
19 篇 grid computing
19 篇 semantics
18 篇 application soft...
18 篇 distributed comp...
17 篇 concurrent compu...

机构

10 篇 research institu...
8 篇 tech univ cluj n...
7 篇 department of co...
7 篇 faculty of infor...
6 篇 faculty of mathe...
6 篇 department of co...
6 篇 faculty of compu...
5 篇 department of co...
5 篇 department of co...
5 篇 computer science...
4 篇 department of co...
4 篇 nicolaus coperni...
4 篇 research institu...
4 篇 institute e-aust...
4 篇 department of co...
4 篇 romanian acad in...
4 篇 computer science...
4 篇 faculty of autom...
3 篇 department of co...
3 篇 department of co...

作者

9 篇 gabriel ciobanu
8 篇 adina magda flor...
7 篇 petcu dana
7 篇 james h. davenpo...
7 篇 jebelean tudor
7 篇 eneia nicolae to...
7 篇 nebojsa bacanin
7 篇 tudor jebelean
6 篇 catalin stoean
6 篇 ciobanu gabriel
6 篇 nicolae tapus
6 篇 valentin cristea
5 篇 mugurel ionut an...
5 篇 dorel lucanu
5 篇 ardagna danilo
5 篇 ciprian dobre
5 篇 ruxandra stoean
5 篇 stephen m. watt
5 篇 florin pop
5 篇 simson daniel

语言

574 篇 英文

检索条件"任意字段=7th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"

共 574 条记录，以下是531-540 订阅

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

详细简洁

排序：

Handling Abort Commands for Kitchen Robots

Handling Abort Commands for Kitchen Robots

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Darius Has Adrian Groza Mihai Pomarlan Department of Computer Science Technical University of Cluj-Napoca Romania Department of Applied Linguistics University of Bremen Germany

ISBN: (数字)9798331532833

ISBN: (纸本)9798331532840

We propose a solution for handling robot abort commands, illustrated by a real-world scenario involving household kitchen robots. the robot uses planning to find sequences of actions that must be performed in order to gracefully cancel a previously received command. the Planning Domain Definition Language (PDDL) is used to write a domain to model kitchen activities and behaviours, and this domain is enriched with knowledge from online ontologies and knowledge graphs, like DBPedia. We discuss the results obtained in different scenarios.

关键词： Translation Costs scientific computing Knowledge based systems Knowledge graphs Ontologies Planning Robots Commonsense reasoning

来源：评论

学校读者我要写书评

暂无评论

On Projective Delineability

On Projective Delineability

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Lucas Michel Jasper Nalbach Pierre Mathonet Naïm Zénaïdi Christopher W. Brown Erika Ábraham James H. Davenport Matthew England University of Liège RWTH Aachen University United States Naval Academy University of Bath Coventry University

We consider cylindrical algebraic decomposition (CAD) and the key concept of delineability which underpins CAD theory. We introduce the novel concept of projective delineability which is easier to guarantee computatio... 详细信息

ISBN: (数字)9798331532833

ISBN: (纸本)9798331532840

关键词： scientific computing

来源：评论

学校读者我要写书评

暂无评论

Multi-Domain Logic and its Applications to SAT

Multi-Domain Logic and its Applications to SAT

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Tudor Jebelean Gabor Kusper RISC Linz Austria Eszterházy Károly College Hungary

We describe a new formalism and special proof methods for a novel generalization of propositional logic, which is especially suitable for solving the satisfiability problem (SAT). A multi-domain logic (MDL) formula is quantifier-free and contains only atoms of the form x isin A, where x is a variable and A is a constant set. For formulae in conjunctive normal form, we are interested in finding solutions (assignments to variables which satisfy all clauses). Classical propositional logic corresponds to the special case when each set is either {T} or {F}. the union of all the sets occurring for a certain variable can be seen as rdquothe domainrdquo of that variable, thus MDL is also a generalization of multi-valued logic, but with different domains for variables. the most distinctive feature is, however, the indication of the sub-domain in each clause. the notions of resolution, subsumption, as well as the basic steps of the DPLL method generalize in an elegant and straightforward way. As a novel MDL specific technique, variable clustering consists in creating a new variable ranging over the cartesian product of the domains of several rdquoclusteredrdquo variables. this allows the transformation of classical SAT problems in MDL problems with less literals, and in which the propagation of information can be performed more efficiently than classical unit propagation. the basic idea of MDL originates from the earlier work of the second author on rdquohyper-unitrdquo propagation (that is simultaneous propagation of several unit clauses) and on the representation and propagation of rdquok-literalsrdquo (generalized literals containing information on several propositional variables). Preliminary experiments with a prototype Java implementation exhibit speed-ups of up to 30 times.

关键词： scientific computing Reduced instruction set computing Educational institutions Multivalued logic Prototypes Java Boolean functions

来源：评论

学校读者我要写书评

暂无评论

Subdivision and Schröder's Polynomial Root-Finders Combined

Subdivision and Schröder's Polynomial Root-Finders Combined

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Victor Y. Pan Department of Computer Science Lehman College of the City University of New York Bronx NY USA Ph.D. Programs in Mathematics and Computer Science The Graduate Center of the City University of New York New York NY USA

ISBN: (数字)9798331532833

ISBN: (纸本)9798331532840

Our root-finder at ACM-SIAM SODA 2024 accelerates classical subdivision iterations for approximation of all zeros of a polynomial as well as all its zeros lying in a fixed Region of Interest in the complex plane. the root-finder enhances the power of subdivision classical iterations and promises to compete for user's choice. At SODA 2024 we proved that that root-finder is near-optimal in some detail, except for its stage of near-maximal compression of a complex disc without losing its roots. Here we complete the proof and also propose to simplify that stage empirically by means of incorporation of Schröder's iterations.

关键词： scientific computing Polynomials Classification algorithms

来源：评论

学校读者我要写书评

暂无评论

the Impact of Convolutional Neural Network Parameters in the Binary Classification of Mammograms

The Impact of Convolutional Neural Network Parameters in the...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Mădălina Dicu Laura Dioşan Anca Andreica Camelia Chira Alin Cordoş Faculty of Mathematics and Computer Science Babeş-Bolyai University Cluj-Napoca Romania PIXELDATA Cluj-Napoca Romania

Breast cancer is the most commonly diagnosed type of cancer. It is essential to classify patients as quickly as possible into groups with a high or low risk of cancer, to provide adequate treatment. this paper aims to address the impact of the parameters of convolutional neural networks in the binary classification of mammograms. In this paper, we treat two types of binary classification, namely: classification between normal and abnormal tissues, respectively classification between benign and malignant tumors. In the analysis, we investigate the correlation and impact of batch size and learning rate in increasing the performance of the proposed model. Following the experiments on the MIAS dataset, we concluded that for the treated problems, it is appropriate to choose a learning rate lower than 0.001. For the classification of tissues (normal/abnormal), we obtained the fact that training the model on a batch size of 32 brings the best results, namely an accuracy of 0.67, and for the classification of tumors (benign/malignant), it is more appropriate to use a batch size of 8, for which we obtained an accuracy of 0.63. For the best results configurations, we continued the experiments by investigating the impact of data augmentation. We have increased the number of training data by applying horizontal flip and rotation operations. Following these attempts, we noticed an improvement only for the tissue classification, for which we obtained an accuracy of 0.70.

关键词： Training Correlation scientific computing Malignant tumors Neural networks Training data Mammography

来源：评论

学校读者我要写书评

暂无评论

Fostering Agentic Play Between Technology and Democracy

Fostering Agentic Play Between Technology and Democracy

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Jennifer Edmond Eleonora Lima César García Martínez Trinity College Dublin Dublin Ireland Fundacíon Cibervoluntarios Madrid Spain

ISBN: (数字)9798331532833

ISBN: (纸本)9798331532840

the Knowledge Technologies for Democracy (KT4D) project seeks to produce new mechanisms to support the protection of human agency in the context of tensions between democracy and emerging technologies. Addressing this challenge from the perspectives of education, regulation and innovation, the project has chosen to deliver a number of its interventions through the paradigm of serious games. the place of agency in gaming is contested, however, leading the project to weave multiple mechanisms to foster agency as a collective process across its approaches to critical digital literacy, narrative and co-creation.

关键词： Performance evaluation Technological innovation scientific computing Social sciences Software Regulation Serious games Cultural differences Artificial intelligence Protection

来源：评论

学校读者我要写书评

暂无评论

A Hierarchy of Tractable Subclasses for SAT and Counting SAT Problems

A Hierarchy of Tractable Subclasses for SAT and Counting SAT...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Stefan Andrei Gheorghe Grigoras Martin Rinard Roland Hock Chuan Yap Department of Computer Science Lamar University Beaumont USA Department of Computer Science Cuza University of Iaşi Romania Massachusetts Institute of Technology Cambridge USA National University of Singapore Singapore

Finding subclasses of formulae for which the SAT problem can be solved in polynomial time has been an important problem in computer science. We present a new hierarchy of propositional formulæ subclasses for which the SAT and counting SAT problems can be solved in polynomial time. Our tractable subclasses are those propositional formulae in conjunctive normal form where any set of k + 1 clauses are related, i.e., there exists at least one literal in one clause that appears negated in another clause of the considered set of k + 1 clauses. We say this subclass of formulæ is of rank k and it is different from previously known subclasses that are solvable in polynomial time. this is an improvement over the SAT Dichotomy theorem and the counting SAT Dichotomy theorem, since our subclass can be moved out from the ¿P-complete class to the P class. the membership problem for this new subclass can be solved in O(n·l k+1 ), where n, l and k are the number of variables, clauses and the rank (1 ¿ k ¿ l - 1), respectively. We give an efficient algorithm to approximate the number of assignments for any arbitrary conjunctive normal form propositional formula by an upper bound.

关键词： Polynomials Computer science NP-complete problem scientific computing Upper bound Application software Real time systems Embedded system Artificial intelligence Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Simple Relation between the Lowest-Order Element of Ideal 〈G,H〉 and the Last Element of Polynomial Remainder Sequence

Simple Relation between the Lowest-Order Element of Ideal 〈...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Tateaki Sasaki Daiju Inaba Professor emeritus University of Tsukuba Ibaraki Japan The Mathematics Certification Institute of Japan Tokyo Japan

ISBN: (纸本)9781538626276

Let G and H be relatively prime polynomials in K[x,u], where K is a number field and (u) = (u 1 , . . . , u ℓ ), with ℓ ≥ 2. Let GB(G,H) be the reduced Gröbner basis of ideal hG,Hi, w.r.t. the elimination order for x. Let r̂ be the lowest-order element of GB(G,H), and Ã, B ∈ K[x,u] be the cofactors of r̂: ÃG+ e BH = r̂. Let PRS(G,H) be the polynomial remainder sequence w.r.t. x, with initial polynomials G and H. Let Pk ∈ K[u] be the last element of PRS(G,H), and A k , B k ∈ K[x,u] be cofactors of P k : A k G + B k H = P k . Ak and B k satisfy degree conditions: deg x (Ak) x(H) and deg x (B k ) x(G), while e Ã and B in general do not. computing Â and B by reducing the degrees w.r.t. x, of Ã and B, respectively, and by normalizing Pk suitably, we show that (P k ,A k ,B k ) = c ( r̂, Â, B), where (P,A,B) denotes a tuple and c ∈ K. We then present a new method for solving the multivariate Diophantine equation φ G + ψH = F for given F ∈ K[x,u] and unknowns φ , ψ ∈ K(u)[x]. Furthermore, we show a new method for solving the ideal-membership problem for 〈G,H〉, without computing any Gröbner basis.

关键词： scientific computing Algebra Mathematical model Complexity theory Computational modeling Analytical models

来源：评论

学校读者我要写书评

暂无评论

Finding Loop Invariants for Programs over Arrays Using a theorem Prover

Finding Loop Invariants for Programs over Arrays Using a The...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Laura Kovacs Andrei Voronkov ETH Zürich Switzerland University of Manchester Institute of Science and Technology UK

Invariants with quantifiers are important for verification and static analysis of programs over arrays due to the unbounded nature of arrays. Such invariants can express relationships among array elements and properties involving array and scalar variables of the loop. this talk presents how quantified loop invariants of programs over arrays can be automatically inferred using a first order theorem prover, reducing the burden of annotating loops with complete invariants. Unlike all previously known methods, our method is able to generate loop invariants containing quantifier alternations. the method is based on the following steps. (1) Given a loop over array and scalar variables, we first try to extract from it various information that can be expressed by first-order formulas. For example, these formulas can express the values of loop variables in terms of the loop counter, monotonicity properties of these variables considered as functions of the loop counter and polynomial relations among these variables. For extracting this information we deploy techniques from symbolic computation, such as recurrence solving and quantifier elimination, as presented in, to perform inductive reasoning over scalar variables. (2) Using the derived loop properties, we then automatically discover first-order properties of the so-called update predicates for array variables used in the loop and monotonicity properties for scalar variables. the update predicates describe the positions at which arrays are updated, iterations at which the updates occur and the update values. the first-order information extracted from the loop description can use auxiliary symbols, such as symbols denoting update predicates or loop counters. By relying on the update predicates of arrays and the monotonicity properties of scalars, we avoid inductive reasoning over arrays. (3) After having collected the first-order information, we run a saturation theorem prover to eliminate the auxiliary symbols and obtain

关键词： Data mining Counting circuits Packaging scientific computing Algorithm design and analysis Polynomials Reduced instruction set computing Contracts Arithmetic Artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

A Comparison of Open-Source Static Analysis Tools for Vulnerability Detection in C/C++ Code

A Comparison of Open-Source Static Analysis Tools for Vulner...

引用

international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)

作者： Andrei Arusoaie Stefan Ciobâca Vlad Craciun Dragos Gavrilut Dorel Lucanu Faculty of Computer Science Alexandru Ioan Cuza University Iaşi Bitdefender Iaşi

ISBN: (纸本)9781538626276

We describe work that is part of a research project on static code analysis between the Alexandru Ioan Cuza University and Bitdefender. the goal of the project is to develop customized static analysis tools for detecting potential vulnerabilities in C/C++ code. We present the results of benchmarking several existing open source static analysis tools for C/C++ against the Toyota ITC test suite [1] in order to determine which tools are best suited to our purpose. the Toyota ITC test suite is a synthetic benchmark for C/C++ consisting of around 650 test cases organized by defect type and defect subtype and is well-suited to our purpose, since it contains various bugs such as buffer overflows that are common in C/C++ code. We analyze the open-source static analysis tools according to the existing quality indicators such as detection rate and false positive rate proposed in [1], but we also introduce a new quality metric that we call robust detection which also allows us to measure unique detections by tool and by (sub)defect type. We also find several mistakes in the Toyota ITC testsuite that we fix. We publish the harness used to benchmark the static analyzers in order for anyone to be able to reproduce our results.

关键词： Tools Static analysis Memory management Computer bugs Resource management Concurrent computing Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 49 50 51 52 53 54 55 56 57 58 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：