Performance Evaluation of DV-HOP and Amorphous Algorithms based on Localization Schemes in Wireless Sensor Networks

In the field of high-risk observation, the nodes in Wireless Sensor Network (WSN) are distributed randomly. The result from sensing becomes meaningless if it is not known from where the originating node is. Therefore, a sensor node positioning scheme, known as the localization scheme, is required. The localization scheme consists of distance estimation and position computing. Thus, this research used connectivity as distance estimation within range free algorithm DV-Hop and Amorphous, and then trilateral algorithm for computing the position. Besides that, distance estimation using the connectivity between nodes is not needed for the additional hardware ranging as required by a range-based localization scheme. In this research compared the localization algorithm based on range free localization, which are DV-Hop algorithm and Amorphous algorithm. The simulation result shows that the amorphous algorithm have achieved 13.60% and 24.538% lower than dv-hop algorithm for each parameter error localization and energy consumption. On node density variations, dv-hop algorithm gained a localization error that is 26.95% lower than amorphous algorithm, but for energy consumption parameter, amorphous gained 14.227% lower than dv-hop algorithm. In the communication range variation scenario, dv-hop algorithm gained a localization error that is50.282% lower than amorphous. However, for energy consumption parameter, amorphous algorithm gained 12.35%. lower than dv-hop algorithm

Localization Process for WSNs with Various Grid-Based Topology Using Artificial Neural Network

Wireless Sensor Network (WSN) is a technology that can aid human life by providing ubiquitous communication, sensing, and computing capabilities. It allows people to be more able to interact with the environment. The environment contains many nodes to monitor and collect data. Localizing nodes distributed in different locations covering different regions is a challenge in WSN. Localization of accurate and low-cost sensors is an urgent need to deploy WSN in various applications. In this paper, we propose an artificial automatic neural network method for sensor node localization. The proposed method in WSN is implemented with network-based topology in different regions. To demonstrate the accuracy of the proposed method, we compared the estimated locations of the proposed feedforward neural network (FFNN) with the estimated locations of the deep feedforward neural network (DFF) and the weighted centroid localization (WCL) algorithm based on the strength of the received signal index. The proposed FFNN model outperformed alternative methods in terms of its lower average localization error which is 0.056m. Furthermore, it demonstrated its capability to predict sensor locations in wireless sensor networks (WSNs) across various grid-based topologies

Localization Process for WSNs with Various Grid-Based Topology Using Artificial Neural Network

Wireless Sensor Network (WSN) is a technology that can aid human life by providing ubiquitous communication, sensing, and computing capabilities. It allows people to be more able to interact with the environment. The environment contains many nodes to monitor and collect data. Localizing nodes distributed in different locations covering different regions is a challenge in WSN. Localization of accurate and low-cost sensors is an urgent need to deploy WSN in various applications. In this paper, we propose an artificial automatic neural network method for sensor node localization. The proposed method in WSN is implemented with network-based topology in different regions. To demonstrate the accuracy of the proposed method, we compared the estimated locations of the proposed feedforward neural network (FFNN) with the estimated locations of the deep feedforward neural network (DFF) and the weighted centroid localization (WCL) algorithm based on the strength of the received signal index. The proposed FFNN model outperformed alternative methods in terms of its lower average localization error which is 0.056m. Furthermore, it demonstrated its capability to predict sensor locations in wireless sensor networks (WSNs) across various grid-based topologies

Evaluation of the Classification Accuracy of the Kidney Biopsy Direct Immunofluorescence through Convolutional Neural Networks

