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

linearly coded profilometry with a coding light that has isosceles triangle teeth: Even-number-sample decoding method

引用

APPLIED OPTICS 1997年第7期36卷 1615-1620页

作者： Fang, QA []The author is with the Department of Applied Physics Xi’an Jiaotong University Xi’an Shaanxi 710049 China.

A new triangulation-based optical profilometry-linearly coded profilometry (LCP)-is presented. In this method, a linear coding technique is introduced. It uses a periodic sawtoothlike structure light to code the surface being measured and the phase-shifting technique to decode the profile. A coding light that has isosceles triangle teeth is proposed. To realize the decoding, at least three samples are needed. When more than three samples are used, higher accuracy can be obtained. A decoding method of LCP with an even number of samples is provided. This method has been realized in my laboratory and the experimental results verify the reliability of LCP. Because the coding method used in LCP is simpler than that used in phase-measuring profilometry, LCP has a faster measuring speed. (C) 1997 Optical Society of America.

关键词： optical profilometry linear coding

来源：评论

学校读者我要写书评

暂无评论

Optimal Task Allocation and coding Design for Secure Edge Computing With Heterogeneous Edge Devices

引用

IEEE TRANSACTIONS ON CLOUD COMPUTING 2022年第4期10卷 2817-2833页

作者： Wang, Jin Cao, Chunming Wang, Jianping Lu, Kejie Jukan, Admela Zhao, Wei Soochow Univ Dept Comp Sci & Technol Suzhou 215006 Peoples R China China Mobile Suzhou Software Technol Co Ltd Suzhou 215000 Peoples R China City Univ Dept Comp Sci Hong Kong Peoples R China Univ Puerto Rico Mayaguez Dept Comp Sci & Engn Mayaguez PR 00682 USA Tech Univ Braunschweig Dept Elect Engn Informat Technol Phys D-38106 Braunschweig Germany CAS Shenzhen Inst Adv Technol Shenzhen 518055 Peoples R China

In recent years, edge computing has attracted significant attention because it can effectively support many delay-sensitive applications. Despite such a salient feature, edge computing also faces many challenges, especially for efficiency and security, because edge devices are usually heterogeneous and may be untrustworthy. To address these challenges, we propose a unified framework to provide efficiency and confidentiality by coded distributed computing. Within the proposed framework, we use matrix multiplication, a fundamental building block of many distributed machine learning algorithms, as the representative computation task. To minimize resource consumption while achieving information-theoretic security, we investigate two highly-coupled problems, (1) task allocation that assigns data blocks in a computing task to edge devices and (2) linear code design that generates data blocks by encoding the original data with random information. Specifically, we first theoretically analyze the necessary conditions for the optimal solution. Based on the theoretical analysis, we develop an efficient task allocation algorithm to obtain a set of selected edge devices and the number of coded vectors allocated to them. Using the task allocation results, we then design secure coded computing schemes, for two cases, (1) with redundant computation and (2) without redundant computation, all of which satisfy the availability and security conditions. Moreover, we also theoretically analyze the optimization of the proposed scheme. Finally, we conduct extensive simulation experiments to demonstrate the effectiveness of the proposed schemes.

关键词： Edge computing efficiency confidentiality coded computing task allocation linear coding optimization

来源：评论

学校读者我要写书评

暂无评论

Source coding using families of universal hash functions

引用

IEEE TRANSACTIONS ON INFORMATION THEORY 2007年第9期53卷 3226-3233页

作者： Koga, Hiroki Univ Tsukuba Grad Sch Syst & Informat Engn Tsukuba Ibaraki 3058573 Japan

This correspondence is concerned with new connections between source coding and two kinds of families of hash functions known as the families of universal hash functions and N-strongly universal hash functions, where N >= 2 is an integer. First, it is pointed out that such families contain classes of well-known source codes such as bin codes and linear codes. Next, performance of a source coding scheme using either of the two kinds of families is evaluated. An upper bound on the expectation of the decoding error probability is obtained for each family. The expectation of the decoding error probability is analyzed in detail for the cases of discrete memoryless sources and sources without the memoryless assumption under a certain class of decoders.

关键词： bin coding error exponent linear coding strongly universal hash functions universal hash functions

