Focus on the ESET NOD32 antivirus system

One of the software programs we take for granted is antivirus software. Perhaps part of the reason for not being excited about protecting our computers resides in the fact that most PCs marketed over the past few years are bundled with an antivirus solution. When you initialize the computer you also start your virus protection program, which will often provide you with only a short period of protection before pop‐up messages appear reminding you to renew your antivirus program license to ensure your protection is up to date. What is more than likely never mentioned to consumers is the fact that the antivirus software bundled with your computer was positioned there due to the software vendor paying the computer manufacturer a fee. While most third‐party software placed on new computers must pass a certain level of quality assurance, the computer manufacturer is more interested in the placement fee than whether the software is the best for the purchaser of the computer. Thus, one of the things we should do when our antivirus software license expires, if not sooner, is to look at other possible solutions beyond the software bundled with the computer. One such antivirus product that warrants our attention and which is the focus of this column is ESET's NOD32 for Windows antivirus solution, which was originally developed in Slovakia.     

Synthesis and characterization of a polyfluorene containing carbazole and oxadiazole dipolar pendent groups and its application to electroluminescent devices

We have synthesized a blue‐light‐emitting polyfluorene (PF) derivative ( PF‐CBZ‐OXD ) that presents bulky hole‐transporting carbazole and electron‐transporting oxadiazole pendent groups functionalized at the C‐9 positions of alternating fluorene units. The results from photoluminescence and electrochemical measurements indicate that both the side chains and the PF main chain retain their own electronic characteristics in the copolymer. An electroluminescent device incorporating this polymer as the emitting layer was turned on at 4.5 V; it exhibited a stable blue emission with a maximum external quantum efficiency of 1.1%. Moreover, we doped PF‐CBZ‐OXD and its analogue PF‐TPA‐OXD with a red‐light‐emitting iridium phosphor for use as components of phosphorescent red‐light emitters to investigate the effect of the host's HOMO energy level on the degree of charge trapping and on the electrophosphorescent efficiency. We found that spectral overlap and individual energy level matching between the host and guest were both crucial features affecting the performance of the electroluminescence devices. Atomic force microscopy measurements indicated that the dipolar nature of PF‐CBZ‐OXD , in contrast to the general nonpolarity of polydialkylfluorenes, provided a stabilizing environment that allowed homogeneous dispersion of the polar iridium triplet dopant. © 2007 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 45: 2925–2937, 2007     

Roles of rhenium diimine complexes as metal‐ion probes and photosensitizers in functional polyurethanes

Polyurethanes incorporated with rhenium diimine complexes were synthesized. The polymers exhibited interesting morphologies and solution properties. Results from gel permeation chromatography suggested the formation of polymer aggregates in solutions. The polymers could act as probes for metal ions. The addition of metal ions to polymer solutions led to significant changes in the electronic absorption properties of the polymer solutions. This was attributed to the interactions between the polyether moieties and metal ions. The metal complexes could also act as efficient photosensitizers. After doping with charge‐transport viologens, the photoconductivity of the polymers was greatly enhanced. The experimental quantum efficiency was simulated with Onsager's theory. The thermalization distances and the primary yields were typically 12–14 Å and 10^?3, respectively. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1708–1715, 2003     

Hollow latex particles as submicrometer reactors for polymerization in confined geometries

A method was developed for free‐radical polymerization in the confines of a hollow latex particle. Hollow particles were prepared via the dynamic swelling method from polystyrene seed and divinylbenzene and had hollows of 500–1000 nm. So that these hollow poly(divinylbenzene) particles could function as submicrometer reactors, the particles were filled with a monomer (N‐isopropylacrylamide) via the dispersion of the dried particles in the molten monomer. The monomer that was not contained in the hollows was removed by washing and gentle abrasion. Free‐radical polymerization was then initiated by γ radiolysis in the solid state. Transmission electron microscopy showed that poly(N‐isopropylacrylamide) formed in the hollow interior of the particles, which functioned as submicrometer reactors. © 2004 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 42: 5706–5713, 2004     

Polygonal approximation for image segmentation

A new learning model for real-time, grey-level image segmentation is presented. The model gives excellent results for images with different shapes.     

Latex particles bearing hydrophilic grafted hairs with controlled chain length and functionality synthesized by reversible addition–fragmentation chain transfer

A method is described for synthesizing latex particles with anchored hairs by the grafting of hydrophilic chains, synthesized by reversible addition–fragmentation chain transfer, onto functionalized latex particles. These have the potential to bind biologically active species. © 2003 Wiley Periodicals, Inc. J Polym Sci Part A: Polym Chem 41: 1188–1195, 2003     

Parallel-decomposition algorithm for discrete computationalproblems and its application in developing an efficient discreteconvolution algorithm

The authors present a parallel-decomposition algorithm for discrete computational problems. An efficient convolution algorithm is developed under the proposed decomposition algorithm. The decomposition operation is based on integer modular arithmetic. Congruent sets are generated from integer modular operation over the index of the problem and constitute a partition. The partition is used to decompose the problem into several small subproblems. The partition under the integer modular operation is unique. Complete reconstruction of the problem is guaranteed by the uniqueness of the partition. Since the algorithm is established on the foundation of all algebraic systems, i.e. number and set theories, it is highly problem-independent, and provides an uniform approach to parallel decomposition of general problems on the discrete domain. Because the subproblems are highly regular, it is suitable for VLSI hardware implementation. The computational complexity of the developed convolution algorithm is reduced by a factor of p², and (p²)ⁿ for n-dimensional problems (p can be any common factor of the input sequences). Compared to the popular FFT methods, where round-off error is introduced, the convolution result from the algorithm is exact. In addition, it does not have restrictions on the length of the input sequences, as in the well known block convolution algorithm. As a result, the algorithm is highly efficient for convolution of large input sequences or correlation operations     

A local search approach to a circle cutting problem arising in the motor cycle industry

This paper is concerned with the development of a customized circle packing algorithm for a manufacturer of sprockets for the motor cycle industry. Practical constraints mean that the problem differs somewhat from those tackled elsewhere in the literature. In particular, the layouts need to conform to a given structure. This is achieved by using a local search algorithm with an appropriate starting solution and a series of neighbourhoods designed to preserve the layout structure. Empirical evidence based on real data shows that the quality of the resulting solutions closely matches that of cutting patterns currently produced by human experts. Computation times average around 20–30?s per order as compared to several hours for an equivalent manual solution.