Titanium alloys are the difficult to cut metals due their low thermal conductivity and chemical affinity with tool material. Since vibration is a replica of wear surface roughness, present study has proposed methodology for estimating roughness based on milling Ti-6Al-4V alloy using cemented carbide mill cutter. Experiments conducted at optimum levels cutting speed, feed per tooth, depth cut, e...

OBJECTIVES The theoretical threshold (effort-reward ratio >1.0) may not be ideal for the Japanese short version of the effort-reward imbalance (ERI) questionnaire. We aimed to seek the optimum cut-off point. METHODS We administered the original and short versions of the ERI questionnaire with a psychological distress scale to randomly selected workers (n=1,489) in a web-based survey. We evalu...

max (k, n − k)-cut (resp., min (k, n − k)-cut) is a constrained version of max-cut (resp., min-cut) where one has to find a bipartition of the vertex set into two subsets with respectively k and n − k vertices (n being the total number of vertices of the input graph) which maximizes (resp., minimizes) the number of edges going from one subset to the other. In this paper, we investigate the para...

Field-Programmable Gate Arrays (FPGAs) are flexible and reusable circuits that can be easily reconfigured by the designer. One of the steps involved in the logic design with FPGA circuits is placement. In this step, the logic functions are assigned to specific cells of the circuit. In this paper we present a placement algorithm for FPGA circuits. In traditional min-cut based placement algorithm...

Inconel 718 (IN718) is a precipitation hardened nickel-base super-alloy exhibiting high strength and good corrosion resistance at elevated temperatures on the downside; it characterized by poor machinability. Abrasive water jet (AWJ) process offers potential method to machining difficult-to-cut materials such as IN718. The present work investigates influence of AWJ parameters surface roughness,...

The well-known Max Cut problem asks for the largest bipartite subgraph of a graph G. This problem has been the subject of extensive research, both from the algorithmic perspective in computer science and the extremal perspective in combinatorics. Let n be the number of vertices and e be the number edges of G and let b(G) denote the size of the largest bipartite subgraph of G. The extremal part ...

We analyze the addition of a simple local improvement step to various known ran-domized approximation algorithms. Let ' 0:87856 denote the best approximation ratio currently known for the Max Cut problem on general graphs GW95]. We consider a semideenite relaxation of the Max Cut problem, round it using the random hyperplane rounding technique of ((GW95]), and then add a local improvement step....

This paper studies the existence of eecient (small size) ampliiers for proving explicit inaproximability results for bounded degree and bounded occurrence combinatorial optimization problems, and gives an explicit construction for such ampliiers. We use this construction to improve the currently best known approximation lower bounds for bounded occurrence instances of linear equations mod 2, an...

Metric MAX-CUT is the problem of dividing a set of points in metric space into two parts so as to maximize the sum of the distances between points belonging to distinct parts. We show that metric MAX-CUT has a polynomial time randomized approximation scheme.

Medication errors are among the most common medical errors in the hospitals. Transcription error is a specific type of medication errors and is due to data entry error that is commonly made by the human operators. This study was designed to detect transcription errors in a teaching hospital in Tehran. Direct observational method was used in this study. Error was defined as any deviation in tran...