109 research outputs found
Antipowers in Uniform Morphic Words and the Fibonacci Word
No full textFici, Restivo, Silva, and Zamboni define a -antipower to be a word
composed of pairwise distinct, concatenated words of equal length. Berger
and Defant conjecture that for any sufficiently well-behaved aperiodic morphic
word , there exists a constant such that for any and any index ,
a -antipower with block length at most starts at the th position of
. They prove their conjecture in the case of binary words, and we extend
their result to alphabets of arbitrary finite size and characterize those words
for which the result does not hold. We also prove their conjecture in the
specific case of the Fibonacci word
Design, synthesis and biological evaluation of biphenylamide derivatives as Hsp90 C-terminal inhibitors
No full textModulation of Hsp90 C-terminal function represents a promising
therapeutic approach for the treatment of cancer and neurodegenerative
diseases. Current drug discovery efforts toward Hsp90 C-terminal
inhibition focus on novobiocin, an antibiotic that was transformed into
an Hsp90 inhibitor. Based on structural information obtained during the
development of novobiocin derivatives and molecular docking studies,
scaffolds containing a biphenyl moiety in lieu of the coumarin ring
present in novobiocin were identified as new Hsp90 C-terminal
inhibitors. Structure activity relationship studies produced new
derivatives that inhibit the proliferation of breast cancer cell lines
at nanomolar concentrations, which corresponded directly with Hsp90
inhibition. (C) 2014 Elsevier Masson SAS. All rights reserved
High-throughput FPGA QC-LDPC decoder architecture for 5G wireless
No full textWireless data traffic is expected to increase by a 1000 fold by the year 2020 with more than 50 billion devices connected to these wireless networks with peak data rates upto 10 Gb/s. The next generation of wireless cellular technology (being collectively termed as 5G) is slated to operate in the mm-wave (30-300GHz) spectrum which comes with challenges such as, reliance on line of sight (LOS) communication, short range of communication, increased shadowing and, rapid fading in time. This will necessitate additional signal processing techniques such as large antenna arrays and beamsteering which will further reduce the processing budget available to the channel coding system. In an effort ort to design and develop a channel coding solution suitable to such systems, in this thesis we propose strategies to achieve a high-throughput FPGA-based decoder architecture for a QC-LDPC code based on circulant-1 identity matrix construction. We present a novel representation of the parity-check matrix (PCM) providing a multifold throughput gain. Splitting of the node processing algorithm enables us to achieve pipelining of blocks and hence layers. By partitioning the PCM into not only layers but superlayers, we derive an upper bound on the pipelining depth with respect to the size of the superlayer for the compact representation. To validate the architecture, a decoder for the IEEE 802.11n (2012) QC-LDPC is implemented on the Xilinx Kintex-7 FPGA with the help of the FPGA IP compiler available in the NI LabVIEW Communication System Design Suite (CSDS). It off ers an automated and systematic compilation flow. An optimized hardware implementation from the decoder algorithm was generated in approximately 3 minutes, achieving an overall throughput of 608Mb/s (at 260MHz). With little or no modi fications, the proposed decoder architecture caters to a wide range of circulant-1 identity matrix construction based QC-LDPC codes widely accepted in several communication and data storage standards.M.S.Includes bibliographical referencesby Swapnil Mhask
Rani Kamlapati (Habibganj) Railway Station Redevelopment: A World-Class Dream Coming True
No full textFew Ways to Succeed, Many Ways toFail: Asymmetrical Performance of Indian Highway PPP Projects
No full textNew Results on Nyldon Words and Nyldon-like Sets
No full textGrinberg defined Nyldon words as those words which cannot be factorized into
a sequence of lexicographically nondecreasing smaller Nyldon words. He was
inspired by Lyndon words, defined the same way except with "nondecreasing"
replaced by "nonincreasing." Charlier, Philibert, and Stipulanti proved that,
like Lyndon words, any word has a unique nondecreasing factorization into
Nyldon words. They also show that the Nyldon words form a right Lazard set, and
equivalently, a right Hall set. In this paper, we provide a new proof of unique
factorization into Nyldon words related to Hall set theory and resolve several
questions of Charlier et al. In particular, we prove that Nyldon words of a
fixed length form a circular code, we prove a result on factorizing powers of
words into Nyldon words, and we investigate the Lazard procedure for generating
Nyldon words. We show that these results generalize to a new class of Hall
sets, of which Nyldon words are an example, that we name "Nyldon-like sets."Comment: 27 pages; incorporated reviewer comment
sj-docx-1-cjk-10.1177_20543581231154183 – Supplemental material for Magnesium and Fracture Risk in the General Population and Patients Receiving Dialysis: A Narrative Review
No full textSupplemental material, sj-docx-1-cjk-10.1177_20543581231154183 for Magnesium and Fracture Risk in the General Population and Patients Receiving Dialysis: A Narrative Review by Andrea C. Cowan, Kristin K. Clemens, Jessica M. Sontrop, Stephanie N. Dixon, Lauren Killin, Sierra Anderson, Rey R. Acedillo, Amit Bagga, Clara Bohm, Pierre Antoine Brown, Brenden Cote, Varun Dev, Claire Harris, Swapnil Hiremath, Mercedeh Kiaii, Eduardo Lacson Jr, Amber O. Molnar, Matthew J. Oliver, Malvinder S. Parmar, Jennifer M. McRae, Bharat Nathoo, Kathleen Quinn, Nikhil Shah, Samuel A. Silver, Daniel J. Tascona, Stephanie Thompson, Robert H. Ting, Marcello Tonelli, Hans Vorster, Davinder B. Wadehra, Ron Wald, Myles Wolf and Amit X. Garg in Canadian Journal of Kidney Health and Disease</p
Opportunity cost analysis of android smartphones' permissions
No full textThis thesis provides the opportunity cost for reading androids permission model. We investigate the opportunity cost for users and an example nation (United States), if people would actually read these permission screens during installation time.While the Federal Trade Commission and reserachers try to protect users’ privacy and to improve their comfort level with mobile applications, users still remain unaware of these changes. Users are given a choice to overview the permissions an app would use and have to make an on the spot decision to accept these and move forward with the installation. In this research we project the time required by an average user if they were to read the permissions and compute the monetary value of that time in different situations. An average user may spend half an hour in overviewing permission screens bearing maximum opportunity cost of 3 based on whether it was read at work or leisure. Other than this, if the users decide to read the details of these permissions as well, they will spend more time and hence bear more cost. Reading permissions with details would require users to spend two and half hours annually with a maximum cost of 13. An entire nation (United States) would have to invest a minimum of 6 billion, in reading permissions.M.S.Includes bibliographical referencesby Swapnil Sarod
- …
