zeta-alpha-ai/NanoSCIDOCS huggingface dataset:
In recent years we have seen a tremendous growth in the volume of text documents available on the Internet, digital libraries, news sources, and company-wide intrane ts. Automatic text categorization, which is the task of assigning text documents to pre-specified classes (topics o r themes) of documents, is an important task that can help both in organizing as well as in finding information on these h uge resources. Text categorization presents unique challenges due to the large number of attributes present in t he data set, large number of training samples, and attribute dependencies. In this paper we focus on a simple linear-time centroid-based document classification algorithm, that despite its simplicity and robust performance, has not been extensively studied and analyzed. Our extensive experiments show that this centroid-based classifier consi stently and substantially outperforms other algorithms su ch as Naive Bayesian, k-nearest-neighbors, and C4.5, on a wide range of datasets. O ur analysis shows that the similarity measure used by the centroid-based scheme allows it to class ify new document based on how closely its behavior matches the behavior of the documents belonging to differen t classes, as measured by the average similarity between the documents. This matching allows it to dynamically adjus t for classes with different densities. Furthermore, our analysis shows that the similarity measure of the centroidbased scheme accounts for dependencies between the terms in the different classes. We believe that this feature is the reason why it consistently outperforms other classifiers th at cannot take these dependencies into account.
Neural machine translation (NMT) models are able to partially learn syntactic information from sequential lexical information. Still, some complex syntactic phenomena such as prepositional phrase attachment are poorly modeled. This work aims to answer two questions: 1) Does explicitly modeling source or target language syntax help NMT? 2) Is tight integration of words and syntax better than multitask training? We introduce syntactic information in the form of CCG supertags either in the source as an extra feature in the embedding, or in the target, by interleaving the target supertags with the word sequence. Our results on WMT data show that explicitly modeling syntax improves machine translation quality for English↔German, a high-resource pair, and for English↔Romanian, a lowresource pair and also several syntactic phenomena including prepositional phrase attachment. Furthermore, a tight coupling of words and syntax improves translation quality more than multitask training.
Distinguishing between natural images (NIs) and computer-generated (CG) images by naked human eyes is difficult. In this paper, we propose an effective method based on a convolutional neural network (CNN) for this fundamental image forensic problem. Having observed the rather limited performance of training existing CCNs from scratch or fine-tuning pre-trained network, we design and implement a new and appropriate network with two cascaded convolutional layers at the bottom of a CNN. Our network can be easily adjusted to accommodate different sizes of input image patches while maintaining a fixed depth, a stable structure of CNN, and a good forensic performance. Considering the complexity of training CNNs and the specific requirement of image forensics, we introduce the so-called local-to-global strategy in our proposed network. Our CNN derives a forensic decision on local patches, and a global decision on a full-sized image can be easily obtained via simple majority voting. This strategy can also be used to improve the performance of existing methods that are based on hand-crafted features. Experimental results show that our method outperforms existing methods, especially in a challenging forensic scenario with NIs and CG images of heterogeneous origins. Our method also has good robustness against typical post-processing operations, such as resizing and JPEG compression. Unlike previous attempts to use CNNs for image forensics, we try to understand what our CNN has learned about the differences between NIs and CG images with the aid of adequate and advanced visualization tools.
The development of radar signal processing algorithms for target tracking and higher-level automotive applications is mainly done based on real radar data. A data basis has to be acquired during cost-expensive and time-consuming test runs. For a comparably simple application like the adaptive cruise control (ACC), the variety of significant traffic situations can sufficiently be covered by test runs. But for more advanced applications like intersection assistance, the effort for the acquisition of a representative set of radar data will be unbearable. In this paper, we propose a way of simulating radar target lists in a realistic but computationally undemanding way, which will allow to significantly reduce the amount of real radar data needed
Using validated carving techniques, we show that popular operating systems (e.g. Windows, Linux, and OSX) frequently have residual IP packets, Ethernet frames, and associated data structures present in system memory from long-terminated network traffic. Such information is useful for many forensic purposes including establishment of prior connection activity and services used; identification of other systems present on the system’s LAN or WLAN; geolocation of the host computer system; and cross-drive analysis. We show that network structures can also be recovered from memory that is persisted onto a mass storage medium during the course of system swapping or hibernation. We present our network carving techniques, algorithms and tools, and validate these against both purpose-built memory images and a readily available forensic corpora. These techniques are valuable to both forensics tasks, particularly in analyzing mobile devices, and to cyber-security objectives such as malware analysis. Published by Elsevier Ltd.
Android, the fastest growing mobile operating system released in November 2007, boasts of a staggering 1.4 billion active users. Android users are susceptible to malicious applications that can hack into their personal data due to the lack of careful monitoring of their in-device security. There have been numerous works on devising malware detection methods. However, none of earlier works are conclusive enough for direct application and lack experimental validation. In this paper, we have investigated the natures and identities of malicious applications and devised two novel detection approaches for detection: network-based detection and system call based detection approaches. To evaluate our proposed approaches, we performed experiments on a subset of 1260 malwares, acquired from Android Malware Genome Project, a malware database created by Y. Zhou et al. [1] and 227 non-malware (benign) applications. Results show that our system call based approach is able to detect malwares with an accuracy of 87% which is quite significant in general malware detection context. Our proposed detection approaches along with the experimental results will provide security professionals with more precise and quantitative approaches in their investigations of mobile malwares on Android systems.
With over 50 billion downloads and more than 1.3 million apps in Google’s official market, Android has continued to gain popularity amongst smartphone users worldwide. At the same time there has been a rise in malware targeting the platform, with more recent strains employing highly sophisticated detection avoidance techniques. As traditional signature based methods become less potent in detecting unknown malware, alternatives are needed for timely zero-day discovery. Thus this paper proposes an approach that utilizes ensemble learning for Android malware detection. It combines advantages of static analysis with the efficiency and performance of ensemble machine learning to improve Android malware detection accuracy. The machine learning models are built using a large repository of malware samples and benign apps from a leading antivirus vendor. Experimental results and analysis presented shows that the proposed method which uses a large feature space to leverage the power of ensemble learning is capable of 97.3 % to 99% detection accuracy with very low false positive rates. Keywordsmobile security; Android; malware detection; ensemble learning; static analysis; machine learning; data mining; random forest
The sharp increase in the number of smartphones on the market, with the Android platform posed to becoming a market leader makes the need for malware analysis on this platform an urgent issue.
 In this paper we capitalize on earlier approaches for dynamic analysis of application behavior as a means for detecting malware in the Android platform. The detector is embedded in a overall framework for collection of traces from an unlimited number of real users based on crowdsourcing. Our framework has been demonstrated by analyzing the data collected in the central server using two types of data sets: those from artificial malware created for test purposes, and those from real malware found in the wild. The method is shown to be an effective means of isolating the malware and alerting the users of a downloaded malware. This shows the potential for avoiding the spreading of a detected malware to a larger community.
