Query: Bank distress in the news: Describing events through deep learning

Relevant passages:
Learning representations by back-propagating errors <=SEP=> We describe a new learning procedure, back-propagation, for networks of neurone-like units. The procedure repeatedly adjusts the weights of the connections in the network so as to minimize a measure of the difference between the actual output vector of the net and the desired output vector. As a result of the weight adjustments, internal ‘hidden’ units which are not part of the input or output come to represent important features of the task domain, and the regularities in the task are captured by the interactions of these units. The ability to create useful new features distinguishes back-propagation from earlier, simpler methods such as the perceptron-convergence procedure1.

Long Short-Term Memory <=SEP=> Learning to store information over extended time intervals by recurrent backpropagation takes a very long time, mostly because of insufficient, decaying error backflow. We briefly review Hochreiter's (1991) analysis of this problem, then address it by introducing a novel, efficient, gradient based method called long short-term memory (LSTM). Truncating the gradient where this does not do harm, LSTM can learn to bridge minimal time lags in excess of 1000 discrete-time steps by enforcing constant error flow through constant error carousels within special units. Multiplicative gate units learn to open and close access to the constant error flow. LSTM is local in space and time; its computational complexity per time step and weight is O. 1. Our experiments with artificial data involve local, distributed, real-valued, and noisy pattern representations. In comparisons with real-time recurrent learning, back propagation through time, recurrent cascade correlation, Elman nets, and neural sequence chunking, LSTM leads to many more successful runs, and learns much faster. LSTM also solves complex, artificial long-time-lag tasks that have never been solved by previous recurrent network algorithms.

Information Retrieval <=SEP=> The major change in the second edition of this book is the addition of a new chapter on probabilistic retrieval. This chapter has been included because I think this is one of the most interesting and active areas of research in information retrieval. There are still many problems to be solved so I hope that this particular chapter will be of some help to those who want to advance the state of knowledge in this area. All the other chapters have been updated by including some of the more recent work on the topics covered. In preparing this new edition I have benefited from discussions with Bruce Croft, The material of this book is aimed at advanced undergraduate information (or computer) science students, postgraduate library science students, and research workers in the field of IR. Some of the chapters, particularly Chapter 6 * , make simple use of a little advanced mathematics. However, the necessary mathematical tools can be easily mastered from numerous mathematical texts that now exist and, in any case, references have been given where the mathematics occur. I had to face the problem of balancing clarity of exposition with density of references. I was tempted to give large numbers of references but was afraid they would have destroyed the continuity of the text. I have tried to steer a middle course and not compete with the Annual Review of Information Science and Technology. Normally one is encouraged to cite only works that have been published in some readily accessible form, such as a book or periodical. Unfortunately, much of the interesting work in IR is contained in technical reports and Ph.D. theses. For example, most the work done on the SMART system at Cornell is available only in reports. Luckily many of these are now available through the National Technical Information Service (U.S.) and University Microfilms (U.K.). I have not avoided using these sources although if the same material is accessible more readily in some other form I have given it preference. I should like to acknowledge my considerable debt to many people and institutions that have helped me. Let me say first that they are responsible for many of the ideas in this book but that only I wish to be held responsible. My greatest debt is to Karen Sparck Jones who taught me to research information retrieval as an experimental science. Nick Jardine and Robin …

Don't count, predict! A systematic comparison of context-counting vs. context-predicting semantic vectors <=SEP=> Context-predicting models (more commonly known as embeddings or neural language models) are the new kids on the distributional semantics block. Despite the buzz surrounding these models, the literature is still lacking a systematic comparison of the predictive models with classic, count-vector-based distributional semantic approaches. In this paper, we perform such an extensive evaluation, on a wide range of lexical semantics tasks and across many parameter settings. The results, to our own surprise, show that the buzz is fully justified, as the context-predicting models obtain a thorough and resounding victory against their count-based counterparts.

