Review of quantitative phase-digital holographic microscopy: promising novel imaging technique to resolve neuronal network activity and identify cellular biomarkers of psychiatric disorders.

Quantitative phase microscopy (QPM) has recently emerged as a new powerful quantitative imaging technique well suited to noninvasively explore a transparent specimen with a nanometric axial sensitivity. In this review, we expose the recent developments of quantitative phase-digital holographic microscopy (QP-DHM). Quantitative phase-digital holographic microscopy (QP-DHM) represents an important and efficient quantitative phase method to explore cell structure and dynamics. In a second part, the most relevant QPM applications in the field of cell biology are summarized. A particular emphasis is placed on the original biological information, which can be derived from the quantitative phase signal. In a third part, recent applications obtained, with QP-DHM in the field of cellular neuroscience, namely the possibility to optically resolve neuronal network activity and spine dynamics, are presented. Furthermore, potential applications of QPM related to psychiatry through the identification of new and original cell biomarkers that, when combined with a range of other biomarkers, could significantly contribute to the determination of high risk developmental trajectories for psychiatric disorders, are discussed.

Digital printing delivering value to the value network: CASE: STORA ENSO OYJ

Tutkielman tavoitteena oli tutkia, millaista arvoa digitaalinen painatusmenetelmä tuo yrityksen arvoverkostoon. Teoriaosassa tavoite oli rakentaa digitaalipainatuksen arvoverkostoa tutkien kirjallisuutta liittyen arvoketju- ja arvoverkostoajatteluun. Myös aiemmat tutkimukset ja kirjallisuus liittyen digitaalipainatukseen rakensivat osaltaan teoreettisen viitekehyksen muodostumista. Aiemmat tutkimukset digitaalisen painomenetelmän mahdollisuuksista ovat hyvin tekniikkapainotteisia, siksi tämä tutkimus liittyy enemmän kaupallisiin mahdollisuuksiin. Empiirinen osio tutkimuksesta tehtiin kvalitatiivisena case -tutkimuksena, johon sisältyi yksi alayksikkö. Eli tutkittiin yhtä casea, jossa oli kaksi osapuolta. Tutkielma liittyy kiinteästi Stora Enson ja Valion väliseen digipainatus-projektiin, joka käynnistettiin helmikuussa 2001. Tutkielman teemahaastatteluihin valittiin henkilöt tästä projektiryhmästä. Projektiryhmän mielipiteitä ja havaintoja hyödyntäen pyrittiin löytämään tukea ja eroavaisuuksia teoriaosan muodostamaan viitekehykseen ja informaatioon. Empiirinen osuus tuki teoriaosassa esittämiä väittämiä hyvin, mutta myös muutamia uusia havaintoja esiintyi. Tutkimusongelmaan löydettiin monia vastauksia: digitaalipainatus luo arvoa yrityksen jakeluketjuun vähentämällä varastoja ja nopeuttamalla toimituksia. Jäätelöpakkausten markkinointi on aivan uuden haasteen edessä, koska mahdollisuudet kasvavat digitaalipainatuksen myötä huomattavasti. Kartongin valmistajalle arvo tulee parempien tuotteiden kautta, joista saa myös paremman tuoton. Digitaalipainatuksen arvoverkostossa tulee tapahtumaan muutoksia jatkossa, eri osapuolten roolit saattavat muuttua radikaalisti. Kuka hoitaa painatusta ja miten?

An energy efficient vertical handover decision algorithm

As wireless communications evolve towards heterogeneousnetworks, mobile terminals have been enabled tohandover seamlessly from one network to another. At the sametime, the continuous increase in the terminal power consumptionhas resulted in an ever-decreasing battery lifetime. To that end,the network selection is expected to play a key role on howto minimize the energy consumption, and thus to extend theterminal lifetime. Hitherto, terminals select the network thatprovides the highest received power. However, it has been provedthat this solution does not provide the highest energy efficiency.Thus, this paper proposes an energy efficient vertical handoveralgorithm that selects the most energy efficient network thatminimizes the uplink power consumption. The performance of theproposed algorithm is evaluated through extensive simulationsand it is shown to achieve high energy efficiency gains comparedto the conventional approach.

Formal modelling for digital media distribution

