Artificial Noise Aided Secure Cognitive Beamforming for Cooperative MISO-NOMA Using SWIPT

Cognitive radio (CR) and non-orthogonal multiple access (NOMA) have been deemed two promising technologies due to their potential to achieve high spectral efficiency and massive connectivity. This paper studies a multiple-input single-output NOMA CR network relying on simultaneous wireless information and power transfer conceived for supporting a massive population of power limited battery-driven devices. In contrast to most of the existing works, which use an ideally linear energy harvesting model, this study applies a more practical non-linear energy harvesting model. In order to improve the security of the primary network, an artificial-noise-aided cooperative jamming scheme is proposed. The artificial-noise-aided beamforming design problems are investigated subject to the practical secrecy rate and energy harvesting constraints. Specifically, the transmission power minimization problems are formulated under both perfect channel state information (CSI) and the bounded CSI error model. The problems formulated are non-convex, hence they are challenging to solve. A pair of algorithms either using semidefinite relaxation (SDR) or a cost function are proposed for solving these problems. Our simulation results show that the proposed cooperative jamming scheme succeeds in establishing secure communications and NOMA is capable of outperforming the conventional orthogonal multiple access in terms of its power efficiency. Finally, we demonstrate that the cost function algorithm outperforms the SDR-based algorithm.


Volumetric spatial transformer network for object recognition

Understanding 3D environments is a vital element of modern computer vision research due to paramount relevance in many vision systems, spanning a wide field of application scenarios from self-driving cars to autonomous robots [Qi et al. 2016]. At the present time, object recognition mainly employs two methods: volumetric CNNs [Wu Z 2015] and multi-view CNNs [Xu et al. 2015] [Xu et al. 2016]. In this paper, we propose a volumetric spatial transformer network for object recognition. It fills the gap between 3D CNN and 2D CNN for the first time, and provides an end-to-end training fashion. Given a 3D shape, the network can automatically select the best view that maximizes the accuracy of object recognition.


A framework of mobile transaction use : the user's perspective

.....................................................................................................................................II ACKNOWLEDGEMENTS .......................................................................................................... IV DEDICATION.................................................................................................................................. V TABLE OF CONTENTS .............................................................................................................. VI LIST OF FIGURES ...................................................................................................................... XII LIST OF TABLES ...................................................................................................................... XIII CHAPTER


Quranic Verse Extraction base on Concepts using OWL-DL Ontology

In recent years, there has been a global growing demand for Islamic knowledge by both Muslims and non-Muslims. This has brought about a number of automated applications that ease the retrieval of knowledge from the Holy Book, being the major source of Knowledge in Islam. However, the current retrieval methods in the Quranic domain lack adequate semantic search capabilities; they are mostly based on the keywords matching approach. There is a lack of adequate linked data to provide a better description of concepts found in the Holy Quran. In this study we propose an Ontology assisted semantic search system in the Qur’an domain. The system makes use of Quran ontology and various relationships and restrictions. This will enable the user to semantically search for verses related to their query in Al-Quran. The system has improved the search capability of the Holy Quran knowledge to 95 percent accuracy level.


Outline for a Logical Theory of Adaptive Systems

The purpose of this paper is to outline a theory of automata appropriate to the properties, requirements and questions of adaptation. The conditions that such a theory should satisfy come from not one but several fields: It should be possible to formulate, at least in an abstract version, some of the key hypotheses and problems from relevant parts of biology, particularly the areas concerned with molecular control and neurophysiology. The work in theoretical genetics initiated by R. A. Fisher [5] and Sewall Wright [24] should find a natural place in the theory. At the same time the rigorous methods of automata theory should be brought to bear (particularly those parts concerned with growing automata [1, 2, 3, 7, 8, 12, 15, 18, 23]). Finally the theory should include among its models abstract counterparts of artificial adaptive systems currently being studied, systems such as Newell-Shaw-Simon's "General Problem Solver" [13], Selfridge's "Pandemonium" [17], von Neumann's self-reproducing automata [22] and Turing's morphogenetic systems [19, 20]. The theory outlined here (which is intended as a theory and not the theory) is presented in four main parts. Section 2 discusses the study of adaptation via generation procedures and generated populations. Section 3 defines a continuum of generation procedures realizable in a reasonably direct fashion. Section 4 discusses the realization of generation procedures as populations of interacting programs in an iterative circuit computer. Section 5 discusses the process of adaptation in the context of the earlier sections. The paper concludes with a discussion of the nature of the theorems of this theory. Before entering upon the detailed discussion, one general feature of the theory should be noted. The interpretations or models of the theory divide into two broad categories: "complete" models and "incomplete" models. The "complete" models comprise the artificial systems--systems with properties and specifications completely delimited at the outset (cf. the rules of a game). One set of "complete" models for the theory consists of various programmed parallel computers. The "incomplete" models encompass natural systems. Any natural system involves an unlimited number of factors and, inevitably, the theory can handle only a selected few of these. Because there will always be variables which do not have explicit counterparts in the theory, the derived statements must be approximate relative to natural systems. For this reason it helps greatly that


Maximum Power Point Tracking Scheme for PV Systems Operating Under Partially Shaded Conditions

Current-voltage and power-voltage characteristics of large photovoltaic (PV) arrays under partially shaded conditions are characterized by multiple steps and peaks. This makes the tracking of the actual maximum power point (MPP) [global peak (GP)] a difficult task. In addition, most of the existing schemes are unable to extract maximum power from the PV array under these conditions. This paper proposes a novel algorithm to track the global power peak under partially shaded conditions. The formulation of the algorithm is based on several critical observations made out of an extensive study of the PV characteristics and the behavior of the global and local peaks under partially shaded conditions. The proposed algorithm works in conjunction with a DC-DC converter to track the GP. In order to accelerate the tracking speed, a feedforward control scheme for operating the DC-DC converter is also proposed, which uses the reference voltage information from the tracking algorithm to shift the operation toward the MPP. The tracking time with this controller is about one-tenth as compared to a conventional controller. All the observations and conclusions, including simulation and experimental results, are presented.


A Particle Swarm Optimization-Based Maximum Power Point Tracking Algorithm for PV Systems Operating Under Partially Shaded Conditions

A photovoltaic (PV) generation system (PGS) is becoming increasingly important as renewable energy sources due to its advantages such as absence of fuel cost, low maintenance requirement, and environmental friendliness. For large PGS, the probability for partially shaded condition (PSC) to occur is also high. Under PSC, the P-V curve of PGS exhibits multiple peaks, which reduces the effectiveness of conventional maximum power point tracking (MPPT) methods. In this paper, a particle swarm optimization (PSO)-based MPPT algorithm for PGS operating under PSC is proposed. The standard version of PSO is modified to meet the practical consideration of PGS operating under PSC. The problem formulation, design procedure, and parameter setting method which takes the hardware limitation into account are described and explained in detail. The proposed method boasts the advantages such as easy to implement, system-independent, and high tracking efficiency. To validate the correctness of the proposed method, simulation, and experimental results of a 500-W PGS will also be provided to demonstrate the effectiveness of the proposed technique.


Adolescent thriving: the role of sparks, relationships, and empowerment.

Although most social science research on adolescence emphasizes risks and challenges, an emergent field of study focuses on adolescent thriving. The current study extends this line of inquiry by examining the additive power of identifying and nurturing young people's "sparks," giving them "voice," and providing the relationships and opportunities that reinforce and nourish thriving. A national sample of 1,817 adolescents, all age 15 (49% female), and including 56% white, 17% Hispanic/Latino, and 17% African-American adolescents, completed an online survey that investigated their deep passions or interests (their "sparks"), the opportunities and relationships they have to support pursuing those sparks, and how empowered they feel to make civic contributions (their "voice"). Results consistently supported the hypothesis that linking one's spark with a sense of voice and supportive opportunities and relationships strengthens concurrent outcomes, particularly those reflecting prosociality, during a key developmental transition period. The three developmental strengths also predicted most outcomes to a greater degree than did demographics. However, less than 10 percent of 15-year-olds reported experiencing high levels of all three strengths. The results demonstrate the value of focusing on thriving in adolescence, both to reframe our understanding of this age group and to highlight the urgency of providing adolescents the opportunities and relationships they need to thrive.


Large-Scale Multiclass Support Vector Machine Training via Euclidean Projection onto the Simplex

Dual decomposition methods are the current state-of-the-art for training multiclass formulations of Support Vector Machines (SVMs). At every iteration, dual decomposition methods update a small subset of dual variables by solving a restricted optimization problem. In this paper, we propose an exact and efficient method for solving the restricted problem. In our method, the restricted problem is reduced to the well-known problem of Euclidean projection onto the positive simplex, which we can solve exactly in expected O(k) time, where k is the number of classes. We demonstrate that our method empirically achieves state-of-the-art convergence on several large-scale high-dimensional datasets.


The Foreign Language Effect on Moral Judgment: The Role of Emotions and Norms

We investigated whether and why the use of a foreign language influences moral judgment. We studied the trolley and footbridge dilemmas, which propose an action that involves killing one individual to save five. In line with prior work, the use of a foreign language increased the endorsement of such consequentialist actions for the footbridge dilemma, but not for the trolley dilemma. But contrary to recent theorizing, this effect was not driven by an attenuation of emotions. An attenuation of emotions was found in both dilemmas, and it did not mediate the foreign language effect on moral judgment. An examination of additional scenarios revealed that foreign language influenced moral judgment when the proposed action involved a social or moral norm violation. We propose that foreign language influences moral judgment by reducing access to normative knowledge.


