title: Second-order cone programming

text: Second-order cone programming (SOCP) problems are convex optimization problems in which a linear function is minimized over the intersection of an affine linear manifold with the Cartesian product of second-order (Lorentz) cones. Linear programs, convex quadratic programs and quadratically constrained convex quadratic programs can all be formulated as SOCP problems, as can many other problems that do not fall into these three categories. These latter problems model applications from a broad range of fields from engineering, control and finance to robust optimization and combinatorial optimization. On the other hand semidefinite programming (SDP)—that is the optimization problem over the intersection of an affine set and the cone of positive semidefinite matrices—includes SOCP as a special case. Therefore, SOCP falls between linear (LP) and quadratic (QP) programming and SDP. Like LP, QP and SDP problems, SOCP problems can be solved in polynomial time by interior point methods. The computational effort per iteration required by these methods to solve SOCP problems is greater than that required to solve LP and QP problems but less than that required to solve SDP’s of similar size and structure. Because the set of feasible solutions for an SOCP problem is not polyhedral as it is for LP and QP problems, it is not readily apparent how to develop a simplex or simplex-like method for SOCP. While SOCP problems can be solved as SDP problems, doing so is not advisable both on numerical grounds and computational complexity concerns. For instance, many of the problems presented in the survey paper of Vandenberghe and Boyd [VB96] as examples of SDPs can in fact be formulated as SOCPs and should be solved as such. In §2, 3 below we give SOCP formulations for four of these examples: the convex quadratically constrained quadratic programming (QCQP) problem, problems involving fractional quadratic functions such as those that arise in structural optimization, logarithmic Tchebychev approximation and the


title: Whitening Black-Box Neural Networks

text: Many deployed learned models are black boxes: given input, returns output. Internal information about the model, such as the architecture, optimisation procedure, or training data, is not disclosed explicitly as it might contain proprietary information or make the system more vulnerable. This work shows that such attributes of neural networks can be exposed from a sequence of queries. This has multiple implications. On the one hand, our work exposes the vulnerability of black-box neural networks to different types of attacks – we show that the revealed internal information helps generate more effective adversarial examples against the black box model. On the other hand, this technique can be used for better protection of private content from automatic recognition models using adversarial examples. Our paper suggests that it is actually hard to draw a line between white box and black box models.


title: Development of a superior frontal–intraparietal network for visuo-spatial working memory

text: Working memory capacity increases throughout childhood and adolescence, which is important for the development of a wide range of cognitive abilities, including complex reasoning. The spatial-span task, in which subjects retain information about the order and position of a number of objects, is a sensitive task to measure development of spatial working memory. This review considers results from previous neuroimaging studies investigating the neural correlates of this development. Older children and adolescents, with higher capacity, have been found to have higher brain activity in the intraparietal cortex and in the posterior part of the superior frontal sulcus, during the performance of working memory tasks. The structural maturation of white matter has been investigated by diffusion tensor magnetic resonance imaging (DTI). This has revealed several regions in the frontal lobes in which white matter maturation is correlated with the development of working memory. Among these is a superior fronto-parietal white matter region, located close to the grey matter regions that are implicated in the development of working memory. Furthermore, the degree of white matter maturation is positively correlated with the degree of cortical activation in the frontal and parietal regions. This suggests that during childhood and adolescence, there is development of networks related to specific cognitive functions, such as visuo-spatial working memory. These networks not only consist of cortical areas but also the white matter tracts connecting them. For visuo-spatial working memory, this network could consist of the superior frontal and intraparietal cortex.


title: Nobel Lecture: The Economic Way of Looking at Behavior

text: Your use of the JSTOR archive indicates your acceptance of JSTOR's Terms and Conditions of Use, available at http://www.jstor.org/page/info/about/policies/terms.jsp. JSTOR's Terms and Conditions of Use provides, in part, that unless you have obtained prior permission, you may not download an entire issue of a journal or multiple copies of articles, and you may use content in the JSTOR archive only for your personal, non-commercial use.


title: Foot Step Based Person Identification Using Histogram Similarity and Wavelet Decomposition

text: Research in person identification and authentication has attracted significant attention from the researchers and scientists. This paper presents a biometric user authentication based on a person's foot step. The advantage of this recognition method over other types of biometrics is that it enables unobtrusive user authentication where other types of biometrics are not available. Firstly the ground reaction force data was extracted using force plate to gather ground reaction force for individuals. Later we utilized the discrete wavelet transform to de-noise the experimental data and in the final step, histograms were used to identify different person's foot step. The experimental results show improvements in identification accuracies compared to previously reported work.


title: Pharmaceutical cold chain management: Platform based on a distributed ledger

text: In the process of distributing pharmaceutical products multiple stages are involved until products are delivered to patient. A reliable way for validating and verifying that products had been maintained within a licensed range is required. The paper presents a solution for pharmaceutical cold chain management using distributed ledger technologies. An application framework is proposed for shipment tracking which will deliver information to all stakeholders during the distribution phase of pharmaceutical products. The solution is based on Hyperledger Sawtooth distributed ledger framework, which has been extended with a custom transactions family and a sensors gateway for automatically collecting data from temperature tracking devices. The focus of the paper is to describe the data model and how entities of the system communicate.


title: Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures

text: We demonstrate how the framework that is used for creating efficient number-theoretic ID and signature schemes can be transferred into the setting of lattices. This results in constructions of the most efficient to-date identification and signature schemes with security based on the worst-case hardness of problems in ideal lattices. In particular, our ID scheme has communication complexity of around 65, 000 bits and the length of the signatures produced by our signature scheme is about 50, 000 bits. All prior lattice-based identification schemes required on the order of millions of bits to be transferred, while all previous lattice-based signature schemes were either stateful, too inefficient, or produced signatures whose lengths were also on the order of millions of bits. The security of our identification scheme is based on the hardness of finding the approximate shortest vector to within a factor of Õ(n) in the standard model, while the security of the signature scheme is based on the same assumption in the random oracle model. Our protocols are very efficient, with all operations requiring Õ(n) time. We also show that the technique for constructing our lattice-based schemes can be used to improve certain number-theoretic schemes. In particular, we are able to shorten the length of the signatures that are produced by Girault’s factoring-based digital signature scheme ([10,11,31]).


title: Arabic Optical Character Recognition Software : A Review 1

text: This paper provides a thorough evaluation of a set of six important Arabic OCR systems available in the market; namely: Abbyy FineReader, Leadtools, Readiris, Sakhr, Tesseract and NovoVerus. We test the OCR systems using a randomly selected images from the well known Arabic Printed Text Image database (250 images from the APTI database) and using a set of 8 images from an Arabic book. The APTI database contains 45.313.600 of both decomposable and non-decomposable word images. In the evaluation, we conduct two tests. The first test is based on usual metrics used in the literature. In the second test, we provide a novel measure for Arabic language, which can be used for other non-Latin languages.


title: Synthesizing tests for detecting atomicity violations

text: Using thread-safe libraries can help programmers avoid the complexities of multithreading. However, designing libraries that guarantee thread-safety can be challenging. Detecting and eliminating atomicity violations when methods in the libraries are invoked concurrently is vital in building reliable client applications that use the libraries. While there are dynamic analyses to detect atomicity violations, these techniques are critically dependent on effective multithreaded tests. Unfortunately, designing such tests is non-trivial. In this paper, we design a novel and scalable approach for synthesizing multithreaded tests that help detect atomicity violations. The input to the approach is the implementation of the library and a sequential seed testsuite that invokes every method in the library with random parameters. We analyze the execution of the sequential tests, generate variable lock dependencies and construct a set of three accesses which when interleaved suitably in a multithreaded execution can cause an atomicity violation. Subsequently, we identify pairs of method invocations that correspond to these accesses and invoke them concurrently from distinct threads with appropriate objects to help expose atomicity violations. We have incorporated these ideas in our tool, named Intruder, and applied it on multiple open-source Java multithreaded libraries. Intruder is able to synthesize 40 multithreaded tests across nine classes in less than two minutes to detect 79 harmful atomicity violations, including previously unknown violations in thread-safe classes. We also demonstrate the effectiveness of Intruder by comparing the results with other approaches designed for synthesizing multithreaded tests.


title: Parallel Processing of Dynamic Continuous Queries over Streaming Data Flows

text: More and more real-time applications need to handle dynamic continuous queries over streaming data of high density. Conventional data and query indexing approaches generally do not apply for excessive costs in either maintenance or space. Aiming at these problems, this study first proposes a new indexing structure by fusing an adaptive cell and KDB-tree, namely CKDB-tree. A cell-tree indexing approach has been developed on the basis of the CKDB-tree that supports dynamic continuous queries. The approach significantly reduces the space costs and scales well with the increasing data size. Towards providing a scalable solution to filtering massive steaming data, this study has explored the feasibility to utilize the contemporary general-purpose computing on the graphics processing unit (GPGPU). The CKDB-tree-based approach has been extended to operate on both the CPU (host) and the GPU (device). The GPGPU-aided approach performs query indexing on the host while perform streaming data filtering on the device in a massively parallel manner. The two heterogeneous tasks execute in parallel and the latency of streaming data transfer between the host and the device is hidden. The experimental results indicate that (1) CKDB-tree can reduce the space cost comparing to the cell-based indexing structure by 60 percent on average, (2) the approach upon the CKDB-tree outperforms the traditional counterparts upon the KDB-tree by 66, 75 and 79 percent in average for uniform, skewed and hyper-skewed data in terms of update costs, and (3) the GPGPU-aided approach greatly improves the approach upon the CKDB-tree with the support of only a single Kepler GPU, and it provides real-time filtering of streaming data with 2.5M data tuples per second. The massively parallel computing technology exhibits great potentials in streaming data monitoring.


