Results 41 to 50 of about 55,326 (148)
Theoretical and Experimental Verification of Dynamic Behaviour of a Guided Spline Arbor Circular Saw
An analysis of the dynamic and stability characteristics of a guided wood cutting spline arbor circular saw is presented. A multibody dynamic model is developed to consider the idling and cutting characteristics.
Ahmad Mohammadpanah, Stanley G. Hutton
doaj +1 more source
Research into the geometry of the delimbing head of cutting knives
Limbing with a wedge tool as a chipless operation is accompanied by a large deformation of wood in the cutting plane, i.e. at the spot of contact with the tool face as well as in the zone adjacent to this plane.
J. Mikleš
doaj +1 more source
Bessel Beam Dielectrics Cutting with Femtosecond Laser in GHz-Burst Mode
We report, for the first time to the best of our knowledge, Bessel beam dielectrics cutting with a femtosecond laser in GHz-burst mode. The non-diffractive beam shaping is based on the use of an axicon and allows for cutting glasses up to 1 mm thickness ...
Pierre Balage +6 more
doaj +1 more source
The Number of Plane Corner Cuts
An \(n\)-element subset \(\lambda\) of \(\mathbb{N}^2\) which is cut off a line is called a (plane) corner cut of size \(n\). Let be \({\mathbb{N}^2\choose n}_{ \text{cut}}\) the set of corner cuts of size \(n\). [See \textit{S. Onn} and \textit{B. Sturmfels}, ibid., 29-48 (1999; above).] The authors give a generating for the number \(\#{\mathbb{N}^2 ...
Corteel, Sylvie +3 more
openaire +1 more source
Cutting Planes for Signomial Programming
Cutting planes are of crucial importance when solving nonconvex nonlinear programs to global optimality, for example using the spatial branch-and-bound algorithms. In this paper, we discuss the generation of cutting planes for signomial programming. Many global optimization algorithms lift signomial programs into an extended formulation such that these
Liding Xu +3 more
openaire +3 more sources
A Cutting Method with Updating Approximating Sets and its Combination with Other Algorithms
For solving constrained minimization problem propose a cutting plane method which belongs to a class of cutting methods.The designed method uses an approximation of the epigraph of the objective function.
I.Ya. Zabotin, R.S. Yarullin
doaj
Cutting Plane and Frege Proofs
The cutting plane refutation system CP for classical propositional calculus [see \textit{W. Cook}, \textit{C. R. Coullard} and \textit{Gy. Turan}, Discrete Appl. Math. 18, 25-38 (1987; Zbl 0625.90056)], initially coming from works in operation research, can be considered as an extension of resolution based on showing the non-existence of solutions for ...
openaire +2 more sources
Multiple Cuts in the Analytic Center Cutting Plane Method
Summary: We analyze the multiple cut generation scheme in the analytic center cutting plane method. We propose an optimal primal and dual updating direction when the cuts are central. The direction is optimal in the sense that it maximizes the product of the new dual slacks and of the new primal variables within the trust regions defined by Dikin's ...
Goffin, Jean-Louis, Vial, Jean-Philippe
openaire +2 more sources
Force modeling in metal cutting is important for various purposes, including thermal analysis, tool life estimation, chatter prediction, and tool condition monitoring.
Bashistakumar M., Pushkal B.
doaj +1 more source
The Analytic Center Cutting Plane Method with Semidefinite Cuts
Summary: We analyze an analytic center cutting plane algorithm for convex feasibility problems with semidefinite cuts. The problem of interest seeks a feasible point in a bounded convex set, which contains a full-dimensional ball with radius \(\varepsilon
Oskoorouchi, Mohammad R. +1 more
openaire +3 more sources

