Change points detection in crime-related time series: an on-line fuzzy approach based on a shape space representation

The extension of traditional data mining methods to time series has been effectively applied to a wide range of domains such as finance, econometrics, biology, security, and medicine. Many existing mining methods deal with the task of change points detection, but very few provide a flexible approach. Querying specific change points with linguistic variables is particularly useful in crime analysis, where intuitive, understandable, and appropriate detection of changes can significantly improve the allocation of resources for timely and concise operations. In this paper, we propose an on-line method for detecting and querying change points in crime-related time series with the use of a meaningful representation and a fuzzy inference system. Change points detection is based on a shape space representation, and linguistic terms describing geometric properties of the change points are used to express queries, offering the advantage of intuitiveness and flexibility. An empirical evaluation is first conducted on a crime data set to confirm the validity of the proposed method and then on a financial data set to test its general applicability. A comparison to a similar change-point detection algorithm and a sensitivity analysis are also conducted. Results show that the method is able to accurately detect change points at very low computational costs. More broadly, the detection of specific change points within time series of virtually any domain is made more intuitive and more understandable, even for experts not related to data mining.

Self-reported sitting time and physical activity: interactive associations with mental well-being and productivity in office employees

Abstract Background: Little is known about how sitting time, alone or in combination with markers of physical activity (PA), influences mental well-being and work productivity. Given the need to develop workplace PA interventions that target employees’ health related efficiency outcomes; this study examined the associations between self-reported sitting time, PA, mental well-being and work productivity in office employees. Methods: Descriptive cross-sectional study. Spanish university office employees (n = 557) completed a survey measuring socio-demographics, total and domain specific (work and travel) self-reported sitting time, PA (International Physical Activity Questionnaire short version), mental well-being (Warwick-Edinburg Mental Well-Being Scale) and work productivity (Work Limitations Questionnaire). Multivariate linear regression analyses determined associations between the main variables adjusted for gender, age, body mass index and occupation. PA levels (low, moderate and high) were introduced into the model to examine interactive associations. Results: Higher volumes of PA were related to higher mental well-being, work productivity and spending less time sitting at work, throughout the working day and travelling during the week, including the weekends (p < 0.05). Greater levels of sitting during weekends was associated with lower mental well-being (p < 0.05). Similarly, more sitting while travelling at weekends was linked to lower work productivity (p < 0.05). In highly active employees, higher sitting times on work days and occupational sitting were associated with decreased mental well-being (p < 0.05). Higher sitting times while travelling on weekend days was also linked to lower work productivity in the highly active (p < 0.05). No significant associations were observed in low active employees. Conclusions: Employees’ PA levels exerts different influences on the associations between sitting time, mental well-being and work productivity. The specific associations and the broad sweep of evidence in the current study suggest that workplace PA strategies to improve the mental well-being and productivity of all employees should focus on reducing sitting time alongside efforts to increase PA.

Large-scale production and purification of recombinant protein from an insect cell/baculovirus system in Erlenmeyer flasks: application to the chicken poly(ADP-ribose) polymerase catalytic domain

A simple and inexpensive shaker/Erlenmeyer flask system for large-scale cultivation of insect cells is described and compared to a commercial spinner system. On the basis of maximum cell density, average population doubling time and overproduction of recombinant protein, a better result was obtained with a simpler and less expensive bioreactor consisting of Erlenmeyer flasks and an ordinary shaker waterbath. Routinely, about 90 mg of pure poly(ADP-ribose) polymerase catalytic domain was obtained for a total of 3 x 109 infected cells in three liters of culture

Can low domain knowledge be compensated for when using the internet? /

Previous researchers have found that learners do not benefit fi-om using the Internet when domain knowledge is low. The purpose of the current study was to investigate possible methods to compensate for low domain knowledge. Specifically, the presence of notes, more time to search the Internet, and high levels of motivation to use the Internet were examined as possible compensating factors. Sixty Political Science and Kinesiology undergraduate students were randomly assigned to one of three conditions. Students searched the Internet for an hour prior to vmting an essay with notes present, searched the Internet for an hour prior to writing an essay without notes present, or did not search the Internet prior to completing an essay. Each participant completed the same two essays, one corresponding to a high knowledge domain and another corresponding to a low knowledge domain. First, the presence of notes did not significantly improve essay scores in comparison to the absence of notes. Second, learners did benefit fi-om using the Internet for 1 hour in comparison to their peers who were not exposed to the Internet, regardless of level of domain knowledge. Third, high levels of motivation did not affect essay performance. A discussion of why time may have compensated for low domain knowledge while notes and motivation did not is included. In addition, methods that may compensate for low domain knowledge when time is restricted are suggested.

Design and Development of data mining models for the predictions of manpower placement in the technical Domain

