Greater Expectations?

Physically Unclonable Functions (PUFs) are key tools in the construction of lightweight authentication and key exchange protocols. So far, all existing PUF-based authentication protocols follow the same paradigm: A resource-constrained prover, holding a PUF, wants to authenticate to a resource-rich verifier, who has access to a database of pre-measured PUF challenge-response pairs (CRPs). In this paper we consider application scenarios where all previous PUF-based authentication schemes fail to work: The verifier is resource-constrained (and holds a PUF), while the prover is resource-rich (and holds a CRP-database). We construct the first and efficient PUF-based authentication protocol for this setting, which we call converse PUF-based authentication. We provide an extensive security analysis against passive adversaries, show that a minor modification also allows for authenticated key exchange and propose a concrete instantiation using controlled Arbiter PUFs

Practical computational toolkits for dendrimers and dendrons structure design

Dendrimers and dendrons offer an excellent platform for developing novel drug delivery systems and medicines. The rational design and further development of these repetitively branched systems are restricted by difficulties in scalable synthesis and structural determination, which can be overcome by judicious use of molecular modelling and molecular simulations. A major difficulty to utilise in silico studies to design dendrimers lies in the laborious generation of their structures. Current modelling tools utilise automated assembly of simpler dendrimers or the inefficient manual assembly of monomer precursors to generate more complicated dendrimer structures. Herein we describe two novel graphical user interface (GUI) toolkits written in Python that provide an improved degree of automation for rapid assembly of dendrimers and generation of their 2D and 3D structures. Our first toolkit uses the RDkit library, SMILES nomenclature of monomers and SMARTS reaction nomenclature to generate SMILES and mol files of dendrimers without 3D coordinates. These files are used for simple graphical representations and storing their structures in databases. The second toolkit assembles complex topology dendrimers from monomers to construct 3D dendrimer structures to be used as starting points for simulation using existing and widely available software and force fields. Both tools were validated for ease-of-use to prototype dendrimer structure and the second toolkit was especially relevant for dendrimers of high complexity and size.Peer reviewe

Formation of different magnetic phases and high Curie temperature ferromagnetism in Fe57-implanted ZnO film

© 2014 Elsevier B.V. All rights reserved. We investigated magnetic properties of ZnO thin film implanted with Fe57 ions to the fluence of 1.00×1017 ions/cm2. Both vibrating sample magnetometry and magneto-optical Kerr effect measurements revealed strong room temperature ferromagnetism with similar hysteresis loops. Temperature dependent measurements showed a very high Curie temperature around 850 K. Conversion electron Mössbauer spectroscopy experiments proved the existence of paramagnetic Fe+3 and Fe+2 ions and also the presence of substitutional Fe atoms in the hexagonal ZnO crystal resulting in intrinsic ferromagnetic order

Shelf-derived iron inputs drive biological productivity in the southern Drake Passage

Author Posting. © American Geophysical Union, 2009. This article is posted here by permission of American Geophysical Union for personal use, not for redistribution. The definitive version was published in Global Biogeochemical Cycles 23 (2009): GB4014, doi:10.1029/2008GB003406.In the Southern Ocean near the Antarctic Peninsula, Antarctic Circumpolar Current (ACC) fronts interact with shelf waters facilitating lateral transport of shelf-derived components such as iron into high-nutrient offshore regions. To trace these shelf-derived components and estimate lateral mixing rates of shelf water, we used naturally occurring radium isotopes. Short-lived radium isotopes were used to quantify the rates of shelf water entrainment while Fe/228Ra ratios were used to calculate the Fe flux. In the summer of 2006 we found rapid mixing and significant lateral iron export, namely, a dissolved iron flux of 1.1 × 105 mol d−1 and total acid leachable iron flux of 1.1 × 106 mol d−1 all of which is transported in the mixed layer from the shelf region offshore. This dissolved iron flux is significant, especially considering that the bloom observed in the offshore region (0.5–2 mg chl a m−3) had an iron demand of 1.1 to 4 × 105 mol Fe. Net vertical export fluxes of particulate Fe derived from 234Th/238U disequilibrium and Fe/234Th ratios accounted for only about 25% of the dissolved iron flux. On the other hand, vertical upward mixing of iron rich deeper waters provided only 7% of the lateral dissolved iron flux. We found that similarly to other studies in iron-fertilized regions of the Southern Ocean, lateral fluxes overwhelm vertical inputs and vertical export from the water column and support significant phytoplankton blooms in the offshore regions of the Drake Passage.This work was funded by the National Science Foundation (ANT-0443869 to M.A.C.)

