Search results for: minimum patch
2013 Vector Quantization Based on Vector Difference Scheme for Image Enhancement
Authors: Biji Jacob
Abstract:
Vector quantization algorithm which uses minimum distance calculation for codebook generation, a time consuming calculation performed on each pixel values leads to computation complexity. The codebook is updated by comparing the distance of each vector to their centroid vector and measure for their closeness. In this paper vector quantization is modified based on vector difference algorithm for image enhancement purpose. In the proposed scheme, vector differences between the vectors are considered as the new generation vectors or new codebook vectors. The codebook is updated by comparing the new generation vector with a threshold value having minimum error with the parent vector. The minimum error decides the fitness of each newly generated vector. Thus the codebook is generated in an adaptive manner and the fitness value is determined for the suppression of the degraded portion of the image and thereby leads to the enhancement of the image through the adaptive searching capability of the vector quantization through vector difference algorithm. Experimental results shows that the vector difference scheme efficiently modifies the vector quantization algorithm for enhancing the image with peak signal to noise ratio (PSNR), mean square error (MSE), Euclidean distance (E_dist) as the performance parameters.Keywords: codebook, image enhancement, vector difference, vector quantization
Procedia PDF Downloads 2672012 Microwave Imaging by Application of Information Theory Criteria in MUSIC Algorithm
Authors: Majid Pourahmadi
Abstract:
The performance of time-reversal MUSIC algorithm will be dramatically degrades in presence of strong noise and multiple scattering (i.e. when scatterers are close to each other). This is due to error in determining the number of scatterers. The present paper provides a new approach to alleviate such a problem using an information theoretic criterion referred as minimum description length (MDL). The merits of the novel approach are confirmed by the numerical examples. The results indicate the time-reversal MUSIC yields accurate estimate of the target locations with considerable noise and multiple scattering in the received signals.Keywords: microwave imaging, time reversal, MUSIC algorithm, minimum description length (MDL)
Procedia PDF Downloads 3372011 Compact 3-D Co-Planar Waveguide Fed Dual-Port Ultrawideband-Multiple-Input and Multiple-Output Antenna with WLAN Band-Notched Characteristics
Authors: Asim Quddus
Abstract:
A miniaturized three dimensional co-planar waveguide (CPW) two-port MIMO antenna, exhibiting high isolation and WLAN band-notched characteristics is presented in this paper for ultrawideband (UWB) communication applications. The microstrip patch antenna operates as a single UWB antenna element. The proposed design is a cuboid-shaped structure having compact size of 35 x 27 x 45 mm³. Radiating as well as decoupling structure is placed around cuboidal polystyrene sheet. The radiators are 27 mm apart, placed Face-to-Face in vertical direction. Decoupling structure is placed on the side walls of polystyrene. The proposed antenna consists of an oval shaped radiating patch. A rectangular structure with fillet edges is placed on ground plan to enhance the bandwidth. The proposed antenna exhibits a good impedance match (S11 ≤ -10 dB) over frequency band of 2 GHz – 10.6 GHz. A circular slotted structure is employed as a decoupling structure on substrate, and it is placed on the side walls of polystyrene to enhance the isolation between antenna elements. Moreover, to achieve immunity from WLAN band distortion, a modified, inverted crescent shaped slotted structure is etched on radiating patches to achieve band-rejection characteristics at WLAN frequency band 4.8 GHz – 5.2 GHz. The suggested decoupling structure provides isolation better than 15 dB over the desired UWB spectrum. The envelope correlation coefficient (ECC) and gain for the MIMO antenna are analyzed as well. Finite Element Method (FEM) simulations are carried out in Ansys High Frequency Structural Simulator (HFSS) for the proposed design. The antenna is realized on a Rogers RT/duroid 5880 with thickness 1 mm, relative permittivity ɛr = 2.2. The proposed antenna achieves a stable omni-directional radiation patterns as well, while providing rejection at desired WLAN band. The S-parameters as well as MIMO parameters like ECC are analyzed and the results show conclusively that the design is suitable for portable MIMO-UWB applications.Keywords: 3-D antenna, band-notch, MIMO, UWB
Procedia PDF Downloads 2962010 Non-Uniform Filter Banks-based Minimum Distance to Riemannian Mean Classifition in Motor Imagery Brain-Computer Interface
Authors: Ping Tan, Xiaomeng Su, Yi Shen
Abstract:
The motion intention in the motor imagery braincomputer interface is identified by classifying the event-related desynchronization (ERD) and event-related synchronization ERS characteristics of sensorimotor rhythm (SMR) in EEG signals. When the subject imagines different limbs or different parts moving, the rhythm components and bandwidth will change, which varies from person to person. How to find the effective sensorimotor frequency band of subjects is directly related to the classification accuracy of brain-computer interface. To solve this problem, this paper proposes a Minimum Distance to Riemannian Mean Classification method based on Non-Uniform Filter Banks. During the training phase, the EEG signals are decomposed into multiple different bandwidt signals by using multiple band-pass filters firstly; Then the spatial covariance characteristics of each frequency band signal are computered to be as the feature vectors. these feature vectors will be classified by the MDRM (Minimum Distance to Riemannian Mean) method, and cross validation is employed to obtain the effective sensorimotor frequency bands. During the test phase, the test signals are filtered by the bandpass filter of the effective sensorimotor frequency bands, and the extracted spatial covariance feature vectors will be classified by using the MDRM. Experiments on the BCI competition IV 2a dataset show that the proposed method is superior to other classification methods.Keywords: non-uniform filter banks, motor imagery, brain-computer interface, minimum distance to Riemannian mean
Procedia PDF Downloads 1252009 A Lifetime-Enhancing Monitoring Node Distribution Using Minimum Spanning Tree in Mobile Ad Hoc Networks
Authors: Sungchul Ha, Hyunwoo Kim
Abstract:
In mobile ad hoc networks, all nodes in a network only have limited resources and calculation ability. Therefore communication topology which have long lifetime is good for all nodes in mobile ad hoc networks. There are a variety of researches on security problems in wireless ad hoc networks. The existing many researches try to make efficient security schemes to reduce network power consumption and enhance network lifetime. Because a new node can join the network at any time, the wireless ad hoc networks are exposed to various threats and can be destroyed by attacks. Resource consumption is absolutely necessary to secure networks, but more resource consumption can be a critical problem to network lifetime. This paper focuses on efficient monitoring node distribution to enhance network lifetime in wireless ad hoc networks. Since the wireless ad hoc networks cannot use centralized infrastructure and security systems of wired networks, a new special IDS scheme is necessary. The scheme should not only cover all nodes in a network but also enhance the network lifetime. In this paper, we propose an efficient IDS node distribution scheme using minimum spanning tree (MST) method. The simulation results show that the proposed algorithm has superior performance in comparison with existing algorithms.Keywords: MANETs, IDS, power control, minimum spanning tree
Procedia PDF Downloads 3722008 Efficient Broadcasting in Wireless Sensor Networks
Authors: Min Kyung An, Hyuk Cho
Abstract:
In this paper, we study the Minimum Latency Broadcast Scheduling (MLBS) problem in wireless sensor networks (WSNs). The main issue of the MLBS problem is to compute schedules with the minimum number of timeslots such that a base station can broadcast data to all other sensor nodes with no collisions. Unlike existing works that utilize the traditional omni-directional WSNs, we target the directional WSNs where nodes can collaboratively determine and orientate their antenna directions. We first develop a 7-approximation algorithm, adopting directional WSNs. Our ratio is currently the best, to the best of our knowledge. We then validate the performance of the proposed algorithm through simulation.Keywords: broadcast, collision-free, directional antenna, approximation, wireless sensor networks
Procedia PDF Downloads 3462007 Satellite Images to Determine Levels of Fire Severity in a Native Chilean Forest: Assessing the Responses of Soil Mesofauna Diversity to a Fire Event
Authors: Carolina Morales, Ricardo Castro-Huerta, Enrique A. Mundaca
Abstract:
The edaphic fauna is the main factor involved in the transformation of nutrients and soil decomposition processes. Edaphic organisms are highly sensitive to soil disturbances, which normally causes changes in the composition and abundance of such organisms. Fire is known to be a disturbing factor since it affects the physical, chemical and biological properties of the soil and the whole ecosystem. During the summer (December-March) of 2017, Chile suffered the major fire events recorded in its modern history, which affected a vast area and a number of ecosystem types. The objective of this study was first to use remote sensing satellite images and GIS (Geographic Information Systems) to assess and identify levels of fire severity in disturbed areas and to compare the responses of the soil mesofauna diversity among such areas. We identified four areas (treatments) with an ascending level of severity, namely: mild, medium, high severity, and free of fire. A non-affected patch of forest was established as a control. Three samples from each treatment were collected in the form of a soil cube (10x10x10 cm). Edaphic mesofauna was obtained from each sample through the Berlese-Tullgren funnel method. Collected specimens were quantified and identified, using the RTU (Recognisable Taxonomic Unit) criterion. Diversity was analysed using inferential statistics to compare Simpson and Shannon-Wiener indexes across treatments. As predicted, the unburned forest patch (control) exhibited higher diversity values than the treatments. Significantly higher diversity values were recorded in those treatments subjected to lower fire severity. We conclude that remote sensing zoning is an adequate tool to identify different levels of fire severity and that an edaphic mesofauna is a group of organisms that qualify as good bioindicators for monitoring soil recovery after fire events.Keywords: bioindicator, Chile, fire severity level, soil
Procedia PDF Downloads 1602006 An Eigen-Approach for Estimating the Direction-of Arrival of Unknown Number of Signals
Authors: Dia I. Abu-Al-Nadi, M. J. Mismar, T. H. Ismail
Abstract:
A technique for estimating the direction-of-arrival (DOA) of unknown number of source signals is presented using the eigen-approach. The eigenvector corresponding to the minimum eigenvalue of the autocorrelation matrix yields the minimum output power of the array. Also, the array polynomial with this eigenvector possesses roots on the unit circle. Therefore, the pseudo-spectrum is found by perturbing the phases of the roots one by one and calculating the corresponding array output power. The results indicate that the DOAs and the number of source signals are estimated accurately in the presence of a wide range of input noise levels.Keywords: array signal processing, direction-of-arrival, antenna arrays, Eigenvalues, Eigenvectors, Lagrange multiplier
Procedia PDF Downloads 3342005 Spatial Mapping and Change Detection of a Coastal Woodland Mangrove Habitat in Fiji
Authors: Ashneel Ajay Singh, Anish Maharaj, Havish Naidu, Michelle Kumar
Abstract:
Mangrove patches are the foundation species located in the estuarine land areas. These patches provide a nursery, food source and protection for numerous aquatic, intertidal and well as land-based organisms. Mangroves also help in coastal protection, maintain water clarity and are one of the biggest sinks for blue carbon sequestration. In the Pacific Island countries, numerous coastal communities have a heavy socioeconomic dependence on coastal resources and mangroves play a key ecological and economical role in structuring the availability of these resources. Fiji has a large mangrove patch located in the Votua area of the Ba province. Globally, mangrove population continues to decline with the changes in climatic conditions and anthropogenic activities. Baseline information through wetland maps and time series change are essential references for development of effective mangrove management plans. These maps reveal the status of the resource and the effects arising from anthropogenic activities and climate change. In this study, we used remote sensing and GIS tools for mapping and temporal change detection over a period of >20 years in Votua, Fiji using Landsat imagery. Landsat program started in 1972 initially as Earth Resources Technology Satellite. Since then it has acquired millions of images of Earth. This archive allows mapping of temporal changes in mangrove forests. Mangrove plants consisted of the species Rhizophora stylosa, Rhizophora samoensis, Bruguiera gymnorrhiza, Lumnitzera littorea, Heritiera littoralis, Excoecaria agallocha and Xylocarpus granatum. Change detection analysis revealed significant reduction in the mangrove patch over the years. This information serves as a baseline for the development and implementation of effective management plans for one of Fiji’s biggest mangrove patches.Keywords: climate change, GIS, Landsat, mangrove, temporal change
Procedia PDF Downloads 1792004 Efficient Schemes of Classifiers for Remote Sensing Satellite Imageries of Land Use Pattern Classifications
Authors: S. S. Patil, Sachidanand Kini
Abstract:
Classification of land use patterns is compelling in complexity and variability of remote sensing imageries data. An imperative research in remote sensing application exploited to mine some of the significant spatially variable factors as land cover and land use from satellite images for remote arid areas in Karnataka State, India. The diverse classification techniques, unsupervised and supervised consisting of maximum likelihood, Mahalanobis distance, and minimum distance are applied in Bellary District in Karnataka State, India for the classification of the raw satellite images. The accuracy evaluations of results are compared visually with the standard maps with ground-truths. We initiated with the maximum likelihood technique that gave the finest results and both minimum distance and Mahalanobis distance methods over valued agriculture land areas. In meanness of mislaid few irrelevant features due to the low resolution of the satellite images, high-quality accord between parameters extracted automatically from the developed maps and field observations was found.Keywords: Mahalanobis distance, minimum distance, supervised, unsupervised, user classification accuracy, producer's classification accuracy, maximum likelihood, kappa coefficient
Procedia PDF Downloads 1832003 Single Feed Circularly Polarized Poly Fractal Antenna for Wireless Applications
Authors: V. V. Reddy, N. V. Sarma
Abstract:
A circularly polarized fractal boundary microstrip antenna is presented. The sides of a square patch along x-axis, y-axis are replaced with Minkowski and Koch curves correspondingly. By using the fractal curves as edges, asymmetry in the structure is created to excite two orthogonal modes for circular polarization (CP) operation. The indentation factors of the fractal curves are optimized for pure CP. The simulated results of the novel poly fractal antenna are demonstrated.Keywords: fractal, circular polarization, Minkowski, Koch
Procedia PDF Downloads 3562002 A Comparative Analysis of Global Minimum Variance and Naïve Portfolios: Performance across Stock Market Indices and Selected Economic Regimes Using Various Risk-Return Metrics
Authors: Lynmar M. Didal, Ramises G. Manzano Jr., Jacque Bon-Isaac C. Aboy
Abstract:
This study analyzes the performance of global minimum variance and naive portfolios across different economic periods, using monthly stock returns from the Philippine Stock Exchange Index (PSEI), S&P 500, and Dow Jones Industrial Average (DOW). The performance is evaluated through the Sharpe ratio, Sortino ratio, Jensen’s Alpha, Treynor ratio, and Information ratio. Additionally, the study investigates the impact of short selling on portfolio performance. Six-time periods are defined for analysis, encompassing events such as the global financial crisis and the COVID-19 pandemic. Findings indicate that the Naive portfolio generally outperforms the GMV portfolio in the S&P 500, signifying higher returns with increased volatility. Conversely, in the PSEI and DOW, the GMV portfolio shows more efficient risk-adjusted returns. Short selling significantly impacts the GMV portfolio during mid-GFC and mid-COVID periods. The study offers insights for investors, suggesting the Naive portfolio for higher risk tolerance and the GMV portfolio as a conservative alternative.Keywords: portfolio performance, global minimum variance, naïve portfolio, risk-adjusted metrics, short-selling
Procedia PDF Downloads 962001 Effect of Abiotic Factors on Population of Red Cotton Bug Dysdercus Koenigii F. (Heteroptera: Pyrrhocoridae) and Its Impact on Cotton Boll Disease
Authors: Haider Karar, Saghir Ahmad, Amjad Ali, Ibrar Ul Haq
Abstract:
The experiment was conducted at Cotton Research Station, Multan to study the impact of weather factors and red cotton bug (RCB) on cotton boll disease yielded yellowish lint during 2012. The population on RCB along with abiotic factors was recorded during three consecutive years i.e. 2012, 2013, and 2014. Along with population of RCB and abiotic factors, the number of unopened/opened cotton bolls (UOB), percent yellowish lint (YL) and whitish lint (WL) were also recorded. The data revealed that the population per plant of RCB remain 0.50 and 0.34 during years 2012, 2013 but increased during 2014 i.e. 3.21 per plant. The number of UOB were more i.e. 13.43% in 2012 with YL 76.30 and WL 23.70% when average maximum temperature 34.73◦C, minimum temperature 22.83◦C, RH 77.43% and 11.08 mm rainfall. Similarly in 2013 the number of UOB were less i.e. 0.34 per plant with YL 1.48 and WL 99.53 per plant when average maximum temperature 34.60◦C, minimum temperature 23.37◦C, RH 73.01% and 9.95 mm rainfall. During 2014 RCB population per plant was 3.22 with no UOB and YL was 0.00% and WL was 100% when average maximum temperature 23.70◦C, minimum temperature 23.18◦C, RH 71.67% and 4.55 mm rainfall. So it is concluded that the cotton bolls disease was more during 2012 due to more rainfall and more percent RH. The RCB may be the carrier of boll rot disease pathogen during more rainfall.Keywords: red cotton bug, cotton, weather factors, years
Procedia PDF Downloads 3452000 Develop a Software to Hydraulic Redesign a Depropanizer Column to Minimize Energy Consumption
Authors: Mahdi Goharrokhi, Rasool Shiri, Eiraj Naser
Abstract:
A depropanizer column of a particular refinery was redesigned in this work. That is, minimum reflux ratio, minimum number of trays, feed tray location and the hydraulic characteristics of the tower were calculated and compared with the actual values of the existing tower. To Design review of the tower, fundamental equations were used to develop software which its results were compared with two commercial software results. In each case PR EOS was used. Based on the total energy consumption in reboiler and condenser, feed tray location was also determined using case study definition for tower.Keywords: column, hydraulic design, pressure drop, energy consumption
Procedia PDF Downloads 4231999 A Hybrid Based Algorithm to Solve the Multi-objective Minimum Spanning Tree Problem
Authors: Boumesbah Asma, Chergui Mohamed El-amine
Abstract:
Since it has been shown that the multi-objective minimum spanning tree problem (MOST) is NP-hard even with two criteria, we propose in this study a hybrid NSGA-II algorithm with an exact mutation operator, which is only used with low probability, to find an approximation to the Pareto front of the problem. In a connected graph G, a spanning tree T of G being a connected and cycle-free graph, if k edges of G\T are added to T, we obtain a partial graph H of G inducing a reduced size multi-objective spanning tree problem compared to the initial one. With a weak probability for the mutation operator, an exact method for solving the reduced MOST problem considering the graph H is then used to give birth to several mutated solutions from a spanning tree T. Then, the selection operator of NSGA-II is activated to obtain the Pareto front approximation. Finally, an adaptation of the VNS metaheuristic is called for further improvements on this front. It allows finding good individuals to counterbalance the diversification and the intensification during the optimization search process. Experimental comparison studies with an exact method show promising results and indicate that the proposed algorithm is efficient.Keywords: minimum spanning tree, multiple objective linear optimization, combinatorial optimization, non-sorting genetic algorithm, variable neighborhood search
Procedia PDF Downloads 911998 Reliability Analysis: A Case Study in Designing Power Distribution System of Tehran Oil Refinery
Authors: A. B. Arani, R. Shojaee
Abstract:
Electrical power distribution system is one of the vital infrastructures of an oil refinery, which requires wide area of study and planning before construction. In this paper, power distribution reliability of Tehran Refinery’s KHDS/GHDS unit has been taken into consideration to investigate the importance of these kinds of studies and evaluate the designed system. In this regard, the authors chose and evaluated different configurations of electrical power distribution along with the existing configuration with the aim of finding the most suited configuration which satisfies the conditions of minimum cost of electrical system construction, minimum cost imposed by loss of load, and maximum power system reliability.Keywords: power distribution system, oil refinery, reliability, investment cost, interruption cost
Procedia PDF Downloads 8761997 Prospective Study on the Efficacy of Bio Absorbable Screws in Treatment of Osteochondral Fractures
Authors: S. Anwar Sathik, K. Manoj Deepak, K. Venkatachalam
Abstract:
Our study is a prospective study on the use of bio absorbable pins for the treatment of osteochondral fractures after patellar dislocation.22 patients who presented with osteochondral fractures were treated in our institution. They were followed for a minimum of 12 months by regular radiological evaluation. Of the 22 patients, 2 had fragments that detached from the fracture site which was treated arthroscopically. All the patients underwent open reduction and fixation of the pins using bio absorbable crews. They were immobilized in the cast for a minimum of 6 weeks after which mobilization was started according to our protocol. Fracture consolidation was found to occur in 20 of the 22 patients. Thus, Bio absorbable screws can be used as a reliable method of fixation of the osteochondral fragments.Keywords: osteochondral fracture, bio absorbable pins, patella dislocation, physiotherapy
Procedia PDF Downloads 3121996 A Low-Cost Long-Range 60 GHz Backhaul Wireless Communication System
Authors: Atabak Rashidian
Abstract:
In duplex backhaul wireless communication systems, two separate transmit and receive high-gain antennas are required if an antenna switch is not implemented. Although the switch loss, which is considerable and in the order of 1.5 dB at 60 GHz, is avoided, the large separate antenna systems make the design bulky and not cost-effective. To avoid two large reflectors for such a system, transmit and receive antenna feeds with a common phase center are required. The phase center should coincide with the focal point of the reflector to maximize the efficiency and gain. In this work, we present an ultra-compact design in which stacked patch antennas are used as the feeds for a 12-inch reflector. The transmit antenna is a 1 × 2 array and the receive antenna is a single element located in the middle of the transmit antenna elements. Antenna elements are designed as stacked patches to provide the required impedance bandwidth for four standard channels of WiGigTM applications. The design includes three metallic layers and three dielectric layers, in which the top dielectric layer is a 100 µm-thick protective layer. The top two metallic layers are specified to the main and parasitic patches. The bottom layer is basically ground plane with two circular openings (0.7 mm in diameter) having a center through via which connects the antennas to a single input/output Si-Ge Bi-CMOS transceiver chip. The reflection coefficient of the stacked patch antenna is fully investigated. The -10 dB impedance bandwidth is about 11%. Although the gap between transmit and receive antenna is very small (g = 0.525 mm), the mutual coupling is less than -12 dB over the desired frequency band. The three dimensional radiation patterns of the transmit and receive reflector antennas at 60 GHz is investigated over the impedance bandwidth. About 39 dBi realized gain is achieved. Considering over 15 dBm of output power of the silicon chip in the transmit side, the EIRP should be over 54 dBm, which is good enough for over one kilometer multi Gbps data communications. The performance of the reflector antenna over the bandwidth shows the peak gain is 39 dBi and 40 dBi for the reflector antenna with 2-element and single element feed, respectively. This type of the system design is cost-effective and efficient.Keywords: Antenna, integrated circuit, millimeter-wave, phase center
Procedia PDF Downloads 1211995 Analysis of Arthroscopic Rotator Cuff Repair
Authors: Prakash Karrun, M. Manoj Deepak, Mathivanan, K. Venkatachalam
Abstract:
Our study aims to evaluate the rates of healing and the efficacy of the arthroscopic repair of the rotator cuff tears. 40 patients who had rotator cuff tears were taken up for the study and arthroscopic repair was done with double row technique.They were evaluated and followed up for a minimum of 2 years minimum.The functional status,range of motion and healing rates were compared post operatively. All the patients were followed up with serial questionnaires and MRI at the end of 2 years. There was significant improvement in the functional status of the patient. The MRI showed better rates of healing in these patients.Thus our study effectively proves the efficacy of our operating technique.Keywords: rotator cuff tear, arthroscopic repair, double stich, healing
Procedia PDF Downloads 3471994 Some Codes for Variants in Graphs
Authors: Sofia Ait Bouazza
Abstract:
We consider the problem of finding a minimum identifying code in a graph. This problem was initially introduced in 1998 and has been since fundamentally connected to a wide range of applications (fault diagnosis, location detection …). Suppose we have a building into which we need to place fire alarms. Suppose each alarm is designed so that it can detect any fire that starts either in the room in which it is located or in any room that shares a doorway with the room. We want to detect any fire that may occur or use the alarms which are sounding to not only to not only detect any fire but be able to tell exactly where the fire is located in the building. For reasons of cost, we want to use as few alarms as necessary. The first problem involves finding a minimum domination set of a graph. If the alarms are three state alarms capable of distinguishing between a fire in the same room as the alarm and a fire in an adjacent room, we are trying to find a minimum locating domination set. If the alarms are two state alarms that can only sound if there is a fire somewhere nearby, we are looking for a differentiating domination set of a graph. These three areas are the subject of much active research; we primarily focus on the third problem. An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from other vertices by the set of vertices in C that are at distance at most r≥1 from x. When only vertices out of the code are asked to be identified, we get the related concept of a locating dominating set. The problem of finding an identifying code (resp a locating dominating code) of minimum size is a NP-hard problem, even when the input graph belongs to a number of specific graph classes. Therefore, we study this problem in some restricted classes of undirected graphs like split graph, line graph and path in a directed graph. Then we present some results on the identifying code by giving an exact value of upper total locating domination and a total 2-identifying code in directed and undirected graph. Moreover we determine exact values of locating dominating code and edge identifying code of thin headless spider and locating dominating code of complete suns.Keywords: identiying codes, locating dominating set, split graphs, thin headless spider
Procedia PDF Downloads 4781993 Aggregation Scheduling Algorithms in Wireless Sensor Networks
Authors: Min Kyung An
Abstract:
In Wireless Sensor Networks which consist of tiny wireless sensor nodes with limited battery power, one of the most fundamental applications is data aggregation which collects nearby environmental conditions and aggregates the data to a designated destination, called a sink node. Important issues concerning the data aggregation are time efficiency and energy consumption due to its limited energy, and therefore, the related problem, named Minimum Latency Aggregation Scheduling (MLAS), has been the focus of many researchers. Its objective is to compute the minimum latency schedule, that is, to compute a schedule with the minimum number of timeslots, such that the sink node can receive the aggregated data from all the other nodes without any collision or interference. For the problem, the two interference models, the graph model and the more realistic physical interference model known as Signal-to-Interference-Noise-Ratio (SINR), have been adopted with different power models, uniform-power and non-uniform power (with power control or without power control), and different antenna models, omni-directional antenna and directional antenna models. In this survey article, as the problem has proven to be NP-hard, we present and compare several state-of-the-art approximation algorithms in various models on the basis of latency as its performance measure.Keywords: data aggregation, convergecast, gathering, approximation, interference, omni-directional, directional
Procedia PDF Downloads 2291992 Multiple Version of Roman Domination in Graphs
Authors: J. C. Valenzuela-Tripodoro, P. Álvarez-Ruíz, M. A. Mateos-Camacho, M. Cera
Abstract:
In 2004, it was introduced the concept of Roman domination in graphs. This concept was initially inspired and related to the defensive strategy of the Roman Empire. An undefended place is a city so that no legions are established on it, whereas a strong place is a city in which two legions are deployed. This situation may be modeled by labeling the vertices of a finite simple graph with labels {0, 1, 2}, satisfying the condition that any 0-vertex must be adjacent to, at least, a 2-vertex. Roman domination in graphs is a variant of classic domination. Clearly, the main aim is to obtain such labeling of the vertices of the graph with minimum cost, that is to say, having minimum weight (sum of all vertex labels). Formally, a function f: V (G) → {0, 1, 2} is a Roman dominating function (RDF) in the graph G = (V, E) if f(u) = 0 implies that f(v) = 2 for, at least, a vertex v which is adjacent to u. The weight of an RDF is the positive integer w(f)= ∑_(v∈V)▒〖f(v)〗. The Roman domination number, γ_R (G), is the minimum weight among all the Roman dominating functions? Obviously, the set of vertices with a positive label under an RDF f is a dominating set in the graph, and hence γ(G)≤γ_R (G). In this work, we start the study of a generalization of RDF in which we consider that any undefended place should be defended from a sudden attack by, at least, k legions. These legions can be deployed in the city or in any of its neighbours. A function f: V → {0, 1, . . . , k + 1} such that f(N[u]) ≥ k + |AN(u)| for all vertex u with f(u) < k, where AN(u) represents the set of active neighbours (i.e., with a positive label) of vertex u, is called a [k]-multiple Roman dominating functions and it is denoted by [k]-MRDF. The minimum weight of a [k]-MRDF in the graph G is the [k]-multiple Roman domination number ([k]-MRDN) of G, denoted by γ_[kR] (G). First, we prove that the [k]-multiple Roman domination decision problem is NP-complete even when restricted to bipartite and chordal graphs. A problem that had been resolved for other variants and wanted to be generalized. We know the difficulty of calculating the exact value of the [k]-MRD number, even for families of particular graphs. Here, we present several upper and lower bounds for the [k]-MRD number that permits us to estimate it with as much precision as possible. Finally, some graphs with the exact value of this parameter are characterized.Keywords: multiple roman domination function, decision problem np-complete, bounds, exact values
Procedia PDF Downloads 1081991 Using Gene Expression Programming in Learning Process of Rough Neural Networks
Authors: Sanaa Rashed Abdallah, Yasser F. Hassan
Abstract:
The paper will introduce an approach where a rough sets, gene expression programming and rough neural networks are used cooperatively for learning and classification support. The Objective of gene expression programming rough neural networks (GEP-RNN) approach is to obtain new classified data with minimum error in training and testing process. Starting point of gene expression programming rough neural networks (GEP-RNN) approach is an information system and the output from this approach is a structure of rough neural networks which is including the weights and thresholds with minimum classification error.Keywords: rough sets, gene expression programming, rough neural networks, classification
Procedia PDF Downloads 3831990 Drag Reduction of Base Bleed at Various Flight Conditions
Authors: Man Chul Jeong, Hyoung Jin Lee, Sang Yoon Lee, Ji Hyun Park, Min Wook Chang, In-Seuck Jeung
Abstract:
This study focus on the drag reduction effect of the base bleed at supersonic flow. Base bleed is the method which bleeds the gas on the tail of the flight vehicle and reduces the base drag, which occupies over 50% of the total drag in any flight speed. Thus base bleed can reduce the total drag significantly, and enhance the total flight range. Drag reduction ratio of the base bleed is strongly related to the mass flow rate of the bleeding gas. Thus selecting appropriate mass flow rate is important. However, since the flight vehicle has various flight speed, same mass flow rate of the base bleed can have different drag reduction effect during the flight. Thus, this study investigates the effect of the drag reduction depending on the flight speed by numerical analysis using STAR-CCM+. The analysis model is 155mm diameter projectile with boat-tailed shape base. Angle of the boat-tail is chosen previously for minimum drag coefficient. Numerical analysis is conducted for Mach 2 and Mach 3, with various mass flow rate, or the injection parameter I, of the bleeding gas and the temperature of the bleeding gas, is fixed to 300K. The results showed that I=0.025 has the minimum drag at Mach 2, and I=0.014 has the minimum drag at Mach 3. Thus as the Mach number is higher, the lower mass flow rate of the base bleed has more effect on drag reduction.Keywords: base bleed, supersonic, drag reduction, recirculation
Procedia PDF Downloads 4151989 Surface Flattening Assisted with 3D Mannequin Based on Minimum Energy
Authors: Shih-Wen Hsiao, Rong-Qi Chen, Chien-Yu Lin
Abstract:
The topic of surface flattening plays a vital role in the field of computer aided design and manufacture. Surface flattening enables the production of 2D patterns and it can be used in design and manufacturing for developing a 3D surface to a 2D platform, especially in fashion design. This study describes surface flattening based on minimum energy methods according to the property of different fabrics. Firstly, through the geometric feature of a 3D surface, the less transformed area can be flattened on a 2D platform by geodesic. Then, strain energy that has accumulated in mesh can be stably released by an approximate implicit method and revised error function. In some cases, cutting mesh to further release the energy is a common way to fix the situation and enhance the accuracy of the surface flattening, and this makes the obtained 2D pattern naturally generate significant cracks. When this methodology is applied to a 3D mannequin constructed with feature lines, it enhances the level of computer-aided fashion design. Besides, when different fabrics are applied to fashion design, it is necessary to revise the shape of a 2D pattern according to the properties of the fabric. With this model, the outline of 2D patterns can be revised by distributing the strain energy with different results according to different fabric properties. Finally, this research uses some common design cases to illustrate and verify the feasibility of this methodology.Keywords: surface flattening, strain energy, minimum energy, approximate implicit method, fashion design
Procedia PDF Downloads 3341988 Combined Localization, Beamforming, and Interference Threshold Estimation in Underlay Cognitive System
Authors: Omar Nasr, Yasser Naguib, Mohamed Hafez
Abstract:
This paper aims at providing an innovative solution for blind interference threshold estimation in an underlay cognitive network to be used in adaptive beamforming by secondary user Transmitter and Receiver. For the task of threshold estimation, blind detection of modulation and SNR are used. For the sake of beamforming several localization algorithms are compared to settle on best one for cognitive environment. Beamforming algorithms as LCMV (Linear Constraint Minimum Variance) and MVDR (Minimum Variance Distortion less) are also proposed and compared. The idea of just nulling the primary user after knowledge of its location is discussed against the idea of working under interference threshold.Keywords: cognitive radio, underlay, beamforming, MUSIC, MVDR, LCMV, threshold estimation
Procedia PDF Downloads 5821987 The Routine Use of a Negative Pressure Incision Management System in Vascular Surgery: A Case Series
Authors: Hansraj Bookun, Angela Tan, Rachel Xuan, Linheng Zhao, Kejia Wang, Animesh Singla, David Kim, Christopher Loupos
Abstract:
Introduction: Incisional wound complications in vascular surgery patients represent a significant clinical and econometric burden of morbidity and mortality. The objective of this study was to trial the feasibility of applying the Prevena negative pressure incision management system as a routine dressing in patients who had undergone arterial surgery. Conventionally, Prevena has been applied to groin incisions, but this study features applications on multiple wound sites such as the thigh or major amputation stumps. Method: This was a cross-sectional observational, single-centre case series of 12 patients who had undergone major vascular surgery. Their wounds were managed with the Prevena system being applied either intra-operatively or on the first post-operative day. Demographic and operative details were collated as well as the length of stay and complication rates. Results: There were 9 males (75%) with mean age of 66 years and the comorbid burden was as follows: ischaemic heart disease (92%), diabetes (42%), hypertension (100%), stage 4 or greater kidney impairment (17%) and current or ex-smoking (83%). The main indications were acute ischaemia (33%), claudication (25%), and gangrene (17%). There were single instances of an occluded popliteal artery aneurysm, diabetic foot infection, and rest pain. The majority of patients (50%) had hybrid operations with iliofemoral endarterectomies, patch arterioplasties, and further peripheral endovascular treatment. There were 4 complex arterial bypass operations and 2 major amputations. The mean length of stay was 17 ± 10 days, with a range of 4 to 35 days. A single complication, in the form of a lymphocoele, was encountered in the context of an iliofemoral endarterectomy and patch arterioplasty. This was managed conservatively. There were no deaths. Discussion: The Prevena wound management system shows that in conjunction with safe vascular surgery, absolute wound complication rates remain low and that it remains a valuable adjunct in the treatment of vasculopaths.Keywords: wound care, negative pressure, vascular surgery, closed incision
Procedia PDF Downloads 1361986 Screening the Best Integrated Pest Management Treatments against Helicoverpa armigera
Authors: Ajmal Khan Kassi, Humayun Javed, Tariq Mukhtar
Abstract:
The research was conducted to screen out resistance and susceptibility of okra varieties against Helicoverpa armigera under field conditions 2016. In this experiment, the different management practices viz. release Trichogramma chilonis, hoeing, and weeding, clipping, and lufenuron were tested individually and with all possible combinations for the controlling of American bollworm at 3 diverse localities viz. University research farm Koont, National Agriculture Research Centre (NARC) and farmer field Taxila by using resistant variety Arka Anamika. All the treatment combinations regarding damage of shoot and fruit showed significant results. The minimum fruit infestation, i.e., 3.20% and 3.58% was recorded with combined treatment (i.e., T. chilonis + hoeing + weeding + lufenuron) in two different localities. The minimum shoot infestation, i.e., 7.18%, 7.08%, and 6.85% was also observed with (T. chilonis + hoeing + weeding + lufenuron) combined treatment at all three different localities. The above-combined treatment (T. chilonis + hoeing + weeding + lufenuron) also resulted in maximum yield at NARC and Taxila, i.e., 57.67 and 62.66 q/ha respectively. On the basis of combined treatment (i.e., T. chilonis + hoeing + weeding + lufenuron) in three different localities, Arka Anamika variety proved to be comparatively resistant against H. armigera. So this variety is recommended for the cultivation in Pothwar region to get maximum yield and minimum losses against H. armigera.Keywords: okra, screening, combine treatment, Helicoverpa armigera
Procedia PDF Downloads 1551985 Performance Evaluation and Economic Analysis of Minimum Quantity Lubrication with Pressurized/Non-Pressurized Air and Nanofluid Mixture
Authors: M. Amrita, R. R. Srikant, A. V. Sita Rama Raju
Abstract:
Water miscible cutting fluids are conventionally used to lubricate and cool the machining zone. But issues related to health hazards, maintenance and disposal costs have limited their usage, leading to application of Minimum Quantity Lubrication (MQL). To increase the effectiveness of MQL, nanocutting fluids are proposed. In the present work, water miscible nanographite cutting fluids of varying concentration are applied at cutting zone by two systems A and B. System A utilizes high pressure air and supplies cutting fluid at a flow rate of 1ml/min. System B uses low pressure air and supplies cutting fluid at a flow rate of 5ml/min. Their performance in machining is evaluated by measuring cutting temperatures, tool wear, cutting forces and surface roughness and compared with dry machining and flood machining. Application of nano cutting fluid using both systems showed better performance than dry machining. Cutting temperatures and cutting forces obtained by both techniques are more than flood machining. But tool wear and surface roughness showed improvement compared to flood machining. Economic analysis has been carried out in all the cases to decide the applicability of the techniques.Keywords: economic analysis, machining, minimum quantity lubrication, nanofluid
Procedia PDF Downloads 3801984 Optimal Number of Reconfigurable Robots in a Transport System
Authors: Mari Chaikovskaia, Jean-Philippe Gayon, Alain Quilliot
Abstract:
We consider a fleet of elementary robots that can be connected in different ways to transport loads of different types. For instance, a single robot can transport a small load, and the association of two robots can either transport a large load or two small loads. We seek to determine the optimal number of robots to transport a set of loads in a given time interval, with or without reconfiguration. We show that the problem with reconfiguration is strongly NP-hard by a reduction to the bin-packing problem. Then, we study a special case with unit capacities and derive simple formulas for the minimum number of robots, up to 3 types of loads. For this special case, we compare the minimum number of robots with or without reconfiguration and show that the gain is limited in absolute value but may be significant for small fleets.Keywords: fleet sizing, reconfigurability, robots, transportation
Procedia PDF Downloads 86