Technion – Israel Institute of Technology

About: Technion – Israel Institute of Technology is a education organization based out in Haifa, Israel. It is known for research contribution in the topics: Population & Upper and lower bounds. The organization has 31714 authors who have published 79377 publications receiving 2603976 citations. The organization is also known as: Technion Israel Institute of Technology & Ṭekhniyon, Makhon ṭekhnologi le-Yiśraʼel.

Discrete solitons in photorefractive optically induced photonic lattices

Abstract: We demonstrate that optical discrete solitons are possible in appropriately oriented biased photorefractive crystals. This can be accomplished in optically induced periodic waveguide lattices that are created via plane-wave interference. Our method paves the way towards the observation of entirely new families of discrete solitons. These include, for example, discrete solitons in two-dimensional self-focusing and defocusing lattices of different group symmetries, incoherently coupled vector discrete solitons, discrete soliton states in optical diatomic chains, as well as their associated collision properties and interactions. We also present results concerning transport anomalies of discrete solitons that depend on their initial momentum within the Brillouin zone.

A sequential parametric convex approximation method with applications to nonconvex truss topology design problems

Abstract: We describe a general scheme for solving nonconvex optimization problems, where in each iteration the nonconvex feasible set is approximated by an inner convex approximation. The latter is defined using an upper bound on the nonconvex constraint functions. Under appropriate conditions, a monotone convergence to a KKT point is established. The scheme is applied to truss topology design (TTD) problems, where the nonconvex constraints are associated with bounds on displacements and stresses. It is shown that the approximate convex problem solved at each inner iteration can be cast as a conic quadratic programming problem, hence large scale TTD problems can be efficiently solved by the proposed method.

The Perception-Distortion Tradeoff

Abstract: Image restoration algorithms are typically evaluated by some distortion measure (e.g. PSNR, SSIM, IFC, VIF) or by human opinion scores that quantify perceived perceptual quality. In this paper, we prove mathematically that distortion and perceptual quality are at odds with each other. Specifically, we study the optimal probability for correctly discriminating the outputs of an image restoration algorithm from real images. We show that as the mean distortion decreases, this probability must increase (indicating worse perceptual quality). As opposed to the common belief, this result holds true for any distortion measure, and is not only a problem of the PSNR or SSIM criteria. However, as we show experimentally, for some measures it is less severe (e.g. distance between VGG features). We also show that generative-adversarial-nets (GANs) provide a principled way to approach the perception-distortion bound. This constitutes theoretical support to their observed success in low-level vision tasks. Based on our analysis, we propose a new methodology for evaluating image restoration methods, and use it to perform an extensive comparison between recent super-resolution algorithms.

Shortest-path and minimum-delay algorithms in networks with time-dependent edge-length

Abstract: In this paper the shortest-path problem in networks in which the delay (or weight) of the edges changes with time according to arbitrary functions is considered. Algorithms for finding the shortest path and minimum delay under various waiting constraints are presented and the properties of the derived path are investigated. It is shown that if departure time from the source node is unrestricted, then a shortest path can be found that is simple and achieves a delay as short as the most unrestricted path. In the case of restricted transit, it is shown that there exist cases in which the minimum delay is finite, but the path that achieves it is infinite.

Modifying supervisory practices to improve subunit safety: a leadership-based intervention model.

Abstract: This article presents a leadership-based intervention model designed to modify supervisory monitoring and rewarding of subordinates' safety performance. Line supervisors received weekly feedback based on repeated episodic interviews with subordinates conceming the cumulative frequency of their safety-oriented interactions. This information identified the priority of safety over competing goals such as speed or schedules. Section managers received the same information and used it to communicate (high) safety priority. They also were trained to conduct episodic interviews to provide intermittent feedback after intervention, tuming safety priority into an explicit performance goal. Safety-oriented interaction increased significantly in the experimental groups but remained unchanged in the control groups. This change in safety-oriented interaction was accompanied by significant (and stable) changes in minor-injury rate, earplug use, and safety climate scores during the postintervention period.