Shenyang, China

Shenyang Aerospace University , formerly known as Shenyang Institute of Aeronautical Engineering, is a comprehensive research university in Shenyang, the capital of Liaoning province in Northeast China. It educates students for supporting the military and civil aviation industries of China. Wikipedia.


Time filter

Source Type

Wu P.,Shenyang Aerospace University
Proceedings of the International Conference on Inventive Computation Technologies, ICICT 2016 | Year: 2017

In this paper, we conduct analysis on the current condition of virtual reality and the computer graphics and the applications on the digital media interaction. We proposed the systematic review of the digital media interaction modes with the theoretical analysis of the virtual reality and computer graphics. Multimedia gateway is a separate control of the entire media interaction center core components, has the media docking and adaptation, multimedia intelligent routing, configuration and management, and other functions and at the center of the centralized control of all media interaction, the configuration and management of multimedia intelligent routing. With this basis, we integrate the 3D reconstruction methodology to propose the new perspective of the digital media interaction paradigm. The man-machine interface design principles should include the basic principles of general interface design, analysis and man-machine interface specification and the type of interface requirements. Our review summarizes the characteristics of the method well and in the future, the VR integration with the multimedia system and optimized re-construction method and image representation algorithms will be considered.


Wang J.-B.,Shenyang Aerospace University | Wang J.-J.,Dalian University of Technology
Computers and Operations Research | Year: 2014

This paper investigates flowshop scheduling problems with a general exponential learning effect, i.e., the actual processing time of a job is defined by an exponent function of the total weighted normal processing time of the already processed jobs and its position in a sequence, where the weight is a position-dependent weight. The objective is to minimize the makespan, the total (weighted) completion time, the total weighted discounted completion time, and the sum of the quadratic job completion times, respectively. Several simple heuristic algorithms are proposed in this paper by using the optimal schedules for the corresponding single machine problems. The tight worst-case bound of these heuristic algorithms is also given. Two well-known heuristics are also proposed for the flowshop scheduling with a general exponential learning effect. © 2013 Published by Elsevier Ltd.


Wang J.-B.,Shenyang Aerospace University | Wang J.-J.,Dalian University of Technology
Information Sciences | Year: 2014

In this paper we investigate a single machine scheduling problem with time dependent processing times and group technology (GT) assumption. By time dependent processing times and group technology assumption, we mean that the group setup times and job processing times are both increasing functions of their starting times, i.e., group setup times and job processing times are both described by function which is proportional to a linear function of time. We attempt to minimize the makespan with ready times of the jobs. We show that the problem can be solved in polynomial time when start time dependent processing times and group technology are considered simultaneously. © 2014 Elsevier Inc. All rights reserved.


Wang J.-B.,Shenyang Aerospace University | Wang M.-Z.,Dalian University of Technology
Computers and Operations Research | Year: 2012

In this paper, we consider single-machine scheduling problem in which processing time of a job is described by a convex decreasing resource consumption function. The objective is to minimize the total amount of resource consumed subject to a constraint on total weighted flow time. The optimal resource allocation is obtained for any arbitrary job sequence. The computational complexity of the general problem remains an open question, but we present and analyze some special cases that are solvable by using polynomial time algorithms. For the general problem, several dominance properties and some lower bounds are derived, which are used to speed up the elimination process of a branch-and-bound algorithm proposed to solve the problem. A heuristic algorithm is also proposed, which is shown by computational experiments to perform effectively and efficiently in obtaining near-optimal solutions. The results show that the average percentage error of the proposed heuristic algorithm from optimal solutions is less than 3%. © 2011 Elsevier Ltd. All rights reserved.


Wang J.-B.,Shenyang Aerospace University | Wang M.-Z.,Dalian University of Technology
Computers and Operations Research | Year: 2013

In this paper, a three-machine permutation flow shop scheduling problem with time-dependent processing times is considered. By the time-dependent processing times we mean that the jobs processing time is an increasing function of its starting time. The objective is to find a sequence that minimizes the makespan. This problem is well known to be NP-hard. Several dominance properties and a lower bound are derived to speed up the elimination process of a branch-and-bound algorithm. Moreover, two heuristic algorithms are proposed to overcome the inefficiency of the branch-and-bound algorithm. Computational experiments on randomly generated problems are conducted to evaluate the branch-and-bound algorithm and heuristic algorithm. Computational results show that the proposed heuristic algorithm M-NEH perform effectively and efficiently. © 2012 Elsevier Ltd. All rights reserved.


Li D.,Shenyang Aerospace University
Applied Mechanics and Materials | Year: 2013

A new mobile information environment has been gradually formed with the rapid development of the computer network technology in the world. In this environment, the mobile information service in the university library is able to meet the changing need of readers for the specific information online and need not visit libraries. The potential demand, opportunities and challenges of the mobile information service in the university library are analyzed respectively. At last, some advices are proposed to provide a better mobile information service in order to meet readers' need for information in today's society. © (2013) Trans Tech Publications, Switzerland.


Xiang S.,Shenyang Aerospace University | Kang G.-W.,Shenyang Aerospace University
European Journal of Mechanics, A/Solids | Year: 2013

This paper focus on the bending analysis of functionally graded plates by a nth-order shear deformation theory and meshless global collocation method based on the thin plate spline radial basis function. Reddy's third-order theory can be considered as a special case of present nth-order theory (n = 3). The governing equations are derived by the principle of virtual work. The displacement and stress of a simply supported functionally graded plate under sinusoidal load are calculated to verify the accuracy and efficiency of the present theory. © 2012 Elsevier Masson SAS. All rights reserved.


Li D.,Shenyang Aerospace University
Applied Mechanics and Materials | Year: 2014

In today's information age, how to effectively acquire knowledge is now a prerequisite for success in life. The conception and features of the knowledge service of university library are discussed firstly, and then the problems and development hindrances are also indicated on the basis of the network environment. Therefore, how to meet the requirement of the era becomes a challenge for the information service of university library. Some suggests are made to set up a scaffold in order to strengthen the information exchange and enhance the knowledge services level of university library by the application of the network communication tools. © (2014) Trans Tech Publications, Switzerland.


Wang D.,Shenyang Aerospace University
WIT Transactions on Information and Communication Technologies | Year: 2014

This note deals with a scheduling problem jobs with group technology, deteriorating jobs, and learning effect on a single machine. The setup time of a group is a function of its resource allocation, and the processing time of a job is a function of its starting time and its position in a sequence. We show that some results are incorrect in recent paper [1] by counter-examples, and we also provide corrected results. © 2014 WIT Press.


Qu L.,Shenyang Aerospace University | Yang T.,Shenyang Aerospace University
IEEE Transactions on Geoscience and Remote Sensing | Year: 2012

For stepped frequency continuous wave ground penetrating radar (SFCW GPR), the image of buried targets is usually reconstructed by a combination of point-like scatters whose number is much smaller than that of pixels of target space image. The intrinsic sparseness of target space offers a migration imaging method to make the high-quality image of underground region based on compressive sensing (CS) theory. In this paper, the effects of air/ground interface and antenna beamwidth on CS-based SFCW GPR migration imaging are presented and analyzed. It is shown that the presence of the strong air/ground interface reflection and finite antenna beamwidth usually challenges the robust CS migration imaging algorithm in practice. To overcome this problem in the context of CS migration imaging, an improved CS migration imaging method for SFCW GPR system is proposed in this paper. Experimental results show that the approach is robust to deliver a high-quality image of underground region. © 2012 IEEE.

Loading Shenyang Aerospace University collaborators
Loading Shenyang Aerospace University collaborators