Ultrasonic treatment restores the photoelectric parameters of silicon solar cells degraded under the action of <Superscript>60</Superscript>Co gamma radiation

The photoelectric parameters of silicon solar cells degraded under the action of ⁶⁰Co gamma-radiation can be partly restored using an ultrasonic treatment (UST). The growth of the maximum output power of solar cells after the UST is related to a redistribution of the radiation defects and an increase in the homogeneity of a semiconductor crystal structure.     

Phase states of a two-dimensional non-Heisenberg ferromagnet

The effects of a biquadratic exchange and an external magnetic field on the phase states of a twodimensional non-Heisenberg ferromagnet have been studied with allowance for magnetoelastic and magnetodipolar interactions.     

Self-adjusting the intensity of assortative mating in genetic algorithms

Mate selection plays a crucial role in both natural and artificial systems. While traditional Evolutionary Algorithms (EA) usually engage in random mating strategies, that is, mating chance is independent of genotypic or phenotypic distance between individuals, in natural systems non-random mating is common, which means that somehow this mechanism has been favored during the evolutionary process. In non-random mating, the individuals mate according to their parenthood or likeness. Previous studies indicate that negative assortative mating (AM)—also known as dissortative mating—, which is a specific type of non-random mating, may improve EAs performance by maintaining the genetic diversity of the population at a higher level during the search process. In this paper we present the Variable Dissortative Mating Genetic Algorithm (VDMGA). The algorithm holds a mechanism that varies the GA’s mating restrictions during the run by means of simple rule based on the number of chromosomes created in each generation and indirectly influenced by the genetic diversity of the population. We compare VDMGA not only with traditional Genetic Algorithms (GA) but also with two preceding non-random mating EAs: the CHC algorithm and the negative Assortative Mating Genetic Algorithm (nAMGA). We intend to study the effects of the different methods in the performance of GAs and verify the reliability of the proposed algorithm when facing an heterogeneous set of landscapes. In addition, we include the positive Assortative Mating Genetic Algorithm (pAMGA) in the experiments in order test both negative and positive AM mechanisms, and try to understand if and when negative AM (or DM) speeds up the search process or enables the GAs to escape local optima traps. For these purposes, an extensive set of optimization test problems was chosen to cover a variety of search landscapes with different characteristics. Our results confirm that negative AM is effective in leading EAs out of local optima traps, and show that the proposed VDMGA is at least as efficient as nAMGA when applied to the range of our problems, being more efficient in very hard functions were traditional GAs usually fail to escape local optima. Also, scalability tests have been made that show VDMGA ability to decrease optimal population size, thus reducing the amount of evaluations needed to attain global optima. We like to stress that only two parameters need to be hand-tuned in VDMGA, thus reducing the tuning effort present in traditional GAs and nAMGA.     

Analysis of the Datagram Congestion Control Protocol’s connection management procedures using the sweep-line method

State space explosion is a key problem in the analysis of finite state systems. The sweep-line method is a state exploration method which uses a notion of progress to allow states to be deleted from memory when they are no longer required. This reduces the peak number of states that need to be stored, while still exploring the full state space. The technique shows promise but has never achieved reductions greater than about a factor of 10 in the number of states stored in memory for industrially relevant examples. This paper discusses sweep-line analysis of the connection management procedures of a new Internet standard, the Datagram Congestion Control Protocol (DCCP). As the intuitive approaches to sweep-line analysis are not effective, we introduce new variables to track progress. This creates further state explosion. However, when used with the sweep-line, the peak number of states is reduced by over two orders of magnitude compared with the original. Importantly, this allows DCCP to be analysed for larger parameter values. Somsak Vanit-Anunchai was partially supported by an Australian Research Council Discovery Grant (DP0559927) and Suranaree University of Technology. Guy Edward Gallasch was supported by an Australian Research Council Discovery Grant (DP0559927).     

Real-time measurement of pointing action by using DSP

This paper presents an approach of measuring in real-time the vector of finger that is pointing to an object. DSP is used in the operation processing unit in order to do the real-time processing. The steps include the extraction of flesh-colored regions from an image, the labeling of the flesh-colored regions, and the detection of two characteristic positions on the finger so that the direction that the finger is pointing at will be calculated. The entire process takes about 29 msec, which makes it possible to have the frame rate of 34 fps. With this frame rate, this measurement approach is considered real-time and promising to be merged into other application systems. This work was presented in part at the 13th International Symposium on Artificial Life and Robotics, Oita, Japan, January 31–February 2, 2008     

Integrating trust into the CyberCraft Initiative via the Trust Vectors model [Application Notes]

This research supports the hypothesis that the Trust Vector model can be modified to fit the CyberCraft Initiative, and that there are limits to the utility of historical data. This research proposed some modifications and expansions to the Trust Model Vector, and identified areas for future research.     

Translating a typical business process modelling language to a web services ontology through lightweight mapping

Bridging the gap between enterprise modelling methods and Semantic Web services is an important yet challenging task. For organisations with business goals, the automation of business processes as Web services is increasingly important, especially with many business transactions taking place within the Web today. Taking one approach to address this problem, a lightweight mapping between Fundamental Business Process Modelling Language (FBPML) and the Web Services Ontology (OWL-S) is outlined. The framework entails a data model translation and a process model translation via the use of ontologies and mapping principles. Several working examples of the process model translations are presented together with the implementation of an automated translator. FBPML constructs and process models that could not be translated to OWL-S equivalents highlight the differences between the languages of the two domains. It also implies that evolving Semantic Web technologies, in particular OWL-S, are not adequate for all service modelling needs and could thus benefit from the more traditional and mature BPM methods. On a more interesting note, this is effectively the first step towards enabling a semantic-based business workflow system     

QoS assessment of 3G video-phone calls by tracing watermarking exploiting the new colour space `YST?

Tracing watermarking has been recently proposed as a technique to provide a blind measure of the quality of service of the communication link, focusing on multimedia communication scenarios. 3G communication scenarios, where each customer transmits both voice and MPEG-4 video sequences in real time, have been considered. Typical video-phone call consists of close shots of speakers, framing their face in the foreground. For such particular application, a novel colour space (YST) is adopted to minimise the perceptual distortions on face coding introduced by watermarking. In the YST space, the luminance component (Y) is the same as in conventional YUV space, whereas the vectors S and T lie within the chrominance (UV) plane. The S (skin) component is a linear combination of U and V obtained as the 'average' chrominance estimated from an assorted set human faces to achieve a reasonable generalisation. The third component, T, is defined as orthogonal to the YS plane. The results show the benefits obtained in digital watermarking by the new representation against the conventional approach. In fact, the sensitivity of the YST representation outperforms the conventional one in terms of objective (mean square error, peak signal-to-noise ratio) and subjective (video-quality metrics) indicators.