title: (DE)$^2$CO: Deep Depth Colorization

text: The ability to classify objects is fundamental for robots. Besides knowledge about their visual appearance, captured by the RGB channel, robots heavily need also depth information to make sense of the world. While the use of deep networks on RGB robot images has benefited from the plethora of results obtained on databases like ImageNet, using convnets on depth images requires mapping them into three-dimensional channels. This transfer learning procedure makes them processable by pretrained deep architectures. Current mappings are based on heuristic assumptions over preprocessing steps and on what depth properties should be most preserved, resulting often in cumbersome data visualizations, and in suboptimal performance in terms of generality and recognition results. Here, we take an alternative route and we attempt instead to learn an optimal colorization mapping for any given pretrained architecture, using as training data a reference RGB-D database. We propose a deep network architecture, exploiting the residual paradigm, that learns how to map depth data to three channel images. A qualitative analysis of the images obtained with this approach clearly indicates that learning the optimal mapping preserves the richness of depth information better than current hand-crafted approaches. Experiments on the Washington, JHUIT-50 and BigBIRD public benchmark databases, using CaffeNet, VGG-16, GoogleNet, and ResNet50 clearly showcase the power of our approach, with gains in performance of up to 16% compared to state of the art competitors on the depth channel only, leading to top performances when dealing with RGB-D data.


title: GEOSTATISTICS : PAST , PRESENT , AND FUTURE

text: Geostatistical analyses were first developed in the 1950's as a result of interest in areal or block averages for ore reserves in the mining industry. Today, variogram estimation and spatial prediction (kriging) span all sciences where data exhibit spatial correlation. Theoretical properties of the spatial process are addressed under the distribution-free and likelihood-based perspectives. Strengths and weaknesses of these two dominant methodologies for modeling spatial correlation and predicting responses at unsampled sites and areal units are explored. Examples of hot spot detection and areal prediction show the flexibility of the Bayesian paradigm. Current bottlenecks and future directions in the field of geostatistics are discussed.


title: iPinYou Global RTB Bidding Algorithm Competition Dataset

text: RTB (Real Time Bidding) is one of the most exciting developments in computational advertising in recent years. It drives transparency and efficiency in the display advertising ecosystem and facilitates the healthy growth of the display advertising industry. It enables advertisers to deliver the right message to the right person at the right time, publishers to better monetize their content by leveraging their website audience, and consumers to view relevant information through personalized ads. However, researchers in computational advertising area have been suffering from lack of publicly available datasets. iPinYou organizes a three-season global RTB algorithm competition in 2013. For each season, there is offline stage and online stage. On the offline stage, iPinYou releases a dataset for model training and reserves a dataset for testing. The dataset includes logs of ad biddings, impressions, clicks, and final conversions. After the whole competition ends, iPinYou organizes and releases all these three datasets for public use. These datasets can support experiments of some important research problems such as bid optimization and CTR estimation. To the best of our knowledge, this is the first publicly available dataset on RTB display advertising. In this paper, we give descriptions of these datasets to further boost the interests of computational advertising research community using this dataset.


title: Towards Extracting Faithful and Descriptive Representations of Latent Variable Models

text: Methods that use latent representations of data, such as matrix and tensor factorization or deep neural methods, are becoming increasingly popular for applications such as knowledge base population and recommendation systems. These approaches have been shown to be very robust and scalable but, in contrast to more symbolic approaches, lack interpretability. This makes debugging such models difficult, and might result in users not trusting the predictions of such systems. To overcome this issue we propose to extract an interpretable proxy model from a predictive latent variable model. We use a socalled pedagogical method, where we query our predictive model to obtain observations needed for learning a descriptive model. We describe two families of (presumably more) descriptive models, simple logic rules and Bayesian networks, and show how members of these families provide descriptive representations of matrix factorization models. Preliminary experiments on knowledge extraction from text indicate that even though Bayesian networks may be more faithful to a matrix factorization model than the logic rules, the latter are possibly more useful for interpretation and debugging.


title: A design of an ICN architecture within the framework of SDN

text: The core design principle of Information-Centric Networking (ICN) is in the name based routing that enables users to ask for a data object by its name and makes the network deliver it to users from a nearby cache if available. Software-Defined Networking (SDN) lowers the cost and complexity of network management by decoupling architecture from infrastructure, which promises the continuous evolution of the network architecture in a flexible manner. The synergy between ICN supporting efficient data dissemination as the norm and SDN providing flexible management framework enables the combination to be a fully controllable framework for efficient data dissemination. In this paper, we propose a design of an ICN architecture within the framework of SDN.


title: The Tri-Wheel: A novel wheel-leg mobility concept

text: The Tri-Wheel is a novel wheel-leg locomotion concept inspired by work with first responders. Through its two modes of operation-Driving Mode and Tumbling Mode- this mechanism is able to both drive quickly on smooth surfaces at roughly 1.7 times desired speed and climb objects as tall as 67% of the diameter of the mechanism. The unique gearing configuration that facilitates these dual capabilities is described, and testing quantifies that this nonprecision gearing system is roughly 81% efficient in a worst-case scenario of loading. This work introduces the Tri-Wheel concept and provides preliminary testing to validate its predicted operating characteristics.


title: A multistage dataflow implementation of a Deep Convolutional Neural Network based on FPGA for high-speed object recognition

text: Deep Neural Networks (DNNs) have progressed significantly in recent years. Novel DNN methods allow tasks such as image and speech recognition to be conducted easily and efficiently, compared with previous methods that needed to search for valid feature values or algorithms. However, DNN computations typically consume a significant amount of time and high-performance computing resources. To facilitate high-speed object recognition, this article introduces a Deep Convolutional Neural Network (DCNN) accelerator based on a field-programmable gate array (FPGA). Our hardware takes full advantage of the characteristics of convolutional calculation; this allowed us to implement all DCNN layers, from image input to classification, in a single chip. In particular, the dateflow from input to classification is uninterrupted and paralleled. As a result, our implementation achieved a speed of 409.62 giga-operations per second (GOPS), which is approximately twice as fast as the latest reported result. Furthermore, we used the same architecture to implement a Recurrent Convolutional Neural Network (RCNN), which can, in theory, provide better recognition accuracy.


title: Hierarchical data-driven vehicle dispatch and ride-sharing

text: Modern transportation system suffers from increasing passenger demand, limited vehicle supply and inefficient mobility service. Towards building an intelligent transportation system to address these issues, we propose a hierarchical framework to implement strategies that is capable of allocating vehicles to serve passengers in different locations based on limited supply. In the higher hierarchy, we optimize idle mileage induced by rebalancing vehicles across regions using receding horizon control towards current and predicted future requests. In addition, we design a dispatch strategy that is robust against passenger demand and vehicle mobility pattern uncertainties. In the lower hierarchy, within each region, pick-up and drop-off schedules for real-time requests are obtained for each vehicle by solving mixed-integer linear programs (MILP). The objective of the MILP is to minimize total mileage delay due to ride-sharing while serving as many requests as possible. We illustrate the validity of our framework via numerical simulations on taxi trip data from New York City.


title: Brain tumor segmentation from MRI data sets using region growing approach

text: Brain segmentation is an important part of medical image processing. Most commonly, it aims at locating various lesions and pathologies inside the human brain. In this paper, a new brain segmentation algorithm is proposed. The method is seeded region growing approach which was developed to segment the area of the brain affected by a tumor. The proposed algorithm was described. Results of testing the developed method on real MRI data set are presented and discussed.


title: Eliminative Materialism and the Propositional Attitudes


title: Wearable Ultrasonic Sensor Using Double-Layer PVDF Films for Monitoring Tissue Motion

text: Monitoring of the physical properties of the tissues provides valuable information for the clinical diagnosis and evaluation. However, one of the challenges of an ultrasonic method for continuous monitoring of a tissue motion using a conventional clinical ultrasonic image system could be motion artifacts due to the weight and size of its handheld ultrasonic probe employed. A wearable ultrasonic sensor, made of a polyvinylidene fluoride (PVDF) polymer piezoelectric film, may be able to reduce the motion artifacts due to its lightweight and flexible properties. However, the PVDF ultrasonic sensor has a relatively weak transmitting acoustic signal strength which causes poor signal-to-noise ratio of the ultrasonic signal acquired in pulse-echo measurements, particularly for the signal reflected from deeper tissue. This paper investigated an improvement of the ultrasonic performance of the WUS using double-layer PVDF films. The sensor was constructed using two 52-μm thick PVDF films. The developed double-layer WUS showed the 1.7 times greater ultrasonic signal amplitude compared to the WUS made of a single-layer PVDF having the equivalent PVDF film thickness. Thus, the developed double-layer PVDF WUS improved the depth of the ultrasonic penetration into the tissue. The developed WUS successfully demonstrated to monitor the contractions of biceps muscles in an upper arm. In addition, a cardiac tissue motion was clearly observed in the M-mode measurement corresponding with the cardiac cycles obtained from the ECG measurement.


title: Cerebral bases of subliminal speech priming

