类别不平衡的多任务人脸属性识别

属性的识别对物体的识别起到了比较重要的作用,例如人脸验证和场景识别。提高属性的识别率对后面基于属性特征的应用的正确率有很大的影响。近些年来,有些工作也开始关注于属性的学习,而很多的工作都是基于属性之间独立的假设,但在实际中很多的属性都是强相关的,例如没有胡子和女性,光头和头发的颜色;很多的工作忽略了类别之间的不平衡性,例如光头的样本比例可能只占样本的很小一部分。基于这2个观察,本文提出一种基于多任务的类别不平衡的人脸属性识别网络架构,该网络结构是由Densenet修改而来。该方法比以往的方法效果要好,一定程度上缓解了不平衡问题,且参数少,计算效率更高,在公开人脸属性数据集CelebA和LFWA上的实验验证了该方法的有效性。     

基于能效的异构无线网络资源分配与切换调度机制研究

【】：为了能够有效提高系统的能效,本文就提出了基于能效的资源分配机切换调度机制。首先通过微基站睡眠集中式的切换调度算法,实现用户关联基站的确定,集中式切换调度算法能够使微基站中的用户到宏基站中切换,从而降低功能消耗,对微基站睡眠准则进行有效的判断。之后基站使用以最优信道质量子载波分配调整算法实现传输功率及子载波的分配,此算法利用最大调整实现最小及最大能效用户子载波的分配,从而使网络能够接近于最优解。通过实验仿真及理论分析可以看出来,和其他的算法相对比,本文所研究的基于能效资源分配及切换调度机制算法具有较高的复杂度,但是能够有效降低网络功能消耗,提高网络速度。通过实验结果表示,基于能效的资源分配及切换调度机制能够实现异构网络能源消耗的有效提高。     

MFR (Multipurpose Field Robot) for installing construction materials

The objective of the study was to propose a MFR (Multipurpose Field Robot) in hazardous operation environments. This system combines a basic system composed of a multi-DOF (Degree Of Freedom) manipulator and a mobile platform with an additional module for construction, national defense and emergency-rescue. According to an additional module type combined with a basic system, it can be used in a various fields. In this study, we describe a prototype of construction robot which helps a human operator handle easily construction materials in case of using the cooperation system on construction site. This study introduces an additional module for construction and a robot control algorithm for a HRC (Human-Robot Cooperation). In addition, it proposes a novel construction method to install construction materials with robot on construction site. Seung Yeol Lee received the B.S. degree from the Department of Mechanical Engineering, Myungji University, Seoul, Korea in 2002, and the M.S. degree from the Department of Mechatronics Engineering, Hanyang University, Seoul, Korea in 2005. He is a Ph.D. degree candidate from the Department of Mechanical Engineering, Hanyang University, Seoul, Korea. From 2003, He is currently a visiting researcher in the Research Institute of Technology, Construction Group at the Samsung Corporation, Korea conducting the design and implementation of construction robot and automation system for construction project. His research interests include design, control, and application of construction robots, field robotic systems and ergonomic design of robotic systems. He is a member of the Korea Society of Mechanical Engineers, Architectural Institute of Korea, and Ergonomics Society of Korea. Yong Seok Lee received the B.S. degree from the Department of Precision Mechanical Engineering, Kunsan national University, Kunsan, Korea in 2002, and the M.S. degree from the Department of Precision Mechanical Engineering, Hanyang University, Seoul, Korea in 2005. Currently, he is the Post Master in Hanyang University, Korea. His major interests include design and kinematic/dynamic analysis on multi-purpose field robots and service robots. He is a member of the Architectural Institute of Korea. Bum Seok Park received the B.S. degree from the Department of Mechanical Engineering, Hanyang University, Ansan, Kyung-gi Do, Korea in 1993, and the M.S. degree from the Department of Mechatronics Engineering, Hanyang University, Seoul, Korea in 1998. He is a Ph.D. from the Department of Mechatronics System Engineering, Hanyang University, Seoul, Korea From 2006. He is currently the post-doctor in Hanyang University, Korea. His major interests include embedded robot control system on multi-purpose field robot and service robot. He is a member of the Korea Society of Mechanical Engineers, Korean Society of Machine Tool Engineers. Sang Heon Lee graduated with the B.S. degree in Precision Mechanical Engineering from Hanyang University, Seoul, Korea in 1992. He received the M.S. degree in Precision Engineering from KAIST, Taejon, Korea in 1994 and the Ph.D. degree in Mechanical Engineering from KAIST in 2001. Currently, he is a senior researcher in Samsung Corporation, Korea. His major interests include the kinematic/dynamic analysis on multi-body system, application of field robots, and automation in construction. ChangSoo Han received the B.S. degree from the Department of Mechanical Engineering, Seoul National University Technology, Seoul, Korea in 1983, and the M.S. and Ph.D. degrees from the Department of Mechanical Engineering, University of Texas at Austin, in 1985 and 1989, respectively. From May 1988 to September 1989, he was a Research Assistant, Robotics Lab in Mechanical Engineering about manufacturing of the high resolution micro manipulator module. In March 1990, he joined Hanyang University, Ansan, Kyungki-Do, Korea as a Professor, Department of Mechanical Engineering. From March 1993 to February 1995, he was a Vice President, The Research Institute of Engineering & Technology of the Hanyang University. From August 1996 to July 1997, he was a Visiting Professor, Univ. of California at Berkeley. From September 1997 to February 1999, he was a Director, Hanyang Business Incubator. In August 2000, he joined a Branch President, The Korean Society of Mechanical Engineers. In January 2002, he joined a Committee Member, The Korean Society of Mechanical Engineers. From January 2001 to December 2001, he was an International Cooperation Director, The Institute of Control, Automation and Systems, Korea. His research interests include design, control, and application of robot, automation systems, and advanced vehicle.     

