Query: Intelligent Accident Detection System

Relevant passages:
Automatic Vehicle Accident Detection and Messaging System Using GSM and GPS Modem <=SEP=> The Rapid growth of technology and infrastructure has made our lives easier. The advent of technology has also increased the traffic hazards and the road accidents take place frequently which causes huge loss of life and property because of the poor emergency facilities. Our project will provide an optimum solution to this draw back. An accelerometer can be used in a car alarm application so that dangerous driving can be detected. It can be used as a crash or rollover detector of the vehicle during and after a crash. With signals from an accelerometer, a severe accident can be recognized. According to this project when a vehicle meets with an accident immediately Vibration sensor will detect the signal or if a car rolls over, and Micro electro mechanical system (MEMS) sensor will detects the signal and sends it to ARM controller. Microcontroller sends the alert message through the GSM MODEM including the location to police control room or a rescue team. So the police can immediately trace the location through the GPS MODEM, after receiving the information. Then after conforming the location necessary action will be taken. If the person meets with a small accident or if there is no serious threat to anyone`s life, then the alert message can be terminated by the driver by a switch provided in order to avoid wasting the valuable time of the medical rescue team. This paper is useful in detecting the accident precisely by means of both vibration sensor and Micro electro Mechanical system (MEMS) or accelerometer. As there is a scope for improvement and as a future implementation we can add a wireless webcam for capturing the images which will help in providing driver`s assistance.

Intelligent accident identification system using GPS , GSM modem <=SEP=> Recently technological and population development, the usage of vehicles are rapidly increasing and at the same time the occurrence accident is also increased. Hence, the value of human life is ignored. No one can prevent the accident, but can save their life by expediting the ambulance to the hospital in time. A new vivid scheme called Intelligent Transportation System (ITS) is introduced. The objective of this scheme is to minimize the delay caused by traffic congestion and to provide the smooth flow of emergency vehicles. The concept of this scheme is to green the traffic signal in the path of ambulance automatically with the help of RF module. So that the ambulance can reach the spot in time and human life can be saved and the accident location is identified sends the accident location immediately to the main server. The main server finds the nearest ambulance to the accident zone and sends the exact accident location to the emergency vehicle. The control unit monitors the ambulance and provides the shortest path to the ambulance at the same time it controls the traffic light according to the ambulance location and thus arriving at the hospital safely. This scheme is fully automated, thus it locates the accident spot accurately, controls the traffic lights, provide the shortest path to reach the location and to the hospital in time.

Development of vehicle tracking system using GPS and GSM modem <=SEP=> The ability to track vehicles is useful in many applications including security of personal vehicles, public transportation systems, fleet management and others. Furthermore, the number of vehicles on the road globally is also expected to increase rapidly. Therefore, the development of vehicle tracking system using the Global Positioning System (GPS) and Global System for Mobile Communications (GSM) modem is undertaken with the aim of enabling users to locate their vehicles with ease and in a convenient manner. The system will provide users with the capability to track vehicle remotely through the mobile network. This paper presents the development of the vehicle tracking system's hardware prototype. Specifically, the system will utilize GPS to obtain a vehicle's coordinate and transmit it using GSM modem to the user's phone through the mobile network. The main hardware components of the system are u-blox NEO-6Q GPS receiver module, u-blox LEON-G100 GSM module and Arduino Uno microcontroller. The developed vehicle tracking system demonstrates the feasibility of near real-time tracking of vehicles and improved customizability, global operability and cost when compared to existing solutions.

The survey of GSM wireless communication system <=SEP=> In the past decade, wireless communications experienced an explosive growth period and became an integral part of modern society. The convenience and flexibility offered by mobile communications have made it one of the fastest growing areas of telecommunications. Mobile communication systems have experienced rapid growth in the number of users as well as the range of services provided during the last two decades. The Global System for Mobile communications, GSM, is a pan-European Mobile communication system in the 900 MHz band which was first introduced in the early years of this decade. An increasing demand for data transmission services over the GSM system has been driven by the wide use of the internet applications. In this thesis, we focus on the survey of GSM for wireless communication, which is one of the most widely deployed second generation wireless cellular systems in the world. While voice was the primary service provided early communication systems, current systems offer other transmission services. One of the most commonly used cellular systems is based on the Global System for Mobile communication, GSM, standard. We briefly introduce the GSM System configuration and major properties. It included five parts. It is about service and features, architecture of GSM system, channel and frame structure of GSM, GSM security features, data in the GSM System.