The popularity and adoption of smart phones has greatly stimulated the spread of mobile malware, especially on the popular platforms such as Android. In light of their rapid growth, there is a pressing need to develop effective solutions. However, our defense capability is largely constrained by the limited understanding of these emerging mobile malware and the lack of timely access to related samples. In this paper, we focus on the Android platform and aim to systematize or characterize existing Android malware. Particularly, with more than one year effort, we have managed to collect more than 1,200 malware samples that cover the majority of existing Android malware families, ranging from their debut in August 2010 to recent ones in October 2011. In addition, we systematically characterize them from various aspects, including their installation methods, activation mechanisms as well as the nature of carried malicious payloads. The characterization and a subsequent evolution-based study of representative families reveal that they are evolving rapidly to circumvent the detection from existing mobile anti-virus software. Based on the evaluation with four representative mobile security software, our experiments show that the best case detects 79.6% of them while the worst case detects only 20.2% in our dataset. These results clearly call for the need to better develop next-generation anti-mobile-malware solutions.
This paper presents the technique for increasing bandwidth of rectangular patch antenna from 0.88 GHz (7.76 - 8.64 GHz) to 6.75 GHz (3.49 - 10.24 GHz). This technique use inset feed patch antenna with modified ground plane for achieved widest bandwidth. We will propose three types of rectangular patch antenna: the simple rectangular patch fed by microstrip line, inset feed rectangular patch and inset feed rectangular patch with modifies ground plane. The final simulation result show that the lower edge of frequency is moved down from 7.76 GHz to 3.49 GHz and the higher edge of frequency is shifted up from 8.64 GHz to 10.24 GHz, which is the one selection for increasing bandwidth of rectangular patch antenna for wideband. Details of the increasing bandwidth of microstrip patch antenna are described, and simulation results for obtained wideband performance are presented by using IE3D Zeland software.
Context is a key issue in interaction between human and computer, describing the surrounding facts that add meaning. In mobile computing research published the parameter location is most often used to approximate context and to implement context-aware applications. We propose that ultra-mobile computing, characterized by devices that are operational and operated while on the move (e.g. PDAs, mobile phones, wearable computers), can significantly benefit from a wider notion of context. To structure the field we introduce a working model for context, discuss mechanisms to acquire context beyond location, and application of context-awareness in ultra-mobile computing. We investigate the utility of sensors for context-awareness and present two prototypical implementations-a light sensitive display and an orientation aware PDA interface. The concept is then extended to a model for sensor fusion to enable more sophisticated context recognition. Based on an implementation of the model an experiment is described and the feasibility of the approach is demonstrated. Further we explore fusion of sensors for acquisition of information on more sophisticated contexts. 1 Introduction Context is " that which surrounds, and gives meaning to something else " =. Various areas of computer science have been investigating this concept over the last 40 years, to relate information processing and communication to aspects of the situations in which such processing occurs. Most notably, context is a key concept in Natural Language Processing and more generally in Human-Computer Interaction. For instance, state of the art graphical user interfaces use context to adapt menus to contexts such as user preference and dialogue status. A new domain, in which context currently receives growing attention, is mobile computing. While a first wave of mobile computing was based on portable general-purpose computers and primarily focussed on location transparency, a second wave is now based on ultra-mobile devices and an interest in relating these to their surrounding situation of usage. Ultra-mobile devices are a new class of small mobile computer, defined as computing devices that are operational and operated while on the move, and characterized by a shift from general-purpose computing to task-specific support. Ultra-mobile devices comprise for instance Personal Digital Assistants (PDAs), mobile phones, and wearable computers. A primary concern of context-awareness in mobile computing is awareness of the physical environment surrounding a user and their ultra-mobile device. In recent work, this concern has been addressed by implementation of location-awareness, for instance based on global positioning, or the use of beacons. Location …
A novel system for the location of people in an office environment is described. Members of staff wear badges that transmit signals providing information about their location to a centralized location service, through a network of sensors. The paper also examines alternative location techniques, system design issues and applications, particularly relating to telephone call routing. Location systems raise concerns about the privacy of an individual and these issues are also addressed.
Significant progress has been made in recent years in the development of microwave tomographic imaging systems for medical applications. In order to design an appropriate microwave imaging system for industrial applications, and to interpret the images produced, the materials under imaging need to be characterised. In this paper, we describe the use of open-ended coaxial probes for the measurement of dielectric properties of liquids at frequencies between 400MHz and 20GHz. The results obtained using the Misra-Blackham model for a number of liquids including water of different salinity are compared with those published in the literature showing a good agreement. For saline water, in particular, the frequency of the minimum loss depends on the salinity. It may change from 1.5GHz for the inclusion of 0.2% NaCl to 7GHz for the inclusion of 3.5% NaCl. The real part of the permittivity may also change by approximately 50% from 400MHz to 20GHz.
High-resolution satellite imagery has been increasingly used on remote sensing classification problems. One of the main factors is the availability of this kind of data. Despite the high availability, very little effort has been placed on the zebra crossing classification problem. In this letter, crowdsourcing systems are exploited in order to enable the automatic acquisition and annotation of a large-scale satellite imagery database for crosswalks related tasks. Then, this data set is used to train deep-learning-based models in order to accurately classify satellite images that contain or not contain zebra crossings. A novel data set with more than 240000 images from 3 continents, 9 countries, and more than 20 cities was used in the experiments. The experimental results showed that freely available crowdsourcing data can be used to accurately (97.11%) train robust models to perform crosswalk classification on a global scale.
A 10-point plan toward fashioning a proposal to ban some---if not all---lethal autonomous weapons.
This paper introduces a novel Gabor-Fisher (1936) classifier (GFC) for face recognition. The GFC method, which is robust to changes in illumination and facial expression, applies the enhanced Fisher linear discriminant model (EFM) to an augmented Gabor feature vector derived from the Gabor wavelet representation of face images. The novelty of this paper comes from 1) the derivation of an augmented Gabor feature vector, whose dimensionality is further reduced using the EFM by considering both data compression and recognition (generalization) performance; 2) the development of a Gabor-Fisher classifier for multi-class problems; and 3) extensive performance evaluation studies. In particular, we performed comparative studies of different similarity measures applied to various classifiers. We also performed comparative experimental studies of various face recognition schemes, including our novel GFC method, the Gabor wavelet method, the eigenfaces method, the Fisherfaces method, the EFM method, the combination of Gabor and the eigenfaces method, and the combination of Gabor and the Fisherfaces method. The feasibility of the new GFC method has been successfully tested on face recognition using 600 FERET frontal face images corresponding to 200 subjects, which were acquired under variable illumination and facial expressions. The novel GFC method achieves 100% accuracy on face recognition using only 62 features.
We present an unsupervised technique for visual learning, which is based on density estimation in high-dimensional spaces using an eigenspace decomposition. Two types of density estimates are derived for modeling the training data: a multivariate Gaussian (for unimodal distributions) and a Mixture-of-Gaussians model (for multimodal distributions). These probability densities are then used to formulate a maximum-likelihood estimation framework for visual search and target detection for automatic object recognition and coding. Our learning technique is applied to the probabilistic visual modeling, detection, recognition, and coding of human faces and nonrigid objects, such as hands.
A multilevel boost power factor correction (PFC) rectifier is presented in this paper controlled by cascaded controller and multicarrier pulse width modulation technique. The presented topology has less active semiconductor switches compared to similar ones reducing the number of required gate drives that would shrink the manufactured box significantly. A simple controller has been implemented on the studied converter to generate a constant voltage at the output while generating a five-level voltage waveform at the input without connecting the load to the neutral point of the dc bus capacitors. Multicarrier pulse-width modulation technique has been used to produce switching pulses from control signal at a fixed switching frequency. Multilevel voltage waveform harmonics has been analyzed comprehensively which affects the harmonic contents of input current and the size of required filters directly. Full experimental results confirm the good dynamic performance of the proposed five-level PFC boost rectifier in delivering power from ac grid to the dc loads while correcting the power factor at the ac side as well as reducing the current harmonics remarkably.
Minutiae, as the essential features of fingerprints, play a significant role in fingerprint recognition systems. Most existing minutiae extraction methods are based on a series of hand-defined preprocesses such as binarization, thinning and enhancement. However, these preprocesses require strong prior knowledge and are always lossy operations. And that will lead to dropped or false extractions of minutiae. In this paper, a novel minutiae extraction approach based on deep convolutional neural networks is proposed, which directly extract minutiae on raw fingerprint images without any preprocess since we tactfully take the advantage of the strong representative capacity of deep convolutional neural networks. Minutiae can be effectively extracted due to the well designed architectures. Furthermore, the accuracy is guaranteed in that the comprehensive estimate is made to eliminate spurious minutiae. Moreover, a number of implement skills are employed both to avoid overfitting and to improve the robustness. This approach makes a good performance because it not only makes all use of information in fingerprint images but also learns the minutiae patterns from large amounts of data. Comparisons are made with previous works and a widely applied commercial fingerprint identification system. Results show that our approach performs better both in accuracy and robustness.
New regulations impose more stringent limits on current harmonics injected by power converters that are achieved with pulsewidth-modulated (PWM) rectifiers. In addition, several applications demand the capability of power regeneration to the power supply. This work presents the state of the art in the field of regenerative rectifiers with reduced input harmonics and improved power factor. Regenerative rectifiers are able to deliver energy back from the dc side to the ac power supply. Topologies for single- and three-phase power supplies are considered with their corresponding control strategies. Special attention is given to the application of voltage- and current-source PWM rectifiers in different processes with a power range from a few kilowatts up to several megawatts. This paper shows that PWM regenerative rectifiers are a highly developed and mature technology with a wide industrial acceptance.
This paper describes an integrated frequency multiplier, implemented as a Gilbert cell based frequency doubler in a 130 nm SiGe BiCMOS technology. The circuit demonstrates a 3 dB bandwidth of 97–134GHz with peak output power of 1 dBm for 1 dBm input power. The fundamental suppression, measured at the single-ended output, is better than 21 dBc while the frequency doubler consumes 69mW from a 3.3V supply. The doubler is preceded by a differential amplifier functioning as an active balun to generate a differential signal for the Gilbert cell.
Given a large dataset of images, we seek to automatically determine the visually similar object and scene classes together with their image segmentation. To achieve this we combine two ideas: (i) that a set of segmented objects can be partitioned into visual object classes using topic discovery models from statistical text analysis; and (ii) that visual object classes can be used to assess the accuracy of a segmentation. To tie these ideas together we compute multiple segmentations of each image and then: (i) learn the object classes; and (ii) choose the correct segmentations. We demonstrate that such an algorithm succeeds in automatically discovering many familiar objects in a variety of image datasets, including those from Caltech, MSRC and LabelMe.
In this paper, we present an approach for learning a visual representation from the raw spatiotemporal signals in videos. Our representation is learned without supervision from semantic labels. We formulate our method as an unsupervised sequential verification task, i.e., we determine whether a sequence of frames from a video is in the correct temporal order. With this simple task and no semantic labels, we learn a powerful visual representation using a Convolutional Neural Network (CNN). The representation contains complementary information to that learned from supervised image datasets like ImageNet. Qualitative results show that our method captures information that is temporally varying, such as human pose. When used as pre-training for action recognition, our method gives significant gains over learning without external data on benchmark datasets like UCF101 and HMDB51. To demonstrate its sensitivity to human pose, we show results for pose estimation on the FLIC and MPII datasets that are competitive, or better than approaches using significantly more supervision. Our method can be combined with supervised representations to provide an additional boost in accuracy.
Accurate and early diagnosis of Alzheimer’s disease (AD) plays important role for patient care and development of future treatment. Structural and functional neuroimages, such as magnetic resonance images (MRI) and positron emission tomography (PET), are providing powerful imaging modalities to help understand the anatomical and functional neural changes related to AD. In recent years, machine learning methods have been widely studied on analysis of multi-modality neuroimages for quantitative evaluation and computer-aided-diagnosis (CAD) of AD. Most existing methods extract the hand-craft imaging features after image preprocessing such as registration and segmentation, and then train a classifier to distinguish AD subjects from other groups. This paper proposes to construct cascaded convolutional neural networks (CNNs) to learn the multi-level and multimodal features of MRI and PET brain images for AD classification. First, multiple deep 3D-CNNs are constructed on different local image patches to transform the local brain image into more compact high-level features. Then, an upper high-level 2D-CNN followed by softmax layer is cascaded to ensemble the high-level features learned from the multi-modality and generate the latent multimodal correlation features of the corresponding image patches for classification task. Finally, these learned features are combined by a fully connected layer followed by softmax layer for AD classification. The proposed method can automatically learn the generic multi-level and multimodal features from multiple imaging modalities for classification, which are robust to the scale and rotation variations to some extent. No image segmentation and rigid registration are required in pre-processing the brain images. Our method is evaluated on the baseline MRI and PET images of 397 subjects including 93 AD patients, 204 mild cognitive impairment (MCI, 76 pMCI +128 sMCI) and 100 normal controls (NC) from Alzheimer’s Disease Neuroimaging Initiative (ADNI) database. Experimental results show that the proposed method achieves an accuracy of 93.26% for classification of AD vs. NC and 82.95% for classification pMCI vs. NC, demonstrating the promising classification performance.
The two areas of online transaction processing (OLTP) and online analytical processing (OLAP) present different challenges for database architectures. Currently, customers with high rates of mission-critical transactions have split their data into two separate systems, one database for OLTP and one so-called data warehouse for OLAP. While allowing for decent transaction rates, this separation has many disadvantages including data freshness issues due to the delay caused by only periodically initiating the Extract Transform Load-data staging and excessive resource consumption due to maintaining two separate information systems. We present an efficient hybrid system, called HyPer, that can handle both OLTP and OLAP simultaneously by using hardware-assisted replication mechanisms to maintain consistent snapshots of the transactional data. HyPer is a main-memory database system that guarantees the ACID properties of OLTP transactions and executes OLAP query sessions (multiple queries) on the same, arbitrarily current and consistent snapshot. The utilization of the processor-inherent support for virtual memory management (address translation, caching, copy on update) yields both at the same time: unprecedentedly high transaction rates as high as 100000 per second and very fast OLAP query response times on a single system executing both workloads in parallel. The performance analysis is based on a combined TPC-C and TPC-H benchmark.
We present a stacked-FET monolithic millimeter-wave (mmW) integrated circuit Doherty power amplifier (DPA). The DPA employs a novel asymmetrical stack gate bias to achieve high power and high efficiency at 6-dB power back-off (PBO). The circuit is fabricated in a 0.15-µm enhancement mode (E-mode) Gallium Arsenide (GaAs) process. Experimental results demonstrate output power at 1-dB gain compression (P1dB) of 28.2 dBm, peak power added efficiency (PAE) of 37% and PAE at 6-dB PBO of 27% at 28 GHz. Measured small signal gain is 15 dB while the 3-dB bandwidth covers from 25.5 to 29.5 GHz. Using digital predistortion (DPD) with a 20 MHz 64 QAM modulated signal, an adjacent channel power ratio (ACPR) of −46 dBc has been observed.
We introduce an autoregressive attention mechanism for parallelizable characterlevel sequence modeling. We use this method to augment a neural model consisting of blocks of causal convolutional layers connected by highway network skip connections. We denote the models with and without the proposed attention mechanism respectively as Highway Causal Convolution (Causal Conv) and Autoregressive-attention Causal Convolution (ARA-Conv). The autoregressive attention mechanism crucially maintains causality in the decoder, allowing for parallel implementation. We demonstrate that these models, compared to their recurrent counterparts, enable fast and accurate learning in character-level NLP tasks. In particular, these models outperform recurrent neural network models in natural language correction and language modeling tasks, and run in a fraction of the time.
A broadband printed quadrifilar helical antenna employing a novel compact feeding circuit is proposed in this paper. This antenna presents an excellent axial ratio over a wide beamwidth, with a 29% bandwidth. A specific feeding circuit based on an aperture-coupled transition and including two 90° surface mount hybrids has been designed to be integrated with the quadrifilar antenna. Over the bandwidth, the measured reflection coefficient of the antenna fed by the wideband compact circuit has been found to be equal to or lower than -12 dB and the maximum gain varies between 1.5 and 2.7 dBic from 1.18 to 1.58 GHz. The half-power beamwidth is 150°, with an axial ratio below 3 dB over this range. The compactness of the feeding circuit allows small element spacing in array arrangements.
Stochastic Gradient Descent (SGD) has become popular for solving large scale supervised machine learning optimization problems such as SVM, due to their strong theoretical guarantees. While the closely related Dual Coordinate Ascent (DCA) method has been implemented in various software packages, it has so far lacked good convergence analysis. This paper presents a new analysis of Stochastic Dual Coordinate Ascent (SDCA) showing that this class of methods enjoy strong theoretical guarantees that are comparable or better than SGD. This analysis justifies the effectiveness of SDCA for practical applications.
Many classical algorithms are found until several years later to outlive the confines in which they were conceived, and continue to be relevant in unforeseen settings. In this paper, we show that SVRG is one such method: originally designed for strongly convex objectives, is also very robust under non-strongly convex or sum-of-non-convex settings. If f(x) is a sum of smooth, convex functions but f is not strongly convex (such as Lasso or logistic regression), we propose a variant SVRG that makes a novel choice of growing epoch length on top of SVRG. SVRG is a direct, faster variant of SVRG in this setting. If f(x) is a sum of non-convex functions but f is strongly convex, we show that the convergence of SVRG linearly depends on the non-convexity parameter of the summands. This improves the best known result in this setting, and gives better running time for stochastic PCA.
Stochastic gradient descent is popular for large scale optimization but has slow convergence asymptotically due to the inherent variance. To remedy this problem, we introduce an explicit variance reduction method for stochastic gradient descent which we call stochastic variance reduced gradient (SVRG). For smooth and strongly convex functions, we prove that this method enjoys the same fast convergence rate as those of stochastic dual coordinate ascent (SDCA) and Stochastic Average Gradient (SAG). However, our analysis is significantly simpler and more intuitive. Moreover, unlike SDCA or SAG, our method does not require the storage of gradients, and thus is more easily applicable to complex problems such as some structured prediction problems and neural network learning.
Nonconvex and nonsmooth problems have recently received considerable attention in signal/image processing, statistics and machine learning. However, solving the nonconvex and nonsmooth optimization problems remains a big challenge. Accelerated proximal gradient (APG) is an excellent method for convex programming. However, it is still unknown whether the usual APG can ensure the convergence to a critical point in nonconvex programming. In this paper, we extend APG for general nonconvex and nonsmooth programs by introducing a monitor that satisfies the sufficient descent property. Accordingly, we propose a monotone APG and a nonmonotone APG. The latter waives the requirement on monotonic reduction of the objective function and needs less computation in each iteration. To the best of our knowledge, we are the first to provide APG-type algorithms for general nonconvex and nonsmooth problems ensuring that every accumulation point is a critical point, and the convergence rates remain O ( 1 k2 ) when the problems are convex, in which k is the number of iterations. Numerical results testify to the advantage of our algorithms in speed.
Often security is seen as an add-on service for automation systems that frequently conflicts with other goals such as efficient transmission or resource limitations. This article goes for a practice-oriented approach to security in automation systems. It analysis common threats to automation systems and automation networks in particular, sets up a model to classify systems with respect to security and discusses common measures available at different system levels. The description of measures should allow to rate the effects on the overall system security
Facebook is quickly becoming one of the most popular tools for social communication. However, Facebook is somewhat different from other Social Networking Sites as it demonstrates an offline-to-online trend; that is, the majority of Facebook Friends are met offline and then added later. The present research investigated how the Five-Factor Model of personality relates to Facebook use. Despite some expected trends regarding Extraversion and Openness to Experience, results indicated that personality factors were not as influential as previous literature would suggest. The results also indicated that a motivation to communicate was influential in terms of Facebook use. It is suggested that different motivations may be influential in the decision to use tools such as Facebook, especially when individual functions of Facebook are being considered. Ó 2008 Elsevier Ltd. All rights reserved. 1. Personality correlates and competency factors associated
We have analyzed the fully-anonymized headers of 362 million messages exchanged by 4.2 million users of Facebook, an online social network of college students, during a 26 month interval. The data reveal a number of strong daily and weekly regularities which provide insights into the time use of college students and their social lives, including seasonal variations. We also examined how factors such as school affiliation and informal online “friend” lists affect the observed behavior and temporal patterns. Finally, we show that Facebook users appear to be clustered by school with respect to their temporal messaging patterns.
Our analysis shows that many "big-memory" server workloads, such as databases, in-memory caches, and graph analytics, pay a high cost for page-based virtual memory. They consume as much as 10% of execution cycles on TLB misses, even using large pages. On the other hand, we find that these workloads use read-write permission on most pages, are provisioned not to swap, and rarely benefit from the full flexibility of page-based virtual memory.
 To remove the TLB miss overhead for big-memory workloads, we propose mapping part of a process's linear virtual address space with a direct segment, while page mapping the rest of the virtual address space. Direct segments use minimal hardware---base, limit and offset registers per core---to map contiguous virtual memory regions directly to contiguous physical memory. They eliminate the possibility of TLB misses for key data structures such as database buffer pools and in-memory key-value stores. Memory mapped by a direct segment may be converted back to paging when needed.
 We prototype direct-segment software support for x86-64 in Linux and emulate direct-segment hardware. For our workloads, direct segments eliminate almost all TLB misses and reduce the execution time wasted on TLB misses to less than 0.5%.
