oalib

Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99

Submit

Any time

2019 ( 146 )

2018 ( 1208 )

2017 ( 1072 )

2016 ( 1095 )

Custom range...

Search Results: 1 - 10 of 78186 matches for " Duanbing Chen "
All listed articles are free for downloading (OA Articles)
Page 1 /78186
Display every page Item
Corner Occupying Theorem for the Two-dimensional Integral Rectangle Packing Problem
Wenqi Huang,Tao Ye,Duanbing Chen
Mathematics , 2011,
Abstract: This paper proves a corner occupying theorem for the two-dimensional integral rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given integral rectangles into an integral rectangular container without overlapping, then we can achieve a feasible packing by successively placing an integral rectangle onto a bottom-left corner in the container. Based on this theorem, we might develop efficient heuristic algorithms for solving the integral rectangle packing problem. In fact, as a vague conjecture, this theorem has been implicitly mentioned with different appearances by many people for a long time.
Bottom-Left Placement Theorem for Rectangle Packing
Wenqi Huang,Tao Ye,Duanbing Chen
Computer Science , 2011,
Abstract: This paper proves a bottom-left placement theorem for the rectangle packing problem, stating that if it is possible to orthogonally place n arbitrarily given rectangles into a rectangular container without overlapping, then we can achieve a feasible packing by successively placing a rectangle onto a bottom-left corner in the container. This theorem shows that even for the real-parameter rectangle packing problem, we can solve it after finite times of bottom-left placement actions. Based on this theorem, we might develop efficient heuristic algorithms for solving the rectangle packing problem.
The role of taste affinity in agent-based models for social recommendation
Giulio Cimini,An Zeng,Matus Medo,Duanbing Chen
Computer Science , 2013,
Abstract: In the Internet era, online social media emerged as the main tool for sharing opinions and information among individuals. In this work we study an adaptive model of a social network where directed links connect users with similar tastes, and over which information propagates through social recommendation. Agent-based simulations of two different artificial settings for modeling user tastes are compared with patterns seen in real data, suggesting that users differing in their scope of interests is a more realistic assumption than users differing only in their particular interests. We further introduce an extensive set of similarity metrics based on users' past assessments, and evaluate their use in the given social recommendation model with both artificial simulations and real data. Superior recommendation performance is observed for similarity metrics that give preference to users with small scope---who thus act as selective filters in social recommendation.
Adaptive social recommendation in a multiple category landscape
Duanbing Chen,An Zeng,Giulio Cimini,Yi-Cheng Zhang
Computer Science , 2012, DOI: 10.1140/epjb/e2012-30899-9
Abstract: People in the Internet era have to cope with the information overload, striving to find what they are interested in, and usually face this situation by following a limited number of sources or friends that best match their interests. A recent line of research, namely adaptive social recommendation, has therefore emerged to optimize the information propagation in social networks and provide users with personalized recommendations. Validation of these methods by agent-based simulations often assumes that the tastes of users and can be represented by binary vectors, with entries denoting users' preferences. In this work we introduce a more realistic assumption that users' tastes are modeled by multiple vectors. We show that within this framework the social recommendation process has a poor outcome. Accordingly, we design novel measures of users' taste similarity that can substantially improve the precision of the recommender system. Finally, we discuss the issue of enhancing the recommendations' diversity while preserving their accuracy.
Identifying Influential Spreaders by Weighted LeaderRank
Qian Li,Tao Zhou,Linyuan Lv,Duanbing Chen
Computer Science , 2013, DOI: 10.1016/j.physa.2014.02.041
Abstract: Identifying influential spreaders is crucial for understanding and controlling spreading processes on social networks. Via assigning degree-dependent weights onto links associated with the ground node, we proposed a variant to a recent ranking algorithm named LeaderRank [L. Lv et al., PLoS ONE 6 (2011) e21202]. According to the simulations on the standard SIR model, the weighted LeaderRank performs better than LeaderRank in three aspects: (i) the ability to find out more influential spreaders, (ii) the higher tolerance to noisy data, and (iii) the higher robustness to intentional attacks.
Enhancing topology adaptation in information-sharing social networks
Giulio Cimini,Duanbing Chen,Matus Medo,Linyuan Lu,Yi-Cheng Zhang,Tao Zhou
Computer Science , 2011, DOI: 10.1103/PhysRevE.85.046108
Abstract: The advent of Internet and World Wide Web has led to unprecedent growth of the information available. People usually face the information overload by following a limited number of sources which best fit their interests. It has thus become important to address issues like who gets followed and how to allow people to discover new and better information sources. In this paper we conduct an empirical analysis on different on-line social networking sites, and draw inspiration from its results to present different source selection strategies in an adaptive model for social recommendation. We show that local search rules which enhance the typical topological features of real social communities give rise to network configurations that are globally optimal. These rules create networks which are effective in information diffusion and resemble structures resulting from real social systems.
Firm competition in a probabilistic framework of consumer choice
Hao Liao,Rui Xiao,Duanbing Chen,Matus Medo,Yi-Cheng Zhang
Quantitative Finance , 2013, DOI: 10.1016/j.physa.2013.12.026
Abstract: We develop a probabilistic consumer choice framework based on information asymmetry between consumers and firms. This framework makes it possible to study market competition of several firms by both quality and price of their products. We find Nash market equilibria and other optimal strategies in various situations ranging from competition of two identical firms to firms of different sizes and firms which improve their efficiency.
Research on the Incentive Mechanism of Hidilao Hotpot’s Employees Based on Grounded Theory  [PDF]
Chen Chen
Journal of Human Resource and Sustainability Studies (JHRSS) , 2018, DOI: 10.4236/jhrss.2018.61031
Abstract: The traditional classical incentive model only reveals the general rule of organizational incentive, and does not give specific operation rules. The matching between organizational incentives and employee needs is still black box, and it does not reveal its core operation mechanism from the perspective of mechanism. This paper took through the literature review, the Hidilao Hotpot company as a case study, through a variety of ways to collect data, the use of grounded theory to encode data analysis, and ultimately extracted 58 concepts, 26 sub-areas, 7 main areas, concluded that the Hidilao Hotpot Employee motivation formed the path, and ultimately extracted the micro-level employee motivation mechanism model. The research result of this article comes from the practice of the enterprise, which has enlightenment to the organizational incentive of the traditional catering industry and also provides a micro-research perspective and systematic mechanism research for the incentive field.
Digital Image Watermarking Based on Mixed Error Correcting Code  [PDF]
Yonghong Chen, Jiancong Chen
Journal of Information Security (JIS) , 2012, DOI: 10.4236/jis.2012.32018
Abstract: In this paper, we present a novel technique based on a mixed Error Correcting Code(ECC)-the convolutional code and the repetition code to enhance the robustness of the embedded watermark. Before embedding, the binary watermark is scanned to one-dimension sequence and later inputted into the (3, 1, 2) convolutional encoder and (3, 1) repetition encoder frame by frame, which will improve the error correcting capability of decoder. The output code sequence is scanned to some matrixes as the new watermark messages. The watermarking is selected in low frequency band of the Discrete Wavelet Transform (DWT) and therefore it can resist the destruction of image processing. Experimental results are presented to demonstrate that the robustness of a watermark with mixed ECC is much higher than the traditional one just with repetition coding while suffering JPEG lossy compression, salt and pepper noise and center cutting processing.
Operator Equation and Application of Variation Iterative Method  [PDF]
Ning Chen, Jiqian Chen
Applied Mathematics (AM) , 2012, DOI: 10.4236/am.2012.38127
Abstract: In this paper, we study some semi-closed 1-set-contractive operators A and investigate the boundary conditions under which the topological degrees of 1-set contractive fields, deg (I-A, Ω, p) are equal to 1. Correspondingly, we can obtain some new fixed point theorems for 1-set-contractive operators which extend and improve many famous theorems such as the Leray-Schauder theorem, and operator equation, etc. Lemma 2.1 generalizes the famous theorem. The calculation of topological degrees and index are important things, which combine the existence of solution of for integration and differential equation and or approximation by iteration technique. So, we apply the effective modification of He’s variation iteration method to solve some nonlinear and linear equations are proceed to examine some a class of integral-differential equations, to illustrate the effectiveness and convenience of this method.
Page 1 /78186
Display every page Item


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