Adaptive postfiltering for quality enhancement of coded speech <=SEP=> AbstrucfAn adaptive postfiltering algorithm for enhancing the perceptual quality of coded speech is presented. The posffilter consists of a long-term postfilter section in cascade with a shortterm postfilter section and includes spectral tilt compensation and automatic gain control. The long-term section emphasizes pitch harmonics and attenuates the spectral valleys between pitch harmonics. The short-term section, on the other hand, emphasizes speech formants and attenuates the spectral valleys between formants. Both filter sections have poles and zeros. Unlike earlier postfilters that often introduced a substantial amount of muffling to the output speech, our postfilter significantly reduces this effect by minimizing the spectral tilt in its frequency response. As a result, this postlilter achieves noticeable noise reduction while introducing only minimal distortion in speech. The complexity of the postfilter is quite low. Variations of this postlilter are now being used in several national and international speech coding standards. This paper presents for the first time a complete description of our original postfiltering algorithm and the underlying ideas that motivated its development.

Simulation on Simulink AC4 model (200hp DTC induction motor drive) using Fuzzy Logic controller <=SEP=> Classical direct torque control (DTC) has advantage in absence of coordinate transform and voltage modulator block. However, it may have disadvantage in controlling electromagnetic torque. DTC produces high ripple in electromagnetic torque as it is not directly controlled. High torque ripple causes vibrations to the motor which may lead to component lose, bearing failure or resonance. Thus, Fuzzy Logic controller is applied to reduce electromagnetic torque ripple. This paper presents the simulation analysis of Fuzzy Logic Direct Torque Controller (FLDTC) of induction machine drives. However, only the design of the controller using built in DTC induction motor drive model of Simulink AC4 will be discussed in this paper. Using FLDTC, the resulting electromagnetic torque from produced less ripple than classical DTC.

Developing a Web-Based Application using OWL and SWRL <=SEP=> Data integration is central in Web application development because these applications typically deal with a variety of information formats. Ontology-driven applications face the additional challenge of integrating these multiple formats with the information stored in ontologies. A number of mappings are required to reconcile the variety of formats to produce a coherent overall system. To address these mappings we have developed a number of open source tools that support transformations between some of the common formats encountered when developing an ontology-driven Web application. The Semantic Web Rule Language (SWRL) is a central building block in these tools. We describe these tools and illustrate their use in the development of a prototype Web-based application.

Styling with Attention to Details <=SEP=> Fashion as characterized by its nature, is driven by style. In this paper, we propose a method that takes into account the style information to complete a given set of selected fashion items with a complementary fashion item. Complementary items are those items that can be worn along with the selected items according to the style. Addressing this problem facilitates in automatically generating stylish fashion ensembles leading to a richer shopping experience for users. Recently, there has been a surge of online social websites where fashion enthusiasts post the outfit of the day and other users can like and comment on them. These posts contain a gold-mine of information about style. In this paper, we exploit these posts to train a deep neural network which captures style in an automated manner. We pose the problem of predicting complementary fashion items as a sequence to sequence problem where the input is the selected set of fashion items and the output is a complementary fashion item based on the style information learned by the model. We use the encoder decoder architecture to solve this problem of completing the set of fashion items. We evaluate the goodness of the proposed model through a variety of experiments. We empirically observe that our proposed model outperforms competitive baseline like apriori algorithm by ~28% in terms of accuracy for top-1 recommendation to complete the fashion ensemble. We also perform retrieval based experiments to understand the ability of the model to learn style and rank the complementary fashion items and find that using attention in our encoder decoder model helps in improving the mean reciprocal rank by ~24%. Qualitatively we find the complementary fashion items generated by our proposed model are richer than the apriori algorithm.