Deep Learning for Natural Language Processing <=SEP=> 1Student,Dept. of Computer Engineering, VESIT, Maharashtra, India ---------------------------------------------------------------------------***-------------------------------------------------------------------Abstract Deep Learning has come into existence as a new area for research in Machine Learning. It aims to act like a human brain, having the ability to learn and process from complex data and also tries solving intricate tasks as well. Due to this capability, its been used in various fields like text, sound, images etc. Natural language process has started to being impacted by the deep learning techniques. This research paper highlights Deep Learning’s recent developments and applications in Natural Language Processing.

Image Segmentation by Cascaded Region Agglomeration <=SEP=> We propose a hierarchical segmentation algorithm that starts with a very fine over segmentation and gradually merges regions using a cascade of boundary classifiers. This approach allows the weights of region and boundary features to adapt to the segmentation scale at which they are applied. The stages of the cascade are trained sequentially, with asymetric loss to maximize boundary recall. On six segmentation data sets, our algorithm achieves best performance under most region-quality measures, and does it with fewer segments than the prior work. Our algorithm is also highly competitive in a dense over segmentation (super pixel) regime under boundary-based measures.

Continuous and Cuffless Blood Pressure Monitoring Based on ECG and SpO2 Signals ByUsing Microsoft Visual C Sharp <=SEP=> BACKGROUND
One of the main problems especially in operating room and monitoring devices is measurement of Blood Pressure (BP) by sphygmomanometer cuff. Objective :In this study we designed a new method to measure BP changes continuously for detecting information between cuff inflation times by using vital signals in monitoring devices. This will be achieved by extraction of the time difference between each cardiac cycle and a relative pulse wave.


