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

Ruan Jian Xue Bao/Journal of Software 2005年第10期16卷 1805-1810页

作者： Li, Yan-Jiang Ma, Chuan-Gui Huang, Liu-Sheng Department of Computer Science and Technology University of Science and Technology of China Hefei 230027 China Department of Applied Mathematics PLA Information Engineering University Zhengzhou 450002 China Anhui Province-MOST Co-Key Laboratory of High Performance Computing and Application Hefei 230027 China

A dynamic multi-secrets sharing threshold scheme is presented to apply to a large scale electronic voting system with many talliers (tallying authorities). Even if there exists adaptive adversaries, this scheme can guard the ballot's producing, encrypting, transmitting, decrypting and final tallying in spite of the adversaries's attack, so the scheme guarantees robustness. In this paper, the verifiability of the voters' qualification and talliers' identification will be solved by a dynamic multi-secret sharing scheme without invoking more zero knowledge proof to maintain privacy, universal verifiability, and anonymity of ballots. It holds more communication efficiency and more security than the proposed schemes in early time.

关键词： Electronic communities

来源：评论

学校读者我要写书评

暂无评论

Handling missing values via decomposition of the conditioned set

Handling missing values via decomposition of the conditioned...

引用

IEEE International Conference on information Reuse and Integration (IRI)

作者： M.-L. Shyu I.P. Kuruppu-Appuhamilage S.-C. Chen L. Chang Department of Electrical and Computer Engineering University of Miami Coral Gables FL USA Distributed Multimedia Information System Laboratory School of Computer Science Florida International University Miami FL USA Naval Research Laboratory Center for High Assurance Computer Systems Washington D.C. DC USA

In this paper, a framework for replacing missing values in a database is proposed since a real-world database is seldom complete. Good data quality in a database can directly improve the performance of any data mining algorithm in various applications. Our proposed framework adopts the basic concepts from conditional probability theories and further develops an algorithm to facilitate the capability of handling both nominal and numerical values, which addresses the problem of the inability of handling both nominal and numerical values with a high degree of accuracy in the existing algorithms. Several experiments are conducted and the experimental results demonstrate that our framework provides a high accuracy when compared with most of the commonly used algorithms such as using the average value, using the maximum value, and using the minimum value to replace missing values.

关键词： Cleaning Data mining Multimedia databases Laboratories Distributed databases Data preprocessing Multimedia systems information systems computer science Distributed computing

来源：评论

学校读者我要写书评

暂无评论

Discriminant analysis with tensor representation

Discriminant analysis with tensor representation

引用

Conference on computer Vision and Pattern Recognition (CVPR)

作者： Shuicheng Yan Dong Xu Qiang Yang Lei Zhang Xiaoou Tang Hong-Jiang Zhang Department of Information Engineering Chinese University of Hong Kong Sha Tin Hong Kong China MOE-Microsoft Key Laboratory of Multimedia Computing and Communication & Department of EEIS University of Science and Technology Hefei Anhui China Department of Computer Science Hong Kong University of Science and Technology Hong Kong China Microsoft Research Asia Beijing China

ISBN: (纸本)0769523722

In this paper, we present a novel approach to solving the supervised dimensionality reduction problem by encoding an image object as a general tensor of 2nd or higher order. First, we propose a discriminant tensor criterion (DTC), whereby multiple interrelated lower-dimensional discriminative subspaces are derived for feature selection. Then, a novel approach called k-mode cluster-based discriminant analysis is presented to iteratively learn these subspaces by unfolding the tensor along different tensor dimensions. We call this algorithm discriminant analysis with tensor representation (DATER), which has the following characteristics: 1) multiple interrelated subspaces can collaborate to discriminate different classes; 2) for classification problems involving higher-order tensors, the DATER algorithm can avoid the curse of dimensionality dilemma and overcome the small sample size problem; and 3) the computational cost in the learning stage is reduced to a large extent owing to the reduced data dimensions in generalized eigenvalue decomposition. We provide extensive experiments by encoding face images as 2nd or 3rd order tensors to demonstrate that the proposed DATER algorithm based on higher order tensors has the potential to outperform the traditional subspace learning algorithms, especially in the small sample size cases.

关键词： Tensile stress Iterative algorithms Linear discriminant analysis Scattering Asia Image coding Clustering algorithms Algorithm design and analysis Principal component analysis Unsupervised learning

来源：评论

学校读者我要写书评

暂无评论

Journal of information science and engineering: Editorial notice

引用

Journal of information science and engineering 2005年第5期21卷 i-ii页

