基于Java与XML的测井矢量图形处理技术

介绍测井图的构成特点及存储、处理的要求，提出测井矢量图的概念，提出Java与XML结合处理测井矢量图的方法，同时给出该方法的处理流程；讨论XML文件存储测井矢量图的可行性，给出存储测井矢量图的XML文件的组织结构和创建过程以及从XML文件生成测井矢量图的步骤；在实例中创建XML存储文件，通过XML文件生成测井矢量图。     

具备网络共享功能——BUFFALO（巴比禄） HD-CELU2

HD—CELU2是一款结合USB外置硬盘和NAS网络附加存储功能的存储解决方案,既可以通过USB接口连接到个人电脑中使用,也可以通过以太网接口连接到网络中的多台电脑共享使用,并且整合了众多功能,如自动安装、TurboUSB支持、Memeo自动备份和Secure Lock Ware加密支持等。     

固定名称访问Linux存储设备

近日笔者在调试一台IP存储和两台Linux服务器的时候,遇到了一些问题。在存储中给两台Linux服务器分配LUN（逻辑单元）以后,经过配置,Linux主机给新磁盘分配了设备文件。但是每次重启服务器后,新磁盘的设备文件就发生了改变,比如原来给第一块新盘分配的设备文件是／dev／sda,等重启后设备文件就变成了／dev／sdb或者／dev／sdf等等。     

100G空间100个账号

联想企业网盘是一款服务于企业大数据存储、分发和汇总的云产品。可以全面替代企业文件服务器和FTP服务器,降低IT管理成本。高效管理分支机构,提高与客户的数据交换效率。 （1）新增企业网盘功能 大文件秒传：通过传输协议优化、后台使用分片存储、分片传输的机制,实现大文件秒传。     

问诊台

我们单位是通过SER—U来架设的FTP服务器,用来满足办公人员存储数据、文档、文件等需求。但是最近有几台办公人员的电脑在访问该服务器时却出现了奇怪的问题。这几台电脑通过账号登录以后,拷贝有内容的文档文件（DOC、TXT等）至FTP服务器时,拷贝进去的文档大小为OK,在服务器上虽然可以看到这个文档,但是下载到本地,打开文档却是空的 .     

清华大学计算机中心存储备份系统

清华大学计算机中心系统平台以SUNSolaris为主,并有多台Windows、Linux服务器。这些服务器按应用类别可以划分为:综合教务系统和网上教学系统主机SUN15000;邮件处理系统主机SUN5500;其他Windows、Linux主机,分别作为网络管理服务器、防火墙以及文件服务器等。另外,计算机中心拟选用一台SUNE250主机作为专用备份服务器,对所有主机上的数据进行集中备份管理。所有服务器通过以太网连接,且多数主机配置有专属的磁盘阵列来存储数据信息。上述综合教务、邮件服务及网上教学等系统均为数据在线服务系统,因此要求备份系统能够支持Oracle数…     

基于工作流的XML表单文件的存储与重建

针对记录和描述XML表单文件的变动,采用工作流处理系统中的工作流处理过程作为活动节点,XML表单文件中的工作单元作为变动区域,通过活动节点对变动区域进行增删改处理,来自动查出文件变动的情况并实时存储,根据企业需求重建XML表单文件的版本.通过实例表明,XML表单文件的存储与重建效率得到明显提高.     

基于Android手机的可靠云存储系统的架构设计

本系统研究一种基于Android手机的可靠云存储服务器架构。文件在内部存储机制上采用分布式存储,文件采用冗余切片,数据加密,数据校验,分布式类文件系统等方法,分散存储到云存储服务器中,保证数据的高可靠性。     

用Windows Storage Server 2008做iSCSI存储服务器：安装Windows Storage Server 2008

Windows Storage Server 2008（以下简称WSS 2008）Windows Server 2008系列中的存储服务器版本，是企业级的文件服务器平台，支持多Administrator文件存储相关的优化特征、副本管理，以及iSCSI功能。     