Background and objectives: Immunohistopathology is an essential technique in the diagnostic workflow of a kidney biopsy. Deep learning is an effective tool in the elaboration of medical imaging. We wanted to evaluate the role of a convolutional neural network as a support tool for kidney immunofluorescence reporting. Design, setting, participants, & measurements: High-magnification ( 7400) immunofluorescence images of kidney biopsies performed from the year 2001 to 2018 were collected. The report, adopted at the Division of Nephrology of the AOU Policlinico di Modena, describes the specimen in terms of \u201cappearance,\u201d \u201cdistribution,\u201d \u201clocation,\u201d and \u201cintensity\u201d of the glomerular deposits identified with fluorescent antibodies against IgG, IgA, IgM, C1q and C3 complement fractions, fibrinogen, and \u3ba- and \u3bb-light chains. The report was used as ground truth for the training of the convolutional neural networks. Results: In total, 12,259 immunofluorescence images of 2542 subjects undergoing kidney biopsy were collected. The test set analysis showed accuracy values between 0.79 (\u201cirregular capillary wall\u201d feature) and 0.94 (\u201cfine granular\u201d feature). The agreement test of the results obtained by the convolutional neural networks with respect to the ground truth showed similar values to three pathologists of our center. Convolutional neural networks were 117 times faster than human evaluators in analyzing 180 test images. A web platform, where it is possible to upload digitized images of immunofluorescence specimens, is available to evaluate the potential of our approach. Conclusions: The data showed that the accuracy of convolutional neural networks is comparable with that of pathologists experienced in the field

Constructing living buildings: a review of relevant technologies for a novel application of biohybrid robotics

Biohybrid robotics takes an engineering approach to the expansion and exploitation of biological behaviours for application to automated tasks. Here, we identify the construction of living buildings and infrastructure as a high-potential application domain for biohybrid robotics, and review technological advances relevant to its future development. Construction, civil infrastructure maintenance and building occupancy in the last decades have comprised a major portion of economic production, energy consumption and carbon emissions. Integrating biological organisms into automated construction tasks and permanent building components therefore has high potential for impact. Live materials can provide several advantages over standard synthetic construction materials, including self-repair of damage, increase rather than degradation of structural performance over time, resilience to corrosive environments, support of biodiversity, and mitigation of urban heat islands. Here, we review relevant technologies, which are currently disparate. They span robotics, self-organizing systems, artificial life, construction automation, structural engineering, architecture, bioengineering, biomaterials, and molecular and cellular biology. In these disciplines, developments relevant to biohybrid construction and living buildings are in the early stages, and typically are not exchanged between disciplines. We, therefore, consider this review useful to the future development of biohybrid engineering for this highly interdisciplinary application.publishe

Assessing the Effectiveness of Defect Prediction-based Test Suites at Localizing Faults

Debugging a software program constitutes a significant and laborious task for programmers, often consuming a substantial amount of time. The need to identify faulty lines of code further compounds this challenge, leading to decreased overall productivity. Consequently, the development of automated tools for fault detection becomes imperative to streamline the debugging process and enhance programmer productivity. In recent years, the field of automatic test generation has witnessed remarkable advancements, significantly improving the efficacy of automatic tests in detecting faults. The localization of faults can be further optimized through the utilization of such sophisticated tools. This dissertation aims to conduct an experimental study that assembles specialized automatic test generation tools designed to detect faults by estimating the likelihood of code being faulty. These tools will be compared against each other to discern their relative performance and effectiveness. Additionally, the study will comprehensively compare developer-generated tests with automatically generated tests to evaluate their respective aptitude for fault detection. Through this investigation, we seek to identify the most effective automated test generation tool while providing valuable insights into the relative merits of developer-generated and automatically generated tests for fault detection

تقييم أداء خوارزميات تحديد الموقع في شبكات الحساسات اللاسلكية

