Query: Quark-X: An Efficient Top-K Processing Framework for RDF Quad Stores

Relevant passages:
DBpedia - A crystallization point for the Web of Data <=SEP=> The DBpedia project is a community effort to extract structured information from Wikipedia and to make this information accessible on the Web. The resulting DBpedia knowledge base currently describes over 2.6 million entities. For each of these entities, DBpedia defines a globally unique identifier that can be dereferenced over the Web into a rich RDF description of the entity, including human-readable definitions in 30 languages, relationships to other resources, classifications in four concept hierarchies, various facts as well as data-level links to other Web data sources describing the entity. Over the last year, an increasing number of data publishers have begun to set data-level links to DBpedia resources, making DBpedia a central interlinking hub for the emerging Web of data. Currently, the Web of interlinked data sources around DBpedia provides approximately 4.7 billion pieces of information and covers domains such as geographic information, people, companies, films, music, genes, drugs, books, and scientific publications. This article describes the extraction of the DBpedia knowledge base, the current status of interlinking DBpedia with other data sources on the Web, and gives an overview of applications that facilitate the Web of Data around DBpedia.

LUBM: A benchmark for OWL knowledge base systems <=SEP=> We describe our method for benchmarking Semantic Web knowledge base systems with respect to use in large OWL applications. We present the Lehigh University Benchmark (LUBM) as an example of how to design such benchmarks. The LUBM features an on-tology for the university domain, synthetic OWL data scalable to an arbitrary size, fourteen extensional queries representing a variety of properties, and several performance metrics. The LUBM can be used to evaluate systems with different reasoning capabilities and storage mechanisms. We demonstrate this with an evaluation of two memory-based systems and two systems with persistent storage.

Automatically refining the wikipedia infobox ontology <=SEP=> The combined efforts of human volunteers have recently extracted numerous facts from Wikipedia, storing them as machine-harvestable object-attribute-value triples in Wikipedia infoboxes. Machine learning systems, such as Kylin, use these infoboxes as training data, accurately extracting even more semantic knowledge from natural language text. But in order to realize the full power of this information, it must be situated in a cleanly-structured ontology. This paper introduces KOG, an autonomous system for refining Wikipedia's infobox-class ontology towards this end. We cast the problem of ontology refinement as a machine learning problem and solve it using both SVMs and a more powerful joint-inference approach expressed in Markov Logic Networks. We present experiments demonstrating the superiority of the joint-inference approach and evaluating other aspects of our system. Using these techniques, we build a rich ontology, integrating Wikipedia's infobox-class schemata with WordNet. We demonstrate how the resulting ontology may be used to enhance Wikipedia with improved query processing and other features.

Racer: A Core Inference Engine for the Semantic Web <=SEP=> In this paper we describe Racer, which can be considered as a core inference engine for the semantic web. The Racer inference server offers two APIs that are already used by at least three different network clients, i.e., the ontology editor OilEd, the visualization tool RICE, and the ontology development environment Protege 2. The Racer server supports the standard DIG protocol via HTTP and a TCP based protocol with extensive query facilities. Racer currently supports the web ontology languages DAML+OIL, RDF, and OWL.

Exploiting Wikipedia as External Knowledge for Named Entity Recognition <=SEP=> We explore the use of Wikipedia as external knowledge to improve named entity recognition (NER). Our method retrieves the corresponding Wikipedia entry for each candidate word sequence and extracts a category label from the first sentence of the entry, which can be thought of as a definition part. These category labels are used as features in a CRF-based NE tagger. We demonstrate using the CoNLL 2003 dataset that the Wikipedia category labels extracted by such a simple method actually improve the accuracy of NER.

