Tensor Clustering for Rendering Many‐Light Animations

Rendering animations of scenes with deformable objects, camera motion, and complex illumination, including indirect lighting and arbitrary shading, is a long‐standing challenge. Prior work has shown that complex lighting can be accurately approximated by a large collection of point lights. In this formulation, rendering of animation sequences becomes the problem of efficiently shading many surface samples from many lights across several frames. This paper presents a tensor formulation of the animated many‐light problem, where each element of the tensor expresses the contribution of one light to one pixel in one frame. We sparsely sample rows and columns of the tensor, and introduce a clustering algorithm to select a small number of representative lights to efficiently approximate the animation. Our algorithm achieves efficiency by reusing representatives across frames, while minimizing temporal flicker. We demonstrate our algorithm in a variety of scenes that include deformable objects, complex illumination and arbitrary shading and show that a surprisingly small number of representative lights is sufficient for high quality rendering. We believe out algorithm will find practical use in applications that require fast previews of complex animation.     

Motion synthesis with decoupled parameterization

In real-time animation systems, motion interpolation techniques are widely used for their controllability and efficiency. The techniques sample the parameter space using example motions, and interpolate them to compute the blend weights corresponding to the given parameters. A main problem of the techniques is that, as the dimension n of the parameter space increases, the number of required example motions increases exponentially, i.e. O(c ⁿ ). To resolve the problem, this paper proposes to use two decoupled parameter spaces for controlling the upper body and the lower body separately. At each frame time, a parameterized motion space produces a source frame, and the target frame is synthesized by splicing the upper body of one source frame with the lower body of the other. In order to have the two source frames correlated with each other, a time-warping scheme has been developed. Furthermore, in order to handle the dynamic properties of the parameter samples of the upper body, we have developed an approximation technique for quickly determining the sample positions in its parameter space. This decoupled parameterization method alleviates the complexity problem, e.g. from O(c ⁶) to O(c ³), while providing the users with the capability of convenient control over the character.     

Design and Implementation of a Ubiquitous Robotic Space

This paper describes a concerted effort to design and implement a robotic service framework. The proposed framework is comprised of three conceptual spaces: physical, semantic, and virtual spaces, collectively referred to as a ubiquitous robotic space. We implemented a prototype robotic security application in an office environment, which confirmed that the proposed framework is an efficient tool for developing a robotic service employing IT infrastructure, particularly for integrating heterogeneous technologies and robotic platforms.     

Effects of material combination on laser beam drilling of a metal foil using a cover plate

This research investigated the microdrilling characteristics of metal foils depending on the materials of the cover plates and metal foils in the cover plate-laser beam machining (c-LBM) process, which is a method to achieve better quality in metal foil machining with a given piece of equipment. Laser beam drilling using a nanosecond pulsed laser was carried out on 10-µm-thick stainless steel 304 (STS304), nickel, and copper foils with 100-µm-thick cover plates of each material. Consequently, STS304 was found to be an effective cover plate material for reducing the hole diameter and spatter deposition on metal foils. Compared to the results without using a cover plate, the average hole diameter and the area of spatter deposition decreased by up to 77% and 96%, respectively, by using the STS304 cover plate. Meanwhile, the thermal deformation of the STS304 and nickel foils was prevented by using a cover plate, while the copper foil was barely deformed even without a cover plate. Lastly, it was remarkable that the copper foil was drilled with approximately 67% lower pulse energy than the effective minimum pulse energy required to drill it by using the STS304 cover plate, resulting in a smaller hole with little spatter.     

Flexible Nonvolatile Transistor Memory with Solution‐Processed Transition Metal Dichalcogenides

Nonvolatile field‐effect transistor (FET) memories containing transition metal dichalcogenide (TMD) nanosheets have been recently developed with great interest by utilizing some of the intriguing photoelectronic properties of TMDs. The TMD nanosheets are, however, employed as semiconducting channels in most of the memories, and only a few works address their function as floating gates. Here, a floating‐gate organic‐FET memory with an all‐in‐one floating‐gate/tunneling layer of the solution‐processed TMD nanosheets is demonstrated. Molybdenum disulfide (MoS₂) is efficiently liquid‐exfoliated by amine‐terminated polystyrene with a controlled amount of MoS₂ nanosheets in an all‐in‐one floating‐gate/tunneling layer, allowing for systematic investigation of concentration‐dependent charge‐trapping and detrapping properties of MoS₂ nanosheets. At an optimized condition, the nonvolatile memory exhibits memory performances with an ON/OFF ratio greater than 10⁴, a program/erase endurance cycle over 400 times, and data retention longer than 7 × 10³ s. All‐in‐one floating‐gate/tunneling layers containing molybdenum diselenide and tungsten disulfide are also developed. Furthermore, a mechanically‐flexible TMD memory on a plastic substrate shows a performance comparable with that on a hard substrate, and the memory properties are rarely altered after outer‐bending events over 500 times at the bending radius of 4.0 mm.     

