maximum weight
Recently Published Documents


TOTAL DOCUMENTS

538
(FIVE YEARS 58)

H-INDEX

32
(FIVE YEARS 1)

2021 ◽  
Vol 2021 ◽  
pp. 1-17
Author(s):  
Ruo-Hai Di ◽  
Ye Li ◽  
Ting-Peng Li ◽  
Lian-Dong Wang ◽  
Peng Wang

Dynamic programming is difficult to apply to large-scale Bayesian network structure learning. In view of this, this article proposes a BN structure learning algorithm based on dynamic programming, which integrates improved MMPC (maximum-minimum parents and children) and MWST (maximum weight spanning tree). First, we use the maximum weight spanning tree to obtain the maximum number of parent nodes of the network node. Second, the MMPC algorithm is improved by the symmetric relationship to reduce false-positive nodes and obtain the set of candidate parent-child nodes. Finally, with the maximum number of parent nodes and the set of candidate parent nodes as constraints, we prune the parent graph of dynamic programming to reduce the number of scoring calculations and the complexity of the algorithm. Experiments have proved that when an appropriate significance level α is selected, the MMPCDP algorithm can greatly reduce the number of scoring calculations and running time while ensuring its accuracy.


2021 ◽  
Vol 12 (4) ◽  
Author(s):  
Yu. V. Tsapko ◽  
O. Yu. Horbachova ◽  
S. M. Mazurchuk

The process of wood biological destruction is analyzed. It was found that the neglect of environmentally friendly means of bioprotection, leads to the destruction of wooden structures under the action of microorganisms. It is established that the study of wood protection conditions leads to the creation of new types of protective materials that reduce water absorption, as well as reduce the amount of substances that are the environment for the development of wood-destroying fungi. In this regard, a computational and experimental method for determining the proportion of destroyed material under the action of microorganisms using an antiseptic has been developed. The analysis of the results shows that the maximum weight loss in the case of biodegradation of untreated wood samples ranged from 7,6 to 16 %, and the weight loss of thermally modified wood samples did not exceed 3 %, antiseptic-hydrophobicizer – was less than 2 %. It was found that the protection when treated with thermally modified wood with oil-wax and azure exceeds (compared to untreated) more than 4 times in terms of biodegradation, and treatment with antiseptic-water repellent for untreated oil-wax and azure – more than 8 times. It should be noted that the presence of oil-wax and azure leads to blockage of the wood surface from the penetration of moisture or microorganisms. Therefore, the intensity of wood-destroying fungus development on the surface of various samples are differed. Obviously, such a mechanism of the protective coating influence is the factor regulating the process, which preserves the integrity of the object. On the experimental data basis and by modeling the equations, the microorganisms population dynamics in the volume of material and the function of increasing the number of dead organisms are derived. Thus, a polymer shell was created on the surface of the sample, which significantly reduced the penetration of microorganisms into the wood, and the weight loss of wood during biodegradation did not exceed 2,5 %. Additional application of protective substances on the surface increases the protection level of untreated pine wood by 72 %, thermomodified at 190 °C – 25 %, at 220 °C – by 37 %. Similar results for hornbeam wood – 60; 37 and 28 %, for oak – 50; 37 and 37 % respectively.


Author(s):  
M. V. Roik ◽  
N. O. Kononiuk

Purpose. Find out the features of biometric indicators formation in sugar beet hybrids of domestic breeding. Methods. Field, laboratory. Results. According to the results of the research, it was determined that in early August, the maximum weight of roots (840 g) was in hybrid ‘ITsB 0904’. Good indicators were observed in hybrids ‘Umanskyi Ch S97’, ‘Soniachnyi’ and ‘Anichka’, 770, 780, and 800 g at the average group indicator of 730 g. It was investigated that the hybrid ‘Maksym’ (15.1%) and ‘Etiud’ (14.9%) were the best in terms of sugar accumulation in roots. Sugar content at the level of 14.8 % was observed in hybrids ‘Umanskyi ChS 97’, ‘Ramzes’, ‘Konstanta’, ‘Soniachnyi’ and ‘Verkhnia’ at the average group value of 14.5%. Conclusions. It is important to continue the study of the dynamics of root and leaf mass formation together with the process of sugar accumulation in roots in terms of establishing individual efficiency of hybrids and developing recommendations for the fullest realization of their potential in production conditions.


2021 ◽  
Vol 14 (2) ◽  
pp. 68-72
Author(s):  
Muhammad Jundi Al'Aziz ◽  
Bambang Guruh Irianto ◽  
Abd Kholiq

