Estimating Crowd Density in an RF-Based Dynamic Environment

Crowd density estimating is a crucial service in many applications (e.g., smart guide, crowd control, etc.), which is often conducted using pattern recognition technologies based on video surveillance. However, these kinds of methods are high cost, and cannot work well in low-light environments. Radio frequency based technologies are adopted more and more in indoor application, since radio signal strength (RSS) can be easily obtained by various wireless devices without additional cost. In this paper, we introduce a low cost crowd density estimating method using wireless sensor networks. The proposed approach is a device-free crowd counting approach without objects carrying any assistive device. It is hard to count objects based on RSS measurement, since different number of mobile people at different positions often generates different RSS due to the multipath phenomenon. This paper utilizes the space-time relativity of crowd distribution to reduce the estimation errors. The proposed approach is an iterative process, which contains three phases: the training phase, the monitoring phase, and the calibrating phase. Our experiments are implemented based on TelosB sensor platform. We also do some large-scale simulations to verify the feasibility and the effectiveness of our crowd density estimating approach.


Selective Sampling with Redundant Views

Selective sampling, a form of active learning, reduces the cost of labeling training data by asking only for the labels of the most informative unlabeled examples. We introduce a novel approach to selective sampling which we call co-testing. Cotesting can be applied to problems with redundant views (i.e., problems with multiple disjoint sets of attributes that can be used for learning). We analyze the most general algorithm in the co-testing family, naive co-testing, which can be used with virtually any type of learner. Naive co-testing simply selects at random an example on which the existing views disagree. We applied our algorithm to a variety of domains, including three real-world problems: wrapper induction, Web page classi cation, and discourse trees parsing. The empirical results show that besides reducing the number of labeled examples, naive co-testing may also boost the classi cation accuracy.


A Methodology for Realizing High Efficiency Class-J in a Linear and Broadband PA

The design and implementation of a class-J mode RF power amplifier is described. The experimental results indicate the class-J mode's potential in achieving high efficiency across extensive bandwidth, while maintaining predistortable levels of linearity. A commercially available 10 W GaN (gallium nitride) high electron mobility transistor device was used in this investigation, together with a combination of high power waveform measurements, active harmonic load-pull and theoretical analysis of the class-J mode. Targeting a working bandwidth of 1.5-2.5 GHz an initial power amplifier (PA) design was based on basic class-J theory and computer-aided design simulation. This realized a 50% bandwidth with measured drain efficiency of 60%-70%. A second PA design iteration has realized near-rated output power of 39 dBm and improved efficiency beyond the original 2.5 GHz target, hence extending efficient PA operation across a bandwidth of 1.4-2.6 GHz, centered at 2 GHz. This second iteration made extensive use of active harmonic load-pull and waveform measurements, and incorporated a novel design methodology for achieving predistortable linearity. The class-J amplifier has been found to be more realizable than conventional class-AB modes, with a better compromise between power and efficiency tradeoffs over a substantial RF bandwidth.


Hardware Accelerated Per-Pixel Displacement Mapping

In this paper we present an algorithm capable of rendering a displacement mapped triangle mesh interactively on latest GPUs. The algorithm uses only pixel shaders and does not rely on adaptively adding geometry. All sampling of the displacement map takes place in the pixel shader and bior trilinear filtering can be applied to it, and at the same time as the calculations are done per pixel in the shader, the algorithm has automatic level of detail control. The triangles of the base mesh are extruded along the respective normal directions and then the resulting prisms are rendered by casting rays inside and intersecting them with the displaced surface. Two different implementations are discussed in detail.


Paraphrasing Out-of-Vocabulary Words with Word Embeddings and Semantic Lexicons for Low Resource Statistical Machine Translation

Out-of-vocabulary (OOV) word is a crucial problem in statistical machine translation (SMT) with low resources. OOV paraphrasing that augments the translation model for the OOV words by using the translation knowledge of their paraphrases has been proposed to address the OOV problem. In this paper, we propose using word embeddings and semantic lexicons for OOV paraphrasing. Experiments conducted on a low resource setting of the OLYMPICS task of IWSLT 2012 verify the effectiveness of our proposed method.


A Character Model with Moral Emotions: Preliminary Evaluation

In literary and drama criticism, emotions, and moral emotions in particular, have been pointed out as one of characterizing features of stories. In this paper, we propose to model story characters as value-based emotional agents, who appraise their own and others’ actions based on their desires and values, and feel the appropriate moral emotions in response to narrative situations that challenge their goals and values. In order to validate the appropriateness of the agent model for narrative characters, we ran an experiment with human participants aimed at comparing their expectations about characters’ emotions with the predictions of the value-based model of emotional agent. The results of the experiment show that the participants’ expectations meet the predictions of the model. 1998 ACM Subject Classification I.2.11 Intelligent Agents, I.2.0 Cognitive Simulation


Social neuroscience evidence for dehumanised perception


A Spatial Mapping Algorithm with Applications in Deep Learning-Based Structure Classification

Convolutional Neural Network (CNN)-based machine learning systems have made breakthroughs in feature extraction and image recognition tasks in two dimensions (2D). Although there is significant ongoing work to apply CNN technology to domains involving complex 3D data, the success of such efforts has been constrained, in part, by limitations in data representation techniques. Most current approaches rely upon low-resolution 3D models, strategic limitation of scope in the 3D space, or the application of lossy projection techniques to allow for the use of 2D CNNs. To address this issue, we present a mapping algorithm that converts 3D structures to 2D and 1D data grids by mapping a traversal of a 3D space-filling curve to the traversal of corresponding 2D and 1D curves. We explore the performance of 2D and 1D CNNs trained on data encoded with our method versus comparable volumetric CNNs operating upon raw 3D data from a popular benchmarking dataset. Our experiments demonstrate that both 2D and 1D representations of 3D data generated via our method preserve a significant proportion of the 3D data’s features in forms learnable by CNNs. Furthermore, we demonstrate that our method of encoding 3D data into lower-dimensional representations allows for decreased CNN training time cost, increased original 3D model rendering resolutions, and supports increased numbers of data channels when compared to purely volumetric approaches. This demonstration is accomplished in the context of a structural biology classification task wherein we train 3D, 2D, and 1D CNNs on examples of two homologous branches within the Ras protein family. The essential contribution of this paper is the introduction of a dimensionality-reduction method that may ease the application of powerful deep learning tools to domains characterized by complex structural data.


Fast End-to-End Trainable Guided Filter

Image processing and pixel-wise dense prediction have been advanced by harnessing the capabilities of deep learning. One central issue of deep learning is the limited capacity to handle joint upsampling. We present a deep learning building block for joint upsampling, namely guided filtering layer. This layer aims at efficiently generating the high-resolution output given the corresponding low-resolution one and a high-resolution guidance map. The proposed layer is composed of a guided filter, which is reformulated as a fully differentiable block. To this end, we show that a guided filter can be expressed as a group of spatial varying linear transformation matrices. This layer could be integrated with the convolutional neural networks (CNNs) and jointly optimized through end-to-end training. To further take advantage of end-to-end training, we plug in a trainable transformation function that generates task-specific guidance maps. By integrating the CNNs and the proposed layer, we form deep guided filtering networks. The proposed networks are evaluated on five advanced image processing tasks. Experiments on MIT-Adobe FiveK Dataset demonstrate that the proposed approach runs 10-100Ã— faster and achieves the state-of-the-art performance. We also show that the proposed guided filtering layer helps to improve the performance of multiple pixel-wise dense prediction tasks. The code is available at https://github.com/wuhuikai/DeepGuidedFilter.


Building Lexical Vector Representations from Concept Definitions

The use of distributional language representations have opened new paths in solving a variety of NLP problems. However, alternative approaches can take advantage of information unavailable through pure statistical means. This paper presents a method for building vector representations from meaning unit blocks called concept definitions, which are obtained by extracting information from a curated linguistic resource (Wiktionary). The representations obtained in this way can be compared through conventional cosine similarity and are also interpretable by humans. Evaluation was conducted in semantic similarity and relatedness test sets, with results indicating a performance comparable to other methods based on single linguistic resource extraction. The results also indicate noticeable performance gains when combining distributional similarity scores with the ones obtained using this approach. Additionally, a discussion on the proposed method’s shortcomings is provided in the analysis of error cases.


Circuit Design of a High Speed and Low Power CMOS Continuous-time Current Comparator

Current comparator is a fundamental component of current-mode analog integrated circuits. A novel high-performance continuous-time CMOS current comparator is proposed in this paper, which comprises one CMOS complementary amplifier, two resistive-load amplifiers and two CMOS inverters. A MOS resistor is used as the CMOS complementary amplifier’s negative feedback. Because the voltage swings of the CMOS complementary amplifier are reduced by low input and output resistances, the delay time of the current comparator is shortened. Its power consumption can be reduced rapidly with the increase of input current. Simulation results based on 1.2 μm CMOS process model show the speed of the novel current comparator is comparable with those of the existing fastest CMOS current comparators, and its power consumption is the lowest, so it has the smallest power-delay product. Furthermore, the new current comparator occupies small area and is process-robust, so it is very suitable to high-speed and low-power applications.


Statistical Decision Theory and Bayesian Analysis, 2nd Edition


Automated Generation of Attack Trees