一种优化的XML文档模型映射方案

在借鉴XRel方法的基础上加入边模型映射思想,提出了一种新的XML文档存储方案.与使用区间编码不同,该方案采用先序编号与路径串结合对文档树中的节点进行编码,然后按照文档中节点类型将XML文档树型结构分解为节点,分别存储到对应的关系中.实验结果表明,该方案在存储、查询性能方面要优于XRel方法,同时有效地支持XML文档更新.     

Group replica caching scheme for optical grid networks

This paper proposes a cache replacement scheme named group replica caching for optical grid networks. In optical grid networks, data files for job execution are replicated at multiple servers in order to distribute loads. Clients download these files via lightpaths and store them as necessary. File downloading is blocked when the corresponding lightpath cannot be established. The blocking probability of file downloading depends on location of files. The case where a file is stored in a client is ideal because blocking of lightpath establishments does not occur. However, the storage size of the client is limited. In order to efficiently use storage resources of clients, our proposed scheme focuses on the fact that clients can download files stored in surrounding servers with low blocking probability. The proposed scheme regards a group of storages of a client and its surrounding servers as one storage. In particular, they preferentially store different files. By doing so, the probability that a file is stored at the client or its surrounding servers increases. Through simulation experiments, we show that the proposed scheme improves the blocking probability of file downloading efficiently.     

视频网格中自适应热度变化的条块化存储

针对在基于内容分发网络(Content Delivery Network,CDN)存储机制的视频网格中,用户申请大量未被存储在边缘服务器上的次热度视频文件所造成的传输延迟问题,提出了自适应热度变化的条块化存储机制。在机制中视频文件根据其热度被分块存储、调度和更新,可增加边缘服务器存储的视频文件数量。仿真模拟的结果表明:机制在保证视频服务质量的同时,可以提高用户在本域边缘服务器获得视频服务的命中率。     

Pushing Dependent Data in Clients–Providers–Servers Systems

In satellite and wireless networks and in advanced traffic information systems in which the up-link bandwidth is very limited, a server broadcasts data files in a round-robin manner. The data files are provided by different providers and are accessed by many clients. The providers are independent and therefore files may share information. The clients who access these files may have different patterns of access. Some clients may wish to access more than one file at a time in any order, some clients may access one file out of of several files, and some clients may wish to access a second file only after accessing another file. The goal of the server is to order the files in a way that minimizes the access time of the clients given some a-priori knowledge of their access patterns. This paper introduces a clients–providers–servers model that better represents certain environments than the traditional clients–servers model. Then, we show that a random order of the data files performs well, independent of the specific access pattern. Our main technical contribution is de-randomizing the procedure that is based on selecting a random order. The resulting algorithm is a polynomial-time deterministic algorithm that finds an order with the same performance bounds as those of the random order.     

保密文件传输方法

描述了一种在企业局域网中通过传送“钥匙”文件的方式共享保密文件的方法,在“钥匙”文件内存储了加密文件的相关信息和被授权的浏览者身分验证信息等,保密文件被加密后存储到服务器端。当用户打开“钥匙”文件则验证访问用户的权限,再从服务器下载加密数据到客户端,通过具有保密存储系统的虚拟磁盘解密打开文件。客户端只能对文件浏览而无法对保密文件进行拷贝和截屏等操作,对保密等级的文件有很好的保护作用。     

Dynamic parallel access to replicated content in the Internet

Popular content is frequently replicated in multiple servers or caches in the Internet to offload origin servers and improve end-user experience. However, choosing the best server is a nontrivial task and a bad choice may provide poor end user experience. In contrast to retrieving a file from a single server, we propose a parallel-access scheme where end users access multiple servers at the same time, fetching different portions of that file from different servers and reassembling them locally. The amount of data retrieved from a particular server depends on the resources available at that server or along the path from the user to the server. Faster servers deliver bigger portions of a file while slower servers deliver smaller portions. If the available resources at a server or along the path change during the download of a file, a dynamic parallel access automatically shifts the load from congested locations to less loaded parts (server and links) of the Internet. The end result is that users experience significant speedups and very consistent response times. Moreover, there is no need for complicated server selection algorithms and load is dynamically shared among all servers. The dynamic parallel-access scheme presented does not require any modifications to servers or content and can be easily included in browsers, peer-to-peer applications or content distribution networks to speed up delivery of popular content.     

