Agile Spectrum Imaging: Programmable Wavelength Modulation for Cameras and Projectors

We advocate the use of quickly‐adjustable, computer‐controlled color spectra in photography, lighting and displays. We present an optical relay system that allows mechanical or electronic color spectrum control and use it to modify a conventional camera and projector. We use a diffraction grating to disperse the rays into different colors, and introduce a mask (or LCD/DMD) in the optical path to modulate the spectrum. We analyze the trade‐offs and limitations of this design, and demonstrate its use in a camera, projector and light source. We propose applications such as adaptive color primaries, metamer detection, scene contrast enhancement, photographing fluorescent objects, and high dynamic range photography using spectrum modulation.     

Efficient GPU Data Structures and Methods to Solve Sparse Linear Systems in Dynamics Applications

We present graphics processing unit (GPU) data structures and algorithms to efficiently solve sparse linear systems that are typically required in simulations of multi‐body systems and deformable bodies. Thereby, we introduce an efficient sparse matrix data structure that can handle arbitrary sparsity patterns and outperforms current state‐of‐the‐art implementations for sparse matrix vector multiplication. Moreover, an efficient method to construct global matrices on the GPU is presented where hundreds of thousands of individual element contributions are assembled in a few milliseconds. A finite‐element‐based method for the simulation of deformable solids as well as an impulse‐based method for rigid bodies are introduced in order to demonstrate the advantages of the novel data structures and algorithms. These applications share the characteristic that a major computational effort consists of building and solving systems of linear equations in every time step. Our solving method results in a speed‐up factor of up to 13 in comparison to other GPU methods.     

A GPU‐Adapted Structure for Unstructured Grids

A key advantage of working with structured grids (e.g., images) is the ability to directly tap into the powerful machinery of linear algebra. This is not much so for unstructured grids where intermediate bookkeeping data structures stand in the way. On modern high performance computing hardware, the conventional wisdom behind these intermediate structures is further challenged by costly memory access, and more importantly by prohibitive memory resources on environments such as graphics hardware. In this paper, we bypass this problem by introducing a sparse matrix representation for unstructured grids which not only reduces the memory storage requirements but also cuts down on the bulk of data movement from global storage to the compute units. In order to take full advantage of the proposed representation, we augment ordinary matrix multiplication by means of action maps, local maps which encode the desired interaction between grid vertices. In this way, geometric computations and topological modifications translate into concise linear algebra operations. In our algorithmic formulation, we capitalize on the nature of sparse matrix‐vector multiplication which allows avoiding explicit transpose computation and storage. Furthermore, we develop an efficient vectorization to the demanding assembly process of standard graph and finite element matrices.     

DOCSIS3.1物理层新功能分析与应用研究

DOCSIS3.1标准逐步从标准制定走向规模化部署阶段,而网络性能的优化和网络的主动维护功能还有很大的提升空间,本文重点介绍了可变bit-loading的Profile管理功能,并针对Profile管理出现的一些问题,提出了一种新的单播Profile管理方法;同时介绍了DOCSIS3.1PNM运维功能,并分析了新功能面临的挑战以及走向智能运维的转型方向。     

一种新颖的菜单设计技术

介绍了一种有热健响应的下拉菜单设计技术,主要介绍了其设计思想及实现原理,具有效率高,美观大方等特点。     

Cross Pharmacological,Biochemical and Computational Studies of a Human Kv3.1b Inhibitor from Androctonus australis Venom

The voltage-gated K⁺ channels Kv3.1 display fast activation and deactivation kinetics and are known to have a crucial contribution to the fast-spiking phenotype of certain neurons. AahG50, as a natural product extracted from Androctonus australis hector venom, inhibits selectively Kv3.1 channels. In the present study, we focused on the biochemical and pharmacological characterization of the component in AahG50 scorpion venom that potently and selectively blocks the Kv3.1 channels. We used a combined optimization through advanced biochemical purification and patch-clamp screening steps to characterize the peptide in AahG50 active on Kv3.1 channels. We described the inhibitory effect of a toxin on Kv3.1 unitary current in black lipid bilayers. In silico, docking experiments are used to study the molecular details of the binding. We identified the first scorpion venom peptide inhibiting Kv3.1 current at 170 nM. This toxin is the alpha-KTx 15.1, which occludes the Kv3.1 channel pore by means of the lysine 27 lateral chain. This study highlights, for the first time, the modulation of the Kv3.1 by alpha-KTx 15.1, which could be an interesting starting compound for developing therapeutic biomolecules against Kv3.1-associated diseases.     

