Jeng-Shyang Pan

Bio: Jeng-Shyang Pan is an academic researcher from Shandong University of Science and Technology. The author has contributed to research in topics: Digital watermarking & Watermark. The author has an hindex of 50, co-authored 789 publications receiving 11645 citations. Previous affiliations of Jeng-Shyang Pan include National Kaohsiung Normal University & Technical University of Ostrava.

A Matrix-Based Implementation of DE Algorithm: The Compensation and Deficiency

Abstract: Differential Evolution has become a very popular continuous optimization algorithm since its inception as its simplicity, easy coding and good performance over kinds of optimization problems Difference operator in donor vector calculation is the key feature of DE algorithm Usually, base vector and difference vectors selection in calculating a donor usually cost extra lines of condition judgement Moreover, these vectors are not equally selected from the individual population These lead to more perturbation in optimization performance To tackling this disadvantage of DE implementation, a matrix-based implementation of DE algorithm is advanced herein this paper Three commonly used DE implementation approaches in literature are also presented and contrasted CEC2013 test suites for real-parameter optimization are used as the test-beds for these comparison Experiment results show that the proposed matrix-based implementation of DE algorithm performs better on optimization performance than the common implementation schemes of DE algorithm with similar time complexity

Reversible Data Hiding Base on Histogram Shift for 3D Vertex

Abstract: Watermarking is a very active research field and its application to 2D still images and audio signals have been widely used also, but watermarking of 3D mesh object has not been heavily researched, reversible 3D watermarking especially. This paper proposes a reversible data hiding scheme for 3D vertex. We first select last few digits of vertices coordinate value which should be perceptually invisible and classify them base on some previous conditions. Then we find the proper coordinate to embed data. The original model can be perfectly recovered if it is intact. Our scheme is suitable for some specific applications where high accuracy of the original model must be guaranteed.

Incrementally Updating High-Utility Itemsets with Transaction Insertion

Abstract: High-utility itemsets mining (HUIM) is designed to solve the limitations of association-rule mining by considering both the quantity and profit measures. Most algorithms of HUIM are designed to handle the static database. Fewer research handles the dynamic HUIM with transaction insertion, thus requiring the computations of database rescan and combination explosion of pattern-growth mechanism. In this paper, an efficient incremental algorithm with transaction insertion is designed to reduce computations without candidate generation based on the utility-list structures. The enumeration tree and the relationships between 2-itemsets are also adopted in the proposed algorithm to speed up computations. Several experiments are conducted to show the performance of the proposed algorithm in terms of runtime, and memory consumption.

Grade Diffusion Algorithm

Abstract: In this paper, a grade diffusion algorithm is proposed to solve the sensor node’s transmission problem and the sensor node’s loading problem in wireless sensor networks by to arrange the sensor node’s routing. In addition to them, the sensor node also can save some backup nodes to reduce the energy consumption for the re-looking routing by our proposed algorithm in case the sensor node’s routing is broken. In the simulation, the grade diffusion algorithm can save 28.66% energy and increase 76.39% lift time than the tradition algorithms for sensor node. Moreover, our proposed algorithm has the less data package transmission loss and the hop count than the tradition algorithms in our simulate setting. Hence, in addition to balance the sensor node’s loading and reduce the energy consumption, our algorithm can send the data package to destination node quickly and correctly.

A Load Economic Dispatch Based on Ion Motion Optimization Algorithm

Abstract: This paper presents a new approach for dispatch generating powers of thermal plants based on ion motion optimization algorithm (IMA) Electrical power systems are determined by optimization in power balancing, transporting loss, and generating capacity The scheduling power generating units for stabilizing different dynamic responses of the control power system are mathematically modeled for the objective function Economic load dispatch (ELD) gains as the objective function is optimized by applying IMA In the experimental section, several cases of different units of thermal plants are used to test the performance of the proposed approach The preliminary results are compared with the other methods in the literature shows that the proposed plan offers higher effect performance

Mean shift: a robust approach toward feature space analysis

Abstract: A general non-parametric technique is proposed for the analysis of a complex multimodal feature space and to delineate arbitrarily shaped clusters in it. The basic computational module of the technique is an old pattern recognition procedure: the mean shift. For discrete data, we prove the convergence of a recursive mean shift procedure to the nearest stationary point of the underlying density function and, thus, its utility in detecting the modes of the density. The relation of the mean shift procedure to the Nadaraya-Watson estimator from kernel regression and the robust M-estimators; of location is also established. Algorithms for two low-level vision tasks discontinuity-preserving smoothing and image segmentation - are described as applications. In these algorithms, the only user-set parameter is the resolution of the analysis, and either gray-level or color images are accepted as input. Extensive experimental results illustrate their excellent performance.

Digital Watermarking

Abstract: Digital watermarking is a key ingredient to copyright protection. It provides a solution to illegal copying of digital material and has many other useful applications such as broadcast monitoring and the recording of electronic transactions. Now, for the first time, there is a book that focuses exclusively on this exciting technology. Digital Watermarking covers the crucial research findings in the field: it explains the principles underlying digital watermarking technologies, describes the requirements that have given rise to them, and discusses the diverse ends to which these technologies are being applied. As a result, additional groundwork is laid for future developments in this field, helping the reader understand and anticipate new approaches and applications.

PORs: Proofs of Retrievability for Large Files

Abstract: In this paper, we define and explore proofs of retrievability (PORs). A POR scheme enables an archive or back-up service (prover) to produce a concise proof that a user (verifier) can retrieve a target file F, that is, that the archive retains and reliably transmits file data sufficient for the user to recover F in its entirety.A POR may be viewed as a kind of cryptographic proof of knowledge (POK), but one specially designed to handle a large file (or bitstring) F. We explore POR protocols here in which the communication costs, number of memory accesses for the prover, and storage requirements of the user (verifier) are small parameters essentially independent of the length of F. In addition to proposing new, practical POR constructions, we explore implementation considerations and optimizations that bear on previously explored, related schemes.In a POR, unlike a POK, neither the prover nor the verifier need actually have knowledge of F. PORs give rise to a new and unusual security definition whose formulation is another contribution of our work.We view PORs as an important tool for semi-trusted online archives. Existing cryptographic techniques help users ensure the privacy and integrity of files they retrieve. It is also natural, however, for users to want to verify that archives do not delete or modify files prior to retrieval. The goal of a POR is to accomplish these checks without users having to download the files themselves. A POR can also provide quality-of-service guarantees, i.e., show that a file is retrievable within a certain time bound.