A Framework for Discovering Internal Financial Fraud Using Analytics <=SEP=> In today's knowledge based society, financial fraud has become a common phenomenon. Moreover, the growth in knowledge discovery in databases and fraud audit has made the detection of internal financial fraud a major area of research. On the other hand, auditors find it difficult to apply a majority of techniques in the fraud auditing process and to integrate their domain knowledge in this process. In this Paper a framework called "Knowledge-driven Internal Fraud Detection (KDIFD)" is proposed for detecting internal financial frauds. The framework suggests a process-based approach that considers both forensic auditor's tacit knowledge base and computer-based data analysis and mining techniques. The proposed framework can help auditor in discovering internal financial fraud more efficiently.

Modified image segmentation method based on region growing and region merging <=SEP=> Image segmentation is one of the basic concepts widely used in each and every fields of image processing. The entire process of the proposed work for image segmentation comprises of 3 phases: Threshold generation with dynamic Modified Region Growing phase (DMRG), texture feature generation phase and region merging phase. by dynamically changing two thresholds, the given input image can be performed as DMRG, in which the cuckoo search optimization algorithm helps to optimize the two thresholds in modified region growing. after obtaining the region growth segmented image, the edges are detected with edge detection algorithm. In the second phase, the texture feature is extracted using entropy based operation from the input image. In region merging phase, the results obtained from the texture feature generation phase is combined with the results of DMRG phase and similar regions are merged by using a distance comparison between regions. The proposed work is implemented using Mat lab platform with several medical images. the performance of the proposed work is evaluated using the metrics sensitivity, specificity and accuracy. the results show that this proposed work provides very good accuracy for the segmentation process in images.

Kinematics and design of a portable and wearable exoskeleton for hand rehabilitation <=SEP=> We present the kinematic design and actuation mechanics of a wearable exoskeleton for hand rehabilitation of post-stroke. Our design method is focused on achieving maximum safety, comfort and reliability in the interaction, and allowing different users to wear the device with no manual regulations. In particular, we propose a kinematic and actuation solution for the index finger flexion/extension, which leaves full movement freedom on the abduction-adduction plane. This paper presents a detailed kineto-static analysis of the system and a first prototype of the device.

Style Augmentation: Data Augmentation via Style Randomization <=SEP=> We introduce style augmentation, a new form of data augmentation based on random style transfer, for improving the robustness of convolutional neural networks (CNN) over both classification and regression based tasks. During training, our style augmentation randomizes texture, contrast and color, while preserving shape and semantic content. This is accomplished by adapting an arbitrary style transfer network to perform style randomization, by sampling input style embeddings from a multivariate normal distribution instead of inferring them from a style image. In addition to standard classification experiments, we investigate the effect of style augmentation (and data augmentation generally) on domain transfer tasks. We find that data augmentation significantly improves robustness to domain shift, and can be used as a simple, domain agnostic alternative to domain adaptation. Comparing style augmentation against a mix of seven traditional augmentation techniques, we find that it can be readily combined with them to improve network performance. We validate the efficacy of our technique with domain transfer experiments in classification and monocular depth estimation, illustrating consistent improvements in generalization.

Globally optimal toon tracking <=SEP=> The ability to identify objects or region correspondences between consecutive frames of a given hand-drawn animation sequence is an indispensable tool for automating animation modification tasks such as sequence-wide recoloring or shape-editing of a specific animated character. Existing correspondence identification methods heavily rely on appearance features, but these features alone are insufficient to reliably identify region correspondences when there exist occlusions or when two or more objects share similar appearances. To resolve the above problems, manual assistance is often required. In this paper, we propose a new correspondence identification method which considers both appearance features and motions of regions in a global manner. We formulate correspondence likelihoods between temporal region pairs as a network flow graph problem which can be solved by a well-established optimization algorithm. We have evaluated our method with various animation sequences and results show that our method consistently outperforms the state-of-the-art methods without any user guidance.