Scales Scales in the world of health are used to measure human body weight such as baby scales. Newborns are very important to be weighed because it is used as a measure of the baby's health indication ranging from 2.4 kg to 4.2 kg. The author makes a tool for this to make it easier for users to weigh with a 7 segment display on the Infant Warmer tool and external calibration. By using a loadcell sensor with a maximum capacity of 5 kg, the loadcell can detect the weight of the load where the voltage generated by the loadcell of 0.7 mV at a load of 1 kg is amplified to 0.62 V by the PSA circuit using the AD620 IC and then processed by Arudino UNO as a microcontroller. The weight results will be displayed on the 7Segment display located on the Infant Warmer tool. In the study, the measured load included a weight of 0 kg to a maximum weight of 5 kg. The measurement of the data results was carried out 5 times each by comparing the modules that had been made with the standard weight, namely (lead). The data from the measurement results of the research module shows that when the weight of the measurement at 1 kg has an error percentage of 0.08%. Measurements at a weight of 2 kg have an error percentage of 0.05%. Measurement of weight 3 kg has a presentation error of 0.01%. Measurements at a weight of 4 kg have a presentation error of 0.02%. And measurements at a weight of 5 kg have an error percentage of 0.04%. Then the data from the measurement results of the research module shows the largest error presentation of 0.08% at a weight of 1 kg. And the data from the measurement results of the research module shows the smallest error presentation of 0.01% at a weight of 3 kg. Making a research module in the form of a scale placed on an infant warmer can make it easier for the wearer.


2021 ◽  
Vol 407 ◽  
pp. 126328
Author(s):  
Kien Trung Nguyen ◽  
Nguyen Thanh Hung

2021 ◽  
Vol 2 (4) ◽  
Author(s):  
Yuanyuan Dong ◽  
Andrew V. Goldberg ◽  
Alexander Noe ◽  
Nikos Parotsidis ◽  
Mauricio G. C. Resende ◽  
...  

AbstractWe present a set of new instances of the maximum weight independent set problem. These instances are derived from a real-world vehicle routing problem and are challenging to solve in part because of their large size. We present instances with up to 881 thousand nodes and 383 million edges.


Author(s):  
Savita . ◽  
Devender Chahal ◽  
Arvind Malik ◽  
Sarita Devi

Background: The present investigation was carried out during the cropping season of year 2019-20 to find out the most suitable growing condition as well as variety of Asiatic lily for the production of bulbs/bulblets under Hisar (Haryana) conditions. Methods: The experiment was laid out in RBD (factorial) with three replications and twelve treatment combinations, comprising of three growing conditions (polyhouse of 200 µ, green shade-net of 50% shade and open field) and four varieties (Courier White, Tresor, Nova Lux and Red Stone). Result: These varieties of Asiatic lily when grown under polyhouse performed better in some parameters resulting in early bulb sprouting, maximum plant height and number of leaves/plant and the minimum days upto harvesting of bulbs, however, in other parameters viz. leaf length and width, weight of bulbs/plant, diameter of bulb and number of bulblets/plant, the shade-net condition was observed to be better than polyhouse. Overall, Tresor performed better, resulting in early bulb sprouting (5.11 days), minimum days (236.56) upto harvesting of bulbs and the maximum plant height (89.01 cm), number of leaves/plant (64.08), leaf length (9.50 cm), diameter of bulb (3.91 cm) and number of bulblets/plant (2.99) and it was followed by Red Stone which produced maximum weight of bulbs/plant (59.03 g) and observed next to Tresor in most of the parameters. Tresor grown under polyhouse took minimum days (231) upto the harvesting of bulbs, produced maximum plant height (115.13 cm) and number of leaves/plant (69.67) and it was closely followed by Red Stone grown under same condition. Further, under the shade-net, Red Stone produced maximum weight of bulbs/plant (65.30 g) followed by Tresor (63.93 g), while the maximum number of bulblets/plant (3.90) were produced by Tresor followed by Red Stone (3.44). Henceforth, Tresor and Red Stone when grown under polyhouse performed better in vegetative parameters and when grown under shade-net performed better in bulb parameters than the other combinations of growing conditions and varieties.


2021 ◽  
Vol 72 ◽  
pp. 39-67
Author(s):  
Shaowei Cai ◽  
Jinkun Lin ◽  
Yiyuan Wang ◽  
Darren Strash

This paper explores techniques to quickly solve the maximum weight clique problem (MWCP) in very large scale sparse graphs. Due to their size, and the hardness of MWCP, it is infeasible to solve many of these graphs with exact algorithms. Although recent heuristic algorithms make progress in solving MWCP in large graphs, they still need considerable time to get a high-quality solution. In this work, we focus on solving MWCP for large sparse graphs within a short time limit. We propose a new method for MWCP which interleaves clique finding with data reduction rules. We propose novel ideas to make this process efficient, and develop an algorithm called FastWClq. Experiments on a broad range of large sparse graphs show that FastWClq finds better solutions than state-of-the-art algorithms while the running time of FastWClq is much shorter than the competitors for most instances. Further, FastWClq proves the optimality of its solutions for roughly half of the graphs, all with at least 105 vertices, with an average time of 21 seconds.


Sign in / Sign up

Export Citation Format

Share Document