Habitat use and population dynamics of brown bears (Ursus arctos) in Scandinavia

Large carnivore populations are currently recovering from past extirpation efforts and expanding back into their original habitats. At the same time human activities have resulted in very few wilderness areas left with suitable habitats and size large enough to maintain populations of large carnivores without human contact. Consequently the long-term future of large carnivores depends on their successful integration into landscapes where humans live. Thus, understanding their behaviour and interaction with surrounding habitats is of utmost importance in the development of management strategies for large carnivores. This applies also to brown bears (Ursus arctos) that were almost exterminated from Scandinavia and Finland at the turn of the century, but are now expanding their range with the current population estimates being approximately 2600 bears in Scandinavia and 840 in Finland. This thesis focuses on the large-scale habitat use and population dynamics of brown bears in Scandinavia with the objective to develop modelling approaches that support the management of bear populations. Habitat analysis shows that bear home ranges occur mainly in forested areas with a low level of human influence relative to surrounding areas. Habitat modelling based on these findings allows identification and quantification of the potentially suitable areas for bears in Scandinavia. Additionally, this thesis presents novel improvements to home range estimation that enable realistic estimates of the effective area required for the bears to establish a home range. This is achieved through fitting to the radio-tracking data to establish the amount of temporal autocorrelation and the proportion of time spent in different habitat types. Together these form a basis for the landscape-level management of the expanding population. Successful management of bears requires also assessment of the consequences of harvest on the population viability. An individual-based simulation model, accounting for the sexually selected infanticide, was used to investigate the possibility of increasing the harvest using different hunting strategies, such as trophy harvest of males. The results indicated that the population can sustain twice the current harvest rate. However, harvest should be changed gradually while carefully monitoring the population growth as some effects of increased harvest may manifest themselves only after a time-delay. The results and methodological improvements in this thesis can be applied to the Finnish bear population and to other large carnivores. They provide grounds for the further development of spatially-realistic management-oriented models of brow bear dynamics that can make projections of the future distribution of bears while accounting for the development of human activities.

R1SVM: A randomised nonlinear approach to large-scale anomaly detection

The problem of unsupervised anomaly detection arises in a wide variety of practical applications. While one-class support vector machines have demonstrated their effectiveness as an anomaly detection technique, their ability to model large datasets is limited due to their memory and time complexity for training. To address this issue for supervised learning of kernel machines, there has been growing interest in random projection methods as an alternative to the computationally expensive problems of kernel matrix construction and sup-port vector optimisation. In this paper we leverage the theory of nonlinear random projections and propose the Randomised One-class SVM (R1SVM), which is an efficient and scalable anomaly detection technique that can be trained on large-scale datasets. Our empirical analysis on several real-life and synthetic datasets shows that our randomised 1SVM algorithm achieves comparable or better accuracy to deep auto encoder and traditional kernelised approaches for anomaly detection, while being approximately 100 times faster in training and testing.

R1STM: One-class support tensor machine with randomised kernel

Identifying unusual or anomalous patterns in an underlying dataset is an important but challenging task in many applications. The focus of the unsupervised anomaly detection literature has mostly been on vectorised data. However, many applications are more naturally described using higher-order tensor representations. Approaches that vectorise tensorial data can destroy the structural information encoded in the high-dimensional space, and lead to the problem of the curse of dimensionality. In this paper we present the first unsupervised tensorial anomaly detection method, along with a randomised version of our method. Our anomaly detection method, the One-class Support Tensor Machine (1STM), is a generalisation of conventional one-class Support Vector Machines to higher-order spaces. 1STM preserves the multiway structure of tensor data, while achieving significant improvement in accuracy and efficiency over conventional vectorised methods. We then leverage the theory of nonlinear random projections to propose the Randomised 1STM (R1STM). Our empirical analysis on several real and synthetic datasets shows that our R1STM algorithm delivers comparable or better accuracy to a state-of-the-art deep learning method and traditional kernelised approaches for anomaly detection, while being approximately 100 times faster in training and testing.

Cellular and molecular regulation of mammalian blastocyst hatching

In mammals including humans, failure in blastocyst hatching and implantation leads to early embryonic loss and infertility. Prior to implantation, the blastocyst must hatch out of its acellular glycoprotein coat, the zona pellucida (ZP). The phenomenon of blastocyst hatching is believed to be regulated by (i) dynamic cellular components such as actin-based trophectodermal projections (TEPs), and (ii) a variety of autocrine and paracrine molecules such as growth factors, cytokines and proteases. The spatio-temporal regulation of zona lysis by blastocyst-derived cellular and molecular signaling factors is being keenly investigated. Our studies show that hamster blastocyst hatching is acelerated by growth factors such as heparin binding-epidermal growth factor and leukemia inhibitory factor and that embryo-derived, cysteine proteases including cathepsins are responsible for blastocyst hatching. Additionally, we believe that cyclooxygenase-generated prostaglandins, estradiol-17 beta mediated estrogen receptor-alpha signaling and possibly NF kappa B could be involved in peri-hatching development. Moreover, we show that TEPs are intimately involved with lysing ZP and that the TEPs potentially enrich and harbor hatching-enabling factors. These observations provide new insights into our understanding of the key cellular and molecular regulators involved in the phenomenon of mammalian blastocyst hatching, which is essential for the establishment of early pregnancy.

