Single Thread Research Articles

Rolling Formability Optimization of Locking Bolt Based on Double-Thread Structure Composed of Coaxial Single and Multiple Threads

Abstract In previous studies, we developed innovative anti-loosening bolts and nuts with a double-thread structure (denoted DTB-IIC) composed of coaxial single and multiple coarse threads. It was also experimentally proven that the DTB-IIC has high anti-loosening performance. In this study, we analytically and experimentally investigated the effects of multiple thread groove depths and rolling methods on the thread rolling formability of DTB-IIC fasteners. The bottom rise rate of the multiple-thread groove was set in three ways of 50%, 60%, and 70%. As the depth of the multiple thread groove became shallower, peeling on the thread surface was suppressed and the high temperatures produced by thread rolling decreased significantly, but the loosening resistance against vibration clearly decreased. We compared three typical mass production processes for bolts: the round die method, the flat die method, and the planetary method, with the bottom rise rate set at 50%. It was found that the flat die method had the best rolling formability in terms of screw-thread shape and surface quality. A Finite element simulation consistently reproduced the deformation process of the complex DTB-IIC thread and revealed that the material shear flow due to over-rolling led to the occurrence of surface peeling.

Direct Multi‐Thread Adaptive Control With Attracting Manifold Design

ABSTRACTThis article presents a novel multi‐thread attracting manifold (MTAM) adaptive control scheme. The novel contribution of this new controller lies in how the attracting manifold design method is spread across multiple estimates of the truth while simultaneously weighting between said individual estimates to arrive at an adaptive composite estimate which outperforms single thread adaptive controllers. A notable benefit of this new formulation is that it allows for both the weighting of multiple threads and monotonic decrease of parameter error to aid the performance of transient error dynamics, without arbitrarily increasing adaptation gains. The benefits of the proposed controller over existing adaptive control schemes are analyzed through two aerospace flight control applications from the literature.

Thread-Based Bienzymatic Biosensor for Linoleic Acid Detection.

The concentration of nonesterified fatty acids (NEFAs) in biological media is associated with metabolic and cardiovascular disorders (e.g., diabetes, cancer, and cystic fibrosis) and in food products is indicative of their quality. Therefore, the early identification of NEFAs is crucial for both medical diagnosis and food quality assessment. However, the development of a portable and scalable sensor capable of detecting these compounds at a low cost presents challenges due to their considerable chemical and physical stability. This research endeavors to illustrate the viability of detecting linoleic acid using a chemiresistive bienzymatic sensor constructed with cotton thread. The sensor's design incorporates the conductive polymer poly(3,4-ethylenedioxythiophene):polystyrenesulfonate (PEDOT:PSS) within the thread, alongside the enzymes horseradish peroxidase (HRP) and lipoxygenase (LOX). By implementing this technology, a sensitive detection range spanning from 161 nM to 16.1 μM is achieved when the PEDOT:PSS/HRP/LOX system is integrated into a single thread. The sensor exhibits exceptional selectivity toward linoleic acid, owing to the specific enzymatic reaction between LOX and linoleic acid. This selectivity is upheld even in the presence of other unsaturated fatty acids. This system can be used for future designs with the capability to detect polyunsaturated fatty acids and other intricate biomolecules.

Parallelization of particle-mass-transfer algorithms on shared-memory, multi-core CPUs

Simulating the transfer of mass between particles is not straightforwardly parallelized because it involves the calculation of the influence of many particles on each other. Engdahl et al. (2019) intuited that the number of matrix operations used for mass transfer grows quadratically with the number of particles, so that dividing the domain geometrically into sub-domains will give speed and memory advantages, even on a single processing thread. Those authors also showed the speed scalability of several one-dimensional examples on multiple cores. Here, we extend those results for more general cases, both in terms of spatial dimensions and algorithmic implementation. We show that there is an optimal subdivision scheme for naive, full-matrix calculations on a multi-processor, or multi-threading shared-memory machine. A similar sparse-matrix implementation that also uses row-and-column-sum normalization often greatly reduces the memory requirements. We also introduce a completely new mass transfer algorithm that uses a non-geometric domain decomposition and only matrix row-sum normalization. This allows the mass-transfer “matrix” to be constructed and solved one row at a time in parallel, so it is faster and vastly more memory efficient than previous methods, but requires more care for suitable accuracy.

OptiSAIL: A system for the simultaneous retrieval of soil, leaf, and canopy parameters and its application to Sentinel-3 Synergy (OLCI+SLSTR) top-of-canopy reflectances

