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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

4,590 篇 会议
920 篇 期刊文献
8 篇 学位论文
3 册 图书

馆藏范围

5,521 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

1,647 篇 工学
- 1,193 篇 电气工程
- 961 篇 计算机科学与技术...
- 512 篇 信息与通信工程
- 169 篇 软件工程
- 100 篇 电子科学与技术（可...
- 64 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 17 篇 交通运输工程
- 10 篇 机械工程
- 8 篇 测绘科学与技术
- 6 篇 光学工程
- 5 篇 网络空间安全
- 4 篇 力学（可授工学、理...
- 4 篇 生物医学工程（可授...
- 3 篇 材料科学与工程（可...
- 3 篇 航空宇航科学与技...
- 2 篇 石油与天然气工程
345 篇 理学
- 256 篇 数学
- 57 篇 物理学
- 21 篇 系统科学
- 6 篇 统计学（可授理学、...
- 5 篇 生物学
- 4 篇 地球物理学
271 篇 文学
- 271 篇 新闻传播学
114 篇 医学
- 111 篇 临床医学
- 9 篇 特种医学
59 篇 管理学
- 55 篇 管理科学与工程(可...
- 4 篇 图书情报与档案管...
9 篇 军事学
- 9 篇 军队指挥学
2 篇 教育学
- 2 篇 教育学
1 篇 农学

主题

5,521 篇 source coding
1,261 篇 decoding
639 篇 codes
602 篇 channel coding
418 篇 rate-distortion
387 篇 entropy
340 篇 random variables
291 篇 image coding
271 篇 data compression
227 篇 software
227 篇 training
223 篇 computational mo...
212 篇 semantics
203 篇 video coding
197 篇 encoding
191 篇 quantization
185 篇 distortion
184 篇 redundancy
182 篇 information theo...
181 篇 parity check cod...

机构

28 篇 department of el...
25 篇 department of el...
24 篇 department of el...
20 篇 school of electr...
19 篇 technion israel ...
19 篇 stanford univ de...
18 篇 univ calif berke...
17 篇 school of electr...
15 篇 princeton univ d...
15 篇 univ calif san d...
15 篇 department of el...
15 篇 department of el...
15 篇 queens univ dept...
15 篇 univ michigan de...
14 篇 georgia inst tec...
13 篇 department of el...
13 篇 department of el...
12 篇 ibm thomas j. wa...
12 篇 university of ca...
12 篇 department of el...

作者

46 篇 zixiang xiong
31 篇 k. ramchandran
26 篇 yang yang
25 篇 mikael skoglund
24 篇 en-hui yang
24 篇 m. effros
23 篇 s. sandeep pradh...
20 篇 tsachy weissman
19 篇 chang wen chen
18 篇 k. rose
18 篇 jun chen
18 篇 michelle effros
17 篇 yasutada oohama
16 篇 skoglund mikael
15 篇 chao tian
14 篇 k. zeger
14 篇 b. girod
13 篇 s.s. pradhan
13 篇 xiaolin wu
13 篇 pradhan s. sande...

语言

5,468 篇 英文
44 篇 其他
8 篇 中文
1 篇 俄文

检索条件"主题词=Source coding"

共 5521 条记录，以下是4911-4920 订阅

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

详细简洁

排序：

Improving source Code with Assistance from AI — A Pilot Case Study with ChatGPT

Improving Source Code with Assistance from AI — A Pilot Cas...

引用

International Conference on Information and Computer Technologies (ICICT)

作者： Steven McDaniel Minhaz F. Zibran Department of Computer Science Idaho State University Pocatello ID USA

ISBN: (数字)9798350385625

ISBN: (纸本)9798350385632

ChatGPT queries were used to provide feedback on five C++ programs selected from various programming assignments for two graduate-level computer science courses – a scientific programming course and an algorithms course. The evaluated software was written by the first author for those courses within the last two years. ChatGPT was asked to evaluate and provide feedback for each program. Specifically, ChatGPT was asked to evaluate the code for strengths and weaknesses and make recommendations for improving (1) execution speed as well as (2) readability and maintainability. A subjective agreement rating was generated by the authors for each strength, weakness, and recommended change provided by ChatGPT. While the overall agreement with the ChatGPT provided feedback was over 90 percent, at times, ChatGPT’s recommendations were found misleading.

关键词： Codes Generative AI source coding Software algorithms C++ languages Software quality Programming

来源：评论

学校读者我要写书评

暂无评论

DADR: Deep adaptive dimensionality reduction architecture based on the coefficient of variation

DADR: Deep adaptive dimensionality reduction architecture ba...

引用

IEEE International Conference on Cloud Computing and Intelligence Systems (CCIS)

作者： Xuemei Ding Jielei Chu Dao Xiang Tianrui Li School of Computing and Artificial Intelligence Southwest Jiaotong University Chengdu China China E-port Data Center Chengdu Branch Chengdu China

ISBN: (纸本)9781665456579

The traditional deep dimensionality reduction methods corresponding to the depth of the model and the dimensionality of each layer depend on empirical settings. In this paper, we propose a deep adaptive dimensionality reduction architecture (DADR) based on the coefficient of variation and Gaussian restricted Boltzmann machine (GRBM) for achieving adaptivity of depth and dimensionality in the dimensionality reduction process. To verily the validity of the proposed model, we introduce two unsupervised algorithms, K-means and spectral clustering (SC), to compare the DADR architecture with all original features, shallow GRBM model, PCA and two advanced feature selection-based dimensionality reduction algorithms (CNAFS and UFSwithOL), respectively. The final experimental results show the performance of the proposed DADR architecture is demonstrated to be superior to the other algorithmic models. The source code is available at https://***/dingxm99/DADR.

关键词： Dimensionality reduction Representation learning Adaptation models Cloud computing Adaptive systems source coding Clustering algorithms

来源：评论

学校读者我要写书评

暂无评论

Towards a Metric for Reuse of Microservice Intrusion Detection Models

Towards a Metric for Reuse of Microservice Intrusion Detecti...

引用

European Dependable Computing Conference (EDCC)

作者： José Flora Nuno Antunes CISUC DEI University of Coimbra Coimbra Portugal

ISBN: (数字)9798350360684

ISBN: (纸本)9798350360691

Application development based on microservices allows leveraging continuous delivery to efficiently reach the market. This architectural methodology facilitates automated testing and deployment of frequent service changes. Nevertheless, it is imperative to incorporate security into this paradigm and ensure its continuous adaptation to the evolving landscape. We explore host-based intrusion detection by capturing microservices’ behavior, which encounters a significant challenge when dealing with the dynamicity of microservices that causes profiles to become outdated. This paper presents a preliminary study to assess the feasibility of a profile reutilization metric. It leverages data from the service’s source code, its runtime data and algorithm patterns to understand whether models from prior versions can be repurposed to newer versions. We apply it to four service versions within a microservices application to validate if we are on the correct path towards a valid and useful metric.

关键词： Measurement Runtime Computational modeling source coding Heuristic algorithms Microservice architectures Intrusion detection

来源：评论

学校读者我要写书评

暂无评论

Body-Part Guided Animal Pose Estimation

Body-Part Guided Animal Pose Estimation

引用

IEEE International Conference on Multimedia and Expo Workshops (ICMEW)

作者： Jiyong Rao Tianyang Xu Xiaoning Song Zhenhua Feng Xiao-Jun Wu

ISBN: (数字)9798350379815

ISBN: (纸本)9798350379822

In this paper, we present our solution to ICME Grand Challenge in animal pose estimation track in the 2024 Multi-Modal Video Reasoning and Analyzing Competition (MMVRAC 2024). We introduce a novel body-part guided framework for cross-species animal pose estimation task, which consists of two coupled components. The first component is to extract keypoint features and generate body part visual prompts. And the second is a Keypoint-Interactive Transformer (KIT) used to implement guidance through body parts. The proposed model has the advantage to effectively overcome the problems brought by the data variances cross multiple species. Our proposed method outperforms the state-of-the-art in animal pose estimation competition at MMVRAC 2024. The source code is public available at https://***/Raojiyong/icme_animalpose

关键词： Visualization Animals source coding Pose estimation Wildlife Feature extraction Transformers

来源：评论

学校读者我要写书评

暂无评论

Interactive Quantization for Extremum Computation in Collocated Networks

Interactive Quantization for Extremum Computation in Colloca...

引用

Data Compression Conference (DCC)

作者： Solmaz Torabi Jie Ren John MacLaren Walsh Department of Electrical and Computer Engineering Drexel University Philadelphia PA

Summary form only given. The problem of function computation arises in in many practical scenarios, such as query computation in distributed databases. In such scenarios, it is often possible to exploit the structure of the function to reduce the amount of information that needs to be exchanged in order to compute it. In a so-called a collocated network, information is exchanged as users take turns sending messages to a sink, the central estimation officer (CEO), with each user perfectly overhearing the message from every other user, as depicted in Fig 1. In this paper a problem of function computation is studied in a collocated network where m independent nodes in transmission range with each other, exchange messages with the aim of losslessly computing the extremization function f = arg maxi Xi, or f = maxi Xi. An optimal dynamic quantizer for the user's observations is proposed via a dynamic program which provides the CEO just enough information to compute the desired functions with no error. Both fundamental limits and practical schemes are presented. Ma et al, in [1] studied this problem in a distributed source coding framework, and proposed an iterative algorithm via a convex geometric approach to compute the minimum sum rate of for anyfinite and infinite number of rounds. Building upon this prior work, we propose an achievable scheme using scalar quantizers followed by Huffman encoding the results. We compute the fundamental limit from [1] for the extrema function, and study the the fundamental tradeoff between the rate-cost and the delay in optimal interactive quantization schemes. We also design some low complexity suboptimal scheme which substantially shrinks the search space of the optimal dynamic program. Moreover, using optimal heterogeneous quantizers result in substantial rate savings relative to the parallel homogenous quantizers in [2].

关键词： Quantization (signal) source coding Computers Distributed databases Estimation Propagation losses

来源：评论

学校读者我要写书评

暂无评论

FedGR: Genetic Algorithm and Relay Strategy Based Federated Learning

FedGR: Genetic Algorithm and Relay Strategy Based Federated ...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Yifei Zeng Kai Zhao Fangchao Yu Bo Zeng Zhi Pang Lina Wang Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Wuhan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Federated learning (FL) is a privacy-preserving distributed machine learning approach that enables multiple parties to collaboratively train machine learning models without sharing local data. However, compared with the models trained on independent and identically distributed (IID) data, existing methods still face significant degradation in model performance when running on non-IID data. To solve this problem, we propose a federated learning framework based on genetic algorithm and relay strategy in this paper. The framework groups clients according to their local data distribution using genetic algorithm. After obtaining the optimal grouping result, a relay strategy is used to train and aggregate models within each group. Extensive experiments on three benchmark datasets show that FedGR significantly outperforms other state-of-the-art federated learning algorithms on various image classification tasks. The source code is available at https://***/zyfhylyh/FedGR.

关键词： Federated learning Computational modeling source coding Distributed databases Benchmark testing Data models Relays

来源：评论

学校读者我要写书评

暂无评论

Conveying discrete memoryless sources over networks: When are zero-rate edges dispensable?

Conveying discrete memoryless sources over networks: When ar...

引用

IEEE International Symposium on Information Theory

作者： Badri N. Vellambi Institute for Telecommunications Research University of South Australia Australia

ISBN: (纸本)9781479904440

This work investigates the problem of conveying discrete memoryless sources over general networks with specified lossless (vanishing error probability) and/or lossy (average per-symbol distortion) reconstruction demands. It presents two different sufficient conditions under which an edge carrying zero-rate messages is not crucial for the conveyance of the sources, i.e., the demands can be met even when the zero-rate edge is deleted and the rates on other edges are kept unchanged.

关键词： source coding Joints Stability criteria Random variables Conferences

来源：评论

学校读者我要写书评

暂无评论

Test Transplantation through Dynamic Test Slicing

Test Transplantation through Dynamic Test Slicing

引用

IEEE International Workshop on source Code Analysis and Manipulation

作者： Mehrdad Abdi Serge Demeyer Dept. Computer Science University of Antwerp Antwerp Belgium

ISBN: (纸本)9781665496100

Previous research has demonstrated that the test coverage of libraries can be expanded by using existing test inputs from their dependent projects. In this paper, we propose an algorithm for test transplantation based on test slicing. The algorithm extracts test inputs, isolates them by creating mocks, and then transplants the test code onto the test suite of the libraries. To achieve test slicing, we dynamically execute the tests in the dependent project and create its graph of histories. Then, we traverse back from the interesting object state and collect the corresponding edges. Finally, we reverse the collected edges and create a sequence of method calls to reconstruct the same object state. We have implemented a proof-of-concept in Pharo-Smalltalk, in this paper we discuss the lessons learned so far.

关键词： Codes Heuristic algorithms source coding Ecosystems Cloning Libraries Organ transplantation

来源：评论

学校读者我要写书评

暂无评论

C Programs Formal Verification Using Maude

C Programs Formal Verification Using Maude

引用

Innovative Research in Applied Science, Engineering and Technology (IRASET),Conference on

作者： Fateh Boutekkouk Research Laboratory on Computer Science’ Complex Systems ReLaCS2 University of Oum El Bouaghi Oum El Bouaghi Algeria

ISBN: (数字)9798350309508

ISBN: (纸本)9798350309515

In this paper, we present a new approach for C programs formal verification based on the Maude formal language. The input of the proposed approach is a C ANSI standard source code. From a C source code, a pretreatment step is performed to transform the original code to a simpler one more suitable for formal verification. After that, a control/data flow graph (CDFG) is generated automatically. This intermediate representation will be used after to generate automatically a Maude system module. Using Maude tools, one can simulate, reachability analyze or verify the C code against a LTL-based specification. The specificity of our work is that we use the CDFG to generate automatically a Maude code used for both control-oriented and data-oriented properties formal verification.

关键词： Codes source coding Formal languages Transforms ANSI Standards Flow graphs Reachability analysis

来源：评论

学校读者我要写书评

暂无评论

A Ziv-Zakai-Rényi lower bound on distortion at high resolution

A Ziv-Zakai-Rényi lower bound on distortion at high resolut...

引用

IEEE (first ITW conference of the year) Information Theory Workshop (ITW)

作者： Itai Leibowitz Ram Zamir EE-Systems Department Tel-Aviv University Tel-Aviv Israel

We follow a method introduced by Ziv and Zakai for finding 'informational' lower bounds on delay constrained joint source-channel coding. Their method uses the data processing theorem for generalized measures of information. We introduce the use of Renyi's information of order alpha in their framework, and use high-resolution approximations to find its rate distortion function for a source that possesses a smooth distribution with rth-power distortion. This allows us to present two new lower bounds, one on the distortion in fixed rate vector quantization, and the other on the transmission through low-dimensional modulo-lattice additive noise channels.

关键词： Distortion measurement Length measurement Data processing Rate-distortion Delay Resource description framework Channel capacity source coding Mutual information Density measurement

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共500页 << < 488 489 490 491 492 493 494 495 496 497 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：