Book Reviews

Books reviewed:
Donnelly, Daniel. Web Design: The Next Generation
Hege, H.-C. and Polthier, K. (editors). Visualization and Mathematics
Gibson, J. D., Berger, T., Lookabaugh, T., Lindbergh, D. andBaker, R. L. Digital Compression for Multimedia
Morgan, Don. Numerical Methods For DSP Systems in C
Wainer, Howard. Visual Revelations: Graphical Tales of Fate and Deception from Napoleon Bonaparte to Ross Perot
Maestri, George. Digital Character Animation
Klimek, Grazyna and Klimek, Maciej. Discovering Curves and Surfaces with Maple
Trappl, Robert and Petta, Paolo (editors). Creating Personalities for Synthetic Actors
Lohmann, Gabriele. Volumetric Image Analysis
Meinhardt, Hans. The Algorithmic Beauty of Sea Shells (2nd Edition)
Palanque, Philippe and Paterno, Fabio (editors) Formal Methods in Human-Computer Interaction
Dai, Fan (editor). Virtual Reality for Industrial Applications     

Comparison of computational approaches for predicting the effects of missense mutations on p53 function

We applied our recently developed kinetic computational mutagenesis (KCM) approach [L.T. Chong, W.C. Swope, J.W. Pitera, V.S. Pande, Kinetic computational alanine scanning: application to p53 oligomerization, J. Mol. Biol. 357 (3) (2006) 1039–1049] along with the MM-GBSA approach [J. Srinivasan, T.E. Cheatham 3rd, P. Cieplak, P.A. Kollman, D.A. Case, Continuum solvent studies of the stability of DNA, RNA, and phosphoramidate-DNA helices, J. Am. Chem. Soc. 120 (37) (1998) 9401–9409; P.A. Kollman, I. Massova, C.M. Reyes, B. Kuhn, S. Huo, L.T. Chong, M. Lee, T. Lee, Y. Duan, W. Wang, O. Donini, P. Cieplak, J. Srinivasan, D.A. Case, T.E. Cheatham 3rd., Calculating structures and free energies of complex molecules: combining molecular mechanics and continuum models, Acc. Chem. Res. 33 (12) (2000) 889–897] to evaluate the effects of all possible missense mutations on dimerization of the oligomerization domain (residues 326–355) of tumor suppressor p53. The true positive and true negative rates for KCM are comparable (within 5%) to those of MM-GBSA, although MM-GBSA is much less computationally intensive when it is applied to a single energy-minimized configuration per mutant dimer. The potential advantage of KCM is that it can be used to directly examine the kinetic effects of mutations.     

