掌桥科研
跨库:
单库:

您现在的位置:首页>外文会议>会议详情

会议信息

会议名称:

Information Theory and Applications Workshop

召开年:

2017

召开地:

San Diego

会议文集:

2017 Information Theory and Applications Workshop: Information Theory and Applications Workshop (ITA), 12-17 Feb. 2017, San Diego, CA, USA

主办单位:

Institute of Electrical and Electronics Engineers

出版时间:

-
全选 (0)
469条结果 1/20
  • 题名 作者 来源 发表时间 操作
  • A comparison of two methods for fountain-coded file distribution in an ad hoc network with relays

    作者:Siddhartha S. Borkotoky;Michael B. Pursley; 会议名称:Information Theory and Applications Workshop 2017年

    We investigate two approaches to fountain-coded broadcast file distribution in an ad hoc packet radio network. In the first method, all destinations receive fountain-coded packets directly from the source. In the second method, after one destination obtains the file, it acts as a relay node by applying continued fountain coding to the file and sending the encoded packets to other destinations. The other destinations combine the fountain-coded packets they received from the source with those they obtain from the relay node. We compare the performance of the two methods when they are employed in a network whose links have Rayleigh fading. As performance benchmarks, we also examine two conventional broadcast techniques that use automatic repeat request (ARQ) for retransmission of erased packets.

    关键字:Relays;Encoding;Throughput;Protocols;Ad hoc networks;Rayleigh channels

  • A comparison of two methods for fountain-coded file distribution in an ad hoc network with relays

    Siddhartha S. Borkotoky;Michael B. Pursley;

    Information Theory and Applications Workshop

    2017年

  • Correcting errors by natural redundancy

    作者:Anxiao Jiang;Pulakesh Upadhyaya;Erich F. Haratsch;Jehoshua Bruck; 会议名称:Information Theory and Applications Workshop 2017年

    For the storage of big data, there are significant challenges with its long-term reliability. This paper studies how to use the natural redundancy in data for error correction, and how to combine it with error-correcting codes to effectively improve data reliability. It explores several aspects of natural redundancy, including the discovery of natural redundancy in compressed data, the efficient decoding of codes with random structures, the capacity of error-correcting codes that contain natural redundancy, and the time-complexity tradeoff between source coding and channel coding.

    关键字:Decoding;Redundancy;Image coding;Iterative decoding;Error correction codes;Error correction

  • Correcting errors by natural redundancy

    Anxiao Jiang;Pulakesh Upadhyaya;Erich F. Haratsch;Jehoshua Bruck;

    Information Theory and Applications Workshop

    2017年

  • Advances in DNA storage

    作者:Naveen Goela;Jean Bolot; 会议名称:Information Theory and Applications Workshop 2017年

    With decreasing costs for DNA synthesis and sequencing, ultra-dense DNA storage is an emerging, viable technology. The original proof of concept [1]-[3] has yielded several experiments of larger scale demonstrating archival storage in DNA molecules [4]-[7]. In particular, a recent collaboration by Harvard and Technicolor announced the storage of 22 MB of data in synthetic DNA [4]. Primarily, existing storage systems utilize high-fidelity synthesizers. For synthesizers which incur non-negligible insertions and deletions, a large fraction of the oligonucleotide segments produced have unequal, variable lengths. This talk overviews methods to correct for synchronization errors in variable-length segments using synchronization codes (e.g., [8], [9]).

    关键字:DNA;Synchronization

  • Advances in DNA storage

    Naveen Goela;Jean Bolot;

    Information Theory and Applications Workshop

    2017年

  • Bit allocation for increased power efficiency in 5G receivers with variable-resolution ADCs

    作者:Waqas bin Abbas;Felipe Gomez-Cuba;Michele Zorzi; 会议名称:Information Theory and Applications Workshop 2017年

    In future mmWave wireless system, fully digital receivers may have an excessive power consumption at the Analog to Digital Converters (ADC), even if lower resolution ADCs are employed. We propose to optimize the ADC resolution exploiting the sparse propagation in mmWave. We identify and assign more bits to antennas that capture stronger incoming signals, and allocate fewer bits to the antennas that see mostly noise. In order to facilitate a potential practical implementation, we constrain the allocation problem so the number of bits assigned to each antenna can take only one of two values, b or b. Compared to a reference fixed-resolution mmWave system with b bits (b ≤ b ≤ b), and depending on the margin between the two options given to the algorithm, (b, b), our results show that 2-level receivers with a low margin (e.g., (4, 6)) can achieve moderate power saving (5-20\%) consistent across any received unquantized SNR value, whereas 2-level receivers with a wide margin (e.g., (1, 8)) can achieve a large power saving (80\%) only at high SNR, while consuming more power than the reference at low SNR. Combining bit allocation with antenna selection techniques, we create a 3-level system (e.g., 0, 4, 8) that can outperform the former scenario when the given resolution options are carefully chosen.

    关键字:Signal to noise ratio;Power demand;Receiving antennas;MIMO;Signal resolution

  • Bit allocation for increased power efficiency in 5G receivers with variable-resolution ADCs

    Waqas bin Abbas;Felipe Gomez-Cuba;Michele Zorzi;

    Information Theory and Applications Workshop

    2017年

  • Communicating correlated sources over multi-user channels

    作者:Arun Padakandla; 会议名称:Information Theory and Applications Workshop 2017年

    A new coding technique, based on fixed block-length codes, is proposed for the problems of communicating a pair of correlated sources over (i) a 2-user multiple access channel (MAC) and (ii) a 2-user interference channel. Its performance is analyzed to derive a new set of sufficient conditions for both problems. The derived conditions are proven to be strictly less binding than the current known best. Our findings are inspired by Dueck's example [1].

    关键字:Channel coding;Integrated circuits;Correlation;Decoding;Markov processes;Interference channels

  • Communicating correlated sources over multi-user channels

    Arun Padakandla;

    Information Theory and Applications Workshop

    2017年

  • Computing inter-encounter time distributions for multiple random walkers on graphs

    作者:Quynh Nguyen;Bhaskar Krishnamachari; 会议名称:Information Theory and Applications Workshop 2017年

    For intermittently connected mobile networks such as sparsely-deployed vehicular networks, it is of great interest to characterize the distribution of encounter times. We consider a very general mobility model in which each device is assumed to be moving through a given graph following a general random walk with arbitrary transition probabilities. We consider first the pairwise inter-encounter time distribution for a pair of random walkers and present a recursive polynomial-time computation that yields the exact solution. We then consider the individual-to-any inter-encounter time (i.e., the time between contacts of a particular walker with any of the other walkers in the population). For this harder problem, we give an approximate computation that is also polynomial time. We validate the accuracy of the presented solutions using numerical simulations. We discuss how the model can be generalized to consider multiple populations.

    关键字:Mathematical model;Peer-to-peer computing;Probability;Automobiles;Mobile communication;Computational modeling;Mobile computing

  • Computing inter-encounter time distributions for multiple random walkers on graphs

    Quynh Nguyen;Bhaskar Krishnamachari;

    Information Theory and Applications Workshop

    2017年

  • Device-aware routing and scheduling in multi-hop Device-to-Device networks

    作者:Yuxuan Xing;Hulya Seferoglu; 会议名称:Information Theory and Applications Workshop 2017年

    The dramatic increase in data and connectivity demand, in addition to heterogeneous device capabilities, poses a challenge for future wireless networks. One of the promising solutions is Device-to-Device (D2D) networking. D2D networking, advocating the idea of connecting two or more devices directly without traversing the core network, is promising to address the increasing data and connectivity demand. In this paper, we consider D2D networks, where devices with heterogeneous capabilities including computing power, energy limitations, and incentives participate in D2D activities heterogeneously. We develop (i) a device-aware routing and scheduling algorithm (DARS) by taking into account device capabilities, and (ii) a multi-hop D2D testbed using Android-based smartphones and tablets by exploiting Wi-Fi Direct and legacy Wi-Fi connections. We show that DARS significantly improves throughput in our testbed as compared to state-of-the-art.

    关键字:Mobile communication;Device-to-device communication;Routing;Topology;Diamond;Mobile computing;Base stations

  • Device-aware routing and scheduling in multi-hop Device-to-Device networks

    Yuxuan Xing;Hulya Seferoglu;

    Information Theory and Applications Workshop

    2017年

  • Generalized Hessian approximations via Stein's lemma for constrained minimization

    作者:Murat A. Erdogdu; 会议名称:Information Theory and Applications Workshop 2017年

    We consider the problem of convex constrained minimization of an average of n functions, where the parameter and the features are related through inner products. We focus on second order batch updates, where the curvature matrix is obtained by assuming random design and by applying the celebrated Stein's lemma together with subsampling techniques. The proposed algorithm enjoys fast convergence rates similar to the Newton method, yet the per-iteration cost has the same order of magnitude as the gradient descent. We demonstrate its performance on well-known optimization problems where Stein's lemma is not directly applicable, such as M-estimation for robust statistics, and inequality form linear/quadratic programming etc. Under certain assumptions, we show that the constrained optimization algorithm attains a composite convergence rate that is initially quadratic and asymptotically linear. We validate its performance through widely encountered optimization tasks on several real and synthetic datasets by comparing it to classical optimization algorithms.

    关键字:convergence;convex programming;gradient methods;Hessian matrices;minimisation

  • Generalized Hessian approximations via Stein's lemma for constrained minimization

    Murat A. Erdogdu;

    Information Theory and Applications Workshop

    2017年

  • Info-clustering: An efficient algorithm by network information flow

    作者:Chung Chan;Ali Al-Bashabsheh;Qiaoqiao Zhou; 会议名称:Information Theory and Applications Workshop 2017年

    Motivated by the fact that entities in a social network or biological system often interact by exchanging information, we propose an efficient info-clustering algorithm that can group entities into communities using a parametric max-flow algorithm. This is a meaningful special case of the info-clustering paradigm where the dependency structure is graphical and can be learned readily from data.

    关键字:Mutual information;Random variables;Pins;Clustering algorithms;Entropy;Social network services;Approximation algorithms

  • Info-clustering: An efficient algorithm by network information flow

    Chung Chan;Ali Al-Bashabsheh;Qiaoqiao Zhou;

    Information Theory and Applications Workshop

    2017年

  • Integrated code design for a joint source and channel LDPC coding scheme

    作者:Hsien-Ping Lin;Shu Lin;Khaled Abdel-Ghaffar; 会议名称:Information Theory and Applications Workshop 2017年

    This paper presents a design of LDPC codes for a joint source-channel (JSC) coding system. In the construction of such an LDPC code, the source compression matrix and the channel code parity-check matrix are designed jointly. The integrated matrix is used for both JSC encoding and decoding. Experimental results show that the codes constructed not only perform well in the waterfall region but also achieve low error-floors.

    关键字:Parity check codes;Floors

  • Integrated code design for a joint source and channel LDPC coding scheme

    Hsien-Ping Lin;Shu Lin;Khaled Abdel-Ghaffar;

    Information Theory and Applications Workshop

    2017年

  • Local Conditioning on undirected graphs

    作者:Matthew G. Reyes;David L. Neuhoff; 会议名称:Information Theory and Applications Workshop 2017年

    This paper proposes Local Conditioning as a truly distributed exact version of Belief Propagation for cyclic undirected graphical models. It is shown how to derive explicit recursive updates for messages and beliefs that are truly distributed in the sense that messages are passed between individual nodes of the graph rather than between clustered nodes. Such a distributed algorithm is especially relevant for problems that require a distributed implementation, for example sensor networks. In order to compare its complexity and ease of implementation with a clustered version of Belief Propagation, we illustrate both in a Min-Sum block interpolation problem within the context of an Ising model.

    关键字:Belief propagation;Clustering algorithms;Complexity theory;Graphical models;Interpolation;Distributed algorithms;Standards

  • Local Conditioning on undirected graphs

    Matthew G. Reyes;David L. Neuhoff;

    Information Theory and Applications Workshop

    2017年

  • Multidimensional index modulation in wireless communications

    作者:Bharath Shamasundar;Swaroop Jacob;Sandeep Bhat;A. Chockalingam; 会议名称:Information Theory and Applications Workshop 2017年

    In index modulation schemes, information bits are conveyed through indexing of transmission entities such as antennas, subcarriers, times slots, precoders, subarrays, and radio frequency (RF) mirrors. Index modulation schemes are attractive for their advantages such as good performance, high rates, and hardware simplicity. This paper focuses on index modulation schemes in which multiple transmission entities, namely, antennas, time slots, and RF mirrors, are indexed simultaneously. Recognizing that such multidimensional index modulation schemes encourage sparsity in their transmit signal vectors, we propose efficient signal detection schemes that use compressive sensing based reconstruction algorithms. Results show that, for a given rate, improved performance is achieved when the number of indexed transmission entities is increased. We also explore indexing opportunities in load modulation, which is a modulation scheme that offers power efficiency and reduced RF hardware complexity advantages in multiantenna systems. Results show that indexing space and time in load modulated multiantenna systems can achieve improved performance.

    关键字:Radio frequency;Modulation;Transmitting antennas;Indexing;Hardware

  • Multidimensional index modulation in wireless communications

    Bharath Shamasundar;Swaroop Jacob;Sandeep Bhat;A. Chockalingam;

    Information Theory and Applications Workshop

    2017年

  • On the duality between multiple-access codes and computation codes

    作者:Jingge Zhu;Sung Hoon Lim;Michael Gastpar; 会议名称:Information Theory and Applications Workshop 2017年

    For a two-user Gaussian multiple access channel, computation codes are designed for the scenarios where the decoder is not interested in decoding the two codewords, but only the sum of them. It has been observed that good computation codes should possess some algebraic structure. In this note, we expose the fact that such algebraic structure could undermine the capability of the codes for recovering the messages, i.e., for the purpose of multiple-access. Particularly, we establish duality results between the codes which are good for computation and the codes which are good for multiple access.

    关键字:Receivers;Decoding;Signal to noise ratio;Zinc;Reliability;Upper bound;Encoding

  • On the duality between multiple-access codes and computation codes

    Jingge Zhu;Sung Hoon Lim;Michael Gastpar;

    Information Theory and Applications Workshop

    2017年

  • On the Gaussian Z-interference channel

    作者:Max Costa;Chandra Nair;David Ng; 会议名称:Information Theory and Applications Workshop 2017年

    The optimality of the Han and Kobayashi achievable region (with Gaussian signaling) remains an open problem for Gaussian interference channels. In this paper we focus on the Gaussian Z-interference channel. We first show that using correlated (over time) Gaussian signals does not improve on the Han and Kobayashi achievable rate region. Secondly we compute the slope of the Han and Kobayashi achievable region with Gaussian signaling around the Sato's corner point.

    关键字:Interference channels;Eigenvalues and eigenfunctions;Power control;Encoding;Channel capacity;Random variables

  • On the Gaussian Z-interference channel

    Max Costa;Chandra Nair;David Ng;

    Information Theory and Applications Workshop

    2017年

  • On the performance of random reshuffling in stochastic learning

    作者:Bicheng Ying;Kun Yuan;Stefan Vlaski;Ali H. Sayed; 会议名称:Information Theory and Applications Workshop 2017年

    In empirical risk optimization, it has been observed that gradient descent implementations that rely on random reshuffling of the data achieve better performance than implementations that rely on sampling the data randomly and independently of each other. Recent works have pursued justifications for this behavior by examining the convergence rate of the learning process under diminishing step-sizes. Some of these justifications rely on loose bounds, or their conclusions are dependent on the sample size which is problematic for large datasets. This work focuses on constant step-size adaptation, where the agent is continuously learning. In this case, convergence is only guaranteed to a small neighborhood of the optimizer albeit at a linear rate. The analysis establishes analytically that random reshuffling outperforms independent sampling by showing that the iterate at the end of each run approaches a smaller neighborhood of size O(μ) around the minimizer rather than O(μ). Simulation results illustrate the theoretical findings.

    关键字:gradient methods;learning (artificial intelligence)

  • On the performance of random reshuffling in stochastic learning

    Bicheng Ying;Kun Yuan;Stefan Vlaski;Ali H. Sayed;

    Information Theory and Applications Workshop

    2017年

  • Optimal transportation to the entropy-power inequality

    作者:Olivier Rioul; 会议名称:Information Theory and Applications Workshop 2017年

    We present a simple proof of the entropy-power inequality using an optimal transportation argument which takes the form of a simple change of variables. The same argument yields a reverse inequality involving a conditional differential entropy which has its own interest. It can also be generalized in various ways. The equality case is easily captured by this method and the proof is formally identical in one and several dimensions.

    关键字:Entropy;Transportation;Random variables;Xenon;Distribution functions;Jacobian matrices;Mutual information

  • Optimal transportation to the entropy-power inequality

    Olivier Rioul;

    Information Theory and Applications Workshop

    2017年

  • Poisson cluster process: Bridging the gap between PPP and 3GPP HetNet models

    作者:Chiranjib Saha;Mehrnaz Afshang;Harpreet S. Dhillon; 会议名称:Information Theory and Applications Workshop 2017年

    The growing complexity of heterogeneous cellular networks (HetNets) has necessitated the need to consider variety of user and base station (BS) configurations for realistic performance evaluation and system design. This is directly reflected in the HetNet simulation models considered by standardization bodies, such as the third generation partnership project (3GPP). Complementary to these simulation models, stochastic geometry-based approach modeling the user and BS locations as independent and homogeneous Poisson point processes (PPPs) has gained prominence in the past few years. Despite its success in revealing useful insights, this PPP-based model is not rich enough to capture all the spatial configurations that appear in real-world HetNet deployments (on which 3GPP simulation models are based). In this paper, we bridge the gap between the 3GPP simulation models and the popular PPP-based analytical model by developing a new unified HetNet model in which a fraction of users and some BS tiers are modeled as Poisson cluster processes (PCPs). This model captures both non-uniformity and coupling in the BS and user locations. For this setup, we derive exact expression for downlink coverage probability under maximum signal-to-interference ratio (SIR) cell association model. As intermediate results, we define and evaluate sum-product functionals for PPP and PCP. Special instances of the proposed model are shown to closely resemble different configurations considered in 3GPP HetNet models. Our results concretely demonstrate that the performance trends are highly sensitive to the assumptions made on the user and SBS configurations.

    关键字:3GPP;Analytical models;Stochastic processes;Couplings;Macrocell networks;Geometry

  • Poisson cluster process: Bridging the gap between PPP and 3GPP HetNet models

    Chiranjib Saha;Mehrnaz Afshang;Harpreet S. Dhillon;

    Information Theory and Applications Workshop

    2017年

  • Reed-Solomon based globally coupled quasi-cyclic LDPC codes

    作者:Juane Li;Keke Liu;Shu Lin;Khaled Abdel-Ghaffar; 会议名称:Information Theory and Applications Workshop 2017年

    This paper presents a special type of LDPC codes constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes. LDPC codes of this type are referred to as globally coupled RS-LDPC codes. These codes are designed for correcting random errors, random short phased bursts of erasures and long bursts of erasures. The Tanner graph of a globally coupled RS-LDPC is composed of a number of disjoint copies of the Tanner graph of a local RS-LDPC code which are connected together by a group of overall check-nodes (CNs), called global CNs. A globally coupled RS-LDPC code can be decoded with a two-phase local/global iterative scheme which allows correction of local random errors and phased bursts of erasures in the local phase and global random errors and a single long burst of erasures in the global phase.

    关键字:Iterative decoding;Generators;Sparse matrices;Null space;Bit error rate;Reed-Solomon codes

  • Reed-Solomon based globally coupled quasi-cyclic LDPC codes

    Juane Li;Keke Liu;Shu Lin;Khaled Abdel-Ghaffar;

    Information Theory and Applications Workshop

    2017年

  • Replica symmetry breaking in compressive sensing

    作者:Ali Bereyhi;Ralf Müller;Hermann Schulz-Baldes; 会议名称:Information Theory and Applications Workshop 2017年

    For noisy compressive sensing systems, the asymptotic distortion with respect to an arbitrary distortion function is determined when a general class of least-square based reconstruction schemes is employed. The sampling matrix is considered to belong to a large ensemble of random matrices including i.i.d. and projector matrices, and the source vector is assumed to be i.i.d. with a desired distribution. We take a statistical mechanical approach by representing the asymptotic distortion as a macroscopic parameter of a spin glass and employing the replica method for the large-system analysis. In contrast to earlier studies, we evaluate the general replica ansatz which includes the RS ansatz as well as RSB. The generality of the solution enables us to study the impact of symmetry breaking. Our numerical investigations depict that for the reconstruction scheme with the “zero-norm” penalty function, the RS fails to predict the asymptotic distortion for relatively large compression rates; however, the one-step RSB ansatz gives a valid prediction of the performance within a larger regime of compression rates.

    关键字:Compressed sensing;Precoding;Correlation;Additives;Glass;Sensors;Lattices

  • Replica symmetry breaking in compressive sensing

    Ali Bereyhi;Ralf Müller;Hermann Schulz-Baldes;

    Information Theory and Applications Workshop

    2017年

  • Sequential differential optimization of incremental redundancy transmission lengths: An example with tail-biting convolutional codes

    作者:Nathan Wong;Kasra Vakilinia; Haobo Wang;Sudarsan V. S. Ranganathan;Richard D. Wesel; 会议名称:Information Theory and Applications Workshop 2017年

    This paper applies the sequential differential optimization (SDO) algorithm to optimize the transmission lengths of incremental redundancy for a 1024-state tail-biting convolutional code. The tail-biting reliability-output Viterbi algorithm is used to determine whether to inform the transmitter that a message has been successfully received or to request that the transmitter provide additional convolutional code bits. In order to maximize the average throughput, SDO is used to determine the rate of the initial codeword and the number of bits of incremental redundancy to be sent in each increment. With the help of SDO, this paper demonstrates a system that achieves 86.3 percent of the binary-input AWGN capacity (for SNR 2 dB) with an average blocklength of 115.5 symbols.

    关键字:Decoding;Redundancy;Nickel;Convolutional codes;Optimization;Throughput

  • Sequential differential optimization of incremental redundancy transmission lengths: An example with tail-biting convolutional codes

    Nathan Wong;Kasra Vakilinia; Haobo Wang;Sudarsan V. S. Ranganathan;Richard D. Wesel;

    Information Theory and Applications Workshop

    2017年

