Testable heuristics for the 0–1 knapsack problem

Two kinds of heuristics, fixed time and cut time, are proposed in order to use the running time available in solving 0–1 knapsack problems profitably.Translated from Kibernetika, No. 2, pp. 44–52, March–April, 1991.     

Screening of supports for the immobilization of pectinmethylesterase from acerola (Malpighia glabra L)

A partially purified extract of pectinmethylesterase (PME) from acerola fruit was immobilized on various supports: glass, celite, chrysotile, agarose, concanavalin A Sepharose 4B, egg shell, polyacrylamide and gelatin. In addition, reticulation with glutaraldehyde was assessed, as well as the use of gelatin in the presence of celite, glass and silica. The highest immobilization yields were obtained when the pectinmethylesterase was immobilized in concanavalin A Sepharose 4B (81.7%) and in gelatin‐water (78.0%). Copyright © 2004 Society of Chemical Industry     

Controlling the losing probability in a monotone game

We deal with a complex game between Alice and Bob where each contender’s probability of victory grows monotonically by unknown amounts with the resources employed. For a fixed effort on Alice’s part, Bob increases his resources on the basis of the results for each round (victory, tie or defeat) with the aim of reducing the probability of defeat to below a given threshold. We read this goal in terms of computing a confidence interval for the probability of losing and realize that the moves in some contests may bring in an indeterminacy trap: in certain games Bob cannot simultaneously have both a low probability-of-defeat measure and a narrow confidence interval. We use the inferential mechanism called twisting argument to compute the above interval on the basis of two joint statistics. Careful use of such statistics allows us to avoid indeterminacy.     

Using physical memorabilia as opportunities to move into collocated digital photo-sharing

The uptake of digital photos vs. print photos has altered the practice of photo-sharing. Print photos are easy to share within the home, but much harder to share outside of it. The opposite is true of digital photos. People easily share digital photos outside the home, e.g., to family and friends by e-mail gift-giving, and to social networks and the broader public by web publishing. Yet within the home, collocated digital photo-sharing is harder, primarily because digital photos are typically stored on personal accounts in desktop computers located in home offices. This leads to several consequences. (1) The invisibility of digital photos implies few opportunities for serendipitous photo-sharing. (2) Access control and navigation issues inhibit family members from retrieving photo collections. (3) Photo viewing is compromised as digital photos are displayed on small screens in an uncomfortable viewing setting.To mitigate some of these difficulties, we explore how physical memorabilia collected by family members can create opportunities that encourage social and collocated digital photo-sharing. First, we studied (via contextual interviews with 20 households) how families currently practice photo-sharing and how they keep memorabilia. We identified classes of memorabilia that can serve as memory triggers to family events, trips, and times when people took photos. Second, we designed Souvenirs, a photo-viewing system that exploits memorabilia as a social instrument. Using Souvenirs, a family member can meaningfully associate physical memorabilia with particular photo-sets. Later, any family member can begin their story-telling with others through the physical memento, and then enrich the story by displaying its associated photos simply by moving the memento close to the home's large-format television screen. Third, we re-examined our design premises by evoking household reactions to an early version of Souvenirs. Based on these interviews, we redesigned Souvenirs to better reflect the preferences and real practices of photo and memorabilia use in the home.     

Distributed Latency-Energy Minimization and interference avoidance in TDMA Wireless Sensor Networks

This paper presents Latency-Energy Minimization Medium Access (LEMMA), a new TDMA-based MAC protocol for Wireless Sensor Networks (WSNs), specially suited to extend the lifetime of networks supporting alarm-driven, delay-sensitive applications characterized by convergecast traffic patterns and sporadic traffic generation. Its cascading time-slot assignment scheme conciliates low end-to-end latency with a low duty-cycle, while supporting multi-sink WSN topologies. Unlike most of the current solutions, LEMMA’s time-slot allocation protocol makes decisions based on the interference actually experienced by the nodes, instead of following the simple but potentially ineffective n-hop approach. Simulation results are presented to demonstrate the ineffectiveness of the n-hop time-slot allocation in comparison with LEMMA, as well as to evaluate the performance of LEMMA against L-MAC, T-MAC and Low Power Listening. The results show that under the target scenario conditions, LEMMA presents lower interference between assigned time-slots and lower end-to-end latency, while matching its best contender in terms of energy-efficiency.     

Level Lines of a Polynomial on a Plane

Programming and Computer Software - A method for calculating the location of all types of level lines of a real polynomial on the real plane is proposed. To this end, the critical points and...