作者： Lee, Der-Tsai Amato, Nancy M. Chang, Shih-Fu Chen, Homer H. Chen, Tsuhan Hsu, Tsan-Sheng Hwang, Jenq-Neng Kuo, Sy-Yen Kuo, Tei-Wei Li, Chung-Sheng Tokuyama, Takeshi Wing, Jeannette Wu, Tzong-Chen Yen, John Computer Science at Texas A and M University United States Parasol Laboratory United States IEEE Transactions on Parallel and Distributed Systems Computing Research Association's Committee on the Status of Women in Computing Research CRA-W's Distributed Mentor Program United States Department of Electrical Engineering Columbia University United States Lab. United States College of Electrical Engineering and Computer Science National Taiwan University Taiwan IEEE Transactions on Circuits and Systems for Video Technology IEEE Department of Electrical and Computer Engineering Carnegie Mellon University Pittsburgh PA United States ACM ACM SIGACT IEEE Computer Society IICM Austria Research and Development of the Department Multimedia Signal Processing Technical Committee IEEE Signal Processing Society United States IEEE Transactions on Circuits and systems for Video Technology College of Electrical Engineering and Computer Science National Taiwan Ocean University Keelung Taiwan Department of Electrical Engineering National Taiwan University Taiwan Department of Computer Science and Information Engineering National Taiwan University Taipei Taiwan IEEE Technical Committee on Real-Time Systems Computer Science Division IBM T.J. Watson Research Center United States IBM Research Division Graduate School of Information Sciences Tohoku University Japan ACM IPSJ Mathematical Society of Japan Japan Department of Computer Science Computer Science Department Carnegie Mellon University United States National Academies of Science's Computer Science and Telecommunications Board United States Microsoft's Trustworthy Academic Advisory Board Intel Research Pittsburgh's Advisory Board United States Dartmouth's Institute for Security Technology Studies Advisory Committee Canada Sloan Research Fellowships Program Committee United States ACM Taiwan China Information Sciences and Technology Pennsylvania State University United States Laboratory for Intelligent Agents Penn State's School of Info

No abstract available

关键词：

来源：评论

学校读者我要写书评

暂无评论

Granular theorem of quotient space in image segmentation

引用

Jisuanji Xuebao/Chinese Journal of computers 2005年第10期28卷 1680-1685页

作者： Liu, Ren-Jin Huang, Xian-Wu Department of Computer Science and Technology West Anhui University Lu'an 237012 China Laboratory of Intelligent Computing and Signal Processing Anhui University Hefei 230039 China School of Electronic and Information Engineering Soochow University Suzhou 215006 China

Based on the quotient space granular theorem, the image segmentation concept is analyzed and the image segmentation methods are studied, and then the quotient space granular theorem of image segmentation is demonstrated. The image segmentation problems are described with triple elements function of the quotient space model (X,f,Γ)⇔([X],[f],[Γ]), according to the quotient space granularity computing, the image segmentation theorem is presented. The methods of images segmentation based on hierarchical and synthesis and combinational technique are exploited and then the segmentation algorithm based granularity synthesis technique is proposed. In this technique, the features of directionality and roughness in texture images data set are firstly extracted respectively to form the different granularities of image, then the different granularity are synthesized according to the theorem of granularity synthesis, finally the texture images is segmented. The experimental results demonstrate that the algorithm is valid for the segmentation of complicated texture images.

关键词： Image segmentation

来源：评论

学校读者我要写书评

暂无评论

A resource broker for computing nodes selection in grid computing environments 3rd

引用

3rd International Conference on Grid and Cooperative computing, GCC2004

作者： Yang, Chao-Tung Lai, Chuan-Lin Shih, Po-Chi Li, Kuan-Ching High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung407 Taiwan Parallel and Distributed Processing Center Department of Computer Science and Information Management Providence University Shalu Taichung433 Taiwan

ISBN: (纸本)3540235647

As Grid computing is becoming a reality, there is a need for managing and monitoring the available resources worldwide, as well as the need for conveying these resources to the everyday user. This paper describes a resource broker with its main function as to match the available resources to the user’s needs. The use of the resource broker provides a uniform interface to access any of the available and appropriate resources using user’s credentials. The resource broker runs on top of the Globus Toolkit. Therefore, it provides security and current information about the available resources and serves as a link to the diverse systems available in the Grid. © Springer-Verlag Berlin Heidelberg 2004.

关键词： Grid computing

来源：评论

学校读者我要写书评

暂无评论

Study on optimization of agent initial positions in land combat simulation

引用

自然科学进展(英文版) 2004年第3期14卷 257-261页

作者： WU Chunguo LIANG Yanchun LEE Heow Pueh LU Chun Yang Xiaowei College of Computer Science and Technology Key Laboratory of Symbol Computation and Knowledge Engineering of the Ministry of Education Jilin University Changchun 130012 China Institute of High Performance Computing Singapore 117528 Singapore Institute of High Performance Computing Singapore 117528 Singapore Department of Applied Mathematics South China University of Technology Guangzhou 510640 China Centre for ACES Department of Mechanical Engineering National University of Singapore 119260 Singapore