This paper describes the selected algorithm for the ESA climate change initiative vegetation parameters project. Multi- and hyper-spectral, multi-angular, or multi-sensor top-of-canopy reflectance data call for an efficient generic retrieval system which can improve the consistent retrieval of standard canopy parameters as albedo, Leaf Area Index (LAI), Fraction of Absorbed Photosynthetically Active Radiation (fAPAR) and their uncertainties, and exploit the information to retrieve additional parameters (e.g. leaf pigments). We present a retrieval system for canopy and sub-canopy parameters (OptiSAIL), which is based on a model comprising SAIL (canopy reflectance), PROSPECT-D (leaf properties), TARTES (snow properties), a soil model (soil reflectance anisotropy, moisture effect), and a cloud contamination model. The inversion is gradient based and uses codes created by Automatic Differentiation. The full per pixel covariance-matrix of the retrieved parameters is computed. For this demonstration, single observation data from the Sentinel-3 SY_2_SYN (synergy) product is used. The results are compared with the MODIS 4-day LAI/fAPAR product and PhenoCam site photography. OptiSAIL produces generally consistent and credible results, at least matching the quality of the technically quite different MODIS product. The system is computationally efficient with a rate of 150 pixel s−1 (7 ms per pixel) for a single thread on a current desktop CPU using observations on 26 bands. Not all of the model parameters are well determined in all situations. Significant correlations between the parameters are found, which can change sign and magnitude over time. OptiSAIL appears to meet the design goals and puts real-time processing with this kind of system into reach.

Surgical outcomes of external double needle puncture epiglottopexy in severe laryngomalacia patients with high-risk comorbidities

ObjectivesPatients with severe laryngomalacia (LM) and high-risk comorbidities require surgical interventions such as supraglottoplasty. However, evidence supporting epiglottopexy for these patients is scarce. This study aims to report the surgical outcomes of external double needle puncture using a single thread for epiglottopexy in severe LM patients with high-risk comorbidities. MethodsThis retrospective study was conducted at a single tertiary hospital. We enrolled 32 patients under 12 months with severe LM who underwent external double needle puncture epiglottopexy. We compared clinical factors between the successful and failed groups and identified risk factors for the failure of epiglottopexy. ResultsOf the airway surgical outcomes, 22 (68.7 %) patients were in the successful group. In the failed group (n = 10, 32.3 %), patients received tracheostomies due to uncontrolled saliva (n = 3), the need for mechanical ventilation (n = 3), and uncontrolled LM (n = 4). There was a statistically significant difference in body weight at the time of surgery and the proportion of associated comorbidities between the two groups. Gestational age was the only factor significantly associated with successful surgical outcomes in both univariate and multivariate logistic regression analyses (odds ratio = 2.263; 95 % confidence interval, 1.042–4.918; P = 0.039). ConclusionExternal double needle puncture epiglottopexy is an effective surgical method for patients with LM who present with a retroflexed floppy epiglottis and high-risk comorbidities. Low gestational age is a major risk factor for surgical failure. Consideration of factors such as the need for mechanical ventilation and uncontrolled saliva should be prioritized before and after surgery to enhance surgical success.

Determining Adequate Sample Size for Social Survey Research

Determination of a valid sample size is a fundamental step in research. This paper explains how existing formulas are tied in a single thread by applying the concept of standard error, margin of error, Z and t scores, confidence interval and sampling distribution. Bringing the concept of sample control ratio, we suggest a unified formula which is where I is the sample size, N is the population, t is the t-value at a desired level of probability with df = (N-1) and  is the sample control ratio to be estimated by for continuous variables and for categorical variables where  is the proportion of acceptable error and p is the proportion of presence of an attribute in the population. This formula does not need the finite population correction, and it has been derived from and consistent with existing formulas. A researcher does not need to calculate the error margin in absolute terms for this formula, and it is sufficient to provide only the proportion of error (e.g., 0.03 or 0.05). This paper should help social scientists, researchers, academicians and students determine the appropriate sample size for their research with greater confidence and clarity. J Bangladesh Agril Univ 22(2): 146-157, 2024

Accurate 3D LiDAR SLAM System Based on Hash Multi-Scale Map and Bidirectional Matching Algorithm.

