咨询与建议

限定检索结果

文献类型

  • 518 篇 会议
  • 298 篇 期刊文献
  • 9 册 图书

馆藏范围

  • 825 篇 电子文献
  • 0 种 纸本馆藏

日期分布

学科分类号

  • 424 篇 工学
    • 319 篇 计算机科学与技术...
    • 248 篇 软件工程
    • 77 篇 信息与通信工程
    • 58 篇 控制科学与工程
    • 30 篇 生物工程
    • 27 篇 电气工程
    • 26 篇 化学工程与技术
    • 24 篇 机械工程
    • 19 篇 动力工程及工程热...
    • 19 篇 电子科学与技术(可...
    • 17 篇 生物医学工程(可授...
    • 15 篇 力学(可授工学、理...
    • 15 篇 光学工程
    • 15 篇 仪器科学与技术
    • 15 篇 材料科学与工程(可...
    • 7 篇 航空宇航科学与技...
  • 370 篇 理学
    • 302 篇 数学
    • 92 篇 统计学(可授理学、...
    • 61 篇 物理学
    • 39 篇 生物学
    • 28 篇 系统科学
    • 27 篇 化学
  • 80 篇 管理学
    • 42 篇 管理科学与工程(可...
    • 38 篇 图书情报与档案管...
    • 28 篇 工商管理
  • 13 篇 教育学
    • 13 篇 教育学
  • 12 篇 经济学
    • 12 篇 应用经济学
  • 12 篇 医学
    • 10 篇 临床医学
    • 8 篇 基础医学(可授医学...
  • 7 篇 法学
    • 6 篇 社会学
  • 5 篇 农学
  • 1 篇 哲学
  • 1 篇 文学
  • 1 篇 历史学
  • 1 篇 军事学
  • 1 篇 艺术学

主题

  • 118 篇 computer science
  • 40 篇 mathematics
  • 19 篇 algorithm design...
  • 19 篇 polynomials
  • 17 篇 artificial intel...
  • 16 篇 educational inst...
  • 16 篇 computational mo...
  • 14 篇 humans
  • 14 篇 shape
  • 13 篇 data mining
  • 13 篇 equations
  • 12 篇 application soft...
  • 11 篇 routing
  • 11 篇 mathematical mod...
  • 11 篇 layout
  • 10 篇 concurrent compu...
  • 10 篇 control systems
  • 10 篇 topology
  • 10 篇 robustness
  • 9 篇 cameras

机构

  • 21 篇 department of co...
  • 11 篇 math. division n...
  • 11 篇 department of ma...
  • 9 篇 college of mathe...
  • 8 篇 courant inst. of...
  • 7 篇 department of ap...
  • 7 篇 inst. math. stoc...
  • 6 篇 department of co...
  • 6 篇 department of co...
  • 6 篇 machine learning...
  • 6 篇 department of ap...
  • 5 篇 department of ap...
  • 5 篇 school of comput...
  • 5 篇 research centre ...
  • 5 篇 department of ap...
  • 5 篇 dept. of math. a...
  • 4 篇 department of ma...
  • 4 篇 math. research i...
  • 4 篇 department of co...
  • 4 篇 department of ma...

作者

  • 11 篇 naor moni
  • 11 篇 ban jung-chao
  • 9 篇 hu wen-guei
  • 9 篇 sharir micha
  • 8 篇 alsmeyer gerold
  • 8 篇 m. irani
  • 8 篇 lai guan-yu
  • 7 篇 r. basri
  • 6 篇 hemaspaandra edi...
  • 6 篇 krishnaswamy smi...
  • 6 篇 srivastava gauta...
  • 6 篇 fitzsimmons zack
  • 6 篇 wu yu-liang
  • 5 篇 chang chih-hung
  • 5 篇 maldonado josé c...
  • 5 篇 irit dinur
  • 5 篇 macdonell stephe...
  • 5 篇 mendes emília
  • 5 篇 pinchasi rom
  • 5 篇 evangelos a. the...

语言

  • 806 篇 英文
  • 17 篇 其他
  • 2 篇 中文
检索条件"机构=Department of Applied Math. and Computer Science"
825 条 记 录,以下是91-100 订阅
排序:
Problems in practical use of electronic signatures
Problems in practical use of electronic signatures
收藏 引用
作者: Janáček, Jaroslav Ostertág, Richard Department of Computer Science Fac. of Math. Phys. and Informatics Comenius University Mlynská dolina 842 48 Bratislava Slovakia
The boom of electronic commerce requires existence and use of reliable means of authentication of communicating parties. We need an analogy of hand-written signature that can be applied to electronic documents. We sha... 详细信息
来源: 评论
Peer-to-peer enterprise data backup over a ren cloud
Peer-to-peer enterprise data backup over a ren cloud
收藏 引用
作者: Khan, Javed I. Tahboub, Omar Y. Media Communications and Networking Research Laboratory Department of Math. and Computer Science Kent State University Kent OH 44242 United States
Enterprise data backup is always a mission critical as well as resource straining operation. In the light of recent surge in near peta-byte databases universities are particularly searching for scalable solutions. Mos... 详细信息
来源: 评论
The formalization of a cognitive architecture and its application to reasoning about human computer interaction
收藏 引用
Formal Aspects of Computing 1999年 第6期11卷 665-689页
作者: Duke, David Duce, David Department of Computer Science University of York York United Kingdom Oxford Brookes University Sch. of Comp. and Math. Sciences Oxford United Kingdom Oxford Brookes University Sch. of Comp. and Math. Sciences Gipsy Lane Campus Headington Oxford OX3 0BP United Kingdom
Software systems are not just math.matical structures. The majority are also cognitive artefacts that rely on the ability of their users to understand and interpret information provided via an interface, and to act on... 详细信息
来源: 评论
The expansion and mixing time of skip graphs with applications  05
The expansion and mixing time of skip graphs with applicatio...
收藏 引用
Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures
作者: Aspnes, James Wieder, Udi Department of Computer Science Yale University New Haven CT 06520 United States Department of Applied Math and Computer Science The Weizmann Institute of Science Rehovot 76100 Israel
We prove that with high probability a skip graph contains a 4-regular expander as a subgraph, and estimate the quality of the expansion via simulations. As a consequence skip graphs contain a large connected component... 详细信息
来源: 评论
Porting of GROMACS package into the Grid environment: Testing of a new distribution strategy
Porting of GROMACS package into the Grid environment: Testin...
收藏 引用
2010 International Conference on Computational science and Its Applications, ICCSA 2010
作者: Costantini, Alessandro Gutierrez, Eduardo Cacheiro, Javier Lopez Rodriguez, Aurelio Gervasi, Osvaldo Laganà, Antonio Department of Chemistry University of Perugia Perugia Italy Department of Math. and Computer Science University of Perugia Perugia Italy CESGA Santiago de Compostela Spain
The paper describes the application porting process onto the EGEE grid of GROMACS package that was carried out using the P-GRADE Grid Portal tool implemented in COMPCHEM. For this purpose a new stategy to access local... 详细信息
来源: 评论
Computing the visibility graph of points within a polygon
Computing the visibility graph of points within a polygon
收藏 引用
Proceedings of the Twentieth Annual Symposium on Computational Geometry (SCG'04)
作者: Ben-Moshe, Boaz Hall-Holt, Olaf Katz, Matthew J. Mitchell, Joseph S.B. Computer Science Ben-Gurion University Beer-Sheva 84105 Israel Applied Math. and Statistics Stony Brook University Stony Brook NY 11794-3600 United States
We study the problem of computing the visibility graph defined by a set P of n points inside a polygon Q: two points p, q Ε P are joined by an edge if the segment pq ⊂ Q. Efficient output-sensitive algorithms are kno... 详细信息
来源: 评论
An evolution strategy for the induction of fuzzy finite-state automata
An evolution strategy for the induction of fuzzy finite-stat...
收藏 引用
IEEE International Conference on Granular Computing
作者: Mo, ZW Wan, M Shu, L Department of Applied Math Southwest Jiaotong Univ. China College of Math. & Software Sci. Sichuan Normal Univ. Chengdu P.R.China School of Applied Math Univ. of Electronic Science and Technology of China P.R.China
This paper presents an evolution strategy used to infer fuzzy finite-state automata from examples of a fuzzy language. We describe the fitness function of an generated automata with respect to a set of examples of a f... 详细信息
来源: 评论
Why Eve and Mallory love Android: An analysis of Android SSL (in)security  12
Why Eve and Mallory love Android: An analysis of Android SSL...
收藏 引用
2012 ACM Conference on computer and Communications Security, CCS 2012
作者: Fahl, Sascha Harbach, Marian Muders, Thomas Smith, Matthew Baumgärtner, Lars Freisleben, Bernd Distributed Computing and Security Group Leibniz University of Hannover Hannover Germany Department of Math. and Computer Science Philipps University of Marburg Marburg Germany
Many Android apps have a legitimate need to communicate over the Internet and are then responsible for protecting potentially sensitive data during transit. This paper seeks to better understand the potential security... 详细信息
来源: 评论
An exploratory study on content-based filtering of call for papers
An exploratory study on content-based filtering of call for ...
收藏 引用
6th Information Retrieval Facility Conference for science and Technology, IRFC 2013
作者: Hurtado Martín, Germán Schockaert, Steven Cornelis, Chris Naessens, Helga Faculty of Applied Engineering Sciences University College Ghent Ghent Belgium Dept. of Applied Math. Comp. Science and Statistics Ghent University Belgium School of Computer Science and Informatics Cardiff University United Kingdom Dept. of Computer Science and Artificial Intelligence University of Granada Spain
Due to the increasing number of conferences, researchers need to spend more and more time browsing through the respective calls for papers (CFPs) to identify those conferences which might be of interest to them. In th... 详细信息
来源: 评论
SCHEDULING ALGORITHM FOR MINIMIZING CONTEXT SWITCHES OF PERIODIC AND BOUNDED PREDICTABLE TASKS  15
SCHEDULING ALGORITHM FOR MINIMIZING CONTEXT SWITCHES OF PERI...
收藏 引用
15th International Conference on computer Applications in Industry and Engineering, CAINE 2002
作者: Lee, Haesun K. Lee, Ilhyun Debnath, Narayan C. Department of Science and Math. University of Texas of the Permian Basin OdessaTX79762 United States Computer Science Department Winona State University WinonaMN55987 United States
We present a new scheduling algorithm Odd-Even4, which not only guarantees the hard deadlines of all periodic tasks with fewer context switches but also minimizes the average response time of bounded predictable tasks... 详细信息
来源: 评论