Search results for: data contents search

Authors: González A. Julio, Ramírez L. Leonardo, Puerta A. Gabriel

Abstract:

Telemedicine services use a large amount of data, most of which are diagnostic images in Digital Imaging and Communications in Medicine (DICOM) and Health Level Seven (HL7) formats. Metadata is generated from each related image to support their identification. This study presents the use of decision trees for the optimization of information search processes for diagnostic images, hosted on the cloud server. To analyze the performance in the server, the following quality of service (QoS) metrics are evaluated: delay, bandwidth, jitter, latency and throughput in five test scenarios for a total of 26 experiments during the loading and downloading of DICOM images, hosted by the telemedicine group server of the Universidad Militar Nueva Granada, Bogotá, Colombia. By applying decision trees as a data mining technique and comparing it with the sequential search, it was possible to evaluate the search times of diagnostic images in the server. The results show that by using the metadata in decision trees, the search times are substantially improved, the computational resources are optimized and the request management of the telemedicine image service is improved. Based on the experiments carried out, search efficiency increased by 45% in relation to the sequential search, given that, when downloading a diagnostic image, false positives are avoided in management and acquisition processes of said information. It is concluded that, for the diagnostic images services in telemedicine, the technique of decision trees guarantees the accessibility and robustness in the acquisition and manipulation of medical images, in improvement of the diagnoses and medical procedures in patients.

Keywords: cloud storage, decision trees, diagnostic image, search, telemedicine

Procedia PDF Downloads 180

Authors: Lamiche Chaabane

Abstract:

In this study, a new method for solving sequence alignment problem is proposed, which is named ITS (Improved Tabu Search). This algorithm is based on the classical Tabu Search (TS). ITS is implemented in order to obtain results of multiple sequence alignment. Several ideas concerning neighbourhood generation, move selection mechanisms and intensification/diversification strategies for our proposed ITS is investigated. ITS have generated high-quality results in terms of measure of scores in comparison with the classical TS and simple iterative search algorithm.

Keywords: multiple sequence alignment, tabu search, improved tabu search, neighbourhood generation, selection mechanisms

Procedia PDF Downloads 269

Authors: R. Islam, Rafiqul A. Tarefder

Abstract:

This study presents the moisture variations of unbound layers from April 2012 to January 2014 in the Interstate 40 (I-40) pavement section in New Mexico. Three moisture probes were installed at different layers inside the pavement which measure the continuous moisture variations of the pavement. Data show that the moisture contents of unbound layers are typically constant throughout the day and month unless there is rainfall. Moisture contents of all unbound layers change with rainfall. Change in ground water table may affect the moisture content of unbound layers which has not investigated in this study. In addition, the Level 3 predictions of moisture contents using the Pavement Mechanistic-Empirical (ME) Design software are compared and found quite reasonable. However, results presented in the current study may not be applicable for pavement in other regions.

Keywords: asphalt pavement, moisture probes, resilient modulus, climate model

Procedia PDF Downloads 465

Authors: Yasmeen A. S. Essawy, Khaled Nassar

Abstract:

With the rapid increase of complexity in the building industry, professionals in the A/E/C industry were forced to adopt Building Information Modeling (BIM) in order to enhance the communication between the different project stakeholders throughout the project life cycle and create a semantic object-oriented building model that can support geometric-topological analysis of building elements during design and construction. This paper presents a model that extracts topological relationships and geometrical properties of building elements from an existing fully designed BIM, and maps this information into a directed acyclic Elemental Graph Data Model (EGDM). The model incorporates BIM-based search algorithms for automatic deduction of geometrical data and topological relationships for each building element type. Using graph search algorithms, such as Depth First Search (DFS) and topological sortings, all possible construction sequences can be generated and compared against production and construction rules to generate an optimized construction sequence and its associated schedule. The model is implemented in a C# platform.

Keywords: building information modeling (BIM), elemental graph data model (EGDM), geometric and topological data models, graph theory

Procedia PDF Downloads 345

Authors: M. M. Fercan, A. S. Kipcak, O. Dere Ozdemir, M. B. Piskin, E. Moroydor Derun

Abstract:

Coffee is a widely consumed beverage with many components such as caffeine, flavonoids, phenolic compounds, and minerals. Coffee consumption continues to increase due to its physiological effects, its pleasant taste, and aroma. Robusta and Arabica are two basic types of coffee beans. The coffee bean used for Turkish coffee is Arabica. There are many elements in the structure of coffee and have various effect on human health such as Sodium (Na), Boron (B), Magnesium (Mg) and Iron (Fe). In this study, the amounts of Mg, Na, Fe, and B contents in Turkish coffee are determined and effect of sugar addition is investigated for conscious consumption. The analysis of the contents of coffees was determined by using inductively coupled plasma optical emission spectrometry (ICP-OES). From the results of the experiments the Mg, Na, Fe and B contents of Turkish coffee after sugar addition were found as 19.83, 1.04, 0.02, 0.21 ppm, while without using sugar these concentrations were found 21.46, 0.81, 0.008 and 0.16 ppm. In addition, element contents were calculated for 1, 3 and 5 cups of coffee in order to investigate the health effects.

Keywords: health effect, ICP-OES, sugar, Turkish coffee

Procedia PDF Downloads 462

Authors: Halil Ibrahim Demir, Alper Goksu, Onur Canpolat, Caner Erden, Melek Nur

Abstract:

Traditionally process planning, scheduling and due date assignment are performed sequentially and separately. High interrelation between these functions makes integration very useful. Although there are numerous works on integrated process planning and scheduling and many works on scheduling with due date assignment, there are only a few works on the integration of these three functions. Here we tested the different integration levels of these three functions and found a fully integrated version as the best. We applied genetic search and random search and genetic search was found better compared to the random search. We penalized all earliness, tardiness and due date related costs. Since all these three terms are all undesired, it is better to penalize all of them.

Keywords: process planning, scheduling, due-date assignment, genetic algorithm, random search

Procedia PDF Downloads 351

Authors: Ibrahim Umar, S Chindo, A Rajab

Abstract:

Background: TB remains a disease of public health concern in Nigeria with an estimated incidence rate of 219/100,000. Kano has the second highest TB burden in Nigeria and is the leading state with the highest consistent yearly TB notification. House-to-house (H2H) active case search in the community was found to have major contribution to the total TB notification in the state. Aims and Objective: To showcase the impact of H2H community active TB case search (ACF) to yearly TB notification in Kano State, Northern Nigeria from 2012 to 2022. Methodology: This is a retrospective descriptive study based on the analysis of data collected during the routine quarterly and yearly TB data collected in the state. Data was analyzed using the Power BI with statistical alpha level of significance <0.05. Results: Between 2012 and 2013 there was no House-to-house active TB case search in Nigeria and Kano had zero contribution to TB notification from the community in those years. However, in 2014 with the introduction of H2H Active TB Case Search Kano notified 6,014 TB cases out of which 113 came from the community ACF that translated to 2% contribution to total TB notification. From 2014 to 2022 there was progressive increase in community contribution to TB case notification from 113 out of 6,014 total TB patients notified (2012) to 11,799 out of 26,371 TB patients notified (2022) in Kano State. This translated to 45% increase in community contribution to total TB case notification. Discussion: Remarkable increase in community contribution to total TB case notification in Kano State was achieved in 2022 with 11,799 TB cases notified from the community Active TB case search to the total of 26,731 TB cases notified in Kano State, Nigeria. Conclusion: in research has shown that Community-based H2H Active TB Case Search through Community TB Workers (CTWs) is an excellent strategy in finding the missing TB cases towards Ending TB in the world.

Keywords: tuberculosis(TB), active case search (ACF), house-to-house (H2H), community TB workers (CTWs)

Procedia PDF Downloads 31

Authors: Karine B. de Oliveira, Carina F. Dorneles

Abstract:

The structure level matching is the problem of combining elements of a structure, which can be represented as entities, classes, XML elements, web forms, and so on. This is a challenge due to large number of distinct representations of semantically similar structures. This paper describes a structure-based matching method applied to search for different representations in data sources, considering the similarity between elements of two structures and the data source context. Using real data sources, we have conducted an experimental study comparing our approach with our baseline implementation and with another important schema matching approach. We demonstrate that our proposal reaches higher precision than the baseline.

Keywords: context, data source, index, matching, search, similarity, structure

Procedia PDF Downloads 333