Field-Robot-Based Agriculture : “ RemoteFarming . 1 ” and “ BoniRob-Apps <=SEP=> Based on the autonomous field robot BoniRob, which was developed for plant phenotyping, the authors have created an enhanced platform BoniRob (V2). The design of BoniRob (V2) considers two main improvements: At first the robustness for continuous outdoor use is increased and secondly the robot now makes available a reusable platform that can serve for multiple agricultural purposes. The combination of the platform BoniRob (V2) and application modules (“BoniRob-Apps”) is comparable to the classical combination of a tractor and an implement. In order to demonstrate this new concept, the authors have implemented three BoniRob-Apps, which can be integrated in BoniRob (V2) via defined mechanical, electrical and logical interfaces. The research project RemoteFarming.1 goes even beyond the accomplishment of a specific task by a robot and demonstrates the integration of the BoniRob (V2) platform into agricultural processes. For that purpose innovative agricultural engineering is combined with webbased communication technologies. The target is to develop a robotic mechanical weed control system which integrates a human user as remote worker in the process. The robotic weed control system is used for intra row weed treatment in carrots at BBCH-scales 10 to 20 in organic farming. This task is today conducted by hand. Introduction In recent years a variety of field robot prototypes have been proposed. They cover several applications, such as scouting and sampling, precise variable rate application of pesticides and fertilizers as well as autonomous weeding [1][2]. However, until now there is no commercial application of autonomous field operation in agriculture available. This is partly due to open issues regarding safety and legal requirements of autonomous operations [3].Another problem of the presented prototypes for autonomous field robots is their conception as single-purpose robots, despite there being several applications with market potential [6]. As the single-purpose concept leads typically would lead high costs due to a low workload over the year (specific tasks are required over only a short period of time), the systems are not economically feasible yet. To overcome this barrier a new concept for a multipurpose field robot is shown here. Multipurpose field robot platform BoniRob (V2) The BoniRob (V2) platform has been designed as an improved version of the BoniRob crop scout, which has been announced by the authors [5]. The BoniRob (V2) is shown in Fig 1. Fig.1: BoniRob (V2) during a RemoteFarming.1 field trial It was reengineered with focus on robustness and reusability. This manifests in increases of power supply by the electrical generator, continuous and peak torque at the wheel drives as well as chassis clearance (Table 1). Table 1: Technical figures of BoniRob (V2) BoniRob crop scout BoniRob (V2) platform Power of electric generator 2.0 kW 2.6 kW Battery’s capacity 110 Ah 170 Ah Continuous drive torque (per wheel) 55 Nm 70 Nm Peak drive torque (per wheel) 110 Nm 240 Nm As it can be seen in Fig.1, the height adjustment of the entire robot body was replaced by vertically fixed arms for each wheel, which can be rotated in the horizontal plane for adjustment of track width and centration of the robot body over the row to be treated. The hydraulic height adjustment was replaced by a manual, mechanical height-adjustment module frame. Furthermore, all other hydraulic drives were replaced by electrical systems. The BoniRob-App concept Using the multipurpose field robot platform BoniRob (V2) as a carrier, supplier and base for multiple BoniRob-Apps can be compared to the traditional combination of a single tractor with multiple implements. BoniRob-Apps can be integrated into the platform using defined mechanical, electrical and logical interfaces. The module frame of 0.77 m x 0.75 m in the centre of the robot allows mechanically attaching the BoniRob-App (Fig. 2). The mounting height can be adjusted in a range of 0.4 m. The electrical connection is set up using a custom plug. This provides energy supply to the BoniRob-App and different voltage levels (230V AC, 24 V DC, 12 V DC, 5 V DC). Moreover, it allows linking the emergency stop infrastructure of platform and App, such that even the App can stop the entire robot in case of emergency. Also, the custom plug sets up a Gigabit-Ethernet connection to the host-computer on BoniRob (V2). The entire communication infrastructure on BoniRob (V2) and between platform and the Apps is designed using Ethernet and ROS [4]. A sequence controller with 2 levels opens the way for distributed drive control of the robot. In the row the App (level 2 sequence controller) can access the drive control. On the headland the platform (level 1 sequence controller) holds the access to the drive control and runs the turn procedure of the robot. This Fig. 2: Multiple BoniRob-Apps can be used in the same platform allows switching the access to the drive depending on the state including letting the App control the drive train of the robot in properly defined situations. Again, this can be compared to a tractor-implement combination. In recent years in the field of Tractor Implement Management advances have been made towards control of the tractor by the implement in specific situations, because the implement and its sensors are closer to the process and more specifically adapted to it. This also shows that BoniRob-Apps are more than just tools to be used with the BoniRob (V2) platform but smart combinations of mechanical and electrical systems together with processand application-specific intelligence. BoniRob-Apps: Demonstrating examples In order to demonstrate the new concept, the authors implemented three BoniRob-Apps:

