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

International Conference on Modern Power Systems (MPS)

作者： Gary Ng Sorin Deleanu Jean-Paul Prévost David Carpenter Alta Steel Ltd. Edmonton Alberta Canada School of Applied Science and Technology Northern Alberta Institute of Technology (NAIT) Edmonton CANADA GE's Grid Software Solutions Technical Training Institute Redmond WA USA

ISBN: (纸本)9781509065660

The paper describes how a Direct Torque Control (DTC) drive technology has been applied to provide improved torque control of a Flying Dividing Shear (FDS) system in a steel rolling mill. The control system has a supervisory level ensured by a Programmable Logic Controller (PLC). The FDS is a highly dynamic, high speed application load and requires a high performance torque control drive for the purpose of the accuracy of the cutting process. During the FDS cutting mode, the bar profile has a very high linear speed, fact which represents a challenge the accuracy of the cut length. During the FDS cutting mode, depending on the bar length, the original DTC drive experienced overcurrent faults that cause production downtimes. A model of the overall system has been developed and has been used to provide the parameters for simulating the system. This has allowed the FDS operation to be analyzed and the FDS control system properly developed and tuned-up to obtain the required performance. The simulated DTC induction motor (IM) drive has been compared with the existing system from a steel plant. Measured data from the original system in the steel mill are compared with simulation results. This comparison shows that the system has been successfully simulated to determine a suitable agreement to the FDS operation. These measured and simulated results are also shown in the paper. Conclusions from this project are discussed.

关键词： Torque Induction motors Rotors Stator cores Torque control Aerospace electronics

来源：评论

学校读者我要写书评

暂无评论

Guaranteed quality isotropic surface remeshing based on uniformization

引用

Procedia Engineering 2017年 203卷 297-309页

作者： Ming Ma Xiaokang Yu Na Lei Hang Si Xianfeng Gu Department of Computer Science Stony Brook University Stony Brook NY 11794 United States Beijing Advanced Innovation Center for Imaging Technology Capital Normal University Beijing 100048 China College of Computer Science and Technology Qingdao University Qingdao 266071 China School of Software and Technology Dalian University of Technology Dalian 116620 China Weierstrass Institute for Applied Analysis and Stochastics Berlin 10117 Germany

Surface remeshing plays a significant role in computer graphics and visualization. Numerous surface remeshing methods have been developed to produce high quality meshes. Generally, the mesh quality is improved in terms of vertex sampling, regularity, triangle size and triangle shape. Many of such surface remeshing methods are based on Delaunay refinement. In particular, some surface remeshing methods generate high quality meshes by performing the planar Delaunay refinement on the conformal uniformization domain. However, most of these methods can only handle topological disks. Even though some methods can cope with high-genus surfaces, they require partitioning a high-genus surface into multiple simply connected segments, and remesh each segment in the parameterized domain. In this work, we propose a novel surface remeshing method based on uniformization theorem using dynamic discrete Yamabe flow and Delaunay refinement, which is capable of handling surfaces with complicated topologies, without the need of partitioning. The proposed method has the following merits: Dimension deduction, it converts all 3D surface remeshing to 2D planar meshing; Theoretic rigor, the existence of the constant curvature measures and the lower bound of the corner angles of the generated meshes can be proven. Experimental results demonstrate the efficiency and efficacy of our proposed method.

关键词： Surface remeshing Conformal uniformization Dynamic discrete Yamabe flow Delaunay refinement

来源：评论

学校读者我要写书评

暂无评论

Unsupervised storyline extraction from news articles 25

Unsupervised storyline extraction from news articles

引用

25th International Joint Conference on Artificial Intelligence, IJCAI 2016

作者： Zhou, Deyu Xu, Haiyang Dai, Xin-Yu He, Yulan School of Computer Science and Engineering Southeast University China State Key Laboratory for Novel Software Technology Nanjing University China School of Engineering and Applied Science Aston University United Kingdom

Storyline extraction from news streams aims to extract events under a certain news topic and reveal how those events evolve over time. It requires algorithms capable of accurately extracting events from news articles published in different time periods and linking these extracted events into coherent stories. The two tasks are often solved separately, which might suffer from the problem of error propagation. Existing unified approaches often consider events as topics, ignoring their structured representations. In this paper, we propose a non-parametric generative model to extract structured representations and evolution patterns of storylines simultaneously. In the model, each storyline is modelled as a joint distribution over some locations, organizations, persons, keywords and a set of topics. We further combine this model with the Chinese restaurant process so that the number of storylines can be determined automatically without human intervention. Moreover, per-token Metropolis-Hastings sampler based on light latent Dirichlet allocation is employed to reduce sampling complexity. The proposed model has been evaluated on three news corpora and the experimental results show that it outperforms several baseline approaches.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