服务协议

服务协议


掌桥科研助手微信平台(简称“本平台”)外文文献服务的所有权和运营权归属六维联合信息科技(北京)有限公司(简称“六维联合”)。在购买本平台外文文献服务前,请您仔细阅读本服务协议的如下全部内容,以便您决定是否继续购买本平台的服务,您的继续购买行为即表示您已经完全理解并接受本服务协议,并同意受其约束。若您不同意本服务协议,请勿购买本平台的服务。

1.服务说明

(1)要成为系统服务用户必须自行配备上网的所需设备,包括个人微信使用终端、调制解调器或其他必备上网装置,并自行负担个人上网所支付的与此服务有关的网络费用;

(2)用户应向本平台上提供单位名称、姓名、电子邮箱、手机号码,通过手机验证后才能收到外文文献电子邮件;

(3)除按照国家法律法规、第三方(本服务中指国家工程技术图书馆)和本服务要求提供用户的个人资料外,本平台不额外要求用户提供个人隐私信息;

(4)外文文献一经购买,无论用户是否实际使用,不得退款;

(5)外文文献原文是由国家工程技术图书馆负责提供。

2.合理使用

根据相关法律规定,本平台及其所提供的外文期刊、外文会议、外文学位论文和外文科技报告文献仅供购买服务的用户(即授权用户)为个人目的或课堂教学目的使用,授权用户可以对本平台的文献进行以下合理使用:

