Entity

Time filter

Source Type


Yang C.,Shandong University of Finance and Economics | Yang C.,Shandong Provincial Key Laboratory of Software Engineering | Yang C.,CVIC Software Engineering Co. | Gao S.S.,Shandong University of Finance and Economics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

The cross-enterprise business process is different from the common business process. More issues of level interoperability must be defined and differentiated. The enterprise interoperability framework has been proposed by five levels. And a novel method of cross-enterprise process collaboration is presented. In order to enhance the capability of process reengineering and change, the services composition strategy which is based on SCA components have been proposed. An example of cross-enterprise business of cloth-order in textile industry is illustrated and analyzed as well. © Springer International Publishing Switzerland 2015. Source


Yang C.,Shandong University of Finance and Economics | Yang C.,Shandong Provincial Key Laboratory of Software Engineering | Yang C.,CVIC Software Engineering Co. | Peng S.,Shandong University of Finance and Economics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2015

With the emergence of cloud computing paradigm, it provides a promising new solution for sophisticated instance intensive applications. However, the reliability and response speed begins to be suffered because of the limitation of the Hadoop’s FIFO scheduling model. It becomes unacceptable to execute the large scale instance intensive tasks under such conditions. In order to enhance the system resource utilization, we propose a solution in this paper. We use a delay scheduling algorithm to determine the scheduling opportunity and reduce the cost. Delay scheduling can ensure that the current scheduled tasks can make full use of the physical resources, raise resource utilization, and reduce the probability of failure scheduling. The experimental evaluation illustrates that the large scale instance intensive tasks can benefit from the Min-cost delay scheduling algorithm presented in the paper. © Springer International Publishing Switzerland 2015. Source


Yang C.,Shandong University of Finance and Economics | Yang C.,Shandong Provincial Key Laboratory of Software Engineering | Guo J.-D.,Shandong University of Finance and Economics | Chi J.,Shandong University of Finance and Economics
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) | Year: 2014

The response time starts to suffer due to the limitation of the Hadoop’s FIFO scheduler, and this is unacceptable to execute the large scale instance intensive tasks. To enhance the system resource utilization, we propose a new scheduling solution. To reduce the cost, we use a delay scheduling algorithm to determine the scheduling opportunity. Delay scheduling can ensure that the current service can make full use of the resources, improve resource utilization, and reduce the probability of failure scheduling. The initial experiments demonstrate that the large scale instances intensive workflow tasks will benefit from the Min-Cost delay scheduling algorithm that is proposed in this paper. © Springer International Publishing Switzerland 2014. Source


Guo F.,Shandong University of Science and Technology | Guo F.,Shandong Provincial Key Laboratory of Software Engineering | Li S.,Shandong University of Science and Technology
2012 2nd International Conference on Consumer Electronics, Communications and Networks, CECNet 2012 - Proceedings | Year: 2012

In this paper, a new data compression method is presented. A prediction method based on quadratic curve reconstruction is used to improve the data reduction rate. The limitations of human perception with respect to a user's hand position and force feedback are considered in the method to insure that distortions introduced by the compression scheme remain imperceptible to the user. Experiments are included to prove the effectiveness of the proposed approach in data reduction rate. © 2012 IEEE. Source


Yang F.,Shandong University of Science and Technology | Yang F.,Shandong Provincial Key Laboratory of Software Engineering | Yu X.,Shandong University of Science and Technology | Yu X.,York University | And 5 more authors.
Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining | Year: 2012

The problem of gauging information credibility on social net- works has received considerable attention in recent years. Most previous work has chosen Twitter, the world's largest micro-blogging platform, as the premise of research. In this work, we shift the premise and study the problem of information credibility on Sina Weibo, China's leading micro- blogging service provider. With eight times more users than Twitter, Sina Weibo is more of a Facebook-Twitter hybrid than a pure Twitter clone, and exhibits several important characteristics that distinguish it from Twitter. We collect an extensive set of microblogs which have been confirmed to be false rumors based on information from the official rumor-busting service provided by Sina Weibo. Unlike previous studies on Twitter where the labeling of rumors is done manually by the participants of the experiments, the official nature of this service ensures the high quality of the dataset. We then examine an extensive set of features that can be extracted from the microblogs, and train a classifier to automatically detect the rumors from a mixed set of true information and false information. The experiments show that some of the new features we propose are indeed effective in the classification, and even the features considered in previous studies have different implications with Sina Weibo than with Twitter. To the best of our knowledge, this is the first study on rumor analysis and detection on Sina Weibo. Copyright © 2012 ACM. Source

Discover hidden collaborations