Confidence intervals for the overall effect size in random-effects meta-analysis.

One of the main objectives in meta-analysis is to estimate the overall effect size by calculating a confidence interval (CI). The usual procedure consists of assuming a standard normal distribution and a sampling variance defined as the inverse of the sum of the estimated weights of the effect sizes. But this procedure does not take into account the uncertainty due to the fact that the heterogeneity variance (tau2) and the within-study variances have to be estimated, leading to CIs that are too narrow with the consequence that the actual coverage probability is smaller than the nominal confidence level. In this article, the performances of 3 alternatives to the standard CI procedure are examined under a random-effects model and 8 different tau2 estimators to estimate the weights: the t distribution CI, the weighted variance CI (with an improved variance), and the quantile approximation method (recently proposed). The results of a Monte Carlo simulation showed that the weighted variance CI outperformed the other methods regardless of the tau2 estimator, the value of tau2, the number of studies, and the sample size.


Automated leukemia detection in blood microscopic images using statistical texture analysis

Pathological image analysis plays a significant role in effective disease diagnostics. Quantitative microscopy has supplemented clinicians with accurate results for diagnosis of dreaded diseases such as leukemia, hepatitis, AIDS, psoriasis. In this paper we present a texture based approach for automated leukemia detection. Acute lymphocytic leukemia (ALL) is a malignant disease characterized by the accumulation of lymphoblast in the bone marrow. Texture features of the blood nucleus are investigated for diagnostic prediction of ALL. Other shape features are also extracted to classify a lymphocytic cell in the blood image into normal lymphocyte or lymphoblast (blasts). Initial segmentation is done using K-means clustering which segregates leukocytes or white blood cells (WBC) from other blood components i.e. erythrocytes and platelets. The results of K-means are used for evaluating individual cell shape, texture and other features for final detection of leukemia. A total of 108 blood smear images were considered for feature extraction and final performance evaluation is validated with the results of a hematologist.


Self-Assembling Machine

This letter describes dynamic self-assembly of two-component rotors floating at the interface between liquid and air into simple, reconfigurable mechanical systems ~‘‘machines’’!. The rotors are powered by an external, rotating magnetic field, and their positions within the interface are controlled by:~i! repulsive hydrodynamic interactions between them and ~ii ! by localized magnetic fields produced by an array of small electromagnets located below the plane of the interface. The mechanical functions of the machines depend on the spatiotemporal sequence of activation of the electromagnets. ©2004 American Institute of Physics. @DOI: 10.1063/1.1664019 #


Detection of cancer tumors in mammography images using support vector machine and mixed gravitational search algorithm

In this paper, support vector machine (SVM) and mixed gravitational search algorithm (MGSA) are utilized to detect the breast cancer tumors in mammography images. Sech template matching method is used to segment images and extract the regions of interest (ROIs). Gray-level co-occurrence matrix (GLCM) is used to extract features. The mixed GSA is used for optimization of the classifier parameters and selecting salient features. The main goal of using MGSA-SVM is to decrease the number of features and to improve the SVM classification accuracy. Finally, the selected features and the tuned SVM classifier are used for detecting tumors. The experimental results show that the proposed method is able to optimize both feature selection and the SVM parameters for the breast cancer tumor detection.


Machine Learning for Vehicular Networks

The emerging vehicular networks are expected to make everyday vehicular operation safer, greener, and more efficient, and pave the path to autonomous driving in the advent of the fifth generation (5G) cellular system. Machine learning, as a major branch of artificial intelligence, has been recently applied to wireless networks to provide a data-driven approach to solve traditionally challenging problems. In this article, we review recent advances in applying machine learning in vehicular networks and attempt to bring more attention to this emerging area. After a brief overview of the major concepts of machine learning, we present some application examples of machine learning in solving problems arising in vehicular networks. We finally discuss and highlight several open issues that warrant further research.


Mining Graphs for Understanding Time-Varying Volumetric Data

A notable recent trend in time-varying volumetric data analysis and visualization is to extract data relationships and represent them in a low-dimensional abstract graph view for visual understanding and making connections to the underlying data. Nevertheless, the ever-growing size and complexity of data demands novel techniques that go beyond standard brushing and linking to allow significant reduction of cognition overhead and interaction cost. In this paper, we present a mining approach that automatically extracts meaningful features from a graph-based representation for exploring time-varying volumetric data. This is achieved through the utilization of a series of graph analysis techniques including graph simplification, community detection, and visual recommendation. We investigate the most important transition relationships for time-varying data and evaluate our solution with several time-varying data sets of different sizes and characteristics. For gaining insights from the data, we show that our solution is more efficient and effective than simply asking users to extract relationships via standard interaction techniques, especially when the data set is large and the relationships are complex. We also collect expert feedback to confirm the usefulness of our approach.


Human iris recognition in post-mortem subjects: Study and database

This paper presents a unique study of post-mortem human iris recognition and the first known to us database of near-infrared and visible-light iris images of deceased humans collected up to almost 17 days after death. We used four different iris recognition methods to analyze the dynamics of iris quality decay in short-term comparisons (samples collected up to 60 hours after death) and long-term comparisons (for samples acquired up to 407 hours after demise). This study shows that post-mortem iris recognition is possible and occasionally works even 17 days after death. These conclusions contradict a promulgated rumor that iris is unusable shortly after decease. We make this dataset publicly available to let others verify our findings and to research new aspects of this important and unfamiliar topic. We are not aware of any earlier papers offering post-mortem human iris images and such comprehensive analysis employing four different matchers.


Performance analysis of visualmarkers for indoor navigation systems

The massive diffusion of smartphones, the growing interest in wearable devices and the Internet of Things, and the exponential rise of location based services (LBSs) have made the problem of localization and navigation inside buildings one of the most important technological challenges of recent years. Indoor positioning systems have a huge market in the retail sector and contextual advertising; in addition, they can be fundamental to increasing the quality of life for citizens if deployed inside public buildings such as hospitals, airports, and museums. Sometimes, in emergency situations, they can make the difference between life and death. Various approaches have been proposed in the literature. Recently, thanks to the high performance of smartphones’ cameras, marker-less and marker-based computer vision approaches have been investigated. In a previous paper, we proposed a technique for indoor localization and navigation using both Bluetooth low energy (BLE) and a 2D visual marker system deployed into the floor. In this paper, we presented a qualitative performance evaluation of three 2D visual markers, Vuforia, ArUco marker, and AprilTag, which are suitable for real-time applications. Our analysis focused on specific case study of visual markers placed onto the tiles, to improve the efficiency of our indoor localization and navigation approach by choosing the best visual marker system.


An Investigation into Neural Net Optimization via Hessian Eigenvalue Density

To understand the dynamics of optimization in deep neural networks, we develop a tool to study the evolution of the entire Hessian spectrum throughout the optimization process. Using this, we study a number of hypotheses concerning smoothness, curvature, and sharpness in the deep learning literature. We then thoroughly analyze a crucial structural feature of the spectra: in non-batch normalized networks, we observe the rapid appearance of large isolated eigenvalues in the spectrum, along with a surprising concentration of the gradient in the corresponding eigenspaces. In batch normalized networks, these two effects are almost absent. We characterize these effects, and explain how they affect optimization speed through both theory and experiments. As part of this work, we adapt advanced tools from numerical linear algebra that allow scalable and accurate estimation of the entire Hessian spectrum of ImageNet-scale neural networks; this technique may be of independent interest in other applications.


FlexiStickers: photogrammetric texture mapping using casual images

Texturing 3D models using casual images has gained importance in the last decade, with the advent of huge databases of images. We present a novel approach for performing this task, which manages to account for the 3D geometry of the photographed object. Our method overcomes the limitation of both the constrained-parameterization approach, which does not account for the photography effects, and the photogrammetric approach, which cannot handle arbitrary images. The key idea of our algorithm is to formulate the mapping estimation as a Moving-Least-Squares problem for recovering local camera parameters at each vertex. The algorithm is realized in a FlexiStickers application, which enables fast interactive texture mapping using a small number of constraints.


Monte-Carlo Tree Search in Settlers of Catan

Games are considered important benchmark tasks of artificial intelligence research. Modern strategic board games can typically be played by three or more people, which makes them suitable test beds for investigating multi-player strategic decision making. Monte-Carlo Tree Search (MCTS) is a recently published family of algorithms that achieved successful results with classical, two-player, perfect-information games such as Go. In this paper we apply MCTS to the multi-player, non-deterministic board game Settlers of Catan. We implemented an agent that is able to play against computer-controlled and human players. We show that MCTS can be adapted successfully to multi-agent environments, and present two approaches of providing the agent with a limited amount of domain knowledge. Our results show that the agent has considerable playing strength when compared to existing heuristics for the game. We conclude that MCTS is suitable for implementing a strong Settlers of Catan player.


Enduring effects for cognitive behavior therapy in the treatment of depression and anxiety.

Recent studies suggest that cognitive and behavioral interventions have enduring effects that reduce risk for subsequent symptom return following treatment termination. These enduring effects have been most clearly demonstrated with respect to depression and the anxiety disorders. It remains unclear whether these effects are a consequence of the amelioration of the causal processes that generate risk or the introduction of compensatory strategies that offset them and whether these effects reflect the mobilization of cognitive or other mechanisms. No such enduring effects have been observed for the psychoactive medications, which appear to be largely palliative in nature. Other psychosocial interventions remain largely untested, although claims that they produce lasting change have long been made. Whether such enduring effects extend to other disorders remains to be seen, but the capacity to reduce risk following treatment termination is one of the major benefits provided by the cognitive and behavioral interventions with respect to the treatment of depression and the anxiety disorders.