基于索引的文件备份方案

针对数据备份服务器上存在大量相同文件冗余的问题,提出了一种新的基于索引的文件备份方案,其核心是用二维链表形式对备份文件建立索引,并对相同的文件只存储一个副本,从而消除重复文件的冗余,达到节省存储空间的目的。该方案包括以下几个部分:相同文件的识别、文件的存储、文件夹的处理、文件备份过程和备份的更新.理论分析和实验表明,该方案较传统方法节省了存储空间,但备份过程中的系统负载和时间消耗有所增加.     

Method of privacy protection based on multiple edge servers in personalized search

In the plaintext environment,users' personalized search results can be obtained through users' interest model and query keywords.However,it may possibly result in the disclosure of sensitive data and privacy,which prevents using sensitive data in cloud search.Therefore,data is generally stored in the form of ciphertext in the cloud server.In the process of cloud search service,users intend to quickly obtain the desired search results from the vast amount of ciphertext.In order to solve the problem,it was proposed that a method of privacy protection based on multiple edge servers in personalized search shall be used.By introducing multiple edge servers and cutting the index as well as the query matrix,the computing relevance scores of partial query and partial file index are achieved on the edge server.The cloud server only needs to get the relevance score on the edge server and make a simple processing that can return to the most relevant Top K files by user query,so as to make it particularly suitable for a large number of users in the massive personalized ciphertext search.Security analysis and experimental results show that this method can effectively protect users’ privacy and data confidentiality.In addition,it can guarantee high efficiency in search to provide better personalized search experience.     

云存储中密文数据的客户端安全去重方案

云存储环境下,客户端数据去重能在本地进行文件重复性检测,有效地节约存储空间和网络带宽.然而,客户端去重仍面临着很多安全挑战.首先,由于将文件哈希值作为重复性检测的证据,攻击者很可能通过一个文件的哈希值获得整个文件;其次,为了保护数据隐私,收敛加密被广泛运用于数据去重方案,但是由于数据本身是可预测的,所以收敛加密仍不可避免地遭受暴力字典攻击.为了解决上述问题,本文首次利用盲签名构造了一个安全的密钥生成协议,通过引入一个密钥服务器,实现了对收敛密钥的二次加密,有效地预防了暴力字典攻击;并进一步提出了一个基于块密钥签名的拥有权证明方法,能够有效预防攻击者通过单一的哈希值来获取文件,并能同时实现对密文文件的文件级和块级去重.同时,安全分析表明本文方案在随机预言模型下是可证明安全的,并能够满足收敛密钥安全、标签一致性和抗暴力字典攻击等更多安全属性.此外,与现有方案相比,实验结果表明本文方案在文件上传和文件去重方面的计算开销相对较小.     

中间件在银行储蓄系统中的应用

文章介绍了使用Tuxedo中间件的银行系统构架及Tuxedo中间件在客户机和服务器之间的作用；并通过动态查询的实例说明利用Tuxedo中间件实现客户端和服务器端数据传送的方法。     

网页防篡改中分布式文件同步复制系统

为了解决Web服务器核心内嵌防篡改系统中,文件的分布式发布以及文件篡改后的即时恢复的问题。文中基于J2EE技术架构以及MVC（模型一视图一控制）的软件开发模式,设计了一种分布式文件同步复制系统。该系统能将文件分布式的发送到多个Web服务器上;当检测到某个Web服务器上的文件被篡改了,系统能迅速从原始库同步复制到相应的Web服务器上,以达到网页防篡改的目的。系统通过对文件进行比对,只传输差异部分,提高了系统资源利用率。