Attack trees are widely used to represent threat scenarios in a succinct and intuitive manner, suitable for conveying security information to non-experts. The manual construction of such objects relies on the creativity and experience of specialists, and therefore it is error-prone and impracticable for large systems. Nonetheless, the automated generation of attack trees has only been explored in connection to computer networks and levering rich models, whose analysis typically leads to an exponential blow-up of the state space. We propose a static analysis approach where attack trees are automatically inferred from a process algebraic specification in a syntax-directed fashion, encompassing a great many application domains and avoiding incurring systematically an exponential explosion. Moreover, we show how the standard propositional denotation of an attack tree can be used to phrase interesting quantitative problems, that can be solved through an encoding into Satisfiability Modulo Theories. The flexibility and effectiveness of the approach is demonstrated on the study of a national-scale authentication system, whose attack tree is computed thanks to a Java implementation of the framework.


A low cost implementation of MQTT using ESP8266

Technology is great growling engine of the change and Internet of Things (IoT) is the backbone of such revolutionary engines. Basically, in the real world the things having sensor capability, sufficient power supply and connectivity to internet makes field like Internet of Things (IoT) possible. For such rapid growing technology, it is the necessity to have very light, inexpensive and minimum bandwidth protocol like Message Queuing Telemetry Transport (MQTT) Protocol. Because of such non-established protocol it is easy for the clients to publish or/and subscribe the desire topic through the host acting as server of the network also known to be the broker. In this paper, it is shown that communication between the low power ESP8266 WiFi as client with the clients on smartphones and laptop using an MQTT protocol becomes easier and more reliable. The WiFi enabled ESP8266 board interfaces with DHT11 sensor and LDR sensor to monitor the ambient condition and according to the light intensity level the brightness level of 8∗8 Neopixel matrix is controlled. The adafruit.io is the MQTT server i.e, broker which also provides the facility of monitoring system through the dashboard. The clients on smartphone and laptop subscribes to the topics of temperature, humidity and light intensity level gets the respective update. The main objective of the paper is to implement the idea for the smart home appliance, street light system for the smart cities, fire alert systems, whether monitoring system and so.


Machine Learning Techniques in Spam Filtering

The article gives an overview of some of the most popular machine learning methods (Bayesian classification, k-NN, ANNs, SVMs) and of their applicability to the problem of spam-filtering. Brief descriptions of the algorithms are presented, which are meant to be understandable by a reader not familiar with them before. A most trivial sample implementation of the named techniques was made by the author, and the comparison of their performance on the PU1 spam corpus is presented. Finally, some ideas are given of how to construct a practically useful spam filter using the discussed techniques. The article is related to the author’s first attempt of applying the machine-learning techniques in practice, and may therefore be of interest primarily to those getting aquainted with machine-learning.


SVM-KNN: Discriminative Nearest Neighbor Classification for Visual Category Recognition

We consider visual category recognition in the framework of measuring similarities, or equivalently perceptual distances, to prototype examples of categories. This approach is quite flexible, and permits recognition based on color, texture, and particularly shape, in a homogeneous framework. While nearest neighbor classifiers are natural in this setting, they suffer from the problem of high variance (in bias-variance decomposition) in the case of limited sampling. Alternatively, one could use support vector machines but they involve time-consuming optimization and computation of pairwise distances. We propose a hybrid of these two methods which deals naturally with the multiclass setting, has reasonable computational complexity both in training and at run time, and yields excellent results in practice. The basic idea is to find close neighbors to a query sample and train a local support vector machine that preserves the distance function on the collection of neighbors. Our method can be applied to large, multiclass data sets for which it outperforms nearest neighbor and support vector machines, and remains efficient when the problem becomes intractable for support vector machines. A wide variety of distance functions can be used and our experiments show state-of-the-art performance on a number of benchmark data sets for shape and texture classification (MNIST, USPS, CUReT) and object recognition (Caltech- 101). On Caltech-101 we achieved a correct classification rate of 59.05%(±0.56%) at 15 training images per class, and 66.23%(±0.48%) at 30 training images.


Support vector machines for spam categorization

