Pastry: Scalable, distributed object location and routing for large-scale peer-to-

This paper presents the design and evaluation of Pastry, a sc al ble, distributed object location and routing scheme for wide-ar a peer-to-peer applications. Pastry performs application-level routing and ob ject location in a potentially very large overlay network of nodes connected via the Int rnet. It can be used to support a wide range of peer-to-peer applications li ke g obal data storage, global data sharing, and naming. An insert operation in Pastry stores an object at a user-defin ed number of diverse nodes within the Pastry network. A lookup operation reliabl y retrieves a copy of the requested object if one exists. Moreover, a lookup is usu ally routed to the node nearest the client issuing the lookup (by some measure of pro ximity), among the nodes storing the requested object. Pastry is completely de centralized, scalable, and self-configuring; it automatically adapts to the arriva l, departure and failure of nodes. Experimental results obtained with a prototype implementa tion on a simulated network of up to 100,000 nodes confirm Pastry’s scalability, its ability to selfconfigure and adapt to node failures, and its good network loc ality properties.


Face-to-face transfer of wafer-scale graphene films

Graphene has attracted worldwide interest since its experimental discovery, but the preparation of large-area, continuous graphene film on SiO2/Si wafers, free from growth-related morphological defects or transfer-induced cracks and folds, remains a formidable challenge. Growth of graphene by chemical vapour deposition on Cu foils has emerged as a powerful technique owing to its compatibility with industrial-scale roll-to-roll technology. However, the polycrystalline nature and microscopic roughness of Cu foils means that such roll-to-roll transferred films are not devoid of cracks and folds. High-fidelity transfer or direct growth of high-quality graphene films on arbitrary substrates is needed to enable wide-ranging applications in photonics or electronics, which include devices such as optoelectronic modulators, transistors, on-chip biosensors and tunnelling barriers. The direct growth of graphene film on an insulating substrate, such as a SiO2/Si wafer, would be useful for this purpose, but current research efforts remain grounded at the proof-of-concept stage, where only discontinuous, nanometre-sized islands can be obtained. Here we develop a face-to-face transfer method for wafer-scale graphene films that is so far the only known way to accomplish both the growth and transfer steps on one wafer. This spontaneous transfer method relies on nascent gas bubbles and capillary bridges between the graphene film and the underlying substrate during etching of the metal catalyst, which is analogous to the method used by tree frogs to remain attached to submerged leaves. In contrast to the previous wet or dry transfer results, the face-to-face transfer does not have to be done by hand and is compatible with any size and shape of substrate; this approach also enjoys the benefit of a much reduced density of transfer defects compared with the conventional transfer method. Most importantly, the direct growth and spontaneous attachment of graphene on the underlying substrate is amenable to batch processing in a semiconductor production line, and thus will speed up the technological application of graphene.


Memristor-Based Material Implication (IMPLY) Logic: Design Principles and Methodologies

Memristors are novel devices, useful as memory at all hierarchies. These devices can also behave as logic circuits. In this paper, the IMPLY logic gate, a memristor-based logic circuit, is described. In this memristive logic family, each memristor is used as an input, output, computational logic element, and latch in different stages of the computing process. The logical state is determined by the resistance of the memristor. This logic family can be integrated within a memristor-based crossbar, commonly used for memory. In this paper, a methodology for designing this logic family is proposed. The design methodology is based on a general design flow, suitable for all deterministic memristive logic families, and includes some additional design constraints to support the IMPLY logic family. An IMPLY 8-bit full adder based on this design methodology is presented as a case study.


Video Super-Resolution via Bidirectional Recurrent Convolutional Networks

Super resolving a low-resolution video, namely video super-resolution (SR), is usually handled by either single-image SR or multi-frame SR. Single-Image SR deals with each video frame independently, and ignores intrinsic temporal dependency of video frames which actually plays a very important role in video SR. Multi-Frame SR generally extracts motion information, e.g., optical flow, to model the temporal dependency, but often shows high computational cost. Considering that recurrent neural networks (RNNs) can model long-term temporal dependency of video sequences well, we propose a fully convolutional RNN named bidirectional recurrent convolutional network for efficient multi-frame SR. Different from vanilla RNNs, 1) the commonly-used full feedforward and recurrent connections are replaced with weight-sharing convolutional connections. So they can greatly reduce the large number of network parameters and well model the temporal dependency in a finer level, i.e., patch-based rather than frame-based, and 2) connections from input layers at previous timesteps to the current hidden layer are added by 3D feedforward convolutions, which aim to capture discriminate spatio-temporal patterns for short-term fast-varying motions in local adjacent frames. Due to the cheap convolutional operations, our model has a low computational complexity and runs orders of magnitude faster than other multi-frame SR methods. With the powerful temporal dependency modeling, our model can super resolve videos with complex motions and achieve well performance.


Semi-supervised time series classification

The problem of time series classification has attracted great interest in the last decade. However current research assumes the existence of large amounts of labeled training data. In reality, such data may be very difficult or expensive to obtain. For example, it may require the time and expertise of cardiologists, space launch technicians, or other domain specialists. As in many other domains, there are often copious amounts of unlabeled data available. For example, the PhysioBank archive contains gigabytes of ECG data. In this work we propose a semi-supervised technique for building time series classifiers. While such algorithms are well known in text domains, we will show that special considerations must be made to make them both efficient and effective for the time series domain. We evaluate our work with a comprehensive set of experiments on diverse data sources including electrocardiograms, handwritten documents, and video datasets. The experimental results demonstrate that our approach requires only a handful of labeled examples to construct accurate classifiers.


Luhn Revisited: Significant Words Language Models

Users tend to articulate their complex information needs in only a few keywords, making underspecified statements of request the main bottleneck for retrieval effectiveness. Taking advantage of feedback information is one of the best ways to enrich the query representation, but can also lead to loss of query focus and harm performance in particular when the initial query retrieves only little relevant information when overfitting to accidental features of the particular observed feedback documents. Inspired by the early work of Luhn [23], we propose significant words language models of feedback documents that capture all, and only, the significant shared terms from feedback documents. We adjust the weights of common terms that are already well explained by the document collection as well as the weight of rare terms that are only explained by specific feedback documents, which eventually results in having only the significant terms left in the feedback model.
 Our main contributions are the following. First, we present significant words language models as the effective models capturing the essential terms and their probabilities. Second, we apply the resulting models to the relevance feedback task, and see a better performance over the state-of-the-art methods. Third, we see that the estimation method is remarkably robust making the models in- sensitive to noisy non-relevant terms in feedback documents. Our general observation is that the significant words language models more accurately capture relevance by excluding general terms and feedback document specific terms.


Performance Engineering for Microservices: Research Challenges and Directions

Microservices complement approaches like DevOps and continuous delivery in terms of software architecture. Along with this architectural style, several important deployment technologies, such as container-based virtualization and container orchestration solutions, have emerged. These technologies allow to efficiently exploit cloud platforms, providing a high degree of scalability, availability, and portability for microservices.
 Despite the obvious importance of a sufficient level of performance, there is still a lack of performance engineering approaches explicitly taking into account the particularities of microservices. In this paper, we argue why new solutions to performance engineering for microservices are needed. Furthermore, we identify open issues and outline possible research directions with regard to performance-aware testing, monitoring, and modeling of microservices.


ABF + + : Fast and Robust Angle Based Flattening Temporary version-In print

Conformal parameterization of mesh models has numerous applications in geometry processing. Conformality is desirable for remeshing, surface reconstruction, and many other mesh processing applications. Subject to the conformality requirement, these applications typically bene t from parameterizations with smaller stretch. The Angle Based Flattening (ABF) method, presented a few years ago, generates provably valid conformal parameterizations with low stretch. However, it is quite time consuming and becomes error prone for large meshes due to numerical error accumulation. This work presents ABF++, a highly e cient extension of the ABF method that overcomes these drawbacks, while maintaining all the advantages of ABF. ABF++ robustly parameterizes meshes of hundreds of thousands and millions of triangles within minutes. It is based on two main components: (1) a new numerical solution technique that dramatically reduces the dimension of the linear systems solved at each iteration, speeding up the solution; (2) an e cient hierarchical solution technique. The speedup with (1) does not come at the expense of greater distortion. The hierarchical technique (2) enables parameterization of models with millions of faces in seconds, at the expense of a minor increase in parametric distortion. The parameterization computed by ABF++ are provably valid, i.e. they contain no ipped triangles. As a result of these extensions, the ABF++ method is extremely suitable for robustly and e ciently parameterizing models for geometry processing applications.


Steering with eyes closed: Mm-Wave beam steering without in-band measurement

Millimeter-wave communication achieves multi-Gbps data rates via highly directional beamforming to overcome pathloss and provide the desired SNR. Unfortunately, establishing communication with sufficiently narrow beamwidth to obtain the necessary link budget is a high overhead procedure in which the search space scales with device mobility and the product of the sender-receiver beam resolution. In this paper, we design, implement, and experimentally evaluate Blind Beam Steering (BBS) a novel architecture and algorithm that removes in-band overhead for directional mm-Wave link establishment. Our system architecture couples mm-Wave and legacy 2.4/5 GHz bands using out-of-band direction inference to establish (overhead-free) multi-Gbps mm-Wave communication. Further, BBS evaluates direction estimates retrieved from passively overheard 2.4/5 GHz frames to assure highest mm-Wave link quality on unobstructed direct paths. By removing in-band overhead, we leverage mm-Wave's very high throughput capabilities, beam-width scalability and provide robustness to mobility. We demonstrate that BBS achieves 97.8% accuracy estimating direction between pairing nodes using at least 5 detection band antennas. Further, BBS successfully detects unobstructed direct path conditions with an accuracy of 96.5% and reduces the IEEE 802.11ad beamforming training overhead by 81%.