The use of computational-intelligence-based techniques in the optimization of agent initial positions in land combat simulations is studied. A novel method for the reduction of support vectors in the support vector machine (SVM) is presented. The optimization on the width of the Gaussian kernel function and the combination of the SVM with the radial basis function neural network are performed in the proposed method. Simulation results show that the proposed method can improve the running efficiency drastically compared with that using the traditional SVM with the same precision. We also summarize and present some experiences and trends in the study on the optimization problem in land combat simulation.

关键词： multi-agent support vector machine radial basis function genetic algorithm regression

来源：评论

学校读者我要写书评

暂无评论

A parallel loop self-scheduling on grid computing environments

A parallel loop self-scheduling on grid computing environmen...

引用

International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

作者： Kuan-Wei Cheng Chao-Tung Yang Chuan-Lin Lai Shun-Chyi Chang High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0769521355

Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively will transform scientific disciplines ranging from high-energy physics to the life sciences. In this paper, a grid computing environment is proposed and constructed on multiple PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). The experimental results are also conducted by using the matrix multiplication to demonstrate the performance. On the other hand, the approaches to deal with scheduling and load balancing on multiple heterogeneous PC clusters computer system are not mature. Self-scheduling schemes which are suitable for parallel loops with independent iterations on heterogeneous cluster computer system have been designed in the past. However, these schemes, such as FSS, GSS and TSS, can not achieve load balancing in extremely heterogeneous environment. We propose a heuristic approach based upon a two-phase scheme to solve parallel regular loop scheduling problem on an extremely heterogeneous grid computing environment.

关键词： Grid computing Processor scheduling Load management Internet Large-scale systems Physics Sun Search engines Concurrent computing Frequency selective surfaces

来源：评论

学校读者我要写书评

暂无评论

Construct a grid computing environment for bioinformatics

Construct a grid computing environment for bioinformatics

引用

International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN)

作者： Yu-Lun Kuo Chao-Tung Yang Chuan-Lin Lai Tsai-Ming Tseng High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0769521355

Internet computing and grid technologies promise to change the way we tackle complex problems. They will enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively will transform scientific disciplines ranging from high-energy physics to the life sciences. The computational analysis of biological sequences is a kind of computation driven science. Cause the biology data growing quickly and these databases are heterogeneous. We can use the grid system sharing and integrating the heterogeneous biology database. As we know, bioinformatics tools can speed up analysis the large-scale sequence data, especially about sequence alignment. The FASTA is a tool for aligning multiple protein or nucleotide sequences. FASTA which we used is a distributed and parallel version. The software uses a message-passing library called MPl (Message Passing Interface) and runs on distributed workstation clusters as well as on traditional parallel computers. A grid computing environment is proposed and constructed on multiple Linux PC clusters by using Globus Toolkit (GT) and SUN Grid Engine (SGE). The experimental results and performances of the bioinformatics tool using on grid system are also presented in this paper.

关键词： Grid computing Bioinformatics Sequences Biology computing Large-scale systems Databases Internet Physics Proteins Software libraries

来源：评论

学校读者我要写书评

暂无评论

Design and implementation of a computational grid for bioinformatics

Design and implementation of a computational grid for bioinf...

引用

IEEE International Conference on e-Technology, e-Commerce and e-Service

作者： Chao-Tung Yang Yu-Lun Kuo Chuan-Lin Lai High-Performance Computing Laboratory Department of Computer Science and Information Engineering Tunghai University Taichung Taiwan

ISBN: (纸本)0769520731

The popular technologies, Internet computing and grid technologies promise to change the way we tackle complex problems. They enable large-scale aggregation and sharing of computational, data and other resources across institutional boundaries. And harnessing these new technologies effectively transforms scientific disciplines ranging from high-energy physics to the life sciences. The computational analysis of biological sequences is a kind of computation driven science. Cause the biology data growing quickly and these databases are heterogeneous. We can use the grid system sharing and integrating the heterogeneous biology database. As we know, bioinformatics tools can speed up analysis the large-scale sequence data, especially about sequence alignment and analysis. The FASTA is a tool for aligning multiple protein or nucleotide sequences. These two bioinformatics software, which we used is a distributed and parallel version. The software uses a message-passing library called MPI (message passing interface) and runs on distributed workstation clusters as well as on traditional parallel computers. A grid computing environment is proposed and constructed on multiple Linux PC clusters by using globus toolkit (GT) and SUN grid engine (SGE). The experimental results and performances of the bioinformatics tool using on grid system are also presented.

关键词： Grid computing Bioinformatics Biology computing Sequences Large-scale systems Databases Internet Physics Proteins Software libraries

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：