METHODS
Finger pulse and ECG signals in lead I were recorded by a monitoring device. The output of monitoring device wasinserted in a computer by serial network communication. A software interface (Microsoft Visual C#.NET ) was used to display and process the signals in the computer. Time difference between each cardiac cycle and pulse signal was calculated throughout R wave detection in ECG and peak of pulse signal by the software. The relation between time difference in two waves and BP was determined then the coefficients of equation were obtained in different physical situations. The results of estimating BP were compared with the results of sphygmomanometer method and the error rate was calculated.


RESULTS
In this study, 25 subjects participated among them 15 were male and 10 were female. The results showed that BP was linearly related to time difference. Average of coefficient correlation was 0.9±0.03 for systolic and 0.82±0.04 for diastolic blood pressure. The highest error percentage was calculated 8% for male and 11% for female group. Significant difference was observed between the different physical situation and arm movement changes. The relationship between time difference and age was estimated in a linear relationship with a correlation coefficient of 0.76.


CONCLUSION
By determining linear relation values with high accuracy, BP can be measured with insignificant error. Therefore it can be suggested as a new method to measure the blood pressure continuously.

Performance assessment and uncertainty quantification of predictive models for smart manufacturing systems <=SEP=> We review in this paper several methods from Statistical Learning Theory (SLT) for the performance assessment and uncertainty quantification of predictive models. Computational issues are addressed so to allow the scaling to large datasets and the application of SLT to Big Data analytics. The effectiveness of the application of SLT to manufacturing systems is exemplified by targeting the derivation of a predictive model for quality forecasting of products on an assembly line.

LDA-based document models for ad-hoc retrieval <=SEP=> Search algorithms incorporating some form of topic model have a long history in information retrieval. For example, cluster-based retrieval has been studied since the 60s and has recently produced good results in the language model framework. An approach to building topic models based on a formal generative model of documents, Latent Dirichlet Allocation (LDA), is heavily cited in the machine learning literature, but its feasibility and effectiveness in information retrieval is mostly unknown. In this paper, we study how to efficiently use LDA to improve ad-hoc retrieval. We propose an LDA-based document model within the language modeling framework, and evaluate it on several TREC collections. Gibbs sampling is employed to conduct approximate inference in LDA and the computational complexity is analyzed. We show that improvements over retrieval using cluster-based models can be obtained with reasonable efficiency.

Number of articles Economy Health Care Taxes Federal Budget Jobs State Budget Education Candidate Biography Elections Immigration Foreign Policy Crime Energy History Job Accomplishments Legal Issues Environment Terrorism Military Guns <=SEP=> We report on attempts to use currently available automated text analysis tools to identify possible biased treatment by Politifact of Democratic vs. Republican speakers, through language. We begin by noting that there is no established method for detecting such differences, and indeed that “bias” is complicated and difficult to operationalize into a measurable quantity. This report includes several analyses that are representative of the tools available from natural language processing at this writing. In each case, we offer (i) what we would expect to see in the results if the method picked up on differential treatment between Democrats vs. Republicans, (ii) what we actually observe, and (iii) potential problems with the analysis; in some cases we also suggest (iv) future analyses that might be more revelatory.

PCSIM: A Parallel Simulation Environment for Neural Circuits Fully Integrated with Python <=SEP=> The Parallel Circuit SIMulator (PCSIM) is a software package for simulation of neural circuits. It is primarily designed for distributed simulation of large scale networks of spiking point neurons. Although its computational core is written in C++, PCSIM's primary interface is implemented in the Python programming language, which is a powerful programming environment and allows the user to easily integrate the neural circuit simulator with data analysis and visualization tools to manage the full neural modeling life cycle. The main focus of this paper is to describe PCSIM's full integration into Python and the benefits thereof. In particular we will investigate how the automatically generated bidirectional interface and PCSIM's object-oriented modular framework enable the user to adopt a hybrid modeling approach: using and extending PCSIM's functionality either employing pure Python or C++ and thus combining the advantages of both worlds. Furthermore, we describe several supplementary PCSIM packages written in pure Python and tailored towards setting up and analyzing neural simulations.

Class Activation Map Generation by Representative Class Selection and Multi-Layer Feature Fusion <=SEP=> Existing method generates class activation map (CAM) by a set of fixed classes (i.e., using all the classes), while the discriminative cues between class pairs are not considered. Note that activation maps by considering different class pair are complementary, and therefore can provide more discriminative cues to overcome the shortcoming of the existing CAM generation that the highlighted regions are usually local part regions rather than global object regions due to the lack of object cues. In this paper, we generate CAM by using a few of representative classes, with aim of extracting more discriminative cues by considering each class pair to obtain CAM more globally. The advantages are twofold. Firstly, the representative classes are able to obtain activation regions that are complementary to each other, and therefore leads to generating activation map more accurately. Secondly, we only need to consider a small number of representative classes, making the CAM generation suitable for small networks. We propose a clustering based method to select the representative classes. Multiple binary classification models rather than a multiple class classification model are used to generate the CAM. Moreover, we propose a multi-layer fusion based CAM generation method to simultaneously combine high-level semantic features and low-level detail features. We validate the proposed method on the PASCAL VOC and COCO database in terms of segmentation groundtruth. Various networks such as classical network (Resnet-50, Resent-101 and Resnet-152) and small network (VGG-19, Resnet-18 and Mobilenet) are considered. Experimental results show that the proposed method improves the CAM generation obviously.

Processing of Reference and the Structure of Language: An Analysis of Complex Noun Phrases <=SEP=> Five experiments used self-paced reading time to examine the ways in which complex noun phrases (both conjoined NPs and possessive NPs) inuence the interpretation of referentially dependent expressions. The experimental conditions contrasted the reading of repeated names and pronouns referring to components of a complex NP and to the entire complex NP. The results indicate that the entity introduced by a major constituent of a sentence is more accessible as a referent than the entities introduced by component noun phrases. This pattern of accessibility departs from the advantage of rst mention that has been demonstrated using probe-word recognition tasks. It supports the idea that reduced expressions are interpreted as referring directly to prominent entities in a mental model whereas reference by names to entities that are already represented in a mental model is mediated by additional processes. The same interpretive processes appear to operate on coreference within and between sentences.

Predicting the Price of Used Cars using Machine Learning Techniques <=SEP=> In this paper, we investigate the application of supervised machine learning techniques to predict the price of used cars in Mauritius. The predictions are based on historical data collected from daily newspapers. Different techniques like multiple linear regression analysis, k-nearest neighbours, naïve bayes and decision trees have been used to make the predictions. The predictions are then evaluated and compared in order to find those which provide the best performances. A seemingly easy problem turned out to be indeed very difficult to resolve with high accuracy. All the four methods provided comparable performance. In the future, we intend to use more sophisticated algorithms to make the predictions. Keywords-component; formatting; style; styling; insert (key words)

Beyond Doctors: Future Health Prediction from Multimedia and Multimodal Observations <=SEP=> Although chronic diseases cannot be cured, they can be effectively controlled as long as we understand their progressions based on the current observational health records, which is often in the form of multimedia data. A large and growing body of literature has investigated the disease progression problem. However, far too little attention to date has been paid to jointly consider the following three observations of the chronic disease progression: 1) the health statuses at different time points are chronologically similar; 2) the future health statuses of each patient can be comprehensively revealed from the current multimedia and multimodal observations, such as visual scans, digital measurements and textual medical histories; and 3) the discriminative capabilities of different modalities vary significantly in accordance to specific diseases. In the light of these, we propose an adaptive multimodal multi-task learning model to co-regularize the modality agreement, temporal progression and discriminative capabilities of different modalities. We theoretically show that our proposed model is a linear system. Before training our model, we address the data missing problem via the matrix factorization approach. Extensive evaluations on a real-world Alzheimer's disease dataset well verify our proposed model. It should be noted that our model is also applicable to other chronic diseases.

