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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

Building customized Named Entity Recognition models for specific process automation tasks

Building customized Named Entity Recognition models for spec...

引用

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

作者： Vasile Ionut Iga Gheorghe Cosmin Silaghi Business Informatics Research Center Babes-Bolyai University Cluj-Napoca Romania

In the context of a project aiming to build human-behaving robots for process automation, named entity recognition (NER) becomes one of the first tasks to solve. this paper presents our experience on building NER models for recognizing specific entities of interest, with the help of the state-of-the-art pre-trained BERT model. Noticing that the model built with the help of a general knowledge dataset scores poor results in retrieving entities specific to our particular use cases, we constructed two datasets tailored for our context and trained BERT-based models on it. We show that properly constructing the specific datasets is sufficient in order to obtain a good entity classification performance, without further increasing the model learning time.

关键词： Training Automation Target recognition scientific computing Computational modeling Buildings Predictive models

来源：评论

学校读者我要写书评

暂无评论

CSPs and Connectedness: P/NP Dichotomy for Idempotent, Right Quasigroups

CSPs and Connectedness: P/NP Dichotomy for Idempotent, Right...

引用

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

作者： Robert W. McGrail James Belk Solomon Garber Japheth Wood Benjamin Fish Reem Kayden Center for Science and Computation Bard College New York Department of Mathematics University of Illinois at Chicago Chicago IL

In the 1990's, Jeavons showed that every finite algebra corresponds to a class of constraint satisfaction problems. Vardi later conjectured that idempotent algebras exhibit P/NP dichotomy: Every non NP-complete algebra in this class must be tractable. Here we discuss how tractability corresponds to connectivity in Cayley graphs. In particular, we show that dichotomy in finite idempotent, right quasi groups follows from a very strong notion of connectivity. Moreover, P/NP membership is first-order axiomatizable in involutory quandles.

关键词： Algebra Polynomials Educational institutions scientific computing Roads Marine animals

来源：评论

学校读者我要写书评

暂无评论

Fault Tolerance Using a Front-End Service for Large Scale Distributed Systems

Fault Tolerance Using a Front-End Service for Large Scale Di...

引用

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

作者： Marieta Nastase Ciprian Dobre Florin Pop Valentin Cristea Faculty of Automatics and Computer Science University Politehnica of Bucharest Romania

In this paper we present a solution to ensuring a high degree of availability and reliability in service-based large scale distributed systems. the proposed architecture is based on a set of replicated services running in a fault-tolerant container and a proxy service able to mask possible faults, completely transparent for a client. the solution not only masks possible faults but also optimizes the access to the distributed services and their replicas using a load-balancing strategy, whilst ensuring a high degree of scalability. the advantages of the proposed architecture were evaluated using a pilot implementation. the obtained results prove that the solution ensures a high degree of availability and reliability for a wide range of service-based distributed systems.

关键词： Fault tolerant systems Large-scale systems Availability Fault tolerance Containers Scalability scientific computing Computer science Computer architecture Instruments

来源：评论

学校读者我要写书评

暂无评论

symbolic Regression with augmented dataset using RuleFit

Symbolic Regression with augmented dataset using RuleFit

引用

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

作者： Fabricio Olivetti de Franca Universidade Federal do ABC Center for Mathematics Computing and Cognition (CMCC) Heuristics and Analysis Laboratory (HAL) Santo Andre Brazil

symbolic Regression models are often associated with transparency and interpretability. the main motivation is their ability to describe nonlinear models balancing accuracy and conciseness. But, in practice, it may generate models that are hard to understand at the same level as opaque models. From another perspective, linear models are guaranteed to be transparent but fail to model nonlinearities and interactions. the algorithm RuleFit uses a tree-based nonlinear model to create meta-features augmenting the dataset, increasing the accuracy of the linear models while maintaining their transparency. In this paper we test whether this augmented dataset can help symbolic Regression models to find more transparent models without reducing the overall accuracy. the results indicate that the augmented models have a slightly better accuracy on a class of benchmarks while keeping the expression size small and closer to a linear model. As a caveat, the models also tend to become closer to a step function which limits the interpretability of the studied phenomena.

关键词： Analytical models scientific computing Benchmark testing Data models

来源：评论

学校读者我要写书评

暂无评论

Challenges in Verifying Arithmetic Circuits Using Computer Algebra

Challenges in Verifying Arithmetic Circuits Using Computer A...

引用

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

作者： Armin Biere Manuel Kauers Daniela Ritirc Johannes Kepler University Linz Linz Austria

ISBN: (纸本)9781538626276

Verifying arithmetic circuits is an important problem which still requires considerable manual effort. For instance multipliers are considered difficult to verify. the currently most effective approach for arithmetic circuit verification uses computer algebra. In this approach the circuit is modeled as a set of pseudo-boolean polynomials and it is checked if the given word-level specification is implied by the circuit polynomials. For this purpose the theory of Gröbner bases is used. In this paper we give a summary of two recent papers on this work. We reword the theory and illustrate the results of these papers by examples. We also present a new technical theorem which allows to rewrite local parts of the Gröbner basis. Rewriting the Gröbner basis has tremendous effect on computation time.