High Resolution Surface Imaging Using a Carbon Nanotube Array with Pointed Height distribution

In this paper we discuss a new technique to image the surfaces of metallic substrates using field emission from a pointed array of carbon nanotubes (CNTs). We consider a pointed height distribution of the CNT array under a diode configuration with two side gates maintained at a negative potential to obtain a highly intense beam of electrons localized at the center of the array. The CNT array on a metallic substrate is considered as the cathode and the test substrate as the anode. Scanning the test Substrate with the cathode reveals that the field emission current is highly sensitive to the surface features with nanometer resolution. Surface features of semi-circular, triangular and rectangular geometries (projections and grooves) are considered for simulation. This surface scanning/mapping technique can be applied for surface roughness measurements with nanoscale accuracy. micro/nano damage detection, high precision displacement sensors, vibrometers and accelerometers. among other applications.

High-Rate Space-Time Coded Large-MIMO Systems: Low-Complexity Detection and Channel Estimation

In this paper, we present a low-complexity algorithm for detection in high-rate, non-orthogonal space-time block coded (STBC) large-multiple-input multiple-output (MIMO) systems that achieve high spectral efficiencies of the order of tens of bps/Hz. We also present a training-based iterative detection/channel estimation scheme for such large STBC MIMO systems. Our simulation results show that excellent bit error rate and nearness-to-capacity performance are achieved by the proposed multistage likelihood ascent search (M-LAS) detector in conjunction with the proposed iterative detection/channel estimation scheme at low complexities. The fact that we could show such good results for large STBCs like 16 X 16 and 32 X 32 STBCs from Cyclic Division Algebras (CDA) operating at spectral efficiencies in excess of 20 bps/Hz (even after accounting for the overheads meant for pilot based training for channel estimation and turbo coding) establishes the effectiveness of the proposed detector and channel estimator. We decode perfect codes of large dimensions using the proposed detector. With the feasibility of such a low-complexity detection/channel estimation scheme, large-MIMO systems with tens of antennas operating at several tens of bps/Hz spectral efficiencies can become practical, enabling interesting high data rate wireless applications.

Influence of tool rake angle on the quality of pure magnesium chip-consolidated product

Chips were produced by orthogonal Cutting of cast pure magnesium billet with three different tool rake angles viz., -15 degrees, -5 degrees and +15 degrees on a lathe. Chip consolidation by solid state recycling technique involved cold compaction followed by hot extrusion. The extruded products were characterized for microstructure and mechanical properties. Chip-consolidated products from -15 degrees rake angle tools showed 19% increase in tensile strength, 60% reduction ingrain size and 12% increase in hardness compared to +15 degrees rake chip-consolidated product indicating better chip bonding and grain refinement. Microstructure of the fracture specimen Supports the abovefinding. On the overall, the present work high lights the importance of tool take angle in determining the quality of the chip-consolidated products. (C) 2009 Elsevier B.V. All rights reserved.

A Combinatorial Optimization Problem for High Order PODs with Few Sensors

Experimental characterization of high dimensional dynamic systems sometimes uses the proper orthogonal decomposition (POD). If there are many measurement locations and relatively fewer sensors, then steady-state behavior can still be studied by sequentially taking several sets of simultaneous measurements. The number required of such sets of measurements can be minimized if we solve a combinatorial optimization problem. We aim to bring this problem to the attention of engineering audiences, summarize some known mathematical results about this problem, and present a heuristic (suboptimal) calculation that gives reasonable, if not stellar, results.

Distributed space-time codes for cooperative networks with partial CSI

Design criteria and full-diversity Distributed Space Time Codes (DSTCs) for the two phase transmission based cooperative diversity protocol of Jing-Hassibi and the Generalized Nonorthogonal Amplify and Forward (GNAF) protocol are reported, when the relay nodes are assumed to have knowledge of the phase component of the source to relay channel gains. It is shown that this under this partial channel state information (CSI), several well known space time codes for the colocated MIMO (Multiple Input Multiple Output) channel become amenable for use as DSTCs. In particular, the well known complex orthogonal designs, generalized coordinate interleaved orthogonal designs (GCIODs) and unitary weight single symbol decodable (UW-SSD) codes are shown to satisfy the required design constraints for DSTCs. Exploiting the relaxed code design constraints, we propose DSTCs obtained from Clifford Algebras which have low ML decoding complexity.

Towards an analysis framework of technology habituation by older users

Smart everyday objects could support the wellbeing, independent living and social connectedness of ageing people, but their successful adoption depends upon them fitting with their skills, values and goals. Many technologies fail in this respect. Our work is aimed at designs that engage older people by building on their individual affective attachment to habituated objects and leveraging, from a participatory design perspective, the creative process through which people continuously adapt their homes and tools to their own lifestyle. We contribute a novel analytic framework based on an analysis of related research on appropriation and habituated objects. It identifies steps in appropriation from inspection to performance and habituation. We test this framework with the preliminary testing of an augmented habituated object, a messaging kettle. While only used in one home so far, its daily use has provoked many thoughts, scenarios and projections about use by friends, both practical, utopian and dystopian.