Energy Minimization Using Multiple Supply Voltages <=SEP=> We present a dynamic programming technique for solving the multiple supply voltage scheduling problem in both non-pipelined and functionally pipelined data-paths. The scheduling problem refers to the assignment of a supply voltage level to each operation in a data ow graph so as to minimize the average energy consumption for given computation time or throughput constraints or both. The energy model is accurate and accounts for the input pattern dependencies, re-convergent fanout induced dependencies, and the energy cost of level shifters. Experimental results show that using four supply voltage levels on a number of standard benchmarks, an average energy saving of 53% (with a computation time constraint of 1.5 times the critical path delay) can be obtained compared to using one fixed supply voltage level.

Modeling Commonsense Reasoning via Analogical Chaining: A Preliminary Report <=SEP=> Understanding the nature of commonsense reasoning is one of the deepest questions of cognitive science. Prior work has proposed analogy as a mechanism for commonsense reasoning, with prior simulations focusing on reasoning about continuous behavior of physical systems. This paper examines how analogy might be used in commonsense more broadly. The two contributions are (1) the idea of common sense units, intermediate-sized collections of facts extracted from experience (including cultural experience) which improves analogical retrieval and simplifies inferencing, and (2) analogical chaining, where multiple rounds of analogical retrieval and mapping are used to rapidly construct explanations and predictions. We illustrate these ideas via an implemented computational model, tested on examples from an independently-developed test of commonsense reasoning.

A key-management scheme for distributed sensor networks <=SEP=> Distributed Sensor Networks (DSNs) are ad-hoc mobile networks that include sensor nodes with limited computation and communication capabilities. DSNs are dynamic in the sense that they allow addition and deletion of sensor nodes after deployment to grow the network or replace failing and unreliable nodes. DSNs may be deployed in hostile areas where communication is monitored and nodes are subject to capture and surreptitious use by an adversary. Hence DSNs require cryptographic protection of communications, sensor-capture detection, key revocation and sensor disabling. In this paper, we present a key-management scheme designed to satisfy both operational and security requirements of DSNs. The scheme includes selective distribution and revocation of keys to sensor nodes as well as node re-keying without substantial computation and communication capabilities. It relies on probabilistic key sharing among the nodes of a random graph and uses simple protocols for shared-key discovery and path-key establishment, and for key revocation, re-keying, and incremental addition of nodes. The security and network connectivity characteristics supported by the key-management scheme are discussed and simulation experiments presented.

A New Approach to Track Multiple Vehicles With the Combination of Robust Detection and Two Classifiers <=SEP=> It plays an important role to accurately track multiple vehicles in intelligent transportation, especially in intelligent vehicles. Due to complicated traffic environments it is difficult to track multiple vehicles accurately and robustly, especially when there are occlusions among vehicles. To alleviate these problems, a new approach is proposed to track multiple vehicles with the combination of robust detection and two classifiers. An improved ViBe algorithm is proposed for robust and accurate detection of multiple vehicles. It uses the gray-scale spatial information to build dictionary of pixel life length to make ghost shadows and object’s residual shadows quickly blended into the samples of the background. The improved algorithm takes good post-processing method to restrain dynamic noise. In this paper, we also design a method using two classifiers to further attack the problem of failure to track vehicles with occlusions and interference. It classifies tracking rectangles with confidence values between two thresholds through combining local binary pattern with support vector machine (SVM) classifier and then using a convolutional neural network (CNN) classifier for the second time to remove the interference areas between vehicles and other moving objects. The two classifiers method has both time efficiency advantage of SVM and high accuracy advantage of CNN. Comparing with several existing methods, the qualitative and quantitative analysis of our experiment results showed that the proposed method not only effectively removed the ghost shadows, and improved the detection accuracy and real-time performance, but also was robust to deal with the occlusion of multiple vehicles in various traffic scenes.