Data mining is one of the hottest research areas nowadays as it has got wide variety of applications in common man’s life to make the world a better place to live. It is all about finding interesting hidden patterns in a huge history data base. As an example, from a sales data base, one can find an interesting pattern like “people who buy magazines tend to buy news papers also” using data mining. Now in the sales point of view the advantage is that one can place these things together in the shop to increase sales. In this research work, data mining is effectively applied to a domain called placement chance prediction, since taking wise career decision is so crucial for anybody for sure. In India technical manpower analysis is carried out by an organization named National Technical Manpower Information System (NTMIS), established in 1983-84 by India's Ministry of Education & Culture. The NTMIS comprises of a lead centre in the IAMR, New Delhi, and 21 nodal centres located at different parts of the country. The Kerala State Nodal Centre is located at Cochin University of Science and Technology. In Nodal Centre, they collect placement information by sending postal questionnaire to passed out students on a regular basis. From this raw data available in the nodal centre, a history data base was prepared. Each record in this data base includes entrance rank ranges, reservation, Sector, Sex, and a particular engineering. From each such combination of attributes from the history data base of student records, corresponding placement chances is computed and stored in the history data base. From this data, various popular data mining models are built and tested. These models can be used to predict the most suitable branch for a particular new student with one of the above combination of criteria. Also a detailed performance comparison of the various data mining models is done.This research work proposes to use a combination of data mining models namely a hybrid stacking ensemble for better predictions. A strategy to predict the overall absorption rate for various branches as well as the time it takes for all the students of a particular branch to get placed etc are also proposed. Finally, this research work puts forward a new data mining algorithm namely C 4.5 * stat for numeric data sets which has been proved to have competent accuracy over standard benchmarking data sets called UCI data sets. It also proposes an optimization strategy called parameter tuning to improve the standard C 4.5 algorithm. As a summary this research work passes through all four dimensions for a typical data mining research work, namely application to a domain, development of classifier models, optimization and ensemble methods.

Magnetic properties and domain-wall motion in single-crystal BaFe10.2Sn0.74Co0.66O19

The magnetic properties of BaFe12O19 and BaFe10.2Sn0.74Co0.66O19 single crystals have been investigated in the temperature range (1.8 to 320 K) with a varying field from -5 to +5 T applied parallel and perpendicular to the c axis. Low-temperature magnetic relaxation, which is ascribed to the domain-wall motion, was performed between 1.8 and 15 K. The relaxation of magnetization exhibits a linear dependence on logarithmic time. The magnetic viscosity extracted from the relaxation data, decreases linearly as temperature goes down, which may correspond to the thermal depinning of domain walls. Below 2.5 K, the viscosity begins to deviate from the linear dependence on temperature, tending to be temperature independent. The near temperature independence of viscosity suggests the existence of quantum tunneling of antiferromagnetic domain wall in this temperature range.

WAIS seminar: The Domain Name System: a magical mystery tour

Wednesday 12th March 2014 Speaker(s): Dr Tim Chown Organiser: Time: 12/03/2014 11:00-11:50 Location: B32/3077 File size: 642 Mb Abstract The WAIS seminar series is designed to be a blend of classic seminars, research discussions, debates and tutorials. The Domain Name System (DNS) is a critical part of the Internet infrastructure. In this talk we begin by explaining the basic model of operation of the DNS, including how domain names are delegated and how a DNS resolver performs a DNS lookup. We then take a tour of DNS-related topics, including caching, poisoning, governance, the increasing misuse of the DNS in DDoS attacks, and the expansion of the DNS namespace to new top level domains and internationalised domain names. We also present the latest work in the IETF on DNS privacy. The talk will be pitched such that no detailed technical knowledge is required. We hope that attendees will gain some familiarity with how the DNS works, some key issues surrounding DNS operation, and how the DNS might touch on various areas of research within WAIS.

Integration of knowledge-based, qualitative and numeric tools for real time dynamic systems supervision

The proposal presented in this thesis is to provide designers of knowledge based supervisory systems of dynamic systems with a framework to facilitate their tasks avoiding interface problems among tools, data flow and management. The approach is thought to be useful to both control and process engineers in assisting their tasks. The use of AI technologies to diagnose and perform control loops and, of course, assist process supervisory tasks such as fault detection and diagnose, are in the scope of this work. Special effort has been put in integration of tools for assisting expert supervisory systems design. With this aim the experience of Computer Aided Control Systems Design (CACSD) frameworks have been analysed and used to design a Computer Aided Supervisory Systems (CASSD) framework. In this sense, some basic facilities are required to be available in this proposed framework: ·

Integrable evolution equations in time-dependent domains

We discuss the implementation of a method of solving initial boundary value problems in the case of integrable evolution equations in a time-dependent domain. This method is applied to a dispersive linear evolution equation with spatial derivatives of arbitrary order and to the defocusing nonlinear Schrödinger equation, in the domain l(t)

Domain swapping in the human histamine H-1 receptor

