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

Medical Imaging 2002 Conference

作者： Cao, XH Wong, STC Hoo, KS Ching, W Hawkins, R Dillon, W Univ Calif San Francisco San Francisco CA 94143 USA

ISBN: (纸本)0819444308

Medical information systems based in different hospital departments face tremendous difficulty in information exchange and dissemination due to the multitudes of hardware and software platforms running these systems. In this paper, we describe a distributed information system for integrating various hospital systems in supporting clinical neuroimaging research and epilepsy surgical planning. Our distributed information system uses a three-tiered architecture consists of a user-interface tier, application logic tier and data store tier. Two system implementations based on this software architecture but using different integration technologies were developed and are discussed in this paper: the XML (extensible Mark Up Language)-based implementation and the CORBA (Common Object Request Broker Architecture)-based implementation. In the XML-based implementation, application logic tier communicates with user-interface tier and data store tier using HTTP and XML for data exchange. For the data exchange in CORBA-based implementation, the middleware uses HOP (Internet inter-ORB protocol) to call CORBA objects in the data store tier then to return the results to the user-interface tier. For the user-interface tier of either implementation, the Web browsers are served as clients to invoke application components or agents in the middleware. The application of the proposed distributed system allows clinical users to access, search and retrieve the multimedia information in any underlying computer systems with commonly used Web browsers. Preliminary results show that the system is effective for information integration and data sharing among the different departmental systems in the hospital for neuroimaging applications.

关键词： distributed computation middleware system integration technology XML CORBA IIOP Web

来源：评论

学校读者我要写书评

暂无评论

Recurring job optimization in scope 12

Recurring job optimization in scope

引用

2012 ACM SIGMOD International Conference on Management of Data, SIGMOD '12

作者： Bruno, Nicolas Agarwal, Sameer Kandula, Srikanth Shi, Bing Wu, Ming-Chuan Zhou, Jingren Microsoft Corp. Redmond WA United States

No abstract available.

ISBN: (纸本)9781450312479

No abstract available.

关键词： statistics scope query optimization distributed computation recurring jobs

来源：评论

学校读者我要写书评

暂无评论

Toward A Practical Data Privacy Scheme for A distributed Implementation of the Smith-Waterman Genome Sequence Comparison Algorithm 13

Toward A Practical Data Privacy Scheme for A Distributed Imp...

引用

13th Symposium on Network and distributed System Security, NDSS 2006

作者： Szajda, Doug Pohl, Michael Owen, Jason Lawson, Barry University of Richmond RichmondVA United States

ISBN: (纸本)1891562223

Volunteer distributed computations utilize spare processor cycles of personal computers that are connected to the Internet. The resulting platforms provide computational power previously available only through the use of expensive clusters or supercomputers. However, distributed computations running in untrustworthy environments raise a number of security concerns, including computation integrity and data privacy. This paper introduces a strategy for enhancing data privacy in some distributed volunteer computations, providing an important first step toward a general data privacy solution for these computations. The strategy is used to provide enhanced data privacy for the Smith-Waterman local nucleotide sequence comparison algorithm. Our modified Smith-Waterman algorithm provides reasonable performance, identifying most, and in many cases all, sequence pairs that exhibit statistically significant similarity according to the unmodified algorithm, with reasonable levels of false positives. Moreover the modified algorithm achieves a net decrease in execution time, with no increase in memory requirements. Most importantly, our scheme represents an important first step toward providing data privacy for a practical and important real-world algorithm. © 2006 Proceedings of the Symposium on Network and distributed System Security, NDSS 2006. All Rights Reserved.

关键词： data privacy distributed computation Smith-Waterman algorithm

来源：评论

学校读者我要写书评

暂无评论

Brief announcement: distributed algorithmic mechanism design for scheduling 05

Brief announcement: Distributed algorithmic mechanism design...

引用

24th Annual ACM Symposium on Principles of distributed Computing, PODC 2005

作者： Carroll, Thomas E. Grosu, Daniel Department of Computer Science Wayne State University Detroit MI 48202 United States

No abstract available

ISBN: (纸本)9781581139945

No abstract available

关键词： truthful mechanism task scheduling mechanism design distributed computation

来源：评论

学校读者我要写书评

暂无评论

