Search results for: Network reduction
3722 BPNN Based Processing for End Effects of HHT
Authors: Chun-Yao Lee, Yao-chen Lee
Abstract:
This paper describes a method of signal process applied on an end effects of Hilbert-Huang transform (HHT) to provide an improvement in the reality of spectrum. The method is based on back-propagation network (BPN). To improve the effect, the end extension of the original signal is obtained by back-propagation network. A full waveform including origin and its extension is decomposed by using empirical mode decomposition (EMD) to obtain intrinsic mode functions (IMFs) of the waveform. Then, the Hilbert transform (HT) is applied to the IMFs to obtain the Hilbert spectrum of the waveform. As a result, the method is superiority of the processing of end effect of HHT to obtain the real frequency spectrum of signals.Keywords: Neural network, back-propagation network, Hilbert-Huang transform
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 17803721 Prioritizing Service Quality Dimensions:A Neural Network Approach
Authors: A. Golmohammadi, B. Jahandideh
Abstract:
One of the determinants of a firm-s prosperity is the customers- perceived service quality and satisfaction. While service quality is wide in scope, and consists of various dimensions, there may be differences in the relative importance of these dimensions in affecting customers- overall satisfaction of service quality. Identifying the relative rank of different dimensions of service quality is very important in that it can help managers to find out which service dimensions have a greater effect on customers- overall satisfaction. Such an insight will consequently lead to more effective resource allocation which will finally end in higher levels of customer satisfaction. This issue –despite its criticality- has not received enough attention so far. Therefore, using a sample of 240 bank customers in Iran, an artificial neural network is developed to address this gap in the literature. As customers- evaluation of service quality is a subjective process, artificial neural networks –as a brain metaphor- may appear to have a potentiality to model such a complicated process. Proposing a neural network which is able to predict the customers- overall satisfaction of service quality with a promising level of accuracy is the first contribution of this study. In addition, prioritizing the service quality dimensions in affecting customers- overall satisfaction –by using sensitivity analysis of neural network- is the second important finding of this paper.Keywords: service quality, customer satisfaction, relativeimportance, artificial neural network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21493720 The Relation between Social Capital and Trust with Social Network Analysis
Authors: Safak Baykal
Abstract:
The purpose of this study is analyzing the relationship between trust and social capital of people with using Social Network Analysis. In this study, two aspects of social capital will be focused: Bonding, homophilous social capital (BoSC), and Bridging, heterophilous social capital (BrSC). These two aspects diverge each other regarding to the social theories. The other concept of the study is Trust (Tr), namely interpersonal trust, willing to ascribe good intentions to and have confidence in the words and actions of other people. In this study, the sample group, 61 people, was selected from a private firm from the defense industry. The relation between BoSC/BrSC and Tr is shown by using Social Network Analysis (SNA) and statistical analysis with Likert type-questionnaire. The results of the analysis show the Cronbach’s alpha value is 0.756 and social capital values (BoSC/BrSC) is not correlated with Tr values of the people.Keywords: Social capital, interpersonal trust, social network analysis (SNA).
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 25763719 The Effects of Yield and Yield Components of Some Quality Increase Applications on Ismailoglu Grape Type in Turkey
Authors: Yaşar Önal, Aydın Akın
Abstract:
This study was conducted Ismailoglu grape type (Vitis vinifera L.) and its vine which was aged 15 was grown on its own root in a vegetation period of 2013 in Nevşehir province in Turkey. In this research, it was investigated whether the applications of Control (C), 1/3 cluster tip reduction (1/3 CTR), shoot tip reduction (STR), 1/3 CTR + STR, TKI-HUMAS (TKI-HM) (Soil) (S), TKIHM (Foliar) (F), TKI-HM (S + F), 1/3 CTR + TKI-HM (S), 1/3 CTR + TKI-HM (F), 1/3 CTR + TKI-HM (S+F), STR + TKI-HM (S), STR + TKI-HM (F), STR + TKI-HM (S + F), 1/3 CTR + STR+TKI-HM (S), 1/3 CTR + STR + TKI-HM (F), 1/3 CTR + STR + TKI-HM (S + F) on yield and yield components of Ismailoglu grape type. The results were obtained as the highest fresh grape yield (16.15 kg/vine) with TKI-HM (S), as the highest cluster weight (652.39 g) with 1/3 CTR + STR, as the highest 100 berry weight (419.07 g) with 1/3 CTR + STR + TKI-HM (F), as the highest maturity index (44.06) with 1/3 CTR, as the highest must yield (810.00 ml) with STR + TKI-HM (F), as the highest intensity of L* color (42.04) with TKIHM (S + F), as the highest intensity of a* color (2.60) with 1/3 CTR + TKI-HM (S), as the highest intensity of b* color (7.16) with 1/3 CTR + TKI-HM (S) applications. To increase the fresh grape yield of Ismailoglu grape type can be recommended TKI-HM (S) application.
Keywords: 1/3 cluster tip reduction, shoot tip reduction, TKIHumas application, yield and yield Components.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 18073718 A New Routing Algorithm: MIRAD
Authors: Amir Gholami Pastaki, Ali Reza Sahab, Seyed Mehdi Sadeghi
Abstract:
LSP routing is among the prominent issues in MPLS networks traffic engineering. The objective of this routing is to increase number of the accepted requests while guaranteeing the quality of service (QoS). Requested bandwidth is the most important QoS criterion that is considered in literatures, and a various number of heuristic algorithms have been presented with that regards. Many of these algorithms prevent flows through bottlenecks of the network in order to perform load balancing, which impedes optimum operation of the network. Here, a modern routing algorithm is proposed as MIRAD: having a little information of the network topology, links residual bandwidth, and any knowledge of the prospective requests it provides every request with a maximum bandwidth as well as minimum end-to-end delay via uniform load distribution across the network. Simulation results of the proposed algorithm show a better efficiency in comparison with similar algorithms.Keywords: new generation networks, QoS, traffic engineering, MPLS, QoS based routing, LSP
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19073717 Prediction of Compressive Strength of Self- Compacting Concrete with Fuzzy Logic
Authors: Paratibha Aggarwal, Yogesh Aggarwal
Abstract:
The paper presents the potential of fuzzy logic (FL-I) and neural network techniques (ANN-I) for predicting the compressive strength, for SCC mixtures. Six input parameters that is contents of cement, sand, coarse aggregate, fly ash, superplasticizer percentage and water-to-binder ratio and an output parameter i.e. 28- day compressive strength for ANN-I and FL-I are used for modeling. The fuzzy logic model showed better performance than neural network model.Keywords: Self compacting concrete, compressive strength, prediction, neural network, Fuzzy logic.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 24443716 A Car Parking Monitoring System Using a Line-Topology Wireless Sensor Network
Authors: Dae Il Kim, Jungho Moon, Tae Yun Chung
Abstract:
This paper presents a car parking monitoring system using a wireless sensor network. The presented sensor network has a line-shaped topology and adopts a TDMA-based protocol for allowing multi-hop communications. Sensor nodes are deployed in the ground of an outdoor parking lot in such a way that a sensor node monitors a parking space. Each sensor node detects the availability of the associated parking space and transmits the detection result to a sink node via intermediate sensor nodes existing between the source sensor node and the sink node. We evaluate the feasibility of the presented sensor network and the TDMA-based communication protocol through experiments using 11 sensor nodes deployed in a real parking lot. The result shows that the presented car parking monitoring system is robust to changes in the communication environments and efficient for monitoring parking spaces of outdoor parking lots.
Keywords: Multi-hop communication, parking monitoring system, TDMA, wireless sensor network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16053715 Planning the Building Evacuation Routes by a Spatial Network
Authors: Hsin-Yun Lee
Abstract:
The previous proposed evacuation routing approaches usually divide the space into multiple interlinked zones. However, it may be harder to clearly and objectively define the margins of each zone. This paper proposes an approach that connects locations of necessary guidance into a spatial network. In doing so, evacuation routes can be constructed based on the links between starting points, turning nodes, and terminal points. This approach more conforms to the real-life evacuation behavior. The feasibility of the proposed approach is evaluated through a case of one floor in a hospital building. Results indicate that the proposed approach provides valuable suggestions for evacuation planning.
Keywords: Evacuation, spatial network, simulation.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14173714 The Effects of Speed on the Performance of Routing Protocols in Mobile Ad-hoc Networks
Authors: Narendra Singh Yadav, R.P.Yadav
Abstract:
Mobile ad hoc network is a collection of mobile nodes communicating through wireless channels without any existing network infrastructure or centralized administration. Because of the limited transmission range of wireless network interfaces, multiple "hops" may be needed to exchange data across the network. Consequently, many routing algorithms have come into existence to satisfy the needs of communications in such networks. Researchers have conducted many simulations comparing the performance of these routing protocols under various conditions and constraints. One question that arises is whether speed of nodes affects the relative performance of routing protocols being studied. This paper addresses the question by simulating two routing protocols AODV and DSDV. Protocols were simulated using the ns-2 and were compared in terms of packet delivery fraction, normalized routing load and average delay, while varying number of nodes, and speed.Keywords: AODV, DSDV, MANET, relative performance
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21543713 Order Reduction of Linear Dynamic Systems using Stability Equation Method and GA
Authors: G. Parmar, R. Prasad, S. Mukherjee
Abstract:
The authors present an algorithm for order reduction of linear dynamic systems using the combined advantages of stability equation method and the error minimization by Genetic algorithm. The denominator of the reduced order model is obtained by the stability equation method and the numerator terms of the lower order transfer function are determined by minimizing the integral square error between the transient responses of original and reduced order models using Genetic algorithm. The reduction procedure is simple and computer oriented. It is shown that the algorithm has several advantages, e.g. the reduced order models retain the steady-state value and stability of the original system. The proposed algorithm has also been extended for the order reduction of linear multivariable systems. Two numerical examples are solved to illustrate the superiority of the algorithm over some existing ones including one example of multivariable system.
Keywords: Genetic algorithm, Integral square error, Orderreduction, Stability equation method.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 31793712 Review of Trust Models in Wireless Sensor Networks
Authors: V. Uma Rani, K. Soma Sundaram
Abstract:
The major challenge faced by wireless sensor networks is security. Because of dynamic and collaborative nature of sensor networks the connected sensor devices makes the network unusable. To solve this issue, a trust model is required to find malicious, selfish and compromised insiders by evaluating trust worthiness sensors from the network. It supports the decision making processes in wireless sensor networks such as pre key-distribution, cluster head selection, data aggregation, routing and self reconfiguration of sensor nodes. This paper discussed the kinds of trust model, trust metrics used to address attacks by monitoring certain behavior of network. It describes the major design issues and their countermeasures of building trust model. It also discusses existing trust models used in various decision making process of wireless sensor networks.
Keywords: Attacks, Security, Trust, Trust model, Wireless sensor network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 45543711 Dynamic Window Secured Implicit Geographic Forwarding Routing for Wireless Sensor Network
Authors: Z.M. Hanapi, M. Ismail, K. Jumari, M. Mahdavi
Abstract:
Routing security is a major concerned in Wireless Sensor Network since a large scale of unattended nodes is deployed in ad hoc fashion with no possibility of a global addressing due to a limitation of node-s memory and the node have to be self organizing when the systems require a connection with the other nodes. It becomes more challenging when the nodes have to act as the router and tightly constrained on energy and computational capabilities where any existing security mechanisms are not allowed to be fitted directly. These reasons thus increasing vulnerabilities to the network layer particularly and to the whole network, generally. In this paper, a Dynamic Window Secured Implicit Geographic Forwarding (DWSIGF) routing is presented where a dynamic time is used for collection window to collect Clear to Send (CTS) control packet in order to find an appropriate hoping node. The DWIGF is expected to minimize a chance to select an attacker as the hoping node that caused by a blackhole attack that happen because of the CTS rushing attack, which promise a good network performance with high packet delivery ratios.Keywords: sensor, security, routing, attack, random.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13953710 Energy and Distance Based Clustering: An Energy Efficient Clustering Method for Wireless Sensor Networks
Authors: Mehdi Saeidmanesh, Mojtaba Hajimohammadi, Ali Movaghar
Abstract:
In this paper, we propose an energy efficient cluster based communication protocol for wireless sensor network. Our protocol considers both the residual energy of sensor nodes and the distance of each node from the BS when selecting cluster-head. This protocol can successfully prolong the network-s lifetime by 1) reducing the total energy dissipation on the network and 2) evenly distributing energy consumption over all sensor nodes. In this protocol, the nodes with more energy and less distance from the BS are probable to be selected as cluster-head. Simulation results with MATLAB show that proposed protocol could increase the lifetime of network more than 94% for first node die (FND), and more than 6% for the half of the nodes alive (HNA) factor as compared with conventional protocols.Keywords: Clustering methods, energy efficiency, routing protocol, wireless sensor networks.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 21423709 Tool Wear and Surface Roughness Prediction using an Artificial Neural Network (ANN) in Turning Steel under Minimum Quantity Lubrication (MQL)
Authors: S. M. Ali, N. R. Dhar
Abstract:
Tool wear and surface roughness prediction plays a significant role in machining industry for proper planning and control of machining parameters and optimization of cutting conditions. This paper deals with developing an artificial neural network (ANN) model as a function of cutting parameters in turning steel under minimum quantity lubrication (MQL). A feed-forward backpropagation network with twenty five hidden neurons has been selected as the optimum network. The co-efficient of determination (R2) between model predictions and experimental values are 0.9915, 0.9906, 0.9761 and 0.9627 in terms of VB, VM, VS and Ra respectively. The results imply that the model can be used easily to forecast tool wear and surface roughness in response to cutting parameters.Keywords: ANN, MQL, Surface Roughness, Tool Wear.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 38583708 Online Pose Estimation and Tracking Approach with Siamese Region Proposal Network
Authors: Cheng Fang, Lingwei Quan, Cunyue Lu
Abstract:
Human pose estimation and tracking are to accurately identify and locate the positions of human joints in the video. It is a computer vision task which is of great significance for human motion recognition, behavior understanding and scene analysis. There has been remarkable progress on human pose estimation in recent years. However, more researches are needed for human pose tracking especially for online tracking. In this paper, a framework, called PoseSRPN, is proposed for online single-person pose estimation and tracking. We use Siamese network attaching a pose estimation branch to incorporate Single-person Pose Tracking (SPT) and Visual Object Tracking (VOT) into one framework. The pose estimation branch has a simple network structure that replaces the complex upsampling and convolution network structure with deconvolution. By augmenting the loss of fully convolutional Siamese network with the pose estimation task, pose estimation and tracking can be trained in one stage. Once trained, PoseSRPN only relies on a single bounding box initialization and producing human joints location. The experimental results show that while maintaining the good accuracy of pose estimation on COCO and PoseTrack datasets, the proposed method achieves a speed of 59 frame/s, which is superior to other pose tracking frameworks.Keywords: Computer vision, Siamese network, pose estimation, pose tracking.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 11523707 An Energy-Efficient Protocol with Static Clustering for Wireless Sensor Networks
Authors: Amir Sepasi Zahmati, Bahman Abolhassani, Ali Asghar Beheshti Shirazi, Ali Shojaee Bakhtiari
Abstract:
A wireless sensor network with a large number of tiny sensor nodes can be used as an effective tool for gathering data in various situations. One of the major issues in wireless sensor networks is developing an energy-efficient routing protocol which has a significant impact on the overall lifetime of the sensor network. In this paper, we propose a novel hierarchical with static clustering routing protocol called Energy-Efficient Protocol with Static Clustering (EEPSC). EEPSC, partitions the network into static clusters, eliminates the overhead of dynamic clustering and utilizes temporary-cluster-heads to distribute the energy load among high-power sensor nodes; thus extends network lifetime. We have conducted simulation-based evaluations to compare the performance of EEPSC against Low-Energy Adaptive Clustering Hierarchy (LEACH). Our experiment results show that EEPSC outperforms LEACH in terms of network lifetime and power consumption minimization.Keywords: Clustering methods, energy efficiency, routingprotocol, wireless sensor networks.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 27113706 Papain Immobilized Polyurethane Film as Antimicrobial Food Package
Authors: M. Cynthya, V. Prabhawathi, D. Mukesh
Abstract:
Food contamination occurs during post process handling. This leads to spoilage and growth of pathogenic microorganisms in the food, thereby reducing its shelf life or spreading of food borne diseases. Several methods are tried and one of which is use of antimicrobial packaging. Here, papain, a protease enzyme, is covalently immobilized with the help of glutarldehyde on polyurethane and used as a food wrap to protect food from microbial contamination. Covalent immobilization of papain was achieved at a pH of 7.4; temperature of 4°C; glutaraldehyde concentration of 0.5%; incubation time of 24h; and 50mg of papain. The formation of -C=Nobserved in the Fourier transform infrared spectrum confirmed the immobilization of the enzyme on the polymer. Immobilized enzyme retained higher activity than the native free enzyme. The modified polyurethane showed better reduction of Staphylococcus aureus biofilm than bare polymer film (eight folds reduction in live colonies, two times reduction in protein and 6 times reduction in carbohydrates). The efficacy of this was studied by wrapping it over S. aureus contaminated cottage cheese (paneer) and cheese and stored at a temperature of 4°C for 7days. The modified film reduced the bacterial contamination by eight folds when compared to the bare film. FTIR also indicated reduction in lipids, sugars and proteins in the biofilm.
Keywords: Cheese, Papain, polyurethane, Staphylococcus aureus.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 29393705 Finding a Solution, all Solutions, or the Most Probable Solution to a Temporal Interval Algebra Network
Authors: André Trudel, Haiyi Zhang
Abstract:
Over the years, many implementations have been proposed for solving IA networks. These implementations are concerned with finding a solution efficiently. The primary goal of our implementation is simplicity and ease of use. We present an IA network implementation based on finite domain non-binary CSPs, and constraint logic programming. The implementation has a GUI which permits the drawing of arbitrary IA networks. We then show how the implementation can be extended to find all the solutions to an IA network. One application of finding all the solutions, is solving probabilistic IA networks.Keywords: Constraint logic programming, CSP, logic, temporalreasoning.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13903704 System Reduction by Eigen Permutation Algorithm and Improved Pade Approximations
Authors: Jay Singh, Kalyan Chatterjee, C. B. Vishwakarma
Abstract:
A mixed method by combining a Eigen algorithm and improved pade approximations is proposed for reducing the order of the large-scale dynamic systems. The most dominant Eigen value of both original and reduced order systems remain same in this method. The proposed method guarantees stability of the reduced model if the original high-order system is stable and is comparable in quality with the other well known existing order reduction methods. The superiority of the proposed method is shown through examples taken from the literature.
Keywords: Eigen algorithm, Order reduction, improved pade approximations, Stability, Transfer function.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 20753703 Identification of Nonlinear Systems Using Radial Basis Function Neural Network
Authors: C. Pislaru, A. Shebani
Abstract:
This paper uses the radial basis function neural network (RBFNN) for system identification of nonlinear systems. Five nonlinear systems are used to examine the activity of RBFNN in system modeling of nonlinear systems; the five nonlinear systems are dual tank system, single tank system, DC motor system, and two academic models. The feed forward method is considered in this work for modelling the non-linear dynamic models, where the KMeans clustering algorithm used in this paper to select the centers of radial basis function network, because it is reliable, offers fast convergence and can handle large data sets. The least mean square method is used to adjust the weights to the output layer, and Euclidean distance method used to measure the width of the Gaussian function.
Keywords: System identification, Nonlinear system, Neural networks, RBF neural network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 28523702 Prioritizing Service Quality Dimensions: A Neural Network Approach
Authors: A. Golmohammadi, B. Jahandideh
Abstract:
One of the determinants of a firm-s prosperity is the customers- perceived service quality and satisfaction. While service quality is wide in scope, and consists of various dimensions, there may be differences in the relative importance of these dimensions in affecting customers- overall satisfaction of service quality. Identifying the relative rank of different dimensions of service quality is very important in that it can help managers to find out which service dimensions have a greater effect on customers- overall satisfaction. Such an insight will consequently lead to more effective resource allocation which will finally end in higher levels of customer satisfaction. This issue – despite its criticality- has not received enough attention so far. Therefore, using a sample of 240 bank customers in Iran, an artificial neural network is developed to address this gap in the literature. As customers- evaluation of service quality is a subjective process, artificial neural networks –as a brain metaphor- may appear to have a potentiality to model such a complicated process. Proposing a neural network which is able to predict the customers- overall satisfaction of service quality with a promising level of accuracy is the first contribution of this study. In addition, prioritizing the service quality dimensions in affecting customers- overall satisfaction –by using sensitivity analysis of neural network- is the second important finding of this paper.Keywords: service quality, customer satisfaction, relative importance, artificial neural network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 16353701 Study on the Optimization of Completely Batch Water-using Network with Multiple Contaminants Considering Flow Change
Authors: Jian Du, Shui Hong Hong, Lu Meng, Qing Wei Meng
Abstract:
This work addresses the problem of optimizing completely batch water-using network with multiple contaminants where the flow change caused by mass transfer is taken into consideration for the first time. A mathematical technique for optimizing water-using network is proposed based on source-tank-sink superstructure. The task is to obtain the freshwater usage, recycle assignments among water-using units, wastewater discharge and a steady water-using network configuration by following steps. Firstly, operating sequences of water-using units are determined by time constraints. Next, superstructure is simplified by eliminating the reuse and recycle from water-using units with maximum concentration of key contaminants. Then, the non-linear programming model is solved by GAMS (General Algebra Model System) for minimum freshwater usage, maximum water recycle and minimum wastewater discharge. Finally, numbers of operating periods are calculated to acquire the steady network configuration. A case study is solved to illustrate the applicability of the proposed approach.Keywords: Completely batch process, flow change, multiple contaminants, water-using network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 14443700 Analysis of Combined Use of NN and MFCC for Speech Recognition
Authors: Safdar Tanweer, Abdul Mobin, Afshar Alam
Abstract:
The performance and analysis of speech recognition system is illustrated in this paper. An approach to recognize the English word corresponding to digit (0-9) spoken by 2 different speakers is captured in noise free environment. For feature extraction, speech Mel frequency cepstral coefficients (MFCC) has been used which gives a set of feature vectors from recorded speech samples. Neural network model is used to enhance the recognition performance. Feed forward neural network with back propagation algorithm model is used. However other speech recognition techniques such as HMM, DTW exist. All experiments are carried out on Matlab.
Keywords: Speech Recognition, MFCC, Neural Network, classifier.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 32583699 Integer Programming Model for the Network Design Problem with Facility Dependent Shortest Path Routing
Authors: Taehan Lee
Abstract:
We consider a network design problem which has shortest routing restriction based on the values determined by the installed facilities on each arc. In conventional multicommodity network design problem, a commodity can be routed through any possible path when the capacity is available. But, we consider a problem in which the commodity between two nodes must be routed on a path which has shortest metric value and the link metric value is determined by the installed facilities on the link. By this routing restriction, the problem has a distinct characteristic. We present an integer programming formulation containing the primal-dual optimality conditions to the shortest path routing. We give some computational results for the model.Keywords: Integer programming, multicommodity network design, routing, shortest path.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 10463698 Trust Building Mechanisms for Electronic Business Networks and Their Relation to eSkills
Authors: Radoslav Delina, Michal Tkáč
Abstract:
Globalization, supported by information and communication technologies, changes the rules of competitiveness and increases the significance of information, knowledge and network cooperation. In line with this trend, the need for efficient trust-building tools has emerged. The absence of trust building mechanisms and strategies was identified within several studies. Through trust development, participation on e-business network and usage of network services will increase and provide to SMEs new economic benefits. This work is focused on effective trust building strategies development for electronic business network platforms. Based on trust building mechanism identification, the questionnairebased analysis of its significance and minimum level of requirements was conducted. In the paper, we are confirming the trust dependency on e-Skills which play crucial role in higher level of trust into the more sophisticated and complex trust building ICT solutions.Keywords: Correlation analysis, decision trees, e-marketplace, trust building
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 19123697 Distributed Generator Placement for Loss Reduction and Improvement in Reliability
Authors: Priyanka Paliwal, N.P. Patidar
Abstract:
Distributed Power generation has gained a lot of attention in recent times due to constraints associated with conventional power generation and new advancements in DG technologies .The need to operate the power system economically and with optimum levels of reliability has further led to an increase in interest in Distributed Generation. However it is important to place Distributed Generator on an optimum location so that the purpose of loss minimization and voltage regulation is dully served on the feeder. This paper investigates the impact of DG units installation on electric losses, reliability and voltage profile of distribution networks. In this paper, our aim would be to find optimal distributed generation allocation for loss reduction subjected to constraint of voltage regulation in distribution network. The system is further analyzed for increased levels of Reliability. Distributed Generator offers the additional advantage of increase in reliability levels as suggested by the improvements in various reliability indices such as SAIDI, CAIDI and AENS. Comparative studies are performed and related results are addressed. An analytical technique is used in order to find the optimal location of Distributed Generator. The suggested technique is programmed under MATLAB software. The results clearly indicate that DG can reduce the electrical line loss while simultaneously improving the reliability of the system.Keywords: AENS, CAIDI, Distributed Generation, lossreduction, Reliability, SAIDI
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 30873696 A Black-Box Approach in Modeling Valve Stiction
Abstract:
Several valve stiction models have been proposed in the literature to help understand and study the behavior of sticky valves. In this paper, an alternative black-box modeling approach based on Neural Network (NN) is presented. It is shown that with proper network type and optimum model structures, the performance of the developed NN stiction model is comparable to other established method. The resulting NN model is also tested for its robustness against the uncertainty in the stiction parameter values. Predictive mode operation also shows excellent performance of the proposed model for multi-steps ahead prediction.
Keywords: Control valve stiction, neural network, modeling.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15873695 Tree Based Data Aggregation to Resolve Funneling Effect in Wireless Sensor Network
Authors: G. Rajesh, B. Vinayaga Sundaram, C. Aarthi
Abstract:
In wireless sensor network, sensor node transmits the sensed data to the sink node in multi-hop communication periodically. This high traffic induces congestion at the node which is present one-hop distance to the sink node. The packet transmission and reception rate of these nodes should be very high, when compared to other sensor nodes in the network. Therefore, the energy consumption of that node is very high and this effect is known as the “funneling effect”. The tree based-data aggregation technique (TBDA) is used to reduce the energy consumption of the node. The throughput of the overall performance shows a considerable decrease in the number of packet transmissions to the sink node. The proposed scheme, TBDA, avoids the funneling effect and extends the lifetime of the wireless sensor network. The average case time complexity for inserting the node in the tree is O(n log n) and for the worst case time complexity is O(n2).Keywords: Data Aggregation, Funneling Effect, Traffic Congestion, Wireless Sensor Network.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 13093694 Criticality Assessment of Failures in Multipoint Communication Networks
Authors: Myriam Noureddine, Rachid Noureddine
Abstract:
Following the current economic challenges and competition, all systems, whatever their field, must be efficient and operational during their activity. In this context, it is imperative to anticipate, identify, eliminate and estimate the failures of systems, which may lead to an interruption of their function. This need requires the management of possible risks, through an assessment of the failures criticality following a dependability approach. On the other hand, at the time of new information technologies and considering the networks field evolution, the data transmission has evolved towards a multipoint communication, which can simultaneously transmit information from a sender to multiple receivers. This article proposes the failures criticality assessment of a multipoint communication network, integrates a database of network failures and their quantifications. The proposed approach is validated on a case study and the final result allows having the criticality matrix associated with failures on the considered network, giving the identification of acceptable risks.
Keywords: Dependability, failure, multipoint network, criticality matrix.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 15933693 Applying Complex Network Theory to Software Structure Analysis
Authors: Weifeng Pan
Abstract:
Complex networks have been intensively studied across many fields, especially in Internet technology, biological engineering, and nonlinear science. Software is built up out of many interacting components at various levels of granularity, such as functions, classes, and packages, representing another important class of complex networks. It can also be studied using complex network theory. Over the last decade, many papers on the interdisciplinary research between software engineering and complex networks have been published. It provides a different dimension to our understanding of software and also is very useful for the design and development of software systems. This paper will explore how to use the complex network theory to analyze software structure, and briefly review the main advances in corresponding aspects.Keywords: Metrics, measurement, complex networks, software.
Procedia APA BibTeX Chicago EndNote Harvard JSON MLA RIS XML ISO 690 PDF Downloads 2580