Windows XP Research Articles

ART: A Data Aggregation Program for the Behavioral Sciences

Today, many experiments in the field of behavioral sciences are conducted using a computer. While there is a broad choice of computer programs facilitating the process of conducting experiments as well as programs for statistical analysis there are relatively few programs facilitating the intermediate step of data aggregation. ART has been developed in order to fill this gap and to provide a computer program for data aggregation that has a graphical user interface such that aggregation can be done more easily and without any programming. All “rules” that are necessary to extract variables can be seen “at a glance” which helps the user to conduct even complex aggregations with several hundreds of variables and makes aggregation more resistant against errors. ART runs with Windows XP, Vista, 7, and 8 and it is free. Copies (executable and source code) are available at http://www.psychologie.hhu.de/arbeitsgruppen/allgemeinepsychologie-und-arbeitspsychologie/art.html.

Study on the Platform of Visual Producing Technology of Greenhouse by Solar Heat in Winter Based on Information Flow Model

The promoting platform of visual producing technology of greenhouse by solar heat in winter uses Windows XP as the operating system platform, IIS as the web server software, C# as the programming language of ASP.NET programs and SQL Server 2005 database technology to implement that the latest research and technology of greenhouse vegetable production by solar heat can be released and promoted in time. The system could solve the conflict that technicians cannot guide users in time and provide users with the service of producing technology instantly.

An improved approach for accurate and efficient measurement of common carotid artery intima-media thickness in ultrasound images.

The intima-media thickness (IMT) of common carotid artery (CCA) can serve as an important indicator for the assessment of cardiovascular diseases (CVDs). In this paper an improved approach for automatic IMT measurement with low complexity and high accuracy is presented. 100 ultrasound images from 100 patients were tested with the proposed approach. The ground truth (GT) of the IMT was manually measured for six times and averaged, while the automatic segmented (AS) IMT was computed by the algorithm proposed in this paper. The mean difference ± standard deviation between AS and GT IMT is 0.0231 ± 0.0348 mm, and the correlation coefficient between them is 0.9629. The computational time is 0.3223 s per image with MATLAB under Windows XP on an Intel Core 2 Duo CPU E7500 @2.93 GHz. The proposed algorithm has the potential to achieve real-time measurement under Visual Studio.

Detecting malicious files using non-signature-based methods