As increasingly powerful techniques emerge for machine tagging multimedia content, it becomes ever more important to standardize the underlying vocabularies. Doing so provides interoperability and lets the multimedia community focus ongoing research on a well-defined set of semantics. This paper describes a collaborative effort of multimedia researchers, library scientists, and end users to develop a large standardized taxonomy for describing broadcast news video. The large-scale concept ontology for multimedia (LSCOM) is the first of its kind designed to simultaneously optimize utility to facilitate end-user access, cover a large semantic space, make automated extraction feasible, and increase observability in diverse broadcast news video data sets
BACKGROUND
Meditative techniques are sought frequently by patients coping with medical and psychological problems. Because of their increasingly widespread appeal and use, and the potential for use as medical therapies, a concise and thorough review of the current state of scientific knowledge of these practices as medical interventions was conducted.


PURPOSE
To systematically review the evidence supporting efficacy and safety of meditative practices in treating illnesses, and examine areas warranting further study. Studies on normal healthy populations are not included.


METHODS
Searches were performed using PubMed, PsycInfo, and the Cochrane Database. Keywords were Meditation, Meditative Prayer, Yoga, Relaxation Response. Qualifying studies were reviewed and independently rated based on quality by two reviewers. Mid-to-high-quality studies (those scoring above 0.65 or 65% on a validated research quality scale) were included.


