检索结果-南通市图书馆

Nonsmooth Optimization algorithms in Some Problems of Fracture Dynamics

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Intelligent Information Management 2010年第11期2卷 637-646页

作者： V. V. Zozulya Centro de Investigacion Cientifica de Yucatan A. C Colonia Chuburna de Hidalgo

Mathematical statement of elastodynamic contact problem for cracked body with considering unilateral restrictions and friction of the crack faces is done in classical and weak forms. Different variational formulations of unilateral contact problems with friction based on boundary variational principle are considered. Nonsmooth optimization algorithms of Udzawa’s type for solution of unilateral contact problem with friction have been developed. Convergence of the proposed algorithms has been studied numerically.

关键词： Unilateral Contact Friction Crack Variational Principles Boundary Variational Functional Nonsmooth Optimization algorithm

Design of Radial Basis Function Network Using Adaptive Particle Swarm Optimization and Orthogonal Least Squares

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Software Engineering and Applications 2010年第7期3卷 704-708页

作者： Majid Moradi Zirkohi Mohammad Mehdi Fateh Ali Akbarzade Department of Electrical and Robotic Engineering Shahrood University of Technology

This paper presents a two-level learning method for designing an optimal Radial Basis Function Network (RBFN) using Adaptive Velocity Update Relaxation Particle Swarm Optimization algorithm (AVURPSO) and Orthogonal Least Squares algorithm (OLS) called as OLS-AVURPSO method. The novelty is to develop an AVURPSO algorithm to form the hybrid OLS-AVURPSO method for designing an optimal RBFN. The proposed method at the upper level finds the global optimum of the spread factor parameter using AVURPSO while at the lower level automatically constructs the RBFN using OLS algorithm. Simulation results confirm that the RBFN is superior to Multilayered Perceptron Network (MLPN) in terms of network size and computing time. To demonstrate the effectiveness of proposed OLS-AVURPSO in the design of RBFN, the Mackey-Glass Chaotic Time-Series as an example is modeled by both MLPN and RBFN.

关键词： Radial Basis Function Network Orthogonal Least Squares algorithm Particle Swarm Optimization Mackey-Glass Chaotic Time-Series

Comparative analysis of various modularization algorithms and species specific study of VEGF signaling pathways

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Biomedical Science and Engineering 2010年第10期3卷 931-942页

作者： Namrata Tomar Losiana Nayak Rajat K. De Machine Intelligence Unit Indian Statistical Institute

In biology, signal transduction refers to a process by which a cell converts one kind of signal or stimulus into another. It involves ordered sequences of biochemical reactions inside the cell. These cascades of reactions are carried out by enzymes and activated by second messengers. Signal transduction pathways are complex in nature. Each pathway is responsible for tuning one or more biological functions in the intracellular environment as well as more than one pathway interact among themselves to carry forward a single biological function. Such kind of behavior of these pathways makes understanding difficult. Hence, for the sake of simplicity, they need to be partitioned into smaller modules and then analyzed. We took VEGF signaling pathway, which is responsible for angiogenesis for this kind of modularized study. Modules were obtained by applying the algorithm of Nayak and De (Nayak and De, 2007) for different complexity values. These sets of modules were compared among themselves to get the best set of modules for an optimal complexity value. The best set of modules compared with four different partitioning algorithms namely, Farhat’s (Farhat, 1998), Greedy (Chartrand and Oellermann, 1993), Kernighan-Lin’s (Kernighan and Lin, 1970) and Newman’s community finding algorithm (Newman, 2006). These comparisons enabled us to decide which of the aforementioned algorithms was the best one to create partitions from human VEGF signaling pathway. The optimal complexity value, on which the best set of modules was obtained, was used to get modules from different species for comparative study. Comparison among these modules would shed light on the trend of development of VEGF signaling pathway over these species.

关键词： Signal Transduction Pathway VEGF Pathway Complexity Value KEGG Database Modularization Newman’s Community Finding algorithm Kernighan-Lin’s algorithm Farhat’s algorithm and Greedy algorithm.

Implementation of Dynamic System Control Circuit Board Test System of Pure Electric Vehicles

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Semiconductor Photonics and Technology 2010年第4期16卷 167-172页

作者： BI Wei, WANG Jianming, DOU Ruzhen, GAO Hua (Department of Information and Communication, Tianjin Polytechnic University, Tianjin 300160, CHN) Department of Information and Communication Tianjin Polytechnic University Tianjin 300160

The dynamic system control circuit board(DSCCB)is one of the most important components for dynamic system of pure electric vehicles. The current detection of the DSCCB is done manually, which is not only inefficient in the detection but also difficult to guarantee the data accuracy. In order to improve the detection efficiency and accuracy, a new testing system is designed by Labview. The total test time can be further reduced by about 75% compared with the results of the manual detection. In this paper, the three-parameter sine wave curve-fit algorithm theory is applied to the phase delay detection of the current sensor sampling circuit on the DSCCB. This method solves the problem of big error in the phase delay detection.

