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

IEEE International Conference on Networking, Sensing and Control

作者： GuanJun Liu ChangJun Jiang MengChu Zhou Key Laboratory of the MoE for Embedded System and Service Computing University of Tongji Shanghai China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA

Li and Zhou propose an important concept for Petri nets: elementary siphons. They partition siphons into elementary and dependent ones. The controllability of the latter can be ensured by the former's proper control. They give a sufficient condition to decide whether a dependent siphon is controlled by its elementary ones in S 3 PR. However, this condition is so loose that in many cases the controllability of a dependent SMS cannot be determined although it is actually controlled. In this paper, we propose an improved condition to decide the controllability of strongly dependent SMS.

关键词： Controllability System recovery Nickel Flexible manufacturing systems Petri nets Sufficient conditions Control theory

来源：评论

学校读者我要写书评

暂无评论

On the complexity of leakage interference minimization for interference alignment

On the complexity of leakage interference minimization for i...

引用

IEEE Workshop on Signal Processing Advances in Wireless Communications (SPAWC)

作者： Ya-Feng Liu Yu-Hong Dai Zhi-Quan Luo State Key Laboratory of Scientific and Engineering Computing Academy of Mathematics and Systems Science Chinese Academy and Sciences Beijing China Department of Electronic and Computer Engineering University of Minnesota Minneapolis MN USA

For a general MIMO interference channel, we can determine the feasibility of linear interference alignment via minimizing the leakage interference. This paper gives a complete complexity characterization of the leakage interference minimization problem. It is shown that, when each transmitter (receiver) is equipped with at least three antennas and each receiver (transmitter) is equipped with at least two antennas, the problem of checking whether the interference in the network can be perfectly aligned is strongly NP-hard. Moreover, when each transmit/receive node is equipped with two or more antennas, leakage interference minimization can not be solved (even approximately) in polynomial time, unless P = NP.

关键词： Interference Polynomials Minimization MIMO Complexity theory Receiving antennas

来源：评论

学校读者我要写书评

暂无评论

Stereoscopic learning for disparity estimation

Stereoscopic learning for disparity estimation

引用

IEEE International Symposium on Circuits and Systems (ISCAS)

作者： Zhebin Zhang Yizhou Wang Tingting Jiang Wen Gao National Engineering Laboratory for Video Technology Peking University Beijing China Key Laboratory of Intelligent Information Processing Institute of Computing Technology Chinese Academy and Sciences Beijing China Key Laboratory of Machine Perception (MoE) School of EECS Peking University Beijing China Peking University Beijing Beijing CN

In this paper, we propose a learning based approach to estimating pixel disparities from the motion information extracted out of input monoscopic video sequences. We represent each video frame with superpixels, and extract the motion features from the superpixels and the frame boundary. These motion features account for the motion pattern of the superpixel as well as camera motion. In the learning phase, given a pair of stereoscopic video sequences, we employ a state-of-the-art stereo matching method to compute the disparity map of each frame as ground truth. Then a multi-label SVM is trained from the estimated disparities and the corresponding motion features. In the testing phase, we use the learned SVM to predict the disparity for each superpixel in a monoscopic video sequence. Experiment results show that the proposed method achieves low error rate in disparity estimation.

关键词： Pixel Three dimensional displays Cameras Feature extraction Histograms Support vector machines Optical imaging

来源：评论

学校读者我要写书评

暂无评论

An Empirical Comparative Study on Two Large-Scale Hierarchical Text Classification Approaches

引用

International Journal of Computer Processing of Languages 2011年第4期23卷 309-325页

作者： JIAN ZHANG HAI ZHAO LIQING ZHANG BAO-LIANG LU Center for Brain-Like Computing and Machine Intelligence Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai 200240 China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems Shanghai Jiaotong University 800 Dongchuan Rd. Shanghai 200240 China Department of Computer Science Virginia Tech Blacksburg VA 24061 USA