Rapid diagnostic tests for malaria parasites. <=SEP=> Malaria presents a diagnostic challenge to laboratories in most countries. Endemic malaria, population movements, and travelers all contribute to presenting the laboratory with diagnostic problems for which it may have little expertise available. Drug resistance and genetic variation has altered many accepted morphological appearances of malaria species, and new technology has given an opportunity to review available procedures. Concurrently the World Health Organization has opened a dialogue with scientists, clinicians, and manufacturers on the realistic possibilities for developing accurate, sensitive, and cost-effective rapid diagnostic tests for malaria, capable of detecting 100 parasites/microl from all species and with a semiquantitative measurement for monitoring successful drug treatment. New technology has to be compared with an accepted "gold standard" that makes comparisons of sensitivity and specificity between different methods. The majority of malaria is found in countries where cost-effectiveness is an important factor and ease of performance and training is a major consideration. Most new technology for malaria diagnosis incorporates immunochromatographic capture procedures, with conjugated monoclonal antibodies providing the indicator of infection. Preferred targeted antigens are those which are abundant in all asexual and sexual stages of the parasite and are currently centered on detection of HRP-2 from Plasmodium falciparum and parasite-specific lactate dehydrogenase or Plasmodium aldolase from the parasite glycolytic pathway found in all species. Clinical studies allow effective comparisons between different formats, and the reality of nonmicroscopic diagnoses of malaria is considered.

Automatic Keyword Extraction for Text Summarization in Multi-document e-Newspapers Articles <=SEP=> Summarization is the way towards lessening the content of a text file to make it brief that holds all the critical purposes in the content of original text file. In the process of extractive summarization, one extracts only those sentences which are the most relevant sentences in the text document and that conveys the moral of the content. The extractive summarization techniques usually revolve around the idea of discovering most relevant and frequent keywords and then extract the sentences based on those keywords. Manual extraction or explanation of relevant keywords are a dreary procedure overflowing with errors including loads of manual exertion and time. In this paper, we proposed a hybrid approach to extract keyword automatically for multi-document text summarization in enewspaper articles. The performance of the proposed approach is compared with three additional keyword extraction techniques namely, term frequency-inverse document frequency (TF-IDF), term frequency-adaptive inverse document frequency (TF-AIDF), and a number of false alarm (NFA) for automatic keyword extraction and summarization in e-newspapers articles for better analysis. Finally, we showed that our proposed techniques had been outperformed over other techniques for automatic keyword extraction and summarization.