G-protein-coupled receptors (GPCRs) represent the largest family of receptors involved in transmembrane signaling. Although these receptors were generally believed to be monomeric entities, accumulating evidence supports the presence of GPCRs in multimeric forms. Here, using immunoprecipitation as well as time-resolved fluorescence resonance energy transfer to assess protein-protein interactions in living cells, we unambiguously demonstrate the occurrence of dimerization of the human histamine H-1 receptor. We also show the presence of domain-swapped H-1 receptor dimers in which there is the reciprocal exchange of transmembrane domain TM domains 6 and 7 between the receptors present in the dimer. Mutation of aspartate(107) in transmembrane (TM) 3 or phenylalanine(432) in TM6 to alanine results in two radioligand-binding-deficient mutant H-1 receptors. Coexpression of H-1 D(107)A and H-1 F(432)A, however, results in a reconstituted radioligand binding site that exhibits a pharmacological profile that corresponds to the wildtype H-1 receptor. Interestingly, the H-1 receptor radioligands [H-3] mepyramine and [H-3]-(-)- trans-1-phenyl-3-N, N-dimethylamino-1,2,3,4-tetrahydronaphthalene show differential saturation binding values (B-max) for wild-type H-1 receptors but not for the radioligand binding site that is formed upon coexpression of H-1 D(107)A and H-1 F(432)A receptors, suggesting the presence of different H-1 receptor populations.

An Exponentially Convergent Nonpolynomial Finite Element Method for Time-Harmonic Scattering from Polygons

In recent years nonpolynomial finite element methods have received increasing attention for the efficient solution of wave problems. As with their close cousin the method of particular solutions, high efficiency comes from using solutions to the Helmholtz equation as basis functions. We present and analyze such a method for the scattering of two-dimensional scalar waves from a polygonal domain that achieves exponential convergence purely by increasing the number of basis functions in each element. Key ingredients are the use of basis functions that capture the singularities at corners and the representation of the scattered field towards infinity by a combination of fundamental solutions. The solution is obtained by minimizing a least-squares functional, which we discretize in such a way that a matrix least-squares problem is obtained. We give computable exponential bounds on the rate of convergence of the least-squares functional that are in very good agreement with the observed numerical convergence. Challenging numerical examples, including a nonconvex polygon with several corner singularities, and a cavity domain, are solved to around 10 digits of accuracy with a few seconds of CPU time. The examples are implemented concisely with MPSpack, a MATLAB toolbox for wave computations with nonpolynomial basis functions, developed by the authors. A code example is included.

Switching on a two-dimensional time-harmonic scalar wave in the presence of a diffracting edge

This paper concerns the switching on of two-dimensional time-harmonic scalar waves. We first review the switch-on problem for a point source in free space, then proceed to analyse the analogous problem for the diffraction of a plane wave by a half-line (the ‘Sommerfeld problem’), determining in both cases the conditions under which the field is well-approximated by the solution of the corresponding frequency domain problem. In both cases the rate of convergence to the frequency domain solution is found to be dependent on the strength of the singularity on the leading wavefront. In the case of plane wave diffraction at grazing incidence the frequency domain solution is immediately attained along the shadow boundary after the arrival of the leading wavefront. The case of non-grazing incidence is also considered.

Generalised Dirichelt-to-Neumann map in time dependent domains

We study the heat, linear Schrodinger and linear KdV equations in the domain l(t) < x < ∞, 0 < t < T, with prescribed initial and boundary conditions and with l(t) a given differentiable function. For the first two equations, we show that the unknown Neumann or Dirichlet boundary value can be computed as the solution of a linear Volterra integral equation with an explicit weakly singular kernel. This integral equation can be derived from the formal Fourier integral representation of the solution. For the linear KdV equation we show that the two unknown boundary values can be computed as the solution of a system of linear Volterra integral equations with explicit weakly singular kernels. The derivation in this case makes crucial use of analyticity and certain invariance properties in the complex spectral plane. The above Volterra equations are shown to admit a unique solution.

CP-OQAM-OFDM based SC-FDMA: adjustable user bandwidth and space-time coding

The discrete Fourier transmission spread OFDM DFTS-OFDM) based single-carrier frequency division multiple access (SC-FDMA) has been widely adopted due to its lower peak-to-average power ratio (PAPR) of transmit signals compared with OFDM. However, the offset modulation, which has lower PAPR than general modulation, cannot be directly applied into the existing SC-FDMA. When pulse-shaping filters are employed to further reduce the envelope fluctuation of transmit signals of SC-FDMA, the spectral efficiency degrades as well. In order to overcome such limitations of conventional SC-FDMA, this paper for the first time investigated cyclic prefixed OQAMOFDM (CP-OQAM-OFDM) based SC-FDMA transmission with adjustable user bandwidth and space-time coding. Firstly, we propose CP-OQAM-OFDM transmission with unequally-spaced subbands. We then apply it to SC-FDMA transmission and propose a SC-FDMA scheme with the following features: a) the transmit signal of each user is offset modulated single-carrier with frequency-domain pulse-shaping; b) the bandwidth of each user is adjustable; c) the spectral efficiency does not decrease with increasing roll-off factors. To combat both inter-symbolinterference and multiple access interference in frequencyselective fading channels, a joint linear minimum mean square error frequency domain equalization using a prior information with low complexity is developed. Subsequently, we construct space-time codes for the proposed SC-FDMA. Simulation results confirm the powerfulness of the proposed CP-OQAM-OFDM scheme (i.e., effective yet with low complexity).