Title: Exciton binding energy and excitonic absorption spectra in a parabolic quantum wire under transverse electric field
Yüklə 2,34 Mb.
|
|
Source title:International Journal of Digital Content Technology and its Applications Abbreviated source title:Int. J. Digit. Content Technol. Appl. Volume:4 Issue:9
Issue date:December 2010 Publication year:2010 Pages:27-35 Language:English ISSN:19759339 Document type:Journal article (JA) Publisher:Advanced Institute of Convergence Information Technology, 707 Seokjang-dong, Gyeongju, Gyeongbuk, Korea, Republic of Abstract:A multi-agent system (MAS) has been built based on characteristics of emergency system, in which task schedulable and maximum task scheduling problem for the MAS has been discussed in our previous work. However, the mentioned task scheduling method both supposed that all tasks were equally important and agents have the same capability in playing a certain role, and evaluated the quality of task scheduling only by the number of accomplished tasks, which ignored the differences among tasks or Agents that conflicts with our real life. In order to make the task scheduling be more close to actual process of emergencies, the utility based optimal task scheduling problem (UOTSP) is proposed in this paper. The method assigns each task with a utility to represent the earnings from accomplishing it and adds preference on each Agent to distinguish the Agent's preferences and role play abilities. The UOTSP problem is proved to be NP complete by reducing MAX-S to it in polynomial time, and two approximate algorithms (GTS and RTOM) are proposed to solve the UOTSP problem approximately. The experiment results show that both GTS and RTOM can get excellent approximate solutions, and the time performance of GTS is wonderful which makes it suitable for the emergency applications of MAS (emergency system). Number of references:13 Main heading:Multitasking Controlled terms:Multi agent systems - Optimization - Polynomial approximation - Scheduling algorithms Uncontrolled terms:Approximate algorithms - Emergency system - NP Complete - Task-scheduling - Utility Classification code:722.4 Digital Computers and Systems - 723 Computer Software, Data Handling and Applications - 723.5 Computer Applications - 921 Mathematics DOI:10.4156/jdcta.vol4. issue9.4 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc. Accession number:20111013715516 Title:A landmark-based virtual geographic routing in WSN Authors:Yang, Yun (1); Chen, Jie (2); Chen, Junqin (2); Shi, Tingting (2); Zhang, Jing (2) Author affiliation:(1) Postdoctoral Mobile on Computer Application, Nanjing University of Science and Technology, Nanjing Jiangsu 210004, China; (2) College of Information Engineering, Yangzhou University, Yangzhou Jiangsu 225009, China Corresponding author:Yang, Y. Source title:Proceedings - 2010 International Forum on Information Technology and Applications, IFITA 2010 Abbreviated source title:Proc. - Int. Forum Inf. Technol. Appl., IFITA Volume:1 Monograph title:Proceedings - 2010 International Forum on Information Technology and Applications, IFITA 2010 Issue date:2010 Publication year:2010 Pages:247-250 Article number:5635100 Language:English ISBN-13:9780769541150 Document type:Conference article (CA) Conference name:2010 International Forum on Information Technology and Applications, IFITA 2010 Conference date:July 16, 2010 - July 18, 2010 Conference location:Kunming, China Conference code:83975 Sponsor:Int. Inf. Technol. Appl. Assoc. (IITAA) Publisher:IEEE Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States Abstract:Geographic routing is widely used in wireless sensor networks due to its great efficiency, good scalability and computed routing close to the best possible. However, the problem that geographic routing uses GPS receivers or location algorithms to obtain nodes' geographic information leads to expensive cost and high overhead. Aiming at this problem, we present a Landmark-based Virtual Geographic Routing Algorithm (LVGR), which depends only on node connectivity and not on any knowledge of node positions to discover the global topology of the sensor field. After topology discover, nodes can successfully communicate through local coordinate routing. Simulation shows that LVGR generates routes that are comparable to those generated by geographic routing algorithms, and even load-balanced. It has advantages in low cost, light routing overhead and high performance. © 2010 IEEE. Number of references:10 Main heading:Wireless sensor networks Controlled terms:Global positioning system - Information technology - Routing algorithms - Sensors - Topology Uncontrolled terms:Geographic information - Geographic routing - Global topology - GPS receivers - Landmark - Load balance - Load-balanced - Local coordinate - Location algorithms - Low costs - Node connectivity - Routing overheads - Sensor fields Classification code:716.3 Radio Systems and Equipment - 723 Computer Software, Data Handling and Applications - 732 Control Devices - 801 Chemistry - 903 Information Science - 921.4 Combinatorial Mathematics, Includes Graph Theory, Set Theory DOI:10.1109/IFITA.2010.24 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc. Accession number:20110313592550 Title:k-biclusters algorithm for gene expression data Authors:He, Ping (1); Xi, Yanqiu (2); Pan, Zhoujin (2); Xu, Xiaohua (2); Chen, Ling (2) Author affiliation:(1) Department of Computer Science and Engineering, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China; (2) Department of Computer Science, Yangzhou University, Yangzhou 225009, China; (3) State Key Laboratory for Novel Software Technology, Nanjing University, Nanjing 210093, China Corresponding author:He, P.(arterx@gmail.com) Source title:Journal of Computational Information Systems Abbreviated source title:J. Comput. Inf. Syst. Volume:6 Issue:12
Issue date:December 2010 Publication year:2010 Pages:4035-4043 Language:English ISSN:15539105 Document type:Journal article (JA) Publisher:Binary Information Press, P.O. Box 162, Bethel, CT 06801-0162, United States Abstract:In this paper, we propose a k-means algorithm which aims to find k biclusters for given gene expression data. Our algorithm k-Biclusters first clusters the columns (conditions) and groups the row (genes) in each subset of columns, then applies the row-clustering and column-clustering methods iteratively until the "steady" biclusters are found. After that, we refine the "steady" biclusters by reducing their Hscores and maximize the cluster size in the end. Experimental results demonstrate that the algorithm can efficiently find the co-regulation patterns, especially those highly homogenous with little difference from each other. © 2010 Binary Information Press. Number of references:9 Main heading:Gene expression Controlled terms:Clustering algorithms Uncontrolled terms:Biclustering - Biclusters - Cluster sizes - Clustering methods - Co-regulation - Gene Expression Data - K-means - k-Means algorithm Classification code:461.8.1 Genetic Engineering - 721 Computer Circuits and Logic Elements Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110413621322 Title:Modelling the Effect of Initial Grain Size on Dynamic Recrystallization Using a Modified Cellular Automata and a Adaptive Response Surface Method Authors:Jin, Zhaoyang (1); Cui, Zhenshan (1) Author affiliation:(1) National Die and Mold CAD Engineering Research Center, Shanghai Jiao Tong University, Shanghai 200030, China; (2) School of Mechanical Engineering, Yangzhou University, Yangzhou 225001, China Corresponding author:Cui, Z.(cuizs@sjtu.edu.cn) Source title:Journal of Materials Science and Technology Abbreviated source title:J. Mater. Sci. Technol. Volume:26 Issue:12
Issue date:December 2010 Publication year:2010 Pages:1063-1070 Language:English ISSN:10050302 CODEN:JSCTEQ Document type:Journal article (JA) Publisher:Chinese Society of Metals, 72 Wenhua Road, Shenyang, 110015, China Abstract:A modified cellular automata (CA) model of dynamic recrystallization (DRX) and a flow stress-based nucleation parameter identification method have been developed. In the method, the modified CA model, which takes the role of deformation degree on nucleation behavior into consideration, is coupled with an adaptive response surface model (ARSM) to search for the optimum nucleation parameter. The DRX behavior of an oxygen free high conductivity (OFHC) copper with different initial grain sizes has been taken as an example to validate the model. Good agreement is found between the simulated and the experimental results, which demonstrates that the new method can effectively improve the simulation accuracy. © 2010 The Chinese Society for Metals. Number of references:22 Main heading:Dynamic recrystallization Controlled terms:Automata theory - Cellular automata - Grain size and shape - Nucleation - Oxygen - Parameter estimation - Pattern recognition systems - Surface properties Uncontrolled terms:Adaptive response - Adaptive response surface method - CA model - Cellular Automata method - Deformation degrees - Flow stress - Initial grain size - Nucleation behavior - Nucleation model - Nucleation parameters - Oxygen free high conductivity copper - Parameter identification - Response surface method - Simulation accuracy Classification code:951 Materials Science - 933.1.2 Crystal Growth - 933.1.1 Crystal Lattice - 921 Mathematics - 804 Chemical Products Generally - 731.1 Control Systems - 723 Computer Software, Data Handling and Applications - 716 Telecommunication; Radar, Radio and Television - 537.1 Heat Treatment Processes DOI:10.1016/S1005-0302(11)60002-9 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20113814355671 Title:On O-ideals and lattices of O-ideals in regular residuated lattices Authors:Liu, Chun-Hui (1); Xu, Luo-Shan (1) Author affiliation:(1) Department of Mathematics, Yangzhou University, Yangzhou 225002, China; (2) Department of Elementary Education, Chifeng University, Chifeng 024001, China Corresponding author:Xu, L.-S.(luoshanxu@hotmail.com) Source title:Advances in Intelligent and Soft Computing Abbreviated source title:Adv. Intell. Soft Comput. Volume:82 Monograph title:Quantitative Logic and Soft Computing 2010: Volume 2 Issue date:2010 Publication year:2010 Pages:425-434 Language:English ISSN:18675662 ISBN-13:9783642156595 Document type:Conference article (CA) Publisher:Springer Verlag, Tiergartenstrasse 17, Heidelberg, D-69121, Germany Abstract:In this paper, the operation O˙ and the concept of O˙-ideals of (regular) residuated lattices are introduced. Some characterization theorems for O˙-ideals of (regular) residuated lattices are given. Representation theorems about O˙-ideals which are generated by non-empty subsets of regular residuated lattices are obtained. For the set of all O˙-ideals of a (regular) residuated lattice, an adjunction pair is defined. It is proved that the lattice of all O˙- ideals in a regular residuated lattice with the adjunction and the set-inclusion order is a complete Heyting algebra (i.e., a frame) and an algebraic lattice, which thus gives a new distributive residuated lattice. © 2010 Springer-Verlag Berlin Heidelberg. Number of references:13 Main heading:Computation theory Controlled terms:Algebra - Soft computing Uncontrolled terms:A-frames - Adjunctions - Algebraic lattices - Characterization theorems - frame - Representation theorem - Residuated lattices Classification code:723 Computer Software, Data Handling and Applications - 921 Mathematics - 921.1 Algebra DOI:10.1007/978-3-642-15660-1_41 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc.
Accession number:20110413618073 Title:Using multivariate regression methods to resolve overlapped electrochemical signals Authors:Zhu Xin-Feng, X.-F. (1); Wang, Jian-Dong (1); Li, Bin (2) Author affiliation:(1) College of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, China; (2) College of Information Technology, Yangzhou University, China Corresponding author:Zhu, X.-F.(zxfeng168@163.com) Source title:International Journal of Digital Content Technology and its Applications Abbreviated source title:Int. J. Digit. Content Technol. Appl. Volume:4 Issue:9
Issue date:December 2010 Publication year:2010 Pages:123-131 Language:English ISSN:19759339 Document type:Journal article (JA) Publisher:Advanced Institute of Convergence Information Technology, 707 Seokjang-dong, Gyeongju, Gyeongbuk, Korea, Republic of Abstract:This paper proposes the application of Gaussian process regression (GPR) as an alternative regression model to resolve the hard overlapped electrochemical signals belonging to the 2,4,6- trichlorophenol/2,6-dichlorophenol (TCP/DCP) system. Gaussian process derives from the perspective of Bayesian non-parametric regression methods, in terms of the parameterization of the covariance function, results in its good performance for the development of a calibration model for both linear and non-linear data sets. The multivariate regression model developed by GPR was compared with some traditional regression methods such as partial least squares regression (PLSR), and support vector regression (SVR). The comparative results were satisfied. The satisfactory results obtained throughGPR method suggest that it can be used as a more effective and promising tool for multivariate regression tasks than the others. Number of references:23 Main heading:Regression analysis Controlled terms:Gaussian distribution - Gaussian noise (electronic) Uncontrolled terms:Electrochemical signals - GPR - Multicomponents - Multivariate regression - PLSR - SVR Classification code:713 Electronic Circuits - 716 Telecommunication; Radar, Radio and Television - 922.2 Mathematical Statistics DOI:10.4156/jdcta.vol4. issue9.15 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc. Accession number:20110813676486 Title:Application of bionic design in product form design Authors:Jiang, Nan (1); Wang, Heng (1); Hu, Xuelong (2); Liu, Hui (3); Li, Wenfei (4) Author affiliation:(1) School of Mechanical Engineering, Yangzhou University, Yangzhou, China; (2) School of Information Engineering, Yangzhou University, Yangzhou, China; (3) Siyang Productivity Promotion Center, Suqian, China; (4) Jiangsu Best Baby Car Seat Mfg. Ltd. Company, Zhenjiang, China Corresponding author:Jiang, N.(jndesign9@126.com) Source title:2010 IEEE 11th International Conference on Computer-Aided Industrial Design and Conceptual Design, CAID and CD'2010 Abbreviated source title:IEEE Int. Conf. Comput.-Aided Ind. Des. Concept. Des., CAID CD Volume:1 Monograph title:2010 IEEE 11th International Conference on Computer-Aided Industrial Design and Conceptual Design, CAID and CD'2010 Issue date:2010 Publication year:2010 Pages:431-434 Article number:5681318 Language:English ISBN-13:9781424479719 Document type:Conference article (CA) Conference name:2010 IEEE 11th International Conference on Computer-Aided Industrial Design and Conceptual Design, CAID and CD'2010 Conference date:November 17, 2010 - November 19, 2010 Conference location:Yiwu, China Conference code:83807 Sponsor:IEEE Beijing Section; Zhejiang University; Ind. Des. Inst., Chin. Mech. Eng. Soc. Publisher:IEEE Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States Abstract:Nature is a talented designer. She makes every natural form existing in the world has own clever and unique shape, color, texture, structure and function. In product form design, using bionic principle, the research and application of natural biological form are carried out. Based on concrete or abstract bionic means, by extracting, simplifying evolving the form features of researched object, design inspiration and creative thinking of designer is triggered. Fully exerting the designers' creative imagination to product form will make the product form design has vigor and the emotion. and performs simulating natural beauty, so greatly improve the product value. © 2010 IEEE. Number of references:4 Main heading:Product design Controlled terms:Abstracting - Bionics - Biophysics - Conceptual design - Feature extraction Uncontrolled terms:Abstract bionics - Bionic design - Creative thinking - Form features - Natural beauty - Product form design - Product forms - Product value - Research and application Classification code:931 Classical Physics; Quantum Theory; Relativity - 913.1 Production Engineering - 903.1 Information Sources and Analysis - 731.1 Control Systems - 716 Telecommunication; Radar, Radio and Television - 701 Electricity and Magnetism - 408 Structural Design DOI:10.1109/CAIDCD.2010.5681318 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc. Accession number:20110413618063 Title:The partner selection in virtual enterprise based on BDI agent Authors:Yu, Wang (1); Feng, Zhu (1); Hua, Geng (1); Jing, Zhuwang (1) Author affiliation:(1) Information engineering institute, Yangzhou University, China Corresponding author:Feng, Z.(zhufeng621@gmail.com) Source title:International Journal of Digital Content Technology and its Applications Abbreviated source title:Int. J. Digit. Content Technol. Appl. Volume:4 Issue:9
Issue date:December 2010 Publication year:2010 Pages:36-43 Language:English ISSN:19759339 Document type:Journal article (JA) Publisher:Advanced Institute of Convergence Information Technology, 707 Seokjang-dong, Gyeongju, Gyeongbuk, Korea, Republic of Abstract:This paper's research is based on the model of BDI Agent, carries out the research of the modeling and simulating the Virtual Enterprise's partner selection using Swarm simulation methodology under the background of Swarm simulation methodology and analyzes the simulation results to study the relationship between micro and macro behavior in this system. The time of duration, the number of virtual enterprises and the ability of transforming information affect the selection of its partner in some extent. This study will play a reference role to the modern enterprise alliances. Number of references:16 Main heading:Virtual corporation Controlled terms:Computer simulation - Mathematical models Uncontrolled terms:BDI Agent - Enterprise alliance - Micro and macro - Partner selection - Simulation result - SWARM simulation - Virtual enterprise Classification code:723.5 Computer Applications - 912.2 Management - 921 Mathematics DOI:10.4156/jdcta.vol4. issue9.5 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc. Accession number:20111013715541 Title:A fast mining and updating algorithm for frequent patterns on biological single sequence Authors:Liu, Wei (1); Chen, Ling (2) Author affiliation:(1) Institute of Information Science and Technology, Nanjing University of Aeronautics and Astronautics, Nanjing 210016, China; (2) Institute of Information Science and Technology, Yangzhou University, Yangzhou 225009, China; (3) National Key Lab. of Novel Software Tech., Nanjing University, Nanjing 210093, China Corresponding author:Liu, W.(yzliuwei@126.com) Source title:Proceedings - 2010 International Forum on Information Technology and Applications, IFITA 2010 Abbreviated source title:Proc. - Int. Forum Inf. Technol. Appl., IFITA Volume:1 Monograph title:Proceedings - 2010 International Forum on Information Technology and Applications, IFITA 2010 Issue date:2010 Publication year:2010 Pages:147-151 Article number:5635151 Language:English ISBN-13:9780769541150 Document type:Conference article (CA) Conference name:2010 International Forum on Information Technology and Applications, IFITA 2010 Conference date:July 16, 2010 - July 18, 2010 Conference location:Kunming, China Conference code:83975 Sponsor:Int. Inf. Technol. Appl. Assoc. (IITAA) Publisher:IEEE Computer Society, 445 Hoes Lane - P.O.Box 1331, Piscataway, NJ 08855-1331, United States Abstract:Traditional Mining Frequent Pattems algorithms will construct lots of projected databases and generate lots of patterns with short length in the process of mining which cause the low efficiency of mining. In order to overcome the shortcomings of traditional algorithms, a fast and efficient algorithm SSPM was proposed. We used longer pattems for mining, which avoided producing lots of patterns with short length. We also used prefix tree of primary patterns for frequent patterns mining and pattern growth which could avoid producing plenty of irrelevant patterns .The experimental results show that SSPM not only improves the performance but also achieves effective mining results. © 2010 IEEE. Number of references:11 Main heading:Algorithms Controlled terms:Information technology Uncontrolled terms:Efficient algorithm - Frequent patterns - Pattern growth - Prefix tree of primary patterns - Prefix trees - Projected database - Sequential frequent pattem mining - Single sequences - Updating algorithm Classification code:723 Computer Software, Data Handling and Applications - 903 Information Science - 921 Mathematics DOI:10.1109/IFITA.2010.142 Database:Compendex Compilation and indexing terms, Copyright 2011 Elsevier Inc. Accession number:20111113753088 Title:Using an interpolation method to make classification decision Authors:Hua-Jizhao (1); Wang-Jianguo (2) Author affiliation:(1) Information College, YangZhou University, YangZhou, 25009, China; (2) Department of Computer Science and Technology, TangShan College, TangShan, 060300, China Corresponding author:Hua-Jizhao(huajizhao@163.com) Source title:Proceedings - 4th International Conference on Genetic and Evolutionary Computing, ICGEC 2010 Abbreviated source title:Proc. - Int. Conf. Genet. Evol. Comput., ICGEC Monograph title:Proceedings - 4th International Conference on Genetic and Evolutionary Computing, ICGEC 2010 Issue date:2010 Publication year:2010 Pages:1-3 Article number:5715355 Language:English ISBN-13:9780769542812 Document type:Conference article (CA) Conference name:4th International Conference on Genetic and Evolutionary Computing, ICGEC 2010 Conference date:December 13, 2010 - December 15, 2010 Conference location:Shenzhen, China Conference code:84151 Sponsor:Shenzhen University; K.U.A.S. Yüklə 2,34 Mb. Dostları ilə paylaş:
|