检索结果-内蒙古大学图书馆

Has “Intelligent Manufacturing” Promoted the Productivity of Manufacturing Sector?--Evidence from China’s Listed Firms

引用

Procedia Computer Science 2018年 139卷 299-305页

作者： Yi Qu Yong Shi Kun Guo Yuanchun Zheng School of Economics and Management University of Chinese Academy of Sciences Beijing 100190 China Key Laboratory of Big Data Mining and Knowledge Management Chinese Academy of Sciences Beijing 100190 China Research Center on Fictitious Economy & Data Science Chinese Academy of Sciences Beijing 100190 China College of Information Science and Technology University of Nebraska at Omaha NE 68182 USA School of Computing and Control Engineering University of Chinese Academy of Sciences Beijing 100190 China

Intelligent Manufacturing has attracted global and continuous attention recent years, with more and more intelligent devices and systems applied in production. In this paper, we take China’s manufacturing listed firms to investigate the productivity difference between intelligent and general manufacturing firms. By the Cobb-Douglas production function, we built a Coefficient-varying Model and used Seemingly Unrelated Regression (SUR) to estimate the time-varying trend of productivity from 2011 to 2017. The empirical results show that “Intelligent Manufacturing” has obviously promoted the Labor factor utilization efficiency and the Total Factor Productivity (TFP) through the advances in technology. But it doesn’t have universally enhancing effect of all industries. The impact of “Intelligent Manufacturing” still remains to be observed overtime.

关键词： Intelligent Manufacturing Cobb-Douglas Production Function Total Factor Productivity (TFP) Coefficient-varying Model Seemingly Unrelated Regression (SUR)

来源：评论

学校读者我要写书评

暂无评论

Enhancing stock market prediction with extended coupled Hidden Markov Model over multi-sourced data

arXiv

引用

arXiv 2018年

作者： Zhang, Xi Li, Yixuan Wang, Senzhang Fang, Binxing Yu, Philip S. Key Laboratory of Trustworthy Distributed Computing and Service Beijing University of Posts and Telecommunications Ministry of Education Beijing China Department of Computing Hong Kong Polytechnic University Kowloon Hong Kong Institute of Electronic and Information Engineering UESTC Guangdong China Department of Computer Science University of Illinois ChicagoIL United States Institute for Data Science Tsinghua University Beijing China

Traditional stock market prediction methods commonly only utilize the historical trading data, ignoring the fact that stock market uctuations can be impacted by various other information sources such as stock related events. Although some recent works propose event-driven prediction approaches by considering the event data, how to leverage the joint impacts of multiple data sources still remains an open research problem. In this work, we study how to explore multiple data sources to improve the performance of the stock prediction. We introduce an Extended Coupled Hidden Markov Model incorporating the news events with the historical trading data. To address the data sparsity issue of news events for each single stock, we further study the uctuation correlations between the stocks and incorporate the correlations into the model to facilitate the prediction task. Evaluations on China A-share market data in 2016 show the superior performance of our model against previous methods. Copyright © 2018, The Authors. All rights reserved.

关键词： Hidden Markov models

来源：评论

学校读者我要写书评

暂无评论

Radio detection of an elusive millisecond pulsar in the Globular Cluster NGC 6397

arXiv

引用

arXiv 2022年

