Mathematical modeling and optimization of intratumor drug transport

A pseudohyperbolic problem of optimal control of intratumoral drug distribution is formulated. It takes into account the heterogeneity of tumor tissues and effects of convection diffusion in a fissured porous medium. A mathematical model constructed and the corresponding optimal control problem are shown to be correct. __________ Translated from Kibernetika i Sistemnyi Analiz, No. 6, pp. 147–154, November–December 2007.     

Binary rewriting and call interception for efficient runtime protection against buffer overflows

Buffer overflow vulnerabilities are one of the most commonly and widely exploited security vulnerabilities in programs. Most existing solutions for avoiding buffer overflows are either inadequate, inefficient or incompatible with existing code. In this paper, we present a novel approach for transparent and efficient runtime protection against buffer overflows. The approach is implemented by two tools: Type Information Extractor and Depositor (TIED) and LibsafePlus. TIED is first used on a binary executable or shared library file to extract type information from the debugging information inserted in the file by the compiler and reinsert it in the file as a data structure available at runtime. LibsafePlus is a shared library that is preloaded when the program is run. LibsafePlus intercepts unsafe C library calls such as strcpy and uses the type information made available by TIED at runtime to determine whether it would be ‘safe’ to carry out the operation. With our simple design we are able to protect most applications with a performance overhead of less than 10%. Copyright © 2006 John Wiley & Sons, Ltd.     

Chromatic luminance,colorimetric purity,and optimal aperture‐color stimuli

Chromatic luminance (i.e., luminance of a monochromatic color) is the source of all luminance, since achromatic luminance arises only from mixing colors and their chromatic luminances. The ratio of chromatic luminance to total luminance (i.e., chromatic plus achromatic luminance) is known as colorimetric purity, and its measurement has long been problematic for nonspectral hues. Colorimetric purity (p_c) is a luminance metric in contrast to excitation purity, which is a chromaticity‐diagram metric approximating saturation. The CIE definition of p_c contains a fallacy. CIE defines maximum (1.0) p_c for spectral stimuli as monochromatic (i.e., optimal) stimuli, and as the line between spectrum ends for nonspectrals. However, this line has <0.003 lm/W according to CIE colorimetric data and is therefore effectively invisible. It only represents the limit of theoretically attainable colors, and is of no practical use in color reproduction or color appearance. Required is a locus giving optimal rather than invisible nonspectral stimuli. The problem is partly semantic. CIE wisely adopted the term colorimetric purity, rather than the original spectral luminance purity, to permit an equivalent metric for spectrals and nonspectrals, but the parameter of equivalence was never clear. Since 1 p_c denotes optimal aperture‐color stimuli for spectrals, arguably 1 p_c should denote optimal stimuli consistently for all stimuli. The problem reduces to calculating optimal aperture‐color stimuli (“optimal” in energy efficiency in color‐matching) for nonspectrals, shown to comprise 442 + 613 nm in all CIE illuminants. This remedy merely requires redefinition of 1 p_c for nonspectrals as the line 442–613 nm, and gives meaningful p_c values over the hue cycle allowing new research of chromatic luminance relations with color appearance. © 2007 Wiley Periodicals, Inc. Col Res Appl, 32, 469–476, 2007     

Tree-based partitioning of date for association rule mining

The most computationally demanding aspect of Association Rule Mining is the identification and counting of support of the frequent sets of items that occur together sufficiently often to be the basis of potentially interesting rules. The task increases in difficulty with the scale of the data and also with its density. The greatest challenge is posed by data that is too large to be contained in primary memory, especially when high data density and/or low support thresholds give rise to very large numbers of candidates that must be counted. In this paper, we consider strategies for partitioning the data to deal effectively with such cases. We describe a partitioning approach which organises the data into tree structures that can be processed independently. We present experimental results that show the method scales well for increasing dimensions of data and performs significantly better than alternatives, especially when dealing with dense data and low support thresholds. Shakil Ahmed received a first class BSc (Hons) degree from Dhaka University, Bangladesh, in 1990; and an MSc (first class), also Dhaka University, in 1992. He received his PhD from The University of Liverpool, UK, in 2005. From 2000 onwards he is a member of the Data Mining Group at the Department of Computer Science of the University of Liverpool, UK. His research interests include data mining, Association Rule Mining and pattern recognition. Frans Coenen has been working in the field of Data Mining for many years and has written widely on the subject. He received his PhD from Liverpool Polytechnic in 1989, after which he took up a post as a RA within the Department of Computer Science at the University of Liverpool. In 1997, he took up a lecturing post within the same department. His current Data Mining research interests include Association rule Mining, Classification algorithms and text mining. He is on the programme committee for ICDM'05 and was the chair for the UK KDD symposium (UKKDD'05). Paul Leng is professor of e-Learning at the University of Liverpool and director of the e-Learning Unit, which is responsible for overseeing the University's online degree programmes, leading to degrees of MSc in IT and MBA. Along with e-Learning, his main research interests are in Data Mining, especially in methods of discovering Association Rules. In collaboration with Frans Coenen, he has developed efficient new algorithms for finding frequent sets and is exploring applications in text mining and classification.     

以数字搜索树表示的二值图象的几何变换

本文介绍以数字搜索树表示的二值图象的一种几何变换算法，文中讨论了四分区与正四边区的基本关系，输出ＤＳＴ结点成立的充分条件，给出了完整的几何变换算法并对算法的复杂性作了分析。     

具有多重焦点的波带透镜的设计

本文提出了一种新型的具有多重焦点的波带透镜的概念及其设计方法。可提供某些特定的光场分布,而且具有性能稳定、微型化和可实际制作等特点。     

基于Matlab的线性规划问题求解

线性规划是运筹学中研究较早、发展较快、应用广泛、方法成熟的一个重要分支,它是辅助人们进行科学管理的一种重要的数学方法.文章首先介绍了线性规划的基本概念及标准形式,着重讨论了线性规划问题的三种常用解法:单纯形法、直接搜索法以及遗传算法,最后在Matlab R2009a环境下进行了仿真.通过结果可以看出,用Matlab求解线性规划问题,可以避免手工的烦琐计算,大大地提高工作效率和结果的准确性.     

最佳相位设计的MBE声码器语音合成

提出了一种基于最佳相位设计的语音合成技术,能够有效降低MBE声码器合成语音信号由于波形失衡而导致的饱和失真的概率.此外,为了保证合成滤波器的稳定性,对线谱频率(LSF)系数提取进行了优化.实验结果显示,合成语音信号波形近似平衡地分布在零幅度值的上下,语音听起来没有不舒服的感觉.实验结果表明,基于最佳相位设计的语音合成技术能够有效改善合成语音质量.     

Intranet搜索引擎设计与实现

随着企业内部网络应用的深入,Intranet内部的信息资源越来越庞大,怎样为这些数据信息构建索引是我们面If缶的主要任务,而全文检索的产生解决了这一问题。目前越来越多的中小企业采用Linux系统作为Web平台,并且利用检索系统来管理内部繁多的文本和HTML文件。文章对www搜索引擎的全文检索及其相关技术进行了分析和讨论,实现了一个基于Linux环境的Intranet搜索引擎LISE（Linux Intranet Search Engine）。LISE利用了基于词表的索引方法,为用户提供了更加准确的信息,能满足多种中小企业用户的需求。