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

IEEE International Symposium on Parallel and Distributed Processing with Applications

作者： Ren, Wei Ren, Yi Zhang, Hui China Univ Geosci Sch Comp Sci Wuhan 430074 Peoples R China Univ Agder UIA Informat & Comm Tech Dept Kristiansand Norway Dept Elect Politecnico Torino Turin Italy

ISBN: (纸本)9780769537474

In In-networking storage Wireless Sensor Networks, sensed data are stored locally for a long term and retrieved on-demand instead of real-time. To maximize data survival, the sensed data are normally distributively stored at multiple nearby nodes. It arises a problem that how to check and grantee data integrity of distributed data storage in the context of resource constraints. In this paper, a technique called Two Granularity linear Code (TGLC) that consists of Intracodes and Inter-codes is presented. An efficient and lightweight data integrity check scheme based on TGLC is proposed. Data integrity can be checked by any one who holds short Intercodes, and the checking credentials is short Intra-codes that is dynamically generated. The proposed scheme is efficient and lightweight with respect to low storage and communication overhead, and yet checking validity is maintained. Our conclusion is justified by extensive analysis.

关键词： Data Integrity linear coding Secure Storage Wireless Sensor Networks Distributed Storage

来源：评论

学校读者我要写书评

暂无评论

MCSEC: Secure Coded Matrix Multiplication Scheme for Edge Computing with Minimum Communication Cost 18

MCSEC: Secure Coded Matrix Multiplication Scheme for Edge Co...

引用

18th IEEE Int Symp on Parallel and Distributed Proc with Applicat (ISPA) / 10th IEEE Int Conf on Big Data and Cloud Comp (BDCloud) / IEEE Int Symp on Social Comp and Networking (SocialCom) / IEEE Int Conf on Sustainable Comp and Commun (SustainCom)

作者： Dong, Tingting Wang, Jin Gu, Fei Zhou, Jingya Lu, Kejie Wang, Jianping Soochow Univ Comp Sci & Technol Suzhou Peoples R China Univ Puerto Rico Comp Sci & Engn Mayaguez PR USA City Univ Hong Kong Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9781665414852

Edge computing is an emerging technology that enables real-time and high-efficiency data processing by utilizing the storage, computing and communication capabilities of edge devices. Data security of computing tasks is the most important consideration in edge computing. Ensuring data security will bring additional communication load. Many researchers have proposed effective solutions to reduce the communication load. However, they did not further consider the communication cost in edge computing, i.e., the sum of the cost of each data transmission over the network, which includes communication load (the total amount of data transmission over the network). In this paper, we use communication cost instead of communication load and take matrix multiplication as the computing tasks to study the problem of secure matrix multiplication in edge computing with minimum communication cost (SMC). Specifically, we first theoretically analyze the security and decodability conditions of SMC to get the maximum number of matrix multiplication tasks stored on each edge device. Then we propose a scheme, i.e., Minimum Communication cost Secure coded Edge Computing (MCSEC), which adopts dynamic allocation and linear coding methods to allocate the matrix multiplication tasks to multiple edge devices and complete the coding design to satisfy the requirement of information-theoretic security (ITS), respectively. Moreover, we prove that the MCSEC achieves minimum communication cost by using constructive and logical analysis methods. Finally, we conduct extensive simulation experiments to evaluate the efficiency of MCSEC. The experiment results demonstrate that the MCSEC effectively reduces the communication cost (up to 71%) compared with other schemes.

关键词： edge computing matrix multiplication communication cost linear coding task allocation

来源：评论

学校读者我要写书评

暂无评论

A Lower Bound on Feedback Capacity of Colored Gaussian Relay Channels

A Lower Bound on Feedback Capacity of Colored Gaussian Relay...

引用

50th Annual Allerton Conference on Communication, Control, and Computing (Allerton)

作者： Agrawal, Mayur Love, David J. Balakrishnan, Venkataramanan Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

ISBN: (纸本)9781467345392;9781467345378

Relay channels aid in increasing the rate of communication possible from the source to the destination. However, in general, the capacity of a relay channel is still an open problem. In this work, we provide a lower bound for the capacity of the three-terminal relay channel with destination-source feedback in the presence of correlated noise using the recent results in [1] and employing linear processing at the relay node. We also extend our model to the one involving multiple relays in either series or parallel configuration. Simulation results show that significant improvements in the lower bound can be obtained via our formulation of the problem.

关键词： Relay channel feedback capacity correlated noise linear coding relay networks

来源：评论

学校读者我要写书评

暂无评论

A Null-space-based Verification Scheme for Coded Edge Computing against Pollution Attacks 25

A Null-space-based Verification Scheme for Coded Edge Comput...

引用

25th IEEE International Conference on Parallel and Distributed Systems (IEEE ICPADS)