We study the use of support vector machines (SVM's) in classifying e-mail as spam or nonspam by comparing it to three other classification algorithms: Ripper, Rocchio, and boosting decision trees. These four algorithms were tested on two different data sets: one data set where the number of features were constrained to the 1000 best features and another data set where the dimensionality was over 7000. SVM's performed best when using binary features. For both data sets, boosting trees and SVM's had acceptable test performance in terms of accuracy and speed. However, SVM's had significantly less training time.


An Introduction to Support Vector Machines and Other Kernel-based Learning Methods

Bargaining with reading habit is no need. Reading is not kind of something sold that you can take or not. It is a thing that will change your life to life better. It is the thing that will give you many things around the world and this universe, in the real world and here after. As what will be given by this an introduction to support vector machines and other kernel based learning methods, how can you bargain with the thing that has many benefits for you?


Naive (Bayes) at Forty: The Independence Assumption in Information Retrieval

The naive Bayes classiier, currently experiencing a renaissance in machine learning, has long been a core technique in information retrieval. We review some of the variations of naive Bayes models used for text retrieval and classiication, focusing on the distributional assumptions made about word occurrences in documents.


A Call for the Integration of Trauma-Informed Care Among Intellectual and Developmental Disability Organizations

Research exploring the occurrence of trauma among adults with intellectual and developmental disabilities (I/DD) has grown over the past decade. Yet there is a dearth of literature investigating the impact of organizational factors on the trauma experience despite this population’s need for organizational supports. Trauma-informed care (TIC), a systems-focused model for service delivery, is a fast-developing interest among the broader field of trauma in the general population. It recognizes the prevalence and impact of trauma, and creates a culture of safety, trustworthiness, choice, collaboration, and empowerment. The author synthesized relevant literature from both the intellectual and developmental disabilities areas and integrated this with TIC and trauma literature drawn from the general population. Explored are the implications of organizations for service delivery and the potential assimilation of TIC within I/DD organizations. The effectiveness of TIC applications and their potential barriers are discussed and related to the philosophy of quality of life and organizational culture. The author notes that some individuals with I/DD comprise a vulnerable subgroup of the population that in large part relies upon the support of organizational services to foster quality of life. Given the implications of the focus on quality of life, he posits that TIC presents as a viable response for organizations, complimenting and augmenting current efforts.


Sea Ice Remote Sensing Using AMSR-E 89 GHz Channels

Recent progress in sea ice concentration remote sensing by satellite microwave radiometers has been stimulated by two developments: First, the new sensor AMSR-E offers spatial resolutions of approximately 6x4 km at 89 GHz, nearly three times the resolution of the standard sensor SSM/I at 85 GHz (15x13 km). Second, a new algorithm enables to estimate sea ice concentration from the channels near 90GHz, despite the enhanced atmospheric influence in these channels. This allows to fully exploit their horizontal resolution which is up to four times finer than the one of the channels near 19 and 37 GHz, the frequencies used by the most widespread algorithms for sea ice retrieval, the NASA-Team and Bootstrap algorithms. The ASI algorithm used combines a model for retrieving the sea ice concentration from SSM/I 85 GHz data proposed by Svendsen et al. [1987] with an ocean mask derived from the 18-, 23-, and 37-GHz AMSR-E data using weather filters. During two ship campaigns, the correlation of ASI, NASA-Team 2 and Bootstrap algorithms ice concentrations with bridge observations were 0.80, 0.79 and 0.81, respectively. Systematic differences over the complete AMSR-E period (2002-2006) between ASI and NASA-Team 2 are below −2±8.8%, and between ASI and Bootstrap 1.7±10.8%. Among the geophysical implications of the ASI algorithm are: (1) Its higher spatial resolution allows to better estimate crucial variables in numerical atmospheric and ocean models, e.g. the heat flux between ocean and atmosphere, especially near coastlines and in polynyas. (2) It provides an additional time series of ice area and extent for climate studies.


Aware LSTM model for Semantic Role Labeling

In Semantic Role Labeling (SRL) task, the tree structured dependency relation is rich in syntax information, but it is not well handled by existing models. In this paper, we propose Syntax Aware Long Short Time Memory (SA-LSTM). The structure of SA-LSTM changes according to dependency structure of each sentence, so that SA-LSTM can model the whole tree structure of dependency relation in an architecture engineering way. Experiments demonstrate that on Chinese Proposition Bank (CPB) 1.0, SA-LSTM improves F1 by 2.06% than ordinary bi-LSTM with feature engineered dependency relation information, and gives state-of-the-art F1 of 79.92%. On English CoNLL 2005 dataset, SA-LSTM brings improvement (2.1%) to bi-LSTM model and also brings slight improvement (0.3%) when added to the stateof-the-art model.


Adaptation algorithm for adaptive streaming over HTTP

Internet video makes up a significant part of the Internet traffic and its fraction is constantly growing. In order to guarantee best user experience throughout different network access technologies with dynamically varying network conditions, it is fundamental to adopt technologies enabling a proper delivery of the media content. One of such technologies is adaptive streaming. It allows to dynamically adapt the bit-rate of the stream to varying network conditions. There are various approaches to adaptive streaming. In our work, we focus on the receiver-driven approach where the media file is subdivided into segments, each of the segments is provided at multiple bit-rates, and the task of the client is to select the appropriate bit-rate for each of the segments. With this approach, the challenges are (i) to properly estimate the dynamics of the available network throughput, (ii) to control the filling level of the client buffer in order to avoid underflows resulting in playback interruptions, (iii) to maximize the quality of the stream, while avoiding unnecessary quality fluctuations, and, finally, (iv) to minimize the delay between the user's request and the start of the playback. During our work, we designed and implemented a receiver-driven adaptation algorithm for adaptive streaming that does not rely on cross-layer information or server assistance. We integrated the algorithm with a prototype implementation of a streaming client based on the MPEG DASH (Dynamic Adaptive Streaming over HTTP) standard. We evaluated the implemented prototype in real-world scenarios and found that it performes remarkably well even under challenging network conditions. Further, it exhibits stable and fair operation if a common link is shared among multiple clients.


User Acceptance of Hedonic Information Technologies: A Perceived Value Perspective

Hedonic information technologies do not focus on productivity-oriented applications, but rather, on lifestyle-augmentation and entertainment. As such users of hedonic IT are provided with benefits related to general enjoyment as opposed to gains in organizational efficiency. The main purpose of this study is to investigate this burgeoning phenomenon by measuring several value drivers for downloading mobile phone ringtones. Hypothesis testing was performed with PLS techniques applied to data collected from 119 ringtone users. Results confirmed that the overall value of hedonic IT is a third-order construct, which successfully predicted behavioral usage intentions and positive word of mouth.


Continuous monitoring of distance-based outliers over data streams

Anomaly detection is considered an important data mining task, aiming at the discovery of elements (also known as outliers) that show significant diversion from the expected case. More specifically, given a set of objects the problem is to return the suspicious objects that deviate significantly from the typical behavior. As in the case of clustering, the application of different criteria lead to different definitions for an outlier. In this work, we focus on distance-based outliers: an object x is an outlier if there are less than k objects lying at distance at most R from x. The problem offers significant challenges when a stream-based environment is considered, where data arrive continuously and outliers must be detected on-the-fly. There are a few research works studying the problem of continuous outlier detection. However, none of these proposals meets the requirements of modern stream-based applications for the following reasons: (i) they demand a significant storage overhead, (ii) their efficiency is limited and (iii) they lack flexibility. In this work, we propose new algorithms for continuous outlier monitoring in data streams, based on sliding windows. Our techniques are able to reduce the required storage overhead, run faster than previously proposed techniques and offer significant flexibility. Experiments performed on real-life as well as synthetic data sets verify our theoretical study.


From phonemes to images: levels of representation in a recurrent neural model of visually-grounded language learning

We present a model of visually-grounded language learning based on stacked gated recurrent neural networks which learns to predict visual features given an image description in the form of a sequence of phonemes. The learning task resembles that faced by human language learners who need to discover both structure and meaning from noisy and ambiguous data across modalities. We show that our model indeed learns to predict features of the visual context given phonetically transcribed image descriptions, and show that it represents linguistic information in a hierarchy of levels: lower layers in the stack are comparatively more sensitive to form, whereas higher layers are more sensitive to meaning.


Measuring the Similarity between Automatically Generated Topics

Previous approaches to the problem of measuring similarity between automatically generated topics have been based on comparison of the topics’ word probability distributions. This paper presents alternative approaches, including ones based on distributional semantics and knowledgebased measures, evaluated by comparison with human judgements. The best performing methods provide reliable estimates of topic similarity comparable with human performance and should be used in preference to the word probability distribution measures used previously.


Electronic model of human brain using verilog

Computers are man-made machines which work according to the given set of inputs and perform some operation on the input to generate a new set of outputs. They can be programmed to perform huge and complex task yet they lack imagination and ability to understand things. On the hand human brain is a machine which can learn new tasks by process of acquiring knowledge and understanding through thought, experience and the senses. To make computer work or think like human, human brain modeling of machine is necessary. We need to know how human brain works. The basic component of human brain is neuron, which make us think and do smart things. Brains have billions of neurons and they communicate with each other using electrical impulse. These impulses are responsible for making brain think and to have a consciousness. This paper proposes such a model of a part of the brain.


Synchronous reluctance motor multi-static MEC model

High efficiency, low cost and high reliable electrical machines are designed to meet very demanding specifications for a wide range of applications. The SynchRM (Synchronous Reluctance Motor) has very interesting properties and features. One of the main advantages is that the motor can be designed without rare earth materials permanent magnets. In this article, a modelling method of such machines using the MEC (Magnetic Equivalent Circuit) is proposed. The main challenges are to obtain a very accurate parametric model in order to calculate torque variations and to make possible geometric optimizations in future work.


Learning Pixel-Level Semantic Affinity with Image-Level Supervision for Weakly Supervised Semantic Segmentation

The deficiency of segmentation labels is one of the main obstacles to semantic segmentation in the wild. To alleviate this issue, we present a novel framework that generates segmentation labels of images given their image-level class labels. In this weakly supervised setting, trained models have been known to segment local discriminative parts rather than the entire object area. Our solution is to propagate such local responses to nearby areas which belong to the same semantic entity. To this end, we propose a Deep Neural Network (DNN) called AffinityNet that predicts semantic affinity between a pair of adjacent image coordinates. The semantic propagation is then realized by random walk with the affinities predicted by AffinityNet. More importantly, the supervision employed to train AffinityNet is given by the initial discriminative part segmentation, which is incomplete as a segmentation annotation but sufficient for learning semantic affinities within small image areas. Thus the entire framework relies only on image-level class labels and does not require any extra data or annotations. On the PASCAL VOC 2012 dataset, a DNN learned with segmentation labels generated by our method outperforms previous models trained with the same level of supervision, and is even as competitive as those relying on stronger supervision.


Generalized distributed rate limiting

The Distributed Rate Limiting (DRL) paradigm is a recently proposed mechanism for decentralized control of cloud-based services. DRL is a simple and efficient approach to resolve the issues of pricing and resource control/engineering of cloud based services. The existing DRL schemes focus on very specific performance metrics (such as loss rate and fair-share) and their design heavily depends on the assumption that the traffic is generated by elastic TCP sources. In this paper we tackle the DRL problem for general workloads and performance metrics and propose an analytic framework for the design of stable DRL algorithms. The closed-form nature of our results allows simple design rules which, together with extremely low communication overhead, makes the presented algorithms practical and easy to deploy with guaranteed convergence properties under a wide range of possible scenarios.


1 Wave Dispersion in High-Rise Buildings due to Soil-Structure Interaction

Nonparametric techniques for estimation of wave dispersion in buildings by seismic interferometry are applied to a simple model of a soil-structure interaction (SSI) system with coupled horizontal and rocking response. The system consists of a viscously damped shearbeam, representing a building, on a rigid foundation embedded in a half-space. The analysis shows that (1) wave propagation through the system is dispersive. The dispersion is characterized by lower phase velocity (softening) in the band containing the fundamental system mode of vibration, and little change in the higher frequency bands, relative to the building shear wave velocity. This mirrors its well known effect on the frequencies of vibration, i.e. reduction for the fundamental mode (softening) and no significant change for the higher modes of vibration, in agreement with the duality of the wave and vibrational nature of structural response. Nevertheless, the phase velocity identified from broader band IRFs is very close to the superstructure shear wave velocity, as found by the earlier study. The analysis reveals that (2) the reason for this apparent paradox is that the latter estimates are biased towards the higher values, representative of the higher frequencies in the band, where the response is less affected by SSI. It is also discussed that (3) bending flexibility and soil flexibility produce similar effects on the phase velocities and frequencies of vibration of a building. 1 Ph.D. Candidate, University of Southern California, Dept. of Civil Eng., Los Angeles, CA 90089-2531, Email: mrahmani@usc.edu 2 Ph.D. Candidate, University of Southern California, Dept. of Civil Eng., Los Angeles, CA 90089-2531, Email: mebrahim@usc.edu 3 Research Professor, University of Southern California, Dept. of Civil Eng., Los Angeles, CA 90089-2531, Email: mtodorov@usc.edu Earthquake Engineering and Structural Dynamics. DOI: 10.1002/eqe.2454, Final Draft. First published online on June 23, 2014, in press Article available at: http://onlinelibrary.wiley.com/doi/10.1002/eqe.2454/abstract.


Clinical anatomy of the coccyx: A systematic review.

The coccyx has been relatively neglected in anatomical research which is surprising given the population prevalence of coccydynia and our inadequate understanding of its etiology. This systematic review analyzes available information on the clinical anatomy of the coccyx. A literature search using five electronic databases and standard anatomy reference texts was conducted yielding 61 primary and 7 secondary English-language sources. This was supplemented by a manual search of selected historical foreign language articles. The coccygeal vertebrae, associated joints, ligaments and muscles, coccygeal movements, nerves, and blood supply were analyzed in detail. Although the musculoskeletal aspects of the coccyx are reasonably well described, the precise anatomy of the coccygeal plexus and its distribution, the function of the coccygeal body, and the anatomy of the sacrococcygeal zygapophyseal joints are poorly documented. Further research into the anatomy of the coccyx may clarify the etiopathogenesis of coccydynia which remains uncertain in one-third of affected patients.


ASSESSMENT OF SLOPE STABILITY IN EMBANKMENT DAMS USING ARTIFICIAL NEURAL NETWORK

A slope formed when there is a height difference between two points of the ground surface. Limited or ambiguous data defined in the studying of the slip surface have always been posed as a challenge to engineers and geologists; however, previous studies presented the useful strategies for resolving this challenge. In general, Multi Layer Perceptrons (MLPs) (with three input, output and hidden layers) artificial neural networks (ANNs), as well as the transfer function and sufficient number of neurons in hidden layer are able to estimate any nonlinear function with any degree of complexity. In the present study, the Zonouz embankment dam at Iran was firstly modeled by using the classic limit equilibrium method (LEM) then, obtained results were used for training the ANN. Then the effect of various parameters such as logarithmic data and training epoch number on the network and sensitivity analysis on the input parameters were discussed. Finally the best network was selected in training step, and obtained results were verified. The results show that the ANN can be used as a suitable alternative technique instead of LEM for probing the slope stability in embankment dams.


Improving SAT-solving with Machine Learning

In this project, we aimed to improve the runtime of Minisat, a Conflict-Driven Clause Learning (CDCL) solver that solves the Propositional Boolean Satisfiability (SAT) problem. We first used a logistic regression model to predict the satisfiability of propositional boolean formulae after fixing the values of a certain fraction of the variables in each formula. We then applied the logistic model and added a preprocessing period to Minisat to determine the preferable initial value (either true or false) of each boolean variable using a Monte-Carlo approach. Concretely, for each Monte-Carlo trial, we fixed the values of a certain ratio of randomly selected variables, and calculated the confidence that the resulting sub-formula is satisfiable with our logistic regression model. The initial value of each variable was set based on the mean confidence scores of the trials that started from the literals of that variable. We were particularly interested in setting the initial values of the backbone variables correctly, which are variables that have the same value in all solutions of a SAT formula. Our Monte-Carlo method was able to set 78% of the backbones correctly. Excluding the preprocessing time, compared with the default setting of Minisat, the runtime of Minisat for satisfiable formulae decreased by 23%. However, our method did not outperform vanilla Minisat in runtime, as the decrease in the conflicts was outweighed by the long runtime of the preprocessing period.


Semantic Models for Scalable Search in the Internet of Things

The Internet of Things is anticipated to connect billions of embedded devices equipped with sensors to perceive their surroundings. Thereby, the state of the real world will be available online and in real-time and can be combined with other data and services in the Internet to realize novel applications such as Smart Cities, Smart Grids, or Smart Healthcare. This requires an open representation of sensor data and scalable search over data from diverse sources including sensors. In this paper we show how the Semantic Web technologies RDF (an open semantic data format) and SPARQL (a query language for RDF-encoded data) can be used to address those challenges. In particular, we describe how prediction models can be employed for scalable sensor search, how these prediction models can be encoded as RDF, and how the models can be queried by means of SPARQL.


Analyzing the Performance of Multilayer Neural Networks for Object Recognition

In the last two years, convolutional neural networks (CNNs) have achieved an impressive suite of results on standard recognition datasets and tasks. CNN-based features seem poised to quickly replace engineered representations, such as SIFT and HOG. However, compared to SIFT and HOG, we understand much less about the nature of the features learned by large CNNs. In this paper, we experimentally probe several aspects of CNN feature learning in an attempt to help practitioners gain useful, evidence-backed intuitions about how to apply CNNs to computer vision problems.


SenGen: Sentence Generating Neural Variational Topic Model

We present a new topic model that generates documents by sampling a topic for one whole sentence at a time, and generating the words in the sentence using an RNN decoder that is conditioned on the topic of the sentence. We argue that this novel formalism will help us not only visualize and model the topical discourse structure in a document better, but also potentially lead to more interpretable topics since we can now illustrate topics by sampling representative sentences instead of bag of words or phrases. We present a variational auto-encoder approach for learning in which we use a factorized variational encoder that independently models the posterior over topical mixture vectors of documents using a feedforward network, and the posterior over topic assignments to sentences using an RNN. Our preliminary experiments on two different datasets indicate early promise, but also expose many challenges that remain to be addressed.


Understanding packet delivery performance in dense wireless sensor networks

Wireless sensor networks promise fine-grain monitoring in a wide variety of environments. Many of these environments (e.g., indoor environments or habitats) can be harsh for wireless communication. From a networking perspective, the most basic aspect of wireless communication is the packet delivery performance: the spatio-temporal characteristics of packet loss, and its environmental dependence. These factors will deeply impact the performance of data acquisition from these networks.In this paper, we report on a systematic medium-scale (up to sixty nodes) measurement of packet delivery in three different environments: an indoor office building, a habitat with moderate foliage, and an open parking lot. Our findings have interesting implications for the design and evaluation of routing and medium-access protocols for sensor networks.


TopP-S: Persistent homology-based multi-task deep neural networks for simultaneous predictions of partition coefficient and aqueous solubility

Aqueous solubility and partition coefficient are important physical properties of small molecules. Accurate theoretical prediction of aqueous solubility and partition coefficient plays an important role in drug design and discovery. The prediction accuracy depends crucially on molecular descriptors which are typically derived from a theoretical understanding of the chemistry and physics of small molecules. This work introduces an algebraic topology-based method, called element-specific persistent homology (ESPH), as a new representation of small molecules that is entirely different from conventional chemical and/or physical representations. ESPH describes molecular properties in terms of multiscale and multicomponent topological invariants. Such topological representation is systematical, comprehensive, and scalable with respect to molecular size and composition variations. However, it cannot be literally translated into a physical interpretation. Fortunately, it is readily suitable for machine learning methods, rendering topological learning algorithms. Due to the inherent correlation between solubility and partition coefficient, a uniform ESPH representation is developed for both properties, which facilitates multi-task deep neural networks for their simultaneous predictions. This strategy leads to a more accurate prediction of relatively small datasets. A total of six datasets is considered in this work to validate the proposed topological and multitask deep learning approaches. It is demonstrated that the proposed approaches achieve some of the most accurate predictions of aqueous solubility and partition coefficient. Our software is available online at http://weilab.math.msu.edu/TopP-S/. © 2018 Wiley Periodicals, Inc.


SelCSP: A Framework to Facilitate Selection of Cloud Service Providers

With rapid technological advancements, cloud marketplace witnessed frequent emergence of new service providers with similar offerings. However, service level agreements (SLAs), which document guaranteed quality of service levels, have not been found to be consistent among providers, even though they offer services with similar functionality. In service outsourcing environments, like cloud, the quality of service levels are of prime importance to customers, as they use third-party cloud services to store and process their clients' data. If loss of data occurs due to an outage, the customer's business gets affected. Therefore, the major challenge for a customer is to select an appropriate service provider to ensure guaranteed service quality. To support customers in reliably identifying ideal service provider, this work proposes a framework, SelCSP, which combines trustworthiness and competence to estimate risk of interaction. Trustworthiness is computed from personal experiences gained through direct interactions or from feedbacks related to reputations of vendors. Competence is assessed based on transparency in provider's SLA guarantees. A case study has been presented to demonstrate the application of our approach. Experimental results validate the practicability of the proposed estimating mechanisms.


Acquiring the reflectance field of a human face

We present a method to acquire the reflectance field of a human face and use these measurements to render the face under arbitrary changes in lighting and viewpoint. We first acquire images of the face from a small set of viewpoints under a dense sampling of incident illumination directions using a light stage. We then construct a reflectance function image for each observed image pixel from its values over the space of illumination directions. From the reflectance functions, we can directly generate images of the face from the original viewpoints in any form of sampled or computed illumination. To change the viewpoint, we use a model of skin reflectance to estimate the appearance of the reflectance functions for novel viewpoints. We demonstrate the technique with synthetic renderings of a person's face under novel illumination and viewpoints.


Piecewise smooth surface reconstruction

We present a general method for automatic reconstruction of accurate, concise, piecewise smooth surface models from scattered range data. The method can be used in a variety of applications such as reverse engineering—the automatic generation of CAD models from physical objects. Novel aspects of the method are its ability to model surfaces of arbitrary topological type and to recover sharp features such as creases and corners. The method has proven to be effective, as demonstrated by a number of examples using both simulated and real data.
A key ingredient in the method, and a principal contribution of this paper, is the introduction of a new class of piecewise smooth surface representations based on subdivision. These surfaces have a number of properties that make them ideal for use in surface reconstruction: they are simple to implement, they can model sharp features concisely, and they can be fit to scattered range data using an unconstrained optimization procedure.


Computer generated animation of faces

This paper describes the representation, animation and data collection techniques that have been used to produce "realistic" computer generated half-tone animated sequences of a human face changing expression. It was determined that approximating the surface of a face with a polygonal skin containing approximately 250 polygons defined by about 400 vertices is sufficient to achieve a realistic face. Animation was accomplished using a cosine interpolation scheme to fill in the intermediate frames between expressions. This approach is good enough to produce realistic facial motion. The three-dimensional data used to describe the expressions of the face was obtained photogrammetrically using pairs of photographs.


"Is it Weird to Still Be a Virgin": Anonymous, Locally Targeted Questions on Facebook Confession Boards

People have long sought answers to questions online, typically using either anonymous or pseudonymous forums or social network platforms that primarily use real names. Systems that allow anonymous communication afford freedom to explore identity and discuss taboo topics, but can result in negative disinhibited behavior such as cyberbullying. Identifiable communication systems allows one to reach a known audience and avoid negative disinhibition, but can constrain behavior with concerns about privacy and reputation. One persistent design issue is understanding how to leverage the benefits of anonymity without suffering its drawbacks. This paper presents a case study analysis of question asking on Facebook confession boards (FCBs), a tool popular on some college campuses. FCBs present a unique configuration in which members of an offline community (e.g., a university) anonymously submit content to a moderator who posts it to a Facebook page where others in the community can view it and respond. Response is via identifiable Facebook comments and likes. Our results show users asking about taboo and stigmatized topics with local others, and receiving relevant responses with little cyberbullying or negativity.


Bitcoin Block Withholding Attack: Analysis and Mitigation

We address two problems: first, we study a variant of block withholding (BWH) attack in Bitcoins and second, we propose solutions to prevent all existing types of BWH attacks in Bitcoins. We analyze the strategies of a selfish Bitcoin miner who in connivance with one pool attacks another pool and receives reward from the former mining pool for attacking the latter. We name this attack as “sponsored block withholding attack.” We present detailed quantitative analysis of the monetary incentive that a selfish miner can earn by adopting this strategy under different scenarios. We prove that under certain conditions, the attacker can maximize her revenue by adopting some strategies and by utilizing her computing power wisely. We also show that an attacker may use this strategy for attacking both the pools for earning higher amount of incentives. More importantly, we present a strategy that can effectively counter block withholding attack in any mining pool. First, we propose a generic scheme that uses cryptographic commitment schemes to counter BWH attack. Then, we suggest an alternative implementation of the same scheme using hash function. Our scheme protects a pool from rogue miners as well as rogue pool administrators. The scheme and its variant defend against BWH attack by making it impossible for the miners to distinguish between a partial proof of work and a complete proof of work. The scheme is so designed that the administrator cannot cheat on the entire pool. The scheme can be implemented by making minor changes to existing Bitcoin protocol. We also analyze the security of the scheme.


Deep Relevance Ranking using Enhanced Document-Query Interactions

We explore several new models for document relevance ranking, building upon the Deep Relevance Matching Model (DRMM) of Guo et al. (2016). Unlike DRMM, which uses context-insensitive encodings of terms and query-document term interactions, we inject rich context-sensitive encodings throughout our models, inspired by PACRR’s (Hui et al., 2017) convolutional n-gram matching features, but extended in several ways including multiple views of query and document inputs. We test our models on datasets from the BIOASQ question answering challenge (Tsatsaronis et al., 2015) and TREC ROBUST 2004 (Voorhees, 2005), showing they outperform BM25-based baselines, DRMM, and PACRR.


BrainID: Development of an EEG-based biometric authentication system

Authentication is a crucial consideration when securing data or any kind of information system. Though existing approaches for authentication are user-friendly, they have vulnerabilities such as the possibility & criminally threatening a user. We propose a novel approach which uses Electroencephalogram (EEG) brain signals for an authentication process. Unique features of EEG data for distinguishing brain activities can potentially be used to authenticate a user. Compared to other biometric systems, this approach is very robust and more secure because response is significantly changed according to instantaneous mental condition. In the proposed approach, the system user is asked to visualize a number while corresponding EEG signals are captured. Captured signals are used to train the system, compared in the authentication process. This approach mainly focuses on the 8 to 30 Hz Alpha and Beta combined frequency band across all EEG channels, since it is the most appropriate band for EEG signals in Brain Computer Interfaces (BCI). Common Spatial Patterns (CSP) values were used as main features to train the model. Linear discriminant analysis (LDA) was used as a classification algorithm for a given set of user data. A trained set of models for each user is embedded in the system as a parameter database. Each user selects the profile attached to their trained model before the authentication session. Eventually, a trained model can authenticate a user after memorization of pre-determined four digits which the user is asked to think at the first stage of the process. The maximum accuracy recorded with the existing data was 96.97%.


Quantifying the experience of immersion in games.

Games are undoubtedly the most successful computer application yet it is not easy to attribute their success to any one particular feature. Nonetheless, when talking about games, gamers and reviewers frequently refer to the immersive experience of the game as an important aspect to be attained. However, it is not clear what immersion is and even if it is a comparable experience between different players and different games. This paper aims to develop more quantifiable and therefore objective measures of immersion. We describe a study into switching from an immersive gaming experience to another task, not in the game world. Though the degree of immersion does seem to have an impact on the ability to perform the task, the experimental approach is complex and possibly quite fragile. We therefore set out hypotheses for a similar experiment with the aim of exploring whether eyetracking and body motion provide better indicators of the degree of immersion.


Design and construction of organic computing systems

The next generation of embedded computing systems will have to meet new challenges. The systems are expected to act mainly autonomously, to dynamically adapt to changing environments and to interact with one another if necessary. Such systems are called organic. Organic Computing systems are similar to autonomic computing systems. In addition Organic Computing systems often behave life-like and are inspired by nature/biological phenomena. Design and construction of such systems brings new challenges for the software engineering process. In this paper we present a framework for design, construction and analysis of organic computing systems. It can facilitate design and construction as well as it can be used to (semi-)formally define organic properties like self-configuration or self-adaptation. We illustrate the framework on a real-world case study from production automation.


How useful are your comments?: analyzing and predicting youtube comments and comment ratings

An analysis of the social video sharing platform YouTube reveals a high amount of community feedback through comments for published videos as well as through meta ratings for these comments. In this paper, we present an in-depth study of commenting and comment rating behavior on a sample of more than 6 million comments on 67,000 YouTube videos for which we analyzed dependencies between comments, views, comment ratings and topic categories. In addition, we studied the influence of sentiment expressed in comments on the ratings for these comments using the SentiWordNet thesaurus, a lexical WordNet-based resource containing sentiment annotations. Finally, to predict community acceptance for comments not yet rated, we built different classifiers for the estimation of ratings for these comments. The results of our large-scale evaluations are promising and indicate that community feedback on already rated comments can help to filter new unrated comments or suggest particularly useful but still unrated comments.


Automated Driving in Uncertain Environments: Planning With Interaction and Uncertain Maneuver Prediction

Automated driving requires decision making in dynamic and uncertain environments. The uncertainty from the prediction originates from the noisy sensor data and from the fact that the intention of human drivers cannot be directly measured. This problem is formulated as a partially observable Markov decision process (POMDP) with the intended route of the other vehicles as hidden variables. The solution of the POMDP is a policy determining the optimal acceleration of the ego vehicle along a preplanned path. Therefore, the policy is optimized for the most likely future scenarios resulting from an interactive, probabilistic motion model for the other vehicles. Considering possible future measurements of the surrounding cars allows the autonomous car to incorporate the estimated change in future prediction accuracy in the optimal policy. A compact representation results in a low-dimensional state-space. Thus, the problem can be solved online for varying road layouts and number of vehicles. This is done with a point-based solver in an anytime fashion on a continuous state-space. Our evaluation is threefold: At first, the convergence of the algorithm is evaluated and it is shown how the convergence can be improved with an additional search heuristic. Second, we show various planning scenarios to demonstrate how the introduction of different considered uncertainties results in more conservative planning. At the end, we show online simulations for the crossing of complex (unsignalized) intersections. We can demonstrate that our approach performs nearly as good as with full prior information about the intentions of the other vehicles and clearly outperforms reactive approaches.


3D printing of robotic soft actuators with programmable bioinspired architectures

Soft actuation allows robots to interact safely with humans, other machines, and their surroundings. Full exploitation of the potential of soft actuators has, however, been hindered by the lack of simple manufacturing routes to generate multimaterial parts with intricate shapes and architectures. Here, we report a 3D printing platform for the seamless digital fabrication of pneumatic silicone actuators exhibiting programmable bioinspired architectures and motions. The actuators comprise an elastomeric body whose surface is decorated with reinforcing stripes at a well-defined lead angle. Similar to the fibrous architectures found in muscular hydrostats, the lead angle can be altered to achieve elongation, contraction, or twisting motions. Using a quantitative model based on lamination theory, we establish design principles for the digital fabrication of silicone-based soft actuators whose functional response is programmed within the material's properties and architecture. Exploring such programmability enables 3D printing of a broad range of soft morphing structures. 3D-printed soft actuators have limited motion and are far from reaching the level of complexity found in biological systems. Here the authors present a multimaterial 3D printing platform for the fabrication of soft actuators displaying a wide range of motions that are programmable.


Clump splitting via bottleneck detection and shape classification

Under-segmentation of an image with multiple objects is a common problem in image segmentation algorithms. This paper presents a novel approach for splitting clumps formed by multiple objects due to under-segmentation. The proposed algorithm includes three steps: (1) decide whether to split a candidate connected component by application-specific shape classification; (2) find a pair of points for clump splitting and (3) join the pair of selected points. In the first step, a shape classifier is applied to determine whether a connected component should be split. In the second step, a pair of points for splitting is detected using a bottleneck rule, under the assumption that the desired objects have roughly a convex shape. In the third step, the selected splitting points from step two are joined by finding the optimal splitting line between them, based on minimizing an image energy. The shape classifier is built offline via various shape features and a support vector machine. Steps two and three are applicationindependent. The performance of this method is evaluated using images from various applications. Experimental results show that the proposed approach outperforms the state-of-the-art algorithms for the clump splitting problem. & 2011 Elsevier Ltd. All rights reserved.


Answering enumeration queries with the crowd

1.1. 能否全部搞定?枚举查询 在本文中,我们思考了关系数据库管理系统 (RDBMS) 中一种最基本的运算,即利用筛选约束条件或断言 来扫描单一数据库表格;此查询枚举用户感兴趣的一 组特定项目。例如,请思考以下 SQL 查询,它要列 出可以忍耐低光环境的所有室内盆栽植物:SELECT DISTINCT name FROM Plants WHERE lightneeds = ‘low’。在使用传统的 RDBMS 并且给定数 据库状态时,此查询只有一个正确的答案,通过扫描 相关表格、筛选记录,再返回所有匹配的记录即可获 得该答案。这种方法对即便实际上无界的关系也奏效, 因为封闭世界假定指出:在查询执行之时数据库中没 有的任何记录都不存在。 相反,在 CrowdDB 等众包系统中,一旦耗尽已 存储表格中的记录时,我们可以向众人发送作业来索 取更多记录。然后问题演变为:查询结果集何时才算 完整?众包查询天生具有模糊性或拥有无界结果集, 其元组分散于网络或者仅存在于人脑。例如,我们可 以思考这样的查询:列出就业市场上现有的博士学位 应届毕业生,或者列出加利福尼亚州对绿色技术感兴 趣的企业。这种查询是利用众人力量的数据库系统的 主要用例,对发出要执行的查询的用户而言均属于劳 动密集型任务,但由于并不经常需要执行,所以不一 定值得去开发、调节和使用复杂的机器学习解决方案。 在本文中,我们将解决以下问题:“用户在众包 数据库系统的开放世界中应当如何思索枚举查询?” 我们开发的统计学工具可以帮助用户推导时间 / 成本 与完整度的权衡,还可用于推进查询执行和众包策略。


VARAN the Unbelievable: An Efficient N-version Execution Framework

With the widespread availability of multi-core processors, running multiple diversified variants or several different versions of an application in parallel is becoming a viable approach for increasing the reliability and security of software systems. The key component of such N-version execution (NVX) systems is a runtime monitor that enables the execution of multiple versions in parallel. Unfortunately, existing monitors impose either a large performance overhead or rely on intrusive kernel-level changes. Moreover, none of the existing solutions scales well with the number of versions, since the runtime monitor acts as a performance bottleneck.
 In this paper, we introduce Varan, an NVX framework that combines selective binary rewriting with a novel event-streaming architecture to significantly reduce performance overhead and scale well with the number of versions, without relying on intrusive kernel modifications.
 Our evaluation shows that Varan can run NVX systems based on popular C10k network servers with only a modest performance overhead, and can be effectively used to increase software reliability using techniques such as transparent failover, live sanitization and multi-revision execution.


Identification of influencers - Measuring influence in customer networks

Viral marketing refers to marketing techniques that use social networks to produce increases in brand awareness through self-replicating viral diffusion of messages, analogous to the spread of pathological and computer viruses. The idea has successfully been used by marketers to reach a large number of customers rapidly. If data about the customer network is available, centrality measures provide a structural measure that can be used in decision support systems to select influencers and spread viral marketing campaigns in a customer network. Usage stimulation and churn management are examples of DSS applications, where centrality of customers does play a role. The literature on network theory describes a large number of such centrality measures. A critical question is which of these measures is best to select an initial set of customers for a marketing campaign, in order to achieve a maximum dissemination of messages. In this paper, we present the results of computational experiments based on call data from a telecom company to compare different centrality measures for the diffusion of marketing messages. We found a significant lift when using central customers in message diffusion, but also found differences in the various centrality measures depending on the underlying network topology and diffusion process. The simple out-degree centrality performed well in all treatments.


Person Re-Identification by Deep Joint Learning of Multi-Loss Classification

Existing person re-identification (re-id) methods rely mostly on either localised or global feature representation alone. This ignores their joint benefit and mutual complementary effects. In this work, we show the advantages of jointly learning local and global features in a Convolutional Neural Network (CNN) by aiming to discover correlated local and global features in different context. Specifically, we formulate a method for joint learning of local and global feature selection losses designed to optimise person re-id when using only generic matching metrics such as the L2 distance. We design a novel CNN architecture for Jointly Learning Multi-Loss (JLML) of local and global discriminative feature optimisation subject concurrently to the same re-id labelled information. Extensive comparative evaluations demonstrate the advantages of this new JLML model for person re-id over a wide range of state-of-the-art re-id methods on five benchmarks (VIPeR, GRID, CUHK01, CUHK03, Market-1501).


Projection Based Weight Normalization for Deep Neural Networks

Optimizing deep neural networks (DNNs) often suffers from the ill-conditioned problem. We observe that the scaling-based weight space symmetry property in rectified nonlinear network will cause this negative effect. Therefore, we propose to constrain the incoming weights of each neuron to be unit-norm, which is formulated as an optimization problem over Oblique manifold. A simple yet efficient method referred to as projection based weight normalization (PBWN) is also developed to solve this problem. PBWN executes standard gradient updates, followed by projecting the updated weight back to Oblique manifold. This proposed method has the property of regularization and collaborates well with the commonly used batch normalization technique. We conduct comprehensive experiments on several widely-used image datasets including CIFAR-10, CIFAR-100, SVHN and ImageNet for supervised learning over the state-of-the-art convolutional neural networks, such as Inception, VGG and residual networks. The results show that our method is able to improve the performance of DNNs with different architectures consistently. We also apply our method to Ladder network for semi-supervised learning on permutation invariant MNIST dataset, and our method outperforms the state-of-the-art methods: we obtain test errors as 2.52%, 1.06%, and 0.91% with only 20, 50, and 100 labeled samples, respectively.


Connecting modalities: Semi-supervised segmentation and annotation of images using unaligned text corpora

We propose a semi-supervised model which segments and annotates images using very few labeled images and a large unaligned text corpus to relate image regions to text labels. Given photos of a sports event, all that is necessary to provide a pixel-level labeling of objects and background is a set of newspaper articles about this sport and one to five labeled images. Our model is motivated by the observation that words in text corpora share certain context and feature similarities with visual objects. We describe images using visual words, a new region-based representation. The proposed model is based on kernelized canonical correlation analysis which finds a mapping between visual and textual words by projecting them into a latent meaning space. Kernels are derived from context and adjective features inside the respective visual and textual domains. We apply our method to a challenging dataset and rely on articles of the New York Times for textual features. Our model outperforms the state-of-the-art in annotation. In segmentation it compares favorably with other methods that use significantly more labeled training data.


Reducing Patient Mortality in Hospitals : The Role of Human Resource

Developing effective health care organizations is increasingly complex as a result of demographic changes, globalization and developments in medicine. This study examines the potential contribution of organizational behavior theory and research by investigating the relationship between systems of human resource management (HRM) practices and effectiveness of patient care in hospitals. Relatively little research has been conducted to explore these issues in health care settings. In a sample of 52 hospitals in England, we examine the relationship between the HRM system and health care outcome. Specifically, we study the association between high performance HRM policies and practices and standardized patient mortality rates. The research reveals that, after controlling for prior mortality and other potentially confounding factors such as the ratio of doctors to patients, greater use of a complementary set of HRM practices has a statistically and practically significant relationship with patient mortality. The findings suggest that managers and policy makers should focus sharply on improving the functioning of relevant HR management systems in health care organizations as one important means by which to improve patient care.


Digital Calibration Techniques for Pipelined ADC ’ s

A skip and fill algorithm is developed to digitally self-calibrate pipelined analog-to-digital converters (ADC’s) in real time. The proposed digital calibration technique is applicable to capacitor-ratioed multiplying digital-to-analog converters (MDAC’s) commonly used in multi-step or pipelined ADC’s. This background calibration process can replace, in effect, a trimming procedure usually done in the factory with a hidden electronic calibration. Unlike other self-calibration techniques working in the foreground, the proposed technique is based on the concept of skipping conversion cycles randomly but filling in data later by nonlinear interpolation. This opens up the feasibility of digitally implementing calibration hardware and simplifying the task of self-calibrating multi-step or pipelined ADC’s. The proposed method improves the performance of the inherently fast ADC’s by maintaining simple system architectures. To measure errors resulting from capacitor mismatch, op amp dc gain, offset, and switch feedthrough in real time, the calibration test signal is injected in place of the input signal using a split-reference injection technique. Ultimately, the missing signal within 2/3 of the Nyquist bandwidth is recovered with 16-bit accuracy using a 44-th order polynomial interpolation, behaving essentially as an FIR filter. This work was supported by the National Science Foundation under Grant MIP-9312671.


Role of Broca's Area in Implicit Motor Skill Learning: Evidence from Continuous Theta-burst Magnetic Stimulation

Complex actions can be regarded as a concatenation of simple motor acts, arranged according to specific rules. Because the caudal part of the Broca's region (left Brodmann's area 44, BA 44) is involved in processing hierarchically organized behaviors, we aimed to test the hypothesis that this area may also play a role in learning structured motor sequences. To address this issue, we investigated the inhibitory effects of a continuous theta-burst TMS (cTBS) applied over left BA 44 in healthy subjects, just before they performed a serial RT task (SRTT). SRTT has been widely used to study motor skill learning and is also of interest because, for complex structured sequences, subjects spontaneously organize them into smaller subsequences, referred to as chunks. As a control, cTBS was applied over the vertex in another group, which underwent the same experiment. Control subjects showed both a general practice learning effect, evidenced by a progressive decrease in RT across blocks and a sequence-specific learning effect, demonstrated by a significant RT increase in a pseudorandom sequence. In contrast, when cTBS was applied over left BA 44, subjects lacked both the general practice and sequence-specific learning effects. However, surprisingly, their chunking pattern was preserved and remained indistinguishable from controls. The present study indicates that left BA 44 plays a role in motor sequence learning, but without being involved in elementary chunking. This dissociation between chunking and sequence learning could be explained if we postulate that left BA 44 intervenes in high hierarchical level processing, possibly to integrate elementary chunks together.