Aesthetic quality classification of photographs based on color harmony <=SEP=> Aesthetic quality classification plays an important role in how people organize large photo collections. In particular, color harmony is a key factor in the various aspects that determine the perceived quality of a photo, and it should be taken into account to improve the performance of automatic aesthetic quality classification. However, the existing models of color harmony take only simple color patterns into consideration–e.g., patches consisting of a few colors–and thus cannot be used to assess photos with complicated color arrangements. In this work, we tackle the challenging problem of evaluating the color harmony of photos with a particular focus on aesthetic quality classification. A key point is that a photograph can be seen as a collection of local regions with color variations that are relatively simple. This led us to develop a method for assessing the aesthetic quality of a photo based on the photo's color harmony. We term the method ‘bags-of-color-patterns.’ Results of experiments on a large photo collection with user-provided aesthetic quality scores show that our aesthetic quality classification method, which explicitly takes into account the color harmony of a photo, outperforms the existing methods. Results also show that the classification performance is improved by combining our color harmony feature with blur, edges, and saliency features that reflect the aesthetics of the photos.

Electrick: Low-Cost Touch Sensing Using Electric Field Tomography <=SEP=> Current touch input technologies are best suited for small and flat applications, such as smartphones, tablets and kiosks. In general, they are too expensive to scale to large surfaces, such as walls and furniture, and cannot provide input on objects having irregular and complex geometries, such as tools and toys. We introduce Electrick, a low-cost and versatile sensing technique that enables touch input on a wide variety of objects and surfaces, whether small or large, flat or irregular. This is achieved by using electric field tomography in concert with an electrically conductive material, which can be easily and cheaply added to objects and surfaces. We show that our technique is compatible with commonplace manufacturing methods, such as spray/brush coating, vacuum forming, and casting/molding enabling a wide range of possible uses and outputs. Our technique can also bring touch interactivity to rapidly fabricated objects, including those that are laser cut or 3D printed. Through a series of studies and illustrative example uses, we show that Electrick can enable new interactive opportunities on a diverse set of objects and surfaces that were previously static.

Estimation of IMU and MARG orientation using a gradient descent algorithm <=SEP=> This paper presents a novel orientation algorithm designed to support a computationally efficient, wearable inertial human motion tracking system for rehabilitation applications. It is applicable to inertial measurement units (IMUs) consisting of tri-axis gyroscopes and accelerometers, and magnetic angular rate and gravity (MARG) sensor arrays that also include tri-axis magnetometers. The MARG implementation incorporates magnetic distortion compensation. The algorithm uses a quaternion representation, allowing accelerometer and magnetometer data to be used in an analytically derived and optimised gradient descent algorithm to compute the direction of the gyroscope measurement error as a quaternion derivative. Performance has been evaluated empirically using a commercially available orientation sensor and reference measurements of orientation obtained using an optical measurement system. Performance was also benchmarked against the propriety Kalman-based algorithm of orientation sensor. Results indicate the algorithm achieves levels of accuracy matching that of the Kalman based algorithm; < 0.8° static RMS error, < 1.7° dynamic RMS error. The implications of the low computational load and ability to operate at small sampling rates significantly reduces the hardware and power necessary for wearable inertial movement tracking, enabling the creation of lightweight, inexpensive systems capable of functioning for extended periods of time.

Mori-Zwanzig formalism as a practical computational tool. <=SEP=> An operational procedure is presented to compute explicitly the different terms in the generalized Langevin equation (GLE) for a few relevant variables obtained within Mori-Zwanzig formalism. The procedure amounts to introducing an artificial controlled parameter which can be tuned in such a way that the so-called projected dynamics becomes explicit and the GLE reduces to a Markovian equation. The projected dynamics can be realised in practice by introducing constraints, and it is shown that the Green-Kubo formulae computed with these dynamics do not suffer from the plateau problem. The methodology is illustrated in the example of star polymer molecules in a melt using their center of mass as relevant variables. Through this example, we show that not only the effective potentials, but also the friction forces and the noise play a very important role in the dynamics.