Joint Resource Partitioning and Offloading in Heterogeneous Cellular Networks

In heterogeneous cellular networks (HCNs), it is desirable to offload mobile users to small cells, which are typically significantly less congested than the macrocells. To achieve sufficient load balancing, the offloaded users often have much lower SINR than they would on the macrocell. This SINR degradation can be partially alleviated through interference avoidance, for example time or frequency resource partitioning, whereby the macrocell turns off in some fraction of such resources. Naturally, the optimal offloading strategy is tightly coupled with resource partitioning; the optimal amount of which in turn depends on how many users have been offloaded. In this paper, we propose a general and tractable framework for modeling and analyzing joint resource partitioning and offloading in a two-tier cellular network. With it, we are able to derive the downlink rate distribution over the entire network, and an optimal strategy for joint resource partitioning and offloading. We show that load balancing, by itself, is insufficient, and resource partitioning is required in conjunction with offloading to improve the rate of cell edge users in co-channel heterogeneous networks.


IEEE 802.11ad: directional 60 GHz communication for multi-Gigabit-per-second Wi-Fi [Invited Paper]

With the ratification of the IEEE 802.11ad amendment to the 802.11 standard in December 2012, a major step has been taken to bring consumer wireless communication to the millimeter wave band. However, multi-gigabit-per-second throughput and small interference footprint come at the price of adverse signal propagation characteristics, and require a fundamental rethinking of Wi-Fi communication principles. This article describes the design assumptions taken into consideration for the IEEE 802.11ad standard and the novel techniques defined to overcome the challenges of mm-Wave communication. In particular, we study the transition from omnidirectional to highly directional communication and its impact on the design of IEEE 802.11ad.


Inter-Session Modeling for Session-Based Recommendation

In recent years, research has been done on applying Recurrent Neural Networks (RNNs) as recommender systems. Results have been promising, especially in the session-based setting where RNNs have been shown to outperform state-of-the-art models. In many of these experiments, the RNN could potentially improve the recommendations by utilizing information about the user's past sessions, in addition to its own interactions in the current session. A problem for session-based recommendation, is how to produce accurate recommendations at the start of a session, before the system has learned much about the user's current interests. We propose a novel approach that extends an RNN recommender to be able to process the user's recent sessions, in order to improve recommendations. This is done by using a second RNN to learn from recent sessions, and predict the user's interest in the current session. By feeding this information to the original RNN, it is able to improve its recommendations. Our experiments on two different datasets show that the proposed approach can significantly improve recommendations throughout the sessions, compared to a single RNN working only on the current session. The proposed model especially improves recommendations at the start of sessions, and is therefore able to deal with the cold start problem within sessions.


Mood and Emotions in Small Groups and Work Teams

Affective influences abound in groups. In this article we propose an organizing model for understanding these affective influences and their effects on group life. We begin with individuallevel affective characteristics that members bring to their groups: moods, emotions, sentiments, and emotional intelligence. These affective characteristics then combine to form a group’s affective composition. We discuss explicit and implicit processes through which this affective combination occurs by examining the research on emotional contagion, entrainment, modeling, and the manipulation of affect. We also explore how elements of the affective context, such as organizationwide emotion norms and the group’s particular emotional history, may serve to constrain or amplify group members’ emotions. The outcome, group emotion, results from the combination of the group’s affective composition and the affective context in which the group is behaving. Last, we focus on the important interaction between nonaffective factors and affective factors in group life and suggest a possible agenda for future research. q 2001 Academic Press


LoRea: A Backscatter Reader for Everyone!

Computational RFID (CRFID) platforms have enabled reconfigurable, battery-free applications for close to a decade. However, several factors have impeded their wide-spread adoption: low communication range, low throughput, and expensive infrastructure— CRFID readers usually cost upwards of $1000. This paper presents LoRea, a backscatter reader that achieves an order of magnitude higher range than existing CRFID readers, while costing a fraction of their price. LoRea achieves this by diverging from existing designs of CRFID readers and more specifically, how self-interference is tackled. LoRea builds on recent work that frequency-shifts backscatter transmissions away from the carrier signal to reduce selfinterference. LoRea also decouples the carrier generation from the reader, helping to further decrease self-interference. Decoupling carrier generation also enables the use of deployed infrastructure of smartphones and sensor nodes to provide the carrier signal. Together these methods reduce cost and complexity of the reader. LoRea also purposefully operates at lower bitrates than recent backscatter systems which enables high sensitivity and longer range. We evaluate LoRea experimentally and find that it achieves a communication range of up to 225 m in lineof-sight scenarios. In indoor environments, where the signal traverses several walls separating the reader and the backscatter tag, LoRea achieves a range of 30 m. These results illustrate how LoRea outperforms stateof-art backscatter systems and CRFID platforms.


Sensory integration dysfunction affects efficacy of speech therapy on children with functional articulation disorders

BACKGROUND
Articulation disorders in young children are due to defects occurring at a certain stage in sensory and motor development. Some children with functional articulation disorders may also have sensory integration dysfunction (SID). We hypothesized that speech therapy would be less efficacious in children with SID than in those without SID. Hence, the purpose of this study was to compare the efficacy of speech therapy in two groups of children with functional articulation disorders: those without and those with SID.

METHOD
A total of 30 young children with functional articulation disorders were divided into two groups, the no-SID group (15 children) and the SID group (15 children). The number of pronunciation mistakes was evaluated before and after speech therapy.

RESULTS
There were no statistically significant differences in age, sex, sibling order, education of parents, and pretest number of mistakes in pronunciation between the two groups (P > 0.05). The mean and standard deviation in the pre- and post-test number of mistakes in pronunciation were 10.5 ± 3.2 and 3.3 ± 3.3 in the no-SID group, and 10.1 ± 2.9 and 6.9 ± 3.5 in the SID group, respectively. Results showed great changes after speech therapy treatment (F = 70.393; P < 0.001) and interaction between the pre/post speech therapy treatment and groups (F = 11.119; P = 0.002).

CONCLUSIONS
Speech therapy can improve the articulation performance of children who have functional articulation disorders whether or not they have SID, but it results in significantly greater improvement in children without SID. SID may affect the treatment efficiency of speech therapy in young children with articulation disorders.


Membrane vesicles as conveyors of immune responses

In multicellular organisms, communication between cells mainly involves the secretion of proteins that then bind to receptors on neighbouring cells. But another mode of intercellular communication — the release of membrane vesicles — has recently become the subject of increasing interest. Membrane vesicles are complex structures composed of a lipid bilayer that contains transmembrane proteins and encloses soluble hydrophilic components derived from the cytosol of the donor cell. These vesicles have been shown to affect the physiology of neighbouring recipient cells in various ways, from inducing intracellular signalling following binding to receptors to conferring new properties after the acquisition of new receptors, enzymes or even genetic material from the vesicles. This Review focuses on the role of membrane vesicles, in particular exosomes, in the communication between immune cells, and between tumour and immune cells.


Global Fusion of Relative Motions for Robust, Accurate and Scalable Structure from Motion

Multi-view structure from motion (SfM) estimates the position and orientation of pictures in a common 3D coordinate frame. When views are treated incrementally, this external calibration can be subject to drift, contrary to global methods that distribute residual errors evenly. We propose a new global calibration approach based on the fusion of relative motions between image pairs. We improve an existing method for robustly computing global rotations. We present an efficient a contrario trifocal tensor estimation method, from which stable and precise translation directions can be extracted. We also define an efficient translation registration method that recovers accurate camera positions. These components are combined into an original SfM pipeline. Our experiments show that, on most datasets, it outperforms in accuracy other existing incremental and global pipelines. It also achieves strikingly good running times: it is about 20 times faster than the other global method we could compare to, and as fast as the best incremental method. More importantly, it features better scalability properties.


SquishedNets: Squishing SqueezeNet further for edge device scenarios via deep evolutionary synthesis

While deep neural networks have been shown in recent years to outperform other machine learning methods in a wide range of applications, one of the biggest challenges with enabling deep neural networks for widespread deployment on edge devices such as mobile and other consumer devices is high computational and memory requirements. Recently, there has been greater exploration into small deep neural network architectures that are more suitable for edge devices, with one of the most popular architectures being SqueezeNet, with an incredibly small model size of 4.8MB. Taking further advantage of the notion that many applications of machine learning on edge devices are often characterized by a low number of target classes, this study explores the utility of combining architectural modifications and an evolutionary synthesis strategy for synthesizing even smaller deep neural architectures based on the more recent SqueezeNet v1.1 macroarchitecture (considered state-of-the-art in efficient architectures) for applications with fewer target classes. In particular, architectural modifications are first made to SqueezeNet v1.1 to accommodate for a 10-class ImageNet-10 dataset, and then an evolutionary synthesis strategy is leveraged to synthesize more efficient deep neural networks based on this modified macroarchitecture. The resulting SquishedNets possess model sizes ranging from 2.4MB to 0.95MB (∼5.17X smaller than SqueezeNet v1.1, or 253X smaller than AlexNet). Furthermore, the SquishedNets are still able to achieve accuracies ranging from 81.2% to 77%, and able to process at speeds of 156 images/sec to as much as 256 images/sec on a Nvidia Jetson TX1 embedded chip. These preliminary results show that a combination of architectural modifications and an evolutionary synthesis strategy can be a useful tool for producing very small deep neural network architectures that are well-suited for edge device scenarios without the need for compression or quantization.