Software-Defined “Hardware” Infrastructures: A Survey on Enabling Technologies and Open Research Directions <=SEP=> This paper provides an overview of software-defined “hardware” infrastructures (SDHI). SDHI builds upon the concept of hardware (HW) resource disaggregation. HW resource disaggregation breaks today’s physical server-oriented model where the use of a physical resource (e.g., processor or memory) is constrained to a physical server’s chassis. SDHI extends the definition of of software-defined infrastructures (SDI) and brings greater modularity, flexibility, and extensibility to cloud infrastructures, thus allowing cloud operators to employ resources more efficiently and allowing applications not to be bounded by the physical infrastructure’s layout. This paper aims to be an initial introduction to SDHI and its associated technological advancements. This paper starts with an overview of the cloud domain and puts into perspective some of the most prominent efforts in the area. Then, it presents a set of differentiating use-cases that SDHI enables. Next, we state the fundamentals behind SDI and SDHI, and elaborate why SDHI is of great interest today. Moreover, it provides an overview of the functional architecture of a cloud built on SDHI, exploring how the impact of this transformation goes far beyond the cloud infrastructure level in its impact on platforms, execution environments, and applications. Finally, an in-depth assessment is made of the technologies behind SDHI, the impact of these technologies, and the associated challenges and potential future directions of SDHI.

A Study On Unmanned Vehicles and Cyber Security <=SEP=> During the past years Unmanned Aerial Vehicle (UAV) usage has grown in military and civilian fields. Every year, emergency response operations are more and more dependent of these unmanned vehicles. Lacking direct human interference, the correction of onboard errors and security breaches is a growing concern in unmanned vehicles. One of the concerns raised by first responders using unmanned vehicles is the security and privacy of the victims they are rescuing. Video channels used for the control of unmanned vehicles are of particular importance, having great susceptibility to hijack, jamming and spoofing attacks. It is assumed the video feeds are not protected by any type of encryption and are therefore vulnerable to hacking and/or spoofing. This summer we have conducted a preliminary survey of the security vulnerabilities and their implications on the operation of unmanned vehicles from a network security perspective.

A stochastic data discrimination based autoencoder approach for network anomaly detection <=SEP=> Machine learning based network anomaly detection methods, which are already effective defense mechanisms against known network intrusion attacks, have also proven themselves to be more successful on the detection of zero-day attacks compared to other types of detection methods. Therefore, research on network anomaly detection using deep learning is getting more attention constantly. In this study we created an anomaly detection model based on a deterministic autoencoder, which discriminates normal and abnormal data by using our proposed stochastic threshold determination approach. We tested our proposed anomaly detection model on the NSL-KDD's test dataset KDDTest+ and obtained an accuracy of 88.28%. The experimental results show that our proposed anomaly detection model can perform almost the same as the most successful and up-to-date machine learning based anomaly detection models in the literature.

Electrophysiology in the age of light <=SEP=> Electrophysiology, the 'gold standard' for investigating neuronal signalling, is being challenged by a new generation of optical probes. Together with new forms of microscopy, these probes allow us to measure and control neuronal signals with spatial resolution and genetic specificity that already greatly surpass those of electrophysiology. We predict that the photon will progressively replace the electron for probing neuronal function, particularly for targeted stimulation and silencing of neuronal populations. Although electrophysiological characterization of channels, cells and neural circuits will remain necessary, new combinations of electrophysiology and imaging should lead to transformational discoveries in neuroscience.