Analyzing and labeling telecom communities using structural properties

Social network analysis and mining has been highly influenced by the online social web sites, telecom consumer data and instant messaging systems and has widely analyzed the presence of dense communities using graph theory and machine learning techniques. Mobile social network analysis is the mapping and measuring of interactions and flows between people, groups, and organizations based on the usage of their mobile communication services. Community identification and mining is one of the recent major directions in social network analysis. In this paper we find the communities in the network based on a modularity factor. Then we propose a graph theory-based algorithm for further split of communities resulting in smaller sized and closely knit sub-units, to drill down and understand consumer behavior in a comprehensive manner. These sub-units are then analyzed and labeled based on their group behavior pattern. The analysis is done using two approaches:—rule-based, and cluster-based, for comparison and the able usage of information for suitable labeling of groups. Moreover, we measured and analyzed the uniqueness of the structural properties for each small unit; it is another quick and dynamic way to assign suitable labels for each distinct group. We have mapped the behavior-based labeling with unique structural properties of each group. It reduces considerably the time taken for processing and identifying smaller sub-communities for effective targeted marketing. The efficiency of the employed algorithms was evaluated on a large telecom dataset in three different stages of our work.


Patterns and dynamics of users' behavior and interaction: Network analysis of an online community

This research draws on longitudinal network data from an online community to examine patterns of users’ behavior and social interaction, and infer the processes underpinning dynamics of system use. The online community represents a prototypical example of a complex evolving social network in which connections between users are established over time by online messages. We study the evolution of a variety of properties since the inception of the system, including how users create, reciprocate, and deepen relationships with one another, variations in users’ gregariousness and popularity, reachability and typical distances among users, and the degree of local redundancy in the system. Results indicate that the system is a “small world”characterized by the emergence, in its early stages,of a hub-dominated structure with heterogeneity in users’ behavior. We investigate whether hubs are responsible for holding the system together and facilitating information flow, examine first-mover advantages underpinning users’ability to rise to system prominence, and uncover gender differences in users’ gregariousness, popularity, and local redundancy. We discuss the implications of the results for research on system use and evolving social networks, and for a host of applications, including information diffusion, communities of practice, and the security and robustness of information systems.


Modeling Analysis and Parameters Calculation of Permanent Magnet Linear Synchronous Motor

Permanent magnet linear synchronous motor (PMLSM) has several advantages, such as simple structure, small volume, high force, and so on. It is a research focus and difficulties in the research field of motor. Because PMLSM is different from the traditional rotary motors in structure and running state, it is difficult for to build its precise mathematical model by analytical method. The asymmetry of the three-phase winding electromagnetic and electrical parameters of open PMLSM in a low-speed working zone is impossible to take into account. In this paper, the difference between the permanent magnet linear synchronous motor and traditional motors are analyzed. And then, a non-linear, asymmetric and variable parameter space state model is built, considering the structural and running characteristics of PMLSM. The proposed model needs all kinds of parameters of PMLSM, including selfinductance, mutual inductance, flux linkage, etc. So, a finite element calculation and actual measurement of the required parameters of a prototype PMLSM are done, respectively. The influence of air-gap on the inductance parameters was analyzed.


Super High Gain Substrate Integrated Clamped-Mode Printed Log-Periodic Dipole Array Antenna

A compact, low profile, super high antenna gain, and broadband antenna, based on the printed log-periodic dipole array (PLPDA) antenna and the substrate integrated waveguide (SIW) technologies, has been proposed. It is so called substrate integrated waveguide clamped-mode printed log-periodic dipole array (SIW clamped-mode PLPDA) antenna. The arrangement of the dipole elements and feed lines in the SIW clamped-mode PLPDA antenna is designed and optimized. The proposed SIW clamped-mode PLPDA antenna was designed, fabricated, and tested, while a single SIW PLPDA antenna and a 2-element SIW PLPDA array were designed for comparison. The impedance bandwidth and the far-field radiation patterns in both E-plane and H-plane were measured. The measured results show that the performance of the SIW clamped-mode PLPDA antenna is similar to that of the 2-element SIW PLPDA array over the working frequency range 25 GHz-40 GHz, while the proposed antenna has only half the number of dipole elements and feed lines.


AN INTEGRATIVE MODEL OF ORGANIZATIONAL

Scholars in various disciplines have considered the causes, nature, and effects of trust. Prior approaches to studying trust are considered, Including characteristics of the tnistor, the trustee, and the role of risk. A definition of trust and a model of its antecedents and outcomes are presented, which integrate research from multiple disciplines and differentiate trust from similar constructs. Several research propositions based on the model are presented.


Safe Planes for Injection Rhinoplasty: A Histological Analysis of Midline Longitudinal Sections of the Asian Nose

Dorsal nasal augmentation is an essential part of injection rhinoplasty on the Asian nose. Aesthetic physicians require detailed knowledge of the nasal anatomy to accurately and safely inject filler. One hundred and thirty-five histological cross sections were examined from 45 longitudinal strips of soft tissue harvested from the midline of the nose, beginning from the glabella to the nasal tip. Muscles and nasal cartilage were used as landmarks for vascular identification. At the nasal tip, a midline longitudinal columellar artery with a diameter of 0.21 ± 0.09 mm was noted in 14 cadavers (31.1 %). At the infratip, subcutaneous tissue contained cavernous tissue similar to that of the nasal mucosa. The feeding arteries of these dilated veins formed arteriovenous shunts, into which retrograde injection of filler may be possible. All of the nasal arteries present were identified as subcutaneous arteries. They coursed mainly in the superficial layer of the subcutaneous tissues, with smaller branches forming subdermal plexuses. A substantial arterial anastomosis occurred at the supratip region, in which the artery lay in the middle of the subcutaneous tissue at the level of the major alar cartilages. These arteries had a diameter ranging between 0.4 and 0.9 mm and were found in 29 of 45 specimens (64.4 %). This was at the level midway between the rhinion above the supratip and the infratip. This anastomotic artery also crossed the midline at the rhinion superficial to the origin of the procerus on the lower end of the nasal bone. Here the arterial diameter ranged between 0.1 and 0.3 mm, which was not large enough to cause arterial emboli. Fascicular cross sections of the nasalis muscle directly covered the entire upper lateral cartilage. The subdermal tissue contained few layers of fat cells along with the occasional small artery. The procerus arose from the nasal bone and was continuous with the nasalis in 16 cadavers (35.6 %). There was fatty areolar tissue between the procerus and the periosteal layer and no significant arteries present. The procerus ascended beyond the brow to insert into the frontalis muscle with very few cutaneous insertions. The supratrochlear vessels and accompanying nerve were occasionally found on the surface of the frontalis muscle. Most nasal arteries found in the midline are subcutaneous arteries. Filler should be injected deeply to avoid vascular injury leading to compromised perfusion at the dorsum or filler emboli at the nasal tip. This journal requires that the authors assign a level of evidence to each article. For a full description of these Evidence-Based Medicine ratings, please refer to the Table of Contents or the online Instructions to Authors www.springer.com/00266 .


A Convolutional Attention Network for Extreme Summarization of Source Code

Attention mechanisms in neural networks have proved useful for problems in which the input and output do not have fixed dimension. Often there exist features that are locally translation invariant and would be valuable for directing the model’s attention, but previous attentional architectures are not constructed to learn such features specifically. We introduce an attentional neural network that employs convolution on the input tokens to detect local time-invariant and long-range topical attention features in a context-dependent way. We apply this architecture to the problem of extreme summarization of source code snippets into short, descriptive function name-like summaries. Using those features, the model sequentially generates a summary by marginalizing over two attention mechanisms: one that predicts the next summary token based on the attention weights of the input tokens and another that is able to copy a code token as-is directly into the summary. We demonstrate our convolutional attention neural network’s performance on 10 popular Java projects showing that it achieves better performance compared to previous attentional mechanisms.


'C and tcc: A Language and Compiler for Dynamic Code Generation

Dynamic code generation allows programmers to use run-time information in order to achieve performance and expressiveness superior to those of static code. The 'C(Tick C) language is a superset of ANSI C that supports efficient and high-level use of dynamic code generation. 'C provides dynamic code generation at the level of C expressions and statements and supports the composition of dynamic code at run time. These features enable programmers to add dynamic code generation to existing C code incrementally and to write important applications (such as “just-in-time” compilers) easily. The article presents many examples of how 'C can be used to solve practical problems. The tcc compiler is an efficient, portable, and freely available implementation of 'C. tcc allows programmers to trade dynamic compilation speed for dynamic code quality: in some aplications, it is most important to generate code quickly, while in others code quality matters more than compilation speed. The overhead of dynamic compilation is on the order of 100 to 600 cycles per generated instruction, depending on the level of dynamic optimizaton. Measurements show that the use of dynamic code generation can improve performance by almost an order of magnitude; two- to four-fold speedups are common. In most cases, the overhead of dynamic compilation is recovered in under 100 uses of the dynamic code; sometimes it can be recovered within one use.


The dark side of smartphone usage: Psychological traits, compulsive behavior and technostress

