<> <http://www.w3.org/2000/01/rdf-schema#comment> "The repository administrator has not yet configured an RDF license."^^<http://www.w3.org/2001/XMLSchema#string> .
<> <http://xmlns.com/foaf/0.1/primaryTopic> <http://www.eledia.org/students-reports/id/eprint/192> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Thesis> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Article> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/title> "Optimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/ontology/bibo/abstract> "Negli array lineari di grandi dimensioni utilizzati nel radar tracking le eccitazioni necessarie alla generazione di patterns di tipo soma e differenza sono tipicamente di tipo (ON/OFF). Array di questo tipo sono detti thinned. \r\nLa necessità di ridurre la complessità hw, l’ingombro del sistema ‘Antenna’ (elemento radiante ed alimentazione) e d’altra parte aumentarne l?efficienza ha portato all’introduzione di una nuova tecnica detta ‘interleaved’ in cui pattern differenti sono generati da elementi che si trovano sullo stesso array lineare.\r\n"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/date> "2005" .
<http://www.eledia.org/students-reports/id/document/5195> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://purl.org/ontology/bibo/Document> .
<http://www.eledia.org/students-reports/id/org/ext-adc2a6a34f7668580a664f4a292d7852> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<http://www.eledia.org/students-reports/id/org/ext-adc2a6a34f7668580a664f4a292d7852> <http://xmlns.com/foaf/0.1/name> "University of Trento"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/issuer> <http://www.eledia.org/students-reports/id/org/ext-adc2a6a34f7668580a664f4a292d7852> .
<http://www.eledia.org/students-reports/id/org/ext-62cb29e4e017dd6ade47c5b5f1320c67> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Organization> .
<http://www.eledia.org/students-reports/id/org/ext-62cb29e4e017dd6ade47c5b5f1320c67> <http://xmlns.com/foaf/0.1/name> "ELEDIA Research Center@DISI, University of Trento"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/org/ext-62cb29e4e017dd6ade47c5b5f1320c67> <http://purl.org/dc/terms/isPartOf> <http://www.eledia.org/students-reports/id/org/ext-adc2a6a34f7668580a664f4a292d7852> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/issuer> <http://www.eledia.org/students-reports/id/org/ext-62cb29e4e017dd6ade47c5b5f1320c67> .
<http://www.eledia.org/students-reports/id/org/ext-adc2a6a34f7668580a664f4a292d7852> <http://purl.org/dc/terms/hasPart> <http://www.eledia.org/students-reports/id/org/ext-62cb29e4e017dd6ade47c5b5f1320c67> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/ontology/bibo/status> <http://purl.org/ontology/bibo/status/published> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/creator> <http://www.eledia.org/students-reports/id/person/ext-d772d90908704dc6afe74e5f153cb319> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/ontology/bibo/authorList> <http://www.eledia.org/students-reports/id/eprint/192#authors> .
<http://www.eledia.org/students-reports/id/eprint/192#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_1> <http://www.eledia.org/students-reports/id/person/ext-d772d90908704dc6afe74e5f153cb319> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/creator> <http://www.eledia.org/students-reports/id/person/ext-bbcd32701372bbe2e7bdbcbf225bb9b8> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/ontology/bibo/authorList> <http://www.eledia.org/students-reports/id/eprint/192#authors> .
<http://www.eledia.org/students-reports/id/eprint/192#authors> <http://www.w3.org/1999/02/22-rdf-syntax-ns#_2> <http://www.eledia.org/students-reports/id/person/ext-bbcd32701372bbe2e7bdbcbf225bb9b8> .
<http://www.eledia.org/students-reports/id/person/ext-d772d90908704dc6afe74e5f153cb319> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<http://www.eledia.org/students-reports/id/person/ext-d772d90908704dc6afe74e5f153cb319> <http://xmlns.com/foaf/0.1/givenName> "M."^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/person/ext-d772d90908704dc6afe74e5f153cb319> <http://xmlns.com/foaf/0.1/familyName> "Broilo"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/person/ext-d772d90908704dc6afe74e5f153cb319> <http://xmlns.com/foaf/0.1/name> "M. Broilo"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/person/ext-bbcd32701372bbe2e7bdbcbf225bb9b8> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://xmlns.com/foaf/0.1/Person> .
<http://www.eledia.org/students-reports/id/person/ext-bbcd32701372bbe2e7bdbcbf225bb9b8> <http://xmlns.com/foaf/0.1/givenName> "M."^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/person/ext-bbcd32701372bbe2e7bdbcbf225bb9b8> <http://xmlns.com/foaf/0.1/familyName> "Merler"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/person/ext-bbcd32701372bbe2e7bdbcbf225bb9b8> <http://xmlns.com/foaf/0.1/name> "M. Merler"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/EPrint> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/ThesisEPrint> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/isPartOf> <http://www.eledia.org/students-reports/id/repository> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://eprints.org/ontology/hasDocument> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5195> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://www.eledia.org/students-reports/id/document/5195> <http://www.w3.org/2000/01/rdf-schema#label> "Optimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays (Text)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/document/5195> <http://eprints.org/ontology/hasFile> <http://www.eledia.org/students-reports/192/1/Abstract.A054.pdf> .
<http://www.eledia.org/students-reports/id/document/5195> <http://purl.org/dc/terms/hasPart> <http://www.eledia.org/students-reports/192/1/Abstract.A054.pdf> .
<http://www.eledia.org/students-reports/192/1/Abstract.A054.pdf> <http://www.w3.org/2000/01/rdf-schema#label> "Abstract.A054.pdf"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://eprints.org/ontology/hasDocument> <http://www.eledia.org/students-reports/id/document/5203> .
<http://www.eledia.org/students-reports/id/document/5203> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://www.eledia.org/students-reports/id/document/5203> <http://www.w3.org/2000/01/rdf-schema#label> "Optimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/document/5203> <http://eprints.org/relation/isVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5203> <http://eprints.org/relation/isVolatileVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5203> <http://eprints.org/relation/islightboxThumbnailVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5203> <http://eprints.org/ontology/hasFile> <http://www.eledia.org/students-reports/192/2/lightbox.jpg> .
<http://www.eledia.org/students-reports/id/document/5203> <http://purl.org/dc/terms/hasPart> <http://www.eledia.org/students-reports/192/2/lightbox.jpg> .
<http://www.eledia.org/students-reports/192/2/lightbox.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "lightbox.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://eprints.org/ontology/hasDocument> <http://www.eledia.org/students-reports/id/document/5204> .
<http://www.eledia.org/students-reports/id/document/5204> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://www.eledia.org/students-reports/id/document/5204> <http://www.w3.org/2000/01/rdf-schema#label> "Optimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/document/5204> <http://eprints.org/relation/isVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5204> <http://eprints.org/relation/isVolatileVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5204> <http://eprints.org/relation/ispreviewThumbnailVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5204> <http://eprints.org/ontology/hasFile> <http://www.eledia.org/students-reports/192/3/preview.jpg> .
<http://www.eledia.org/students-reports/id/document/5204> <http://purl.org/dc/terms/hasPart> <http://www.eledia.org/students-reports/192/3/preview.jpg> .
<http://www.eledia.org/students-reports/192/3/preview.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "preview.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://eprints.org/ontology/hasDocument> <http://www.eledia.org/students-reports/id/document/5205> .
<http://www.eledia.org/students-reports/id/document/5205> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://www.eledia.org/students-reports/id/document/5205> <http://www.w3.org/2000/01/rdf-schema#label> "Optimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/document/5205> <http://eprints.org/relation/isVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5205> <http://eprints.org/relation/isVolatileVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5205> <http://eprints.org/relation/ismediumThumbnailVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5205> <http://eprints.org/ontology/hasFile> <http://www.eledia.org/students-reports/192/4/medium.jpg> .
<http://www.eledia.org/students-reports/id/document/5205> <http://purl.org/dc/terms/hasPart> <http://www.eledia.org/students-reports/192/4/medium.jpg> .
<http://www.eledia.org/students-reports/192/4/medium.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "medium.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://eprints.org/ontology/hasDocument> <http://www.eledia.org/students-reports/id/document/5206> .
<http://www.eledia.org/students-reports/id/document/5206> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://www.eledia.org/students-reports/id/document/5206> <http://www.w3.org/2000/01/rdf-schema#label> "Optimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/document/5206> <http://eprints.org/relation/isVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5206> <http://eprints.org/relation/isVolatileVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5206> <http://eprints.org/relation/issmallThumbnailVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5206> <http://eprints.org/ontology/hasFile> <http://www.eledia.org/students-reports/192/5/small.jpg> .
<http://www.eledia.org/students-reports/id/document/5206> <http://purl.org/dc/terms/hasPart> <http://www.eledia.org/students-reports/192/5/small.jpg> .
<http://www.eledia.org/students-reports/192/5/small.jpg> <http://www.w3.org/2000/01/rdf-schema#label> "small.jpg"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://eprints.org/ontology/hasDocument> <http://www.eledia.org/students-reports/id/document/5207> .
<http://www.eledia.org/students-reports/id/document/5207> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://eprints.org/ontology/Document> .
<http://www.eledia.org/students-reports/id/document/5207> <http://www.w3.org/2000/01/rdf-schema#label> "Optimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays (Other)"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/document/5207> <http://eprints.org/relation/isVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5207> <http://eprints.org/relation/isVolatileVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5207> <http://eprints.org/relation/isIndexCodesVersionOf> <http://www.eledia.org/students-reports/id/document/5195> .
<http://www.eledia.org/students-reports/id/document/5207> <http://eprints.org/ontology/hasFile> <http://www.eledia.org/students-reports/192/6/indexcodes.txt> .
<http://www.eledia.org/students-reports/id/document/5207> <http://purl.org/dc/terms/hasPart> <http://www.eledia.org/students-reports/192/6/indexcodes.txt> .
<http://www.eledia.org/students-reports/192/6/indexcodes.txt> <http://www.w3.org/2000/01/rdf-schema#label> "indexcodes.txt"^^<http://www.w3.org/2001/XMLSchema#string> .
<http://www.eledia.org/students-reports/id/eprint/192> <http://www.w3.org/2000/01/rdf-schema#seeAlso> <http://www.eledia.org/students-reports/192/> .
<http://www.eledia.org/students-reports/192/> <http://purl.org/dc/elements/1.1/title> "HTML Summary of #192 \n\nOptimal Compromise (Sum-Difference) Synthesis Using a B-Tree Search Algorithm - Linear Interleaved Arrays\n\n" .
<http://www.eledia.org/students-reports/192/> <http://purl.org/dc/elements/1.1/format> "text/html" .
<http://www.eledia.org/students-reports/192/> <http://xmlns.com/foaf/0.1/primaryTopic> <http://www.eledia.org/students-reports/id/eprint/192> .
<http://www.eledia.org/students-reports/id/subject/TK> <http://www.w3.org/1999/02/22-rdf-syntax-ns#type> <http://www.w3.org/2004/02/skos/core#Concept> .
<http://www.eledia.org/students-reports/id/subject/TK> <http://www.w3.org/2004/02/skos/core#prefLabel> "TK Master Thesis and Project Reports"@en .
<http://www.eledia.org/students-reports/id/eprint/192> <http://purl.org/dc/terms/subject> <http://www.eledia.org/students-reports/id/subject/TK> .