arXiv subjects

Mohammad Mahdi Dehshibi

Publications and source records attributed to Mohammad Mahdi Dehshibi.

25 records · Page 2Linked to original sources

arXiv2020

Electrical activity of fungi: Spikes detection and complexity analysis

Oyster fungi \emph{Pleurotus djamor} generate actin potential like spikes of electrical potential. The trains of spikes might manifest propagation of growing mycelium in a substrate, transportation of nutrients and metabolites and communication processes in the mycelium network. The spiking activity of the mycelium networks is highly variable compared to neural activity and therefore can not be analysed by standard tools from neuroscience. We propose original techniques for detecting and classifying the spiking activity of fungi. Using these techniques, we analyse the information-theoretic complexity of the fungal electrical activity. The results can pave ways for future research on sensorial fusion and decision making of fungi.

q-bio.NC↗

arXiv2019

Raft Consensus Algorithm: an Effective Substitute for Paxos in High Throughput P2P-based Systems

One of the significant problem in peer-to-peer databases is collision problem. These databases do not rely on a central leader that is a reason to increase scalability and fault tolerance. Utilizing these systems in high throughput computing cause more flexibility in computing system and meanwhile solve the problems in most of the computing systems which are depend on a central nodes. There are limited researches in this scope and they seem are not suitable for using in a large scale. In this paper, we used Cassandra which is a distributed database based on peer-to-peer network as a high throughput computing system. Cassandra uses Paxos to elect central leader by default that causes collision problem. Among existent consensus algorithms Raft separates the key elements of consensus, such as leader election, so enforces a stronger degree of coherency to reduce the number of states that must be considered, such as collision.

cs.DC↗

arXiv2019

VICSOM: VIsual Clues from SOcial Media for psychological assessment

Sharing multimodal information (typically images, videos or text) in Social Network Sites (SNS) occupies a relevant part of our time. The particular way how users expose themselves in SNS can provide useful information to infer human behaviors. This paper proposes to use multimodal data gathered from Instagram accounts to predict the perceived prototypical needs described in Glasser's choice theory. The contribution is two-fold: (i) we provide a large multimodal database from Instagram public profiles (more than 30,000 images and text captions) annotated by expert Psychologists on each perceived behavior according to Glasser's theory, and (ii) we propose to automate the recognition of the (unconsciously) perceived needs by the users. Particularly, we propose a baseline using three different feature sets: visual descriptors based on pixel images (SURF and Visual Bag of Words), a high-level descriptor based on the automated scene description using Convolutional Neural Networks, and a text-based descriptor (Word2vec) obtained from processing the captions provided by the users. Finally, we propose a multimodal fusion of these descriptors obtaining promising results in the multi-label classification problem.

cs.CV↗

arXiv2019

On complexity of branching droplets in electrical field

Decanol droplets in a thin layer of sodium decanoate with sodium chloride exhibit bifurcation branching growth due to interplay between osmotic pressure, diffusion and surface tension. We aimed to evaluate if morphology of the branching droplets changes when the droplets are subject to electrical potential difference. We analysed graph-theoretic structure of the droplets and applied several complexity measures. We found that, in overall, the current increases complexity of the branching droplets in terms of number of connected components and nodes in their graph presentations, morphological complexity and compressibility.

cs.ET↗

arXiv2018

A robust image-based cryptology scheme based on cellular non-linear network and local image descriptors

Cellular nonlinear network (CNN) provides an infrastructure for Cellular Automata to have not only an initial state but an input which has a local memory in each cell with much more complexity. This property has many applications which we have investigated it in proposing a robust cryptology scheme. This scheme consists of a cryptography and steganography sub-module in which a 3D CNN is designed to produce a chaotic map as the kernel of the system to preserve confidentiality and data integrity in cryptology. Our contributions are three-fold including (1) a feature descriptor is applied to the cover image to form the secret key while conventional methods use a predefined key, (2) a 3D CNN is used to make a chaotic map for making cipher from the visual message, and (3) the proposed CNN is also used to make a dynamic $k$-LSB steganography. Conducted experiments on 25 standard images prove the effectiveness of the proposed cryptology scheme in terms of security, visual, and complexity analysis.

cs.CR↗

arXiv2018

Exploring Tehran with excitable medium

An excitable chemical medium --- Belousov-Zhabotinsky (BZ) reaction --- is proven to be a fruitful substrate for prototyping unconventional computing devices. These include image processors, logical circuits, and robot controllers. We study a BZ potential for characterising a geometry of street networks on a fragment of Tehran street map. The city was chosen because it is one of the most populated cities in the World with nearly uncontrollable urban growth. In numerical experiments with Oregonator model of BZ reaction, we demonstrate that excitability of the medium allows acts as a selector between omnidirectional waves and soliton-like localised excitations. We uncover a phase-transition like dynamics, controlled by the excitability, of coverage of the street network by excitation wave-fronts. In the cluster analysis, we show how the network geometry, when it meets propagation of BZ wave-front, relates to the traffic flow of Tehran

cs.ET↗

arXiv2018

On complexity of post-processing in analyzing GATE-driven X-ray spectrum

Computed Tomography (CT) imaging is one of the most influential diagnostic methods. In clinical reconstruction, an effective energy is used instead of total X-ray spectrum. This approximation causes an accuracy decline. To increase the contrast, single source or dual source dual energy CT can be used to reach optimal values of tissue differentiation. However, these infrastructures are still at the laboratory level, and their safeties for patients are still yet to mature. Therefore, computer modelling of DECT could be used. We propose a novel post-processing approach for converting a total X-ray spectrum into irregular intervals of quantized energy. We simulate a phantom in GATE/GEANT4 and irradiate it based on CT configuration. Inverse Radon transform is applied to the acquired sinogram to construct the Pixel-based Attenuation Matrix (PAM). To construct images represented by each interval, water attenuation coefficient of the interval is extracted from NIST and used in the Hounsfield unit (HU) scale in conjunction with PAM. The CT image is modified by using of an associated normalized photon flux and calculated HU corresponding to the interval. We demonstrate the proposed method efficiency via complexity analysis, using absolute and relative complexities, entropy measures, Kolmogorov complexity, morphological richness, and quantitative segmentation criteria associated with standard fuzzy C-means. The irregularity of the modified CT images decreases over the simulated ones.

cs.ET↗