Inverse Geometric Approach to the Simulation of the Circular Growth. The Case of Multicellular Tumor Spheroids

We demonstrate the power of the genetic algorithms to construct the cellular automata model simulating the growth of 2-dimensional close-to-circular clusters revealing the desired properties, such as the growth rate and, at the same time, the fractal behavior of their contours. The possible application of the approach in the field of tumor modeling is outlined

An intuitive control space for material appearance

Many different techniques for measuring material appearance have been proposed in the last few years. These have produced large public datasets, which have been used for accurate, data-driven appearance modeling. However, although these datasets have allowed us to reach an unprecedented level of realism in visual appearance, editing the captured data remains a challenge. In this paper, we present an intuitive control space for predictable editing of captured BRDF data, which allows for artistic creation of plausible novel material appearances, bypassing the difficulty of acquiring novel samples. We first synthesize novel materials, extending the existing MERL dataset up to 400 mathematically valid BRDFs. We then design a large-scale experiment, gathering 56,000 subjective ratings on the high-level perceptual attributes that best describe our extended dataset of materials. Using these ratings, we build and train networks of radial basis functions to act as functionals mapping the perceptual attributes to an underlying PCA-based representation of BRDFs. We show that our functionals are excellent predictors of the perceived attributes of appearance. Our control space enables many applications, including intuitive material editing of a wide range of visual properties, guidance for gamut mapping, analysis of the correlation between perceptual attributes, or novel appearance similarity metrics. Moreover, our methodology can be used to derive functionals applicable to classic analytic BRDF representations. We release our code and dataset publicly, in order to support and encourage further research in this direction

Pressure-dependent transition from atoms to nanoparticles in magnetron sputtering: Effect on WSi2 film roughness and stress

We report on the transition between two regimes from several-atom clusters to much larger nanoparticles in Ar magnetron sputter deposition of WSi2, and the effect of nanoparticles on the properties of amorphous thin films and multilayers. Sputter deposition of thin films is monitored by in situ x-ray scattering, including x-ray reflectivity and grazing incidence small angle x-ray scattering. The results show an abrupt transition at an Ar background pressure Pc; the transition is associated with the threshold for energetic particle thermalization, which is known to scale as the product of the Ar pressure and the working distance between the magnetron source and the substrate surface. Below Pc smooth films are produced, while above Pc roughness increases abruptly, consistent with a model in which particles aggregate in the deposition flux before reaching the growth surface. The results from WSi2 films are correlated with in situ measurement of stress in WSi2/Si multilayers, which exhibits a corresponding transition from compressive to tensile stress at Pc. The tensile stress is attributed to coalescence of nanoparticles and the elimination of nano-voids.Comment: 16 pages, 10 figures; v3: published versio

The Challenge of Non-Technical Loss Detection using Artificial Intelligence: A Survey

Detection of non-technical losses (NTL) which include electricity theft, faulty meters or billing errors has attracted increasing attention from researchers in electrical engineering and computer science. NTLs cause significant harm to the economy, as in some countries they may range up to 40% of the total electricity distributed. The predominant research direction is employing artificial intelligence to predict whether a customer causes NTL. This paper first provides an overview of how NTLs are defined and their impact on economies, which include loss of revenue and profit of electricity providers and decrease of the stability and reliability of electrical power grids. It then surveys the state-of-the-art research efforts in a up-to-date and comprehensive review of algorithms, features and data sets used. It finally identifies the key scientific and engineering challenges in NTL detection and suggests how they could be addressed in the future

Robust Temporally Coherent Laplacian Protrusion Segmentation of 3D Articulated Bodies

In motion analysis and understanding it is important to be able to fit a suitable model or structure to the temporal series of observed data, in order to describe motion patterns in a compact way, and to discriminate between them. In an unsupervised context, i.e., no prior model of the moving object(s) is available, such a structure has to be learned from the data in a bottom-up fashion. In recent times, volumetric approaches in which the motion is captured from a number of cameras and a voxel-set representation of the body is built from the camera views, have gained ground due to attractive features such as inherent view-invariance and robustness to occlusions. Automatic, unsupervised segmentation of moving bodies along entire sequences, in a temporally-coherent and robust way, has the potential to provide a means of constructing a bottom-up model of the moving body, and track motion cues that may be later exploited for motion classification. Spectral methods such as locally linear embedding (LLE) can be useful in this context, as they preserve "protrusions", i.e., high-curvature regions of the 3D volume, of articulated shapes, while improving their separation in a lower dimensional space, making them in this way easier to cluster. In this paper we therefore propose a spectral approach to unsupervised and temporally-coherent body-protrusion segmentation along time sequences. Volumetric shapes are clustered in an embedding space, clusters are propagated in time to ensure coherence, and merged or split to accommodate changes in the body's topology. Experiments on both synthetic and real sequences of dense voxel-set data are shown. This supports the ability of the proposed method to cluster body-parts consistently over time in a totally unsupervised fashion, its robustness to sampling density and shape quality, and its potential for bottom-up model constructionComment: 31 pages, 26 figure