Authors: Maisyatus Suadaa Irfana, Nove Eka Variant Anna, Dyah Puspitasari Sri Rahayu

Abstract:

Technological developments provide convenience to all the people. Nowadays, the communication of human with the computer is done via text. With the development of technology, human and computer communications have been conducted with a voice like communication between human beings. It provides an easy facility for many people, especially those who have special needs. Voice search technology is applied in the search of book collections in the OPAC (Online Public Access Catalog), so library visitors will find it faster and easier to find books that they need. Integration with Google is needed to convert the voice into text. To optimize the time and the results of searching, Server will download all the book data that is available in the server database. Then, the data will be converted into JSON format. In addition, the incorporation of some algorithms is conducted including Decomposition (parse) in the form of array of JSON format, the index making, analyzer to the result. It aims to make the process of searching much faster than the usual searching in OPAC because the data are directly taken to the database for every search warrant. Data Update Menu is provided with the purpose to enable users perform their own data updates and get the latest data information.

Keywords: OPAC, voice, searching, faster

Procedia PDF Downloads 318

Authors: Gemma García López

Abstract:

The goal of this study is to analyze if search queries carried out in search engines such as Google, can offer emotional information about the user that performs them. Knowing the emotional state in which the Internet user is located can be a key to achieve the maximum personalization of content and the detection of worrying behaviors. For this, two studies were carried out using tools with advanced natural language processing techniques. The first study determines if a query can be classified as positive, negative or neutral, while the second study extracts emotional content from words and applies the categorical and dimensional models for the representation of emotions. In addition, we use search queries in Spanish and English to establish similarities and differences between two languages. The results revealed that text search queries performed by users on the Internet can be classified emotionally. This allows us to better understand the emotional state of the user at the time of the search, which could involve adapting the technology and personalizing the responses to different emotional states.

Keywords: emotion classification, text search queries, emotional analysis, sentiment analysis in text, natural language processing

Procedia PDF Downloads 115

Authors: Akanit Pisalwadcharin, Komate Satayawut, Virachnee Lohachoompol

Abstract:

Green tea, mangosteen and pomegranate contain high levels of bioactive compounds which have antioxidant effects and great potential in food applications. The aim of this study was to produce and determine catechin contents, total phenolic contents, antioxidant activity and phenolic compounds of two instant fruit green tea powders which were green tea fortified with mangosteen juice and green tea fortified with pomegranate juice. Seventy percent of hot water extract of green tea was mixed with 30% of mangosteen juice or pomegranate juice, and then spray-dried using a spray dryer. The results showed that the drying conditions optimized for the highest total phenolic contents, catechin contents and antioxidant activity of both powders were the inlet air temperature of 170°C, outlet air temperatures of 90°C and maltodextrin concentration of 30%. The instant green tea with mangosteen powder had total phenolic contents, catechin contents and antioxidant activity of 19.18 (mg gallic acid/kg), 85.44 (mg/kg) and 4,334 (µmoles TE/100 g), respectively. The instant green tea with pomegranate powder had total phenolic contents, catechin contents and antioxidant activity of 32.72 (mg gallic acid/kg), 156.36 (mg/kg) and 6,283 (µmoles TE/100 g), respectively. The phenolic compounds in instant green tea with mangosteen powder comprised of tannic acid (2,156.87 mg/kg), epigallocatechin-3-gallate (898.23 mg/kg) and rutin (13.74 mg/kg). Also, the phenolic compounds in instant green tea with pomegranate powder comprised of tannic acid (2,275.82 mg/kg), epigallocatechin-3-gallate (981.23 mg/kg), rutin (14.97 mg/kg) and i-quercetin (5.86 mg/kg).

Keywords: green tea, mangosteen, pomegranate, antioxidant activity

Procedia PDF Downloads 332

Authors: Ladislav Kristoufek, Helen Susannah Moat, Tobias Preis

Abstract:

Data on the number of people who have committed suicide tends to be reported with a substantial time lag of around two years. We examine whether online activity measured by Google searches can help us improve estimates of the number of suicide occurrences in England before official figures are released. Specifically, we analyse how data on the number of Google searches for the terms “depression” and “suicide” relate to the number of suicides between 2004 and 2013. We find that estimates drawing on Google data are significantly better than estimates using previous suicide data alone. We show that a greater number of searches for the term “depression” is related to fewer suicides, whereas a greater number of searches for the term “suicide” is related to more suicides. Data on suicide related search behaviour can be used to improve current estimates of the number of suicide occurrences.

