Positive academic emotions moderate the relationship between self-regulation and academic achievement.

BACKGROUND
Research has shown how academic emotions are related to achievement and to cognitive/motivational variables that promote achievement. Mediated models have been proposed to account for the relationships among academic emotions, cognitive/motivational variables, and achievement, and research has supported such mediated models, particularly with negative emotions.

AIMS
The study tested the hypotheses: (1) self-regulation and the positive academic emotions of enjoyment and pride are positive predictors of achievement; and (2) enjoyment and pride both moderate the relationship between self-regulation and achievement.

SAMPLE
Participants were 1,345 students enrolled in various trigonometry classes in one university.

METHODS
Participants answered the Academic Emotions Questionnaire-Math (Pekrun, Goetz, & Frenzel, 2005) and a self-regulation scale (Pintrich, Smith, Garcia, & McKeachie, 1991) halfway through their trigonometry class. The students' final grades in the course were regressed to self-regulation, positive emotions, and the interaction terms to test the moderation effects.

RESULTS AND CONCLUSIONS
Enjoyment and pride were both positive predictors of grades; more importantly, both moderated the relationship between self-regulation and grades. For students who report higher levels of both positive emotions, self-regulation was positively associated with grades. However, for those who report lower levels of pride, self-regulation was not related to grades; and, for those who reported lower levels of enjoyment, self-regulation was negatively related to grades. The results are discussed in terms of how positive emotions indicate positive appraisals of task/outcome value, and thus enhance the positive links between cognitive/motivational variables and learning.


Adaptive systems for foreign exchange trading

Foreign exchange markets are notoriously difficult to predict. For many years academics and practitioners alike have tried to build trading models, but history has not been kind to their efforts. Consistently predicting FX markets has seemed like an impossible goal but recent advances in financial research now suggest otherwise. With newly developed computational techniques and newly available data, the development of successful trading models is looking possible. The Centre for Financial Research (CFR) at Cambridge University’s Judge Institute of Management has been researching trading techniques in foreign exchange markets for a number of years. Over the last 18 months a joint project with HSBC Global Markets has looked at how the bank’s proprietary information on customer order flow and on the customer limit order book can be used to enhance the profitability of technical trading systems in FX markets. Here we give an overview of that research and report our results.


Lung Pattern Classification for Interstitial Lung Diseases Using a Deep Convolutional Neural Network

Automated tissue characterization is one of the most crucial components of a computer aided diagnosis (CAD) system for interstitial lung diseases (ILDs). Although much research has been conducted in this field, the problem remains challenging. Deep learning techniques have recently achieved impressive results in a variety of computer vision problems, raising expectations that they might be applied in other domains, such as medical image analysis. In this paper, we propose and evaluate a convolutional neural network (CNN), designed for the classification of ILD patterns. The proposed network consists of 5 convolutional layers with 2 × 2 kernels and LeakyReLU activations, followed by average pooling with size equal to the size of the final feature maps and three dense layers. The last dense layer has 7 outputs, equivalent to the classes considered: healthy, ground glass opacity (GGO), micronodules, consolidation, reticulation, honeycombing and a combination of GGO/reticulation. To train and evaluate the CNN, we used a dataset of 14696 image patches, derived by 120 CT scans from different scanners and hospitals. To the best of our knowledge, this is the first deep CNN designed for the specific problem. A comparative analysis proved the effectiveness of the proposed CNN against previous methods in a challenging dataset. The classification performance ( ~ 85.5%) demonstrated the potential of CNNs in analyzing lung patterns. Future work includes, extending the CNN to three-dimensional data provided by CT volume scans and integrating the proposed method into a CAD system that aims to provide differential diagnosis for ILDs as a supportive tool for radiologists.


A convolutional neural network approach for face verification

In this paper, we present a convolutional neural network (CNN) approach for the face verification task. We propose a “Siamese” architecture of two CNNs, with each CNN reduced to only four layers by fusing convolutional and subsampling layers. Network training is performed using the stochastic gradient descent algorithm with annealed global learning rate. Generalization ability of network is investigated via unique pairing of face images, and testing is done on AT&T face database. Experimental work shows that the proposed CNN system can classify a pair of 46×46 pixel face images in 0.6 milliseconds, which is significantly faster compared to equivalent network architecture with cascade of convolutional and subsampling layers. The verification accuracy achieved is 3.33% EER (equal error rate). Learning converges within 20 epochs, and the proposed technique can verify a test subject unseen in training. This work shows the viability of the “Siamese” CNN for face verification applications, and further improvements to the architecture are under construction to enhance its performance.


Face Detection Using Convolutional Neural Networks and Gabor Filters

This paper proposes a method for detecting facial regions by combining a Gabor filter and a convolutional neural network. The first stage uses the Gabor filter which extracts intrinsic facial features. As a result of this transformation we obtain four subimages. The second stage of the method concerns the application of the convolutional neural network to these four images. The approach presented in this paper yields better classification performance in comparison to the results obtained by the convolutional neural network alone.


Multiclass Posterior Probability Support Vector Machines

Tao et. al. have recently proposed the posterior probability support vector machine (PPSVM) which uses soft labels derived from estimated posterior probabilities to be more robust to noise and outliers. Tao et. al.'s model uses a window-based density estimator to calculate the posterior probabilities and is a binary classifier. We propose a neighbor-based density estimator and also extend the model to the multiclass case. Our bias-variance analysis shows that the decrease in error by PPSVM is due to a decrease in bias. On 20 benchmark data sets, we observe that PPSVM obtains accuracy results that are higher or comparable to those of canonical SVM using significantly fewer support vectors.


A Generalized Representer Theorem

Wahba’s classical representer theorem states that the solutions of certain risk minimization problems involving an empirical risk term and a quadratic regularizer can be written as expansions in terms of the training examples. We generalize the theorem to a larger class of regularizers and empirical risk terms, and give a self-contained proof utilizing the feature space associated with a kernel. The result shows that a wide range of problems have optimal solutions that live in the finite dimensional span of the training examples mapped into feature space, thus enabling us to carry out kernel algorithms independent of the (potentially infinite) dimensionality of the feature space.


An extensive comparative study of cluster validity indices

The validation of the results obtained by clustering algorithms is a fundamental part of the clustering process. The most used approaches for cluster validation are based on internal cluster validity indices. Although many indices have been proposed, there is no recent extensive comparative study of their performance. In this paper we show the results of an experimental work that compares 30 cluster validity indices in many different environments with different characteristics. These results can serve as a guideline for selecting the most suitable index for each possible application and provide a deep insight into the performance differences between the currently available indices. & 2012 Elsevier Ltd. All rights reserved.


Joint precision optimization and high level synthesis for approximate computing

Approximate computing has been recognized as an effective low power technique for applications with intrinsic error tolerance, such as image processing and machine learning. Existing efforts on this front are mostly focused on approximate circuit design, approximate logic synthesis or processor architecture approximation techniques. This work aims at how to make good use of approximate circuits at system and block level. In particular, approximation aware scheduling, functional unit allocation and binding algorithms are developed for data intensive applications. Simple yet credible error models, which are essential for precision control in the optimizations, are investigated. The algorithms are further extended to include bitwidth optimization in fixed point computations. Experimental results, including those from Verilog simulations, indicate that the proposed techniques facilitate desired energy savings under latency and accuracy constraints.


On the impact of knowledge discovery and data mining

Knowledge Discovery and Data Mining are powerful automated data analysis tools and they are predicted to become the most frequently used analytical tools in the near future. The rapid dissemination of these technologies calls for an urgent examination of their social impact. This paper identifies social issues arising from Knowledge Discovery (KD) and Data Mining (DM). An overview of these technologies is presented, followed by a detailed discussion of each issue. The paper's intention is to primarily illustrate the cultural context of each issue and, secondly, to describe the impact of KD and DM in each case. Existing solutions specific to each issue are identified and examined for feasibility and effectiveness, and a solution that provides a suitably contextually sensitive means for gathering and analysing sensitive data is proposed and briefly outlined. The paper concludes with a discussion of topics for further consideration.


Analysis of Various Sentiment Classification Techniques

Sentiment analysis is an ongoing research area in the field of text mining. People post their review in form of unstructured data so opinion extraction provides overall opinion of reviews so it does best job for customer, people, organization etc. The main aim of this paper is to find out approaches that generate output with good accuracy. This paper presents recent updates on papers related to classification of sentiment analysis of implemented various approaches and algorithms. The main contribution of this paper is to give idea about that careful feature selection and existing classification approaches can give better accuracy.


Book recommendation system based on combine features of content based filtering, collaborative filtering and association rule mining

Recommendation systems are widely used to recommend products to the end users that are most appropriate. Online book selling websites now-a-days are competing with each other by many means. Recommendation system is one of the stronger tools to increase profit and retaining buyer. The book recommendation system must recommend books that are of buyer's interest. This paper presents book recommendation system based on combined features of content filtering, collaborative filtering and association rule mining.


A real-coded genetic algorithm for training recurrent neural networks

The use of Recurrent Neural Networks is not as extensive as Feedforward Neural Networks. Training algorithms for Recurrent Neural Networks, based on the error gradient, are very unstable in their search for a minimum and require much computational time when the number of neurons is high. The problems surrounding the application of these methods have driven us to develop new training tools. In this paper, we present a Real-Coded Genetic Algorithm that uses the appropriate operators for this encoding type to train Recurrent Neural Networks. We describe the algorithm and we also experimentally compare our Genetic Algorithm with the Real-Time Recurrent Learning algorithm to perform the fuzzy grammatical inference.


