A novel highly copper(II)‐selective chelating ion exchanger based on poly(glycidyl methacrylate‐co‐ethylene dimethacrylate) beads modified with aspartic acid derivative

Anchoring the hydroxyaspartic acid onto poly(glycidyl methacrylate‐co‐ethylene dimethacrylate) (poly(GMA‐co‐EDMA)) beads or epoxysuccinic acid onto ammonium‐modified poly(GMA‐co‐EDMA) beads resulted in a novel chelating resin, which contained up to 0.37 mmol of the ligand per gram of resin. Batch extraction experiments showed a very high selectivity for Cu²⁺ over Zn²⁺ and Cd²⁺ ions in buffered solutions under competitive conditions. © 2001 John Wiley & Sons, Inc. J Appl Polym Sci 80: 913–916, 2001     

Using cryptographic and. watermarking algorithms

Because of multimedia's structure and complexity, security mechanisms for multimedia data should be specific for each purpose. We introduce the most important security requirements for all types of multimedia systems. We also survey revocation methods for digital certificates and introduce a media-independent classification scheme     

VistaMail: an integrated multimedia mailing system

VistaMail, a fully integrated multimedia mailing system, lets users easily create, send, and view audio and video components. The system treats these components as part of a single unified message rather than as additions to the text portion. This article discusses the design of the multimedia mail system and some of the issues involved in implementing it     

Routing with topology aggregation in delay-bandwidth sensitive networks

Routing is a process of finding a network path from a source node to a destination node. The execution time and the memory requirement of a routing algorithm increase with the size of the network. In order to deal with the scalability problem, large networks are often structured hierarchically by grouping nodes into different domains. The internal topology of each domain is then aggregated into a simple topology that reflects the cost of routing across that domain. This process is called topology aggregation. For delay-bandwidth sensitive networks, traditional approaches represent the property of each link in the aggregated topology as a delay-bandwidth pair, which corresponds to a point on the delay-bandwidth plane. Since each link after aggregation may be the abstraction of many physical paths, a single delay-bandwidth pair results in significant information loss. The major contribution of this paper is a novel quality-of-service (QoS) parameter representation with a new aggregation algorithm and a QoS-aware routing protocol. Our QoS representation captures the state information about the network with much greater accuracy than the existing algorithms. Our simulation results show that the new approach achieves very good performance in terms of delay deviation, success ratio, and crankback ratio.     

The Role of Value Deliberation to Improve Stakeholder Participation in Issues of Water Governance

Water Resources Management - Stakeholder participation is a requirement for environmental decision-making in the European Union. Despite this, numerous instances can be seen in water governance in...     

Reflection on reflection in action: a case study of growers conception of irrigation strategies in pot plant production

A case study of growers conception of irrigation strategies indicates that pot plant growers in Scandinavia base their management approaches on experientially based art. The study also indicates that there is a gap between experientially based art and available greenhouse technology. In order to standardize production and produce quality, both the grower’s experience and available technology should be taken into account. In order to achieve this, the present study proposes to arrange reflection on reflection in action with a group of growers by means of the dialogue seminar method. The concept of reflection on reflection in action is novel to horticultural practice. Therefore, we suggest future inter- and multidisciplinary research within this domain.     

Optimal configurations for peer-to-peer user-private information retrieval

User-private information retrieval systems should protect the user’s anonymity when performing queries against a database, or they should limit the servers capacity of profiling users. Peer-to-peer user-private information retrieval (P2P UPIR) supplies a practical solution: the users in a group help each other in doing their queries, thereby preserving their privacy without any need of the database to cooperate. One way to implement the P2P UPIR uses combinatoric configurations to administrate the keys needed for the private communication between the peers.This article is devoted to the choice of the configuration in this system. First of all we characterize the optimal configurations for the P2P UPIR and see the relationship with the projective planes as described in finite geometry. Then we give a very efficient construction of such optimal configurations, i.e. finite projective planes. We finally check that the involved graphs are Ramanujan graphs, giving an additional justification of the optimality of the constructed configurations.