Detail analysis of fusion neutronics benchmark experiment for iron

In order to specify the best nuclear data on iron, the fusion neutronics benchmark experiment on iron at Japan Atomic Energy Agency (JAEA)/Fusion Neutronics Source (FNS) was analyzed in detail with MCNP-4C and the latest nuclear data libraries, JENDL-3.3, FENDL-2.1, JEFF-3.1 and ENDF/B-VII.0. As a result, totally the calculation result with ENDF/B-VII.0 agreed with the measurement best, except that it underestimated the measured neutron flux above 10 MeV with the depth. It was noted that the calculation result with JENDL-3.3 overestimated the measured neutrons below a few keV. Through the DORT calculations based on the iron data in ENDF/B-VII.0, it was found out that the first inelastic scattering cross-section data of ⁵⁷Fe in JENDL-3.3 caused the overestimation.     

EFFECT OF HEAT TREATMENT ON POSITRON ANNIHILATION OF GLASSY Bi_(1.6)Pb_(0.4)Sr_(1.9)Ca_2Cu_(3.1)O_y

Effects of isochronal annealing on the positron annihilation of glassy Bi_(1.6) Pb_(0.4) Sr_(1.9)Ca_2Cu_(3.1)O_y(BPSCCO)have been reported.It is shown that the crystallization influencesobviously the positron annihilation characteristics of BPSCCO.A maximum is found inthe region of crystallization temperature in curves of mean lifetime and peak/wing ratio,one of Doppler Iineshape parameter,with annealing temperature;the bulk lifetime ofpositron annihilation in the glassy state is longer than that in the crystalline one.Positronannihilation spectroscopy could be used for studying structure of glassy BPSCCO andits change with heat treatment.     

Hierarchical Bucket Queuing for Fine‐Grained Priority Scheduling on the GPU

While the modern graphics processing unit (GPU) offers massive parallel compute power, the ability to influence the scheduling of these immense resources is severely limited. Therefore, the GPU is widely considered to be only suitable as an externally controlled co‐processor for homogeneous workloads which greatly restricts the potential applications of GPU computing. To address this issue, we present a new method to achieve fine‐grained priority scheduling on the GPU: hierarchical bucket queuing. By carefully distributing the workload among multiple queues and efficiently deciding which queue to draw work from next, we enable a variety of scheduling strategies. These strategies include fair‐scheduling, earliest‐deadline‐first scheduling and user‐defined dynamic priority scheduling. In a comparison with a sorting‐based approach, we reveal the advantages of hierarchical bucket queuing over previous work. Finally, we demonstrate the benefits of using priority scheduling in real‐world applications by example of path tracing and foveated micropolygon rendering.     

Performance Comparison of Bounding Volume Hierarchies and Kd‐Trees for GPU Ray Tracing

We present a performance comparison of bounding volume hierarchies and kd‐trees for ray tracing on many‐core architectures (GPUs). The comparison is focused on rendering times and traversal characteristics on the GPU using data structures that were optimized for very high performance of tracing rays. To achieve low rendering times, we extensively examine the constants used in termination criteria for the two data structures. We show that for a contemporary GPU architecture (NVIDIA Kepler) bounding volume hierarchies have higher ray tracing performance than kd‐trees for simple and moderately complex scenes. On the other hand, kd‐trees have higher performance for complex scenes, in particular for those with high depth complexity. Finally, we analyse the causes of the performance discrepancies using the profiling characteristics of the ray tracing kernels.