Data Mining - Concepts and Techniques.

The objective of this paper is to give a comprehensive introduction to applied cryptography with an engineer or computer scientist in mind. The emphasis is on the knowledge needed to create practical systems which supports integrity, confidentiality, or authenticity. Topics covered includes an introduction to the concepts in cryptography, attacks against cryptographic systems, key use and handling, random bit generation, encryption modes, and message authentication codes. Recommendations on algorithms and further reading is given in the end of the paper. This paper should make the reader able to build, understand and evaluate system descriptions and designs based on the cryptographic components described in the paper.

[서평]「Applied Cryptography」

Matrix Factorization Techniques for Recommender Systems

Self-Directed Learning, A Guide for Learners and Teachers

In this paper, the analysis of recent advances in genetic algorithms is discussed. The genetic algorithms of great interest in research community are selected for analysis. This review will help the new and demanding researchers to provide the wider vision of genetic algorithms. The well-known algorithms and their implementation are presented with their pros and cons. The genetic operators and their usages are discussed with the aim of facilitating new researchers. The different research domains involved in genetic algorithms are covered. The future research directions in the area of genetic operators, fitness function and hybrid algorithms are discussed. This structured review will be helpful for research and graduate teaching.

/pdf/a-review-on-genetic-algorithm-past-present-and-future-2o5y8ru178.pdf

A review on genetic algorithm: past, present, and future

A new efficient decentralized commit protocol is proposed for distributed database systems. This protocol can be applied to systems of all sizes and is [log2 N] — 2 resilient to site failures, where N is the number of sites in the system. In addition, the number of messages sent among the N sites is O(N log22 N) which is only a factor of log2 N over the message complexity lower bound O(N ln N) of decentralized commit protocols.

An efficient fault-tolerant decentralized commit protocol

https://ir.nctu.edu.tw/bitstream/11536/2532/1/A1994NH75400003.pdf

Message complexity of hierarchical quorum consensus algorithm

To improve data transmission efficiency, image compression is a commonly used method with the disadvantage of accompanying image distortion. There are many image restoration (IR) algorithms, and one of the most advanced algorithms is the generative adversarial network (GAN)-based method with a high correlation to the human visual system (HVS). To evaluate the performance of GAN-based IR algorithms, we proposed an ensemble image quality assessment (IQA) called ATDIQA (Auxiliary Transformer with DISTS IQA) to give weights on multiscale features global self-attention transformers and local features of convolutional neural network (CNN) IQA of DISTS. The result not only performed better on the perceptual image processing algorithms (PIPAL) dataset with images by GAN IR algorithms but also has good model generalization over LIVE and TID2013 as traditional distorted image datasets. The ATDIQA ensemble successfully demonstrates its performance with a high correlation with the human judgment score of distorted images. 

/pdf/full-reference-image-quality-assessment-with-transformer-and-q81nf3lk.pdf

Full-Reference Image Quality Assessment with Transformer and DISTS

Since the term "Web 2.0" appears, a new generation of Web is coming. There are many articles referring to how to design a Web 2.0 website. However, the traditional Web 1.0 websites are still multitudinous currently. The developers of the traditional Web 1.0 website may not have adequate techniques to reconstruct the websites into Web 2.0 timely. Rebuilding a website often takes tremendous efforts. A simple and effective strategy to upgrade the websites is essential. The paper attempts to provide a flexible framework, by introducing the Web 2.0 Proxy, to upgrade websites from Web 1.0 to Web 2.0. The Web 2.0 Proxy combines the original Web 1.0 web page with the additional Web 2.0 information together on the fly. Therefore, the developers need not to rewrite their websites, and the users are able to experience the additional Web 2.0 functions. In the paper, we have implemented the tag and comment functionalities of Web 2.0.

http://www.wseas.us/e-library/conferences/2008/istanbul/tele-info/tele-info_16.pdf

Web 2.0 Proxy: a new framework for web 2.0 website development

In this paper, we present a novel in-domain neighborhood approach to clarify the dynamic load balancing problem on a heterogeneous network and to solve many practical problems. The distributed system consists of a network of workstations with different domains, speeds and capacities. Since the number of workstations and the diameter of the network affect the convergences rate, our approach introduces the in-domain relation that classifies the entire network into sub-networks called domains. The algorithm runs in each workstation in order to reach the fairness state in-domain and in entire network rapidly. In this paper, our approach is applied to a cafeteria system as a case study, each workstation is viewed as a cafeteria where the maximum number of orders that can be submitted to one cafeteria corresponds to the capacity of that cafeteria workstation, the communication channels are modeled between the in-domain cafeterias, and the workload is represented as orders. An algorithm is presented to simulate the migration of the orders between in-domain cafeterias and to distribute a proportion of the excessive workload of heavily loaded node to lightly loaded node by considering the capacity of each node such that when the algorithm terminates, the effective-load in all cafeterias is the same. Therefore, each workstation receives an amount of workload proportional to its total capacity. This framework is analyzed mathematically, and it is proved that the proposed algorithm converges and achieves the fairness state.

Shyan-Ming Yuan

Papers

An efficient fault-tolerant decentralized commit protocol

Message complexity of hierarchical quorum consensus algorithm

Full-Reference Image Quality Assessment with Transformer and DISTS

Web 2.0 Proxy: a new framework for web 2.0 website development

In-Domain Neighborhood Approach to Heterogeneous Dynamic Load Balancing in Real World Network