Behavioral inhibition , behavioral activation , and affective responses to impending reward and punishment : The BIS / BAS Scales

Gray (1981, 1982) holds that 2 general motivational systems underlie behavior and affect: a behavioral inhibition system (BIS) and a behavioral activation system (BAS). Self-report scales to assess dispositional BIS and BAS sensitivities were created. Scale development (Study 1) and convergent and discriminant validity in the form of correlations with alternative measures are reported (Study 2). In Study 3, a situation in which Ss anticipated a punishment was created. Controlling for initial nervousness, Ss high in BIS sensitivity (assessed earlier) were more nervous than those low. In Study 4, a situation in which Ss anticipated a reward was created. Controlling for initial happiness, Ss high in BAS sensitivity (Reward Responsiveness and Drive scales) were happier than those low. In each case the new scales predicted better than an alternative measure. Discussion is focused on conceptual implications.


Workshop on novelty and diversity in recommender systems - DiveRS 2011

Novelty and diversity have been identified as key dimensions of recommendation utility in real scenarios, and a fundamental research direction to keep making progress in the field. Yet recommendation novelty and diversity remain a largely open area for research. The DiveRS workshop gathered researchers and practitioners interested in the role of these dimensions in recommender systems. The workshop seeks to advance towards a better understanding of what novelty and diversity are, how they can improve the effectiveness of recommendation methods and the utility of their outputs. The workshop pursued the identification of open problems, relevant research directions, and opportunities for innovation in the recommendation business.


Autonomous Indoor Robot Navigation Using Sketched Maps and Routes

Hand drawn sketches are natural means by which a high level description of an environment can be provided. They can be exploited to impart coarse prior information about the scene to a robot, thereby enabling it to perform autonomous navigation and exploration when a full metrical description of the scene is not available beforehand. In this paper, we present a navigation system supplemented by a tablet interface that allows a user to sketch a rough map of an indoor environment and a desired trajectory for the robot to follow. We propose a novel theoretical framework for sketch interpretation based upon the manifold formalism in which associations between the sketch and the real world are modeled as local deformation of a suitable metric manifold. We also present empirical results from experimental evaluations of our approach in real world scenarios both from the perspective of the navigation capability and the usability of the interface.


Analysis and Defensive Tools for Social-Engineering Attacks on Computer Systems

The weakest link in an information-security chain is often the user because people can be manipulated. Attacking computer systems with information gained from social interactions is one form of social engineering (K. Mitnick, et al. 2002). It can be much easier to do than targeting the complex technological protections of systems (J. McDermott, Social engineering - the weakest link in information security). In an effort to formalize social engineering for cyberspace, we are building models of trust and attack. Models help in understanding the bewildering number of different tactics that can be employed. Social engineering attacks can be complex with multiple ploys and targets; our models function as subroutines that are called multiple times to accomplish attack goals in a coordinated plan. Models enable us to infer good countermeasures to social engineering


Conducted EMI noise mitigation in DC-DC converters using active filtering method

Electromagnetic interference (EMI) noise mitigation is an important issue that should be addressed and emphasized when designing DC/DC converters. These later, are known to be the primary culprit of the EMI noise generation in most of the electronic systems, mainly due to the switching action of the MOSFET circuitries. Passive input EMI LC filters have been the intuitive solution for EMI noise mitigation; hence they have been integrated in almost every DC/DC converters. However, their size, weight and cost can cause a significant constraint in some applications. To overcome these constraints, an input active EMI filter is proposed. The active filter is based on the noise current phase shift and the injection of this noise current back to the DC input bus. However, the combination of the input active and the passive filters shows a substantial attenuation of the conducted emissions as compared to the passive filter only, which in turn contributes to the reduction of the size and weight of the input passive EMI filter. The proposed combination provides a design solution for compliance engineers where the PCB real-estate is an issue. Experimental results to demonstrate the performance and the effectiveness of the input active EMI filter in DC/DC converters are presented.


ITU-T G.729.1: AN 8-32 Kbit/S Scalable Coder Interoperable with G.729 for Wideband Telephony and Voice Over IP

This paper describes the scalable coder - G.729.1 - which has been recently standardized by ITU-T for wideband telephony and voice over IP (VoIP) applications. G.729.1 can operate at 12 different bit rates from 32 down to 8 kbit/s with wideband quality starting at 14 kbit/s. This coder is a bitstream interoperable extension of ITU-T G.729 based on three embedded stages: narrowband cascaded CELP coding at 8 and 12 kbit/s, time-domain bandwidth extension (TDBWE) at 14 kbit/s, and split-band MDCT coding with spherical vector quantization (VQ) and pre-echo reduction from 16 to 32 kbit/s. Side information - consisting of signal class, phase, and energy - is transmitted at 12, 14 and 16 kbit/s to improve the resilience and recovery of the decoder in case of frame erasures. The quality, delay, and complexity of G.729.1 are summarized based on ITU-T results.


MultiSE: multi-path symbolic execution using value summaries

Dynamic symbolic execution (DSE) has been proposed to effectively generate test inputs for real-world programs. Unfortunately, DSE techniques do not scale well for large realistic programs, because often the number of feasible execution paths of a program increases exponentially with the increase in the length of an execution path. In this paper, we propose MultiSE, a new technique for merging states incrementally during symbolic execution, without using auxiliary variables. The key idea of MultiSE is based on an alternative representation of the state, where we map each variable, including the program counter, to a set of guarded symbolic expressions called a value summary. MultiSE has several advantages over conventional DSE and conventional state merging techniques: value summaries enable sharing of symbolic expressions and path constraints along multiple paths and thus avoid redundant execution. MultiSE does not introduce auxiliary symbolic variables, which enables it to 1) make progress even when merging values not supported by the constraint solver, 2) avoid expensive constraint solver calls when resolving function calls and jumps, and 3) carry out most operations concretely. Moreover, MultiSE updates value summaries incrementally at every assignment instruction, which makes it unnecessary to identify the join points and to keep track of variables to merge at join points. We have implemented MultiSE for JavaScript programs in a publicly available open-source tool. Our evaluation of MultiSE on several programs shows that 1) value summaries are an eective technique to take advantage of the sharing of value along multiple execution path, that 2) MultiSE can run significantly faster than traditional dynamic symbolic execution and, 3) MultiSE saves a substantial number of state merges compared to conventional state-merging techniques.


Variational Bayes with synthetic likelihood

Synthetic likelihood is an attractive approach to likelihood-free inference when an approximately Gaussian summary statistic for the data, informative for inference about the parameters, is available. The synthetic likelihood method derives an approximate likelihood function from a plug-in normal density estimate for the summary statistic, with plug-in mean and covariance matrix obtained by Monte Carlo simulation from the model. In this article, we develop alternatives to Markov chain Monte Carlo implementations of Bayesian synthetic likelihoods with reduced computational overheads. Our approach uses stochastic gradient variational inference methods for posterior approximation in the synthetic likelihood context, employing unbiased estimates of the log likelihood. We compare the new method with a related likelihood free variational inference technique in the literature, while at the same time improving the implementation of that approach in a number of ways. These new algorithms are feasible to implement in situations which are challenging for conventional approximate Bayesian computation (ABC) methods, in terms of the dimensionality of the parameter and summary statistic.


Head Pose and Expression Transfer Using Facial Status Score

We propose a method to transfer both head poseand facial expression of a source person in a video to the faceof a target person in an output video. Our method models theentire 2D frame instead of the 3D face, and it generates outputresults using a status score, which includes the relative facialstatus about the head pose and expression in a frame. From thetarget video, the learning process obtains frame features neededfor moving to each frame from the neutral frame for all frames,and generates the basis of these features via principal componentanalysis (PCA). Then, it learns to generate these features from agiven status score sequentially. In the transfer process, it obtainsa status score from a source frame of the video and generatesthe features from the given status score. Then, it generates theoutput frame using the reconstructed features. An output videois generated by repeating these steps for each source frame.Our method generates output results on the trajectory of thetarget video by using the advantage of PCA. Therefore, in theoutput results generated by our methods, both head pose andexpression are transferred correctly while the non-face regionsof the frames are supported. Finally, we experimentally comparethe effectiveness of our method and conventional methods.


Photovoltaic Power Conditioning System With Line Connection

A photovoltaic (PV) power conditioning system (PCS) with line connection is proposed. Using the power slope versus voltage of the PV array, the maximum power point tracking (MPPT) controller that produces a smooth transition to the maximum power point is proposed. The dc current of the PV array is estimated without using a dc current sensor. A current controller is suggested to provide power to the line with an almost-unity power factor that is derived using the feedback linearization concept. The disturbance of the line voltage is detected using a fast sensing technique. All control functions are implemented in software with a single-chip microcontroller. Experimental results obtained on a 2-kW prototype show high performance such as an almost-unity power factor, a power efficiency of 94%, and a total harmonic distortion (THD) of 3.6%


Predicting Movie Revenue from IMDb Data

Given the information known about a movie in the we ek of its release, can we predict the total gross revenue for that movie? Such information would be u s f l to marketers, theater operators, and others i n the movie industry, but it is a hard problem, even for human beings. We found that, given a set of numeric , textbased, and sentiment features from IMDb, linear reg ession outperforms class-based logistic regression at predicting gross revenue. However, neither gives su fficiently precise results to be used in practice.


Semi-productive Polysemy and Sense Extension

