Search results for: minimum volume embedding
Commenced in January 2007
Frequency: Monthly
Edition: International
Paper Count: 4642

Search results for: minimum volume embedding

4522 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 853
4521 Security System for Safe Transmission of Medical Image

Authors: Mohammed Jamal Al-Mansor, Kok Beng Gan

Abstract:

This paper develops an optimized embedding of payload in medical image by using genetic optimization. The goal is to preserve region of interest from being distorted because of the watermark. By using this developed system there is no need of manual defining of region of interest through experts as the system will apply the genetic optimization to select the parts of image that can carry the watermark with guaranteeing less distortion. The experimental results assure that genetic based optimization is useful for performing steganography with less mean square error percentage.

Keywords: AES, DWT, genetic algorithm, watermarking

Procedia PDF Downloads 388
4520 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 290
4519 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 328
4518 Feature Engineering Based Detection of Buffer Overflow Vulnerability in Source Code Using Deep Neural Networks

Authors: Mst Shapna Akter, Hossain Shahriar

Abstract:

One of the most important challenges in the field of software code audit is the presence of vulnerabilities in software source code. Every year, more and more software flaws are found, either internally in proprietary code or revealed publicly. These flaws are highly likely exploited and lead to system compromise, data leakage, or denial of service. C and C++ open-source code are now available in order to create a largescale, machine-learning system for function-level vulnerability identification. We assembled a sizable dataset of millions of opensource functions that point to potential exploits. We developed an efficient and scalable vulnerability detection method based on deep neural network models that learn features extracted from the source codes. The source code is first converted into a minimal intermediate representation to remove the pointless components and shorten the dependency. Moreover, we keep the semantic and syntactic information using state-of-the-art word embedding algorithms such as glove and fastText. The embedded vectors are subsequently fed into deep learning networks such as LSTM, BilSTM, LSTM-Autoencoder, word2vec, BERT, and GPT-2 to classify the possible vulnerabilities. Furthermore, we proposed a neural network model which can overcome issues associated with traditional neural networks. Evaluation metrics such as f1 score, precision, recall, accuracy, and total execution time have been used to measure the performance. We made a comparative analysis between results derived from features containing a minimal text representation and semantic and syntactic information. We found that all of the deep learning models provide comparatively higher accuracy when we use semantic and syntactic information as the features but require higher execution time as the word embedding the algorithm puts on a bit of complexity to the overall system.

Keywords: cyber security, vulnerability detection, neural networks, feature extraction

Procedia PDF Downloads 61
4517 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 451
4516 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 203
4515 A Novel Approach of Secret Communication Using Douglas-Peucker Algorithm

Authors: R. Kiruthika, A. Kannan

Abstract:

Steganography is the problem of hiding secret messages in 'innocent – looking' public communication so that the presence of the secret message cannot be detected. This paper introduces a steganographic security in terms of computational in-distinguishability from a channel of probability distributions on cover messages. This method first splits the cover image into two separate blocks using Douglas – Peucker algorithm. The text message and the image will be hided in the Least Significant Bit (LSB) of the cover image.

Keywords: steganography, lsb, embedding, Douglas-Peucker algorithm

Procedia PDF Downloads 336
4514 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 83
4513 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 353
4512 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 395
4511 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 315
4510 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 559
4509 Analysis of the CO2 Emissions of Public Passenger Transport in Tianjin City of China

Authors: Tao Zhao, Xianshuo Xu

Abstract:

Low-carbon public passenger transport is an important part of low carbon city. The CO2 emissions of public passenger transport in Tianjin from 1995 to 2010 are estimated with IPCC CO2 counting method, which shows that the total CO2 emissions of Tianjin public passenger transport have gradually become stable at 1,425.1 thousand tons. And then the CO2 emissions of the buses, taxies, and rail transits are calculated respectively. A CO2 emission of 829.9 thousand tons makes taxies become the largest CO2 emissions source among the public passenger transport in Tianjin. Combining with passenger volume, this paper analyzes the CO2 emissions proportion of the buses, taxies, and rail transits compare the passenger transport rate with the proportion of CO2 emissions, as well as the CO2 emissions change of per 10,000 people. The passenger volume proportion of bus among the three public means of transport is 72.62% which is much higher than its CO2 emissions proportion of 36.01%, with the minimum number of CO2 emissions per 10,000 people of 4.90 tons. The countermeasures to reduce CO2 emissions of public passenger transport in Tianjin are to develop rail transit, update vehicles and use alternative fuel vehicles.

Keywords: public passenger transport, carbon emissions, countermeasures, China

Procedia PDF Downloads 405
4508 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 135
4507 The Relationship Between Artificial Intelligence, Data Science, and Privacy

Authors: M. Naidoo

Abstract:

Artificial intelligence often requires large amounts of good quality data. Within important fields, such as healthcare, the training of AI systems predominately relies on health and personal data; however, the usage of this data is complicated by various layers of law and ethics that seek to protect individuals’ privacy rights. This research seeks to establish the challenges AI and data sciences pose to (i) informational rights, (ii) privacy rights, and (iii) data protection. To solve some of the issues presented, various methods are suggested, such as embedding values in technological development, proper balancing of rights and interests, and others.

Keywords: artificial intelligence, data science, law, policy

Procedia PDF Downloads 87
4506 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 359
4505 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 62
4504 Embedding Employability in the Curriculum: Experiences from New Zealand

Authors: Narissa Lewis, Susan Geertshuis

Abstract:

The global and national employability agenda is changing the higher education landscape as academic staff are faced with the responsibility of developing employability capabilities and attributes in addition to delivering discipline specific content and skills. They realise that the shift towards teaching sustainable capabilities means a shift in the way they teach. But what that shift should be or how they should bring it about is unclear. As part of a national funded project, representatives from several New Zealand (NZ) higher education institutions and the NZ Association of Graduate Employers partnered to discover, trial and disseminate means of embedding employability in the curriculum. Findings from four focus groups (n=~75) and individual interviews (n=20) with staff from several NZ higher education institutions identified factors that enable or hinder embedded employability development within their respective institutions. Participants believed that higher education institutions have a key role in developing graduates for successful lives and careers however this requires a significant shift in culture within their respective institutions. Participants cited three main barriers: lack of strategic direction, support and guidance; lack of understanding and awareness of employability; and lack of resourcing and staff capability. Without adequate understanding and awareness of employability, participants believed it is difficult to understand what employability is let alone how it can be embedded in the curriculum. This presentation will describe some of the impacts that the employability agenda has on staff as they try to move from traditional to contemporary forms of teaching to develop employability attributes of students. Changes at the institutional level are required to support contemporary forms of teaching, however this is often beyond the sphere of influence at the teaching staff level. The study identified that small changes to teaching practices were necessary and a simple model to facilitate change from traditional to contemporary forms of teaching was developed. The model provides a framework to identify small but impactful teaching practices and exemplar teaching practices were identified. These practices were evaluated for transferability into other contexts to encourage small but impactful changes to embed employability in the curriculum.

Keywords: curriculum design, change management, employability, teaching exemplars

Procedia PDF Downloads 308
4503 Multimodal Employee Attendance Management System

Authors: Khaled Mohammed

Abstract:

This paper presents novel face recognition and identification approaches for the real-time attendance management problem in large companies/factories and government institutions. The proposed uses the Minimum Ratio (MR) approach for employee identification. Capturing the authentic face variability from a sequence of video frames has been considered for the recognition of faces and resulted in system robustness against the variability of facial features. Experimental results indicated an improvement in the performance of the proposed system compared to the Previous approaches at a rate between 2% to 5%. In addition, it decreased the time two times if compared with the Previous techniques, such as Extreme Learning Machine (ELM) & Multi-Scale Structural Similarity index (MS-SSIM). Finally, it achieved an accuracy of 99%.

Keywords: attendance management system, face detection and recognition, live face recognition, minimum ratio

Procedia PDF Downloads 137
4502 Production Planning for Animal Food Industry under Demand Uncertainty

Authors: Pirom Thangchitpianpol, Suttipong Jumroonrut

Abstract:

This research investigates the distribution of food demand for animal food and the optimum amount of that food production at minimum cost. The data consist of customer purchase orders for the food of laying hens, price of food for laying hens, cost per unit for the food inventory, cost related to food of laying hens in which the food is out of stock, such as fine, overtime, urgent purchase for material. They were collected from January, 1990 to December, 2013 from a factory in Nakhonratchasima province. The collected data are analyzed in order to explore the distribution of the monthly food demand for the laying hens and to see the rate of inventory per unit. The results are used in a stochastic linear programming model for aggregate planning in which the optimum production or minimum cost could be obtained. Programming algorithms in MATLAB and tools in Linprog software are used to get the solution. The distribution of the food demand for laying hens and the random numbers are used in the model. The study shows that the distribution of monthly food demand for laying has a normal distribution, the monthly average amount (unit: 30 kg) of production from January to December. The minimum total cost average for 12 months is Baht 62,329,181.77. Therefore, the production planning can reduce the cost by 14.64% from real cost.

Keywords: animal food, stochastic linear programming, aggregate planning, production planning, demand uncertainty

Procedia PDF Downloads 356
4501 Assessing the Antimicrobial Activity of Chitosan Nanoparticles by Fluorescence-Labeling

Authors: Laidson P. Gomes, Cristina T. Andrade, Eduardo M. Del Aguila, Cameron Alexander, Vânia M. F. Paschoalin