text: While the neural correlates of unconscious perception and subliminal priming have been largely studied for visual stimuli, little is known about their counterparts in the auditory modality. Here we used a subliminal speech priming method in combination with fMRI to investigate which regions of the cerebral network for language can respond in the absence of awareness. Participants performed a lexical decision task on target items preceded by subliminal primes, which were either phonetically identical or different from the target. Moreover, the prime and target could be spoken by the same speaker or by two different speakers. Word repetition reduced the activity in the insula and in the left superior temporal gyrus. Although the priming effect on reaction times was independent of voice manipulation, neural repetition suppression was modulated by speaker change in the superior temporal gyrus while the insula showed voice-independent priming. These results provide neuroimaging evidence of subliminal priming for spoken words and inform us on the first, unconscious stages of speech perception.


title: Optimised KD-trees for fast image descriptor matching

text: In this paper, we look at improving the KD-tree for a specific usage: indexing a large number of SIFT and other types of image descriptors. We have extended priority search, to priority search among multiple trees. By creating multiple KD-trees from the same data set and simultaneously searching among these trees, we have improved the KD-treepsilas search performance significantly.We have also exploited the structure in SIFT descriptors (or structure in any data set) to reduce the time spent in backtracking. By using Principal Component Analysis to align the principal axes of the data with the coordinate axes, we have further increased the KD-treepsilas search performance.


title: Computer Vision - Algorithms and Applications

text: As known, adventure and experience about lesson, entertainment, and knowledge can be gained by only reading a book. Even it is not directly done, you can know more about this life, about the world. We offer you this proper and easy way to gain those all. We offer many book collections from fictions to science at all. One of them is this computer vision algorithms and applications that can be your partner.


title: The Case for VM-Based Cloudlets in Mobile Computing

text: Mobile computing continuously evolve through the sustained effort of many researchers. It seamlessly augments users' cognitive abilities via compute-intensive capabilities such as speech recognition, natural language processing, etc. By thus empowering mobile users, we could transform many areas of human activity. This article discusses the technical obstacles to these transformations and proposes a new architecture for overcoming them. In this architecture, a mobile user exploits virtual machine (VM) technology to rapidly instantiate customized service software on a nearby cloudlet and then uses that service over a wireless LAN; the mobile device typically functions as a thin client with respect to the service. A cloudlet is a trusted, resource-rich computer or cluster of computers that's well-connected to the Internet and available for use by nearby mobile devices. Our strategy of leveraging transiently customized proximate infrastructure as a mobile device moves with its user through the physical world is called cloudlet-based, resource-rich, mobile computing. Crisp interactive response, which is essential for seamless augmentation of human cognition, is easily achieved in this architecture because of the cloudlet's physical proximity and one-hop network latency. Using a cloudlet also simplifies the challenge of meeting the peak bandwidth demand of multiple users interactively generating and receiving media such as high-definition video and high-resolution images. Rapid customization of infrastructure for diverse applications emerges as a critical requirement, and our results from a proof-of-concept prototype suggest that VM technology can indeed help meet this requirement.


title: Why do we trust new technology? A study of initial trust formation with organizational information systems

text: Recent trust research in the information systems (IS) field has described trust as a primary predictor of technology usage and a fundamental construct for understanding user perceptions of technology. Initial trust formation is particularly relevant in an IS context, as users must overcome perceptions of risk and uncertainty before using a novel technology. With initial trust in a more complex, organizational information system, there are a number of external determinants, trusting bases, that may explain trust formation and provide organizations with the needed levers to form or change individuals’ initial trust in technology. In this study, a research model of initial trust formation is developed and includes trusting bases, trusting beliefs, trusting attitude and subjective norm, and trusting intentions. Eight trusting base factors are assessed including personality, cognitive, calculative, and both technology and organizational factors of the institutional base. The model is empirically tested with 443 subjects in the context of initial trust in a national identity system (NID). The proposed model was supported and the results indicate that subjective norm and the cognitive–reputation, calculative, and organizational situational normality base factors significantly influence initial trusting beliefs and other downstream trust constructs. Factors from some of the more commonly investigated bases, personality and technology institutional, did not significantly affect trusting beliefs. The findings have strategic implications for agencies implementing e-government systems and organizational information systems in general. Published by Elsevier B.V.


title: A Vector Space for Distributional Semantics for Entailment

text: Distributional semantics creates vectorspace representations that capture many forms of semantic similarity, but their relation to semantic entailment has been less clear. We propose a vector-space model which provides a formal foundation for a distributional semantics of entailment. Using a mean-field approximation, we develop approximate inference procedures and entailment operators over vectors of probabilities of features being known (versus unknown). We use this framework to reinterpret an existing distributionalsemantic model (Word2Vec) as approximating an entailment-based model of the distributions of words in contexts, thereby predicting lexical entailment relations. In both unsupervised and semi-supervised experiments on hyponymy detection, we get substantial improvements over previous results.


title: Detecting Duplicate Posts in Programming QA Communities via Latent Semantics and Association Rules

text: Programming community-based question-answering (PCQA) websites such as Stack Overflow enable programmers to find working solutions to their questions. Despite detailed posting guidelines, duplicate questions that have been answered are frequently created. To tackle this problem, Stack Overflow provides a mechanism for reputable users to manually mark duplicate questions. This is a laborious effort, and leads to many duplicate questions remain undetected. Existing duplicate detection methodologies from traditional community based question-answering (CQA) websites are difficult to be adopted directly to PCQA, as PCQA posts often contain source code which is linguistically very different from natural languages. In this paper, we propose a methodology designed for the PCQA domain to detect duplicate questions. We model the detection as a classification problem over question pairs. To extract features for question pairs, our methodology leverages continuous word vectors from the deep learning literature, topic model features and phrases pairs that co-occur frequently in duplicate questions mined using machine translation systems. These features capture semantic similarities between questions and produce a strong performance for duplicate detection. Experiments on a range of real-world datasets demonstrate that our method works very well; in some cases over 30% improvement compared to state-of-the-art benchmarks. As a product of one of the proposed features, the association score feature, we have mined a set of associated phrases from duplicate questions on Stack Overflow and open the dataset to the public.


title: The tear trough and lid/cheek junction: anatomy and implications for surgical correction.

text:
BACKGROUND
The tear trough and the lid/cheek junction become more visible with age. These landmarks are adjacent, forming in some patients a continuous indentation or groove below the infraorbital rim. Numerous, often conflicting procedures have been described to improve the appearance of the region. The purpose of this study was to evaluate the anatomy underlying the tear trough and the lid/cheek junction and to evaluate the procedures designed to correct them.

METHODS
Twelve fresh cadaver lower lid and midface dissections were performed (six heads). The orbital regions were dissected in layers, and medical photography was performed.

RESULTS
In the subcutaneous plane, the tear trough and lid/cheek junction overlie the junction of the palpebral and orbital portions of the orbicularis oculi muscle and the cephalic border of the malar fat pad. In the submuscular plane, these landmarks differ. Along the tear trough, the orbicularis muscle is attached directly to the bone. Along the lid/cheek junction, the attachment is ligamentous by means of the orbicularis retaining ligament.

CONCLUSIONS
The tear trough and lid/cheek junction are primarily explained by superficial (subcutaneous) anatomical features. Atrophy of skin and fat is the most likely explanation for age-related visibility of these landmarks. "Descent" of this region with age is unlikely (the structures are fixed to bone). Bulging orbital fat accentuates these landmarks. Interventions must extend significantly below the infraorbital rim. Fat or synthetic filler may be best placed in the intraorbicularis plane (tear trough) and in the suborbicularis plane (lid/cheek junction).


title: A Broadband Dual Circularly Polarized Patch Antenna With Wide Beamwidth

text: A broadband dual circularly polarized patch antenna with wide beamwidth is presented. The patch is excited by four cross slots via a microstrip line with multiple matching segments underneath the ground plane. The four cross slots and the multiple matching segments are optimized simultaneously to obtain the best performance. Measurements show that the antenna has 10-dB return-loss bandwidth of 24%, 10-dB isolation bandwidth of 19%, 3-dB axial-ratio bandwidth of 16%, and beamwidth of 110 °. Moreover, the single feed makes it a good candidate for array design.


title: Age Prediction in Blogs: A Study of Style, Content, and Online Behavior in Pre- and Post-Social Media Generations

text: Research Assistant May 2008 present Currently working on a project to influence power and rifts in unstructured text project in classifying the age of authors as well as identifying opinion and persuasion in blogs (funded by IARPA SCIL) Previously worked on a project maintaining a pipeline for Question Answering System and creating system tools using Natural Language Processing techniques (funded by DARPA GALE). Computer administrator of the NLP group.


title: Twitter sentiment analysis using deep learning methods

text: The social media has Immense and popularity among all the services today. Data from SNS (Social Network Service) can be used for a lot of objectives such as prediction or sentiment analysis. Twitter is a SNS that has a huge data with user posting, with this significant amount of data, it has the potential of research related to text mining and could be subjected to sentiment analysis. But handling such a huge amount of unstructured data is a difficult task, machine learning is needed for handling such huge of data. Deep learning is of the machine learning method that use the deep feed forward neural network with many hidden layers in the term of neural network with the result of the experiment about 75%.


title: Automated vehicle system architecture with performance assessment