In this paper we discuss various aspects of systematic or conventional polysemy and their formal treatment within an implemented constraint based approach to linguistic representation. We distinguish between two classes of systematic polysemy: constructional polysemy, where a single sense assigned to a lexical entry is contextually specialised, and sense extension, which predictably relates two or more senses. Formally the first case is treated as instantiation of an underspecified lexical entry and the second by use of lexical rules. The problems of distinguishing between these two classes are discussed in detail. We illustrate how lexical rules can be used both to relate fully conventionalised senses and also applied productively to recognise novel usages and how this process can be controlled to account for semi-productivity by utilising probabilities.


Type shifting in construction grammar : An integrated approach to aspectual coercion *

Implicit type shifting, or coercion, appears to indicate a modular grammatical architecture, in which the process of semantic composition may add meanings absent from the syntax in order to ensure that certain operators, e.g., the progressive, receive suitable arguments (Jackendo¤ 1997; De Swart 1998). I will argue that coercion phenomena actually provide strong support for a sign-based model of grammar, in which rules of morphosyntactic combination can shift the designations of content words with which they combine. On this account, enriched composition is a by-product of the ordinary referring behavior of constructions. Thus, for example, the constraint which requires semantic concord between the syntactic sisters in the string a bottle is also what underlies the coerced interpretation found in a beer. If this concord constraint is stated for a rule of morphosyntactic combination, we capture an important generalization: a single combinatory mechanism, the construction, is responsible for both coerced and compositional meanings. Since both type-selecting constructions (e.g., the French Imparfait) and type-shifting constructions (e.g., English progressive aspect) require semantic concord between syntactic sisters, we account for the fact that constructions of both types perform coercion. Coercion data suggest that aspectual sensitivity is not merely a property of formally di¤erentiated past tenses, as in French and Latin, but a general property of tense constructions, including the English present and past tenses.


Grammatical Constructions and Linguistic Generalizations : the What ' s X doing Y ? Construction 1

To adopt a constructional approach is to undertake a commitment in principle to account for the entirety of each language. This means that the relatively general patterns of the language, such as the one licensing the ordering of a finite auxiliary verb before its subject in English as illustrated in (1), and the more idiomatic patterns, such as those exemplified in (2), stand on an equal footing as data for which the grammar must provide an account.


On the relationship between math anxiety and math achievement in early elementary school: The role of problem solving strategies.

Even at young ages, children self-report experiencing math anxiety, which negatively relates to their math achievement. Leveraging a large dataset of first and second grade students' math achievement scores, math problem solving strategies, and math attitudes, we explored the possibility that children's math anxiety (i.e., a fear or apprehension about math) negatively relates to their use of more advanced problem solving strategies, which in turn relates to their math achievement. Our results confirm our hypothesis and, moreover, demonstrate that the relation between math anxiety and math problem solving strategies is strongest in children with the highest working memory capacity. Ironically, children who have the highest cognitive capacity avoid using advanced problem solving strategies when they are high in math anxiety and, as a result, underperform in math compared with their lower working memory peers.


Selective harmonic elimination modulation technique applied on four-leg NPC

In this paper the selective harmonic elimination pulse width modulation (SHE-PWM) technique is proposed to control the three-level four-leg neutral point clamped (NPC) inverter in order to have both advantages of low switching frequency of SHE and neutral point of fourth leg in four wire systems. In this proposed method, the obtained switching angles of inverter phase legs are used to eliminate the non-triplen, 5th to 23th harmonics orders from the output voltage. As well, switching angles calculated for the fourth leg are considered to eliminate the triplen harmonics containing 3th, 9th, 15th, 21th and 27th orders from phase voltage. The efficiency of the proposed modulation technique is verified by simulations of a four leg NPC inverter as an UPS feeding different types of dynamic and unbalanced loads.


Evaluation of direct attacks to fingerprint verification systems

The vulnerabilities of fingerprint-based recognition systems to direct attacks with and without the cooperation of the user are studied. Two different systems, one minutiae-based and one ridge feature-based, are evaluated on a database of real and fake fingerprints. Based on the fingerprint images quality and on the results achieved on different operational scenarios, we obtain a number of statistically significant observations regarding the robustness of the systems.


Conjunctive representation of position, direction, and velocity in entorhinal cortex.

Grid cells in the medial entorhinal cortex (MEC) are part of an environment-independent spatial coordinate system. To determine how information about location, direction, and distance is integrated in the grid-cell network, we recorded from each principal cell layer of MEC in rats that explored two-dimensional environments. Whereas layer II was predominated by grid cells, grid cells colocalized with head-direction cells and conjunctive grid x head-direction cells in the deeper layers. All cell types were modulated by running speed. The conjunction of positional, directional, and translational information in a single MEC cell type may enable grid coordinates to be updated during self-motion-based navigation.


Compliance through Informed Consent: Semantic Based Consent Permission and Data Management Model

The General Data Protection Regulations (GDPR) imposes greater restrictions on obtaining valid user consents involving the use of personal data. A semantic model of consent can make the concepts of consent explicit, establish a common understanding and enable re-use of consent. Therefore, forming a semantic model of consent will satisfy the GDPR requirements of specificity and unambiguity and is an important step towards ensuring compliance. In this paper, we discuss obtaining an open vocabulary of expressing consent leveraging existing semantic models of provenance, processes, permission and obligations. We also present a reference architecture for the management of data processing according to consent permission. This data management model utilizes the open vocabulary of consent and incorporates the change of context into the data processing activity. By identifying and incorporating changes to the relational context between data controllers and data subjects into the data processing model, it aims to improve the integration of data management across different information systems specifically adhering to the GDPR and helping controllers to demonstrate compliance.


Risk and parameter convergence of logistic regression