Revisiting Random Binning Features: Fast Convergence and Strong Parallelizability <=SEP=> Kernel method has been developed as one of the standard approaches for nonlinear learning, which however, does not scale to large data set due to its quadratic complexity in the number of samples. A number of kernel approximation methods have thus been proposed in the recent years, among which the random features method gains much popularity due to its simplicity and direct reduction of nonlinear problem to a linear one. Different random feature functions have since been proposed to approximate a variety of kernel functions. Among them the Random Binning (RB) feature, proposed in the first random-feature paper [21], has drawn much less attention than the Random Fourier (RF) feature proposed also in [21]. In this work, we observe that the RB features, with right choice of optimization solver, could be orders-of-magnitude more efficient than other random features and kernel approximation methods under the same requirement of accuracy. We thus propose the first analysis of RB from the perspective of optimization, which by interpreting RB as a Randomized Block Coordinate Descent in the infinite-dimensional space, gives a faster convergence rate compared to that of other random features. In particular, we show that by drawing R random grids with at least κ number of non-empty bins per grid in expectation, RB method achieves a convergence rate of O(1/κ R)), which not only sharpens its O(1/√R) rate from Monte Carlo analysis, but also shows a κ times speedup over other random features under the same analysis framework. In addition, we demonstrate another advantage of RB in the L1-regularized setting, where unlike other random features, a RB-based Coordinate Descent solver can be parallelized with guaranteed speedup proportional to κ. Our extensive experiments demonstrate the superior performance of the RB features over other random features and kernel approximation methods.

HHCART: An Oblique Decision Tree <=SEP=> Decision trees are a popular technique in statistical data classification. They recursively partition the feature space into disjoint sub-regions until each sub-region becomes homogeneous with respect to a particular class. The basic Classification and Regression Tree (CART) algorithm partitions the feature space using axis parallel splits. When the true decision boundaries are not aligned with the feature axes, this approach can produce a complicated boundary structure. Oblique decision trees use oblique decision boundaries to potentially simplify the boundary structure. The major limitation of this approach is that the tree induction algorithm is computationally expensive. In this article we present a new decision tree algorithm, called HHCART. The method utilizes a series of Householder matrices to reflect the training data at each node during the tree construction. Each reflection is based on the directions of the eigenvectors from each classes’ covariance matrix. Considering axis parallel splits in the reflected training data provides an efficient way of finding oblique splits in the unreflected training data. Experimental results show that the accuracy and size of the HHCART trees are comparable with some benchmark methods in the literature. The appealing feature of HHCART is that it can handle both qualitative and quantitative features in the same oblique split.

Stillbirths: economic and psychosocial consequences <=SEP=> Despite the frequency of stillbirths, the subsequent implications are overlooked and underappreciated. We present findings from comprehensive, systematic literature reviews, and new analyses of published and unpublished data, to establish the effect of stillbirth on parents, families, health-care providers, and societies worldwide. Data for direct costs of this event are sparse but suggest that a stillbirth needs more resources than a livebirth, both in the perinatal period and in additional surveillance during subsequent pregnancies. Indirect and intangible costs of stillbirth are extensive and are usually met by families alone. This issue is particularly onerous for those with few resources. Negative effects, particularly on parental mental health, might be moderated by empathic attitudes of care providers and tailored interventions. The value of the baby, as well as the associated costs for parents, families, care providers, communities, and society, should be considered to prevent stillbirths and reduce associated morbidity.