Digital Watermarking and Steganography <=SEP=> Sharing, disseminating, and presenting data in digital format is not just a fad, but it is becoming part of our life. Without careful planning, digitized resources could easily be misused, especially those that are shared across the Internet. Examples of such misuse include use without the owner’s permission, and modification of a digitized resource to fake ownership. One way to prevent such behaviors is to employ some form of copyright protection technique, such as digital watermarks. Digital watermarks refer to the data embedded into a digital source (e.g., images, text, audio, or video recording). They are similar to watermarks in printed materials as a message inserted into the host media typically becomes an integral part of the media. Apart from traditional watermarks in printed forms, digital watermarks may also be invisible, may be in the forms other than graphics, and may be digitally removed.

An evaluation of bipartitioning techniques <=SEP=> Logic partitioning is an important issue in VLSI CAD, and has been an area of active research for at least the last 25 years. Numerous approaches have been developed and many different techniques have been combined for a wide range of applications. In this paper, we examine many of the existing techniques for logic bipartitioning and present a methodology for determining the best mix of approaches. The result is a novel bipartitioning algorithm that includes both new and pre-existing techniques. Our algorithm produces results that are at least 16% better than the state-of-the-art while also being efficient in run-time.

Unsupervised soccer video abstraction based on pitch, dominant color and camera motion analysis <=SEP=> We present a soccer video abstraction method based on the analysis of the audio and video streams. This method could be applied to other sports as rugby or american football. The main contribution of this paper is the design of an unsupervised summarization method, and more specifically, the introduction of an efficient detector of excited speech segments. An excited commentary is supposed to correspond to an interesting moment of the game. It is simultaneously characterized by an increase of the pitch (or fundamental frequency) within the voiced segments and an increase of the energy supported by the harmonics of the pitch. The pitch is estimated from the autocorrelation function and its local increases are detected from a multiresolution technique. We introduce a specific energy measure for the voiced segments. A statistical analysis of the energy measures is performed to detect the most excited parts of the speech. A deterministic combination of excited speech detection, dominant color identification and camera motion analysis is then performed in order to discriminate between excited speech sequences of the game and excited speech sequences in commercials or in studio shots included in the processed TV programs.
 The method presented here does not need any learning stage. It has been tested on seven soccer videos for a total duration of almost 20 hours.

Blurred boundaries: the therapeutics and politics of medical marijuana. <=SEP=> For 5 millennia, Cannabis sativa has been used throughout the world medically, recreationally, and spiritually. From the mid-19th century to the 1930s, American physicians prescribed it for a plethora of indications, until the federal government started imposing restrictions on its use, culminating in 1970 with the US Congress classifying it as a Schedule I substance, illegal, and without medical value. Simultaneous with this prohibition, marijuana became the United States' most widely used illicit recreational drug, a substance generally regarded as pleasurable and relaxing without the addictive dangers of opioids or stimulants. Meanwhile, cannabis never lost its cachet in alternative medicine circles, going mainstream in 1995 when California became the first of 16 states to date to legalize its medical use, despite the federal ban. Little about cannabis is straightforward. Its main active ingredient, δ-9-tetrahydrocannabinol, was not isolated until 1964, and not until the 1990s were the far-reaching modulatory activities of the endocannabinoid system in the human body appreciated. This system's elucidation raises the possibility of many promising pharmaceutical applications, even as draconian federal restrictions that hamstring research show no signs of softening. Recreational use continues unabated, despite growing evidence of marijuana's addictive potential, particularly in the young, and its propensity for inducing and exacerbating psychotic illness in the susceptible. Public approval drives medical marijuana legalization efforts without the scientific data normally required to justify a new medication's introduction. This article explores each of these controversies, with the intent of educating physicians to decide for themselves whether marijuana is panacea, scourge, or both. PubMed searches were conducted using the following keywords: medical marijuana, medical cannabis, endocannabinoid system, CB1 receptors, CB2 receptors, THC, cannabidiol, nabilone, dronabinol, nabiximols, rimonabant, marijuana legislation, marijuana abuse, marijuana dependence, and marijuana and schizophrenia. Bibliographies were hand searched for additional references relevant to clarifying the relationships between medical and recreational marijuana use and abuse.