来源：评论

学校读者我要写书评

暂无评论

Adaptive locality-constrained regularized robust coding for image recognition

引用

OPTIK 2019年 178卷 1208-1217页

作者： Du, Haishun Ma, Luogang Hu, Qingpu Wang, Sheng Zhang, Yanyu Henan Univ Inst Image Proc & Pattern Recognit Kaifeng 475004 Peoples R China

We propose a novel adaptive locality-constrained regularized robust coding (ALRRC) for image recognition by considering both the effects of the test sample's features and the local relationships between the test sample and the training samples in the linear coding procedure. By adaptively calculating out a feature weight matrix of a test sample, ALRRC measures the effects of the test sample's features in the linear coding procedure. Furthermore, ALRRC can obtain the weighted test sample by multiplying the test sample by the feature weight matrix, which has reduced the roles of the aberrant features as far as possible. Similarly, ALRRC can get the weighted training samples by multiplying the training samples by the feature weight matrix. Moreover, using the similarities between the weighted test sample and weighted training samples, ALRRC adaptively calculates out a locality-constrained matrix that can truly characterize the local relationships between the test sample and the training samples. Finally, by incorporating the feature weight matrix and locality-constrained matrix into the linear coding framework, ALRRC is inclined to select the true local training samples to represent the test sample. In addition, we also propose an iterative algorithm to solve the optimization problem of ALRRC. Experimental results on several image databases show that ALRRC is more effective and robust than state-of-the-art linear coding-based methods.

关键词： Locality constraint Feature weight Robust coding linear coding Image recognition

来源：评论

学校读者我要写书评

暂无评论

Decodability of Network coding with Time-Varying Delay and No Buffering

引用

IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES 2009年第8期E92A卷 2141-2145页

作者： Tateno, Terumasa Matsumoto, Ryutaroh Uyematsu, Tomohiko Tokyo Inst Technol Dept Commun & Integrated Syst Tokyo 1528550 Japan

We show the sufficient conditions for coding by nodes such that every sink can decode all information multicasted by the single source when there exists time-varying delay of information transmission at links in the n... 详细信息

关键词： time-varying delay network coding linear coding multicast

来源：评论

学校读者我要写书评

暂无评论

Multisource network coding with two sinks

Multisource network coding with two sinks

引用

International Conference on Communications, Circuits and Systems

作者： Ngai, CK Yeung, RW Chinese Univ Hong Kong Dept Informat Engn Shatin Hong Kong Peoples R China

ISBN: (纸本)0780386477

Network coding shows,that data rate can be increased if information is allowed, to be encoded in the network nodes. The recent work of Li, Yeung and Cai [1], and Koetter and Medard [2], shows that linear network coding is sufficient for single source multicast network. The restrictiveness of usage of linear code is still an unknown in the general multisource multicast network. In this paper, we characterize the achievable information rate region for single source node multi-source multicast networks with two sinks. We further show that linear coding is sufficient for achieving the maximum network capacity.

关键词： network coding multicast linear coding

来源：评论

学校读者我要写书评

暂无评论

CodedINT: Leveraging Network coding to Improve the Visibility of In-band Network Telemetry (INT)

CodedINT: Leveraging Network Coding to Improve the Visibilit...

引用

IEEE International Conference on Communications (ICC)

作者： Ma, Zhihuang Tang, Shaofei Tao, Wenpeng Xue, Yuhan Zhut, Zuqing Univ Sci & Technol China Sch Informat Sci & Technol Hefei Peoples R China

ISBN: (数字)9781538683477

ISBN: (纸本)9781538683477

With momentum gained from programmable data plane (PDP), in-band network telemetry (INT) has been widely considered as a promising technique for realtime network monitoring. In this work, we leverage network coding (NC) to design CodedINT, for improving the visibility of INT in lossy networks. Specifically, we propose to encode the telemetry data in multiple packets with NC and distribute the encoded data over a group of packets. Then, among the group of packets, if we can receive enough ones that satisfy the decoding condition of NC, the whole original telemetry data can be recovered. We first explain the design of CodedINT to elaborate on its operation principle, packet format, and system implementation. Then, we implement and experimentally evaluate CodedINT in a real network testbed. Our experiments demonstrate that in a lossy network with packet loss rate at 80%, CodedINT ensures that 89:48% of the telemetry data carried by INT packets can be recovered successfully.