作者： Zhang, Lei Ridolfi, Alessandro Blumer, Harsha Freire, Paulo C.C. Manchester, Richard N. McLaughlin, Maura Kremer, Kyle Cameron, Andrew D. Zhang, Zhiyu Behrend, Jan Burgay, Marta Buchner, Sarah Champion, David J. Chen, Weiwei Dai, Shi Feng, Yi Fu, Xiaoting Guo, Meng Hobbs, George Keane, Evan F. Kramer, Michael Levin, Lina Li, Xiangdong Ni, Mengmeng Pan, Jingshan Padmanabh, Prajwal V. Possenti, Andrea Ransom, Scott M. Tsai, Chao-Wei Krishnan, Vivek Venkatraman Wang, Pei Zhang, Jie Zhi, Qijun Zhang, Yongkun Li, Di National Astronomical Observatories Chinese Academy of Sciences A20 Datun Road Chaoyang District Beijing100101 China Centre for Astrophysics and Supercomputing Swinburne University of Technology P.O. Box 218 HawthornVIC3122 Australia SelargiusI-09047 Italy Department of Physics and Astronomy West Virginia University MorgantownWV26506 United States Max-Planck Institut für Radioastronomie Auf dem Hügel 69 BonnD-53121 Germany CSIRO Space and Astronomy Australia Telescope National Facility PO Box 76 EppingNSW1710 Australia TAPIR California Institute of Technology PasadenaCA91125 United States The Observatories of the Carnegie Institution for Science PasadenaCA91101 United States Swinburne University of Technology Mail H74 PO Box 218 VIC3122 Australia School of Astronomy and Space Science Nanjing University Nanjing210023 China Ministry of Education Nanjing210093 China South African Radio Astronomy Observatory Fir Street Black River Park Cape Town7925 South Africa School of Science Western Sydney University Locked Bag 1797 PenrithNSW2751 Australia Research Center for Intelligent Computing Platforms Zhejiang Laboratory Hangzhou311100 China Purple Mountain Observatory Chinese Academy of Sciences Nanjing210023 China National Supercomputing Center in Jinan Qilu University of Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China Jinan Institute of Supercomputing Technology 28666 East Jingshi Road Licheng Distrist Jinan250103 China School of Physics Trinity College Dublin College Green Dublin Ireland Jodrell Bank Centre for Astrophysics Department of Physics and Astronomy The University of Manchester ManchesterM13 9PL United Kingdom HannoverD-30167 Germany MonserratoI-09042 Italy NRAO 520 Edgemont Road CharlottesvilleVA22903 United States College of Physics and Electronic Engineering Qilu Normal University 2 Wenbo Road Zhangqiu District Jinan250200 China Guizhou Provincial Key Laboratory of Radio

We report the discovery of a new 5.78 ms-period millisecond pulsar (MSP), PSR J1740−5340B (NGC 6397B), in an eclipsing binary system discovered with the Parkes radio telescope (now also known as Murriyanga), Australia, and confirmed with the MeerKAT radio telescope in South Africa. The measured orbital period, 1.97 days, is the longest among all eclipsing binaries in globular clusters (GCs) and consistent with that of the coincident X-ray source U18, previously suggested to be a ‘hidden MSP’. Our XMM-Newton observations during NGC 6397B’s radio quiescent epochs detected no X-ray flares. NGC 6397B is either a transitional MSP or an eclipsing binary in its initial stage of mass transfer after the companion star left the main sequence. The discovery of NGC 6397B potentially reveals a subgroup of extremely faint and heavily obscured binary pulsars, thus providing a plausible explanation to the apparent dearth of binary neutron stars in core-collapsed GCs as well as a critical constraint on the evolution of GCs. Copyright © 2022, The Authors. All rights reserved.

关键词： Mass transfer

来源：评论

学校读者我要写书评

暂无评论

A decoupling two-grid method for the time-dependent poisson-nernst-planck equations

arXiv

引用

arXiv 2018年

作者： Shen, Ruigang Shu, Shi Yang, Ying Lu, Benzhuo School of Mathematics and Computational Science Xiangtan University Xiangtan Hunan411105 China Hunan Key Laboratory for Computation and Simulation in Science and Engineering Xiangtan University Xiangtan Hunan411105 China School of Mathematics and Computational Science Guangxi Colleges Universities Key Laboratory of Data Analysis and Computation Guangxi Key Laboratory of Cryptography and information Security Guilin University of Electronic Technology Guilin Guangxi541004 China Institute of Computational Mathematics and Scientific/Engineering Computing National Center for Mathematics and Interdisciplinary Sciences Academy of Mathematics and Systems Science Chinese Academy of Sciences Beijing100190 China

We study a two-grid strategy for decoupling the time-dependent Poisson-Nernst-Planck equations describing the mass concentration of ions and the electrostatic potential. The computational system is decoupled to smaller systems by using coarse space solutions at each time level, which can speed up the solution process compared with the finite element method combined with the Gummel iteration. We derive the optimal error estimates in L2 norm for both semi- and fully discrete finite element approximations. Based on the a priori error estimates, the error estimates in H1 norm are presented for the two-grid algorithm. The theoretical results indicate this decoupling method can retain the same accuracy as the finite element method. Numerical experiments including the Poisson-Nernst-Planck equations for an ion channel show the efficiency and effectiveness of the decoupling two-grid method. Copyright © 2018, The Authors. All rights reserved.

关键词： Finite element method

来源：评论

学校读者我要写书评

暂无评论

Recognition of Natural Road Sign Based on the Improved Curvature Feature

Recognition of Natural Road Sign Based on the Improved Curva...

引用

The Third International Conference of Pioneering Computer Scientists, Engineers and Educators,ICPCSEE 2017(originally ICYCSEE)

作者： Yanqing Wang Hao Zheng Weiwei Chen Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information Engineering Nanjing Xiaozhuang University

