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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

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

来源：评论

学校读者我要写书评

暂无评论

Improving the Nested Markov Chain Hyper-Heuristic (NMHH) Framework Efficiency through Sequential Probability Ratio Testing

Improving the Nested Markov Chain Hyper-Heuristic (NMHH) Fra...

引用

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

作者： Nándor Bándi Faculty of Mathematics and Computer Science Babeş-Bolyai University Cluj-Napoca Romania

ISBN: (数字)9798331532833

ISBN: (纸本)9798331532840

this paper introduces sequential probability ratio testing to the hyper-heuristic design process. Hyper-heuristics often require many function evaluations to find an acceptable heuristic configuration for the given problem. the reduction of the number of function evaluations is proposed via sequential T-testing. the new approach is compared to two state-of-the-art hyper-heuristics and six metaheuristics on twelve benchmark problems in the continuous domain. the results point to the effectiveness of the new approach.

关键词： scientific computing Metaheuristics Benchmark testing

来源：评论

学校读者我要写书评

暂无评论

Algorithm for Application of Evolution Rules Based on Linear Diofantic Equations

Algorithm for Application of Evolution Rules Based on Linear...

引用

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

作者： Alberto Arteta Luis Fernandez Javier Gil Natural Computing group Universidad Politecnica de Madrid Madrid Spain

Transition P system are a parallel and distributed computational model based on the notion of the cellular membrane structure. Each membrane determines a region that encloses a multiset of objects and evolution rules. Transition P systems evolve through transitions between two consecutive configurations. Moreover, transitions between two consecutive configurations are provided by an exhaustive non-deterministic and parallel application of evolution rules inside each membrane of the P system. Hence, rules application is critical for the whole evolution process efficiency, because it is performed in parallel inside each membrane in each one of the evolution steps. It is known that P systems have a high degree of nondeterminism and parallelism. A transition in such a system consists in applying in parallel a set of atomic actions (e.g., evolution rules) and this set of atomic actions is randomly chosen from a domain of possible next transitions. this paper tries to characterize this domain as the hyperspace defined by a set of diophantine equations and then to develop an algorithm which randomly chooses solutions from this hyperspace. those solutions are uniquely related to the number of times that certain evolution rules are applied. the work presented here includes an algorithm based on resolving linear systems equations and explain into detail the process that the algorithm must follow.

关键词： Equations Evolution (biology) Biomembranes Biology computing Biological system modeling Computational modeling Parallel processing Application software Concurrent computing Linear systems

来源：评论

学校读者我要写书评

暂无评论

Combinatorial Optimization 1

引用

丛书名： Lecture Notes in Computer Science

1000年

作者： Ivana Ljubić Francisco Barahona Santanu S. Dey A. Ridha Mahjoub

ISBN: (数字)9783031185304

ISBN: (纸本)9783031185298

this book constitutes thoroughly refereed and revised selected papers from the 7th international symposium on Combinatorial Optimization, ISCO 2022, which was held online during May 18–20, 2022.;the 24 full papers included in this book were carefully reviewed and selected from 50 submissions. they were organized in topical sections as follows: Polyhedra and algorithms; polyhedra and combinatorics; non-linear optimization; game theory; graphs and trees; cutting and packing; applications; and approximation algorithms.

关键词： Discrete Mathematics in Computer Science Computer Communication Networks Algorithm Analysis and Problem Complexity Data Structures numeric computing Artificial Intelligence

来源：评论

学校读者我要写书评

暂无评论

Motorage - Computer vision-based self-sufficient smart parking system

Motorage - Computer vision-based self-sufficient smart parki...

引用

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

作者： Bogdan Budihală Todor Ivașcu Sebastian Ștefănigă Department of Computer Science West University of Timisoara Timisoara Romania

As devices get ever so interconnected, the concept of Smart City is becoming less of a distant aspiration and more of a reality. One major discomfort which is persistent in traditional cities, from the perspective of a vehicle motorist, is the lack of guidance or coordination when in need of a parking space, be it in a shopping center, at the airport, at work or any other overcrowded point of interest. Motorists are frequently presented with little to no adequate information regarding the parking space availability within a parking lot, and in turn end up spending excessive time in hopes of finding an open spot. this work tackles the problem of improving operational efficiency regarding the widely known problem of finding a parking space, through automation and surveillance, in hopes of providing higher quality allocation and management services. We propose a smart parking system centered around environment monitoring with the help of motion sensors and live-feed cameras, as well as efficient parking space management through a reservation system. As a result, the entire process is automated and the end user is kept up to date, with regard to parking space availability, no longer needing to wander around in order to find a vacant spot. Given that the system does not require any human intervention, it efficiently manages the incoming traffic by ensuring all reservation expectations are met, and it does so effortlessly.

关键词： Space vehicles Automation Smart cities scientific computing Surveillance Cameras Airports

来源：评论

学校读者我要写书评

暂无评论

On the bases of Zn lattice

On the bases of Zn lattice

引用

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

作者： Shashank K Mehta Mahesh Sreekumar Rajasree Department of Computer Science and Engineering Indian Institute of Technology Kanpur Kanpur India