Intelligent Health Monitoring of Machine Bearings Based on Feature Extraction

This document is the Accepted Manuscript of the following article: Mohammed Chalouli, Nasr-eddine Berrached, and Mouloud Denai, ‘Intelligent Health Monitoring of Machine Bearings Based on Feature Extraction’, Journal of Failure Analysis and Prevention, Vol. 17 (5): 1053-1066, October 2017. Under embargo. Embargo end date: 31 August 2018. The final publication is available at Springer via DOI: https://doi.org/10.1007/s11668-017-0343-y.Finding reliable condition monitoring solutions for large-scale complex systems is currently a major challenge in industrial research. Since fault diagnosis is directly related to the features of a system, there have been many research studies aimed to develop methods for the selection of the relevant features. Moreover, there are no universal features for a particular application domain such as machine diagnosis. For example, in machine bearing fault diagnosis, these features are often selected by an expert or based on previous experience. Thus, for each bearing machine type, the relevant features must be selected. This paper attempts to solve the problem of relevant features identification by building an automatic fault diagnosis process based on relevant feature selection using a data-driven approach. The proposed approach starts with the extraction of the time-domain features from the input signals. Then, a feature reduction algorithm based on cross-correlation filter is applied to reduce the time and cost of the processing. Unsupervised learning mechanism using K-means++ selects the relevant fault features based on the squared Euclidian distance between different health states. Finally, the selected features are used as inputs to a self-organizing map producing our health indicator. The proposed method is tested on roller bearing benchmark datasets.Peer reviewe

Review of seasonal heat storage in large basins: water tanks and gravel-water pits

In order to respond to climatic change, many efforts have been made to reduce harmful gas emissions. According to energy policies, an important goal is the implementation of renewable energy sources, as well as electrical and oil combustion savings through energy conservation. This paper focuses on an extensive review of the technologies developed, so far, for central solar heating systems employing seasonal sensible water storage in artificial large scale basins. Among technologies developed since the late 70s, the use of underground spaces as an energy storage medium - Underground Thermal Energy Storage (UTES) - has been investigated and closely observed in experimental plants in many countries, most of them, as part of government programmes. These projects attempt to optimise technical and economic aspects within an international knowledge exchange; as a result, UTES is becoming a reliable option to save energy through energy conservation. Other alternatives to UTES include large water tanks and gravel-water pits, also called man-made or artificial aquifers. This implies developing this technology by construction and leaving natural aquifers untouched. The present article reviews most studies and results obtained in this particular area to show the technical and economical feasibility for each system and specifics problems occurred during construction and operation. Advantages and disadvantages are pointed out to compare both alternatives. The projects discussed have been carried out mainly in European states with some references to other countries

FMAP: Distributed Cooperative Multi-Agent Planning