Keywords: nowcasting, search data, Google Trends, official statistics

Procedia PDF Downloads 333

Authors: Mahdi Salarian, Xi Xu, Rashid Ansari

Abstract:

Accurate localization of mobile devices based on camera-acquired visual media information usually requires a search over a very large GPS-referenced image database. This paper proposes an efficient method for limiting the search space for image retrieval engine by extracting and leveraging additional media information about Estimated Positional Error (EP E) to address complexity and accuracy issues in the search, especially to be used for compensating GPS location inaccuracy in dense urban areas. The improved performance is achieved by up to a hundred-fold reduction in the search area used in available reference methods while providing improved accuracy. To test our procedure we created a database by acquiring Google Street View (GSV) images for down town of Chicago. Other available databases are not suitable for our approach due to lack of EP E for the query images. We tested the procedure using more than 200 query images along with EP E acquired mostly in the densest areas of Chicago with different phones and in different conditions such as low illumination and from under rail tracks. The effectiveness of our approach and the effect of size and sector angle of the search area are discussed and experimental results demonstrate how our proposed method can improve performance just by utilizing a data that is available for mobile systems such as smart phones.

Keywords: localization, retrieval, GPS uncertainty, bag of word

Procedia PDF Downloads 258

Authors: Arslan Ellahi, Syed Amjad Hussain

Abstract:

Software Testing is a vital process in software development life cycle. We can attain the quality of software after passing it through software testing phase. We have tried to find out automatic test data generation techniques that are a key research area of software testing to achieve test automation that can eventually decrease testing time. In this paper, we review some of the approaches presented in the literature which use evolutionary search based algorithms like Genetic Algorithm, Particle Swarm Optimization (PSO), etc. to validate the test data generation process. We also look into the quality of test data generation which increases or decreases the efficiency of testing. We have proposed test data generation techniques for model-based testing. We have worked on tuning and fitness function of PSO algorithm.

Keywords: search based, evolutionary algorithm, particle swarm optimization, genetic algorithm, test data generation

Procedia PDF Downloads 156

Authors: Arah Abubakar Saidu, Audu Rufai, Abdulkadir Mohammed, Ibrahim Yakubu Umar, Idris Abubakar Mohammed

Abstract:

The study determined the contents for the maintenance and troubleshooting of an anti-lock braking system for automobile craftsmen in Nigeria. Two research questions were raised and answered and two null hypotheses were formulated and tested at a .05 level of significance. The study adopted a descriptive survey research design. The study was conducted in Federal Capital Territory (FCT), Abuja, Kaduna, Kano, Lagos and Plateau States, Nigeria. The targeted population for the study was 99 consisting of all 43 non-teaching Subject Matter Experts (SMEs). The study utilized the whole population of the study. The instruments used for data collection were Anti-lock Braking System Maintenance and Troubleshooting Contents Questionnaire (ABSMTQ). Mean was used to analyze data that answered research questions and Z-test was used in testing the null hypotheses. Findings revealed, among others, that 81 items as content for the maintenance of ABS and 61 items as content for troubleshooting ABS for automobile craftsmen in Nigeria. Based on the findings of the study, the recommended, among others, that the National Board for Technical Education should include the contents for the maintenance and troubleshooting ABS in Motor Vehicle Mechanic Works curriculum used for training automobile craftsmen through the process of curriculum review in order to equip them with the competencies in troubleshooting and maintenance of ABS.

Keywords: anti-lock braking system, maintenance, troubleshooting, automobile craftsmen

Procedia PDF Downloads 59

Authors: Mohammed Belloufi, Rachid Benzine, Badreddine Sellami

Abstract:

Conjugate gradient methods is useful for solving large scale optimization problems in scientific and engineering computation, characterized by the simplicity of their iteration and their low memory requirements. It is well known that the search direction plays a main role in the line search method. In this paper, we propose a search direction with the Wolfe line search technique for solving unconstrained optimization problems. Under the above line searches and some assumptions, the global convergence properties of the given methods are discussed. Numerical results and comparisons with other CG methods are given.

