Automatically Generated of Large Sports Games Voluntee Management Enlightenment

Abstract:

Volunteer management is large sports games get a key element of success. This article through the literature data method, interview method and logical analysis, the characteristics of volunteers and the particularity of the large sports games was analyzed, With the success of Beijing Olympic Games volunteer management experience, put forward the large sports games volunteer management should stick to effective recruitment, multiple training, it is with the person this, dynamic adjustment, Multidimensional incentive, meet the demand, mutual equality, unity cooperation principle, with its large sporting events for the future volunteer management to provide the beneficial reference.

• Periodical: Applied Mechanics and Materials (Volumes 321-324)
• Pages: 2583-2586
• DOI: https://doi.org/10.4028/www.scientific.net/AMM.321-324.2583
• Online since: June 2013
• Authors: Yan Ling Dong, Qiang Ji
• Keywords: Beijing Olympic Games, Enlightenment, Large Sports Games, Volunteer Management

References

[1] Zhang Yichuan, Miao Qiang, Zhu Xi-and so on. pedestrian head impact the applicability of sub-model [J]. Automotive Engineering, 2010, 32 (3): 223-227.

[2] Greg Welch, Gary Bishop. An Introduction to the Kalman Filter[C]. SIGGRAPH 2001.

[3] Zhang Kai, Chen is Ling, Yue Guohui. Great for a car to improve pedestrian protection analysis [J]. Automotive Engineering, 2008, 30 (11): 975-978.

[4] Rikard Fredriksson, Yngve Håland, Jikuang Yang. Evaluation of A New Pedestrian Head Injury Protection System With A Sensor In The Bumper And Lifting Of The Bonnet's Rear Edge[C]. Proceedings of the 17th International Conference on the Enhanced Safety of Vehicles (ESV), Amsterdam, Holland, June 4-7, 2001.

[5] Xiang-Rong Li, Wang Kai and so on. Car hood for pedestrian protection safety of children in simulation [J]. Automotive Engineering, 2010, 32 (1): 56-59.

[6] Yong tae Jun. A piecewise hole filling algorithm in reverse engineering[J]. Computer-Aided Design, 37 (2005): 263-270.

DOI: 10.1016/j.cad.2004.06.012

[7] N.C. Gabrielidesa, A.I. Ginnisa, P.D. Kaklisa. G1-smooth branching surface construction from cross sections[J]. Computer-Aided Design, 2007 (39): 639-651.

DOI: 10.1016/j.cad.2007.05.004

[8] Yi-Jun Yang, Jun-Hai Yong, Hui Zhang. A rational extension of Piegl's method for flling n-sided holes[J]. Computer-Aided Design,2006 (38):1166-1178.

DOI: 10.1016/j.cad.2006.07.001

[9] Cheng Pengfei, Yan Haowen, HanZhenhui. An Algorithm for Computing the Minimum Area Bounding Rectangle of an Arbitrary Polygon[J]. Journal of Engineering Graphics, 2008(1) :122-126.

[10] Vera Rayevskaya, Larry L. Multi-sided macro-element spaces based on Clough–Tocher triangle splits with applications to hole filling[J].Computer Aided Geometric Design, 22 (2005): 57-79.

DOI: 10.1016/j.cagd.2004.09.001

[11] Wang Jian-ning, Manuel M. Filling holes on locally smooth surfaces reconstructed from point clouds[J]. Image and Vision Computing, 25 (2007): 103-113.

DOI: 10.1016/j.imavis.2005.12.006

[12] Yong tae Jun. A piecewise hole filling algorithm in reverse engineering[J]. Computer-Aided Design, 37 (2005): 263-270.

DOI: 10.1016/j.cad.2004.06.012