Exploring the Aesthetic Effects of the Golden Ratio in the Design of Interactive Products

We conducted an experiment to test whether the use of the golden ratio as a design guideline in interactive products has aesthetic value, that is, whether it influences users’ aesthetic evaluation of the product and their preferences for it over other product of the same type. We studied two types of products (mobile phones and web pages), each was wireframed in two design versions and then manipulated systematically to form various width × height proportions, including the golden ratio. Each of ninety-one participants evaluated one design version of each product by means of pairwise comparisons of all proportions. The results support the golden ratio hypothesis regarding the mobile devices but not regarding the web page designs. We discuss possible explanations for these results

The "Black Box" Behind Prison-Based Vocational Training Programs

Despite the great importance of prison vocational programs, studies have pointed to a wide variety of barriers that inhibit the released prisoner's chances to integrate into the labor market. The present qualitative investigation was designed to crack the "black box" behind six vocational programs implemented in the Israel Prison Service (IPS). Our findings based on the interviews with all the supervisors in the programs emphasized several factors that seem necessary for the success of the different vocational programs. The interviews show that training in a correctional environment poses a number of major difficulties for the respondents. Furthermore, a significant part of the prisoners' motivation to participate in the training programs is not necessarily related to the desire to find work after release. It was also found that a relatively long training, which makes it possible to find work in the field even during the period of incarceration, holistically addresses the various needs of the prisoner, and corresponds to the job market requirements, increases the chances of its participants to find employment also after their release from prison. When the characteristics of the various programs were examined, it was found that in addition to the characteristics of prisoners, one must also consider structural characteristics such: to what extent do the programs comply with the requirements of the Israeli labor market, confer a formal diploma at the end of the training period, or allow integration into the work force after release

"Judaism Intertwines with Worldly Good": A Qualitative Study on Religious Rehabilitation Programs in the Israeli Prison Service

Background: Religion with its religious institutions has played a key role in shaping punishment and rehabilitation of offenders throughout history. The aim of these programs is to transform a person spiritually and lead them to intra-personal changes on the religious level by prompting repentance or the reaffirmation of one's faith. Objectives: We present qualitative findings from an evaluation of two religious programs operating in the Israeli Prison Service: The Torah Rehabilitation Program (TRP) that functions as a religious community within prison walls, and the Torah Study Program (TSP) in which prisoners participate faith-based studies four hours a day. The main research question that led the researchers was how Judaism provides opportunities for prisoner’s rehabilitation. Method: This research is a qualitative study that includes seven interviews with seven Rabbis who work in the Israeli Prison Service and lead the religious programs. The interviewees were involved in the formulation and implementation of the religious correctional programs. Results: The interviewees have raised a link between Jewish beliefs and practices, including atonement, and the foundations of prisoners’ rehabilitation. Among the themes that have been raised: promoting moral action; giving prisoners a second chance; providing opportunities for repentance and atonement; supervision; placing emphasis on behavioral norms; focusing on belonging and commitment to a community; working alongside Torah; learning and providing a unique response to each individual according to their characteristics and needs. Conclusions: The emerging themes raised in the interviews correspond well with theoretical ideas found in the field of corrections in general and in positive criminology in particular

New Applications of Nearest-Neighbor Chains: Euclidean TSP and Motorcycle Graphs

We show new applications of the nearest-neighbor chain algorithm, a technique that originated in agglomerative hierarchical clustering. We use it to construct the greedy multi-fragment tour for Euclidean TSP in O(n log n) time in any fixed dimension and for Steiner TSP in planar graphs in O(n sqrt(n)log n) time; we compute motorcycle graphs, a central step in straight skeleton algorithms, in O(n^(4/3+epsilon)) time for any epsilon>0

Comparison of in vitro and in situ plankton production determinations

Plankton production was measured using 8 techniques at 4 stations in the Celtic Sea, North Atlantic Ocean, in April 2002. Primary production (PP) was derived from 14C incorporation into particulate carbon after 24 h simulated in situ, PP(14CSIS), and 2 h photosynthesis-irradiance incubations, PP(14CPUR), and from 2 published satellite algorithms, PP(VGPM) and PP (M91). Gross production (GP) was calculated from O2 evolution, GP(O2), and 18O enrichment of dissolved O 2, GP(18O), after 24 h simulated in situ incubations, and from in situ active fluorescence measured by fast repetition rate fluorometry (FRRF). Net community production (NCP) was determined from changes in in situ dissolved oxygen, NCP(?O2), and from changes in oxygen during 24 h simulated in situ incubations, NCP(O2). Dark community respiration (DCR) was derived from changes in oxygen during a 24 h dark incubation, DCR(O2), and daily oxygen uptake, DOU(18O, O2), was calculated from the difference between GP(18O) and NCP(O2). Three stations were dominated by picoautotrophs and the fourth station was dominated by diatoms. While most of the comparisons between techniques fell within previously published ranges, 2 anomalies occurred only at the diatom-dominated station. Rates of PP(14CPUR) were oxygen uptake in the dark. The low rates of PP( 14CPUR) in relation to PP(14CSIS) may have resulted from the heterogeneous nature of the bloom and differences in sampling time. However, it is also possible that dissolved organic material (DOM) released by the stressed diatom population restricted the diffusion of 14C into the cells, thereby causing a greater underestimate of PP by techniques using short incubations. The significantly higher rates of oxygen uptake in the light are difficult to reconcile, and we do not know whether the light enhanced oxygen uptake was directly linked to carbon fixation. However, the release of DOM may also have provided substrate for enhanced respiration in the light. These anomalies were only revealed through the concurrent measurement of plankton production by this wide range of techniques. Further investigation of DOM excretion and light-enhanced respiration during diatom blooms is warranted

Multi-Level Steiner Trees

In the classical Steiner tree problem, one is given an undirected, connected graph G=(V,E) with non-negative edge costs and a set of terminals T subseteq V. The objective is to find a minimum-cost edge set E\u27 subseteq E that spans the terminals. The problem is APX-hard; the best known approximation algorithm has a ratio of rho = ln(4)+epsilon < 1.39. In this paper, we study a natural generalization, the multi-level Steiner tree (MLST) problem: given a nested sequence of terminals T_1 subset ... subset T_k subseteq V, compute nested edge sets E_1 subseteq ... subseteq E_k subseteq E that span the corresponding terminal sets with minimum total cost. The MLST problem and variants thereof have been studied under names such as Quality-of-Service Multicast tree, Grade-of-Service Steiner tree, and Multi-Tier tree. Several approximation results are known. We first present two natural heuristics with approximation factor O(k). Based on these, we introduce a composite algorithm that requires 2^k Steiner tree computations. We determine its approximation ratio by solving a linear program. We then present a method that guarantees the same approximation ratio and needs at most 2k Steiner tree computations. We compare five algorithms experimentally on several classes of graphs using four types of graph generators. We also implemented an integer linear program for MLST to provide ground truth. Our combined algorithm outperforms the others both in theory and in practice when the number of levels is small (k <= 22), which works well for applications such as designing multi-level infrastructure or network visualization