Improved Text Extraction from PDF Documents for Large-Scale Natural Language Processing <=SEP=> The inability of reliable text extraction from arbitrary documents is often an obstacle for large scale NLP based on resources crawled from the Web. One of the largest problems in the conversion of PDF documents is the detection of the boundaries of common textual units such as paragraphs, sentences and words. PDF is a file format optimized for printing and encapsulates a complete description of the layout of a document including text, fonts, graphics and so on. This paper describes a tool for extracting texts from arbitrary PDF files for the support of largescale data-driven natural language processing. Our approach combines the benefits of several existing solutions for the conversion of PDF documents to plain text and adds a language-independent post-processing procedure that cleans the output for further linguistic processing. In particular, we use the PDF-rendering libraries pdfXtk, Apache Tika and Poppler in various configurations. From the output of these tools we recover proper boundaries using on-the-fly language models and languageindependent extraction heuristics. In our research, we looked especially at publications from the European Union, which constitute a valuable multilingual resource, for example, for training statistical machine translation models. We use our tool for the conversion of a large multilingual database crawled from the EU bookshop with the aim of building parallel corpora. Our experiments show that our conversion software is capable of fixing various common issues leading to cleaner data sets in the end.

Depeche Mood: a Lexicon for Emotion Analysis from Crowd Annotated News <=SEP=> While many lexica annotated with words polarity are available for sentiment analysis, very few tackle the harder task of emotion analysis and are usually quite limited in coverage. In this paper, we present a novel approach for extracting – in a totally automated way – a highcoverage and high-precision lexicon of roughly 37 thousand terms annotated with emotion scores, called DepecheMood. Our approach exploits in an original way ‘crowd-sourced’ affective annotation implicitly provided by readers of news articles from rappler.com. By providing new state-of-the-art performances in unsupervised settings for regression and classification tasks, even using a naı̈ve approach, our experiments show the beneficial impact of harvesting social media data for affective lexicon building.

Response and Habituation of the Human Amygdala during Visual Processing of Facial Expression <=SEP=> We measured amygdala activity in human volunteers during rapid visual presentations of fearful, happy, and neutral faces using functional magnetic resonance imaging (fMRI). The first experiment involved a fixed order of conditions both within and across runs, while the second one used a fully counterbalanced order in addition to a low level baseline of simple visual stimuli. In both experiments, the amygdala was preferentially activated in response to fearful versus neutral faces. In the counterbalanced experiment, the amygdala also responded preferentially to happy versus neutral faces, suggesting a possible generalized response to emotionally valenced stimuli. Rapid habituation effects were prominent in both experiments. Thus, the human amygdala responds preferentially to emotionally valenced faces and rapidly habituates to them.

Deception through telling the truth ? ! : Experimental evidence from individuals and teams <=SEP=> Informational asymmetries abound in economic decision making and often provide an incentive for deception through telling a lie or misrepresenting information. In this paper I use a cheap-talk sender-receiver experiment to show that telling the truth should be classified as deception too if the sender chooses the true message with the expectation that the receiver will not follow the sender’s (true) message. The experimental data reveal a large degree of ‘sophisticated’ deception through telling the truth. The robustness of my broader definition of deception is confirmed in an experimental treatment where teams make decisions. JEL-classification: C72, C91, D82

Group-sensitive multiple kernel learning for object categorization <=SEP=> In this paper, we propose a group-sensitive multiple kernel learning (GS-MKL) method to accommodate the intra-class diversity and the inter-class correlation for object categorization. By introducing an intermediate representation “group” between images and object categories, GS-MKL attempts to find appropriate kernel combination for each group to get a finer depiction of object categories. For each category, images within a group share a set of kernel weights while images from different groups may employ distinct sets of kernel weights. In GS-MKL, such group-sensitive kernel combinations together with the multi-kernels based classifier are optimized in a joint manner to seek a trade-off between capturing the diversity and keeping the invariance for each category. Extensive experiments show that our proposed GS-MKL method has achieved encouraging performance over three challenging datasets.

