Search

Determining the properties of mine waste dump material is very difficult, it is caused by the difference of dimension between the laboratory equipment and field material size distribution. This study aims to determine the material properties from mine waste dump material using back analysis method after failure was occurred. The back analysis method is based on a trial and error concept which focuses on failure geometry and it is conducted by varying the cohesion and friction angle until the safety factor was less than 1.0. The laboratory results showed a 66.2 kPa change as well as a 48.8°friction angle deviation in mine waste dump material properties, while the back analysis indicated 33.7 kPa and 27.4°. It means, there is a reduction in the value. Therefore, the increasing in these properties are expected to allow the redesign of heap stability.

Background Millions of people throughout the world suffer from parasite infections. Traditionally, technicians use manual eye inspection of microscopic specimens to perform a parasite examination. However, manual operations have limitations that hinder the ability to obtain precise egg counts and cause inefficient identification of infected parasites on co-infections. The technician requirements for handling a large number of microscopic examinations in countries that have limited medical resources are substantial. We developed the helminth egg analysis platform (HEAP) as a user-friendly microscopic helminth eggs identification and quantification platform to assist medical technicians during parasite infection examination. Methods Multiple deep learning strategies including SSD (Single Shot MultiBox Detector), U-net, and Faster R-CNN (Faster Region-based Convolutional Neural Network) are integrated to identify the same specimen allowing users to choose the best predictions. An image binning and egg-in-edge algorithm based on pixel density detection was developed to increase the performance. Computers with different operation systems can be gathered to lower the computation time using our easy-to-deploy software architecture. Results A user-friendly interface is provided to substantially increase the efficiency of manual validation. To adapt to low-cost computers, we architected a distributed computing structure with high flexibilities. Conclusions HEAP serves not only as a prediction service provider but also as a parasitic egg database of microscopic helminth egg image collection, labeling data and pretrained models. All images and labeling resources are free and accessible at http://heap.cgu.edu.tw . HEAP can also be an ideal education and training resource for helminth egg examination.

Kernel heap buffer overflow vulnerabilities have been exposed for decades, but there are few practical countermeasure that can be applied to OS kernels. Previous solutions either suffer from high performance overhead or compatibility problems with mainstream kernels and hardware. In this paper, we present KRUISER, a concurrent kernel heap buffer overflow monitor. Unlike conventional methods, the security enforcement of which is usually inlined into the kernel execution, Kruiser migrates security enforcement from the kernel's normal execution to a concurrent monitor process, leveraging the increasingly popular multi-core architectures. To reduce the synchronization overhead between the monitor process and the running kernel, we design a novel semi-synchronized non-blocking monitoring algorithm, which enables efficient runtime detection on live memory without incurring false positives. To prevent the monitor process from being tampered and provide guaranteed performance isolation, we utilize the virtualization technology to run the monitor process out of the monitored VM, while heap memory allocation information is collected inside the monitored VM in a secure and efficient way. We have implemented a prototype of KRUISER based on Linux and the Xen/KVM hypervisor. The evaluation shows that Kruiser can detect realistic kernel heap buffer overflow attacks in cloud environment effectively with minimal cost.

This paper proposes a novel method termed HEAP for fast and reliably computing nose points, tracing the entire P-V curve, and assessing static stability limits. HEAP uses an arc-length parametrization and piecewise approximants and enjoys a favorable feature that can pass through the nose without numerical difficulties. Another feature of HEAP is its computational efficiency by enabling the accurate approximation over long intervals because of the large convergence region of HEAP. Existing methods for similar tasks usually suffer from several issues including empirical criteria for detecting noses, small convergence regions of correctors, numerous intermediate points, and large memory consumption. These issues are addressed by HEAP. To check its numerical performance, HEAP is tested on models with up to 70,000 buses, and numerical results substantiate its outstanding features. Depending on intended applications (e.g., only locating the nose or fully tracking the curve), tailored approaches are devised to effectively deriving numerical solutions. In comparison with the continuation-based power flow (CPF) method, HEAP attains speedups of 3x to 300x and notably achieves speedups of at least 19x for all large cases with 10,000 or more buses. While the CPF fails in several large cases, however, all of which are successfully solved by HEAP.

Although the biodegradability of compostable bioplastic bags (CBBs) is well ascertained, concerns arise about the possibility of treating a massive quantity of compostable materials in composting facilities of all sizes and configurations. These concerns are even greater in small-scale composting where the biodegrading conditions may be milder that those in industrial composting. In this work, 7–15 lightweight CBBs were disposed of, together with organic food waste, in an electromechanical composter (EMC), every day for about 2 months. For the bulking agent, fragments and twigs of golden wattle wood were used instead of the recommended wood pellets. The composting process was carried out for 3 months in the EMC, and for further 4 months in a heap, in order to complete the maturation. During the process, critical issues in general, and any due to the presence of the CBBs, were reported: high temperatures, up to 72 °C, were constantly reached both in the ECM and in the heap, while critical anaerobic pockets were not detected. After 7 months, when the temperature and pH of the heap were equal to the ambient temperature and to 7.4, respectively, and were constant over time, the process was stopped and the compost produced underwent chemical, physical and biological analysis, in order to evaluate its quality. The CBBs did not produce any visual contamination of the final compost with bioplastic residues. Finally, all the stability, environmental and agronomic parameters were in compliance with the reference values established by law. This work shows how lightweight CBBs are perfectly managed by the EMC, at least with a CBB/organic waste mass ratio that is consistent with a normal use of CBBs as the collector of organic waste.