Simultaneous localization and mapping (SLAM) is a hot research area that is widely required in many robotics applications. In SLAM technology, it is essential to explore an accurate and efficient map model to represent the environment and develop the corresponding data association methods needed to achieve reliable matching from measurements to maps. These two key elements impact the working stability of the SLAM system, especially in complex scenarios. However, previous literature has not fully addressed the problems of efficient mapping and accurate data association. In this article, we propose a novel hash multi-scale (H-MS) map to ensure query efficiency with accurate modeling. In the proposed map, the inserted map point will simultaneously participate in modeling voxels of different scales in a voxel group, enabling the map to represent objects of different scales in the environment effectively. Meanwhile, the root node of the voxel group is saved to a hash table for efficient access. Secondly, considering the one-to-many (1 ×103 order of magnitude) high computational data association problem caused by maintaining multi-scale voxel landmarks simultaneously in the H-MS map, we further propose a bidirectional matching algorithm (MSBM). This algorithm utilizes forward-reverse-forward projection to balance the efficiency and accuracy problem. The proposed H-MS map and MSBM algorithm are integrated into a completed LiDAR SLAM (HMS-SLAM) system. Finally, we validated the proposed map model, matching algorithm, and integrated system on the public KITTI dataset. The experimental results show that, compared with the ikd tree map, the H-MS map model has higher insertion and deletion efficiency, both having O(1) time complexity. The computational efficiency and accuracy of the MSBM algorithm are better than that of the small-scale priority matching algorithm, and the computing speed of the MSBM achieves 49 ms/time under a single CPU thread. In addition, the HMS-SLAM system built in this article has also reached excellent performance in terms of mapping accuracy and memory usage.

Fog water collection of harp-like single smooth and texturized filaments under field conditions

Harp-like arrangements of filaments have been proposed as a more efficient alternative to cross-linked screens for fog water collection. We investigate the fog capture capabilities of both smooth and texturized single vertical nylon threads under field conditions. Redefining the Stokes number in terms of the wetted string and the pinning drop geometry allowed the average fog water collection efficiency to be described using a physically based droplet impaction model with acceptable fit (NSE = 0.614; RMSE = 0.093). In addition, rugosity of the filaments was found to affect the long-term fog water yield (up to 41 % lower), while parallel grooves along the filaments maximised the fog collection, with 51 % improvement, under real field conditions.

GMiner++: Boosting GPU-based frequent itemset mining by reducing redundant computations

Frequent itemset mining (FIM) is increasingly important in fundamental data mining techniques. However, the applicability of existing FIM methods is limited, mainly because of their performance. The expected performance improvement is limited owing to the exploitation of only a single thread, despite numerous efficient single-threaded FIM methods being proposed. Numerous parallel FIM methods have been devised using graphic processing units (GPU) or multicore central processing units (CPUs) to overcome the shortcomings of these methods. However, when extracting patterns from large amounts of data, multi-threaded FIM methods exhibit a similar performance tendency to single-threaded FIM methods, because of their large memory footprints and computations. Hence, we propose GMiner++, a memory-efficient GPU-based FIM method equipped with several GPUs. We propose a sub-database of the same size called bit array blocks, which contains pre-calculated bit arrays of F1∪P(IK). These bit arrays are repeatedly exploited during mining tasks using an elegant probabilistic model. GMiner++ can obtain frequent patterns and use several GPUs only by using the bit array blocks and the occurrence update scheme. The proposed method decreased redundant computations using pre-calculated bit arrays with bit array blocks. In addition, GMiner++ does not create intermediate data during mining tasks to increase robustness and reduce memory footprints. Simulation results demonstrate that GMiner++ outperformed existing FIM methods concerning performance and scalability with increasing robustness.

Morphodynamics and depositional architecture of mid‐channel bars in large Amazonian rivers

AbstractLarge rivers are characterized by large water discharges, high suspended sediment fluxes and low slope, and typically display multiple channels that are separated by large complex bars. The most common channel style found in these rivers is characterized by the alternating presence of single and multiple channel threads. Mid‐channel compound bars separate a main deeper channel from shallower secondary channels, leading to low‐order braiding and low to moderate sinuosity. Despite the importance of this type of river for global terrestrial sediment transport and the interpretation of ancient fluvial successions, integrated depositional models for large multi‐channel rivers are still not fully developed. This paper interprets the channel morphodynamics and depositional architecture of such large rivers by investigating the distinctive features of their laterally‐accreting mid‐channel bars in the Solimões–Amazonas River. This is achieved by examination of temporal series of satellite images, quantification of bedforms using multibeam echosounding surveys, analysis of shallow seismic and ground penetrating radar surveys of selected areas, and on‐site field observations and sample collections. Such mid‐channel bars produce directional variability in planform scroll bar accretion of up to 180°. As these bars – and their associated channels – evolve, they become progressively shallower, due to the bifurcation of the two channels and the resultant partitioning of discharge that leads to a gradual reduction in transport capacity within the outer channel. The preserved successions of this process in the alluvial plain are characterized by fining‐upward trends, with larger cross‐strata sets at mid‐depths and internal erosional surfaces marking distinct cycles of bar development with potentially differing palaeocurrent trends. The new depositional models proposed for these mid‐channel bars and channels constitute a basis for the recognition of large multi‐channel river deposits in the ancient rock record.