Rough Sets Clustering and Markov model for Web Access Prediction

Discovering user access patterns from web access log is increasing the importance of information to build up adaptive web server according to the individual user’s behavior. The variety of user behaviors on accessing information also grows, which has a great impact on the network utilization. In this paper, we present a rough set clustering to cluster web transactions from web access logs and using Markov model for next access prediction. Using this approach, users can effectively mine web log records to discover and predict access patterns. We perform experiments using real web trace logs collected from www.dusit.ac.th servers. In order to improve its prediction ration, the model includes a rough sets scheme in which search similarity measure to compute the similarity between two sequences using upper approximation

Rational bidding using reinforcement learning: an application in automated resource allocation

The application of autonomous agents by the provisioning and usage of computational resources is an attractive research field. Various methods and technologies in the area of artificial intelligence, statistics and economics are playing together to achieve i) autonomic resource provisioning and usage of computational resources, to invent ii) competitive bidding strategies for widely used market mechanisms and to iii) incentivize consumers and providers to use such market-based systems. The contributions of the paper are threefold. First, we present a framework for supporting consumers and providers in technical and economic preference elicitation and the generation of bids. Secondly, we introduce a consumer-side reinforcement learning bidding strategy which enables rational behavior by the generation and selection of bids. Thirdly, we evaluate and compare this bidding strategy against a truth-telling bidding strategy for two kinds of market mechanisms – one centralized and one decentralized

Q-Strategy: A Bidding Strategy for Market-Based Allocation of Grid Services

The application of autonomous agents by the provisioning and usage of computational services is an attractive research field. Various methods and technologies in the area of artificial intelligence, statistics and economics are playing together to achieve i) autonomic service provisioning and usage of Grid services, to invent ii) competitive bidding strategies for widely used market mechanisms and to iii) incentivize consumers and providers to use such market-based systems. The contributions of the paper are threefold. First, we present a bidding agent framework for implementing artificial bidding agents, supporting consumers and providers in technical and economic preference elicitation as well as automated bid generation by the requesting and provisioning of Grid services. Secondly, we introduce a novel consumer-side bidding strategy, which enables a goal-oriented and strategic behavior by the generation and submission of consumer service requests and selection of provider offers. Thirdly, we evaluate and compare the Q-strategy, implemented within the presented framework, against the Truth-Telling bidding strategy in three mechanisms – a centralized CDA, a decentralized on-line machine scheduling and a FIFO-scheduling mechanisms

Allelomimesis as universal clustering mechanism for complex adaptive systems

Animal and human clusters are complex adaptive systems and many are organized in cluster sizes $s$ that obey the frequency-distribution $D(s)\propto s^{-\tau}$. Exponent $\tau$ describes the relative abundance of the cluster sizes in a given system. Data analyses have revealed that real-world clusters exhibit a broad spectrum of $\tau$-values, $0.7\textrm{(tuna fish schools)}\leq\tau\leq 2.95\textrm{(galaxies)}$. We show that allelomimesis is a fundamental mechanism for adaptation that accurately explains why a broad spectrum of $\tau$-values is observed in animate, human and inanimate cluster systems. Previous mathematical models could not account for the phenomenon. They are hampered by details and apply only to specific systems such as cities, business firms or gene family sizes. Allelomimesis is the tendency of an individual to imitate the actions of its neighbors and two cluster systems yield different $\tau$ values if their component agents display different allelomimetic tendencies. We demonstrate that allelomimetic adaptation are of three general types: blind copying, information-use copying, and non-copying. Allelomimetic adaptation also points to the existence of a stable cluster size consisting of three interacting individuals.Comment: 8 pages, 5 figures, 2 table