Malware or malicious code intends to harm the computer systems without the knowledge of system users. Malware are unknowingly installed by naive users while browsing the internet. Once installed, the malicious programs perform unintentional activities like: a) steal user name, password; b) install spy software to provide remote access to the attackers; c) flood spam messages; d) perform denial of service attacks, etc. With the emergence of metamorphic malware (that uses complex obfuscation techniques), signature-based detectors fail to identify new variants of malware. In this paper, we investigate non-signature techniques for malware detection and demonstrate methods of feature selection that are best suited for detection purposes. Features are produced using mnemonic n-grams and instruction opcodes (opcodes along with addressing modes). The redundant features are eliminated using class-wise document frequency, scatter criterion and principal component analysis (PCA). The experiments are conducted on the malware dataset collected from VX Heavens and benign executables (gathered from fresh installation of Windows XP operating system and other utility software's). The experiments also demonstrate that proposed methods that do not require signatures are effective in identifying and classifying morphed malware.

Strategic Planning Based on Consumers’ Decision Making Process towards Mobile Telecommunications Operators

The current research is based on the analysis of the factors that influence the buying decision, as they are described by Dubois & Jolibert, 1994, Boier, 1994, applied on the mobile telecommunications operators’ clients. These factors can be grouped in several categories such as: economic factors, social factors, cultural factors, psychological factors. The questionnaire based survey was made during March- April 2013 on a sample of 165 mobile telecommunications clients, with an error of 5%. Statistical methods used to interpret the gathered data were: descriptive statistics, t test, factor analysis. Hypotheses were created based on the results of the study, while the software used to obtain the results was SPSS, version 16.0 for Windows XP. This analysis comes up with solutions for further strategic planning of the operators based on the decision process of their consumers and the main elements that influence it.

Controlling for Cybersecurity Risks of Medical Device Software

While computer-related failures are known to play a significant role in deaths and injuries involving medical devices reported to the U.S. Food and Drug Administration (FDA), there is no similar reporting system that meaningfully captures security-related failures in medical devices. Medical device software must satisfy system properties, including safety, security, reliability, resilience, and robustness, among others. This column focuses on the challenges to satisfying a security property for medical devices: postmarket surveillance, integrity and availability, and regulation and standards. Medical devices depend on software for patient care ranging from radiation therapy planning to pharmaceutical compounding to automated diagnosis of disease with mobile medical apps. Meanwhile, the medical community has observed an uptick in reported security vulnerabilities in medical device software—raising doubts of cybersecurity preparedness. It should come as little surprise that security risks in medical devices “could lead to patient harm” as recently explained by the chief scientist at the FDA Center for Devices and Radiological Health. Device manufacturers and healthcare providers ought to more carefully and deliberately consider security hazards during the phases from design to use of medical devices. Measuring Medical Device Security: Quantitative or Qualitative? Between years 2006 and 2011, 5,294 recalls and approximately 1.2 million adverse events of medical devices were reported to the FDA’s Manufacturer and User Facility Device Experience (MAUDE) database. Almost 23% of these recalls were due to computer-related failures, of which approximately 94% presented medium to high risk of severe health consequences (such as serious injury or death) to patients. For security incidents on medical devices, no systematic national reporting system exists. Yet, individual hospitals know of hundreds of security incidents on medical devices. For instance, the FDA MAUDE does not capture adverse events such as lack of or impaired availability of function when malware infects a medical device’s operating system. FDA’s own disclaimer explains that the MAUDE database is qualitative rather than quantitative. MAUDE is incomplete with underreporting and reporting bias. Imagine the reaction of a clinician using a high-risk pregnancy monitor that begins to perform more slowly because of a Conficker infection. Would the clinician report a malware infection? Likely not. Admitting to playing a role in accidentally infecting a medical device Controlling for Cybersecurity Risks of Medical Device Software

집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법

집중형센터를 가진 역물류네트워크 평가 : 혼합형 유전알고리즘 접근법

A Maple package for improved global mapping forecast

We present a Maple implementation of the well known global approach to time series analysis and some further developments designed to improve the computational efficiency of the forecasting capabilities of the approach. This global approach can be summarized as being a reconstruction of the phase space, based on a time ordered series of data obtained from the system. After that, using the reconstructed vectors, a portion of this space is used to produce a mapping, a polynomial fitting, through a minimization procedure, that represents the system and can be employed to forecast further entries for the series. In the present implementation, we introduce a set of commands, tools, in order to perform all these tasks. For example, the command VecTS deals mainly with the reconstruction of the vector in the phase space. The command GfiTS deals with producing the minimization and the fitting. ForecasTS uses all these and produces the prediction of the next entries. For the non-standard algorithms, we here present two commands: IforecasTS and NiforecasTS that, respectively deal with the one-step and the N-step forecasting. Finally, we introduce two further tools to aid the forecasting. The commands GfiTS and AnalysTS, basically, perform an analysis of the behavior of each portion of a series regarding the settings used on the commands just mentioned above. Program summaryProgram title: TimeSCatalogue identifier: AERW_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERW_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 3001No. of bytes in distributed program, including test data, etc.: 95018Distribution format: tar.gzProgramming language: Maple 14.Computer: Any capable of running MapleOperating system: Any capable of running Maple. Tested on Windows ME, Windows XP, Windows 7.RAM: 128 MBClassification: 4.3, 4.9, 5Nature of problem:Time series analysis and improving forecast capability.Solution method:The method of solution is partially based on a result published in [1].Restrictions:If the time series that is being analyzed presents a great amount of noise or if the dynamical system behind the time series is of high dimensionality (Dim≫3), then the method may not work well.Unusual features:Our implementation can, in the cases where the dynamics behind the time series is given by a system of low dimensionality, greatly improve the forecast.Running time:This depends strongly on the command that is being used.

Development of Hovering AUV Test-bed for Underwater Explorations and Operations

This paper describes the design and control of a hovering AUV test-bed and analyzes the dynamic performance of the vehicle using simulation programs. The main purpose of this vehicle is to carry out fundamental tests of its station keeping, attitude control, and desired position tracking. Its configuration is similar to the general appearance of an ROV for underwater operations, and its dimensions are 0.75 m × 0.5 m × 0.5 m. It has four 450-W thrusters for longitudinal/lateral/vertical propulsion and is equipped with a pressure sensor for measuring the water depth and a magnetic compass for measuring its heading angle. The navigation of the vehicle is controlled by an onboard Pentium III-class computer, which runs with the help of the Windows XP operating system. This provides an appropriate environment for developing the various algorithms needed for developing and advancing a hovering AUV.

The Process of Ant Algorithm for Solving the Degree-Constrained Euclidean Steiner Minimal Tree

The degree-constrained Euclidean Steiner minimal tree problem was discussed based on the Euclidean Steiner minimal tree with each original point being added with a degree constraint. The property of the problem was analyzed and the implementation process of solving the problem by using the ant algorithm was presented.The algorithms is coded in Delphi and run on the Windows XP environment.

A novel classification model for data theft detection using advanced pattern mining

One of the challenges in data theft detection is the difficulty to classify copy operation from other type of access (non-copy) operations. Existing work in this area focuses on the stochastic model of filesystem behavior to identify emergent patterns in MAC timestamps unique to copying. Such an approach produces lot of false positives because of the fact that patterns emerging due to copying are similar to other access operations like searching a file in folder, compressing a folder, scanning a folder by antivirus software and recursive listing of directory entries from a command prompt. A novel classification model is proposed for detection of data theft by means of copy operation. Experiments were conducted by making use of advanced pattern mining algorithms such as ANFIS (Adaptive Network-based Fuzzy Inference System), ANN (Artificial Neural Networks) and C&RT (Classification & Regression Trees). All the experiments were conducted on three different operating systems i.e. Windows XP, Ubuntu and Windows 7. Henceforth the approach is validated against a simulated data theft event and analysis of the results revealed that C&RT based approach is most appropriate for data theft detection. The proposed classification model can be used by digital forensic investigators to filter out the most important artefacts and prioritize their investigation while investigating a data theft case.

PDRF: A general dispersion relation solver for magnetized multi-fluid plasma

A general dispersion-relation solver that numerically evaluates the full propagation properties of all the waves in fluid plasmas is presented. The effects of anisotropic pressure, external magnetic fields and beams, relativistic dynamics, as well as local plasma inhomogeneity are included. Program summaryProgram title: PDRFCatalogue identifier: AERF_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERF_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 436No. of bytes in distributed program, including test data, etc.: 21,670Distribution format: tar.gzProgramming language: MATLAB 7.Computer: Any computer running MATLAB 7. Tested on DELL OptiPlex 380.Operating system: Any system running MATLAB 7. Tested on Windows XP Pro.RAM: 10 MClassification: 10, 12, 15, 19.13.Nature of problem:This dispersion relation solver calculates all the solutions and gives corresponding polarizations for magnetized fluid plasma with arbitrary number of components and arbitrary orient wave vector, with and without anisotropic pressure, relativistic, beam and local inhomogeneity effects.Solution method:Solving as matrix eigenvalue problem.Restrictions:No kinetic and nonlinear effects.Unusual features:Giving all the solutions and polarizations.Running time:About 1 s on a Intel Pentium 2.60 GHz PC

A software program to investigate the nucleation kinetics of solution grown crystals using MATLAB platform

A software program has been developed on the MATLAB platform, which is useful for studying the nucleation kinetics of crystals grown from solutions. Nucleation parameters such as interfacial energy (σ), metastable zone width (ΔTmax), volume free energy (ΔGv), critical energy barrier for nucleation (ΔG∗), radius of the critical nucleus (r∗) and nucleation rate (J) of the crystals are determined from classical nucleation theory. The Metastable Zone Width (MZW) of the crystals is explored by using the relation based on solubility and enthalpy of nucleation. A new polynomial equation has been generated by this software program, and the results are checked with the experimental data of crystal growth/formation. Nucleation temperature as a function of supersaturation ratio was successfully evaluated using MZW. The equation relating to the nucleation kinetics and MZW can easily be solved with the help of a newly designed software program in the MATLAB platform. In addition, a program has been developed that highlights changes in nucleation parameters when the supersaturation ratio is changed. A plot of temperature vs energy barrier, nucleation rate and interfacial energy is also drawn. Program summaryProgram title: NucleationCatalogue identifier: AERG_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERG_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 6305No. of bytes in distributed program, including test data, etc.: 616560Distribution format: tar.gzProgramming language: MATLAB (MathWorks Inc.) version R2013a. Statistics Toolbox and Curve Fitting Toolbox requiredComputer: Any computer running MATLAB (MathWorks Inc.)Operating system: Tested on Windows XP, but generally it would work on any computer running MATLAB (MathWorks Inc.)RAM: 32 MBClassification: 8Nature of problem:In crystal growth, the knowledge of nucleation thermodynamical parameters like interfacial energy, metastable zone width (supercooling temperature), volume free energy, critical energy barrier for nucleation, radius of critical nucleus and nucleation rates is essential for the growth of good quality bulk single crystals. In these parameters, metastable zone width determination is very useful for growth. Also some curve fitting tool is needed to obtain more information about nucleation kinetics.Solution method:In this program, an attempt has been made to calculate nucleation parameters theoretically to understand the role of these nucleation thermodynamical parameters for crystallization. A linear fit is done to calculate enthalpy of solution and polynomial fitting is used to derive the saturation concentration equation. Metastable zone width was calculated by the enthalpy–supersaturation relation. Supersaturation control is a decisive parameter for optimizing growth conditions during crystallization processes. The effects of metastable zone width and nucleation rate of crystals caused by changes in different supersaturation ratios were analyzed.Running time:Interactive and instantaneous.

RFID-Based Intelligent Management System of Poultry House

This paper study on aquaculture management system of main achievement of the poultry animal breeding site data collection and background data management. The actual development environment consists of software and hardware resources to build the configuration of the two part of the work. PC hardware machine, ARM-based embedded development board set and RFID reader chip and its peripheral circuit module, PC machine with Windows XP operating system. Development board running Linux system, including transplant Boot Loader, Linux kernel cutting, making the root file system migration and application development. System realizes the intelligent management of the poultry house.

THE IMPACT OF ABUSE & OTHER ADVERSE EVENTS IN THE GENERAL NEUROLOGY CLINIC–FROM FREUD TO SAVILE?

An inherently emotive issue ‘abuse’ is variably defined in part depending upon individuals' subjective interpretation. However, it is generally believed to be significantly under–reported. It has been increasingly recognised in...

BilKristal 2.0: A tool for pattern information extraction from crystal structures

We present a revised version of the BilKristal tool of Okuyan et al. (2007). We converted the development environment into Microsoft Visual Studio 2005 in order to resolve compatibility issues. We added multi-core CPU support and improvements are made to graphics functions in order to improve performance. Discovered bugs are fixed and exporting functionality to a material visualization tool is added. New version program summaryProgram title: BilKristal 2.0.Catalogue identifier: ADYU_v2_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/ADYU_v2_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 364263No. of bytes in distributed program, including test data, etc.: 9135815Distribution format: tar.gzProgramming language: C, C++, Microsoft.NET Framework 2.0 and OpenGL Libraries.Computer: Personal computer with Windows operating system.Operating system: Windows XP or higher.Has the code been vectorized or parallelized?: Multi-core CPU support included.RAM: 20–60 Megabytes.Catalogue identifier of previous version: ADYU_v1_0Journal reference of previous version: Comput. Phys. Comm. 176 (2007) 486Classification: 8.External routines: Microsoft.NET Framework 2.0. For the visualization tool, the graphics card driver should also support OpenGL.Does the new version supercede the previous version?: YesNature of problem:Determining the crystal structure parameters of a material is a very important issue in crystallography. Knowing the crystal structure parameters helps the understanding of the physical behavior of a material. For complex structures, particularly for materials which also contain local symmetry as well as global symmetry, obtaining crystal parameters can be very hard.Solution method:The tool extracts crystal parameters such as primitive vectors and basis vectors and identifies the space group from the atomic coordinates of crystal structures.Reasons for new version:Additional features, resolved compatibility issues with the new development environments, performance optimizations, minor bug corrections.Summary of revisions:•Capability to export to MaterialVis tool [1] is added. The tool can export the unit cell information extracted from the crystal structure, the raw atomic coordinates and atomic radii into a data file (.dat) that the MaterialVis tool can process.•Compatibility issues with Microsoft Visual Studio 2005 up to 2010 are resolved. The original code was developed using Microsoft Visual Studio 2003. However, newer Visual Studio versions were not able to convert and compile the code. Due to the changes in the .NET framework, the converted project produced many errors. In this work, the project is converted into a Visual Studio 2005 project and compilation errors are resolved. We also tested the code with Visual Studio 2010 and the project was successfully converted and compiled.•Multi-Core CPU support is added. In recent years, multi-core CPUs have become very common. We added the multi-core CPU support in order to utilize the computational capabilities of additional CPU cores. This significantly improves the performance.•The visualization interface is improved. In particular, the sphere drawing functionality is replaced with an efficient and high quality version that utilizes GPU acceleration.•For some cases, the fractional coordinates of some of the calculated basis vectors were not all in the [0,1) range, but at coordinate 1.0 for some axes. These cases were corrected by translating these basis vectors into the [0,1) range.Restrictions:Assumptions are explained in [2]. However, none of them can be considered as a restriction on the complexity of the problem.Running time:The tool was able to process input files with more than a million atoms in less than 20 s on a PC with an Athlon quad-core CPU at 3.2 GHz using the default parameter values.

FracSym: Automated symbolic computation of Lie symmetries of fractional differential equations

In this paper, we present an algorithm for the systematic calculation of Lie point symmetries for fractional order differential equations (FDEs) using the method as described by Buckwar & Luchko (1998) and Gazizov, Kasatkin & Lukashchuk (2007, 2009, 2011). The method has been generalised here to allow for the determination of symmetries for FDEs with n independent variables and for systems of partial FDEs. The algorithm has been implemented in the new MAPLE package FracSym (Jefferson and Carminati 2013) which uses routines from the MAPLE symmetry packages DESOLVII (Vu, Jefferson and Carminati, 2012) and ASP (Jefferson and Carminati, 2013). We introduce FracSym by investigating the symmetries of a number of FDEs; specific forms of any arbitrary functions, which may extend the symmetry algebras, are also determined. For each of the FDEs discussed, selected invariant solutions are then presented. Program summaryProgram title: FracSymCatalogue identifier: AERA_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AERA_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 16802No. of bytes in distributed program, including test data, etc.: 165364Distribution format: tar.gzProgramming language: MAPLE internal language.Computer: PCs and workstations.Operating system: Linux, Windows XP and Windows 7.RAM: Will depend on the order and/or complexity of the differential equation or system given (typically MBs).Classification: 4.3.Nature of problem:Determination of the Lie point symmetries of fractional differential equations (FDEs).Solution method:This package utilises and extends the routines used in the MAPLE symmetry packages DESOLVII (Vu, Jefferson and Carminati [1]) and ASP (Jefferson and Carminati [2]) in order to calculate the determining equations for Lie point symmetries of FDEs. The routines in FracSym automate the method of finding symmetries for FDEs as proposed by Buckwar & Luchko [3] and Gazizov, Kasatkin & Lukashchuk in [4,5] and are the first routines to automate the symmetry method for FDEs in MAPLE. Some extensions to the basic theory have been used in FracSym which allow symmetries to be found for FDEs with n independent variables and for systems of partial FDEs (previously, symmetry methods as applied to FDEs have only been considered for scalar FDEs with two independent variables and systems of ordinary FDEs). Additional routines (some internal and some available to the user) have been included which allow for the simplification and expansion of infinite sums, identification and expression in MAPLE of fractional derivatives (of Riemann–Liouville type) and calculation of the extended symmetry operators for FDEs.Restrictions:Sufficient memory may be required for large and/or complex differential systems.Running time:Depends on the order and complexity of the differential equations given. Usually seconds.

A Coarse to Fine Minutiae-Based Latent Palmprint Matching

With the availability of live-scan palmprint technology, high resolution palmprint recognition has started to receive significant attention in forensics and law enforcement. In forensic applications, latent palmprints provide critical evidence as it is estimated that about 30 percent of the latents recovered at crime scenes are those of palms. Most of the available high-resolution palmprint matching algorithms essentially follow the minutiae-based fingerprint matching strategy. Considering the large number of minutiae (about 1,000 minutiae in a full palmprint compared to about 100 minutiae in a rolled fingerprint) and large area of foreground region in full palmprints, novel strategies need to be developed for efficient and robust latent palmprint matching. In this paper, a coarse to fine matching strategy based on minutiae clustering and minutiae match propagation is designed specifically for palmprint matching. To deal with the large number of minutiae, a local feature-based minutiae clustering algorithm is designed to cluster minutiae into several groups such that minutiae belonging to the same group have similar local characteristics. The coarse matching is then performed within each cluster to establish initial minutiae correspondences between two palmprints. Starting with each initial correspondence, a minutiae match propagation algorithm searches for mated minutiae in the full palmprint. The proposed palmprint matching algorithm has been evaluated on a latent-to-full palmprint database consisting of 446 latents and 12,489 background full prints. The matching results show a rank-1 identification accuracy of 79.4 percent, which is significantly higher than the 60.8 percent identification accuracy of a state-of-the-art latent palmprint matching algorithm on the same latent database. The average computation time of our algorithm for a single latent-to-full match is about 141 ms for genuine match and 50 ms for impostor match, on a Windows XP desktop system with 2.2-GHz CPU and 1.00-GB RAM. The computation time of our algorithm is an order of magnitude faster than a previously published state-of-the-art-algorithm.

PDEBellII: A Maple package for finding bilinear forms, bilinear Bäcklund transformations, Lax pairs and conservation laws of the KdV-type equations

Based on the Bell polynomials scheme, this paper presents a Maple computer algebra program PDEBellII which can automatically construct the bilinear forms, bilinear Bäcklund transformations, Lax pairs and conservation laws of the KdV-type soliton equations. Some examples are given to verify the validity of our program. Program summaryProgram title: PDEBellIICatalogue identifier: AEQP_v1_0Program summary URL:http://cpc.cs.qub.ac.uk/summaries/AEQP_v1_0.htmlProgram obtainable from: CPC Program Library, Queen’s University, Belfast, N. IrelandLicensing provisions: Standard CPC licence, http://cpc.cs.qub.ac.uk/licence/licence.htmlNo. of lines in distributed program, including test data, etc.: 2170No. of bytes in distributed program, including test data, etc.: 43827Distribution format: tar.gzProgramming language: Maple internal language.Computer: PCs, Dell OptiPlex 390.Operating system: Windows XP and Windows 7.RAM: Depends on the complexity of the problem (MB)Classification: 4.3, 5.Nature of problem:Determination of integrability of the nonlinear evolution equations, including bilinear forms, bilinear Bäcklund transformations, Lax pairs and conservation laws.Solution method:The package PDEBellII is developed by using the Bell polynomials which is linked with Hirota operators.Restrictions:The program can only handle single nonlinear evolution equations.Unusual features:The program PDEBellII is the first Maple automatic program to construct bilinear Bäcklund transformations, Lax pairs and the infinite conservation laws for nonlinear evolution equations.Running time:Depends strongly on the complexity of the equation. Different tasks take from 0.4 to 20 s.

Moving Icons on Windows XP Desktop Efficiently, Exactly and Eliminating Icons Bounce after Releasing

A icon can be located by its coordinates in the window by the windows coordinates system.A icon has its own coordinate system too.These two different coordinate systems must communicate properly and on time. Some important problem are discussed in the paper. They are about moving icon efficiently,exactly.Some people have noticed that moving icons on desktop under window XP is not efficient and exact. In the GUI environment,icons and pictures are frequently used and they represent many things,such as files,folders etc.In fact theses icons are associated with system resources.Controlling these resources efficiently is controlling the systems rescources efficiently in reality.This phenomenon mentioned previously is caused by some defaults in the development of Windows XP itself. Unenabling to smally move an icon on Windows XP screen efficiently and the icons bounce after releasing mouse are analyzed and studied in the paper. In VB 6.0 development environment the methods and skills of solving this problem are given, so icons dragging can be controlled efficiently and accurately. This idea is very useful and valuable generally for solving similar problems in Windows XP.