0747-5632/$ see front matter 2013 Elsevier Ltd. All rights reserved. http://dx.doi.org/10.1016/j.chb.2013.10.047 ⇑ Corresponding author. Address: Department of Business Management, National Sun Yat-sen University, No. 70, Lianhai Rd., Gushan District, Kaohsiung City 804, Taiwan, Tel.: +886 7 525 2000x4627. E-mail address: ctchang@faculty.nsysu.edu.tw (C.-T. Chang). Yu-Kang Lee, Chun-Tuan Chang ⇑, You Lin, Zhao-Hong Cheng


Fourier Lucas-Kanade Algorithm

In this paper, we propose a framework for both gradient descent image and object alignment in the Fourier domain. Our method centers upon the classical Lucas & Kanade (LK) algorithm where we represent the source and template/model in the complex 2D Fourier domain rather than in the spatial 2D domain. We refer to our approach as the Fourier LK (FLK) algorithm. The FLK formulation is advantageous when one preprocesses the source image and template/model with a bank of filters (e.g., oriented edges, Gabor, etc.) as 1) it can handle substantial illumination variations, 2) the inefficient preprocessing filter bank step can be subsumed within the FLK algorithm as a sparse diagonal weighting matrix, 3) unlike traditional LK, the computational cost is invariant to the number of filters and as a result is far more efficient, and 4) this approach can be extended to the Inverse Compositional (IC) form of the LK algorithm where nearly all steps (including Fourier transform and filter bank preprocessing) can be precomputed, leading to an extremely efficient and robust approach to gradient descent image matching. Further, these computational savings translate to nonrigid object alignment tasks that are considered extensions of the LK algorithm, such as those found in Active Appearance Models (AAMs).


Sensor Reduction for Driver-Automation Shared Steering Control via an Adaptive Authority Allocation Strategy

This paper presents a new shared control method for lane keeping assist (LKA) systems of intelligent vehicles. The proposed method allows the LKA system to effectively share the control authority with a human driver by avoiding or minimizing the conflict situations between these two driving actors. To realize the shared control scheme, the unpredictable driver-automation interaction is explicitly taken into account in the control design via a fictive driver activity variable. This latter is judiciously introduced into the driver–road–vehicle system to represent the driver's need for assistance in accordance with his/her real-time driving activity. Using Lyapunov stability arguments, Takagi–Sugeno fuzzy model-based design conditions are derived to handle not only the time-varying driver activity variable, but also a large variation range of vehicle speed. Both simulation and hardware experiments are presented to demonstrate that the proposed control strategy together with a linear matrix inequality design formulation provide an effective tool to deal with the challenging shared steering control issue. In particular, a fuzzy output feedback control scheme is exploited to achieve the shared control goal without at least two important vehicle sensors. These physical sensors are widely employed in previous works to measure the lateral speed and the steering rate for the control design and real-time implementation. The successful results of this idea of sensor-reduction control has an obvious interest from practical viewpoint.


Predictability, Complexity, and Learning

We define predictive information Ipred(T) as the mutual information between the past and the future of a time series. Three qualitatively different behaviors are found in the limit of large observation times T: Ipred(T) can remain finite, grow logarithmically, or grow as a fractional power law. If the time series allows us to learn a model with a finite number of parameters, then Ipred(T) grows logarithmically with a coefficient that counts the dimensionality of the model space. In contrast, power-law growth is associated, for example, with the learning of infinite parameter (or non-parametric) models such as continuous functions with smoothness constraints. There are connections between the predictive information and measures of complexity that have been defined both in learning theory and the analysis of physical systems through statistical mechanics and dynamical systems theory. Furthermore, in the same way that entropy provides the unique measure of available information consistent with some simple and plausible conditions, we argue that the divergent part of Ipred(T) provides the unique measure for the complexity of dynamics underlying a time series. Finally, we discuss how these ideas may be useful in problems in physics, statistics, and biology.


Modeling Response Time in Digital Human Communication

Our daily lives increasingly involve interactions with other individuals via different communication channels, such as email, text messaging, and social media. In this paper we focus on the problem of modeling and predicting how long it takes an individual to respond to an incoming communication event, such as receiving an email or a text. In particular, we explore the effect on response times of an individual’s temporal pattern of activity, such as circadian and weekly patterns which are typically present in individual data. A probabilistic time-warping approach is used, considering linear time to be a transformation of “effective time,” where the transformation is a function of an individual’s activity rate. We apply this transformation of time to two different types of temporal event models, the first for modeling response times directly, and the second for modeling event times via a Hawkes process. We apply our approach to two different sets of real-world email histories. The experimental results clearly indicate that the transformation-based approach produces systematically better models and predictions compared to simpler methods that ignore circadian and weekly patterns. Current technology allows us to collect large quantities of time-stamped individual-level event data characterizing our “digital behavior” in contexts such as texting, email activity, microblogging, social media interactions, and more — and the volume and variety of this type of data is continually increasing. The resulting time-series of events are rich in behavioral information about our daily lives. Tools for obtaining and visualizing such information are becoming increasingly popular, such as the ability to download your entire email history for mail applications such as Gmail, and various software packages for tracking personal fitness using data from devices such as Fitbit. This paper is focused on modeling the temporal aspects of how an individual (also referred to as the “ego”) responds to others, given a sequence of timestamped events (e.g. communication messages via email or text). What can we learn from the way we respond to others? Are there systematic ∗Currently employed at Google. The research described in this paper was conducted while the author was a graduate student at UC Irvine. Copyright c © 2015, Association for the Advancement of Artificial Intelligence (www.aaai.org). All rights reserved. Mon Tue Wed Thu Fri Sat Sun 0 1 a (t ) Mon Tue Wed Thu Fri Sat Sun 0 1 a (t ) Figure 1: Example of smoothed daily and weekly patterns over two separate individuals’ email histories. a(t) on the yaxis represents an individual’s typical activity as a function of time. patterns that can be extracted and used predictively? How do our daily sleep and work patterns factor in to our response patterns? These are common issues that arise when modeling communication events, as the ego’s behavior typically changes significantly over the course of a day or week. Examples of such patterns are shown in Figure 1. We propose a novel method for parameterizing these circadian (daily) and weekly patterns, allowing the time dimension to be transformed according to such patterns. This transformation of time will allow models to describe and predict behavioral patterns which are invariant to the ego’s routine patterns. We apply this approach to predicting the ego’s response time to an event. Learning such response patterns is useful not only for identifying relationships between pairs of individuals (Halpin and De Boeck 2013), but also as features for prioritization of events, e.g., the priority inbox implemented in Gmail (Aberdeen, Pacovsky, and Slater 2010). Our experimental results show clear advantages in terms of predictive power when modeling response times in the transformed time domain. τ0 τ1 τ2 t0 t1 t2 ∆0


An empirical investigation of mobile ticketing service adoption in public transportation

In this paper, we present results from a study of mobile ticketing service adoption in public transportation. The theoretical background of the study is based on technology adoption and trust theories, which are augmented with concepts of mobile use context and mobility. Our empirical findings from analyses of a survey data suggest that compatibility of the mobile ticketing service with consumer behavior is a major determinant of adoption. Mobility and contextual factors, including budget constraints, availability of other alternatives, and time pressure in the service use situation were also found to have a strong effect on the adoption decision. Our findings suggest that contextual and mobile service-specific features are important determinants of mobile service adoption and should thus be integrated into the traditional adoption models.


The obstacle-restriction method for robot obstacle avoidance in difficult environments

This paper addresses the obstacle avoidance problem in difficult scenarios that usually are dense, complex and cluttered. The proposal is a method called the obstacle-restriction. At each iteration of the control cycle, this method addresses the obstacle avoidance in two steps. First there is procedure to compute instantaneous subgoals in the obstacle structure (obtained by the sensors). The second step associates a motion restriction to each obstacle, which are managed next to compute the most promising motion direction. The advantage of this technique is that it avoids common limitations of previous obstacle avoidance methods, improving their navigation performance in difficult scenarios. Furthermore, we obtain similar results to the recent methods that achieve navigation in troublesome scenarios. However, the new method improves their behavior in open spaces. The performance of this method is illustrated with experimental results obtained with a robotic wheelchair vehicle.


Perceived aggressiveness predicts fighting performance in mixed-martial-arts fighters.

Accurate assessment of competitive ability is a critical component of contest behavior in animals, and it could be just as important in human competition, particularly in human ancestral populations. Here, we tested the role that facial perception plays in this assessment by investigating the association between both perceived aggressiveness and perceived fighting ability in fighters' faces and their actual fighting success. Perceived aggressiveness was positively associated with the proportion of fights won, after we controlled for the effect of weight, which also independently predicted perceived aggression. In contrast, perception of fighting ability was confounded by weight, and an association between perceived fighting ability and actual fighting success was restricted to heavyweight fighters. Shape regressions revealed that aggressive-looking faces are generally wider and have a broader chin, more prominent eyebrows, and a larger nose than less aggressive-looking faces. Our results indicate that perception of aggressiveness and fighting ability might cue different aspects of success in male-male physical confrontation.


Positive psychology : Past , present , and ( possible ) future

