scholarly journals THE PARALLEL IMPLEMENTATION OF ALGORITHMS FOR FINDING THE REFLECTION SYMMETRY OF THE BINARY IMAGES

2017 ◽  
Vol XLII-2/W4 ◽  
pp. 179-184
Author(s):  
S. Fedotova ◽  
O. Seredin ◽  
O. Kushnir
Keyword(s):  
Symmetry Axis ◽  
Parallel Implementation ◽  
Search Algorithm ◽  
Experimental Studies ◽  
Ground Truth ◽  
Approximate Symmetry ◽  
Brute Force ◽  
Brute Force Search ◽  
Binary Images ◽  
The Common

In this paper, we investigate the exact method of searching an axis of binary image symmetry, based on brute-force search among all potential symmetry axes. As a measure of symmetry, we use the set-theoretic Jaccard similarity applied to two subsets of pixels of the image which is divided by some axis. Brute-force search algorithm definitely finds the axis of approximate symmetry which could be considered as ground-truth, but it requires quite a lot of time to process each image. As a first step of our contribution we develop the parallel version of the brute-force algorithm. It allows us to process large image databases and obtain the desired axis of approximate symmetry for each shape in database. Experimental studies implemented on “Butterflies” and “Flavia” datasets have shown that the proposed algorithm takes several minutes per image to find a symmetry axis. However, in case of real-world applications we need computational efficiency which allows solving the task of symmetry axis search in real or quasi-real time. So, for the task of fast shape symmetry calculation on the common multicore PC we elaborated another parallel program, which based on the procedure suggested before in (Fedotova, 2016). That method takes as an initial axis the axis obtained by superfast comparison of two skeleton primitive sub-chains. This process takes about 0.5 sec on the common PC, it is considerably faster than any of the optimized brute-force methods including ones implemented in supercomputer. In our experiments for 70 percent of cases the found axis coincides with the ground-truth one absolutely, and for the rest of cases it is very close to the ground-truth.

Traditional Classifiers vs. Deep Learning for Cyberbullying Detection

2018 ◽  
pp. 133-149
Keyword(s):  
Neural Networks ◽  
Deep Learning ◽  
Convolutional Neural Networks ◽  
Search Algorithm ◽  
Learning Approach ◽  
Brute Force ◽  
Brute Force Search ◽  
Novel Method ◽  
Objective View ◽  
Cyberbullying Detection

In this chapter, the authors present their approach to cyberbullying detection with the use of various traditional classifiers, including a deep learning approach. Research has tackled the problem of cyberbullying detection during recent years. However, due to complexity of language used in cyberbullying, the results obtained with traditional classifiers has remained only mildly satisfying. In this chapter, the authors apply a number of traditional classifiers, used also in previous research, to obtain an objective view on to what extent each of them is suitable to the task. They also propose a novel method to automatic cyberbullying detection based on convolutional neural networks and increased feature density. The experiments performed on actual cyberbullying data showed a major advantage of the presented approach to all previous methods, including the two best performing methods so far based on SO-PMI-IR and brute-force search algorithm, presented in previous two chapters.

scholarly journals ALGORITHMS FOR ADJUSTMENT OF SYMMETRY AXIS FOUND FOR 2D SHAPES BY THE SKELETON COMPARISON METHOD

2019 ◽  
Vol XLII-2/W12 ◽  
pp. 129-136
Author(s):  
O. A. Kushnir ◽  
O. S. Seredin ◽  
S. A. Fedotova
Keyword(s):  
Similarity Measure ◽  
Symmetry Axis ◽  
Ground Truth ◽  
Comparison Method ◽  
Reflection Symmetry ◽  
Brute Force ◽  
Symmetry Detection ◽  
Jaccard Similarity ◽  
Axis Of Symmetry ◽  
Pair Wise Comparison

<p><strong>Abstract.</strong> Reflection symmetry detection for 2D shapes is a well-known task in Computer Vision, but there is a limited number of efficient and effective methods for its solution. Our previously proposed approach based on pair-wise comparison of sub-sequences of skeleton primitives finds the axis of symmetry within few seconds. In order to evaluate the value of symmetry relative to the found axis we use the Jaccard similarity measure. It is applied to the pixels subsets of a shape which are split by the axis. Often an axis found by the skeleton comparison method diverges more or less from the ground-truth axis found by the method of exhaustive search among all the potential candidates. That is why the algorithms that allow adjusting the axis found by the fast skeleton method are proposed. They are based on the idea of searching the axis which is located near the seed skeleton axis and has greater Jaccard similarity measure. The experimental study on the ”Flavia” and ”Butterflies” datasets shows that proposed algorithms find the ground-truth axis (or the axis which has slightly less Jaccard similarity value than the ground-truth axis) in near real time. It is considerably faster than any of the optimized brute-force methods.</p>