This paper proposes FMAP (Forward Multi-Agent Planning), a fully-distributed multi-agent planning method that integrates planning and coordination. Although FMAP is specifically aimed at solving problems that require cooperation among agents, the flexibility of the domain-independent planning model allows FMAP to tackle multi-agent planning tasks of any type. In FMAP, agents jointly explore the plan space by building up refinement plans through a complete and flexible forward-chaining partial-order planner. The search is guided by h D T G , a novel heuristic function that is based on the concepts of Domain Transition Graph and frontier state and is optimized to evaluate plans in distributed environments. Agents in FMAP apply an advanced privacy model that allows them to adequately keep private information while communicating only the data of the refinement plans that is relevant to each of the participating agents. Experimental results show that FMAP is a general-purpose approach that efficiently solves tightly-coupled domains that have specialized agents and cooperative goals as well as loosely-coupled problems. Specifically, the empirical evaluation shows that FMAP outperforms current MAP systems at solving complex planning tasks that are adapted from the International Planning Competition benchmarks.This work has been partly supported by the Spanish MICINN under projects Consolider Ingenio 2010 CSD2007-00022 and TIN2011-27652-C03-01, the Valencian Prometeo project II/2013/019, and the FPI-UPV scholarship granted to the first author by the Universitat Politecnica de Valencia.Torreño Lerma, A.; Onaindia De La Rivaherrera, E.; Sapena Vercher, O. (2014). FMAP: Distributed Cooperative Multi-Agent Planning. Applied Intelligence. 41(2):606-626. https://doi.org/10.1007/s10489-014-0540-2S606626412Benton J, Coles A, Coles A (2012) Temporal planning with preferences and time-dependent continuous costs. In: Proceedings of the 22nd international conference on automated planning and scheduling (ICAPS). AAAI, pp 2–10Borrajo D. (2013) Multi-agent planning by plan reuse. In: Proceedings of the 12th international conference on autonomous agents and multi-agent systems (AAMAS). IFAAMAS, pp 1141–1142Boutilier C, Brafman R (2001) Partial-order planning with concurrent interacting actions. J Artif Intell Res 14(105):136Brafman R, Domshlak C (2008) From one to many: planning for loosely coupled multi-agent systems. In: Proceedings of the 18th international conference on automated planning and scheduling (ICAPS). AAAI, pp 28–35Brenner M, Nebel B (2009) Continual planning and acting in dynamic multiagent environments. J Auton Agents Multiagent Syst 19(3):297–331Bresina J, Dearden R, Meuleau N, Ramakrishnan S, Smith D, Washington R (2002) Planning under continuous time and resource uncertainty: a challenge for AI. In: Proceedings of the 18th conference on uncertainty in artificial intelligence (UAI). Morgan Kaufmann, pp 77–84Cox J, Durfee E (2009) Efficient and distributable methods for solving the multiagent plan coordination problem. Multiagent Grid Syst 5(4):373–408Crosby M, Rovatsos M, Petrick R (2013) Automated agent decomposition for classical planning. In: Proceedings of the 23rd international conference on automated planning and scheduling (ICAPS). AAAI, pp 46–54Dimopoulos Y, Hashmi MA, Moraitis P (2012) μ-satplan: Multi-agent planning as satisfiability. Knowl-Based Syst 29:54–62Fikes R, Nilsson N (1971) STRIPS: a new approach to the application of theorem proving to problem solving. Artif Intell 2(3):189–208Gerevini A, Haslum P, Long D, Saetti A, Dimopoulos Y (2009) Deterministic planning in the fifth international planning competition: PDDL3 and experimental evaluation of the planners. Artif Intell 173(5-6):619–668Ghallab M, Nau D, Traverso P (2004) Automated planning. Theory and practice. Morgan KaufmannGünay A, Yolum P (2013) Constraint satisfaction as a tool for modeling and checking feasibility of multiagent commitments. Appl Intell 39(3):489–509Helmert M (2004) A planning heuristic based on causal graph analysis. In: Proceedings of the 14th international conference on automated planning and scheduling ICAPS. AAAI, pp 161–170Hoffmann J, Nebel B (2001) The FF planning system: fast planning generation through heuristic search. J Artif Intell Res 14:253–302Jannach D, Zanker M (2013) Modeling and solving distributed configuration problems: a CSP-based approach. IEEE Trans Knowl Data Eng 25(3):603–618Jonsson A, Rovatsos M (2011) Scaling up multiagent planning: a best-response approach. In: Proceedings of the 21st international conference on automated planning and scheduling (ICAPS). AAAI, pp 114–121Kala R, Warwick K (2014) Dynamic distributed lanes: motion planning for multiple autonomous vehicles. Appl Intell:1–22Koehler J, Ottiger D (2002) An AI-based approach to destination control in elevators. AI Mag 23(3):59–78Kovacs DL (2011) Complete BNF description of PDDL3.1. Technical reportvan der Krogt R (2009) Quantifying privacy in multiagent planning. Multiagent Grid Syst 5(4):451–469Kvarnström J (2011) Planning for loosely coupled agents using partial order forward-chaining. In: Proceedings of the 21st international conference on automated planning and scheduling (ICAPS). AAAI, pp 138–145Lesser V, Decker K, Wagner T, Carver N, Garvey A, Horling B, Neiman D, Podorozhny R, Prasad M, Raja A et al (2004) Evolution of the GPGP/TAEMS domain-independent coordination framework. Auton Agents Multi-Agent Syst 9(1–2):87–143Long D, Fox M (2003) The 3rd international planning competition: results and analysis. J Artif Intell Res 20:1–59Nissim R, Brafman R, Domshlak C (2010) A general, fully distributed multi-agent planning algorithm. In: Proceedings of the 9th international conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 1323–1330O’Brien P, Nicol R (1998) FIPA - towards a standard for software agents. BT Tech J 16(3):51–59Öztürk P, Rossland K, Gundersen O (2010) A multiagent framework for coordinated parallel problem solving. Appl Intell 33(2):132–143Pal A, Tiwari R, Shukla A (2013) Communication constraints multi-agent territory exploration task. Appl Intell 38(3):357–383Richter S, Westphal M (2010) The LAMA planner: guiding cost-based anytime planning with landmarks. J Artif Intell Res 39(1):127–177de la Rosa T, García-Olaya A, Borrajo D (2013) A case-based approach to heuristic planning. Appl Intell 39(1):184–201Sapena O, Onaindia E (2008) Planning in highly dynamic environments: an anytime approach for planning under time constraints. Appl Intell 29(1):90–109Sapena O, Onaindia E, Garrido A, Arangú M (2008) A distributed CSP approach for collaborative planning systems. Eng Appl Artif Intell 21(5):698–709Serrano E, Such J, Botía J, García-Fornes A (2013) Strategies for avoiding preference profiling in agent-based e-commerce environments. Appl Intell:1–16Smith D, Frank J, Jónsson A (2000) Bridging the gap between planning and scheduling. Knowl Eng Rev 15(1):47–83Such J, García-Fornes A, Espinosa A, Bellver J (2012) Magentix2: a privacy-enhancing agent platform. Eng Appl Artif Intell:96–109Tonino H, Bos A, de Weerdt M, Witteveen C (2002) Plan coordination by revision in collective agent based systems. Artif Intell 142(2):121–145Torreño A, Onaindia E, Sapena O (2012) An approach to multi-agent planning with incomplete information. In: Proceedings of the 20th European conference on artificial intelligence (ECAI), vol 242. IOS Press, pp 762–767Torreño A, Onaindia E, Sapena O (2014) A flexible coupling approach to multi-agent planning under incomplete information. Knowl Inf Syst 38(1):141–178Van Der Krogt R, De Weerdt M (2005) Plan repair as an extension of planning. In: Proceedings of the 15th international conference on automated planning and scheduling (ICAPS). AAAI, pp 161–170de Weerdt M, Clement B (2009) Introduction to planning in multiagent systems. Multiagent Grid Syst 5(4):345– 355Yokoo M, Durfee E, Ishida T, Kuwabara K (1998) The distributed constraint satisfaction problem: formalization and algorithms. IEEE Trans Knowl Data Eng 10(5):673–685Zhang J, Nguyen X, Kowalczyk R (2007) Graph-based multi-agent replanning algorithm. In: Proceedings of the 6th international joint conference conference on autonomous agents and multiagent systems (AAMAS). IFAAMAS, pp 798–80