text: This paper proposes a reference architecture to increase reliability and robustness of an automated vehicle. The architecture exploits the benefits arising from the in-terdependencies of the system and provides self awareness. Performance Assessment units attached to subsystems quantify the reliability of their operation and return performance values. The Environment Condition Assessment, which is another important novelty of the architecture, informs augmented sensors on current sensing conditions. Utilizing environment conditions and performance values for subsequent centralized integrity checks allow algorithms to adapt to current driving conditions and thereby to increase their robustness. We demonstrate the benefit of the approach with the example of false positive object detection and tracking, where the detection of a ghost object is resolved in centralized performance assessment using a Bayesian network.


title: Using Intermediate Representations to Solve Math Word Problems

text: To solve math word problems, previous statistical approaches attempt at learning a direct mapping from a problem description to its corresponding equation system. However, such mappings do not include the information of a few higher-order operations that cannot be explicitly represented in equations but are required to solve the problem. The gap between natural language and equations makes it difficult for a learned model to generalize from limited data. In this work we present an intermediate meaning representation scheme that tries to reduce this gap. We use a sequence-to-sequence model with a novel attention regularization term to generate the intermediate forms, then execute them to obtain the final answers. Since the intermediate forms are latent, we propose an iterative labeling framework for learning by leveraging supervision signals from both equations and answers. Our experiments show using intermediate forms outperforms directly predicting equations.


title: Graph-based mining of multiple object usage patterns

text:
The interplay of multiple objects in object-oriented programming often follows specific protocols, for example certain orders of method calls and/or control structure constraints among them that are parts of the intended object usages. Unfortunately, the information is not always documented. That creates long learning curve, and importantly, leads to subtle problems due to the misuse of objects.
 In this paper, we propose GrouMiner, a novel graph-based approach for mining the usage patterns of one or multiple objects. GrouMiner approach includes a graph-based representation for multiple object usages, a pattern mining algorithm, and an anomaly detection technique that are efficient, accurate, and resilient to software changes. Our experiments on several real-world programs show that our prototype is able to find useful usage patterns with multiple objects and control structures, and to translate them into user-friendly code skeletons to assist developers in programming. It could also detect the usage anomalies that caused yet undiscovered defects and code smells in those programs.


title: Performance improvement of synchronous reluctance motors: A review

text: Synchronous Reluctance motors can replace the more commonly used, induction, switched reluctance and permanent magnet motors. They have been shown to outperform similarly dimensioned induction motors in efficiency, torque and power density. They are simple and cheap to construct and require simple control. Such a motor would be ideal for wide spread use in Africa, which currently faces a power deficit, considering that motors account for about 43% of global electric power consumption. The use of synchronous reluctance motors in Electric Vehicles may contribute to the production of more efficient, heavier load and longer range vehicles. This would accelerate adoption of Electric Vehicles and it would help wean the world off fossil fuels. The synchronous reluctance motor has disadvantages of high torque ripple and poor power factor. A radical redesign of the rotor geometry and simultaneous optimisation of the rotor and the stator may significantly improve its performance.


title: Vectorized total variation defined by weighted L infinity norm for utilizing inter channel dependency

text: Vectorized total variation (VTV) is very successful convex regularizer to solve various color image recovery problems. Despite the fact that color channels of natural color images are closely related, existing variants of VTV can not utilize this prior efficiently. We proposed L∞-VTV as a convex regularizer can penalize the violation of such inter-channel dependency by employing weighted L∞ (L-infty) norm. We also introduce an effective algorithm for an image denoising problem using L∞-VTV. Experimental results shows that our proposed method can outperform the conventional methods.


title: Crafting Integrated Multichannel Retailing Strategies

text: Multichannel retailing is the set of activities involved in selling merchandise or services to consumers through more than one channel. Multichannel retailers dominate today's retail landscape. While there are many benefits of operating multiple channels, these retailers also face many challenges. In this article, we discuss the key issues concerning multichannel retailing, including the motivations and constraints of going multichannel, the challenges of crafting multichannel retailing strategies and opportunities for creating synergies across channels, key retail mix decisions facing multichannel retailers, and the dynamics of multichannel retailing. We synthesize current knowledge drawn from the academic literature and industry practice, and discuss potential directions for future research. © 2010 Direct Marketing Educational Foundation, Inc. Published by Elsevier Inc. All rights reserved.


title: Wire Speed Name Lookup: A GPU-based Approach

text: This paper studies the name lookup issue with longest prefix matching, which is widely used in URL filtering, content routing/switching, etc. Recently Content-Centric Networking (CCN) has been proposed as a clean slate future Internet architecture to naturally fit the contentcentric property of today’s Internet usage: instead of addressing end hosts, the Internet should operate based on the identity/name of contents. A core challenge and enabling technique in implementing CCN is exactly to perform name lookup for packet forwarding at wire speed. In CCN, routing tables can be orders of magnitude larger than current IP routing tables, and content names are much longer and more complex than IP addresses. In pursuit of conquering this challenge, we conduct an implementation-based case study on wire speed name lookup, exploiting GPU’s massive parallel processing power. Extensive experiments demonstrate that our GPU-based name lookup engine can achieve 63.52M searches per second lookup throughput on large-scale name tables containing millions of name entries with a strict constraint of no more than the telecommunication level 100μs per-packet lookup latency. Our solution can be applied to contexts beyond CCN, such as search engines, content filtering, and intrusion prevention/detection. c ⃝Prof. Qunfeng Dong (qunfeng.dong@gmail.com) and Prof. Bin Liu (lmyujie@gmail.com), placed in alphabetic order, are the correspondence authors of the paper. Yi Wang and Yuan Zu, placed in alphabetic order, are the lead student authors of Tsinghua University and University of Science and Technology of China, respectively. This paper is supported by 863 project (2013AA013502), NSFC (61073171, 61073184), Tsinghua University Initiative Scientific Research Program(20121080068), the Specialized Research Fund for the Doctoral Program of Higher Education of China(20100002110051), the Ministry of Education (MOE) Program for New Century Excellent Talents (NCET) in University, the Science and Technological Fund of Anhui Province for Outstanding Youth (10040606Y05), by the Fundamental Research Funds for the Central Universities (WK0110000007, WK0110000019), and Jiangsu Provincial Science Foundation (BK2011360).


title: Enable IoT interoperability in ambient assisted living: Active and healthy aging scenarios

text: Ambient Assisted Living (AAL) represents one of the most promising Internet of Things (IoT) applications due to its influence on the quality of life and health of the elderly people. However, the interoperability is one of the major issues that needs to be addressed to promote the adoption of AAL solutions in real environments. In this paper, an IoT prototype system for AAL called AAL-IoTSys is proposed, which includes a Smart IoT Gateway as a key component to enable the interoperability from several heterogeneous devices over different communication protocols and technologies (e.g., WiFi, ZigBee, Bluetooth, IEEE 802.15.4, 6LowPAN). This system aims to monitor environmental (temperature, humidity, C02), health (heart rate) and location (GPS) parameters in the elderly people's houses in order to facilitate events early detection and automatic sending notifications to elderly care stakeholders in active and healthy aging scenarios (included health professionals, caregivers, family members and emergency services).


title: Intelligent Tutoring Systems with Multiple Representations and Self-Explanation Prompts Support Learning of Fractions

text: Although a solid understanding of fractions is foundational in mathematics, the concept of fractions remains a challenging one. Previous research suggests that multiple graphical representations (MGRs) may promote learning of fractions. Specifically, we hypothesized that providing students with MGRs of fractions, in addition to the conventional symbolic notation, leads to better learning outcomes as compared to instruction incorporating only one graphical representation. We anticipated, however, that MGRs would make the students’ task more challenging, since they must link the representations and distill from them a common concept or principle. Therefore, we hypothesized further that selfexplanation prompts would help students benefit from working with MGRs. To investigate these hypotheses, we conducted a classroom study in which 112 6grade students used intelligent tutors for fraction conversion and fraction addition. The results of the study show that students learned more with MGRs of fractions than with a single representation, but only when prompted to self-explain how the graphics relate to the symbolic fraction representations.


title: Boosted key-frame selection and correlated pyramidal motion-feature representation for human action recognition

text: In this paper we propose a novel method for human action recognition based on boosted key-frame selection and correlated pyramidal motion feature representations. Instead of using an unsupervised method to detect interest points, a Pyramidal Motion Feature (PMF), which combines optical flow with a biologically inspired feature, is extracted from each frame of a video sequence. The AdaBoost learning algorithm is then applied to select the most discriminative frames from a large feature pool. In this way, we obtain the top-ranked boosted frames of each video sequence as the key frames which carry the most representative motion information. Furthermore, we utilise the correlogram which focuses not only on probabilistic distributions within one frame but also on the temporal relationships of the action sequence. In the classification phase, a Support-Vector Machine (SVM) is adopted as the final classifier for human action recognition. To demonstrate generalizability, our method has been systematically tested on a variety of datasets and shown to be more effective and accurate for action recognition compared to the previous work. We obtain overall accuracies of: 95.5%, 93.7%, and 36.5% with our proposed method on the KTH, the multiview IXMAS and the challenging HMDB51 datasets, respectively. & 2012 Elsevier Ltd. All rights reserved.


title: Consumers ’ attitude towards online shopping : Factors influencing employees of crazy domains to shop online