Xerox :: Alto :: Ethernet :: Notesonthewormprogramssep80

引用

2016年

Xerox :: Alto :: Ethernet :: Notesonthewormprogramssep80 by published by

关键词： computation distributed distributed computation early experience ethernet host host number machines memory diagnostic network boot notesonthewormprogramssep80 program programs segment segments traffic matrix worm worm control worm program worm programs worm segment xerox

来源：评论

学校读者我要写书评

暂无评论

Rational and Resilient Protocols 14

Rational and Resilient Protocols

引用

ACM Symposium on Principles of distributed Computing (PODC)

作者： Micali, Silvio MIT Cambridge MA 02139 USA

ISBN: (纸本)9781450329446

Cryptography and distributed computation have been very successful in advancing the study of interaction of distinct computing agents. Moreover, both fields have been very successful in conversing with each other, sharing models and techniques. Notably, they both model agents as being either 'good' (i.e., following their prescribed programs) or 'bad' (i.e., deviating from their prescribed program, by stopping, by acting maliciously, or even by coordinating their malicious strategies). I believe however, that we have been neglecting a fundamental ingredient, UTILITY, which has long been recognized and studied by another scientific field, game theory, and in particular by a beautiful subfield of it, mechanism design. Mechanism design aims at obtaining a desired outcome by engineering a game that, rationally played, yields a desired outcome. In such games, multiple players interact very much as in a cryptographic/distributed protocol. But here players are not good or malicious. Rather, every player is RATIONAL, that is, always acts so as to maximize HIS OWN utility.I believe that properly incorporating utility/rationality in our models will dramatically increase our range of action. Viceversa, mechanism design stands to gain a lot by properly incorporating cryptographic/distributed notions and techniques. In particular, rational players may, by colluding (and making side-payments to one another), increase their utilities. And they too value privacy, which may indeed represent their strategic interests in unforeseen and not yet modeled interactions. Thus, privacy and collusion can disrupt the intended course of an engineered game, and ultimately prevent a desired outcome from being achieved. Mechanism design has been only moderately successful in protecting against collusion, has largely ignored privacy, and might gain precious resiliency by taking into consideration our notions and *** sum, there is an opportunity for cryptography, distributed computation, an

关键词： interaction collusion privacy rationality resiliency cryptography distributed computation mechanism design

来源：评论

学校读者我要写书评

暂无评论

Computing with distributed Information

Computing with Distributed Information

引用

作者： Li Yang University of Pennsylvania

学位级别：Ph . D

The age of computing with massive data sets is highlighting new computational challenges. Nowadays, a typical server may not be able to store an entire data set, and thus data is often partitioned and stored on multiple servers in a distributed manner. A natural way of computing with such distributed data is to use distributed algorithms: these are algorithms where the participating parties (i.e., the servers holding portions of the data) collaboratively compute a function over the entire data set by sending (preferably small-size) messages to each other, where the computation performed at each participating party only relies on the data possessed by it and the messages received by it.

关键词： Communication and the arts Applied sciences Convergence Data summarization distributed computation

来源：评论

学校读者我要写书评

暂无评论

A Cluster-Based Partition Method of Remote Sensing Data for Efficient distributed Image Processing

引用

REMOTE SENSING 2022年第19期14卷 4964-4964页

作者： Wang, Lei Yu, Bo Chen, Fang Li, Congrong Li, Bin Wang, Ning Int Res Ctr Big Data Sustainable Dev Goals Beijing 100094 Peoples R China Chinese Acad Sci Aerosp Informat Res Inst Key Lab Digital Earth Sci Beijing 100094 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Chinese Acad Sci Aerosp Informat Res Inst State Key Lab Remote Sensing Sci Beijing 100101 Peoples R China