Patent classification is a large scale hierarchical text classification (LSHTC) task. Though comprehensive comparisons, either learning algorithms or feature selection strategies, have been fully made in the text categorization field, few work was done for a LSHTC task due to high computational cost and complicated structural label characteristics. For the first time, this paper compares two popular learning frameworks, namely, hierarchical support vector machine (SVM) and k -nearest neighbor ( k -NN) that are applied to a LSHTC task. Our experimental results show that the latter outperforms the former for the LSHTC task, which is quite different from the existing results for normal text categorization tasks. In addition, this paper compares different similarity measures and ranking strategies in k -NN framework for LSHTC task. From our empirical study, conclusions can be drawn that k -NN is more appropriate for the LSHTC task than hierarchical SVM. BM25 outperforms other similarity measures and ListWeak gains a better performance than other ranking strategies. Our empirical results also indicate that using all the labels of the retrieved neighbors can remarkably improve classification performance over only using the first label of the retrieved neighbors.

关键词： Large-scale text classification hierarchical text classification text classification k -NN hierarchical SVM similarity measure ranking strategies

来源：评论

学校读者我要写书评

暂无评论

A three-stage method to find refining schedules of crude oil operations in refinery

A three-stage method to find refining schedules of crude oil...

引用

IEEE International Conference on Service Operations and Logistics, and Informatics, SOLI

作者： Naiqi Wu LiPing Bai MengChu Zhou School of Mechatronics Engineering Guangdong University of Technology Guangzhou China MoE Key Laboratory of Embedded System and Service Computing University of Tongji Shanghai China ECE New Jersey Institute of Technology Newark NJ USA

A short-term scheduling problem for crude oil operations is highly challenging. There lack efficient techniques and software tools for its solution. Our prior research shows that it may be solved in a hierarchical way. At the upper level, we find a realizable refining schedule to optimize concerned objectives. At the lower level, a detailed schedule is obtained to realize it. This work attempts to present a three-stage method to solve the the upper level problem from a control perspective. The first stage solves a linear programming problem to determine the maximal production rate. The second one solves a transportation problem to optimally assign crude oil types and volume to the distillers. The last one adjusts and sequences oil parcels. Consequently, the proposed method is computationally efficient. An industrial case study is presented to show the result.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Extracting all minimal siphons from maximal unmarked siphons in manufacturing-oriented Petri nets

Extracting all minimal siphons from maximal unmarked siphons...

引用

IEEE International Conference on Automation Science and engineering (CASE)

作者： ShouGuang Wang MengChu Zhou ChengYing Wang College of Information & Electronic Engineering Zhejiang Gongshang University Hangzhou China Department of Electrical and Computer Engineering New Jersey Institute of Technology Newark NJ USA MoE Key Laboratory of Embedded System and Service Computing Tongji University Shanghai China

Deadlock control is an important research issue in automated manufacturing systems that have a high degree of resource sharing and concurrency. Since minimal siphons are closely tied with deadlocks in Petri net models, their efficient extraction is fundamentally important. The existing methods can rapidly extract one minimal siphon given a maximal unmarked siphon that is obtained by using a mixed integer programming approach. This paper for the first time presents an extraction algorithm that can efficiently extract all minimal ones. The idea is based on the generation and use of a subnet tree structure given the places in a maximal unmarked siphon. Several Petri net models of automated manufacturing systems are used to illustrate the proposed concepts and methods.

关键词： System recovery Algorithm design and analysis Petri nets Educational institutions Manufacturing systems Software algorithms Image edge detection

来源：评论

学校读者我要写书评

暂无评论

A study of an irrelevant variability normalization based discriminative training approach for LVCSR

A study of an irrelevant variability normalization based dis...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Yu Zhang Jian Xu Zhi-Jie Yan Qiang Huo Department of Computer Science and Engineering Shanghai Jiaotong University Shanghai China MOE-Microsoft Key Laboratory for Intelligent Computing and Intelligent Systems China Microsoft Research Asia Beijing China University of Science and Technology Hefei China

