Publish in OALib Journal

ISSN: 2333-9721

APC: Only $99


Any time

2019 ( 137 )

2018 ( 1110 )

2017 ( 1110 )

2016 ( 1326 )

Custom range...

Search Results: 1 - 10 of 460428 matches for " H.S. Lu "
All listed articles are free for downloading (OA Articles)
Page 1 /460428
Display every page Item
Design and implementation of cutting tools search system
J.Y. Chen,H.S. Lu,B.Y. Lee,C.H. Chen
Journal of Achievements in Materials and Manufacturing Engineering , 2008,
Abstract: Purpose: The main purpose of this paper is to analyse the grinding processes and develop a search system of database for cutting tools.Design/methodology/approach: A tool grinding software with open architecture was used to analyse the grinding processes of square end mills, tapered square end mills, ball nose end mills, tapered ball nose end mills, radius end mills, tapered radius end mills, straight flute reamers, helical flute reamers, flat drills, twist drills, and step drills. According to the characteristics of these tools, 20270 data were established in the relational database. The SQL syntax was then utilized for writing the search algorithm, and the C++ Builder was employed for designing human machine interfaces of the search system of the tool database.Findings: A half of time on the tool design and the change of production line for grinding other types of tools can be saved by means of the proposed system. More specifically, the efficiency in terms of the overall machining time was improved up to 10.58%, 9.36%, 4.64%, and 7.52% for grinding the radius end mill, tapered radius end mill, twist drill, and step drill, respectively.Research limitations/implications: Special tools have diversification. They can not be taken into consideration in the database system owing to the tools have specific profiles. Therefore, it is difficult to encode by formal rules.Practical implications: The most commercial tool grinding software is the modular-based design and uses tool shapes to construct the CAM interface. However, it is very difficult for users to design new cutting tools. Utilizing the grinding processes to construct the grinding path of tools, and the search system of the database provides more flexible options to develop new cutting tools.Originality/value: The database and search system of cutting tools were presented in this paper. We can save time for production line change, tool design, and tool grinding by employing this kind of system. It also gives more convenience. That is, company’s productivity and benefit can be improved.
On the Use of Orthogonality Relations to Construct Character Tables of Finite Group
H.S. Ndakwo
Research Journal of Applied Sciences , 2012,
Abstract: Group characters are very fundamental in the study of group representation. In this paper we employed the orthogonality relation in constructing the character table which shows the difference irreducible characters for each conjugacy class. The first kind is used along the rows, while the second kind is used along the columns. Relevant details of this method are described following.
The Representation of Real Characters of Finite Groups
H.S. Ndakwo
Research Journal of Applied Sciences , 2012,
Abstract: Let A(x) be the representation of an element x in a group G. The representation A(x) may be real or complex. The aim of this study is to distinguish when the character of A(x) is real and when it is not. This distinction is linked with the notion of bilinear invariants and to find out the situation in which if A(x) is complex for some x whether it is equivalent as a representation to Q(x) such that Q(x) has a real coefficients for all xG. This notion is equivalent to finding an invertible matrix T such that Q(x) = TA(x) T and Q(x) is real. It was also proved in this study that for any complex irreducible orthogonal representation of a finite group G, the representation Q(x) for every xG is equivalent to a real orthogonal representation.
Optimization of Plant-Bacteria Complex for Phytoremediation of Contaminated Soils
H.S. Hussein
International Journal of Botany , 2008,
Abstract: The aim of the present study is to optimize the plant-microbe combinations to clean up multi-metal contaminated soils. Three different Bacillus bacteria strains were introduced into the rhizosphre of the Indian mustard plant growing in soil contaminated with mixture of selenium (Se), cadmium (Cd) and chromium (Cr). The experimental design, Plackett-Burman has been used to optimize a novel crosslinked trace metals-rhizosphere bacteria complex as a potential system for phytoremediation of contaminated soils. Three bacterial strains were isolated from highly contaminated sediments with different trace and heavy metals and introduced into the rhizosphere of Indian mustard (Brassica juncea L.) in soil contaminated with mixture of selenium (Se), cadmium (Cd) and chromium (Cr) to study the plant-microbe interactions on metal removal. The results showed that inoculating high-density of B. licheniformis in the rhizosphere of Indian mustard was enhanced Cd accumulation in plant tissues. High densities of all examined bacteria were assisting on removal of Cr from the soil whereas; Se accumulation was achieved in association with low bacterial densities in the rhizosphere. This study shows that the rhizosphere bacteria are metal-specific, in addition the bacteria isolated from certain contaminated sites may be used in conjunction with other plant species to improve their phytoremediation potential.
Tuning Semiconductor Laser Diode Lasing Frequency and Narrowing the Laser Linewidth Using External Oscillating Driving Field
H.S. Ashour
Journal of Applied Sciences , 2006,
Abstract: In this study, we propose a new method to tune the semiconductor laser lasing frequency and reducing the laser linewidth using an external deriving field. We redeveloped Floquet S-matrix which determines the transmission probabilities and the shape and position of the induced quasibound state, which accumulated incident electrons. We explored the S-matrix numerically for various system parameters. We found that the oscillating field amplitude V1 plays a curial rule in defining the profile of electrons accumulations in the quasibound state and the field`s strength made sift the position of the quasibound state. This sift in the bound state energy due field`s strength is used to tune the lasing frequency and the output of the semiconductor laser linewidth is improved by changing the field`s amplitude the deriving field. By narrowing down the electron accumulations profile the laser linewidth would be narrower.
Segmentation and Classification using Heuristic HRSPSO
H.S. Behera
International Journal of Soft Computing & Engineering , 2011,
Abstract: In this paper, a Heuristic Hybrid Rough Set Particle Swarm optimization (HRSPSO) Algorithm is proposed for partitioning a digital image into different segments that is more meaningful and easier to analyze segmentation and Classification. The heuristic HRSPSO algorithm has been implemented with a novel method in MATLAB platform considering 50 iterations and 20 particles. The experimental study and performance evaluation show that Heuristic HRSPSO optimization Algorithm is observed to be having optimal solution with smallest DB (Davies-Bouldin) index and it converges after fifteenth iterations.
Experimental Analysis of New Fair-Share Scheduling Algorithm with Weighted Time Slice For Real Time Systems
H.S. Behera
Journal of Global Research in Computer Science , 2011,
Abstract: The performance and efficiency of multitasking operating systems mainly depend upon the used CPU scheduling algorithm. In Time Shared System, Round Robin(RR) scheduling gives optimal solution. But it is not suitable for real time system because it gives more number of context switches, larger waiting and turnaround time. In this paper a new Fair-Share scheduling with weighted time slice is proposed and analyzed which calculates time quantum in each round. Our proposed algorithm is based on a novel approach which makes the time quantum repeatedly adjustable according to the burst time of the currently running processes. This algorithm assigns a weight to each process and the process having the least burst time is assigned the largest weight. The process having largest weight is executed first, then the next largest weight and so on. Experimental analysis shows that our proposed algorithm gives better result, reduces the average waiting time, average turnaround time and number of context switches
A New Proposed Two Processor Based CPU Scheduling Algorithm with Varying Time quantum for Real Time Systems
H.S. Behera
Journal of Global Research in Computer Science , 2011,
Abstract: The performance and efficiency of multitasking operating systems mainly depends upon the use of CPU scheduling algorithm. In time shared system, Round Robin (RR) scheduling gives optimal solution but it may not be suitable for real time systems because it gives more number of context switches and larger waiting time and larger turnaround time. In this paper two processor based CPU scheduling (TPBCS) algorithm is proposed, Where one processor is exclusively for CPU-intensive processes and the other processor is exclusively for I/O-intensive processes. This approach dispatches the processes to appropriate processor according to their percentage of CPU or I/O requirement. After the processes are dispatched to respective processors, the time quantum is calculated and the processes are executed in increasing order of their burst time. Experimental analysis shows that our proposed algorithm performs better result by reducing the average waiting time, average turnaround time.
Weighted Mean Priority Based Scheduling for Interactive Systems
H.S. Behera
Journal of Global Research in Computer Science , 2011,
Abstract: Scheduling in Operating System means determining which tasks are supposed to run when there are multiple tasks to be run. Consequently, the efficiency and performance of a system mainly depends on CPU scheduling algorithm where CPU is considered as one of the primary computer resource. Traditionally, Priority Scheduling Algorithm is used for processes in which priority is the determining factor. This paper proposes a newly improved process scheduling algorithm by using dynamic time quantum along with weighted mean. Experimental analysis demonstrates that this proposed algorithm gives better response time making the algorithm useful for interactive systems.
Fungicidal management of web blight of urdbean
Indian Phytopathology , 2012,
Page 1 /460428
Display every page Item

Copyright © 2008-2017 Open Access Library. All rights reserved.