Towards the Next Generation of Tabletop Gaming Experiences

In this paper we present a novel hardware and software platform (STARS) to realize computer augmented tabletop games that unify the strengths of traditional board games and computer games. STARS game applications preserve the social situation of traditional board games and provide a tangible interface with physical playing pieces to facilitate natural interaction. The virtual game components offer exciting new opportunities for game design and provide richer gaming experiences impossible to realize with traditional media. This paper describes STARS in terms of the hardware setup and the software platform used to develop and play STARS games. The interaction design within STARS is discussed and sample games are presented with regard to their contributions to enhancing user experience. Finally, realworld experiences with the platform are reported.


Integrated feature selection and higher-order spatial feature extraction for object categorization

In computer vision, the bag-of-visual words image representation has been shown to yield good results. Recent work has shown that modeling the spatial relationship between visual words further improves performance. Previous work extracts higher-order spatial features exhaustively. However, these spatial features are expensive to compute. We propose a novel method that simultaneously performs feature selection and feature extraction. Higher-order spatial features are progressively extracted based on selected lower order ones, thereby avoiding exhaustive computation. The method can be based on any additive feature selection algorithm such as boosting. Experimental results show that the method is computationally much more efficient than previous approaches, without sacrificing accuracy.


A Comparison Among ARIMA, BP-NN, and MOGA-NN for Software Clone Evolution Prediction

Software evolution continues throughout the life cycle of the software. During the evolution of software system, it has been observed that the developers have a tendency to copy the modules completely or partially and modify them. This practice gives rise to identical or very similar code fragments called software clones. This paper examines the evolution of clone components by using advanced time series analysis. In the first phase, software clone components are extracted from the source repository of the software application by using the abstract syntax tree approach. Then, the evolution of software clone components is analyzed. In this paper, three models, Autoregressive Integrated Moving Average, back propagation neural network, and multi-objective genetic algorithm-based neural network, have been compared for the prediction of the evolution of software clone components. Evaluation is performed on the large open-source software application, ArgoUML. The ability to predict the clones helps the software developer to reduce the effort during software maintenance activities.


Automated detection of optic disc and blood vessel in retinal image using morphological, edge detection and feature extraction technique

Reliable, fast and efficient optic disc localization and blood-vessel detection are the primary tasks in computer analyses of retinal image. Most of the existing algorithms suffer due to inconsistent image contrast, varying individual condition, noises and computational complexity. This paper presents an algorithm to automatically detect landmark features of retinal image, such as optic disc and blood vessel. First, optic disc and blood vessel pixels are detected from blue plane of the image. Then, using OD location the vessel pixels are connected. The detection scheme utilizes basic operations like edge detection, binary thresholding and morphological operation. This method was evaluated on standard retinal image databases, such as STARE and DRIVE. Experimental results demonstrate that the high accuracy achieved by the proposed method is comparable to that reported by the most accurate methods in literature, alongside a substantial reduction of execution time. Thus the method may provide a reliable solution in automatic mass screening and diagnosis of the retinal diseases.


Linked data on the web (LDOW2008)

The Web is increasingly understood as a global information space consisting not just of linked documents, but also of Linked Data. More than just a vision, the resulting Web of Data has been brought into being by the maturing of the Semantic Web technology stack, and by the publication of an increasing number of datasets according to the principles of Linked Data.
 The Linked Data on the Web (LDOW2008) workshop brings together researchers and practitioners working on all aspects of Linked Data. The workshop provides a forum to present the state of the art in the field and to discuss ongoing and future research challenges. In this workshop summary we will outline the technical context in which Linked Data is situated, describe developments in the past year through initiatives such as the Linking Open Data community project, and look ahead to the workshop itself.


Spectrogram Enhancement Using Multiple Window Savitzky-Golay (MWSG) Filter for Robust Bird Sound Detection

Bird sound detection from real-field recordings is essential for identifying bird species in bioacoustic monitoring. Variations in the recording devices, environmental conditions, and the presence of vocalizations from other animals make the bird sound detection very challenging. In order to overcome these challenges, we propose an unsupervised algorithm comprising two main stages. In the first stage, a spectrogram enhancement technique is proposed using a multiple window Savitzky-Golay MWSG filter. We show that the spectrogram estimate using MWSG filter is unbiased and has lower variance compared with its single window counterpart. It is known that bird sounds are highly structured in the time-frequency T-F plane. We exploit these cues of prominence of T-F activity in specific directions from the enhanced spectrogram, in the second stage of the proposed method, for bird sound detection. In this regard, we use a set of four moving average filters that when applied to the enhanced spectrogram, yield directional spectrograms that capture the direction specific information. We propose a thresholding scheme on the time varying energy profile computed from each of these directional spectrograms to obtain frame-level binary decisions of bird sound activity. These individual decisions are then combined to obtain the final decision. Experiments are performed with three different datasets, with varying recording and noise conditions. Frame level F-score is used as the evaluation metric for bird sound detection. We find that the proposed method, on average, achieves higher F-score $10.24\%$ relative compared to the best of the six baseline schemes considered in this work.


A fast and efficient python library for interfacing with the Biological Magnetic Resonance Data Bank

The Biological Magnetic Resonance Data Bank (BMRB) is a public repository of Nuclear Magnetic Resonance (NMR) spectroscopic data of biological macromolecules. It is an important resource for many researchers using NMR to study structural, biophysical, and biochemical properties of biological macromolecules. It is primarily maintained and accessed in a flat file ASCII format known as NMR-STAR. While the format is human readable, the size of most BMRB entries makes computer readability and explicit representation a practical requirement for almost any rigorous systematic analysis. To aid in the use of this public resource, we have developed a package called nmrstarlib in the popular open-source programming language Python. The nmrstarlib’s implementation is very efficient, both in design and execution. The library has facilities for reading and writing both NMR-STAR version 2.1 and 3.1 formatted files, parsing them into usable Python dictionary- and list-based data structures, making access and manipulation of the experimental data very natural within Python programs (i.e. “saveframe” and “loop” records represented as individual Python dictionary data structures). Another major advantage of this design is that data stored in original NMR-STAR can be easily converted into its equivalent JavaScript Object Notation (JSON) format, a lightweight data interchange format, facilitating data access and manipulation using Python and any other programming language that implements a JSON parser/generator (i.e., all popular programming languages). We have also developed tools to visualize assigned chemical shift values and to convert between NMR-STAR and JSONized NMR-STAR formatted files. Full API Reference Documentation, User Guide and Tutorial with code examples are also available. We have tested this new library on all current BMRB entries: 100% of all entries are parsed without any errors for both NMR-STAR version 2.1 and version 3.1 formatted files. We also compared our software to three currently available Python libraries for parsing NMR-STAR formatted files: PyStarLib, NMRPyStar, and PyNMRSTAR. The nmrstarlib package is a simple, fast, and efficient library for accessing data from the BMRB. The library provides an intuitive dictionary-based interface with which Python programs can read, edit, and write NMR-STAR formatted files and their equivalent JSONized NMR-STAR files. The nmrstarlib package can be used as a library for accessing and manipulating data stored in NMR-STAR files and as a command-line tool to convert from NMR-STAR file format into its equivalent JSON file format and vice versa, and to visualize chemical shift values. Furthermore, the nmrstarlib implementation provides a guide for effectively JSONizing other older scientific formats, improving the FAIRness of data in these formats.


Bibliometric information retrieval system (BIRS): A web search interface utilizing bibliometric research results

The aim of this article is to test whether the results obtained from a specific bibliographic research can be applied to a real search environment and enhance the level of utility of an information retrieval session for all levels of end users. In this respect, a Web-based Bibliometric Information Retrieval System (BIRS) has been designed and created, with facilities to assist the end users to get better understanding of their search domain, formulate and expand their search queries, and visualize the bibliographic research results. There are three specific features in the system design of the BIRS: the information visualization feature of the BIRS (cocitation maps) to guide the end users to identify the important research groups and capture the detailed information about the intellectual structure of the search domain; the multilevel browsing feature to allow the end users to go to different levels of interesting topics; and the common user interface feature to enable the end users to search all kinds of databases regardless of different searching systems, different working platforms, different database producer and supplier, such as different Web search engines, different library OPACs, or different on-line databases. A preliminary user evaluation study of BIRS revealed that users generally found it easy to form and expand their queries, and that BIRS helped them acquire useful background information about the search domain. They also pointed out aspects of information visualization, multilevel browsing, and common user interface as novel characteristics exhibited by BIRS.


Elementary Siphons of Petri Nets and Deadlock Control in FMS

For responsiveness, in the Petri nets theory framework deadlock prevention policies based elementary siphons control are often utilized to deal with deadlocks caused by the sharing of resources in flexible manufacturing system (FMS) which is developing the theory of efficient strict minimal siphons of an S3PR. Analyzer of Petri net models and their P-invariant analysis, and deadlock control are presented as tools for modelling, efficiency structure analysis, control, and investigation of the FMSs when different policies can be implemented for the deadlock prevention. We are to show an effective deadlock prevention policy of a special class of Petri nets namely elementary siphons. As well, both structural analysis and reachability graph analysis and simulation are used for analysis and control of Petri nets. This work is successfully applied Petri nets to deadlock analysis using the concept of elementary siphons, for design of supervisors of some supervisory control problems of FMS and simulation of Petri net tool with MATLAB.


