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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

559 篇 会议
7 篇 期刊文献
5 册 图书

馆藏范围

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

日期分布

学科分类号

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

主题

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

机构

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

语言

571 篇 英文

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

共 571 条记录，以下是271-280 订阅

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

详细简洁

排序：

Deciding Whether two Codes Have the Same Ambiguities is in co-NP

Deciding Whether two Codes Have the Same Ambiguities is in c...

引用

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

作者： Yannick Chevalier Michael Rusinowitch IRIT Université de Toulouse Toulouse France LORIA Inria Nancy Grand Est Vandoeuvre-lès-Nancy France

We define a code to be a finite set of words C on a finite alphabet, and an ambiguity to be an equality between two words in the monoid C * . We recall that a code is uniquely decipherable if its ambiguities are trivial. In this paper we construct a finite-turn deterministic pushdown automaton that recognizes the set of ambiguities of a code. this allows one to show that whether two codes of the same size have the same ambiguities is in co-NP.

关键词： Codes scientific computing Automata Complexity theory Cryptographic protocols

来源：评论

学校读者我要写书评

暂无评论

A Depth-first Algorithm to Reduce Graphs in Linear Time

A Depth-first Algorithm to Reduce Graphs in Linear Time

引用

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

作者： Miklos Bartha Miklos Kresz Department of Computer Science Memorial University of Newfoundland Saint John's NB Canada Faculty of Education University of Szeged Szeged Hungary

A redex in a graph G is a triple r = (u, c, v) of distinct vertices that determine a 2-star. Shrinking r means deleting the center c and merging u with v into one vertex. Reduction of G entails shrinking all of its redexes in a recursive way, and, at the same time, deleting all loops that are created during this process. It is shown that reduction can be implemented in O(m) time, where m is the number of edges in G.

关键词： Solitons Automata scientific computing Computer science Computer science education Merging Tree graphs Gain

来源：评论

学校读者我要写书评

暂无评论

Semi-Supervised Pipeline for Human Sprites Neural Rendering

Semi-Supervised Pipeline for Human Sprites Neural Rendering

引用

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

作者： Alexandru Ionascu Sebastian Stefaniga Department of Computer Science West University of Timisoara Timisoara Romania

In this paper we are discussing the possibility of a hybrid approach in renderable scenes. the main idea of the presented experiment is to render the human actors by using existing videos of the characters. the input video is first converted to a sprite dataset. the dataset is generated with supervised techniques but human intervention is also required. After that we extract body and pose parameters. Lastly, we render novel poses using a GAN-based approach similar to pix2pix.

关键词： Image segmentation Image resolution scientific computing Pipelines Pose estimation Rendering (computer graphics) Hardware

来源：评论

学校读者我要写书评

暂无评论

m-Hilbert Polynomial and Arbitrariness of the General Solution of Partial Differential Equations

m-Hilbert Polynomial and Arbitrariness of the General Soluti...

引用

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

作者： Qi Ding Hongqing Zhang School of Mathematical Science Dalian University of Technology Dalian China

Using the framework of formal theory of partial differential equations, we consider a method of computation of the m-Hilbert polynomial (i.e. Hilbert polynomial with multivariable), which generalizes the Seiler's theorem of Hilbert polynomial with single variable. Next we present an approach to compute the number of arbitrary functions of positive differential order in the general solution, and give a formally well-posed initial problem. Finally,as applications the Maxwell equations and weakly over determined equations are considered.

关键词： Polynomials Partial differential equations Differential equations Maxwell equations scientific computing Hilbert space Algebra Physics

来源：评论

学校读者我要写书评

暂无评论

Graph Rewriting in Computational Origami

Graph Rewriting in Computational Origami

引用

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

作者： Tetsuo Ida Department of Computer Science University of Tsukuba Tsukuba Japan

We give graph-theoretic formalization of origami, the art of paper folding. Starting from the abstract origami system, we model origami construction as are write sequence of abstract origami's. To reason about the entire origami construction for the computational purposes, we define a labeled hypergraph for origami and give the abstraction of origami fold as a set of algebraic graph rewrite rules. We give detailed description of the fold operation in terms of graph rewriting. the graph-theoretic formalism enables us to reason in two separate domains of discourse, i.e. pure combinatoric domain and geometrical domain R 2 .

关键词： Solid modeling scientific computing Computer science Art Combinatorial mathematics Bridges