作者： Fu, Mingjia Wang, Jin Zhou, Jingya Wang, Jianping Lu, Kejie Zhou, Xiaobo Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Collaborat Innovat Ctr Novel Software Technol & I Nanjing Peoples R China Georgia Inst Technol Dept Comp Sci Atlanta GA 30332 USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China Univ Puerto Rico Dept Comp Sci & Engn Mayaguez PR USA Tianjin Univ Dept Comp Sci & Technol Tianjin Peoples R China

ISBN: (纸本)9781728125831

Edge computing is attracting more and more attention in recent years to fulfill the requirements of latency-critical and computation-intensive applications. By using the coding redundancy, coded edge computing has emerged to optimize the total computation latency. Compared with the servers in cloud computing, edge devices located at the edge of network may not be reliable and trustworthy. In coded edge computing, even one incorrect intermediate result will lead to the incorrect final result. Therefore, considering the low computation capabilities of edge devices and low latency requirements of user, we study the result verification problem for coded edge computing. Specifically, we propose an efficient Orthogonal Mark (OM) verification scheme by the properties of linear space. We also conduct solid theoretical analysis to show the successful verification probabilities under two kinds of attack models, respectively. Finally, we conduct extensive simulations to show the effectiveness of the proposed OM verification scheme when comparing with basic coded edge computing scheme and Decoding Comparison (DC) scheme.

关键词： verifiable computation null space edge computing linear coding distributed computing

来源：评论

学校读者我要写书评

暂无评论

The Design of Secure Coded Edge Computing for User-Edge Collaborative Computing 20

The Design of Secure Coded Edge Computing for User-Edge Coll...

引用

20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom)

作者： Cui, Mingyue Wang, Jin Zhou, Jingya Lu, Kejie Wang, Jianping Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Collaborat Innovat Ctr Novel Software Technol & I Nanjing Peoples R China Univ Puerto Rico Dept Comp Sci & Engn Mayaguez PR USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9781665416580

In recent years, edge computing (EC), as an emerging technology, has been widely used in various industries. It can meet the needs of industries in real-time business, application intelligence, security and privacy protection. However, edge devices may not always be trustworthy in the edge computing environment. Moreover, traditional edge computing systems have ignored the fact that the computation capability of user device can also be used. In this paper, we propose the Minimum Computation Latency Secure Edge Computing (MCLSEC) scheme to minimize computation latency and provide the security of computing data by utilizing linear coding and the resources of both edge devices and user device. Specifically, we consider the matrix multiplication as a computation task, which is an important module in many application operations, such as machine learning, big data analysis, etc.. We firstly theoretically analyze the total computation latency of edge devices and user device in the coded edge computing. We then give the design of the MCLSEC scheme, which includes of the coding scheme and the task allocation scheme. Moreover, we also give theoretical analysis to show the proposed MCLSEC scheme is secure and optimal. Finally, we conduct extensive simulation experiments to show the effectiveness of the proposed scheme. Compared with the existing schemes, MCLSEC scheme significantly reduces the computation latency of edge computing while ensuring data confidentiality.

关键词： edge computing linear coding security computation latency task allocation

来源：评论

学校读者我要写书评

暂无评论

Performance Analysis of PAPR reduction for OFDM-BPSK,-QPSK and -QAM using Forward Error Correcting Code

Performance Analysis of PAPR reduction for OFDM-BPSK,-QPSK a...

引用

7th International Conference on Electrical and Computer Engineering

作者： Dey, M. R. Islam, M. S. Bangladesh Univ Engn & Technol Inst Informat & Commun Technol Dhaka 1000 Bangladesh

ISBN: (纸本)9781467314343;9781467314350

Orthogonal Frequency Division Multiplexing (OFDM) is an attractive modulation technique for transmitting large amounts of digital data over radio waves. A high peak-to-average power ratio (PAPR) is one of the major shortcomings in OFDM systems, as it causes nonlinearity distortion in the transmitter, degrading the performance of the system significantly. In this article, a new PAPR reduction method is proposed using forward error correcting coding technique. This method is based on block coding the input data and introducing deliberate errors prior to transmission iteratively, until the PAPR goes below a previously determined threshold value. Finally we have compared the performance of OFDM- BPSK,-QPSK and -QAM system by using forward error correcting code schemes that are used to encode the data stream.

关键词： OFDM PAPR BER block code linear coding

来源：评论

学校读者我要写书评

暂无评论

Children's early mental number line: Logarithmic or decomposed linear?

引用

JOURNAL OF EXPERIMENTAL CHILD PSYCHOLOGY 2009年第4期103卷 503-515页

作者： Moeller, Korbinian Pixner, Silvia Kaufmann, Liane Nuerk, Hans-Christoph Univ Tubingen Dept Psychol D-72072 Tubingen Germany Paris Lodron Univ Salzburg Dept Psychol A-5020 Salzburg Austria Univ Ulm Dept Child & Adolescent Psychiat D-89075 Ulm Germany Innsbruck Med Univ Dept Pediat 4 Div Neuropediat A-6020 Innsbruck Austria

