Search

In dense indoor areas, high numbers of people use their smartphones and tablets to share or download pictures, videos, or data. The heterogeneous network (HetNet) solves the problems caused by the explosion of data generated by smartphones and tablets. Heterogeneous networks use a mix of Relay, Femtocell, Pico, and Macro base stations to improve spectral efficiency per unit area. Operators wish to know how to upgrade existing networks and how to design new ones. This subject has become hot in the industry. In this paper, we presented the architecture of heterogeneous networks. The parameters affecting the heterogeneous networks topology plan are discussed. Moreover, a comparison of existing solutions that consider the problems of base station layout planning is presented. Finally, a road map is given to point out to the main future directions of researches on the topological design of dense area heterogeneous mobile networks.

The reliability of the recommender system is highly essential for the continuity of any system. Fake and malicious users may be spoiling system predictions reliability by inserting and injecting fake profiles called “shilling attacks” into the target recommender system. Thus, the detection of these attacks is necessary for any recommender system. Therefore, several shilling attacks detection approaches have proposed. In this work, we propose a survey for the recent detection methods, which pick up famous shilling attack models against the collaborative filtering recommender systems.

Satellites is the bird’s-eyes that enable us to view massive areas of earth at the same time, satellites can gather more data, more quickly, than tools on the ground. Satellites also can view into space better than telescopes at earth’s surface. Development of such artificial satellites which composed of many subsystem, requires a lot of time and money that any deadly failure is unacceptable, the satellite operating in a remote environment, so it is practically very hard or impossible to repair it once a severe failure occurs, so detecting the anomalies of the subsystems measurement values (Telemetry data) is the first step in satellite failure protection and early warning. Traditional spectral-based methods like PCA is traditional for detecting anomalies in a variety of domains and problems. However, if the collected data contains tensor (multiway) structure, for example space-time-measurements values, such as the satellites subsystems measurement, some significant anomalies may stay hidden with these traditional methods. Tensor-based anomaly detection (TAD) applied in a variety set of disciplines over the recent years, although it is not recognized yet as an official category of anomaly detection techniques. This work target to highlight the candidate of tensor-based technique as a new approach for identification and detection of abnormalities and dud in the satellite telemetry data.

driver is in the state of drowsiness he can cause accidents. This state is the state between being awake and asleep. In this state driver reaction time is slower, his attentiveness is reduced, and his information processing is less efficient. Driver Fatigue Detection System (called FDS) has been proposed by the authors in a recent work. The FDS aims to monitor the driver and the alertness to prevent them from falling asleep at the wheel. FDS is very hard to fix in a car. In the present paper, the FDS software is modified and new system WakeApp is developed to be run in smartphone instead of Laptop and use all advantages of smartphone like camera and late weight. The WakeApp will solve this problem by using a mobile phone camera; the phone will be put on a stand in the car to make the driver feels comfortable. The WakeApp has hardware and software components such as mobile camera and Android SDK. Both components are integrated together to record real video for the driver, and then processing it for real-time eye tracking. WakeApp has reserve all advantages in FDS like fast and real-time face and eye tracking, external illumination interference is limited, more robustness and accuracy allowance for fast head/face movement. The Main goals of WakeApp are to ensure that the driver is staying awake during his drive, make the driver feels comfortable and to help decrease the number of accidents.

Transition state between being awake and asleep is called drowsiness. When driver is in this state he can cause accidents because his reaction time is slower, his attentiveness is reduced, and his information processing is less efficient. Driver Fatigue Detection System (called FDS) has been proposed by the authors in a recent work. The FDS aims to monitor the driver and the alertness to prevent them from falling asleep at the wheel. In the present paper, the FDS software is modified to be run in smartphone instead of Laptop which is very hard to fixed in a car and use all advantages of smartphone like camera and late weight. The proposed system will solve this problem by using a mobile phone camera; the phone will be put on a stand in the car to make the driver feels comfortable. The proposed system has hardware and software components such as mobile camera and Android SDK. Both components are integrated together to record real video for the driver, and then processing it for real-time eye tracking. This system has reserve all advantages in FDS like fast and real-time face and eye tracking, external illumination interference is limited, more robustness and accuracy allowance for fast head/face movement. The Main goals of this system are to ensure that the driver is staying awake during his drive, make the driver feels comfortable and to help decrease the number of accidents.