What is positive psychology? Where has it come from? Where is it going? These are the questions we address in this article. In defining positive psychology, we distinguish between the meta-psychological level, where the aim of positive psychology is to redress the imbalance in psychology research and practice, and the pragmatic level, which is concerned with what positive psychologists do, in terms of their research, practice, and areas of interest. These distinctions in how we understand positive psychology are then used to shape conceptions of possible futures for positive psychology. In conclusion, we identify several pertinent issues for the consideration of positive psychology as it moves forward. These include the need to synthesize the positive and negative, build on its historical antecedents, integrate across levels of analysis, build constituency with powerful stakeholders, and be aware of the implications of description versus prescription.


Design and Optimization of Printed Spiral Coils for Efficient Transcutaneous Inductive Power Transmission

The next generation of implantable high-power neuroprosthetic devices such as visual prostheses and brain computer interfaces are going to be powered by transcutaneous inductive power links formed between a pair of printed spiral coils (PSC) that are batch-fabricated using micromachining technology. Optimizing the power efficiency of the wireless link is imperative to minimize the size of the external energy source, heating dissipation in the tissue, and interference with other devices. Previous design methodologies for coils made of 1-D filaments are not comprehensive and accurate enough to consider all geometrical aspects of PSCs with planar 3-D conductors as well as design constraints imposed by implantable device application and fabrication technology. We have outlined the theoretical foundation of optimal power transmission efficiency in an inductive link, and combined it with semi-empirical models to predict parasitic components in PSCs. We have used this foundation to devise an iterative PSC design methodology that starts with a set of realistic design constraints and ends with the optimal PSC pair geometries. We have executed this procedure on two design examples at 1 and 5 MHz achieving power transmission efficiencies of 41.2% and 85.8%, respectively, at 10-mm spacing. All results are verified with simulations using a commercial field solver (HFSS) as well as measurements using PSCs fabricated on printed circuit boards.


Mapping distributed brain function and networks with diffuse optical tomography.

Mapping of human brain function has revolutionized systems neuroscience. However, traditional functional neuroimaging by positron emission tomography or functional magnetic resonance imaging cannot be used when applications require portability, or are contraindicated because of ionizing radiation (positron emission tomography) or implanted metal (functional magnetic resonance imaging). Optical neuroimaging offers a non-invasive alternative that is radiation free and compatible with implanted metal and electronic devices (for example, pacemakers). However, optical imaging technology has heretofore lacked the combination of spatial resolution and wide field of view sufficient to map distributed brain functions. Here, we present a high-density diffuse optical tomography imaging array that can map higher-order, distributed brain function. The system was tested by imaging four hierarchical language tasks and multiple resting-state networks including the dorsal attention and default mode networks. Finally, we imaged brain function in patients with Parkinson's disease and implanted deep brain stimulators that preclude functional magnetic resonance imaging.


On the Performance of Intel SGX

As cloud computing is widely used in various fields, more and more individuals and organizations are considering outsourcing data to the public cloud. However, the security of the cloud data has become the most prominent concern of many customers, especially those who possess a large volume of valuable and sensitive data. Although some technologies like Homomorphic Encryption were proposed to solve the problem of secure data, the result is still not satisfying. With the advent of Intel SGX processor, which aims to thoroughly eliminate the security concern of cloud environment in a hardware-assisted approach, it brings us a number of questions on its features and its practicability for the current cloud platform. To evaluate the potential impact of Intel SGX, we analyzed the current SGX programming mode and inferred some possible factors that may arise the overhead. To verify our performance hypothesis, we conducted a systematic study on SGX performance by a series of benchmark experiments. After analyzing the experiment result, we performed a workload characterization to help programmer better exploit the current availability of Intel SGX and identify feasible research directions.


A Generative Modeling Approach to Limited Channel ECG Classification

Processing temporal sequences is central to a variety of applications in health care, and in particular multichannel Electrocardiogram (ECG) is a highly prevalent diagnostic modality that relies on robust sequence modeling. While Recurrent Neural Networks (RNNs) have led to significant advances in automated diagnosis with time-series data, they perform poorly when models are trained using a limited set of channels. A crucial limitation of existing solutions is that they rely solely on discriminative models, which tend to generalize poorly in such scenarios. In order to combat this limitation, we develop a generative modeling approach to limited channel ECG classification. This approach first uses a Seq2Seq model to implicitly generate the missing channel information, and then uses the latent representation to perform the actual supervisory task. This decoupling enables the use of unsupervised data and also provides highly robust metric spaces for subsequent discriminative learning. Our experiments with the Physionet dataset clearly evidence the effectiveness of our approach over standard RNNs in disease prediction.


A Boosted Bayesian Multiresolution Classifier for Prostate Cancer Detection From Digitized Needle Biopsies

Diagnosis of prostate cancer (CaP) currently involves examining tissue samples for CaP presence and extent via a microscope, a time-consuming and subjective process. With the advent of digital pathology, computer-aided algorithms can now be applied to disease detection on digitized glass slides. The size of these digitized histology images (hundreds of millions of pixels) presents a formidable challenge for any computerized image analysis program. In this paper, we present a boosted Bayesian multiresolution (BBMR) system to identify regions of CaP on digital biopsy slides. Such a system would serve as an important preceding step to a Gleason grading algorithm, where the objective would be to score the invasiveness and severity of the disease. In the first step, our algorithm decomposes the whole-slide image into an image pyramid comprising multiple resolution levels. Regions identified as cancer via a Bayesian classifier at lower resolution levels are subsequently examined in greater detail at higher resolution levels, thereby allowing for rapid and efficient analysis of large images. At each resolution level, ten image features are chosen from a pool of over 900 first-order statistical, second-order co-occurrence, and Gabor filter features using an AdaBoost ensemble method. The BBMR scheme, operating on 100 images obtained from 58 patients, yielded: 1) areas under the receiver operating characteristic curve (AUC) of 0.84, 0.83, and 0.76, respectively, at the lowest, intermediate, and highest resolution levels and 2) an eightfold savings in terms of computational time compared to running the algorithm directly at full (highest) resolution. The BBMR model outperformed (in terms of AUC): 1) individual features (no ensemble) and 2) a random forest classifier ensemble obtained by bagging multiple decision tree classifiers. The apparent drop-off in AUC at higher image resolutions is due to lack of fine detail in the expert annotation of CaP and is not an artifact of the classifier. The implicit feature selection done via the AdaBoost component of the BBMR classifier reveals that different classes and types of image features become more relevant for discriminating between CaP and benign areas at different image resolutions.


Innovation and practice of continuous auditing

Article history: Received 27 August 2010 Received in revised form 23 December 2010 Accepted 6 January 2011 The traditional audit paradigm is outdated in the real time economy. Innovation of the traditional audit process is necessary to support real time assurance. Practitioners and academics are exploring continuous auditing as a potential successor to the traditional audit paradigm. Using technology and automation, continuous auditing methodology enhances the efficiency and effectiveness of the audit process to support real time assurance. This paper defines how continuous auditing methodology introduces innovation to practice in seven dimensions and proposes a four-stage paradigm to advance future research. In addition, we formulate a set of methodological propositions concerning the future of assurance for practitioners and academic researchers. © 2011 Elsevier Inc. All rights reserved.


Severity Analyses of Single-Vehicle Crashes Based on Rough Set Theory

A single-vehicle crash is a typical pattern of traffic accidents and tends to cause heavy loss. The purpose of this study is to identify the factors significantly influencing single-vehicle crash injury severity, using a data selected from Beijing city for a 4-year period. Rough set theory was applied to complete the injury severity analysis, and followed by applying cross-validation method to estimate the prediction accuracy of extraction rules. Results show that it is effective for analyzing the severity of Single-vehicle crashes with rough set theory.


Galvanometric optical laser beam steering system for microfactory application

This article presents a kinematic model and control of a galvanometric laser beam steering system for high precision marking, welding or soldering applications as a microfactory module. Galvo systems are capable of scanning laser beam with relatively high frequencies that makes them suitable for fast processing applications. For the sake of flexibility and ease of use 2D reference shapes to be processed are provided as CAD drawings. Drawings are parsed and interpolated to x - y reference data points on MATLAB then stored as arrays in C code. C header file is further included as reference data points to be used by the system. Theoretical kinematic model of the system is derived and model parameters are tuned for practical implementation and validated with respect to measured positions on rotation space with optical position sensor and image field with position sensitive device. Machining with material removal requires high power laser to be employed that makes position measurement on image field unfeasible. Therefore for closed loop applications optical position sensor embedded in galvo motors is used for position feedback. Since the model approved to be approximately linear in the range of interest by simulations, a PI controller is used for precise positioning of the galvo motors. Experimental results for tracking circular and rectangular shape references are proved to be precise with errors of less than 2%.


Local potassium signaling couples neuronal activity to vasodilation in the brain

The mechanisms by which active neurons, via astrocytes, rapidly signal intracerebral arterioles to dilate remain obscure. Here we show that modest elevation of extracellular potassium (K+) activated inward rectifier K+ (Kir) channels and caused membrane potential hyperpolarization in smooth muscle cells (SMCs) of intracerebral arterioles and, in cortical brain slices, induced Kir-dependent vasodilation and suppression of SMC intracellular calcium (Ca2+) oscillations. Neuronal activation induced a rapid (<2 s latency) vasodilation that was greatly reduced by Kir channel blockade and completely abrogated by concurrent cyclooxygenase inhibition. Astrocytic endfeet exhibited large-conductance, Ca2+-sensitive K+ (BK) channel currents that could be activated by neuronal stimulation. Blocking BK channels or ablating the gene encoding these channels prevented neuronally induced vasodilation and suppression of arteriolar SMC Ca2+, without affecting the astrocytic Ca2+ elevation. These results support the concept of intercellular K+ channel–to–K+ channel signaling, through which neuronal activity in the form of an astrocytic Ca2+ signal is decoded by astrocytic BK channels, which locally release K+ into the perivascular space to activate SMC Kir channels and cause vasodilation.