The DenK-architecture: A fundamental approach to user-interfaces

In this paper we present the basic principles underlying the DenK-system, a generic cooperative interface combining linguistic and visual interaction. The system integrates results from fundamental research in knowledge representation, communication, natural language semantics and pragmatics, and object-oriented animation. Our design incorporates a cooperative and knowledgeable electronic assistant that communicates with a user in natural language, and an application domain, which is presented visually. The assistant, that we call thecooperator, has an information state that is represented in a rich form of Type Theory, a formalism that enables us to model the inherent cognitive dynamics of a dialogue participant. Pragmatic issues in man-machine interaction, concerning the use of natural language and knowledge in cooperative communication, are central to our approach.Authors' addresses: R. M. C. Ahn and H. C. Bunt, Institute for Language Technology and Artificial Intelligence (ITK), Tilburg University, P.O. Box 90153, 5000 LE Tilburg, The Netherlands, e-mail: r.m.c.ahn@kub.nl, h.c.bunt@kub.nl; R. J. Beun, Institute for Perception Research (IPO), P.O. Box 513, 5600 MB Eindhoven, The Netherlands, e-mail: rjbeun@prl.philips.nl; T. Borghuis and C. W. A. M. van Overveld, Eindhoven University of Technology, Den Dolech 2, Eindhoven, The Netherlands, e-mail: tijn@win.tue.nl, wsinkvo@info.win.tue.nl.     

Pruning boosted classifiers with a real valued genetic algorithm

Ensemble classifiers and algorithms for learning ensembles have recently received a great deal of attention in the machine learning literature (R.E. Schapire, Machine Learning 5(2) (1990) 197–227;N. Cesa-Bianchi, Y. Freund, D. Haussler, D.P. Helbold, R.E. Schapire, M.K. Warmuth, Proceedings of the 25th Annual ACM Symposium on the Theory of Computing, 1993, pp. 382–391; L. Breiman, Bias, Technical Report 460, Statistics Department, University of California, Berkeley, CA, 1996; J.R. Quinlan, Proceedings of the 14th International Conference on Machine Learning, Italy, 1997; Y. Freund, R.E. Schapire, Proceedings of the 13th International Conference on Machine Learning ICML96, Bari, Italy 1996, pp. 148–157; A.J.C. Sharkey, N.E. Sharkey, Combining diverse neural nets, The Knowledge Engineering Review 12 (3) (1997) 231–247). In particular, boosting has received a great deal of attention as a mechanism by which an ensemble of classifiers that has a better generalisation characteristic than any single classifier derived using a particular technique can be discovered. In this article, we examine and compare a number of techniques for pruning a classifier ensemble which is overfit on its training set and find that a real valued GA is at least as good as the best heuristic search algorithm for choosing an ensemble weighting.     

CSP-CASL—A new integration of process algebra and algebraic specification

CSP–CASL integrates the process algebra CSP [T. Hoare, Communicating Sequential Processes, Prentice-Hall, Englewood cliffs, NJ, 1985; A.W. Roscoe, The Theory and Practice of Concurrency, Prentice-Hall, Englewood cliffs, NJ, 1998] with the algebraic specification language CASL [P.D. Mosses (Ed.), CASL Reference Manual, Lecture Notes in Computer Science, Vol. 2960, Springer, Berlin, 2004; E. Astesiano, M. Bidoit, B. Krieg-Brückner, H. Kirchner, P.D. Mosses, D. Sannella, A. Tarlecki, CASL—the common algebraic specification language, Theoret. Comput. Sci. 286 (2002) 153–196]. Its novel aspects include the combination of denotational semantics in the process part and, in particular, loose semantics for the data types covering both concepts of partiality and sub-sorting. Technically, this integration involves the development of a new so-called data-logic formulated as an institution. This data-logic serves as a link between the institution underlying CASL and the alphabet of communications necessary for the CSP semantics. Besides being generic in the various denotational CSP semantics, this construction leads also to an appropriate notion of refinement with clear relations to both data refinement in CASL and process refinement in CSP.     