Omega-3 Fatty Acids and Inflammatory Processes

Long chain fatty acids influence inflammation through a variety of mechanisms; many of these are mediated by, or at least associated with, changes in fatty acid composition of cell membranes. Changes in these compositions can modify membrane fluidity, cell signaling leading to altered gene expression, and the pattern of lipid mediator production. Cell involved in the inflammatory response are typically rich in the n-6 fatty acid arachidonic acid, but the contents of arachidonic acid and of the n-3 fatty acids eicosapentaenoic acid (EPA) and docosahexaenoic acid (DHA) can be altered through oral administration of EPA and DHA. Eicosanoids produced from arachidonic acid have roles in inflammation. EPA also gives rise to eicosanoids and these often have differing properties from those of arachidonic acid-derived eicosanoids. EPA and DHA give rise to newly discovered resolvins which are anti-inflammatory and inflammation resolving. Increased membrane content of EPA and DHA (and decreased arachidonic acid content) results in a changed pattern of production of eicosanoids and resolvins. Changing the fatty acid composition of cells involved in the inflammatory response also affects production of peptide mediators of inflammation (adhesion molecules, cytokines etc.). Thus, the fatty acid composition of cells involved in the inflammatory response influences their function; the contents of arachidonic acid, EPA and DHA appear to be especially important. The anti-inflammatory effects of marine n-3 PUFAs suggest that they may be useful as therapeutic agents in disorders with an inflammatory component.


Impact of mosquito gene drive on malaria elimination in a computational model with explicit spatial and temporal dynamics.

The renewed effort to eliminate malaria and permanently remove its tremendous burden highlights questions of what combination of tools would be sufficient in various settings and what new tools need to be developed. Gene drive mosquitoes constitute a promising set of tools, with multiple different possible approaches including population replacement with introduced genes limiting malaria transmission, driving-Y chromosomes to collapse a mosquito population, and gene drive disrupting a fertility gene and thereby achieving population suppression or collapse. Each of these approaches has had recent success and advances under laboratory conditions, raising the urgency for understanding how each could be deployed in the real world and the potential impacts of each. New analyses are needed as existing models of gene drive primarily focus on nonseasonal or nonspatial dynamics. We use a mechanistic, spatially explicit, stochastic, individual-based mathematical model to simulate each gene drive approach in a variety of sub-Saharan African settings. Each approach exhibits a broad region of gene construct parameter space with successful elimination of malaria transmission due to the targeted vector species. The introduction of realistic seasonality in vector population dynamics facilitates gene drive success compared with nonseasonal analyses. Spatial simulations illustrate constraints on release timing, frequency, and spatial density in the most challenging settings for construct success. Within its parameter space for success, each gene drive approach provides a tool for malaria elimination unlike anything presently available. Provided potential barriers to success are surmounted, each achieves high efficacy at reducing transmission potential and lower delivery requirements in logistically challenged settings.


Accurate design of corrugated waveguide low-pass filters using exclusively closed-form expressions

A simple, quasi-analytical, and accurate method to design classical corrugated rectangular waveguide low-pass filters is presented in this paper. Unlike in other published techniques, the dimensions of the final filter are directly obtained in a quasi-analytical manner following exclusively closed-form expressions and, in particular, using neither electromagnetic simulation nor optimization. Thus, our method is amenable to be implemented using an off-the-shelf mathematical software tool such as Matlab. The proposed method is based on the synthesis of the heights and lengths of the final structure taking into account the shunt capacitance effect (produced by the excitation of higher-order modes at the height steps) over the magnitude and phase of the local reflection coefficients. The novel method has been validated with the design of a classical Chebyshev corrugated low-pass filter of order 31, which shows a remarkable accordance between the ideal and simulated frequency responses.


Fast and Scalable Bayesian Deep Learning by Weight-Perturbation in Adam

Uncertainty computation in deep learning is essential to design robust and reliable systems. Variational inference (VI) is a promising approach for such computation, but requires more effort to implement and execute compared to maximumlikelihood methods. In this paper, we propose new natural-gradient algorithms to reduce such efforts for Gaussian mean-field VI. Our algorithms can be implemented within the Adam optimizer by perturbing the network weights during gradient evaluations, and uncertainty estimates can be cheaply obtained by using the vector that adapts the learning rate. This requires lower memory, computation, and implementation effort than existing VI methods, while obtaining uncertainty estimates of comparable quality. Our empirical results confirm this and further suggest that the weight-perturbation in our algorithm could be useful for exploration in reinforcement learning and stochastic optimization.


Mid-term electricity price forecasting using SVM

In the modern electricity market, it is very significant to have a precise electricity price forecasting in medium term time horizon. There are few studies done concentrating on the medium term forecasting of the electricity price. Medium term time horizon of electricity price forecasting is very useful and of great importance. It has many applications such as future maintenance scheduling of the power plants, risk management, plan future contracts, purchasing raw materials and determine the market pricing. To forecast the electricity price, some factors are very important, such as choosing the most useful price features that influence the market price, and choosing the proper prediction model that is able to predict the price variations behavior using the historical data. The proposed SVM method and the other employed methods are evaluated using the data from the New England ISO which are published at their official website.


Autonomous Intersection Management For Semi-Autonomous Vehicles

Recent advances in autonomous vehicle technology will open the door to highly efficient transportation systems in the future, as demonstrated by Autonomous Intersection Management, an intersection control protocol designed for fully autonomous vehicles. We, however, anticipate there will be a long transition period during which most vehicles have some but not all capabilities of fully autonomous vehicles. This chapter introduces a new protocol called Semi-Autonomous Intersection Management, which allows vehicles with partiallyautonomous features such as adaptive cruise control to enter an intersection from different directions simultaneously. Our experiments show that this protocol can greatly decrease traffic delay when most vehicles are semi-autonomous. Our incremental deployment study reveals that traffic delay keeps decreasing as more and more vehicles employ features of autonomy.


SQL injection detection and prevention techniques

As the use of internet is increasing rapidly, the attacks on web applications are also increasing as well. Nowadays SQL injection attack is a major issue of web applications. It allows unrestricted access to the database. The successful execution of SQL injection leads to a loss of integrity and confidentiality. In this paper, a review of different types of SQL injection attacks, their detection and prevention techniques are presented. This paper will help the researchers decide the technique of interest for further studies.


Autonomous Driving in Urban Environments: Boss and the Urban Challenge

Chris Urmson, Joshua Anhalt, Drew Bagnell, Christopher Baker, Robert Bittner, M. N. Clark, John Dolan, Dave Duggins, Tugrul Galatali, Chris Geyer, Michele Gittleman, Sam Harbaugh, Martial Hebert, Thomas M. Howard, Sascha Kolski, Alonzo Kelly, Maxim Likhachev, Matt McNaughton, Nick Miller, Kevin Peterson, Brian Pilnick, Raj Rajkumar, Paul Rybski, Bryan Salesky, Young-Woo Seo, Sanjiv Singh, Jarrod Snider, Anthony Stentz, William “Red” Whittaker, Ziv Wolkowicki, and Jason Ziglar Carnegie Mellon University Pittsburgh, Pennsylvania 15213 e-mail: curmson@ri.cmu.edu


Maneuver-Based Trajectory Planning for Highly Autonomous Vehicles on Real Road With Traffic and Driver Interaction

This paper presents the design and first test on a simulator of a vehicle trajectory-planning algorithm that adapts to traffic on a lane-structured infrastructure such as highways. The proposed algorithm is designed to run on a fail-safe embedded environment with low computational power, such as an engine control unit, to be implementable in commercial vehicles of the near future. The target platform has a clock frequency of less than 150 MHz, 150 kB RAM of memory, and a 3-MB program memory. The trajectory planning is performed by a two-step algorithm. The first step defines the feasible maneuvers with respect to the environment, aiming at minimizing the risk of a collision. The output of this step is a target group of maneuvers in the longitudinal direction (accelerating or decelerating), in the lateral direction (changing lanes), and in the combination of both directions. The second step is a more detailed evaluation of several possible trajectories within these maneuvers. The trajectories are optimized to additional performance indicators such as travel time, traffic rules, consumption, and comfort. The output of this module is a trajectory in the vehicle frame that represents the recommended vehicle state (position, heading, speed, and acceleration) for the following seconds.


Model-Based Probabilistic Collision Detection in Autonomous Driving

The safety of the planned paths of autonomous cars with respect to the movement of other traffic participants is considered. Therefore, the stochastic occupancy of the road by other vehicles is predicted. The prediction considers uncertainties originating from the measurements and the possible behaviors of other traffic participants. In addition, the interaction of traffic participants, as well as the limitation of driving maneuvers due to the road geometry, is considered. The result of the presented approach is the probability of a crash for a specific trajectory of the autonomous car. The presented approach is efficient as most of the intensive computations are performed offline, which results in a lean online algorithm for real-time application.


Junior: The Stanford entry in the Urban Challenge


Digital color halftoning with generalized error diffusion and multichannel green-noise masks