Deterministic and probabilistic occupancy detection with a novel heuristic optimization and Back-Propagation (BP) based algorithm

2021 ◽  
pp. 1-13
Author(s):  
Nuzhat Fatema ◽  
Saeid Gholami Farkoush ◽  
Mashhood Hasan ◽  
H Malik
Keyword(s):  
Convergence Rate ◽  
Search Algorithm ◽  
Gravitational Search Algorithm ◽  
Hybrid Approach ◽  
Experimental Studies ◽  
Back Propagation ◽  
Heuristic Optimization ◽  
Local Minima ◽  
Occupancy Detection ◽  
Trapping Problem

In this paper, a novel hybrid approach for deterministic and probabilistic occupancy detection is proposed with a novel heuristic optimization and Back-Propagation (BP) based algorithms. Generally, PB based neural network (BPNN) suffers with the optimal value of weight, bias, trapping problem in local minima and sluggish convergence rate. In this paper, the GSA (Gravitational Search Algorithm) is implemented as a new training technique for BPNN is order to enhance the performance of the BPNN algorithm by decreasing the problem of trapping in local minima, enhance the convergence rate and optimize the weight and bias value to reduce the overall error. The experimental results of BPNN with and without GSA are demonstrated and presented for fair comparison and adoptability. The demonstrated results show that BPNNGSA has outperformance for training and testing phase in form of enhancement of processing speed, convergence rate and avoiding the trapping problem of standard BPNN. The whole study is analyzed and demonstrated by using R language open access platform. The proposed approach is validated with different hidden-layer neurons for both experimental studies based on BPNN and BPNNGSA.

Kinetics of hypso anhydrites dissolution in water. Experimental studies

2019 ◽  
pp. 93-96
Author(s):  
A. L. Lebedev ◽  
I. V. Avilina
Keyword(s):  
Experimental Data ◽  
Experimental Study ◽  
Riccati Equation ◽  
Balance Equation ◽  
Experimental Studies ◽  
Common Ion ◽  
The Common ◽  
Common Ion Effect ◽  
Kinetics Of Dissolution ◽  
Kinetics Of

Experimental study of kinetics of dissolution of hypso anhydrites at 25 ᵒC made it possible to formulate model of the process in the form of a balance equation for the kinetics of dissolution of gypsum, anhydrite (first and second orders, respectively) and kinetics of precipitation of gypsum (second order). The processing of the experimental data were carried out on the basis of the solution of the Riccati equation. When taking into account the common-ion effect on the solubility of gypsum and anhydrite, the calculated values turned out to be more comparable with the experimental ones.

scholarly journals Weaving the Common Threads of Simulation and Formation studies in Archaeology

2017 ◽  
Author(s):  
Benjamin Davies
Keyword(s):  
Computer Simulation ◽  
Human Activity ◽  
Computational Models ◽  
Experimental Studies ◽  
Surface Erosion ◽  
Archaeological Record ◽  
The Common ◽  
The Relationship ◽  
Material Record

Computer simulation is a tool increasingly used by archaeologists to build theories about past human activity; however, simulation has had a limited role theorising about the relationship between past behaviours and the formation of observed patterning in the material record. This paper visits the argument for using simulation as a means of addressing the gap that exists between archaeological interpretations of past behaviours and their physical residues. It is argued that simulation is used for much the same reason that archaeologists use ethnographic or experimental studies, and that computational models can help to address some of the practical limitations of these approaches to record formation. A case study from arid Australia, examining the effects of episodic surface erosion on the visibility of the record, shows how simple, generative simulations, grounded in formational logic, can be used to compare different explanatory mechanisms and suggest tests of the archaeological record itself.

scholarly journals Secure Remote User Authentication using Pass Script & Pass Text

2019 ◽  
Vol 8 (4) ◽  
pp. 4411-4417
Keyword(s):  
Smart Card ◽  
Mobile Device ◽  
User Authentication ◽  
Brute Force ◽  
Brute Force Search ◽  
Secure Systems ◽  
Graphical Passwords ◽  
Remote User Authentication ◽  
Remote User