What Are the Factors That Enable Thread Lifting to Last Longer?

Thread-lifting traditionally addressed aging-related skin laxity by leveraging precise thread placement and traction. However, recent advancements, notably cog threads, expanded its application to younger patients seeking facial contour refinement. These newer threads effectively lift sagging areas and refine facial contours, broadening the procedure’s appeal. Challenges arise in selecting threads due to variable physician preferences and patient needs. Clear indications for thread efficacy are vital for credibility and tailored selection. Thread choice depends on tissue laxity, necessitating lighter threads for minimal laxity and stronger ones for significant sagging. However, no single thread universally suits all cases. Combining different threads is favored for optimal outcomes and minimizing side effects. Excessive traction post-procedure may lead to prolonged discomfort and skin irregularities. Post-procedural tension adjustments through massage remain debated, potentially conflicting with minimally invasive principles. Understanding thread characteristics guides tailored selection, considering patient conditions and procedural goals. This comprehensive understanding extends beyond specific products, aiming for optimal outcomes in thread-lifting procedures. Key factors influencing outcomes encompass thread materials, thickness, cog shapes, insertion depth, lifting vectors, and absorbable thread expiration dates.

The Science of Implicit Race Bias: Evidence from the Implicit Association Test

Abstract Beginning in the mid-1980s, scientific psychology underwent a revolution – the implicit revolution – that led to the development of methods to capture implicit bias: attitudes, stereotypes, and identities that operate without full conscious awareness or conscious control. This essay focuses on a single notable thread of discoveries from the Race Attitude Implicit Association Test (RA-IAT) by providing 1) the historical origins of the research, 2) signature and replicated empirical results for construct validation, 3) further validation from research in sociocognitive development, neuroscience, and computer science, 4) new validation from robust association between regional levels of race bias and socially significant outcomes, and 5) evidence for both short- and long-term attitude change. As such, the essay provides the first comprehensive repository of research on implicit race bias using the RA-IAT. Together, the evidence lays bare the hollowness of current-day actions to rectify disadvantage experienced by Black Americans at individual, institutional, and societal levels.

Intraoperative lateral wall breach simulation in the cadaveric spine and the impact of thread designs of screws on pullout strength in the osteoporotic thoracic vertebrae: A biomechanical study in human cadavers.

This study aimed (1) to simulate pedicle screw pullout after intraoperative external wall perforation and (2) to assess restoration strength with different thread designs in the pedicle screw instrumentation for osteoporotic thoracic vertebrae. Twenty fresh-frozen human cadaveric thoracic vertebra bodies were prepared and divided into 4 groups: group 1, 5.5 mm × 45 mm polyaxial single thread pedicle screws (PASTS); group 2, after wall injury 5.5 mm × 45 mm PASTS; group 3, 6.5 mm × 45 mm PASTS after wall injury; and group 4: 6.5 mm × 45 mm polyaxial mixed-threaded screws after wall injury. While group 1 was the control group, groups 2, 3, and 4 were used as study groups after the lateral wall breach. All prepared screw units were placed on a universal pullout measurement testing device. The mean bone mineral density for 20 thoracic vertebrae was 0.57 ± 0.12 g/cm2 (range 0.53-0.6 g/cm2 ). The mean pullout strength was 474.90 Newtons (N) for group 1, 412.85 N for group 2, 475.4 N for group 3, and 630.74N for group 4. The lateral wall breach caused a 14.1 % decrease in average pullout strength compared with the initial screw pullout. Mixed (double)-threaded screws increased pullout strength compared to 6.5 mm screws (P=.036) Conclusion: Using a 1 mm thicker polyaxial pedicle screw or mixed (double)-threaded pedicle screw seems to increase pullout strength; however, this was statistically significant only for group 4. In the thoracic spine, the redirection possibility of the pedicle screw is limited, and augmentation with cement will not be appropriate due to the risk of wall injury-related leakage. Therefore, care should be taken to avoid violating the lateral cortex by using appropriate pedicle entry points and trajectories.