Validation of a Novel, Sensitive, and Specific Urine-Based Test for Recurrence Surveillance of Patients With Non-Muscle-Invasive Bladder Cancer in a Comprehensive Multicenter Study

Bladder cancer (BC), the most frequent malignancy of the urinary system, is ranked the sixth most prevalent cancer worldwide. Of all newly diagnosed patients with BC, 70–75% will present disease confined to the mucosa or submucosa, the non-muscle-invasive BC (NMIBC) subtype. Of those, approximately 70% will recur after transurethral resection (TUR). Due to high rate of recurrence, patients are submitted to an intensive follow-up program maintained throughout many years, or even throughout life, resulting in an expensive follow-up, with cystoscopy being the most cost-effective procedure for NMIBC screening. Currently, the gold standard procedure for detection and follow-up of NMIBC is based on the association of cystoscopy and urine cytology. As cystoscopy is a very invasive approach, over the years, many different noninvasive assays (both based in serum and urine samples) have been developed in order to search genetic and protein alterations related to the development, progression, and recurrence of BC. TERT promoter mutations and FGFR3 hotspot mutations are the most frequent somatic alterations in BC and constitute the most reliable biomarkers for BC. Based on these, we developed an ultra-sensitive, urine-based assay called Uromonitor®, capable of detecting trace amounts of TERT promoter (c.1-124C > T and c.1-146C > T) and FGFR3 (p.R248C and p.S249C) hotspot mutations, in tumor cells exfoliated to urine samples. Cells present in urine were concentrated by the filtration of urine through filters where tumor cells are trapped and stored until analysis, presenting long-term stability. Detection of the alterations was achieved through a custom-made, robust, and highly sensitive multiplex competitive allele-specific discrimination PCR allowing clear interpretation of results. In this study, we validate a test for NMIBC recurrence detection, using for technical validation a total of 331 urine samples and 41 formalin-fixed paraffin-embedded tissues of the primary tumor and recurrence lesions from a large cluster of urology centers. In the clinical validation, we used 185 samples to assess sensitivity/specificity in the detection of NMIBC recurrence vs. cystoscopy/cytology and in a smaller cohort its potential as a primary diagnostic tool for NMIBC. Our results show this test to be highly sensitive (73.5%) and specific (93.2%) in detecting recurrence of BC in patients under surveillance of NMIBC.This study was supported by FCT (“Portuguese Foundation for Science and Technology”) through a PhD grant to RB (SFRH/ BD/111321/2015). Further funding was obtained from the project “Advancing cancer research: from basic knowledge to application” NORTE-01-0145-FEDER-000029: “Projetos Estruturados de I & D & I,” funded by Norte 2020—Programa Operacional Regional do Norte. This article is a result of the project PTDC/MED-ONC/31438/2017 (The Other Faces of Telomerase: Looking beyond Tumor Immortalization), supported by Norte Portugal Regional Operational Programme (NORTE 2020), under the PORTUGAL 2020 Partnership Agreement, through the European Regional Development Fund (ERDF), COMPETE 2020—Operacional Programme for Competitiveness and Internationalisation (POCI) and by Portuguese funds through FCT. Further funding by the European Regional Development Fund (ERDF) through the Operational Programme for Competitiveness and Internationalisation— COMPETE 2020, and Portuguese national funds via FCT, under project POCI-01-0145-FEDER-016390:CANCEL STEM