RESULTS
From a total of 82 identified studies, 20 randomized controlled trials met our criteria. The studies included 958 subjects total (397 experimentally treated, 561 controls). No serious adverse events were reported in any of the included or excluded clinical trials. Serious adverse events are reported in the medical literature, though rare. The strongest evidence for efficacy was found for epilepsy, symptoms of the premenstrual syndrome and menopausal symptoms. Benefit was also demonstrated for mood and anxiety disorders, autoimmune illness, and emotional disturbance in neoplastic disease.


CONCLUSIONS
The results support the safety and potential efficacy of meditative practices for treating certain illnesses, particularly in nonpsychotic mood and anxiety disorders. Clear and reproducible evidence supporting efficacy from large, methodologically sound studies is lacking.
Generative models of 3D human motion are often restricted to a small number of activities and can therefore not generalize well to novel movements or applications. In this work we propose a deep learning framework for human motion capture data that learns a generic representation from a large corpus of motion capture data and generalizes well to new, unseen, motions. Using an encoding-decoding network that learns to predict future 3D poses from the most recent past, we extract a feature representation of human motion. Most work on deep learning for sequence prediction focuses on video and speech. Since skeletal data has a different structure, we present and evaluate different network architectures that make different assumptions about time dependencies and limb correlations. To quantify the learned features, we use the output of different layers for action classification and visualize the receptive fields of the network units. Our method outperforms the recent state of the art in skeletal motion prediction even though these use action specific training data. Our results show that deep feedforward networks, trained from a generic mocap database, can successfully be used for feature extraction from human motion data and that this representation can be used as a foundation for classification and prediction.
OBJECTIVE
The aim of this study was to review the literature on clinical applications of the Hybrid Assistive Limb system for gait training.


