Efficient asymmetric inclusion of regular expressions with interleaving and counting for XML type-checking

The inclusion of Regular Expressions (REs) is the kernel of any type-checking algorithm for XML manipulation languages. XML applications would benefit from the extension of REs with interleaving and counting, but this is not feasible in general, since inclusion is EXPSPACE-complete for such extended REs. In Colazzo et al. (2009) [1] we introduced a notion of ?conflict-free REs?, which are extended REs with excellent complexity behaviour, including a polynomial inclusion algorithm [1] and linear membership (Ghelli et al., 2008 [2]). Conflict-free REs have interleaving and counting, but the complexity is tamed by the ?conflict-free? limitations, which have been found to be satisfied by the vast majority of the content models published on the Web.However, a type-checking algorithm needs to compare machine-generated subtypes against human-defined supertypes. The conflict-free restriction, while quite harmless for the human-defined supertype, is far too restrictive for the subtype. We show here that the PTIME inclusion algorithm can be actually extended to deal with totally unrestricted REs with counting and interleaving in the subtype position, provided that the supertype is conflict-free.This is exactly the expressive power that we need in order to use subtyping inside type-checking algorithms, and the cost of this generalized algorithm is only quadratic, which is as good as the best algorithm we have for the symmetric case (see [1]). The result is extremely surprising, since we had previously found that symmetric inclusion becomes NP-hard as soon as the candidate subtype is enriched with binary intersection, a generalization that looked much more innocent than what we achieve here

HL-1 cells express an inwardly rectifying K+ current activated via muscarinic receptors comparable to that in mouse atrial myocytes

An inwardly rectifying K^+ current is present in atrial cardiac myocytes that is activated by acetylcholine (I_{KACh}). Physiologically, activation of the current in the SA node is important in slowing the heart rate with increased parasympathetic tone. It is a paradigm for the direct regulation of signaling effectors by the Gβγ G-protein subunit. Many questions have been addressed in heterologous expression systems with less focus on the behaviour in native myocytes partly because of the technical difficulties in undertaking comparable studies in native cells. In this study, we characterise a potassium current in the atrial-derived cell line HL-1. Using an electrophysiological approach, we compare the characteristics of the potassium current with those in native atrial cells and in a HEK cell line expressing the cloned Kir3.1/3.4 channel. The potassium current recorded in HL-1 is inwardly rectifying and activated by the muscarinic agonist carbachol. Carbachol-activated currents were inhibited by pertussis toxin and tertiapin-Q. The basal current was time-dependently increased when GTP was substituted in the patch-clamp pipette by the non-hydrolysable analogue GTPγS. We compared the kinetics of current modulation in HL-1 with those of freshly isolated atrial mouse cardiomyocytes. The current activation and deactivation kinetics in HL-1 cells are comparable to those measured in atrial cardiomyocytes. Using immunofluorescence, we found GIRK4 at the membrane in HL-1 cells. Real-time RT-PCR confirms the presence of mRNA for the main G-protein subunits, as well as for M2 muscarinic and A1 adenosine receptors. The data suggest HL-1 cells are a good model to study IKAch

PENGARUH SUBSTITUSI TEPUNG CANGKANG TELUR DAN TEPUNG IKAN TERI (Stolephorus sp) TERHADAP SIFAT ORGANOLEPTIK (Cookies) SEBAGAI PMT BALITA STUNTING

Pengaruh Substitusi Tepung Cangkang Telur Dan Tepung Ikan Teri (Stolephorus sp) Terhadap Sifat Organoleptik (Cookies) Sebagai PMT Balita Stunting (Dimbimbing oleh Thobianus Hasan S,Si.,MPH) Email : [email protected] Poltekkes Kemenkes Kupang Prodi Gizi xiv + 79 halaman : gambar, tabel, lampiran. Latar belakang :Stunting adalah kondisi kurang gizi anak balita dan anak sekolah dijangka panjang. Stunting disebabkan oleh kurangnya konsumsi zat gizi kalsium dan protein yang akan berpengaruh pada pertumbuhan tinggi badan, pertumbuhan tulang, serta volume sel otak anak menurun. Cookies yaitu produk berahan utama terigu, jadi dilakukan substitusi tepung cangkang telur juga tepung ikan teri bertujuan meningkatkan nilai tambah tepung cangkang telur dan tepung ikan teri juga mengurangi tepung terigu sebagai bahan baku cookies. Tujuan : Penelitian ini bertujuan untuk mengetahui pengaruh substitusi tepung cangkang telur dan ikan teri (stolephorus sp) terhadap sifat organoleptic (coookies). Metode Penelitian : Eksperimen dengan menggunakan Rancangan Acak Lengkap (RAL) dengan 4 perlakuan. Analisis data menggunakan Oneway Anova pada Tingkat kepercayaan 95%. Jika ada perbedaan akan dilanjutkan dengan uji Tukey. Hasil : Substitusi tepung cangkang telur, tepung ikan teri dan tepung terigu meliputi warna, rasa, tekstur, dan rasa yang paling disukai adalah (P1: 50%, 5%, 112,5%). Untuk nilai gizi yang paling tinggi adalah P2 dengan nilai gizi Energi: 2.271 gram, Protein 73,79 gram, lemak 128,6 gram, karbohidrat 212,1 gram, kalsium 1.507 gram, serat 3,4 gram fosfor 523,6 mg dan air 1,54 gram. Kesimpulan : Dari penelitan ini penulis merekomendasikan perlakuan P2 dengan substitusi Tepung Cangkang telur (60%) : Tepung Ikan teri (10%) Kata kunci :Stunting, Tepung cangkang telur, Tepung ikan teri,Cookies, Organoleptik, Substitusi