Winnowing: Local Algorithms for Document Fingerprinting

Digital content is for copying: quotation, revision, plagiarism, and file sharing all create copies. Document fingerprinting is concerned with accurately identifying copying, including small partial copies, within large sets of documents.We introduce the class of local document fingerprinting algorithms, which seems to capture an essential property of any finger-printing technique guaranteed to detect copies. We prove a novel lower bound on the performance of any local algorithm. We also develop winnowing, an efficient local fingerprinting algorithm, and show that winnowing's performance is within 33% of the lower bound. Finally, we also give experimental results on Web data, and report experience with MOSS, a widely-used plagiarism detection service.


Analysis of Metastability Errors in Conventional, LSB-First, and Asynchronous SAR ADCs

A practical model for characterizing comparator metastability errors in SAR ADCs is presented, and is used to analyze not only the conventional SAR but also LSB-first and asynchronous versions. This work makes three main contributions: first, it is shown that for characterizing metastability it is more reasonable to use input signals with normal or Laplace distributions. Previous work used uniformly-distributed signals in the interest of making derivations easier, but this simplifying assumption overestimated SMR by as much as 18 dB compared to the more reasonable analysis presented here. Second, this work shows that LSB-first SAR ADCs achieve SMR performance equal to or better than conventional SARs with the same metastability window, depending on bandwidth. Finally, the analysis is used to develop a framework for calculating the maximum effective sample rate for asynchronous SAR ADCs, and in doing so demonstrates that proximity detectors are not effective solutions to improving metastability performance.


PixelNet: Representation of the pixels, by the pixels, and for the pixels

We explore design principles for general pixel-level prediction problems, from low-level edge detection to midlevel surface normal estimation to high-level semantic segmentation. Convolutional predictors, such as the fullyconvolutional network (FCN), have achieved remarkable success by exploiting the spatial redundancy of neighboring pixels through convolutional processing. Though computationally efficient, we point out that such approaches are not statistically efficient during learning precisely because spatial redundancy limits the information learned from neighboring pixels. We demonstrate that stratified sampling of pixels allows one to (1) add diversity during batch updates, speeding up learning; (2) explore complex nonlinear predictors, improving accuracy; and (3) efficiently train state-of-the-art models tabula rasa (i.e., “from scratch”) for diverse pixel-labeling tasks. Our single architecture produces state-of-the-art results for semantic segmentation on PASCAL-Context dataset, surface normal estimation on NYUDv2 depth dataset, and edge detection on BSDS.


Culture Wires the Brain: A Cognitive Neuroscience Perspective.

There is clear evidence that sustained experiences may affect both brain structure and function. Thus, it is quite reasonable to posit that sustained exposure to a set of cultural experiences and behavioral practices will affect neural structure and function. The burgeoning field of cultural psychology has often demonstrated the subtle differences in the way individuals process information-differences that appear to be a product of cultural experiences. We review evidence that the collectivistic and individualistic biases of East Asian and Western cultures, respectively, affect neural structure and function. We conclude that there is limited evidence that cultural experiences affect brain structure and considerably more evidence that neural function is affected by culture, particularly activations in ventral visual cortex-areas associated with perceptual processing.


Passive Self-Interference Suppression for Full-Duplex Infrastructure Nodes

Recent research results have demonstrated the feasibility of full-duplex wireless communication for short-range links. Although the focus of the previous works has been active cancellation of the self-interference signal, a majority of the overall self-interference suppression is often due to passive suppression, i.e., isolation of the transmit and receive antennas. We present a measurement-based study of the capabilities and limitations of three key mechanisms for passive self-interference suppression: directional isolation, absorptive shielding, and cross-polarization. The study demonstrates that more than 70 dB of passive suppression can be achieved in certain environments, but also establishes two results on the limitations of passive suppression: (1) environmental reflections limit the amount of passive suppression that can be achieved, and (2) passive suppression, in general, increases the frequency selectivity of the residual self-interference signal. These results suggest two design implications: (1) deployments of full-duplex infrastructure nodes should minimize near-antenna reflectors, and (2) active cancellation in concatenation with passive suppression should employ higher-order filters or per-subcarrier cancellation.


System-level performance evaluation of downlink non-orthogonal multiple access (NOMA)

As a promising downlink multiple access scheme for further LTE enhancement and future radio access (FRA), this paper investigates the system-level performance of non-orthogonal multiple access (NOMA) with a successive interference canceller (SIC) on the receiver side. The goal is to clarify the potential gains of NOMA over orthogonal multiple access (OMA) such as OFDMA, taking into account key link adaptation functionalities of the LTE radio interface such as adaptive modulation and coding (AMC), hybrid automatic repeat request (HARQ), time/frequency-domain scheduling, and outer loop link adaptation (OLLA), in addition to NOMA specific functionalities such as dynamic multi-user power allocation. Based on computer simulations, we show under multiple configurations that the system-level performance achieved by NOMA is superior to that for OMA.


Non-Orthogonal Multiple Access With Cooperative Full-Duplex Relaying

We propose a full-duplex (FD) cooperative non-orthogonal multiple access (NOMA) system with dual users, where a dedicated FD relay assists the information transmission to the user with weak channel condition. Under the realistic assumption of imperfect self-interference cancellation, the achievable outage probability of both users and ergodic sum capacity are investigated, and exact analytical expressions are derived. Simulation results demonstrate that the proposed FD cooperative NOMA system attains better performance than the half-duplex cooperative NOMA system in the moderate signal-to-noise ratio regime.


An Analysis of Several Heuristics for the Traveling Salesman Problem

Several polynomial time algorithms finding "good," but not necessarily optimal, tours for the traveling salesman problem are considered. We measure the closeness of a tour by the ratio of the obtained tour length to the minimal tour length. For the nearest neighbor method, we show the ratio is bounded above by a logarithmic function of the number of nodes. We also provide a logarithmic lower bound on the worst case. A class of approximation methods we call insertion methods are studied, and these are also shown to have a logarithmic upper bound. For two specific insertion methods, which we call nearest insertion and cheapest insertion, the ratio is shown to have a constant upper bound of 2, and examples are provided that come arbitrarily close to this upper bound. It is also shown that for any n => 8, there are traveling salesman problems with n nodes having tours which cannot be improved by making n/4 edge changes, but for which the ratio is 2(1l/n). Key words, traveling salesman problem, approximation algorithm, k-optimal, minimal spanning tree, triangle inequality


A survey of vertical handover decision algorithms in Fourth Generation heterogeneous wireless networks

