Evolutions of the Ruled Surfaces via the Evolution of Their Directrix Using Quasi Frame along a Space Curve

In this paper, evolutions of ruled surfaces generated by the quasi normal and quasi binormal vector fields of space curve are presented. These evolutions of the ruled surfaces depend on the evolutions of their directrix using quasi frame along a space curve.

RULED SURFACE MACHINING BY 4-AXES SIMULTANEOUS CONTROL WIRE-EDM

On the tasis of study in the mathematical model of 3-dimensional ruled surface (RS),this paper introduces a new concept of distance paramcter (DP) and also puts forward that themethod of modeling a RS depends on not only two boundary curves but also DP. According toabove theory, the formulas to calculate corresponding point coordinates to any kind of top and bot-tom profile of a workpiece and formulas to calcuate the maximum inclination angle of ruling linehave been obtained. Then a different top and bottom RS mathining method including profile withline-are combination as well as parametric curves has been achieved by 4-axes simultancous con-trol programming proposed.

CAD/CAM ALGORITHM OF RULED SURFACE BASED ON LINE GEOMETRY

A new concept of design and manufacturing of ruled surface based on line geometry is proposed. Some practical algorithm for CAD system is derived. Some problems in design and manufacturing of ruled surface can be solved by using the algorithm.

Tool path generation for 5-axis flank milling of ruled surfaces with optimal cutter locations considering multiple geometric constraints

Ruled surfaces found in engineering parts are often blended with a constraint surface,like the blade surface and hub surface of a centrifugal impeller.It is significant to accurately machine these ruled surfaces in flank milling with interference-free and fairing tool path,while current models in fulfilling these goals are complex and rare.In this paper,a tool path planning method with optimal cutter locations(CLs)is proposed for 5-axis flank milling of ruled surfaces under multiple geometric constraints.To be specific,a concise three-point contact tool positioning model is firstly developed for a cylindrical cutter.Different tool orientations arise when varying the three contact positions and a tool orientation pool with acceptable cutter-surface deviation is constructed using a meta-heuristic algorithm.Fairing angular curves are derived from candidates in this pool,and then curve registration for cutter tip point on each determined tool axis is performed in respect of interference avoidance and geometric smoothness.On this basis,an adaptive interval determination model is developed for deviation control of interpolated cutter locations.This model is designed to be independent of the CL optimization process so that multiple CLs can be planned simultaneously with parallel computing technique.Finally,tests are performed on representative surfaces and the results show the method has advantages over previous meta-heuristic tool path planning approaches in both machining accuracy and computation time,and receives the best comprehensive performance compared to other multi-constrained methods when machining an impeller.

Prediction of cutting forces in flank milling of parts with non-developable ruled surfaces

Predicting the cutting forces required for five-axis flank milling is a challenging task due to the difficulties involved in determining the Undeformed Chip Thickness(UCT) and CutterWorkpiece Engagement(CWE). To solve these problems, this paper presents a new mechanistic cutting force model based on the geometrical analysis of a flank milling process. In the model,the part feature and corresponding cutting location data are taken as input information. The UCT considering cutter runout is calculated according to the instantaneous feed rate of the element cutting edges. A solid-discrete-based method is used to precisely and efficiently identify the CWE between the end mill and the surface being machined. Then, after calibrating the specific force coef-ficients, the mechanistic milling force can be obtained. During the validation process, two practical operations, three-axis flank milling of a vertical surface and five-axis flank milling of a nondevelopable ruled surface, are conducted. Comparisons between predicted and measured cutting forces demonstrate the reliability of the proposed cutting force model.

Positioning method of a cylindrical cutter for ruled surface machining based on minimizing one-sided Hausdorff distance