(1)通过安全网络访问服务器对网络数据库进行检索;

(2)以个人研究和学习为目的,在线阅读检索结果;

(3)通过文献传递获取电子文献供授权用户个人研究和学习使用;

(4)非以商业营利为目的承担正常教学任务的授权用户,为教学需要,可少量复制文献供教学人员使用,同时应指明作者姓名和文献名称。例如授权用户可少量复制作为教学参考资料的文献供从事课堂教授的教师使用,可少量文献复制到供本单位教学使用的内部网络中的安全计算机上,供选修特定课程的学生在该课程课堂教学期间和地点通过内部网络进行阅读。

3.侵权行为

除上述合理使用方式外,不得以任何方式对本平台全部或者部分文献进行复制、出版、发行、传播、转让、商业或其他开发,授权用户以下(但不仅限于以下)超出合理使用范围的行为,属侵犯知识产权行为,须严格禁止:

(1)把外文文献以公共方式提供给非授权用户使用;

(2)利用外文文献对非授权用户提供文献服务;

(3)利用外文文献进行商业服务或支持商业服务;

(4)利用外文文献内容汇编生成二次产品,提供公共或商业服务;

(5)将外文文献使用在任何其他网站或计算机联网环境中,包括但不仅限于在国际互联网和万维网站上。

