Mesenchymal stem cells, neural lineage potential, heparan sulfate proteoglycans and the matrix

Along with the tri-lineage of bone, cartilage and fat, human mesenchymal stem cells (hMSCs) retain neural lineage potential. Multiple factors have been described that influence lineage fate of hMSCs including the extracellular microenvironment or niche. The niche includes the extracellular matrix (ECM) providing structural composition, as well as other associated proteins and growth factors, which collectively influence hMSC stemness and lineage specification. As such, lineage specific differentiation of MSCs is mediated through interactions including cell–cell and cell–matrix, as well as through specific signalling pathways triggering downstream events. Proteoglycans (PGs) are ubiquitous within this microenvironment and can be localised to the cell surface or embedded within the ECM. In addition, the heparan sulfate (HS) and chondroitin sulfate (CS) families of PGs interact directly with a number of growth factors, signalling pathways and ECM components including FGFs, Wnts and fibronectin. With evidence supporting a role for HSPGs and CSPGs in the specification of hMSCs down the osteogenic, chondrogenic and adipogenic lineages, along with the localisation of PGs in development and regeneration, it is conceivable that these important proteins may also play a role in the differentiation of hMSCs toward the neuronal lineage. Here we summarise the current literature and highlight the potential for HSPG directed neural lineage fate specification in hMSCs, which may provide a new model for brain damage repair.

Heparan sulfate proteoglycans and human breast cancer epithelial cell tumorigenicity

Heparan sulfate proteoglycans (HSPGs) are key components of the extracellular matrix that mediate cell proliferation, invasion, and cellular signaling. The biological functions of HSPGs are linked to their co-stimulatory effects on extracellular ligands (e.g., WNTs) and the resulting activation of transcription factors that control mammalian development but also associated with tumorigenesis. We examined the expression profile of HSPG core protein syndecans (SDC1–4) and glypicans (GPC1–6) along with the enzymes that initiate or modify their glycosaminoglycan chains in human breast cancer (HBC) epithelial cells. Gene expression in relation to cell proliferation was examined in the HBC cell lines MCF-7 and MDA-MB-231 following treatment with the HS agonist heparin. Heparin increased gene expression of chain initiation and modification enzymes including EXT1 and NDST1, as well as core proteins SDC2 and GPC6. With HS/Wnt interactions established, we next investigated WNT pathway components and observed that increased proliferation of the more invasive MDA-MB-231 cells is associated with activation of the Wnt signaling pathway. Specifically, there was substantial upregulation (>5-fold) of AXIN1, WNT4A, and MYC in MDA-MB-231 but not in MCF-7 cells. The changes in gene expression observed for HSPG core proteins and related enzymes along with the associated Wnt signaling components suggest coordinated interactions. The influence of HSPGs on cellular proliferation and invasive potential of breast cancer epithelial cells are cell and niche specific. Further studies on the interactions between HSPGs and WNT ligands may yield clinically relevant molecular targets, as well as new biomarkers for characterization of breast cancer progression.

Bucket attack on numeric set watermarking model and safeguards

Numeric set watermarking is a way to provide ownership proof for numerical data. Numerical data can be considered to be primitives for multimedia types such as images and videos since they are organized forms of numeric information. Thereby, the capability to watermark numerical data directly implies the capability to watermark multimedia objects and discourage information theft on social networking sites and the Internet in general. Unfortunately, there has been very limited research done in the field of numeric set watermarking due to underlying limitations in terms of number of items in the set and LSBs in each item available for watermarking. In 2009, Gupta et al. proposed a numeric set watermarking model that embeds watermark bits in the items of the set based on a hash value of the items’ most significant bits (MSBs). If an item is chosen for watermarking, a watermark bit is embedded in the least significant bits, and the replaced bit is inserted in the fractional value to provide reversibility. The authors show their scheme to be resilient against the traditional subset addition, deletion, and modification attacks as well as secondary watermarking attacks. In this paper, we present a bucket attack on this watermarking model. The attack consists of creating buckets of items with the same MSBs and determine if the items of the bucket carry watermark bits. Experimental results show that the bucket attack is very strong and destroys the entire watermark with close to 100% success rate. We examine the inherent weaknesses in the watermarking model of Gupta et al. that leave it vulnerable to the bucket attack and propose potential safeguards that can provide resilience against this attack.