A 5.8-GHz radar sensor chip in 0.18-μm CMOS for non-contact vital sign detection

This paper presents a 5.8-GHz radar sensor chip for non-contact vital sign detection. The sensor chip is designed and fabricated in TSMC 0.18 μm CMOS 1P6M process. Except for the low-noise amplifier, all the active and passive components of the radar system are fully integrated in a single CMOS chip. With packaging on the printed-circuit board and connecting transmitting and receiving antennas, the radar sensor chip has been successfully demonstrated to detect the respiration and heart beat rates of a human adult.


Linear scan register allocation

We describe a new algorithm for fast global register allocation called linear scan. This algorithm is not based on graph coloring, but allocates registers to variables in a single linear-time scan of the variables' live ranges. The linear scan algorithm is considerably faster than algorithms based on graph coloring, is simple to implement, and results in code that is almost as efficient as that obtained using more complex and time-consuming register allocators based on graph coloring. The algorithm is of interest in applications where compile time is a concern, such as dynamic compilation systems, “just-in-time” compilers, and interactive development environments.


A Classification and Comparison Framework for Software Architecture Description Languages

ÐSoftware architectures shift the focus of developers from lines-of-code to coarser-grained architectural elements and their overall interconnection structure. Architecture description languages (ADLs) have been proposed as modeling notations to support architecture-based development. There is, however, little consensus in the research community on what is an ADL, what aspects of an architecture should be modeled in an ADL, and which of several possible ADLs is best suited for a particular problem. Furthermore, the distinction is rarely made between ADLs on one hand and formal specification, module interconnection, simulation, and programming languages on the other. This paper attempts to provide an answer to these questions. It motivates and presents a definition and a classification framework for ADLs. The utility of the definition is demonstrated by using it to differentiate ADLs from other modeling notations. The framework is used to classify and compare several existing ADLs, enabling us, in the process, to identify key properties of ADLs. The comparison highlights areas where existing ADLs provide extensive support and those in which they are deficient, suggesting a research agenda for the future. Index TermsÐSoftware architecture, architecture description language, component, connector, configuration, definition, classification, comparison.