4.侵权责任

授权用户应在法律规定的其超出合理使用范围内使用本平台提供的文献,若因授权用户的侵权使用行为被相关权利人主张权利而产生任何纠纷、仲裁、诉讼,或遭到国家相关部门处理,由授权用户承担全部法律责任并使本平台方免责,授权用户还应赔偿因上述原因给本平台方造成的全部直接和间接损失,包括但不限于律师费用、诉讼及仲裁费用、财务费用及差旅费等。一经发现用户的使用情况超出著作权法规定的合理使用范围,本平台有权立即封禁该用户的服务账户,并有权终止向用户提供本协议约定的服务而无须承担违约责任。

5.免责声明

(1)本平台仅为根据您的搜索指令提供搜索服务、数据链接服务和电子邮件原文传递服务,搜索结果和原文数据均来自第三方网站,六维联合不会对第三方网站内容作任何实质性的编辑、整理、修改;

(2)本平台对服务及服务所涉文献信息不作任何明示或暗示的保证,包括但不限于服务一定会满足用户的使用要求、服务的及时性、持续性、安全性、准确性以及服务所涉及文献的准确性、完整行、可靠性;

(3)本平台不保证所提供的服务和服务所涉文献信息来源客观准确,对于任何因信赖或使用获取的文献信息,而给用户造成任何直接或间接损失,本平台均不承担责任;本平台不因用户与任何第三方产生的争议或诉讼承担任何责任。

(4)用户签署本协议即意味着理解且不要求六维联合在发生不可抗力情况下承担责任。不可抗力是指不能合理控制、不可预见或即使预见亦无法避免的事件,包括但不限于政府行为、地震、台风、洪水、火灾或其它天灾、战争或任何其它类似事件。鉴于互联网之特殊性质,不可抗力还包含非因本平台原因导致本服务无法正常运行、服务中断或延迟的情形,包括黑客攻击,电信部门技术调整导致之重大影响,因政府管制而造成之暂时关闭,病毒侵袭,网站升级、系统停机维护或通讯终端、电信设备出现故障导致无法进行数据传输等。

6.其他规定

(1)本协议内容受中华人民共和国法律的约束。如果本协议中任何规定被裁定为无效或不可强制执行,该项规定应被撤销,而其余规定继续有效。

(2)本协议的最终解释权归六维联合。

(3)本协议条款可由六维联合随时全部或部分转让。未经六维联合事先明确书面同意,用户不得以任何方式转让本协议条款。

注意:六维联合未就您或其他人士的某项违约行为采取行动,并不表明六维联合就任何继后或类似的违约事件放弃采取行动的权利。


我已阅读并同意《服务协议》