In this paper, we introduce two novel techniques for digital color halftoning with green-noise--stochastic dither patterns generated by homogeneously distributing minority pixel clusters. The first technique employs error diffusion with output-dependent feedback where, unlike monochrome image halftoning, an interference term is added such that the overlapping of pixels of different colors can be regulated for increased color control. The second technique uses a green-noise mask, a dither array designed to create green-noise halftone patterns, which has been constructed to also regulate the overlapping of different colored pixels. As is the case with monochrome image halftoning, both techniques are tunable, allowing for large clusters in printers with high dot-gain characteristics, and small clusters in printers with low dot-gain characteristics.


Marrying Uncertainty and Time in Knowledge Graphs

The management of uncertainty is crucial when harvesting structured content from unstructured and noisy sources. Knowledge Graphs (KGs) are a prominent example. KGs maintain both numerical and non-numerical facts, with the support of an underlying schema. These facts are usually accompanied by a confidence score that witnesses how likely is for them to hold. Despite their popularity, most of existing KGs focus on static data thus impeding the availability of timewise knowledge. What is missing is a comprehensive solution for the management of uncertain and temporal data in KGs. The goal of this paper is to fill this gap. We rely on two main ingredients. The first is a numerical extension of Markov Logic Networks (MLNs) that provide the necessary underpinning to formalize the syntax and semantics of uncertain temporal KGs. The second is a set of Datalog constraints with inequalities that extend the underlying schema of the KGs and help to detect inconsistencies. From a theoretical point of view, we discuss the complexity of two important classes of queries for uncertain temporal KGs: maximum a-posteriori and conditional probability inference. Due to the hardness of these problems and the fact that MLN solvers do not scale well, we also explore the usage of Probabilistic Soft Logics (PSL) as a practical tool to support our reasoning tasks. We report on an experimental evaluation comparing the MLN and PSL approaches.


Business Models : A Discovery Driven Approach

The business model concept offers strategists a fresh way to consider their options in uncertain, fast-moving and unpredictable environments. In contrast to conventional assumptions, recognizing that more new business models are both feasible and actionable than ever before is creating unprecedented opportunities for today’s organizations. However, unlike conventional strategies that emphasize analysis, strategies that aim to discover and exploit new models must engage in significant experimentation and learning e a ‘discovery driven,’ rather than analytical approach.


A Wideband Differential-Fed Slot Antenna Using Integrated Compact Balun With Matching Capability

This communication proposes a wideband differential-fed slot antenna that works in its dominant mode ( λ/2 mode). The antenna has a near omnidirectional radiation pattern with vertical polarization, which is designed for near-ground wireless sensor node applications. A compact integrated T-slot balun and a loop to T-slot feeding structure are introduced to realize the differential feeding; the bandwidth is expanded to 30.7% (2.2 GHz-3.0 GHz) with a 3.8 dB peak gain. A detailed matching method without using lumped elements is proposed, which can be applied to various types of RFIC chips. A prototype is built and measured. Its differential impedance, antenna patterns, and gain are consistent with the simulation results.


Cross-Point Resistive RAM Based on Field-Assisted Superlinear Threshold Selector

We report a 3-D-stackable 1S1R passive cross-point resistive random access memory (RRAM). The sneak (leakage) current challenge in the cross-point RRAM integration has been overcome utilizing a field-assisted superlinear threshold selector. The selector offers high selectivity of >107, sharp switching slope of <;5 mV/decade, ability to tune the threshold voltage, stable operation at 125°C, and endurance of >1011. Furthermore, we demonstrate 1S1R integration in which the selector-subthreshold current is <;10 pA while offering >102 memory ON/OFF ratio and >106 selectivity during cycling. Combined with self-current-controlled RRAM, the 1S1R enables high-density and high-performance memory applications.


Augmented reality-based exergames for rehabilitation

Rehabilitation for stroke afflicted patients, through exercises tailored for individual needs, aims at relearning basic motor skills, especially in the extremities. Rehabilitation through Augmented Reality (AR) based games engage and motivate patients to perform exercises which, otherwise, maybe boring and monotonic. Also, mirror therapy allows users to observe one's own movements in the game providing them with good visual feedback. This paper presents an augmented reality based system for rehabilitation by playing four interactive, cognitive and fun Exergames (exercise and gaming).
 The system uses low-cost RGB-D cameras such as Microsoft Kinect V2 to capture and generate 3D model of the person by extracting him/her from the entire captured data and immersing it in different interactive virtual environments. Animation based limb movement enhancement along with cognitive aspects incorporated in the game can help in positive reinforcement, progressive challenges and motion improvement. Recording module of the toolkit allows future reference and facilitates feedback from the physician. 10 able-bodied users, 2 psychological experts and 2 Physical Medicine and Rehabilitation physicians evaluated the user experience and usability aspects of the exergames. Results obtained shows the games to be fun and realistic, and at the same time engaging and motivating for performing exercises.


Commonsense Reasoning in and Over Natural Language

ConceptNet is a very large semantic network of commonsense knowledge suitable for making various kinds of practical inferences over text. ConceptNet captures a wide range of commonsense concepts and relations like those in Cyc, while its simple semantic network structure lends it an ease-of-use comparable to WordNet. To meet the dual challenge of having to encode complex higher-order concepts, and maintaining ease-of-use, we introduce a novel use of semi-structured natural language fragments as the knowledge representation of commonsense concepts. In this paper, we present a methodology for reasoning flexibly about these semi-structured natural language fragments. We also examine the tradeoffs associated with representing commonsense knowledge in formal logic versus in natural language. We conclude that the flexibility of natural language makes it a highly suitable representation for achieving practical inferences over text, such as context finding, inference chaining, and conceptual analogy. 1 What is ConceptNet? ConceptNet (www.conceptnet.org) is the largest freely available, machine-useable commonsense resource. Structured as a network of semi-structured natural language fragments, ConceptNet presently consists of over 250,000 elements of commonsense knowledge. We were inspired dually by the range of commonsense concepts and relations in Cyc (Lenat, 1995), and by the ease-of-use of WordNet (Fellbaum, 1998), and hoped to combine the best of both worlds. As a result, we adopted the semantic network representation of WordNet, but extended the representation in several key ways. First, we extended WordNet’s lexical notion of nodes to a conceptual notion of nodes, but we kept the nodes in natural language, because one of the primary strengths of WordNet in the textual domain is that its knowledge representation is itself textual. ConceptNet’s nodes are thus natural language fragments which are semi-structured according to an ontology of allowable syntactic patterns, and accommodate both first-order concepts given as noun phrases (e.g. “potato chips”), and second-order concepts given as verb phrases (e.g. “buy potato chips”). Second, we extended WordNet’s small ontology of semantic relations, which are primarily taxonomic in nature, to include a richer set of relations appropriate to concept-level nodes. At present there are 19 semantic relations used in ConceptNet, representing categories of, inter alia, temporal, spatial, causal, and functional knowledge. By combining higher order nodes with this relational ontology, it is possible to represent richer kinds of knowledge in ConceptNet beyond what can be represented in WordNet (Fig 1.). For example, we can represent a layman’s common sense observation that “you may be hurt if you get into an accident” in ConceptNet as EffectOf(“get into accident”, “be hurt”). Note that because the knowledge representation is semi-structured natural language, there are often various ways to represent the same knowledge. This is a source of ambiguity, but as we will argue in this paper, maintaining some ambiguity lends us greater flexibility for reasoning.


Who falls for phish?: a demographic analysis of phishing susceptibility and effectiveness of interventions

In this paper we present the results of a roleplay survey instrument administered to 1001 online survey respondents to study both the relationship between demographics and phishing susceptibility and the effectiveness of several anti-phishing educational materials. Our results suggest that women are more susceptible than men to phishing and participants between the ages of 18 and 25 are more susceptible to phishing than other age groups. We explain these demographic factors through a mediation analysis. Educational materials reduced users' tendency to enter information into phishing webpages by 40% percent; however, some of the educational materials we tested also slightly decreased participants' tendency to click on legitimate links.


An Ensemble-of-Classifiers Based Approach for Early Diagnosis of Alzheimer's Disease: Classification Using Structural Features of Brain Images

Structural brain imaging is playing a vital role in identification of changes that occur in brain associated with Alzheimer's disease. This paper proposes an automated image processing based approach for the identification of AD from MRI of the brain. The proposed approach is novel in a sense that it has higher specificity/accuracy values despite the use of smaller feature set as compared to existing approaches. Moreover, the proposed approach is capable of identifying AD patients in early stages. The dataset selected consists of 85 age and gender matched individuals from OASIS database. The features selected are volume of GM, WM, and CSF and size of hippocampus. Three different classification models (SVM, MLP, and J48) are used for identification of patients and controls. In addition, an ensemble of classifiers, based on majority voting, is adopted to overcome the error caused by an independent base classifier. Ten-fold cross validation strategy is applied for the evaluation of our scheme. Moreover, to evaluate the performance of proposed approach, individual features and combination of features are fed to individual classifiers and ensemble based classifier. Using size of left hippocampus as feature, the accuracy achieved with ensemble of classifiers is 93.75%, with 100% specificity and 87.5% sensitivity.


Family issues in child anxiety: attachment, family functioning, parental rearing and beliefs.