the ${\mathbb{Z}^n}$ lattice is the lattice generated by the set of all orthogonal unit integer vectors. Since it has an orthonormal basis, the shortest vector problem and the closest vector problem are easy to solve in this particular lattice. But, these problems are hard to solve when we consider a rotation of ${\mathbb{Z}^n}$ lattice. In-fact, even though it is known that the ${\mathbb{Z}^n}$-isomorphism problem is in NP ∩ Co-NP, we still don’t have an efficient algorithm to solve it. Motivated by the above, in this paper we investigate the properties of the bases of ${\mathbb{Z}^n}$ lattice which are the sets of column/row vectors of unimodular matrices. We show that an integer primitive vector of norm strictly greater than 1 can be extended to a unimodular matrix U such that the remaining vectors have norm strictly smaller than the initial primitive vector. We also show a reduction from SVP in any lattice isomorphic to ${\mathbb{Z}^n}$ to SVP in n − 1 dimensional sublattice of ${\mathbb{Z}^n}$. We define two new classes of lattice bases and show certain results related to ${\mathbb{Z}^n}$ bases. Finally, we study the relation between any solution to Successive Minima Problem and the set of Voronoi relevant vectors and present some bounds related to the compact bases of ${\mathbb{Z}^n}$.

关键词： scientific computing Lattices Zinc

来源：评论

学校读者我要写书评

暂无评论

Algorithm for intersecting symbolic and approximate linear differential varieties

Algorithm for intersecting symbolic and approximate linear d...

引用

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

作者： Siyuan Deng Zahra Mohammadi Gregory Reid Department of Mathematics University of Western Ontario London Canada Department of Mathematics & Statistics University of Guelph Guelph Canada

this article provides algorithms for systems of approximate linear partial differential equations that exploit exact subsystems. Such exact systems have rational function coefficients over $\mathbb{Q}$ and can be reduced to forms (e.g. differential Gröbner bases) by a finite number of differentiations and eliminations using available computer implementations. We will use the rifsimp algorithm in Maple for this purpose. Such algorithms use solvers based on orderings (rankings) of their derivatives, are coordinate dependent, and are prone to instability when applied to approximate input. In contrast, our Geometric Involutive Form algorithm, uses a sequence of geometric differentiations (prolongations) and projections to complete approximate linear systems to geometric involutive form. In particular, it uses numerical linear algebra (especially the SVD) to monitor dimension criteria for termination. However, this latter method can be expensive as the size of the matrices rapidly increases with the number of variables and order of derivatives *** differential systems in applications often have exact subsystems and this motivated us to develop the hybrid method described in this article. the first step of the method is to partition the input into an exact subsystem and an approximate subsystem. the exact subsystem is reduced by using our rifsimp algorithm. the reduced exact subsystem is used to simplify the approximate subsystem. the previous partition, reduction and simplification steps are repeated until no new exact equations are found. then the reduced exact subsystem is used to simplify prolongations of the approximate subsystem. Checking that the jointly prolonged system is geometrically involutive is done by computing dimension criteria of the simplified prolonged approximate system and using the differential Hilbert function of the reduced exact *** algorithm is illustrated by determination of approximate symmetry properties of a gravitati

关键词： Linear systems scientific computing Partial differential equations Symbols Approximation algorithms Mathematical models numerical models

来源：评论

学校读者我要写书评

暂无评论

Level Generation Using ChatGPT: A Case Study on the Science Bird Game

Level Generation Using ChatGPT: A Case Study on the Science ...

引用

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

作者： Julia Garbaruk Jiban Kumar Ray Doina Logofătu Department of Computer Science and Engineering Frankfurt University of Applied Sciences Frankfurt am Main Germany

ISBN: (数字)9798331532833

ISBN: (纸本)9798331532840

the increasing complexity of video games and development costs have necessitated innovative approaches to content creation. Procedural Content Generation (PCG) and AI tools like ChatGPT offer promising solutions. this paper explores the application of ChatGPT in Procedural Level Generation (PLG) for the game “Science Birds”. through a combination of theoretical exploration and practical experiments, we demonstrate how ChatGPT can be leveraged to automate level design, enhancing both efficiency and creativity in game development.

关键词： Video games Procedural generation Costs scientific computing Chatbots Birds Complexity theory Artificial intelligence Creativity

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

A Detailed Survey of Textural Features in Breast Cancer Detection Using Deep Learning

A Detailed Survey of Textural Features in Breast Cancer Dete...

引用

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

作者： Bianca Iacob Faculty of Mathematics and Computer Science University Babes Bolyai Cluj-Napoca Romania

ISBN: (数字)9798331532833

ISBN: (纸本)9798331532840

Early cancer diagnosis is crucial for effective health management. this paper explores various approaches for the early prognostication of breast cancer. We focus on applying textural features and Convolutional Neural Networks (CNNs) to develop a model distinguishing between normal and abnormal classes. Furthermore, the model identifies and differentiates benign tumours from malignant ones within the abnormal cases. Textural features present a viable option for early diagnosis due to their fast computational capabilities and cancer staging.

关键词： Surveys scientific computing Computational modeling Feature extraction Mammography Breast cancer numerical models Convolutional neural networks Medical diagnostic imaging Tumors

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

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

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：