Strong Secrecy for Erasure Wiretap Channels

We show that duals of certain low-density parity-check (LDPC) codes, when used in a standard coset coding scheme, provide strong secrecy over the binary erasure wiretap channel (BEWC). This result hinges on a stopping set analysis of ensembles of LDPC codes with block length $n$ and girth $\geq 2k$, for some $k \geq 2$. We show that if the minimum left degree of the ensemble is $l_\mathrm{min}$, the expected probability of block error is \calO(\frac{1}{n^{\lceil l_\mathrm{min} k /2 \rceil - k}}) when the erasure probability $\epsilon < \epsilon_\mathrm{ef}$, where $\epsilon_\mathrm{ef}$ depends on the degree distribution of the ensemble. As long as $l_\mathrm{min} > 2$ and $k > 2$, the dual of this LDPC code provides strong secrecy over a BEWC of erasure probability greater than $1 - \epsilon_\mathrm{ef}$.Comment: Submitted to the Information Theory Workship (ITW) 2010, Dubli

Fort-Trust: Safeguarding online transaction by machine learning

In the digital age, the safety of online transactions has become an important situation for both customers and groups. The increasing sophistication of cyber-attacks necessitates the development of robust and sensible protection mechanisms. "Citadel-believe: Safeguarding online Transactions through device gaining knowledge of" proposes a complete solution leveraging machine studying techniques to decorate the safety of online financial transactions. This method aims to stumble on and mitigate fraudulent activities in real time, presenting a further layer of safety past conventional techniques. e-commerce has completely changed the way people shop, it has also made people more susceptible to online transaction fraud. This problem is addressed by the innovative framework Fort-Trust, which uses the XGBoost algorithm for fraud detection. Fort-Trust incorporates feature correlation analysis to solve a prevalent problem in this field: imbalanced datasets. This strategy aims to maximize detection accuracy while minimizing false positives. The high precision rate that XGBoost delivers, according to the results, is essential for lowering financial losses and increasing user confidence. All things considered, Fort-Trust strengthens the security and dependability of online transactions by providing a strong and useful solution for real-world fraud detectio

Genetic regulation of adult hippocampal neurogenesis: A Systems genetics approach using BXD recombinant inbred mouse strains

Adult hippocampal neurogenesis is regulated at various levels and by various factors. Genetic influence is an important key determinant of adult neurogenesis and exerts its effects at all levels. In vivo studies have suggested that adult hippocampal neurogenesis is highly variable and heritable among different laboratory strains of mice. To dissect the genetic effect from other contributing factors, it is necessary to study adult neurogenesis under highly controlled environment conditions. We extracted adult hippocampal precursor cells (AHPCs) from 20 strains of the BXD set of recombinant inbred mice, cultured them and studied the effect of genetic background on neurogenesis. The BXD panel consists of mouse lines derived from an intercross between inbred parentals C57BL/6J and DBA/2J. Both of the parentals are fully sequenced and all the strains are well characterized in terms of genotypic and phenotypic characteristics. This allows us to use advanced genetic techniques to identify novel genomic loci and gene-gene interactions important in adult neurogenesis. Comparison of the AHPCs from 20 BXD strains, with respect to cell proliferation and neuronal and astrocytic differentiation in vitro, revealed a large variation for these traits across the strains. Proliferation, as measured by BrdU incorporation, showed over two- fold differences between the extremes. Similar differences were observed for neurogenic (4-fold) and astrogenic differentiation (2-fold). These three traits all showed strong heritability values indicating that the differences were mainly attributed to the genetic component. QTL mapping, with these phenotypic data, revealed that there was no major contribution from single loci controlling these traits. Instead, we found many loci with smaller effects associated with these traits. Gene expression profiling using RNA samples from proliferating cultures of the 20 BXD mice strains yielded two cis eQTL candidates that directly regulated proliferation, LRP6 and Chchd8. LRP6 is well known as a co-receptor of Wnt signaling, but the function of Chchd8 is not known. Further experimentation, using over expression and gene silencing demonstrated that LRP6 negatively regulates AHPCs proliferation. Thus, from this study using a system genetics approach, we were able to identify, LRP6 as a novel regulator of adult hippocampal neurogenesis

An improved upper bound for the domination number of a graph