Family studies have found a large overlap between anxiety disorders in family members. In addition to genetic heritability, a range of family factors may also be involved in the intergenerational transmission of anxiety. Evidence for a relationship between family factors and childhood as well as parental anxiety is reviewed. Four groups of family variables are considered: (I) attachment; (II), aspects of family functioning, such as marital conflict, co-parenting, functioning of the family as a whole, and sibling relationships; (III) parental rearing strategies; and (IV) beliefs that parents hold about their child. The reviewed literature provides evidence for an association between each of these family factors and child anxiety. However, there is little evidence as yet that identified family factors are specific to child anxiety, rather than to child psychopathology in general. Moreover, evidence for a relationship between child anxiety and family factors is predominantly cross-sectional. Therefore, whether the identified family factors cause childhood anxiety still needs to be investigated. Further research that investigates mechanisms mediating the relationship between family factors and child anxiety is also called for. Finally, parental beliefs are identified as important predictors of parental behaviour that have largely not been investigated in relation to child anxiety disorders.


Computer Architecture with Associative Processor Replacing Last-Level Cache and SIMD Accelerator

This study presents a computer architecture, where a last-level cache and a SIMD accelerator are replaced by an associative processor. Associative processor combines data storage and data processing, and functions as a massively parallel SIMD processor and a memory at the same time. An analytic performance model of this computer architecture is introduced. Comparative analysis supported by cycle-accurate simulation and emulation shows that this architecture may outperform a conventional computer architecture comprising a SIMD coprocessor and a shared last-level cache while consuming less power.


Improved image-based classification of Alzheimer ’ s disease using multimodality brain imaging data

Purpose Amyloid-PET is an accurate marker of Alzheimer's disease. However, this technique is invasive and not widely available. Here we investigated whether other neuroimaging techniques can yield similar diagnostic accuracy as PET imaging. This proof of concept study presents two approaches of analyzing multi-modality combinations of metabolic, functional and anatomical brain imaging data using kernel-based pattern recognition techniques. Methods Input images were taken from a systematically collected database of previous studies. Data included [ 18 F]FDG-PET, rs-fMRI and structural MR data of 15 controls and 25 AD patients. [ 11 C]PIB was used as reference test for classification of AD using imaging data. From rs-fMRI data, both eigenvector centrality (EC) images and default mode network (DMN) regression maps were calculated. Structural MR data was used to create gray matter (GM) maps. Intermediate results were combined and analyzed with two types of existing pattern classification software; 1) using spatial concatenation of voxel data and, 2) a regional multi-kernel approach.


What to expect from teleconferencing.

Like other marvels of the electronic age, teleconferencing has been both oversold and underused. Though it has many potential uses, what managers know, or think they know, about it is generally based on misconceptions. Rather than relying only on vendors of teleconferencing, potential purchasers should first decide what their communication needs are, then choose the system that suits them best. These authors explain the new teleconferencing options and give guidelines for adapting them to a particular company.


Exploring motivations for contributing to open source initiatives: The roles of contribution context and personal values

We explore contextual and dispositional correlates of the motivation to contribute to open source initiatives. We examine how the context of the open source project, and the personal values of contributors, are related to the types of motivations for contributing. A web-based survey was administered to 300 contributors in two prominent open source contexts: software and content. As hypothesized, software contributors placed a greater emphasis on reputation-gaining and self-development motivations, compared with content contributors, who placed a greater emphasis on altruistic motives. Furthermore, the hypothesized relationships were found between contributors’ personal values and their motivations for contributing. 2007 Elsevier Ltd. All rights reserved.


On the cognitive process of human problem solving

One of the fundamental human cognitive processes is problem solving. As a higher-layer cognitive process, problem solving interacts with many other cognitive processes such as abstraction, searching, learning, decision making, inference, analysis, and synthesis on the basis of internal knowledge representation by the object–attribute-relation (OAR) model. Problem solving is a cognitive process of the brain that searches a solution for a given problem or finds a path to reach a given goal. When a problem object is identified, problem solving can be perceived as a search process in the memory space for finding a relationship between a set of solution goals and a set of alternative paths. This paper presents both a cognitive model and a mathematical model of the problem solving process. The cognitive structures of the brain and the mechanisms of internal knowledge representation behind the cognitive process of problem solving are explained. The cognitive process is formally described using real-time process algebra (RTPA) and concept algebra. This work is a part of the cognitive computing project that designed to reveal and simulate the fundamental mechanisms and processes of the brain according to Wang’s layered reference model of the brain (LRMB), which is expected to lead to the development of future generation methodologies for cognitive computing and novel cognitive computers that are capable of think, learn, and perceive. 2008 Published by Elsevier B.V.


Move Evaluation in Go Using Deep Convolutional Neural Networks

The game of Go is more challenging than other board games, due to the difficulty of constructing a position or move evaluation function. In this paper we investigate whether deep convolutional networks can be used to directly represent and learn this knowledge. We train a large 12-layer convolutional neural network by supervised learning from a database of human professional games. The network correctly predicts the expert move in 55% of positions, equalling the accuracy of a 6 dan human player. When the trained convolutional network was used directly to play games of Go, without any search, it beat the traditional-search program GnuGo in 97% of games, and matched the performance of a state-of-the-art Monte-Carlo tree search that simulates two million positions per move.


Summarizability in OLAP and Statistical Data Bases

Summarizability of OLAP and Statistical Databases is an a extremely important property because violating this condition can lead to erroneous conclusions and decisions. In this paper we explore the conditions for summarizability. We introduce a framework for specifying precisely the context in which statistical objects are defined. We use a three step process to define normalized statistical objects. Using this framework, we identify three necessary conditions for summarizability. We provided specific tests for each of the conditions that can be verified either from semantic knowledge, or by checking the statistical database itself. We also provide the reasoning for our belief that these three summarizability conditions are sufficient as well.


Andromeda: Performance, Isolation, and Velocity at Scale in Cloud Network Virtualization

This paper presents our design and experience with Andromeda, Google Cloud Platform’s network virtualization stack. Our production deployment poses several challenging requirements, including performance isolation among customer virtual networks, scalability, rapid provisioning of large numbers of virtual hosts, bandwidth and latency largely indistinguishable from the underlying hardware, and high feature velocity combined with high availability. Andromeda is designed around a flexible hierarchy of flow processing paths. Flows are mapped to a programming path dynamically based on feature and performance requirements. We introduce the Hoverboard programming model, which uses gateways for the long tail of low bandwidth flows, and enables the control plane to program network connectivity for tens of thousands of VMs in seconds. The on-host dataplane is based around a highperformance OS bypass software packet processing path. CPU-intensive per packet operations with higher latency targets are executed on coprocessor threads. This architecture allows Andromeda to decouple feature growth from fast path performance, as many features can be implemented solely on the coprocessor path. We demonstrate that the Andromeda datapath achieves performance that is competitive with hardware while maintaining the flexibility and velocity of a software-based architecture.


Microwave antenna applications of metasurfaces

This paper reviews the past and current research progress in microwave antenna applications using 2D planar metamaterials or metasurfaces. Firstly, we revisit the definitions of metamaterial and metasurface, and the applications of the ultra-thin metasurfaces for low-profile printed antennas in microwave frequency regime, for the purposes of size reduction and performance enhancement. Then we summarize the different types of metasurfaces and their applications. Finally, we provide the future lookout into microwave antenna and EM related applications using metasurfaces.


A Modified Node2vec Method for Disappearing Link Prediction

Disappearing link prediction aims to predict the possibility of the links disappearing in the future. This paper describes the disappearing link prediction problem in scientific collaboration networks based on network embedding. We propose a novel network embedding method called TDL2vec, which is an extension of node2vec algorithm. TDL2vec generates the link embdeddings considering with the time factor. In this paper, the disappearing link prediction problem is considered as a binary classification problem, and support vector machine (SVM) is used as the classifier after link embedding. To evaluate the performance in disappearing link prediction, this paper tests the proposed method and several baseline methods on a real-world network. The experimental results show that TDL2vec achieves better performance than other baselines.


EdgeConnect: Generative Image Inpainting with Adversarial Edge Learning

Over the last few years, deep learning techniques have yielded significant improvements in image inpainting. However, many of these techniques fail to reconstruct reasonable structures as they are commonly over-smoothed and/or blurry. This paper develops a new approach for image inpainting that does a better job of reproducing filled regions exhibiting fine details. We propose a two-stage adversarial model EdgeConnect that comprises of an edge generator followed by an image completion network. The edge generator hallucinates edges of the missing region (both regular and irregular) of the image, and the image completion network fills in the missing regions using hallucinated edges as a priori. We evaluate our model end-to-end over the publicly available datasets CelebA, Places2, and Paris StreetView, and show that it outperforms current state-ofthe-art techniques quantitatively and qualitatively.


Learning Temporal Transformations From Time-Lapse Videos

Based on life-long observations of physical, chemical, and biologic phenomena in the natural world, humans can often easily picture in their minds what an object will look like in the future. But, what about computers? In this paper, we learn computational models of object transformations from time-lapse videos. In particular, we explore the use of generative models to create depictions of objects at future times. These models explore several different prediction tasks: generating a future state given a single depiction of an object, generating a future state given two depictions of an object at different times, and generating future states recursively in a recurrent framework. We provide both qualitative and quantitative evaluations of the generated results, and also conduct a human evaluation to compare variations of our models.


Large-Scale Training of Shadow Detectors with Noisily-Annotated Shadow Examples

