scispace - formally typeset
Search or ask a question
Institution

Jiangxi University of Finance and Economics

EducationNanchang, China
About: Jiangxi University of Finance and Economics is a education organization based out in Nanchang, China. It is known for research contribution in the topics: Fuzzy logic & China. The organization has 2865 authors who have published 3556 publications receiving 41567 citations.


Papers
More filters
Journal ArticleDOI
TL;DR: In the proposed hybrid prediction algorithm named PSO-NN, particle swarm optimization (PSO) is introduced to enhance NN by optimizing its initial settings, and significantly outperforms the basic NN in the terms of prediction precision.
Abstract: Trustworthiness is an important indicator for service selection and recommendation in the cloud environment. However, predicting the trust rate of a cloud service based on its multifaceted quality of services (QoSs) is not an easy task due to the complicated and non-linear relations between service’s QoS values and the final trust rate of the service. According to the existing studies, the adoption of intelligent technique is a rational way to attack this problem. Neural network (NN) has been validated as an effective way to predict the trust rate of the service. However, the parameter setting of NN, which plays an important role in its prediction performance, has not been properly addressed yet. In the paper, particle swarm optimization (PSO) is introduced to enhance NN by optimizing its initial settings. In the proposed hybrid prediction algorithm named PSO-NN, PSO is used to search the appropriate parameters for NN so as to realize accurate trust prediction of cloud services. In order to investigate the effectiveness of PSO-NN, extensive experiments are performed based on public QoS data set, as well as in-depth comparison analysis. The results show that our proposed approach has better performance than basic classification methods in most cases, and significantly outperforms the basic NN in the terms of prediction precision. In addition, PSO-NN demonstrates better stability than the basic NN.

43 citations

Journal ArticleDOI
TL;DR: Analysis of data obtained from consumer surveys after the Double 11 promotion indicates that temporal distance has positive impact on purchase decision of high involvement products, while having negative impact on Purchase decision of low involvement products.
Abstract: As a key marketing tool, online sales promotion has been widely used by online retailers to increase sales of products and brands. Most previous researches on online sales promotion have ignored the effect of consumers’ psychological factors and the heterogeneity of product and consumers. The purpose of this study is to examine the role of psychological distance and involvement on consumers’ buying behavior in large online promotion activities. The research model was examined using empirical analysis of data obtained from consumer surveys after the Double 11 promotion. Our results indicate that temporal distance has positive impact on purchase decision of high involvement products, while having negative impact on purchase decision of low involvement products. Social distance has negative impact on consumers’ purchase decision. Temporal distance is positively associated with consumers’ purchase-decision involvement, and then purchase-decision involvement positively impacts consumers’ total consumption. Social distance has no impact on consumers’ purchase decision involvement. These findings not only advance the understanding of the role of psychological distance and involvement in online sales promotion but also offer implications regarding strategies that online retailers can employ to publish their promotions at different times and encourage consumers more to share promotional information among their friends.

43 citations

Journal ArticleDOI
TL;DR: Wang et al. as mentioned in this paper proposed a novel spatiotemporal network, where the key innovation is the design of its temporal unit Compared with other existing competitors, the proposed temporal unit exhibits an extremely lightweight design that does not degrade its strong ability to sense temporal information Furthermore, it fully enables the computation of temporal saliency cues that interact with their spatial counterparts.
Abstract: We have witnessed a growing interest in video salient object detection (VSOD) techniques in today’s computer vision applications In contrast with temporal information (which is still considered a rather unstable source thus far), the spatial information is more stable and ubiquitous, thus it could influence our vision system more As a result, the current main-stream VSOD approaches have inferred and obtained their saliency primarily from the spatial perspective, still treating temporal information as subordinate Although the aforementioned methodology of focusing on the spatial aspect is effective in achieving a numeric performance gain, it still has two critical limitations First, to ensure the dominance by the spatial information, its temporal counterpart remains inadequately used, though in some complex video scenes, the temporal information may represent the only reliable data source, which is critical to derive the correct VSOD Second, both spatial and temporal saliency cues are often computed independently in advance and then integrated later on, while the interactions between them are omitted completely, resulting in saliency cues with limited quality To combat these challenges, this paper advocates a novel spatiotemporal network, where the key innovation is the design of its temporal unit Compared with other existing competitors (eg, convLSTM), the proposed temporal unit exhibits an extremely lightweight design that does not degrade its strong ability to sense temporal information Furthermore, it fully enables the computation of temporal saliency cues that interact with their spatial counterparts, ultimately boosting the overall VSOD performance and realizing its full potential towards mutual performance improvement for each The proposed method is easy to implement yet still effective, achieving high-quality VSOD at 50 FPS in real-time applications

43 citations

Journal ArticleDOI
TL;DR: An exact algorithm is proposed from the view of cutting a convex polytope with hyperplanes to compute the projection depth and most of its associated estimators of dimension p≥2, including Stahel-Donoho location and scatter estimators, projection trimmed mean, projection depth contours and median, etc.
Abstract: To facilitate the application of projection depth, an exact algorithm is proposed from the view of cutting a convex polytope with hyperplanes. Based on this algorithm, one can obtain a finite number of optimal direction vectors, which are x-free and therefore enable us (Liu et al., Preprint, 2011) to compute the projection depth and most of its associated estimators of dimension p?2, including Stahel-Donoho location and scatter estimators, projection trimmed mean, projection depth contours and median, etc. Both real and simulated examples are also provided to illustrate the performance of the proposed algorithm.

42 citations

Journal ArticleDOI
TL;DR: A new method for interactive multi-criteria group decision-making with probabilistic linguistic information and applies to the emergency assistance area selection of COVID-19 for Wuhan and some new operational laws of PLTSs based on the Archimedean copulas and co-copulas are defined.

42 citations


Authors

Showing all 2890 results

NameH-indexPapersCitations
Jian Huang97118940362
Dean Tjosvold6328113224
Ning Zhang6270116494
Kin Keung Lai6054713120
Lei Shu5959813601
Brian M. Lucey5837314227
Robert J. Hardy451218798
Yu Lu432326485
Jiaying Liu432807489
Ali M. Kutan432726884
Dejian Lai391676409
Ahsan Habib392234951
Xiaohua Hu364246099
Naixue Xiong352915084
Yuming Fang352044800
Network Information
Related Institutions (5)
Renmin University of China
15.4K papers, 238.4K citations

88% related

Beijing Jiaotong University
37.9K papers, 376K citations

84% related

Xiamen University
54.4K papers, 1M citations

84% related

Nanjing Normal University
20.2K papers, 325K citations

83% related

Anhui University
16.7K papers, 210.5K citations

82% related

Performance
Metrics
No. of papers from the Institution in previous years
YearPapers
202315
202236
2021415
2020328
2019254
2018219