text: E-commerce offers many online marketing opportunities to companies worldwide and along with high rapid growth of online shopping; it has impressed many retailers to sell products and services through online channel to expand their market. Online shopping or marketing is the use of technology (i.e., computer, internet) for better marketing performance. And retailers are mixing strategies to meet the demand of online shoppers; they are busy in studying consumer in the field of online shopping, to see the consumer attitudes towards online shopping and specifically studying the factors influencing consumers to shop online. In this study, the multiple regression analysis was employed to measure the relationship between 9 independent variables and receptivity to online shopping. The score of Beta weight presented that all 9 independent variables had positive statistical significant effect to Internet users to accept online shopping. Among the 9 factors, the strongest influencers from highest to lowest were Price, Refund, Convenience, Auction websites, Security, Brand, Search engines, Promotion and Online shopping malls. According to independent t-test analysis for gender, there was significant different means between males and females for online shopping malls and Auctions websites factors to receptivity on online shopping. The means of female significant higher than male for these two factors. This study might contribute not only to a better understanding on what and how strongly the factors are involved in online consumer purchasing decisions but also this study provides e-retailer’s standpoint such the effectively manage and recommendations. However, eretailers should keep in mind that consumer behavior might change in time to time especially in online market so the e-retailer should investigate the consumer behavior in time to time and adapt the products and services to serve as the customer requirements.


title: Big Data Mobile Services for New York City Taxi Riders and Drivers

text: In recent years, taxis in New York City have been equipped with GPS sensors to record the start and end locations of every trip, in conjunction with fare collection equipment recording trip time, fare, and distance. This paper analyzes this vast dataset with big data technologies. We use MapReduce and Hive in order to understand traffic and travel patterns, discover relationships among the data, and make predictions on the taxi network. We also propose a service model combining the results of our data analysis with smartphone applications to offer users various taxi-related services based on results of our big data analysis.


title: Monogenic polyarteritis: the lesson of ADA2 deficiency

text: The deficiency of Adenosine Deaminase 2 (DADA2) is a new autoinflammatory disease characterised by an early onset vasculopathy with livedoid skin rash associated with systemic manifestations, CNS involvement and mild immunodeficiency.This condition is secondary to autosomal recessive mutations of CECR1 (Cat Eye Syndrome Chromosome Region 1) gene, mapped to chromosome 22q11.1, that encodes for the enzymatic protein adenosine deaminase 2 (ADA2). By now 19 different mutations in CECR1 gene have been detected.The pathogenetic mechanism of DADA2 is still unclear. ADA2 in a secreted protein mainly expressed by cells of the myeloid lineage; its enzymatic activity is higher in conditions of hypoxia, inflammation and oncogenesis. Moreover ADA2 is able to induce macrophages proliferation and differentiation; it's deficiency is in fact associated with a reduction of anti-inflammatory macrophages (M2). The deficiency of ADA2 is also associated with an up-regulation of neutrophils-expressed genes and an increased secretion of pro-inflammatory cytokines. The mild immunodeficiency detected in many DADA2 patients suggests a role of this protein in the adaptive immune response; an increased mortality of B cells and a reduction in the number of memory B cells, terminally differentiated B cells and plasmacells has been described in many patients. The lack of the protein is associated with endothelium damage; however the function of this protein in the endothelial homeostasis is still unknown.From the clinical point of view, this disease is characterized by a wide spectrum of severity. Chronic or recurrent systemic inflammation with fever, elevation of acute phase reactants and skin manifestations (mainly represented by livedo reticularis) is the typical clinical picture. While in some patients the disease is mild and skin-limited, others present a severe, even lethal, disease with multi-organ involvement; the CNS involvement is rather common with ischemic or hemorrhagic strokes. In many patients not only the clinical picture but also the histopathologic features are undistinguishable from those of systemic polyarteritis nodosa (PAN). Of note, patients with an unusual phenotype, mainly dominated by clinical manifestations suggestive for an immune-disrective condition, have been described.Due to its rarity, the response to treatment of DADA2 is still anecdotal. While steroids can control the disease's manifestations at high dosage, none of the common immunosuppressive drugs turned out to be effective. Biologic drugs have been used only in few patients, without a clear effectiveness; anti-TNF drugs are those associated to a better clinical response. Hematopoietic stem cells transplantation was effective in patients with a severe phenotype.


title: Understanding and Modeling of WiFi Signal Based Human Activity Recognition

text: Some pioneer WiFi signal based human activity recognition systems have been proposed. Their key limitation lies in the lack of a model that can quantitatively correlate CSI dynamics and human activities. In this paper, we propose CARM, a CSI based human Activity Recognition and Monitoring system. CARM has two theoretical underpinnings: a CSI-speed model, which quantifies the correlation between CSI value dynamics and human movement speeds, and a CSI-activity model, which quantifies the correlation between the movement speeds of different human body parts and a specific human activity. By these two models, we quantitatively build the correlation between CSI value dynamics and a specific human activity. CARM uses this correlation as the profiling mechanism and recognizes a given activity by matching it to the best-fit profile. We implemented CARM using commercial WiFi devices and evaluated it in several different environments. Our results show that CARM achieves an average accuracy of greater than 96%.


title: Towards Answering Opinion Questions: Separating Facts from Opinions and Identifying the Polarity of Opinion Sentences

text: Opinion question answering is a challenging task for natural language processing. In this paper, we discuss a necessary component for an opinion question answering system: separating opinions from fact, at both the document and sentence level. We present a Bayesian classifier for discriminating between documents with a preponderance of opinions such as editorials from regular news stories, and describe three unsupervised, statistical techniques for the significantly harder task of detecting opinions at the sentence level. We also present a first model for classifying opinion sentences as positive or negative in terms of the main perspective being expressed in the opinion. Results from a large collection of news stories and a human evaluation of 400 sentences are reported, indicating that we achieve very high performance in document classification (upwards of 97% precision and recall), and respectable performance in detecting opinions and classifying them at the sentence level as positive, negative, or neutral (up to 91% accuracy).


title: Development and Use of a Gold-Standard Data Set for Subjectivity Classifications

text: This paper presents a case study of analyzing and improving intercoder reliability in discourse tagging using statistical techniques. Bias-corrected tags are formulated and successfully used to guide a revision of the coding manual and develop an automatic classifier. 1 Introduction This paper presents a case study of analyzing and improving intercoder reliability in discourse tagging using the statistical techniques presented in (Bruce and Wiebe, 1998; Bruce and Wiebe, to appear). Our approach is data driven: we refine our understanding and presentation of the classification scheme guided by the results of the intercoder analysis. We also present the results of a probabilistic classifier developed on the resulting annotations. Much research in discourse processing has focused on task-oriented and instructional dialogs. The task addressed here comes to the fore in other genres, especially news reporting. The task is to distinguish sentences used to objectively present factual information from sentences used to present opinions and evaluations. There are many applications for which this distinction promises to be important, including text categorization and summarization. This research takes a large step toward developing a reliably annotated gold standard to support experimenting with such applications. This research is also a case study of analyzing and improving manual tagging that is applicable to any tagging task. We perform a statistical analysis that provides information that complements the information provided by


title: New Avenues in Opinion Mining and Sentiment Analysis

text: The Web holds valuable, vast, and unstructured information about public opinion. Here, the history, current use, and future of opinion mining and sentiment analysis are discussed, along with relevant techniques and tools.


title: Inferring 3D layout of building facades from a single image

text: In this paper, we propose a novel algorithm that infers the 3D layout of building facades from a single 2D image of an urban scene. Different from existing methods that only yield coarse orientation labels or qualitative block approximations, our algorithm quantitatively reconstructs building facades in 3D space using a set of planes mutually related by 3D geometric constraints. Each plane is characterized by a continuous orientation vector and a depth distribution. An optimal solution is reached through inter-planar interactions. Due to the quantitative and plane-based nature of our geometric reasoning, our model is more expressive and informative than existing approaches. Experiments show that our method compares competitively with the state of the art on both 2D and 3D measures, while yielding a richer interpretation of the 3D scene behind the image.


title: Suicide rates among physicians: a quantitative and gender assessment (meta-analysis).

text:
OBJECTIVE
Physicians' suicide rates have repeatedly been reported to be higher than those of the general population or other academics, but uncertainty remains. In this study, physicians' suicide rate ratios were estimated with a meta-analysis and systematic quality assessment of recent studies.

METHOD
Studies of physicians' suicide rates were located in MEDLINE, PsycINFO, AARP Ageline, and the EBM Reviews: Cochrane Database of Systematic Reviews with the terms "physicians," "doctors," "suicide," and "mortality." Studies were included if they were published in or after 1960 and gave estimates of age-standardized suicide rates of physicians and their reference population or reported extractable data on physicians' suicide; 25 studies met the criteria. Reviewers extracted data and scored each study for quality. The studies were tested for heterogeneity and publication bias and were stratified by publication year, follow-up, and study quality. Effect sizes were pooled by using fixed-effects (women) and random-effects (men) models.

RESULTS
The aggregate suicide rate ratio for male physicians, compared to the general population, was 1.41, with a 95% confidence interval (CI) of 1.21-1.65. For female physicians the ratio was 2.27 (95% CI=1.90-2.73). Visual inspection of funnel plots from tests of publication bias revealed randomness for men but some indication of bias for women, with a relative, nonsignificant lack of studies in the lower right quadrant.

CONCLUSIONS
Studies on physicians' suicide collectively show modestly (men) to highly (women) elevated suicide rate ratios. Larger studies should help clarify whether female physicians' suicide rate is truly elevated or can be explained by publication bias.


title: Designs of fully on-chip antennas in (Bi)CMOS technology

text: The paper presents several feasible millimeter wave on-chip antenna designs suitable to be fabricated in CMOS technology without any additional process. The results are listed and compared with state-of-the-art designs in the literature. The difficulties in designing high efficiency antenna on CMOS chip are discussed.