Engineering students need to have a high Mental Rotation Skill (MRS) to improve their Spatial Visualization Skills (SVS). MRS classified as a type of SVS. Having a high MRS, enhanced students to understand the engineering graphics course and pass it without difficulties. Instructors in engineering educations indicated that first-year students faced difficulties when visualizing models in engineering graphic course. Traditional tools such as textbooks and modeling techniques are not enough for enhancing the SVS of engineering students. This paper presents Virtual Mental Rotation Training (VMRT) system using semi-immersive virtual reality technology based on Purdue Spatial Visualization Skills: Rotation (PSVT:R), and on both analytical and combined mental rotation strategy to improve MRS for females’ engineering students. VMRT is an adapting system according to the student’s level of MRS. Moreover, we report the results of the experimental study using VMRT system and PSVT:R with axes and without axes. The results of pre-test and post-test results of the experimental study using (PSVT:R), indicate that the students have a probability of over 99% of improving their mental rotation skills. Also, results show 63% of improvement in the difference percentage between pre-test and post-test for engineering students who were training using VMRT. Moreover, the results indicate the students prefer to use analytical mental rotation strategy to improve their mental rotation skill.

Spatial visualization skills are crucial in engineering fields and are required to support the spatial abilities of engineering students. Instructors in engineering colleges indicated that freshmen students faced difficulties when visualizing models in engineering graphics. Students cannot correctly understand and process visual object and mental images of the engineering models. Traditional tools using textbooks, physical models, and modeling techniques is not sufficient for improving the spatial visualization skills of engineering students. This paper is a survey of all techniques used to learn freshmen students in engineering graphics and improve their spatial visualization skills. Also, it presents the method of evaluation the spatial visualization skills. After describing techniques and presented the literature review, this work presents a comparison between methodologies and techniques used in previous studies. Finally, we summarize a road of the map for the techniques and strategies to improve the spatial visualization skills for freshmen engineering students.

This paper deals with social infrastructure planning problems to determine the location of the facilities of social infrastructure network and the layout. Each user must be assigned to the closest facility to be economically viable. The objective is how to make the accessibility to facilities maximum (i.e., to minimize the distance which the users traveled to reach the facilities). In this paper, we study the problem of clustering in the presence of obstacles to locate the public service facility. In this article we present a new algorithm in data mining in the presence of obstacles. Minimum pre-specified level of demand must served by each facility. The objective is to maximize the accessibility of the facilities this means also to minimize the distance travelled by users to reach the facilities. CSPOD-DBSC algorithm (Clustering with short path Obstructed Distance DensityBased Spatial Clustering) is developed. Obstructed short path distance calculated in this algorithm by using Density-based clustering algorithm and Dijkstra algorithm. A case study involving the location of schools in districts of Mecca in Saudi Arabia is used to illustrate the application of this

Drowsiness is a transition state between being awake and asleep and can have serious consequences when occurring in tasks that require sustained attention such as driving. During the state of drowsiness, reaction time is slower, vigilance is reduced, and information processing is less efficient, which may cause accidents. The proposed Driver Fatigue Detection System (called FDS) aims to monitor the alertness of drivers to prevent them from falling asleep at the wheel. The system monitors the driver's face using Haar feature classifiers with an increased training set to detect changes in the face of the driver quickly. A correlation matching algorithm is used to accurately provide the target's position and track the target's eyes according to the intensity, shape, and size of the pupils. FDS uses an IR illuminator to produce the desired bright pupil effect when the driver is wearing sunglasses. The resulting system operates in real-time, and is more accurate and less intrusive to the driver than other systems currently available.