Authenticating users to secure systems is a crucial task for security experts to solve a password problem, where user should able to memorize a password or secret and password should be hard to guess and crack by adversaries. In general, Most of the secure systems were designed with text passwords along with additional factors such as tokens like smart card, mobile device. Text passwords are not resistant to dictionary, brute-force and guessing attacks. This paper proposes a novel graphical password method, which solves the password problem and secure against all password vulnerabilities. Theoretically, graphical passwords are easy to memorize and recall them easily for long term and resistant to dictionary and brute-force search attacks

The History and Status of the Journal of Sport Psychology: 1979-1985

1986 ◽  
Vol 8 (3) ◽  
pp. 149-163 ◽  
Author(s):  
Daniel M. Landers ◽  
Stephen H. Boutcher ◽  
Min Q. Wang
Keyword(s):  
Sport Psychology ◽  
Statistical Tests ◽  
Experimental Studies ◽  
The Past ◽  
Subject Selection ◽  
Research Areas ◽  
Time Period ◽  
Methodological Problems ◽  
The Common ◽  
Single Set

In the past 7 years JSP has evolved to become a respected sport psychology journal. The journal has been uncompromising in the strong research posture it has taken. It is currently the only journal entirely devoted to sport psychology that uses a single set of criteria for evaluating the scientific merit of submitted manuscripts. Over this time period the submitted manuscripts have shown an increase in the number of female principal authors as well as authors being affiliated with departments other than physical education. Survey studies were the most common submittals, but lately there has been a greater emphasis in field experimental studies. Some potential problem areas are noted in subject selection and choice of statistical tests. An examination of research areas revealed that in recent years "motivation" was the most frequently submitted topic. It appeared that other research areas varied in terms of their publishability. The common methodological problems associated with rejection of these types of manuscripts are discussed.

Cyberbullying Blocker Test Application for Android Devices

2018 ◽  
pp. 150-163
Keyword(s):  
Search Algorithm ◽  
Negative Influence ◽  
Detection Methods ◽  
Brute Force Search ◽  
Test Application ◽  
Semantic Orientation ◽  
Orientation Score ◽  
Harmful Content ◽  
Language Modelling ◽  
Cyberbullying Detection

In this chapter, the authors present an application for Android smartphones to automatically detect possible harmful content in input text. The developed application is aimed to test in practice the performance of the developed cyberbullying detection methods described in previous chapters. The final goal of the developed application will be to help mitigate the problem of cyberbullying by quickly detecting possibly harmful contents in user's entry and warning the user of the possible negative influence. The test application was prepared to use one of two methods for detection of harmful messages: a method inspired by a brute force search algorithm applied to language modelling and a method which uses seed words from three categories to calculate semantic orientation score SO-PMI-IR and then maximize the relevance of categories to specify harmfulness of a message (both methods were described in previous chapters). First tests showed that both methods are working properly under the Android environment.

Hybrid Query and Data Qodering for Fast and Progressive Range-Aggregate Query Answering

2008 ◽  
pp. 1250-1268
Author(s):  
Cyrus Shahabi ◽  
Mehrdad Jahangiri ◽  
Dimitris Sacharidis
Keyword(s):  
Experimental Studies ◽  
Query Answering ◽  
Common Belief ◽  
Multidimensional Datasets ◽  
Scientific Datasets ◽  
Aggregate Queries ◽  
Random Dataset ◽  
Aggregate Query ◽  
The Common ◽  
Superior Approach

Data analysis systems require range-aggregate query answering of large multidimensional datasets. We provide the necessary framework to build a retrieval system capable of providing fast answers with progressively increasing accuracy in support of range-aggregate queries. In addition, with error forecasting, we provide estimations on the accuracy of the generated approximate results. Our framework utilizes the wavelet transformation of query and data hypercubes. While prior work focused on the ordering of either the query or the data coefficients, we propose a class of hybrid ordering techniques that exploits both query and data wavelets in answering queries progressively. This work effectively subsumes and extends most of the current work where wavelets are used as a tool for approximate or progressive query evaluation. The results of our experimental studies show that independent of the characteristics of the dataset, the data coefficient ordering, contrary to the common belief, is the inferior approach. Hybrid ordering, on the other hand, performs best for scientific datasets that are inter-correlated. For an entirely random dataset with no inter-correlation, query ordering is the superior approach.

Sign in / Sign up

Export Citation Format

Share Document