Reverse top-k keyword-based location query (RTkKL), aims to find the maximum spatial region such that the query object is contained in the result of any top-k spatial keyword query with users’ queried keywords and any location in the region as arguments. Existing efforts on RTkKL find the objects in the Euclidean space. In this paper, we study the problem of reverse top-k keyword-based location query on road networks. We propose two methods. One is based on mark vertex, and the other is based on bisector. For the mark vertex based method, we identify the mark vertex according to the definition of RTkKL on road networks. Based on the mark vertex, we will get the mark segments in the result. For the bisector-based method, we find the border points for the query q and some objects. With Dijkstra algorithm, we start from the query point q. For each closed edge, whose two adjacent vertices have been extracted from the min heap, we would search the border points on the edge, and count the border points for the adjacent vertex. For each method, we propose effective pruning strategy to reduce the search range and computation cost. Finally, experiments demonstrate the efficiency of the proposed algorithm.

Purpose The discrete element method (DEM) can be used in agricultural fields such as crop sowing, harvesting, and crop transportation. Nevertheless, modeling complex crops as appropriately shaped particles remains challenging. The modeling of particles and the calibration of input parameters are important for simulating the realistic behaviors of particles using the DEM. Methods In this study, particle models representing the morphological characteristics and size deviations of garlic cloves were proposed. Additionally, the coefficients of friction were analyzed as the contact parameters of the particles based on the heap formation experiments and simultations of the swing-arm method using 150 garlic cloves. Results The simulation results were analyzed that the residual number of particles, a bulk property that can be measured simply in the experiment, is related to the coefficients of friction. In the heap formation experiments with low particle counts, the bulk properties were more clearly differentiated by the residual number of particles than the angle of repose. Moreover, the bulk properties similar to the actual garlic could not be expressed as a spherical particle model. Thus, an equation for predicting the residual number of particles was derived for the non-spherical garlic clove particle model. Five sets of coefficients of friction were presented using the prediction equation, and all the simulation results were close to the actual residual number of particles and angle of repose of the garlic. Conclusions Although the sizes of garlic cloves have a wide distribution, appropriate inter-particle contact parameters could be predicted. Therefore, the calibration process of the DEM can be shortened using the proposed prediction equation for the residual number of particles with non-spherical particles.

In this paper, a modified equilibrium algorithm (MEA) is proposed for optimally determining the position and capacity of wind power plants added in a transmission power network with 30 nodes and effectively selecting operation parameters for other electric components of the network. Two single objectives are separately optimized, including generation cost and active power loss for the case of placing one wind power plant (WPP) and two wind power plants (WPPs) at predetermined nodes and unknown nodes. In addition to the proposed MEA, the conventional equilibrium algorithm (CEA), heap-based optimizer (HBO), forensic-based investigation (FBI), and modified social group optimization (MSGO) are also implemented for the cases. Result comparisons indicate that the generation cost and power loss can be reduced effectively, thanks to the suitable location selection and appropriate power determination for WPPs. In addition, the generation cost and loss of the proposed MEA are also less than those from other compared methods. Thus, it is recommended that WPPs should be placed in power systems to reduce cost and loss, and MEA is a powerful method for the placement of wind power plants in power systems.