Integration | Innovation | Inclusion: Values,Variables and the Design of Human Environments

Complexity, complication, contradiction, consumption, confusion, delusion, depression. Opportunity, inspiration, ingenuity, compassion, wisdom. Our world is perplexing, our times are fast moving, and our choices are many. To find an appropriate path is a daunting yet vital challenge that confronts us as individuals, as communities, and as a civilization. How sustainable is our world? How reasonable are our behaviors? The present article is a collection of thoughts on a series of intertwined issues related to the contemporary world, its environmental dimensions, and their present-day problems. The goal is to survey the landscape through a lens of Environmental Design, to provide some perspectives, to raise some questions, and to explore systems, beliefs, and values informing and influencing actions. It is important to consider how people's belief systems influence, inform, and shape actions. This holds true in realms political, spiritual, and cultural. It also proves relevant in the ways in which we imagine, design, develop, and construct our buildings, cities, spaces, and places.

Appropriate solutions to some of our most daunting problems will arise through the concerted efforts, open dialogue, and collective wisdom of the wide array of stakeholders, professionals, politicians, decision makers, and citizens (both engaged and disenfranchised) who have the will and wherewithal to make a difference and to make the world safer, healthier, and better. It seems vital for us to critically examine, and question, our belief systems and their connections to the ways we define, refine, and realize progress. Architecture and Environmental Design, in both a philosophical and a practical sense, reflect as well as form greater aspirations, directions, and events of our times.     

On The Edge Geodetic Number Of A Graph

Many graph-theoretic concepts have both vertex and edge versions. Examples are cut-vertex , cut-edge , vertex-integrity ( integrity ), edge-integrity , vertex coloring , edge coloring , and vertex-connectivity , edge-connectivity . Frank Harary et al. defined the geodetic number of a graph for vertices in [Chartrand, G., Harary, F. and Zhang, P. (2002). On the geodetic number of a graph. Networks , 39 , 1-6; Chartrand, G., Harary, F. and Zhang, P. (2000). Geodetic sets in graphs. Discussions Mathematicae Graph Theory , 20 , 129-138; Harary, F., Loukakis, E. and Tsours, C. (1993). The geodetic number of a graph. Mathl. Comput. Modelling , 17 (11), 89-93]. In this study we give a definition of the edge geodetic number for a graph and derive some results.     

RFRCDB-siRNA: improved design of siRNAs by random forest regression model coupled with database searching