Keywords: unconstrained optimization, conjugate gradient method, strong Wolfe line search, global convergence

Procedia PDF Downloads 385

Authors: Meng-Hui Chen, Chiao-Wei Yu, Pei-Chann Chang

Abstract:

Imperial competitive algorithm (ICA) simulates a multi-agent algorithm. Each agent is like a kingdom has its country, and the strongest country in each agent is called imperialist, others are colony. Countries are competitive with imperialist which in the same kingdom by evolving. So this country will move in the search space to find better solutions with higher fitness to be a new imperialist. The main idea in this paper is using the peculiarity of ICA to explore the search space to solve the kinds of combinational problems. Otherwise, we also study to use the greed search to increase the local search ability. To verify the proposed algorithm in this paper, the experimental results of traveling salesman problem (TSP) is according to the traveling salesman problem library (TSPLIB). The results show that the proposed algorithm has higher performance than the other known methods.

Keywords: traveling salesman problem, artificial chromosomes, greedy search, imperial competitive algorithm

Procedia PDF Downloads 425

Authors: Wahyu Widodo, Imbang Dwi Rahayu, Adi Sutanto

Abstract:

The purpose of this research was to analyze the effect of the fermented organic feed to dry matter, ash, organic matter, protein, fat and crude fiber contents of kampong chicken meat. The research had conducted at January until June, 2016. One hundreds chickens were used in this research. Experimental method and completely randomized design were used to support this research. We had 4 treatment namely P0: organic feed without fermentation, P1: Organic feed with fermented rice bran, P2: Organic feed with fermented corn, P3: Organic feed with fermented rice bran and corn with 5 replication. The conclusion was the treatment had not a significant effect in the dry matter, ash, organic matter and protein contents of chicken meat. On the other hand, it had a significant effect in the fat and crude fiber contents of chicken meat.

Keywords: corn, fermented organic feed, nutritive contents, rice bran

Procedia PDF Downloads 284

Authors: Khaled Moh. Alhamad

Abstract:

This paper describes a tabu search heuristic for a ship routing and scheduling problem (SRSP). The method was developed to address the problem of loading cargos for many customers using heterogeneous vessels. Constraints relate to delivery time windows imposed by customers, the time horizon by which all deliveries must be made and vessel capacities. The results of a computational investigation are presented. Solution quality and execution time are explored with respect to problem size and parameters controlling the tabu search such as tenure and neighbourhood size.

Keywords: heuristic, scheduling, tabu search, transportation

Procedia PDF Downloads 478

Authors: Wen-Bao Qiao, Jean-Charles Créput

Abstract:

To accelerate the solution for large scale traveling salesman problems (TSP), a parallel 2-opt local search algorithm with simple implementation based on Graphics Processing Unit (GPU) is presented and tested in this paper. The parallel scheme is based on technique of data decomposition by dynamically assigning multiple K processors on the integral tour to treat K edges’ 2-opt local optimization simultaneously on independent sub-tours, where K can be user-defined or have a function relationship with input size N. We implement this algorithm with doubly linked list on GPU. The implementation only requires O(N) memory. We compare this parallel 2-opt local optimization against sequential exhaustive 2-opt search along integral tour on TSP instances from TSPLIB with more than 10000 cities.

Keywords: parallel 2-opt, double links, large scale TSP, GPU

Procedia PDF Downloads 594

Authors: Allagui Mohamed

Abstract:

The study of the temporal variation of the PM10 and the SO₂ in the area of Sfax during the year of 2008, showed very significant fluctuations of the contents. They depend on the transmitting sources and the weather conditions. The study of the evolutionary behavior of the PM10 and the SO₂ in a situation of the Sirocco revealed the determining influence of the Sahara which was confirmed by its strong enrichment of the atmosphere with particulate matter. The analysis of a situation of breeze of sea highlighted the increase in the contents of the PM10 of agreement with the increase the speed of the marine wind, in particular for the diurnal period, possibly testifying to the enrichment of the aerosol in a considerable maritime component. A situation of anticyclonic winter examined when with it the accumulation of the contents of the PM10 at a rate of 70 μg/m³ showed such concentrations remained weak by comparison with other studies which show contents of about 300 μg/m³.

