咨询与建议

限定检索结果

文献类型

  • 559 篇 会议
  • 7 篇 期刊文献

馆藏范围

  • 566 篇 电子文献
  • 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...
  • 28 篇 computer archite...
  • 28 篇 algebra
  • 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

语言

  • 566 篇 英文
检索条件"任意字段=8th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing"
566 条 记 录,以下是451-460 订阅
排序:
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
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... 详细信息
来源: 评论
Groebner Bases and Solutions to Diophantine Equations
Groebner Bases and Solutions to Diophantine Equations
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Mihai Cipu Institute of Mathematics Romanian Academy of Sciencies Bucharest Romania
the aim of this paper is to discuss a novel application of Grobner bases in the study of Diophantine equations. the idea appeared during some work on the number of solutions of systems of Pell equations, but can be us... 详细信息
来源: 评论
A CRT-Based Solution to Yao's Millionaires' Problem
A CRT-Based Solution to Yao's Millionaires' Problem
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Sorin Iftene Daniel Pasaila Department of Computer Science Alexandru Ioan Cuza슠University Iasi Romania
We propose a simple solution to Yao's millionaires' problem using thesubtractive homomorphic properties of the secret sharing schemes based on the Chinese remainder theorem (CRT).
来源: 评论
Secrecy for Bounded Security Protocols under Composed Keys and Disequality Tests
Secrecy for Bounded Security Protocols under Composed Keys a...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Catalin V. Birjoveanu Department of Computer Science Alexandru Ioan Cuza슠University Iasi Romania
In this paper, we extend some complexity results on the secrecy problem for bounded security protocols by adding composed keys and disequality tests to an existing model for security protocols.
来源: 评论
Complementaries of Greek Means with Respect to the Logarithmic Mean
Complementaries of Greek Means with Respect to the Logarithm...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Iulia Costin Department of Computer Science Technical University of UTCN Cluj-Napoca Romania
the mean N is the complementary of the mean M with respect to the mean P if P(M, N) = P. We study the complementaries of Greek means with respect to the logarithmic mean. We look after the complementary of a mean in s... 详细信息
来源: 评论
the numerical Solutions for an Elliptic Control Problem
The Numerical Solutions for an Elliptic Control Problem
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Razvan Stefanescu Viorel Arnautu Faculty of Mathematics Alexandru Ioan Cuza슠University Iasi Romania Department of Mathematics and Informatics University of Medicine and Pharmacy Iasi Romania
the aim of our paper is to solve numerically a second order elliptic BVP, using a collocation method. then, an optimal control problem governed by an elliptic equation is considered and numerical solutions are presented.
来源: 评论
Triangular Decomposition for Algebraic and Geometric computing
Triangular Decomposition for Algebraic and Geometric Computi...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Dongming Wang Laboratoire d'Informatique de Paris 6 UPMC-CNRS Paris France LMIB-School of Science Beihang University Beijing China
In this talk, we present several algorithms for decomposing systems of multivariate polynomials into triangular systems of various kinds. the algorithms have been efficiently implemented and successfully applied to nu... 详细信息
来源: 评论
Coverability Problems for Jumping Petri Nets
Coverability Problems for Jumping Petri Nets
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Cristian Vidrascu Faculty of Computer Science University Al. I. Cuza of Iaşi Iasi Romania
In this paper we extend some decidability results concerning the coverability problem and a related one, the quasi-liveness problem, from jumping Petri nets with finite jumps to the larger class of reduced-computable ... 详细信息
来源: 评论
A Cryptographic Algorithm Based on a Pseudorandom Number Generator
A Cryptographic Algorithm Based on a Pseudorandom Number Gen...
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Dominic Bucerzan Department of Mathematics and Computer Science Aurel Vlaicu University of Arad Arad Romania
the paper proposes to the information security specialists, a new algorithm based on a synchronous stream cipher HENKOS, built around a performing pseudorandom number generator. the paper describes the main parts of t... 详细信息
来源: 评论
BBUFs: A New Lookup Mechanism Based on IPV6
BBUFs: A New Lookup Mechanism Based on IPV6
收藏 引用
international symposium on symbolic and numeric algorithms for scientific computing (SYNASC)
作者: Dan Cojocar Department of Computer Science Babes Bolyai University Cluj-Napoca Romania
BBUFs (Babes Bolyai university file system) is a peer to peer distributed file system with a new lookup mechanism. the file system is designed for ordinary Unix machines that are IPv6 capable. In this paper we propose... 详细信息
来源: 评论