Motivated by the definition of the machining errors induced by tool path planning methods, a mapping curve of the tool axis of a cylindrical cutter is constructed on the tool surface. The mapping curve is a typical one that can be used to express the closeness between the tool surface and the surface to be machined. A novel tool path planning method is proposed for flank or plunge milling ruled surfaces based on the minimization of the one-sided Hausdorff distance （HD） from the mapping curve to the surface to be machined. It is a nonlinear optimization problem in best uniform approximation （BUA） or Chebyshev sense. A mathematical programming model for computing the minimum one-sided HD is proposed. The linearization method of the programming model is provided and the final optimal solutions are obtained by simplex method. The effectiveness of the proposed BUA method is verified by two numerical examples and compared with the least squares （LS） and double point offset （DPO） methods. The variation in tool orientation induced by the optimization of the tool positions is also evaluated.

Proper Reparametrization of Rational Ruled Surface

In this paper, we present a proper reparametrization algorithm for rational ruled surfaces. That is, for an improper rational parametrization of a ruled surface, we construct a proper rational parametrization for the same surface. The algorithm consists of three steps. We first reparametrize the improper rational parametrization caused by improper supports. Then the improper rational parametrization is transformed to a new one which is proper in one of the parameters. Finally, the problem is reduced to the proper reparametrization of planar rational algebraic curves.

A Symbolic-Numeric Approach for Parametrizing Ruled Surfaces

This paper presents symbolic algorithms to determine whether a given surface(implicitly or parametrically defined)is a rational ruled surface and find a proper parametrization of the ruled surface.However,in practical applications,one has to deal with numerical objects that are given approximately,probably because they proceed from an exact data that has been perturbed under some previous measuring process or manipulation.For these numerical objects,the authors adapt the symbolic algorithms presented by means of the use of numerical techniques.The authors develop numeric algorithms that allow to determine ruled surfaces"close"to an input(not necessarily ruled)surface,and the distance between the input and the output surface is computed.

THAPE: A Tunable Hybrid Associative Predictive Engine Approach for Enhancing Rule Interpretability in Association Rule Learning for the Retail Sector

Association rule learning(ARL)is a widely used technique for discovering relationships within datasets.However,it often generates excessive irrelevant or ambiguous rules.Therefore,post-processing is crucial not only for removing irrelevant or redundant rules but also for uncovering hidden associations that impact other factors.Recently,several post-processing methods have been proposed,each with its own strengths and weaknesses.In this paper,we propose THAPE(Tunable Hybrid Associative Predictive Engine),which combines descriptive and predictive techniques.By leveraging both techniques,our aim is to enhance the quality of analyzing generated rules.This includes removing irrelevant or redundant rules,uncovering interesting and useful rules,exploring hidden association rules that may affect other factors,and providing backtracking ability for a given product.The proposed approach offers a tailored method that suits specific goals for retailers,enabling them to gain a better understanding of customer behavior based on factual transactions in the target market.We applied THAPE to a real dataset as a case study in this paper to demonstrate its effectiveness.Through this application,we successfully mined a concise set of highly interesting and useful association rules.Out of the 11,265 rules generated,we identified 125 rules that are particularly relevant to the business context.These identified rules significantly improve the interpretability and usefulness of association rules for decision-making purposes.

Semantic Consistency and Correctness Verification of Digital Traffic Rules

The consensus of the automotive industry and traffic management authorities is that autonomous vehicles must follow the same traffic laws as human drivers.Using formal or digital methods,natural language traffic rules can be translated into machine language and used by autonomous vehicles.In this paper,a translation flow is designed.Beyond the translation,a deeper examination is required,because the semantics of natural languages are rich and complex,and frequently contain hidden assumptions.The issue of how to ensure that digital rules are accurate and consistent with the original intent of the traffic rules they represent is both significant and unresolved.In response,we propose a method of formal verification that combines equivalence verification with model checking.Reasonable and reassuring digital traffic rules can be obtained by utilizing the proposed traffic rule digitization flow and verification method.In addition,we offer a number of simulation applications that employ digital traffic rules to assess vehicle violations.The experimental findings indicate that our digital rules utilizing metric temporal logic(MTL)can be easily incorporated into simulation platforms and autonomous driving systems(ADS).