The last few years have witnessed the widespread use of mobile technology. Billions of citizens around the world own smartphones, which they use for both personal and business applications. Thus, technologies will minimize the risk of losing people's lives. Mobile platform is one of the most popular plat-form technologies utilized on a wide scale and accessible to a high number of people. There has been a huge increase in natural and manmade disasters in the last few years. Such disasters can hap-pen anytime and anywhere causing major damage to people and property. The environment affluence and the failure of people to go to other safe places are the results of catastrophic events re-cently in Jeddah city. Flood causes the sinking and destruction of homes and private properties. Thus, this paper describes a sys-tem that can help in determining the affected properties, evacuat-ing them, and providing a proper guidance to the registered users in the system. This system notifies mobile phone users by sending guidance messages and sound alerts, in a real-time when disasters (fires, floods) hit. Warnings and tips are received on the mobile user to teach him/her how to react before, during, and after the disaster. Provide a mobile application using GPS to determine the user location and guide the user for the best way with the aid of rule-based system that built through the interview with the Experts domains. Moreover, the user will re-ceive Google map updates for any added information. This sys-tem consists of two subsystems: the first helps students in our university to evacuate during a catastrophe and the second aids all people in the city. Due to all these features, the system can access the required information at the needed time.

Mobiles have become very essential part of our everyday life begin of voice call to internet access. Therefore, the cellular industry is a very competitive market in the whole world. As the development 4G mobile wireless standards the operator need to know how to design and update their networks so that they can provide the best services to the lowest possible cost. This topic has become a hot topic in the industry. In this paper, we present a literature review on the topological planning problem of LTE Advanced-based Heterogeneous mobile Networks. After describing the need of heterogeneous mobile networks, the architecture is presented. A comparison is made between components to justify the necessity of components we will use in the planning process. We focus on base stations layout and the main problems faced in this planning. This paper provides a high level overview of different parameters constraints and challenges that operators must tackle in order for these networks to reach their potential so that it is used as a starting point for future research on topological design of Dense Areas Heterogeneous mobile Networks.

Problem statement: As a large amount of data stored in spatial databa ses, people may like to find groups of data which share similar features. T hus cluster analysis becomes an important area of research in data mining. Applications of clustering analysis have been utilized in many fields, such a s when we search to construct a cluster served by base sta tion in mobile network. Deciding upon the optimum placement for the base stations to achieve best ser vices while reducing the cost is a complex task req uiring vast computational resource. Approach: This study addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original density-based Spatial Clustering of Applic ations with Noise algorithm. The Cluster Partitioni ng around Medoids original algorithm has been modified and a new algorithm has been proposed by the authors in a recent work. In this study, the densit y-based Spatial Clustering of Applications with Noi se original algorithm has been modified and combined with old algorithm to produce the hybrid algorithm Clustering Density Base and Clustering with Weighted Node-Partitioning around Medoids algorithm to solve the problems in Mobile Network Planning. Results: Implementation of this algorithm to a real case study is presented. Results demonstrate that the pr oposed algorithm has minimum run time minimum cost and high grade of service. Conclusion: The proposed hyper algorithm has the advantage of quick divide the area into clusters where the density base algor ithm has a limit iteration and the advantage of acc uracy (no sampling method is used) and highly grade of se rvice due to the moving of the location of the base stations (medoid) toward the heavy loaded (weighted ) nodes.

Problem statement: The process of network planning is divided into two sub steps. The first step is determining the location of the Multi Service Access Node (MSAN). The second step is the construction of subscriber network lines from MSAN to subscribers to satisfy optimization criteria and design constraints. Due to the complexity of this process artificial intelligence and clustering techniques have been successfully deployed to solve many problems. The problems of the locations of MSAN, the cabling layout and the computation of optimum cable network layouts have been addressed in this study. The proposed algorithm, Clustering density-Based Spatial of Applications with Noise original, minimal Spanning tree and modified Ant-Colony-Based algorithm (CBSCAN-SPANT), used two clustering algorithms which are density-based and agglomerative clustering algorithm using distances which are shortest paths distance and satisfying the network constraints. This algorithm used wire and wireless technology to serve the subscribers demand and place the switches in a real optimal place. Approach: The density-based Spatial Clustering of Applications with Noise original (DBSCAN) algorithm has been modified and a new algorithm (NetPlan algorithm) has been proposed by the author in a recent work to solve the first step in the problem of network planning. In the present study, the NetPlan algorithm is modified by introduce the modified Ant-Colony-Based algorithm to find the optimal path between any node and the corresponding MSAN node in the first step of network planning process to determine nodes belonging to each cluster. The second step, in the process of network planning, is also introduced in the present study. For each cluster, the optimal cabling layout from each MSAN to the subscriber premises is determining by introduce the Prime algorithm which construct minimal spanning tree. Results: Experimental results and analysis indicate that the CBSCAN-SP-ANT algorithm was effective, leads to minimum costs for network construction and make the best grade of service. Conclusion: Using mobile network to serve the area with low density is decreasing the cost of design the fixed wire network. Also, using the modified ANT algorithm and minimum spanning tree, are helping to construct the cable layout from each MSAN to subscribers when the network is complicated and the number of intersections and streets are large.

