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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

1,867 篇 会议
162 篇 期刊文献
10 册 图书
5 篇 科技报告

馆藏范围

2,044 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,146 篇 工学
- 826 篇 计算机科学与技术...
- 443 篇 软件工程
- 292 篇 电气工程
- 204 篇 控制科学与工程
- 165 篇 信息与通信工程
- 82 篇 机械工程
- 72 篇 电子科学与技术（可...
- 50 篇 动力工程及工程热...
- 36 篇 力学（可授工学、理...
- 36 篇 仪器科学与技术
- 36 篇 土木工程
- 33 篇 航空宇航科学与技...
- 30 篇 交通运输工程
- 24 篇 材料科学与工程（可...
- 23 篇 化学工程与技术
- 23 篇 生物工程
- 19 篇 建筑学
- 17 篇 冶金工程
- 17 篇 石油与天然气工程
- 17 篇 安全科学与工程
493 篇 理学
- 366 篇 数学
- 106 篇 物理学
- 83 篇 系统科学
- 41 篇 统计学（可授理学、...
- 40 篇 生物学
- 24 篇 化学
181 篇 管理学
- 144 篇 管理科学与工程(可...
- 45 篇 图书情报与档案管...
- 40 篇 工商管理
18 篇 经济学
- 18 篇 应用经济学
18 篇 医学
14 篇 法学
7 篇 教育学
7 篇 农学
3 篇 文学
3 篇 军事学

主题

354 篇 optimization
176 篇 genetic algorith...
171 篇 software algorit...
115 篇 software
109 篇 heuristic algori...
89 篇 algorithm design...
81 篇 particle swarm o...
68 篇 hardware
65 篇 computational mo...
56 篇 application soft...
54 篇 convergence
52 篇 computer archite...
51 篇 optimization met...
49 篇 design optimizat...
49 篇 prediction algor...
47 篇 accuracy
44 篇 mathematical mod...
39 篇 high performance...
37 篇 clustering algor...
36 篇 resource managem...

机构

12 篇 shenzhen univ co...
11 篇 nanjing univ sta...
8 篇 college of compu...
7 篇 university of ch...
6 篇 univ chinese aca...
6 篇 wuhan univ state...
6 篇 state key labora...
6 篇 tongji univ sch ...
5 篇 tianjin key labo...
5 篇 harbin institute...
5 篇 school of softwa...
5 篇 shenzhen univers...
5 篇 school of softwa...
4 篇 south china univ...
4 篇 department of pr...
4 篇 software college...
4 篇 school of busine...
4 篇 chinese acad sci...
4 篇 chinese acad sci...
4 篇 department of ma...

作者

7 篇 zhang jun
6 篇 lin qiuzhen
5 篇 mu bin
5 篇 yuan shijin
5 篇 dai haipeng
5 篇 zhang yunquan
4 篇 wang lei
4 篇 bernady o. apduh...
4 篇 li kenli
4 篇 wang wentao
4 篇 tian jun
4 篇 osvaldo gervasi
4 篇 zhan zhi-hui
4 篇 wang qian
4 篇 dou wanchun
4 篇 qian chao
4 篇 ana maria a. c. ...
4 篇 beniamino murgan...
4 篇 sanjay misra
4 篇 li keqin

语言

1,999 篇 英文
33 篇 其他
9 篇 中文
2 篇 俄文
1 篇 西班牙文

检索条件"任意字段=Conference on High Performance Algorithms and Software for Nonlinear Optimization"

共 2044 条记录，以下是1991-2000 订阅

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

详细简洁

排序：

CILP: An Arbitrary-bit Precision All-digital Compute-in-memory Solver for Integer Linear Programming Problems

CILP: An Arbitrary-bit Precision All-digital Compute-in-memo...

引用

Custom Integrated Circuits conference (CICC)

作者： Mengtian Yang Yipeng Wang Shanshan Xie Chieh-Pu Lo Meizhi Wang Sirish Oruganti Rishabh Sehgal Jaydeep P. Kulkarni The University of Texas at Austin Austin TX

ISBN: (数字)9798350394061

ISBN: (纸本)9798350394078

Integer Linear Programming (ILP) is an NP-complete combinatorial optimization problem (COP), suggesting that it is computationally challenging to solve due to its exponentially increased operations with scaling. As shown in Fig. 1, The ILP is relevant in various real-world scenarios such as computational biology [1], investment decision, automated driving, and electronic design automation [2]. An ILP solver aims to find a set of integer variables $(x)$ to maximize a linear objective function $(c\cdot x)$ , subject to a set of linear constraints $(A\cdot x\leq b)$ . With the increasingly wide usage of ILP, various new solving algorithms [3] have been proposed, but the performance are limited by substantial memory access. ILP coefficients are fixed during solving, but software solvers on cache-register architectures frequently access cache to reload coefficients because of small register file size, causing up to a $10^{14}\mathrm{x}$ disparity between stored and accessed memory bits. FPGA [4] and AISC [5] accelerated solvers improve the speed by customized processing element (PE), but they still need frequent accesses to Block-RAM or scratch pad. Compute-in-memory (CIM) solutions are well-suited for ILP solving which has extremely high data reuse, but existing CIM DNN accelerators incur precision loss with hardware tradeoffs, which is unacceptable for ILP where the feasibility checking must be correct. Previous all-digital CIM COP solver for Boolean variables [6] uses a customized $6\mathrm{T}$ -6T{###} $3\mathrm{T}$ cell, limiting their adaptability to different technologies.

关键词： Microprocessors software algorithms Computer architecture Integer linear programming In-memory computing Linear programming Common Information Model (computing)

来源：评论

学校读者我要写书评

暂无评论

An optimization for Distance Estimation in Real-Time with DM6437

An Optimization for Distance Estimation in Real-Time with DM...

引用

2012 4th International conference on Signal Processing Systems(ICSPS 2012)

作者： He Tian-xiang FU Xiao-ning Hou Guo-qiang School of Electromechanical Engineering Xidian University

The passive ranging system on monocular has earned its bright application prospect in modern opto-electronic countermeasures and traffic monitoring. This technology is characterized by using the imaging direction and the distance-related features in the target image to estimate distance by solving a proper equation [1] . The distance-related features could be obtained by making use of complex image processing algorithms [2] . Limited by the complexity and time-consuming of the algorithm, to realize such an algorithm in real-time is much difficult. To solve this problem, in addition to using high-performance image processing chip, optimization on program body is also a quite effective method. Taking into account the hardware characteristics of DM6437, the DSP chip, a simplified [3] Scale Invariant Feature Transform (SIFT [4] ) image matching algorithm was developed. On the other hand, a lot of effort has been done for optimization subroutine itself based on the characteristics of C64x+ DSP core, such as using intermediate variables, intrinsic operations, word access to short type data, the compiler settings, software pipelining and linear assembly. It is showed by our final experiments that the operation speed has been significantly improved. For an image sequence with size of 256×256 pixels, the operation speed was improved from 4 seconds per frame to 25 frames per second, which meets the requirements of real-time location algorithm perfectly while the ranging error is less than 7%.

关键词： video image, distance estimation, DM6437, optimization, SIFT

来源：评论

学校读者我要写书评

暂无评论

Energy Efficiency Maximization for Secure Live Video Streaming in UAV Wireless Networks

Energy Efficiency Maximization for Secure Live Video Streami...

引用

IEEE conference on Vehicular Technology (VTC)

作者： Lan Yi Jiansong Miao Tao Zhang Yushun Yao Xiangyun Tang Zaodi Song School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China School of Software Engineering Beijing Jiaotong University Beijing China School of Information Engineering Minzu University of China Beijing China North Automatic Control Technology Institute Taiyuan China

ISBN: (数字)9798350387414

ISBN: (纸本)9798350387421

Unmanned aerial vehicles (UAVs) have shown great potential in live video streaming applications, especially in surveillance and reconnaissance. However, ensuring high quality of service (QoS) remains a challenge due to the dynamic nature of wireless channels. In this paper, we tackle the crucial challenge of energy-efficient and secure UAV-enabled live video streaming. To maximize long-term energy efficiency, we propose a cross-layer optimization framework that coordinates the adjustment of video coding parameters, wireless resource allocation, and UAV trajectory planning. We formulate the joint optimization as a constrained Markov decision process (CMDP) to capture the complex interdependencies between video quality, energy usage, and security risks. We introduce a new performance metric that captures the trade-off between video quality and energy consumption. The core of our method is a customized first-order constrained policy optimization, which efficiently handle complex real-world constraints like UAV battery capacities and end-to-end transmission delays. Our approach achieves scalability and sample efficiency with minimal gradient information. Through extensive system modeling and simulations under various network conditions, we validate the effectiveness of the proposed method compared with existing reinforcement learning algorithms.

关键词： Video coding Wireless networks Quality of service Streaming media Autonomous aerial vehicles Energy efficiency Quality assessment

来源：评论

学校读者我要写书评

暂无评论

A Code Generation Algorithm for Affine Partitioning Framework

A Code Generation Algorithm for Affine Partitioning Framewor...

引用

International conference on Parallel and Distributed Systems (ICPADS)

作者： Shih-wei Liao Zhaohui Du Gansha Wu G. Lueh Microprocessor Technology Laboratories Intel Corporation Mission College Blvd Santa Clara CA USA

Multiprocessors are about to become prevalent in the PC world. Major CPU vendors such as Intel and Advanced Micro Devices have recently announced their imminent migration to multicore processors. Affine partitioning provides a systematic framework to find asymptotically optimal computation and data decomposition for multiprocessors, including multicore processors. This affine framework uniformly models a large class of high-level optimizations such as loop interchange, reversal, skewing, fusion, fission, re-indexing, scaling, and statement reordering. However, the resulting code after applying affine transformations tends to contain more loop levels and complex conditional expressions. This impacts performance, code readability and debuggability for both programmers and compiler developers. To facilitate the adoption of affine partitioning in industry, we address the above practical issues by proposing a salient two-step algorithm: coalesce and optimize. The coalescing algorithm maintains valid code throughout and improves readability and debuggability. We demonstrate with examples that the optimization algorithm simplifies the resulting loop structures, conditional expressions and array access functions and generates efficient code

关键词： Partitioning algorithms Multicore processing Application software Microprocessors Programming profession Program processors Concurrent computing Parallel processing Educational institutions Central Processing Unit

来源：评论

学校读者我要写书评

暂无评论

Towards Energy-efficient Container Data Center: An Online Migratability-aware Orchestrator

Towards Energy-efficient Container Data Center: An Online Mi...

引用

International conference on Mobile Ad-hoc and Sensor Networks, MSN

作者： Shengjie Wei Jiayi Li Tuo Cao Sheng Zhang Zhuzhong Qian State Key Lab. for Novel Software Technology Nanjing University China Jiangsu Frontier Electric Technology Co. Ltd. China

The growing demands for cloud computing have led to high power consumption in data centers. To save power, existing works attempt to reduce the number of active servers via scheduling or migrating VMs. Meanwhile, owing to the lightweight, highly-portable and scalable properties, containers have been widely used in data centers. However, comparing with VMs, containers show the migratability property, i.e., some containers can not be consolidated by migration. Thus, one has to take this property into consideration when making scheduling and migrating decisions. To this end, this paper studies the energy-efficient container orchestration problem in data centers. We frame container scheduling and migration as a single problem, and take the migratability of containers into account. We propose an online container orchestration algorithm, based on Lyapunov optimization and Markov approximation. It works without requiring future information and achieves a provable performance guarantee. Simulation results show that our algorithm can effectively reduce the power consumption of data centers.

关键词： Data centers Power demand Costs Simulation Containers Markov processes Approximation algorithms

来源：评论

学校读者我要写书评

暂无评论

Simulation of Camera Visual Range Based on Three-dimensional Model

Simulation of Camera Visual Range Based on Three-dimensional...

引用

Power, Electrical Engineering, Electronics and Control (PEEEC), International conference on

作者： Yating Wang Hui Yuan Chen Min Sheng State Grid Jiangxi Electric Power Co. Ltd. Economic and Technological Research Institute Nanchang Jiangxi China

ISBN: (数字)9798350378917

ISBN: (纸本)9798350378924

This study proposes a camera visibility range simulation method based on 3D models, aimed at improving the accuracy of traditional 2D plane estimation methods to more realistically reflect the camera’s visibility range in three-dimensional space. The study employs various technical means to acquire 3D data and construct high-quality 3D models, including the use of professional 3D modeling software and laser scanning technology. At the same time, by setting and adjusting key parameters such as the camera’s focal length (FL), field of view (FOV), and installation position, the accuracy and authenticity of the simulation results are ensured. In the simulation calculation of visual range, an innovative method combining ray tracing and visual field analysis is adopted in this study, which realizes the accurate simulation and optimization of camera visual range. The ray tracing technology is used to simulate the propagation path of light in 3D model, and the dynamic visual field adjustment algorithm is introduced, which can automatically adjust the visual field of the camera according to the monitoring requirements, and improve the flexibility and efficiency of the monitoring system. In order to verify the effectiveness of this research method, 3D models of different scenes such as shopping malls, parks, office buildings and residential areas are selected for experiments. The experimental results show that this research method can achieve high accuracy and adaptability in different scenarios, and can achieve the best coverage of monitoring targets. Compared with the traditional manual calculation or simple software simulation, this research method has higher accuracy and stronger adaptability, which significantly improves the performance of the monitoring system. This research not only brings new breakthroughs and progress in the field of camera visual range simulation, but also provides support for the technical development in the fields of virtual reality and augmented

关键词： Visualization Solid modeling Three-dimensional displays Accuracy Heuristic algorithms Transportation Ray tracing Cameras software Monitoring

来源：评论

学校读者我要写书评

暂无评论

BCLB: A Scalable and Cooperative Layer-4 Load Balancer for Data Centers

BCLB: A Scalable and Cooperative Layer-4 Load Balancer for D...

引用

International conference on Distributed Computing Systems

作者： Shu Yang Xinze Wu Laizhong Cui College of Computer Science and Software Engineering Shenzhen University Shenzhen China

ISBN: (数字)9798350386059

ISBN: (纸本)9798350386066

Nowadays, load balancing is more and more important for huge data centers. Most data centers usually adopt a software-based load balancer (LB), which consumes too many server resources and does not scale with the increasing traffic volume. However, there is an increased demand for layer-4 load balancers, which need to check more bits in packet headers. Although hardware-based load balancers can meet the requirements, they are much more expensive. During the past years, data centers frequently update their devices, including kinds of switches. Thus, there exists a huge number of obsolete switches, some of which are in good condition and equipped with high-performance storage like SRAM (Static Random Access Memory). In this paper, we proposed BCLB (Bit-based Collaborative Load Balancer), a new cooperative LB, which builds more powerful load balancing based on existing switches. Different with previous cooperative mechanisms that distribute rules to different LBs, BCLB lets switches cooperate based on bits. Many switches along the data path check different bits, and cooperatively check all bits in 5-tuple (which would be 296 bits in IPv6) for layer-4 packet header. In this way, rule updating will not influence the load balancing in BCLB. To optimize the performance of BCLB, we formulate the problem as an optimization problem, then we propose a dynamic programming algorithm to solve it. Finally, we conduct comprehensive simulations using both real-world traffic datasets and a P4-based prototype, the results show that BCLB performs much better than previous rule-based cooperative schemes.

关键词： Data centers Heuristic algorithms Random access memory Prototypes Distributed databases Load management Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

Memory power optimization on different memory address mapping schemas

Memory power optimization on different memory address mappin...

引用

IEEE International conference on Embedded and Real-Time Computing Systems and Applications (RTCSA)

作者： Zongwei Zhu Xi Li Chao Wang Xuehai Zhou Department of Computer Science and Technology University of Science and Technology of China (USTC) Hefei China

Since memory accounts for a large and increasing fraction of the energy consumed by computers, memory manufacturers have developed memory devices with different power/work modes. For taking full advantage of these modes, more and more creditable hardware or software power mode control algorithms have been proposed. In this paper, by analyzing the effects of power mode control polices on different memory address mapping schemas (schema is used to translate a given physical address to a specific memory cell in DRAM system), we find that most previous power mode control policies are sensitive to mapping schemas. Therefore, in order to manage these power modes on different mapping schemas more effectively, we divide them into two categories: high-bit multi-access cross memory (HMCM) and low-bit multi-access cross memory (LMCM), and then take a targeted optimization. For the former schema, a rank-sensitive buddy system (RS-Buddy) was proposed to cluster pages together to prolong memory modules' low power time. For the latter, we introduce a comprehensive solution named as MSPA. It adopts a memory address segmentation module (MASM) to split memory into many regions configured as different mapping schemas. And with the help of an OS power-aware memory allocator (PAMA), MSPA can dynamically allocate one application's memory from its preferred region to balance power and performance. By performing extensive experiments on practical platform for HMCM while on simulator for LMCM, the results of HMCM show that RS-Buddy can optimize the power efficiency from 2% to 22%. Furthermore, the simulation results of LMCM demonstrate that MSPA can further improve the power efficiency from 3% to 17% when combined with other previous state-of-the-art studies.

关键词： Random access memory Memory management Hardware Power demand optimization Bandwidth Switches

来源：评论

学校读者我要写书评

暂无评论

A Game Theoretic Approach to Task Offloading for Multi-Data-Source Tasks in Mobile Edge Computing

A Game Theoretic Approach to Task Offloading for Multi-Data-...

引用

IEEE International conference on Big Data and Cloud Computing (BdCloud)

作者： Shuyu Chen Shiyong Sun Haopeng Chen Jinteng Ruan Ziming Wang School of Software Shanghai Jiao Tong University Shanghai China The 54th Research Institute of China Electronics Technology Group Corporation Shijiazhuang China

Mobile edge computing(MEC) is becoming an appealing paradigm due to its low-latency and low-overhead computing services offered to users. In MEC scenarios, most user data are usually stored on multiple edge nodes for their privacy, large scale, and unstructured nature instead of being centralized stored in the cloud datacenter. Consequently, we focus on the multi-data-source tasks and propose a game-theoretic approach to task offloading for task accomplishment. We formulate the multi-data-source task offloading as a unified task offloading optimization problem. The traditional centralized optimal solutions have the issues of high complexity, data privacy, and poor performance. To solve these issues, we decompose the global optimization problem into sub-optimization problems which each edge node can solve. Furthermore, we construct a non-cooperative game-theoretic offloading framework and prove the existence of Nash equilibrium. We then design a distributed task offloading strategy to find the Nash equilibrium, which combines an optimal subtask partial offloading algorithm for each node. We conduct simulation experiments and demonstrate that our proposed approach has better convergence, lower algorithm overhead, and superior performance in task offloading than other typical algorithms.

关键词： Data privacy Multi-access edge computing Computational modeling Simulation Games Transforms Nash equilibrium

来源：评论

学校读者我要写书评

暂无评论

Implementation and evaluation of a 3D OSEM and median root prior (3D OSEM-MRP) reconstruction algorithm

Implementation and evaluation of a 3D OSEM and median root p...

引用

IEEE Symposium on Nuclear Science (NSS/MIC)

作者： V. Bettinardi E. Pagani S. Alenius M. Teras M.C. Gilardi C. Labbe M. Jacobsen K. Thielemans M. Sadki C. Morel R. Levkovitz A. Ben-Tal T. Spinks G. Mitra F. Fazio Scientific Institute H.S.Raffaele INB-CNR University of Milano-Bicocca Milan Italy Signal Proc. Laboratory Tampere University of Technology Finland TUKS PET Center Finland Geneve Cantonal Hospital Switzerland MRC-CU Hammersmith Hospital Brunei University London UK Brunei University London UK Optimization Center Technion MINERVA Haifa Israel

A 3D OSEM and Median Root Prior (3D OSEM-MRP) algorithm has been evaluated for the reconstruction of 3D PET studies. The algorithm was implemented using the software package developed during the EU project PARAPET. Evaluation was performed using experimental phantom data simulating in terms of shape and size PET brain studies. For each phantom, high (/spl sim/200 Mcounts) and low (<50 Mcounts) count statistics 3D PET data were acquired. The performances of the algorithm were evaluated by calculating simple figures of merit (e.g. contrast, coefficient of variation, activity ratio between two regions) based on the use of regions of interest. The performances of the 3D OSEM-MRP were compared with those of a "pure" 3D OSEM and of the PROMIS algorithm, using different reconstruction filters. In all the considered experimental situations, 3D OSEM-MRP shows: 1) to converge to a stable solution, 2) to be quantitatively accurate, 3) to be very effective in noise reduction, particularly for low statistics data, 4) to maintain "good" spatial resolution. Compared with the 3D OSEM and PROMIS algorithms, 3D OSEM-MRP provides better or comparable results depending on the configuration parameters used for the reconstruction of the images.

关键词： Image reconstruction Positron emission tomography performance evaluation Imaging phantoms Statistics software algorithms software packages Brain modeling Shape Filters

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共205页 << < 196 197 198 199 200 201 202 203 204 205 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：