1389-1286/$ see front matter 2010 Elsevier B.V doi:10.1016/j.comnet.2010.02.006 * Corresponding author. Tel.: +61 3 99053503; fa E-mail address: ASekerci@ieee.org (Y. Ahmet S ek Vertical handover decision (VHD) algorithms are essential components of the architecture of the forthcoming Fourth Generation (4G) heterogeneous wireless networks. These algorithms need to be designed to provide the required Quality of Service (QoS) to a wide range of applications while allowing seamless roaming among a multitude of access network technologies. In this paper, we present a comprehensive survey of the VHD algorithms designed to satisfy these requirements. To offer a systematic comparison, we categorize the algorithms into four groups based on the main handover decision criterion used. Also, to evaluate tradeoffs between their complexity of implementation and efficiency, we discuss three representative VHD algorithms in each group. 2010 Elsevier B.V. All rights reserved.


Animal Navigation: Path Integration, Visual Landmarks and Cognitive Maps

Animals typically have several navigational strategies available to them. Interactions between these strategies can reduce navigational errors and may lead to the emergence of new capacities.


A Survey of Model Comparison Approaches and Applications

This survey paper presents the current state of model comparison as it applies to Model-Driven Engineering. We look specifically at how model matching is accomplished, the application of the approaches, and the types of models that approaches are intended to work with. Our paper also indicates future trends and directions. We find that many of the latest model comparison techniques are geared towards facilitating arbitrary meta models and use similarity-based matching. Thus far, model versioning is the most prevalent application of model comparison. Recently, however, work on comparison for versioning has begun to stagnate, giving way to other applications. Lastly, there is wide variance among the tools in the amount of user effort required to perform model comparison, as some require more effort to facilitate more generality and expressive power.


A topological hierarchy for functions on triangulated surfaces

We combine topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by cancelling pairs of critical points. Based on a simple notion of dependency among these cancellations, we construct a hierarchical data structure supporting traversal and reconstruction operations similarly to traditional geometry-based representations. We use this data structure to extract topologically valid approximations that satisfy error bounds provided at runtime.


CampusSense — A smart vehicle parking monitoring and management system using ANPR cameras and android phones

Vehicle parking monitoring and management has become a big challenge for educational institutions with increasing enrollments, high percentage of vehicle ownership and decreasing parking supply which in result triggering blockage of vehicle, congestion, wastage of time and money. In university campuses particularly in Kingdom of Saudi Arabia, vehicle parking monitoring and management problem is getting worse and more frustrating due to the fact that majority of students, faculty and staff members own cars and drive through them to the university campuses. These common problems include finding out people (evidence) who are responsible for the damages (hitting, scraping, scratching and dents) to other cars and the blockage of car due to wrong car parking which takes much time to locate the owner of the car. Moreover, locating or forgetting their car park location another difficulty that is often faced by the students, faculty and staff members. The existing cameras located at the parking lots are only for video surveillance and cannot help in such situations as there is a lack of proper vehicle parking monitoring and management system. To cope with above mentioned problems and to ensure a better parking experience by accommodating increasing number of vehicles in a proper convenient manner, we propose a smart vehicle parking monitoring and management system called CampusSense. In CampusSense, Automatic Number Plate Recognition (ANPR) cameras and android based mobile application is developed to efficiently monitor, manage and protect the parking facilities at university campuses. Parking problems around the university campus faced by the students, faculty and staff members are analyzed by conducting a survey.


Angry, disgusted, or afraid? Studies on the malleability of emotion perception.

Current theories of emotion perception posit that basic facial expressions signal categorically discrete emotions or affective dimensions of valence and arousal. In both cases, the information is thought to be directly "read out" from the face in a way that is largely immune to context. In contrast, the three studies reported here demonstrated that identical facial configurations convey strikingly different emotions and dimensional values depending on the affective context in which they are embedded. This effect is modulated by the similarity between the target facial expression and the facial expression typically associated with the context. Moreover, by monitoring eye movements, we demonstrated that characteristic fixation patterns previously thought to be determined solely by the facial expression are systematically modulated by emotional context already at very early stages of visual processing, even by the first time the face is fixated. Our results indicate that the perception of basic facial expressions is not context invariant and can be categorically altered by context at early perceptual levels.


Simulator sickness in virtual display gaming: a comparison of stereoscopic and non-stereoscopic situations

In this paper we compare simulator sickness symptoms produced by racing game in three different conditions. In the first experiment the participants played the Need for Speed car racing game with an ordinary 17" display and in the second and third experiments they used a head-worn virtual display for the game playing. The difference between experiments 2 and 3 was in the use of stereoscopy, as in the third experiment the car racing game was seen in stereoscopic three-dimensions. Our results indicated that there were no significant differences in sickness symptoms when we compared the ordinary display and the virtual display in non-stereoscopic mode. In stereoscopic condition the eye strain and disorientation symptoms were significantly elevated compared to the ordinary display. We conclude that using a virtual display as an accessory in a mobile device is a viable alternative, because the non-stereoscopic virtual display did not produce significantly more sickness symptoms compared to ordinary game playing.


Assessment of lexical semantic judgment abilities in alcohol-dependent subjects: An fMRI study

Neuropsychological studies have shown that alcohol dependence is associated with neurocognitive deficits in tasks requiring memory, perceptual motor skills, abstraction and problem solving, whereas language skills are relatively spared in alcoholics despite structural abnormalities in the language-related brain regions. To investigate the preserved mechanisms of language processing in alcohol-dependents, functional brain imaging was undertaken in healthy controls (n=18) and alcohol-dependents (n=16) while completing a lexical semantic judgment task in a 3 T MR scanner. Behavioural data indicated that alcohol-dependents took more time than controls for performing the task but there was no significant difference in their response accuracy. fMRI data analysis revealed that while performing the task, the alcoholics showed enhanced activations in left supramarginal gyrus, precuneus bilaterally, left angular gyrus, and left middle temporal gyrus as compared to control subjects. The extensive activations observed in alcoholics as compared to controls suggest that alcoholics recruit additional brain areas to meet the behavioural demands for equivalent task performance. The results are consistent with previous fMRI studies suggesting compensatory mechanisms for the execution of task for showing an equivalent performance or decreased neural efficiency of relevant brain networks. However, on direct comparison of the two groups, the results did not survive correction for multiple comparisons; therefore, the present findings need further exploration.


Markov Random Field model for single image defogging

Fog reduces contrast and thus the visibility of vehicles and obstacles for drivers. Each year, this causes traffic accidents. Fog is caused by a high concentration of very fine water droplets in the air. When light hits these droplets, it is scattered and this results in a dense white background, called the atmospheric veil. As pointed in [1], Advanced Driver Assistance Systems (ADAS) based on the display of defogged images from a camera may help the driver by improving objects visibility in the image and thus may lead to a decrease of fatality and injury rates. In the last few years, the problem of single image defogging has attracted attention in the image processing community. Being an ill-posed problem, several methods have been proposed. However, a few among of these methods are dedicated to the processing of road images. One of the first exception is the method in [2], [1] where a planar constraint is introduced to improve the restoration of the road area, assuming an approximately flat road. The single image defogging problem being ill-posed, the choice of the Bayesian approach seems adequate to set this problem as an inference problem. A first Markov Random Field (MRF) approach of the problem has been proposed recently in [3]. However, this method is not dedicated to road images. In this paper, we propose a novel MRF model of the single image defogging problem which applies to all kinds of images but can also easily be refined to obtain better results on road images using the planar constraint. A comparative study and quantitative evaluation with several state-of-the-art algorithms is presented. This evaluation demonstrates that the proposed MRF model allows to derive a new algorithm which produces better quality results, in particular in case of a noisy input image.


Log-Euclidean Metric Learning on Symmetric Positive Definite Manifold with Application to Image Set Classification

The manifold of Symmetric Positive Definite (SPD) matrices has been successfully used for data representation in image set classification. By endowing the SPD manifold with LogEuclidean Metric, existing methods typically work on vector-forms of SPD matrix logarithms. This however not only inevitably distorts the geometrical structure of the space of SPD matrix logarithms but also brings low efficiency especially when the dimensionality of SPD matrix is high. To overcome this limitation, we propose a novel metric learning approach to work directly on logarithms of SPD matrices. Specifically, our method aims to learn a tangent map that can directly transform the matrix logarithms from the original tangent space to a new tangent space of more discriminability. Under the tangent map framework, the novel metric learning can then be formulated as an optimization problem of seeking a Mahalanobis-like matrix, which can take the advantage of traditional metric learning techniques. Extensive evaluations on several image set classification tasks demonstrate the effectiveness of our proposed metric learning method.


Classifying streaming of Twitter data based on sentiment analysis using hybridization

Twitter is a social media that developed rapidly in today’s modern world. As millions of Twitter messages are sent day by day, the value and importance of developing a new technique for detecting spammers become significant. Moreover, legitimate users are affected by means of spams in the form of unwanted URLs, irrelevant messages, etc. Another hot topic of research is sentiment analysis that is based on each tweet sent by the user and opinion mining of the customer reviews. Most commonly natural language processing is used for sentiment analysis. The text is collected from user’s tweets by opinion mining and automatic sentiment analysis that are oriented with ternary classifications, such as “positive,” “neutral,” and “negative.” Due to limited size, unstructured nature, misspells, slangs, and abbreviations, it is more challenging for researchers to find sentiments for Twitter data. In this paper, we collected 600 million public tweets using URL-based security tool and feature generation is applied for sentiment analysis. The ternary classification is processed based on preprocessing technique, and the results of tweets sent by the users are obtained. We use a hybridization technique using two optimization algorithms and one machine learning classifier, namely particle swarm optimization and genetic algorithm and decision tree for classification accuracy by sentiment analysis. The results are compared with previous works, and our proposed method shows a better analysis than that of other classifiers.


Semi-autonomous flying robot for physical interaction with environment

This contribution presents the first results of the development of an unmanned aerial vehicle (UAV) which is capable of applying force to a wall while maintaining flight stability. This is a novel idea since UAVs are used so far only for tasks without physical contact to the surrounding objects. The basis for the work presented is a quadrotor system which is stabilized with an inertial measurement unit. As a new approach an additional actuator was added to generate forces in physical contact while the UAV stays horizontal. A control architecture based on ultrasonic distance sensors and a CMOS-camera is proposed. The performance of the system was proved by several flight tests. Potential applications of the system can be physical tasks at high places like cleaning windows or walls as well as rescue or maintenance tasks.


Bi-Modal DRAM Cache: Improving Hit Rate, Hit Latency and Bandwidth

In this paper, we present Bi-Modal Cache - a flexible stacked DRAM cache organization which simultaneously achieves several objectives: (i) improved cache hit ratio, (ii) moving the tag storage overhead to DRAM, (iii) lower cache hit latency than tags-in-SRAM, and (iv) reduction in off-chip bandwidth wastage. The Bi-Modal Cache addresses the miss rate versus off-chip bandwidth dilemma by organizing the data in a bi-modal fashion - blocks with high spatial locality are organized as large blocks and those with little spatial locality as small blocks. By adaptively selecting the right granularity of storage for individual blocks at run-time, the proposed DRAM cache organization is able to make judicious use of the available DRAM cache capacity as well as reduce the off-chip memory bandwidth consumption. The Bi-Modal Cache improves cache hit latency despite moving the metadata to DRAM by means of a small SRAM based Way Locator. Further by leveraging the tremendous internal bandwidth and capacity that stacked DRAM organizations provide, the Bi-Modal Cache enables efficient concurrent accesses to tags and data to reduce hit time. Through detailed simulations, we demonstrate that the Bi-Modal Cache achieves overall performance improvement (in terms of Average Normalized Turnaround Time (ANTT)) of 10.8%, 13.8% and 14.0% in 4-core, 8-core and 16-core workloads respectively.


Intangible benefits valuation in ERP projects

The development, implementation and ownership of information systems, especially large-scale systems such as enterprise resource planning (ERP), has become progressively longer in duration and more cost intensive. As a result, IS managers are being required to justify projects financially based on their return. Historically, information systems have been difficult to quantify in monetary terms because of the intangible nature of many of the derived benefits, e.g. improved customer service. Using the case study methodology, this paper examines an attempt by a large computer manufacturer to incorporate intangibles into traditional cost–benefit analysis in an ERP project. The paper reviews the importance of intangibles, lists intangible benefits that are important in ERP projects and demonstrates the use of a scheme through which they can be incorporated into traditional evaluation techniques.


Modeling of electric vehicle loads for power flow analysis based on PSAT

This paper proposes the modeling of electric vehicle(EV) loads for power flow analysis based on User Define Models (UDMs) in power system analysis toolbox (PSAT) programming, According to the development of EV technology especially motor controller and battery, the EV has totally designed and made for using in city area as small city cars. To study the performance of EV, this aims to present the model of EV loads for using to solve power flow analysis in the real power system. EV load is modeled as the function box equivalent on PSAT that can connect to the single line diagram of power system model. The IEEE 14 bus system is selected for simulating the performance of EV and charging station which compared between PQ load base case and EV load. The simulation result showed that the EV load was installed at bus No.14. The rated power of EV load was increased from 5.0 p.u. to 79 p.u. This proposed EV load model can be used to solve the power flow analysis with continuation power flow (CPF) method. The EV load model is directly effected to voltage stability margin when the EV load increased. This study can be verified that proposed EV load can use to study the EV load in the future works.


Modular equalization architecture using inter-module and switchless intra-module equalizer for energy storage system

This paper proposes a novel modular equalization architecture using inter-module and intra-module equalizers for energy storage systems comprising multiple cells/modules connected in series. In the proposed equalization architecture, cells in a module is equalized by a series-resonant voltage multiplier (SRVM)-based intra-module equalizer while module voltages are unified by a switched capacitor converter (SCC)-based inter-module equalizer. A square wave voltage generated at a switching node of the SCC-based inter-module equalizer is utilized to drive the SRVM-based intra-module equalizer so that the SRVM-based intra-module equalizer can be totally switchless topology. The required switch count of the proposed equalization architecture can be dramatically reduced compared to conventional architectures, allowing simplified circuitry. The proposed equalization architecture is modular and allows different equalizer topologies to be used for inter- and intra-module equalizers, offering good modularity and design flexibility. The derivation procedure of the proposed equalization architecture is explained, followed by separate analyses for the SCC-based inter-module equalizer and SRVM-based intra-module equalizer. An experimental equalization test for three supercapacitor (SC) modules, each consisting of four cells in series, was performed from an initially voltage-imbalanced condition. Module and cell voltages were equalized at different rates, and the equalization performance of the proposed modular equalization architecture was successfully demonstrated.


Nonnegative Matrix Factorization with the Itakura-Saito Divergence: With Application to Music Analysis

This letter presents theoretical, algorithmic, and experimental results about nonnegative matrix factorization (NMF) with the Itakura-Saito (IS) divergence. We describe how IS-NMF is underlaid by a well-defined statistical model of superimposed gaussian components and is equivalent to maximum likelihood estimation of variance parameters. This setting can accommodate regularization constraints on the factors through Bayesian priors. In particular, inverse-gamma and gamma Markov chain priors are considered in this work. Estimation can be carried out using a space-alternating generalized expectation-maximization (SAGE) algorithm; this leads to a novel type of NMF algorithm, whose convergence to a stationary point of the IS cost function is guaranteed. We also discuss the links between the IS divergence and other cost functions used in NMF, in particular, the Euclidean distance and the generalized Kullback-Leibler (KL) divergence. As such, we describe how IS-NMF can also be performed using a gradient multiplicative algorithm (a standard algorithm structure in NMF) whose convergence is observed in practice, though not proven. Finally, we report a furnished experimental comparative study of Euclidean-NMF, KL-NMF, and IS-NMF algorithms applied to the power spectrogram of a short piano sequence recorded in real conditions, with various initializations and model orders. Then we show how IS-NMF can successfully be employed for denoising and upmix (mono to stereo conversion) of an original piece of early jazz music. These experiments indicate that IS-NMF correctly captures the semantics of audio and is better suited to the representation of music signals than NMF with the usual Euclidean and KL costs.


The Life Satisfaction Advantage of Being Married and Gender Specialization

This investigation examined whether the life satisfaction advantage of married over unmarried persons decreased over the last three decades, and whether the changes in the contextual gender specialization explained this trend. The author used representative data from the World Values Survey–European Values Study (WVS–EVS)-integrated data set for 87 countries (N = 292,525) covering a period of 29 years. Results showed that the life satisfaction advantage of being married decreased among men but not among women. The analysis did not support the hypothesis that contextual gender specialization shaped the observed trend. Only in developed countries the declining contextual specialization correlated with smaller life satisfaction advantage of being married. This evidence suggests that the advantages of marriage are greater under conditions that support freedom of choice rather than economic necessity. (130 words)


UFMC system performance analysis for discrete narrow-band private networks

In this paper, the performance of universal-filtered multi-carrier (UFMC) system is analyzed. Specifically, the UFMC signals are generated with Dolph-Chebyshev, Hamming and Hanning filtering. The characteristics of UFMC signals are also compared with OFDM signal, in both software and hardware-in-the-loop simulations. Experimental results show that UFMC signals have better performance than OFDM signal, by means of side-lobe attenuation, bit-error-ratio (BER) and Error Vector Magnitude (EVM). The results indicate that the UFMC signal is more suitable than OFDM signal for discrete narrow-band private networks. The results can provide useful information on the design of multi-carrier radio systems.


Following My Head and My Heart: Integrating Preschoolers' Empathy, Theory of Mind, and Moral Judgments.

Associations among hypothetical, prototypic moral, and conventional judgments; theory of mind (ToM); empathy; and personal distress were examined in 108 socioeconomically diverse preschoolers (Mage  = 42.94 months, SD = 1.42). Repeated measures analysis of covariance with empathy, false beliefs, and their interaction as covariates indicated that empathy was significantly associated with judgments of greater moral but not conventional transgression severity, particularly for psychological harm, and with deserved punishment for unfairness. False beliefs were associated with (combined) moral criterion judgments of rule and authority independence and inalterability. Empathy also was positively associated with criterion judgments but only for children low in ToM. Personal distress was unrelated to judgments. Results demonstrate the importance of both affective and cognitive processes in preschoolers' moral judgments.


A 5-MHz 91% Peak-Power-Efficiency Buck Regulator With Auto-Selectable Peak- and Valley-Current Control

This paper presents a multi-MHz buck regulator for portable applications using an auto-selectable peak- and valley-current control (ASPVCC) scheme. The proposed ASPVCC scheme can enable the current-mode buck regulator to reduce the settling-time requirement of the current sensing by two times. In addition, the dynamically biased shunt feedback technique is employed to improve the sensing speed and the sensing accuracy of both the peak and valley current sensors. With both ASPVCC scheme and advanced current sensors, the buck regulator can thus operate at high switching frequencies with a wide range of duty ratios for reducing the required off-chip inductance. The proposed current-mode buck regulator was fabricated in a standard 0.35-μm CMOS process and occupies a small chip area of 0.54 mm2. Measurement results show that the buck regulator can deliver a maximum output current of 500 mA, operate at 5 MHz with a wide duty-ratio range of about 0.6, use a small-value off-chip inductor of 1 μH, and achieve the peak power efficiency of 91%.


Low-Quality Product Review Detection in Opinion Summarization

Product reviews posted at online shopping sites vary greatly in quality. This paper addresses the problem of detecting lowquality product reviews. Three types of biases in the existing evaluation standard of product reviews are discovered. To assess the quality of product reviews, a set of specifications for judging the quality of reviews is first defined. A classificationbased approach is proposed to detect the low-quality reviews. We apply the proposed approach to enhance opinion summarization in a two-stage framework. Experimental results show that the proposed approach effectively (1) discriminates lowquality reviews from high-quality ones and (2) enhances the task of opinion summarization by detecting and filtering lowquality reviews.


Automatically Producing Plot Unit Representations for Narrative Text

In the 1980s, plot units were proposed as a conceptual knowledge structure for representing and summarizing narrative stories. Our research explores whether current NLP technology can be used to automatically produce plot unit representations for narrative text. We create a system called AESOP that exploits a variety of existing resources to identify affect states and applies “projection rules” to map the affect states onto the characters in a story. We also use corpus-based techniques to generate a new type of affect knowledge base: verbs that impart positive or negative states onto their patients (e.g., being eaten is an undesirable state, but being fed is a desirable state). We harvest these “patient polarity verbs” from a Web corpus using two techniques: co-occurrence with Evil/Kind Agent patterns, and bootstrapping over conjunctions of verbs. We evaluate the plot unit representations produced by our system on a small collection of Aesop’s fables.


Plot Units and Narrative Summarization

In order to summarize a story, i t is necessary to access a high level analysis of the story that highlights its central concepts. A technique of memory representation based on plot units appears to provide a rich foundation for such an analysis. Plot units are conceptual structures that overlap with each other when a narrative is cohesive. When overlapping intersections between plot units are interpreted as arcs in a graph of plot units, the resulting graph encodes the plot of the story. Structural features of the graph then reveal which concepts are central to the story, and which concepts are peripheral. Plot unit analysis is currently being investigated as a processing strategy for narrative summarization by both computer simulotion ond psychological experiments.