To solve the recognition of road sign with an intelligent vehicle in vision-based navigation, road sign extraction and matching techniques required in outdoor scene was proposed in this paper. The method of the improved curvature based on feature extraction and binary description took the advantage of reasonable features distribution to overcome the problems of traditional features uneven distribution. Binary description method was represented to solve the real-time problem of feature matching. Through the validity and real-time performance of different algorithms are compared by experiments and indicate that the method can not only overcome negative influences from the disturb of non-targets, while spending on average only 46 ms processing each frame, but also meet the requirements of robustness, real-time, and accuracy.

关键词： Feature matching Feature extraction Road sign Curvature algorithm

来源：评论

学校读者我要写书评

暂无评论

Research on Target Extraction Technology of Fruit and Vegetable Images in the Complex Environment

Research on Target Extraction Technology of Fruit and Vegeta...

引用

The Third International Conference of Pioneering Computer Scientists, Engineers and Educators,ICPCSEE 2017(originally ICYCSEE)

作者： Yanqing Wang Hao Zheng Key Laboratory of Trusted Cloud Computing and Big Data Analysis School of Information Engineering Nanjing Xiaozhuang University

Considering the difficulty of fruit and vegetable images with uneven illumination and uncontrolled backgrounds, this paper proposed an image preprocess algorithm based on visual subject detection. Firstly, we can use manifold ranking to significance test and to acquire significance images, then use gradient images and position weighting to get cutting images, finally adjust the image brightness and remove image noise to complete the image *** experiment results demonstrated the robustness and real-time of the proposed algorithm which can segment images accurately and the accuracy is higher than 91%.

关键词： Manifold ranking Significance images Gradient images Image segment

来源：评论

学校读者我要写书评

暂无评论

A Vehicular Positioning Enhancement with Connected Vehicle Assistance Using Extended Kalman Filtering 1st

A Vehicular Positioning Enhancement with Connected Vehicle A...

引用

1st International Conference on 5G for Future Wireless Networks, 5GWN 2017

作者： Tian, Daxin Liu, Wenhao Duan, Xuting Rong, Hui Guo, Peng Wang, Wenyang Zhang, Haijun Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University XueYuan Road No. 37 Beijing100191 China China Automotive Technology and Research Center Automotive Engineering Research Institute East Xianfeng Road No. 68 Tianjin300300 China School of Computer and Communication Engineering University of Science and Technology Beijing XueYuan Road No. 30 Beijing100083 China Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University XueYuan Road No. 37 Beijing100191 China Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies Si Pai Lou. 2 Nanjing210096 China Key Lab of Urban ITS Technology Optimization and Integration The Ministry of Public Security of China Hefei230088 China

ISBN: (纸本)9783319728223

In this paper, we consider the problem of vehicular positioning enhancement with emerging connected vehicles (CV) technologies. In order to actually describe the scenario, the Interacting Multiple Model (IMM) filter is used for depicting varies of observation models. A CV-enhanced IMM filtering approach is proposed to locate a vehicle by data fusion from both coarse GPS data and the Doppler frequency shifts (DFS) measured from dedicated short-range communications (DSRC) radio signals. Simulation results state the effectiveness of the proposed approach called CV-IMM-EKF. © 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Global positioning system

来源：评论

学校读者我要写书评

暂无评论

Modeling and Simulation on Cooperative Movement of Vehicle Group Based on the Behavior of Fish 1st

Modeling and Simulation on Cooperative Movement of Vehicle G...

引用

1st International Conference on 5G for Future Wireless Networks, 5GWN 2017

作者： Tian, Daxin Kang, Lu Zheng, Kunxian Duan, Xuting Rong, Hui Guo, Peng Wang, Wenyang Zhang, Haijun Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University XueYuan Road No.37 Beijing100191 China China Automotive Technology and Research Center Automotive Engineering Research Institute East Xianfeng Road No.68 Tianjin300300 China School of Computer and Communication Engineering University of Science and Technology Beijing XueYuan Road No.30 Beijing100083 China Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University XueYuan Road No.37 Beijing100191 China Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies Si Pai Lou. 2 Nanjing210096 China Key Lab of Urban ITS Technology Optimization and Integration The Ministry of Public Security of China Hefei230088 China

ISBN: (纸本)9783319728223

Fatigue driving might affect the traffic safety when the vehicles are on the cruising state in highway. Trying to solve this problem, this paper uses the movement pattern of the fish to the vehicles fleet, and develops a model of vehicle group with realistic restrictions based on the existed fish algorithms, the mobile behavioral model and cluster behavior model, and then demonstrates the feasibility of applying the fish behavior to the cooperative movement of vehicle groups through analyzing the trajectory, velocity and spacing of vehicles. © 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