Tagging Ingush - Language Technology For Low-Resource Languages Using Resources From Linguistic Field Work <=SEP=> This paper presents on-going work on creating NLP tools for under-resourced languages from very sparse training data coming from linguistic field work. In this work, we focus on Ingush, a Nakh-Daghestanian language spoken by about 300,000 people in the Russian republics Ingushetia and Chechnya. We present work on morphosyntactic taggers trained on transcribed and linguistically analyzed recordings and dependency parsers using English glosses to project annotation for creating synthetic treebanks. Our preliminary results are promising, supporting the goal of bootstrapping efficient NLP tools with limited or no task-specific annotated data resources available.

Vertex-Centric Graph Processing: The Good, the Bad, and the Ugly <=SEP=> We study distributed graph algorithms that adopt an iterati ve vertexcentric framework for graph processing, popularized by Goo gle’s Pregel system. Since then, there are several attempts to imp lement many graph algorithms in a vertex-centric framework, a s well as efforts to design optimization techniques for improving the efficiency. However, to the best of our knowledge, there has not been any systematic study to compare these vertex-centric i mplementations with their sequential counterparts. Our paper a dd esses this gap in two ways. (1) We analyze the computational complexity of such implementations with the notion of time-pro cessor product, and benchmark several vertex-centric graph algor ithms whether they perform more work with respect to their best-kn ow sequential solutions. (2) Employing the concept of balance d practical Pregel algorithms, we study if these implementations suffer from imbalanced workload and large number of iterations. Ou r findings illustrate that with the exception of Euler tour tre e algorithm, all other algorithms either perform asymptotically more work than their best-known sequential approach, or suffer from i mbalanced workload/ large number of iterations, or even both. We also emphasize on graph algorithms that are fundamentally diffic ult to be expressed in vertex-centric frameworks, and conclude by discussing the road ahead for distributed graph processing.

Vision-Based Classification of Skin Cancer using Deep Learning <=SEP=> This study proposes the use of deep learning algorithms to detect the presence of skin cancer, specifically melanoma, from images of skin lesions taken by a standard camera. Skin cancer is the most prevalent form of cancer in the US where 3.3 million people get treated each year. The 5-year survival rate of melanoma is 98% when detected and treated early yet over 10,000 people are lost each year due mostly to late-stage diagnoses [2]. Thus, there is a need to make melanoma screening and diagnoses methods cheaper, quicker, simpler, and more accessible. This study aims to produce an inexpensive and fast computer-vision based machine learning tool that can be used by doctors and patients to track and classify suspicious skin lesions as benign or malignant with adequate accuracy using only a cell phone camera. The data set was trained on 3 separate learning models with increasingly improved classification accuracy. The 3 models included logistic regression, a deep neural network, and a fine-tuned, pre-trained, VGG-16 Convolutional Neural Network (CNN) [7]. Preliminary results show the developed algorithm’s ability to segment moles from images with 70% accuracy and classify skin lesions as melanoma with 78% balanced accuracy using a fine-tuned VGG-16 CNN.

Ceiling continuum arm with extensible pneumatic actuators for desktop workspace <=SEP=> We propose an extensible pneumatic continuum arm that elongates to perform reaching movements and object grasping, and is suspended on the ceiling to prevent interference with human workers in a desktop workspace. The selected actuators with bellows aim to enhance the arm motion capabilities. A single actuator can provide a maximum tension force of 150 N, and the proposed arm has a three-segment structure with a bundle of three actuators per segment. We measured the three-dimensional motion at the arm tip by using an optical motion-capture system. The corresponding results show that the arm can grasp objects with approximate radius of 80 mm and reach any point on the desktop. Furthermore, the maximum elongation ratio is 180%, with length varying between 0.75 m and 2.1 m. Experiments verified that the arm can grasp objects of various sizes and shapes. Moreover, we demonstrate the vertical transportation of objects taking advantage of the arm extensibility. We expect to apply the proposed arm for tasks such as grasping objects, illuminating desktops, and physically interacting with users.