Abstract:

Chitosan is a natural polysaccharide prepared by the N-deacetylation of chitin. In this study, the physicochemical and antibacterial properties of chitosan nanoparticles, produced by ultrasound irradiation, were evaluated. The physicochemical properties of the nanoparticles were determined by dynamic light scattering and zeta potential analysis. Chitosan nanoparticles inhibited the growth of E. coli. The minimum inhibitory concentration (MIC) values were lower than 0.5 mg/mL, and the minimum bactericidal concentration (MBC) values were similar or higher than MIC values. Confocal laser scanning micrographs (CLSM) were used to observe the interaction between E. coli suspensions mixed with FITC-labeled chitosan polymers and nanoparticles.

Keywords: chitosan nanoparticles, dynamic light scattering, zeta potential, confocal microscopy, antibacterial activity

Procedia PDF Downloads 478
4500 Efficiency of Robust Heuristic Gradient Based Enumerative and Tunneling Algorithms for Constrained Integer Programming Problems

Authors: Vijaya K. Srivastava, Davide Spinello

Abstract:

This paper presents performance of two robust gradient-based heuristic optimization procedures based on 3n enumeration and tunneling approach to seek global optimum of constrained integer problems. Both these procedures consist of two distinct phases for locating the global optimum of integer problems with a linear or non-linear objective function subject to linear or non-linear constraints. In both procedures, in the first phase, a local minimum of the function is found using the gradient approach coupled with hemstitching moves when a constraint is violated in order to return the search to the feasible region. In the second phase, in one optimization procedure, the second sub-procedure examines 3n integer combinations on the boundary and within hypercube volume encompassing the result neighboring the result from the first phase and in the second optimization procedure a tunneling function is constructed at the local minimum of the first phase so as to find another point on the other side of the barrier where the function value is approximately the same. In the next cycle, the search for the global optimum commences in both optimization procedures again using this new-found point as the starting vector. The search continues and repeated for various step sizes along the function gradient as well as that along the vector normal to the violated constraints until no improvement in optimum value is found. The results from both these proposed optimization methods are presented and compared with one provided by popular MS Excel solver that is provided within MS Office suite and other published results.

Keywords: constrained integer problems, enumerative search algorithm, Heuristic algorithm, Tunneling algorithm

Procedia PDF Downloads 305
4499 Classification of Tropical Semi-Modules

Authors: Wagneur Edouard

Abstract:

Tropical algebra is the algebra constructed over an idempotent semifield S. We show here that every m-dimensional tropical module M over S with strongly independent basis can be embedded into Sm, and provide an algebraic invariant -the Γ-matrix of M- which characterises the isomorphy class of M. The strong independence condition also yields a significant improvement to the Whitney embedding for tropical torsion modules published earlier We also show that the strong independence of the basis of M is equivalent to the unique representation of elements of M. Numerous examples illustrate our results.

Keywords: classification, idempotent semi-modules, strong independence, tropical algebra

Procedia PDF Downloads 352
4498 Two Axial, Quick Mounting and Easily Adjustable Fixturing System

Authors: Özgür Cavbozar, Rasih Hakan Demirkol

Abstract:

In many industries, it is occasionally essential to mount heavy modules to stationary racks or constructions in correct position in minimum time. With the rapid advancement in technology, consumption has increased. Therefore, to meet the higher demands, manufacturers should develope innovative methods to produce and store rapidly manufactured products faster. It is usually very tough to fix the heavy modules in two axes in correct position with fasteners like bolts. This paper represents a design solution for fixing the heavy modules to their racks of stationary shelves exactly with minimum effort. The design solution for a particular study has been proposed. Regarding quick mounting and easily adjustable operations for heavy modules, design and production suggestions have been carried out.

Keywords: exact mounting, mounting of heavy modules, quick mounting, two axial fixturing

Procedia PDF Downloads 57
4497 Incorporating Ground Sand in Production of Self-Consolidating Concrete to Decrease High Paste Volume and Improve Passing Ability of Self-Consolidating Concrete

Authors: S. K. Ling, A. K. H. Kwan

Abstract:

The production of SCC (self-consolidating concrete) generally requires a fairy high paste volume, ranging from 35% to 40% of the total concrete volume. Such high paste volume would lead to low dimensional stability and high carbon footprint. Direct lowering the paste volume would deteriorate the performance of SCC, especially the passing ability. It is often observed that at narrow gap of congested reinforcements, the paste often flows in the front leaving the coarse aggregate particle behind to block the subsequent flow of concrete. Herein, it is suggested to increase the mortar volume through incorporating ground sand with a mean size of 0.3 mm while keeping the paste volume small. Trial concrete mixes with paste volumes of 30% and 34% and different ground sand contents have been tested to demonstrate how the paste volume can be lowered without sacrificing the passing ability. Overall, the results demonstrated that the addition of ground sand would enable the achievement of high passing ability at a relatively small paste volume.

