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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

375 篇 会议
297 篇 期刊文献
13 册 图书

馆藏范围

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

日期分布

学科分类号

407 篇 工学
- 276 篇 计算机科学与技术...
- 212 篇 软件工程
- 71 篇 信息与通信工程
- 62 篇 电子科学与技术（可...
- 55 篇 电气工程
- 50 篇 光学工程
- 38 篇 生物工程
- 37 篇 生物医学工程（可授...
- 29 篇 控制科学与工程
- 24 篇 材料科学与工程（可...
- 24 篇 化学工程与技术
- 20 篇 动力工程及工程热...
- 15 篇 力学（可授工学、理...
- 14 篇 仪器科学与技术
- 12 篇 机械工程
264 篇 理学
- 131 篇 物理学
- 113 篇 数学
- 47 篇 生物学
- 28 篇 化学
- 23 篇 统计学（可授理学、...
- 11 篇 系统科学
99 篇 管理学
- 70 篇 管理科学与工程(可...
- 40 篇 工商管理
- 31 篇 图书情报与档案管...
40 篇 医学
- 35 篇 基础医学(可授医学...
- 35 篇 临床医学
- 25 篇 药学(可授医学、理...
- 12 篇 公共卫生与预防医...
12 篇 经济学
- 11 篇 应用经济学
11 篇 教育学
- 10 篇 教育学
9 篇 法学
5 篇 农学
2 篇 艺术学
1 篇 哲学
1 篇 历史学

主题

28 篇 grid computing
26 篇 computer science
23 篇 high performance...
21 篇 distributed comp...
20 篇 resource managem...
20 篇 computational mo...
18 篇 computer archite...
18 篇 bandwidth
17 篇 processor schedu...
16 篇 internet
15 篇 concurrent compu...
15 篇 application soft...
12 篇 algorithm design...
12 篇 quantum cryptogr...
12 篇 computer network...
11 篇 data mining
11 篇 bioinformatics
11 篇 machine learning
10 篇 runtime
10 篇 parallel process...

机构

28 篇 high-performance...
28 篇 institute of hig...
23 篇 department of el...
18 篇 institute of hig...
16 篇 institute of hig...
14 篇 russian quantum ...
12 篇 nti center for q...
11 篇 institute for qu...
9 篇 institute for qu...
9 篇 department of co...
9 篇 department of ph...
8 篇 national center ...
8 篇 high-performance...
8 篇 kavli institute ...
8 篇 department of co...
8 篇 department of ph...
8 篇 institute for qu...
7 篇 university of sc...
7 篇 high-performance...
7 篇 department of el...

作者

32 篇 chao-tung yang
23 篇 yang chao-tung
22 篇 fu huazhu
18 篇 kimura n.
15 篇 liu jiang
15 篇 huang anqi
13 篇 ohkawa m.
13 篇 miyoki s.
13 篇 oohara k.
13 篇 hayama k.
13 篇 aso y.
13 篇 kokeyama k.
13 篇 morisaki s.
13 篇 michimura y.
13 篇 mio n.
13 篇 nakano h.
12 篇 lin c.-y.
12 篇 takahashi h.
12 篇 suzuki t.
12 篇 cannon k.

语言

668 篇 英文
14 篇 其他
3 篇 中文

检索条件"机构=High Performance Computing Lab Department of Computer Science and Engineering"

共 685 条记录，以下是341-350 订阅

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

详细简洁

排序：

Genetic algorithm application on the job shop scheduling problem

Genetic algorithm application on the job shop scheduling pro...

引用

International Conference on Machine Learning and Cybernetics (ICMLC)

作者： C.G. Wu X.L. Xing H.P. Lee C.G. Zhou Y.C. Liang College of Computer Science and Technology Jilin University Changchun China Institute of High Performance Computing Singapore Department of Optoelectronic Engineering Beijing Institute of Technology Beijing China

Based on the concepts of operation template and virtual job shop, this paper attempts to solve several job shop scheduling problems with different scale and analyzes the relationship among the population size, mutation probability, the number of evolving generations and the complexity of the undertaking problem visually by using the trend chart of the fitness curves. This visual analysis could provide some referencing information for the adjustment of genetic algorithm running parameters.

关键词： Genetic algorithms Job shop scheduling Genetic mutations Application software Processor scheduling computer science high performance computing performance analysis Information analysis Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Lattice Boltzmann algorithms for fluid turbulence

Lattice Boltzmann algorithms for fluid turbulence

引用

department of Defense - HPCMP Users Group Conference 2007;high performance computing Modernization Program: A Bridge to Future Defense, DoD HPCMP UGC

作者： Vahala, George Yepez, Jeffrey Soe, Min Vahala, Linda Ziegeler, Sean Department of Physics College of William and Mary Williamsburg VA United States Hanscom Field MA United States Department of Mathematics and Science Rogers State University Claremore OK United States Department of Electrical and Computer Engineering Old Dominion University Norfolk VA United States High Performance Computing Modernization Program Mississippi State University MS United States

ISBN: (纸本)0769530885

Lattice Boltzmann algorihms are a mesoscopic representation of nonlinear continuum physics (like Navier-Stokes, magnetohydrodynamics (MHD), Gross-Pitaevskii equations) which are ideal for parallel supercomputers because they transform the difficult nonlinear convective macroscopic derivatives into purely local moments of distribution functions. The macroscopic nonlinearities are recovered by relaxation distribution functions in the collision operator whose dependence on the macroscopic velocity is algebraically nonlinear and thus purely local. Unlike standard computational fluid dynamics codes, there is no loss in parallelization in handling arbitrary geometric boundaries, e.g., using bounce-back rules from kinetic theory. By encoding detailed balance into the collision operator through the introduction of discrete H-function, the lattice Boltzmann algorithm can be made unconditionally stable for arbitrary high Reynolds numbers. It is shown that this approach is a special case of a quantum lattice Boltzmann algorithm that entangles local qubits through unitary collision operators and which is ideally parallelized on quantum computer architectures. Here we consider turbulence simulations using 2,048 PEs on a 1,6003-spatial grid. A connection is found between the rate of change of enstrophy and the onset of laminar-to-turbulent flows. © 2007 IEEE.

关键词： Magnetohydrodynamics

来源：评论

学校读者我要写书评

暂无评论

A new bio-inspired location search algorithm for peer to peer network based Internet telephony 06

A new bio-inspired location search algorithm for peer to pee...

引用

Bio-Inspired Models of Network, Information and computing Systems, BIONETICS

作者： Sachin Kulkarni Niloy Ganguly Geoffrey Canright Andreas Deutsch Department of Computer Science and Engineering Indian Institute of Technology Kharagpur Kharagpur India R&D Telenor Oslo Norway Center for Information Services High Performance Computing Dresden Germany Center for Information Services and High Performance Computing (ZIH) TU-Dresden Dresden

ISBN: (纸本)9781424404636

In this paper, we propose a p2p network based location search algorithm which can be used to establish connections in Internet telephony. By using the location search algorithm, the caller can identify the peer it is calling. The algorithm is based upon the concept of gradient search and is applicable upon unstructured networks. It is inspired by a biological phenomenon called haptotaxis. The algorithm performs at par with DHT-based location search algorithms, however it is much more robust than such structured algorithms. We also present some initial analysis to explain the reason behind the superiority of the algorithm

关键词： Peer to peer computing Internet telephony Protocols Network address translation Robustness Algorithm design and analysis Costs computer science high performance computing Biology computing

来源：评论

学校读者我要写书评

暂无评论

Portfolio-Based Selection of Robust Dynamic Loop Scheduling Algorithms Using Machine Learning

Portfolio-Based Selection of Robust Dynamic Loop Scheduling ...

引用

IEEE International Symposium on Parallel and Distributed Processing Workshops and Phd Forum (IPDPSW)

作者： Nitin Sukhija Brandon Malone Srishti Srivastava Ioana Banicescu Florina M. Ciorba Department of Computer Science and Engineering Mississippi State University MS USA Department of Computer Science Helsinki Institute for Information Technology Technische Universität Dresden Center for Information Services and High Performance Computing Dresden Germany

ISBN: (纸本)9781479941155

The execution of computationally intensive parallel applications in heterogeneous environments, where the quality and quantity of computing resources available to a single user continuously change, often leads to irregular behavior, in general due to variations of algorithmic and systemic nature. To improve the performance of scientific applications, loop scheduling algorithms are often employed for load balancing of their parallel loops. However, it is a challenge to select the most robust scheduling algorithms for guaranteeing optimized performance of scientific applications on large-scale computing systems that comprise resources which are widely distributed, highly heterogeneous, often shared among multiple users, and have computing availabilities that cannot always be guaranteed or predicted. To address this challenge, in this work we focus on a portfolio-based approach to enable the dynamic selection and use of the most robust dynamic loop scheduling (DLS) algorithm from a portfolio of DLS algorithms, depending on the given application and current system characteristics including workload conditions. Thus, in this paper we provide a solution to the algorithm selection problem and experimentally evaluate its quality. We propose the use of supervised machine learning techniques to build empirical robustness prediction models that are used to predict DLS algorithm's robustness for given scientific application characteristics and system availabilities. Using simulated scientific applications characteristics and system availabilities, along with empirical robustness prediction models, we show that the proposed portfolio-based approach enables the selection of the most robust DLS algorithm that satisfies a user-specified tolerance on the given application's performance obtained in the particular computing system with a certain variable availability. We also show that the portfolio-based approach offers higher guarantees regarding the robust performance of the applic

关键词： Robustness Heuristic algorithms Prediction algorithms Program processors Availability Predictive models Dynamic scheduling

来源：评论

学校读者我要写书评

暂无评论

Polygonal mesh simplification with face color and boundary edge preservation using quadric error metric

Polygonal mesh simplification with face color and boundary e...

引用

International Symposium on Multimedia Software engineering

作者： Chin-Shyurng Fahn Hung-Kuang Chen Yi-Haur Shiau Department of Computer Science and Information Engineering National Taiwan University of Science and Technology Taiwan Department of Electronic Engineering National Taiwan University of Science and Technology Taiwan Software and Development Division National Center of High-Performance Computing Taiwan

ISBN: (纸本)0769518575

In applications such as scientific and medical visualization, highly detailed polygonal meshes are needed. Rendering these polygonal meshes usually exceeds the capabilities of graphics hardware. To improve rendering efficiency and maintain proper interactivity, the polygonal mesh simplification technique is commonly used to reduce the number of polygons of the mesh and construct a multiresolution representation. We propose a new and simple constraint scheme based on the quadric error metric proposed by Garland and Heckbert (1997, 1998) to preserve face colors and boundary edges during the simplification process. In addition, our method generates progressive meshes that store the polygonal mesh in a continuous multi-resolution representation. According to our experimental results, this new method is successful in preserving face colors and boundary edges. Moreover, we compare the latency of resolution changes for progressive meshes of various models.

关键词： computer errors Frequency Error correction computer science Reactive power Mesh generation Data visualization Sampling methods Topology Geometry

来源：评论

学校读者我要写书评

暂无评论

A Network Management System Based on DPI

A Network Management System Based on DPI

引用

International Conference on Network-Based Information Systems (NBIS)

作者： Chu-Sing Yang Ming-Yi Liao Mon-Yen Luo Shin-Min Wang C. Eugene Yeh Institute of Computer and Communication Engineering Department of Electrical Engineering National Cheng Kung University Taiwan Department of Computer Science and Information Engineering National Kaohsiung University of Applied Sciences Kaohsiung Taiwan National Center of High-Performance Computing Taiwan

More and more network applications have appeared in recent years. Government, university, industry and individual Internet users and network services need more bandwidth and various network applications. Many new network protocols are proposed so that it is now becoming harder to manage the network. In the conditional network, every network protocol uses the fixed port, the so-called well-known port number. In the past, it was easy to classify and manage the network traffic because we could identify the network service by the port number. However, new types of network applications do not use fixed port number. The method of traffic classification with fixed port number is inadequate. In recent years, the DPI (Deep Packet Inspection) is used to classify the traffic. This study deploys a NMS (network management system) based on DPI and SNMP. The NMS controls the network devices and services according to the traffic classification of DPIS (DPI server). The platform of DPIS is implemented on the Netfilter framework in Linux kernel.

关键词： Linux Servers Kernel Switches Protocols Inspection Sockets

来源：评论

学校读者我要写书评

暂无评论

Alleviating Deduplication-oriented Fragmentation of SSDs by Considering File Hotness and Popularity

Alleviating Deduplication-oriented Fragmentation of SSDs by ...

引用

International SoC Design Conference, ISOCC

作者： Lee Chang Chien-Chung Ho Tei-Wei Kuo Department of Computer Science and Information Engineering National Taiwan University Department of Computer Science and Information Engineering National Cheng Kung University High Performance and Scientific Computing Center National Taiwan University Mohamed bin Zayed University of Artificial Intelligence

Data deduplication is a highly efficient method for data storage, providing significant benefits in terms of storage utilization and cost reduction in large-scale storage systems. This research introduces a novel approach to dynamic chunk allocation in deduplication systems, aiming to minimize fragmentation and enhance read performance by leveraging supported SSD commands. The write strategy is intelligently determined based on the popularity of chunks within each die, optimizing overall system performance. Additionally, we introduce a read/write unit based on the plane level to harness the internal parallelism of SSDs. Through extensive simulations, our proposed design demonstrates an average performance improvement of 18.8%, highlighting our approach’s effectiveness and impact.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Analyzing the Robustness of Scheduling Algorithms Using Divisible Load Theory on Heterogeneous Systems

Analyzing the Robustness of Scheduling Algorithms Using Divi...

引用

International Symposium on Parallel and Distributed computing

作者： Mahadevan Balasubramaniam Ioana Banicescu Florina M. Ciorba Department of Computer Science and Engineering Mississippi State University Mississippi USA Center for Information Services and High Performance Computing (ZIH) Technische Universität Dresden Dresden Germany

ISBN: (纸本)9781479907342

Arbitrarily divisible workloads are present in a large class of scientific applications, such as N-body simulations, Monte Carlo simulations, CFD applications, and others. Divisible load theory (DLT) provides a tractable approach to the scheduling of arbitrarily divisible workloads. high performance parallel and distributed systems may operate in an unreliable environment, and a robust system is expected to deliver a certain level of performance when operating in such an environment. To the best of our knowledge, this is the first work to study and analyze the robustness of DLT algorithms. Using simulations, a study of the resiliency of DLT to variations in certain system features, such as the network latency, the network bandwidth, and the processor availability on a single level tree topology is presented. The simulation results demonstrate the robustness of the DLT algorithms under certain application and system characteristics.

关键词： Robustness Processor scheduling Equations Schedules Bandwidth Computational modeling Runtime

来源：评论

学校读者我要写书评

暂无评论

An efficient technique for optimization of the concentric array radial line slot antenna (CA-RLSA)

An efficient technique for optimization of the concentric ar...

引用

Antennas and Propagation Society International Symposium

作者： Zhuo Feng Le-Wei Li Er-Ping Li Tat Soon Yeo Department of Electrical and Computer Engineering National University of Singapore Kent Ridge Singapore Computational Electronics and Electromagnetics Division Institute of High Performance Computing Science Park II Singapore

Presents an improved technique for the design of CA-RLSAs in which the slot paths are split into several identical regions. The conventional Galerkin's moment method is carried out to solve the unknown excitation ... 详细信息

ISBN: (纸本)0780388836

关键词： Antenna arrays Slot antennas Moment methods Apertures Transmission line matrix methods Admittance Magnetic analysis Magnetic fields Equations Electromagnetics

来源：评论

学校读者我要写书评

暂无评论

Virtual memory versus file interfaces for large, memory-intensive scientific applications 96

Virtual memory versus file interfaces for large, memory-inte...

引用

Proceedings of the 1996 ACM/IEEE conference on Supercomputing

作者： Yoonho Park Ridgway Scott Stuart Sechrest High Performance Computing Center University of Houston Houston TX Software Systems Research Laboratory Department of Electrical Engineering and Computer Science University of Michigan Ann Arbor MI

ISBN: (纸本)9780897918541

Scientific applications often require some strategy for temporary data storage to do the largest possible simulations. The use of virtual memory for temporary data storage has received criticism because of performance problems. However, modern virtual memory found in recent operating systems such as Cenju-3/DE give application writers control over virtual memory policies. We demonstrate that custom virtual memory policies can dramatically reduce virtual memory overhead and allow applications to run out-of-core efficiently. We also demonstrate that the main advantage of virtual memory, namely programming simplicity, is not lost.

关键词： custom policies

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共69页 << < 31 32 33 34 35 36 37 38 39 40 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：