Human beings have always strived to preserve their memories and spread their ideas. In the beginning this was always done through human interpretations, such as telling stories and creating sculptures. Later, technological progress made it possible to create a recording of a phenomenon; first as an analogue recording onto a physical object, and later digitally, as a sequence of bits to be interpreted by a computer. By the end of the 20th century technological advances had made it feasible to distribute media content over a computer network instead of on physical objects, thus enabling the concept of digital media distribution. Many digital media distribution systems already exist, and their continued, and in many cases increasing, usage is an indicator for the high interest in their future enhancements and enriching. By looking at these digital media distribution systems, we have identified three main areas of possible improvement: network structure and coordination, transport of content over the network, and the encoding used for the content. In this thesis, our aim is to show that improvements in performance, efficiency and availability can be done in conjunction with improvements in software quality and reliability through the use of formal methods: mathematical approaches to reasoning about software so that we can prove its correctness, together with the desirable properties. We envision a complete media distribution system based on a distributed architecture, such as peer-to-peer networking, in which different parts of the system have been formally modelled and verified. Starting with the network itself, we show how it can be formally constructed and modularised in the Event-B formalism, such that we can separate the modelling of one node from the modelling of the network itself. We also show how the piece selection algorithm in the BitTorrent peer-to-peer transfer protocol can be adapted for on-demand media streaming, and how this can be modelled in Event-B. Furthermore, we show how modelling one peer in Event-B can give results similar to simulating an entire network of peers. Going further, we introduce a formal specification language for content transfer algorithms, and show that having such a language can make these algorithms easier to understand. We also show how generating Event-B code from this language can result in less complexity compared to creating the models from written specifications. We also consider the decoding part of a media distribution system by showing how video decoding can be done in parallel. This is based on formally defined dependencies between frames and blocks in a video sequence; we have shown that also this step can be performed in a way that is mathematically proven correct. Our modelling and proving in this thesis is, in its majority, tool-based. This provides a demonstration of the advance of formal methods as well as their increased reliability, and thus, advocates for their more wide-spread usage in the future.

Evaluation of Machine Learning Classifiers for Mobile Network Intrusion Detection Systems

Mobile malwares are increasing with the growing number of Mobile users. Mobile malwares can perform several operations which lead to cybersecurity threats such as, stealing financial or personal information, installing malicious applications, sending premium SMS, creating backdoors, keylogging and crypto-ransomware attacks. Knowing the fact that there are many illegitimate Applications available on the App stores, most of the mobile users remain careless about the security of their Mobile devices and become the potential victim of these threats. Previous studies have shown that not every antivirus is capable of detecting all the threats; due to the fact that Mobile malwares use advance techniques to avoid detection. A Network-based IDS at the operator side will bring an extra layer of security to the subscribers and can detect many advanced threats by analyzing their traffic patterns. Machine Learning(ML) will provide the ability to these systems to detect unknown threats for which signatures are not yet known. This research is focused on the evaluation of Machine Learning classifiers in Network-based Intrusion detection systems for Mobile Networks. In this study, different techniques of Network-based intrusion detection with their advantages, disadvantages and state of the art in Hybrid solutions are discussed. Finally, a ML based NIDS is proposed which will work as a subsystem, to Network-based IDS deployed by Mobile Operators, that can help in detecting unknown threats and reducing false positives. In this research, several ML classifiers were implemented and evaluated. This study is focused on Android-based malwares, as Android is the most popular OS among users, hence most targeted by cyber criminals. Supervised ML algorithms based classifiers were built using the dataset which contained the labeled instances of relevant features. These features were extracted from the traffic generated by samples of several malware families and benign applications. These classifiers were able to detect malicious traffic patterns with the TPR upto 99.6% during Cross-validation test. Also, several experiments were conducted to detect unknown malware traffic and to detect false positives. These classifiers were able to detect unknown threats with the Accuracy of 97.5%. These classifiers could be integrated with current NIDS', which use signatures, statistical or knowledge-based techniques to detect malicious traffic. Technique to integrate the output from ML classifier with traditional NIDS is discussed and proposed for future work.

A case study investigation of the learning needs of the Niagara grape and wine community