关键词： pure electric vehicles automatic test system PXI platform three-parameter sine wave curve-fit algorithm

Performance Analysis of Multi-Parametric Call Admission Control Strategies in Un-Buffered Multi-Service Cellular Wireless Networks

维普期刊数据库

同方期刊数据库评论

在线全文

学校读者我要写书评

暂无评论

Wireless Sensor Network 2010年第3期2卷 218-226页

作者： Jang Hyun Baek Che Soong Kim Agassi Melikov Mehriban Fattakhova 不详

In this paper model of integrated voice/data cellular wireless networks (CWN) are investigated. The unified approximate approach to calculate the desired Quality of Service (QoS) metrics in an isolated cell of such networks under two multi-parametric call admission control (CAC) strategies is developed. One of them is based on the guard channels scheme while the second is based on a threshold scheme. Results of the numerical experiments are given and a comparison of QoS metrics under different CAC strategies is carried out.

关键词： Cellular Networks Call Admission Control Quality of Service Calculation algorithm

Heuristic Approaches for Cell Formation in Cellular Manufacturing

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Journal of Software Engineering and Applications 2010年第7期3卷 674-682页

作者： Shahram Saeedi Maghsud Solimanpur Iraj Mahdavi Nikbakhsh Javadian Department of Industrial Eng. Mazandaran University of Science and Technology Faculty of Engineering Urmia University

Cellular Manufacturing System (CMS) is an application of Group Technology (GT) that allows decomposing a manu-facturing system into subsystems. Grouping the machines and parts in a cellular manufacturing system, based on simi-larities is known as cell formation problem (CFP) which is an NP-hard problem. In this paper, a mathematical model is proposed for CFP and is solved using the Ant Colony Optimization (ACO), Genetic algorithm (GA) and Simulated Annealing (SA) meta-heuristic methods and the results are compared. The computational results show that the GA method is more effective in solving the model.

关键词： Cell Formation Problem Ant Colony Optimization Genetic algorithm Simulated Annealing Sequence Data Production Volume

Optimal Deployment with Self-Healing Movement Algo-rithm for Particular Region in Wireless Sensor Network

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Wireless Sensor Network 2009年第3期1卷 212-221页

作者： Fan ZHU Hongli LIU Shugang LIU Jie ZHAN 不详

Optimizing deployment of sensors with self-healing ability is an efficient way to solve the problems of cov-erage, connectivity and the dead nodes in WSNs. This work discusses the particular relationship between the monitoring range and the communication range, and proposes an optimal deployment with self-healing movement algorithm for closed or semi-closed area with irregular shape, which can not only satisfy both coverage and connectivity by using as few nodes as possible, but also compensate the failure of nodes by mobility in WSNs. We compute the maximum efficient range of several neighbor sensors based on the dif-ferent relationships between monitoring range and communication range with consideration of the complex boundary or obstacles in the region, and combine it with the Euclidean Minimum Spanning Tree (EMST) algorithm to ensure the coverage and communication of Region of Interest (ROI). Besides, we calculate the location of dead nodes by Geometry algorithm, and move the higher priority nodes to replace them by an-other Improved Virtual Force algorithm (IVFA). Eventually, simulation results based-on MATLAB are presented, which do show that this optimal deployment with self-healing movement algorithm can ensure the coverage and communication of an entire region by requiring the least number of nodes and effectively compensate the loss of the networks.

关键词： Optimal Deployment Self-Healing Movement Particular Region Euclidean Minimum Spanning Tree (EMST) Improved Virtual Force algorithm (IVFA)

The Design of the Minimum Spanning Tree algorithms

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

Intelligent Information Management 2009年第1期1卷 56-59页

作者： Zhicheng LIU Bo JIANG 不详

Based on the graphic theory and improved genetic algorithm,an improved genetic algorithm to search the minimum spanning trees is given . The algorithm uses binary code to represent the problem of minimum spanning trees. It designs the corresponding fitness function,operator and few controlling strategies to improve its speed and evolutionary efficiency.Only one solution can be gotten with running traditional al-gorithem atone time.The new algorithm can get a set of the solutions with higher probability in a shorter time.The experiment shows that it has a better performance than traditional methods.

关键词： minimum spanning tree genetic algorithm pattern

A Model for Uncertainty Knowledge

在线全文

维普期刊数据库

学校读者我要写书评

暂无评论

High Technology Letters 1997年第1期3卷 46-48页

作者：邓培民

A numeric reasoning method is proposed in this paper. It transforms the step--by-step matching reasoning method into computations of logical values. The reasoning time of this model is at most O(n2).

关键词： Reasoning Uncertainty Numeric reasoning Matching algorithm