Research in consumer science has proven that grocery shopping is a complex and distressing process. Further, the task of generating the grocery lists for the grocery shopping is always undervalued as the effort and time took to create and manage the grocery lists are unseen and unrecognized. Even though grocery lists represent consumers’ purchase intention, research pertaining the grocery lists does not get much attention from researchers; therefore, limited studies about the topic are found in the literature. Hence, this study aims at bridging the gap by designing and developing a mobile app (application) for creating and managing grocery lists using modern smartphones. Smartphones are pervasive and become a necessity for everyone tod

The proliferation of cellular network enabled users through various positioning tools to track locations, location information is being continuously captured from mobile phones, created a prototype that enables detected location based on using the two invariant models for Global Systems for Mobile (GSM) and Universal Mobile Telecommunications System (UMTS). The smartphone application on an Android platform applies the location sensing run as a background process and the localization method is based on cell phones. The proposed application is associated with remote server and used to track a smartphone without permissions and internet. Mobile stored data location information in the database (SQLite), then transfer it into location AP

This paper presents the motion programming and control of omni-directional mobile robot through the process of building and programming a small robotic platform with secondary design criteria of modularity and simplified control. This is accomplished by combining the positive aspects of several different robotics platform ideas. The platform is shaped like an equilateral triangle with a servo motor, sensors, and omni-wheel, controlled by a PIC microcontroller.

      In this work the kinematics, inverse kinematics and dynamic module for the platform is derived. Two search algorithms (the wall-following search and the “most-open-area” search) is designed, tested, and analyzed experimentally.

In this work the effect of choosing tri-circular tube section had been addressed to minimize the end effector’s error, a comparison had been made between the tri-tube section and the traditional square cross section for a robot arm, the study shows that for the same weight of square section and tri-tube section the error may be reduced by about 33%.

A program had been built up by the use of MathCAD software to calculate the minimum weight of a square section robot arm that could with stand a given pay load and gives a minimum deflection. The second part of the program makes an optimization process for the dimension of the cross section and gives the dimensions of the tri-circular tube cross section that have the same weight of

Community detection is one of the most fundamental applications in understanding the structure of complicated networks. Furthermore, it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships. Networking structures are highly sensitive in social networks, requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks. In addition, they miss out on accurately identifying clusters. Since single-objective optimization cannot always generate accurate and comprehensive results, as multi-objective optimization can.Therefore,we utilized two objective

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).

    Identification of complex communities in biological networks is a critical and ongoing challenge since lots of network-related problems correspond to the subgraph isomorphism problem known in the literature as NP-hard. Several optimization algorithms have been dedicated and applied to solve this problem. The main challenge regarding the application of optimization algorithms, specifically to handle large-scale complex networks, is their relatively long execution time. Thus, this paper proposes a parallel extension of the PSO algorithm to detect communities in complex biological networks. The main contribution of this study is summarized in three- fold; Firstly, a modified PSO algorithm with a local search operator is proposed