Effect of stents coated with a combination of sirolimus and alpha-lipoic acid in a porcine coronary restenosis model

The aim of this study was to evaluate antiproliferative sirolimus- and antioxidative alpha-lipoic acid (ALA)-eluting stents using biodegradable polymer [poly-l-lactic acid (PLA)] in a porcine coronary overstretch restenosis model. Forty coronary arteries of 20 pigs were randomized into four groups in which the coronary arteries had a bare metal stent (BMS, n = 10), ALA-eluting stent with PLA (AES, n = 10), sirolimus-eluting stent with PLA (SES, n = 10), or sirolimus- and ALA-eluting stent with PLA (SAS, n = 10). A histopathological analysis was performed 28 days after the stenting. The ALA and sirolimus released slowly over 30 days. There were no significant differences between groups in the injury or inflammation score; however, there were significant differences in the percent area of stenosis (56.2 ± 11.78 % in BMS vs. 51.5 ± 12.20 % in AES vs. 34.7 ± 7.23 % in SES vs. 28.7 ± 7.30 % in SAS, P < 0.0001) and fibrin score [1.0 (range 1.0–1.0) in BMS vs. 1.0 (range 1.0–1.0) in AES vs. 2.0 (range 2.0–2.0) in SES vs. 2.0 (range 2.0–2.0) in SAS, P < 0.0001] between the four groups. The percent area of stenosis based on micro-computed tomography corresponded with the restenosis rates based on histopathological stenosis in different proportions in the four groups (54.8 ± 7.88 % in BMS vs. 50.4 ± 14.87 % in AES vs. 34.5 ± 7.22 % in SES vs. 28.9 ± 7.22 % in SAS, P < 0.05). SAS showed a better neointimal inhibitory effect than BMS, AES, and SES at 1 month after stenting in a porcine coronary restenosis model. Therefore, SAS with PLA can be a useful drug combination for coronary stent coating to suppress neointimal hyperplasia.     

Trajectory generation and control for a biped robot walking upstairs

This paper presents an effective and systematic trajectory generation method, together with a control method for enabling a biped robot to walk upstairs. The COG (center of gravity) trajectory is generated by the VHIPM (virtual height inverted pendulum mode) for the horizontal motion and by a 6th order polynomial for the vertical motion; an ankle compliance control (ACC) is also added into the robot control. The proposed methods are evaluated by simulations as well as being implemented in a robot for the performance verification. The results show that the proposed methods can generate stable motions when walking upstairs, and these can significantly reduce the zero moment point (ZMP) errors compared with other methods, enabling the robot to walk up steeper stairs.     

Online Search with Time-Varying Price Bounds

Online search is a basic online problem. The fact that its optimal deterministic/randomized solutions are given by simple formulas (however with difficult analysis) makes the problem attractive as a target to which other practical online problems can be transformed to find optimal solutions. However, since the upper/lower bounds of prices in available models are constant, natural online problems in which these bounds vary with time do not fit in the available models.We present two new models where the bounds of prices are not constant but vary with time in certain ways. The first model, where the upper and lower bounds of (logarithmic) prices have decay speed, arises from a problem in concurrent data structures, namely to maximize the (appropriately defined) freshness of data in concurrent objects. For this model we present an optimal deterministic algorithm with competitive ratio \(\sqrt{D}\), where D is the known duration of the game, and a nearly-optimal randomized algorithm with competitive ratio \(\frac{\ln D}{1+\ln2-\frac{2}{D}}\). We also prove that the lower bound of competitive ratios of randomized algorithms is asymptotically \(\frac{\ln D}{4}\).The second model is inspired by the fact that some applications do not utilize the decay speed of the lower bound of prices in the first model. In the second model, only the upper bound decreases arbitrarily with time and the lower bound is constant. Clearly, the lower bound of competitive ratios proved for the first model holds also against the stronger adversary in the second model. For the second model, we present an optimal randomized algorithm. Our numerical experiments on the freshness problem show that this new algorithm achieves much better/smaller competitive ratios than previous algorithms do, for instance 2.25 versus 3.77 for D=128.