STRONGLY CONVERGENT INERTIAL FORWARD-BACKWARD-FORWARD ALGORITHM WITHOUT ON-LINE RULE FOR VARIATIONAL INEQUALITIES

This paper studies a strongly convergent inertial forward-backward-forward algorithm for the variational inequality problem in Hilbert spaces.In our convergence analysis,we do not assume the on-line rule of the inertial parameters and the iterates,which have been assumed by several authors whenever a strongly convergent algorithm with an inertial extrapolation step is proposed for a variational inequality problem.Consequently,our proof arguments are different from what is obtainable in the relevant literature.Finally,we give numerical tests to confirm the theoretical analysis and show that our proposed algorithm is superior to related ones in the literature.

Effect of speed humps on instantaneous traffic emissions in a microscopic model with limited deceleration capacity

As a common transportation facility, speed humps can control the speed of vehicles on special road sections to reduce traffic risks. At the same time, they also cause instantaneous traffic emissions. Based on the classic instantaneous traffic emission model and the limited deceleration capacity microscopic traffic flow model with slow-to-start rules, this paper has investigated the impact of speed humps on traffic flow and the instantaneous emissions of vehicle pollutants in a single lane situation. The numerical simulation results have shown that speed humps have significant effects on traffic flow and traffic emissions. In a free-flow region, the increase of speed humps leads to the continuous rise of CO_(2), NO_(X) and PM emissions. Within some density ranges, one finds that these pollutant emissions can evolve into some higher values under some random seeds. Under other random seeds, they can evolve into some lower values. In a wide moving jam region, the emission values of these pollutants sometimes appear as continuous or intermittent phenomenon. Compared to the refined Na Sch model, the present model has lower instantaneous emissions such as CO_(2), NO_(X) and PM and higher volatile organic components(VOC) emissions. Compared to the limited deceleration capacity model without slow-to-start rules, the present model also has lower instantaneous emissions such as CO_(2), NO_(X) and PM and higher VOC emissions in a wide moving jam region. These results can also be confirmed or explained by the statistical values of vehicle velocity and acceleration.

Improved STNModels and Heuristic Rules for Cooperative Scheduling in Automated Container Terminals

Improving the cooperative scheduling efficiency of equipment is the key for automated container terminals to copewith the development trend of large-scale ships. In order to improve the solution efficiency of the existing spacetimenetwork (STN) model for the cooperative scheduling problem of yard cranes (YCs) and automated guidedvehicles (AGVs) and extend its application scenarios, two improved STN models are proposed. The flow balanceconstraints in the original model are decomposed, and the trajectory constraints of YCs and AGVs are added toacquire the model STN_A. The coupling constraint in STN_A is updated, and buffer constraints are added toSTN_A so that themodel STN_B is built.As the size of the problem increases, the solution speed of CPLEX becomesthe bottleneck. So a heuristic method containing three groups of heuristic rules is designed to obtain a near-optimalsolution quickly. Experimental results showthat the computation time of STN_A is shortened by 49.47% on averageand the gap is reduced by 1.69% on average compared with the original model. The gap between the solution ofthe heuristic rules and the solution of CPLEX is less than 3.50%, and the solution time of the heuristic rules is onaverage 99.85% less than the solution time of CPLEX. Compared with STN_A, the computation time for solvingSTN_B increases by 58.93% on average.

Comparing 11 early warning scores and three shock indices in early sepsis prediction in the emergency department