关键词： Logic gates Algebra Integrated circuit modeling Computational modeling Adders scientific computing Manuals

来源：评论

学校读者我要写书评

暂无评论

Branch Differences and Lambert W

Branch Differences and Lambert W

引用

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

作者： D.J. Jeffrey J.E. Jankowski Department of Applied Mathematics The University of Western Ontario London Canada

the Lambert W function possesses branches labelled by an index k. the value of W therefore depends upon the value of its argument z and the value of its branch index. Given two branches, labelled n and m, the branch difference is the difference between the two branches, when both are evaluated at the same argument z. It is shown that elementary inverse functions have trivial branch differences, but Lambert W has nontrivial differences. the inverse sine function has real-valued branch differences for real arguments, and the natural logarithm function has purely imaginary branch differences. the Lambert W function, however, has both real-valued differences and complex-valued differences. Applications and representations of the branch differences of W are given.

关键词： Equations Educational institutions Indexes Presses scientific computing Electronic mail

来源：评论

学校读者我要写书评

暂无评论

Variant Implementations of SCBiCG Method for Linear Equations with Complex Symmetric Matrices

Variant Implementations of SCBiCG Method for Linear Equation...

引用

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

作者： Kuniyoshi Abe Seiji Fujino Economics and Information Gifu Shotoku University Gifu Japan Research Institute for Information Technology Kyushu University Fukuoka Japan

ISBN: (纸本)9781509004621

SCBiCG (Bi-Conjugate Gradient method for Symmetric Complex matrices) has been proposed for solving linear equations with complex symmetric matrices, where coefficients ci need to be set by users in SCBiCG. We have had the numerical results that the residual norms of SCBiCG do not converge when the coefficients ci are real. We therefore design an efficient implementation such that the coefficients ci which are complex are given by a computation. numerical experiments show that the residual norms of our proposed variant with the complex coefficients ci converge slightly faster than those of COCG (Conjugate Orthogonal Conjugate Gradient method) and some implementations of SCBiCG.

关键词： Symmetric matrices Gradient methods Computational efficiency Electronic mail Convergence Transforms scientific computing

来源：评论

学校读者我要写书评

暂无评论

Organic Structures Emerging From Bio-Inspired Graph-Rewriting Automata

Organic Structures Emerging From Bio-Inspired Graph-Rewritin...

引用

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

作者： Paul Cousin Aude Maignan CNRS Grenoble INP LJK Univ. Grenoble Alpes Grenoble France

Graph-Rewriting Automata (GRA) are an extension of Cellular Automata to a dynamic structure using local graph-rewriting rules. this work introduces linear algebra based tools that allow for a practical investigation of their behavior in deeply extended time scales. A natural subset of GRA is explored in different ways thereby demonstrating the benefits of this method. Some elements of the subset were discovered to create chaotic patterns of growth and others to generate organic-looking graph structures. these phenomena suggest a strong relevance of GRA in the modeling natural complex systems. the approach presented here can be easily adapted to a wide range of GRA beyond the chosen subset.

关键词： Adaptation models scientific computing Automata Directed graphs Linear algebra Behavioral sciences Topology

来源：评论

学校读者我要写书评

暂无评论

Proof of Useful Work Based on Matrix Computation

Proof of Useful Work Based on Matrix Computation

引用

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

作者： Cojocaru Dragos Universirty of Alexandru Ioan Cuza Iasi Romania

Due to the inherently wasteful nature of traditional proof of work mechanisms in blockchain networks, researchers are motivated to find alternatives that can make use of the computational power expended in the process. there are a number of such applications, however most of them target very specific problems, and few are proven to work in practice. this paper presents a proof of work mechanism based on matrix computation, serving a much wider range of applications while serving as the consensus mechanism of a blockchain network. I will cover the current research in the proof of useful work area, and focus on Proof of eXercise (PoX), another mechanism based on matrix computation. Proof of Computation (PoC), the consensus mechanism described in this paper, is a redesigned version of PoX. the mechanism is backed by a series of experiments that confirm the functionality of the protocol.

关键词： scientific computing Computational modeling Proof of Work Trustless services Consensus protocol numerical models Load modeling

来源：评论

学校读者我要写书评

暂无评论

Scalable and Fault Tolerant Monitoring of Security Parameters in the Cloud

Scalable and Fault Tolerant Monitoring of Security Parameter...

引用

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

作者： Bogdan-Constantin Irimie Dana Petcu Department of Computer Science West University of Timisoara Romania Institute e-Austria Timisoara Romania

Monitoring cloud resources is an essential part of cloud computing, and although some effort has been made in this direction, monitoring security parameters is still an open issue because of the large number and types of resources available in a multi tenant environment. In this paper we propose a distributed monitoring system that is able to monitor, filter and store security parameters of network hosts. the proposed system is decentralized, fault tolerant and can run scanning jobs in parallel, those three characteristics making it a perfect candidate for monitoring resources in a cloud environment. the proposed monitoring system was validated by a series of tests that demonstrated it's scalability. All the empirical results were analysed and conclusions were formulated based on the observed properties.

关键词： Monitoring Security Cloud computing Computer architecture Fault tolerance Fault tolerant systems Servers

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 33 34 35 36 37 38 39 40 41 42 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：