来源：评论

学校读者我要写书评

暂无评论

Approximating and Combining Equilibria in Non-cooperative Games

Approximating and Combining Equilibria in Non-cooperative Ga...

引用

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

作者： D. Dumitrescu Rodica Ioana Lung Tudor Dan Mihoc Babeş-Bolyai University Cluj-Napoca Romania

Generative relations for different equilibria types in finite non cooperative games are proposed. these relations induce appropriate domination concepts. Using an evolutionary technique approximations for different equilibria are computed. the concept of game is extended in order to allow players to have different types of rationality. the new game allows us to combine different equilibria. numerical experiments indicate the potential of the proposed concepts and technique and offers an inside view of the implication of the rationality in the solution concept.

关键词： Game theory Nash equilibrium scientific computing Lungs

来源：评论

学校读者我要写书评

暂无评论

Abstract Matrix Arithmetic

Abstract Matrix Arithmetic

引用

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

作者： Alan P. Sexton Volker Sorge Stephen M. Watt University of Binningham Birmingham UK University of Western Ontario London Canada

We present an approach to basic arithmetic between abstract matrices, i.e., matrices of symbolic dimension with underspecified components. We define a simple basis function that enables the representation of abstract matrices composed of arbitrary regions in a single term that supports matrix addition and multiplication by regular arithmetic on terms. this can, in particular, be exploited to obtain general arithmetic closure properties for classes of structured matrices. We also describe an approach using alternative basis functions that allow more compact expressions and admit additional arithmetic simplifications.

关键词： Arithmetic scientific computing Genetic expression Concrete Bismuth Reduced instruction set computing Europe Polynomials

来源：评论

学校读者我要写书评

暂无评论

An Overview of Monitoring Tools for Big Data and Cloud Applications

An Overview of Monitoring Tools for Big Data and Cloud Appli...

引用

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

作者： Gabriel Iuhasz Ioan Dragan Institute e-Austria Timisoara Romania University of Medicine and Pharmacy and Institute e-Austria Timisoara Timisoara Romania

this paper makes a short overview of current state of the art monitoring tools for cloud and big data frameworks. In order to effectively create, test and deploy new algorithms or frameworks one needs suitable monitoring solutions. Hence we aim on creating a critical overview for some of the monitoring solutions existing on the market. Also we present relevant metrics used for monitoring cloud and big data applications, focused mainly on cloud deployment scenarios for big data frameworks.

关键词： Monitoring Cloud computing Big data Measurement Servers Computer architecture Containers

来源：评论

学校读者我要写书评

暂无评论

DL-AgentRecom - A Multi-Agent Based Recommendation System for scientific Documents

DL-AgentRecom - A Multi-Agent Based Recommendation System fo...

引用

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

作者： Horia-Emil Popa Viorel Negru Daniel Pop Ionel Muscalagiu Department of Computer Science West University of Timisoara Timisoara Romania Faculty of Engineering of Hunedoara Polytechnic University of Timisoara Timisoara Romania

the goal is to propose a recommendation system for scientific documents. the paper presents the architecture and the principles of functioning of the system. the way a user organizes its documents is called the user's perspective over the set of documents. Operations with user perspectives are defined, also the system can have and build its own perspective. the users perspective can be mixed with system perspective.

关键词： Collaboration Information filtering Information filters Computer science Navigation scientific computing Computer architecture Search engines Information analysis Image retrieval

来源：评论

学校读者我要写书评

暂无评论

Identifiability for Gauge Regularizations and algorithms for Block-Sparse Synthesis in Compressive Sensing

Identifiability for Gauge Regularizations and Algorithms for...

引用

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

作者： Flavius Turcu Charles Dossal Marc Nicodàme Université de Bordeaux France Communaute d'Universites et Etablissements d'Aquitaine Bordeaux Aquitaine FR

ISBN: (纸本)9781509057085

In the paper we give a characterization of identifiability for regularizations with gauges of compact convexes. this extends the classic identifiability results from the standard l 1 -regularization framework in compressive sensing. We show that the standard dual certificate techniques can no longer work by themselves ouside the polytope case. We then apply the general characterization to the caseof block-sparse regularizations and obtain an identification algorithm based on a combination of the standard duality and a convex-projection technique.

关键词： Compressed sensing Standards Lattices Context scientific computing Data models Linear systems

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 24 25 26 27 28 29 30 31 32 33 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：