AndroTaint: An efficient android malware detection framework using dynamic taint analysis <=SEP=> Android operating system is widespread in today's smart-phone market due to its open source model, its easy functionality and huge number of Apps and App-Stores (the official and others). The coverage of some 90% of the market, it is also the place-holder for user's personal as well as sensitive information (IMEI, IMSI, etc.). There is a tendency of Apps user to trust on Android OS for securing his/her data but it has been proved that Android OS is more vulnerable to exploitation either for fun or for monetary purpose. Malware detection for Android OS has become an upcoming research problem of interest. Dynamic Taint Analysis is an efficient analysis in existing Android malware detection analysis. The aim of this paper is to work towards Dynamic Taint Analysis of Android malware using automatic tagging and with out modification in Android platform. In order to do this, this paper surveys exhaustively the available literature and works related to dynamic taint analysis. This paper proposes some novel ideas to improve the existing solution with more accuracy. There are two phases of our novel algorithm, the first phase is training phase for feature extraction and the second phase is the analysis phase for automatic tagging and tainting. We have developed a framework named AndroTaint, which is working on Dynamic Taint Analysis. AndroTaint follows a novel supervised and unsupervised Anomaly Detection technique with high precision, recall and harmonic mean. Our Dynamic Taint Analysis algorithm categorizes the App is risky, benign, malicious or aggressive as per their feature and behaviour. We have measured AndroTaint effectiveness on the basis of timeline for building dataset and 10-fold cross validation. AndroTaint covers 90% of malware and benign in analysis phase with less false positive and false negative.

Metacognitive Beliefs About Procrastination : Development and Concurrent Validity of a Self-Report Questionnaire <=SEP=> This article describes the development of a questionnaire on metacognitive beliefs about procrastination. In Study 1 we performed a principal axis factor analysis that suggested a twofactor solution for the data obtained from the preliminary questionnaire. The factors identified were named positive and negative metacognitive beliefs about procrastination. The factor analysis reduced the questionnaire from 22 to 16 items, with each factor consisting of 8 items. In Study 2 we performed a confirmatory factor analysis that provided support for the twofactor solution suggested by the exploratory factor analysis. Both factors had adequate internal consistency. Concurrent validity was partially established through correlation analyses. These showed that positive metacognitive beliefs about procrastination were positively correlated with decisional procrastination, and that negative metacognitive beliefs about procrastination were positively correlated with both decisional and behavioral procrastination. The Metacognitive Beliefs About Procrastination Questionnaire may aid future research into procrastination and facilitate clinical assessment and case formulation.

One-Class Kernel Spectral Regression for Outlier Detection <=SEP=> The paper introduces a new efficient nonlinear oneclass classifier formulated as the Rayleigh quotient criterion optimisation. The method, operating in a reproducing kernel Hilbert subspace, minimises the scatter of target distribution along an optimal projection direction while at the same time keeping projections of positive observations distant from the mean of the negative class. We provide a graph embedding view of the problem which can then be solved efficiently using the spectral regression approach. In this sense, unlike previous similar methods which often require costly eigen-computations of dense matrices, the proposed approach casts the problem under consideration into a regression framework which is computationally more efficient. In particular, it is shown that the dominant complexity of the proposed method is the complexity of computing the kernel matrix. Additional appealing characteristics of the proposed one-class classifier are: 1-the ability to be trained in an incremental fashion (allowing for application in streaming data scenarios while also reducing the computational complexity in a non-streaming operation mode); 2-being unsupervised, but providing the option for refining the solution using negative training examples, when available; Last but not least, 3-the use of the kernel trick which facilitates a nonlinear mapping of the data into a high-dimensional feature space to seek better solutions. Extensive experiments conducted on several datasets verify the merits of the proposed approach in comparison with other alternatives.

Very greedy crossover in a genetic algorithm for the traveling salesman problem <=SEP=> In the traveling salesman problem, we are given a set of cities and the distances between them, and we seek a shortest tour that visits each city exactly once and returns to the starting city. Many researchers have described genetic algorithms for this problem, and they have often focused on the crossover operator, which builds offspring tours by combining two parental tours. Very greedy crossover extends several of these operators; as it builds a tour, it always appends the shortest parental edge to a city not yet visited, if there is such an edge. A steady-state genetic algorithm using this operator, mutation by inversion, and rank-based probabilities for both selection and deletion shows good results on a suite of flve test problems.