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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

当前已输入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,032 篇 会议
19 册 图书
8 篇 期刊文献

馆藏范围

1,059 篇 电子文献
0 种 纸本馆藏

日期分布

学科分类号

626 篇 工学
- 576 篇 计算机科学与技术...
- 291 篇 软件工程
- 229 篇 电气工程
- 225 篇 信息与通信工程
- 80 篇 控制科学与工程
- 41 篇 仪器科学与技术
- 38 篇 动力工程及工程热...
- 37 篇 网络空间安全
- 36 篇 交通运输工程
- 36 篇 安全科学与工程
- 17 篇 电子科学与技术（可...
- 12 篇 机械工程
- 11 篇 生物工程
- 7 篇 建筑学
- 7 篇 环境科学与工程（可...
- 4 篇 化学工程与技术
- 4 篇 生物医学工程（可授...
122 篇 理学
- 62 篇 数学
- 36 篇 化学
- 13 篇 系统科学
- 12 篇 生物学
- 10 篇 统计学（可授理学、...
- 6 篇 物理学
111 篇 管理学
- 81 篇 管理科学与工程(可...
- 64 篇 图书情报与档案管...
- 34 篇 工商管理
8 篇 经济学
- 8 篇 应用经济学
5 篇 医学
- 5 篇 基础医学(可授医学...
- 5 篇 临床医学
3 篇 法学
- 3 篇 社会学
1 篇 军事学

主题

121 篇 distributed comp...
73 篇 computer science
57 篇 protocols
56 篇 distributed comp...
55 篇 cloud computing
53 篇 mobile computing
49 篇 middleware
47 篇 computer archite...
46 篇 costs
42 篇 scalability
41 篇 application soft...
41 篇 computer network...
40 篇 computational mo...
39 篇 intelligent netw...
38 篇 bandwidth
36 篇 real time system...
35 篇 peer to peer com...
33 篇 monitoring
31 篇 network servers
31 篇 internet

机构

4 篇 university of st...
4 篇 school of scienc...
3 篇 college of compu...
3 篇 department of co...
3 篇 ibm thomas j. wa...
3 篇 school of comput...
3 篇 brown univ dept ...
3 篇 dept. of cs geor...
3 篇 department of el...
3 篇 univ chicago il ...
3 篇 nppd tehran
3 篇 georgia institut...
3 篇 institute of com...
3 篇 natl univ def te...
3 篇 distributed syst...
2 篇 department of co...
2 篇 school of comput...
2 篇 univ nevada dept...
2 篇 department of co...
2 篇 the chinese univ...

作者

5 篇 yi pan
4 篇 uwe breitenbüche...
4 篇 frank leymann
3 篇 y. shibata
3 篇 jianhua sun
3 篇 dustdar schahram
3 篇 nong xiao
3 篇 hai jin
3 篇 takizawa hiroyuk...
3 篇 jiannong cao
2 篇 j.a. stankovic
2 篇 posdorfer wolf
2 篇 miremadi seyed g...
2 篇 datskova olga
2 篇 m. ito
2 篇 garcia jordi
2 篇 li j
2 篇 jukan admela
2 篇 souissi samia
2 篇 cheng yijun

语言

1,059 篇 英文

检索条件"任意字段=23rd International Conference on Distributed Computing Systems Workshops"

共 1059 条记录，以下是1001-1010 订阅

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

详细简洁

排序：

Client Scheduling for Unreliable Semi-Decentralized Federated Learning 23

Client Scheduling for Unreliable Semi-Decentralized Federate...

引用

23rd IEEE international conference on Communication Technology, ICCT 2023

作者： Tan, Yuhao Zhao, Haitao Xia, Wenchao Wang, Qin Guo, Kun Xu, Bo Quek, Tony Q. S. Nanjing University of Posts and Telecommunications Jiangsu Key Laboratory of Wireless Communications Nanjing210003 China Chongqing Institute of East China Normal University Chongqing Key Laboratory of Precision Optics Chongqing401120 China Singapore University of Technology and Design Information Systems Technology and Design Pillar Singapore

ISBN: (纸本)9798350325959

The Industrial Internet of Things (IIoT) is emerging as a promising technology that can accelerate the application of industrial intelligence. Because of the sensitive nature of user data, federated learning (FL) which performs distributed machine learning while preserving data privacy, is developed to meet the accuracy and privacy requirements of IIoT end devices/clients. However, the unreliable communications in IIoT may negatively affect the training efficiency. In this paper, we study on the client scheduling problem in a multi-server FL framework for the communication reliability and training efficiency improvement. A client-server association optimization problem is formulated, with the objective of minimizing the global training loss. Resorting to the convergence analysis of SD-FL, the original problem is simplified and transformed to guide us to design a high-efficiency client scheduling scheme. Finally, simulation results show that the proposed scheme significantly outperforms the baselines in terms of the test accuracy and training loss. © 2023 IEEE.

关键词： client scheduling edge association edge computing federated learning industrial internet of things

来源：评论

学校读者我要写书评

暂无评论

Integrating sensor networks in pervasive computing environments using symbolic coordinates

Integrating sensor networks in pervasive computing environme...

引用

international conference on Communication systems Software and Middleware (COMSWARE)

作者： Matthias Gauger Pedro Jose Marron Marcus Handte Olga Saukh Daniel Minder Andreas Lachenmann Kurt Rothermel Fraunhofer IAIS St. Augustin Germany Universität Bonn Bonn Germany IPVS Universität Stuttgart Stuttgart Germany

Wireless sensor networks can monitor different types of physical phenomena and are able to provide a diverse set of context data to interested clients. Allowing mobile pervasive computing devices to access such data requires solutions for routing messages between mobile devices and the static sensor network. This paper presents a novel approach that addresses this problem with the help of symbolic coordinates. It requires only a small amount of topology information distributed in the network and allows mobile devices to send messages to arbitrary areas. The routing task is split among the client nodes, which specify a symbolic source route, and the sensor nodes that handle node-to-node routing. The paper describes the algorithm, specific challenges associated with its design and gives an extensive evaluation of the approach and its properties, showing that the use of symbolic coordinates in these environments is a viable alternative to more traditional types of routing.

关键词： Pervasive computing Mobile computing Mobile communication Wireless sensor networks Routing protocols Sensor phenomena and characterization Network topology Information retrieval Monitoring Algorithm design and analysis

来源：评论

学校读者我要写书评

暂无评论

Streaming verification for graph problems: Optimal tradeoffs and nonlinear sketches 23

Streaming verification for graph problems: Optimal tradeoffs...

引用

23rd international conference on Approximation Algorithms for Combinatorial Optimization Problems and 24th international conference on Randomization and Computation, APPROX/RANDOM 2020

作者： Chakrabarti, Amit Ghosh, Prantar Thaler, Justin Dartmouth College HanoverNH United States Georgetown University WashingtonDC United States

ISBN: (纸本)9783959771641

We study graph computations in an enhanced data streaming setting, where a space-bounded client reading the edge stream of a massive graph may delegate some of its work to a cloud service. We seek algorithms that allow the client to verify a purported proof sent by the cloud service that the work done in the cloud is correct. A line of work starting with Chakrabarti et al. (ICALP 2009) has provided such algorithms, which we call schemes, for several statistical and graph-theoretic problems, many of which exhibit a tradeoff between the length of the proof and the space used by the streaming verifier. This work designs new schemes for a number of basic graph problems - including triangle counting, maximum matching, topological sorting, and single-source shortest paths - where past work had either failed to obtain smooth tradeoffs between these two key complexity measures or only obtained suboptimal tradeoffs. Our key innovation is having the verifier compute certain nonlinear sketches of the input stream, leading to either new or improved tradeoffs. In many cases, our schemes in fact provide optimal tradeoffs up to logarithmic factors. Specifically, for most graph problems that we study, it is known that the product of the verifier's space cost v and the proof length h must be at least Ω(n2) for n-vertex graphs. However, matching upper bounds are only known for a handful of settings of h and v on the curve h · v = Θ(~ n2). For example, for counting triangles and maximum matching, schemes with costs lying on this curve are only known for (h = Õ(n2), v = Õ(1)), (h = Õ(n), v = Õ(n)), and the trivial (h = Õ(1), v = Õ(n2)). A major message of this work is that by exploiting nonlinear sketches, a significant "portion" of costs on the tradeoff curve h · v = n2 can be achieved. © 2020 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. All rights reserved.

关键词： distributed database systems

来源：评论

学校读者我要写书评

暂无评论

An Artificial Intelligence Peer-To-Peer Car Repair Platform 1st

An Artificial Intelligence Peer-To-Peer Car Repair Platform

引用

1st international conference on Advances in computing Research, ACR’23

作者： Alluhaidan, Ala Saleh Alzaid, Layan Aldossari, Daniyah Alhumid, Renad Alkadi, Joud Department of Information Systems College of Computer and Information Science Princess Nourah Bint Abdulrahman University Riyadh Saudi Arabia

ISBN: (纸本)9783031337420

Auto service industry is a very extensive field and there are many chances for utilizing technology in offering better services. In current model of service provider, finding the righteous place for repairing car can be a tedious job. In the Kingdom of Saudi Arabia, vehicle repairing becomes a challenging task since vehicle workshops are usually located in distant areas and randomly distributed. This can ravage customers’ time to find the right workshop, especially, with the increasing traffic and accidents in the Kingdom of Saudi Arabia. With smart phones applications, reporting and accepting services become easy and fast. Therefore, finding the best deal with transparent pricing is a desirable service. Time saving and preventing commercial fraud are among the goals of using such an application. The proposed system aims to enable the user to upload the image of the vehicle then, the image will be analyzed, and an estimate of repairing cost is given. The novelty in this application is grounded on a shared platform between customer and service provider with pricing estimate of service needed and the request is shared among the available shops. Liability and usability of the app was measured with error free application and 88% application usability survey. This system will contribute to the work of a strategy intended to improve business and customer satisfaction when it comes to vehicle repair processes. © 2023, The Author(s), under exclusive license to Springer Nature Switzerland AG.

关键词： Customer satisfaction

来源：评论

学校读者我要写书评

暂无评论

Demo: Talk2Me - A Framework for D2D Augmented Reality Social Network

Demo: Talk2Me - A Framework for D2D Augmented Reality Social...

引用

IEEE international conference on Pervasive computing and Communications

作者： Jiayu Shu Sokol Kosta Rui Zheng Pan Hui HKUST-DT System and Media Laboratory Hong Kong University of Science and Technology Hong Kong Department of Electronic Systems Aalborg University Copenhagen Denmark

ISBN: (纸本)9781538632284

In this demo, we present Talk2Me, an augmented reality social network framework that enables users to disseminate information in a distributed way and view others' information instantly. Talk2Me advertises users' messages, together with their face-signatures, to every nearby device in a Device-to-Device fashion. When a user looks at nearby persons through her camera-enabled wearable devices (e.g., Google Glass), the framework automatically extracts the face-signature of the person of interest, compares it with the previously captured signatures, and presents the information shared by this person to the user. We design a lightweight and yet accurate face recognition algorithm, together with an efficient distributed dissemination protocol. We integrate their implementations in an Android prototype.

关键词： Social network services Face Augmented reality Smart phones Cameras Face detection Face recognition Facial Recognition augmented reality Social network services Smartphone Cameras Face Face Persons Social Media Social Networks Device-to-device communication face recognition algorithm Consumers

来源：评论

学校读者我要写书评

暂无评论

RTTAC-An Access Control Model Based on Blockchain and Role-Trusted Transfer 3

RTTAC-An Access Control Model Based on Blockchain and Role-T...

引用

3rd international conference on Computer Science and Blockchain, CCSB 2023

作者： Wang, Feng Lu, Yang Liu, Yang Zhang, Zhiruo Henan university of technology Distributed Computing & BlockChain Lab Zhengzhou China

ISBN: (纸本)9798350359077

Aiming to address the data security issues in data sharing, current approaches such as RBAC, ABAC, and blockchain-based data sharing platforms suffer from problems like role redundancy, role abuse, complex authorization, and data user privacy leakage. In response, a role-based trusted transfer access control model based on trust and attributes is proposed. This model is built upon Attribute-Based Access Control (ABAC) while integrating Role-Based Access Control (RBAC). Users obtain roles based on their attributes and trust levels, and roles determine access permissions based on trust level and defined policies, and then determine the transferability of roles, at the same time, the transfer of roles is limited by trust levels. Encryption techniques and off-chain storage systems are utilized to protect data privacy and integrity, thereby alleviating the storage pressure on the blockchain. Finally, the performance and effectiveness of the proposed model were evaluated through experimental analysis, demonstrating its capability to achieve trustworthy role transfer and enhance the security and privacy of on-chain sharing schemes. © 2023 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

Evaluation of the energy consumption and the packet loss in WSNs using Deterministic Stochastic Petri Nets

Evaluation of the energy consumption and the packet loss in ...

引用

international Workshop on Bio and Intelligent computing

作者： Amel Berrachedi Malika Boukala-Ioualalen MOVEP Laboratory Computing Science Department USTHB

ISBN: (纸本)9781509024629

When developing critical and complex systems, the analysis and the performance evaluation of the designed system is a challenging task. Wireless Sensor Networks (WSNs) are examples of such systems. A WSN consists of a large amount of distributed nodes which monitor physical or environmental conditions. In this paper, we address the problem of how WSNs must be designed to have good performances in particular the energy consumption and the packet loss ratio. To do so, we use an expressive kind of Petri Nets called Deterministic Stochastic Petri Nets. To show the applicability of the proposed model, one of routing techniques dedicated for WSNs is presented.

关键词： WSN DSPN Energy Packet Loss

来源：评论

学校读者我要写书评

暂无评论

Solar Energy-Based Virtual Machine Placement Algorithm for Geo-distributed Datacenters

Solar Energy-Based Virtual Machine Placement Algorithm for G...

引用

IEEE international conference on Software Quality, Reliability and Security Companion (QRS-C)

作者： Sanjaya Kumar Panda Sahil Chopra Slokashree Padhi Department of Computer Science and Engineering National Institute of Technology Warangal Warangal Telangana India

The cloud computing market is continually rising due to the digital transformation of business sectors, the adoption of information technology devices and the ease of access to the Internet. However, this rise has numerous challenges, including power consumption, customization, security, and compliance. Traditionally, power is generated using fossil fuels, which run the components of datacenters, such as servers, cooling, storage and network systems. Fossil fuels emit carbon dioxide, heat and other gases, directly impacting the environment. Therefore, cloud service providers (CSPs) seek environment-friendly solutions using renewable energy sources to run the datacenters. On the other hand, the datacenters' servers can host multiple customer requests by deploying virtual machines (VMs). The improper placing of the VMs in the servers of datacenters can lead to more energy consumption and increase the overall cost. Recent studies show that VM placement algorithms use renewable energy sources. However, they dispatch the VMs chronologically without considering the types of VMs and servers. This paper proposes a solar energy-based VM placement (SEVMP) algorithm for geo-distributed datacenters. The proposed algorithm dispatches the VMs to the corresponding servers based on their types (groups) and costs, such as power, brown energy usage and fragmentation. Moreover, it selects an appropriate VM from a set of VMs arrived simultaneously to minimize the energy consumption and the overall cost. The SEVMP is simulated by varying VMs, servers and datacenters. The simulation results of SEVMP are compared with four state-of-the-art algorithms to show its effectiveness in the average energy cost, the total energy cost and the number of accepted VMs.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Geometric tree kernels: Classification of COPD from airway tree geometry

Geometric tree kernels: Classification of COPD from airway t...

引用

23rd international conference on Information Processing in Medical Imaging, IPMI 2013

作者： Feragen, Aasa Petersen, Jens Grimm, Dominik Dirksen, Asger Pedersen, Jesper Holst Borgwardt, Karsten De Bruijne, Marleen Department of Computer Science University of Copenhagen Denmark Max Planck Institute for Intelligent Systems Max Planck Institute for Developmental Biology Tübingen Germany Zentrum für Bioinformatik Eberhard Karls Universität Tübingen Germany Lungemedicinsk Afdeling Gentofte Hospital Denmark Department of Cardiothoracic Surgery Rigshospitalet Denmark Erasmus MC - University Medical Center Rotterdam Netherlands

ISBN: (纸本)9783642388675

Methodological contributions: This paper introduces a family of kernels for analyzing (anatomical) trees endowed with vector valued measurements made along the tree. While state-of-the-art graph and tree kernels use combinatorial tree/graph structure with discrete node and edge labels, the kernels presented in this paper can include geometric information such as branch shape, branch radius or other vector valued properties. In addition to being flexible in their ability to model different types of attributes, the presented kernels are computationally efficient and some of them can easily be computed for large datasets (N ~10.000) of trees with 30 - 600 branches. Combining the kernels with standard machine learning tools enables us to analyze the relation between disease and anatomical tree structure and geometry. Experimental results: The kernels are used to compare airway trees segmented from low-dose CT, endowed with branch shape descriptors and airway wall area percentage measurements made along the tree. Using kernelized hypothesis testing we show that the geometric airway trees are significantly differently distributed in patients with Chronic Obstructive Pulmonary Disease (COPD) than in healthy individuals. The geometric tree kernels also give a significant increase in the classification accuracy of COPD from geometric tree structure endowed with airway wall thickness measurements in comparison with state-of-the-art methods, giving further insight into the relationship between airway wall thickness and COPD. Software: Software for computing kernels and statistical tests is available at http://***/aasa/***. © 2013 Springer-Verlag.

关键词： Thickness measurement

来源：评论

学校读者我要写书评

暂无评论

Efficient Skyline Query Processing on Peer-to-Peer Networks

Efficient Skyline Query Processing on Peer-to-Peer Networks

引用

international conference on Data Engineering

作者： Shiyuan Wang Beng Chin Ooi Anthony K. H. Tung Lizhen Xu South-East University China National University of Singapore Singapore

ISBN: (纸本)1424408024

Skyline query has been gaining much interest in database research communities in recent years. Most existing studies focus mainly on centralized systems, and resolving the problem in a distributed environment such as a peer-to-peer (P2P) network is still an emerging topic. The desiderata of efficient skyline querying in P2P environment include: 1) progressive returning of answers, 2) low processing cost in terms of number of peers accessed and search messages, 3) balanced query loads among the peers. In this paper, we propose a solution that satisfies the three desiderata. Our solution is based on a balanced tree structured P2P network. By partitioning the skyline search space adaptively based on query accessing patterns, we are able to alleviate the problem of "hot" spots present in the skyline query processing. By being able to estimate the peer nodes within the query subspaces, we are able to control the amount of query forwarding, limiting the number of peers involved and the amount of messages transmitted in the network. Load balancing is achieved in query load conscious data space splitting/merging during the joining/departure of nodes and through dynamic load migration. Experiments on real and synthetic datasets confirm the effectiveness and scalability of our algorithm on P2P networks.

关键词： Query processing Peer to peer computing Load management History Databases Costs Merging Scalability Information retrieval Computer networks

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共106页 << < 97 98 99 100 101 102 103 104 105 106 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：