AxNN: Energy-efficient neuromorphic systems using approximate computing <=SEP=> Neuromorphic algorithms, which are comprised of highly complex, large-scale networks of artificial neurons, are increasingly used for a variety of recognition, classification, search and vision tasks. However, their computational and energy requirements can be quite high, and hence their energy-efficient implementation is of great interest.
 We propose a new approach to design energy-efficient hardware implementations of large-scale neural networks (NNs) using approximate computing. Our work is motivated by the observations that (i) NNs are used in applications where less-than-perfect results are acceptable, and often inevitable, and (ii) they are highly resilient to inexactness in many (but not all) of their constituent computations. We make two key contributions. First, we propose a method to transform any given NN into an Approximate Neural Network (AxNN). This is performed by (i) adapting the backpropagation technique, which is commonly used to train these networks, to quantify the impact of approximating each neuron to the overall network quality (e.g., classification accuracy), and (ii) selectively approximating those neurons that impact network quality the least. Further, we make the key observation that training is a naturally error-healing process that can be used to mitigate the impact of approximations to neurons. Therefore, we incrementally retrain the network with the approximations in-place, reclaiming a significant portion of the quality ceded by approximations. As a second contribution, we propose a programmable and quality-configurable neuromorphic processing engine (qcNPE), which utilizes arrays of specialized processing elements that execute neuron computations with dynamically configurable accuracies and can be used to execute AxNNs from diverse applications. We evaluated the proposed approach by constructing AXNNs for 6 recognition applications (ranging in complexity from 12-47,818 neurons and 160-3,155,968 connections) and executing them on two different platforms--qcNPE implementation containing 272 processing elements in 45nm technology and a commodity Intel Xeon server. Our results demonstrate 1.14X-1.92X energy benefits for virtually no loss (< 0.5%) in output quality, and even higher improvements (upto 2.3X) when some loss (upto 7.5%) in output quality is acceptable.

Text Encryption with Huffman Compression <=SEP=> Communication between a sender and receiver needs security. It can be done in any form, like plain text or binary data. Changing the information to some unidentifiable form, can save it from assailants. For example, plain text can be coded using schemes so that a stranger cannot apprehend it. Cryptography is a subject or field which deals with the secret transmission of messages/ data between two parties. Cryptography is the practice and study of hiding information. It enables you to store delicate information and transmit it across insecure networks so that it cannot be read by anyone except the authorized recipient. Applications of cryptography include ATM cards, computer passwords, and electronic commerce etc. Messages, which are being sent between two parties, should be of small size so that they occupy less space. Data compression involves encoding of information using fewer bits than the original representation. Compression algorithms reduce the redundancy in data representation to decrease the storage required for that data. Symmetric key cryptography algorithms [6] are fast and mostly used type of encryption. Many types of data compression techniques do exist. Huffman Compression [5] is a lossless data compression technique and can be considered as the most efficient algorithm. In this paper, a combination of new Symmetric key algorithm and existing Huffman compression algorithm has been proposed. Proposed method works on text data. Algorithms have been provided in the paper itself.

Health informatics: current issues and challenges <=SEP=> Health informatics concerns the use of information and information and communication technologies within healthcare. Health informatics and information science need to take account of the unique aspects of health and medicine. The development of information systems and electronic records within health needs to consider the information needs and behaviour of all users. The sensitivity of personal health data raises ethical concerns for developing electronic records. E-health initiatives must actively involve users in the design, development, implementation and evaluation, and information science can contribute to understanding the needs and behaviour of user groups. Health informatics could make an important contribution to the ageing society and to reducing the digital divide and health divides within society. There is a need for an appropriate evidence base within health informatics to support future developments, and to ensure health informatics reaches its potential to improve the health and well-being of patients and the public.

