854 research outputs found
特別支援教育専攻学生を対象とした障害理解のための教材開発(2)―糖尿病・血友病等の「自己注射」場面を中心にした教材―
特別支援教育専攻学生の指導では、対象とする障害児・者が活用する機器・道具を提示し、その使用法の解説がなされてきた。これは感覚・情報系障害領域では指導上意義がある。また肢体不自由・運動障害系では、車イスや生活補助具、障害体験グッズなどが障害理解教材として活用されてきた。しかし病弱教育領域では、子どもの困難理解につながる「病気体験」は、健常学生にはできない。そこで教員は、病院見学、療養生活の映像資料等を活用し、病気の影響や困難をイメージさせる方法をとることが多い。本研究では糖尿病および血友病を例にとり、病気による「困難」を体験・体感させる教材について検討した。糖尿病・血友病の自己注射モデルを提示し、その作製・改善とそれを使用した授業経過を分析対象とした。学生による試作及び改良モデルは、自己注射実施時の困難・不安・躊躇を「体感」させることを目的としているが、作製過程そのものが、学生による困難・不安・躊躇といった自己注射実施を必要とする疾患のもつ障害特性の理解を促進することが推察された
Effectiveness of habitat management for improving grey partridge populations: a BACI experimental assessment
We assessed the impact of field division (4 m bare ground strips within wheat fields) and food supplementation (supplied through grain feeders) on grey partridge Perdix perdix L. populations using six–year ‘before–after’/'control–impact’ (BACI) experiments. We did not detect any convincing positive effects of either of these two schemes on partridge pair density and reproductive success. Increases in pair densities were similar on managed and control areas, and contrasting results were found between some sites. No consistent pattern was observed between reproductive success and feeding intensity. Our studies highlight the need for field experiments at farm–scale to test the effectiveness of management measures. We conclude that, in the context in which they are applied, management techniques directed towards increasing partridge density do not systematically provide the desired outcome. We develop our point of view about management in the Discussion
Static Data Structure Lower Bounds Imply Rigidity
We show that static data structure lower bounds in the group (linear) model
imply semi-explicit lower bounds on matrix rigidity. In particular, we prove
that an explicit lower bound of on the cell-probe
complexity of linear data structures in the group model, even against
arbitrarily small linear space , would already imply a
semi-explicit () construction of rigid matrices with
significantly better parameters than the current state of art (Alon, Panigrahy
and Yekhanin, 2009). Our results further assert that polynomial () data structure lower bounds against near-optimal space, would
imply super-linear circuit lower bounds for log-depth linear circuits (a
four-decade open question). In the succinct space regime , we show
that any improvement on current cell-probe lower bounds in the linear model
would also imply new rigidity bounds. Our results rely on a new connection
between the "inner" and "outer" dimensions of a matrix (Paturi and Pudlak,
2006), and on a new reduction from worst-case to average-case rigidity, which
is of independent interest
OpenFluor- an online spectral library of auto-fluorescence by organic compounds in the environment
An online repository of published organic fluorescence spectra has been developed, which can be searched for quantitative matches with any set of unknown spectra. It fills a critical gap by increasing access to measured and modelled (PARAFAC) spectra, and linking across studies and systems to reveal "global" fluorescence trends
07471 Abstracts Collection -- Equilibrium Computation
From 18 to 23 November 2007, the Dagstuhl Seminar 07471 ``Equilibrium Computation\u27\u27 was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Nearly Optimal Static Las Vegas Succinct Dictionary
Given a set of (distinct) keys from key space , each associated
with a value from , the \emph{static dictionary} problem asks to
preprocess these (key, value) pairs into a data structure, supporting
value-retrieval queries: for any given , must
return the value associated with if , or return if . The special case where is called the \emph{membership}
problem. The "textbook" solution is to use a hash table, which occupies linear
space and answers each query in constant time. On the other hand, the minimum
possible space to encode all (key, value) pairs is only bits, which could be much less.
In this paper, we design a randomized dictionary data structure using
bits of space, and it
has \emph{expected constant} query time, assuming the query algorithm can
access an external lookup table of size . The lookup table depends
only on , and , and not the input. Previously, even for
membership queries and , the best known data structure with
constant query time requires bits of space
(Pagh [Pag01] and P\v{a}tra\c{s}cu [Pat08]); the best-known using
space has query time ; the only known
non-trivial data structure with space has
query time and requires a lookup table of size (!). Our new
data structure answers open questions by P\v{a}tra\c{s}cu and Thorup
[Pat08,Tho13].
We also present a scheme that compresses a sequence to its
zeroth order (empirical) entropy up to extra
bits, supporting decoding each in expected time.Comment: preliminary version appeared in STOC'2
EEMlab: A graphical user-friendly interface for fluorimetry experiments based on the drEEM toolbox
[EN] Fluorescence has been widely employed for the characterization of organic matter. In particular, excitation emission matrixes (EEM) provide important qualitative information on its composition. However, the application of this technique is limited by the mathematical complexity involved, which requires the use of PARAFAC for deconvolution of the EEM in their components. To overcome the numerical problem specific MATLAB toolboxes for the PARAFAC deconvolution have been implemented (e.g. drEEM). This toolbox is widely used by the scientific community but its intrinsic complexity in terms of programming knowledge makes it difficult to use. In this regard and in order to facilitate the first approximation to the PARAFAC programming problem, this paper describes and offers to the community the EEMlab software application: a graphical user-firendly interface for fluorimetry experiments based on the drEEM toolbox. The interface is developed in order to facilitate not only the intuitive use of the drEEM (no previous MATLAB knowledge is needed) but also to automate many repetitive tasks (as the data load or the modeling loop) or even to manage the different formats of files being produced by all the devices involved in the process. In order to validate the EEMlab, the same experiment documented by the drEEM is reproduced. In addition, the EEMlab is tested again with conducting a new fluorimetry experiment and the results are presented at the end of the paper. Finally to appoint a reference to the public web site pabmitor.webs.upv.es/eemlab in where all the components of the EEMlab GUI (software, tutorial and datasets) are publicly available to the readers.The authors want to thank the financial support of the Generalitat Valenciana, Conselleria d'Educacio, Cultura i Esport (Spain) [GV/2015/074].
The authors want to thank the financial support of Ministerio de Educacion y Ciencia (Spain)(CTQ2015-69832-C4-4-R). Sara Garcia-Ballesteros would like to thank Ministerio de Economia y Competitividad (Spain) for her fellowship (BES-2013-066201).
The authors want to thank Dr. F.S. García Einschlag who has
independently tested the EEMlab and helped the authors to improve and
validate the final version of the application.Micó Tormos, P.; García-Ballesteros, S.; Mora Carbonell, M.; Vicente Candela, R.; Amat Payá, AM.; Arqués Sanz, A. (2019). EEMlab: A graphical user-friendly interface for fluorimetry experiments based on the drEEM toolbox. Chemometrics and Intelligent Laboratory Systems. 188:6-13. https://doi.org/10.1016/j.chemolab.2019.03.001S61318
- …