This paper presents a discriminative training (DT) approach to irrelevant variability normalization (IVN) based training of feature transforms and hidden Markov models for large vocabulary continuous speech recognition. A speaker-clustering based method is used for acoustic sniffing and maximum mutual information (MMI) is used as a training criterion. Combined with unsupervised adaptation of feature transforms, the IVN-based DT approach achieves a 14.5% relative word error rate reduction over an MMI-trained baseline system on a Switchboard-1 conversational telephone speech transcription task.

关键词： Training Hidden Markov models Acoustics Transforms Speech Speech recognition Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Closed-form solution for cycle time of revisiting processes in single-arm cluster tool scheduling with atomic layer deposition

Closed-form solution for cycle time of revisiting processes ...

引用

IEEE International Conference on Networking, Sensing and Control

作者： YuXi Sun NaiQi Wu MengChu Zhou School of Mechatronics Engineering Guangdong University of Technology Guangzhou China Key Laboratory of MoE for Embedded System and Service Computing University of Tongji Shanghai China ECE Department New Jersey Institute of Technology Newark NJ USA

Atomic layer deposition (ALD) is a typical process with wafer revisiting that should be performed by cluster tools. This paper discusses the scheduling problem of single-arm cluster tools for the ALD process. In scheduling such system, the most difficult part is to schedule the revisiting process and obtain its optimal cycle time. This paper studies the revisiting process of ALD with revisiting times k = 3, 4, and 5. Analytical expressions are obtained to calculate the cycle time for the k possible schedules with k = 3, 4, and 5, respectively, so as to obtain the optimal one. In this way, the scheduling problem of such a revisiting process becomes simple and this is a significant improvement in scheduling cluster tools with wafer revisiting.

关键词： Schedules Semiconductor device modeling Robots Load modeling System recovery Color Integrated circuit modeling

来源：评论

学校读者我要写书评

暂无评论

Hybrid flexible neural tree approach for leukemia cancer classification

Hybrid flexible neural tree approach for leukemia cancer cla...

引用

World Congress on Information and Communication Technologies (WICT)

作者： Lei Zhang Yuehui Chen Ajith Abraham Zhenxiang Chen Shandong Provincial Key Laboratory of Network Based Intelligent Computing School of Information science and Engineering University of Jinan Jinan China Machine Intelligent Research Labs (MIR Labs) Scientific Network for Innovation and Research Excellence USA

In this paper, a novel method for improving flexible neural tree is proposed to classify the leukemia cancer data. The hybrid flexible neural tree with pre-defined instruction sets can be created and evolved. The structure and parameter of hybrid flexible neural tree are optimized using probabilistic incremental program evolution (PIPE) and particle swarm optimization (PSO) algorithm. The experimental results indicate that the proposed method illustrates feasible and efficient for the classifications of microarray data.

关键词： Cancer Computational modeling Gene expression Neurons Vectors Optimization Accuracy

来源：评论

学校读者我要写书评

暂无评论

Maximum Flow-Segment Based Channel Assignment and Routing in Cognitive Radio Networks

Maximum Flow-Segment Based Channel Assignment and Routing in...

引用

IEEE Conference on Vehicular Technology (VTC)

作者： Changliang Zheng Ren Ping Liu Xun Yang Iain B. Collings Zheng Zhou Eryk Dutkiewicz Key Laboratory of Universal Wireless Communications MOE Wireless Network Lab Beijing University of Posts and Telecommunications China Department of Electronic Engineering Macquarie University Sydney Australia ICT Centre Commonwealth Scientific and Industrial Research Organisation Sydney Australia

In multi-hop cognitive radio networks (CRNs), there can be dramatic increase in end-to-end delay when a traffic flow switches between a number of channels along its path. We propose a new Maximum Flow-Segment (MFS) based scheme to channel assignment in CRN by minimizing the number of times the channel is switched along a flow. Our MFS based scheme has been efficiently integrated into the AODV on-demand routing protocol. We demonstrate that our MFS based scheme reduces the number of channel switches for the traffic flows and reduces the end-to-end delay by 50%. Our scheme also minimizes the routing overhead, and achieves a higher and more stable throughput than the link based approach.

关键词： Switches Routing Delay Routing protocols Throughput Algorithm design and analysis Cognitive radio

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：