Ahstract-Privacy-protecting technology is essential in this surveillance society. The applications of cameras widely vary, e.g., crime surveillance, monitoring of an environment, and marketing.Furthermore, the scale of surveillance systems is predicted to become more diverse (from home area networks to wide area networks) due to the decrease in size and price of cameras.Therefore, a simple privacy protection system that does not require central servers or large databases is needed. Scrambling private information in a captured image can be a solution to sim plifying a system. We propose an image-scrambling method for bitmap and JPEG formatted images to private information. Our method enables access control by providing keys to authorized individuals. They cannot view private information that they do not have permission to access. The image's format is retained; therefore, no special viewer is necessary in display-only console. Experimental results suggest that scramble level can be controlled linearly by using parameters (three for JPEG formatted image, and one for bitmap image). We also developed a demo system for this method and confirm that this method can be applied to embedded systems such as those equipped with surveillance cameras.

No abstract

From the mechanical point of view, welding processes can be modeled as a coupling problem between heat conduction and thermal elastic–plastic problems. Such a welding mechanics problem generally requires a large amount of computational time due to its nonlinearity as well as a lot of time steps with a moving heat source. To overcome this difficulty, we are developing a large-scale welding simulator based on the domain decomposition method, which is one of parallel finite element methods. In the present paper, the methodology of the domain decomposition method that is applied to welding analysis is presented, followed by the algorithm. Then, a bead-on-plate problem, which is a popular benchmark problem in the field of computational welding mechanics, was analyzed by the simulator. The bead-on-plate problem was successfully analyzed within very small numbers of iteration steps of the Newton–Raphson and conjugate gradient methods.

No abstract

No abstract