Keywords: PM10, sea breeze, SO₂, sirocco, anticyclone

Procedia PDF Downloads 103

Authors: Halil Ibrahim Demir, Caner Erden, Abdullah Hulusi Kokcam, Mumtaz Ipek

Abstract:

Process planning, scheduling, and due date assignment are three important manufacturing functions which are studied independently in literature. There are hundreds of works on IPPS and SWDDA problems but a few works on IPPSDDA problem. Integrating these three functions is very crucial due to the high relationship between them. Since the scheduling problem is in the NP-Hard problem class without any integration, an integrated problem is even harder to solve. This study focuses on the integration of these functions. Sum of weighted tardiness, earliness, and due date related costs are used as a penalty function. Random search and hybrid metaheuristics are used to solve the integrated problem. Marginal improvement in random search is very high in the early iterations and reduces enormously in later iterations. At that point directed search contribute to marginal improvement more than random search. In this study, random and genetic search methods are combined to find better solutions. Results show that overall performance becomes better as the integration level increases.

Keywords: process planning, genetic algorithm, hybrid search, random search, weighted due-date assignment, weighted scheduling

Procedia PDF Downloads 337

Authors: Parag Bhalchandra, S. D. Khamitkar

Abstract:

Searching trees is a most interesting application of Artificial Intelligence. Over the period of time, many innovative methods have been evolved to better search trees with respect to computational complexities. Tree searches are difficult to understand due to the exponential growth of possibilities when increasing the number of nodes or levels in the tree. Usually it is understood when we traverse down in the tree, traverse down to greater depth, in the search of a solution or a goal. However, this does not happen in reality as explicit enumeration is not a very efficient method and there are many algorithmic speedups that will find the optimal solution without the burden of evaluating all possible trees. It was a common question before all researchers where they often wonder what algorithms will yield the best and fastest result The intention of this paper is two folds, one to review selected tree search algorithms and search strategies that can be applied to a problem space and the second objective is to stimulate to implement recent developments in the complexity behavior of search strategies. The algorithms discussed here apply in general to both brute force and heuristic searches.

Keywords: trees search, asymptotic complexity, brute force, heuristics algorithms

Procedia PDF Downloads 282

Authors: Shih-Ting Yang, Chih-Yun Lin, Ming-Yu Li, Jhong-Ting Syue, Wei-Ming Huang

Abstract:

Global positioning system (GPS) has become increasing precise in recent years, and the location-based service (LBS) has developed rapidly. Take the example of finding a parking lot (such as Parking apps). The location-based service can offer immediate information about a nearby parking lot, including the information about remaining parking spaces. However, it cannot provide expected search results according to the requirement situations of users. For that reason, this paper develops a “Location-based Search Approach according to Users’ Application Scenario” according to the location-based search and demand determination to help users obtain the information consistent with their requirements. The “Location-based Search Approach based on Users’ Application Scenario” of this paper consists of one mechanism and three kernel modules. First, in the Information Pre-processing Mechanism (IPM), this paper uses the cosine theorem to categorize the locations of users. Then, in the Information Category Evaluation Module (ICEM), the kNN (k-Nearest Neighbor) is employed to classify the browsing records of users. After that, in the Information Volume Level Determination Module (IVLDM), this paper makes a comparison between the number of users’ clicking the information at different locations and the average number of users’ clicking the information at a specific location, so as to evaluate the urgency of demand; then, the two-dimensional space is used to estimate the application situations of users. For the last step, in the Location-based Search Module (LBSM), this paper compares all search results and the average number of characters of the search results, categorizes the search results with the Manhattan Distance, and selects the results according to the application scenario of users. Additionally, this paper develops a Web-based system according to the methodology to demonstrate practical application of this paper. The application scenario-based estimate and the location-based search are used to evaluate the type and abundance of the information expected by the public at specific location, so that information demanders can obtain the information consistent with their application situations at specific location.

Keywords: data mining, knowledge management, location-based service, user application scenario

Procedia PDF Downloads 86

Authors: Aniket Ganvir, Ritarani Sahu, Suchismita Chinara

Abstract:

The rapid digitization of various aspects of life is leading to the creation of smart IoT ecosystems, where interconnected devices generate significant amounts of valuable data. However, these IoT devices face constraints such as limited computational resources and bandwidth. Cloud computing emerges as a solution by offering ample resources for offloading tasks efficiently despite introducing latency issues, especially for time-sensitive applications like fog computing. Fog computing (FC) addresses latency concerns by bringing computation and storage closer to the network edge, minimizing data travel distance, and enhancing efficiency. Offloading tasks to fog nodes or the cloud can conserve energy and extend IoT device lifespan. The offloading process is intricate, with tasks categorized as full or partial, and its optimization presents an NP-hard problem. Traditional greedy search methods struggle to address the complexity of task offloading efficiently. To overcome this, the efficient crow search algorithm (ECSA) has been proposed as a meta-heuristic optimization algorithm. ECSA aims to effectively optimize computation offloading, providing solutions to this challenging problem.

Keywords: IoT, fog computing, task offloading, efficient crow search algorithm

Procedia PDF Downloads 15

Authors: Getu Dessalegn Asfaw, Yalew Dessalegn Asfaw

Abstract:

This research aims to examine the chemical composition of bamboo species in Ethiopia under the effect of age and culm height. The chemical composition of bamboo species in Ethiopia has not been investigated so far. The highest to the lowest cellulose and hemicellulose contents are Injibara (Y. alpina), Mekaneselam (Y. alpina), and Kombolcha (B. oldhamii), whereas lignin, extractives, and ash contents are Kombolcha, Mekanesealm, and Injibra, respectively. As a result of this research, the highest and lowest cellulose, hemicelluloses and lignin contents are at the age of 2 and 1 year old, respectively. Whereas extractives and ash contents are decreased at the age of the culm matured. The cellulose, hemicelluloses, lignin, and ash contents of the culm increase from the bottom to top along the height, however, extractive contents decrease from the bottom to top position. The cellulose content of Injibara, Kombolch, and Mekaneselam bamboo was recorded at 51±1.7–53±1.8%, 45±1.6%–48±1.5%, and 48±1.8–51±1.6%, and hemicelluloses content was measured at 20±1.2–23±1.1%, 17±1.0–19±0.9%, and 18±1.0–20±1.0%, lignin content was measured 19±1.0–21±1.1%, 27±1.2–29±1.1%, and 21±1.1–24±1.1%, extractive content was measured 3.9±0.2 –4.5±0.2%, 6.6±0.3–7.8±0.4%, and 4.7±0.2–5.2±0.1%, ash content was measured 1.6±0.1–2.1±0.1%, 2.8±0.1–3.5±0.2%, and 1.9±0.1–2.5±0.1% at the ages of 1–3 years old, respectively. This result demonstrated that bamboo species in Ethiopia can be a source of feedstock for lignocelluloses ethanol and bamboo composite production since they have higher cellulose content.

Keywords: age, bamboo species, culm height, chemical composition

Procedia PDF Downloads 73

Authors: Ebert Brea

Abstract:

We propose a novel direct search algorithm for identifying at least a local minimum of mixed integer nonlinear unconstrained optimization problems. The Mixed Integer Randomized Pattern Search Algorithm (MIRPSA), so-called by the author, is based on a randomized pattern search, which is modified by the MIRPSA for finding at least a local minimum of our problem. The MIRPSA has two main operations over the randomized pattern search: moving operation and shrinking operation. Each operation is carried out by the algorithm when a set of conditions is held. The convergence properties of the MIRPSA is analyzed using a Markov chain approach, which is represented by an infinite countable set of state space λ, where each state d(q) is defined by a measure of the qth randomized pattern search Hq, for all q in N. According to the algorithm, when a moving operation is carried out on the qth randomized pattern search Hq, the MIRPSA holds its state. Meanwhile, if the MIRPSA carries out a shrinking operation over the qth randomized pattern search Hq, the algorithm will visit the next state, this is, a shrinking operation at the qth state causes a changing of the qth state into (q+1)th state. It is worthwhile pointing out that the MIRPSA never goes back to any visited states because the MIRPSA only visits any qth by shrinking operations. In this article, we describe the MIRPSA for mixed integer nonlinear unconstrained optimization problems for doing a deep study of its convergence properties using Markov chain viewpoint. We herein include a low dimension case for showing more details of the MIRPSA, when the algorithm is used for identifying the minimum of a mixed integer quadratic function. Besides, numerical examples are also shown in order to measure the performance of the MIRPSA.