The Niagara Grape and Wine Community (NGWC) is an industry that has undergone rapid change and expansion as a result of changes in governmental regulations and consumer preferences. As a result of these changes, the demands of the wine industry workforce have changed to reflect the need to implement new strategies and practices to remain viable and competitive. The influx of people into the community with little or no prior practical experience in grape growing (viticulture) or winemaking (oenology) has created a need for additional training and learning opportunities to meet workforce needs. This case study investigated the learning needs of the members of this community and how these needs are currently being met. The barriers to, and the opportunities for, members acquiring new knowledge and developing skills were also explored. Participants were those involved in all levels of the industry and sectors (viticulture, processing, and retail), and their views on needs and suggestions for programs of study were collected. Through cross analyses of sectors, areas of common and unique interest were identified as well as formats for delivery. A common fundamental component was identified by all sectors - any program must have a significant applied component or demonstration of proficiency and should utilize members as peer instructors, mentors, and collaborators to generate a larger shared collective of knowledge. Through the review of learning organizations, learning communities, communities of practices, and learning networks, the principles for the development of a Grape and Wine Learning Network to meet the learning needs of the NGWC outside of formal institutional or academic programs were developed. The roles and actions of members to make such a network successful are suggested.

A moving-mesh finite element method and its application to the numerical solution of phase-change problems

A distributed Lagrangian moving-mesh finite element method is applied to problems involving changes of phase. The algorithm uses a distributed conservation principle to determine nodal mesh velocities, which are then used to move the nodes. The nodal values are obtained from an ALE (Arbitrary Lagrangian-Eulerian) equation, which represents a generalization of the original algorithm presented in Applied Numerical Mathematics, 54:450--469 (2005). Having described the details of the generalized algorithm it is validated on two test cases from the original paper and is then applied to one-phase and, for the first time, two-phase Stefan problems in one and two space dimensions, paying particular attention to the implementation of the interface boundary conditions. Results are presented to demonstrate the accuracy and the effectiveness of the method, including comparisons against analytical solutions where available.

Competing edge networks

We introduce a model for a pair of nonlinear evolving networks, defined over a common set of vertices, sub ject to edgewise competition. Each network may grow new edges spontaneously or through triad closure. Both networks inhibit the other’s growth and encourage the other’s demise. These nonlinear stochastic competition equations yield to a mean field analysis resulting in a nonlinear deterministic system. There may be multiple equilibria; and bifurcations of different types are shown to occur within a reduced parameter space. This situation models competitive peer-to-peer communication networks such as BlackBerry Messenger displacing SMS; or instant messaging displacing emails.

An application of neural network technique to correct the dome temperature effects on pyrgeometer measurements

This work describes an application of a multilayer perceptron neural network technique to correct dome emission effects on longwave atmospheric radiation measurements carried out using an Eppley Precision Infrared Radiometer (PIR) pyrgeometer. It is shown that approximately 7-month-long measurements of dome and case temperatures and meteorological variables available in regular surface stations (global solar radiation, air temperature, and air relative humidity) are enough to train the neural network algorithm and correct the observed longwave radiation for dome temperature effects in surface stations with climates similar to that of the city of São Paulo, Brazil. The network was trained using data from 15 October 2003 to 7 January 2004 and verified using data, not present during the network-training period, from 8 January to 30 April 2004. The longwave radiation values generated by the neural network technique were very similar to the values obtained by Fairall et al., assumed here as the reference approach to correct dome emission effects in PIR pyrgeometers. Compared to the empirical approach the neural network technique is less limited to sensor type and time of day (allows nighttime corrections).

Probabilistic neural network to predict cracks in taphole mud used in blast furnaces

One of the major problems facing Blast Furnaces is the occurrence of cracks in taphole mud, as the underlying causes are not easily identifiable. The absence of this knowledge makes it difficult the use of conventional techniques for predictability and mitigation. This paper will address the application of Probabilistic Neural Network using the Matlab software as a means to detect and control such cracks. The most relevant BF operational variables were picked through the statistic tool "Principal Component Analysis - PCA." Based upon the selection of these variables a probabilistic neural network was built. A set of BF operational data, consisting of 30 controlling variables, was divided into 2 groups, one of which for network training, and the other one to validate the neural network. The neural network got 98% of the cases right. The results show the effectiveness of this tool for crack prediction in relation to clay intrinsic properties and as a result of the fluctuation in operational variables.