title: LOMAC: Low Water-Mark Integrity Protection for COTS Environments

text: We hypothesizethat a form of kernel-residentaccesscontrol-based integrity protection can gain widespread acceptancein Commer cial Off-The-Shelf(COTS)environmentsprovidedthat it couplessomeusefulprotectionwith a high degreeof compatibilitywith existing software, configurations,andpractices.To testthis hypothesis, wehave developeda highly-compatiblefreeopen-sour ceprototype calledLOMAC, andreleasedit on theInternet.LOMAC is a dynamicallyloadableextensionfor COTSLinux kernels thatprovidesintegrity protectionbasedonLowWater-Mark accesscontrol. We presenta classificationof existing accesscontrol modelswith regard tocompatibility, concluding thatmodelssimilar to LowWater-Mark areespeciallywellsuitedto high-compatibilitysolutions.Wealsodescribeour practical strategiesfor dealingwith thepathological cases in the Low Water-Mark model’s behavior , which includea smallextensionof themodel,andanunusualapplicationof


title: Experience in System Design for Human-Robot Teaming in Urban Search and Rescue

text: The paper describes experience with applying a user-centric design methodology in developing systems for human-robot teaming in Urban Search & Rescue. A human-robot team consists of several semi-autonomous robots (rovers/UGVs, microcopter/UAVs), several humans at an off-site command post (mission commander, UGV operators) and one on-site human (UAV operator). This system has been developed in close cooperation with several rescue organizations, and has been deployed in a real-life tunnel accident use case. The human-robot team jointly explores an accident site, communicating using a multi-modal team interface, and spoken dialogue. The paper describes the development of this complex socio-technical system per se, as well as recent experience in evaluating the performance of this system.


title: A method for Automatic Text Summarization using Consensus of Multiple Similarity Measures and Ranking Techniques

text: In the era of information overload, text summarization can be defined as the process of extracting useful information from a large space of available content using traditional filtering methods. One of the major challenges in the domain of extraction based summarization is that a single statistical measure is not sufficient to produce efficient summaries which would be close to human-made ‘gold standard’, since each measure suffers from individual weaknesses. We deal with this problem by proposing a text summarization model that combines various statistical measures so that the pitfalls of an individual technique could be compensated by the strengths of others. Experimental results are presented to demonstrate the effectiveness of the proposed method using the TAC 2011 Multiling pilot dataset for English language and ROUGE summary evaluation tool.


title: TopicShop: enhanced support for evaluating and organizing collections of Web sites

text: TopicShop is an interface that helps users evaluate and organize collections of web sites. The main interface components are site profiles, which contain information that helps users select high-quality items, and a work area, which offers thumbnail images, annotation, and lightweight grouping techniques to help users organize selected sites. The two components are linked to allow task integration. Previous work [2] demonstrated that subjects who used TopicShop were able to select significantly more highquality sites, in less time and with less effort. We report here on studies that confirm and extend these results. We also show that TopicShop subjects spent just half the time organizing sites, yet still created more groups and more annotations, and agreed more in how they grouped sites. Finally, TopicShop subjects tightly integrated the tasks of evaluating and organizing sites. INTRODUCTION In previous work [2], we motivated an important task for web users – gathering, evaluating, and organizing information resources for a given topic. Current web tools do not support this task well; specifically, they do not make it easy to evaluate collections of web sites to select the best ones or to organize sites for future reuse and sharing. Users have to browse and view sites one after another until they are satisfied they have a good set, or, more likely, they get tired and give up. Browsing a web site is an expensive operation, both in time and cognitive effort. And bookmarks, the most common form of keeping track of web sites, are a fairly primitive organizational technique. We designed and implemented the TopicShop system to provide comprehensive, integrated support for this task. TopicShop aids users in finding a set of relevant sites, in narrowing down the set into a smaller set of high quality sites, and in organizing sites for future use. TopicShop has evolved through a number of design iterations, driven by extensive user testing. We report here on lessons we learned from a pilot study, how these lessons re-shaped our understanding of the task and led to a significant re-design, and the results of a second, larger user study. RELATED WORK Our research program investigates the major information problems faced by users of the World Wide Web: • finding collections of items relevant to their interests; • identifying high-quality items within a collection; • finding items that contain a certain category of information, e.g., episode guides (for a television show) or song lyrics (for a musician); • organizing personalized subsets of items. We have addressed these problems by developing algorithms, implementing them in web crawling and analysis tools, creating interfaces to support users in exploring, comprehending, and organizing collections of web documents, and performing user studies [2, 3, 4, 15]. The work reported here focuses on understanding the user tasks of evaluating and organizing collections of web sites, as ill uminated by the design, evaluation, and re-design of interfaces to support these tasks. Other researchers have investigated these issues. Much recent work has been devoted to algorithms for adding meta-information to collections of web sites to enhance user comprehension, typically by analyzing the structure of links between sites. This approach builds on the intuition that when the author of one site chooses to link to another, this often implies both that the sites have similar content and that the author is endorsing the content of the linked-to site. Pirolli , Pitkow and colleagues [12, 13] experimented with link-based algorithms for clustering and categorizing web pages. Kleinberg’s HITS algorithm [8] defines authoritative and hub pages within a hypertext collection. Authorities and hubs are mutually dependent: a good authority is a page that is linked to by many hubs, and a good hub is one that links to many authorities. After evaluating items and selecting the interesting ones, users must organize the items for future use. Card, Robertson, and Mackinlay [5] introduced the concept of information workspaces to refer to environments in which information items can be stored and manipulated. A departure point for most such systems is the file manager popularized by the Apple Macintosh and then in Microsoft Windows. Such systems typically include a list view, which shows various properties of items, and an icon view, which lets users organize icons representing the items in a 2D space. Mander, Salomon, and Wong [10] enhanced the basic metaphor with the addition of “piles” . Users could create and manipulate piles of items. Interesting interaction techniques for displaying, browsing, and searching piles were designed and tested. Bookmarks are the most popular way to create personal information workspaces of web resources. Bookmarks consist of lists of URLs; typically the title of the web page is used as the label for the URL. Users may organize their bookmarks into a hierarchical category structure. Abrams, Baecker, and Chignell [1] carried out an extensive study of how several hundred web users used bookmarks. They observed a number of strategies for organizing bookmarks, including a flat ordered list, a single level of folders, and hierarchical folders. They also made four design recommendations to help users manage their bookmarks more effectively. First, bookmarks must be easy to organize, e.g., via automatic sorting techniques. Second, visualization techniques are necessary to provide comprehensive overviews of large sets of bookmarks. Third, rich representations of sites are required; many users noted that site titles are not accurate descriptors of site content. Finally, tools for managing bookmarks must be well i ntegrated with web browsers. Many researchers have created experimental information workspace interfaces, often designed expressly for web documents. Card, Robertson, and York [5] describe the WebBook, which uses a book metaphor to group a collection of related web pages for viewing and interaction, and the WebForager, an interface that lets users view and manage multiple WebBooks. Mackinlay, Rao, and Card [9] developed a novel user interface for accessing articles from a citation database. The central UI object is a “Butterfly” , which represents an article, its references, and its citers. The interface makes it easy for users to browse among related articles, group articles, and generate queries to retrieve articles that stand in a particular relationship to the current article. The Data Mountain of Robertson et al [14] represents documents as thumbnail images in a 3D virtual space. Users can move and group the images freely, with various interesting visual and audio cues used to help users arrange the documents. In a study comparing the use of Data Mountain to Internet Explorer Favorites, Data Mountain users retrieved items more quickly, with fewer incorrect or failed retrievals. Our research shares goals with much of the previous work. We focus on designing interfaces that make automatically extracted information about web sites readily accessible to users. We show that this increases users’ abilit y to select high-quality sites. Through ongoing user studies and redesign, we developed easy-to-use annotation and grouping techniques that let users organize items better and more quickly. Finally, we learned how users interleave work on various tasks and re-designed our interface to support such task interleaving. TOPICSHOPEXPLORER, VERSION 1 The TopicShop Explorer is implemented in C++ and runs on Microsoft Windows platforms. Version 1 was based directly on the Macintosh file manager / MS Windows Explorer metaphor (see [3] for detail of TopicShop Version 1 and the pilot study). Accordingly, users could view collections in either a details (Figure 1) or icons (Figure 2) view. The details view showed site profile information (see below) to help users evaluate sites, and the icons view let users organize sites spatially. Figure 1: TopicShop Explorer (version 1), details view. Each web site is represented by a small thumbnail image, the site title, and profile data including the links to/from other sites in the collection, and the number of pages, images, and audio files on the site. Users can sort by a property by clicking on the appropriate column. Figure 2: TopicShop Explorer (version 1), icons view. Each site is represented by a large thumbnail image and the site title. Users can organize sites by arranging them spatially, a technique especially useful in the early stages of exploration. The collections of sites and site profile data used in TopicShop are obtained by running a webcrawler/analyzer. The crawler takes a user-specified set of seed sites as input, and follows links from the seeds to construct a graph of the seed sites, pages contained on these sites, and, optionally, sites determined to be related based on their textual and hyperlink connections to the seeds. Site profiles are built by fetching a large number of pages from each site. Profiles contain content data, including the page title, an estimate of the page count, and a roster of audio files, movie files, and images; they also record links between sites in the collection. In addition, a thumbnail image of each site’s root page is constructed. The first goal of TopicShop is to help users evaluate and identify high quality sites. We sought to achieve this goal by providing site profile data and interface mechanisms for viewing and exploring the data. Making this data visible means that users no longer had to select sites to browse based solely on titles and (sometimes) brief textual annotations. (A chief complaint of subjects in the Abrams et al [1] study was that titles were inadequate descriptors of site content — and that was for sites that users already had browsed and decided to bookmark.) Instead, users may visit only sites that have been endorsed (linked to) by many other sites or sites that are rich in