This paper introduces training of shadow detectors under the large-scale dataset paradigm. This was previously impossible due to the high cost of precise shadow annotation. Instead, we advocate the use of quickly but imperfectly labeled images. Our novel label recovery method automatically corrects a portion of the erroneous annotations such that the trained classifiers perform at state-of-the-art level. We apply our method to improve the accuracy of the labels of a new dataset that is 20 times larger than existing datasets and contains a large variety of scenes and image types. Naturally, such a large dataset is appropriate for training deep learning methods. Thus, we propose a semantic-aware patch level Convolutional Neural Network architecture that efficiently trains on patch level shadow examples while incorporating image level semantic information. This means that the detected shadow patches are refined based on image semantics. Our proposed pipeline can be a useful baseline for future advances in shadow detection.


Semantic Segmentation using Adversarial Networks

Adversarial training has been shown to produce state of the art results for generative image modeling. In this paper we propose an adversarial training approach to train semantic segmentation models. We train a convolutional semantic segmentation network along with an adversarial network that discriminates segmentation maps coming either from the ground truth or from the segmentation network. The motivation for our approach is that it can detect and correct higher-order inconsistencies between ground truth segmentation maps and the ones produced by the segmentation net. Our experiments show that our adversarial training approach leads to improved accuracy on the Stanford Background and PASCAL VOC 2012 datasets.


Exploring Time-Sensitive Variational Bayesian Inference LDA for Social Media Data

There is considerable interest among both researchers and the mass public in understanding the topics of discussion on social media as they occur over time. Scholars have thoroughly analysed samplingbased topic modelling approaches for various text corpora including social media; however, another LDA topic modelling implementation— Variational Bayesian (VB)—has not been well studied, despite its known e ciency and its adaptability to the volume and dynamics of social media data. In this paper, we examine the performance of the VB-based topic modelling approach for producing coherent topics, and further, we extend the VB approach by proposing a novel time-sensitive Variational Bayesian implementation, denoted as TVB. Our newly proposed TVB approach incorporates time so as to increase the quality of the generated topics. Using a Twitter dataset covering 8 events, our empirical results show that the coherence of the topics in our TVB model is improved by the integration of time. In particular, through a user study, we find that our TVB approach generates less mixed topics than state-of-the-art topic modelling approaches. Moreover, our proposed TVB approach can more accurately estimate topical trends, making it particularly suitable to assist end-users in tracking emerging topics on social media.


The effect of experimental presentation of thin media images on body satisfaction: a meta-analytic review.

OBJECTIVE
The effect of experimental manipulations of the thin beauty ideal, as portrayed in the mass media, on female body image was evaluated using meta-analysis.

METHOD
Data from 25 studies (43 effect sizes) were used to examine the main effect of mass media images of the slender ideal, as well as the moderating effects of pre-existing body image problems, the age of the participants, the number of stimulus presentations, and the type of research design.

RESULTS
Body image was significantly more negative after viewing thin media images than after viewing images of either average size models, plus size models, or inanimate objects. This effect was stronger for between-subjects designs, participants less than 19 years of age, and for participants who are vulnerable to activation of a thinness schema.

CONCLUSION
Results support the sociocultural perspective that mass media promulgate a slender ideal that elicits body dissatisfaction. Implications for prevention and research on social comparison processes are considered.


Motivated recruitment of autobiographical memories.

We hypothesized that people motivated to believe that they possess a given trait search for autobiographical memories that reflect that trait, so as to justify their desired self-view. We led subjects to believe that either extraversion or introversion was desirable, and obtained convergent evidence from open-ended memory-listing tasks as well as from reaction-time tasks measuring the speed with which memories could be generated that this manipulation enhanced the accessibility of memories reflecting the desired trait. If people rely on their memories to construct desired self-concepts, motivated changes in self-concepts should be constrained by the content of available memories. Our final study demonstrates such constraints.


Evading android runtime analysis via sandbox detection

The large amounts of malware, and its diversity, have made it necessary for the security community to use automated dynamic analysis systems. These systems often rely on virtualization or emulation, and have recently started to be available to process mobile malware. Conversely, malware authors seek to detect such systems and evade analysis. In this paper, we present techniques for detecting Android runtime analysis systems. Our techniques are classified into four broad classes showing the ability to detect systems based on differences in behavior, performance, hardware and software components, and those resulting from analysis system design choices. We also evaluate our techniques against current publicly accessible systems, all of which are easily identified and can therefore be hindered by a motivated adversary. Our results show some fundamental limitations in the viability of dynamic mobile malware analysis platforms purely based on virtualization.


Part Detector Discovery in Deep Convolutional Neural Networks

Current fine-grained classification approaches often rely on a robust localization of object parts to extract localized feature representations suitable for discrimination. However, part localization is a challenging task due to the large variation of appearance and pose. In this paper, we show how pre-trained convolutional neural networks can be used for robust and efficient object part discovery and localization without the necessity to actually train the network on the current dataset. Our approach called “part detector discovery” (PDD) is based on analyzing the gradient maps of the network outputs and finding activation centers spatially related to annotated semantic parts or bounding boxes. This allows us not just to obtain excellent performance on the CUB2002011 dataset, but in contrast to previous approaches also to perform detection and bird classification jointly without requiring a given bounding box annotation during testing and ground-truth parts during training. The code is available at http://www.inf-cv.uni-jena.de/part_ discovery and https://github.com/cvjena/PartDetectorDisovery.


Flexible dual TCP/UDP streaming for H.264 HD video over WLANs

High Definition video streaming over WLANs faces many challenges because video data requires not only data integrity but also frames have strict playout deadline. Traditional streaming methods that rely solely on either UDP or TCP have difficulties meeting both requirements because UDP incurs packet loss while TCP incurs delay. This paper proposed a new streaming method called Flexible Dual-TCP/UDP Streaming Protocol (FDSP) that utilizes the benefit of both UDP and TCP. The FDSP takes advantage of the hierarchical structure of the H.264/AVC syntax and uses TCP to transmit important syntax elements of H.264/AVC video and UDP to transmit non-important elements. The proposed FDSP is implemented and validated under different wireless network conditions. Both visual quality and delay results are compared against pure-UDP and pure-TCP streaming methods. Our results show that FDSP effectively achieves a balance between delay and visual quality, thus it has advantage over traditional pure-UDP and pure-TCP methods.


Probabilistic models for discovering e-communities

The increasing amount of communication between individuals in e-formats (e.g. email, Instant messaging and the Web) has motivated computational research in social network analysis (SNA). Previous work in SNA has emphasized the social network (SN) topology measured by communication frequencies while ignoring the semantic information in SNs. In this paper, we propose two generative Bayesian models for semantic community discovery in SNs, combining probabilistic modeling with community detection in SNs. To simulate the generative models, an EnF-Gibbs sampling algorithm is proposed to address the efficiency and performance problems of traditional methods. Experimental studies on Enron email corpus show that our approach successfully detects the communities of individuals and in addition provides semantic topic descriptions of these communities.


Ideal Ratio Mask Estimation Using Deep Neural Networks for Monaural Speech Segregation in Noisy Reverberant Conditions

Monaural speech segregation is an important problem in robust speech processing and has been formulated as a supervised learning problem. In supervised learning methods, the ideal binary mask (IBM) is usually used as the target because of its simplicity and large speech intelligibility gains. Recently, the ideal ratio mask (IRM) has been found to improve the speech quality over the IBM. However, the IRM was originally defined in anechoic conditions and did not consider the effect of reverberation. In this paper, the IRM is extended to reverberant conditions where the direct sound and early reflections of target speech are regarded as the desired signal. Deep neural networks (DNNs) is employed to estimate the extended IRM in the noisy reverberant conditions. The estimated IRM is then applied to the noisy reverberant mixture for speech segregation. Experimental results show that the estimated IRM provides substantial improvements in speech intelligibility and speech quality over the unprocessed mixture signals under various noisy and reverberant conditions.


Analyzing the Performance of Mutation Operators to Solve the Travelling Salesman Problem

The genetic algorithm includes some parameters that should be adjusted, so as to get reliable results. Choosing a representation of the problem addressed, an initial population, a method of selection, a crossover operator, mutation operator, the probabilities of crossover and mutation, and the insertion method creates a variant of genetic algorithms. Our work is part of the answer to this perspective to find a solution for this combinatorial problem. What are the best parameters to select for a genetic algorithm that creates a variety efficient to solve the Traveling Salesman Problem (TSP)? In this paper, we present a comparative analysis of different mutation operators, surrounded by a dilated discussion that justifying the relevance of genetic operators chosen to solving the TSP problem.


Multi-Column Convolutional Neural Networks with Causality-Attention for Why-Question Answering

Why-question answering (why-QA) is a task to retrieve answers (or answer passages) to why-questions (e.g., "why are tsunamis generated?") from a text archive. Several previously proposed methods for why-QA improved their performance by automatically recognizing causalities that are expressed with such explicit cues as "because" in answer passages and using the recognized causalities as a clue for finding proper answers. However, in answer passages, causalities might be implicitly expressed, (i.e., without any explicit cues): "An earthquake suddenly displaced sea water and a tsunami was generated." The previous works did not deal with such implicitly expressed causalities and failed to find proper answers that included the causalities. We improve why-QA based on the following two ideas. First, implicitly expressed causalities in one text might be expressed in other texts with explicit cues. If we can automatically recognize such explicitly expressed causalities from a text archive and use them to complement the implicitly expressed causalities in an answer passage, we can improve why-QA. Second, the causes of similar events tend to be described with a similar set of words (e.g., "seismic energy" and "tectonic plates" for "the Great East Japan Earthquake" and "the 1906 San Francisco Earthquake"). As such, even if we cannot find in a text archive any explicitly expressed cause of an event (e.g., "the Great East Japan Earthquake") expressed in a question (e.g., "Why did the Great East Japan earthquake happen?"), we might be able to identify its implicitly expressed causes with a set of words (e.g., "tectonic plates") that appear in the explicitly expressed cause of a similar event (e.g., "the 1906 San Francisco Earthquake").
 We implemented these two ideas in our multi-column convolutional neural networks with a novel attention mechanism, which we call causality attention. Through experiments on Japanese why-QA, we confirmed that our proposed method outperformed the state-of-the-art systems.