Co-FAIS: Cooperative fuzzy artificial immune system for detecting intrusion in wireless sensor networks <=SEP=> Due to the distributed nature of Denial-of-Service attacks, it is tremendously challenging to identify such malicious behavior using traditional intrusion detection systems in Wireless Sensor Networks (WSNs). In the current paper, a bio-inspired method is introduced, namely the cooperative-based fuzzy artificial immune system (Co-FAIS). It is a modular-based defense strategy derived from the danger theory of the human immune system. The agents synchronize and work with one another to calculate the abnormality of sensor behavior in terms of context antigen value (CAV) or attackers and update the fuzzy activation threshold for security response. In such a multi-node circumstance, the sniffer module adapts to the sink node to audit data by analyzing the packet components and sending the log file to the next layer. The fuzzy misuse detector module (FMDM) integrates with a danger detector module to identify the sources of danger signals. The infected sources are transmitted to the fuzzy Q-learning vaccination modules (FQVM) in order for particular, required action to enhance system abilities. The Cooperative Decision Making Modules (Co-DMM) incorporates danger detector module with the fuzzy Q-learning vaccination module to produce optimum defense strategies. To evaluate the performance of the proposed model, the Low Energy Adaptive Clustering Hierarchy (LEACH) was simulated using a network simulator. The model was subsequently compared against other existing soft computing methods, such as fuzzy logic controller (FLC), artificial immune system (AIS), and fuzzy Q-learning (FQL), in terms of detection accuracy, counter-defense, network lifetime and energy consumption, to demonstrate its efficiency and viability. The proposed method improves detection accuracy and successful defense rate performance against attacks compared to conventional empirical methods. & 2014 Elsevier Ltd. All rights reserved.

Ray tracing animated scenes using coherent grid traversal <=SEP=> We present a new approach to interactive ray tracing of moderate-sized animated scenes based on traversing frustum-bounded packets of coherent rays through uniform grids. By incrementally computing the overlap of the frustum with a slice of grid cells, we accelerate grid traversal by more than a factor of 10, and achieve ray tracing performance competitive with the fastest known packet-based kd-tree ray tracers. The ability to efficiently rebuild the grid on every frame enables this performance even for fully dynamic scenes that typically challenge interactive ray tracing systems.

Optical techniques for 3D surface reconstruction in computer-assisted laparoscopic surgery <=SEP=> One of the main challenges for computer-assisted surgery (CAS) is to determine the intra-operative morphology and motion of soft-tissues. This information is prerequisite to the registration of multi-modal patient-specific data for enhancing the surgeon's navigation capabilities by observing beyond exposed tissue surfaces and for providing intelligent control of robotic-assisted instruments. In minimally invasive surgery (MIS), optical techniques are an increasingly attractive approach for in vivo 3D reconstruction of the soft-tissue surface geometry. This paper reviews the state-of-the-art methods for optical intra-operative 3D reconstruction in laparoscopic surgery and discusses the technical challenges and future perspectives towards clinical translation. With the recent paradigm shift of surgical practice towards MIS and new developments in 3D optical imaging, this is a timely discussion about technologies that could facilitate complex CAS procedures in dynamic and deformable anatomical regions.

A 0.3 GHz to 1.4 GHz N-path mixer-based code-domain RX with TX self-interference rejection <=SEP=> A code-domain N-path RX is proposed based on PN-code modulated LO pulses for concurrent reception of two code-modulated signals. Additionally, a combination of Walsh-Function and PN sequence is proposed to translate in-band TX self-interference (SI) to out-of-band at N-path RX output enabling frequency filtering for high SI rejection. A 0.3 GHz–1.4 GHz 65-nm CMOS implementation has 35 dB gain for desired signals and concurrently receives two RX signals while rejecting mismatched spreading codes at RF input. Proposed TX SI mitigation approach results in 38.5 dB rejection for −11.8dBm 1.46 Mb/s QPSK modulated SI at RX input. The RX achieves 23.7dBm OP1dB for in-band SI, while consuming ∼35mW and occupies 0.31mm2.

28 GHz and 73 GHz millimeter-wave indoor propagation measurements and path loss models <=SEP=> This paper presents 28 GHz and 73 GHz millimeter-wave propagation measurements performed in a typical office environment using a 400 Megachip-per-second broadband sliding correlator channel sounder and highly directional steerable 15 dBi (30° beamwidth) and 20 dBi (15° beamwidth) horn antennas. Power delay profiles were acquired for 48 transmitter-receiver location combinations over distances ranging from 3.9 m to 45.9 m with maximum transmit powers of 24 dBm and 12.3 dBm at 28 GHz and 73 GHz, respectively. Directional and omnidirectional path loss models and RMS delay spread statistics are presented for line-of-sight and non-line-of-sight environments for both co- and cross-polarized antenna configurations. The LOS omnidirectional path loss exponents were 1.1 and 1.3 at 28 GHz and 73 GHz, and 2.7 and 3.2 in NLOS at 28 GHz and 73 GHz, respectively, for vertically-polarized antennas. The mean directional RMS delay spreads were 18.4 ns and 13.3 ns, with maximum values of 193 ns and 288 ns at 28 GHz and 73 GHz, respectively.

