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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

486 篇 会议
16 篇 期刊文献
9 册 图书

馆藏范围

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

日期分布

学科分类号

209 篇 工学
- 195 篇 计算机科学与技术...
- 97 篇 软件工程
- 42 篇 电气工程
- 12 篇 电子科学与技术（可...
- 8 篇 信息与通信工程
- 6 篇 控制科学与工程
- 6 篇 生物工程
- 4 篇 机械工程
- 3 篇 力学（可授工学、理...
- 3 篇 化学工程与技术
- 1 篇 材料科学与工程（可...
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 生物医学工程（可授...
54 篇 理学
- 34 篇 数学
- 6 篇 生物学
- 4 篇 系统科学
- 3 篇 物理学
- 3 篇 化学
- 1 篇 大气科学
- 1 篇 统计学（可授理学、...
16 篇 管理学
- 9 篇 管理科学与工程(可...
- 7 篇 图书情报与档案管...
- 5 篇 工商管理
2 篇 经济学
- 2 篇 应用经济学
2 篇 法学
- 2 篇 社会学

主题

97 篇 programming
82 篇 parallel process...
79 篇 parallel archite...
71 篇 parallel program...
63 篇 concurrent compu...
59 篇 computer archite...
46 篇 hardware
43 篇 computational mo...
39 篇 programming prof...
39 篇 algorithm design...
36 篇 parallel algorit...
34 篇 computer science
26 篇 dynamic programm...
24 篇 runtime
24 篇 heuristic algori...
22 篇 program processo...
22 篇 partitioning alg...
21 篇 costs
21 篇 instruction sets
21 篇 clustering algor...

机构

6 篇 school of comput...
5 篇 school of comput...
4 篇 school of comput...
3 篇 department of co...
3 篇 department of co...
3 篇 college of infor...
3 篇 school of electr...
2 篇 department of co...
2 篇 univ minnesota d...
2 篇 school of scienc...
2 篇 soochow univ sch...
2 篇 college of optoe...
2 篇 school of comput...
2 篇 beijing research...
2 篇 department of co...
2 篇 school of comput...
2 篇 department of co...
2 篇 department of co...
2 篇 department of co...
2 篇 vision computing...

作者

9 篇 zhong cheng
6 篇 cheng zhong
6 篇 jigang wu
5 篇 hui li
4 篇 shikai guo
4 篇 yeh-cheng chen
4 篇 zhang jinxiong
4 篇 yidong li
4 篇 rong chen
4 篇 sivasankaran raj...
4 篇 hong shen
3 篇 chen danyang
3 篇 wei liu
3 篇 liu jun
3 篇 ruey-shun chen
3 篇 wang shunxu
3 篇 rajamanickam siv...
3 篇 naixue xiong
3 篇 guangzhong sun
3 篇 tonglai liu

语言

508 篇 英文
2 篇 其他
1 篇 中文

检索条件"任意字段=Seventh International Symposium on Parallel Architectures, Algorithms and Programming"

共 511 条记录，以下是321-330 订阅

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

详细简洁

排序：

Multi-view Spectral Clustering With Adaptive Local Neighbors

Multi-view Spectral Clustering With Adaptive Local Neighbors

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Lijuan Wang Jinping Xing Ming Yin Xinxuan Huang School of Computer Science and Technology Guangdong University of Technology China

ISBN: (纸本)9781665496407

Some existing multi-view spectral clustering methods calculate a fixed similarity matrix. However, the fixed similarity is hard to reflect comprehensive and correct relationship between data points and may not be optimal for learning sample embedding, leading to the suboptimal result. In this paper, we propose a novel multi-view spectral clustering (MSCAN) algorithm to address these issues. Specifically, the proposed algorithm generates the dynamic similarity matrix with adaptive neighbors for each view instead of using the fixed similarity matrix. It enhances the representative capacity of the similarity matrix and accuracy of the sample embedding. Meanwhile, the knowlege trnasfer is imposed to the sample embedding for all view, such that the sample embedding learns shared information betwwen the feature embeddings to keep consistency. Additionally, the feature embedding of each view learns from the shared sample embedding to obtian complementary information. An alternating iterative optimization algorithm is presented to optimize the objective function. Experimental results on several benchmark databases show the superior performance compared to the previous state-of-the-arts.

关键词： Databases Heuristic algorithms Clustering methods Clustering algorithms programming Data structures Linear programming

来源：评论

学校读者我要写书评

暂无评论

Efficient Algorithm for Home Care Scheduling with Budget Constraint

Efficient Algorithm for Home Care Scheduling with Budget Con...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Xinxuan Huang Jigang Wu Tonglai Liu Jinyao Huang School of Computer Science and Technology Guangdong University of Technology Guangzhou China College of Information Science and Technology Zhongkai University of Agriculture and Engineering Guangzhou China

ISBN: (纸本)9781665496407

Effective caregiver routing and scheduling methods can improve the service quality of home care and reduce operating costs. How to enable patients to obtain cost-effective home care services within a certain budget is a key issue. Few existing works take into account the patient's budget in home health care issues. Therefore, we propose a new home care problem to minimize the route cost, which includes the weighted sum of total economic benefits, the dissatisfaction of patients and the travel time of caregivers, so as to ensure that caregivers can have satisfactory income and patients can obtain cost-effective services. A genetic algorithm (ARGA) customized with one crossover operation and six mutation operations is designed to solve this problem. Experimental results show that the algorithm ARGA can effectively reduce the route cost by 59.3%, 14.3% and 10.7% respectively, compared with the baselines BA, GA and TS.

关键词： Costs Medical services programming Search problems Routing Scheduling parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Infectious Disease Dynamics Model Considering Suspected Population

Infectious Disease Dynamics Model Considering Suspected Popu...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Xinhong Zhang Xiangyu Wang Fan Zhang School of Software Henan University Kaifeng China School of Computer and Information Engineering Henan University Kaifeng China

ISBN: (纸本)9781665496407

The outbreak of COVID-19 calls for the improvement of infectious disease dynamics model to meet the requirements of future infectious disease's prediction and risk assessment. On the basis of SEIR model, a new transmission dynamics model named as SSEIR is proposed. In order to describe the dynamics evolution of the SSEIR model, a new set of ordinary differential equations (ODE) is constructed. The SSEIR dynamics model is used to simulate and predict the progress of pandemic situation in Wuhan, China. Because that the suspected people have different dynamics characteristics from the susceptible people and the exposed people, this paper put them in a new independent category. To describe the dynamics evolution of SSEIR model, a new set of ordinary differential equations (ODE) is constructed. The SSEIR model can be used to simulate and predict the progress of infectious diseases.

关键词： Infectious diseases Sociology Predictive models Ordinary differential equations programming Prediction algorithms Mathematical models

来源：评论

学校读者我要写书评

暂无评论

parallel Optimization of Queries in XML Dataset Using GPU

Parallel Optimization of Queries in XML Dataset Using GPU

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Xujie Si Airu Yin Xiaocheng Huang Xiaojie Yuan Xiaoguang Liu Gang Wang College of Software Nankai University Tianjin China College of I.T. Nankai University Tianjin China

As XML is playing a crucial role in web services, databases, and document processing, efficient processing of XML queries has become an important issue. On the other hand, due to the increasing number of users, high throughput of XML queries is also required to execute tens of thousands of queries in a short time. Given the great success of GPGPU (General-Purpose computations on the Graphics Processors), we propose a parallel XML query model based on GPU, which mainly consists of two efficient task distribution strategies, to improve the efficiency and throughput of XML queries. We have developed a parallel simplified XPath language using Compute Unified Device Architecture (CUDA) on GPU, and evaluate our model on a recent NVIDIA GPU in comparison with its counterpart on eight-core CPU. The experiment results show that our model achieves both higher throughput and efficiency than CPU-based XML query.

关键词： XML Graphics processing unit Throughput Load modeling Databases Context

来源：评论

学校读者我要写书评

暂无评论

Design of efficient reconfigurable networks

Design of efficient reconfigurable networks

引用

international symposium on parallel Processing

作者： A.K. Somani Department of Electrical Engineering and Department of Computer Science and Engineering University of Washington Seattle WA USA

The author presents a methodology to design an efficient communication reconfigurable network of processor using a circuit switching environment. He assumes that the operation is synchronous and reconfigurations occur at pre-specified times. This network is based on two architectural concepts, the generalized folding cube and the enhanced hypercube architectures. The author demonstrates the effectiveness, versatility, and flexibility of his approach.< >

关键词： Costs Hypercubes Computer architecture parallel processing Computer networks Switching circuits Partitioning algorithms Delay Routing Network topology

来源：评论

学校读者我要写书评

暂无评论

A parallel Algorithm to Construct Node-Independent Spanning Trees on the Line Graph of Locally Twisted Cube

A Parallel Algorithm to Construct Node-Independent Spanning ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Zhiyong Pan Baolei Cheng Jianxi Fan Huanwen Zhang School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9781665496407

An interconnection network can be abstracted into a graph, and the basic mathematical research in the graph can provide a good reference for the research in the practical application. The study of node-independent spanning trees (node-ISTs) in a graph has received extensive attention because of their application in reliable communication, fault-tolerant broadcasting and secure message distribution, and has achieved remarkable results on many special networks. But there are few results in the line graph of them. As one of the typical variations of hypercube, locally twisted cube has many excellent properties, whose line graph has all the advantages of locally twisted cube. So it makes sense to do some research on the line graph of locally twisted cube. In this paper, we propose a parallel algorithm to construct $2n-2$ node-ISTs rooted at node $[u,\ N(u, 2)]$ , where $u$ is an arbitrary node on locally twisted cube and $n\geq 1$ . And the correctness of our algorithm is proved.

关键词： Fault tolerance Fault tolerant systems programming NIST Broadcasting Hypercubes parallel architectures

来源：评论

学校读者我要写书评

暂无评论

Vertex-Disjoint Paths in BCDC Networks

Vertex-Disjoint Paths in BCDC Networks

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Xi Wang Jianxi Fan Suzhou Institute of Industrial Technology Suzhou China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun P.R. China School of Computer Science and Technology Soochow University Suzhou China

ISBN: (纸本)9781665496407

For any integer $n\geq 2,\ B_{n}$ , the $n$ -dimensional BCDC network, based on a class of BC networks, crossed cube, is a server-centric and high-performance data center network for mega data centers with manageable cabling complexity. Implementing vertex-disjoint paths has great value of application in fault-tolerance and multi-path routing of data center networks. In this paper, we construct $n$ vertex-disjoint paths joining every two distinct vertices in $B_{n}$ , whose maximum length is limited by $\lceil\frac{n}{2}\rceil+5$ , where the diameter of $B_{n}$ is $\lceil\frac{n+1}{2}\rceil+1$ . Our results are fundamental and essential for fault-tolerance and multi-path routing in BCDC networks.

关键词： Data centers Fault tolerance Fault tolerant systems programming Routing parallel architectures Complexity theory

来源：评论

学校读者我要写书评

暂无评论

Space optimal packet classification for 2D conflict-free filters

Space optimal packet classification for 2D conflict-free fil...

引用

international symposium on parallel architectures, algorithms and Networks (ISPAN)

作者： Chung Keung Poon Andy Kwok Department of Computer Science City University of Hong Kong Hong Kong China

ISBN: (纸本)0769521355

In this paper, we study the 2D packet classification problem for a set of conflict-free filters in an IP network. We design a linear space data structure with O(min{logiu loglogn, /spl radic/lognloglogn}) query time where n is the number of filters in the router and w is the number of bits in an IP address. This is the first optimal space data structure with poly-logarithmic query time for this problem. Our technique can also be extended to solve the binary dispatching problem in object-oriented programming.

关键词： Matched filters Computer science Data structures IP networks Nonlinear filters Dispatching Object oriented programming Routing Councils Cryptography

来源：评论

学校读者我要写书评

暂无评论

A GA-Based Energy Aware Virtual Machine Placement Algorithm for Cloud Data Centers

A GA-Based Energy Aware Virtual Machine Placement Algorithm ...

引用

international symposium on parallel architectures, algorithms and programming (PAAP)

作者： Xiaodong Wu School of Mathmatics and Computer Science Quanzhou Normal University Quanzhou China Fujian Provincial Key Laboratory of Data-Intensive Computing Key Laboratory of Intelligent Computing and Information Processing Fujian Province University Quanzhou China

ISBN: (纸本)9781665496407

Virtual machine placement (VMP) is among the important techniques to improve the energy efficiency of green cloud data centers. To address this issue, bionic optimization algorithms have been widely used. One of the most effective methods is to use the genetic algorithm (GA) to find the best or near-optimal solution for the VMP problem. In this paper, a GGA-based algorithm is proposed to solve the energy-aware VMP problem. The algorithm regards the VMP problem as BPP and strives to reduce the number of active hosts in order to reduce the system energy consumption. Further, since it is important to find the solution of VMP in a short time especially in the online scenario, several optimization strategies are developed and applied in the proposed algorithm to improve the convergence speed of the algorithm and reduce the execution time of the algorithm. The experimental results demonstrate that compared with the traditional genetic algorithm, our method can effectively decrease the number of iterations and improve the speed of seeking optimal solutions.

关键词： Data centers Cloud computing Energy consumption Heuristic algorithms Simulation programming Virtual machining

来源：评论

学校读者我要写书评

暂无评论

A computational model for message-passing

A computational model for message-passing

引用

international symposium on parallel Processing

作者： A. Sivasubramaniam U. Ramachandran H. Venkateswaran College of Computing Georgia Institute of Technology Atlanta GA USA

The article develops a framework for message-passing architectures consisting of a machine model called communicating random access machine (CRAM) and a programming paradigm. The CRAM model serves as a vehicle for the design and analysis of message-passing algorithms. The message-passing paradigm makes the mapping of algorithms that fit this paradigm onto message-passing architectures more natural.< >

关键词： Computational modeling Read-write memory Computer architecture Random access memory parallel architectures Phase change random access memory Memory architecture Algorithm design and analysis Message passing Multiprocessor interconnection networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共52页 << < 29 30 31 32 33 34 35 36 37 38 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：