Identity-based aggregate signcryption in the standard model from multilinear maps

引用

Frontiers of Computer science 2016年第4期10卷 741-754页

作者： Hao WANG Zhen LIU Zhe LIU Duncan S. WONG School of Information Science and Engineering Shandong Normal University Jinan 250014 China Shandong Provincial Key Labe ratory for Novel Distributed Computer Software Technology Jinan 250014 China Security and Data Sciences Hong Kong Applied Science and Technology Research Institute (ASTRI) Hong Kong China Laboratory of Algorithmics Cryptology and Security (LACS) University of Luxembourg Luxembourg L-1359 Luxembourg

Signcryption is a public key cryptographic method that achieves unforgeability and confidentiality simultaneously with significantly smaller overhead than that required by ＂digital signature followed by public key encryption＂. It does this by signing and *** a message in a single step. An aggregate signcryption scheme allows individual signcryption ciphertexts intended for the same recipi- ent to be aggregated into a single （shorter） combined ciphertext without losing any of the security guarantees. We present an aggregate signcryption scheme in the identity-based setting using multilinear maps, and provide a proof of security in the standard model. To the best of our knowledge, our new scheme is the first aggregate signcryption scheme that is secure in the standard model.

关键词： identity-based aggregate signcryption multilinear maps standard model GGH framework

来源：评论

学校读者我要写书评

暂无评论

A new method for reducing concept lattice attributes using infimum irreducible concepts

引用

International Journal of Hybrid Information technology 2016年第8期9卷 1-10页

作者： Jie, Wu Yan, Liang Yuan, Ma School of Software University of Science and Technology Liaoning Liaoning China School of Applied Technology University of Science and Technology Liaoning Liaoning China

Attribute reduction have always been hot issues in the concept lattice research. In this paper, we define the attribute waned value, and prove that using attribute waned values can simplifies the conversion of the discernibility function. Furthermore, we prove the attribute reduction can be generated by selecting elements from attribute waned values of infimum irreducible concepts, and provide an approach that uses attribute concepts to find all infimum irreducible concepts. In addition, we give an algorithm to get all attribute reductions. Because this algorithm only uses infimum irreducible concepts rather than all concepts, the time and space complexity is polynomial form and smaller. © 2016 SERSC.

关键词： Information analysis

来源：评论

学校读者我要写书评

暂无评论

A New Approach to Estimate the Missing Value based on Neighbor Granular Domain in the Incomplete Information System

A New Approach to Estimate the Missing Value based on Neighb...

引用

2016 IEEE 7th International Conference on software Engineering and Service science

作者： Liang Yan Wu Jie Ma Yuan School of Applied Technology University of Science and Technology Liaoning School of Software University of Science and Technology Liaoning

It is an important research subject to estimate the missing value in the incomplete information *** this paper,we formally define the incomplete information system,incomplete equivalence class,reflexive neighborhood,granularity,granularity domain,rough granularity domain,neighborhood granularity domain,and the property of neighborhood granularity *** we put forward a new method based on neighborhood granularity domain to estimate missing value of the incomplete information *** calculate the object incomplete equivalence class of the condition attributes and decision attributes,and then obtain granularity domain elements from the incomplete equivalence class,and calculate the rough granularity domain and the neighborhood granularity domain,and then divide all calculated objects of neighborhood granularity domain into according equivalence class,finally delete other equivalence class of the *** presents the algorithm and examples,and the experimental results show that the algorithm is fast and the missing value estimation accuracy is high.

关键词： incomprere informanon system incomprere equivalence class missing value neighbor granular domain

来源：评论

学校读者我要写书评

暂无评论

On converse bounds for classical communication over quantum channels

arXiv

引用

arXiv 2017年

作者： Wang, Xin Fang, Kun Tomamichel, Marco Centre for Quantum Software and Information School of Software Faculty of Engineering and Information Technology University of Technology SydneyNSW2007 Australia Joint Center for Quantum Information and Computer Science University of Maryland College ParkMD20742 United States Department of Applied Mathematics and Theoretical Physics University of Cambridge CambridgeCB3 0WA United Kingdom

