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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

74 篇 会议
14 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

51 篇 工学
- 36 篇 计算机科学与技术...
- 32 篇 软件工程
- 18 篇 信息与通信工程
- 14 篇 电子科学与技术（可...
- 12 篇 控制科学与工程
- 9 篇 电气工程
- 5 篇 生物医学工程（可授...
- 5 篇 生物工程
- 4 篇 仪器科学与技术
- 3 篇 光学工程
- 2 篇 材料科学与工程（可...
- 1 篇 机械工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 建筑学
- 1 篇 土木工程
27 篇 理学
- 19 篇 数学
- 12 篇 物理学
- 7 篇 统计学（可授理学、...
- 5 篇 生物学
- 3 篇 系统科学
- 1 篇 化学
- 1 篇 大气科学
12 篇 管理学
- 9 篇 管理科学与工程(可...
- 5 篇 图书情报与档案管...
- 3 篇 工商管理
6 篇 医学
- 5 篇 基础医学(可授医学...
- 4 篇 临床医学
1 篇 经济学
- 1 篇 应用经济学
1 篇 法学
- 1 篇 社会学
1 篇 军事学

主题

5 篇 wireless sensor ...
5 篇 computer network...
4 篇 routing
4 篇 predictive model...
3 篇 computer science
3 篇 base stations
3 篇 traffic control
3 篇 computer archite...
3 篇 throughput
3 篇 telecommunicatio...
3 篇 data engineering
3 篇 laboratories
3 篇 switches
3 篇 frequency
3 篇 analytical model...
3 篇 classification a...
3 篇 hardware
3 篇 batteries
3 篇 measurement
3 篇 communication ne...

机构

3 篇 computer enginee...
3 篇 dept. of electri...
2 篇 school of mathem...
2 篇 computer enginee...
2 篇 department of co...
2 篇 department of ps...
2 篇 cream group stat...
2 篇 department of li...
2 篇 department of co...
2 篇 mobile telecommu...
2 篇 department of co...
2 篇 inst. of communi...
2 篇 department of co...
2 篇 department of co...
2 篇 laboratory for c...
2 篇 institute of ope...
2 篇 comput. eng. & n...
1 篇 department of co...
1 篇 departments of n...
1 篇 school of cognit...

作者

5 篇 chung-ho chen
3 篇 may martin
3 篇 guo hong
3 篇 karlsson gunnar
3 篇 lenders vincent
2 篇 lee hsiao ping
2 篇 brakensiek anja
2 篇 shih ching hua
2 篇 xie shengdong
2 篇 tang chuan yi
2 篇 sven tomforde
2 篇 kuan-chung chen
2 篇 chen chung-ho
2 篇 i-hsien liu
2 篇 sheu tzu fang
2 篇 lars wolf
2 篇 rigoll gerhard
2 篇 kosmala andreas
2 篇 georg von zengen
2 篇 luo bin

语言

86 篇 英文
1 篇 其他
1 篇 中文

检索条件"机构=Inst. of Communication Networks and Computer Engineering"

共 88 条记录，以下是11-20 订阅

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

详细简洁

排序：

Optimization of Stride Prefetching Mechanism and Dependent Warp Scheduling on GPGPU

Optimization of Stride Prefetching Mechanism and Dependent W...

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Tsung-Han Tsou Dun-Jie Chen Sheng-Yang Hung Yu-Hsiang Wang Chung-Ho Chen Inst. of Computer and Communication Engineering Dept. of Electrical Engineering National Cheng-Kung University Taiwan

ISBN: (数字)9781728133201

ISBN: (纸本)9781728133218

In this paper, we propose a data prefetching scheme, History-Awoken Stride (HAS) prefetching, optimized with a warp scheduler, Prefetched-Then-Executed (PTE), and evaluate the performance on the platform that we developed. Our platform is a single inst.uction, multiple thread (SIMT) GPGPU environment, supporting OpenCL 1.2 runtime and TensorFlow framework with CUDA-on-CL technology. Enormous amount of executing threads in GPU demands critical memory performance. HAS exploits history table of related memory accesses in intra-warp and inter-warp of the same workgroup as well as among workgroups, and uses address strides and warp status to monitor the prefetching progress of the executed warp. PTE precisely issues warps according to prefetching status from HAS. The experimental results of LeNet-5 inference and 11 PolyBench test programs on CAS-GPU show that our mechanism can achieve an average IPC performance improvement of 10.4%, and 7.8% reduction in data cache miss rate. The prefetch accuracy can reach 67.7%, and the proportion of prefetch request arrived at the appropriate time reaches 48.2%.

关键词： Prefetching History Kernel Graphics processing units Benchmark testing Central Processing Unit

来源：评论

学校读者我要写书评

暂无评论

A Comparative Study of Z- Transform and Fourier Transform applied on Medical Images for Detection of Cancer Segments 3

A Comparative Study of Z- Transform and Fourier Transform ap...

引用

3rd International Conference on Electronics, Materials engineering and Nano-Technology, IEMENTech 2019

作者： Santra, Soumen Mandal, Surajit Das, Kunal Bhattacharjee, Joy Deyasi, Arpan Dept. of Computer Application Techno India International Kolkata India B.P.Poddar Inst. of Mgmt. and Technology Dept. of Electronics and Communication Engineering Kolkata India Narula Institute of Technology Dept. of Computer Science and Communication Engineering Kolkata India A.P.C College Dept. of Electronic Science Barasat India RCC Institute of Information Technology Dept. of Electronics and Communication Engineering Kolkata India

ISBN: (纸本)9781728155432

A preliminary investigation is carried out by applying Z-transform technique on different types of images with sole intention to record the z-score of any binary image. Bandwidth of the images are computed, and compared with that obtained from Fourier technique. Length of z-score matrix is graphically represented. Result is also analyzed for smooth, shiny and rough images. This preliminary investigation will help in sending multimedia content, precisely images through network and in signal processing which helps for the segments of cancerous portion. © 2019 IEEE.

关键词： Medical imaging

来源：评论

学校读者我要写书评

暂无评论

Multi-Objective Discrete Migratory Bird Optimizer for Stochastic Disassembly Line Balancing Problem

Multi-Objective Discrete Migratory Bird Optimizer for Stocha...

引用

IEEE International Conference on Systems, Man and Cybernetics

作者： GuiBin Qin XiWang Guo MengChu Zhou ShiXin Liu Liang Qi College of Computer and Communication Engineering Liaoning Shihua University Fushun China New Jersey Inst. of Tech. Newark NJ USA Tongji University Shanghai China College of Information Science and Engineering Northeastern University Shenyang China Shandong University of Science and Technology Qingdao China

ISBN: (数字)9781728185262

ISBN: (纸本)9781728185279

Timely and proper recycling of end-of-life products promotes the sustainable development of our human society. Cost-effective and energy-efficient disassembly is a crucial step to realize such recycling. A disassembly process is usually uncertain because of the different quality of subassemblies in an end-of-life product. This work considers resource constraints and operation failure in such a process. A novel mathematical model is formulated with the objectives to maximize profit, minimize energy consumption, and minimize the total need for disassembly resources. A new solution method called a multi-objective discrete migratory bird optimizer is proposed to solve it. A real-life case is given to show its effectiveness and feasibility. Experimental results show that the superiority of the proposed algorithm over a well-known nondominated sorting genetic algorithm II and a multi-objective grey wolf optimizer.

关键词： Energy consumption Uncertainty Stochastic processes Birds Recycling Sustainable development Sorting

来源：评论

学校读者我要写书评

暂无评论

Subsequence Search Considering Duration and Relations of Events in Time Interval-Based Events Sequences

Subsequence Search Considering Duration and Relations of Eve...

引用

International Conference on Data Science and Advanced Analytics (DSAA)

作者： Cheng-Wei Yang Bijay Prasad Jaysawal Jen-Wei Huang Inst. of Computer and Communication Engineering National Cheng Kung University Tainan Taiwan

Previous works of subsequence search in time interval-based events sequences have focused on the relations among events without considering the duration of each event. However, the same event with different time duration may lead to different results. In this work, we propose an index structure referred to as Endpoint Index based on the concept of inverted index to efficiently extract the Time Interval-based Event with Duration, TIED, subsequence. TIED subsequence search considers duration of event intervals in conjunction with relation among events. This makes the results of TIED subsequence search more accurate than those obtained using traditional search methods. In addition, we propose an algorithm SSD, Subsequence Search with Duration, incorporating a pruning strategy to search TIED subsequences efficiently. For the performance evaluation, we modify previous algorithms to compare with our proposed methods SSD_Endpoint and SSD_ER. The experimental results demonstrate that SSD_Endpoint and SSD_ER are more efficient than state-of-the-art algorithms.

关键词： Indexes Pattern matching Time measurement Home appliances Algorithm design and analysis Transforms

来源：评论

学校读者我要写书评

暂无评论

Robust Multi-Exposure Image Fusion: A Structural Patch Decomposition Approach

Robust Multi-Exposure Image Fusion: A Structural Patch Decom...

引用

作者： Ma, Kede Li, Hui Yong, Hongwei Wang, Zhou Meng, Deyu Zhang, Lei Department of Electrical and Computer Engineering University of Waterloo WaterlooONN2L 3G1 Canada Department of Computing Hong Kong Polytechnic University Hong Kong Hong Kong Department of Computing. Hong Kong Polytechnic University Hong Kong Hong Kong Institute for Information and System Sciences and Ministry of Education Key Laboratory of Intelligent Networks and Network Security Xi'an Jiaotong University Xi'an710049 China Inst. for Info. and Syst. Sci. and Min. of Educ. Key Lab. of Intelligent Networks and Netwk. Secty. Xi'an Jiaotong University Xi'an710049 China

We propose a simple yet effective structural patch decomposition approach for multi-exposure image fusion (MEF) that is robust to ghosting effect. We decompose an image patch into three conceptually independent components: signal strength, signal structure, and mean intensity. Upon fusing these three components separately, we reconstruct a desired patch and place it back into the fused image. This novel patch decomposition approach benefits MEF in many aspects. First, as opposed to most pixel-wise MEF methods, the proposed algorithm does not require post-processing steps to improve visual quality or to reduce spatial artifacts. Second, it handles RGB color channels jointly, and thus produces fused images with more vivid color appearance. Third and most importantly, the direction of the signal structure component in the patch vector space provides ideal information for ghost removal. It allows us to reliably and efficiently reject inconsistent object motions with respect to a chosen reference image without performing computationally expensive motion estimation. We compare the proposed algorithm with 12 MEF methods on 21 static scenes and 12 deghosting schemes on 19 dynamic scenes (with camera and object motion). Extensive experimental results demonstrate that the proposed algorithm not only outperforms previous MEF algorithms on static scenes but also consistently produces high quality fused images with little ghosting artifacts for dynamic scenes. Moreover, it maintains a lower computational cost compared with the state-of-The-Art deghosting schemes.11The MATLAB code of the proposed algorithm will be made available online. Preliminary results of Section III-A [1] were presented at the IEEE International Conference on Image Processing, Canada, 2015. © 1992-2012 IEEE.

关键词： Image fusion

来源：评论

学校读者我要写书评

暂无评论

Composite FDIA and topology attack on the electricity market

Composite FDIA and topology attack on the electricity market

引用

IEEE General Meeting Power& Energy Society

作者： Gaoqi Liang Steven R. Weller Junhua Zhao Fengji Luo Yang Dong Zhao Center for Intelligent Electricity Networks (CIEN) University of Newcastle Callaghan NSW Australia School of Electrical Engineering and Computer Science University of Newcastle Callaghan NSW Australia Chinese University of Hong Kong (Shenzhen) Shenzhen Guangdong China School of Civil Engineering The University of Sydney Sydney NSW Australia CSG Electr. Power Res. Inst. Guangzhou China

Cyber-attacks pose significant hazards to the secure and economic operation of modern power systems. This paper proposes a composite false data injection attack (FDIA) and cyber topology attack capable of disturbing conventional transactions in the electricity market. The Australian electricity market mechanism is considered, wherein each trading period is comprised of six 5-minute security-constraint economic dispatch (SCED) intervals. In the proposed attack, the manipulation of cyber-topology information over the 30-minute horizon is considered, with the attack objective being the malicious increase in the costs borne by customers in the market. The proposed attack poses no security threat to the power system, affecting only the economic costs to customers. A defining feature of the proposed algorithm is the joint consideration of both topology error processing and bad data detection constraints in order to ensure validity of the proposed attack. The differential evolution (DE) algorithm is used to find the corresponding attack strategies. Case studies are conducted to validate the proposed attack methodology.

关键词： Smart grids Topology Security Electricity supply industry TV Load flow DH-HEMTs

来源：评论

学校读者我要写书评

暂无评论

Dynamic SIMD re-convergence with paired-path comparison

Dynamic SIMD re-convergence with paired-path comparison

引用

International Symposium on Circuits and Systems

作者： Yun-Chi Huang Kuan-Chieh Hsu Wan-shan Hsieh Chen-Chieh Wang Chia-Han Lu Chung-Ho Chen Inst. of Computer and Communication Engineering National Cheng-Kung University Tainan Taiwan Industrial Technology Research Institute Hsinchu Taiwan

ISBN: (纸本)9781479953424

SIMD divergence is one of the critical factors that decrease the hardware utilization in contemporary GPGPUs (General Purpose Graphic Processor Unit). Both the re-convergence scheme and control flow detection have to be well considered. In the emerging HSA (Heterogeneous System Architecture) platform, we develop an effective dynamic stack-based re-convergence scheme that can be implemented without the insertion of re-convergence inst.uctions generated by the finalizer. The stack keeps track of the minimal necessary information of the taken and non-taken paths;the additional end-of-branch inst.uction insertion is no longer required under our design. Using the scheme we propose, the divergent warp dynamically re-converges at opportunistic re-convergence points. The activity factor improves for 13.36% on average from opportunistic early re-convergence in the unstructured control flow. Our design has eased the development of a finalizer that no longer needs to reason about the re-convergence point after a branch divergence, especially for unstructured control flow.

关键词： warp Branch divergence GPGPU HSA SIMD

来源：评论

学校读者我要写书评

暂无评论

Universal 2-State 24-Neighborhood Asynchronous Cellular Automaton with Inner-Independent Open Rule

Universal 2-State 24-Neighborhood Asynchronous Cellular Auto...

引用

International Symposium on Computing and Networking (CANDAR)

作者： Susumu Adachi Jia Lee Ferdinand Peper Hiroshi Umeo College of Computer Science Chong Qing University China Center for Inf. & Neural Networks Nat. Inst. of Inf. & Commun. Japan Dept. of Computer Science Osaka Electro-Communication University Japan

ISBN: (纸本)9781509026562

This paper proposes a computationally universal two-dimensional square-lattice asynchronous cellular automaton, in which cells have merely two states. The transition rule of a cell is specified by the pattern of the cells or its rotation-symmetric or reflection-symmetric rules included in distances 1 and 2 Moore neighborhood, which does not include its own cell (inner-independent). In a former model, we defined only the rules where the neighboring patterns are taken into account in computation. In the current model, the transition rule is an open rule, which is defined completely in terms of updating 0 or 1. Universality of the model is proven through the construction of a glider and three circuit primitives on the cell space, which are universal for the class of Delay-Insensitive circuits. Correct operation of the circuit is proven through a validity check algorithm which checks all generated patterns from an initial configuration to a final configuration of the operation. As a result, the number of rules to update to 1 is found to be 1618, not including the rotation-symmetric and reflection-symmetric versions of the rules. We show how to determine the open rules of the model, and how to define the energy function to obtain an energy evolution during the operation of the circuit.

关键词： Computational modeling Integrated circuit modeling Automata Delays Radiation detectors computer science Asynchronous circuits

来源：评论

学校读者我要写书评

暂无评论

A graph theoretic characterization of perfect attackability and detection in Distributed Control Systems

A graph theoretic characterization of perfect attackability ...

引用

American Control Conference

作者： Sean Weerakkody Xiaofei Liu Sang H. Son Bruno Sinopoli Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA USA 15213 Department of Information and Communication Engineering Daegu Gyeongbuk Inst. Of Science and Technology (DGIST) Dalseong-Gun Korea

ISBN: (纸本)9781467386838

This paper is concerned with the analysis and design of secure distributed control systems (DCS) in the face of integrity attacks on sensors and controllers by external attackers or insiders. In general a DCS consists of many heterogenous components and agents including sensors, actuators, and controllers. Due to its distributed nature, some agents may start misbehaving to disrupt the system. This paper first reviews necessary and sufficient conditions for deterministic detection of integrity attacks carried out by any number of malicious agents, based on the concept of left invertibility of structural control systems. It then develops a notion equivalent to structural left invertibility in terms of vertex separators of a graph, which allows a designer to efficiently determine if a network is perfectly attackable. This tool is then leveraged to design minimal communication networks for DCSs, which ensure that an adversary cannot generate undetectable attacks. Numerical examples are included to illustrate these results.

关键词： Observers Detectors Sensor systems Particle separators Decentralized control Sensor systems decentralised control control systems Particle separators Observers Distributed control systems Controllers networks(communications) Agents Reversibility detector

来源：评论

学校读者我要写书评

暂无评论

Trustingness & trustworthiness: A pair of complementary trust measures in a social network

Trustingness & trustworthiness: A pair of complementary trus...

引用

International Conference on Advances in Social Network Analysis and Mining, ASONAM

作者： Atanu Roy Chandrima Sarkar Jaideep Srivastava Jisu Huh Dept. of Computer Science & Engineering University of Minnesota Twin Cities Qatar Computing Research Inst. Doha Qatar School of Journalism & Mass Communication University of Minnesota Twin Cities

ISBN: (纸本)9781509028474

The increase in analysis of real life social networks has led to a better understanding of the ways humans socialize in a group. Since trust is an important part of any social interaction, researchers use such networks to understand the nuances of trust relationships. One of the major requirements in trust applications is identifying the trustworthy actors in these networks. This paper proposes a pair of complementary measures that can be used to measure trust scores of actors in a social network using involvement of social networks. Based on the proposed measures, an iterative matrix convergence algorithm is developed that calculates the trustingness and the trustworthiness of each actor in the network. Trustingness of an actor is defined as the propensity of an actor to trust his neighbors in the network. Trustworthiness, on the other hand, is defined as the willingness of the network to trust an individual actor. The algorithm is proposed based on the idea that a person having higher trustingness score contributes to the trustworthiness of its neighbors to a lower degree. Conversely, a higher trustworthiness score is a result of lots of neighbors linked to the actor having low trustingness scores. The algorithm runs in O(k × |E|) time where k denotes the number of iterations and |E| denotes the number of edges in the network. Moreover, the paper shows that the algorithm converges to a finite value quickly. Finally the proposed scores for trust prediction is implemented for various social networks and is shown that the proposed algorithm performs better (average 5%) than the state of the art trust scoring algorithms. The full version of the paper along with the coding implementation can be found at [3].

关键词： trusted computing computational complexity convergence iterative methods matrix algebra social networking (online) actor Social networks iterative methods Nonprofit Organizations trust Trust matrix algebra Social Media complexity classes Converge Neighbor

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共9页 << < 1 2 3 4 5 6 7 8 9 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：