Specifying Distributed Software Architectures

There is a real need for clear and sound design speci cations of distributed systems at the architectural level. This is the level of the design which deals with the high-level organisation of computational elements and the interactions between those elements. The paper presents the Darwin notation for specifying this high-level organisation. Darwin is in essence a declarative binding language which can be used to de ne hierarchic compositions of interconnected components. Distribution is dealt with orthogonally to system structuring. The language supports the speci cation of both static structures and dynamic structures which may evolve during execution. The central abstractions managed by Darwin are components and services. Services are the means by which components interact. In addition to its use in specifying the architecture of a distributed system, Darwin has an operational semantics for the elaboration of speci cations such that they may be used at runtime to direct the construction of the desired system. The paper describes the operational semantics of Darwin in terms of the -calculus, Milner's calculus of mobile processes. The correspondence between the treatment of names in the -calculus and the management of services in Darwin leads to an elegant and concise -calculus model of Darwin's operational semantics. The model is used to argue the correctness of the Darwin elaboration process. The overall objective is to provide a soundly based notation for specifying and constructing distributed software architectures. This paper will appear in the Fifth European Software Engineering Conference, ESEC '95 on 26 September 1995 in Barcelona.


An Introduction to the Aesop System

As the design of software architectures emerges as a discipline within software engineering, it becomes increasingly important to support architectural description and analysis with tools and environments. This paper provides a brief introduction to Aesop, a set of tools for developing architectural design environments that exploit architectural styles to guide software architects in producing speci c systems.


