98 resultados para DSL
Resumo:
This letter considers clip-limited transmission over multiple-input multiple-output digital subscriber lines (MIMO-DSL). We show that a recent low complexity, low peak-to-average-ratio (PAR) single-input modulation technique can be applied to the case of multiple cross-talking channels in a bonded-DSL system. Unfortunately however the direct initialization procedure is computationally infeasible. In this paper, we provide a novel low-complexity initialization procedure. Simulations confirm that the proposed approach has superior performance in clip-limited conditions, compared with both discrete matrix multitone and vectored discrete multitone.
Resumo:
Digital Songlines (DSL) is an Australasian CRC for Interaction Design (ACID) project that is developing protocols, methodologies and toolkits to facilitate the collection, education and sharing of indigenous cultural heritage knowledge. This paper outlines the goals achieved over the last three years in the development of the Digital Songlines game engine (DSE) toolkit that is used for Australian Indigenous storytelling. The project explores the sharing of indigenous Australian Aboriginal storytelling in a sensitive manner using a game engine. The use of the game engine in the field of Cultural Heritage is expanding. They are an important tool for the recording and re-presentation of historically, culturally, and sociologically significant places, infrastructure, and artefacts, as well as the stories that are associated with them. The DSL implementation of a game engine to share storytelling provides an educational interface. Where the DSL implementation of a game engine in a CH application differs from others is in the nature of the game environment itself. It is modelled on the 'country' (the 'place' of their heritage which is so important to the clients' collective identity) and authentic fauna and flora that provides a highly contextualised setting for the stories to be told. This paper provides an overview on the development of the DSL game engine.
Resumo:
Many residential and small business users connect to the Internet via home gateways, such as DSL and cable modems. The characteristics of these devices heavily influence the quality and performance of the Internet service that these users receive. Anecdotal evidence suggests that an extremely diverse set of behaviors exists in the deployed base, forcing application developers to design for the lowest common denominator. This paper experimentally analyzes some characteristics of a substantial number of different home gateways: binding timeouts, queuing delays, throughput, protocol support and others.
Resumo:
Since the days of Digital Subscriber Links (DSL), time domain equalizers (TEQ's) have been used to combat time dispersive channels in Multicarrier Systems. In this paper, we propose computationally inexpensive techniques to recompute TEQ weights in the presence of changes in the channel, especially over fast fading channels. The techniques use no extra information except the perturbation to the channel itself, and provide excellent approximations to the new TEQ weights. Adaptation methods for two existing Channel shortening algorithms are proposed and their performance over randomly varying, randomly perturbed channels is studied. The proposed adaptation techniques are shown to perform admirably well for small changes in channels for OFDM systems. (C) 2012 Elsevier GmbH. All rights reserved.
Resumo:
Since the days of Digital Subscriber Links(DSL), Time Domain Equalizers(TEQ's) have been used to combat time dispersive channels in Multicarrier Systems. In this paper, we propose computationally inexpensive techniques to recompute TEQ weights in the presence of changes in the channel, especially over fast fading channels. The techniques use no extra information except the perturbation itself, and provide excellent approximations to the new TEQ weights. The proposed adaptation techniques are shown to perform admirably well for small changes in channels for OFDM systems.
Resumo:
Graph algorithms have been shown to possess enough parallelism to keep several computing resources busy-even hundreds of cores on a GPU. Unfortunately, tuning their implementation for efficient execution on a particular hardware configuration of heterogeneous systems consisting of multicore CPUs and GPUs is challenging, time consuming, and error prone. To address these issues, we propose a domain-specific language (DSL), Falcon, for implementing graph algorithms that (i) abstracts the hardware, (ii) provides constructs to write explicitly parallel programs at a higher level, and (iii) can work with general algorithms that may change the graph structure (morph algorithms). We illustrate the usage of our DSL to implement local computation algorithms (that do not change the graph structure) and morph algorithms such as Delaunay mesh refinement, survey propagation, and dynamic SSSP on GPU and multicore CPUs. Using a set of benchmark graphs, we illustrate that the generated code performs close to the state-of-the-art hand-tuned implementations.
Resumo:
Traditional software development captures the user needs during the requirement analysis. The Web makes this endeavour even harder due to the difficulty to determine who these users are. In an attempt to tackle the heterogeneity of the user base, Web Personalization techniques are proposed to guide the users’ experience. In addition, Open Innovation allows organisations to look beyond their internal resources to develop new products or improve existing processes. This thesis sits in between by introducing Open Personalization as a means to incorporate actors other than webmasters in the personalization of web applications. The aim is to provide the technological basis that builds up a trusty environment for webmasters and companion actors to collaborate, i.e. "an architecture of participation". Such architecture very much depends on these actors’ profile. This work tackles three profiles (i.e. software partners, hobby programmers and end users), and proposes three "architectures of participation" tuned for each profile. Each architecture rests on different technologies: a .NET annotation library based on Inversion of Control for software partners, a Modding Interface in JavaScript for hobby programmers, and finally, a domain specific language for end-users. Proof-of-concept implementations are available for the three cases while a quantitative evaluation is conducted for the domain specific language.
Resumo:
Gaur egun Twitter moduko mikroblogintza aplikazioak zalantzak argitzeko gero eta gehiago erabiltzen dira. Erabiltzaileak laguntza eskaera adierazi eta sare sozialaren bidez bere kontaktuei helarazi egiten zaie. Erabiltzaileak galdera eta erantzunen kudeaketa sare sozial nahaste baten barruan egin beharko du. Proiektuaren helburu nagusia mikroblogintza plataformetako kanala programazio lengoaien IDEen barruan bateratzea da, modu honetan laguntza eskatzeko prozesua IDEetan bertan kudeatzeko.
Resumo:
Cooperative director fluctuations in lipid bilayers have been postulated for many years. ^2H-NMR T_1^(-1), T_(1P)^(-1) , and T_2^(-1); measurements have been used identify these motions and to determine the origin of increased slow bilayer motion upon addition of unlike lipids or proteins to a pure lipid bilayer.
The contribution of cooperative director fluctuations to NMR relaxation in lipid bilayers has been expressed mathematically using the approach of Doane et al.^1 and Pace and Chan.^2 The T_2^(-1)’s of pure dimyristoyllecithin (DML) bilayers deuterated at the 2, 9 and 10, and all positions on both lipid hydrocarbon chains have been measured. Several characteristics of these measurements indicate the presence of cooperative director fluctuations. First of all, T_2^(-1) exhibits a linear dependence on S2/CD. Secondly, T_2^(-1) varies across the ^2H-NMR powder pattern as sin^2 (2, β), where , β is the angle between the average bilayer director and the external magnetic field. Furthermore, these fluctuations are restricted near the lecithin head group suggesting that the head group does not participate in these motions but, rather, anchors the hydrocarbon chains in the bilayer.
T_2^(-1)has been measured for selectively deuterated liquid crystalline DML hilayers to which a host of other lipids and proteins have been added. The T_2^(-1) of the DML bilayer is found to increase drastically when chlorophyll a (chl a) and Gramicidin A' (GA') are added to the bilayer. Both these molecules interfere with the lecithin head group spacing in the bilayer. Molecules such as myristic acid, distearoyllecithin (DSL), phytol, and cholesterol, whose hydrocarbon regions are quite different from DML but which have small,neutral polar head groups, leave cooperative fluctuations in the DML bilayer unchanged.
The effect of chl a on cooperative fluctuations in the DML bilayer has been examined in detail using ^2H-NMR T_1^(-1), T_(1P)^(-1) , and T_2^(-1); measurements. Cooperative fluctuations have been modelled using the continuum theory of the nematic state of liquid crystals. Chl a is found to decrease both the correlation length and the elastic constants in the DML bilayer.
A mismatch between the hydrophobic length of a lipid bilayer and that of an added protein has also been found to change the cooperative properties of the lecithin bilayer. Hydrophobic mismatch has been studied in a series GA' / lecithin bilayers. The dependence of 2H-NMR order parameters and relaxation rates on GA' concentration has been measured in selectively deuterated DML, dipalmitoyllecithin (DPL), and DSL systems. Order parameters, cooperative lengths, and elastic constants of the DML bilayer are most disrupted by GA', while the DSL bilayer is the least perturbed by GA'. Thus, it is concluded that the hydrophobic length of GA' best matches that of the DSL bilayer. Preliminary Raman spectroscopy and Differential Scanning Calorimetry experiments of GA' /lecithin systems support this conclusion. Accommodation of hydrophobic mismatch is used to rationalize the absence of H_(II) phase formation in GA' /DML systems and the observation of H_(II) phase in GA' /DPL and GA' /DSL systems.
1. J. W. Doane and D. L. Johnson, Chem. Phy3. Lett., 6, 291-295 (1970). 2. R. J. Pace and S. I. Chan, J. Chem. Phy3., 16, 4217-4227 (1982).
Resumo:
O nível sérico do Fator de crescimento semelhante à insulina tipo I (IGF-I) é fundamental para auxiliar no dignóstico e controle terapêutico dos transtornos relacionados à secreção do Hormônio de Crescimento (GH), bem como no diagnóstico e seguimento de outras doenças. Estabelecer valores de referência para as dosagens séricas de IGF-I por um ensaio imunoquimioluminométrico (ICMA), utilizando o sistema automatizado Immulite 2000/Diagnostic Products Corporation (DPC), e por um ensaio imunoradiométrico (IRMA), utilizando o kit comercial ACTIVE IGF-I/Diagnostic System Laboratories (DSL)-5600, numa população brasileira adulta da cidade do Rio de Janeiro. Este estudo, aprovado pelo Comitê de Ética do Instituto Estadual de Hematologia Arthur de Siqueira Cavalcanti, Rio de Janeiro, Brasil, incluiu amostras de 484 indivíduos saudáveis (251 homens e 233 mulheres) com idades entre 18 e 70 anos. As amostras foram estudadas por ICMA- Immulite 2000/DPC and IRMA- ACTIVE IGF-I/DSL-5600. Para análise dos dados foram utilizados modelos específicos para idade e sexo, após transformação dos dados de IGF-I. Foi observada uma lenta diminuição dos níveis de IGF-I com a idade usando ambos os ensaios. Os níveis de IGF-I foram signicativamente (p=0,0181) mais elevados em mulheres do que em homens, quando as amostras foram analisadas usando ICMA. Não houve diferença significativa dos níveis de IGF-I entre homens e mulheres quando as amostras foram analisadas usando IRMA. Este estudo estabeleceu valores de referência de IGF-I específicos para idade e sexo, determinados com o sistema automatizado ICMA-Immulite 2000/DPC, e valores de referência de IGF-I específicos para idade, determinados com o kit comercial IRMA- ACTIVE IGF-I/DSL-5600, em uma população adulta brasileira, da cidade do Rio de Janeiro.
Resumo:
Submitted by zhangdi (zhangdi@red.semi.ac.cn) on 2009-04-13T11:45:31Z
Resumo:
snBench is a platform on which novice users compose and deploy distributed Sense and Respond programs for simultaneous execution on a shared, distributed infrastructure. It is a natural imperative that we have the ability to (1) verify the safety/correctness of newly submitted tasks and (2) derive the resource requirements for these tasks such that correct allocation may occur. To achieve these goals we have established a multi-dimensional sized type system for our functional-style Domain Specific Language (DSL) called Sensor Task Execution Plan (STEP). In such a type system data types are annotated with a vector of size attributes (e.g., upper and lower size bounds). Tracking multiple size aspects proves essential in a system in which Images are manipulated as a first class data type, as image manipulation functions may have specific minimum and/or maximum resolution restrictions on the input they can correctly process. Through static analysis of STEP instances we not only verify basic type safety and establish upper computational resource bounds (i.e., time and space), but we also derive and solve data and resource sizing constraints (e.g., Image resolution, camera capabilities) from the implicit constraints embedded in program instances. In fact, the static methods presented here have benefit beyond their application to Image data, and may be extended to other data types that require tracking multiple dimensions (e.g., image "quality", video frame-rate or aspect ratio, audio sampling rate). In this paper we present the syntax and semantics of our functional language, our type system that builds costs and resource/data constraints, and (through both formalism and specific details of our implementation) provide concrete examples of how the constraints and sizing information are used in practice.
Resumo:
NetSketch is a tool that enables the specification of network-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: modeling and design. As a modeling tool, it enables the abstraction of an existing system so as to retain sufficient enough details to enable future analysis of safety properties. As a design tool, NetSketch enables the exploration of alternative safe designs as well as the identification of minimal requirements for outsourced subsystems. NetSketch embodies a lightweight formal verification philosophy, whereby the power (but not the heavy machinery) of a rigorous formalism is made accessible to users via a friendly interface. NetSketch does so by exposing tradeoffs between exactness of analysis and scalability, and by combining traditional whole-system analysis with a more flexible compositional analysis approach based on a strongly-typed, Domain-Specific Language (DSL) to specify network configurations at various levels of sketchiness along with invariants that need to be enforced thereupon. In this paper, we overview NetSketch, highlight its salient features, and illustrate how it could be used in applications, including the management/shaping of traffic flows in a vehicular network (as a proxy for CPS applications) and in a streaming media network (as a proxy for Internet applications). In a companion paper, we define the formal system underlying the operation of NetSketch, in particular the DSL behind NetSketch's user-interface when used in "sketch mode", and prove its soundness relative to appropriately-defined notions of validity.
Resumo:
NetSketch is a tool for the specification of constrained-flow applications and the certification of desirable safety properties imposed thereon. NetSketch is conceived to assist system integrators in two types of activities: modeling and design. As a modeling tool, it enables the abstraction of an existing system while retaining sufficient information about it to carry out future analysis of safety properties. As a design tool, NetSketch enables the exploration of alternative safe designs as well as the identification of minimal requirements for outsourced subsystems. NetSketch embodies a lightweight formal verification philosophy, whereby the power (but not the heavy machinery) of a rigorous formalism is made accessible to users via a friendly interface. NetSketch does so by exposing tradeoffs between exactness of analysis and scalability, and by combining traditional whole-system analysis with a more flexible compositional analysis. The compositional analysis is based on a strongly-typed Domain-Specific Language (DSL) for describing and reasoning about constrained-flow networks at various levels of sketchiness along with invariants that need to be enforced thereupon. In this paper, we define the formal system underlying the operation of NetSketch, in particular the DSL behind NetSketch's user-interface when used in "sketch mode", and prove its soundness relative to appropriately-defined notions of validity. In a companion paper [6], we overview NetSketch, highlight its salient features, and illustrate how it could be used in two applications: the management/shaping of traffic flows in a vehicular network (as a proxy for CPS applications) and in a streaming media network (as a proxy for Internet applications).