We explore several new converse bounds for classical communication over quantum channels in both the one-shot and asymptotic regimes. First, we show that the Matthews- Wehner meta-converse bound for entanglement-assisted classical communication can be achieved by activated, no-signalling assisted codes, suitably generalizing a result for classical channels. Second, we derive a new efficiently computable meta-converse on the amount of classical information unassisted codes can transmit over a single use of a quantum channel. As applications, we provide a finite resource analysis of classical communication over quantum erasure channels, including the second-order and moderate deviation asymptotics. Third, we explore the asymptotic analogue of our new meta-converse, the γ-information of the channel. We show that its regularization is an upper bound on the classical capacity, which is generally tighter than the entanglement-assisted capacity and other known efficiently computable strong converse bounds. For covariant channels we show that the γ-information is a strong converse bound. Copyright © 2017, The Authors. All rights reserved.

关键词： Quantum entanglement

来源：评论

学校读者我要写书评

暂无评论

Generalized Regular Quadrilateral Mesh Generation based on Surface Foliation

引用

Procedia Engineering 2017年 203卷 336-348页

作者： Na Lei Xiaopeng Zheng Hang Si Zhongxuan Luo Xianfeng Gu DUT-RU International School of Information Science and Engineering Dalian University of Technology Dalian 116620 China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province Dalian 116620 China Beijing Advanced Innovation Center for Imaging Technology Capital Normal University Beijing 100048 China Weierstrass Institute for Applied Analysis and Stochastics Berlin 10117 Germany Computer Science Department Stony Brook University Stony Brook 11794 NY USA

This work introduces a novel algorithm for quad-mesh generation based on surface foliation theory. The algorithm is based on the equivalence among colorable quad-meshes, measure foliations and holomorphic differentials. The holomorphic differentials can be obtained by graph-valued harmonic maps. The algorithm has several merits: it can be applied for surfaces with general topologies; the resulting quad-meshes have global tensor product structure and the least number of singularities; the algorithmic pipeline is fully automatic. The experimental results demonstrate the efficiency and efficacy of the proposed method.

关键词： quadrilateral quad-mesh structured foliation harmonic map holomorphic differential

来源：评论

学校读者我要写书评

暂无评论

CITPM: A cluster-based iterative topical phrase mining framework 21st

CITPM: A cluster-based iterative topical phrase mining frame...

引用

21st International Conference on Database Systems for Advanced Applications, DASFAA 2016

作者： Li, Bing Wang, Bin Zhou, Rui Yang, Xiaochun Liu, Chengfei School of Computer Science and Engineering Northeastern University Liaoning110819 China Centre for Applied Informatics College of Engineering and Science Victoria University MelbourneVIC3011 Australia Department of Computer Science and Software Engineering Swinburne University of Technology MelbourneVIC3122 Australia

ISBN: (纸本)9783319320243

A phrase is a natural, meaningful, essential semantic unit. In topic modeling, visualizing phrases for individual topics is an effective way to explore and understand unstructured text corpora. Unfortunately, existing approaches predominately rely on the general distributional features between topics and phrases on an entire corpus, while ignore the impact of domain-level topical distribution. This often leads to losing domain-specific terminologies, and as a consequence, weakens the coherence of topical phrases. In this paper, we present a novel framework CITPM for topical phrase mining. Our framework views a corpus as a mixture of clusters (domains), and each cluster is characterized by documents sharing similar topical distributions. The CITPM framework iteratively performs phrase mining, topical inferring and cluster updating until a satisfactory final result is obtained. The empirical verification demonstrates our framework outperforms state-of-the-art works in both aspects of interpretability and efficiency. © Springer International Publishing Switzerland 2016.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Application of a hybrid intelligent optimization algorithm in cloud computing resources scheduling

International Journal of Multimedia and Ubiquitous Engineeri...

引用

International Journal of Multimedia and Ubiquitous Engineering 2016年第10期11卷 285-296页

作者： Zhang, Chun-Na Li, Yi-Ran School of Software University of Science and Technology Liaoning AnshanLiaoning114051 China College of Applied Technology University of Science and Technology Liaoning AnshanLiaoning114011 China

The resource scheduling imbalance is a multi-objective optimization problem in cloud computing environment, this paper introduced the particle swarm optimization algorithm in cloud computing, a simulated annealing ideas is proposed in view of the prematurity of the algorithm, on the premise of performance determination, the position of the particle is determined by the probability choice, which helps the particle to escape. In order to enhance the global searching ability of the particle, the algorithm is combined with the chaotic mechanism to improve the accuracy of the algorithm. The inertia weight is adjusted dynamically according to the current state of the particle, accordingly, at the same time to obtain the optimal solution to ensure the convergence. Analysis of the experimental results show that the improved algorithm has a significant improvement in the ability of optimization and convergence speed, compared with other algorithms, the benchmark functions comparison is better, the different resource task proportion spent the shortest time and load balancing is the highest. © 2016 SERSC.

关键词： Simulated annealing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：