Search Results - data distribution ((computer algorithm) OR (((window algorithm) OR (means algorithm))))

Parallel algorithms for numerical simulations of EHD ion-drag micropump on distributed parallel computing systems by Shakeel Ahmed, Kamboh

“…To implement the parallel algorithms a distributed parallel computing laboratory using easily available low cost computers is setup. …”
Get full text
Get full text

Investigation of evolutionary multi-objective algorithms in solving view selection problem / Seyed Hamid Talebian by Talebian, Seyed Hamid

“…The data distributed in these systems sometimes come in inconsistent formats. …”
Get full text
Get full text

A dynamic replication aware load balanced scheduling for data grids in distributed environments of internet of things by Bakhshad, Said, Noor, Rafidah Md, Akhundzada, Adnan, Saba, Tanzila, Ahmedy, Ismail, Haroon, Faisal, Nazir, Babar

“…Grid computing is a powerful distributed and scalable computing infrastructure that deals with massive data-intensive applications. …”
Get full text
Get full text

Parallel power load abnormalities detection using fast density peak clustering with a hybrid canopy-K-means algorithm by Al-Jumaili A.H.A., Muniyandi R.C., Hasan M.K., Singh M.J., Paw J.K.S., Al-Jumaily A.

“…Parallel power loads anomalies are processed by a fast-density peak clustering technique that capitalizes on the hybrid strengths of Canopy and K-means algorithms all within Apache Mahout's distributed machine-learning environment. …”

Efficient genetic partitioning-around-medoid algorithm for clustering by Garib, Sarmad Makki Mohammed

“…One of the main issues in genetic k-means based algorithms is their sensitivity to outliers and unevenly distributed clusters due to the mean compromised computations. …”
Get full text
Get full text

Web based applications for energy management system incorporated network reconfiguration using genetic algorithm / Wan Adnan Wan by Wan Chik, Wan Adnan

“…The development on Web Application system uses An ActiveX technology approach. The Genetic Algorithm Based Network Reconfiguration Technique for loss minimization in the UiTM Distribution System is also proposed based on general combinatorial optimization algorithm. …”
Get full text
Get full text

Analysis and decentralised optimal flow control of heterogeneous computer communication network models by Ku-Mahamud, Ku Ruhana

“…A new method of general model reduction using the Norton' s theorem for general queueing networks in conjunction with the universal maximum entropy algorithm is proposed for the analysis of xix large general closed queueing networks. …”
Get full text
Get full text
Get full text

An improvement on the valiantbrebner hypercube data broadcasting technique / Nasaruddin Zenon by Zenon, Nasaruddin

“…The intended meaning of broadcasting there is the mannereach datum is distributed among the processors in a computer system. …”
Get full text
Get full text

Dynamic replication aware load blanced scheduling in distributed environment / Said Bakhshad by Said Bakhshad, Bakhshad

“…Grid computing is an effective distributed and adaptable processing network that manages a huge number of data applications. …”
Get full text
Get full text
Get full text

Final exam question paper data encryption and decryption using advance encryption standard / Khairul Nashran Nazari by Nazari, Khairul Nashran

“…AES is a data encryption technique that exist in the world with as currently the most secured algorithms. …”
Get full text
Get full text

Estimation Of Weibull Parameters Using Simulated Annealing As Applied In Financial Data by Hamza, Abubakar

“…The finding reveals that the Weibull distribution is well-suited to describing the investment behaviour of the MPS based on the estimates via the SA algorithm. …”
Get full text
Get full text

A power saver scheduling algorithm using DVFS and DNS techniques in cloud computing data centres by Atiewi S., Yussof S., Rusli M.E.B., Zalloum M.

Replica Creation Algorithm for Data Grids by Madi, Mohammed Kamel

“…This thesis presents a new replication algorithm that improves data access performance in data grids by distributing relevant data copies around the grid. …”
Get full text
Get full text
Get full text
Get full text

Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

“…The performances of the proposed algorithms are then compared with the previously developed algorithms. …”
Get full text
Get full text
Get full text

An experience oriented-convergence improved gravitational search algorithm for minimum variance distortionless response beamforming optimum by Darzi S., Tiong S.K., Tariqul Islam M., Rezai Soleymanpour H., Kibria S.

Fuzzy Soft Set Clustering for Categorical Data by Iwan Tri Riyadi, Yanto, Ani, Apriani, Rofiul, Wahyudi, Cheah, Wai Shiang, Suprihatin, in, Rahmat, Hidayat

“…Conventional clustering, such as k-means, cannot be openly used to categorical data. …”
Get full text
Get full text
Get full text
Get full text

Coordinate-Descent Adaptation over Hamiltonian Multi-Agent Networks by Azam Khalili, Vahid Vahidpour, Amir Rastegarnia, Ali Farzamnia, Teo, Kenneth Tze Kin, Saeid Sanei

“…The incremental least-mean-square (ILMS) algorithm is a useful method to perform distributed adaptation and learning in Hamiltonian networks. …”
Get full text
Get full text
Get full text
Get full text
Get full text

Dynamic Robust Bootstrap Algorithm for Linear Model Selection Using Least Trimmed Squares by Uraibi, Hassan Sami

“…One of the important assumptions of the linear model is that the error terms are normally distributed. Unfortunately, many researchers are not aware that the performance of the OLS can be very poor when the data set that one often makes a normal assumption, has a heavy-tailed distribution which may arise as a result of the presence of outliers. …”
Get full text
Get full text

Autonomous anomaly detection using density-based features in streaming data / Muhammmad Yunus Iqbal Basheer by Iqbal Basheer, Muhammmad Yunus

“…Consequently, to handle these data, computer algorithms must adapt to their characteristics. …”
Get full text
Get full text

Survey on job scheduling mechanisms in grid environment by S. M., Argungu, Che Mohamed Arif, Ahmad Suki, Omar, Mohd Hasbullah

“…Grid systems provide geographically distributed resources for both computational intensive and data-intensive applications.These applications generate large data sets.However, the high latency imposed by the underlying technologies; upon which the grid system is built (such as the Internet and WWW), induced impediment in the effective access to such huge and widely distributed data.To minimize this impediment, jobs need to be scheduled across grid environments to achieve efficient data access.Scheduling multiple data requests submitted by grid users onto the grid environment is NP-hard.Thus, there is no best scheduling algorithm that cuts across all grids computing environments.Job scheduling is one of the key research area in grid computing.In the recent past many researchers have proposed different mechanisms to help scheduling of user jobs in grid systems.Some characteristic features of the grid components; such as machines types and nature of jobs at hand means that a choice needs to be made for an appropriate scheduling algorithm to march a given grid environment.The aim of scheduling is to achieve maximum possible system throughput and to match the application needs with the available computing resources.This paper is motivated by the need to explore the various job scheduling techniques alongside their area of implementation.The paper will systematically analyze the strengths and weaknesses of some selected approaches in the area of grid jobs scheduling.This helps researchers better understand the concept of scheduling, and can contribute in developing more efficient and practical scheduling algorithms.This will also benefit interested researchers to carry out further work in this dynamic research area.…”
Get full text
Get full text
Get full text