Recently, the nature of children's mental number line has received much investigation. In the number line task, children are required to mark a presented number on a physical number line with fixed endpoints. Typically, it was observed that the estimations of younger/inexperienced children were accounted for best by a logarithmic function, whereas those of older/more experienced children were reflected best by a linear function. This led to the conclusion that children's mental number line transforms from logarithmic to linear with age and experience. In this study, we outline an alternative interpretation of children's performance in a number line task. We suggest that two separate linear representations for one- and two-digit numbers may exist in young children and that initially the integration of these two representations into the place value structure of the Arabic number system is not fully mastered. When testing this assumption in a sample of more than 120 first graders, we observed that the two-linear model consistently provided better fit indexes. We conclude that instead of assuming a transition from logarithmic to linear coding, performance differences could also be accounted for by an improvement in integrating tens and units into the Arabic place value system. (C) 2009 Elsevier Inc. All rights reserved.

关键词： Mental number line Logarithmic coding linear coding Number line task Numerical development Number magnitude

来源：评论

学校读者我要写书评

暂无评论

Constructing a linear network code for multicast networks based on hypergraphs

Constructing a linear network code for multicast networks ba...

引用

IEEE Global Telecommunications Conference (GLOBECOM 07)

作者： Yang, Min Yang, Yuanyuan SUNY Stony Brook Dept Elect & Comp Engn Stony Brook NY 11794 USA

ISBN: (纸本)9781424410422

Network coding is a promising generalization of routing which allows a node to generate output messages by encoding its received messages. An important scenario where network coding offers unique advantages is a multicast network where a source node generates messages and multiple receivers collect the messages. In a multicast network, linear network codes are preferred due to its sufficiency and simplicity. In this paper, we propose a method to transform the linear coding problem to a graph theory problem. With the help of hypergraphs, we model the linear codes by constructing a pseudo-dual graph of the multicast network. A valid linear code is equal to a cover in the pseudo-dual graph satisfying some constraints. By iterative refinements, an eligible cover can be found in polynomial time. Moreover, this method can be readily applied to many minimum network coding problems as well.

关键词： network coding linear coding multicast network hypergraph

来源：评论

学校读者我要写书评

暂无评论

PCHEC: A Private Coded Computation Scheme For Heterogeneous Edge Computing 20

PCHEC: A Private Coded Computation Scheme For Heterogeneous ...

引用

20th IEEE International Conference on Trust, Security and Privacy in Computing and Communications (IEEE TrustCom)

作者： Chang, Jiqing Wang, Jin Gu, Fei Lu, Kejie Li, Lingzhi Wang, Jianping Soochow Univ Sch Comp Sci & Technol Suzhou Peoples R China Collaborat Innovat Ctr Novel Software Technol & I Nanjing Peoples R China Univ Puerto Rico Dept Comp Sci & Engn Mayaguez PR USA City Univ Hong Kong Dept Comp Sci Hong Kong Peoples R China

ISBN: (纸本)9781665416580

Recently, edge computing (EC) has attracted wide attention as a novel and promising computing mode with high real-time and low-latency characteristics. However, users' privacy and the limited resources have become major concerns in the implementation of EC because edge devices are usually heterogeneous and untrustworthy. Although many related works have protected the user's privacy, they did not take the storage resource limitation of heterogeneous edge devices into consideration and their schemes may cause high communication load. In this paper, we propose PCHEC, a Private Coded computation scheme for Heterogeneous Edge Computing, to protect the user's privacy and minimize the communication load. Specifically, PCHEC first gives a storage allocation scheme to minimize the communication load in EC where the heterogeneous edge devices have different storage limits. Secondly, PCHEC utilizes linear coding to mix the target data with other information for the protection of the user's privacy. To evaluate the efficiency of PCHEC, we make theoretically analysis and conduct extensive simulations. The experiments show PCHEC effectively reduces the communication load by up to 70% compared with other schemes.

关键词： edge computing privacy heterogeneous devices linear coding optimization

来源：评论

学校读者我要写书评

暂无评论

A Class of Non-linearly Solvable Networks

A Class of Non-Linearly Solvable Networks

引用

IEEE International Symposium on Information Theory (ISIT)

作者： Connelly, Joseph Zeger, Kenneth Univ Calif San Diego Dept Elect & Comp Engn La Jolla CA 92093 USA

ISBN: (纸本)9781509018062

For each positive composite integer m, a network is constructed, which is solvable over an alphabet of size m but is not solvable over any smaller alphabet. These networks have no linear solutions over any module alphabets and are not asymptotically linearly solvable over any finite-field alphabets. The networks' capacities are all shown to equal one, and their linear capacities are all shown to be bounded away from one for all finite-field alphabets. In addition, if m is a non-power-of-prime composite number, then such a network is not solvable over any prime-power-size alphabet.

关键词： Capacity linear coding network solvability network coding

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：