تعد عملية تحديد موقع عقد الحساسات اللاسلكية المنتشرة في الوسط ضرورية من أجل التطبيقات التي تعد فيها المعلومات المتعلقة بموقع التحسس معلومات مهمة كتطبيقات الأمن والحماية وتتبع الأهداف وغيرها من التطبيقات. تصنف خوارزميات تحديد الموقع إلى نوعين: المعتمدة على المدى( (Range-basedوغير المعتمدة على المدى(Range-free). ركزت الدراسة على الخوارزميات غير المعتمدة على المدى لأنها أقل كلفة من حيث متطلبات أجهزة العتاد الصلب المستخدمة. استخدم الماتلاب في محاكاة الخوارزميات، حيثُ جرى تقييم أدائها في ظل تغيير عدد العقد الشبكية، عدد العقد المرجعية، إضافة الى مجال اتصال العقد بغيةَ توضيحِ اختلافات الأداء من ناحية خطأ الموقع. أظهرت النتائج تفوق خوارزمية عدم الانتظام(Amorphous)، محققة دقة عالية في تحديد الموقع، وكلفة أقل بالنسبة الى عدد العقد المرجعية المطلوبة لتحقيق خطأ موقع صغير. The location of wireless sensor nodes located in the center is necessary for applications where information about the site is important information such as security, protection, object tracking and other applications. localization algorithms are classified into two types: Range-based and Range-free. The study focused on Range-free localization algorithms because they are less expensive in terms of hardware requirements. The MATLAB was used to simulate the algorithms, whose performance was evaluated by changing the number of network nodes, the number of Anchor nodes, and the contract area of ​​communication in order to illustrate performance differences in terms of localization error. The results showed the superiority of the amorphous algorithm, achieving high localization accuracy and lower cost for the number of Anchor nodes needed to achieve a small error

Determining Material Structures and Surface Chemistry by Genetic Algorithms and Quantum Chemical Simulations

With the advent of modern computing, the use of simulation in chemistry has become just as important as experiment. Simulations were originally only applicable to small molecules, but modern techniques, such as density functional theory (DFT) allow extension to materials science. While there are many valuable techniques for synthesis and characterization in chemistry laboratories, there are far more materials possible than can be synthesized, each with an entire host of surfaces. This wealth of chemical space to explore begs the use of computational chemistry to mimic synthesis and experimental characterization. In this work, genetic algorithms (GA), for the former, and DFT calculations, for the latter, are developed and used for the in silico exploration of materials chemistry. Genetic algorithms were first theorized in 1975 by John Holland and over the years subsequently expanded and developed for a variety of purposes. The first application to chemistry came in the early 1990’s and surface chemistry, specifically, appeared soon after. To complement the ability of a GA to explore chemical space is a second algorithmic technique: machine learning (ML) wherein a program is able to categorize or predict properties of an input after reviewing many, many examples of similar inputs. ML has more nebulous origins than GA, but applications to chemistry also appeared in the 1990’s. A history perspective and assessment of these techniques towards surface chemistry follows in this work. A GA designed to find the crystal structure of layered chemical materials given the material’s X-ray diffraction pattern is then developed. The approach reduces crystals into layers of atoms that are transformed and stacked until they repeat. In this manner, an entire crystal need only be represented by its base layer (or two, in some cases) and a set of instructions on how the layers are to be arranged and stacked. Molecules that may be present may not quite behave in this fashion, and so a second set of descriptors exist to determine the molecule’s position and orientation. Finally, the lattice of the unit cell is specified, and the structure is built to match. The GA determines the structure’s X-ray diffraction pattern, compares it against a provided experimental pattern, and assigns it a fitness value, where a higher value indicates a better match and a more fit individual. The most fit individuals mate, exchanging genetic material (which may mutate) to produce offspring which are further subjected to the same procedure. This GA can find the structure of bulk, layered, organic, and inorganic materials. Once a material’s bulk structure has been determined, surfaces of the material can be derived and analyzed by DFT. In this thesis, DFT is used to validate results from the GA regarding lithium-aluminum layered double hydroxide. Surface chemistry is more directly explored in the prediction of adsorbates on surfaces of lithiated nickel-manganese-cobalt oxide, a common cathode material in lithium-ion batteries. Surfaces are evaluated at the DFT+U level of theory, which reduces electron over-delocalization, and the energies of the surfaces both bare and with adsorbates are compared. By applying first-principles thermodynamics to predict system energies under varying temperatures and pressures, the behavior of these surfaces in experimental conditions is predicted to be mostly pristine and bare of adsorbates. For breadth, this thesis also presents an investigation of the electronic and optical properties of organic semiconductors via DFT and time-dependent DFT calculations