Eventually Returning to Strong Consistency <=SEP=> Eventually and weakly consistent distributed systems have emerged in the past decade as an answer to scalability and availability issues associated with strong consistency semantics, such as linearizability. However, systems offering strong consistency semantics have an advantage over systems based on weaker consistency models, as they are typically much simpler to reason about and are more intuitive to developers, exhibiting more predictable behavior. Therefore, a lot of research and development effort is being invested lately into the re-engineering of strongly consistent distributed systems, as well as into boosting their scalability and performance. This paper overviews and discusses several novel directions in the design and implementation of strongly consistent systems in industries and research domains such as cloud computing, data center networking and blockchain. It also discusses a general trend of returning to strong consistency in distributed systems, when system requirements permit so.

Food Recognition using Fusion of Classifiers based on CNNs <=SEP=> With the arrival of convolutional neural networks, the complex problem of food recognition has experienced an important improvement in recent years. The best results have been obtained using methods based on very deep convolutional ceural cetworks, which show that the deeper the model,the better the classification accuracy will be obtain. However, very deep neural networks may suffer from the overfitting problem. In this paper, we propose a combination of multiple classifiers based on different convolutional models that complement each other and thus, achieve an improvement in performance. The evaluation of our approach is done on two public datasets: Food-101 as a dataset with a wide variety of fine-grained dishes, and Food-11 as a dataset of high-level food categories, where our approach outperforms the independent CNN models.

Implementation of PID controller and pre-filter to control non-linear ball and plate system <=SEP=> In this paper, the authors try to make PID controller with Pre-filter that is implemented at ball and plate system. Ball and plate system will control the position of ball's axis in pixels value by using servo motor as its actuator and webcam as its sensor of position. PID controller with Pre-filter will have a better response than conventional PID controller. Eventhough the response of PID with Pre-filter is slower than conventional PID, the effect of Pre-filter in the system will give the less overshoot response.

Comparing a Scalable SDN Simulation Framework Built on ns-3 and DCE with Existing SDN Simulators and Emulators <=SEP=> As software-defined networking (SDN) grows beyond its original aim to simply separate the control and data network planes, it becomes useful both financially and analytically to provide adequate mechanisms for simulating this new paradigm. A number of simulation/emulation tools for modeling SDN, such as Mininet, are already available. A new, novel framework for providing SDN simulation has been provided in this work using the network simulator ns-3. The ns-3 module Direct Code Execution (DCE) allows real-world network applications to be run within a simulated network topology. This work employs DCE for running the SDN controller library POX and its applications on nodes in a simulated network topology. In this way, real-world controller applications can be completely portable between simulation and actual deployment. This work also describes a user-defined ns-3 application mimicking an SDN switch supporting OpenFlow 1.0 that can interact with real-world controllers. To evaluate its performance, this ns-3 DCE SDN framework is compared against Mininet as well as some other readily available SDN simulation/emulation tools. Metrics such as realtime performance, memory usage, and reliability in terms of packet loss are analyzed across the multiple simulation/emulation tools to gauge how they compare.

Pose optimization in edge distance field for textureless 3D object tracking <=SEP=> This paper presents a monocular model-based 3D tracking approach for textureless objects. Instead of explicitly searching for 3D-2D correspondences as previous methods, which unavoidably generates individual outlier matches, we aim to minimize the holistic distance between the predicted object contour and the query image edges. We propose a method that can directly solve 3D pose parameters in unsegmented edge distance field. We derive the differentials of edge matching distance with respect to the pose parameters, and search the optimal 3D pose parameters using standard gradient-based non-linear optimization techniques. To avoid being trapped in local minima and to deal with potential large inter-frame motions, a particle filtering process with a first order autoregressive state dynamics is exploited. Occlusions are handled by a robust estimator. The effectiveness of our approach is demonstrated using comparative experiments on real image sequences with occlusions, large motions and cluttered backgrounds.