A Type System for Interactive JSON Schema Inference (Extended Abstract)

In this paper we present the first JSON type system that provides the possibility of inferring a schema by adopting different levels of precision/succinctness for different parts of the dataset, under user control. This feature gives the data analyst the possibility to have detailed schemas for parts of the data of greater interest, while more succinct schema is provided for other parts, and the decision can be changed as many times as needed, in order to explore the schema in a gradual fashion, moving the focus to different parts of the collection, without the need of reprocessing data and by only performing type rewriting operations on the most precise schema

Modulation of redox signaling in chronic diseases and regenerative medicine

Not availabl

Schema Inference for Massive JSON Datasets

In the recent years JSON affirmed as a very popular data format for representing massive data collections. JSON data collections are usually schemaless. While this ensures sev- eral advantages, the absence of schema information has im- portant negative consequences: the correctness of complex queries and programs cannot be statically checked, users cannot rely on schema information to quickly figure out the structural properties that could speed up the formulation of correct queries, and many schema-based optimizations are not possible. In this paper we deal with the problem of inferring a schema from massive JSON datasets. We first identify a JSON type language which is simple and, at the same time, expressive enough to capture irregularities and to give com- plete structural information about input data. We then present our main contribution, which is the design of a schema inference algorithm, its theoretical study, and its implemen- tation based on Spark, enabling reasonable schema infer- ence time for massive collections. Finally, we report about an experimental analysis showing the effectiveness of our ap- proach in terms of execution time, precision, and conciseness of inferred schemas, and scalability

Everything You Always Wanted to Know About JSON Schema (But Were Afraid to Ask)

The last few years have seen the ubiquitous diffusion of JSON as one of the most widely used formats for publishing and interchanging data, as it combines the flexibility of semistructured data models with well-known data structures like records and arrays. While various schema languages for describing JSON data have been proposed in the past, e.g., JSound and Joi, JSON Schema established itself as de-facto standard schema language for JSON data. The main aim of this tutorial is to provide the audience with the basic notions for exploiting JSON Schema while processing and manipulating JSON data. This tutorial focuses on four main aspects: (1) we first describe Classical JSON Schema and introduce the features that are shared with the latest versions of the specification; (2) we introduce, then, Modern JSON Schema, explain why it differs from Classical JSON Schema, and discuss its novel evaluation model; (3) we analyze tools that support or exploit JSON Schema, like, for example, validators and data generators; and (4) we highlight open research challenges and opportunities related to JSON Schema

La restauración de las obras contemporáneas en el Opificio delle Pietre Dure de Florencia

Artículo de anuarioEl Opificio delle Pietre Dure (OPD) es un instituto central del Ministerio de los Bienes, de las Actividades Culturales y del Turismo del Estado italiano, en el que se trabajan sobre obras de cada período histórico, desde el campo arqueológico al del arte contemporáneo. En este ámbito, el Instituto se ocupó de la restauración de obras polimateriales, entre las que se encuentran el Gran Legno, de Alberto Burri, Cette obscure clarté qui tombe des étoile, de Anselm Kiefer, y el Memoriale Italiano, de Auschwitz, actualmente en restauración. Muchas fueron las obras sobre papel de los siglos XX y XXI restauradas por el Opificio, como dibujos de Mino Maccari, Franco Zeffirelli y Federico Fellini, de las que aquí informamos brevementeFil:Montalbano, Letizia.Opificio delle Pietre Dure, Florencia, Italia.Fil:Sartiani, Oriana. Opificio delle Pietre Dure, Florencia, Italia.Fil:Burucúa, Lucio. Universidad Nacional de San Martín, Buenos Aires, Argentina