ADLs and dynamic architecture changes

Existing ADLs typically support only static architecture specification and do not provide facilities for the support of dynamically changing architectures. This paper presents a possible solution to this problem: in order to adequately support dynamic architecture changes, ADLs can leverage techniques used in dynamic programming languages. In particular, changes to ADL specifications should be interpreted. To enable interpretation, an ADL should have an architecture construction component that supports explicit and incremental specification of architectural changes, in addition to the traditional architecture description facilities. This will allow software architects to specify the changes to an architecture after it has been built. The paper expands upon the results from an ongoing project -building a development environment for CZstyle architectures.’


A two-stage short-term load forecasting approach using temperature daily profiles estimation

Electrical load forecasting plays an important role in the regular planning of power systems, in which load is influenced by several factors that must be analysed and identified prior to modelling in order to ensure better and instant load balancing between supply and demand. This paper proposes a two-stage approach for short-term electricity load forecasting. In the first stage, a set of day classes of load profiles are identified using K-means clustering algorithm alongside daily temperature estimation profiles. The proposed estimation method is particularly useful in case of lack of historical regular temperature data. While in the second stage, the stacked denoising autoencoders approach is used to build regression models able to forecast each day type independently. The obtained models are trained and evaluated using hourly electricity power data offered by Algeria’s National Electricity and Gas Company. Several models are investigated to substantiate the accuracy and effectiveness of the proposed approach.