BACKGROUND:This study aimed to evaluate the discriminatory performance of 11 vital sign-based early warning scores(EWSs)and three shock indices in early sepsis prediction in the emergency department(ED).METHODS:We performed a retrospective study on consecutive adult patients with an infection over 3 months in a public ED in Hong Kong.The primary outcome was sepsis(Sepsis-3 definition)within 48 h of ED presentation.Using c-statistics and the DeLong test,we compared 11 EWSs,including the National Early Warning Score 2(NEWS2),Modified Early Warning Score,and Worthing Physiological Scoring System(WPS),etc.,and three shock indices(the shock index[SI],modified shock index[MSI],and diastolic shock index[DSI]),with Systemic Inflammatory Response Syndrome(SIRS)and quick Sequential Organ Failure Assessment(qSOFA)in predicting the primary outcome,intensive care unit admission,and mortality at different time points.RESULTS:We analyzed 601 patients,of whom 166(27.6%)developed sepsis.NEWS2 had the highest point estimate(area under the receiver operating characteristic curve[AUROC]0.75,95%CI 0.70-0.79)and was significantly better than SIRS,qSOFA,other EWSs and shock indices,except WPS,at predicting the primary outcome.However,the pooled sensitivity and specificity of NEWS2≥5 for the prediction of sepsis were 0.45(95%CI 0.37-0.52)and 0.88(95%CI 0.85-0.91),respectively.The discriminatory performance of all EWSs and shock indices declined when used to predict mortality at a more remote time point.CONCLUSION:NEWS2 compared favorably with other EWSs and shock indices in early sepsis prediction but its low sensitivity at the usual cut-off point requires further modification for sepsis screening.

Learning Vector Quantization-Based Fuzzy Rules Oversampling Method

Imbalanced datasets are common in practical applications,and oversampling methods using fuzzy rules have been shown to enhance the classification performance of imbalanced data by taking into account the relationship between data attributes.However,the creation of fuzzy rules typically depends on expert knowledge,which may not fully leverage the label information in training data and may be subjective.To address this issue,a novel fuzzy rule oversampling approach is developed based on the learning vector quantization(LVQ)algorithm.In this method,the label information of the training data is utilized to determine the antecedent part of If-Then fuzzy rules by dynamically dividing attribute intervals using LVQ.Subsequently,fuzzy rules are generated and adjusted to calculate rule weights.The number of new samples to be synthesized for each rule is then computed,and samples from the minority class are synthesized based on the newly generated fuzzy rules.This results in the establishment of a fuzzy rule oversampling method based on LVQ.To evaluate the effectiveness of this method,comparative experiments are conducted on 12 publicly available imbalance datasets with five other sampling techniques in combination with the support function machine.The experimental results demonstrate that the proposed method can significantly enhance the classification algorithm across seven performance indicators,including a boost of 2.15%to 12.34%in Accuracy,6.11%to 27.06%in G-mean,and 4.69%to 18.78%in AUC.These show that the proposed method is capable of more efficiently improving the classification performance of imbalanced data.

Density Clustering Algorithm Based on KD-Tree and Voting Rules

Traditional clustering algorithms often struggle to produce satisfactory results when dealing with datasets withuneven density. Additionally, they incur substantial computational costs when applied to high-dimensional datadue to calculating similarity matrices. To alleviate these issues, we employ the KD-Tree to partition the dataset andcompute the K-nearest neighbors (KNN) density for each point, thereby avoiding the computation of similaritymatrices. Moreover, we apply the rules of voting elections, treating each data point as a voter and casting a votefor the point with the highest density among its KNN. By utilizing the vote counts of each point, we develop thestrategy for classifying noise points and potential cluster centers, allowing the algorithm to identify clusters withuneven density and complex shapes. Additionally, we define the concept of “adhesive points” between two clustersto merge adjacent clusters that have similar densities. This process helps us identify the optimal number of clustersautomatically. Experimental results indicate that our algorithm not only improves the efficiency of clustering butalso increases its accuracy.

Automatic Rule Discovery for Data Transformation Using Fusion of Diversified Feature Formats

