Зарубежная периодика по тематике ИПИ РАН
Выпуск № 1, январь 2007 г.
Материалы подготовлены лаб. 13
Безопасность информационных систем. Сентябрь \ октябрь, том 15, вып. 4.
Information Systems Security, Sep/Oct2006, Vol. 15 Issue 4
ISSN: X
Publisher Information: Auerbach Publications Inc.
345 Park Avenue South, Floor 10
New York New York 10010
United States of America
http://www.
СТАТЬИ
1. Вопросы безопасности при работе в электронной почте Gmail
Gmail and Privacy : Freeman, Edward H., p2-6, 5p;
Ключевые слова: COMPUTER security, ELECTRONIC mail systems, INTERNET advertising, LEGISLATIVE bodies, ELECTRONIC mail messages, ELECTRONIC commerce, INTERNET industry, INTERNET -- Law & legislation
Company/Entity: GOOGLE Inc.
Abstract: The article deals with the alleged privacy concerns brought on by Gmail, an online messaging service, and suggests how legislative bodies and individuals should react to this new technology. This new technology has the horrible potential to use electronic mails to create profiles on users based on our most personal and intimate thoughts. The California State Senate passed Senate Bill 1822, popularly known as the anti-Gmail bill. Gmail has fine-tuned the advertising process to minimize advertisements that are inappropriate for a particular user to encourage potential advertisers to use their service. Google Inc. has an ongoinresponsibility to protect the privacy of its users and is now one of the industry leaders in this effort.
Author Affiliations: 1Attorney and educational consultant in West Hartford, Connecticut
2. Пять мифов о безопасности беспроводной связи с ЭВМ.
The Five Myths of Wireless : Kindervag, John. p7-16, 10p
Ключевые слова: COMPUTER crimes, COMPUTER networks, COMPUTER security, DATA protection, WIRELESS communication systems, INTERNET industry, CYBERTERRORISM, COMPUTER users, WIRELESS Internet
Abstract: The article presents the myths regarding wireless communication security which appears from time to time and are usually felt by corporations, clients, and wireless users. It was stated that turning off the broadcast service set identifier will prevent attackers from finding the users' access point. It was assumed that users can restrict access to wireless networks by turning on the media access control address filtering. The letter "E" in WEP, which means wired equivalent privacy, is usually mistaken as encryption. It was always stated that Lightweight Extensible Authentication Protocol is puter users have adopted the thought that WPA/802.1x/802.11i is the preferred method of securing wireless networks.
Author Affiliations: 1Senior security architect at Vigilar, Inc.
3. О степени защищенности, эквивалентной для системы проводной связи, и уязвимости, присущей сетям Wi-Fi.
Demonstrating the Wired Equivalent Privacy (WEP) Weaknesses Inherent in Wi-Fi : Curran, Kevin; Smyth, Elaine. p17-38, 22p;
Ключевые слова: COMPUTER crimes, COMPUTER industry, COMPUTER networks, COMPUTER security, LOCAL area networks (Computer networks), WIRELESS communication systems, INTERNET industry, WIRELESS LANs, IEEE 802.11 (Standard)
Abstract: The article focuses on demonstrating the wired equivalent privacy weaknesses which are inherent in wireless fidelity networks. Wireless devices have the option of participating in ad hoc or infrastructure networks. Wired networks have always presented their own security issues but wireless networks introduce a whole new set of rules with their own unique security vulnerabilities. Wireless local area networks suffer from all the security risks associated with their wired counterparts. However, these counterparts also introduce some unique risks of their own.
Author Affiliations: 1School of Computing and Intelligent Systems, University of Northern Ireland, U. K. Professor Curran can be reached a2Graduate student in the Internet Technologies Research Group, University of Ulster, Northern Ireland, U. K.
4. Совершенствование безопасности соединений беспроводной связи на короткие дистанции по технологии Bluetooth.
Improving Bluetooth Security: What IT Managers and Mobile Device Users Can : Hernack, Brian. p39-42, 4p;
Ключевые слова: COMPUTER crimes, COMPUTER hackers, COMPUTER industry, COMPUTER security, INFORMATION technology, MOBILE communication systems, WIRELESS communication systems, CELLULAR telephone systems, BLUETOOTH technology
Abstract: The article provides several insights on what information technology managers and mobile device users can do to improve Bluetooth security. Hackers are using Bluetooth to attack mobile devices such as mobile phones, personal data assistants (PDA), laptop computers, and handsets. Enterprises and mobile device users should recognize that Bluetooth comes in all shapes and sizes and security risks extend far beyond PDAs and smartphones. Executives should immediately identify any company issued Bluetooth devices and alert other users of known vulnerabilities.
Author Affiliations: 1University of Michigan with a degree in computer engineering
5. Применение безопасной радиочастотной идентификации (Radio Frequency Identification):
проблемы, методы и контроль.
Securing RFID Applications: Issues, Methods, and : So, Stuart C. K.; Liu, John J.. p43-50, 8p;
Ключевые слова:COMMERCIAL products, ELECTRONIC apparatus & appliances, ELECTRONIC security systems, INFORMATION storage & retrieval systems, RADIO frequency, RADIO frequency identification systems, SECURITY systems, WIRELESS communication systems
MASSACHUSETTS Institute of Technology (Cambridge, Mass.)
Abstract: The article presents issues, methods, and controls on securing radio frequency identification (RFID) applications. The technology is developed by the Auto-ID Center at the Massachusetts Institute of Technology in Cambridge, Massachusetts and relies on storing and remotely retrieving data using devices called RFID tags and readers. The data stored on an RFID tag is often publicly accessible or product related, such as electronic product code data or product descriptions. The tag is designed in such a way that each associated consumer product can be uniquely identified through an electronic product code and will be broadcasted to any nearby reader.
Author Affiliations: 1Computer Systems and Laboratory Officer in the Department of Logistics at The Hong Kong Polytechnic University
2Head and Chair Professor of Maritime Studies in the Department of Logistics at the Hong Kong Polytechnic Universit
6. Приоритетные вопросы безопасности, стоящие перед организацией: чем может помочь правительство?
The Top Information Security Issues Facing Organizations: What Can Government Do to Help? Authors:Knapp, Kenneth J.1 Marshall, Thomas E.2 Rainer, Jr., R. Kelly3 Morrow, Dorsey W. A4 p51-58, 8p
Ключевые слова: COMPUTER crimes, COMPUTER security, DATA protection, FEDERAL government, INDUSTRIAL management, ONLINE information services, ELECTRONIC information resources -- Access control, CYBERTERRORISM
Geographic Terms: UNITED States
Abstract: The article reports on means which are to be taken by the U. S. federal government to help solve the top information security problems faced by organizations in the country. The increasing variety of threats and ferociousness of computer attacks and crimes has made the protection of information a complex challenge. Surveys are conducted to tackle upon the issues. The top-ranked issue in the surveys is the top management support. The survey participants are saying that gaining top management support is the most critical issue of an information security program. Governments can also help by creating a legal environment that assists companies and consumers in protecting their valuable information.
Author Affiliations: 1Assistant professor of management at the U. S. Air Force Academy, Colorado
2Associate professor of MIS, Department of Management, Auburn University, Alabama
3George Phillips Privett Professor of MIS, Department of Management, Auburn University, Alabama
4General counsel and corporate secretary of (ISC)
Безопасность информационных систем. Ноябрь \ Декабрь, том 15, вып. 5.
Information Systems Security, Nov/Dec2006, Vol. 15 Issue 5
ISSN: X
Publisher Information: Auerbach Publications Inc.
345 Park Avenue South, Floor 10
New York New York 10010
United States of America
http://www.
СТАТЬИ
1. Мета-фишер: Web-роботы и Интернет - мошенничество следующего поколения.
MetaFisher: Next-Generation Bots and : Dunham, Ken. Information Systems, p2-6, 5p;
Ключевые слова: COMPUTER crimes, COMPUTER networks -- Security measures, COMPUTER security, COMPUTER viruses, WEB sites, INTERNET fraud, PHP (Computer program language), COMPUTER networks -- Remote access, PHISHING
Abstract: The article focuses on MetaFisher, which is being said as the next generation phishing element for Internet fraudsters. According to software experts, it utilizes a PHP command and control interface to monitor, update, and control autogenerated bots. Beside these distinguished features, MetaFisher contains sophisticated phishing attacks that dynamically implant HTML into targeted banking sites to steal information from the victim. Information on how MetaFisher is loaded in a computer, how it starts spreading over the network, and upto what extent it can damage Web sites and network infrastructure, is also included in the article.
Author Affiliations: 1Director of malicious code for iDEFENSE Inc.
2. Измеряемая безопасность.
Measuring : Kleinfeld, Abe. Nov/Dec2006, Vol. , p7-12, 6p
Ключевые слова: BUSINESS enterprises, COMPUTER crimes, COMPUTER hackers, COMPUTER networks -- Security measures, COMPUTER security, SECURITY systems industry
Abstract: The article presents the author's comments on the network security issues for any business puter security has remained a concern at the most priority among CIOs, yet only few have been able to measure the effectiveness of their spending. As the cyber-attacks have increased drastically, companies are rapidly increasing their spending in IT security even as overall IT budgets have remained flat or declined.
Author Affiliations: 1President and CEO of nCircle, Inc.
3. Социальный инжиниринг; концепции и решения.
Social Engineering: Concepts and : Peltier, Thomas R., p13-21, 9p;
Ключевые слова: COMPUTER hackers, COMPUTER networks -- Security measures, COMPUTER security, COMPUTERS -- Access control, DATA protection, ELECTRONIC surveillance, SOCIAL engineering, INTERNET fraud, FIREWALLS (Computer security, Passwords
Abstract: The article presents information on the concepts of social engineering and offers tips to avoid the security attacks on hardware/software by the social engineers. Social engineers are the outside hackers who are not working within the diseased organization. According to a study, only 30% of hacking comes from outsiders, while 70% reasons for hacking occurs with the help of company insiders. Several suggestions like implementing help desk system, strict password system, firewalls to restrict unauthorized access from outer network, and implement user-level responsibilities.
Author Affiliations: 1Principal of Peltier and Associates.
4. Компромисс по информационной безопасности: перспективы пользователя.
Information Security Tradeoffs: The User : Post, Gerald V.; Kagan, Albert. p22-29, 8p;
Ключевые слова: COMPUTER networks -- Security measures, COMPUTER security, DATA protection, ELECTRONIC surveillance, INFORMATION services, ACCESS control
Abstract: The article presents the authors' comments on the job responsibilities of an information security (IS) practitioner. An IS technician might only be responsible on preventing and recovering from security-related problems. Though, increased monitoring and enhanced use of security controls have led the IS managers to interference and delays of information usage for legitimate users.
Author Affiliations: 1Professor of management information systems, Eberhardt School of Business, University of Pacific, Stockton, California 2Professor, Arizona State University, Tempe.
5. Инициативы по внедрению метрик для оценки безопасности.
Implementing Security Metrics : Nichols, Elizabeth A.; Sudbury, Andrew. p30-38, 9p;
Ключевые слова: COMPUTER security, DATA protection, INFORMATION services, ORGANIZATIONAL effectiveness, STANDARDIZATION, SOFTWARE measurement
Abstract: The article presents the authors' views on how important is a metrics program to maximize the effectiveness of an information security strategy within any organization. However, the security metrics are made secret and are often considered too hard to implement with the end result making it necessary and effective management tool. When security metrics are applied to security performance, they become the expression of the state or quality of a critical aspect of the IT infrastructure.
Author Affiliations: 1Founder, board member and CTO for ClearPoint Metrics, Inc.
2Director of security metrics design and best practices for ClearPoint Metrics, Inc.
6. Защита от инсайдерских атак.
Securing Against Insider : Lynch, David M., p39-47, 9p;
Ключевые слова: BUSINESS communication, COMPUTER networks -- Security measures, COMPUTER security, ELECTRONIC surveillance, INFORMATION technology, INTERNET
Abstract: The article presents the author's comments on securing organizational data from the possible insider threats. As the Internet has transposed as the communication framework, most of the organizations have significantly changed the way information technology security is implemented in every business environment. The author suggests to establish necessary security relationships. Regular audit of the network also ensures that the security relationships are being enforced inside the organization.
7. Защита внутренних ресурсов системы с использованием защитной технологии Firewall для приложений.
Protecting Your Internal Resources with Intranet Application : Murphy, Alan. p48-53, 6p;
Ключевые слова: COMPUTER networks, COMPUTER networks -- Security measures, COMPUTER security, DATA protection, DATA transmission systems, INFORMATION networks, INTRANETS (Computer networks), NETWORK computers, FIREWALLS (Computer security)
Abstract: The article presents information about the web application firewalls (WAFs) that are used to prevent unauthorized access from outside the Intranet of any organization. WAFs are rapidly becoming the key aspect of end-to-end computer network security. Web applications over Internet ports 80 and 443 are some of the logical steps to restrict access from the outside to the resources on the inside. How the WAFs sit between the network firewall and the destination application to secure the internal network has been explained in the article.
Author Affiliations: 1Product management engineer, F5 Networks.
Труды Британского института инженеров-электриков – Обработка зрительных образов, изображений и сигналов. Август 2006, том 153, вып. 4.
IEE Proceedings -- Vision, Image & Signal Processing, Aug2006, Vol. 153 Issue 4
ISSN: X
Publisher Information: Institution of Engineering & Technology
Institution of Engineering & Technology
Michael Faraday House
Six Hills Way
Stevenage, Hertfordshire SG1 2AY
United Kingdom
http://www. iee. org
СТАТЬИ
1. Быстрое адаптивное преобразование Фурье для построения отображения на ЭВМ с одним потоком команд и множеством потоков данных.
Flexible-length fast Fourier transform for mapping onto single-instruction multiple-data computing : Jones, K. J. p395-404, 10p, 1 chart, 11 graphs
Ключевые слова: ALGORITHMS, CONGRUENCES & residues, FOURIER analysis, FOURIER transformations, SIGNAL processing -- Digital techniques, CHINESE remainder theorem
Abstract: A novel and flexible approach to the design and implementation of fast Fourier transforms (FFTs) of standard (fixed-radix) or non-standard length is adopting a two-factor formulation, based upon either the prime factor algorithm or the common factor algorithm, where one factor, N1, is an integer power, and the other, N2, a small integer (odd - or even-valued), the (N1×N2)-point 1D discrete Fourier transform (DFT) can be carried out via he ‘row–column’ method with the design of just two generic DFT/FFT modules. Processing the small row-DFTs coefficient-by-coefficient, rather than DFT-by-DFT, it is seen how the usual requirement for matrix transposition of the row-DFT output can be eliminated. This reduces the processing requirement to a number of independent processes in which each process generates a set of small-DFT coefficients prior to computing a fixed-radix FFT of the resulting coefficient set. Hardware efficiency/simplicity is achieved by computing the small-DFT coefficients via a modified form of the Goertzel DFT (GDFT) filter, referred to here as the ‘dual-coefficient’ GDFT filter, which simultaneously computes two DFT coefficients. The resulting decomposition maps onto just floorl½N2floorr+1 processing elements (PEs), via the single-instruction multiple-data computing architecture, in which each PE comprises two types of module: one corresponding to a dual-coefficient GDFT filter bank, the other to the associated dual-data FFTs. This yields flexible-length FFTs that lend themselves naturally to multi-level parallelisation, overcoming the communication problems associated with mapping sequentially optimal FFT algorithms onto multi-processor computing architectures.
2. Новый процессор FFT/IFFT с высоким быстродействием и эффективным использованием памяти, основанный на потоковой обработке данных по алгоритму Волдера.
Memory-efficient and high-speed split-radix FFT/IFFT processor based on pipelined CORDIC : Sung, T.-Y.
Ключевые слова: ALGORITHMS, DIGITAL electronics, FOURIER analysis, FOURIER transformations, SIGNAL processing -- Digital technique, ORTHOGONAL frequency division multiplexing
Abstract: The author presents a CORDIC-based split-radix fast Fourier transform (FFT)/inverse FFT (IFFT) processor dedicated to the computation of 2048/4096/8192-point discrete Fourier transforms (DFTs). The arithmetic unit of a butterfly processor and a twiddle factor generator are based on a CORDIC algorithm. An efficient implementation of the CORDIC-based split-radix FFT algorithm is demonstrated. The chip of 2048/4096/8192-point FFT/IFFT core processor is fabricated in a 0.18 µm CMOS technology. The core size is 4860×7883 µm2 and contains about gates for logic and memory, and the power dissipation is 350 mW with a clock rate of 150 MHz at 1.8 V. All control signals are generated internally on-chip. The processor performs 8192-point FFT/IFFT every 138 µs and 2048-point FFT/IFFT every 34.5 µs, respectively, which exceeds orthogonal frequency division multiplexer symbol rates. The modified-pipelining CORDIC arithmetic unit is employed for complex multiplication. A CORDIC twiddle factor generator is proposed and implemented for reducing the size of ROM required for storing the twiddle pared with conventional FFT implementations, the power consumption is reduced by 25%.
Author Affiliations: 1Chung Hua University, Department of Microelectronics Engineering, Hsinchu, Taiwan, Republic of China
3. Расширяющаяся и сокращающаяся искусственная нейронная сеть, основанная на комплексной радиальной функции функции ( RBF), для выравнивания загрузки коммуникационного канала.
Complex-valued growing and pruning RBF neural networks for communication channel : Li, M.-B.; Huang, G.-B.; Saratchandran, P.; Sundararajan, N., p411-418, 8p, 1 chart, 1graphs
Ключевые слова: APPROXIMATION theory, ESTIMATION theory, KALMAN filtering, NEURAL networks (Computer science), RANDOM noise theory, RADIAL basis functions
Abstract: A complex-valued radial basis function (RBF) network is proposed for solving the communication channel equalisation problem with quadrature amplitude modulation signals. The network uses a sequential learning scheme, referred to as the complex-valued growing and pruning (CGAP) algorithm, and is an extension of the generalised growing and pruning network of Huang et al. developed for real-valued radial basis function (RBF) networks. The learning algorithm in this network makes use of the concept of ‘significance’ for hidden linking the significance of a neuron to the learning accuracy, a growing and pruning strategy for an RBF neural network with complex inputs is derived. Further, for both growing and pruning, one needs to check only the nearest neuron (based on the Euclidean distance to the latest input data) for its significance, resulting in a more compact network. When there is no growing or pruning, a complex, extended Kalman filter is used to adjust the RBF network parameters. The performance of the CGAP-RBF equaliser is compared with several other equalisers such as CMRAN, CRBF and ASNN on several nonlinear, complex channel equalisation problems. The results show that the CGAP-RBF equaliser is superior to other equalisers in terms of symbol error rate and network complexity.
Author Affiliations: 1Nanyang Technological University, School of Electrical and Electronic Engineering, Nanyang, Singapore
4. Максимизация в апостериорном подходе к разделению сигналов в недоопределённый смеси со скрытой нелинейностью.
Maximum a posteriori-based approach to blind nonlinear underdetermined : Wei, C.; Woo, W. L.; Dlay, S. S.; Khor, L. C. p419-430, 12p, 8 graphs
Ключевые слова: CHARACTERISTIC functions, DISTRIBUTION (Probability theory), GAUSSIAN distribution, INFORMATION storage & retrieval system, SOURCE separation (Signal processing, BLIND source separation
Abstract: A new learning algorithm is proposed to solve the separation problem of the blind nonlinear underdetermined mixtures. The mixing system is characterised by the post-nonlinear structure and concurrently the number of sensors is less than the number of sources. The proposed algorithm utilises the generalised Gaussian distribution to model the prior probability distribution of the source signals and the mixing variables. A novel iterative technique based on alternate optimisation within the Bayesian framework has been developed for estimating the source signals, mixing matrix and the nonlinear distortion. It is shown that through formal Bayesian derivation, the update of the mixing matrix can be decomposed into two separate constituents given by linear and nonlinear parts. Furthermore, the post-nonlinear distortion functions in the mixing model are approximated by a set of polynomials and the coefficients are found by solving a least square error problem. Simulations have been carried out to verify the effectiveness in separating signals under nonlinear and underdetermined conditions. An average margin of 130% improvement has been obtained when compared with the existing linear algorithm.
Author Affiliations: 1University of Newcastle, School of Electrical, Electronic and Computer Engineering, Newcastle upon Tyne, UK
5. Синусоидальное моделирование с использованием поиска совпадений по восприятию на психоаккустической шкале Барк для параметрического кодирования звукового сигнала.
Sinusoidal modelling using perceptual matching pursuits in the Bark scale for parametric audio : Vera-Candeas, P.; Ruiz-Reyes, N.; Cuevas-Martınez, J. C.; Rosa-Zurera, M.; López-Ferreras, p431-435, 5p, 2 charts, 4 graphs
Ключевые слова: ADAPTIVE signal processing, AUDITORY perception, MAP projection, ORTHOGRAPHIC projection, PSYCHOACOUSTICS, SINUSOIDAL projection (Cartography)
Abstract: An improved sinusoidal modelling method based on perceptual matching pursuits computed in the Bark scale with application to parametric audio coding is plex exponentials compose the overcomplete dictionary for matching pursuits. The main contribution is the minimisation of a perceptual distortion measure defined in the Bark scale to select the optimum atom at each iteration of the pursuits. In addition, a psychoacoustic stopping criterion for the pursuits is presented. The proposed sinusoidal modelling method is suitable to be integrated into a parametric audio coder based on the three-part model of sines, transients and noise, as appreciated in experimental results. The method provides significant advantages over previously proposed methods mainly because it operates in the Bark scale rather than in the frequency scale.
Author Affiliations: 1University of Jaén, Electronics and Telecommunication Engineering Department, Linares, Spa
2University of Alcalá, Signal Theory and Communication Department, Alcalá de Henares, Spain
6. Поиск изображений, основанный на обратной связи по достоверности и неотрицательной матрице факторизации.
Relevance feedback based on non-negative matrix factorisation for image : Liang, D.; Yang, J.; Chang, Y.,p436-444, 9p, 1 chart, 9 graphs
Ключевые слова: FACTOR analysis, IMAGE processing, IMAGING systems, INFORMATION retrieval, PRINCIPAL components analysis, EXPECTATION-maximization algorithms
Abstract: As a powerful tool for content-based image retrieval, many techniques have been proposed for relevance feedback. A non-negative matrix factorisation (NMF)-based relevance feedback approach is introduced. This approach uses a standard NMF algorithm to construct a reliable semantic space from a pool of relevant images based on a user's interactions, because the latent semantic space derived by NMF does not need to be orthogonal, and each image is guaranteed to take only non-negative values in all the latent semantic directions. It means that each axis in the space derived by NMF has a straightforward correspondence with each image semantic class. In addition, the hidden semantic features of the query and images in the database are extracted with an NMF-projecting memorising the feedback information provided by the user, the knowledge accumulated from past relevance interaction is used to update semantic space, which results in the semantic space being closer to the user's expectation. The experiments show that the proposed NMF-based relevance feedback approach performs better than other relevance feedback approaches.
Author Affiliations: 1Shanghai Jiao Tong University, Institute of Image Processing and Pattern Recognition, Shanghai, People's Republic of China
7. Универсальное квантование цветности для различных цветовых пространств.
Universal colour quantization for different colour : Yu, C.-H.; Chen, S.-Y.. p 445-455, 11p, 2 charts, 10 graphs
Ключевые слова: COLORS, FORM perception, IMAGE processing, IMAGING systems, PATTERN perception, VISUAL perception
Abstract: A universal colour quantisation for different colour spaces is proposed. First, the differences between colour spaces such as RGB, YCrCb, YIQ, I1I2I3, HSV, L*a*b* and L*u*v* are analysed. On the basis of analysis results, the relationship between RGB and HSV is derived, which in turn is used to design a universal colour quantisation for improving retrieval effectiveness. Moreover, colour distribution of real images is further considered so as to obtain more accurate retrieval results. The effectiveness and practicability of the proposed method have been demonstrated by various experiments.
Author Affiliations: 1Yuan Ze University, Department of Computer Science and Engineering, Taoyuan, Taiwan, Republic of China
8. Метрика качества изображения, построенная посредством «восходящей» и «нисходящей» имитации действия зрительного аппарата человека.
Image quality metric with an integrated bottom-up and top-down HVS : Zhai, G.; Zhang, W.; Yang, X.; Xu, Y. p456-460, 5p, 1 chart, 4 graphs
Ключевые слова: IMAGE processing, IMAGING systems, LEAST squares, MULTIVARIATE analysis, REGRESSION analysis, DIGITAL images
Abstract: A novel image quality assessment technique is proposed that incorporates both a ‘bottom-up’ and a ‘top-down’ simulation of the mechanism of the human visual system (HVS) into a unified quality metric, called top-down/bottom-up quality metric (TBQM). The Importance Map and region-based structural similarity index is employed as the bottom-up and the top-down approach of HVS, respectively. These two approaches are then integrated into the TBQM. Extensive experiments indicate that the proposed metric is highly correlated with subjective quality grading and is significantly better than the widely used image distortion metric, such as mean squared error. This method also outperforms simple top-down structural similarity measures.
Author Affiliations: 1Shanghai Jiao Tong University, Institute of Image Communication and Information Processing, Shanghai, People's Republic of China
9. Выбор локализованных характерных черт, получаемых с единственного изображения лица.
Selection of localised salient features from a single facial : Grudin, M. A.; Lisboa, P. J. G.; Harvey, D. M. p461-467, 7p, 1 chart, 7 diagrams
Ключевые слова: COMPUTER files, DATABASES, IMAGE processing, OPTICAL pattern recognition, VISUAL learning, HUMAN face recognition (Computer science)
Abstract: A new application of dynamic link architectures is proposed for the automatic selection of key features in multiple instances of facial images, from manually tagged features in a single facial image of each person. This method is evaluated for its accuracy in face recognition, determined by the frequency with which the model graph fitted to a single instance of an individual's face achieves the closest match to other images of the same person. In addition to the potential of this method for face recognition, the methodology for feature alignment is a practical enabler to recognise emotion in affective computing. The system was first trained to evaluate typical intrapersonal variations of facial features on a training subset with ten facial images from six individuals in the Manchester Face Database (Lanitis et al., 1993). After the training stage, facial features in an image of a new face were assigned the intrapersonal variations obtained for the corresponding features during the training stage. The saliency measure for each local image feature was then computed within a Bayesian framework and the accuracy of face recognition was evaluated with a further three images each from 24 people, taken from the same data set. A refinement of the saliency framework that used only a subset of local features for face recognition further increased the accuracy of face recognition on the same test database.
Author Affiliations: 1Liverpool JMU, General Engineering Research Institute, Liverpool, UK
2Liverpool JMU, Computing and Mathematical Sciences, Liverpool, UK
10. Аналитическая кусочно-линейная модель радиальных искажений для точной калибрации камеры.
Analytical piecewise radial distortion model for precision camera : Ma, L.; Chen, Y. Q.; Moore, K. L., p468-474, 7p, 6 charts, 4 graphs
Abstract—The common approach to radial distortion is by the means of polynomial approximation, which introduces distortion-specific parameters into the camera model and requires estimation of these distortion parameters. The task of estimating radial distortion is to find a radial distortion model that allows easy undistortion as well as satisfactory accuracy. This paper presents a new piecewise radial distor-
tion model with easy analytical undistortion formula. The motivation for seeking a piecewise radial distortion model is that, when a camera is resulted in a low quality during manufacturing, the nonlinear radial distortion can be complex.
Using low order polynomials to approximate the radial distortion might not be precise enough. On the other hand, higher order polynomials suer from the inverse problem. With the new piecewise radial distortion function, more flexibility is obtained and the radial undistortion can be performed analytically. Experimental results are presented to show that with this new piecewise radial distortion model, better performance is achieved than that using the single function. Furthermore, a comparable performance with the conventional polynomial model using 2 coecients can also be accomplished.
Ключевые слова: Camera calibration, Radial distortion, Radial undistortion, Piecewise Function.
11. Классификация изображений скальных пород, основанная на анализе особенностей К ближайших изображений.
Rock image classification based on k-nearest neighbour : Lepistö, L.; Kunttu, I.; Visa, A., p475-482, 8p, 2 charts, 7 graphs
Ключевые слова: COMBINATIONS, COMBINATORIAL analysis, FORM perception, PATTERN perception, ROCKS, IMAGE analysis
Abstract: Image classification is usually based on various visual descriptors extracted from the images. The descriptors characterising, for example, image colours or textures are often high dimensional and their scaling varies significantly. In the case of natural images, the feature distributions are often non-homogenous and the image classes are also overlapping in the feature space. This can be problematic, if all the descriptors are combined into a single feature vector in the classification. A method is presented for combining different
visual descriptors in rock image classification. In our approach, k-nearest neighbour classification is firscarried out for each descriptor separately. After that, the final decision is made by combining the nearest neighbours in each base classification. The total numbers of the neighbours representing each class are used as votes in the final classification. The experimental results with rock image classification indicate that the proposed classifier combination method is more accurate than the conventional plurality voting.
Author Affiliations: 1Tampere University of Technology, Institute of Signal Processing, Tampere, Finland
12. Гистограммо - ориентированный алгоритм нанесения цветных водяных знаков, устойчивый по отношению к геометрическим преобразованиям и обработке сигнала.
Histogram-oriented watermarking algorithm: colour image watermarking scheme robust against geometric attacks and signal : Lin, C.-H.; Chan, D.-Y.; Su, H.; Hsieh, W.-S.. p483-492, 10p, 5 charts, 9 graphs
Ключевые слова: FOURIER analysis, FOURIER transformations, SIGNAL processing, SIGNAL theory (Telecommunication), WATERMARKS, DIGITAL watermarking
Abstract: Developing a robust method of image watermarking that resists rotation, scaling and/or translation transformations is widely considered to be a more challenging task than developing a method resistant to other attacks. Altering the orientation or size of the image, even only slightly, reduces the receiver's ability to retrieve the watermark. Protecting against both geometric distortion and signal processing with blind detection is even more problematic. This investigation proposes a novel approach, based on the properties ohistograms, to measure the numerous global features of all pixels in a cover image and to construct the three-dimensional feature space. The feature space is dynamically partitioned to identify several blocks used to embed the watermark. One feature of the pixels is modified to form a specially distributed histogram for embedding the watermark in a blind digital watermarking method that can be applied to colour images. Experimental results demonstrate the robustness of the proposed method against common geometric attacks and signal processing.
Author Affiliations: 1National Sun Yat-Sen University, Department of Computer Science and
Engineering, Kaohsiung, Taiwan, Republic of China
2National Chiayi University, Department of Computer Science and Information Engineering, Chayi,
Taiwan, Republic of China
13. Идентификация изображения, использующая обобщенную модель конечного автомата.
Image authentication using generalised finite : El-Din, S. N.; Moniri, M. p493-500, 8p, 2 charts, 14 diagrams
Ключевые слова: IDENTIFICATION, IMAGE transmission, IMAGING systems, SIGNAL processing, WATERMARKS, JPEG (Image coding standard), SIGNAL-to-noise ratio
Abstract: An effective technique for combined fragile and semi-fragile image authentication is presented. The authentication signature is extracted from image representation in the automata domain, unlike most conventional methods that are based on frequency domain. In the automata domain, the image is represented in terms of its perceptual self-similarity and can therefore survive high JPEG compression ratios. This method is also capable of changing the degree of fragility by setting the value of the image self-similarity parameter α. Furthermore, the proposed technique features an extremely compact signature length while maintaining a rather simple implementation. Experimental results are presented to demonstrate the effectiveness of the proposed technique.
Author Affiliations: 1Staffordshire University, Faculty of Computing, Engineering and
Technology, Stafford, UK
14. Улучшение Винеровской фильтрации с применением согласованного фильтра.
Improving local Wiener filtering using matched : Kazubek, M. p501-506, 6p, 3 charts, 4 diagrams
Ключевые слова: ALGORITHMS, CHARACTERISTIC functions, DISTRIBUTION (Probability theory), IMAGE processing, RANDOM noise theory, STATISTICAL communication theory
Abstract: A new approach to local Wiener filtering in the presence of Gaussian noise is presented. The two-step denoising algorithm is formulated. In the first step, standard local Wiener filtering is applied. The output of the first step is used for the construction of the matched filter, which enables us to better estimate the signal energy. The signal energy estimate is then used for the construction of the improved local Wiener filter. The performance of this method, using the dual-tree complex wavelet transform, is evaluated. The results obtained are comparable with the best in the literature but at a significant smaller computational cost.
Author Affiliations: 1Warsaw University of Technology, Institute of Radioelectronics,
Warsaw, Poland
15. Кодирование трёхмерного объемного изображения, использующее технологию «коротковолнового» (вейвлет) сжатия для быстрого поиска двумерных изображений.
Image coding of 3D volume using wavelet transform for fast retrieval of 2D : Vijayaraghavan, T.; Rajan, K. p507-511, 5p, 4 charts, 8 graphs
Ключевые слова: DIAGNOSTIC imaging, IMAGE processing, IMAGING systems, MAGNETIC resonance imaging, RADIOGRAPHY, Medical, THREE-dimensional display systems, TOMOGRAPHY
Abstract: An encoder/decoder system for 3D volumetric medical data is proposed. The system allows fast access to any 2D image by decoding only the relevant information from each subband image and thus provides minimum decoding time. This will be of immense use for the medical community because most of the computerised tomography, magnetic resonance imaging and positron emission tomography modalities produce volumetric data. As a fully-fledged 3D wavelet transform is used for compression, the advantage of good compression ratio is preserved. Preprocessing is carried out prior to wavelet transform, to enable easier identification of coefficients from each subband image. Inclusion of special characters in the bit stream (markers) facilitates access to corresponding information from the encoded data. Experiments are carried out by performing Daub4 filter along x (row) and y (column) directions and Haar filter along the z (slice) direction to account for the difference between interslice and intraslice resolution. The performance of the system has been evaluated on four sets of volumetric data and the results are compared to other 3D encoding/2D decoding schemes. Results show that for slice spacing of 3–10 mm, there is substantial improvement in decoding time. The speedup is found to be ∼2.
Author Affiliations: 1Indian Institute of Science, Department of Instrumentation, Bangalore,
India
2Indian Institute of Science, Department of Physics, Bangalore, India
16. Анализ способа улучшения контрастности с перекрывающейся интерполяцией.
Mechanism analysis of highly overlapped interpolation contrast : Wu, Z. Q.; Ware, J. A.; Wilson, I. D.; Zhang, J. p512-520, 9p, 4 charts, 10 diagrams
Ключевые слова: ALGORITHMS, DIGITAL electronics, IMAGE processing -- Digital techniques, IMAGE transmission, IMAGING systems, MATHEMATICAL analysis
Abstract: The pointwise sampling algorithm has been used in adaptive contrast enhancement (ACE) for nearly three decades. To overcome its computational overhead, various stepwise sampling algorithms have been proposed, including the highly overlapped interpolation contrast enhancement (HOICE) algorithm that addresses the artefacts, such as image distortion and blocking effects, of other stepwise sampling algorithms while keeping the advantage of speed. However, HOICE's internal mechanism has not been compared with traditional pointwise algorithms, which may affect the scope of its future application. The authors establish a
bridge between traditional pointwise sampling and HOICE: they first mathematically analyse the internamechanism of two typical sampling algorithms (pointwise and HOICE); and then quantitatively demonstrate the similarities between these two kinds of algorithms. Moreover, the results of quantitative measurement suggest that HOICE has an advantage over the pointwise algorithm in reducing the distortion along image edges. Therefore HOICE has the advantages of both pointwise and other stepwise algorithms making it a reliable sampling algorithm for ACE.
Author Affiliations: 1University of Glamorgan, School of Computing, Cardiff, UK
2University of Glamorgan, School of Electronics, Cardiff, UK
Международный журнал по компьютерному интеллекту и его применению.
Март 2006, том 6, вып.1.
International Journal of Computational Intelligence & Application.
Mar2006, Vol. 6 Issue 1,
ISSN:
Publisher Information: World Scientific Publishing Company
5 Toh Tuck Link
Singapore 596224
Singapore
http://www. /
СТАТЬИ
1. Взвешенная пороговая кластеризация для системы охранной сигнализации.
WEIGHTED THRESHOLD-BASED CLUSTERING FOR INTRUSION DETECTION : NIKULIN, VLADIMIR. 1-19, 19p, 11 charts, 3 graphs
Ключевые слова: ALGEBRAS, Linear, DETECTORS, LINEAR programming, MATHEMATICAL analysis, MATRICES, SYSTEM analysis
Author-Supplied Keywords: Distance-based clustering, intrusion detection, Distance-based clustering
k-nearest-neighbor method, intrusion detection
Abstract: Signature-based intrusion detection systems look for known, suspicious patterns
in the input data. In this paper we explore compression of labeled empirical data using
threshold-based clustering with regularization. The main target of clustering is to compress
training dataset to the limited number of signatures, and to minimize the number of comparisons
that are necessary to determine the status of the input event as a result. Essentially, the
process of clustering includes merging of the clusters which are close enough. As a
consequence, we will reduce original dataset to the limited number of labeled centroids. In a
complex with k-nearest-neighbor (kNN) method, this set of centroids may be used as a
multi-class classifier. Clearly, different attributes have different importance depending on
the particular training database and given cost matrix. This importance may be regulated in the
definition of the distance using linear weight coefficients. The paper introduces special
procedure to estimate above weight coefficients. The experiments on the KDD-99 intrusion
detection dataset have confirmed the effectiveness of the proposed methods.
Author Affiliations: 1Computer Sciences Laboratory, College of Engineering and Computer
Science, Australian National University, Canberra, ACT 0200,
2. Интегрированный алгоритм для анализа изображений и классификации процесса деления ядер для определения клеточных циклов с высоким содержанием.
INTEGRATED ALGORITHMS FOR IMAGE ANALYSIS AND CLASSIFICATION OF NUCLEAR DIVISION FOR HIGH-CONTENT CELL-CYCLE : PHAM, TUAN D.; TRAN, DAT T.; ZHOU, XIAOBO; WONG, STEPHEN T. C., p21-43, 23p, 1 chart, 2 graphs
Ключевые слова: ALGORITHMS, CELL division, FLUORESCENT probes, IMAGING systems, KARYOKINESIS, IMAGE analysis
Author-Supplied Keywords: Microscopic imaging, nuclear division, pattern classification, probability, fuzzy algorithm, computational methods
Abstract: Advances in fluorescent probing and microscopic imaging technology provide
important tools for biomedical research in studying the structures and functions of cells and
molecules. Such studies require the processing and analysis of huge amounts of image data, and
manual image analysis is very time consuming, thus costly, and also potentially inaccurate and
poor reproducibility. In this paper, we present and combine several advanced computational,
probabilistic, and fuzzy-set methods for the computerized classification of cell nuclei in
different mitotic phases. We tested our proposed methods with real image sequences recorded
over a period of twenty-four hours at every fifteen minutes with a time-lapse fluorescence
microscopy. The experimental results have shown that the proposed methods are effective for the
task of classification.
Author Affiliations: 1Bioinformatics Applications Research Centre, School of Information
Technology, James Cook University, Townsville, QLD 4811,
2School of Information Sciences and Engineering, University of Canberra, ACT 2601,
3HCNR Center for Bioinformatics, Harvard Medical School, MA 02215,
3. Применение сверточных нейронных сетей для распознавания цифр, написанных «от руки».
APPLICATION OF SICoNNETS TO HANDWRITTEN DIGIT : TIVIVE, FOK HING CHI; BOUZERDOUM, ABDESSELAM, p45-59, 15p, 4 charts, 4 graphs
Ключевые слова: ALGORITHMS, ARTIFICIAL intelligence, COMPUTER architecture, GRAPHOLOGY, MACHINE translating, COMPUTER programming
Author-Supplied Keywords: Convolutional neural networks, shunting inhibitory neurons, handwritten digit recognition, systematic connection schemes
Abstract: In this paper, we apply a new neural network model, namely shunting inhibitory
convolutional neural networks, or SICoNNets for short, to the problem of handwritten digit
recognition. This type of networks has a generic and flexible architecture, where the
processing is based on the physiologically plausible mechanism of shunting inhibition. A hybrid
first-order training method, called QRProp, is developed based on the three training algorithms
Rprop, Quickprop, and SuperSAB. The MNIST database is used to train and evaluate the
performance of SICoNNets in handwritten digit recognition. A network with 24 feature maps and
2722 free parameters achieves a recognition accuracy of 97.3%.
Author Affiliations: 1School of Electrical, Computer and Telecommunications Engineering,
University of Wollongong, Northfields Avenue, Wollongong, NSW 2522,
4. Нейронная классификация массовых отклонений с различными характеристиками в цифровой маммографии.
NEURAL CLASSIFICATION OF MASS ABNORMALITIES WITH DIFFERENT TYPES OF FEATURES IN DIGITAL : PANCHAL, R.; VERMA, B., p61-75, 15p, 8 charts, 4 graphs
Ключевые слова: BREAST -- Cancer, BREAST -- Diseases, DIAGNOSIS, BREAST -- Radiography, CANCER -- Diagnosis, NEURAL analyzers, WOMEN -- Health & hygiene
Author-Supplied Keywords: classifiers, feature extraction, digital mammography, breast cancer diagnosis, neural networks, classifiers, feature extraction, digital mammography, breast cancer diagnosis
Abstract: Early detection of breast abnormalities remains the primary prevention against
breast cancer despite the advances in breast cancer diagnosis and treatment. Presence of mass
in breast tissues is highly indicative of breast cancer. The research work presented in this
paper investigates the significance of different types of features using proposed neural
network based classification technique to classify mass type of breast abnormalities in digital
mammograms into malignant and benign. 14 gray level based features, four BI-RADS features,
patient age feature and subtlety value feature have been explored using the proposed research
methodology to attain maximum classification on test dataset. The proposed research technique
attained a 91% testing classification rate with a 100% training classification rate on digital
mammograms taken from the DDSM benchmark database.
Author Affiliations: 1School of Information Technology, Central Queensland University,
Rockhampton, QLD 4702,
5. Подход, основанный на обобщенном (дженерик) программировании для многокритериальной классификации моделей, предназначенный для использования в сетях охранной сигнализации.
GENETIC PROGRAMMING APPROACH FOR MULTI-CATEGORY PATTERN CLASSIFICATION APPLIED TO NETWORK INTRUSIONS : FARAOUN, K. M.; BOUKELIF, A., p77-99, 23p, 13 charts, 10 graphs
Ключевые слова: CLASSIFICATION, DATA transmission systems, GENETIC algorithms, INFORMATION science, COMPUTER programming, GENETIC programming (Computer science)
Author-Supplied Keywords: Genetic programming, patterns classification, intrusion detection
Abstract: The present paper describes a new approach of classification using genetic
programming. The proposed technique consists of genetically co-evolve a population of nonlinear
transformations on the input data to be classified, and map them to a new space with reduced
dimension in order to get a maximum inter-classes discrimination. It is much easier to classify
the new samples from the transformed data. Contrary to the existing GP-classification
techniques, the proposed one uses a dynamic repartition of the transformed data in separated
intervals, the efficiency of a given intervals repartition is handled by the fitness criterion,
with a maximum classes discrimination. Experiments were performed using the Fisher's Iris
dataset. After that, the KDD'99 Cup dataset was used to study the intrusion detection and
classification problem. The results demonstrate that the proposed genetic approach outperforms
the existing GP-classification methods, and provides improved results compared to other
existing techniques.
Author Affiliations: 1Evolutionary Engineering and Distributed Information Systems
Laboratory, EEDIS, Djillali Liabès University, Sidi Bel Abbès,
2Communication Networks, Architectures and Multimedia Laboratory, Départment d'électronique,
Djillali Liabès University, University of S. B.A.,
6. Сравнение двух подходов к визуальному распознаванию речи – выделения содержательных признаков образа и преобразования образа.
APPEARANCE FEATURE EXTRACTION VERSUS IMAGE TRANSFORM-BASED APPROACH FOR VISUAL SPEECH : SAGHEER, ALAA; TSURUTA, NAOYUKI; TANIGUCHI, RIN-ICHIRO; MAEDA, SAKASHI. , p101-122, 22p, 6 charts, 6 graphs
Ключевые слова: LIPREADING, SPEECH -- Study & teaching, SPEECH perception, SPEECH processing systems, VERBAL ability, VERBAL behavior
Author-Supplied Keywords: Visual speech recognition, feature extraction, self organizing map, hyper column model, discrete cosine transform
Abstract: In this paper we propose a new appearance based system which consists of two
stages: visual speech feature extraction and classification, followed by recognition of the
extracted feature, thereby the result is a complete lip-reading system. This lip-reading system
employs our Hyper Column Model (HCM) approach to extract and classify the visual features and
uses the Hidden Markov Model (HMM) for recognition. This paper addresses mainly the first
stage; i. e. feature extraction and classification. We investigate the HCM performance to
achieve feature extraction and classification and then compare the performance when replacing
HCM with Fast Discrete Cosine Transform (FDCT). Unlike FDCT, HCM could extract the entire
features without any loss. Also the experiments have shown that HCM is generally better than
FDCT and provides a good distribution of the phonemes in the feature space for recognition
purposes. For fair comparison, two databases are exploited with three different sets of
resolution for each database. One of these two databases is designed to include shifted and
scaled objects. Experiments reveal that HCM is capable of recovering and dealing with such
image restrictions whereas the effectiveness of FDCT drops drastically especially for new
subjects.
Author Affiliations: 1Department of Intelligent Systems, Kyushu University, 6-1,
Kasuga-Koen, Kasuga, Fukuoka ,
2Department of Electronics Engineering and Computer Science, Fukuoka University, 8-9-1,
Nanakuma, Jonan-ku, Fukuoka ,
7. Функциональная декомпозиция – значимость и внедрение в нейросети и проектирование цифровых устройств.
FUNCTIONAL DECOMPOSITION — THE VALUE AND IMPLICATION FOR BOTH NEURAL NETWORKS AND DIGITAL : SELVARAJ, HENRY; SAPIECHA, PIOTR; RAWSKI, MARIUSZ; ŁUBA, TADEUSZ. , p123-138, 16p, 4 charts, 6 graphs
Ключевые слова: ALGEBRA, Boolean, ARTIFICIAL intelligence, NEURAL circuitry, NEURAL networks (Computer science), PROGRAMMING (Mathematics), SYSTEM analysis
Author-Supplied Keywords: Logic synthesis, functional decomposition, FPGA, neural network, digital design, multiple-valued function
Abstract: General functional decomposition is mainly perceived as a logic synthesis
method for implementing Boolean functions into FPGA-based architectures. However it also has
important applications in many other fields of modern engineering and science. In this paper,
advantages of functional decomposition are demonstrated on "real life" examples. Application of
decomposition-based methods in other fields of modern engineering is presented. In the case of
decision tables, application of decomposition methods leads to significant benefits in the
analysis process of data dependencies, especially in cases when the input decision tables are
unmanageably large. Experimental results demonstrate that it can help implementing sequential
machines using flip-flops or ROM memory. It also can be efficiently used as multilevel logic
synthesis method for VLSI technology.
Author Affiliations: 1Department of Electrical and Computer Engineering, University of
Nevada, Las Vegas, NV,
2Warsaw University of Technology, Institute of Telecommunications, 00-665 Warsaw,
8. Календарь событий – информация о международных мероприятиях: «Методы оптимизации колонии муравьёв и интеллект роя», (4-7 сентября 2006, Брюссель, 5-й международный семинар), «Мягкие методы теории вероятности и математической статистики» (3-й международная конференция, Бристоль, Великобритания, 5-7 сентября), «Доказательства, основанные на прецедентах, и контекстная осведомленность» (международный семинар, Фетие, Турция, 5 сентября).
CALENDAR OF : Thimm, Georg, p139-147, 9p
Ключевые слова: CASE-based reasoning, CONGRESSES & conventions, INSECTS -- Behavior, WORKSHOPS, SWARM intelligence
Abstract: The article presents a calendar of events in different countries for September
2006. The "ANTS 2006 Fifth International Workshop on Ant Colony Optimization and Swarm
Intelligence" will be held on September 4-7 in Brussels, Belgium. The "SMPS 2006 The Third
International Conference on Soft Methods in Probability and Statistics" will be held in
Bristol, England on September 5-7. Fethiye, Turkey will be hosting the "ECCBR 2006
International Workshop on Case-based Reasoning and Context Awareness" on September 5.
Международный журнал вычислительной математики, май 2006. Том 83, вып. 5/6
International Journal of Computer Mathematics, May2006, Vol. 83 Issue 5/6
ISSN:
Publisher Information: Taylor & Francis Ltd
4 Park Square
Milton Park
Abingdon
Oxfordshire OX14 4RN
United Kingdom
http://www. tandf. co. uk/journals/titles/.html
СТАТЬИ
1. Концентрированный метод Галеркина для численного решения модифицированного волнового уравнения с равной шириной с использование квадратичных В – сплайнов.
A lumped Galerkin method for the numerical solution of the modified equal-width wave
equation using quadratic : Esen, A., p449-459, 11p, 3 charts, 3 graphs
Ключевые слова: GALERKIN methods, MATHEMATICAL analysis, NUMERICAL analysis, SPLINES, WAVE equation, WAVE-motion, Theory of
Author-Supplied Keywords: MEW equation, Splines, Solitary waves
Abstract: The numerical solution of the one-dimensional modified equal width wave (MEW)
equation is obtained by using a lumped Galerkin method based on quadratic B-spline finite
elements. The motion of a single solitary wave and the interaction of two solitary waves are
studied. The numerical results obtained show that the present method is a remarkably successful
numerical technique for solving the MEW equation. A linear stability analysis of the scheme is
also investigated.
Author Affiliations: 1Department of Mathematics, Faculty of Arts and Science, Inönü
University, 44280 Malatya, Turkey
2. Закрытая форма оценки определённых интегралов и связанных бесконечных рядов с привлечением зета-функции Римана.
Closed-form evaluations of definite integrals and associated infinite series involving
the Riemann zeta : Young Joon Cho; Myungho Jung; Junesang Choi; H. M. Srivastava. , p461-472, 12p
Ключевые слова: CAUCHY integrals, FUNCTIONS, Zeta, GAMMA functions, HYPERGEOMETRIC functions, INTEGRALS, TRANSCENDENTAL functions
Author-Supplied Keywords: Gamma functions, Multiple gamma functions, Cauchy residue theorem, Hurwitz–Lerch zeta function, Generalized zeta function, Gamma functions, Multiple gamma functions, Cauchy residue theorem, Hurwitz—Lerch zeta function, Generalized zeta function
Abstract: A class of definite integrals are evaluated using the Cauchy residue theorem.
These evaluations are then used to obtain closed-form expressions for several infinite series
associated with the Riemann zeta function. A number of interesting (known or new) special cases
and consequences of the main results are also considered.
Author Affiliations: 1Pusan National University, Pusan , Republic of Korea
2Department of Mathematics, Dongguk University, Kyongju 780-714, Republic of Korea
3Department of Mathematics and Statistics, University of Victoria, Victoria, British Columbia
V8W 3P4, Canada
3. Конечные условия для интерполяционных сплайнов шестого порядка.
End conditions for interpolatory sextic splines†. By: Siddiqi, Shahid S.; Akram,
Ghazala. p473-485, 13p, 2 charts
Ключевые слова: BOUNDARY value problems, CONVERGENCE, DIFFERENTIAL equations, INTERPOLATION, NUMERICAL analysis, SPLINE theory
Author-Supplied Keywords: Sextic spline, End conditions
Abstract: In this paper a sextic spline is defined for interpolation at equally spaced
knots along with the end conditions required to complete the definition of the spline. These
conditions are in terms of given functional values at the knots and lead to uniform convergence
of O(h7) throughout the interval of interpolation. The main objective of defining the end
conditions for the sextic spline is to use the sextic spline not only for interpolation
purposes, but also for the solution of the fifth-order boundary value problem, with the change
consistent with the boundary value problem.†Dedicated to the memory of Dr. M. Rafique.
Author Affiliations: 1Department of Mathematics, Punjab University, Lahore, 54590, Pakistan
4. Альтернативная схема для системы геодинамо.
An iterative scheme for a geodynamo : Ting Cheng. p487-502, 16p
Ключевые слова: CONVERGENCE, INDUCTION (Mathematics), ITERATIVE methods (Mathematics), MAGNETIC fields, NAVIER-Stokes equations, NUMERICAL analysis
Author-Supplied Keywords: Iterative scheme, Geodynamo model, Convergence
Abstract: In this paper we propose an iterative scheme for a nonlinear spherical
geodynamo model and carry out convergence analysis of this scheme. Our model is a coupled
system of fluid velocity u, total kinematic pressure P and magnetic field B. They are governed
by the Navier–Stokes equations and the dynamo equations. Using the mathematical induction
method and energy estimates, it is concluded that our iterative scheme converges in the L∞(0,
T; H1) sense and in the L2(0, T; H2) sense.
Author Affiliations: 1Department of Mathematics, Huazhong Normal University, Wuhan
PR China
5. Доказательство гладкости 6-точечной интерполяционной схемы.
A proof of the smoothness of the 6-point interpolatory : Siddiqi, Shahid S.;
Ahmad, Nadeem. p503-509, 7p
Ключевые слова: CONVERGENCE, INTERPOLATION, NUMERICAL analysis, POLYGONS, POLYNOMIALS, RECURSIVE functions
Author-Supplied Keywords: Interpolatory subdivision scheme, Mask, Convergence and smoothnes, Laurent polynomial
Abstract: In this paper the Laurent polynomial method is used to show that the smoothness
of the 6-point Weissman interpolatory subdivision scheme is C2.
Author Affiliations: 1Department of Mathematics, Punjab University, Lahore, 54590, Pakistan
6. Статистический подход к экономизации полиноминальной функции.
A statistical approach for economization of the polynomial : Masjed-Jamei,
M.; Eslahchi, M. R.; Dehghan, Mehdi. p511-523, 13p, 6 charts, 8 graphs
Ключевые слова: APPROXIMATION theory, CHEBYSHEV approximation, NUMERICAL analysis, POLYNOMIALS, PROBABILITIES, STATISTICS
Author-Supplied Keywords: Polynomial function economization, First and second kind Chebyshev polynomials, Probability value
Abstract: Due to having the minimax property, Chebyshev polynomials are used today to
economize the arbitrary polynomial functions. In this work, we present a statistical approach
to show that, contrary to current thought, the Chebyshev polynomials of the first kind are not
appropriate for economizing these polynomials if one uses this statistical approach. In this
way, a numerical results section is also given to clearly prove our claim.
Author Affiliations: 1Department of Mathematics, K. N. Toosi University of Technology, Sayed
Khandan, Jolfa Avenue, Tehran, Iran
2Department of Applied Mathematics, Faculty of Mathematics and Computer Science, Amirkabir
University of Technology, No. 424 Hafez Avenue, Tehran, Iran