title: Improving Document Clustering for Short Texts by Long Documents via a Dirichlet Multinomial Allocation Model

text: Document clustering for short texts has received considerable interest. Traditional document clustering approaches are designed for long documents and perform poorly for short texts due to the their sparseness representation. To better understand short texts, we observe that words that appear in long documents can enrich short text context and improve the clustering performance for short texts. In this paper, we propose a novel model, namely DDMAfs, which 1) improves the clustering performance of short texts by sharing structural knowledge of long documents to short texts; 2) automatically identifies the number of clusters; 3) separates discriminative words from irrelevant words for long documents to obtain high quality structural knowledge. Our experiments indicate that the DDMAfs model performs well on the synthetic dataset and real datasets. Comparisons between the DDMAfs model and state-of-the-art short text clustering approaches show that the DDMAfs model is effective.


title: CBSE as Novel Approach for IDS

text: This paper gives a new approach called Component based software engineering for designing an intrusion detection system. This paper also tells that before this component based software approach, other traditional approaches were used for designing intrusion detection system. But due to various drawbacks we proposed this component based approach for intrusion detection system. A comparison table is also illustrated in this paper on the basis of class diagram designed using UML language in a simulated environment. This comparison table will illustrate main difference between the traditional and component based approach and also shows that which parameters make this approach a better approach. Keywords—Component based software engineering, intrusion detection system, Classes etc.


title: Overview on electrostatic discharge protection designs for mixed-voltage I/O interfaces: design concept and circuit implementations

text: Electrostatic discharge (ESD) protection design for mixed-voltage I/O interfaces has been one of the key challenges of system-on-a-chip (SOC) implementation in nano-scale CMOS processes. The on-chip ESD protection circuit for mixed-voltage I/O interfaces should meet the gate-oxide reliability constraints and prevent the undesired leakage current paths. This paper presents an overview on the design concept and circuit implementations of the ESD protection designs for mixed-voltage I/O interfaces without using the additional thick gate-oxide process. The ESD design constraints in mixed-voltage I/O interfaces, the classification and analysis of ESD protection designs for mixed-voltage I/O interfaces, and the designs of high-voltage-tolerant power-rail ESD clamp circuit are presented and discussed.


title: Enterprise-wide Optimization : A New Frontier in Process Systems Engineering

text: Enterprise-wide optimization (EWO) is a new emerging area that lies at the interface of chemical engineering and operations research, and has become a major goal in the process industries due to the increasing pressures for remaining competitive in the global marketplace. EWO involves optimizing the operations of supply, manufacturing and distribution activities of a company to reduce costs and inventories. A major focus in EWO is the optimal operation of manufacturing facilities, which often requires the use of nonlinear process models. Major operational items include planning, scheduling, realtime optimization and inventory control. One of the key features of EWO is integration of the information and the decision-making among the various functions that comprise the supply chain of the company. This can be achieved with modern IT tools, which together with the internet, have promoted e-commerce. However, as will be discussed, to fully realize the potential of transactional IT tools, the development of sophisticated deterministic and stochastic linear/nonlinear optimization models and algorithms (analytical IT tools) is needed to explore and analyze alternatives of the supply chain to yield overall optimum economic performance, as well as high levels of customer satisfaction. An additional challenge is the integrated and coordinated decision-making across the various functions in a company (purchasing, manufacturing, distribution, sales), across various geographically distributed organizations (vendors, facilities and markets), and across various levels of decision-making (strategic, tactical and operational). © 2005 American Institute of Chemical Engineers AIChE J, 51: 1846–1857, 2005


title: Forecasting stock market movement direction with support vector machine

text: Support vector machine (SVM) is a very speci1c type of learning algorithms characterized by the capacity control of the decision function, the use of the kernel functions and the sparsity of the solution. In this paper, we investigate the predictability of 1nancial movement direction with SVM by forecasting the weekly movement direction of NIKKEI 225 index. To evaluate the forecasting ability of SVM, we compare its performance with those of Linear Discriminant Analysis, Quadratic Discriminant Analysis and Elman Backpropagation Neural Networks. The experiment results show that SVM outperforms the other classi1cation methods. Further, we propose a combining model by integrating SVM with the other classi1cation methods. The combining model performs best among all the forecasting methods. ? 2004 Elsevier Ltd. All rights reserved.


title: Classifying the Informative Behaviour of Emoji in Microblogs

text: Emoji are pictographs commonly used in microblogs as emotion markers, but they can also represent a much wider range of concepts. Additionally, they may occur in different positions within a message (e.g. a tweet), appear in sequences or act as word substitute. Emoji must be considered necessary elements in the analysis and processing of user generated content, since they can either provide fundamental syntactic information, emphasize what is already expressed in the text, or carry meaning that cannot be inferred from the words alone. We collected and annotated a corpus of 2475 tweets pairs with the aim of analyzing and then classifying emoji use with respect to redundancy. The best classification model achieved an F-score of 0.7. In this paper we shortly present the corpus, and we describe the classification experiments, explain the predictive features adopted, discuss the problematic aspects of our approach and suggest future improvements.


Der CDO als Komplement zum CIO


title: Sustainable Food Supply Chains : The Role of Collaboration and Sustainable Relationships

text: The life cycle approach is widely used in the analysis of sustainability. Its application to supply chains is necessary since the product flows, from processing of raw materials to the final customer, are considered. The role of the organizational aspects, expressed in terms of relationships between the supply chain agents, is little considered in the life cycle analysis approach. The aim of this paper is to extend the scope of the food chain life cycle analysis by adding the organizational dimension to the environmental, economic and social ones. Within this context, Collaboration and Sustainable Relationships concepts have been explored based on a literature survey. A theoretical framework, describing their role in assessing the organizational dimension in the life cycle analysis of the food supply chains, is defined. A hypothesis on their joint influence on the supply chains performances is formulated.


title: Offloading in Mobile Edge Computing: Task Allocation and Computational Frequency Scaling

text: In this paper, we propose an optimization framework of offloading from a single mobile device (MD) to multiple edge devices. We aim to minimize both total tasks’ execution latency and the MD’s energy consumption by jointly optimizing the task allocation decision and the MD’s central process unit (CPU) frequency. This paper considers two cases for the MD, i.e., fixed CPU frequency and elastic CPU frequency. Since these problems are NP-hard, we propose a linear relaxation-based approach and a semidefinite relaxation (SDR)-based approach for the fixed CPU frequency case, and an exhaustive search-based approach and an SDR-based approach for the elastic CPU frequency case. Our simulation results show that the SDR-based algorithms achieve near optimal performance. Performance improvement can be obtained with the proposed scheme in terms of energy consumption and tasks’ execution latency when multiple edge devices and elastic CPU frequency are considered. Finally, we show that the MD’s flexible CPU range can have an impact on the task allocation.


title: Robustness beyond shallowness: incremental deep parsing

text: Robustness is a key issue for natural language processing in general and parsing in particular, and many approaches have been explored in the last decade for the design of robust parsing systems. Among those approaches is shallow or partial parsing, which produces minimal and incomplete syntactic structures, often in an incremental way. We argue that with a systematic incremental methodology one can go beyond shallow parsing to deeper language analysis, while preserving robustness. We describe a generic system based on such methodology and designed for building robust analyzers that tackle deeper linguistic phenomena than those traditionally handled by the now widespread shallow parsers. The rule formalism allows the recognition of n-ary linguistic relations between words or constituents on the basis of global or local structural, topological and/or lexical conditions. It offers the advantage of accepting various types of inputs, ranging from raw to chunked or constituent-marked texts, so for instance it can be used to process existing annotated corpora, or to perform a deeper analysis on the output of an existing shallow parser. It has been successfully used to build a deep functional dependency parser, as well as for the task of co-reference resolution, in a modular way.


title: From Single to Dual Robotic Therapy: A Review of the Development Process of iPAM

text: Stroke is a common condition in the UK with over 30,000 people per annum are left with significant disability. When severe arm paresis is occurs, functional recovery of the affected arm is often poor. This can have a major impact on physical independence. A contributing factor to the poor recovery relates to lack of intensity of appropriate arm exercise practice. Through the use of robotic technology it may be possible to augment the physical therapist's efforts and maximize the impact of the limited physical therapy resource. At Leeds University a prototype single robot system has been developed that is capable of moving a patient's arm through a set of movements prescribed by a physiotherapist. This system is robust to changes in the biomechanical and physiological properties through a large range of patients. Further development of the system has led to a dual robot system that provides a greater level of control over upper-arm joint co-ordination while offering additional support to the shoulder complex. In order to test the systems safely, two models of the human arm have been produced: 1) a 6 degree of freedom computational model simulating how the robot system could provide therapy to a patient. 2) A mechanical model (Derryck), representing the biomechanical properties of the shoulder and elbow. The prototype single robot system is shown to be capable of administering trajectory following (for Derryck) for a large range of arm parameters


title: Categorize the Quality of Cotton Seeds Based on the Different Germination of the Cotton Using Machine Knowledge Approach

