With the expanding of database of the watch list of anti-money laundering, improving the speed in
matching between the watch list and the database of account holders and clients’ transaction is especially
important. This paper proposes an improved AC-BM Algorithm, a matching algorithm of subsection, to
improve the speed of matching. Experiment results show the time performance of the improved algorithm
is better than traditional BM algorithm, AC algorithm and the AC-BM algorithm. It can improve the
efficiency of on-line monitoring of anti-money laundering.
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMSecij
Travelling salesman problem (TSP) is a most popular combinatorial routing problem, belongs to the class of NP-hard problems. Many approacheshave been proposed for TSP.Among them, swarm intelligence (SI) algorithms can effectively achieve optimal tours with the minimum lengths and attempt to avoid trapping in local minima points. The transcendence of each SI is depended on the nature of the problem. In our studies, there has been yet no any article, which had compared the performance of SI algorithms for TSP perfectly. In this paper,four common SI algorithms are used to solve TSP, in order to compare the performance of SI algorithms for the TSP problem. These algorithms include genetic algorithm, particle swarm optimization, ant colony optimization, and artificial bee colony. For each SI, the various parameters and operators were tested, and the best values were selected for it. Experiments oversome benchmarks fromTSPLIBshow that
artificial bee colony algorithm is the best one among the fourSI-basedmethods to solverouting problems like TSP.
Information Spread in the Context of Evacuation OptimizationDr. Mirko Kämpf
Abstract: Our evacuation simulation tool utilizes established algorithms for the emotional and intelligence driven motion of human beings in addition to a simple lattice gas simulation. We analyze the spread of information inside a restricted geometry of a real building and compare these results with the data from a simulation in the free space. We apply the DFA and the RIS statistic to our simulation dataset to detect phases or phase transitions of the whole system. We study the impact of communication technology by comparison of different update algorithms and exit strategies. These results help us to define basic functional requirements to the underlying communication technology and network topology as well as to the needed sensors.
Efficient Mining of Association Rules in Oscillatory-based DataWaqas Tariq
Association rules are one of the most researched areas of data mining. Finding frequent patterns is an important step in association rules mining which is very time consuming and costly. In this paper, an effective method for mining association rules in the data with the oscillatory value (up, down) is presented, such as the stock price variation in stock exchange, which, just a few numbers of the counts of itemsets are searched from the database, and the counts of the rest of itemsets are computed using the relationships that exist between these types of data. Also, the strategy of pruning is used to decrease the searching space and increase the rate of the mining process. Thus, there is no need to investigate the entire frequent patterns from the database. This takes less time to find frequent patterns. By executing the MR-Miner (an acronym for “Math Rules-Miner”) algorithm, its performance on the real stock data is analyzed and shown. Our experiments show that the MR-Miner algorithm can find association rules very efficiently in the data based on Oscillatory value type.
Investigation of Parameter Behaviors in Stationarity of Autoregressive and Mo...BRNSS Publication Hub
The most important assumption about time series and econometrics data is stationarity. Therefore, this study focuses on behaviors of some parameters in stationarity of autoregressive (AR) and moving average (MA) models. Simulation studies were conducted using R statistical software to investigate the parameter values at different orders (p) of AR and (q) of MA models, and different sample sizes. The stationary status of the p and q are, respectively, determined, parameters such as mean, variance, autocorrelation function (ACF), and partial autocorrelation function (PACF) were determined. The study concluded that the absolute values of ACF and PACF of AR and MA models increase as the parameter values increase but decrease with increase of their orders which as a result, tends to zero at higher lag orders. This is clearly observed in large sample size (n = 300). However, their values decline as sample size increases when compared by orders across the sample sizes. Furthermore, it was observed that the means values of the AR and MA models of first order increased with increased in parameter but decreased when sample sizes were decreased, which tend to zero at large sample sizes, so also the variances
A COMPARISON BETWEEN SWARM INTELLIGENCE ALGORITHMS FOR ROUTING PROBLEMSecij
Travelling salesman problem (TSP) is a most popular combinatorial routing problem, belongs to the class of NP-hard problems. Many approacheshave been proposed for TSP.Among them, swarm intelligence (SI) algorithms can effectively achieve optimal tours with the minimum lengths and attempt to avoid trapping in local minima points. The transcendence of each SI is depended on the nature of the problem. In our studies, there has been yet no any article, which had compared the performance of SI algorithms for TSP perfectly. In this paper,four common SI algorithms are used to solve TSP, in order to compare the performance of SI algorithms for the TSP problem. These algorithms include genetic algorithm, particle swarm optimization, ant colony optimization, and artificial bee colony. For each SI, the various parameters and operators were tested, and the best values were selected for it. Experiments oversome benchmarks fromTSPLIBshow that
artificial bee colony algorithm is the best one among the fourSI-basedmethods to solverouting problems like TSP.
Information Spread in the Context of Evacuation OptimizationDr. Mirko Kämpf
Abstract: Our evacuation simulation tool utilizes established algorithms for the emotional and intelligence driven motion of human beings in addition to a simple lattice gas simulation. We analyze the spread of information inside a restricted geometry of a real building and compare these results with the data from a simulation in the free space. We apply the DFA and the RIS statistic to our simulation dataset to detect phases or phase transitions of the whole system. We study the impact of communication technology by comparison of different update algorithms and exit strategies. These results help us to define basic functional requirements to the underlying communication technology and network topology as well as to the needed sensors.
Efficient Mining of Association Rules in Oscillatory-based DataWaqas Tariq
Association rules are one of the most researched areas of data mining. Finding frequent patterns is an important step in association rules mining which is very time consuming and costly. In this paper, an effective method for mining association rules in the data with the oscillatory value (up, down) is presented, such as the stock price variation in stock exchange, which, just a few numbers of the counts of itemsets are searched from the database, and the counts of the rest of itemsets are computed using the relationships that exist between these types of data. Also, the strategy of pruning is used to decrease the searching space and increase the rate of the mining process. Thus, there is no need to investigate the entire frequent patterns from the database. This takes less time to find frequent patterns. By executing the MR-Miner (an acronym for “Math Rules-Miner”) algorithm, its performance on the real stock data is analyzed and shown. Our experiments show that the MR-Miner algorithm can find association rules very efficiently in the data based on Oscillatory value type.
Investigation of Parameter Behaviors in Stationarity of Autoregressive and Mo...BRNSS Publication Hub
The most important assumption about time series and econometrics data is stationarity. Therefore, this study focuses on behaviors of some parameters in stationarity of autoregressive (AR) and moving average (MA) models. Simulation studies were conducted using R statistical software to investigate the parameter values at different orders (p) of AR and (q) of MA models, and different sample sizes. The stationary status of the p and q are, respectively, determined, parameters such as mean, variance, autocorrelation function (ACF), and partial autocorrelation function (PACF) were determined. The study concluded that the absolute values of ACF and PACF of AR and MA models increase as the parameter values increase but decrease with increase of their orders which as a result, tends to zero at higher lag orders. This is clearly observed in large sample size (n = 300). However, their values decline as sample size increases when compared by orders across the sample sizes. Furthermore, it was observed that the means values of the AR and MA models of first order increased with increased in parameter but decreased when sample sizes were decreased, which tend to zero at large sample sizes, so also the variances
Combining Neural Network and Firefly Algorithm to Predict Stock Price in Tehr...Editor IJCATR
In the present research, prediction of stock price index in Tehran stock exchange by using neural
networks and firefly algorithm in chaotic behavior of price index stock exchange are studied. Two data sets
are selected for neural network input. Various breaks of index and macro economic factors are considered
as independent variables. Also, firefly algorithm is used to [redict price index in next week. The results of
research show that combining neural networks and firefly optimization algorithm has better performance
than neural network to predict the price index. In addition, acceptable value of error-sequre means for
network error in test data show that there are chaotic mevements in behaviour of price index.
Linear Regression Model Fitting and Implication to Self Similar Behavior Traf...IOSRjournaljce
We present a simple linear regression model fit in the direction of self-similarity behavior of internet user’s arrival data pattern. It has been reported that Internet traffic exhibits self-similarity. Motivated by this fact, real time internet users arrival patterns considered as traffic and the results carried out and proven that it has the self-similar nature by various Hurst index methods. The present study provides a mathematical model equation in terms linear regression as a tool to predict the arrival pattern of Internet users data at web centers. Numerical results, analysis discussed and presented here plays a significant role in improvement of the services and forecasting analysis of arrival protocols at web centers in the view of quality of service (QOS).
Using genetic algorithms and simulation as decision support in marketing stra...infopapers
F.Stoica, L.F.Cacovean, Using genetic algorithms and simulation as decision support in marketing strategies and long-term production planning, Proceedings of the 9th WSEAS International Conference on SIMULATION, MODELLING AND OPTIMIZATION (SMO ‘09), Budapest Tech, Hungary, September 3-5, ISSN: 1790-2769 ISBN:978-960-474-113-7, pp. 435-439, 2009
Search for a substring of characters using the theory of non-deterministic fi...journalBEEI
The paper proposed an algorithm which purpose is searching for a substring of characters in a string. Principle of its operation is based on the theory of non-deterministic finite automata and vector-character architecture. It is able to provide the linear computational complexity of searching for a substring depending on the length of the searched string measured in the number of operations with hyperdimensional vectors when repeatedly searching for different strings in a target line. None of the existing algorithms has such a low level of computational complexity. The disadvantages of the proposed algorithm are the fact that the existing hardware implementations of computing systems for performing operations with hyperdimensional vectors require a large number of machine instructions, which reduces the gain from this algorithm. Despite this, in the future, it is possible to create a hardware implementation that can ensure the execution of operations with hyperdimensional vectors in one cycle, which will allow the proposed algorithm to be applied in practice.
Simulation of the Linear Boltzmann Transport Equation in Modelling Of Photon ...IOSR Journals
A beam data modelling algorithm was developed by solving the linear Boltzmann Transport Equation (BTE). The Linear Boltzmann Transport Equation (LBTE) is a form of the Boltzmann transport equation that assumes that radiation particles only interact with the matter as they are passing through matter and not with each other. This condition is only valid when there is no external magnetic field. The numerical method proposed by Lewis et al., [9] was used to solve the LBTE. A programming code was computed for the LBTE and run on CMS XiO treatment planning system to generate beam data, the generated beam data were compared to experimentally determined data. The calculated percentage depth dose (PDD) completely overlap the measured PDDs for the small field sizes while there is a shift in the PDD tail for large field size. However the shift is negligible. For the wedge PDDs, the shift between the measured PDDs and the calculated occurs at the Dmax region and it increases with increase in field size. The calculated wedge profiles have a slight shift at the shoulder compared to the measured ones and this decreases with increase in field size, unlike the PDDs. There is also a slight shift between calculated in-plane profiles and measured ones. There is a good agreement between the measured beam data and the calculated ones using the algorithm. This algorithm can be implemented as an in-house algorithm for beam data modelling and also as an independent quality assurance tool for checking the accuracy of clinical TPS algorithms with regards to beam data modelling during quality assurance and TPS commissioning tests.
Reduced Merge_FSM Pattern Matching Algorithm for Network Intrusion Detectionidescitation
Pattern matching is a significant issue in intrusion detection systems (IDS), as it
is required to identify and restrict certain virus patterns by matching them with the
patterns present in the database. The performance of an Intrusion Detection System is
dependent on two metrics that is throughput and the total number of patterns that can fit
on a device. Many hardware approaches are proposed to accelerate pattern matching.
Among hardware approaches, memory based architecture has attracted a lot of attention
because of its easy reconfiguration and scalability. In memory architecture approach. First,
the virus string patterns are compiled to a finite-state machine (FSM) whose output is
asserted when any substring of input strings matches the string patterns. The speed of
comparisons and memory required to store virus string patterns is evaluated through the
number of state transitions made. In this paper, a new pattern-matching algorithm
‘Reduced Merge_FSM’ is proposed which significantly reduce the memory requirement
and provides faster matching, by reducing the state transitions, than that of existing Finite
State Machine (FSM) based approaches. This reduction in states results in optimization of
memory and also the comparison time. To prove the efficiency of the proposed algorithm,
it is compared through experimentation with the existing AC-Algorithm and Merge_FSM.
A Survey of String Matching AlgorithmsIJERA Editor
The concept of string matching algorithms are playing an important role of string algorithms in finding a place where one or several strings (patterns) are found in a large body of text (e.g., data streaming, a sentence, a paragraph, a book, etc.). Its application covers a wide range, including intrusion detection Systems (IDS) in computer networks, applications in bioinformatics, detecting plagiarism, information security, pattern recognition, document matching and text mining. In this paper we present a short survey for well-known and recent updated and hybrid string matching algorithms. These algorithms can be divided into two major categories, known as exact string matching and approximate string matching. The string matching classification criteria was selected to highlight important features of matching strategies, in order to identify challenges and vulnerabilities.
The railway capacity optimization problem deals with the maximization of the number of trains running on
a given network per unit time. In this study, we frame this problem as a typical asymmetrical Travelling
Salesman Problem (ATSP), with the ATSP nodes representing the train arrival /departure events and the
ATSP total cost representing the total time-interval of the schedule. The application problem is then
optimized using the standard Ant Colony Optimization (ACO) algorithm. The simulation experiments
validate the formulation of the railway capacity problem as an ATSP and the ACO algorithm produces
optimal solutions superior to those produced by the domain experts.
Congestion Control in Wireless Sensor Networks Using Genetic AlgorithmEditor IJCATR
Sensor network consists of a large number of small nods, strongly interacting with the physical environment, takes
environmental data through sensors, and reacts after processing on information. Wireless network technologies are widely used in most
applications. As wireless sensor networks have many activities in the field of information transmission, network congestion cannot be
thus avoided. So it seems necessary that some new methods can control congestion and use existing resources for providing better traffic
demands. Congestion increases packet loss and retransmission of removed packets and also wastes of energy. In this paper, a novel
method is presented for congestion control in wireless sensor networks using genetic algorithm. The results of simulation show that the
proposed method, in comparison with the algorithm LEACH, can significantly improve congestion control at high speeds.
The optimization of running queries in relational databases using ant colony ...ijdms
The issue of optimizing queries is a cost-sensitive
process and with respect to the number of associat
ed
tables in a query, its number of permutations grows
exponentially. On one hand, in comparison with oth
er
operators in relational database, join operator is
the most difficult and complicated one in terms of
optimization for reducing its runtime. Accordingly,
various algorithms have so far been proposed to so
lve
this problem. On the other hand, the success of any
database management system (DBMS) means
exploiting the query model. In the current paper, t
he heuristic ant algorithm has been proposed to sol
ve this
problem and improve the runtime of join operation.
Experiments and observed results reveal the efficie
ncy
of this algorithm compared to its similar algorithm
s.
Performance Comparision of Machine Learning AlgorithmsDinusha Dilanka
In this paper Compare the performance of two
classification algorithm. I t is useful to differentiate
algorithms based on computational performance rather
than classification accuracy alone. As although
classification accuracy between the algorithms is similar,
computational performance can differ significantly and it
can affect to the final results. So the objective of this paper
is to perform a comparative analysis of two machine
learning algorithms namely, K Nearest neighbor,
classification and Logistic Regression. In this paper it
was considered a large dataset of 7981 data points and 112
features. Then the performance of the above mentioned
machine learning algorithms are examined. In this paper
the processing time and accuracy of the different machine
learning techniques are being estimated by considering the
collected data set, over a 60% for train and remaining
40% for testing. The paper is organized as follows. In
Section I, introduction and background analysis of the
research is included and in section II, problem statement.
In Section III, our application and data analyze Process,
the testing environment, and the Methodology of our
analysis are being described briefly. Section IV comprises
the results of two algorithms. Finally, the paper concludes
with a discussion of future directions for research by
eliminating the problems existing with the current
research methodology.
This paper examines the modelling and forecasting Murder crimes using Auto-Regressive Integrated Moving Average models (ARIMA). Twenty-nine years data obtained from Nigeria Information Resource Center were used to make predictions. Among the most effective approaches for analyzing time series data is the method propounded by Box and Jenkins, the Autoregressive Integrated Moving Average (ARIMA). The augmented Dickey-Fuller test for unit root was applied to the data set to investigate for Stationarity, the data set was found to be non-stationary hence transformed using first-order differencing to make them Stationary. The Stationarities were confirmed with time series plots. Statistical analysis was performed using GRETL software package from which, ARIMA (0, 1, 0) was found to be the best and adequate model for Murder crimes. Forecasted values suggest that Murder would slightly be on the increase.
Technology Content Analysis with Technometric Theory Approach to Improve Perf...Nooria Sukmaningtyas
Radiologic installation be facilitated with medical equipment for supporting of health services in
investigation of disease. There are 3 (three) criteria technology of equipment: investigation with
sophisticated equipment (CT scans single slice), investigation with a medium-sized enterprises equipment
(general x-ray 300 mA / 125 KV) and simple equipment (Portable Dental x-ray 8mA /70 KV). In view of
contribution to the Hospital, Radiologic installation from 2008 until 2012 has decreased, the data as
follows: The year 2008 was 6.8 percent; in 2009 was 4.3 percent; in 2010 was 2.5 percent; in 2011 was
2.3 percent; and in 2012 was 2.6 percent.By using approach of technometric theory, the study measures
the significant contribution of each component of technology that consists of aspects: Technoware,
Humanware, Inforware, Orgaware in Radiologic Installation, and also want to know about the
sophistication of the technology which is used in indicators Technology contribution coefficien (TCC), so
factors that affect experienced performance result can be known, where TCC are: TCC High Technology
TCC_tt =0,490 if T_tt= 0,387 H= 0,519 I= 0,538 O=0,534 TCC Middle technology TCC_tm=0,443 if
T_tm=0,258 H=0,519 I=0,538 O=0,534TCC Simple technology TCC_ts =0,398 if T_ts=0,168 H=0,519
I=0,538 O=0,534If the value of component technology (T,H,I,O) is less than TCC, its means that
Radiologic Installation Unit is in decreasing phase, a condition that cannot be left, need the directors’s
action immediately to formulate the right and fast policies to protect it from lost. The final result of study is a
gap almost everywhere from the three technology component Humanware = 0,519, Inforware = 0,538,
Orgaware = 0,534, but the gap between most components in technology aspects Technoware (0,387,
0,258, 0,168), that means that development strategy of Radiologic Installation unit be prioritized on
increasing aspects Technoware (rejuvenation medical equipment).
Data Exchange Design with SDMX Format for Interoperability Statistical DataNooria Sukmaningtyas
Today’s concept of Open Government Data (OGD) for openness, transparency and ease of
access of data owned by government agencies becomes increasingly important. This initiative emerges
from the demand of data usersforthe data belongs to the government agencies. The data services
providing an easy access, cheap, fast, and interoperability are needed by the users and becomes
important indicator performance for respective government agencies. Statistical Data and Metadata
Exchange (SDMX) is a new standard format in the data dissemination activities particularly in the
exchange of statistical data and metadata via Internet. In this respect SDMX support the implementation of
OGD project. This paper is on the technical design, development and implementation of data and
metadata exchange service of statistical data using SDMX format to support interoperability data through
web services. Three results are proposed: (i) framework for standardization of structure of statistical
publications data model with SDMX; (ii) design architecture of data sharing model; and (iii) web service
implementation of data and metadata exchange service using Service Oriented Analysis and Design
(SOAD) method. Implementation at Statistics Indonesia (BPS) is chosen as a case study to prove the
design concept. It is shown through quantitative assessment and black box testing that the design
achieves its objective.
More Related Content
Similar to An Improved AC-BM Algorithm for Monitoring Watch List
Combining Neural Network and Firefly Algorithm to Predict Stock Price in Tehr...Editor IJCATR
In the present research, prediction of stock price index in Tehran stock exchange by using neural
networks and firefly algorithm in chaotic behavior of price index stock exchange are studied. Two data sets
are selected for neural network input. Various breaks of index and macro economic factors are considered
as independent variables. Also, firefly algorithm is used to [redict price index in next week. The results of
research show that combining neural networks and firefly optimization algorithm has better performance
than neural network to predict the price index. In addition, acceptable value of error-sequre means for
network error in test data show that there are chaotic mevements in behaviour of price index.
Linear Regression Model Fitting and Implication to Self Similar Behavior Traf...IOSRjournaljce
We present a simple linear regression model fit in the direction of self-similarity behavior of internet user’s arrival data pattern. It has been reported that Internet traffic exhibits self-similarity. Motivated by this fact, real time internet users arrival patterns considered as traffic and the results carried out and proven that it has the self-similar nature by various Hurst index methods. The present study provides a mathematical model equation in terms linear regression as a tool to predict the arrival pattern of Internet users data at web centers. Numerical results, analysis discussed and presented here plays a significant role in improvement of the services and forecasting analysis of arrival protocols at web centers in the view of quality of service (QOS).
Using genetic algorithms and simulation as decision support in marketing stra...infopapers
F.Stoica, L.F.Cacovean, Using genetic algorithms and simulation as decision support in marketing strategies and long-term production planning, Proceedings of the 9th WSEAS International Conference on SIMULATION, MODELLING AND OPTIMIZATION (SMO ‘09), Budapest Tech, Hungary, September 3-5, ISSN: 1790-2769 ISBN:978-960-474-113-7, pp. 435-439, 2009
Search for a substring of characters using the theory of non-deterministic fi...journalBEEI
The paper proposed an algorithm which purpose is searching for a substring of characters in a string. Principle of its operation is based on the theory of non-deterministic finite automata and vector-character architecture. It is able to provide the linear computational complexity of searching for a substring depending on the length of the searched string measured in the number of operations with hyperdimensional vectors when repeatedly searching for different strings in a target line. None of the existing algorithms has such a low level of computational complexity. The disadvantages of the proposed algorithm are the fact that the existing hardware implementations of computing systems for performing operations with hyperdimensional vectors require a large number of machine instructions, which reduces the gain from this algorithm. Despite this, in the future, it is possible to create a hardware implementation that can ensure the execution of operations with hyperdimensional vectors in one cycle, which will allow the proposed algorithm to be applied in practice.
Simulation of the Linear Boltzmann Transport Equation in Modelling Of Photon ...IOSR Journals
A beam data modelling algorithm was developed by solving the linear Boltzmann Transport Equation (BTE). The Linear Boltzmann Transport Equation (LBTE) is a form of the Boltzmann transport equation that assumes that radiation particles only interact with the matter as they are passing through matter and not with each other. This condition is only valid when there is no external magnetic field. The numerical method proposed by Lewis et al., [9] was used to solve the LBTE. A programming code was computed for the LBTE and run on CMS XiO treatment planning system to generate beam data, the generated beam data were compared to experimentally determined data. The calculated percentage depth dose (PDD) completely overlap the measured PDDs for the small field sizes while there is a shift in the PDD tail for large field size. However the shift is negligible. For the wedge PDDs, the shift between the measured PDDs and the calculated occurs at the Dmax region and it increases with increase in field size. The calculated wedge profiles have a slight shift at the shoulder compared to the measured ones and this decreases with increase in field size, unlike the PDDs. There is also a slight shift between calculated in-plane profiles and measured ones. There is a good agreement between the measured beam data and the calculated ones using the algorithm. This algorithm can be implemented as an in-house algorithm for beam data modelling and also as an independent quality assurance tool for checking the accuracy of clinical TPS algorithms with regards to beam data modelling during quality assurance and TPS commissioning tests.
Reduced Merge_FSM Pattern Matching Algorithm for Network Intrusion Detectionidescitation
Pattern matching is a significant issue in intrusion detection systems (IDS), as it
is required to identify and restrict certain virus patterns by matching them with the
patterns present in the database. The performance of an Intrusion Detection System is
dependent on two metrics that is throughput and the total number of patterns that can fit
on a device. Many hardware approaches are proposed to accelerate pattern matching.
Among hardware approaches, memory based architecture has attracted a lot of attention
because of its easy reconfiguration and scalability. In memory architecture approach. First,
the virus string patterns are compiled to a finite-state machine (FSM) whose output is
asserted when any substring of input strings matches the string patterns. The speed of
comparisons and memory required to store virus string patterns is evaluated through the
number of state transitions made. In this paper, a new pattern-matching algorithm
‘Reduced Merge_FSM’ is proposed which significantly reduce the memory requirement
and provides faster matching, by reducing the state transitions, than that of existing Finite
State Machine (FSM) based approaches. This reduction in states results in optimization of
memory and also the comparison time. To prove the efficiency of the proposed algorithm,
it is compared through experimentation with the existing AC-Algorithm and Merge_FSM.
A Survey of String Matching AlgorithmsIJERA Editor
The concept of string matching algorithms are playing an important role of string algorithms in finding a place where one or several strings (patterns) are found in a large body of text (e.g., data streaming, a sentence, a paragraph, a book, etc.). Its application covers a wide range, including intrusion detection Systems (IDS) in computer networks, applications in bioinformatics, detecting plagiarism, information security, pattern recognition, document matching and text mining. In this paper we present a short survey for well-known and recent updated and hybrid string matching algorithms. These algorithms can be divided into two major categories, known as exact string matching and approximate string matching. The string matching classification criteria was selected to highlight important features of matching strategies, in order to identify challenges and vulnerabilities.
The railway capacity optimization problem deals with the maximization of the number of trains running on
a given network per unit time. In this study, we frame this problem as a typical asymmetrical Travelling
Salesman Problem (ATSP), with the ATSP nodes representing the train arrival /departure events and the
ATSP total cost representing the total time-interval of the schedule. The application problem is then
optimized using the standard Ant Colony Optimization (ACO) algorithm. The simulation experiments
validate the formulation of the railway capacity problem as an ATSP and the ACO algorithm produces
optimal solutions superior to those produced by the domain experts.
Congestion Control in Wireless Sensor Networks Using Genetic AlgorithmEditor IJCATR
Sensor network consists of a large number of small nods, strongly interacting with the physical environment, takes
environmental data through sensors, and reacts after processing on information. Wireless network technologies are widely used in most
applications. As wireless sensor networks have many activities in the field of information transmission, network congestion cannot be
thus avoided. So it seems necessary that some new methods can control congestion and use existing resources for providing better traffic
demands. Congestion increases packet loss and retransmission of removed packets and also wastes of energy. In this paper, a novel
method is presented for congestion control in wireless sensor networks using genetic algorithm. The results of simulation show that the
proposed method, in comparison with the algorithm LEACH, can significantly improve congestion control at high speeds.
The optimization of running queries in relational databases using ant colony ...ijdms
The issue of optimizing queries is a cost-sensitive
process and with respect to the number of associat
ed
tables in a query, its number of permutations grows
exponentially. On one hand, in comparison with oth
er
operators in relational database, join operator is
the most difficult and complicated one in terms of
optimization for reducing its runtime. Accordingly,
various algorithms have so far been proposed to so
lve
this problem. On the other hand, the success of any
database management system (DBMS) means
exploiting the query model. In the current paper, t
he heuristic ant algorithm has been proposed to sol
ve this
problem and improve the runtime of join operation.
Experiments and observed results reveal the efficie
ncy
of this algorithm compared to its similar algorithm
s.
Performance Comparision of Machine Learning AlgorithmsDinusha Dilanka
In this paper Compare the performance of two
classification algorithm. I t is useful to differentiate
algorithms based on computational performance rather
than classification accuracy alone. As although
classification accuracy between the algorithms is similar,
computational performance can differ significantly and it
can affect to the final results. So the objective of this paper
is to perform a comparative analysis of two machine
learning algorithms namely, K Nearest neighbor,
classification and Logistic Regression. In this paper it
was considered a large dataset of 7981 data points and 112
features. Then the performance of the above mentioned
machine learning algorithms are examined. In this paper
the processing time and accuracy of the different machine
learning techniques are being estimated by considering the
collected data set, over a 60% for train and remaining
40% for testing. The paper is organized as follows. In
Section I, introduction and background analysis of the
research is included and in section II, problem statement.
In Section III, our application and data analyze Process,
the testing environment, and the Methodology of our
analysis are being described briefly. Section IV comprises
the results of two algorithms. Finally, the paper concludes
with a discussion of future directions for research by
eliminating the problems existing with the current
research methodology.
This paper examines the modelling and forecasting Murder crimes using Auto-Regressive Integrated Moving Average models (ARIMA). Twenty-nine years data obtained from Nigeria Information Resource Center were used to make predictions. Among the most effective approaches for analyzing time series data is the method propounded by Box and Jenkins, the Autoregressive Integrated Moving Average (ARIMA). The augmented Dickey-Fuller test for unit root was applied to the data set to investigate for Stationarity, the data set was found to be non-stationary hence transformed using first-order differencing to make them Stationary. The Stationarities were confirmed with time series plots. Statistical analysis was performed using GRETL software package from which, ARIMA (0, 1, 0) was found to be the best and adequate model for Murder crimes. Forecasted values suggest that Murder would slightly be on the increase.
Technology Content Analysis with Technometric Theory Approach to Improve Perf...Nooria Sukmaningtyas
Radiologic installation be facilitated with medical equipment for supporting of health services in
investigation of disease. There are 3 (three) criteria technology of equipment: investigation with
sophisticated equipment (CT scans single slice), investigation with a medium-sized enterprises equipment
(general x-ray 300 mA / 125 KV) and simple equipment (Portable Dental x-ray 8mA /70 KV). In view of
contribution to the Hospital, Radiologic installation from 2008 until 2012 has decreased, the data as
follows: The year 2008 was 6.8 percent; in 2009 was 4.3 percent; in 2010 was 2.5 percent; in 2011 was
2.3 percent; and in 2012 was 2.6 percent.By using approach of technometric theory, the study measures
the significant contribution of each component of technology that consists of aspects: Technoware,
Humanware, Inforware, Orgaware in Radiologic Installation, and also want to know about the
sophistication of the technology which is used in indicators Technology contribution coefficien (TCC), so
factors that affect experienced performance result can be known, where TCC are: TCC High Technology
TCC_tt =0,490 if T_tt= 0,387 H= 0,519 I= 0,538 O=0,534 TCC Middle technology TCC_tm=0,443 if
T_tm=0,258 H=0,519 I=0,538 O=0,534TCC Simple technology TCC_ts =0,398 if T_ts=0,168 H=0,519
I=0,538 O=0,534If the value of component technology (T,H,I,O) is less than TCC, its means that
Radiologic Installation Unit is in decreasing phase, a condition that cannot be left, need the directors’s
action immediately to formulate the right and fast policies to protect it from lost. The final result of study is a
gap almost everywhere from the three technology component Humanware = 0,519, Inforware = 0,538,
Orgaware = 0,534, but the gap between most components in technology aspects Technoware (0,387,
0,258, 0,168), that means that development strategy of Radiologic Installation unit be prioritized on
increasing aspects Technoware (rejuvenation medical equipment).
Data Exchange Design with SDMX Format for Interoperability Statistical DataNooria Sukmaningtyas
Today’s concept of Open Government Data (OGD) for openness, transparency and ease of
access of data owned by government agencies becomes increasingly important. This initiative emerges
from the demand of data usersforthe data belongs to the government agencies. The data services
providing an easy access, cheap, fast, and interoperability are needed by the users and becomes
important indicator performance for respective government agencies. Statistical Data and Metadata
Exchange (SDMX) is a new standard format in the data dissemination activities particularly in the
exchange of statistical data and metadata via Internet. In this respect SDMX support the implementation of
OGD project. This paper is on the technical design, development and implementation of data and
metadata exchange service of statistical data using SDMX format to support interoperability data through
web services. Three results are proposed: (i) framework for standardization of structure of statistical
publications data model with SDMX; (ii) design architecture of data sharing model; and (iii) web service
implementation of data and metadata exchange service using Service Oriented Analysis and Design
(SOAD) method. Implementation at Statistics Indonesia (BPS) is chosen as a case study to prove the
design concept. It is shown through quantitative assessment and black box testing that the design
achieves its objective.
The knowledge management is a model involving the information system in the knowledge
processing. “Tim Penyelesaian Kerugian Negara” (TPKN) is one of sources of information related to the
state loss settlement, so it needs the development of knowledge management system on the state loss
settlement to ease the users when looking for the references of knowledge as completely as possible,
accurately, and quickly. This research aims to develop the system of knowledge management on the state
loss in LAPAN (SIMAPKLA). The used research methodology is Knowledge Management System Life
Cycle (KMSLC). The tacit, explicit knowledge is taken from the experts and it is stored in the Knowledge
Base (KB). The design model uses the approach with the orientation of object and implementation with Yii
Framework and blackbox testing. The menu on this system includes home, about us, dictionary, news,
meeting schedulles, knowledge about state loss, e-document, progress, forum, and contact us. Based on a
series of tests, in the aspect of functionality, this system is suitable and useful to share knowledge and
know the development of state loss settlement.
Automatic Extraction of Diaphragm Motion and Respiratory Pattern from Time-se...Nooria Sukmaningtyas
Thoracic time-sequential MRI can be used to assess diaphragm motion pattern without exposing
radiation to subject. Clinicians may employ the motion to evaluate the severeness of chronic obstructive
pulmonary disease (COPD). This study proposed a novel method of diaphragm motion extraction method
on time-sequential thoracic MRI in sagittal plane. Otsu’s threshold and active contour algorithm are used to
obtain diaphragm boundary. An automatic diaphragm motion tracking and extraction of respiratory pattern
are also performed based on the diaphragm boundary. A total of 1200 frames time-sequential MRI in
sagittal plane was obtained for total of 15 subjects (8 healthy volunteers and 7 COPD patients). The
proposed method successfully extracts diaphragm motion and respiratory patterns for both healthy
volunteers and COPD patients.
A dual-frequency microstrip patch antennas has been presented and used for 802.11WLAN
applications. The antennas had been designed, simulated and parametrically studied in CST Microwave
studio. By introducing u-slot, dual-band operation with its operating mode centered at frequency 2.4GHz,
3.65GHz and 5.2GHz had been obtained. The gain and directivity had been improved by adjusting the
parameters of the antennas. The gain of the proposed designs was 6.019dBi, 4.04dBi and 6.22dBi and
directivity was 6.02dBi, 4.05dBi and 6.22dBi at resonant frequencies 2.4GHz, 3.6GHz and 5.2GHz
respectively. The patch antennas had been proposed to be used in portable devices that require
miniaturized constituent parts.
The Detection of Straight and Slant Wood Fiber through Slop Angle Fiber FeatureNooria Sukmaningtyas
Quality control is one of important process that can not be avoided in industry. Image processing
technique is required to distinguish the quality of wood. If it can be done automatically by the computer, it
will be very helpful. This paper discusses the detection of straight and slant wood fiber to distinguish its
quality. This paper proposes an algorithm by using only two features i.e. mean (average value of slop
angle fiber) and maximumangle (the maximum value of slop angle fiber). Then the classification method is
used by tresholding. The result shows the performance is achieved on accuracy 79.2%
Active Infrared Night Vision System of Agricultural VehiclesNooria Sukmaningtyas
Active infrared night vision system was significant for night driving and it has been greatly used on
limousine car. Design active infrared night vision system for agricultural vehicles greatly improved the night
vision of them and it was an inevitable trend. Comparing parameters of various night vision systems and
designing active infrared night vision system of agricultural vehicles was significant for improving active
security of agricultural vehicles working at nighttime. By analyzing the infrared night vision system basic
parameters determined the structure form and basic parameters, calculated the infrared light wave width
and emission power to choose each components, designed active infrared night vision system’s structure
and determined parameters of agricultural vehicles.
Robot Three Dimensional Space Path-planning Applying the Improved Ant Colony ...Nooria Sukmaningtyas
To make robot avoid obstacles in 3D space, the Pheromone of Ant Colony Optimization (ACO) in
Fuzzy Control Updating is put forward, the Pheromone Updating value varies with The number of iterations
and the path-planning length by each ant . the improved Transition Probability Function is also proposed,
which makes more sense for each ant choosing next feasible point .This paper firstly, describes the Robot
Workspace Modeling and its path-planning basic method, which is followed by introducing the improved
designing of the Transition Probability Function and the method of Pheromone Fuzzy Control Updating of
ACO in detail. At the same time, the comparison of optimization between the pre-improved ACO and the
improved ACO is made. The simulation result verifies that the improved ACO is feasible and available.
Research on a Kind of PLC Based Fuzzy-PID Controller with Adjustable FactorNooria Sukmaningtyas
A kind of fuzzy-PID controller with adjustable factor is designed in this paper. Scale factor’s selfadjust
will come true. Fuzzy control algorithm is finished in STEP7 software, and then downloaded in S7-
300 PLC. WinCC software will be used to control the change-trend in real time. Data communication
between S7-300 PLC and WinCC is achieved by MPI. The research shows that this fuzzy-PID controller
has better robust capability and stability. It’s an effective method in controlling complex long time-varying
delay systems.
This paper proposed a nonlinear robust control for spacecraft attitude based on passivity and
disturbance suppression vector. The spacecraft model was described using quaternion. The control law
introduced the suppression vector of external disturbances and had no information related to the system
parameters. The desired performance of spacecraft attitude control could be achieved using the designed
control law. And stability conditions of the nonlinear robust control for spacecraft attitude were given. The
stability could be proved by applying Lyapunov approach. The verification of the proposed attitude control
method was performed through a series of simulations. The numerical results showed the effectiveness of
the proposed control method in controlling the spacecraft attitude in the presence of external disturbances.
The main benefit of the proposed attitude control method does not need angular velocity measurement
and has its robustness against model uncertainties and external disturbances.
Remote Monitoring System for Communication Base Based on Short MessageNooria Sukmaningtyas
The automatic monitoring system of communication base which is an important means to realize
modernization of mobile communication base station management. In this paper, we implement a
monitoring system for communication base with three essential functions which are telemetry, remote
control and communication. In this system, data acquisition unit, data transmit unit and monitoring centre
unit are combined to form this monitoring system. The system can check the communication base status
anytime through GSM SMS (short message service), and can send predefined command to perform
remote data collection and monitoring in the special conditions. It is suitable especially for the alarm of
unusual situation, the monitoring of environmental information and entrance guard information. The paper,
firstly, proposes the architecture of the monitoring system; secondly, proposes the terminal of monitoring
system. The data collection terminal is studied and designed, including hardware design based on
embedded system and software design. Finally, presents implmentation and results. The monitoring
system can improve the integrity, reliability, flexibility and intellectuality of monitoring system. The system
with modular structure, which is low-cost, fitter and easier to move and operate, can be expanded
according to practical need and is reliable and effective through field test.
Tele-Robotic Assisted Dental Implant Surgery with Virtual Force FeedbackNooria Sukmaningtyas
The dental implant surgical applications full of risk because of the complex anatomical
architecture of craio-maxillofacial area. Therefore, the surgeons move towards computer-aided planning
for surgeries and then implementation using robotic assisted tele-operated techniques. This study divided
into four main parts. The first part is developed by computer-aided surgical planning by image modalities.
The second part is based on Virtual Surgical Environment through virtual force feedback haptic device.
The third part is implemented the experimental surgery by integrating the prototype surgical manipulator
with the haptic device poses using inverse kinematics method. The fourth part based on monitoring the
robotic manipulator pose by using image guided navigation system to calculate the position error of the
surgical manipulator. Thus, this tele-robotic system is able to comprehend the sense of complete practice,
improve skills and gain experience of the surgeon during the surgery. Finally, the experimental outcomes
show in satisfactory boundaries.
This paper proposes an adaptation mechanism based on adaptation planning graph for servicebased
business processes. First, a three-layer representation model of service-based business process is
introduced. Second, control-flow patterns of tasks, goal, logic model of service-based business process
and adaptation planning graph are introduced to enforce reliability of composite web services at run-time.
Finally, a simulation example of adaptation in service-based business processes is given. Simulations
prove that this approach can efficiently guarantee the reliability of composite services at run-time.
Review on Islanding Detection Methods for Photovoltaic InverterNooria Sukmaningtyas
Solar power generation, which is regarded as an ideal environment-friendly manner for power
generation, is getting more and more attention. When photovoltaic inverter is connected to the grid, the
island effect is a special problem to confront. This paper briefly analyzes the island effects and makes a
summary of both domestic and external research progress concerning islanding detection methods; the
islanding detection methods can be divided into two classes: one is grid-side detection; the other is local
detection. The local detection is generally divided into passive methods and active methods. The theory of
advantages and disadvantages of those methods are briefly introduced in this paper. At the end of the
paper, to deal with the disadvantages of those methods that are mentioned, it proposes the research
direction for deeper study of islanding detection methods.
Stabilizing Planar Inverted Pendulum System Based on Fuzzy Nine-point ControllerNooria Sukmaningtyas
In order to stabilize planar inverted pendulum, after analyzing the physical characteristics of the
planar inverted pendulum system, a pendulum nine-point controller and a car nine-point controller for Xaxis
and Y-axis were designed respectively. Then a fuzzy coordinator was designed using the fuzzy
control theory based on the priority of those two controllers, and the priority level of the pendulum is higher
than the car. Thus, the control tasks of each controller in each axis were harmonized successfully. The
designed control strategy did not depend on mathematical model of the system; it depended on the control
experience of people or the control experts. The compared experiments showed that the control strategy
was easy and effective, what was’s more; it had a very good robust feature.
Gross Error Elimination Based on the Polynomial Least Square Method in Integr...Nooria Sukmaningtyas
The measurement data of parameter in the electrical equipment contains many noises in subway
integrated monitoring system. To eliminate the impact of gross error in the measurement data, a
polynomial least square curve fitting algorithm is used in this paper. Based on the Rajda criterion, the
algorithm gives the variance estimation of the noises, and then uses dynamic threshold to detect and
replace the measurement data with gross error by statistical estimation. Finally, a data processing
procedure has been presented to deal with the gross error. The practical application indicates that the
proposed algorithm can effectively eliminate the gross error in many types of measurement signals so as
to ensure the reliability of the monitoring system.
Design on the Time-domain Airborne Electromagnetic Weak Signal Data Acquisiti...Nooria Sukmaningtyas
According to principle of transient electromagnetic method as well as its signal characteristics,
this paper designed and implemented a time-domain airborne electromagnetic weak signal data
acquisition system. With the use of the floating-point amplification technology, the system amplifies the
weak transient electromagnetic signal dynamically. CPLD and DSP were used as the decoding control
circuit and the main controller for processing the sampled data, respectively. The transient electromagnetic
signal acquisition system, which was designed with a dynamic range up to 144dB and a sampling rate up
to 100 kHz, meets the requirements of the high sampling rate with high precision and it has been applied in
the time-domain fixed-wing airborne electromagnetic mineral exploration.
INS/GPS integrated navigation system is studied in this paper for the hypersonic UAV in order to
satisfy the precise guidance requirements of hypersonic UAV and in response to the defects while the
inertial navigation system (INS) and the global positioning system (GPS) are being applied separately. The
information of UAV including position, velocity and attitude can be obtained by using INS and GPS
respectively after generating a reference trajectory. The corresponding errors of two navigation systems
can be obtained through comparing the navigation information of the above two guidance systems.
Kalman filter is designed to estimate the navigation errors and then the navigation information of INS are
corrected. The non-equivalence relationship between the platform misalignment angle and attitude error
angle are considered so that the navigation accuracy is further improved. The Simulink simulation results
show that INS/GPS integrated navigation system can help to achieve higher accuracy and better antiinterference
ability than INS navigation system and this system can also satisfy the navigation accuracy
requirements of hypersonic UAV.
Research on Space Target Recognition Algorithm Based on Empirical Mode Decomp...Nooria Sukmaningtyas
The space target recognition algorithm, which is based on the time series of radar cross section
(RCS), is proposed in this paper to solve the problems of space target recognition in the active radar
system. In the algorithm, EMD method is applied for the first time to extract the eigen of RCS time series.
The normalized instantaneous frequencies of high-frequency intrinsic mode functions obtained by EMD are
used as the eigen values for the recognition, and an effective target recognition criterion is established.
The effectiveness and the stability of the algorithm are verified by both simulation data and real data. In
addition, the algorithm could reduce the estimation bias of RCS caused by inaccurate evaluation, and it is
of great significance in promoting the target recognition ability of narrow-band radar in practice.
Design of a Subsequent Water Detection System Controlled by the MicrocontrollerNooria Sukmaningtyas
This article instructs the subsequent water detection system design and implementation of sanitary
ware. This system used C8051f040 Microcontroller as the main control module and communication
module which controlled the operation of the entire system, touch screen as a position machine,and
made use of metal probing technique and weighing sensor technology to realize data test, collection,
display, storage and export. At last, the experimental results showed that this system meets the expected
requirement and can measure the subsequent water more accurately.
Water scarcity is the lack of fresh water resources to meet the standard water demand. There are two type of water scarcity. One is physical. The other is economic water scarcity.
COLLEGE BUS MANAGEMENT SYSTEM PROJECT REPORT.pdfKamal Acharya
The College Bus Management system is completely developed by Visual Basic .NET Version. The application is connect with most secured database language MS SQL Server. The application is develop by using best combination of front-end and back-end languages. The application is totally design like flat user interface. This flat user interface is more attractive user interface in 2017. The application is gives more important to the system functionality. The application is to manage the student’s details, driver’s details, bus details, bus route details, bus fees details and more. The application has only one unit for admin. The admin can manage the entire application. The admin can login into the application by using username and password of the admin. The application is develop for big and small colleges. It is more user friendly for non-computer person. Even they can easily learn how to manage the application within hours. The application is more secure by the admin. The system will give an effective output for the VB.Net and SQL Server given as input to the system. The compiled java program given as input to the system, after scanning the program will generate different reports. The application generates the report for users. The admin can view and download the report of the data. The application deliver the excel format reports. Because, excel formatted reports is very easy to understand the income and expense of the college bus. This application is mainly develop for windows operating system users. In 2017, 73% of people enterprises are using windows operating system. So the application will easily install for all the windows operating system users. The application-developed size is very low. The application consumes very low space in disk. Therefore, the user can allocate very minimum local disk space for this application.
Automobile Management System Project Report.pdfKamal Acharya
The proposed project is developed to manage the automobile in the automobile dealer company. The main module in this project is login, automobile management, customer management, sales, complaints and reports. The first module is the login. The automobile showroom owner should login to the project for usage. The username and password are verified and if it is correct, next form opens. If the username and password are not correct, it shows the error message.
When a customer search for a automobile, if the automobile is available, they will be taken to a page that shows the details of the automobile including automobile name, automobile ID, quantity, price etc. “Automobile Management System” is useful for maintaining automobiles, customers effectively and hence helps for establishing good relation between customer and automobile organization. It contains various customized modules for effectively maintaining automobiles and stock information accurately and safely.
When the automobile is sold to the customer, stock will be reduced automatically. When a new purchase is made, stock will be increased automatically. While selecting automobiles for sale, the proposed software will automatically check for total number of available stock of that particular item, if the total stock of that particular item is less than 5, software will notify the user to purchase the particular item.
Also when the user tries to sale items which are not in stock, the system will prompt the user that the stock is not enough. Customers of this system can search for a automobile; can purchase a automobile easily by selecting fast. On the other hand the stock of automobiles can be maintained perfectly by the automobile shop manager overcoming the drawbacks of existing system.
NO1 Uk best vashikaran specialist in delhi vashikaran baba near me online vas...Amil Baba Dawood bangali
Contact with Dawood Bhai Just call on +92322-6382012 and we'll help you. We'll solve all your problems within 12 to 24 hours and with 101% guarantee and with astrology systematic. If you want to take any personal or professional advice then also you can call us on +92322-6382012 , ONLINE LOVE PROBLEM & Other all types of Daily Life Problem's.Then CALL or WHATSAPP us on +92322-6382012 and Get all these problems solutions here by Amil Baba DAWOOD BANGALI
#vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore#blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #blackmagicforlove #blackmagicformarriage #aamilbaba #kalajadu #kalailam #taweez #wazifaexpert #jadumantar #vashikaranspecialist #astrologer #palmistry #amliyaat #taweez #manpasandshadi #horoscope #spiritual #lovelife #lovespell #marriagespell#aamilbabainpakistan #amilbabainkarachi #powerfullblackmagicspell #kalajadumantarspecialist #realamilbaba #AmilbabainPakistan #astrologerincanada #astrologerindubai #lovespellsmaster #kalajaduspecialist #lovespellsthatwork #aamilbabainlahore #Amilbabainuk #amilbabainspain #amilbabaindubai #Amilbabainnorway #amilbabainkrachi #amilbabainlahore #amilbabaingujranwalan #amilbabainislamabad
Explore the innovative world of trenchless pipe repair with our comprehensive guide, "The Benefits and Techniques of Trenchless Pipe Repair." This document delves into the modern methods of repairing underground pipes without the need for extensive excavation, highlighting the numerous advantages and the latest techniques used in the industry.
Learn about the cost savings, reduced environmental impact, and minimal disruption associated with trenchless technology. Discover detailed explanations of popular techniques such as pipe bursting, cured-in-place pipe (CIPP) lining, and directional drilling. Understand how these methods can be applied to various types of infrastructure, from residential plumbing to large-scale municipal systems.
Ideal for homeowners, contractors, engineers, and anyone interested in modern plumbing solutions, this guide provides valuable insights into why trenchless pipe repair is becoming the preferred choice for pipe rehabilitation. Stay informed about the latest advancements and best practices in the field.
Event Management System Vb Net Project Report.pdfKamal Acharya
In present era, the scopes of information technology growing with a very fast .We do not see any are untouched from this industry. The scope of information technology has become wider includes: Business and industry. Household Business, Communication, Education, Entertainment, Science, Medicine, Engineering, Distance Learning, Weather Forecasting. Carrier Searching and so on.
My project named “Event Management System” is software that store and maintained all events coordinated in college. It also helpful to print related reports. My project will help to record the events coordinated by faculties with their Name, Event subject, date & details in an efficient & effective ways.
In my system we have to make a system by which a user can record all events coordinated by a particular faculty. In our proposed system some more featured are added which differs it from the existing system such as security.
2. ISSN: 2302-4046
TELKOMNIKA Vol. 12, No. 1, January 2014: 379 – 387
380
2. Watch List and Matching Process
Watch list is a list about the staffs, organizations and classes of business who may lead
financial institutions to face the risk and the financial institutions need to pay close attention to.
The information of watch list comes from the international organization of anti-money laundering
(such as Financial Action Task Force on Money Laundering, Basel Committee on Banking
Supervision, Egmont Group, International Criminal Police Organization and so on), public and
media, the report of the financial internal monitoring system, the risk information of government
departments, while some professional institutes also collect the related information and release
it regularly. It is a legal duty of financial institutes to implement the on-line monitoring of watch
list. Figure 1 gives an example of watch list comes from the Bank of England, which shows
some important persons of Taliban. In addition, the watch list also includes senior officials of
government departments, corrupt officials, and tax evasion personnel and so on.
Figure 1. The watch list of Bank of England
The matching process of watch list is a matching between the watch list and the
database of account holders and clients’ transaction. Usually this process costs lots of time
because there are plenty of personal properties of the clients requiring matched and the
database is keeping expanding. Consequently, decreasing the consumed time of the matching
process is especially important to financial institutes when they are doing normal businesses
and the on-line monitoring of money laundering.
The watch list that this paper discusses is the basic data of the system monitor of
finance. Because of the large system of finance, a lot of subsystems will use the personal
information to confirm some businesses, such as opening an account, transaction, transfer and
so on. Because of the large volume of business, it is easy to cover the facts of crime. The
system of watch list achieves the goal of anti-money laundering by paying close attention to the
staffs that are in the high risk. When a person, who is in the watch list, opens an account or
trades with the personal information in the system of finance, the system monitor will sound the
alarm. Like this, the suspicious criminals will be discovered in time. Obviously, it simplifies the
process of anti-money laundering and it is convenient to supervise the money laundering.
The watch list mainly involves the data module of personal information. The systems
of account holders and clients’ transaction have close relations with it. When the operators help
clients open accounts or trade, the behaviors will involve the personal information. So the watch
list that this paper discusses is mainly about the systems of account holders and clients’
3. TELKOMNIKA ISSN: 2302-4046
An Improved AC-BM Algorithm for Monitoring Watch List (Mo Yiwen)
381
transaction. Figure 2 shows the structure of matching process of watch list. Supervise the
money laundering by matching the information of the watch list. Judge the person whether is
suspicious by matching the client’s personal information with the watch list.Figure 1. Effects of
selecting different switching under dynamic condition
Figure 2. The structure of matching process of watch list
3. Study of Matching Algorithm
According to the requirement of filtering of the watch list’s content, this paper mainly
discusses the matching algorithm. On the basis of the number of pattern string, it can be
classified as algorithm of matching single pattern and algorithm of matching multiple patterns.
The former one matches only one string every time, while the latter one matches several strings
every time. The algorithm of matching single-pattern is represented by the BM algorithm; on the
other hand, the algorithm of matching multiple patterns is represented by the AC algorithm.
We assume P is a string with size m, P[0…m-1], then the P[i…j] is a substring of P,
P[i…j] is a prefix of P, and P[i…m-1] is a postfix of P. (0≤i≤j≤m-1).
Let T is a text string with size n and P is a pattern string. The characters of the P and
the T belong to a limited character set Σ; Therefore, the goal of the matching is to find out the
equal substring between P and T.
3.1. BM Algorithm
BM algorithm (Boyer-Moore) [1] is a kind of matching algorithm based on postfix.
Matching backwards from right side to left side is a distinctive characteristic of BM algorithm.
When there is a character that fails to match in text string T, T[i] =c, it will skip in the text string
to speed up the pattern string moving. If c is a string in P, finding out the rightmost c in P and
then moving P to make T[i] align it; if c isn’t a string in P, moving P to make P[0] align T[i+1].
The fundamental of BM algorithm: matching one character at a certain distance in T,
and then determining whether skip to the right side and the distance of skipping according to the
character, which is matched at present, whether appears in P or appears in which location. If it
doesn’t skip, it will compare with P from the right to the left in the present location. Otherwise it
will skip to the next location of P according to the skipping distance that has been computed in
advance.
The algorithm also includes two parts, preprocessing and scanning. In the part of
preprocessing, it just consider the pattern string p and the set of strings Σ. We introduce a
function of shift (c). It shows the situation that every character c appears in pattern string P, and
the distance that the pattern string moves. The function value of shift is also saved in an array.
The following is a method of computing the array of shift. If c appears in the pattern string P, find
out the location of c in the rightmost of P, and the location is index. The value of function is the
distance between the c of rightmost and the rightmost of P, it is m-1-index; if c doesn’t appear in
the pattern string P, the value is the length of P.
Supervise
the watch
list
The
process of
opening
account
The
process of
transaction
The data
set of
watch list
Supervise
money
laundering
4. ISSN: 2302-4046
TELKOMNIKA Vol. 12, No. 1, January 2014: 379 – 387
382
For example, Σ={a,b,c,d} and the pattern string P = abacab, we can compute it the
Shift(a)=1, , ,Shift(b)=0 Shift(c)=2 Shift(d)=6. And the time complexity of shift is O(m+|Σ|).
Although the average efficiency of BM algorithm is high, it doesn’t performance well in
the worst case. The complexity of the worst case is O(mn), such as, a text string T=aaa…a, a
pattern string P=baa…a.
BM algorithm is designed as a kind of algorithm that matches the single pattern string
in text. Among the algorithms of matching single-pattern, BM algorithm is proved to performance
best. However, when there are various kinds of key words to match in the filtering and matching
of content, the BM algorithm has to match every kind of pattern. The time complexity of the BM
algorithm is O (n) when matching the single pattern, but it is O (kn) when matching the multiple
patterns.
3.2. AC Algorithm
AC algorithm (Aho-Corasick) [2] is a kind of algorithm that based on finite state
machine. It preprocesses the set of pattern strings to form a state machine in a tree before start
matching. It just scans the text string T once, and then it can find out the all patterns that match
with T in P.
The algorithm also includes two parts, preprocessing and scanning. It generates three
functions: the transition function: goto, failure function: failure and output function: output. The
following is the matching process of AC algorithm: starting from state zero, picking up a
character from the text string, and then going to the next state with goto function and the failure
function. When the output function of some state is not a null, it means that it successes to find
out the pattern string.
It structures the finite state machine in the part of preprocessing, and the time
complexity of structuring transition function is O(M), M is the total length of all patterns. The time
complexity of structuring the failure function is O (M), too. In the part of scanning, it scans every
character of the text T on the basis of the finite state machine that has structured before. Every
character just has one transition function, and the time complexity of scanning is O (n). So the
total time complexity of the algorithm that based on the finite state machine is O (M+n). The
time complexity is related to the length of text and pattern, but is not related to the content of
text and pattern. It means that the average time of scanning in the best case or the worst case
is the same, O(M+n).
The disadvantage of AC algorithm is that the demand of space is large. Too many
matching patterns will occupy plenty of space; even maybe make the system crash. So AC
algorithm can satisfy the demand and performances well in the case of a few patterns.
However, it doesn’t skip when it scans the text. It inputs the text in order, which means it can’t
skip the unnecessary comparison. Obviously AC algorithm is not the best matching algorithm in
practical process of matching.
3.3. An Improved AC-BM algorithm
3.3.1. AC-BM Algorithm
AC-BM algorithm [3] combines the AC algorithm and BM algorithm. It includes two
parts, preprocessing and scanning. The part of preprocessing structures a finite state machine
likes AC algorithm. The part of scanning based on the idea of skipping likes BM algorithm, and
matches the text string with the finite state machine. So it improves the speed of AC algorithm
efficiently in the part of scanning.
3.3.2. An Improved AC-BM Algorithm
On basis of the traditional AC-BM algorithm, this paper proposes an improved AC-BM
algorithm, a matching algorithm of subsection. Figure 3 shows the flow chart of the algorithm.
a. Let P align the left side of T, and start matching with BM algorithm. If matching
successfully once, we call it match completely, and then return the result. When Pi≠Ti, pick up
the Pi as L1, so L1={P1…Pi }.
b. Continue to match Pi+1 and make subsection when they are inequality.
c. Do step a and step b repeatedly, we get L1,L2…Lk.
d. Divide T into t1,t2, …tm, and { t1,t2, …tm }∈Σ.
e. Let { L1,L2…Lk } match { t1,t2, …tm } with the technology of the multi-thread AC
matching, and then return the result.
5. TELKOMNIKA ISSN: 2302-4046
An Improved AC-BM Algorithm for Monitoring Watch List (Mo Yiwen)
383
Figure 3. The flow chart of the improved algorithm
The improved AC-BM algorithm above uses the technology of subsection, so the length
of string can’t affect it when it is matching the single pattern. However the length of the string it
is, it affects the speed of matching less. In the matching of multiple patterns, the improved AC-
BM algorithm is not only able to match multiple patterns, which likes AC algorithm, but also skip
the unnecessary comparison, which likes BM algorithm. In addition, it improves the traditional
AC-BM algorithm and the improvement makes it better than the traditional one in the speed of
matching.
4. Experiment
In order to test the efficiency of the algorithms we mentioned above, we extract the
100MB data from the informational database of clients. And we extract randomly the pattern
strings from the database of watch list to test the algorithms. The system configuration is
2.4GHz Intel CPU and 2G RAM. We generate two sets of experimental data, and the size of the
data is 100MB. The first data set has no repetitive strings, and the second one has plenty of
repetitive strings. The length of pattern strings includes 10, 20, 30, 40, 50, 100, 500, 800, 1000.
Figure 4 shows the time of the first data set that every algorithm takes. Figure 5 shows the time
of the second data set that every algorithm takes.
Start
BM(P,T)
Pi ≠ Ti
YES…
L ={ L1,L2…Lk }
AC( , )L T
Result
Quit
Match completely
NO
Match successfully
L1={P1…Pi }; (BM Pi+1, )T
L1,L2={Pi+1…Pi+j }; BM( Pi+j,T)
6. ISSN: 2302-4046
TELKOMNIKA Vol. 12, No. 1, January 2014: 379 – 387
384
Figure 4. The result of the first data set
Figure 5. The result of the first data set
It shows that the improved AC-BM algorithm performs best. When the number of
pattern sets increasing, the time of all the algorithms increase. Because the finite state machine
is larger and it has to take more time to transform; meanwhile, the times of matching increase.
Using the SMA algorithm, it can match by 100MB bytes per second and 1000 kinds of patterns.
So it improves the performance of the matching algorithm of key words well. In addition, as the
number of pattern strings increasing, the improved AC-BM algorithm is affected least. It means
that it’s convenient to add key words, and we don’t need to worry about that it may affect the
speed of matching. Obviously it is one of advantages of the improved AC-BM algorithm.
5. A Model of the Monitoring Watch List
5.1. The Structure of the Whole Monitoring System
The whole monitoring system should include the management and control center, the
module of preprocessing, the module of matching and the module of on-line monitoring and
analyzing. Figure 6 shows the structure of the system.
7. TELKOMNIKA ISSN: 2302-4046
An Improved AC-BM Algorithm for Monitoring Watch List (Mo Yiwen)
385
Figure 6. The structure of the monitoring systemt
The management and control center has a nice user interface, and shows the risk index
of the list that is detected at present. The module of preprocessing deals with the information of
watch list, and makes it standardization. The module of matching is used to match clients’
information with the watch list. The module of on-line monitoring and analyzing is used to
monitor the data of transactions in time.
5.2. The Structure of the Module of Matching
This paper mainly discusses the structuring of the module matching. Improving the
efficiency of this module will improve the operating efficiency of the whole system and help it
achieve the goal of on-line monitoring. The module of matching uses the algorithm of improved
AC-BM that this paper proposes to match and detect the clients’ information. If the module
discovers it there is someone suspicious or someone who maybe have some relationship with
suspicious organization after matching accurately, the system of monitoring will sound alarm. If
the module discovers it there isn’t any suspicious person or organization, it will save the clients’
information to the clients’ dataset. Figure 7 shows the workflow chart of this module.
Preprocessing
The dataset
of Watch list
The module of matching
Clients’ information
Alarm the suspicious data
Clients’
dataset
The module of on-line monitoring and
analyzing
The management and control
center
The situation of system
8. ISSN: 2302-4046
TELKOMNIKA Vol. 12, No. 1, January 2014: 379 – 387
386
Figure 7. The workflow chart of matching module
6. Conclusion
This paper focuses on the problems that anti-money laundering meets, and deliver
related research about the algorithms of matching pattern strings. On basis of BM algorithm, AC
algorithm and traditional AC-BM algorithm, we propose an improved algorithm, the matching
algorithm of subsection. The experiment shows that application of the algorithm to the matching
of watch list of anti-money laundering, could improve the speed of matching significantly. Even
the database of the watch list is expanding and the number of the key words is increasing, the
speed of the matching algorithm is affected least. These advantages can increase the speed of
matching watch list and meet the demand of on-line monitoring of anti-money laundering. In
addition, this paper designs a model of the monitoring system of anti-money laundering.
Applying the algorithm of the improved AC-BM to the module of matching in the monitoring
system will highly improve the efficiency of the whole monitoring system of anti-money
laundering.
Acknowledgment
This work is supported by National Social Science Foundation of China Project “Studies
on Suspicious Financial Transaction Monitoring System based on Behavior Pattern
Recognition” (09BTJ002).
References
[1] RS Boyer, JS Moore. A fast string searching algorithm. Communications of the ACM. 1977; 20(10):
762-772.
[2] AV Aho, MJ Corasick. Efficient string matching: an aid to bibliographic search. Communications of the
ACM. 1975; 18(6):333-340.
[3] Jang-Jong Fan, Keh-Yih Su. An Efficient Algorithm for Matching Multiple Patterns. IEEE Transactions
on Knowledge and Data Engineering. 1993; 5(2): 339-351.
[4] Alba LM. Evolution of Methods of Money Laundering in Latin America. Journal of Financial Crime.
2002.
NO
Imputing the clients’ information
Clients’ dataset
Sound alarm
Further monitoring
Watch list
Discover suspicious
information?
YES
Matching with the algorithm of subsection
9. TELKOMNIKA ISSN: 2302-4046
An Improved AC-BM Algorithm for Monitoring Watch List (Mo Yiwen)
387
[5] Alvaor E. Monge. An Adpative and Efficien Algorithm for Detecting Approximately Duplicate Database
Record. Califonia State University, Janeg. 2000.
[6] Jun Tang, Huan Liang, The building and perfection of watch list of the financial institution. Xinan
finance. 2011.
[7] Guogen Wan, Zhiguang Qin, Improved AC-BM Algorithm for Matching Multiple Strings. Journal of
University of Electronic Science and Technology of China. 2006; 35(4): 531-541.
[8] Siwei Zhou, Yong Cai. Mend of AC- BM A lgorithm and Application in Intrusion D etection Technique.
Microcomputer Applications. 2007; 28(1): 27-31.
[9] Brooks B. Money Laundering and Gambling: The New Zeal and Experience. Journal of Money
Laundering Control. 2003.
[10] Baker R. CaPitalism’s Achiles Heel: Dirty Money and How to Renew the Free-Market System. John
Wiley and Sons, 2005.
[11] Lu Jun, Zhang Zhuo, Mo Juan, LV xingfeng. Multi-pattern Matching Methods Based on Numerical
Computation. TELKOMNIKA Indonesian Journal of Electrical Engineering. 2013; 11(3); 1497-1405.
[12] Ye Peixin, Wei Xiujie. Lebeseguetype Inequality for Orthogonal Matching Pursuit for Microcoherent
Dictionaries. TELKOMINIKA Indonesian Journal of Electrical Engineering. 2013; 11(1); 213-226.
[13] N.Cereone, A,Tsuehiya eds. Special Issue on Learning and Discovery in Knowledge-BasesDatabase.
IEEE Transactions on Knowlddge and Data Engineering.1993.
[14] Dwyer T. ”Harmful” Tax Competition and the Futrue of offshore Financial Centers. Journal of Money
Laundering Control. 2000; 15(1); 48-69.
[15] Alexander R. The Role of Whistleblowers in the Fight against Economic Crime. Journal of Financial
Crime. 2004; 12(2); 131-138.
[16] Doudou La Loudouana, Mambobo Bonouliqui Tarare. Data Set Selection. Journal of Machine
Learning Gossip. 2003; 1: 11-19.
[17] Haddad E. Load distribution optimization in heterogeneous multiple Processor systems. Proceedings
of the Workshop On Heterogeneous Processing. 1993; 42-47.
[18] Jiawei Han, Mieheline Kamber. Data Mining Concepts and Techniques. Morgan Kaufinann Publisher.
2000.