185,294 research outputs found
Phoneys and the dash man: the hypnotic voice of J. D. Salinger
No full textSalinger called himself 'a dash man', quintessentially a short story writer, but I'm not so sure about that. The Catcher in the Rye is an overblown short story, but the Glass family saga is something else. The dash is a breathless narrative momentum that keeps finding sources of
renewal
A new approach for estimating northern peatland gross primary productivity using a satellite-sensor-derived chlorophyll index
No full textCarbon flux models that are largely driven by remotely sensed data can be used to estimate gross primary productivity (GPP) over large areas, but despite the importance of peatland ecosystems in the global carbon cycle, relatively little attention has been given to determining their success in these ecosystems. This paper is the first to explore the potential of chlorophyll-based vegetation index models for estimating peatland GPP from satellite data. Using several years of carbon flux data from contrasting peatlands, we explored the relationships between the MERIS terrestrial chlorophyll index (MTCI) and GPP, and determined whether the inclusion of environmental variables such as PAR and temperature, thought to be important determinants of peatland carbon flux, improved upon direct relationships. To place our results in context, we compared the newly developed GPP models with the MODIS (Moderate Resolution Imaging Spectrometer) GPP product. Our results show that simple MTCI-based models can be used for estimates of interannual and intra-annual variability in peatland GPP. The MTCI is a good indicator of GPP and compares favorably with more complex products derived from the MODIS sensor on a site-specific basis. The incorporation of MTCI into a light use efficiency type model, by means of partitioning the fraction of photosynthetic material within a plant canopy, shows most promise for peatland GPP estimation, outperforming all other models. Our results demonstrate that satellite data specifically related to vegetation chlorophyll content may ultimately facilitate improved quantification of peatland carbon flux dynamics
Dash-Industry-Forum/dash.js: dash.js v4.7.4
No full text<h2>Features</h2>
<p><a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4338">#4338</a> Add support for DVB Font downloads as specified in ETSI TS 103 285 V1.4.1 - Section 7.2 Downloadable Fonts by @mattjuggins
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4360">#4360</a> Add an event that enables manual rendering of subtitles by @bitboxer
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4330">#4330</a> Add API endpoint to trigger a manifest refresh by @eirikbjornr
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4336">#4336</a> Add IMSC settings for rollUp and displayForcedOnly by @nigelmegitt<br>
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4382">#4382</a> Add a liveUpdateTimeThreshold to control time syncing during playback of live streams by @matvp91</p>
<h2>Improvements</h2>
<p><a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4359">#4359</a> Fix flickering and blinking of IMSC subtitles by @mattjuggins
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4350">#4350</a> Include HTTP request range in data that is passed to the modifyRequest function by @dsilhavy
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4356">#4356</a> Remove unused depdendency foodoc and move JSDoc related dependencies to devDependencies section in the package.json by @dsilhavy
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4362">#4362</a> Refactor DVB extensions properties to consistently use camel case. by @mattjuggins</p>
<h2>Bugfixes</h2>
<p><a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4348">#4348</a> <a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4349">#4349</a> Remove duplicate events in index.d.ts by @kris-youview
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4355">#4355</a> Fix invalid warning in StreamProcessor.js by @dsilhavy
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4335">#4335</a> Remove specific Chrome version from CircleCI config by @dsilhavy
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4363">#4363</a> Fix PlaybackErrorEvent Typescript typing by @kris-youview
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4365">#4365</a> Add a try/catch around matchSettingsLang in case bcp47Normalize fails with an error by @dsilhavy
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4368">#4368</a> Check for undefined values in addHttpRequest method by @dsilhavy
<a href="https://github.com/Dash-Industry-Forum/dash.js/pull/4389">#4389</a> Fix a bug when dispatching subtitle events that causes an error in the event bus when the video is seeked by @dsilhavy</p>
[Report to Chief J. E. Curry, by an unknown author #1]
No full textReport to Chief J. E. Curry, by an unknown author. The report contains a list of officers who gave depositions to the United States Attorney
[Report to Chief J. E. Curry, by an unknown author #2]
No full textReport to Chief J. E. Curry, by an unknown author. The report contains a list of officers who gave depositions to the United States Attorney
Dash-Industry-Forum/dash.js: dash.js v3.2.0
No full textFeatures
3411 DASH Events: Support for onReceive mode
3424 Add Learn2Adapt ABR algorithm for low-latency streams
3469 Add LoL+ ABR algorithm for low-latency streams
3468 Enable live playback catchup for non low latency streams
3264 Add Chromecast sender and receiver applications
Improvements
3406 Compare mediaInfo objects in DashAdapter
3385 UpdateSettings new streaming parameters : trackSwitchMode and selectionModeForInitialTrack
3422 Add a fragment request timeout
3437 Use resizeObserver when available for resizing captions
3432 Add MediaPlayer.destroy to free all memory
3372 Refactor of the EventBus
3444 Add event for transition from dynamic to static
3420 Align CMCD reporting with latest changes in the spec
3428 Migrate to intern v4
3450 Remove default CID from CMCD
3456 Decrease already seen initData log from warn to info
3467 Fix timing for live gap jumps
3471 Rewrite the event timing calculation and dispatching logic
3478 Disable Event.LOG per default. Can be enabled via settings parameter
Bugfixes
3405 Fix prebuffering static mpds
3401 Fix ManifestUpdater for 'dynamic' to 'static' streams
3425 Accept non-compliant imagetype attribute name in SMPTE-TT image
3440 [MSS] fix segment duration
3414 dvb:probability should be 1000 by default
3458 Fix script error in case of AdaptationSet removal at MPD update
Fix a bug which caused the preload sample to cras
Recommended from our members
DASH-Style Diet and 24-Hour Urine Composition
No full textBackground and objectives: We previously observed associations between a Dietary Approaches to Stop Hypertension (DASH)-style diet and large reductions in kidney stone risk. This study examined associations between a DASH-style diet and 24-hour excretions of urinary lithogenic factors. Design, setting, participants, & measurements: We studied 3426 participants with and without nephrolithiasis in the Health Professionals Follow-up Study (HPFS) and the Nurses' Health Studies (NHS) I and II. A dietary DASH score was based on seven components: high intake of fruits, vegetables, nuts and legumes, dairy products, and whole grains and low intake of sweetened beverages and red and processed meats. We used analysis of covariance to adjust for age, stone history, body size, and other factors. Results: Comparing participants in the highest to lowest quintiles of DASH score, multivariate-adjusted urinary calcium excretion was 3% greater in HPFS (P trend 0.12), 10% greater in NHS I (P trend <0.01), and 12% greater in NHS II (P trend 0.05). Urinary oxalate was 4% to 18% greater (P trend all <= 0.03), urinary citrate was 11% to 16% greater (P trend all <0.01), and urinary volume was 16% to 32% greater (P trend all <0.001). Higher DASH score was associated with higher urine potassium, magnesium, phosphate, and pH, and lower relative supersaturations (RSS) of calcium oxalate (women only) and uric acid. Conclusions: A DASH-style diet may reduce stone risk by increasing urinary citrate and volume. The small associations between higher DASH score and lower RSS suggest unidentified stone inhibitors in dairy products and/or plants. Clin J Am Soc Nephrol 5: 2315-2322, 2010. doi: 10.2215/CJN.04420510Version of Recor
DASH-2: flexible, low-cost, and high-throughput SNP genotyping by dynamic allele-specific hybridization on membrane arrays
No full textGenotyping technologies need to be continually improved in terms of their flexibility, cost-efficiency, and throughput, to push forward genome variation analysis. To this end, we have leveraged the inherent simplicity of dynamic allele-specific hybridization (DASH) and coupled it to recent innovations of centrifugal arrays and iFRET. We have thereby created a new genotyping platform we term DASH-2, which we demonstrate and evaluate in this report. The system is highly flexible in many ways (any plate format, PCR multiplexing, serial and parallel array processing, spectral-multiplexing of hybridization probes), thus supporting a wide range of application scales and objectives. Precision is demonstrated to be in the range 99.8–100%, and assay costs are 0.05 USD or less per genotype assignment. DASH-2 thus provides a powerful new alternative for genotyping practice, which can be used without the need for expensive robotics support
Distributed Mechanisms for Multi-Agent Systems: Analysis and Design
No full textThere is an increasing need for multi-agent systems to operate under decentralised control regimes that support openness (individual components can enter and leave at will) and enable components representing distinct stakeholders with different aims and objectives to interact effectively. To this end, this thesis explores issues associated with using techniques from Game Theory and Mechanism Design to organise and analyse such systems. In particular, emphasis is given to distributed mechanisms in which there is distributed allocation (no single centre determines the allocation of the resources or the tasks) and distributed information (agents require information privately known by other agents in order to determine their own valuation or cost). Such mechanisms are important because, in comparison to their centralised counterparts, they are robust to a single-point failure, the computational burden can be potentially shared amongst many agents, and there is a reduction in bottlenecks since not all communication need pass through a single point. As a result, distributed mechanisms are better suited to many types of multi-agent application. To provide a grounding for the mechanisms we develop, the thesis contains a running example of a multi-sensor network scenario. In these systems, distributed allocation mechanisms are desirable since they are robust and reduce bottlenecks in the communication system. Furthermore, we show that distributed information naturally arises by deriving an information-theoretic valuation function. This scenario also gives rise to two additional requirements that are addressed within this thesis: (i) constrained capacity, whereby suppliers can only provide a limited amount of goods or services at any given time and (ii) uncertainty in task completion, whereby sensors potentially fail after they have been assigned tasks. Specifically, we focus on the \ac{vcg} mechanisms and investigate ways of extending it so as to address the requirements that arise within distributed setting in general and sensor networks. In particular, we choose the VCG as our point of departure since it is a mechanism that is efficient, individually rational and incentive compatible. Unfortunately, it is brittle in the sense that it does not conserve these desirable properties when considering the requirements that we outlined above. Therefore, we develop novel mechanisms that do. In more detail, the first part of this thesis considers two distributed allocation mechanisms --- a simultaneous auction environment and \ac{cda}. In the former, bidders place sealed bids in a number of selling auctions which are concurrently offering items. This results in a distributed allocation whereby the winner at each auction is determined by the seller conducting it. For this case, we derive the optimal strategy of the bidders using a game-theoretic approach. In the \acs{cda}, buyers and sellers, respectively, submit bids and asks continuously and the market clears when a bid is higher than an ask; meaning that the allocation is again determined in a distributed way. Furthermore, CDAs are known to yield close to efficient allocations, under certain conditions, even when utilising very simple strategies. However, in our case, we need to modify their format in order to deal with the requirement of constrained capacity. In both of these mechanisms, we study the system's loss in efficiency that ensues from distributing the allocation and find that it is in the simultaneous auction case and upto in the continuous double auction case. The second part of this thesis is concerned with designing mechanisms when agents have distributed information within the system. Such settings are more general than those more traditionally studied in that they encompass the fact that agents can potentially change their valuation or cost upon knowing a signal about the system (which they have not observed) that was hitherto unknown to them. Specifically, we first show that interdependent valuations arise naturally within a sensor network when we develop an information-theoretic valuation function. To account for this, we significantly extend the VCG mechanism in order to deal with these interdependent valuations. We then go on to develop a mechanism that can deal with uncertainty in task allocation. In both of these cases, our mechanisms are shown to be efficient, individually rational and incentive compatible. Moreover, their computational properties are studied and efficient algorithms are designed (based on linear and dynamic programming) in order to speed up the computation of the allocation problem which is generally -hard
- …