Analysis and design of compact two-way Wilkinson power dividers using coupled lines

This paper analyzes the two-way Wilkinson power dividers using coupled lines as λ/4 impedance transformer to have more compact layout. The analysis shows that the input port matching is only influenced by the even mode impedance of the coupled lines. Once the even mode impedance is fixed, all other specifications of the power divider are determined by the odd mode impedance of the coupled lines. Design tradeoffs among the output matching, isolation and the odd mode impedance are shown. By using smaller odd mode impedance, layout constraint can be relaxed. To validate the analysis, Wilkinson power dividers using coupled lines with areas of 1.5 cm2 and 1.25 cm2 are designed together with a conventional divider with an area of 3.8 cm2. The experimental results of the three designs are comparable. When coupled lines are used, the layout is more compact with a reduction in size of more than 50% compared to the conventional design.


Organizational Chart Inference

Nowadays, to facilitate the communication and cooperation among employees, a new family of online social networks has been adopted in many companies, which are called the "enterprise social networks" (ESNs). ESNs can provide employees with various professional services to help them deal with daily work issues. Meanwhile, employees in companies are usually organized into different hierarchies according to the relative ranks of their positions. The company internal management structure can be outlined with the organizational chart visually, which is normally confidential to the public out of the privacy and security concerns. In this paper, we want to study the IOC (Inference of Organizational Chart) problem to identify company internal organizational chart based on the heterogeneous online ESN launched in it. IOC is very challenging to address as, to guarantee smooth operations, the internal organizational charts of companies need to meet certain structural requirements (about its depth and width). To solve the IOC problem, a novel unsupervised method Create (ChArT REcovEr) is proposed in this paper, which consists of 3 steps: (1) social stratification of ESN users into different social classes, (2) supervision link inference from managers to subordinates, and (3) consecutive social classes matching to prune the redundant supervision links. Extensive experiments conducted on real-world online ESN dataset demonstrate that Create can perform very well in addressing the IOC problem.


The curvelet transform for image denoising

We describe approximate digital implementations of two new mathematical transforms, namely, the ridgelet transform and the curvelet transform. Our implementations offer exact reconstruction, stability against perturbations, ease of implementation, and low computational complexity. A central tool is Fourier-domain computation of an approximate digital Radon transform. We introduce a very simple interpolation in the Fourier space which takes Cartesian samples and yields samples on a rectopolar grid, which is a pseudo-polar sampling set based on a concentric squares geometry. Despite the crudeness of our interpolation, the visual performance is surprisingly good. Our ridgelet transform applies to the Radon transform a special overcomplete wavelet pyramid whose wavelets have compact support in the frequency domain. Our curvelet transform uses our ridgelet transform as a component step, and implements curvelet subbands using a filter bank of a; trous wavelet filters. Our philosophy throughout is that transforms should be overcomplete, rather than critically sampled. We apply these digital transforms to the denoising of some standard images embedded in white noise. In the tests reported here, simple thresholding of the curvelet coefficients is very competitive with "state of the art" techniques based on wavelets, including thresholding of decimated or undecimated wavelet transforms and also including tree-based Bayesian posterior mean methods. Moreover, the curvelet reconstructions exhibit higher perceptual quality than wavelet-based reconstructions, offering visually sharper images and, in particular, higher quality recovery of edges and of faint linear and curvilinear features. Existing theory for curvelet and ridgelet transforms suggests that these new approaches can outperform wavelet methods in certain image reconstruction problems. The empirical results reported here are in encouraging agreement.


Embodied Construction Grammar

Construction-based approaches to grammar are driven by the insight that meaning plays a crucial role in answering this question: the meanings of both words and grammatical structures can affect grammaticality, and they should therefore be incorporated into grammatical representations. To wit, the various approaches presented in this volume take this tack in predicting the grammaticality of utterances of all sorts, from the creative to the conventional. But focusing on utterance grammaticality removes utterances from their physical and social contexts of use. The result is an approach to language that resembles traditional anatomy, in which utterances are dissected, categorized, and explained in terms of their structural and distributional properties. Insights from such an approach can be both useful and informative in accounting for what utterances are or potentially could be. They do not, however, explain human language use—that is, the mechanisms and representations that human beings use to learn, produce, and understand utterances. If we are interested in these latter issues, issues more properly situated within cognitive science than analytical linguistics, then we find our investigations of grammar (and language more generally) guided by a different sort of question:


Cloud Computing – A Comprehensive Definition

Cloud computing is an evolving technology that is consistently generating impact in IT industry and academia. It performs all computational tasks over Internet by using virtualization techniques and remains isolated from intricate vast hardware and software infrastructures. The aim of this paper is to glance through the background and evolutions of cloud computing, its architecture and services to develop cumulative knowledge for future research extension and evaluation.


Discovering Diverse and Salient Threads in Document Collections

We propose a novel probabilistic technique for modeling and extracting salient structure from large document collections. As in clustering and topic modeling, our goal is to provide an organizing perspective into otherwise overwhelming amounts of information. We are particularly interested in revealing and exploiting relationships between documents. To this end, we focus on extracting diverse sets of threads—singlylinked, coherent chains of important documents. To illustrate, we extract research threads from citation graphs and construct timelines from news articles. Our method is highly scalable, running on a corpus of over 30 million words in about four minutes, more than 75 times faster than a dynamic topic model. Finally, the results from our model more closely resemble human news summaries according to several metrics and are also preferred by human judges.


Current review of prepubertal vaginal bleeding.

PURPOSE OF REVIEW
Prepubertal vaginal bleeding raises many concerns and evaluation and diagnosis may prove difficult for many providers. We aim to provide a comprehensive review and recent updates for those practitioners who care for these patients.

RECENT FINDINGS
Prompt management in the case of prepubertal vaginal bleeding is indicated, especially to rule out malignancy or abuse. If a child is reluctant to undergo examination, or if the extent of injury or source of bleeding cannot be determined, examination under anesthesia and vaginoscopy is recommended. Use of vaginoscopy allows for clear visualization of the vagina and cervix without distorting hymenal anatomy, as well as diagnosis and removal of a foreign body and evaluation of mucosal damage caused. In the case of sexual abuse, providers specifically trained in pediatrics need to be present, and safety of the patient should always be ensured.

SUMMARY
Careful history taking and targeted examination may lead to diagnosis in the case of prepubertal vaginal bleeding. However, in more difficult cases, practitioners should not hesitate to examine a patient in the operating room using general anesthesia to elicit the cause. Although sexual abuse and malignancy are always on the differential, most causes of bleeding are benign and easily treated.


Hypothesizing the Aptness of Social Media and the Information Richness Requirements of Disaster Management

In this article, the author first analyzes the social presence theory, media richness theory and taskmedia fit to investigate the suitability of various types of Social Media in disaster management. Then, on the basis of this analysis, use of social media is proposed to facilitate the communication tasks involved in the interaction between disaster management agencies and communities during disaster management. Next the author adapt a conceptual framework that integrates three types of communication (involving disaster management agencies and communities). The framework is further used as a springboard to develop a number of hypotheses to predict the aptness of rich and lean types of Social Media against the media richness requirements of disaster management tasks.


Natural Image Bases to Represent Neuroimaging Data

Visual inspection of neuroimagery is susceptible to human eye limitations. Computerized methods have been shown to be equally or more e↵ective than human clinicians in diagnosing dementia from neuroimages. Nevertheless, much of the work involves the use of domain expertise to extract hand–crafted features. The key technique in this paper is the use of cross–domain features to represent MRI data. We used a sparse autoencoder to learn a set of bases from natural images and then applied convolution to extract features from the Alzheimer’s Disease Neuroimaging Initiative (ADNI) dataset. Using this new representation, we classify MRI instances into three categories: Alzheimer’s Disease (AD), Mild Cognitive Impairment (MCI) and Healthy Control (HC). Our approach, in spite of being very simple, achieved high classification performance, which is competitive with or better than other approaches.


Doing good or doing well ? Image motivation and monetary incentives in behaving prosocially

Doing Good or Doing Well? Image Motivation and Monetary Incentives in Behaving Prosocially This paper experimentally examines image motivation – the desire to be liked and wellregarded by others – as a driver in prosocial behavior (doing good), and asks whether extrinsic monetary incentives (doing well) have a detrimental effect on prosocial behavior due to crowding out of image motivation. By definition, image depends on one’s behavior being visible to other people. Using this unique property we show that image is indeed an important part of the motivation to behave prosocially. Moreover, we show that extrinsic incentives interact with image motivation and are therefore less effective in public than in private. Together, these results imply that image motivation is crowded out by monetary incentives; which in turn means that monetary incentives are more likely to be counterproductive for public prosocial activities than for private ones. JEL Classification: D64, C90, H41