The heparan sulfate proteoglycan (HSPG) glypican-3 mediates commitment of MC3T3-E1 cells toward osteogenesis

Heparan sulfate (HS) sugar chains attached to core proteoglycans (PGs) termed HSPGs mediate an extensive range of cell-extracellular matrix (ECM) and growth factor interactions based upon their sulfation patterns. When compared with non-osteogenic (maintenance media) culture conditions, under established osteogenic culture conditions, MC3T3-E1 cells characteristically increase their osteogenic gene expression profile and switch their dominant fibroblast growth factor receptor (FGFR) from FGFR1 (0.5-fold decrease) to FGFR3 (1.5-fold increase). The change in FGFR expression profile of the osteogenic-committed cultures was reflected by their inability to sustain an FGF-2 stimulus, but respond to BMP-2 at day 14 of culture. The osteogenic cultures decreased their chondroitin and dermatan sulfate PGs (biglycan, decorin, and versican), but increased levels of the HS core protein gene expression, in particular glypican-3. Commitment and progress through osteogenesis is accompanied by changes in FGFR expression, decreased GAG initiation but increased N- and O-sulfation and reduced remodeling of the ECM (decreased heparanase expression) resulting in the production of homogenous (21 kDa) HS chain. With the HSPG glypican-3 expression strongly upregulated in these processes, siRNA was used to knockdown this gene to examine the effect on osteogenic commitment. Reduced glypican-3 abrogated the expression of Runx2, and thus differentiation. The reintroduction of this HSPG into Runx2-null cells allowed osteogenesis to proceed. These results demonstrate the dependence of osteogenesis on specific HS chains, in particular those associated with glypican-3.

Extensions of the cube attack based on low degree annihilators

At Crypto 2008, Shamir introduced a new algebraic attack called the cube attack, which allows us to solve black-box polynomials if we are able to tweak the inputs by varying an initialization vector. In a stream cipher setting where the filter function is known, we can extend it to the cube attack with annihilators: By applying the cube attack to Boolean functions for which we can find low-degree multiples (equivalently annihilators), the attack complexity can be improved. When the size of the filter function is smaller than the LFSR, we can improve the attack complexity further by considering a sliding window version of the cube attack with annihilators. Finally, we extend the cube attack to vectorial Boolean functions by finding implicit relations with low-degree polynomials.

Coordination polymeric structures in the sodium salt of 4-chloro-3-nitrobenzoic acid and the sodium and potassium salts of 4-nitroanthranilic acid

The structures of the hydrated sodium salts of 4-chloro-3-nitrobenzoic acid {poly[aqua(μ4-4-chloro-3-nitrobenzoato)sodium(I)], [Na(C7H3ClNO4)(H2O)]n, (I)} and 2-amino-4-nitrobenzoic acid {poly[μ-aqua-aqua(μ3-2-amino-4-nitrobenzoato)sodium(I)], [Na(C7H5N2O4)(H2O)2]n, (II)}, and the hydrated potassium salt of 2-amino-4-nitrobenzoic acid {poly[μ-aqua-aqua(μ5-2-amino-4-nitrobenzoato)potassium(I)], [K(C7H5N2O4)(H2O)]n, (III)} have been determined and their complex polymeric structures described. All three structures are stabilized by intra- and intermolecular hydrogen bonding and strong π–π ring interactions. In the structure of (I), the distorted trigonal bipyrimidal NaO5 coordination polyhedron comprises a monodentate water molecule and four bridging carboxylate O-atom donors, generating a two-dimensional polymeric structure lying parallel to (001). Intra-layer hydrogen-bonding associations and strong inter-ring π–π interactions are present. Structure (II) has a distorted octahedral NaO6 stereochemistry, with four bridging O-atom donors, two from a single carboxylate group and two from a single nitro group and three from the two water molecules, one of which is bridging. Na centres are linked through centrosymmetric four-membered duplex water bridges and through 18-membered duplex head-to-tail ligand bridges. Similar centrosymmetric bridges are found in the structure of (III), and in both (II) and (III) strong inter-ring π–π interactions are found. A two-dimensional layered structure lying parallel to (010) is generated in (II), whereas in (III) the structure is three-dimensional. With (III), the irregular KO7 coordination polyhedron comprises a doubly bridging water molecule, a single bidentate bridging carboxylate O-atom donor and three bridging O-atom donors from the two nitro groups. A three-dimensional structure is generated. These coordination polymer structures are among the few examples of metal complexes of any type with either 4-chloro-3-nitrobenzoic acid or 4-nitroanthranilic acid.

