NUMERICAL STUDY OF TURBULENCE DYNAMICS IN PLUNGING & SURGING BREAKING WAVES

KHAYYER ABBAS,YEGANEH-BAKHTIARY ABBAS,GHAHERI ABBAS,GOTOH HITOSHI,SAKAI TETSUO 한국수자원학회 2005 한국수자원학회 학술대회 Vol.2005 No.1

PAPR reduction of optical OFDM signals in visible light communications

Abbas Ali Sharifi 한국통신학회 2019 ICT Express Vol.5 No.3

Orthogonal frequency division multiplexing (OFDM) is extensively used in optical communications to achieve high rate transmission. In this paper, Vandermonde like matrix (VLM) pre-coding approach is offered to reduce the high peak-to-average power ratio (PAPR) of DC-biased optical OFDM (DCO-OFDM) and asymmetrically clipped optical OFDM (ACO-OFDM) signals in visible light communications. The proposed method is compared with Walsh–Hadamard transform (WHT), discrete cosine transform (DCT), and discrete Hartley transform (DHT) pre-coding approaches in terms of PAPR reduction performance. Simulation results indicate that the proposed method effectively reduces the PAPR of an optical signal in both DCO-OFDM and ACO-OFDM techniques.

A Scheduling and Synchronization Technique for RAPIEnet Switches Using Edge-Coloring of Conflict Multigraphs

Abbas, Syed Hayder,Hong, Seung Ho The Korea Institute of Information and Commucation 2013 Journal of communications and networks Vol.15 No.3

In this paper, we present a technique for obtaining conflict-free schedules for real-time automation protocol for industrial Ethernet (RAPIEnet) switches. Mathematical model of the switch is obtained using graph theory. Initially network traffic entry and exit parts in a single RAPIEnet switch are identified, so that a bipartite conflict graph can be constructed. The obtained conflict graph is transformed to three kinds of matrices to be used as inputs for our simulation model, and selection of any of the matrix forms is application-specific. A greedy edge-coloring algorithm is used to schedule the network traffic and to solve the minimum coloring problem. After scheduling, empty slots are identified for forwarding the non real-time traffic of asynchronous devices. Finally, an algorithm for synchronizing the schedules of adjacent switches is proposed using edge-contraction and minors. All simulations were carried out using Matlab.

Lifesaver: Android-based Application for Human Emergency Falling State Recognition

Abbas, Qaisar International Journal of Computer ScienceNetwork S 2021 International journal of computer science and netw Vol.21 No.8

Smart application is developed in this paper by using an android-based platform to automatically determine the human emergency state (Lifesaver) by using different technology sensors of the mobile. In practice, this Lifesaver has many applications, and it can be easily combined with other applications as well to determine the emergency of humans. For example, if an old human falls due to some medical reasons, then this application is automatically determining the human state and then calls a person from this emergency contact list. Moreover, if the car accidentally crashes due to an accident, then the Lifesaver application is also helping to call a person who is on the emergency contact list to save human life. Therefore, the main objective of this project is to develop an application that can save human life. As a result, the proposed Lifesaver application is utilized to assist the person to get immediate attention in case of absence of help in four different situations. To develop the Lifesaver system, the GPS is also integrated to get the exact location of a human in case of emergency. Moreover, the emergency list of friends and authorities is also maintained to develop this application. To test and evaluate the Lifesaver system, the 50 different human data are collected with different age groups in the range of (40-70) and the performance of the Lifesaver application is also evaluated and compared with other state-of-the-art applications. On average, the Lifesaver system is achieved 95.5% detection accuracy and the value of 91.5 based on emergency index metric, which is outperformed compared to other applications in this domain.

ON APPROXIMATE MIXED n-JORDAN HOMOMORPHISMS ON BANACH ALGEBRAS

( Abbas Zivari-kazempour ),( Mohammad Valaei ) 호남수학회 2020 호남수학학술지 Vol.42 No.4

In this paper, the Hyers-Ulam-Rassias stability of mixed n-Jordan homomorphisms on Banach algebras and the superstabil-ity of mixed n-Jordan *-homomorphism between C*-algebras are investigated.

Flow Table Design in Software Defined Networking based on PSO algorithm for enhanced packet loss and delay

Abbas Tataei,Farhad Faghani 대한전자공학회 2017 대한전자공학회 학술대회 Vol.2017 No.1

In the Software Design Network (SDN), Control Plane and Data Plane are separated from each other [1], [2], so we can improve many of network parameters by using this advantage in control plane utilizing algorithms and applying the control policies. With improving the quality of these parameters, we can enhance the Quality of Service in a network. In this study, the aim is to carry out orders which are designed in Application Layer by programmer and provide for control layer and apply to switches by it. We can minimize the rate of Packet Loss with designing multi flow table and use Particle Swarm Optimization algorithm to find best network graph and consider the omission of the Loop in the network which contribute to reduce delay in the received packets and finally, raise Throughput and the Reliability and increase QOS, MININET Emulator and Pox controller were simulated and the results were compared with the previous networks.

