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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

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

详细简洁

排序：

A hardware circuit for selecting active rules in transition P systems

A hardware circuit for selecting active rules in transition ...

引用

7th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2005

作者： Fernández, Luis Martínez, Victor J. Arroyo, Fernando Mingo, Luis F. Departamento de Lenguajes Proyectos y Sistemas Informáticos Escuela Universitaria de Informática Departamento de Arquitectura y Tecnología de Computadores Escuela Universitaria de Informática Departamento de Organización y Estructura de la Information Escuela Universitaria de Informática Natural Computing Group Technical University of Madrid

ISBN: (纸本)0769524532

this paper presents the first step in the design of a hardware circuit implementing evolution inside membranes of a transition P system. the work presented here is part of a very ambitious project: to find and to implement a hardware system, as general as possible, able to simulate P systems evolution. Due to the complexity of this generic system, the process has been divided into several stages. Each one of these stages has concrete objectives. In particular, a circuit able to determine active rules in a determined configuration for the membrane is presented here. In order to proceed in an appropriate manner, it is needed to define a data structure containing information about the initial membrane state, that is, the initial multiset of objects, the set of evolution rules and the corresponding priority relation among them. the circuit takes these data entrances and then produce as output a set of evolution rules, active rules, which are able to produce the needed changes into the system in order to make evolve it to the next configuration. © 2005 IEEE.

关键词： Computer systems

来源：评论

学校读者我要写书评

暂无评论

the rôle of benchmarking in symbolic computation (position paper) 20