Three-way substrate integrated waveguide (SIW) power divider design <=SEP=> In this paper, an X-band 1×3 substrate integrated waveguide (SIW) power divider design is presented. The designed SIW power divider provides equal amplitude with uniform phase distribution at the each output port. It has also a satisfactory operating bandwidth and low insertion loss. Moreover, the return loss is approximately 25 dB at the design frequency as shown in the EM simulation results.

A review and critique of emotional intelligence measures <=SEP=> Emotional intelligence measures vary widely in both their content and in their method of assessment. In particular, emotional intelligence measures tend to use either a self-report personality-based approach, an informant approach, or an ability-based assessment procedure. In this paper, the measurement and psychometric properties of four of the major emotional intelligence measures (Emotional Competence Inventory, Emotional Quotient Inventory, Multifactor Emotional Intelligence Scale, Mayer–Salovey–Caruso Emotional Intelligence Test) are reviewed, the comparability of these measures is examined, and some conclusions and suggestions for future research on emotional intelligence measures are provided. Copyright # 2005 John Wiley & Sons, Ltd.

Faceness-Net: Face Detection through Deep Facial Part Responses <=SEP=> We propose a deep convolutional neural network (CNN) for face detection leveraging on facial attributes based supervision. We observe a phenomenon that part detectors emerge within CNN trained to classify attributes from uncropped face images, without any explicit part supervision. The observation motivates a new method for finding faces through scoring facial parts responses by their spatial structure and arrangement. The scoring mechanism is data-driven, and carefully formulated considering challenging cases where faces are only partially visible. This consideration allows our network to detect faces under severe occlusion and unconstrained pose variations. Our method achieves promising performance on popular benchmarks including FDDB, PASCAL Faces, AFW, and WIDER FACE.

Multi-Sensor Conflict Measurement and Information Fusion <=SEP=> In sensing applications where multiple sensors observe the same scene, fusing sensor outputs can provide improved results. However, if some of the sensors are providing lower quality outputs, e.g. when one or more sensors has a poor signal-tonoise ratio (SNR) and therefore provides very noisy data, the fused results can be degraded. In this work, a multi-sensor conflict measure is proposed which estimates multi-sensor conflict by representing each sensor output as interval-valued information and examines the sensor output overlaps on all possible n-tuple sensor combinations. The conflict is based on the sizes of the intervals and how many sensors output values lie in these intervals. In this work, conflict is defined in terms of how little the output from multiple sensors overlap. That is, high degrees of overlap mean low sensor conflict, while low degrees of overlap mean high conflict. This work is a preliminary step towards a robust conflict and sensor fusion framework. In addition, a sensor fusion algorithm is proposed based on a weighted sum of sensor outputs, where the weights for each sensor diminish as the conflict measure increases. The proposed methods can be utilized to (1) assess a measure of multi-sensor conflict, and (2) improve sensor output fusion by lessening weighting for sensors with high conflict. Using this measure, a simulated example is given to explain the mechanics of calculating the conflict measure, and stereo camera 3D outputs are analyzed and fused. In the stereo camera case, the sensor output is corrupted by additive impulse noise, DC offset, and Gaussian noise. Impulse noise is common in sensors due to intermittent interference, a DC offset a sensor bias or registration error, and Gaussian noise represents a sensor output with low SNR. The results show that sensor output fusion based on the conflict measure shows improved accuracy over a simple averaging fusion strategy.