关键词： In-band Network Telemetry (INT) Protocol-oblivious forwarding (POF) OpenvSwitch (OVS) linear coding

来源：评论

学校读者我要写书评

暂无评论

Gossiping with Network coding

Gossiping with Network Coding

引用

17th IEEE Pacific Rim International Symposium on Dependable Computing (PRDC)

作者： Tokuyama, Shun Tsuchiya, Tatsuhiro Kikuno, Tohru Osaka Univ Suita Osaka 5650871 Japan

ISBN: (纸本)9780769545905

Gossip is a scalable and easy-to-deploy broadcast method for distributed systems. In gossip a broadcast message is disseminated through repeated information exchanges between randomly chosen nodes. Gossip can also achieve high reliability using a large amount of redundant messages;but this also incurs high load on the network. This paper proposes a new gossip algorithm which incorporates network coding techniques to mitigate the high load. With random linear coding, each message propagated in the new algorithm is randomly generated from the broadcast message. Unlike in ordinary gossip, this feature prevents nodes from receiving an identical message more than once, allowing to achieve the same reliability at a lower message cost.

关键词： gossip linear coding network coding broadcast reliability

来源：评论

学校读者我要写书评

暂无评论

Communicating Over Filter-and-Forward Relay Networks With Channel Output Feedback

引用

IEEE TRANSACTIONS ON SIGNAL PROCESSING 2016年第5期64卷 1117-1131页

作者： Agrawal, Mayur Love, David J. Balakrishnan, Venkataramanan WorldQuant Res India Private Ltd Mumbai 400076 MH India Purdue Univ Sch Elect & Comp Engn W Lafayette IN 47907 USA

Relay networks aid in increasing the rate of communication from source to destination. However, the capacity of even a three-terminal relay channel is an open problem. In this paper, we propose a new lower bound for the capacity of the three-terminal relay channel with destination-to-source feedback in the presence of noise with memory. Our lower bound improves on the existing bounds in the literature. We then extend our lower bound to general relay network configurations using an arbitrary number of filter-and-forward relay nodes. Such network configurations are common in many multihop communication systems where the intermediate nodes can only perform minimal processing due to limited computational power. Simulation results show that significant improvements in the achievable rate can be obtained through our approach. We next derive a coding strategy (optimized using post processed signal-to-noise ratio as a criterion) for the three-terminal relay channel with noisy channel output feedback for two transmissions. This coding scheme can be used in conjunction with open-loop codes for applications like automatic repeat request (ARQ) or hybrid-ARQ.

关键词： Channel output feedback concatenated coding correlated noise linear coding relay networks relays

来源：评论

学校读者我要写书评

暂无评论

Nonconcurrent error detection and correction in fault-tolerant linear finite-state machines

引用

IEEE TRANSACTIONS ON AUTOMATIC CONTROL 2003年第12期48卷 2133-2140页

作者： Hadjicostis, CN Univ Illinois Coordinated Sci Lab Urbana IL 61801 USA Univ Illinois Dept Elect & Comp Engn Urbana IL 61801 USA

In this paper, we construct fault-tolerant linear finite-state machines (LFSMs) in which error. detection and correction can be performed nonconcurrently (e.g., periodically). More specifically, by jointly choosing the state encoding constraints and the redundant dynamics of the fault-tolerant LFSM we enable an external checker to detect and identify errors due to past faults based on the current, possibly corrupted state of. the LFSM. The paper presents systematic constructions of fault-tolerant LFSMs based on a characterization of nonconcurrent error detection/correction in terms of state encoding constraints and redundant dynamics. In particular, we develop a scheme that uses Bose-Chaudhuri-Hocquenghem (BCH) coding and obtains fault-tolerant LFSMs that require 2D additional state variables and have the ability to correct up to D errors in any state variable at any time step in the time interval consisting of the latest N time steps of operations The construction uses the minimum possible number of additional state variables and requires an error detecting/correcting mechanism with computational complexity that is only linear in N.

关键词： linear finite-state machines linear coding fault tolerance transient faults nonconcurrent error detection and correction system embeddings

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：