Статьи журнала - International Journal of Information Technology and Computer Science
Все статьи: 1165
About One Model Strategic Game of Collective Choice
Статья научная
A model of dyadic non-cooperative game Γ(H) is discussed in the paper for the set of one and the same players’ strategies. The players make their choice sitting round the table and have the opportunity to coordinate only the meanings of utilities in every situation. Therefore the players’ payoffs are given by 2×2 matrixes. A notion “the equalized situation” in mixed strategies which is at the same time the equilibrium is introduced. The theorem has been proved, which establishes the conditions of existance of an equalized situation in the given game. In the case of the existence algorithm is constructed. If equalized situation doesn’t exist in the game, then there exists the equilibrium situation in the pure strategies and it is possible to find it by analysis of situations. Γ(H) game’s with bimatrix game in case of two players is given. The players’ conditions of optimal mixed strategies existence in game is written. Relevant examples are solved and Γ(H) game’s application for finite amount of players’ is discussed.
Бесплатно
Abuse-Free Optimistic Contract Signing Using RSA for Multiuser Systems
Статья научная
Multi-party contract signing (MPCS) is a way for signers to agree on a predetermined contract by exchanging their signature. This matter has become crucial with the growing number of communications. In this paper, we focus mainly on studying the state of the art protocols and more specifically the cryptography involved. We identify the major advances in MPCS, highlight a few gaps with the current protocols and propose an algorithm for contract signing to be abuse-free, optimistic for many signers in industrial standards.
Бесплатно
Accelerated K-means Clustering Algorithm
Статья научная
Optimizing K-means is still an active area of research for purpose of clustering. Recent developments in Cloud Computing have resulted in emergence of Big Data Analytics. There is a fresh need of simple, fast yet accurate algorithm for clustering huge amount of data. This paper proposes optimization of K-means through reduction of the points which are considered for re-clustering in each iteration. The work is generalization of earlier work by Poteras et al who proposed this idea. The suggested scheme has an improved average runtime. The cost per iteration reduces as number of iterations grow which makes the proposal very scalable.
Бесплатно
Accelerated Simulation Scheme for Solving Financial Problems
Статья научная
The Monte Carlo simulation method uses random sampling to study properties of systems with components that behave in a random state. More precisely, the idea is to simulate on the computer the behavior of these systems by randomly generating the variables describing the behavior of their components. In this paper, we propose an efficient and reliable simulation scheme based on Monte Carlo algorithm and combining two variance reduction procedures. We simulate a European option price numerically using the proposed simulation scheme.
Бесплатно
Accident Response Time Enhancement Using Drones: A Case Study in Najm for Insurance Services
Статья научная
One of the main reasons for mortality among people is traffic accidents. The percentage of traffic accidents in the world has increased to become the third in the expected causes of death in 2020. In Saudi Arabia, there are more than 460,000 car accidents every year. The number of car accidents in Saudi Arabia is rising, especially during busy periods such as Ramadan and the Hajj season. The Saudi Arabia’s government is making the required efforts to lower the nations of car accident rate. This paper suggests a business process improvement for car accident reports handled by Najm in accordance with the Saudi Vision 2030. According to drone success in many fields (e.g., entertainment, monitoring, and photography), the paper proposes using drones to respond to accident reports, which will help to expedite the process and minimize turnaround time. In addition, the drone provides quick accident response and recording scenes with accurate results. The Business Process Management (BPM) methodology is followed in this proposal. The model was validated by comparing before and after simulation results which shows a significant impact on performance about 40% regarding turnaround time. Therefore, using drones can enhance the process of accident response with Najm in Saudi Arabia.
Бесплатно
Accuracy evaluation of brain tumor detection using entropy-based image thresholding
Статья научная
In this paper, the accuracy of the entropy-based thresholding approaches in brain tumor detection framework is investigated. Entropies are information gain methods that have been used for image thresholding with various application and different image modalities. The accuracy of the existing entropies for image thresholding has been studied in general domain (e.g.: natural images) and were not compared thoroughly. Thus, a framework for brain tumor segmentation is proposed with the core process of the image thresholding, in order to evaluate the accuracy of the entropies. Five entropies, namely, Renyi, Maximum, Minimum, Tsallis and Kapur are evaluated. Moreover, the aggregation of entropies was implemented and evaluated. The results show that the maximum entropy is the best for brain tumor detection. Moreover, it was shown that aggregation of entropies output does not enhance the result, however, it works as automatic selection of the best result and produces the results with the highest accuracy.
Бесплатно
Accurate Anomaly Detection using Adaptive Monitoring and Fast Switching in SDN
Статья научная
Software defined networking (SDN) is rapidly evolving technology which provides a suitable environment for easily applying efficient monitoring policies on the networks. SDN provides a centralized control of the whole network from which monitoring of network traffic and resources can be done with ease. SDN promises to drastically simplify network monitoring and management and also enable rapid innovation of networks through network programmability. SDN architecture separates the control of the network from the forwarding devices. With the higher innovation provided by the SDN, security threats at open interfaces of SDN also increases significantly as an attacker can target the single centralized point i.e. controller, to attack the network. Hence, efficient adaptive monitoring and measurement is required to detect and prevent malicious activities inside the network. Various such techniques have already been proposed by many researchers. This paper describes a work of applying efficient adaptive monitoring on the network while maintaining the performance of the network considering monitoring overhead over the controller. This work represents effective bandwidth utilization for calculation of threshold range while applying anomaly detection rules for monitoring of the network. Accurate detection of anomalies is implemented and also allows valid users and applications to transfer the data without any restrictions inside the network which otherwise were considered as anomalies in previous technique due to fluctuation of data and narrow threshold window. The concept of fast switching also used to improve the processing speed and performance of the networks.
Бесплатно
Active Selection Constraints for Semi-supervised Clustering Algorithms
Статья научная
Semi.-supervised clustering algorithms aim to enhance the performance of clustering using the pairwise constraints. However, selecting these constraints randomly or improperly can minimize the performance of clustering in certain situations and with different applications. In this paper, we select the most informative constraints to improve semi-supervised clustering algorithms. We present an active selection of constraints, including active must.-link (AML) and active cannot.-link (ACL) constraints. Based on Radial-Bases Function, we compute lower-bound and upper-bound between data points to select the constraints that improve the performance. We test the proposed algorithm with the base-line methods and show that our proposed active pairwise constraints outperform other algorithms.
Бесплатно
Статья научная
An evolving weighted neuro-neo-fuzzy-ANARX model and its learning procedures are introduced in the article. This system is basically used for time series forecasting. It's based on neo-fuzzy elements. This system may be considered as a pool of elements that process data in a parallel manner. The proposed evolving system may provide online processing data streams.
Бесплатно
Adaptive Guidance based on Context Profile for Software Process Modeling
Статья научная
This paper aims to define an adaptive guidance for software process modeling. The proposed guidance approach is based on development’s profile context (actor’s role in the process, actor’s qualification and related activities in progress). We introduce new guidance concepts through adaptive guidance meta-model (AGM) allowing specific assistance interventions (corrective, constructive and automatic guidance). We illustrate our guidance approach using SPEM formalism extended with these new guidance concepts.
Бесплатно
Статья научная
Polarimetric radar images suffer from the presence of speckles that degrade the received signal and introduce untruthful indications about the nature of the objects. In this study, we proposed a new framework to filter polarimetric images in which the edges and the channel correlation are preserved. Through a proposed scheme, the image is segmented into groups of regular and irregular pixels. The segmentation process is based on the homogeneity of the texture variation throughout the image. In the homogeneous area, speckle reduction is performed using the adaptive local mean of the neighboring pixels. For non-homogeneous surfaces, the scheme works independently for each set of resolution cells using the general product model containing both intensity and texture information. Quantitative and qualitative assessments confirmed that the proposed filter achieved highly ranked order; it has the ability to preserve fine details, polarimetric information, and to maintain the scattering mechanism of the different objects.
Бесплатно
Adaptive Modeling of Urban Dynamics during Armada Event using CDRs
Статья научная
This study investigates the mobile phone data during ephemeral event (Armada). The statistical techniques have been used for modeling human mobility collectively and individually. The undertaken substantial parameters are: inter-event times, travel distances (displacements), and radius of gyration. They have been analyzed and simulated using computing platform by integrating various applications for huge database management, visualization, analysis, and simulation. Accordingly, the general population pattern law has been extracted. This study has revealed the individuals mobility in dynamic perspective for 615,712 mobile users, also the simulated observed data are classified according to general, work, and off days.
Бесплатно
Статья научная
The world is going to be a universal digital village and from the flow of this digitalization Bangladesh also riding of the tide. The key points of these digitalization is young generations basically university students of Bangladesh. ICT and Internet is a new trend for this country that’s the main reasons to encompass this by opportunity by young students. Bangladeshi young generations have also addicted in the upper tier of this list. The addiction of ICT & internet is more on the young generations than any other parts of the people generally in the third world countries. The main objective of this paper is to investigate the excessive use of Information and Communication Technology (ICT) and internet by the university students in Bangladesh. The study had collected the data from 24 public and private universities in Bangladesh out of 135. The study was used the simple random sampling (SRS) for analyzing the sample size with IBM SPSS 23.
Бесплатно
Advance Mining of Temporal High Utility Itemset
Статья научная
The stock market domain is a dynamic and unpredictable environment. Traditional techniques, such as fundamental and technical analysis can provide investors with some tools for managing their stocks and predicting their prices. However, these techniques cannot discover all the possible relations between stocks and thus there is a need for a different approach that will provide a deeper kind of analysis. Data mining can be used extensively in the financial markets and help in stock-price forecasting. Therefore, we propose in this paper a portfolio management solution with business intelligence characteristics. We know that the temporal high utility itemsets are the itemsets with support larger than a pre-specified threshold in current time window of data stream. Discovery of temporal high utility itemsets is an important process for mining interesting patterns like association rules from data streams. We proposed the novel algorithm for temporal association mining with utility approach. This make us to find the temporal high utility itemset which can generate less candidate itemsets.
Бесплатно
Advanced Applications of Neural Networks and Artificial Intelligence: A Review
Статья научная
Artificial Neural Network is a branch of Artificial intelligence and has been accepted as a new computing technology in computer science fields. This paper reviews the field of Artificial intelligence and focusing on recent applications which uses Artificial Neural Networks (ANN’s) and Artificial Intelligence (AI). It also considers the integration of neural networks with other computing methods Such as fuzzy logic to enhance the interpretation ability of data. Artificial Neural Networks is considers as major soft-computing technology and have been extensively studied and applied during the last two decades. The most general applications where neural networks are most widely used for problem solving are in pattern recognition, data analysis, control and clustering. Artificial Neural Networks have abundant features including high processing speeds and the ability to learn the solution to a problem from a set of examples. The main aim of this paper is to explore the recent applications of Neural Networks and Artificial Intelligence and provides an overview of the field, where the AI & ANN’s are used and discusses the critical role of AI & NN played in different areas.
Бесплатно
Advanced Prediction Based Mobility Support for 6LoWPAN Wireless Sensor Networks
Статья научная
Wireless Sensor Nodes (SNs), the key elements for building Internet of Things (IOT) have been deployed widely in order to get and transmit information over the internet. IPv6 over low power personal area network (6LoWPAN) enabled their connectivity with IPV6 networks. 6LoWPAN has mobility and it can find an extensive application space only if provides mobility support efficiently. Existing mobility schemes are focused on reducing handoff (HO) latency and pay less attention towards packet loss and signaling cost. In time critical applications under IOT, packet loss and excessive signaling cost are not acceptable. This paper proposes a scheme based on advanced mobility prediction for reducing extra signaling cost and packet loss that incurs due to connection termination in traditional schemes such as Proxy Mobile IPv6 (PMIPv6) handover. In our proposed scheme 6LoWPAN WSN architecture with IPv6 addressing is presented. Based on this architecture the mobility algorithm is proposed for reducing signaling cost, packet loss by buffering mechanism and HO latency in particular. In the algorithm layer 2 (L2) and layer 3 (L3) HO is performed simultaneously with prior HO prediction with no Care of Address (CoA) configuration which also reduces signaling cost to some extent. The proposed scheme is analyzed theoretically and evaluated for different performance metrics. Data results showed significant improvements in reducing packet loss, signaling cost and HO latency when compared to standard PMIPv6 in time critical scenarios.
Бесплатно
Aerodynamic System Modeling based on Proper Orthogonal Decomposition
Статья научная
The main goal of present paper is to construct an efficient reduced order model (ROM) for aerodynamic system modeling. Proper Orthogonal Decomposition (POD) is presented to address the problem. First, the snapshots are collected to form the POD kernel, and then Singular Values Decomposition (SVD) is used to obtain POD modes, finally POD-ROM can be constructed by projecting full order aerodynamic system to POD modes subspace. Two problems are addressed: (1) aerodynamic data inverse design; (2) aeroelastic structure active control. For the second problem, POD method with balanced modification is introduced to improve the robustness of original POD method. Results in problem (1) suggest POD method works efficiently not only for interpolation inverse design but also for extrapolation problems. The results in problem (2) demonstrate POD method with balanced modification is efficient and accurate enough for aeroelastic system analysis.
Бесплатно
Airport Merchandising Using Micro Services Architecture
Статья научная
Airport offers an ecosystem where passengers, airlines, airport, and merchants meet under one roof during travel. During the journey, there is a good amount of time spent by passengers on waiting or transit before boarding the flight. Passengers look for spending that time by shopping, dining, and entertainment. Airport merchants and airlines look for merchandising opportunities to acquire new customers, up-sell, and cross-sell their products and services. Highly personalized merchandising offers can be generated on the fly by combining contextual information from passenger profile, likes and interests, merchant offers, and location specific events, seasons, and festivals. To achieve this, a strong airport merchandising platform is needed. The goal of the airport merchandising platform is to exchange information in a seamless manner across travel systems. The platform is designed on microservices design principles that use information from airlines, airport, social media, and merchant systems. Microservices can promote quick development, deployment, and realization of services. Microservices also improve the time to market capabilities. Mobile and desktop applications consume them to offer a personalized shopping experience to the passengers.
Бесплатно
Algorithmic Aspects for Total Connected Dominating Sets in Mobile Ad Hoc Wireless Networks
Статья научная
A Total connected dominating set (TCDS) for a graph G(V,E) is a subset V'of V , such that each node in V−V' is adjacent to some node in V' and V' induces a connected subgraph. A TCDS has been proposed as a virtual backbone for routing in wireless ad hoc networks. However, it is NP-hard to find a minimum connected dominating set (MCDS). Approximation algorithms for MCDS have been proposed in the literature. Most of these algorithms suffer from a very poor approximation ratio, and from high time complexity and message complexity. Recently, new distributed heuristics for constructing a TCDS were developed, with constant approximation ratio of 8. These new heuristics are based on a construction of a spanning tree, which makes it very costly in terms of communication overhead to maintain the TCDS in the case of mobility and topology changes. Investigating the algorithmic complexity of total domination for wireless ad hoc network as relevant open question .An O(n^2) algorithm has been proposed for this problem by Bertossi [1].Keil [10] proposed an O(n+m) In this paper, we propose the first distributed approximation algorithm to construct a MCDS for the unit-disk-graph with a constant approximation ratio O(n), and linear time and linear message complexity. This algorithm is fully localized, and does not depend on the spanning tree. Thus, the maintenance of the TCDS after changes of topology guarantees the maintenance of the same approximation ratio. In this algorithm each node requires knowledge of its single hop neighbors, and only a constant number of two-hop and three-hop neighbors.
Бесплатно
An Algorithm to Count Nodes in Wireless Networks Using their Actual Position
Статья научная
In this paper we introduce a novel algorithm for counting nodes based on wireless communications and their actual position, which works for stationary nodes and in scenarios where nodes are moving at high speeds. For this, each node is endowed with a Global Positioning System (GPS) receptor, allowing it to periodically send its actual position and speed through beacon messages. These data will be received by the first-hop neighboring nodes (which are within its scope or propagation range) that will have the ability to compute the actual position of the sending node based on the last broadcasted position and speed. The algorithm is constructed on the propagation of a count request message from the originator node toward nodes that are far away from it, and response messages traveling back to the originator, in the reverse path when it is possible, otherwise using the closest node on the way to the originator. To validate and evaluate the performance of our proposal, we simulate the algorithm using a famous network simulation tool called OMNeT++/INET. The results of our simulations show that the proposed algorithm efficiently computes a number of nodes very close to the real one, even in the case of scenarios of mobile nodes moving at high speeds, with an acceptable response time.
Бесплатно