Keywords: direct search, mixed integer optimization, random search, convergence, Markov chain

Procedia PDF Downloads 434

Authors: Pakinee Aimmanee, Phoom Chokratsamesiri

Abstract:

Search engine has become an essential tool nowadays for people to search for their needed information on the internet. In this work, we evaluate the performance of the search engine from three factors: the keyword frequency, the number of inbound links, and the difficulty of the keyword. The evaluations are based on the ranking position and the number of days that Google has seen or detect the webpage. We find that the keyword frequency and the difficulty of the keyword do not affect the Google ranking where the number of inbound links gives remarkable improvement of the ranking position. The optimal number of inbound links found in the experiment is 10.

Keywords: SEO, information retrieval, web search, knowledge technologies

Procedia PDF Downloads 259

Authors: Haruna Shola Adeosun, Lekan M. Togunwa, Ajoke F. Adebiyi

Abstract:

This paper examines the impact of social media on Nigerian Youths particularly in Nigeria. This study reviewed secondary sources data. The research adopted survey method which involves the use of questionnaire that was administered to gather primary data analysis and presentation were done with the use of tables, figures, percentages and chi-square were used to test the hypotheses formulated. The study revealed that social media consumers, especially Facebook are prone to the benefits or risks aspect of its contents. At this expense, what user derived, seeks, sought and gains from such media depend on the motive they are being used for. The study also revealed that users have the tendency to be positively influenced through heavy or over exposure to numerous contents that are damaging and harmful. This means that social media usage may be considered as good or bad. As its contents may or may not subject consumers to vulnerable use depending on what is saved from it. The study recommends that the use of Facebook should be subjected to gate keeping and monitoring in order to control the activities of users that embrace depression, bullying, sexing and sexual harassment as a way of life. Parents should close watch on their children and caution them towards cultivating the habit of over exposure to social sites so at to protect them form risks social media poses.

Keywords: evaluation, impact, soocial media, nigerian youths

Procedia PDF Downloads 264

Authors: Daniel Panario, Daniel Santana de Freitas, Brett Stevens

Abstract:

Almost Perfect Nonlinear (APN) permutations with optimal resistance against differential cryptanalysis can be found in several domains. The permutation used in the standard for symmetric cryptography (the AES), for example, is based on a special kind of inversion in GF(28). Although very close to APN (2-uniform), this permutation still contains one number 4 in its differential spectrum, which means that, rigorously, it must be classified as 4-uniform. This fact motivates the search for fully APN permutations in other domains of definition. The extremely high complexity associated to this kind of problem precludes an exhaustive search for an APN permutation with 256 elements to be performed without the support of a suitable mathematical structure. On the other hand, in principle, there is nothing to indicate which mathematically structured domains can effectively help the search, and it is necessary to test several domains. In this work, the search for APN permutations in rings ℤ2×ℤ2k is investigated. After a full, exhaustive search with k=2 and k=3, all possible APN permutations in those rings were recorded, together with their differential profiles. Some very promising heuristics in these cases were collected so that, when used as a basis to prune backtracking for the same search in ℤ2×ℤ8 (search space with size 16! ≅244), just a few tenths of a second were enough to produce an APN permutation in a single CPU. Those heuristics were empirically extrapolated so that they could be applied to a backtracking search for APNs over ℤ2×ℤ16 (search space with size 32! ≅2117). The best permutations found in this search were further refined through Simulated Annealing, with a definition of neighbors suitable to this domain. The best result produced with this scheme was a 3-uniform permutation over ℤ2×ℤ16 with only 24 values equal to 3 in the differential spectrum (all the other 968 values were less than or equal 2, as it should be the case for an APN permutation). Although far from being fully APN, this result is technically better than a 4-uniform permutation and demanded only a few seconds in a single CPU. This is a strong indication that the use of mathematically structured domains, like the rings described in this work, together with heuristics based on smaller cases, can lead to dramatic cuts in the computational resources involved in the complexity of the search for APN permutations in extremely large domains.

Keywords: APN permutations, heuristic searches, symmetric cryptography, S-box design

Procedia PDF Downloads 129