Discrete Hartley matrix transform precoding-based OFDM system to reduce the high PAPR

Abbas Ali Sharifi 한국통신학회 2019 ICT Express Vol.5 No.2

The high peak-to-average power ratio (PAPR) is one of the major drawbacks of the orthogonal frequency division multiplexing (OFDM) systems that make non-linear distortion in practical implementation of high power amplifier (HPA). In this study, the performance of discrete Hartley matrix transform (DHMT) in precoding based OFDM system is analyzed to minimize the high PAPR. We demonstrate that the DHMT precoding method eliminates the multicarrier assumption in a special circumstance. The remarkable results are achieved and compared with conventional OFDM, Walsh–Hadamard matrix transform (WHMT), discrete cosine matrix transform (DCMT) and Vandermonde-like matrix transform (VLMT) in precoding based OFDM signals.

FRS-OCC: Face Recognition System for Surveillance Based on Occlusion Invariant Technique

Abbas, Qaisar International Journal of Computer ScienceNetwork S 2021 International journal of computer science and netw Vol.21 No.8

Automated face recognition in a runtime environment is gaining more and more important in the fields of surveillance and urban security. This is a difficult task keeping in mind the constantly volatile image landscape with varying features and attributes. For a system to be beneficial in industrial settings, it is pertinent that its efficiency isn't compromised when running on roads, intersections, and busy streets. However, recognition in such uncontrolled circumstances is a major problem in real-life applications. In this paper, the main problem of face recognition in which full face is not visible (Occlusion). This is a common occurrence as any person can change his features by wearing a scarf, sunglass or by merely growing a mustache or beard. Such types of discrepancies in facial appearance are frequently stumbled upon in an uncontrolled circumstance and possibly will be a reason to the security systems which are based upon face recognition. These types of variations are very common in a real-life environment. It has been analyzed that it has been studied less in literature but now researchers have a major focus on this type of variation. Existing state-of-the-art techniques suffer from several limitations. Most significant amongst them are low level of usability and poor response time in case of any calamity. In this paper, an improved face recognition system is developed to solve the problem of occlusion known as FRS-OCC. To build the FRS-OCC system, the color and texture features are used and then an incremental learning algorithm (Learn++) to select more informative features. Afterward, the trained stack-based autoencoder (SAE) deep learning algorithm is used to recognize a human face. Overall, the FRS-OCC system is used to introduce such algorithms which enhance the response time to guarantee a benchmark quality of service in any situation. To test and evaluate the performance of the proposed FRS-OCC system, the AR face dataset is utilized. On average, the FRS-OCC system is outperformed and achieved SE of 98.82%, SP of 98.49%, AC of 98.76% and AUC of 0.9995 compared to other state-of-the-art methods. The obtained results indicate that the FRS-OCC system can be used in any surveillance application.

Certain New Families for Bi-univalent Functions Defined by a Known Operator

Abbas Kareem Wanas,최준상 영남수학회 2021 East Asian mathematical journal Vol.37 No.3

In this paper, we aim to introduce two new families of analytic and bi-univalent functionsassociated with the Attiya's operator, which is defined by the Hadamard product ofa generalized Mittag-Leffler function and analytic functions on the open unit disk. Then we estimate the second and third coefficients of the Taylor-Maclaurin series expansions of functions belonging to these families. Also, we investigate Fekete-Szeg\"{o} problem for these families. Some relevant connections of certain special cases of the main results with those in several earlier works are also pointed out. Two naturally-arisen problems are given for further investigation.

Modeling and Stimulating Node Cooperation in Wireless Ad Hoc Networks

Abbas Arghavani,Abolfazl Sargazi,Mahdi Arghavani,Mahmood Ahmadi 한국전자통신연구원 2015 ETRI Journal Vol.37 No.1

In wireless networks, cooperation is necessary for many protocols, such as routing, clock synchronization, and security. It is known that cooperator nodes suffer greatly from problems such as increasing energy consumption. Therefore, rational nodes have no incentive to cooperatively forward traffic for others. A rational node is different from a malicious node. It is a node that makes the best decision in each state (cooperate or non-cooperate). In this paper, game theory is used to analyze the cooperation between nodes. An evolutionary game has been investigated using two nodes, and their strategies have been compared to find the best one. Subsequently, two approaches, one based on a genetic algorithm (GA) and the other on learning automata (LA), are presented to incite nodes for cooperating in a noisy environment. As you will see later, the GA strategy is able to disable the effect of noise by using a big enough chromosome; however, it cannot persuade nodes to cooperate in a noise-free environment. Unlike the GA strategy, the LA strategy shows good results in a noise-free environment because it has good agreement in cooperation-based strategies in both types of environment (noise-free and noisy).