Data stream partitioning is a fundamental and important mechanism for distributed systems. However, use of an inappropriate partition scheme may generate a data skew problem, which can influence the execution efficiency of many application tasks. Processing of skewed partitions usually takes a longer time, need more computational resources to complete the task and can even become a performance bottleneck. To solve such data skew issues, this paper proposes a novel partition method to divide on demand the image tiles uniformly into partitions. The partitioning problem is then transformed into a uniform and compact clustering problem whereby the image tiles are regarded as image pixels without spectrum and texture information. First, the equal area conversion principle was used to select the seed points of the partitions and then the image tiles were aggregated in an image layout, thus achieving an initial partition scheme. Second, the image tiles of the initial partition were finely adjusted in the vertical and horizontal directions in separate steps to achieve a uniform distribution among the partitions. Two traditional partition methods were adopted to evaluate the efficiency of the proposed method in terms of the image segmentation testing, data shuffle testing, and image clipping testing. The results demonstrated that the proposed partition method solved the data skew problem observed in the hash partition method. In addition, this method is designed specifically for processing of image tiles and makes the related processing operations for large-scale images faster and more efficient.

关键词： partition method image processing distributed computation Apache Spark digital disaster reduction

来源：评论

学校读者我要写书评

暂无评论

A Strategy of Parallel SLIC Superpixels for Handling Large-Scale Images over Apache Spark

引用

REMOTE SENSING 2022年第7期14卷 1568-1568页

作者： Wang, Ning Chen, Fang Yu, Bo Wang, Lei Chinese Acad Sci Aerosp Informat Res Inst Key Lab Digital Earth Sci 9 Dengzhuang South Rd Beijing 100094 Peoples R China Univ Chinese Acad Sci Beijing 100049 Peoples R China Chinese Acad Sci Aerosp Informat Res Inst State Key Lab Remote Sensing Sci Beijing 100101 Peoples R China Chinese Acad Sci Aerosp Informat Res Inst Hainan Key Lab Earth Observat Sanya 572029 Peoples R China

Superpixel segmentation algorithms are widely used in the image processing field. The size of the large-scale images usually exceeds the memory of a single machine given that the size of image data has increased rapidly in recent years. This leads to big challenges for implementing sequential superpixel segmentation methods, although these algorithms have good scalability. Additionally, segmentation of large-scale images over a distributed cluster is a feasible solution. Nevertheless, it is challenging to transplant sequential superpixel algorithms directly to a distributed environment, as usually there are incomplete object problems in the border area of image tiles. To overcome the incomplete object problems, one approach is to build a distributed strategy based on a sequential SLIC superpixel segmentation algorithm over a distributed cluster organized by Apache Spark. In our research, the decomposed image tiles were divided into two categories-even tiles and odd tiles. The even tiles were first segmented by the SLIC algorithm, then the cluster centers and buffer sizes of even tiles were extracted and switched to odd tiles. During the shuffle stage, the odd tiles acquired pixels from adjacent even tiles according to the buffer sizes, and then the buffered odd tiles were segmented by the SLIC algorithm with the help of the shared cluster centers. The superpixels with shared cluster centers were generated in even tiles and remained in order to enlarge the odd tiles rather than redundant computing of specific areas to modify incomplete superpixels well. Specifically, this strategy employs the shared variables to transmit intermediate results and the shuffle operations were carried out among approximately half of the entire image tiles, which reduces the communications further. The distributed strategy was evaluated in terms of the accuracy and execution efficiency, which revealed that the proposed strategy could not only get better F-measure values but is also implem

关键词： superpixel algorithms distributed computation image processing Apache Spark digital disaster reduction

来源：评论

学校读者我要写书评

暂无评论

Strategie distribuovaného lámání hesel

Strategie distribuovaného lámání hesel

引用

作者： Večeřa, Vojtěch Brno University of Technology

Tato práce představuje a kategorizuje nástroje pro obnovu hesel různých formátů. Dále se zabývá obecně používanými technologiemi a typy hardware využitelnými v tomto ... 详细信息

Tato práce představuje a kategorizuje nástroje pro obnovu hesel různých formátů. Dále se zabývá obecně používanými technologiemi a typy hardware využitelnými v tomto odvětví informatiky. Práce pokračuje přehledem nástrojů pro měření výkonu hardware, popisem navrhnutého procesu měření a cílů jednotlivých kroků. Později se přesouvá od samostatných uzlů k distrubovanému systému FITcrack. Práce navhuje rozšíření a úpravy onoho systému, které jsou experimentálně implementovány a nakonec srovnány s původní implementací.

关键词： Hashcat John the Ripper BOINC FITcrack obnova hesel distribuované výpočty Hashcat John the Ripper BOINC FITcrack password recovery distributed computation Text

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：