Although the observations concerning the factors which influence the siRNA efficacy give clues to the mechanism of RNAi, the quantitative prediction of the siRNA efficacy is still a challenge task. In this paper, we introduced a novel non-linear regression method: random forest regression (RFR), to quantitatively estimate siRNAs efficacy values. Compared with an alternative machine learning regression algorithm, support vector machine regression (SVR) and four other score-based algorithms [A. Reynolds, D. Leake, Q. Boese, S. Scaringe, W.S. Marshall, A. Khvorova, Rational siRNA design for RNA interference, Nat. Biotechnol. 22 (2004) 326-330; K. Ui-Tei, Y. Naito, F. Takahashi, T. Haraguchi, H. Ohki-Hamazaki, A. Juni, R. Ueda, K. Saigo, Guidelines for the selection of highly effective siRNA sequences for mammalian and chick RNA interference, Nucleic Acids Res. 32 (2004) 936-948; A.C. Hsieh, R. Bo, J. Manola, F. Vazquez, O. Bare, A. Khvorova, S. Scaringe, W.R. Sellers, A library of siRNA duplexes targeting the phosphoinositide 3-kinase pathway: determinants of gene silencing for use in cell-based screens, Nucleic Acids Res. 32 (2004) 893-901; M. Amarzguioui, H. Prydz, An algorithm for selection of functional siRNA sequences, Biochem. Biophys. Res. Commun. 316 (2004) 1050-1058) our RFR model achieved the best performance of all. A web-server, RFRCDB-siRNA (http://www.bioinf.seu.edu.cn/siRNA/index.htm), has been developed. RFRCDB-siRNA consists of two modules: a siRNA-centric database and a RFR prediction system. RFRCDB-siRNA works as follows: (1) Instead of directly predicting the gene silencing activity of siRNAs, the service takes these siRNAs as queries to search against the siRNA-centric database. The matched sequences with the exceeding the user defined functionality value threshold are kept. (2) The mismatched sequences are then processed into the RFR prediction system for further analysis.     

Design and analysis of the Dual-Torus Network

In this paper, we propose a new topology called theDual Torus Network (DTN) which is constructed by adding interleaved edges to a torus. The DTN has many advantages over meshes and tori such as better extendibility, smaller diameter, higher bisection width, and robust link connectivity. The most important property of the DTN is that it can be partitioned into sub-tori of different sizes. This is not possible for mesh and torus-based systems. The DTN is investigated with respect to allocation, embedding, and fault-tolerant embedding. It is shown that the sub-torus allocation problem in the DTN reduces to the sub-mesh allocation problem in the torus. With respect to embedding, it is shown that a topology that can be embedded into a mesh with dilation δ can also be embedded into the DTN with less dilation. In fault-tolerant embedding, a fault-tolerant embedding method based on rotation, column insertion, and column skip is proposed. This method can embed any rectangular grid into its optimal square DTN when the number of faulty nodes is fewer than the number of unused nodes. In conclusion, the DTN is a scalable topology well-suited for massively parallel computation. Sang-Ho Chae, M.S.: He received the B.S. in the Computer Science and Engineering from the Pohang University of Science and Technology (POSTECH) in 1994, and the M.E. in 1996. Since 1996, he works as an Associate Research Engineer in the Central R&D Center of the SK Telecom Co. Ltd. He took part in developing SK Telecom Short Message Server whose subscribers are now over 3.5 million and Advanced Paging System in which he designed and implemented high availability concepts. His research interests are the Fault Tolerance, Parallel Processing, and Parallel Topolgies. Jong Kim, Ph.D.: He received the B.S. degree in Electronic Engineering from Hanyang University, Seoul, Korea, in 1981, the M.S. degree in Computer Science from the Korea Advanced Institute of Science and Technology, Seoul, Korea, in 1983, and the Ph.D. degree in Computer Engineering from Pennsylvania State University, U.S.A., in 1991. He is currently an Associate Professor in the Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea. Prior to this appointment, he was a research fellow in the Real-Time Computing Laboratory of the Department of Electrical Engineering and Computer Science at the University of Michigan from 1991 to 1992. From 1983 to 1986, he was a System Engineer in the Korea Securities Computer Corporation, Seoul, Korea. His major areas of interest are Fault-Tolerant Computing, Performance Evaluation, and Parallel and Distributed Computing. Sung Je Hong, Ph.D.: He received the B.S. degree in Electronics Engineering from Seoul National University, Korea, in 1973, the M.S. degree in Computer Science from Iowa State University, Ames, U.S.A., in 1979, and the Ph.D. degree in Computer Science from the University of Illinois, Urbana, U.S.A., in 1983. He is currently a Professor in the Department of Computer Science and Engineering, Pohang University of Science and Technology, Pohang, Korea. From 1983 to 1989, he was a staff member of Corporate Research and Development, General Electric Company, Schenectady, NY, U.S.A. From 1975 to 1976, he was with Oriental Computer Engineering, Korea, as a Logic Design Engineer. His current research interest includes VLSI Design, CAD Algorithms, Testing, and Parallel Processing. Sunggu Lee, Ph.D.: He received the B.S.E.E. degree with highest distinction from the University of Kansas, Lawrence, in 1985 and the M.S.E. and Ph.D. degrees from the University of Michigan, Ann Arbor, in 1987 and 1990, respectively. He is currently an Associate Professor in the Department of Electronic and Electrical Engineering at the Pohang University of Science and Technology (POSTECH), Pohang, Korea. Prior to this appointment, he was an Associate Professor in the Department of Electrical Engineering at the University of Delaware in Newark, Delaware, U.S.A. From June 1997 to July 1998, he spent one year as a Visiting Scientist at the IBM T. J. Watson Research Center. His research interests are in Parallel, Distributed, and Fault-Tolerant Computing. Currently, his main research focus is on the high-level and low-level aspects of Inter-Processor Communications for Parallel Computers.     

An LMI approach to robust reduced-order H ∞ filter design for polytopic uncertain systems

This paper proposes a method for robust reduced-order H _∞ filter design for polytopic uncertain systems, using linear matrix inequalities (LMIs). Sufficient LMI conditions for both robust full- and reduced-order H _∞ filter design are derived. Convex optimization problems are formulated and solved to obtain optimal H _∞ filters by using the resulting LMI conditions. The resulting conditions do not involve any non-convex rank constraints, and thus the proposed method for H _∞ filter design guarantees global optimum solutions. Numerical examples are presented to show the effectiveness of the proposed method. Recommended by Editorial Board member Huanshui Zhang under the direction of Editor Young Il Lee. This work was supported by the Brain Korea 21 Project and the Basic Research Program of the Korea Science and Engineering Foundation under grant R01-2006-000-11373-0. Hyoun-Chul Choi received the B.S., M.S., and Ph.D. degrees in Control and Instrumentation Engineering from Ajou University, Suwon, Korea, in 1995, 1997, and 2006, respectively. He was a Visiting Researcher at Griffith University, Brisbane, Australia, from 2001 to 2002, and a Postdoctoral researcher at Ajou University, Suwon, Korea, from 2006 to 2007. Since 2008, he has been with ASRI, School of Electrical Engineering and Computer Science, Seoul National University, Seoul, Korea, where he is currently a Postdoctoral Researcher. His research interests include LMI-based control, optimal and robust control, network-based control, and mechatronics. Dongkyoung Chwa received the B.S. and M.S. degrees from the Department of Control and Instrumentation Engineering in 1995 and 1997, respectively, and the Ph.D. degree from the School of Electrical and Computer Engineering in 2001, all from Seoul National University, Seoul, Korea. From 2001 to 2003, he was a Postdoctoral Researcher with Seoul National University. In 2003, he was a Visiting Research Fellow at The University of New South Wales, Australian Defence Force Academy, and was the Honorary Visiting Academic at the University of Melbourne, Melbourne, Australia. In 2004, he was a BK21 Assistant Professor with Seoul National University. Since 2005, he has been an Assistant Professor with the Department of Electrical and Computer Engineering, Ajou University, Suwon, Korea. His research interests are nonlinear, robust, and adaptive control theories and their applications to the robotics, underactuated systems including wheeled mobile robots, underactuated ships, cranes, and guidance and control of flight systems. Suk-Kyo Hong received the B.S., M.S., and Ph.D. degrees in Electrical Engineering from Seoul National University, Seoul, Korea, in 1971, 1973, and 1981, respectively. His major graduate research works were centered on speed control of induction motors. He was an Exchange Professor at Rensselaer Polytechnic Institute, Troy, NY, from 1982 to 1983, and at the Institut National de Recherche en Informatique et en Automatique, France, from 1988 to 1989. He has been with the faculty of the Department of Electrical and Computer Engineering, Ajou University, Suwon, Korea, since 1976, and was a Visiting Professor at Griffith University, Australia, in 2001 and 2002. His current research interests include robust robot control, microprocessor applications, factory automation, and computer integrated manufacturing.     

区域网络中异构数据库存储复制技术

传统异构数据库存储复制技术只注重数据安全性,忽略了异构数据库存储复制的时效性与可靠性。为此,本文提出一种新的区域网络异构数据库存储复制技术。首先构建区域网络中异构数据库存储框架,通过定向随机游走方法对电力企业灾备中心异构数据进行存储,依据多叉索引树对异构数据库中的数据进行查询处理。然后采用一致性树分布备份技术对本地灾备中心数据进行备份,把待恢复数据分割成若干部分,通过若干差异远程备份服务器实现数据恢复。将所提技术应用于电力企业灾备中心,结果表明,所提技术有很高的存储、复制及备份恢复性能。     

基于改进PSO算法的加热系统分数阶控制

针对分数阶加热系统,提出一种基于改进粒子群优化算法的分数阶PIλDμ控制方法。首先,将细菌趋化行为机制引入带收缩因子的粒子群优化算法中,解决粒子群优化算法中由于只存在吸引操作没有排斥操作导致种群多样性失去的问题,从而避免PSO早熟收敛及陷入局部最优;然后使用改进PSO算法优化分数阶PIλDμ控制器的参数;最后,以加热系统为被控对象,分别采用改进粒子群优化算法、标准粒子群优化算法、遗传算法优化分数阶PIλDμ控制器的参数。仿真结果表明,使用该改进算法整定分数阶PIλDμ控制器参数,控制器能有效地抑制模型参数的摄动,系统鲁棒性更强。     

Global stabilization of discrete-time homogeneous systems

The feedback stabilization of continuous time Δ^r-homogeneous systems has been studied by several authors, see for instance (Dayawansa and Martin, Proceedings of the 28th C.D.C., Tampa, Florida, December, 1989, Hermes, J. Differential Equations 92 (1991) 76–89, Hermes, Systems Control Lett. 24 (1995) 7–11, Kawski, Proceedings of the 27th C.D.C., Texas, 1988, Texas, Kawski, Control Theory and Advanced Technology, vol. 6, MITA Press, Tokyo, 1996, pp. 497–516, Sepulchre and Aeyels, Math. Control Signal Systems 9 (1996) 34–58). In (Kawski, Analysis of Controlled Dynamical Systems, Birkhauser, Basel, 1991, Kawski, Proceedings of IFAC NOLCOS, 1995), Kawski gave an intrinsic concept of homogeneity with respect to general smooth dilations. In this note, we define the homogeneity of transition maps w.r.t. continuous dilations and we show how one can construct a global stabilizing feedback control for discrete-time homogeneous systems which are locally asymptotically stabilizable.     

基于木马的黑客攻击技术

木马程序一般分为客户端程序和服务端程序两部分,客户端程序用于远程控制计算机。而服务端程序,则隐藏到远程计算机中,接收并执行客户端程序发出的命令。本文首先介绍了木马的定义,功能和特点,其次介绍了木马的常见植入技术,包括网站挂马,发送超级链接,电子邮件,缓冲区溢出,和其它病毒形态相结合五种。再次阐述了木马的自启动技术,然后是木马的隐藏技术,包括文件隐藏,进程隐藏和通信隐藏。最后是木马的免杀技术,主要包括加壳,修改特征码和加花指令。     

Comparison of computational approaches for predicting the effects of missense mutations on p53 function

We applied our recently developed kinetic computational mutagenesis (KCM) approach [L.T. Chong, W.C. Swope, J.W. Pitera, V.S. Pande, Kinetic computational alanine scanning: application to p53 oligomerization, J. Mol. Biol. 357 (3) (2006) 1039–1049] along with the MM-GBSA approach [J. Srinivasan, T.E. Cheatham 3rd, P. Cieplak, P.A. Kollman, D.A. Case, Continuum solvent studies of the stability of DNA, RNA, and phosphoramidate-DNA helices, J. Am. Chem. Soc. 120 (37) (1998) 9401–9409; P.A. Kollman, I. Massova, C.M. Reyes, B. Kuhn, S. Huo, L.T. Chong, M. Lee, T. Lee, Y. Duan, W. Wang, O. Donini, P. Cieplak, J. Srinivasan, D.A. Case, T.E. Cheatham 3rd., Calculating structures and free energies of complex molecules: combining molecular mechanics and continuum models, Acc. Chem. Res. 33 (12) (2000) 889–897] to evaluate the effects of all possible missense mutations on dimerization of the oligomerization domain (residues 326–355) of tumor suppressor p53. The true positive and true negative rates for KCM are comparable (within 5%) to those of MM-GBSA, although MM-GBSA is much less computationally intensive when it is applied to a single energy-minimized configuration per mutant dimer. The potential advantage of KCM is that it can be used to directly examine the kinetic effects of mutations.     

QCDgrid: A Grid Resource for Quantum Chromodynamics

Quantum Chromodynamics (QCD) is an application area that requires access to large supercomputing resources and generates large amounts of raw data. The UK's national lattice QCD collaboration UKQCD currently stores and requires access to around five Tbytes of data, a figure that is growing dramatically as the collaboration's purpose built supercomputing system, QCDOC [P.A. Boyle, D. Chen, N.H. Christ, M. Clark, S.D. Cohen, C. Cristian, Z. Dong, A. Gara, B. Joo, C. Jung, C. Kim, L. Levkova, X. Liao, G. Liu, R.D. Mawhinney, S. Ohta, K. Petrov, T. Wettig and A. Yamaguchi, “Hardware and software status of QCDOC, arXiv: hep-lat/0309096”, Nuclear Physics. B, Proceedings Supplement, Vol. 838, pp. 129–130, 2004. See: http://www.ph.ed.ac.uk/ukqcd/community/qcdoc/; P.A. Boyle, D. Chen, N.H. Christ, M.A. Clark, S.D. Cohen, C. Cristian, Z. Dong, A. Gara, B. Joo, C. Jung, C. Kim, L.A. Levkova, X. Liao, R.D. Mawhinney, S. Ohta, K. Petrov, T. Wettig and A. Yamaguchi, “Overview of the QCDSP and QCDOC computers”, IBM Journal of Research and Development, Vol. 49, No. 2/3, p. 351, 2005] came into full production service towards the end of 2004. This data is stored on QCDgrid, a data Grid currently composed of seven storage elements at five separate UK sites.     

A noise robust gait representation: Motion energy image

Gait-based human identification aims to discriminate individuals by the way they walk. A unique advantage of gait as a biometric is that it requires no subject contact and is easily acquired at a distance, which stands in contrast to other biometric techniques involving face, fingerprints, iris, etc. This paper proposes a new gait representation called motion energy image (MEI). Compared with other gait features, MEI is more robust against noise that can be included in binary gait silhouette images due to various factors. The effectiveness of the proposed method for gait recognition is demonstrated using experiments performed on the NLPR database. Recommended by Editorial Board member Jang Myung Lee under the direction of Editor Jae-Bok Song. This work was supported by the Korea Science and Engineering Foundation (KOSEF) through the Biometrics Engineering Research Center (BERC) at Yonsei University. Grant Number: R11-2002-105-09002-0 (2009). Heesung Lee received the B.S. and M.S. degrees in Electrical and Electronic Engineering, from Yonsei University, Seoul, Korea, in 2003 and 2005, respectively. He is currently a Ph.D. candidate of Dept. of Electrical and Electronic Engineering at Yonsei University. His current research interests include computational intelligence, pattern recognition, biometrics, and neural network. Sungjun Hong received the B.S. degrees in Electrical and Electronic Engineering and Computer Science, from Yonsei University, Seoul, Korea, in 2005. He is a graduate student of the combined master’s and doctoral degree programs at Yonsei University. He has studied machine learning, biometrics and optimization Imran Fareed Nizami received the B.S. degree from University of Engg. & Tech. Taxila, Pakistan and the M.S. degree in the Electrical and Electronic Engineering from Yonsei University, Seoul, Korea. He is currently a senior lecturer in Bahria University, Islamabad, Pakistan. His research interests include biometrics, gait recognition, Bayesian and neural networks. Euntai Kim received the B.S. (with top honors), M.S. and Ph.D. degrees in Electronic Engineering from Yonsei University, Seoul, Korea, in 1992, 1994, and 1999, respectively. From 1999 to 2002, he was a Full-time Lecturer with the Department of Control and Instrumentation Engineering at Hankyong National University, Gyeonggi-do, Korea. Since 2002, he has been with the School of Electrical and Electronic Engineering at Yonsei University, where he is currently an associate professor. He was a Visiting Scholar with the University of Alberta, Edmonton, Canada, and the Berkeley Initiative in Soft Computing (BISC), UC Berkeley, USA, in 2003 and 2008, respectively. His current research interests include computational intelligence and machine learning and their application to intelligent service robots, unmanned vehicles, home networks, biometrics, and evolvable hardware.