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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

18 篇 会议
1 册 图书
1 篇 期刊文献

馆藏范围

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

日期分布

学科分类号

17 篇 工学
- 13 篇 计算机科学与技术...
- 9 篇 软件工程
- 3 篇 信息与通信工程
- 2 篇 仪器科学与技术
- 2 篇 电气工程
- 2 篇 电子科学与技术（可...
- 2 篇 交通运输工程
- 2 篇 生物工程
- 1 篇 力学（可授工学、理...
- 1 篇 机械工程
- 1 篇 冶金工程
- 1 篇 动力工程及工程热...
- 1 篇 控制科学与工程
- 1 篇 建筑学
- 1 篇 土木工程
- 1 篇 水利工程
- 1 篇 化学工程与技术
- 1 篇 生物医学工程（可授...
- 1 篇 安全科学与工程
- 1 篇 网络空间安全
13 篇 理学
- 12 篇 数学
- 5 篇 统计学（可授理学、...
- 2 篇 物理学
- 2 篇 生物学
- 2 篇 系统科学
- 1 篇 化学
6 篇 管理学
- 4 篇 图书情报与档案管...
- 3 篇 管理科学与工程(可...
- 1 篇 工商管理
1 篇 经济学
- 1 篇 应用经济学

主题

2 篇 heuristic algori...
1 篇 puddle iron
1 篇 mild steel
1 篇 gain
1 篇 deep neural netw...
1 篇 optical transmit...
1 篇 cyber physical s...
1 篇 software enginee...
1 篇 pattern matching
1 篇 writing
1 篇 bandwidth
1 篇 bit error rate
1 篇 smart cities
1 篇 media
1 篇 hysteresis loop
1 篇 visualization
1 篇 graph theory
1 篇 modulation
1 篇 biopolymers
1 篇 power generation

机构

1 篇 karlsruhe instit...
1 篇 inst numer simul...
1 篇 humboldt univ de...
1 篇 department of da...
1 篇 speech research ...
1 篇 joint institute ...
1 篇 interdisciplinar...
1 篇 ntnu dept engn d...
1 篇 school of comput...
1 篇 school of comput...
1 篇 north china inst...
1 篇 beihang universi...
1 篇 electrical and c...
1 篇 institute of the...
1 篇 institute for co...
1 篇 wroclaw univ sci...
1 篇 socionext europe...
1 篇 helmholtz center...
1 篇 wroclaw univ sci...
1 篇 rhein friedrich ...

作者

2 篇 horváth tomáš
2 篇 kiss péter
2 篇 sanders peter
1 篇 tingfeng liu
1 篇 shah nirmesh j.
1 篇 wolfram koepf
1 篇 meyerhenke henni...
1 篇 correia jose a. ...
1 篇 krueger elisabet...
1 篇 liu zhonglin
1 篇 kärkkäinen juha
1 篇 lesiuk grzegorz
1 篇 erik de man
1 篇 xiaoqiang li
1 篇 ertl thomas
1 篇 dangelo gianlore...
1 篇 sui qingya
1 篇 reyes-silva juli...
1 篇 berto filippo
1 篇 převorovsky zden...

语言

19 篇 英文
1 篇 其他

检索条件"任意字段=19th Workshop on Algorithm Engineering and Experiments 2017, ALENEX 2017"

共 20 条记录，以下是1-10 订阅

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

详细简洁

排序：

Group-Harmonic and Group-Closeness Maximization Approximation and engineering

Group-Harmonic and Group-Closeness Maximization Approximatio...

引用

4th Symposium on algorithm engineering and experiments (alenex)

作者： Angriman, Eugenio Becker, Ruben DAngelo, Gianlorenzo Gilbert, Hugo van der Grinten, Alexander Meyerhenke, Henning Humboldt Univ Dept Comp Sci Unter Linden 6 D-10099 Berlin Germany Gran Sasso Sci Inst Laquila Italy Univ Paris 09 LAM SADE CNRS Univ PSL F-75016 Paris France

ISBN: (纸本)9781611976472

Centrality measures characterize important nodes in networks. Efficiently computing such nodes has received a lot of attention. When considering the generalization of computing central groups of nodes, challenging optimization problems occur. In this work, we study two such problems, group-harmonic maximization and group-closeness maximization both from a theoretical and from an algorithm engineering perspective. On the theoretical side, we obtain the following results. For group-harmonic maximization, unless P = NP, there is no polynomial-time algorithmthat achieves an approximation factor better than 1 - 1/e (directed) and 1 - 1/4e (undirected), even for unweighted graphs. On the positive side, we show that a greedy algorithm achieves an approximation factor of lambda(1 - 2/e) (directed) and lambda/2 (1 - 1e) (undirected), where lambda is the ratio of minimal and maximal edge weights. For group-closeness maximization, we obtain a strong separation between undirected and directed graphs (that holds even in the unweighted case). the undirected case is NP-hard to be approximated to within a factor better than 1 - 1/e+1 and a constant approximation factor is achieved by a local-search algorithm. For the directed case, however, we show that, for any epsilon < 1/2, the problem is NP-hard to be approximated within a factor of 4|V|(-epsilon). From the algorithm engineering perspective, we provide efficient implementations of the above greedy and local search algorithms. In our extensive experimental study we show that, on instances small enough so that an optimum solution can be computed in reasonable time, the quality of both the greedy and the local search algorithms come very close to the optimum. On larger instances, our local search algorithms yield results with superior quality compared to existing greedy and local search solutions, at the cost of additional running time. We thus advocate local search for scenarios where solution quality is of highest concern.

关键词： Directed graphs

来源：评论

学校读者我要写书评

暂无评论

Zone Based Writing Optimization in User Space 23

Zone Based Writing Optimization in User Space

引用

23rd IEEE International Conference on High Performance Computing and Communications, 7th IEEE International Conference on Data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and Big Data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Shen, Runnan Liu, Yuting Zhang, Rui Zhu, Jinbin Liu, Zhonglin Xiao, Limin School of Computer Science and Engineering Beihang University Beijing100191 China North China Institute of Computing Technology Beijing China Beihang University State Key Laboratory of Software Development Environment Beijing100191 China

ISBN: (纸本)9781665494571

Write operation of the latest storage media such as NAND SSDs has certain restrictions. Data can only be written in an additional write mode. When erasing, some valid data still needs to be written again, which will cause write amplification. Researches about write amplification focused on conventional NVMe protocol and did not consider some forward features. In response to this problem, this paper designs a user-mode write operation optimization algorithm based on the dynamic adjustment of zone space. When the block is erased, the impact caused by write amplification can be significantly resolved, and operations of multiple tenants can be effectively isolated. the Zone Based algorithm will implement a mapping algorithm based on zone space, and select a suitable GC to maximize the performance. We also designed and implemented a variety of mapping algorithms and GC algorithms to improve the processing efficiency of IO requests. experiments based on FEMU show at least 25% improvement when increasing data of different life span. © 2021 IEEE.

关键词： Protocols Smart cities Heuristic algorithms Clustering algorithms Writing Media Jitter

来源：评论

学校读者我要写书评

暂无评论

An Immigration Strategy-based Spherical Search algorithm 19

An Immigration Strategy-based Spherical Search Algorithm

引用

19th IEEE International Conference on Networking, Sensing and Control, ICNSC 2022

作者： Sui, Qingya Tao, Sichen Zhong, Lin Yang, Haichuan Lei, Zhenyu Gao, Shangce University of Toyama Faculty of Engineering Toyama930-8555 Japan

ISBN: (纸本)9781665472432

the spherical search algorithm (SS) is a novel and competitive algorithm applied to real-world problems. However, the population of SS algorithm is divided equally, which requires a large number of computation resources for different problems. To alleviate the issues, we propose an immigration strategy-based spherical search algorithm, namely ISS. ISS adaptively selects individuals that are successfully updated in each generation and replaces the operator in the next iteration. the experiments were conducted on the 30 benchmark functions from the IEEE CEC2017. ISS is compared with SS to verify the effectiveness of the proposed adaptive immigration strategy. Additionally, the classical differential evolutionary algorithm (DE) and a state-of-the-art triple archive particle swarm optimization (TAPSO) are compared to test its performance further. the population diversity is analyzed to discuss the effect of ISS. the experimental results demonstrate that the proposed immigration strategy is quite effective, and ISS is significantly better than its peer's algorithms. © 2022 IEEE.

关键词： Particle swarm optimization (PSO)

来源：评论

学校读者我要写书评

暂无评论

An Outlier Detection algorithm Based on Spectral Clustering 11th

An Outlier Detection Algorithm Based on Spectral Clustering

引用

11th International workshop of Advanced Manufacturing and Automation, IWAMA 2021

作者： Xiaoqiang, Li Tingfeng, Liu Henan Polytechnic Zhengzhou450046 China School of Information Science and Engineering Henan University of Technology Zhengzhou450001 China

ISBN: (纸本)9789811905711

Outliers refer to data that is far away from conventional data objects, resulting from different mechanisms, and there is a clear gap from conventional data. Outlier detection algorithms include statistics-based, distance-based, density-based, and cluster-based algorithms. Spectral clustering has become a research hotspot in the field of clustering because it can cluster on arbitrary-shaped data *** on Self-Tuning spectral clustering, optimize the scale parameters, improve the method of determining the initial centroid and the optimal clustering center in the K-means algorithm, calculate the outlier index for each data, and sort the outliers according to the size of the outlier *** *** the verification of artificial data and real data sets, the experiments show that the outlier detection algorithm based on spectral clustering is superior to the traditional outlier detection algorithm. © 2022, the Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： K-means clustering

来源：评论

学校读者我要写书评

暂无评论

Distributed Quantitative Vibration Demodulation with Direct-detection based Phase-sensitive OTDR Assisted by Acousto-optic Phase Shifting Technique 19

Distributed Quantitative Vibration Demodulation with Direct-...

引用

19th International Conference on Optical Communications and Networks, ICOCN 2021

作者： Liu, Shuaiqi Yu, Feihong Xu, Weijie Vai, Mang I. Shao, Liyang Department of Electrical and Electronic Engineering Southern University of Science and Technology Shenzhen China State Key Laboratory of Analog and Mixed-Signal VLSI University of Macau China

ISBN: (纸本)9781665424462

Quantitative demodulation of the external vibration is demonstrated with a direct-detection based Phase-sensitive OTDR system. An acousto-optic modulator is utilized for both probe pulse generation, and optical phase shifting simultaneously. the fiber under test is probed with a phase shifted double pulse pair scheme, with the phase difference between the two pulses periodically shifted with a π/2 step. the optical phase information is retrieved using the homodyne inter-pulse interference signal with direct detection only. Experimental results show good consistence between the phase demodulation result and the applied vibration amplitude under a cost-effective system configuration. © 2021 IEEE.

关键词： Demodulation

来源：评论

学校读者我要写书评

暂无评论

Variable Rate Syndrome-Trellis Codes for Steganography on Bursty Channels 19th

Variable Rate Syndrome-Trellis Codes for Steganography on Bu...

引用

19th International workshop on Digital Forensics and Watermarking, IWDW 2020

作者： Feng, Bingwen Liu, Zhiquan Wei, Kaimin Lu, Wei Lin, Yuchun College of Information Science and Technology Jinan University Guangzhou510632 China State Key Laboratory of Information Security Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China Guangdong Key Laboratory of Intelligent Information Processing and Shenzhen Key Laboratory of Media Security Shenzhen518060 China School of Computer Science and Engineering Guangdong Province Key Laboratory of Information Security Technology Ministry of Education Key Laboratory of Machine Intelligence and Advanced Computing Sun Yat-sen University Guangzhou510006 China Guangzhou Institute of Science and Technology Guangzhou510006 China

ISBN: (纸本)9783030694487

this paper presents a type of variable rate syndrome-trellis codes (VR-STC) for bursty channels. It can embed message bits with two different embedding rates. In the embedding, a cover vector is sliced into segments, and the embedding rates for each segment depend on the local channel distribution. the parities of stego segments are exploited to indicate the selected embedding rates according to a mapping function between parities and embedding rates. the core of the VR-STC is the parity-aware encoder, which can simultaneously output two candidate stego segments with different embedding rates and opposite parities, either of which can be used to constitute the final stego vector. A Viterbi algorithm is also suggested to find the closed stego segments. Besides, the mapping function between parities and embedding rates is designed by minimizing the embedding costs on a down sampled version of the cover vector. It can further improve the undetectability of the VR-STC. Experimental results on artificial signals and binary images suggest that the proposed VR-STC can provide high success rate of embedding and reduce the embedding cost on bursty channels. © 2021, Springer Nature Switzerland AG.

关键词： Steganography

来源：评论

学校读者我要写书评

暂无评论

Evolutionary federated learning on EEG-data 19

Evolutionary federated learning on EEG-data

引用

19th Conference Information Technologies - Applications and theory, ITAT 2019

作者： Szegedi, Gábor Kiss, Péter Horváth, Tomáš Department of Data Science and Engineering ELTE – Eötvös Loránd University Faculty of Informatics Budapest Pázmány Péter sétány 1/C. BudapestH-1117 Hungary

With the spread of digitalization across every aspects of society and economy, the amount of data generated keeps increasing. In some domains, this generation happens in such a massively distributed fashion that poses challenges for even collecting the data to build machine learning (ML) models on it, not to mention the processing power necessary for training. An important aspect of processing information that has been generated at users is privacy concerns, that is, users might be unwilling to expose anything that would enable one to draw any conclusion regarding to confidential information they possess. In this work, we present a experiment on a genetic algorithm based federated learning (FL) algorithm, that reduces the data transfer from individual users to the learner to a single fitness value. Copyright ©2019 for this paper by its authors.

关键词： Data transfer

来源：评论

学校读者我要写书评

暂无评论

Optimization in federated learning 19

Optimization in federated learning

引用

19th Conference Information Technologies - Applications and theory, ITAT 2019

作者： Felbab, Vukasin Kiss, Péter Horváth, Tomáš Department of Data Science and Engineering ELTE Eötvös Loránd University Faculty of Informatics Budapest Pázmány Péter sétány 1/C. BudapestH-1117 Hungary

Federated learning (FL) is an emerging branch of machine learning (ML) research, that is examining the methods for scenarios, where individual nodes possess parts of the data, and the task is to form a single common model that fits to the whole distribution. In FL, we generally use mini batch gradient descent for optimizing weights of the models that appears to work very well for federated scenarios. For traditional machine learning setups, a number of modifications has been proposed to accelerate the learning process and to help to get over challenges posed by the high dimensionality and non-convexity of search spaces of the parameters. In this paper we present our experiments on applying different popular optimization methods for training neural networks in a federated manner. Copyright ©2019 for this paper by its authors.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

Proceedings of the workshop on algorithm engineering and experiments

Proceedings of the Workshop on Algorithm Engineering and Exp...

引用

19th workshop on algorithm engineering and experiments 2017, alenex 2017

ISBN: (纸本)9781611974768

the proceedings contain 21 papers. the topics discussed include: distributed graph-based topology adaptation using motif signatures;indexing variation graphs;engineering a direct k-way hypergraph partitioning algorithm;computing critical nodes in directed graphs;robust massively parallel sorting;engineering external memory induced suffix sorting;engineering a distributed full-text index;Elias-Fano meets single-term top-k document retrieval;efficient set intersection counting algorithm for text similarity measures;the Moser-Tardos resample algorithm: where is the limit? (an experimental inquiry);and determining tournament payout structures for daily fantasy sports.

关键词：

来源：评论

学校读者我要写书评

暂无评论

engineering a direct k-way hypergraph partitioning algorithm 19

Engineering a direct k-way hypergraph partitioning algorithm

引用

19th workshop on algorithm engineering and experiments 2017, alenex 2017

作者： Akhremtsev, Yaroslav Heuer, Tobias Sanders, Peter Schlag, Sebastian Karlsruhe Institute of Technology Institute for Theoretical Informatics Algorithmics II Germany

ISBN: (纸本)9781611974768

We develop a fast and high quality multilevel algorithm that directly partitions hypergraphs into k balanced blocks - without the detour over recursive bipartitioning. In particular, our algorithm efficiently implements the powerful FM local search heuristics for the complicated k-way case. this is important for objective functions which depend on the number of blocks connected by a hyperedge. We also remove several further bottlenecks in processing large hyperedges, develop a faster contraction algorithm, and a new adaptive stopping rule for local search. To further reduce the size of hyperedges, we develop a pin-sparsifier based on the min-hashing technique that clusters vertices with similar neighborhood. Extensive experiments indicate that our KaHyPar-partitioner compares favorably with the best previous systems. KaHyPar is faster than hMetis and computes better solutions. KaHyPar's results are considerably better than the (faster) PaToH partitioner.

关键词： Heuristic algorithms

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共2页 << < 1 2 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：