Information Technology is an important part of the healthcare environment. Accuracy and integrity of the information in any hospital system is necessary. Then, this information has to be up-to-date as well to achieve continuous quality improvement in any organization and particularly in a complex area like healthcare. Therefore, diverse information systems must be integrated across the healthcare enterprise. The main objective of this research is to develop a framework for the exchange of patients records located in different hospitals in Saudi Arabia, adding insurance and prescriptions information along with the patient’s record to facilitate the insurance process and to automate the medicine prescription process that is currently manual in most hospitals. The proposed framework aims to improve the regular ways of obtaining patients medical records separated in each hospital. For instance, if a particular patient has different medical records in different hospitals visited by that patient, our architecture focuses on the method by which data should be searched and retrieved efficiently from a database on the cloud from different hospitals by preprocessing the data in current hospital’s and saving them in the database that resides on the cloud. Our system design is based on cloud computing service oriented architecture. Some of the information included in these medical records is: medical history, prescribed medications and allergies, immunization status, laboratory and test results, radiology images, personal stats like age and weight, diagnoses, order tests and appointments. All of these records are identified by the national ID of the patient. these systems will be utilized by web services asp.net based framework, the doctor will use his/her ID and password to enter the system for security and then enter the patient’s ID to send a request for that patient’s record that will be sent back to the doctor, the record will be up-to-date since the last visit of the patient to any hospital in Saudi Arabia. The main aim of this study is to provide a data exchange model of patients records, it is used to decrease the time and cost of patients, and help doctors to get up-to-date and accurate information of patients from the records from any hospital in Saudi Arabia. By using e-Patient medical records and Mirth Connect program which use HEALTH LEVEL 7 (HL7) protocol. HL7 protocol is a standard information format of healthcare for data exchange. We provide a single, complete automated patient medical record to give a better patient care that avoids medical mistakes due to lack of information and unavailability of medical records.

Mobiles have become very essential part of our everyday life begin of voice call to internet access. As the development of 4G mobile wireless standards the operator need to know how to design and update their networks so that they can provide best services to the lowest possible cost. This paper presents topological planning problem of fourth generation (4G) cellular networks based on the Long Term Evolution Advanced (LTE-Advanced) standards. After describing the LTE-Advanced architecture, we focus on layout and the main problems faced in this planning. This paper provides a high level overview of antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for LTE-Advanced mobile networks. The goal of this paper is to present and classify the different research works that have been done so that it can be used as a starting point for future research on topological design of LTE-Advanced networks.

Recently, Jeddah has witnessed catastrophic events that have caused the environment pollution, detention of people in one area and the inability of people to go to other safe places. For instance, flood has caused the sinking and destruction of homes and the private properties. Also, the existence of excavation works at Jeddah streets has been the main reason for the traffic disruption and the occurrence of many traffic accidents. All these incidents have been happened because these instructions have not been given to all individuals whereas the guidance and advising means were limited to the SMS. The occurrence of such events could be prevented in case that there is a consciousness program and if the civil protection forces play its significant role in these hard times. The goal of this work which will be available for free download, will deliver real-time disaster and road constructions information and notification to users such as fires, floods, constructions. It also receives warnings and tips on how to react before, during and after the disaster, direct to mobile phones. The use of GPS technology through this application could allow location-specific information to be fed to the citizens providing them with the nearest safe location and the shortest path to get there. Moreover, it will receive Google map updates for any newly added information. In time of a trouble, the user can benefit from the knowledge-based system feature that will give him a feedback on what action the user should take upon a specific situation. The knowledge-based system was building through interview with the Experts domains. All these features will improve access to the needed information at the needed time.

