Modeling and uation of DPS algorithm.doc

Sustainable development and its implications for chemical engineeringOriginal Research ArticleChemical Engineering Science, Volume 61, Issue 13, July 2006, Pages 4179-4187Roland CliftShow preview| Related articles|Related reference work articles Purchase$ 41.95861Coherent beam combining of 137W 22 fiber amplifier arrayOriginal Research ArticleOptics Communications, Volume 284, Issue 8, 15 April 2011, Pages 2198-2201Xiaolin Wang, Yanxing Ma, Pu Zhou, Bing He, Hu Xiao, Yuhao Xue, Chi Liu, Zhen Li, Xiaojun Xu, Jun Zhou, Zejin Liu, Yijun ZhaoClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractWe demonstrate coherent beam combining of two-dimensional fiber amplifier arrays with a total of 137W output power using stochastic parallel gradient descent (SPGD) algorithm. Compact all-fiber polarization-maintained single frequency fiber amplifier chains are developed and four fiber amplifiers are arranged to 22 laser array with a fill factor of 70% in the near-field. Active phase control is implemented by a digital signal processor (DSP) based SPGD controller. The fringe visibility of the coherent combined beam profile is as high as 81% when the system is closed-loop controlled despite perturbations of the environment.Article Outline1. Introduction2. Experimental setup3. Results and discussion4. ConclusionsAcknowledgementsReferencesPurchase$ 35.95Research highlights Four polarization-maintained single frequency fiber amplifier chains are optimized. Coherent beam combining of 137W 22 fiber amplifier array is demonstrated. Fill factor as high as 70% is realized in coherent beam combining.862A new approach to mining method selection based on modifying the Nicholas techniqueOriginal Research ArticleApplied Soft Computing, Volume 10, Issue 4, September 2010, Pages 1040-1061Amir Azadeh, M. Osanloo, M. AtaeiClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractThe main purpose of this paper is to represent a solution to the problem of mining method selection (MMS) in mining projects. To this aim, the well-known MMS technique of Nicholas has been modified so that in addition to eliminate its defects, it would be possible for mining engineers to easily assign their engineering judgments to unsteady and uncertain characteristics of mineral resources. So, in order to resolve the problems of weighting of the Nicholas technique, analytic hierarchy process (AHP) as the most similar multi-criteria decision making (MCDM) tool to Nicholas technique was applied. Due to inability of crisp numbers for assigning of decision maker (DM) judgments to ambiguities of mineral resources, trapezoidal fuzzy numbers also were used for better modeling of those ambiguities. Moreover, a two-step algorithm containing hierarchical technicaloperational model (HTOM) and also hierarchical economical model (HEM), inspired by Nicholas technique, was proposed. These models include some new criteria which are added to the Nicholas technique. Therefore using fuzzy AHP (FAHP), mining alternatives are firstly ranked based on HTOM and then, the most profitable of those alternatives is selected by the HEM. As a case study, the north anomaly of Choghart iron mine was used to compare the proposed approach with the Nicholas technique. The results indicated that the proposed approach eliminated the problems of Nicholas technique. Proposed approach also introduces a profitable mining alternative to start the mining operations. It should be applied to avoid further feasibility studies in mining projects.Article Outline1. Introduction2. Fuzzy sets and fuzzy numbers 2.1. Fuzzy sets theory in mining sciences: reasons and applications3. Multi-criteria decision making (MCDM) 3.1. Decision making using AHP3.2. Using AHP in fuzzy environment3.3. Buckleys FAHP method4. MMS procedure 4.1. A review of MMS technique of Nicholas4.2. Proposed approach5. Case study: Western ore body of North anomaly of Choghart iron mine 5.1. Resolving the problem by Nicholas technique5.2. Resolving the problem using the proposed approach 5.2.1. Results of HTOM5.2.2. Results of HEM5.2.3. Calculation of the inconsistency ratio of fuzzy comparison matrices5.3. Comparison of the results of Nicholas technique and proposed approach6. Discussion7. ConclusionsAcknowledgementsAppendix A. AppendixReferencesPurchase$ 31.50863Ant-based IP tracebackOriginal Research ArticleExpert Systems with Applications, Volume 34, Issue 4, May 2008, Pages 3071-3080Gu Hsin Lai, Chia-Mei Chen, Bing-Chiang Jeng, Willams ChaoClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractThe denial-of-service (DoS) attacks with the source IP address spoofing techniques has become a major threat to the Internet. An intrusion detection system is often used to detect DoS attacks and to coordinate with the firewall to block them. However, DoS attack packets consume and may exhaust all the resources, causing degrading network performance or, even worse, network breakdown. A proactive approach to DoS attacks is allocating the original attack host(s) issuing the attacks and stopping the malicious traffic, instead of wasting resources on the attack traffic. In this paper, an ant-based traceback approach is proposed to identify the DoS attack origin. Instead of creating a new type or function or processing a high volume of fine-grained data used by previous research, the proposed traceback approach uses flow level information to identify the origin of a DoS attack. Two characteristics of ant algorithm, quick convergence and heuristic, are adopted in the proposed approach on finding the DoS attack path. Quick convergence efficiently finds out the origin of a DoS attack; heuristic gives the solution even though partial flow information is provided by the network. The proposed method is evaluated through simulation on various network environments and two simulated real networks, NSFNET and DFN. The simulation results show that the proposed method can successfully and efficiently find the DoS attack path in various simulated network environments, with full and partial flow information provided by the networks.Article Outline1. Introduction2. Related work3. Ant algorithm4. Ant-based DoS traceback5. Extension to partial flow information6. Performance evaluation7. Simulation scenario8. ConclusionsAcknowledgementsReferencesPurchase$ 41.95864Planning and design of Tampines, an award-winning high-rise, high-density township in SingaporeOriginal Research ArticleCities, Volume 18, Issue 1, February 2001, Pages 33-42Foo Tuan SeikClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractNew town planning in Singapore has been entrusted to the Housing and Development Board (HDB) since its establishment in 1960. This paper examines land use planning and design principles for new towns as embodied in HDBs structural model. Using data from field surveys, an analysis is then made of the application and impact of these principles in Tampines, an award-winning new town. It was found that Tampines was efficiently and comprehensively planned using the strategy of hierarchical distribution of population, land uses, open spaces and infrastructure. This has led to the efficient use of land resources to house people and activities, efficient movement of people, goods and services, adequate provision of facilities, and a harmonious spatial pattern of land uses. Tampines was also found to be creatively designed, resulting in a town with a strong and aesthetically pleasing visual identity.Article Outline1. Introduction2. New town planning in Singapore 2.1. Land use plans2.2. New towns3. New town planning model and principles 3.1. Land use planning principles3.2. Design principles4. Tampines: an award-winning new town 4.1. Background4.2. Land use planning in Tampines 4.2.1. Residential land use4.2.2. Commercial land use4.2.3. Industrial land use4.2.4. Open space4.2.5. Infrastructure4.2.6. Other land uses4.2.7. Overview4.3. Urban design in Tampines 4.3.1. Architectural creativity4.3.2. Private sector participation4.3.3. Residents perceptions5. ConclusionsReferencesPurchase$ 19.95865User preferences discovery using fuzzy modelsOriginal Research ArticleFuzzy Sets and Systems, Volume 161, Issue 23, 1 December 2010, Pages 3044-3063Azene Zenebe, Lina Zhou, Anthony F. NorcioClose preview| Related articles|Related reference work articles AbstractAbstract | ReferencesReferences AbstractUser preferences discovery aims to learn the patterns of user preferences for various services or items such as movies. Preferences discovery is essential to the development of intelligent personalization applications. Based on decision and utility theories, traditional approaches to preferences discovery explicitly query users about the behavior of value function, or utility of every outcome with respect to each decision criterion. Consequently, these approaches are generally error-prone and labor intensive. Although implicit elicitation approaches have been proposed to address the above limitations, extent approaches largely ignore multi-valued nature of item features and uncertainty associated with item features and user preferences. To address uncertainty due to vagueness and imprecision, this research proposed a general framework for preferences discovery based on fuzzy set theories. In addition, new fuzzy models were created for preferences discovery and representation. Further, an algorithm was developed to predict user preferences with uncertainty, and visualization of item features, user feedback, and the discovered preferences helped improve the interpretation of the discovered knowledge. The results of the simulation evaluation using a benchmark movie dataset revealed that the proposed preference discovery method: (1) doubled the accuracy of preference discovery as compared to random prediction; and (2) outperformed conventional techniques in making movie recommendation. These findings suggest that fuzzy models are effective for preferences patterns discovery, and personalized recommendation application.Purchase$ 31.50866Ontology based personalized route planning system using a multi-criteria decision making approachOriginal Research ArticleExpert Systems with Applications, Volume 36, Issue 2, Part 1, March 2009, Pages 2250-2259Abolghasem Sadeghi Niaraki, Kyehyun KimClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractThis study presents a generic ontology-based architecture using a multi-criteria decision making technique to design a personalized route planning system. The real world has become too complex to implement entirely within an information system such as geographic information system (GIS). A route planning technique is an essential geo-related decision support tool, especially in intelligent transportation systems (ITS). In ubiquitous GIS environments, personalization can be accomplished through a users preferences stored on mobile appliances. In this manner, personalized and user-centric route planning services using semantic technologies and ontologies perceive user and context models to satisfy user demands and predict their requirements. In the past few years, several studies have been carried out regarding personalized services. However, the existing route finding algorithms suffer from a number of major difficulties, mainly owing to insufficient criteria modeling for a personalized system. Thus, the present study investigates how a user-centric route planning system can be implemented. In order to address this research issue, an ontology-based knowledge modelling technique using an analytic hierarchical process (AHP) is proposed. This technique can facilitate determination of the choice of criteria used for applying an impedance function in the route finding algorithm. From another perspective, AHP explicitly deals with a hierarchy structure and is essentially a theory of measurement and decision making methodology used for combining or synthesizing quantitative as well as qualitative criteria. User-centric results on real data illustrate the strengths of the present approach. It is anticipated that this new technique can be applied to develop new graph algorithms based on semantic web technology and can be used with new semantic graph structures.Article Outline1. Introduction2. Related works3. Materials and methods 3.1. User-centric ontology-based route planning architecture3.2. Ontology-based road segment criteria 3.2.1. Domain-specific ontology3.2.2. Road segment ontology3.2.3. Road segment criteria3.3. Road segment impedance model 3.3.1. User model and context model3.3.2. Multi-criteria decision making technique4. Model implementation and verification 4.1. Model implementation4.2. Verification of MDCM5. Discussion6. ConclusionAcknowledgementsReferencesPurchase$ 41.95867Performance analysis of an AAL multiplexer with dynamic bandwidth allocation in an IP/ATM environmentOriginal Research ArticleComputers & Operations Research, Volume 30, Issue 12, October 2003, Pages 1851-1864Dong Hwan Han, Chul Geun Park, Kwang Hyun BaikClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractIn this paper, we present a discrete-time queueing model with a Markov modulated batch Bernoulli process (MMBBP) as a bursty input traffic model of internet protocol packets in order to investigate the performance of a ATM adaptation layer (AAL) multiplexer with a finite buffer and a threshold-based dynamic bandwidth allocation scheme (DBAS). As a deterministic service time, we use the segmentation processing time devoted to a cell payload in the AAL multiplexer. This service time consists of several slot times and varies in line with threshold levels of the buffer contents. In an MMBBP process, the arrivals during a slot time occur as batch Bernoulli processes with a general distribution of batch sizes varying according to the phases of a Markov chain. We obtain the loss probability and the mean delay of an arbitrary packet. We present some numerical results to show the effects of the burstiness and thresholds on the performance of the AAL multiplexer with a DBAS. Scope and purpose The model which we present takes its origin in the research of appropriate traffic management schemes for carrying Internet protocol (IP) traffic on ATM networks. Due to the connection-oriented nature of ATM and unpredictable bursty characteristics of IP traffic, we need some dynamic schemes in the AAL multiplexer of an interworking unit such as a router in order to support a bandwidth allocation algorithm for IP traffic over ATM backbone networks. Discrete-time finite queueing model has gained to describe queueing multiplexer in an ATM environment where time is slotted into one cell transmission time. Recently, many works reveal the bursty nature of packet arrivals to the IP packet multiplexer. Therefore, we focus on a discrete-time finite queueing model MMBBP/D/1/K of the AAL multiplexer with a threshold-based DBAS in order to control the bursty IP traffic transferred to ATM networks. We analyze the presented model by using the classical supplementary variable method in queueing theory. As a result, we obtain the steady-state queue size distribution at an arbitrary time point and the loss probability and the mean delay of an arbitrary packet.Article Outline1. Introduction2. System model3. Analysis of queueing model4. Numerical results5. ConclusionAcknowledgementsAppendix A A.1. Derivation of (5)A.2. Derivation of (6)ReferencesVitaePurchase$ 31.50868Packet classification using diagonal-based tuple space searchOriginal Research ArticleComputer Networks, Volume 50, Issue 9, 20 June 2006, Pages 1406-1423Fu-Yuan Lee, Shiuhpyng ShiehClose preview| Related articles|Related reference work articles AbstractAbstract | Figures/TablesFigures/Tables | ReferencesReferences AbstractMultidimensional packet classification has attracted considerable research interests in the past few years due to the increasing demand on policy based packet forwarding and security services. These network services typically involve determining the action to take on packets according to a set of rules. As the number of rules increases, time for determining the best matched rule for an incoming IP packet will increase and subsequently incur long processing delay. To address this issue, in this paper we propose a two-dimensional packet classification algorithm which focuses on reducing time for classification while keeping reasonable memory requirement in practice. Our approach extends the tuple space framework and then allows performing binary search on the tuple space. To our knowledge, the proposed scheme is the first binary search scheme on two-dimensional tuples. With the proposed scheme, given a filter set with n two-dimensional filters, it requires only O(log(w) hash operations to determine the best matched filter, where w is the maximum prefix l