Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2020 ( 6 )

2019 ( 32 )

2018 ( 160 )

2017 ( 135 )

Custom range...

Search Results: 1 - 10 of 10561 matches for " Baocang Ding "
All listed articles are free for downloading (OA Articles)
Page 1 /10561
Display every page Item
Model Predictive Control
Baocang Ding,Marcin T. Cychowski,Yugeng Xi,Wenjian Cai
Journal of Control Science and Engineering , 2012, DOI: 10.1155/2012/240898
Applying 3D Polygonal Mesh Watermarking for Transmission Security Protection through Sensor Networks
Roland Hu,Li Xie,Huimin Yu,Baocang Ding
Mathematical Problems in Engineering , 2014, DOI: 10.1155/2014/305960
Abstract: Although many research works have been carried out in the area of transmission 3D data through sensor networks, the security issue of transmission remains to be unsolved. It is important to develop systems for copyright protection and digital right management (DRM). In this paper, a blind watermarking algorithm is proposed to protect the transmission security of 3D polygonal meshes through sensor networks. Our method is based on selecting prominent feature vertices (prongs) on the mesh and then embedding the same watermark into their neighborhood regions. The embedding algorithm is based on modifying the distribution of vertex norms by using quadratic programming (QP). Decoding results are obtained by a majority voting scheme over neighborhood regions of these prongs. Assuming that cropping cannot remove all prongs, we can achieve robustness against the cropping attack both theoretically and experimentally. Experiments indicate that the proposed method is also robust against noise, smoothing, and mesh simplification. The proposed method has provided a solution for 3D polygonal watermarking which is potential to withstand a variety of attacks. 1. Introduction Nowadays, the processing, transmission, and visualization of 3D objects are a part of possible and realistic functionalities over sensor networks [1]. Confirmed 3D processing techniques exist and a large scientific community works hard on open problems and new challenges, including progressive transmission, fast access to huge 3D databases, or content security management. Although many research works have been carried out in the area of transmission 3D data through sensor networks, the security issue of transmission remains to be unsolved. 3D objects can be duplicated, modified, transformed, and shared easily during the transmission process. In this context, it is important to develop systems for copyright protection and digital right management (DRM). Watermarking is a promising area for reinforcing the security of 3D object transmission, which has received much attention in the past years, as summarized by [2, 3]. 3D objects can be represented by polygonal meshes [1], nonuniform rational B-splines (NURBS) [4], point-sampled surfaces, [5] and voxel representation [6]. Among these structures, polygonal mesh is the most popular one due to its simplicity and easiness to be converted to other representations. A 3D polygonal mesh is represented by a set of vertices and connections. In consequence, watermark can be embedded by modifying positions or connections of these vertices. Watermarking algorithms
Model Predictive Control
Baocang Ding,Marcin T. Cychowski,Yugeng Xi,Wenjian Cai,Biao Huang
Journal of Control Science and Engineering , 2012, DOI: 10.1155/2012/240898
Self-Similarity Superresolution for Resource-Constrained Image Sensor Node in Wireless Sensor Networks
Yuehai Wang,Weidong Wang,Shiying Cao,Shiju Li,Li Xie,Baocang Ding
Mathematical Problems in Engineering , 2014, DOI: 10.1155/2014/719408
Abstract: Wireless sensor networks, in combination with image sensors, open up a grand sensing application field. It is a challenging problem to recover a high resolution image from its low resolution counterpart, especially for low-cost resource-constrained image sensors with limited resolution. Sparse representation-based techniques have been developed recently and increasingly to solve this ill-posed inverse problem. Most of these solutions are based on an external dictionary learned from huge image gallery, consequently needing tremendous iteration and long time to match. In this paper, we explore the self-similarity inside the image itself, and propose a new combined self-similarity superresolution solution, with low computation cost and high recover performance. In the self-similarity image super resolution model , a small size sparse dictionary is learned from the image itself by the methods such as . The most similar patch is searched and specially combined during the sparse regulation iteration. Detailed information, such as edge sharpness, is preserved more faithfully and clearly. Experiment results confirm the effectiveness and efficiency of this double self-learning method in the image super resolution. 1. Introduction Wireless sensor networks, in combination with image sensors, open up a grand sensing application field. Visual information provided by image sensor is the most intuitive information perceived by human, especially for recognition, monitoring, and surveillance. Low-cost and resource-constrained image sensors with limited resolution are mainly employed [1–3]. Recovery from low resolution to high resolution is the pressing need for image sensor node. Image super resolution receives more and more interests recently, which has lots of applications in image sensor, digital cameras, mobile phone, image enhancement, high definition TV [4–6], and so forth. It aims to reconstruct a high-resolution image from the low-resolution one based on reasonable assumptions or prior knowledge. From the view of the target image, the image can be generated after downsampling and some blurring operator. Hence, the work has always been formulated as an inverse problem: where is the image to be recovered, is the known image, is the downsampling operator, is the blurring operator that minimizes the high frequency aliasing effect, and is the noise. Traditionally, the downsampling operator and blurring operator are conducted at the same time. Hence, we can use the following formulation (2) instead of (1): where is the generalized blurring and downsampling operator.
Sieve Method for Polynomial Linear Equivalence
Baocang Wang,Yupu Hu
Journal of Applied Mathematics , 2013, DOI: 10.1155/2013/872962
Abstract: We consider the polynomial linear equivalence (PLE) problem arising from the multivariate public key cryptography, which is defined as to find an invertible linear transformation satisfying for given nonlinear polynomial maps and over a finite field . Some cryptographic and algebraic properties of PLE are discussed, and from the properties we derive three sieves called multiplicative, differential, and additive sieves. By combining the three sieves, we propose a sieve method for the PLE problem. As an application of our sieve method, we show that it is infeasible to construct public key encryption schemes from the PLE problem. 1. Introduction With the rapid development of information technology, privacy and authentication have become two important issues that we must resolve in communication networks. Public key cryptography is undoubtedly one of the most important tools to resolve both problems in the area of information and network security engineering. Tremendous efforts had been made to achieve more practical and efficient public key ciphers in the cryptographic literature [1]. However, we should note that only a small number of them survived the serious security scrutiny, amongst which are the two widelyused cryptosystems RSA based on the integer factorization problem [1] and ECC based on the discrete logarithm problem on elliptic curves over finite fields [1, 2]. However, there exist polynomial-time algorithms for factoring large integers and solving the discrete logarithm problems on any finite cyclic group [3, 4]. Therefore, RSA and ECC are at the risk of being totally broken by quantum algorithms if practical quantum computing devices are available. Based on the considerations, cryptographers began to construct some alternative postquantum (i.e., quantum-resistant) public key cryptosystems from other mathematically intractable problems, especially those proven NP-complete or NP-hard problems. Multivariate public key cryptography (MPKC) is an important kind of postquantum public key ciphers [5]. The security of MPKC resides in the proven fact that it is NP-hard to solve a random system of nonlinear equations over finite fields [6]. MPKC was once considered very attractive and interesting also due to its high speed in key generation, encryption, and decryption, easy implementation on both hardware and software, and its simple mathematical description [5]. In a multivariate public key cryptosystem, we first define a nonlinear easy-to-invert map called central map, then we randomly choose two invertible affine transformations and , and finally we
The Termination of Algorithms for Computing Gr?bner Bases
Senshan Pan,Yupu Hu,BaoCang Wang
Mathematics , 2012,
Abstract: The F5 algorithm is generally believed as one of the fastest algorithms for computing Gr\"{o}bner bases. However, its termination problem is still unclear. Recently, an algorithm GVW and its variant GVWHS have been proposed, and their efficiency are comparable to the F5 algorithm. In the paper, we clarify the concept of an admissible module order. For the first time, the connection between the reducible and rewritable check is discussed here. We show that the top-reduced S-Gr\"{o}bner basis must be finite if the admissible monomial order and the admissible module order are compatible. This paper presents a complete proof of the termination and correctness of the GVWHS algorithm. What is more, it can be seen that the GVWHS is in fact an F5-like algorithm. Different from the GVWHS algorithm, the F5B algorithm may generate redundant sig-polynomials. Taking into account this situation, we prove the termination and correctness of the F5B algorithm. And we notice that the original F5 algorithm slightly differs from the F5B algorithm in the insertion strategy on which the F5-rewritten criterion is based. Exploring the potential ordering of sig-polynomials computed by the original F5 algorithm, we propose an F5GEN algorithm with a generalized insertion strategy, and prove the termination and correctness of it. Therefore, we have a positive answer to the long standing problem of proving the termination of the original F5 algorithm.