With the rapid development in mobile network effective network planning tool is needed to satisfy the need of customers. However, deciding upon the optimum placement for the base stations (BS) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks. The Cluster Partitioning Around Medoids (PAM) original algorithm has been modified and a new algorithm M-PAM (Modified-Partitioning Around Medoids) has been proposed by the authors in a recent work. In the present paper, the M-PAM algorithm is modified and a new algorithm CWN-PAM (Clustering with Weighted Node-Partitioning Around Medoids) has been proposed to satisfy the requirements and constraints. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of mobile network planning., Comment: 7 Pages, 14 Figures. arXiv admin note: substantial text overlap with arXiv:1302.6602

This article deals with social infrastructure planning problems in urban city. Each facility must serve minimum pre-specified level of demand. The objective is to minimize the distance traveled by users to reach the facilities this means also to maximize the accessibility to facilities. A location model that captures the above features is formulated and different solution methods are tested. Clustering in spatial data mining is to group similar objects based on their connectivity, distance, or their relative density in space. In real word, there exist many physical obstacles such as rivers, lakes, highways and mountains, and their presence may affect the result of clustering significantly. In this paper, we study the problem of clustering in the presence of obstacles to solve location of public service facility problem. In this paper, CSPOD-DBSCAN algorithm (Clustering with short path Obstructed Distance - Density- Based Spatial Clustering of Applications with Noise) is developed in the spirit of DBSCAN clustering algorithms. This algorithm is Density-based clustering algorithm using Dijkstra algorithm to calculate obstructed short path distance. The application of this algorithm is illustrated through a case study involving the location of schools in the districts of Mecca in Saudi Arabia.

The size and complexity of today's mobile networks is continuously growing, and with it the cost of planning and operating these networks. Network planning and engineering have to reach a delicate balance between cost, network performance, and up-time of business critical services. With this rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks by modified the original density-based Spatial Clustering of Applications with Noise algorithm. The density-based Spatial Clustering of Applications with Noise original algorithm has been modified and a new algorithm Clustering Density Base in Presence of Obstacles has been proposed by the authors to solve the problem of obstructs in Mobile Network Planning. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problems of mobile network planning.

With the rapid development in mobile network we need effective network planning tool to satisfy the need of customers. However, deciding upon the optimum placement for the base stations (BS) to achieve best services while reducing the cost is a complex task requiring vast computational resource. This paper addresses antenna placement problem or the cell planning problem, involves locating and configuring infrastructure for mobile networks. The Cluster Partitioning Around Medoids (PAM) original algorithm has been modified and a new algorithm M-PAM (Modified-Partitioning Around Medoids) has been proposed by the authors in a recent work. In the present paper, the M-PAM algorithm is modified and a new algorithm CWN-PAM (Clustering with Weighted Node-Partitioning Around Medoids) has been proposed to satisfy the requirements and constraints. Implementation of this algorithm to a real case study is presented. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of mobile network planning.

This paper introduces an enhancements to Ant Colony system, which is considered one of the most successful ant algorithms used to solve combinatorial optimization problems. Network planning is the problem of how to plan the infrastructure network in the new city. This paper deals with optimization algorithms for network design problem. The objective is to design a distribution network at a minimum cost that satisfies the demand and constraints required by the subscribers. This approach uses the idea of an ant group to represent a solution and can assist the solution of large networks that cannot normally be solved to optimality. The algorithmic implementation of the proposed algorithm is described and computational experience is reported. Results demonstrate the effectiveness and flexibility of the modifying algorithm. Comparisons with related work are presented showing the advantages of the purposed algorithm introduced in this paper.

Network planning is a key importance to obtain a good functionality, price and quality of services of a network. The CWSP-PAM-ANT (Clustering with Shortest Path-PAM and ANT-Colony algorithms) system starts by divide the city map into clusters. For each cluster determine the location of switch node and finally connect each subscriber to this corresponding switch node. The system also determines the minimum cost network that satisfies the demand and constraints. The Cluster Partitioning Around Medoids (PAM) original algorithm has been modified and a new algorithm (CWSP-PAM algorithm) has been proposed by the author in a recent work [1]. In the present paper, the CWSP-PAM algorithm is modified by introduce the Ant-Colony-Based algorithm [2] in the second step of network planning process to find the optimal path between any node and the corresponding switch node. Results demonstrate the effectiveness and flexibility of the modifying algorithm in tackling the important problem of network planning