Identification of KIF21A mutations as a rare cause of congenital fibrosis of the extraocular muscles type 3 (CFEOM3).

PURPOSE. Three congenital fibrosis of the extraocular muscles phenotypes (CFEOM1-3) have been identified. Each represents a specific form of paralytic strabismus characterized by congenital restrictive ophthalmoplegia, often with accompanying ptosis. It has been demonstrated that CFEOM1 results from mutations in KIF21A and CFEOM2 from mutations in PHOX2A. This study was conducted to determine the incidence of KIF21A and PHOX2A mutations among individuals with the third CFEOM phenotype, CFEOM3. METHODS. All pedigrees and sporadic individuals with CFEOM3 in the authors' database were identified, whether the pedigrees were linked or consistent with linkage to the FEOM1, FEOM2, and/or FEOM3 loci was determined, and the appropriate pedigrees and the sporadic individuals were screened for mutations in KIF21A and PHOX2A. RESULTS. Twelve CFEOM3 pedigrees and 10 CFEOM3 sporadic individuals were identified in the database. The structures of eight of the pedigrees permitted the generation of meaningful linkage data. KIF21A was screened in 17 probands, and mutations were identified in two CFEOM3 pedigrees. One pedigree harbored a novel mutation (2841G-->A, M947I) and one harbored the most common and recurrent of the CFEOM1 mutations identified previously (2860C-->T, R954W). None of CFEOM3 pedigrees or sporadic individuals harbored mutations in PHOX2A. CONCLUSIONS. The results demonstrate that KIF21A mutations are a rare cause of CFEOM3 and that KIF21A mutations can be nonpenetrant. Although KIF21A is the first gene to be associated with CFEOM3, the results imply that mutations in the unidentified FEOM3 gene are the more common cause of this phenotype