ZHANG Baocang
,REN Hao

- , 2018,
Abstract: 摘要 基于虚拟组织知识资源获取通过知识集成对持续创新能力的影响机理,构建了虚拟组织知识资源获取、知识集成与持续创新能力的关系模型。以291家企业作为样本进行了实证研究,研究表明,显性知识资源获取与隐性知识资源获取对持续创新能力有显著正向影响;知识集成显著正向影响持续创新能力;学习能力对知识资源获取与知识集成有显著正向调节作用
Architectural Technology Strategies of Zero Energy Solar House  [PDF]
Ding Ding, Chongjie Wang
Energy and Power Engineering (EPE) , 2013, DOI: 10.4236/epe.2013.54B055
Abstract: Taking I-Magic Cube - the entry of Shandong Jianzhu University for Solar Decathlon 2013 - for example, the paper analyzes the conceptual, technological, functional and aesthetic solutions of zero energy solar house coping with ecological, economic, social and cultural challenges. Passive strategies, the solar thermal and PV system, and the building integrated solar system tactics are elaborated. Finally, industrialization and marketing viability of the solar house prototypes are discussed.
Product Maintainability Design Method and Support Tool Based on Feature Model  [PDF]
Yufeng DING
Journal of Software Engineering and Applications (JSEA) , 2009, DOI: 10.4236/jsea.2009.23024
Abstract: Maintainability is an important character which is given by product design process. The maintainability design criteria and measure index used in product maintainability analysis are summarized and discussed in this paper. A product maintainability design method is studied by integrating the product feature model, maintainability design criteria with measure index. Product feature model can be built on the basis of the product feature library quickly. Product feature library for steam turbine design is created by using SolidWorks design library origination structure. A methodology which supports the design and development of product maintainability design support tool (PMDSTs) is put forward. The function of PMDSTs is designed by using UML (Unified Modeling Language) use case diagram, it is developed by using VC++ 6.0. The maintainability analysis application case of steam turbine-generator system is given at last.
Private Branding Analysis with the Intervention of Marketing Efforts on Channel Competition  [PDF]
Ding Yuan
American Journal of Industrial and Business Management (AJIBM) , 2016, DOI: 10.4236/ajibm.2016.62015
Abstract: Over the past decades, the retail industry has been continuingly prosperous through the constant booming of Chinese economy, a reality that retailers brand their store names or other private labels to products made by unaffiliated manufacturers. However, mass of data shows that retailers are reluctant to maximize their marketing efforts without private labels; from this perspective game theory was used to construct models for three modes, by which two distinguished circumstances depended on whether to adopt private branding. The results reveal a new theoretical insight into private branding choice that retails will not be fully motivated to optimize their marketing efforts on product branded by manufacturers because of the brand specificity. In addition, results also offer an internal condition of private branding strategy and its relevant factors. I’ve built my hope that this approach of private branding is useful to retailers who need scientific suggestions for crafting an efficient branding strategy.
Page 1 /10561
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.