METHODS
A systematic literature search was conducted using Web of Science, PubMed, CINAHL and clinicaltrials.gov and additional search was made using reference lists in identified reports. Abstracts were screened, relevant articles were reviewed and subject to quality assessment.


RESULTS
Out of 37 studies, 7 studies fulfilled inclusion criteria. Six studies were single group studies and 1 was an explorative randomized controlled trial. In total, these studies involved 140 participants of whom 118 completed the interventions and 107 used HAL for gait training. Five studies concerned gait training after stroke, 1 after spinal cord injury (SCI) and 1 study after stroke, SCI or other diseases affecting walking ability. Minor and transient side effects occurred but no serious adverse events were reported in the studies. Beneficial effects on gait function variables and independence in walking were observed.


CONCLUSIONS
The accumulated findings demonstrate that the HAL system is feasible when used for gait training of patients with lower extremity paresis in a professional setting. Beneficial effects on gait function and independence in walking were observed but data do not allow conclusions. Further controlled studies are recommended.
Good indoor air quality is a vital part of human health. Poor indoor air quality can contribute to the development of chronic respiratory diseases such as asthma, heart disease, and lung cancer. Complicating matters, poor air quality is extremely difficult for humans to detect through sight and smell alone and existing sensing equipment is designed to be used by and provide data for scientists rather than everyday citizens. We propose inAir, a tool for measuring, visualizing, and learning about indoor air quality. inAir provides historical and real-time visualizations of indoor air quality by measuring tiny hazardous airborne particles as small as 0.5 microns in size. Through user studies we demonstrate how inAir promotes greater awareness and motivates individual actions to improve indoor air quality.
Bluetooth worms currently pose relatively little danger compared to Internet scanning worms. The BlueBag project shows targeted attacks through Bluetooth malware using proof-of-concept codes and mobile devices
The accuracy of optical flow estimation algorithms has been improving steadily as evidenced by results on the Middlebury optical flow benchmark. The typical formulation, however, has changed little since the work of Horn and Schunck. We attempt to uncover what has made recent advances possible through a thorough analysis of how the objective function, the optimization method, and modern implementation practices influence accuracy. We discover that “classical” flow formulations perform surprisingly well when combined with modern optimization and implementation techniques. Moreover, we find that while median filtering of intermediate flow fields during optimization is a key to recent performance gains, it leads to higher energy solutions. To understand the principles behind this phenomenon, we derive a new objective that formalizes the median filtering heuristic. This objective includes a nonlocal term that robustly integrates flow estimates over large spatial neighborhoods. By modifying this new term to include information about flow and image boundaries we develop a method that ranks at the top of the Middlebury benchmark.
Existing neural dependency parsers usually encode each word in a sentence with bi-directional LSTMs, and estimate the score of an arc from the LSTM representations of the head and the modifier, possibly missing relevant context information for the arc being considered. In this study, we propose a neural feature extraction method that learns to extract arcspecific features. We apply a neural network-based attention method to collect evidences for and against each possible head-modifier pair, with which our model computes certainty scores of belief and disbelief, and determines the final arc score by subtracting the score of disbelief from the one of belief. By explicitly introducing two kinds of evidences, the arc candidates can compete against each other based on more relevant information, especially for the cases where they share the same head or modifier. It makes possible to better discriminate two or more competing arcs by presenting their rivals (disbelief evidence). Experiments on various datasets show that our arc-specific feature extraction mechanism significantly improves the performance of bi-directional LSTMbased models by explicitly modeling long-distance dependencies. For both English and Chinese, the proposed model achieve a higher accuracy on dependency parsing task than most existing neural attention-based models.
This paper studies people recommendations designed to help users find known, offline contacts and discover new friends on social networking sites. We evaluated four recommender algorithms in an enterprise social networking site using a personalized survey of 500 users and a field study of 3,000 users. We found all algorithms effective in expanding users' friend lists. Algorithms based on social network information were able to produce better-received recommendations and find more known contacts for users, while algorithms using similarity of user-created content were stronger in discovering new friends. We also collected qualitative feedback from our survey users and draw several meaningful design implications.
We introduce a type of Deep Boltzmann Machine (DBM) that is suitable for extracting distributed semantic representations from a large unstructured collection of documents. We overcome the apparent difficulty of training a DBM with judicious parameter tying. This enables an efficient pretraining algorithm and a state initialization scheme for fast inference. The model can be trained just as efficiently as a standard Restricted Boltzmann Machine. Our experiments show that the model assigns better log probability to unseen data than the Replicated Softmax model. Features extracted from our model outperform LDA, Replicated Softmax, and DocNADE models on document retrieval and document classification tasks.