An attack-localizing watermarking scheme for natural language documents

We present a text watermarking scheme that embeds a bitstream watermark Wi in a text document P preserving the meaning, context, and flow of the document. The document is viewed as a set of paragraphs, each paragraph being a set of sentences. The sequence of paragraphs and sentences used to embed watermark bits is permuted using a secret key. Then, English language sentence transformations are used to modify sentence lengths, thus embedding watermarking bits in the Least Significant Bits (LSB) of the sentences’ cardinalities. The embedding and extracting algorithms are public, while the secrecy and security of the watermark depends on a secret key K. The probability of False Positives is extremely small, hence avoiding incidental occurrences of our watermark in random text documents. Majority voting provides security against text addition, deletion, and swapping attacks, further reducing the probability of False Positives. The scheme is secure against the general attacks on text watermarks such as reproduction (photocopying, FAX), reformatting, synonym substitution, text addition, text deletion, text swapping, paragraph shuffling and collusion attacks.

Converse results to the Wiener attack on RSA

A well-known attack on RSA with low secret-exponent d was given by Wiener about 15 years ago. Wiener showed that using continued fractions, one can efficiently recover the secret-exponent d from the public key (N,e) as long as d < N 1/4. Interestingly, Wiener stated that his attack may sometimes also work when d is slightly larger than N 1/4. This raises the question of how much larger d can be: could the attack work with non-negligible probability for d=N 1/4 + ρ for some constant ρ > 0? We answer this question in the negative by proving a converse to Wiener’s result. Our result shows that, for any fixed ε > 0 and all sufficiently large modulus lengths, Wiener’s attack succeeds with negligible probability over a random choice of d < N δ (in an interval of size Ω(N δ )) as soon as δ > 1/4 + ε. Thus Wiener’s success bound dattack, which are guaranteed to succeed even when δ > 1/4. The known attacks in this class (by Verheul and Van Tilborg and Dujella) run in exponential time, so it is natural to ask whether there exists an attack in this class with subexponential run-time. Our second converse result answers this question also in the negative.

Crossword puzzle attack on NLS

NLS is one of the stream ciphers submitted to the eSTREAM project. We present a distinguishing attack on NLS by Crossword Puzzle (CP) attack method which is introduced in this paper. We build the distinguisher by using linear approximations of both the non-linear feedback shift register (NFSR) and the nonlinear filter function (NLF). Since the bias of the distinguisher depends on the Konst value, which is a key-dependent word, we present the graph showing how the bias of distinguisher vary with Konst. In result, we estimate the bias of the distinguisher to be around O(2^−30). Therefore, we claim that NLS is distinguishable from truly random cipher after observing O(2^60) keystream words. The experiments also show that our distinguishing attack is successful on 90.3% of Konst among 2^32 possible values. We extend the CP attack to NLSv2 which is a tweaked version of NLS. In result, we build a distinguisher which has the bias of around 2− 48. Even though this attack is below the eSTREAM criteria (2^−40), the security margin of NLSv2 seems to be too low.

Distinguishing attack on SOBER-128 with linear masking