Biomechanical evaluation of the ST-knot: A new suture for flexor tendon repair

PurposeAlthough tendon lacerations are common, there is currently no consensus on choice of suture. Easy and fast sutures that impart enough strength to allow mobilization are needed. This study compared the ex vivo biomechanical strength (force required to create a 2 mm tendon gap) of a novel suture (ST-knot) with that of a conventional suture (double Kessler). Materials and methodsForty fresh deep flexor tendons from porcine forelimbs were used. Both repaired tendon ends were mounted on standard traction jaws of an axial traction machine at an initial distance of 40 mm for all tendons. A high-definition camera was used to determine the force forming a 2 mm gap. Ten tendons in group 1 (ST-knot) and 10 in group 2 (double Kessler) were prepared with PDS 4.0 (single thread for Kessler, double thread for ST-knot). Tendons in groups 3 (ST-knot) and 4 (double Kessler) were repaired with PDS 1.0 using the same principle. ResultsThere was no significant difference in the force required to form a 2 mm tendon gap between groups 1 and 2, and this trend was identical when using a stronger thread in groups 3 and 4. The maximum force before rupture, mode of repair failure, stress and stiffness were also comparable, with no significant differences between groups 1 and 2, or between groups 3 and 4. ConclusionsThe ST-knot showed comparable results to the double-Kessler knot, whichever the thread used. Because it involves fewer steps than conventional techniques and is easy to perform, the ST-knot may offer a therapeutic solution, particularly in complex trauma with multiple tendon injury.

OPTIMIZING NODE.JS APPLICATION PERFORMANCE THROUGH MAIN THREAD OFFLOADING

Node.js is a JavaScript runtime environment that allows you to run JavaScript code outside of a web browser. It works by using a single thread to handle multiple requests using a callback-based event loop. This means that Node.js operates in an event-driven, non-blocking I/O model. One potential weak point of Node.js is that it is designed to be a single-threaded runtime environment, which means that it may not be the best choice for applications that require a high degree of parallelism or multi-threading. While Node.js can handle multiple I/O operations simultaneously through its event-driven architecture, it can struggle with CPU-bound tasks that require heavy computation. This academic article investigates the concept of "offloading" the main thread in Node.js, which refers to the process of delegating heavy computational tasks to worker threads to improve the overall performance and responsiveness Node. js application. The article provides a comprehensive analysis of different techniques for offloading the main thread, such as using worker threads, child processes, and cluster modules. It also explores the potential trade-offs and performance implications of each technique, and provides recommendations for selecting the most suitable approach for different use cases. The article highlights the importance of optimizing the use of CPU resources and avoiding blocking the event loop, which can lead to degraded performance and poor user experience. It also emphasizes the need for careful monitoring and profiling of Node.js applications to identify performance bottlenecks and optimize the use of available resources. Overall, this article provides valuable insights and practical recommendations for developers and system architects who want to improve the performance and scalability of their Node.js applications by unloading the main thread.

Weaving construction software system

The construction methods within the Desint system are organized into three distinct groups, each catering to specific aspects of the weaving process. These groups delineate the procedures involved in creating woven patterns and are selected based on the type of the initial element required to achieve the final desired weave. This group encompasses construction methods that initiate the weaving process from fundamental elements. These elements can range from a single thread to a collection of threads. The focus is on building the foundational structure of the weave, starting from basic components. The second group of construction methods deals with the assembly of specific parts of pattern rapports using the initial elements established in Group 1. It involves combining and arranging these elements to form intricate patterns within the weave. This stage contributes to the development of more complex and detailed designs. The third group is dedicated to specialized methods for constructing pattern rapports with a specific arrangement, often guided by a pre-determined drawing or design. This group involves intricate techniques that go beyond basic weaving, allowing for the creation of intricate and customized patterns based on artistic or functional requirements. The choice of the group is contingent upon the type of initial element essential for constructing the final desired weave. This systematic categorization enables weavers to select the most appropriate set of methods based on the intended design complexity and intricacy.

Optimizing the gravitational tree algorithm for many-core processors