The rôle of benchmarking in symbolic computation (position ...

引用

20th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2018

作者： Davenport, James H. Department of Computer Science University of Bath BathBA2 7AY United Kingdom

ISBN: (纸本)9781728106250

there is little doubt that, in the minds of most symbolic computation researchers, the ideal paper consists of a problem statement, a new algorithm, a complexity analysis and preferably a few validating examples. there are many such great papers. this paradigm has served computer algebra well for many years, and indeed continues to do so where it is applicable. However, it is much less applicable to sparse problems, where there are many NP-hardness results, or to many problems coming from algebraic geometry, where the worst-case complexity seems to be rare. We argue that, in these cases, the field should take a leaf out of the practices of the SAT-solving community, and adopt systematic benchmarking, and benchmarking contests, as a way measuring (and stimulating) progress. this would involve a change of culture. © 2018 IEEE.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Toward on-line predictive models for forecasting workload in clouds 20

Toward on-line predictive models for forecasting workload in...

引用

20th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2018

作者： Doan, Dong Nguyen West University of Timisoara Computer Science Department Romania

ISBN: (纸本)9781728106250

Forecasting workload plays a crucial role in term of Quality of Service (QoS) guarantee in cloud computing. However, there are existing challenges including continuous forecast and multi-step-ahead prediction due to the time series structure characteristics of workload. the most used approaches to forecast workload are predictive models based on time series analysis such as Auto-Regressive Integrated Moving Average (ARIMA) and Exponential Smoothing (ES) models, but these models do not address the limitations yet. this paper presents the strategies to apply machine learning to tackle the challenges of time series data streaming and develop on-line predictive models to continuously forecast and support the multi-step-ahead prediction. the empirical results show that the proposed approach yields much better accuracy than other methods, namely Multilayer Perceptron (MLP) and Long Short-Term Memory (LSTM). © 2018 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

ALGORIthM FOR APPLICATION OF EVOLUTION RULES BASED ON LINEAR DIOFANTIC EQUATIONS

ALGORITHM FOR APPLICATION OF EVOLUTION RULES BASED ON LINEAR...

引用

10th international symposium on symbolic and numeric algorithms for scientific computing

作者： Arteta, Alberto Fernandez, Luis Gil, Javier Univ Politecn Madrid Nat Comp Grp Madrid Spain

ISBN: (纸本)9780769535234

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.

关键词： Natural computing Transition P system Evolution rules application

来源：评论

学校读者我要写书评

暂无评论

A symbolic-numeric algorithm for computing the Alexander polynomial of a plane curve singularity

A symbolic-numeric algorithm for computing the Alexander pol...

引用

作者： Hodorog, MǍdǍlina Mourrain, Bernard Schicho, Josef Johann Radon Institute for Computational and Applied Mathematics Austrian Academy of Sciences Altenbergerstrasse 52 Linz Austria INRIA Sophia-Antipolis 2004 route des Lucioles 06902 Sophia-Antipolis France

ISBN: (纸本)9780769543246

We report on a symbolic-numeric algorithm for computing the Alexander polynomial of each singularity of a plane complex algebraic curve defined by a polynomial with coefficients of limited accuracy, i.e. the coefficients are both exact and inexact data. We base the algorithm on combinatorial methods from knot theory which we combine with computational geometry algorithms in order to compute efficient and accurate results. Nonetheless the problem we are dealing with is ill-posed, in the sense that tiny perturbations in the coefficients of the defining polynomial cause huge errors in the computed results. © 2010 IEEE.

关键词： Polynomials

来源：评论

学校读者我要写书评

暂无评论

the NLP for Employee Review Sentiment Analysis: An Explainable Perspective 26

The NLP for Employee Review Sentiment Analysis: An Explainab...

引用

26th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2024

作者： Babic, Lepa Stoean, Ruxandra Cadjenovic, Jelena Jovanovic, Luka Zivkovic, Miodrag Bacanin, Nebojsa Singidunum University Department of Business Economics Belgrade Serbia University of Craiova Faculty of Sciences Craiova Romania Singidunum University Faculty of Technical Sciences Belgrade Serbia Singidunum University Faculty of Informatics and Computing Belgrade Serbia

ISBN: (纸本)9798331532833

Main goal of the research presented in this manuscript is to analyze employees satisfaction by employing hybrid methods between machine learning and metaheuristics. Furthermore, the proposed work utilizes term frequency-inverse document frequency (TF-IDF), natural language processing (NLP) method, for the identification of important segments of the employees' statements towards their workplaces, while the extreme gradient boosting (XGBoost) model is used for predicting the outcomes. Since each machine learning technique should be calibrated to particular problem, the XGBoost has been optimized by a modified swarm metaheuristics based on red fox optimizer (RFO) algorithm and its performance is evaluated against other high-performing swarm intelligence approaches. the results indicate the superiority of proposed solution, which has been further evaluated with the Shapley additive explanations (SHAP) analysis. © 2024 IEEE.

关键词： Swarm intelligence

来源：评论

学校读者我要写书评

暂无评论

DNA computing model for the minimum spanning tree problem

DNA computing model for the minimum spanning tree problem

引用

8th international symposium on symbolic and numeric algorithms for scientific computing

作者： Han, Aili Zhu, Daming Shandong Univ Weihai Dept Comp Sci & Technol Weihai 264209 Peoples R China Shandong Univ Sch Comp Sci & Technol Jinan 250061 Peoples R China

ISBN: (纸本)9780769527406

We have devised a DNA encoding method and a corresponding DNA algorithm for the minimum spanning tree problem, an instance of optimization problems on weighted graphs. In order to find out the minimum spanning trees of a weighted graph G= (V,E,W), 9) by means of molecular biology techniques, we encode each vertex v(i)is an element of V using one recognition code of length l, l=max{[log(4)n],6};we encode each edge e(ij)is an element of E using two DNA strands of length 2p=2max{w(ij), l};for any two adjacent edges e(ij)e(jk), we add one DNA strand s(aijk) of length w(ij)+w(jk) as an additional code. We also presented a DNA algorithm for the minimum spanning tree problem based on the proposed DNA encoding method, in which we firstly obtain the Euler cycle corresponding to the minimum spanning tree by means of the molecular biology techniques, and then the Euler cycle is converted to the minimum spanning tree. Our work provides further evidence for the ability of DNA computing to solve numerical optimization problems.