The logistic loss is strictly convex and does not attain its infimum; consequently the solutions of logistic regression are in general off at infinity. This work provides a convergence analysis of stochastic and batch gradient descent for logistic regression. Firstly, under the assumption of separability, stochastic gradient descent minimizes the population risk at rate O(ln(t)/t) with high probability. Secondly, with or without separability, batch gradient descent minimizes the empirical risk at rate O(ln(t)/t). Furthermore, parameter convergence can be characterized along a unique pair of complementary subspaces defined by the problem instance: one subspace along which strong convexity induces parameters to converge at rate O(ln(t)/ √ t), and its orthogonal complement along which separability induces parameters to converge in direction at rate O(ln ln(t)/ ln(t)). 1 Overview Logistic regression is the task of finding a vector w ∈ R which approximately minimizes the population or empirical logistic risk, namely Rlog(w) := E [ `log(〈w,−yx〉) ] or R̂log(w) := 1 n n ∑ i=1 `log(〈w,−yixi〉), where `log(r) := ln ( 1 + exp(r) ) is the logistic loss. A traditional way to minimize Rlog or R̂log is to pick an arbitrary w0, and from there recursively construct stochastic gradient descent (SGD) or gradient descent (GD) iterates (wj)j≥0 via wj+1 := wj − ηjgj , where (ηj)j≥0 are step sizes, and gj := ` ′ log (〈 wj ,−yjxj 〉) (−yjxj) for SGD or gj := ∇R̂`log(wj) for GD. A common assumption is that the distribution on (x, y) is separable (Novikoff, 1962; Soudry et al., 2017). Under this assumption, the first result here is that SGD with constant step sizes minimizes the population risk Rlog at rate Õ(1/t) with high probability. Theorem 1.1 (Simplification of Theorem 2.1). Suppose there exists a unit vector ū with 〈ū, yx〉 ≥ γ, and |yx| ≤ 1 almost surely. Consider SGD iterates (wj)j≥0 as above, with w0 = 0 and ηj = 1. Then for any t ≥ 1, |wt| ≤ O(ln(t)), and with probability at least 1− δ, the average iterate ŵt := t−1 ∑ j<t wj satisfies Rlog(ŵt) ≤ O ( ln(t) + ln(t) ln(1/δ) t ) . This result improves upon prior work in the following ways. 1. Since `log exhibits an exponential tail and Lipschitz continuity, standard analyses give a Õ(1/ √ t) rate of SGD with step size ηj = 1/ √ j + 1, but only in expectation (Nesterov, 2004; Bubeck, 2015). With the O(ln(t)) bound on |wt| given by Theorem 1.1, Azuma-Hoeffding’s inequality gives a high-probability Õ(1/ √ t) rate. However, since standard analyses do not ensure a vanishing risk with constant step sizes, they do not give a Õ(1/t) rate. 1 ar X iv :1 80 3. 07 30 0v 2 [ cs .L G ] 1 J un 2 01 8 2. The only other prior high-probability Õ(1/t) rate is under strong convexity (e.g., (Rakhlin et al., 2012)): |wt − w̄| ≤ Õ(1/t) with high probability, where w̄ is the global optimum. However, `log is not strongly convex on R, and even in trivial cases the optimum of logistic regression may be off at infinity: suppose examples (xi) n i=1 lie on the positive real line, and labels (yi) n i=1 are all +1; then infw∈R R̂log(w) = 0, but R̂log(w) > 0 for every w ∈ R. Furthermore, not only do the guarantees here avoid strong convexity; the proofs are different. The proof of Theorem 1.1 is based on the perceptron proof, and might be of independent interest. Now consider batch gradient descent on empirical risk. In this case, a stronger result is possible: no assumption is made (separability is dropped), and the parameters may be precisely characterized. Theorem 1.2 (Simplification of Theorems 3.1, 3.2 and 3.6). Let examples ((xi, yi)) n i=1 be given with |xiyi| ≤ 1, along with a loss ` ∈ {`log, exp}, with corresponding empirical risk R̂ as above. Consider GD iterates (wj)j≥0 as above, with w0 = 0. 1. (Convergence in risk.) For any step sizes ηj ≤ 1 and any t ≥ 1, R̂(wt)− inf w∈Rd R̂(w) = O ( 1 t + ln(t) ∑ j<t ηj ) = { O(ln(t)/t) ηj = Ω(1), O(ln(t)/ √ t) ηj = Ω(1/ √ j + 1). 2. (Convergence in parameters.) There exists a unique subspace S, unique unit vector ū ∈ S⊥, and unique vector v̄ ∈ S which characterize convergence as follows. Fixing step size ηj := 1/ √ j + 1, letting ΠS denote orthogonal projection onto S, and defining optimal iterates w̄t := inf { R̂(w) : |w| ≤ |wt| } , if t = Ω(n ln(t)), then |ΠSwt| = Θ(1) and max { |ΠSwt − v̄|, |ΠSw̄t − v̄| } = O ( ln(t) √ t ) , |ΠS⊥wt| = Θ(ln(t)) and max ∣∣∣∣ wt |wt| − ū ∣∣∣∣2 , ∣∣∣∣ w̄t |w̄t| − ū ∣∣∣∣2 } = O ( ln ln t ln t ) . In particular, wt/|wt|→ ū and ΠSwt → v̄. To make sense of this, recall firstly the earlier discussion that the solutions are off at infinity in general. As will be made precise in Section 3.1, if examples are separable, then S = {0}, v̄ = 0, and ū is the unique maximum margin separator. The GD iterates not only keep driving R̂ to its infimum 0, but also closely track ū in direction, meaning wt/|wt|→ ū. Note that this is a strong mode of convergence: R̂(wt) = Õ(1/t) and |wt| = Θ(ln(t)) do not exclude the possibility that there is always a large angle between wt/|wt| and ū. The full part 2 of Theorem 1.2 gives a characterization of parameter convergence in the general setting: the parameter space can be split into a subspace S along which optimization is strongly convex, and its complement S⊥ along which the problem behaves as though separable. While there does exist recent prior work on parameter convergence of gradient descent for logistic regression (Soudry et al., 2017; Gunasekar et al., 2018; Nacson et al., 2018), it assumes separability. The analysis essentially for free gives convergence not only to (v̄, ū), but also to the optimal iterates w̄t. Consequently, logistic regression is implicitly regularized in a strong sense: it produces a sequence of iterates which closely track the outputs of a sequence of constraint optimization problems. This paper is organized as follows. SGD population risk convergence (Section 2). An online guarantee is given by a perceptron-style analysis, and transformed into a high-probability bound via a martingale Bernstein bound. Empirical samples structure (Section 3.1). The first step of the analysis is to derive the unique complementary subspaces (S, S⊥), along with unique optimal direction ū ∈ S⊥ and unique vector v̄ ∈ S. (S, S⊥) and ū are unique given the data ((xi, yi)) n i=1 and are not affected by the choice of ` or optimization method; v̄ depends on ` but not on the optimization method.


Enabling ECN in Multi-Service Multi-Queue Data Centers

Recent proposals have leveraged Explicit Congestion Notification (ECN) to achieve high throughput low latency data center network (DCN) transport. However, most of them implicitly assume each switch port has one queue, making the ECN schemes they designed inapplicable to production DCNs where multiple service queues per port are employed to isolate different traffic classes through weighted fair sharing. In this paper, we reveal this problem by leveraging extensive testbed experiments to explore the intrinsic tradeoffs between throughput, latency, and weighted fair sharing in multi-queue scenarios. Using the guideline learned from the exploration, we design MQ-ECN, a simple yet effective solution to enable ECN for multi-service multiqueue production DCNs. Through a series of testbed experiments and large-scale simulations, we show that MQ-ECN breaks the tradeoffs by delivering both high throughput and low latency simultaneously, while still preserving weighted fair sharing.


Quantization Mimic: Towards Very Tiny CNN for Object Detection

In this paper, we propose a simple and general framework for training very tiny CNNs (e.g. VGG with the number of channels reduced to 1 32 ) for object detection. Due to limited representation ability, it is challenging to train very tiny networks for complicated tasks like detection. To the best of our knowledge, our method, called Quantization Mimic, is the first one focusing on very tiny networks. We utilize two types of acceleration methods: mimic and quantization. Mimic improves the performance of a student network by transfering knowledge from a teacher network. Quantization converts a full-precision network to a quantized one without large degradation of performance. If the teacher network is quantized, the search scope of the student network will be smaller. Using this feature of the quantization, we propose Quantization Mimic. It first quantizes the large network, then mimic a quantized small network. The quantization operation can help student network to better match the feature maps from teacher network. To evaluate our approach, we carry out experiments on various popular CNNs including VGG and Resnet, as well as different detection frameworks including Faster R-CNN and R-FCN. Experiments on Pascal VOC and WIDER FACE verify that our Quantization Mimic algorithm can be applied on various settings and outperforms state-of-the-art model acceleration methods given limited computing resouces.


Data Approximation Using Biarcs

. An algorithm for data approximation with biarcs is presented. The method uses a specific formulation of biarcs appropriate for parametric curves in Bézier or NURBS formulation. A base curve is applied to obtain tangents and anchor points for the individual arcs joining in G 1 continuity. Data sampled from circular arcs or straight line segments is represented precisely by one biarc. The method is most useful in numerical control to drive the cutter along straight line or circular paths.


Retrieve and Re-rank: A Simple and Effective IR Approach to Simple Question Answering over Knowledge Graphs

SimpleQuestions is a commonly used benchmark for single-factoid question answering (QA) over Knowledge Graphs (KG). Existing QA systems rely on various components to solve different sub-tasks of the problem (such as entity detection, entity linking, relation prediction and evidence integration). In this work, we propose a different approach to the problem and present an information retrieval style solution for it. We adopt a two-phase approach: candidate generation and candidate re-ranking to answer questions. We propose a Triplet-Siamese-Hybrid CNN (TSHCNN) to re-rank candidate answers. Our approach achieves an accuracy of 80% which sets a new state-of-the-art on the SimpleQuestions dataset.


Hypervisor Memory Forensics

Memory forensics is the branch of computer forensics that aims at extracting artifacts from memory snapshots taken from a running system. Even though it is a relatively recent field, it is rapidly growing and it is attracting considerable attention from both industrial and academic researchers. In this paper, we present a set of techniques to extend the field of memory forensics toward the analysis of hypervisors and virtual machines. With the increasing adoption of virtualization techniques (both as part of the cloud and in normal desktop environments), we believe that memory forensics will soon play a very important role in many investigations that involve virtual environments. Our approach, implemented in an open source tool as an extension of the Volatility framework, is designed to detect both the existence and the characteristics of any hypervisor that uses the Intel VT-x technology. It also supports the analysis of nested virtualization and it is able to infer the hierarchy of multiple hypervisors and virtual machines. Finally, by exploiting the techniques presented in this paper, our tool can reconstruct the address space of a virtual machine in order to transparently support any existing Volatility plugin allowing analysts to reuse their code for the analysis of virtual environments.


A Scalable SIEM Correlation Engine and Its Application to the Olympic Games IT Infrastructure

The security event correlation scalability has become a major concern for security analysts and IT administrators when considering complex IT infrastructures that need to handle gargantuan amounts of events or wide correlation window spans. The current correlation capabilities of Security Information and Event Management (SIEM), based on a single node in centralized servers, have proved to be insufficient to process large event streams. This paper introduces a step forward in the current state of the art to address the aforementioned problems. The proposed model takes into account the two main aspects of this field: distributed correlation and query parallelization. We present a case study of a multiple-step attack on the Olympic Games IT infrastructure to illustrate the applicability of our approach.


Autonomous Navigation for Micro Aerial Vehicles in Complex GNSS-denied Environments

Micro aerial vehicles, such as multirotors, are particular well suited for the autonomous monitoring, inspection, and surveillance of buildings, e.g., for maintenance in industrial plants. Key prerequisites for the fully autonomous operation of micro aerial vehicles in restricted environments are 3D mapping, real-time pose tracking, obstacle detection, and planning of collision-free trajectories. In this article, we propose a complete navigation system with a multimodal sensor setup for omnidirectional environment perception. Measurements of a 3D laser scanner are aggregated in egocentric local multiresolution grid maps. Local maps are registered and merged to allocentric maps in which the MAV localizes. For autonomous navigation, we generate trajectories in a multi-layered approach: from mission planning over global and local trajectory planning to reactive obstacle avoidance. We evaluate our approach in a GNSS-denied indoor environment where multiple collision hazards require reliable omnidirectional perception and quick navigation reactions.


Short-Text Topic Modeling via Non-negative Matrix Factorization Enriched with Local Word-Context Correlations

Being a prevalent form of social communications on the Internet, billions of short texts are generated everyday. Discovering knowledge from them has gained a lot of interest from both industry and academia. The short texts have a limited contextual information, and they are sparse, noisy and ambiguous, and hence, automatically learning topics from them remains an important challenge. To tackle this problem, in this paper, we propose a semantics-assisted non-negative matrix factorization (SeaNMF) model to discover topics for the short texts. It effectively incorporates the word-context semantic correlations into the model, where the semantic relationships between the words and their contexts are learned from the skip-gram view of the corpus. The SeaNMF model is solved using a block coordinate descent algorithm. We also develop a sparse variant of the SeaNMF model which can achieve a better model interpretability. Extensive quantitative evaluations on various realworld short text datasets demonstrate the superior performance of the proposed models over several other state-of-the-art methods in terms of topic coherence and classification accuracy. The qualitative semantic analysis demonstrates the interpretability of our models by discovering meaningful and consistent topics. With a simple formulation and the superior performance, SeaNMF can be an effective standard topic model for short texts.


Empirical research on consumers' initial trust and gender differences in B2C e-business

Based on the Technology Acceptance Model and related literatures, this paper proposes an integrated conceptual model of consumers' initial trust in B2C e-business. Empirical research results show that, perceived usefulness, perceived safety, perceived website reputation and propensity to trust significantly positively affect consumers' initial trust in e-vendor, which further positively influence consumers' intention to purchase online, by the complete mediation of attitude; however, the effect of perceived use of use on initial trust doesn't show the statistic significance. Furthermore, there are significant gender differences in the effects of perceived ease of use, perceived safety, perceived website reputation on consumers' initial trust.


Digital array radar: Technology and trends

This paper presents the architecture of digital array radar and analysis the key technologies, digital T/R modules, waveform generation and amplitude-phase control module based on DDS, frequency up/down convert, high efficiency power amplifier, hybrid digital/microwave multilayer circuit and high performance computing are described as the main technologies. The correlation between the microsystems technologies and digital array architectures trends is also discussed.


ACCIDENT AVOIDANCE AND DETECTION ON HIGHWAYS

Technological approaches for detecting and monitoring fatigue levels of driver fatigue continue to emerge and many are now in the development, validation testing, or early implementation stages. Previous studies have reviewed available fatigue detection and prediction technologies and methodologies. As the name indicates this project is about advanced technologies in cars for making it more intelligent and interactive for avoiding accidents on roads. By using ARM7 this system becomes more efficient, reliable & effective. There are very less number of systems implemented on human behaviour detection in or with cars. In this paper, we describe a real-time online safety prototype that controls the vehicle speed under driver fatigue. The purpose of such a model is to advance a system to detect fatigue symptoms in drivers and control the speed of vehicle to avoid accidents. The main components of the system consist of number of real time sensors like gas, eye blink, alcohol, fuel, impact sensors and a software interface with GPS and Google Maps APIs for location.


A cryptosystem based on Vigenère cipher with varying key

— Privacy is one of the key issues information Security addresses. Through encryption one can prevent a third party from understanding raw data during signal transmission. The encryption methods for enhancing the security of digital contents has gained high significance in the current era of breach of security and misuse of the confidential information intercepted and misused by the unauthorized parties. This paper sets out to contribute to the general body of knowledge in the area of cryptography application and by developing a new way of implementing Vigenère cipher encryption algorithm by automatically changing the cipher key after each encryption step. The new method will use successive keys that will be dependent on the initial key value during the encryption process. The algorithm ultimately makes it possible for encryption and decryption of the text. The ciphertext will have different encryption key pattern and the Vigenère cryptosystem will be more difficult to decipher using frequency attack. The implementation will be done using java programming.


Learning to recommend with explicit and implicit social relations

Recommender systems have been well studied and developed, both in academia and in industry recently. However, traditional recommender systems assume that all the users are independent and identically distributed; this assumption ignores the connections among users, which is not consistent with the real-world observations where we always turn to our trusted friends for recommendations. Aiming at modeling recommender systems more accurately and realistically, we propose a novel probabilistic factor analysis framework which naturally fuses the users' tastes and their trusted friends' favors together. The proposed framework is quite general, and it can also be applied to pure user-item rating matrix even if we do not have explicit social trust information among users. In this framework, we coin the term social trust ensemble to represent the formulation of the social trust restrictions on the recommender systems. The complexity analysis indicates that our approach can be applied to very large datasets since it scales linearly with the number of observations, while the experimental results show that our method outperforms state-of-the-art approaches.


Activity Monitoring: Noticing Interesting Changes in Behavior

We introduce a problem class which we term activity monitoring. Such problems involve monitoring the behavior of a large population of entities for interesting events requiring action. We present a framework within which each of the individual problems has a natural expression, as well as a methodology for evaluating performance of activity monitoring techniques. We show that two superficially different tasks, news story monitoring and intrusion detection, can be expressed naturally within the framework, and show that key differences in solution methods can be compared.


LOCI: Fast Outlier Detection Using the Local Correlation Integral

Outlier detection is an integral part of data mining and has attracted much attention recently [BKNS00, JTH01, KNT00]. In this paper, we propose a new method for evaluating outlier-ness, which we call theLocal Correlation Integral(LOCI). As with the best previous methods, LOCI is highly effective for detecting outliers and groups of outliers ( a.k.a.micro-clusters). In addition, it offers the following advantages and novelties: (a) It provides an automatic, data-dictated cut-off to determine whether a point is an outlier—in contrast, previous methods force users to pick cut-offs, without any hints as to what cut-off value is best for a given dataset. (b) It can provide a LOCI plot for each point; this plot summarizes a wealth of information about the data in the vicinity of the point, determining clusters, micro-clusters, their diameters and their inter-cluster distances. None of the existing outlier-detection methods can match this feature, because they output only a single number for each point: its outlierness score.(c) Our LOCI method can be computed as quickly as the best previous methods. (d) Moreover, LOCI leads to a practically linear approximate method, aLOCI (for approximate LOCI ), which provides fast highly-accurate outlier detection. To the best of our knowledge, this is the first work to use approximate computations to speed up outlier detection. Experiments on synthetic and real world data sets show that LOCI and aLOCI can automatically detect outliers and micro-clusters, without user-required cut-offs, and that they quickly spot both expected and unexpected outliers.


A Fast Greedy Algorithm for Outlier Mining

The task of outlier detection is to find small groups of data objects that are exceptional when compared with rest large amount of data. Recently, the problem of outlier detection in categorical data is defined as an optimization problem and a local-search heuristic based algorithm (LSA) is presented. However, as is the case with most iterative type algorithms, the LSA algorithm is still very time-consuming on very large datasets. In this paper, we present a very fast greedy algorithm for mining outliers under the same optimization model. Experimental results on real datasets and large synthetic datasets show that: (1) Our new algorithm has comparable performance with respect to those state-of-the-art outlier detection algorithms on identifying true outliers and (2) Our algorithm can be an order of magnitude faster than LSA algorithm.


Outlier detection by active learning

Most existing approaches to outlier detection are based on density estimation methods. There are two notable issues with these methods: one is the lack of explanation for outlier flagging decisions, and the other is the relatively high computational requirement. In this paper, we present a novel approach to outlier detection based on classification, in an attempt to address both of these issues. Our approach isbased on two key ideas. First, we present a simple reduction of outlier detection to classification, via a procedure that involves applying classification to a labeled data set containing artificially generated examples that play the role of potential outliers. Once the task has been reduced to classification, we then invoke a selective sampling mechanism based on active learning to the reduced classification problem. We empirically evaluate the proposed approach using a number of data sets, and find that our method is superior to other methods based on the same reduction to classification, but using standard classification methods. We also show that it is competitive to the state-of-the-art outlier detection methods in the literature based on density estimation, while significantly improving the computational complexity and explanatory power.


Transfer metric learning for action similarity using high-level semantics

The goal of transfer learning is to exploit previous experiences and knowledge in order to improve learning in a novel domain. This is especially beneficial for the challenging task of learning classifiers that generalize well when only few training examples are available. In such a case, knowledge transfer methods can help to compensate for the lack of data. The performance and robustness against negative transfer of these approaches is influenced by the interdependence between knowledge representation and transfer type. However, this important point is usually neglected in the literature; instead the focus lies on either of the two aspects. In contrast, we study in this work the effect of various high-level semantic knowledge representations on different transfer types in a novel generic transfer metric learning framework. Furthermore, we introduce a hierarchical knowledge representation model based on the embedded structure in the semantic attribute space. The evaluation of the framework on challenging transfer settings in the context of action similarity demonstrates the effectiveness of our approach compared to state-of-the-art. c © 2015 Elsevier Ltd. All rights reserved.


Songle: A Web Service for Active Music Listening Improved by User Contributions

This paper describes a public web service for active music listening,Songle, that enriches music listening experiences by using music-understanding technologies based on signal processing. Although various research-level interfaces and technologies have been developed, it has not been easy to get people to use them in everyday life. Songle serves as a showcase to demonstrate how people can benefit from music-understanding technologies by enabling people to experience active music listening interfaces on the web. Songle facilitates deeper understanding of music by visualizing music scene descriptions estimated automatically, such as music structure, hierarchical beat structure, melody line, and chords. When using music-understanding technologies, however, estimation errors are inevitable. Songle therefore features an efficient error correction interface that encourages people to contribute by correcting those errors to improve the web service. We also propose a mechanism of collaborative training for music-understanding technologies, in which corrected errors will be used to improve the music-understanding performance through machine learning techniques. We hope Songle will serve as a research platform where other researchers can exhibit results of their music-understanding technologies to jointly promote the popularization of the field of music information research.


Combining Data Mining and Machine Learning for Effective Fraud Detection *

This paper describes the automatic design of methods for detecting fraudulent behavior. Much of the design is accomplished using a series of machine learning methods. In particular, we combine data mining and constructive induction with more standard machine learning techniques to design methods for detecting fraudulent usage of cellular telephones based on profiling customer behavior. Specifically, we use a rulelearning program to uncover indicators of fraudulent behavior from a large database of cellular calls. These indicators are used to create profilers, which then serve as features to a system that combines evidence from multiple profilers to generate high-confidence alarms. Experiments indicate that this automatic approach performs nearly as well as the best hand-tuned methods for detecting fraud.


An Improvement of Data Classification Using Random Multimodel Deep Learning (RMDL)

The exponential growth in the number of complex datasets every year requires more enhancement in machine learning methods to provide robust and accurate data classification. Lately, deep learning approaches have achieved surpassing results in comparison to previous machine learning algorithms. However, finding the suitable structure for these models has been a challenge for researchers. This paper introduces Random Multimodel Deep Learning (RMDL): a new ensemble, deep learning approach for classification. RMDL solves the problem of finding the best deep learning structure and architecture while simultaneously improving robustness and accuracy through ensembles of deep learning architectures. In short, RMDL trains multiple randomly generated models of Deep Neural Network (DNN), Convolutional Neural Network (CNN) and Recurrent Neural Network (RNN) in parallel and combines their results to produce better result of any of those models individually. In this paper, we describe RMDL model and compare the results for image and text classification as well as face recognition. We used MNIST and CIFAR-10 datasets as ground truth datasets for image classification and WOS, Reuters, IMDB, and 20newsgroup datasets for text classification. Lastly, we used ORL dataset to compare the model performance on face recognition task.


IccTA: Detecting Inter-Component Privacy Leaks in Android Apps

Shake Them All is a popular "Wallpaper" application exceeding millions of downloads on Google Play. At installation, this application is given permission to (1) access the Internet (for updating wallpapers) and (2) use the device microphone (to change background following noise changes). With these permissions, the application could silently record user conversations and upload them remotely. To give more confidence about how Shake Them All actually processes what it records, it is necessary to build a precise analysis tool that tracks the flow of any sensitive data from its source point to any sink, especially if those are in different components.
 Since Android applications may leak private data carelessly or maliciously, we propose IccTA, a static taint analyzer to detect privacy leaks among components in Android applications. IccTA goes beyond state-of-the-art approaches by supporting inter-component detection. By propagating context information among components, IccTA improves the precision of the analysis. IccTA outperforms existing tools on two benchmarks for ICC-leak detectors: DroidBench and ICC-Bench. Moreover, our approach detects 534 ICC leaks in 108 apps from MalGenome and 2,395 ICC leaks in 337 apps in a set of 15,000 Google Play apps.


Water Quality Measurement and Control from Remote Station for Pisiculture Using NI myRIO Beena

A Wireless sensor network is designed and implemented to automatically and remotely monitor and control the water quality parameters such as temperature, turbidity, pH and dissolved oxygen required for pisiculture. The measurements of the system which is at base station are communicated to the remote farmer through built-in Wi-Fi of NI-myRIO and displayed on user’s computer screen from where he can monitor and change the settings of the system. An audio output is also produced from speakers of the computer. SMS alert is sent to farmer’s mobile for variations in the monitored parameters of the system at the base station via GSM modem. The programming of the entire system is done using LabVIEW software and NI myRIO which has inbuilt processor, FPGA, Wi-Fi and web servicing capabilities. Web publishing tool of LabVIEW allows internet access to the front panel of the system to any remote user.


Lessons Learned from AlphaGo

The game of Go is known to be one of the most complicated board games. Competing in Go against a professional human player has been a long-standing challenge for AI. In this paper we shed light on the AlphaGo program that could beat a Go world champion, which was previously considered non-achievable for the state of the art AI.


Sub-Optimal Multi-Phase Path Planning: A Method for Solving Rubik's Revenge

Rubik’s Revenge, a 4× 4× 4 variant of the Rubik’s puzzles, remains to date as an unsolved puzzle. That is to say, we do not have a method or successful categorization to optimally solve every one of its approximately 7.401×10 possible configurations. Rubik’s Cube, Rubik’s Revenge’s predecessor (3×3×3), with its approximately 4.33 × 10 possible configurations, has only recently been completely solved by Rokicki et. al, further finding that any configuration requires no more than 20 moves. [8] With the sheer dimension of Rubik’s Revenge and its total configuration space, a brute-force method of finding all optimal solutions would be in vain. Similar to the methods used by Rokicki et. al on Rubik’s Cube, in this paper we develop a method for solving arbitrary configurations of Rubik’s Revenge in phases, using a combination of a powerful algorithm known as IDA* and a useful definition of distance in the cube space. While time-series results were not successfully gathered, it will be shown that this method far outweighs current human-solving methods and can be used to determine loose upper bounds for the cube space. Discussion will suggest that this method can also be applied to other puzzles with the proper transformations.


Segmentation of Glioma Tumors in Brain Using Deep Convolutional Neural Network

Detection of brain tumor using a segmentation based approach is critical in cases, where survival of a subject depends on an accurate and timely clinical diagnosis. Gliomas are the most commonly found tumors having irregular shape and ambiguous boundaries, making them one of the hardest tumors to detect. The automation of brain tumor segmentation remains a challenging problem mainly due to significant variations in its structure. An automated brain tumor segmentation algorithm using deep convolutional neural network (DCNN) is presented in this paper. A patch based approach along with an inception module is used for training the deep network by extracting two co-centric patches of different sizes from the input images. Recent developments in deep neural networks such as drop-out, batch normalization, non-linear activation and inception module are used to build a new ILinear nexus architecture. The module overcomes the over-fitting problem arising due to scarcity of data using drop-out regularizer. Images are normalized and bias field corrected in the pre-processing step and then extracted patches are passed through a DCNN, which assigns an output label to the central pixel of each patch. Morphological operators are used for post-processing to remove small false positives around the edges. A two-phase weighted training method is introduced and evaluated using BRATS 2013 and BRATS 2015 datasets, where it improves the performance parameters of state-of-the-art techniques under similar settings.


Detection of non-flat ground surfaces using V-Disparity images

Ground plane detection plays an important role in stereo vision based obstacle detection methods. Recently, V-Disparity image has been widely used for ground plane detection. The existing approach based on V-Disparity image can detect flat ground successfully but have difficulty in detecting non-flat ground. In this paper, we discuss the representation of non-flat ground in V-Disparity image, based on which we propose a method to detect non-flat ground using V-Disparity image.


Across the Digital Divide: A Cross-Country Multi-Technology Analysis of the Determinants of IT Penetration

This paper studies the country-level digital divide across successive generations of IT, providing detailed insights into the magnitude and changing nature of the divide. We examine a panel of 40 countries from 1985-2001, based on data from three distinct generations of IT: mainframes, personal computers, and the Internet. Using two measures of IT penetration, we conduct an empirical investigation of socio-economic factors driving the digital divide. We find that IT penetration is positively associated with national income for all three technology generations, and the association between penetration and income is stronger for countries with higher levels of IT penetration. We also examine other demographic and economic factors, going beyond income, and find significant differences in the nature of their effects across countries at different stages of IT adoption. Importantly, factors that previously may have been expanding the divide with earlier technologies are narrowing the gap as the Internet becomes the defining technology of the Information Age.


A Comprehensive Comparison between Neural Style Transfer and Universal Style Transfer

Style transfer aims to transfer arbitrary visual styles to content images. We explore algorithms adapted from two papers that try to solve the problem of style transfer while generalizing on unseen styles or compromised visual quality. Majority of the improvements made focus on optimizing the algorithm for real-time style transfer while adapting to new styles with considerably less resources and constraints. We compare these strategies and compare how they measure up to produce visually appealing images. We explore two approaches to style transfer: neural style transfer with improvements and universal style transfer. We also make a comparison between the different images produced and how they can be qualitatively measured.


NGMN View on 5G Architecture

The fifth generation of mobile technology (5G) will address the socio-economic demands and business contexts of 2020 and beyond. Leading operators from around the globe have defined their vision for 5G, considering customer and business contexts as well as potential technologies and migration issues in an initiative set up by the NGMN Alliance. While their concrete vision is described in the NGMN 5G whitepaper, this paper describes the key points, such as 5G design principles, 5G components, network slicing, 5G radio access technology and 5G interfacing options that have implications to the 5G architecture design.


Highly deformable 3-D printed soft robot generating inching and crawling locomotions with variable friction legs

Soft and continuum robots have the useful capability of adopting intricate postures and conforming to complex shapes. Furthermore, structures built from soft materials propagate mechanical energy from one part of the body to another, depending on its body shape, boundary condition, stiffness distribution, and so on. This makes the robots capable of producing a large number of force profiles to achieve useful behaviors and functionalities, even using a small number of actuators. Exploiting the soft mechanical property also enables to generate functional frictional forces, which is a key issue in controlling robot locomotion. In this paper, a highly deformable 3-D printed soft robot (PS robot) is presented, which is capable of generating complex, robust gaits on different inclines using a novel variable friction leg design. This design changes the frictional force depending on the robot posture and shape to facilitate robot locomotion. Shape memory alloy (SMA) coils are embedded into the robot in such a way that they act both as structural elements and actuators. This is the first soft robot platform produced by 3-D printing making fabrication simple and fast.


NAIS-Net: Stable Deep Networks from Non-Autonomous Differential Equations

This paper introduces Non-Autonomous Input-Output Stable Network (NAIS-Net), a very deep architecture where each stacked processing block is derived from a time-invariant non-autonomous dynamical system. Non-autonomy is implemented by skip connections from the block input to each of the unrolled processing stages and allows stability to be enforced so that blocks can be unrolled adaptively to a pattern-dependent processing depth. NAIS-Net induces non-trivial, Lipschitz input-output maps, even for an infinite unroll length. We prove that the network is globally asymptotically stable so that for every initial condition there is exactly one input-dependent equilibrium assuming tanh units, and multiple stable equilibria for ReL units. An efficient implementation that enforces the stability under derived conditions for both fully-connected and convolutional layers is also presented. Experimental results show how NAIS-Net exhibits stability in practice, yielding a significant reduction in generalization gap compared to ResNets.


Digital dentistry: an overview of recent developments for CAD/CAM generated restorations

As in many other industries, production stages are increasingly becoming automated in dental technology. As the price of dental laboratory work has become a major factor in treatment planning and therapy, automation could enable more competitive production in high-wage areas like Western Europe and the USA. Advances in computer technology now enable cost-effective production of individual pieces. Dental restorations produced with computer assistance have become more common in recent years. Most dental companies have access to CAD/CAM procedures, either in the dental practice, the dental laboratory or in the form of production centres. The many benefits associated with CAD/CAM generated dental restorations include: the access to new, almost defect-free, industrially prefabricated and controlled materials; an increase in quality and reproducibility and also data storage commensurate with a standardised chain of production; an improvement in precision and planning, as well as an increase in efficiency. As a result of continual developments in computer hardware and software, new methods of production and new treatment concepts are to be expected, which will enable an additional reduction in costs. Dentists, who will be confronted with these techniques in the future, require certain basic knowledge if they are to benefit from these new procedures. This article gives an overview of CAD/CAM-technologies and systems available for dentistry today.


Cognitive perspectives on SLA The Associative-Cognitive CREED *

This paper outlines current cognitive perspectives on second language acquisition (SLA). The Associative-Cognitive CREED holds that SLA is governed by the same principles of associative and cognitive learning that underpin the rest of human knowledge. The major principles of the framework are that SLA is Construction-based, Rational, Exemplar-driven, Emergent, and Dialectic. Language learning involves the acquisition of constructions that map linguistic form and function. Competence and performance both emerge from the dynamic system that is the frequency-tuned conspiracy of memorized exemplars of use of these constructions, with competence being the integrated sum of prior usage and performance being its dynamic contextualized activation. The system is rational in that it optimally reflects prior first language (L1) usage. The L1 tunes the ways in which learners attend to language. Learned-attention transfers to L2 and it is this L1 entrenchment that limits the endstate of usage-based SLA. But these limitations can be overcome by recruiting learner consciousness, putting them into a dialectic tension between the conflicting forces of their current stable states of interlanguage and the evidence of explicit form-focused feedback, either linguistic, pragmatic, or metalinguistic, that allows socially scaffolded development. The paper directs the reader to recent review articles in these key areas and weighs the implications of this framework.


Improving Text Classification by Shrinkage in a Hierarchy of Classes

When documents are organized in a large number of topic categories, the categories are often arranged in a hierarchy. The U.S. patent database and Yahoo are two examples. This paper shows that the accuracy of a naive Bayes text classi er can be signi cantly improved by taking advantage of a hierarchy of classes. We adopt an established statistical technique called shrinkage that smoothes parameter estimates of a data-sparse child with its parent in order to obtain more robust parameter estimates. The approach is also employed in deleted interpolation, a technique for smoothing n-grams in language modeling for speech recognition. Our method scales well to large data sets, with numerous categories in large hierarchies. Experimental results on three real-world data sets from UseNet, Yahoo, and corporate web pages show improved performance, with a reduction in error up to 29% over the traditional at classi er.


Clinicopathological Findings of Chronic Rejection in a Face Grafted Patient.

BACKGROUND
Skin chronic rejection (CR) in vascularized composite allotransplantation has not been included in the Banff classification yet. We report a face-transplant patient who developed cutaneous clinicopathologic changes suggestive of CR.

METHODS
The recipient was a 27-year-old man with severe disfigurement of the lower face due to a pyrotechnic explosion. He received a facial allograft, including mandible, cheeks, lips, and chin, in November 2009. Immunosuppression included antithymocyte globulins and bone-marrow infusion then steroids, tacrolimus, and mycophenolate mofetil.

RESULTS
During the first posttransplant year the acute rejection episodes were characterized by reversible oedema and erythema of the graft. Subsequently, the patient developed primary asymptomatic Epstein-Barr virus (EBV) infection, followed by EBV+ B-cell lymphoma and hepatic EBV-associated posttransplant smooth muscle tumors; therefore, the immunosuppressive treatment was greatly reduced. Since the second posttransplant year, the allografted facial skin became progressively sclerotic and presented pigmented macules on a background of hypopigmentation and teleangiectasias, resulting in a poikilodermatous aspect. Skin biopsies showed epidermal atrophy, basal cell vacuolization, and diffuse dermal sclerosis in the absence of significant dermal cell infiltration. The dermal capillaries showed thickened walls and narrowed lumina, whereas the large vessels did not show significant alterations. Neither donor-specific antibodies nor vascular Cd4 deposits were detected.A dysfunction of the graft functions occurred. It was evidenced by a decrease in mouth opening and modification of some phonemes although lip closure was still possible allowing food intake.

CONCLUSIONS
This is the first report suggestive of CR in a face allotransplantation after immunosuppression minimization.


Multiparty Computation from Somewhat Homomorphic Encryption

We propose a general multiparty computation protocol secure against an active adversary corrupting up to n−1 of the n players. The protocol may be used to compute securely arithmetic circuits over any finite field Fpk . Our protocol consists of a preprocessing phase that is both independent of the function to be computed and of the inputs, and a much more efficient online phase where the actual computation takes place. The online phase is unconditionally secure and has total computational (and communication) complexity linear in n, the number of players, where earlier work was quadratic in n. Moreover, the work done by each player is only a small constant factor larger than what one would need to compute the circuit in the clear. We show this is optimal for computation in large fields. In practice, for 3 players, a secure 64-bit multiplication can be done in 0.05 ms. Our preprocessing is based on a somewhat homomorphic cryptosystem. We extend a scheme by Brakerski et al., so that we can perform distributed decryption and handle many values in parallel in one ciphertext. The computational complexity of our preprocessing phase is dominated by the public-key operations, we need O(n/s) operations per secure multiplication where s is a parameter that increases with the security parameter of the cryptosystem. Earlier work in this model needed Ω(n) operations. In practice, the preprocessing prepares a secure 64-bit multiplication for 3 players in about 13 ms.


How To Exchange Secrets with Oblivious Transfer

As this paper puts forward the notion of “Oblivious Transfers” and is a well-known and frequently cited paper, I felt I should typeset the manuscript, and here is the result. While typesetting, I tried to stick to the original manuscript as much as possible. However, there were some cases, such as a few typos or punctuation marks, which were changed. As in many papers on cryptography, Alice and Bob play the role of participants of the given cryptographic protocols. For the sake of readability, Alice’s and Bob’s messages were printed in red and blue ink, respectively. This work was carefully proofread by my colleague Y. Sobhdel (sobhdel@ce.sharif.edu). Thanks also to H. M. Moghaddam for mentioning a minor mistake in an earlier version. That said, I will be thankful if you inform me of any possible mistakes.


Proving the TLS Handshake Secure (As It Is)

The TLS Internet Standard features a mixed bag of cryptographic algorithms and constructions, letting clients and servers negotiate their use for each run of the handshake. Although many ciphersuites are now well-understood in isolation, their composition remains problematic, and yet it is critical to obtain practical security guarantees for TLS. We experimentally confirm that all mainstream implementations of TLS share key materials between different algorithms, some of them of dubious strength. We outline attacks in their handling of resumption and renegotiation, stressing the need to model multiple related instances of the handshake. We study the provable security of the TLS handshake, as it is implemented and deployed. To capture the details of the standard and its main extensions, we rely on miTLS, a verified reference implementation of the protocol. miTLS inter-operates with mainstream browsers and servers for many protocol versions, configurations, and ciphersuites; and it provides application-level, provable security for some. We propose new agile security definitions and assumptions for the signatures, key encapsulation mechanisms (KEM), and key derivation algorithms used by the TLS handshake. By necessity, our definitions are stronger than those expected with simple modern protocols. To validate our model of key encapsulation, we prove that both RSA and Diffie-Hellman ciphersuites satisfy our definition for the KEM. In particular, we formalize the use of PKCS#1v1.5 encryption in TLS, including recommended countermeasures against Bleichenbacher attacks, and build a 3,000-line EasyCrypt proof of the security of the resulting master secret KEM against replayable chosen-ciphertext attacks under the assumption that ciphertexts are hard to re-randomize. Based on our new agile definitions, we construct a modular proof of security for the miTLS reference implementation of the handshake, including ciphersuite negotiation, key exchange, renegotiation, and resumption, treated as a detailed 3,600-line executable model. We present our main definitions, constructions, and proofs for an abstract model of the protocol, featuring series of related runs of the handshake with different ciphersuites. We also describe its refinement to account for the whole reference implementation, based on automated verification tools.


Founding Cryptography on Oblivious Transfer - Efficiently

We present a simple and efficient compiler for transforming secure multi-party computation (MPC) protocols that enjoy security only with an honest majority into MPC protocols that guarantee security with no honest majority, in the oblivious-transfer (OT) hybrid model. Our technique works by combining a secure protocol in the honest majority setting with a protocol achieving only security against semi-honest parties in the setting of no honest majority. Applying our compiler to variants of protocols from the literature, we get several applications for secure two-party computation and for MPC with no honest majority. These include: • Constant-rate two-party computation in the OT-hybrid model. We obtain a statistically UC-secure two-party protocol in the OT-hybrid model that can evaluate a general circuit C of size s and depth d with a total communication complexity of O(s)+ poly(k, d, log s) and O(d) rounds. The above result generalizes to a constant number of parties. • Extending OTs in the malicious model. We obtain a computationally efficient protocol for generating many string OTs from few string OTs with only a constant amortized communication overhead compared to the total length of the string OTs. • Black-box constructions for constant-round MPC with no honest majority. We obtain general computationally UC-secure MPC protocols in the OT-hybrid model that use only a constant number of rounds, and only make a black-box access to a pseudorandom generator. This gives the first constant-round protocols for three or more parties that only make a black-box use of cryptographic primitives (and avoid expensive zero-knowledge proofs).


Better Key Sizes (and Attacks) for LWE-Based Encryption

We analyze the concrete security and key sizes of theoretically sound lattice-based encryption schemes based on the “learning with errors” (LWE) problem. Our main contributions are: (1) a new lattice attack on LWE that combines basis reduction with an enumeration algorithm admitting a time/success tradeoff, which performs better than the simple distinguishing attack considered in prior analyses; (2) concrete parameters and security estimates for an LWE-based cryptosystem that is more compact and efficient than the well-known schemes from the literature. Our new key sizes are up to 10 times smaller than prior examples, while providing even stronger concrete security levels.


Time-series detection of perspiration as a liveness test in fingerprint devices

Fingerprint scanners may be susceptible to spoofing using artificial materials, or in the worst case, dismembered fingers. An anti-spoofing method based on liveness detection has been developed for use in fingerprint scanners. This method quantifies a specific temporal perspiration pattern present in fingerprints acquired from live claimants. The enhanced perspiration detection algorithm presented here improves our previous work by including other fingerprint scanner technologies; using a larger, more diverse data set; and a shorter time window. Several classification methods were tested in order to separate live and spoof fingerprint images. The dataset included fingerprint images from 33 live subjects, 33 spoofs created with dental material and Play-Doh, and fourteen cadaver fingers. Each method had a different performance with respect to each scanner and time window. However, all the classifiers achieved approximately 90% classification rate for all scanners, using the reduced time window and the more comprehensive training and test sets.


Applying WinWin to Quality Requirements: A Case Study

This paper describes the application of the WinWin paradigm to identify and resolve conflicts in a series of real-client, student-developer digital library projects. The paper is based on a case study of the statistical analysis of 15 projects and an in-depth analysis of one representative project. These analyses focus on the conflict resolution process, stakeholders' roles and their relationships to quality artifacts, and tool effectiveness. We show that stakeholders tend to accept satisfactory rather than optimal resolutions. Users and customers are more proactive in stating win conditions, whereas developers are more active in working toward resolutions. Further, we suggest that knowledge-based automated aids have potential to significantly enhance process effectiveness and efficiency. Finally, we conclude that such processes and tools have theoretical and practical implications in the quest for better software requirements elicitation.


Value Sensitive Design and Information Systems

Value Sensitive Design is a theoretically grounded approach to the design of technology that accounts for human values in a principled and comprehensive manner throughout the design process. It employs an integrative and iterative tripartite methodology, consisting of conceptual, empirical, and technical investigations. We explicate Value Sensitive Design by drawing on three case studies. The first study concerns information and control of web browser cookies, implicating the value of informed consent. The second study concerns using high-definition plasma displays in an office environment to provide a window to the outside world, implicating the values of physical and psychological well-being and privacy in public spaces. The third study concerns an integrated land use, transportation, and environmental simulation system to support public deliberation and debate on major land use and transportation decisions, implicating the values of fairness, accountability, and support for the democratic process, as well as a highly diverse range of values that might be held by different stakeholders, such as environmental sustainability, opportunities for business expansion, or walkable neighborhoods. We conclude with direct and practical suggestions for how to engage in Value Sensitive Design.


Linear dimensionality reduction: survey, insights, and generalizations

Linear dimensionality reduction methods are a cornerstone of analyzing high dimensional data, due to their simple geometric interpretations and typically attractive computational properties. These methods capture many data features of interest, such as covariance, dynamical structure, correlation between data sets, input-output relationships, and margin between data classes. Methods have been developed with a variety of names and motivations in many fields, and perhaps as a result the connections between all these methods have not been highlighted. Here we survey methods from this disparate literature as optimization programs over matrix manifolds. We discuss principal component analysis, factor analysis, linear multidimensional scaling, Fisher’s linear discriminant analysis, canonical correlations analysis, maximum autocorrelation factors, slow feature analysis, sufficient dimensionality reduction, undercomplete independent component analysis, linear regression, distance metric learning, and more. This optimization framework gives insight to some rarely discussed shortcomings of well-known methods, such as the suboptimality of certain eigenvector solutions. Modern techniques for optimization over matrix manifolds enable a generic linear dimensionality reduction solver, which accepts as input data and an objective to be optimized, and returns, as output, an optimal low-dimensional projection of the data. This simple optimization framework further allows straightforward generalizations and novel variants of classical methods, which we demonstrate here by creating an orthogonal-projection canonical correlations analysis. More broadly, this survey and generic solver suggest that linear dimensionality reduction can move toward becoming a blackbox, objective-agnostic numerical technology.


The complex dielectric constant of pure and sea water from microwave satellite observations

We provide a new fit for the microwave complex dielectric constant of water in the salinity range between 0-40 ppt using two Debye relaxation wavelengths. For pure water, the fit is based on laboratory measurements in the temperature range between -20/spl deg/C and +40/spl deg/C including supercooled water and for frequencies up to 500 GHz. For sea water, our fit is valid for temperatures between -2/spl deg/C and +29/spl deg/C and for frequencies up to at least 90 GHz. At low frequencies, our new model is a modified version of the Klein-Swift model. We compare the results of the new fit with various other models and provide a validation using an extensive analysis of brightness temperatures from the Special Sensor Microwave Imager.


Unmanned surface vehicles: An overview of developments and challenges


Concept-Based Information Retrieval Using Explicit Semantic Analysis

Information retrieval systems traditionally rely on textual keywords to index and retrieve documents. Keyword-based retrieval may return inaccurate and incomplete results when different keywords are used to describe the same concept in the documents and in the queries. Furthermore, the relationship between these related keywords may be semantic rather than syntactic, and capturing it thus requires access to comprehensive human world knowledge. Concept-based retrieval methods have attempted to tackle these difficulties by using manually built thesauri, by relying on term cooccurrence data, or by extracting latent word relationships and concepts from a corpus. In this article we introduce a new concept-based retrieval approach based on Explicit Semantic Analysis (ESA), a recently proposed method that augments keyword-based text representation with concept-based features, automatically extracted from massive human knowledge repositories such as Wikipedia. Our approach generates new text features automatically, and we have found that high-quality feature selection becomes crucial in this setting to make the retrieval more focused. However, due to the lack of labeled data, traditional feature selection methods cannot be used, hence we propose new methods that use self-generated labeled training data. The resulting system is evaluated on several TREC datasets, showing superior performance over previous state-of-the-art results.


Measuring and Analyzing Write Amplification Characteristics of Solid State Disks

Write amplification brings endurance challenges to NAND Flash-based solid state disks (SSDs) such as impacts upon their write endurance and lifetime. A large write amplification degrades program/erase cycles (P/Es) of NAND Flashes and reduces the endurance and performance of SSDs. The write amplification problem is mainly triggered by garbage collections, wear-leveling, metadata updates, and mapping table updates. Write amplification is defined as the ratio of data volume written by an SSD controller to data volume written by a host. In this paper, we propose a four-level model of write amplification for SSDs. The four levels considered in our model include the channel level, chip level, die level, and plane level. In light of this model, we design a method of analyzing write amplification of SSDs to trace SSD endurance and performance by incorporating the Ready/Busy (R/B) signal of NAND Flash. Our practical approach aims to measure the value of write amplification for an entire SSD rather than NAND Flashes. To validate our measurement technique and model, we implement a verified SSD (vSSD) system and perform a cross-comparison on a set of SSDs, which are stressed by micro-benchmarks and I/O traces. A new method for SSDs is adopted in our measurements to study the R/B signals of NAND Flashes in an SSD. Experimental results show that our model is accurate and the measurement technique is generally applicable to any SSDs.


Dietary phenolics: chemistry, bioavailability and effects on health.

There is much epidemiological evidence that diets rich in fruit and vegetables can reduce the incidence of non-communicable diseases such as cardiovascular diseases, diabetes, cancer and stroke. These protective effects are attributed, in part, to phenolic secondary metabolites. This review summarizes the chemistry, biosynthesis and occurrence of the compounds involved, namely the C6-C3-C6 flavonoids-anthocyanins, dihydrochalcones, flavan-3-ols, flavanones, flavones, flavonols and isoflavones. It also includes tannins, phenolic acids, hydroxycinnamates and stilbenes and the transformation of plant phenols associated with food processing (for example, production of black tea, roasted coffee and matured wines), these latter often being the major dietary sources. Events that occur following ingestion are discussed, in particular, the deglycosylation, glucuronidation, sulfation and methylation steps that occur at various points during passage through the wall of the small intestine into the circulatory system and subsequent transport to the liver in the portal vein.We also summarise the fate of compounds that are not absorbed in the small intestine, but which pass into the large intestine where they are degraded by the colonic microflora to phenolic acids, which can be absorbed into the circulatory system and subjected to phase II metabolism prior to excretion. Initially, the protective effect of dietary phenolics was thought to be due to their antioxidant properties which resulted in a lowering of the levels of free radicals within the body.However, there is now emerging evidence that themetabolites of dietary phenolics,which appear in the circulatory systemin nmol/L to low mmol/L concentrations, exertmodulatory effects in cells through selective actions on different components of the intracellular signalling cascades vital for cellular functions such as growth, proliferation and apoptosis. In addition, the intracellular concentrations required to affect cell signalling pathways are considerably lower than those required to impact on antioxidant capacity. The mechanisms underlying these processes are discussed.