REFF: REliable and Fast Forwarding in Vehicular Ad-hoc Network 1st

REFF: REliable and Fast Forwarding in Vehicular Ad-hoc Netwo...

引用

1st International Conference on 5G for Future Wireless Networks, 5GWN 2017

作者： Tian, Daxin Dai, Ziyi Zheng, Kunxian Zhou, Jianshan Duan, Xuting Guo, Peng Rong, Hui Wang, Wenyang Zhang, Haijun Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University XueYuan Road No. 37 Beijing100191 China China Automotive Technology and Research Center Automotive Engineering Research Institute East Xianfeng Road No. 68 Tianjin300300 China School of Computer and Communication Engineering University of Science and Technology Beijing XueYuan Road No. 30 Beijing100083 China Beijing Key Laboratory for Cooperative Vehicle Infrastructure Systems and Safety Control School of Transportation Science and Engineering Beihang University XueYuan Road No. 37 Beijing100191 China Jiangsu Province Collaborative Innovation Center of Modern Urban Traffic Technologies Si Pai Lou. 2 Nanjing210096 China Key Lab of Urban ITS Technology Optimization and Integration The Ministry of Public Security of China Hefei230088 China

ISBN: (纸本)9783319728223

Vehicular Ad-Hoc Network (VANET) has emerged as an increasingly dominant technology for future connected vehicle and vehicular networks, where the focus of the development of VANET lies in the standardization of message transmission and dissemination via multi-hop broadcasting. However, the current communication protocols concerning VANET face many challenges, including data flooding and collision, transmission delay and other problems. Most of the challenges are closely related to next-hop selection. Therefore, this paper proposes a new routing protocol named REliable and Fast Forwarding (REFF) to optimize the selection of nodes in VANET. In this protocol, node filtering and node evaluation are two main steps. Distance between previous node and candidate node, relative velocity between previous node and candidate nodes, included angle between direction of target node’s velocity and candidate node’s velocity and transmission power of candidate node are adopted as indexes to help select a specific node as the next hop using Technique for Order of Preference by Similarity to Ideal Solution (TOPSIS). By using this technique, the number of candidates as next-hop is largely reduced, avoiding the data flooding and resulting transmission relay. In addition, simulations based on experiments are done to verify the feasibility. The results show that message achieves a faster and more reliable transmission using REFF. © 2018, ICST Institute for Computer Sciences, Social Informatics and Telecommunications engineering.

关键词： Vehicular ad hoc networks

来源：评论

学校读者我要写书评

暂无评论

The packing problem of uncertain multicasts

The packing problem of uncertain multicasts

引用

作者： Ren, Bangbang Guo, Deke Xie, Junjie Li, Wenxin Yuan, Bo Liu, Yunfei Science and Technology on Information Systems Engineering Laboratory National University of Defense Technology Changsha China School of Computer Science and Technology Dalian University of Technology Dalian China Guangxi Cooperative Innovation Center of Cloud Computing and Big Data Guangxi Colleges and Universities Key Laboratory of Cloud Computing and Complex Systems Guilin University of Electronic Technology Guilin China

Multicast performs better than unicast in delivering the same content from a fixed single source to a set of destinations. Many efforts have been made to optimize such kind of deterministic multicast, such as minimizing the transmission cost of each multicast session. In practice, it is not necessary that the source of each multicast session has to be in a specific location, as long as certain constraints are satisfied. Accordingly, applications usually meet a novel multicast with uncertain sources, ie, uncertain multicast. That is, multiple nodes have the responsibility to act as the root node of a multicast session. Prior proposals have addressed an uncertain multicast by constructing the minimum cost forest. However, it is still unknown how to efficiently share the network resources, when a set of uncertain multicast occupies the network simultaneously. To tackle such a challenging issue, we present the packing problem of uncertain multicasts (MPU) to minimize the total transmission cost, under the constraint of link capacity. We prove that the MPU problem is NP-hard. An intrinsic solution is constructing the minimum cost forest for each uncertain multicast individually. This method, however, is inefficient and may be infeasible because of the constraint of link capacity. Thus, we design 2 dedicated greedy methods, named priority-based and adjusting congested link, to approximate the optimal solution. The comprehensive results indicate that both of our 2 methods can find a feasible solution for the MPU problem. Moreover, given a set of uncertain multicasts, the adjusting congested link method can generate a desired transmission structure for each uncertain multicast and achieve the least total cost when packing them. Copyright © 2016 John Wiley & Sons, Ltd.

关键词： Routing algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：