Multi-style Generative Network for Real-Time Transfer <=SEP=> Despite the rapid progress in style transfer, existing approaches using feed-forward generative network for multistyle or arbitrary-style transfer are usually compromised of image quality and model flexibility. We find it is fundamentally difficult to achieve comprehensive style modeling using 1-dimensional style embedding. Motivated by this, we introduce CoMatch Layer that learns to match the second order feature statistics with the target styles. With the CoMatch Layer, we build a Multi-style Generative Network (MSGNet), which achieves real-time performance. In addition, we employ an specific strategy of upsampled convolution which avoids checkerboard artifacts caused by fractionallystrided convolution. Our method has achieved superior image quality comparing to state-of-the-art approaches. The proposed MSG-Net as a general approach for real-time style transfer is compatible with most existing techniques including content-style interpolation, color-preserving, spatial control and brush stroke size control. MSG-Net is the first to achieve real-time brush-size control in a purely feedforward manner for style transfer. Our implementations and pre-trained models for Torch, PyTorch and MXNet frameworks will be publicly available1.

Performance-Effective and Low-Complexity Task Scheduling for Heterogeneous Computing <=SEP=> ÐEfficient application scheduling is critical for achieving high performance in heterogeneous computing environments. The application scheduling problem has been shown to be NP-complete in general cases as well as in several restricted cases. Because of its key importance, this problem has been extensively studied and various algorithms have been proposed in the literature which are mainly for systems with homogeneous processors. Although there are a few algorithms in the literature for heterogeneous processors, they usually require significantly high scheduling costs and they may not deliver good quality schedules with lower costs. In this paper, we present two novel scheduling algorithms for a bounded number of heterogeneous processors with an objective to simultaneously meet high performance and fast scheduling time, which are called the Heterogeneous Earliest-Finish-Time (HEFT) algorithm and the Critical-Path-on-a-Processor (CPOP) algorithm. The HEFT algorithm selects the task with the highest upward rank value at each step and assigns the selected task to the processor, which minimizes its earliest finish time with an insertion-based approach. On the other hand, the CPOP algorithm uses the summation of upward and downward rank values for prioritizing tasks. Another difference is in the processor selection phase, which schedules the critical tasks onto the processor that minimizes the total execution time of the critical tasks. In order to provide a robust and unbiased comparison with the related work, a parametric graph generator was designed to generate weighted directed acyclic graphs with various characteristics. The comparison study, based on both randomly generated graphs and the graphs of some real applications, shows that our scheduling algorithms significantly surpass previous approaches in terms of both quality and cost of schedules, which are mainly presented with schedule length ratio, speedup, frequency of best results, and average scheduling time metrics.

Automated Accessibility Testing of Mobile Apps <=SEP=> It is important to make mobile apps accessible, so as not to exclude users with common disabilities such as blindness, low vision, or color blindness. Even when developers are aware of these accessibility needs, the lack of tool support makes the development and assessment of accessible apps challenging. Some accessibility properties can be checked statically, but user interface widgets are often created dynamically and are not amenable to static checking. Some accessibility checking frameworks analyze accessibility properties at runtime, but have to rely on existing thorough test suites. In this paper, we introduce the idea of using automated test generation to explore the accessibility of mobile apps. We present the MATE tool (Mobile Accessibility Testing), which automatically explores apps while applying different checks for accessibility issues related to visual impairment. For each issue, MATE generates a detailed report that supports the developer in fixing the issue. Experiments on a sample of 73 apps demonstrate that MATE detects more basic accessibility problems than static analysis, and many additional types of accessibility problems that cannot be detected statically at all. Comparison with existing accessibility testing frameworks demonstrates that the independence of an existing test suite leads to the identification of many more accessibility problems. Even when enabling Android's assistive features like contrast enhancement, MATE can still find many accessibility issues.

Relations among children's social goals, implicit personality theories, and responses to social failure. <=SEP=> Two studies examined children's thought patterns in relation to their responses to social challenge. In Study 1, 4th and 5th graders tried out for a pen pal club under either a performance goal (stressing the evaluative nature of the tryout) or a learning goal (emphasizing the potential learning opportunities). In their behavior and attributions following rejection, children who were focused on a performance goal reacted with more helplessness, whereas children given a learning goal displayed a more mastery-oriented response. Study 2 found that in response to hypothetical socially challenging situations, 4th, 5th, and 6th graders who believed personality was nonmalleable (entity theorists) vs. malleable (incremental theorists) were more likely to endorse performance goals. Together, these studies indicate that children's goals in social situations are associated with their responses to social failure and are predicted by their implicit theories about their personality.