This study aimed to investigate the co-composting time effectiveness as well as the effect of the initial Carbon/Nitrogen ratio (C/N)i variation on the hygienization of olive pomace and turkey manure. Six different heaps, at 3 levels of (C/N)i ratios: 20, 22 and 28, were installed and monitored during 6 months and assessed at three steps: At the beginning, the end of thermophilic-phase and the end of curing-phase. The microbial monitoring concerned 5 microbial pathogens contents, used as hygiene microbial indicators, namely: Sulphite-Reducing Anaerobes (SRA), Escherichia Coli (E. Coli), Total Aerobic Mesophilic Flora (TAMF), Staphylococci, and Salmonella spp. Initially, the mixtures showed high TAMF and Staphylococci loads. Meanwhile, SRA and E. coli populations were relatively low and Salmonella spp. was not detected. The microbial assessment showed a significant effect of composting time on the reduction of pathogens load, except for SRA where its population has increased significantly, while the (C/N)i had a non-significant effect on pathogen content of the end-product. The final values expressed as colony-forming unit per gram (CFU g-1), were as follow: Sulfite-reducing Anaerobes (≤3.1 x 103 CFU g-1), E. Coli germ used as an indicator of faecal contamination (

An important symbol of religious art, a mani heap is formed from hundreds and thousands of stones or slates carved with copious information about the religion, culture, history, art and lifestyle of the Tibetan people. Mani heaps are scattered almost everywhere in Tibet and are a significant way to understand Tibet and the Tibetans. However, research into mani heaps appears relatively limited in scope so far in Tibet as well as in the Himalayan area. At present, qualitative research is the main method used to describe or explain mani heaps, and this, to a certain extent, had led to a certain subjectivity in interpretation. In this article, we propose a quantitative method for looking at mani heaps by digital processing the colours of 70 mani heaps in Dêngqên County. Compared with previous related studies, the results are more accurate in reflecting the colour features of mani heaps in Dêngqên County. More importantly, this quantitative, digital-processing approach can be highly effective in verifying, underpinning or challenging previous research into mani heaps in Tibet and other Himalayan areas.

To modify easily chemical consistence of molten steel metallurgical plants usually add alloys in a form of lumps through a hopper at ladle`s top. The problem is a large variety of adjusted technological conditions for this process, which leads to iterative discovery of rational ones. The article presents synthesis of a mathematical model for the mentioned process using Navier-Stokes and Euler-Lagrange equations. It is designed for researching of process modes depending on: a horizontal position of addition hopper relatively to argon plug at ladle bottom, an average diameter of spherical addition lumps, a total mass of addition heap, a necessity of the second hopper, a temperature of the melt. It takes into account interconnected three-dimensional fluid and solids dynamics, temperature exchange between melt and lump, also it computes level of concentration homogenization. A numerical experiment shows a significantly better addition homogenization when two hoppers are simultaneously used for a feeding. Adequacy checks are performed using ice balls in air-stirred water.

Biomining through bioleaching and bio-oxidation aims at recovering desired metals at the required specifications with lower environmental impact and costs from ores and waste streams. Research and ...

The increase in computational power in recent years has opened a new door for image processing techniques. Three-dimensional object recognition, identification, pose estimation, and mapping are becoming popular. The need for real-world objects to be mapped into three-dimensional spatial representation is greatly increasing, especially considering the heap jump we obtained in the past decade in virtual reality and augmented reality. This paper discusses an algorithm to convert an array of captured images into estimated 3D coordinates of their external mappings. Elementary methods for generating three-dimensional models are also discussed. This framework will help the community in estimating three-dimensional coordinates of a convex-shaped object from a series of two-dimension images. The built model could be further processed for increasing the resemblance of the input object in terms of its shapes, contour, and texture.

In many ways, the year 2020 seemed like an airliner that taxied out to takeoff position, revved up its engines, roared down the runway, lifted off—and wound up as a smoking heap at the far end. Ult...

Debugging failures of deployed concurrent software is important for quality assurance. However, such failures are difficult to debug because their behavior is non-deterministic and limited information can be obtained with conventional means. Reverse debuggers such as REPT [11] assists with debugging by recovering data values before the failure. This is achieved by using a hardware-tracer to log control-flow information, then using the information and a conventional coredump to recover data values via reverse-execution at machine-level. REPT's algorithm for data value recovery is reliable and fast. But the implementation cost is high because of its dependence on architecture. Applying REPT to more abstract IR (Intermediate Representation) level instructions to counter this yielded limited results with low accuracy compared to the original x86_64 implementation. The main reason for this is that the stack layout is abstracted at IR-level. In this paper, we present STRAB (State Recovery at Abstract-level), a collection of our proposed methods to solve these problems. STRAB works in two phases. First, the data values in the coredump are lifted from machine-level to IR-level using rich debug information (DWARF3) and a novel technique we call mid-recovery lifting, the latter helping to recover more heap data values at IR-level. Second, our novel hybrid memory location resolution reduces the accuracy loss due to the abstracted stack layout at IR-level. Experimental results on a variety of real-world concurrent programs show that STRAB has significantly higher accuracy compared to REPT at IR-level (+40% on average) with only minor slowdowns (x2.7 on average), while also achieving architecture-independence.

Heap randomization, in general, has been a well-trodden area; however, the efficacy of byte-granularity randomization has never been fully explored as misalignment raises various concerns. Modern heap exploits often abuse the determinism in word alignment, and modern CPU architecture better supports unaligned access (since Nehalem). Based on such new developments, we conduct an in-depth analysis of evaluating the efficacy of byte-granularity heap randomization in three folds: (i) security effectiveness, (ii) performance impact, and (iii) compatibility analysis to measure deployment cost. Security discussion is based on 20 CVE case studies. To measure performance details, we conduct cycle-level microbenchmarks and report that the performance cost is highly concentrated to edge cases depending on the L1-cache line. Based on such analysis, we design and implement an allocator suited for byte-granularity heap randomization. On the negative side, our analysis suggests that byte-granularity heap randomization has high deployment cost due to various implementation conflicts. We enumerate the problematic compatibility issues using Coreutils, Nginx, and ChakraCore benchmarks.

Theories of higher-order must-alias analysis, often under the guise of environment analysis, provide deep behavioral insight. But these theories---in particular those that are most insightful otherwise---can reason about recursion only in limited cases. This weakness is not inherent to the theories but to the frameworks in which they're defined: machine models which thread the heap through evaluation. Since these frameworks allocate each abstract resource in the heap, the constituent theories of environment analysis conflate co-live resources identified in the abstract, such as recursively-created bindings. We present heap fragments as a general technique to allow these theories to reason about recursion in a general and robust way. We instantiate abstract counting in a heap-fragment framework and compare its performance to a precursor entire-heap framework. We also sketch an approach to realizing binding invariants, a more powerful environment analysis, in the heap-fragment framework.

We will give a two-sort system which axiomatizes winning strategies for the combinatorial game Node Kayles. It is shown that our system captures alternating polynomial time reasonings in the sense that the provably total functions of the theory corresponds to those computable in APTIME. We will also show that our system is equivalently axiomatized by Sprague–Grundy theorem which states that any Node Kayles position is provably equivalent to some NIM heap.

The organization of a set in the form of a heap is the basis for the construction of binary search trees. The algorithm for organizing a set in the form of a pile is laborious and requires a high volume of resources. In this paper we have automated the algorithm for organizing a set in the form of a heap. We developed a program in the C++ programming language that implements the heap generation algorithm and I analyzed a numerical example.

This study aims to study the effect of adding rock phosphate and plant growth-promoting rhizobacteria (PGPR), in the physical and chemical properties of the corn residues compost during aerobic decomposition. Four composting heaps were included in this study as it follows, 1) traditional method composting heap (T1), 2) heap was supplied with rock phosphate (T2), 3) heap was supplied with rock phosphate + Bacillus megatherum culture (T3), and 4) heap was supplied with rock phosphate+(Bacillus.megatherum, Azospirillum lipoferum, Azotobacter chroococcum) mixed cultures (T4). All compost treatments showed an increase in temperature right after composting started. The heap treated with three bacterial inoculums (T4) reached the highest peak values of 62.2°C on day 12 compared to other treatments. At the end of the composting period T1 recorded the lowest value of bulk density (533 kg/m3) compared to other treatments. The pH value declined to stabilize with the end result at 100 days being 6.9, 7.4, 7.1 and 7.0 for composting treatment T1, T2, T3 and T4, respectively. The initial C/N ratio was 61:1 for all composting treatments, and the final values of total C/N ratio after the 100 days were 15:1, 14:1, 12:1 and 10:1 for composting treatments T1, T2, T3 and T4 respectively. Compost supplied with rock phosphate and three bacterial inoculums (T4) reached has more N, P and K content compared to other composting treatments T1, T2, T3. These results indicated that adding rock phosphate and (PGPR) to corn residues during composting improve nutritional value of the resulting compost.

The present work is continuation of our investigations on heap leaching, suggested for the first time. Various variants of alkaline leaching of alunite from alunite ore without preliminary roasting have been studied. In present work the parameters of heap and tank alkaline leaching of alunite ore have been determined. The proposed methods can also be used to extract aluminum from poor alunite rocks. At alunite was washed 17 times with 3% NaOH solution, the degree of weight loss was 30.65%, while with 14 times washing with 10% alkali solution, the weight loss was 47.82 %. The results obtained are also typical for percolation leaching. An increase in alkali concentration and temperature intensifies the leaching process. At a ratio of solid and liquid phases of 1:5, a stirring speed of – 700 cycles/min, and an alkali concentration of 110.9 g/l, at 800C within 60 minutes’ alunite dissolves up to 96% and goes into solution with accompanying components

The authors showed that the main technological process in the combined and separate methods of fiber flax harvesting is deseeding or separating the seed part of the crop from the stems. It was confirmed that there is a direct impact of this process success on seed and straw losses, the fiber yield and quality, the heap composition, the labor intensity and energy consumption of flax drying and processing. (Research purpose) To develop a technology for stripping fiber flax with a comb deseeder during harvesting, to study the deseeder’s specifications and operating modes. (Materials and methods) The authors studied the technological process of stripping flax with a comb deseeder. An experimental plant of a comb deseeder was designed. A model of theoretical calculation was proposed based on the physical and mechanical properties of fiber flax and agrotechnical requirements for its harvesting. (Results and discussion) The authors theoretically determined the comb deseeder’s optimal height, operation kinematic mode, stripping cleanliness, the radius of the stripper drum. Laboratory studies were conducted. It was shown that threshing seeds in the field will reduce the loss of flax seeds by 10 per cent and the stem waste due to tangling during the harvesting process – by 18 per cent. It will also reduce the number of harvesting vehicles, personnel, and the cost of product. The authors identified an opportunity to increase productivity by increasing the width of the header grip: for example, the width of a grain harvester header is about 4 meters, and the width of a flax harvester header is 1.52 meters, that is, the productivity of flax harvesting will increase 2.6 times at the same speed, and 3 times at a higher speed. It was possible to eliminate one piece of equipment – a heap separating machine, since the technological operation of heap processing is carried out by a grain harvester. (Conclusions) The authors presented a theoretical substantiation of the comb deseeder’s operating parameters and modes for stripping fiber flax in the field. The authors proposed a model to determine them based on the physical and mechanical properties of flax and agrotechnical requirements for its harvesting.

The article is devoted to the problem of the reduction of tubers mechanical damages while providing qualitative indicators of the potato heap separation process. Theoretical and experimental dependences of the influence of design and kinematic parameters of the machine operation on the quality performance are obtained. Within the field of experimental studies, a field installation was made to investigate the potato harvester as a whole on the efficiency of separation, the degree of damage, the magnitude of losses and the total capacity for aggregation. Comparison of the results of theoretical and experimental studies showed that the developed mathematical model of the process of separation of potato heap is adequate.

Automating earth-moving tasks has the potential to resolve labour-shortage, allow for unseen designs and foster sustainability through using on-site materials. In this interdisciplinary project involving robotics and landscape architecture, we combine our previous work on autonomous excavation of free-form shapes, dynamic landscape design and terrain modelling tools into a robotic landscape system. It tightly connects survey, design and fabrication to exchange information in real-time during fabrication. We purposely built a LiDAR survey drone for tight integration. The design environment contains terrain modelling tools to balance cut and fill volumes for material-neutral, on-site construction. Its parametric nature allows it to adapt the geometry to changing site conditions during fabrication. Our autonomous walking excavator is used to create these free-form shapes in natural granular material. We propose an excavation planner for free-form embankments that computes the next excavation location and subsequently the location where the excavated soil should be dumped. This robotic excavation system achieves the world’s first autonomous completion of free-form embankments with high accuracy. A 20 m long S-shaped and a two-faced embankment with a corner with roughly 0.03–0.05 m average error were created., Construction Robotics, 5

The column bioleaching of copper flotation tailings was comparatively investigated using layered heap construction method (LM), agglomerate heap construction method (AM), and pellets-sintering heap construction method (PM). The bacterial communities of free, attached, weakly-attached, and strongly-attached microbes in the later bioleaching stage were investigated. In AM group, the addition of lump sulphide ore resulted in the low leachate pH, high ferric iron concentration, and rapid microbial adsorption, which obtained the maximum copper extraction (60.1%) compared with LM (54.6%) and PM (43.9%) groups. The relative abundance of dominant genera and microbial communities of different microbiota underwent changes in three heap construction methods. The alpha-diversity indexes of attached, weakly-attached, and strongly-attached microbes were different, while no significant change was observed in free bacteria. The variation of whole bacterial community was significantly associated with solution pH, total iron, and ferric iron concentrations. Pearson correlation analysis and partial least square path model both indicated that attached bacteria made larger contribution to the copper extraction of tailings.

The Distributed Shared Memory (DSM) architecture is widely used in today's computer design to mitigate the ever-widening processing-memory gap, and it inevitably exhibits Non-Uniform Memory Access (NUMA) to shared-memory parallel applications. Failure to adapt to the NUMA effect can significantly downgrade application performance, especially on today's manycore platforms with tens to hundreds of cores. However, traditional approaches such as first-touch and memory policy fall short in false page-sharing, fragmentation, or ease of use. In this paper, we propose a partitioned shared-memory approach that allows multithreaded applications to achieve full NUMA-awareness with only minor code changes and develop an accompanying NUMA-aware heap manager which eliminates false page-sharing and minimizes fragmentation. Experiments on a 256-core cc-NUMA computing node show that the proposed approach helps applications to adapt to NUMA with only minor code changes and improves the performance of typical multithreaded scientific applications by up to 4.3 folds with the increased use of cores.

In-memory computing has been widely used to process data quickly in memory, but it is no longer able to cope with the current data explosion. This has occurred because modern computers have structural constraints in terms of both memory capacity and bandwidth, fundamentally limiting the amount of data that can be processed in memory. In order to overcome these limitations, the memory-centric computing concept was proposed, and as an attempt to make this concept feasible, nonvolatile memory, next-generation interconnects, and memory-centric operating system technologies are being actively studied. Although, however, there have been many studies of these concepts, the essential problem of both efficiently and safely using the extremely large memory space has not been completely solved. This paper proposes what is termed Global-Heap which solves the above essential problem, thus supporting the core technology of memory-centric computing. In this technology, a heap-level abstraction which can be switched very lightly between processes is provided in an application-friendly manner as a global resource. Global-Heap also provides an effective means by which safely to use this vast address space based on Intel memory protection keys. We implemented Global-Heap on Linux and developed three useful use cases applicable to data-centric applications. Our primary evaluation shows that Global-Heap enables reorganization-free hashing. In addition, Global-Heap can improve the performance of an in-memory key-value store, Redis, by at least 7.56 times, and it can reduce the running time of graph applications executed in a pipeline approach by at least 48%.

The distributed computing innovation is quickly growing these days because of its adaptable highlights of programmed arranging, uninhibitedly extending, on-request asset designating, force and value sparing, which just hits the objective of different associations on IT framework development. In the interim, virtualization innovation has firm relationship with distributed computing as a result of the regular idea of virtualization highlight. Virtualization innovation is much of the time used to progressively deal with load adjusting of the cloud framework where it gets conceivable to remap virtual machines (VMs) and physical assets as indicated by the adjustment in load. Nonetheless, in order to understand the least difficult presentation, the virtual machines need to completely use its administrations and assets by adjusting to the distributed computing condition powerfully. The heap adjusting and legitimate portion of assets must be ensured in order to upgrade asset utility. Numerous analysts in the past have proposed distinctive booking and cost enhancing calculations like static, dynamic and blended methodologies like best fit diminishing, first fit diminishing, however they don't ensure ideal arrangements. This task gives a cost decrease system and empowers successful burden balance. The technique utilized in this paper will propel the framework.

This paper depicts an optimization of adaptive control strategy for grid integrated PV-DSTATCOM and dynamic power channel inverter topographies and their control plans using mechanical rules and advanced high-power courses of action. In this paper we will accomplish DSATCOM based maximum power point tracking (MPPT) method for a three stage framework to improve power quality and backing the three stage AC grid by providing power both to the grid and the associated loads. The proposed framework functions as DSTATCOM improving power quality and the power is moved from the grid to the heap. The exhibition of DSTATCOM and the power point is noticed and it is by all accounts all around performed to restrict the music. The test framework is actualized utilizing MATLAB SIMULINK programming. The framework is named as a brilliant as it can perform the two modes consequently detecting the PV power and is fit for multidirectional power stream.Additionally we will reproduce and print results for optimization of adaptive control technique for grid integrated solar cells. The trial approval is completed on a created model in the research facility under fluctuating modes. The proposed PV grid tied framework is fit for working nonstop. During daylight conditions, the proposed framework performs double elements of improving power quality by functioning as DSTATCOM and furthermore moves power to the heap and the grid got from PV cluster. Notwithstanding, during night or shady conditions.

Objectives Health economics analysis plans (HEAPs) currently lack consistency, with uncertainty surrounding appropriate content. We aimed to develop a list of essential items that should be included in HEAPs for economic evaluations conducted alongside randomized trials. Methods A list of potential items for inclusion was developed by examining existing HEAPs. An electronic Delphi survey was conducted among professional health economists. Respondents were asked to rate potential items from 1 (least important) to 9 (most important), suggest additional items, and comment on proposed items (round 1). A second survey (round 2) was emailed to participants, including the participant’s own scores from round 1 along with summary results from the whole panel; participants were asked to rerate each item. Consensus criteria for inclusion in the final list were predefined as >70% of participants rating an item 7-9 and, Highlights • Health economics analysis plans (HEAPs) are becoming best practice for economic evaluations conducted alongside randomized controlled trials; however, they are currently implemented inconsistently. • This study used Delphi consensus techniques to identify a list of items that should be included in a HEAP. • A standardized HEAP will contribute to the transparency and reproducibility of economic evaluations and to the minimization of bias.

Until the beginning of the twentieth century, in the Kabye country, some heads of enemies – those of men foreign to the group – were buried in a mound of earth referred to as hude, meaning ‘manure’. In each locality, this mound is situated inside a wooded sanctuary where the spirit of the mythical founding ancestor resides. In order to understand this practice, this article examines how it fitted within the overall logic of the male initiation cycle, contextualising it in relation to past and present practices. Because it was a highly ambivalent element of the bush, the head of an enemy renewed the generative power of this original ‘manure’ prodigiously, so as to ensure the group’s survival in their land. The burial of the heads of strangers appears to be an initiatory variant of other forms of mastery of the ambivalence of wild forces, entrusted in other African societies to the chief and his waste heap.

Programs that manipulate heaps such as singlylinked lists, doublylinked lists, skiplists, and treesare ubiquitous, and hence ensuring their correctness is of utmost importance. Analysing correctness properties for such programs is not trivial since they induce dynamic data structures, leading to unbounded state spaces with intricate patterns. One approach that has been adopted to tackle this problem is the use of symbolic searching techniques. The state space is encoded using graphs where the nodes represent memory cells, and the edges represent pointers between the cells. It is necessary to prune the search to avoid generating massive numbers of graphs, thus making the procedure unpractical. Pruning strategies are defined based on operations such as graph matching and inclusion. In this paper, a set of algorithms for performing these operations are presented. It is demonstrated that the proposed algorithms can handle typical graphs that arise in the verification of heap manipulating programs.

The pseudoscorpion Lamprochernes savignyi (Simon, 1881) is reported in Central Europe for the first time. The new record from Switzerland is based on a single female specimen found in a compost heap in the Conservatory and Botanical Garden in Geneva. Until now, the species is distributed mainly in Africa, Americas, and Asia, less in Australia and Oceania, Europe, and the Arabian Peninsula. The new record fills in the gap in species distribution between Northern Europe and the Anatolian Peninsula. A description of the collected female is provided.

Heap bioleaching is a microbial technology that catalyzes the decomposition of ore without grinding. The crushed ore is stacked on the liner, and the microbial solution flows through the heap from ...

Proton Exchange Membrane fuel cells (PEMFCs) are a promising renewable energy source to convert the chemical reactions between hydrogen and oxygen into electricity. To simulate, evaluate, manage, and optimize PEMFCs, an accurate mathematical model is essential. Therefore, this paper improves the accuracy of a mathematical model for the PEMFC based on semi-empirical equations by proposing a meta-heuristic technique to optimize its unidentified parameters. Because the I–V characteristic curve of the PEMFC systems has a nonlinear and multivariable nature, conventional optimization techniques are difficult and time-consuming but modern meta-heuristic algorithms are ideally suited. Therefore, in this paper, a new improved optimization algorithm based on the Heap-based optimizer (HBO) has been proposed to estimate the unknown parameters of PEMFCs models using an objective function that minimizes the error between the measured and estimated data. This improved HBO (IHBO) effectively uses two strategies: ranking-based position update (RPU) and Levy-based exploitation improvement (LEI) to improve the final accuracy to the SSE value with higher convergence speed. Four well-known commercial PEMFCs, (the 500 W BCS stack, NetStack PS6, H-12 stack, and AVISTA SR-12 500 W modular) are utilized to verify the proposed IHBO and compare it with 11 popular optimizers using various performance metrics. The experimental findings show the superiority of IHBO in terms of convergence speed, stability, and final accuracy, where IHBO could fulfill fitness values of 0.01170, 2.14570, 0.11802, and 0.00014 for the 500 W BCS stack, NetStack PS6, H-12 stack, and AVISTA SR-12 500 W modular, respectively.

The extensive networking of devices and the large amount of data generated from the Internet of Things (IoT) has brought security issues to the attention of the researcher. Java is the most common platform for embedded applications such as IoT, Wireless Sensors Networks (WSN), Near Field Communications (NFC) and Radio Frequency Identification (RFID). The object programming languages such as Java, SWIFT, PHP and C++ use garbage collection after any object run which creates security loophole for attacks such as Next Memory Address Occupation (NMAO), memory replay, Learning Tasks Behaviors (LTB). The security risk increases in IoT when attacks exceeds the target device to the surrounding connected devices. Inappropriate or wrong operations causes energy loss and increased costs. In this paper, a security method to protect IoT system operation from memory heap penetration and address modification attack is proposed. The proposed method prevents directed attack by encrypting the object Garbage Collection at run time. To form a unique signature mechanism, the Cryptographic Hash Function (CHF) which employs a specific one-way hash algorithm. The proposed framework uses L-function based ECC and one-time Key (OTK) to secure the memory heap. Our method is used with open system where the effect on the operating system is not considered. The proposed method proved to be powerful and efficient which can help in achieving higher levels of security across several IoT applications, by enabling better detection of malicious attacks., Alexandria Engineering Journal

The production process for pelleted feed using undivided grain heap harvested by stripping into milky to wax ripeness phases is described. This made it possible to increase the protein content in the feed by 7-8% due to the grain richer in protein in early and very early harvesting periods and the inclusion of the vegetative part of the ear in the feed, as well as to reduce the cost of preparing the feed.

This paper proposes a co-design adaptive defense scheme against a class of zero-day buffer over-read attacks that follow unknown stationary probability distributions. In particular, the co-design scheme integrates an improved UCB algorithm and a customized server. The improved UCB algorithm adaptively allocates guard pages on a heap based on induced damage of the guard pages so as to minimize the accumulated damage over time. The security damages of the improved UCB algorithm are proven to be always below a temporal bound without knowing which attack is launched when the buffer allocation follows a certain stationary probability distribution. Then an efficient server modification is introduced to randomly allocate buffers. Moreover, the damages of our scheme asymptotically converge to those of the optimal defense policy where the launched attacks and their distributions are known in advance. Further, the co-design scheme is evaluated with several real-world Heartbleed attacks. The experiment results demonstrate the validity of the upper bound and show that the adaptive defense is effective against all the attacks of interest with runtime overheads as low as 5%.

Computer and communication systems and networks deal with many cases that require rearrangement of data either in descending or ascending order. This operation is called sorting, and the purpose of an efficient sorting algorithm is to reduce the computational complexity and time taken to perform the comparison, swapping, and assignment operations. In this article, we propose an efficient mean-based sorting algorithm that sorts integer/non-integer data by making approximately the same length independent quasi-sorted subarrays. It gradually finds sorted data and checks if the elements are partially sorted or have similar values. The elapsed time, the number of divisions and swaps, and the difference between the locations of the sorted and unsorted data in different samples demonstrate the superiority of the proposed algorithm to the Merge, Quick, Heap, and conventional mean-based sorts for both integer and non-integer large data sets which are random or partially/entirely sorted. Numerical analyses indicate that the mean-based pivot is appropriate for making subarrays with approximately similar lengths. Also, the complexity study shows that the proposed mean-based sorting algorithm offers a memory complexity same as the Quick-sort and a time complexity better than the Merge, Heap, and Quick sorts in the best-case. It is similar to the Merge and Heap sorts in view of the time complexity of the worst-case much better than the Quick-sort while these algorithms experience identical complexity in the average-case. In addition to finding part by part incremental (or decremental) sorted data before reaching the end, it can be implemented by parallel processing the sections running at the same time faster than the other conventional algorithms due to having independent subarrays with similar lengths.

This paper presents a novel endeavor to use the Heap optimization algorithm (HOA) to solve the problem of optimal power flow (OPF) in the electricity networks. The key objective is to optimize the cost of fuel of the conventional generators under the system limitations. Various scenarios are studied in a later stage considering the addition of the PV panel and/or wind farm with changing load curves during a typical day. The active output power of the generators is selected to be the OPF problem search space. The HOA is employed to get the best solution of the fitness function and provides the corresponding best solutions. The modeling of the heap-based optimizer (HBO) depends on three levels: the relation between the subordinates and the boss, the relation between the same level employees, and the contribution of the employee oneself. The validity of the proposed algorithm is tested for a variety of electric grids, the IEEE 30-bus, IEEE 57-bus and 118 bus networks. These networks are simulated under various scenarios. Real load curves, in this study, are considered to achieve a practical outcome. The simulation outcomes are evaluated and tested. The results indicate that the implemented HOA-based OPF methodology is flexible and applicable compared with that achieved by using the genetic algorithm.

Cogeneration systems economic dispatch (CSED) provides an optimal scheduling of heat/ power generating units. The CSED aims to minimize the whole fuel cost (WFC) of the cogeneration units taking into consideration their technical and operational limits. Then, the current paper examines the first implementation of dominant bio-inspired metaheuristic called heap-based optimization algorithm (HBOA). The HBOA is powered by an adaptive penalty functions for getting the optimal operating points. The HBOA is inspired from the organization hierarchy, where the mechanism consists of the interaction among the subordinates and their immediate boss, the interaction among the colleagues, and the employee’s self-contribution. Based on the infeasible solutions’ remoteness from the nearest feasible point, HBOA penalizes them with various degrees. Four case studies of the CSED are implemented and analyzed, which comprise of 4, 24, 84 and 96 generating units. The HBOA is proposed to solve CSED problem with consideration of transmission losses and the valve point impacts. An investigation with the recent optimization algorithms, which are supply demand optimization (SDO), jellyfish search optimization algorithm (JFSOA), and marine predators’ optimization algorithm (MPOA), the improved MPOA (IMPOA) and manta ray foraging (MRF), is developed and elaborated. From the obtained results, it is clearly observed that the optimal solutions gained, in terms of WFC, reveal the feasibility, capability, and efficiency of HBOA compared with other optimizers especially for large-scale systems. case

Discrete element modelling (DEM) and experimental characterization were carried out for Hall flowmeter tests, in which Inconel718 powders were poured down through a funnel into a density cup to form a heap. By measuring the flow rate, angle of repose and packing fraction from the experiments, and combining with DEM simulations, we were able to extract the coefficients of friction for the powder-powder and powder-wall interactions. We further studied the effect of powder-powder adhesion and found that the adhesion could greatly affect the flow rate and flow pattern. In particular, by increasing the adhesion, we observed a transition from a continuous to discontinuous discharging flow, and revealed an underlying mechanism for the transition. We also studied the effects of powder size and density cup diameter, and found that at their application size scale, the influences of these parameters on the measured results are negligible. The present work presents a simple approach to study the intrinsic properties of powders, and their influences on flowability and packing property.

Optimal reactive power dispatch (ORPD) in a typical power system is a complicated multi-objective optimization problem. The proper modeling of the multi-objective optimization problem has a significant impact on system operation and control. In this paper, an Improved Heap-based optimizer (IHBO) is proposed to improve the performance of a recently published technique called Heap-based optimizer (HBO). In addition, two algorithms based on the original HBO and IHBO are developed for solving OPRD problem. Pareto front approach is utilized in the proposed OPRD algorithm with the aim of solving two or three objective functions simultaneously. The performance of HBO is improved by utilizing the chaotic sequences with the aim of improving its global search capability and avoiding getting stuck in a local optimum. Both original HBO and proposed IHBO are applied to determine the optimal settings of the generator’s voltages, shunt capacitor reactive power, and tap settings of transformers. Therefore, this study aims for minimizing three most objective functions of the real power loss, total voltage deviation (TVD) and voltage stability index (VSI), with satisfying different operational constraints. The effectiveness of the IHBO is tested on three test systems IEEE 30-bus, IEEE 57-bus, and IEEE 118-bus test systems. The results of the proposed IHBO are compared with recently published algorithms in the literature. The simulation results proven the superiority and robustness of IHBO in solving the ORPD problem.

У статті наведено одержані результати проведених польових експериментальних випробувань модернізованої коренезбиральної машини МКК-6, яку обладнано комбінованою системою для очистки кормових буряків від різного роду забруднень при їх збиранні. На основі експериментальних результатів виведено рівняння регресії, які характеризують зміну загальної забрудненості вороху коренеплодів різними домішками та побудовано графічні залежності загальної забрудненості вороху кормових буряків, пошкоджень коренеплодів, забрудненості коренеплодів рослинними рештками і кількості налиплого ґрунту на поверхні тіла коренеплодів залежно від зміни кутової швидкості обертання гвинта та діаметра очисних пружних елементів. При аналізі залежностей виявлено, що загальна забрудненість вороху коренеплодів залежно від кутової швидкості обертання гвинта змінюється за параболічною функцією, яка має яскраво виражений оптимум. Також зв’ясовано, що основним фактором, який впливає на кількість налиплого ґрунту на поверхні тіла коренеплодів є діаметр очисних пружних елементів. При його збільшенні кількість налиплого ґрунту на поверхні тіла коренеплодів значно зменшується при всіх значеннях кутової швидкості обертання гвинта.

В роботі представлено результати експериментальних досліджень обґрунтування раціональних конструктивно-режимних параметрів жниварки для збирання насіння льону олійного методом обчісування рослин на корені. Обробкою результатів математичного моделювання процесу сепарації вороху в жниварці обчісувального типу з криволінійною формою кожуха із врахуванням фізико-механічних властивостей його компонентів встановлено, що значущими факторами процесу є такі конструктивно-режимні параметри: частота обертання бітера-відбивача n1 і обчісувального барабана n2, положення прозорої зони границі L повітряної сітки кожуха і її ширина B. Експериментальними дослідженнями процесу сепарації вороху в жниварці встановлено залежності масової частки відходу лушпиння і часточок стебла з її області δh, частки відходу насіння і коробочок із насінням δh і потужності Р, що споживається, від частоти обертання бітера-відбивача n1 і обчісувального барабана n2, положення повітряної сітки L і її ширини B. Виділені, як найбільш значущі такі конструктивно-режимні параметри жниварки обчісувального типу для збирання насіння льону олійного: частота обертання бітера-відбивача n1 = 892 об/хв., частота обертання обчісувального барабана n2 = 652 об/хв., положення повітряної сітки L = 0,62 м і її ширина B = 0,56 м. При цьому масова частка відходу лушпиння і часточок стебла складає δh = 47,5 %, частка втрат насіння і коробочок із насінням з області жниварки, відповідно, δh = 2,1 %, а потужність, що споживається на виконання процесу, P = 2,7 кВт. Статистичний аналіз показав, що коефіцієнт кореляції між теоретичними і експериментальними даними складає 0,88-0,95, відносна похибка оптимальних значень 4,6 %. Наочне і статистичне порівняння теоретичних і експериментальних даних підтвердило адекватність математичних моделей, які розроблено в результаті теоретичних досліджень. За результатами виконаних експериментальних досліджень можна стверджувати про корисність їх застосування для інженерних розрахунків при створенні нових технічних засобів для збирання врожаю сільськогосподарських культур методом обчісування рослин на корені.

Reachability analysis is a fundamental program analysis with a wide variety of applications. We present FlowCFL, a type-based reachability analysis that accounts for mutable heap data. The underlying semantics of FlowCFL is Context-Free-Language (CFL)-reachability. We make three contributions. First, we define a dynamic semantics that captures the notion of flow commonly used in reachability analysis. Second, we establish correctness of CFL-reachability over graphs with inverse edges (inverse edges are necessary for the handling of mutable heap data). Our approach combines CFL-reachability with reference immutability to avoid the addition of certain inverse edges, which results in graph reduction and precision improvement. The key contribution of our work is the formal account of correctness, which extends to the case when inverse edges are removed. Third, we present a type-based reachability analysis and establish equivalence between a certain CFL-reachability analysis and the type-based analysis, thus proving correctness of the type-based analysis.