text: A study was made in those region that expose major area of machine learning techniques which available in data mining. There are lots of Research work is analysized in agriculture field. It is a smart techniques is needed to find the resolution over the modern method. Cotton is an significant beneficial harvest and extensively traded commodity across the world. Its yield is insightful to weather, soil as well as organization practices. This study presents a concise idea of several of the broadly capitalized machine learning technique over agricultural domain. Among the algorithms like Navie bayes, j48 ,MLP,Randomforest,Random tree, I have founded J48 gives better result over the other algorithms using cotton seed quality accuracy is best.


title: MOOCs: So Many Learners, So Much Potential ...

text: Massive open online courses (MOOCs) have exploded onto the scene, promising to satisfy a worldwide thirst for a high-quality, personalized, and free education. This article explores where MOOCs fit within the e-learning and Artificial Intelligence in Education (AIED) landscape.


title: Facial Expression Analysis under Partial Occlusion: A Survey

text: Automatic machine-based Facial Expression Analysis (FEA) has made substantial progress in the past few decades driven by its importance for applications in psychology, security, health, entertainment, and human–computer interaction. The vast majority of completed FEA studies are based on nonoccluded faces collected in a controlled laboratory environment. Automatic expression recognition tolerant to partial occlusion remains less understood, particularly in real-world scenarios. In recent years, efforts investigating techniques to handle partial occlusion for FEA have seen an increase. The context is right for a comprehensive perspective of these developments and the state of the art from this perspective. This survey provides such a comprehensive review of recent advances in dataset creation, algorithm development, and investigations of the effects of occlusion critical for robust performance in FEA systems. It outlines existing challenges in overcoming partial occlusion and discusses possible opportunities in advancing the technology. To the best of our knowledge, it is the first FEA survey dedicated to occlusion and aimed at promoting better-informed and benchmarked future work.


title: A six degrees of freedom haptic interface for laparoscopic training

text: We present the novel kinematics, workspace characterization, functional prototype and impedance control of a six degrees of freedom haptic interface designed to train surgeons for laparoscopic procedures, through virtual reality simulations. The parallel kinematics of the device is constructed by connecting a 3RRP planar parallel mechanism to a linearly actuated modified delta mechanism with a connecting link. The configuration level forward and inverse kinematics of the device assume analytic solutions, while its workspace can be shaped to enable large end-effector translations and rotations, making it well-suited for laparoscopy operations. Furthermore, the haptic interface features a low apparent inertia with high structural stiffness, thanks to its parallel kinematics with grounded actuators. A model-based open-loop impedance controller with feed-forward gravity compensation has been implemented for the device and various virtual tissue/organ stiffness levels have been rendered.


title: Commercial DC-DC converters: A survey of isolated low-voltage very-high-current systems for transportation electrification

text: As the energy demand from low-voltage (LV) DC sources on vehicles keeps increasing, the need for DC-DC converters capable of handling very high current on the LV side is growing. A group of original equipment manufacturers (OEM) have set performance targets for such converters for the years 2015 and 2020. This paper presents an extensive survey of DC-DC converters that are: a) galvanically isolated, b) able to scale 12/24/48 V up to several hundred volts, and c) rated to carry several hundred amperes of current on the LV side. More than eighty converters from thirty manufacturers are analyzed. Characteristics such as voltage ranges, current capacity, power rating, efficiency, operating temperature, cooling types, weight, power density, volume, specific power, compliant codes, and standards are collected and presented in a graphical form. The current insights and trends are gathered and compared with the OEM targets. The results can serve as a technology indicator of this kind of converters in 2015 for researchers and practicing engineers of transportation electrification and others alike.


title: Batch Renormalization: Towards Reducing Minibatch Dependence in Batch-Normalized Models

text: Batch Normalization is quite effective at accelerating and improving the training of deep models. However, its effectiveness diminishes when the training minibatches are small, or do not consist of independent samples. We hypothesize that this is due to the dependence of model layer inputs on all the examples in the minibatch, and different activations being produced between training and inference. We propose Batch Renormalization, a simple and effective extension to ensure that the training and inference models generate the same outputs that depend on individual examples rather than the entire minibatch. Models trained with Batch Renormalization perform substantially better than batchnorm when training with small or non-i.i.d. minibatches. At the same time, Batch Renormalization retains the benefits of batchnorm such as insensitivity to initialization and training efficiency.


title: GANs Trained by a Two Time-Scale Update Rule Converge to a Local Nash Equilibrium

text: Generative Adversarial Networks (GANs) excel at creating realistic images with complex models for which maximum likelihood is infeasible. However, the convergence of GAN training has still not been proved. We propose a two time-scale update rule (TTUR) for training GANs with stochastic gradient descent on arbitrary GAN loss functions. TTUR has an individual learning rate for both the discriminator and the generator. Using the theory of stochastic approximation, we prove that the TTUR converges under mild assumptions to a stationary local Nash equilibrium. The convergence carries over to the popular Adam optimization, for which we prove that it follows the dynamics of a heavy ball with friction and thus prefers flat minima in the objective landscape. For the evaluation of the performance of GANs at image generation, we introduce the ‘Fréchet Inception Distance” (FID) which captures the similarity of generated images to real ones better than the Inception Score. In experiments, TTUR improves learning for DCGANs and Improved Wasserstein GANs (WGAN-GP) outperforming conventional GAN training on CelebA, CIFAR-10, SVHN, LSUN Bedrooms, and the One Billion Word Benchmark.


title: Inception-v4, Inception-ResNet and the Impact of Residual Connections on Learning

text: Very deep convolutional networks have been central to the largest advances in image recognition performance in recent years. One example is the Inception architecture that has been shown to achieve very good performance at relatively low computational cost. Recently, the introduction of residual connections in conjunction with a more traditional architecture has yielded state-of-the-art performance in the 2015 ILSVRC challenge; its performance was similar to the latest generation Inception-v3 network. This raises the question of whether there are any benefit in combining the Inception architecture with residual connections. Here we give clear empirical evidence that training with residual connections accelerates the training of Inception networks significantly. There is also some evidence of residual Inception networks outperforming similarly expensive Inception networks without residual connections by a thin margin. We also present several new streamlined architectures for both residual and non-residual Inception networks. These variations improve the single-frame recognition performance on the ILSVRC 2012 classification task significantly. We further demonstrate how proper activation scaling stabilizes the training of very wide residual Inception networks. With an ensemble of three residual and one Inception-v4, we achieve 3.08% top-5 error on the test set of the ImageNet classification (CLS) challenge.


title: Deep Networks with Stochastic Depth

text: Very deep convolutional networks with hundreds of layers have led to significant reductions in error on competitive benchmarks. Although the unmatched expressiveness of the many layers can be highly desirable at test time, training very deep networks comes with its own set of challenges. The gradients can vanish, the forward flow often diminishes, and the training time can be painfully slow. To address these problems, we propose stochastic depth, a training procedure that enables the seemingly contradictory setup to train short networks and use deep networks at test time. We start with very deep networks but during training, for each mini-batch, randomly drop a subset of layers and bypass them with the identity function. This simple approach complements the recent success of residual networks. It reduces training time substantially and improves the test error significantly on almost all data sets that we used for evaluation. With stochastic depth we can increase the depth of residual networks even beyond 1200 layers and still yield meaningful improvements in test error (4.91% on CIFAR-10).


title: Dissecting Video Server Selection Strategies in the YouTube CDN

text: In this paper, we conduct a detailed study of the YouTube CDN with a view to understanding the mechanisms and policies used to determine which data centers users download video from. Our analysis is conducted using week-long datasets simultaneously collected from the edge of five networks - two university campuses and three ISP networks - located in three different countries. We employ state-of-the-art delay-based geolocation techniques to find the geographical location of YouTube servers. A unique aspect of our work is that we perform our analysis on groups of related YouTube flows. This enables us to infer key aspects of the system design that would be difficult to glean by considering individual flows in isolation. Our results reveal that while the RTT between users and data centers plays a role in the video server selection process, a variety of other factors may influence this selection including load-balancing, diurnal effects, variations across DNS servers within a network, limited availability of rarely accessed video, and the need to alleviate hot-spots that may arise due to popular video content.


title: Reliable Beamspace Channel Estimation for Millimeter-Wave Massive MIMO Systems with Lens Antenna Array

text: Millimeter-wave (mm-wave) massive MIMO with lens antenna array can considerably reduce the number of required radio-frequency (RF) chains by beam selection. However, beam selection requires the base station to acquire the accurate information of beamspace channel. This is a challenging task as the size of beamspace channel is large, while the number of RF chains is limited. In this paper, we investigate the beamspace channel estimation problem in mm-wave massive MIMO systems with lens antenna array. Specifically, we first design an adaptive selecting network for mm-wave massive MIMO systems with lens antenna array, and based on this network, we further formulate the beamspace channel estimation problem as a sparse signal recovery problem. Then, by fully utilizing the structural characteristics of the mm-wave beamspace channel, we propose a support detection (SD)-based channel estimation scheme with reliable performance and low pilot overhead. Finally, the performance and complexity analyses are provided to prove that the proposed SD-based channel estimation scheme can estimate the support of sparse beamspace channel with comparable or higher accuracy than conventional schemes. Simulation results verify that the proposed SD-based channel estimation scheme outperforms conventional schemes and enjoys satisfying accuracy even in the low SNR region as the structural characteristics of beamspace channel can be exploited.