Let $G$ be a graph of order $n$. A classical upper bound for the domination number of a graph $G$ having no isolated vertices is $\lfloor\frac{n}{2}\rfloor$. However, for several families of graphs, we have $\gamma(G) \le \lfloor\sqrt{n}\rfloor$ which gives a substantially improved upper bound. In this paper, we give a condition necessary for a graph $G$ to have $\gamma(G) \le \lfloor\sqrt{n}\rfloor$, and some conditions sufficient for a graph $G$ to have $\gamma(G) \le \lfloor\sqrt{n}\rfloor$. We also present a characterization of all connected graphs $G$ of order $n$ with $\gamma(G) = \lfloor\sqrt{n}\rfloor$. Further, we prove that for a graph $G$ not satisfying $rad(G)=diam(G)=rad(\overline{G})=diam(\overline{G})=2$, deciding whether $\gamma(G) \le \lfloor\sqrt{n}\rfloor$ or $\gamma(\overline{G}) \le \lfloor\sqrt{n}\rfloor$ can be done in polynomial time. We conjecture that this decision problem can be solved in polynomial time for any graph $G$

Comparison of membrane immobilized zero-valent iron nanoparticles for RED ME4BL azodye degradation

Textile industries are hailed as one of the major environmental polluters in the world, owing to their release of undesirable dye effluents. Synthetic dyes do not adhere to fabric firmly and are released into the aquatic ecosystem as effluent. Consequently, the consistent release of wastewater from numerous textile industries without previous treatment has detrimental effects on the ecosystem and human health.   Treatment methods currently being used fail to degrade the dye effluents and have their own shortcomings. Immobilized nanoparticles have been extensively studied for dye remediation because of their many advantages over conventional methods. The present study aimed to compare the efficiency of two different carrier matrices [namely Poly(vinylidene fluoride) and Polyurethane] for iron nanoparticle and their decolorization activity on an azo dye (RED ME4BL). Scanning Electron Microscopy was carried out to show the deposition of iron nanoparticles on the membrane. The reaction kinetics of the bare nanoparticles were compared with that of the immobilized nanoparticles, and all were found to follow pseudo-second-order kinetics. Polyurethane immobilized iron nanoparticles showed a significant degradation of RED ME4bl than the Poly(vinylidene fluoride) immobilized iron and bare nanoparticles. This paper also demonstrates a relatively newer method for nanoparticle immobilisation using the synthetic polyurethane form.

Design analysis of moth-flame optimized fault tolerant technique for minimally buffered network-on-chip router

A network on a chip is a solitary silicon chip utilized to perform the communication characteristics of large-scale (LSI) to very large-scale integration (VLSI) systems. Network-on-chip (NoC) architecture includes links, network interfaces (NI), and routers to unite with external memories or processors. NoC is designed to flow messages from the source module to the destination module through several links involving routing decisions. The design of NoC is complex and the buffer section’s expensiveness creates problems while providing secured data service. Moreover, routers and links in NoC setups are liable to faults. This work introduces a minimal buffered router, and the faults in the network are optimized using moth flame optimized (MFO) fault-tolerant technique. The software named Xilinx ISE design suite 14.5 is employed for the minimum buffered router model. The suggested scheme is operated with less area, low power (0.241 mW), and high speed (965.261 Megahertz (MHz)) when matched with previous works

Design of matrix, distributive round robin, ping pong and enhanced ping lock arbiter for shared resources systems

Arbiter is one of the main core elements in the network scheduler. The significant goal of this work is to design a high-speed and low execution-time arbiter with lock free and fair arbitration scheme. In this work, four types of arbiters such as matrix arbiter (MA), ping pong arbiter (PPA), distributive round-robin arbiter (DRRA) and enhanced ping lock arbiter (EPLA) are designed and analyzed area, delay, and speed of arbiters. MA is worked in square matrix format and matrix transition is performed for effective routing. The DRRA is designed by using a multiplexer and counter. Hence an, effective scheduling is carried out in DRRA. Binary tree format is used in PPA. The PPA provides low chip size and high speed than existing MA and DRRA. The PPA limits fair arbitration during uniformly distributed active request patterns. To overcome this problem, PPA is improved with some lock systems to create an EPLA. A new ping lock arbiter (PLA) leaf and PLA inter structure is proposed at the gate level to reduce the execution delay, improve the speed and achieve fair arbitration over all other existing arbiters. Resource allocation, execution delay, and speed are analyzed using the Xilinx Integrated Software Environment (ISE) tool

Suspension Dry Spinning and Rheological Behavior of Ceramic-Powder-Loaded Polymer Solutions

Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/65574/1/j.1151-2916.1993.tb03966.x.pd