Discrete parameter simulation optimization algorithms with applications to admission control with dependent service times

We propose certain discrete parameter variants of well known simulation optimization algorithms. Two of these algorithms are based on the smoothed functional (SF) technique while two others are based on the simultaneous perturbation stochastic approximation (SPSA) method. They differ from each other in the way perturbations are obtained and also the manner in which projections and parameter updates are performed. All our algorithms use two simulations and two-timescale stochastic approximation. As an application setting, we consider the important problem of admission control of packets in communication networks under dependent service times. We consider a discrete time slotted queueing model of the system and consider two different scenarios - one where the service times have a dependence on the system state and the other where they depend on the number of arrivals in a time slot. Under our settings, the simulated objective function appears ill-behaved with multiple local minima and a unique global minimum characterized by a sharp dip in the objective function in a small region of the parameter space. We compare the performance of our algorithms on these settings and observe that the two SF algorithms show the best results overall. In fact, in many cases studied, SF algorithms converge to the global minimum.

ICI-ISI mitigation in cooperative SFBC-OFDM with carrier frequency offset

Synchronization issues pose a big challenge in cooperative communications. The benefits of cooperative diversity could be easily undone by improper synchronization. The problem arises because it would be difficult, from a complexity perspective, for multiple transmitting nodes to synchronize to a single receiver. For OFDM based systems, loss of performance due to imperfect carrier synchronization is severe, since it results in inter-carrier interference (ICI). The use of space-time/space-frequency codes from orthogonal designs are attractive for cooperative encoding. But orthogonal designs suffer from inter-symbol interference (ISI) due to the violation of quasi-static assumption, which can arise due to frequency- or time-selectivity of the channel. In this paper, we are concerned with combating the effects of i) ICI induced by carrier frequency offsets (CFO), and ii) ISI induced by frequency selectivity of the channel, in a cooperative communication scheme using space-frequency block coded (SFBC) OFDM. Specifically, we present an iterative interference cancellation (IC) algorithm to combat the ISI and ICI effects. The proposed algorithm could be applied to any orthogonal or quasi-orthogonal designs in cooperative SFBC OFDM schemes.

Four group decodable differential scaled unitary linear space-time codes

Differential Unitary Space-Time Block codes (STBCs) offer a means to communicate on the Multiple Input Multiple Output (MIMO) channel without the need for channel knowledge at both the transmitter and the receiver. Recently Yuen-Guan-Tjhung have proposed Single-Symbol-Decodable Differential Space-Time Modulation based on Quasi-Orthogonal Designs (QODs) by replacing the original unitary criterion by a scaled unitary criterion. These codes were also shown to perform better than differential unitary STBCs from Orthogonal Designs (ODs). However the rate (as measured in complex symbols per channel use) of the codes of Yuen-Guan-Tjhung decay as the number of transmit antennas increase. In this paper, a new class of differential scaled unitary STBCs for all even number of transmit antennas is proposed. These codes have a rate of 1 complex symbols per channel use, achieve full diversity and moreover they are four-group decodable, i.e., the set of real symbols can be partitioned into four groups and decoding can be done for the symbols in each group separately. Explicit construction of multidimensional signal sets that yield full diversity for this new class of codes is also given.

1-[5-Acetyl-4-(4-bromophenyl)-2,6-dimethyl-1,4-dihydropyridin-3-yl]eth anone monohydrate

The 1,4-dihydropyridine ring in the title hydrate, C17H18BrNO2 center dot H2O, has a flattened-boat conformation, and the benzene ring is occupies a position orthogonal to this [dihedral angle: 82.19 (16)degrees]. In the crystal packing, supramolecular arrays mediated by N-H center dot center dot center dot O-water and O-water-H center dot center dot center dot O-carbonyl hydrogen bonding are formed in the bc plane. A highly disordered solvent molecule is present within a molecular cavity defined by the organic and water molecules. Its contribution to the electron density was removed from the observed data in the final cycles of refinement and the formula, molecular weight and density are given without taking into account the contribution of the solvent molecule.

MAC design for heterogeneous application support in OFDM based wireless systems

With the increasing adoption of wireless technology, it is reasonable to expect an increase in file demand for supporting both real-time multimedia and high rate reliable data services. Next generation wireless systems employ Orthogonal Frequency Division Multiplexing (OFDM) physical layer owing, to the high data rate transmissions that are possible without increase in bandwidth. Towards improving file performance of these systems, we look at the design of resource allocation algorithms at medium-access layer, and their impact on higher layers. While TCP-based clastic traffic needs reliable transport, UDP-based real-time applications have stringent delay and rate requirements. The MAC algorithms while catering to the heterogeneous service needs of these higher layers, tradeoff between maximizing the system capacity and providing fairness among users. The novelly of this work is the proposal of various channel-aware resource allocation algorithms at the MAC layer. which call result in significant performance gains in an OFDM based wireless system.