We present a distinguishing attack against SOBER-128 with linear masking. We found a linear approximation which has a bias of 2^− − 8.8 for the non-linear filter. The attack applies the observation made by Ekdahl and Johansson that there is a sequence of clocks for which the linear combination of some states vanishes. This linear dependency allows that the linear masking method can be applied. We also show that the bias of the distinguisher can be improved (or estimated more precisely) by considering quadratic terms of the approximation. The probability bias of the quadratic approximation used in the distinguisher is estimated to be equal to O(2^− − 51.8), so that we claim that SOBER-128 is distinguishable from truly random cipher by observing O(2^103.6) keystream words.

Extending FORK-256 attack to the full hash function

In a paper published in FSE 2007, a way of obtaining near-collisions and in theory also collisions for the FORK-256 hash function was presented [8]. The paper contained examples of near-collisions for the compression function, but in practice the attack could not be extended to the full function due to large memory requirements and computation time. In this paper we improve the attack and show that it is possible to find near-collisions in practice for any given value of IV. In particular, this means that the full hash function with the prespecified IV is vulnerable in practice, not just in theory. We exhibit an example near-collision for the complete hash function.

How should future building structure and emergency response cope with bushfire attack?

Bushfires are regular occurrences in the Australian landscape which can, under adverse weather conditions, give rise to losses of life, property, infrastructure, environmental and cultural values. Where property loss is involved, historical surveys of house losses have focussed on ember, radiant heat and flame contact as key bushfire attack mechanisms. Although often noted, little work has been done to quantify the impact of fire generated or fire enhanced wind and pyro-convective events on house loss and to improve construction practice within Australia. It is well known that strong winds are always associated with bushfire events. It is less well known, although increasingly shown through anecdotal evidence, that bushfires are not a passive companion of wind, but indeed they interact with winds and can together cause significant damages to exposed buildings and ecological structures. Previous studies have revealed the effects of wind, fire and structure interactions with the result of increased pressure coefficient distributions on the windward side of a building downstream of a fire front. This paper presents a further analysis of the result in relations to the relevant standards and fire weather conditions. A review of wind code and bushfire code was conducted. Based on the result of the current study, the authors believe it is necessary to consider wind as an attack mechanism in bushfire events. The results of the study will also have implications on bushfire emergency management, design of emergency shelters, perception of danger, emergency evacuation and on risk assessment.

Multiple modular additions and crossword puzzle attack on NLSv2

NLS is a stream cipher which was submitted to the eSTREAM project. A linear distinguishing attack against NLS was presented by Cho and Pieprzyk, which was called Crossword Puzzle (CP) attack. NLSv2 is a tweak version of NLS which aims mainly at avoiding the CP attack. In this paper, a new distinguishing attack against NLSv2 is presented. The attack exploits high correlation amongst neighboring bits of the cipher. The paper first shows that the modular addition preserves pairwise correlations as demonstrated by existence of linear approximations with large biases. Next, it shows how to combine these results with the existence of high correlation between bits 29 and 30 of the S-box to obtain a distinguisher whose bias is around 2^−37. Consequently, we claim that NLSv2 is distinguishable from a random cipher after observing around 2^74 keystream words.

Detection of sinkhole attack in wireless sensor networks

Generally wireless sensor networks rely of many-to-one communication approach for data gathering. This approach is extremely susceptible to sinkhole attack, where an intruder attracts surrounding nodes with unfaithful routing information, and subsequently presents selective forwarding or change the data that carry through it. A sinkhole attack causes an important threat to sensor networks and it should be considered that the sensor nodes are mostly spread out in open areas and of weak computation and battery power. In order to detect the intruder in a sinkhole attack this paper suggests an algorithm which firstly finds a group of suspected nodes by analyzing the consistency of data. Then, the intruder is recognized efficiently in the group by checking the network flow information. The proposed algorithm's performance has been evaluated by using numerical analysis and simulations. Therefore, accuracy and efficiency of algorithm would be verified.