Keywords: ground sand, mortar volume, paste volume, self-consolidating concrete

Procedia PDF Downloads 256
4496 Touching Interaction: An NFC-RFID Combination

Authors: Eduardo Álvarez, Gerardo Quiroga, Jorge Orozco, Gabriel Chavira

Abstract:

AmI proposes a new way of thinking about computers, which follows the ideas of the Ubiquitous Computing vision of Mark Weiser. In these, there is what is known as a Disappearing Computer Initiative, with users immersed in intelligent environments. Hence, technologies need to be adapted so that they are capable of replacing the traditional inputs to the system by embedding these in every-day artifacts. In this work, we present an approach, which uses Radiofrequency Identification (RFID) and Near Field Communication (NFC) technologies. In the latter, a new form of interaction appears by contact. We compare both technologies by analyzing their requirements and advantages. In addition, we propose using a combination of RFID and NFC.

Keywords: touching interaction, ambient intelligence, ubiquitous computing, interaction, NFC and RFID

Procedia PDF Downloads 480
4495 Virtual Dimension Analysis of Hyperspectral Imaging to Characterize a Mining Sample

Authors: L. Chevez, A. Apaza, J. Rodriguez, R. Puga, H. Loro, Juan Z. Davalos

Abstract:

Virtual Dimension (VD) procedure is used to analyze Hyperspectral Image (HIS) treatment-data in order to estimate the abundance of mineral components of a mining sample. Hyperspectral images coming from reflectance spectra (NIR region) are pre-treated using Standard Normal Variance (SNV) and Minimum Noise Fraction (MNF) methodologies. The endmember components are identified by the Simplex Growing Algorithm (SVG) and after adjusted to the reflectance spectra of reference-databases using Simulated Annealing (SA) methodology. The obtained abundance of minerals of the sample studied is very near to the ones obtained using XRD with a total relative error of 2%.

Keywords: hyperspectral imaging, minimum noise fraction, MNF, simplex growing algorithm, SGA, standard normal variance, SNV, virtual dimension, XRD

Procedia PDF Downloads 131
4494 Experimenting with Error Performance of Systems Employing Pulse Shaping Filters on a Software-Defined-Radio Platform

Authors: Chia-Yu Yao

Abstract:

This paper presents experimental results on testing the symbol-error-rate (SER) performance of quadrature amplitude modulation (QAM) systems employing symmetric pulse-shaping square-root (SR) filters designed by minimizing the roughness function and by minimizing the peak-to-average power ratio (PAR). The device used in the experiments is the 'bladeRF' software-defined-radio platform. PAR is a well-known measurement, whereas the roughness function is a concept for measuring the jitter-induced interference. The experimental results show that the system employing minimum-roughness pulse-shaping SR filters outperforms the system employing minimum-PAR pulse-shaping SR filters in the sense of SER performance.

Keywords: pulse-shaping filters, FIR filters, jittering, QAM

Procedia PDF Downloads 323
4493 Using Medicinal Herbs in Designing Green Roofs

Authors: Mohamad Javad Shakouri, Behshad Riahipour

Abstract:

Today, the use of medicinal herbs in architecture and green space has a significant effect on the process of calming human and increases the reliability coefficient of design and design flexibility. The current research was conducted with the aim to design green roof and investigate the effect of medicinal herbs such as cress, leek, fenugreek, beet, sweet fennel, green basil, purple basil, and purslane on reducing the number of environmental pollutants (copper, zinc, and cadmium). Finally, the weight of the dry plant and the concentration of elements zinc, lead, and cadmium in the herbs was measured. According to the results, the maximum dry weight (88.10 and 73.79 g) was obtained in beet and purslane respectively and the minimum dry weight (24.12 and 25.21) was obtained in purple basil, and green basil respectively. The maximum amount of element zinc (235 and 213 mg/kg) and the maximum amount of lead (143 mg/kg) were seen in sweet fennel and purple basil. In addition, the maximum amount of cadmium (13 mg/kg) was seen in sweet fennel and purple basil and the minimum amount of lead and cadmium (78 and 7 mg/kg) was seen in green basil, and the minimum amount of zinc (110 mg/kg) was seen in leek. On the other hand, the absorption amount of element lead in the herbs beet and purslane was the same and both absorbed 123 mg/kg lead. Environmentally, if green roofs are implemented extensively and in wide dimensions in urban spaces, they will purify and reduce pollution significantly by absorbing carbon dioxide and producing oxygen.

Keywords: medicinal herbs, green space, green roof, heavy metals, lead, green basil

Procedia PDF Downloads 141