The larger the size of the
data, structured or unstructured, the harder to understand and make use of it.
One of the fundamentals to machine learning is feature selection. Feature
selection, by reducing the number of irrelevant/redundant features,
dramatically reduces the run time of a learning algorithm and leads to a more
general concept. In this paper, realization of feature selection through a
neural network based algorithm, with the aid of a topology optimizer genetic
algorithm, is investigated. We have utilized NeuroEvolution of Augmenting
Topologies (NEAT) to select a subset of features with the most relevant
connection to the target concept. Discovery and improvement of solutions are
two main goals of machine learning, however, the accuracy of these varies
depends on dimensions of problem space. Although feature selection methods can
help to improve this accuracy, complexity of problem can also affect their
performance. Artificialneural networks are proven effective in feature
elimination, but as a consequence of fixed topology of most neural networks, it
loses accuracy when the number of local minimas is considerable in the problem.
To minimize this drawback, topology of neural network should be flexible and it
should be able to avoid local minimas especially when a feature is removed. In
this work, the power of feature selection through NEAT method is demonstrated.
When compared to the evolution of networks with fixed structure, NEAT discovers
significantly more sophisticated strategies. The results show NEAT can provide
better accuracy compared to conventional Multi-Layer Perceptron and leads to
improved feature selection.

Abstract:
Cryptography as a service is becoming extremely popular. It eases the way companies deal with securing their information without having to worry about their customer’s information being accessed by someone who should not have access to it. In this overview, we will be taking a closer look at Cryptography as a Service. The ground we will be examining is the effectiveness of it for mobile/wireless and desktop computing. Since we will be looking at something that operates as a service, we will need to first cover the application program interface (API) basics [1] or standard software as a service (SaaS) [2]. Next, what exactly cryptography as a service means for each of the aforementioned platforms. Lastly, other possible solutions and how they compare to CaaS. For the purpose of this review, we will be looking at CaaS in a cloud environment since typical SaaS is used that way. Subsequently most cloud environments utilize a UNIX based operating system or similar solution, which will be the target environment for the purpose of this paper. Popular algorithms that are used in CaaS will be the final part that will be examined on the grounds of how they perform, level of security offered, and usability in CaaS. Upon reading this paper the reader will have a better understanding of how exactly CaaS operates and what it has to offer for mobile, desktop, and wireless users in the present and future.

Abstract:
The advent of technology brought forth a myriad of developments that have
streamlined the manner through which people operate. With the growing
need to be at the forefront of communication and information, people have
resorted to the use of mobile phones with a great percentile preferring android
oriented systems. Similarly, the systems are susceptible to the various
threats posed by technology with due summations showing that security flaws
and unauthorized access to sensitive data pose a huge threat to the overarching
efficacy of the android systems. The research presented lays a primal focus
on how users can improve intrinsic android features through the use of
Google services, rooting, custom kernels and ROM techniques. The research
also focused on how Android security features can be improved when using
or installing applications. Results indicate that the rooting process is the most
conclusive and safest scheme. Summations drawn are indicative of the fact
that system security is a moot research topic that requires further research
into how it can be improved.

Abstract:
Pi-Calculus is a formal method for describing and analyzing the behavior of large distributed and concurrent systems. Pi-calculus offers a conceptual framework for describing and analyzing the concurrent systems whose configuration may change during the computation. With all the advantages that pi-calculus offers, it does not provide any methods for performance evaluation of the systems described by it; nevertheless performance is a crucial factor that needs to be considered in designing of a multi-process system. Currently, the available tools for pi-calculus are high level language tools that provide facilities for describing and analyzing systems but there is no practical tool on hand for pi-calculus based performance evaluation. In this paper, the performance evaluation is incorporated with pi-calculus by adding performance primitives and associating performance parameters with each action that takes place internally in a system. By using such parameters, the designers can benchmark multi-process systems and compare the performance of different architectures against one another.

Abstract:
r(VI) is a known human carcinogen. It is a wide spread environmental contaminant as it is extensively used in different industry. The kinetic study of reduction of Cr(VI) by a known organic substance, 1-butanol in micellar media have been studied spectrophotometrically. The reduction of Cr(VI) to Cr(III) occurs in a micro- heterogeneous system in cell cytoplasm. As micelles are considered to mimic the cellular membranes, the reduction process occurring in the micellar system is considered as a model to obtain insight in to the reduction process prevailing in body systems. Micellar media is also a probe to establish the mechanistic paths of reduction of Cr(VI) to Cr(III) and the effects of some electrolytes common to a biological systems are studied to establish the proposed reaction mechanism strongly. The overall reaction follows a first order dependency on substrate and hexavalent chromium and second order dependency on hydrogen ion. Suitable surfactant & suitable concentration of electrolyte enhance the rate of the reaction.

Abstract:
The preparation of several functionalized furan derivatives and attempts to transform them into a derivative containing 6H-furo[3,4-b]furanone skeleton towards the construction of naphtho[2,3-b] furan are described. Attempted Pummerer reaction of a furan sulfoxide derivative produced four interesting furan derivatives. Base promoted annulation between methyl 2-(phenylsulfinylmethyl)-3-furoate and 2-cyclohexenone proceeded to give dihydro naphtho[2,3-b]furanone derivative in a regiospecific manner.

Abstract:
Let $F_g$ denote the closed oriented surface of genus $g$ and $\text{Mod}(F_g)$ denote the mapping class group of genus $g$. The group $\text{Mod}(F_g)$ acts on the set of fillings of $F_g$. The union of the curves in a filling form a graph on the surface which is so called decorated fat graph. We show that two fillings of $F_g$ are in the same $\text{Mod}(F_g)$-orbit if and only if the corresponding fat graphs are isomorphic. Next, we prove that any filling of $F_2$ with complement a single disc(i.e. a so called minimal filling) has either three or four closed curves. Moreover, we prove that there exist unique $\text{Mod}(F_2)$-orbit of minimal filling with three curves and unique $\text{Mod}(F_2)$-orbit of minimal filling with four curves. We show that the minimum number of discs in the complement of a \emph{ filling pair} of $F_2$ is two and we construct \emph{ filling pair} of $F_2$ so that the complement is the union of two topological discs. Finally, for given any $k\geq 2$ we construct filling pair of $F_2$ such that the complement is the union of $k$ topological discs.

Abstract:
The study of the queueing system presented in this note was motivated by its possible application to a multiprogramming computer system. The paper considers a closed network with two service centres with feedback. The steady-state behaviour of the passage time, the random times for a job to traverse a portion of the network, is examined through simulation. The model can be applied to a twin-processor multiprogramming computer system.

Abstract:
In this note a class of interesting generating relation, which is stated in the form of theorem, involving Laguerre polynomials is derived. Some applications of the theorem are also given here.