This article presents an innovative approach to automatic rule discovery for data transformation tasks leveraging XGBoost,a machine learning algorithm renowned for its efficiency and performance.The framework proposed herein utilizes the fusion of diversified feature formats,specifically,metadata,textual,and pattern features.The goal is to enhance the system’s ability to discern and generalize transformation rules fromsource to destination formats in varied contexts.Firstly,the article delves into the methodology for extracting these distinct features from raw data and the pre-processing steps undertaken to prepare the data for the model.Subsequent sections expound on the mechanism of feature optimization using Recursive Feature Elimination(RFE)with linear regression,aiming to retain the most contributive features and eliminate redundant or less significant ones.The core of the research revolves around the deployment of the XGBoostmodel for training,using the prepared and optimized feature sets.The article presents a detailed overview of the mathematical model and algorithmic steps behind this procedure.Finally,the process of rule discovery(prediction phase)by the trained XGBoost model is explained,underscoring its role in real-time,automated data transformations.By employingmachine learning and particularly,the XGBoost model in the context of Business Rule Engine(BRE)data transformation,the article underscores a paradigm shift towardsmore scalable,efficient,and less human-dependent data transformation systems.This research opens doors for further exploration into automated rule discovery systems and their applications in various sectors.

Rule acquisition of three-way semi-concept lattices in formal decision context

Three-way concept analysis is an important tool for information processing,and rule acquisition is one of the research hotspots of three-way concept analysis.However,compared with three-way concept lattices,three-way semi-concept lattices have three-way operators with weaker constraints,which can generate more concepts.In this article,the problem of rule acquisition for three-way semi-concept lattices is discussed in general.The authors construct the finer relation of three-way semi-concept lattices,and propose a method of rule acquisition for three-way semi-concept lattices.The authors also discuss the set of decision rules and the relationships of decision rules among object-induced three-way semi-concept lattices,object-induced three-way concept lattices,classical concept lattices and semi-concept lattices.Finally,examples are provided to illustrate the validity of our conclusions.

Multi-modal knowledge graph inference via media convergence and logic rule

Media convergence works by processing information from different modalities and applying them to different domains.It is difficult for the conventional knowledge graph to utilise multi-media features because the introduction of a large amount of information from other modalities reduces the effectiveness of representation learning and makes knowledge graph inference less effective.To address the issue,an inference method based on Media Convergence and Rule-guided Joint Inference model(MCRJI)has been pro-posed.The authors not only converge multi-media features of entities but also introduce logic rules to improve the accuracy and interpretability of link prediction.First,a multi-headed self-attention approach is used to obtain the attention of different media features of entities during semantic synthesis.Second,logic rules of different lengths are mined from knowledge graph to learn new entity representations.Finally,knowledge graph inference is performed based on representing entities that converge multi-media features.Numerous experimental results show that MCRJI outperforms other advanced baselines in using multi-media features and knowledge graph inference,demonstrating that MCRJI provides an excellent approach for knowledge graph inference with converged multi-media features.

Optimized air-ground data fusion method for mine slope modeling

Refined 3D modeling of mine slopes is pivotal for precise prediction of geological hazards.Aiming at the inadequacy of existing single modeling methods in comprehensively representing the overall and localized characteristics of mining slopes,this study introduces a new method that fuses model data from Unmanned aerial vehicles(UAV)tilt photogrammetry and 3D laser scanning through a data alignment algorithm based on control points.First,the mini batch K-Medoids algorithm is utilized to cluster the point cloud data from ground 3D laser scanning.Then,the elbow rule is applied to determine the optimal cluster number(K0),and the feature points are extracted.Next,the nearest neighbor point algorithm is employed to match the feature points obtained from UAV tilt photogrammetry,and the internal point coordinates are adjusted through the distanceweighted average to construct a 3D model.Finally,by integrating an engineering case study,the K0 value is determined to be 8,with a matching accuracy between the two model datasets ranging from 0.0669 to 1.0373 mm.Therefore,compared with the modeling method utilizing K-medoids clustering algorithm,the new modeling method significantly enhances the computational efficiency,the accuracy of selecting the optimal number of feature points in 3D laser scanning,and the precision of the 3D model derived from UAV tilt photogrammetry.This method provides a research foundation for constructing mine slope model.