Statistical model applied to NetFlow for network intrusion detection

The computers and network services became presence guaranteed in several places. These characteristics resulted in the growth of illicit events and therefore the computers and networks security has become an essential point in any computing environment. Many methodologies were created to identify these events; however, with increasing of users and services on the Internet, many difficulties are found in trying to monitor a large network environment. This paper proposes a methodology for events detection in large-scale networks. The proposal approaches the anomaly detection using the NetFlow protocol, statistical methods and monitoring the environment in a best time for the application. © 2010 Springer-Verlag Berlin Heidelberg.

Network node with wireless and wired interfaces: Nios II processor and uClinux to development of a NCAP embedded (IEEE 1451.1) with two interfaces, wireless (IEEE 1451.5) and wired (IEEE p1451.2)

This paper presents a NCAP embedded on DE2 kit with Nios II processor and uClinux to development of a network gateway with two interfaces, wireless (ZigBee) and wired (RS232) based on IEEE 1451. Both the communications, wireless and wired, were developed to be point-to-point and working with the same protocols, based on IEEE 1451.0-2007. The tests were made using a microcomputer, which through of browser was possible access the web page stored in the DE2 kit and send commands of control and monitoring to both TIMs (WTIM and STIM). The system describes a different form of development of the NCAP node to be applied in different environments with wired or wireless in the same node. © 2011 IEEE.

Wireless mesh networks planning based on parameters of quality of service

The use of QoS parameters to evaluate the quality of service in a mesh network is essential mainly when providing multimedia services. This paper proposes an algorithm for planning wireless mesh networks in order to satisfy some QoS parameters, given a set of test points (TPs) and potential access points (APs). Examples of QoS parameters include: probability of packet loss and mean delay in responding to a request. The proposed algorithm uses a Mathematical Programming model to determine an adequate topology for the network and Monte Carlo simulation to verify whether the QoS parameters are being satisfied. The results obtained show that the proposed algorithm is able to find satisfactory solutions.

Mesh cancer: long-term mesh infection leading to squamous-cell carcinoma of the abdominal wall

Purpose: It is recognized that chronic inflammation can cause cancer. Even though most of the available synthetic meshes are considered non-carcinogenic, the inflammatory response to an infected mesh plays a constant aggression to the skin. Chronic mesh infection is frequently the result of misuse of mesh, and due to the challenging nature of this condition, patients usually suffer for years until the infected mesh is removed by surgical excision. Methods: We report two cases of squamous-cell carcinoma (SCC) of the abdominal wall, arising in patients with long-term mesh infection. Results: In both patients, the degeneration of mesh infection into SCC was presumably caused by the long-term inflammation secondary to infection. Patients presented with advanced SCC behaving just like the Marjolin's ulcers of burns. Radical surgical excision was the treatment of choice. The involvement of the bowel played an additional challenge in case 1, but it was possible to resect the tumor and the involved bowel and reconstruct the abdominal wall using polypropylene mesh as onlay reinforcement, in a single stage operation. He is now under adjuvant chemotherapy. The big gap in the midline after tumor resection in case 2 required mesh bridging to close the defect. The poor prognosis of case 2 who died months after the operation, and the involvement of the armpit, groin and mesenteric nodes in case 1 shows how aggressive this disease can be. Conclusion: Infected mesh must be treated early, by complete excision of the mesh. Long-standing mesh infection can degenerate into aggressive squamous-cell carcinoma of the skin. © 2013 Springer-Verlag France.

Advanced network reconfiguration system applied to CEMIG-D system

In the network reconfiguration context, the challenge nowadays is to improve the system in order to get intelligent systems that are able to monitor the network and produce refined information to support the operator decisions in real time, this because the network is wide, ramified and in some places difficult to access. The objective of this paper is to present the first results of the network reconfiguration algorithm that has been developed to CEMIG-D. The algorithm's main idea is to provide a new network configuration, after an event (fault or study case), based on an initial condition and aiming to minimize the affected load, considering the restrictions of load flow equations, maximum capacity of the lines as well as equipments and substations, voltage limits and system radial operation. Initial tests were made considering real data from the system, provided by CEMIG-D and it reveals very promising results. © 2013 IEEE.