ABSTRACT Gravitational N-body simulations calculate numerous interactions between particles. The tree algorithm reduces these calculations by constructing a hierarchical oct-tree structure and approximating gravitational forces on particles. Over the last three decades, the tree algorithm has been extensively used in large-scale simulations, and its parallelization in distributed memory environments has been well studied. However, recent supercomputers are equipped with many CPU cores per node, and optimizations of the tree construction in shared memory environments are becoming crucial. We propose a novel tree construction method in contrast to the conventional top-down approach. It first creates all leaf cells without traversing the tree and then constructs the remaining cells by a bottom-up approach. We evaluated the performance of our novel method on the supercomputer Fugaku and an Intel machine. On a single thread, our method accelerates one of the most time-consuming processes of the conventional tree construction method by a factor of above 3.0 on Fugaku and 2.2 on the Intel machine. Furthermore, as the number of threads increases, our parallel tree construction time reduces considerably. Compared to the conventional sequential tree construction method, we achieve a speed up of over 45 on 48 threads of Fugaku and more than 56 on 112 threads of the Intel machine. In stark contrast to the conventional method, the tree construction with our method no longer constitutes a bottleneck in the tree algorithm, even when using many threads.

Structural Outlier Detection and Zernike-Canterakis Moments for Molecular Surface Meshes-Fast Implementation in Python.

Object retrieval systems measure the degree of similarity of the shape of 3D models. They search for the elements of the 3D model databases that resemble the query model. In structural bioinformatics, the query model is a protein tertiary/quaternary structure and the objective is to find similarly shaped molecules in the Protein Data Bank. With the ever-growing size of the PDB, a direct atomic coordinate comparison with all its members is impractical. To overcome this problem, the shape of the molecules can be encoded by fixed-length feature vectors. The distance of a protein to the entire PDB can be measured in this low-dimensional domain in linear time. The state-of-the-art approaches utilize Zernike-Canterakis moments for the shape encoding and supply the retrieval process with geometric data of the input structures. The BioZernike descriptors are a standard utility of the PDB since 2020. However, when trying to calculate the ZC moments locally, the issue of the deficiency of libraries readily available for use in custom programs (i.e., without relying on external binaries) is encountered, in particular programs written in Python. Here, a fast and well-documented Python implementation of the Pozo-Koehl algorithm is presented. In contrast to the more popular algorithm by Novotni and Klein, which is based on the voxelized volume, the PK algorithm produces ZC moments directly from the triangular surface meshes of 3D models. In particular, it can accept the molecular surfaces of proteins as its input. In the presented PK-Zernike library, owing to Numba's just-in-time compilation, a mesh with 50,000 facets is processed by a single thread in a second at the moment order 20. Since this is the first time the PK algorithm is used in structural bioinformatics, it is employed in a novel, simple, but efficient protein structure retrieval pipeline. The elimination of the outlying chain fragments via a fast PCA-based subroutine improves the discrimination ability, allowing for this pipeline to achieve an 0.961 area under the ROC curve in the BioZernike validation suite (0.997 for the assemblies). The correlation between the results of the proposed approach and of the 3D Surfer program attains values up to 0.99.

Improved dynamic programming algorithms for unconstrained two-dimensional guillotine cutting

In the unconstrained two-dimensional cutting problem (U2DCP), we are given a large rectangular sheet to be cut in order to extract small rectangular pieces, with no limits on the number (demand) of desired pieces. We face the variant with guillotine constraint, requiring to cut any rectangle in two parts through vertical/horizontal cuts with end points on the rectangle boundaries.For a given U2DCP instance, the dynamic programming approach can be used either to optimally solve it, or to obtain a full matrix of upper bounds suitable for the constrained variant of the problem where limits exist on the piece demands. The elements of the full matrix are also usable as partial solutions to build lower bounds for the non-guillotine variant.In this paper, we propose two major improvements to a dynamic programming procedure previously shown to be capable of solving very large size instances. First, we introduce a new option for one of the three conditions used for the anti-redundancy strategies on cut coordinates. Second, following the effort of the Operations Research community to exploit the feature of modern CPUs containing multi-core processors, we provide a parallelization scheme.An extended computational campaign is presented. We compare the upgraded procedure with its previous version on a single thread and with the currently state-of-the-art algorithm for multi-thread platforms, outperforming both in terms of execution time on average by a factor of 1.7 and 12, respectively, or for some problem instances up to 4.5 and 50, respectively. Moreover, the new procedure can solve two very large instances previously unsolved, as well as the new huge instances proposed in this paper.