Performance analysis of DCO-OFDM in VLC system

The performance of indoor visible light communication (VLC) systems using a direct current-biased optical orthogonal frequency division multiplexing (DCO-OFDM) scheme is investigated in this paper. The impact of nonlinearity of Light Emitting Diode (LED) and its beam angle on the VLC system performance is studied. We later analyze the effect of modulation order, number of subcarriers, signal scaling and biasing operation on the peak to average power ratio (PAPR) which is a major issue in OFDM based VLC system. Simulation results show that the bit error rate (BER) decreases as the degree of nonlinearity increases and a better BER can be achieved as the LED behavior approaches linear model. In addition, it is shown that reducing the QAM order or increasing the number of subcarriers may reduce the effect of the LED nonlinearity, thus improving the BER performance of the VLC system. Moreover, it is demonstrated that PAPR is higher for a large number of subcarriers and modulation order. Finally, the PAPR of the visible light OFDM system can significantly be reduced by employing the signal scaling combined with biasing operation.


When Does More Money Work? Examining the Role of Perceived Fairness in Pay on the Performance Quality of Crowdworkers

This research adds to the rich discussion on whether increases in payment to crowdworkers lead to increases in performance quality by introducing the concept of perceived fairness in pay (PFP). PFP refers to the belief that one is fairly compensated for their work. We examine whether PFP mediates the impact of payment amount on the performance quality of crowdworkers. We conducted a field experiment with 152 crowdworkers performing a buttonclicking (BC) task and an instructional manipulation check (IMC) task. PFP mediated the impact of payment amount on performance quality in the BC task but not in the IMC task. PFP also mediated the impact of payment amount on satisfaction and task time. Results suggest that PFP can help us better understand the relationship between payment and performance quality in crowdsourcing.


Efficient frame-sequential label propagation for video object segmentation

In this work, we present an approach for segmenting objects in videos taken in complex scenes. It propagates initial object label through the entire video by a frame-sequential manner where the initial label is usually given by the user. The proposed method has several contributions which make the propagation much more robust and accurate than other methods. First, a novel supervised motion estimation algorithm is employed between each pair of neighboring frames, by which a predicted shape model can be warped in order to segment the similar color around object boundary. Second, unlike previous methods with fixed modeling range, we design a novel range-adaptive appearance model to handle the tough problem of occlusion. Last, the paper gives a reasonable framework based on GraphCut algorithm for obtaining the final label of the object by combining the clues from both appearance and motion. In the experiments, the proposed approach is evaluated qualitatively and quantitatively with some recent methods to show it achieves state-of-art results on multiple videos from benchmark data sets.


A combined transmembrane topology and signal peptide prediction method.

An inherent problem in transmembrane protein topology prediction and signal peptide prediction is the high similarity between the hydrophobic regions of a transmembrane helix and that of a signal peptide, leading to cross-reaction between the two types of predictions. To improve predictions further, it is therefore important to make a predictor that aims to discriminate between the two classes. In addition, topology information can be gained when successfully predicting a signal peptide leading a transmembrane protein since it dictates that the N terminus of the mature protein must be on the non-cytoplasmic side of the membrane. Here, we present Phobius, a combined transmembrane protein topology and signal peptide predictor. The predictor is based on a hidden Markov model (HMM) that models the different sequence regions of a signal peptide and the different regions of a transmembrane protein in a series of interconnected states. Training was done on a newly assembled and curated dataset. Compared to TMHMM and SignalP, errors coming from cross-prediction between transmembrane segments and signal peptides were reduced substantially by Phobius. False classifications of signal peptides were reduced from 26.1% to 3.9% and false classifications of transmembrane helices were reduced from 19.0% to 7.7%. Phobius was applied to the proteomes of Homo sapiens and Escherichia coli. Here we also noted a drastic reduction of false classifications compared to TMHMM/SignalP, suggesting that Phobius is well suited for whole-genome annotation of signal peptides and transmembrane regions. The method is available at as well as at


Design of a triangular fractal patch antenna with slit for IRNSS and GAGAN applications

In this paper a triangular fractal patch antenna with slit is designed for IRNSS and GAGAN applications using ADS software. India is intended to develop a satellite based navigation systems known as Indian Regional Navigational Satellite System (IRNSS) for positioning applications. Design of IRNSS antenna at user sector is indispensable. GPS Aided and Geo Augmented Navigation (GAGAN), a satellite based augmentation system for India, erect over the GPS system is anticipated to provide the flawless navigation support over the Asia-Pacific regions. The desired antenna has been deliberate on dielectric constant εr = 4.8 and substrate thickness h = 3.05 mm. The feed location of the antenna has been selected to produce the circular polarization. The self-similar property in antenna exhibits multi-band resonant frequencies. These specifications should be satisfied at the frequency L5 (1175 MHz), L1 (1575.42 MHz) and S (2492.08 MHz).


Flame detection in video using hidden Markov models

This paper proposes a novel method to detect flames in video by processing the data generated by an ordinary camera monitoring a scene. In addition to ordinary motion and color clues, flame flicker process is also detected by using a hidden Markov model. Markov models representing the flame and flame colored ordinary moving objects are used to distinguish flame flicker process from motion of flame colored moving objects. Spatial color variations in flame are also evaluated by the same Markov models, as well. These clues are combined to reach a final decision. False alarms due to ordinary motion of flame colored moving objects are greatly reduced when compared to the existing video based fire detection systems.


Sockets for Limb Prostheses: A Review of Existing Technologies and Open Challenges