关键词： Encoding (symbols)

来源：评论

学校读者我要写书评

暂无评论

Hardware implementation of P systems using microcontrollers. An operating environment for implementing a partially parallel distributed architecture

Hardware implementation of P systems using microcontrollers....

引用

2008 10th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2008

作者： Canaval, Sandra María Gómez Rodríguez, Abraham Gutiérrez Villaverde, Santiago Alonso Natural Computing Group Universidad Politécnica de Madrid Madrid Spain

ISBN: (纸本)9780769535234

Nowadays, important efforts in the research of the Transition P Systems have been focused on the simulation/ implementation of the massively parallel character of the model. the distributed implementation of P Systems has met with the communications bottleneck problem. In this sense, there are several research works on analysis for distributed architectures that are technology independent and avoiding communication collisions. Recent works present analysis on the suitability for implementing theses architectures using an universal membrane hardware/software component based on microcontrollers. these implementations are directly programming on hardware components and the resulting data is analyzed by means of a specific program which translates the execution bit code into intelligible data for researchers. the aim of this work is to present an operating environment to automate manual tasks performed during the loading, execution and interpretation of P System into distributed architectures based on microcontrollers as well as the interpretation from inner binary data representation inside of microcontrollers. © 2008 IEEE.

关键词： Microcontrollers

来源：评论

学校读者我要写书评

暂无评论

Modified Metaheuristics Optimization for Cyberbullying Detection on Online Data Science Platform 26

Modified Metaheuristics Optimization for Cyberbullying Detec...

引用

26th international symposium on symbolic and numeric algorithms for scientific computing, SYNASC 2024

作者： Bacanin, Nebojsa Jovanovic, Luka Bujisic, Ilja Uzelac Stoean, Catalin Kaljevic, Jelena Cadjenovic, Jelena Antonijevic, Milos Zivkovic, Miodrag Singidunum University Faculty of Informatics and Computing Belgrade Serbia Singidunum University Faculty of Technical Sciences Belgrade Serbia University of Craiova Department of Computer Science Craiova Romania Singidunum University Faculty for Health and Business Studies Belgrade Serbia Singidunum University Department of Business Economics Belgrade Serbia

ISBN: (纸本)9798331532833

Online harassment detection faces significant challenges due to its expansive reach and anonymity. Addressing this issue demands effective detection mechanisms capable of processing vast data streams and adapting to evolving online languages. Leveraging advancements in artificial intelligence, we propose a novel approach grounded in natural language processing (NLP) and metaheuristic algorithms. Our methodology integrates term frequency-inverse document frequency (TF-IDF) encoding and the AdaBoost algorithm for classification. To tackle the NP-hard problem of hyperparameter selection, we introduce a modified crayfish optimization algorithm (COA), termed GI-COA. this paper represents a pioneering effort in utilizing metaheuristic algorithms for hyperparameter selection in harassment detection models. through experimentation, we demonstrate the efficacy of our approach in fostering a safer online environment. the best-performing optimized models demonstrate an accuracy exceeding 77%. © 2024 IEEE.

关键词： Data streams

来源：评论

学校读者我要写书评

暂无评论

Proving partial correctness and termination of mutually recursive programs

Proving partial correctness and termination of mutually recu...

引用

作者： Popov, Nikolaj Jebelean, Tudor Research Institute for Symbolic Computation Johannes Kepler University Linz Austria

ISBN: (纸本)9780769543246

We present an environment for proving correctness of mutually recursive functional programs. As usual, correctness is transformed into a set of first-order predicate logic formulae- verification conditions. As a distinctive feature of our method, these formulae are not only sufficient, but also necessary for the correctness. © 2010 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共58页 << < 14 15 16 17 18 19 20 21 22 23 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：