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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

7,642 篇 会议
333 篇 期刊文献
250 册 图书

馆藏范围

8,225 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

4,047 篇 工学
- 2,991 篇 计算机科学与技术...
- 1,847 篇 软件工程
- 985 篇 电气工程
- 581 篇 控制科学与工程
- 350 篇 信息与通信工程
- 336 篇 电子科学与技术（可...
- 188 篇 机械工程
- 87 篇 仪器科学与技术
- 78 篇 化学工程与技术
- 49 篇 生物医学工程（可授...
- 48 篇 材料科学与工程（可...
- 41 篇 生物工程
- 37 篇 动力工程及工程热...
- 37 篇 交通运输工程
- 36 篇 土木工程
- 36 篇 航空宇航科学与技...
- 33 篇 建筑学
- 33 篇 环境科学与工程（可...
- 31 篇 安全科学与工程
927 篇 理学
- 730 篇 数学
- 142 篇 系统科学
- 98 篇 物理学
- 97 篇 统计学（可授理学、...
- 68 篇 生物学
488 篇 管理学
- 398 篇 管理科学与工程(可...
- 121 篇 工商管理
- 99 篇 图书情报与档案管...
57 篇 医学
- 46 篇 临床医学
46 篇 经济学
- 41 篇 应用经济学
32 篇 法学
29 篇 教育学
- 29 篇 教育学
20 篇 文学
20 篇 农学
6 篇 艺术学
5 篇 军事学

主题

1,298 篇 programming
768 篇 linear programmi...
579 篇 programming prof...
487 篇 application soft...
485 篇 parallel program...
374 篇 computer archite...
371 篇 computer science
361 篇 hardware
351 篇 dynamic programm...
311 篇 software systems
311 篇 logic programmin...
269 篇 software enginee...
267 篇 concurrent compu...
265 篇 optimization
258 篇 computational mo...
244 篇 object oriented ...
239 篇 parallel process...
232 篇 control systems
207 篇 costs
198 篇 operating system...

机构

19 篇 department of el...
16 篇 carnegie mellon ...
16 篇 school of electr...
12 篇 school of electr...
11 篇 ibm thomas j. wa...
10 篇 georgia inst tec...
10 篇 department of el...
9 篇 department of el...
9 篇 oak ridge nation...
9 篇 department of el...
8 篇 univ hong kong d...
8 篇 institute of dig...
7 篇 department of el...
7 篇 chair for progra...
7 篇 department of co...
7 篇 department of co...
7 篇 department of co...
6 篇 inria
6 篇 school of comput...
6 篇 department of el...

作者

24 篇 steffen bernhard
14 篇 w.-s. lu
13 篇 liu derong
12 篇 anon
11 篇 josef börcsök
10 篇 wei qinglai
9 篇 bernhard steffen
9 篇 wu-sheng lu
9 篇 tiziana margaria
9 篇 margaria tiziana
8 篇 p. hasler
8 篇 a. antoniou
8 篇 m.r. lyu
8 篇 derong liu
8 篇 lu w.-s.
7 篇 wu youfeng
7 篇 t.m. khoshgoftaa...
7 篇 k.h. kim
7 篇 sitek pawel
7 篇 leucker martin

语言

8,069 篇 英文
100 篇 其他
33 篇 中文
19 篇 葡萄牙文
5 篇 西班牙文

检索条件"任意字段=International Symposium on Programming and Systems"

共 8225 条记录，以下是61-70 订阅

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

详细简洁

排序：

A Benchmark Suite for Improving Performance Portability of the SYCL programming Model

A Benchmark Suite for Improving Performance Portability of t...

引用

IEEE international symposium on Performance Analysis of systems and Software (ISPASS)

作者： Jin, Zheming Vetter, Jeffrey S. Oak Ridge Natl Lab Oak Ridge TN 37830 USA

ISBN: (纸本)9798350397390

SYCL is a portable programming model for multivendor computing devices. Portability is critical for its success. The heterogeneous computing benchmark suite (HeCBench) is a collection of samples, benchmarks, and miniapplications from many open-source projects for heterogeneous computing. We hope that HeCBench is useful for understanding and improving performance portability in the development of the SYCL ecosystem. This abstract is a summary of the background, use cases, improvement, and future work of the benchmark suite.

关键词： Benchmark SYCL Portability

来源：评论

学校读者我要写书评

暂无评论

CEDR-API: Productive, Performant programming of Domain-Specific Embedded systems

CEDR-API: Productive, Performant Programming of Domain-Speci...

引用

37th IEEE international Parallel and Distributed Processing symposium (IPDPS)

作者： Mack, Joshua Gener, Serhan Hassan, Sahil Suluhan, H. Umut Akoglu, Ali Univ Arizona ECE Tucson AZ 85721 USA

ISBN: (纸本)9798350311990

As the computing landscape evolves, system designers continue to explore design methodologies that leverage increased levels of heterogeneity to push performance within limited size, weight, power, and cost budgets. One such methodology is to build Domain-Specific System on Chips (DSSoCs) that promise increased productivity through narrowed scope of their target application domain. In previous works, we have proposed CEDR, an open source, unified compilation and runtime framework for DSSoC architectures that allows applications, scheduling heuristics, and accelerators to be co-designed in a cohesive manner that maximizes system performance. In this work, we present changes to the application development workflow that enable a more productive and expressive API-based programming methodology. These changes allow for more rapid integration of new applications without sacrificing application performance. Towards the design of heterogeneous SoCs with rich set of accelerators, in this study we experimentally study the impact of increase in workload complexity and growth in the pool of compute resources on execution time of dynamically arriving workloads composed of real-life applications executed over architectures emulated on Xilinx ZCU102 MPSoC and Nvidia Jetson AGX Xavier. We expand CEDR into the application domain of autonomous vehicles, and we find that API-based CEDR achieves a runtime overhead reduction of 19.5% with respect to the original CEDR.

关键词： heterogeneous programming models runtime systems resource management

来源：评论

学校读者我要写书评

暂无评论

Are We Close to Realizing Self-programming Robots That Overcome the Unexpected?

Are We Close to Realizing Self-Programming Robots That Overc...

引用

2025 IEEE/SICE international symposium on System Integration, SII 2025

作者： Bottega, Jair A. Tsubouchi, Takashi Ruan, Xinyue Ohya, Akihisa University of Tsukuba Faculty of System and Information Engineering 1-1-1 Tennoudai Ibaraki Tsukuba305-8573 Japan Persol Cross Technology Co. Ltd. Japan

ISBN: (纸本)9798331531614

Are we on the verge of developing robots that can reprogram themselves to overcome unexpected situations? As robotic systems and artificial intelligence continue to evolve, the concept of self-programming robots capable of adaptive reasoning seems to be becoming a tangible reality. This paper demonstrates how Large Language Models (LLMs), specifically the OpenAI o1-preview model, can empower mobile robots to autonomously analyze failures and modify their operational code in real time. Traditional robot programming, bound by the need to anticipate all possible scenarios, often leads to rigid behaviors when faced with unforeseen obstacles. We present novel results where a robot, tasked with navigating a predefined path, encounters an unanticipated obstacle and autonomously generates modified code to address the challenge, including obstacle avoidance and dynamic path planning strategies. By utilizing a structured prompt and advanced reasoning capabilities, the robot moves beyond pre-programmed limitations, embodying a new level of dynamic, self-adaptive autonomy. This work highlights the transformative potential of LLMs in robotics, offering a glimpse into a future where robots not only perform tasks but also learn, adapt, and evolve autonomously in complex, real-world environments. © 2025 IEEE.

关键词： Robot programming

来源：评论

学校读者我要写书评

暂无评论

Integer programming Approaches to an Issue of Scheduling for a Truck-Drone Last-Mile Delivery System with Parcel Pickup Service 13

Integer Programming Approaches to an Issue of Scheduling for...

引用

Joint 13th international Conference on Soft Computing and Intelligent systems and 25th international symposium on Advanced Intelligent systems, SCIS and ISIS 2024

作者： Yamada, Kotaro Karuno, Yoshiyuki Iima, Hitoshi Graduate School of Science and Technology Kyoto Institute of Technology Mechanodesign Program Kyoto Japan Kyoto Institute of Technology Faculty of Mechanical Engineering Kyoto Japan Kyoto Institute of Technology Faculty of Information and Human Sciences Kyoto Japan

ISBN: (纸本)9798350373332

In this paper, we consider a scheduling issue for parcel delivery and pickup services by a truck-drone last-mile delivery system. We are given a single carrier truck and multiple identical drones to serve a finite set of customers. The single carrier truck plays the role of a mobile depot for the drones, and it visits several stops in a given order of them. The given order of stops constitutes a fixed truck route, and the carrier truck is allowed to launch (resp., to retrieve) a drone to (resp., from) a customer at a stop. For each sortie of a drone, the launching stop and the retrieving stop must be the same. The load capacity of a drone is limited to one, and for a sortie of a drone at a stop, there are three options: (i) only deliver a parcel to a customer, (ii) only pick up a parcel from a customer, and (iii) deliver a parcel to a customer, and then pick up a parcel from a customer. The scheduling problem asks to find an assignment of customers to drones with sortie options and a choice of a truck stop for each sortie in the assignment. The objective is to minimize the total duration of the carrier truck over all the stops, which is equivalent to minimizing the makespan. In this paper, we first propose an extended integer program for the case with both delivery and pickup services from an existing one for the case with delivery service only. We also conduct numerical experiments to demonstrate the solution quality of the proposed integer program by utilizing an integer programming solver, and report the results. © 2024 IEEE.

关键词： Integer programming

来源：评论

学校读者我要写书评

暂无评论

Dynamic programming for Training DNN in Distributed Computing 21st

Dynamic Programming for Training DNN in Distributed Computin...

引用

21st international symposium on Distributed Computing and Artificial Intelligence

作者： Cabello, Julia Garcia Carbo-Garcia, S. Univ Granada Andalusian Res Inst Data Sci & Computat Intellige Dept Appl Math Granada Spain Univ Granada Andalusian Res Inst Data Sci & Computat Intellige Dept Comp Sci & Artificial Intelligence Granada Spain

ISBN: (纸本)9783031820724;9783031820731

In recent years, the architecture and structure of Deep Neural Networks (DNNs) have become progressively more complex in order to respond to the increasing complexity of real problems. A strategy to deal with this complexity when it affects training would be to partition DNN training in some way: for example, by distributing it among different components of a computer network. For this, training (which is in essence the minimization of the loss function) should be performed through separated "smaller pieces". This paper offers an alternative to the gradient-based DNN training from a Dynamic programming (DP) point of view (DP is an optimisation methodology supported by the division of a complex problem into many problems of lower complexity). To do so, conditions which enable the DNN minimization algorithm to be solved under a DP perspective are studied here. In this line, in this work is proved that any artificial neural network ANN (and thus also DNNs) with monotonic activation is separable. Furthermore, whenever ANNs are considered as a dynamical system in the form of a network (known as coupled cell networks CCNs), we show that the transmission function is a separable function assuming that the activation is non-decreasing.

关键词： Dynamic programming Separable function DNN training

来源：评论

学校读者我要写书评

暂无评论

Runtime support for automatic placement of workloads on heterogeneous processors 16

Runtime support for automatic placement of workloads on hete...

引用

16th IEEE international symposium on Embedded Multicore/Many-core systems-on-Chip (MCSoC)

作者： Benoit, Nicolas Louise, Stephane Sorbonne Univ 4 Pl Jussieu F-75252 Paris 05 France Univ Paris Saclay CEA LIST F-91120 Palaiseau France

ISBN: (纸本)9798350393613

In order to maintain the continuous growth of the performance of computers while keeping their energy consumption under control, the microchip industry develops architectures capable of processing more and more tasks concurrently. Thus, the upcoming generations of processors may count hundreds of independent processing elements that may differ in their functions and features. As an extensive knowledge of their internals cannot be a prerequisite to their programming, and for the sake of portability, these forthcoming computers necessitate the compilation flow to evolve. In this article, we aim to explore solutions to several challenges that awaits the programming tools of such emerging architectures: by relying on a compilation tool to extract and characterize several levels of execution granularity available in a program, we aim at mapping the detected parallelism on the cores of the system taking into account the costs of communication, managing the execution scheduling in an effective way. Most of that should be amenable without much help or tips from the programmer, and more importantly without over-specializing the source code toward a given architecture. One code should fit for all with a desired performance close enough to hand tuned code so that most of programmer would not have to consider to hand-tune a code. An evaluation is done on an old school Cell-BE processor from the PS3 era to check feasibility on a heterogeneous platform. We show we can obtain performance which can surpass state of the art Cell-BE parallel frameworks.

关键词： heterogeneous computing many-core processors programming runtime

来源：评论

学校读者我要写书评

暂无评论

Un-projectable Global Types for Multiparty Sessions 24

Un-projectable Global Types for Multiparty Sessions

引用

26th international Conference on Principles and Practice of Declarative programming (PPDP)

作者： Barbanera, Franco Dezani-Ciancaglini, Mariangiola De'Liguoro, Ugo Univ Catania Catania Italy Univ Torino Turin Italy

ISBN: (纸本)9798400709692

A well-formed global type describes the interaction protocol of multiple end-points via the projection to local specifications. Typed sessions of processes enjoy good communication properties and their overall behaviour is the one described by the global type. We show that a projectable global type is bounded (also said "balanced" in the literature) but also that projectability is not necessary for a global type to be a sound description of well-behaved systems. By revising the semantics of global types via a coinductively defined LTS, we obtain a conservative extension of previous type systems in case of simple sessions without channels and local types, which we call Simple MultiParty Sessions, accommodating unbounded and hence un-projectable global types. Such a system is sound and encompasses infinite sessions that do not type-check for any bounded and/or projectable global type.

关键词： Communication-centred programming Process Calculi Simple Multiparty Sessions Global Types

来源：评论

学校读者我要写书评

暂无评论

DroMPI: Parallel Computation Over Drop Computing 24

DroMPI: Parallel Computation Over Drop Computing

引用

24th IEEE/ACM international symposium on Cluster, Cloud, and Internet Computing (CCGrid)

作者： Grosu, George-Mircea Nistor, Silvia-Elena Ciobanu, Radu-Ioan Dobre, Ciprian Pop, Florin Natl Univ Sci & Technol Politehn Bucharest Bucharest Romania Natl Inst Res & Dev Informat ICI Bucharest Romania Acad Romanian Scientists Bucharest Romania

ISBN: (纸本)9798350377521;9798350377514

With the advancement of technology and the spread of multi-core systems, the need for parallelization arises and the interest in programming models is growing. At the same time, new distributed computing models have been proposed, being in fierce competition to obtain the highest possible performance. The Drop Computing Paradigm proposes the idea of decentralized computing over ad-hoc opportunistic networks of mobile and Edge devices. In this respect, the Drop Computing model does not only aim to achieve a minimum turnaround time but also to optimize other characteristics related to mobile devices, such as limited resources and opportunistic communication. Therefore, it is necessary to define a new programming model called DroMPI that intends to extend the capabilities of current parallel and distributed programming models, based on the Drop Computing paradigm. Therefore, the solution aims to develop a library that takes advantage of hardware capabilities in the interest of the Drop Computing paradigm and also provides programmers with a high-level programming interface. The library's features will be based on the Message Passing Interface (MPI) standard, which will be responsible for inter-node parallelization. The name of the library, DroMPI, is an acronym for Drop Computing and MPI. The implementation of the model will be responsible for the management of communication between nodes and for providing an Application programming Interface (API) for the development of parallel applications in the Drop Computing paradigm.

关键词： Decentralized Computing Parallel Computation Drop Computing Application programming Interface MPI

来源：评论

学校读者我要写书评

暂无评论

Speedcode: Software Performance Engineering Education via the Coding of Didactic Exercises

Speedcode: Software Performance Engineering Education via th...

引用

1st international Conference on Smart Energy systems and Artificial Intelligence (SESAI)

作者： Kaler, Tim Chen, Xuhao Wheatman, Brian Curtis, Dorothy Hoppe, Bruce Schardl, Tao B. Leiserson, Charles E. MIT CSAIL 77 Massachusetts Ave Cambridge MA 02139 USA Johns Hopkins Univ Baltimore MD USA Connect Associates Boston MA USA

ISBN: (纸本)9798350364613;9798350364606

This paper introduces Speedcode, an online programming platform that aims to improve the accessibility of software performance-engineering education. At its core, Speedcode provides a platform that lets users gain hands-on experience in software performance engineering and parallel programming by completing short programming exercises. Speedcode challenges users to develop fast multicore solutions for short programming problems and evaluates their code's performance and scalability in a quiesced cloud environment. Speedcode supports parallel programming using OpenCilk, task-parallel computing platform that is open-source and easy to program, teach and use for research. Speedcode aims to reduce barriers to learning and teaching software performance engineering. It allows users to run and evaluate their code on modern multicore machines from their own computer without installing any software. This provides users an easy introduction to the topic, and enables teachers to more easily incorporate lessons on software performance engineering into their courses without incurring the onerous overhead of needing to setup computing environments for their students.

关键词： education online learning platforms parallel programming software performance engineering

来源：评论

学校读者我要写书评

暂无评论

System Routing and TDM Assignment Optimization in Multi-2.5D FPGA-Based Prototyping systems

System Routing and TDM Assignment Optimization in Multi-2.5D...

引用

2nd international symposium of Electronics Design Automation (ISEDA)

作者： Huang, Chenxi Chu, Pengfei Bi, Shunyang Sun, Richard You, Hailong Xidian Univ Sch Microelect Xian Peoples R China S2C Inc Shenzhen Peoples R China

ISBN: (纸本)9798350352047;9798350352030

2.5-D FPGA has been used in many Multi-FPGA systems (MFS) for prototype verification due to its higher logic capacity and larger number of pins. The FPGA is composed of multiple dies connected with special wires. Due to the limited connections, FPGA-based system-level routing may cause internal congestion and lead to implementation failures. In addition, Time-Division Multiplexing (TDM) is used in inter-FPGA connections to improve logic utilization, and each signal is assigned a TDM ratio. However, the increase in inter-FPGA delay of signals positively correlated with the ratio. And the system performance will be significantly influenced by these internal congestions and TDMs. In this paper, a system-level routing framework with hybrid initial routing and two-stage reroute algorithms that generates legal and high-quality routing results for a 2.5-D MFS is proposed. Afterwards, a three-step framework is proposed to generate legal TDM ratios and optimize the system's performance, where a high-quality discretization algorithm based on bottom-up dynamic programming is implemented to optimize the performance losses. The experimental results demonstrate an average improvement of 8% in the solution's quality compared with our baseline algorithms within reasonable runtime. And compared with the winner of the 5th EDA Elite Challenge, the quality of our solutions achieved the best results in most cases.

关键词： 2.5-D FPGA Multi-FPGA systems Time-Division Multiplex System-level routing TDM assignment Dynamic programming

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 3 4 5 6 7 8 9 10 11 12 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：