In the prosthetics field, one of the most important bottlenecks is still the human-machine interface, namely the socket. Indeed, a large number of amputees still rejects prostheses or points out a low satisfaction level, due to a sub-optimal interaction between the socket and the residual limb tissues. The aim of this paper is to describe the main parameters (displacements, stress, volume fluctuations and temperature) affecting the stump-socket interface and reducing the comfort/stability of limb prostheses. In this review, a classification of the different socket types proposed in the literature is reported, together with an analysis of advantages and disadvantages of the different solutions, from multiple viewpoints. The paper then describes the technological solutions available to face an altered distribution of stresses on the residual limb tissues, volume fluctuations affecting the stump overtime and temperature variations affecting the residual tissues within the socket. The open challenges in this research field are highlighted and the possible future routes are discussed, towards the ambitious objective of achieving an advanced socket able to self-adapt in real-time to the complex interplay of factors affecting the stump, during both static and dynamic tasks.


Visual inertial odometry for quadrotors on SE(3)

The combination of on-board sensors measurements with different statistical characteristics can be employed in robotics for localization and control, especially in GPS-denied environments. In particular, most aerial vehicles are packaged with low cost sensors, important for aerial robotics, such as camera, a gyroscope, and an accelerometer. In this work, we develop a visual inertial odometry system based on the Unscented Kalman Filter (UKF) acting on the Lie group SE(3), such to obtain an unique, singularity-free representation of a rigid body pose. We model this pose with the Lie group SE(3) and model the noise on the corresponding Lie algebra. Moreover, we extend the concepts used in the standard UKF formulation, such as state uncertainty and modeling, to correctly incorporate elements that do not belong to an Euclidean space such as the Lie group members. In this analysis, we use the parallel transport, which requires us to explicitly consider SE(3) as representing rigid bodies though the use of the affine connection. We present experimental results to show the effectiveness of the proposed approach for state estimation of a quadrotor platform.


Sleep and autism spectrum disorders.

Sleep disorders are common in children with autism spectrum disorders and have a significant effect on daytime function and parental stress. The cornerstone of treatment is to establish the cause of the sleep concern, which is often multifactorial. Identifying and treating sleep disorders may result not only in more consolidated sleep, more rapid time to fall asleep, and avoidance of night waking but also favorably affect daytime behavior and parental stress. Targeting effective treatment strategies is dependent on understanding the underlying causes of sleep problems in children with Autism spectrum disorders, therefore further research is paramount.


Optimizing distributions over molecular space . An Objective-Reinforced Generative Adversarial Network for Inverse-design Chemistry ( ORGANIC )

Molecular discovery seeks to generate chemical species tailored to very specific needs. In this paper, we present ORGANIC, a framework based on Objective-Reinforced Generative Adversarial Networks (ORGAN), capable of producing a distribution over molecular space that matches with a certain set of desirable metrics. This methodology combines two successful techniques from the machine learning community: a Generative Adversarial Network (GAN), to create non-repetitive sensible molecular species, and Reinforcement Learning (RL), to bias this generative distribution towards certain attributes. We explore several applications, from optimization of random physicochemical properties to candidates for drug discovery and organic photovoltaic material design. 1


Opportunities and Challenges of Switched Reluctance Motor Drives for Electric Propulsion: A Comparative Study

Selection of the proper electric traction drive is an important step in design and performance optimization of electrified powertrains. Due to the use of high energy magnets, permanent magnet synchronous machines (PMSM) have been the primary choice in the electric traction motor market. However, manufacturers are very interested to find a permanent magnet-free alternative as a fallback option due to unstable cost of rare-earth metals and fault tolerance issues related to the constant permanent magnet excitation. In this paper, a new comprehensive review of electric machines (EMs) that includes various new switched reluctance machine topologies in addition to conventional EMs such as PMSM, induction machine, synchronous reluctance machine (SynRel), and PM-assisted SynRel is presented. This paper is based on performances such as power density, efficiency, torque ripple, vibration and noise, and fault tolerance. These systematic examinations prove that recently proposed magnetic configurations such as double-stator switched reluctance machine can be a reasonable substitute for permanent magnet machines in electric traction applications.


Supervised Learning of Semantics-Preserving Hashing via Deep Neural Networks for Large-Scale Image Search

This paper presents a supervised deep hashing approach that constructs binary hash codes from labeled data for large-scale image search. We assume that semantic labels are governed by a set of latent attributes in which each attribute can be on or off, and classification relies on these attributes. Based on this assumption, our approach, dubbed supervised semanticspreserving deep hashing (SSDH), constructs hash functions as a latent layer in a deep network in which binary codes are learned by the optimization of an objective function defined over classification error and other desirable properties of hash codes. With this design, SSDH has a nice property that classification and retrieval are unified in a single learning model, and the learned binary codes not only preserve the semantic similarity between images but also are efficient for image search. Moreover, SSDH performs joint learning of image representations, hash codes, and classification in a pointwised manner and thus is naturally scalable to large-scale datasets. SSDH is simple and can be easily realized by a slight modification of an existing deep architecture for classification; yet it is effective and outperforms other unsupervised and supervised hashing approaches on several benchmarks and one large dataset comprising more than 1 million images.


Bank Customer Churn Prediction Based on Support Vector Machine: Taking a Commercial Bank's VIP Customer Churn as the Example

Customer churn analysis and prediction play an important role in customer relationship management and improve benefit of enterprise. According to the bank's customer churn data which is large scale and imbalance, this paper presented a support vector machine model to predict customer churn. The method was compared with artificial neural network, decision tree, logistic regression and naive Bayesian classifier regarding customer churn prediction for a commercial bank's VIP customers. It is found that the method has the best accuracy rate, hit rate, covering rate and lift coefficient, and provides an effective measurement for bank's customer churn prediction.


SHOP2: An HTN Planning System

The SHOP2 planning system received one of the awards for distinguished performance in the 2002 International Planning Competition. This paper describes the features of SHOP2 which enabled it to excel in the competition, especially those aspects of SHOP2 that deal with temporal and metric planning domains.


Extending the Hierarchical Deep Reinforcement Learning framework

iv


Unsupervised Image-to-Image Translation Networks

Most of the existing image-to-image translation frameworks—mapping an image in one domain to a corresponding image in another—are based on supervised learning, i.e., pairs of corresponding images in two domains are required for learning the translation function. This largely limits their applications, because capturing corresponding images in two different domains is often a difficult task. To address the issue, we propose the UNsupervised Image-to-image Translation (UNIT) framework, which is based on variational autoencoders and generative adversarial networks. The proposed framework can learn the translation function without any corresponding images in two domains. We enable this learning capability by combining a weight-sharing constraint and an adversarial training objective. Through visualization results from various unsupervised image translation tasks, we verify the effectiveness of the proposed framework. An ablation study further reveals the critical design choices. Moreover, we apply the UNIT framework to the unsupervised domain adaptation task and achieve better results than competing algorithms do in benchmark datasets.


Process scheduling under uncertainty: Review and challenges

Uncertainty is a very important concern in production scheduling since it can cause infeasibilities and production disturbances. Thus scheduling nder uncertainty has received a lot of attention in the open literature in recent years from chemical engineering and operations research communities. he purpose of this paper is to review the main methodologies that have been developed to address the problem of uncertainty in production cheduling as well as to identify the main challenges in this area. The uncertainties in process scheduling are first analyzed, and the different athematical approaches that exist to describe process uncertainties are classified. Based on the different descriptions for the uncertainties, lternative scheduling approaches and relevant optimization models are reviewed and discussed. Further research challenges in the field of process cheduling under uncertainty are identified and some new ideas are discussed. 2007 Elsevier Ltd. All rights reserved.


Diagnosis and compensation of amplitude imbalance, imperfect quadrant and offset in resolver signals

In this paper, a new method for detecting some errors in resolver signals is presented. Sin and cosine signals in resolver to digital converter's (RDC's) input might have errors, such as amplitude imbalance, imperfect quadrant or DC offset. Like other sensors some defects in mechanical structure and electrical or magnetic circuits cause to these errors in resolver output signals. The amplitude and phase of resolver output signals and consequently calculated angle are affected by these errors at any moment. Resolver output signals are more affected in their peak points than the other points. These peak points are easier and more accurate than the other points for analyzing, too. It is obvious that any error has unique effects on the signals. Therefore, by analyzing the effect on signals' peak points the error type and the value can be detected. To avoid wrong detection, error signal is defined, which detects the per unit signals deviation from the unit circle. Also, for error detection, there is no need to interrupt converter's operation. The proposed method is simulated in Matlab/Simulink environment, and the obtained results validate its effectiveness. Also, it is simulated on TMS320F2812 DSP using CCS 3.3, and the results are presented. Furthermore, by implementing the present RDC on motor controller DSP, it will be a low-cost approach.


A Key Characteristic of Sex Differences in the Developing Brain: Greater Variability in Brain Structure of Boys than Girls.

In many domains, including cognition and personality, greater variability is observed in males than in females in humans. However, little is known about how variability differences between sexes are represented in the brain. The present study tested whether there is a sex difference in variance in brain structure using a cohort of 643 males and 591 females aged between 3 and 21 years. The broad age-range of the sample allowed us to test if variance differences in the brain differ across age. We observed significantly greater male than female variance for several key brain structures, including cerebral white matter and cortex, hippocampus, pallidum, putamen, and cerebellar cortex volumes. The differences were observed at both upper and lower extremities of the distributions and appeared stable across development. These findings move beyond mean levels by showing that sex differences were pronounced for variability, thereby providing a novel perspective on sex differences in the developing brain.