Query: DCAN: Dual Channel-Wise Alignment Networks for Unsupervised Scene Adaptation

Relevant passages:
Full-Resolution Residual Networks for Semantic Segmentation in Street Scenes <=SEP=> Semantic image segmentation is an essential component of modern autonomous driving systems, as an accurate understanding of the surrounding scene is crucial to navigation and action planning. Current state-of-the-art approaches in semantic image segmentation rely on pre-trained networks that were initially developed for classifying images as a whole. While these networks exhibit outstanding recognition performance (i.e., what is visible?), they lack localization accuracy (i.e., where precisely is something located?). Therefore, additional processing steps have to be performed in order to obtain pixel-accurate segmentation masks at the full image resolution. To alleviate this problem we propose a novel ResNet-like architecture that exhibits strong localization and recognition performance. We combine multi-scale context with pixel-level accuracy by using two processing streams within our network: One stream carries information at the full image resolution, enabling precise adherence to segment boundaries. The other stream undergoes a sequence of pooling operations to obtain robust features for recognition. The two streams are coupled at the full image resolution using residuals. Without additional processing steps and without pre-training, our approach achieves an intersection-over-union score of 71.8% on the Cityscapes dataset.

Return of Frustratingly Easy Domain Adaptation <=SEP=> Unlike human learning, machine learning often fails to handle changes between training (source) and test (target) input distributions. Such domain shifts, common in practical scenarios, severely damage the performance of conventional machine learning methods. Supervised domain adaptation methods have been proposed for the case when the target data have labels, including some that perform very well despite being “frustratingly easy” to implement. However, in practice, the target domain is often unlabeled, requiring unsupervised adaptation. We propose a simple, effective, and efficient method for unsupervised domain adaptation called CORrelation ALignment (CORAL). CORAL minimizes domain shift by aligning the second-order statistics of source and target distributions, without requiring any target labels. Even though it is extraordinarily simple–it can be implemented in four lines of Matlab code–CORAL performs remarkably well in extensive evaluations on standard benchmark datasets. “Everything should be made as simple as possible, but not simpler.”

Unsupervised Domain Adaptation by Backpropagation <=SEP=> Top-performing deep architectures are trained on massive amounts of labeled data. In the absence of labeled data for a certain task, domain adaptation often provides an attractive option given that labeled data of similar nature but from a different domain (e.g. synthetic images) are available. Here, we propose a new approach to domain adaptation in deep architectures that can be trained on large amount of labeled data from the source domain and large amount of unlabeled data from the target domain (no labeled targetdomain data is necessary). As the training progresses, the approach promotes the emergence of “deep” features that are (i) discriminative for the main learning task on the source domain and (ii) invariant with respect to the shift between the domains. We show that this adaptation behaviour can be achieved in almost any feed-forward model by augmenting it with few standard layers and a simple new gradient reversal layer. The resulting augmented architecture can be trained using standard backpropagation. Overall, the approach can be implemented with little effort using any of the deep-learning packages. The method performs very well in a series of image classification experiments, achieving adaptation effect in the presence of big domain shifts and outperforming previous state-ofthe-art on Office datasets.

Adversarial Discriminative Domain Adaptation <=SEP=> Adversarial learning methods are a promising approach to training robust deep networks, and can generate complex samples across diverse domains. They can also improve recognition despite the presence of domain shift or dataset bias: recent adversarial approaches to unsupervised domain adaptation reduce the difference between the training and test domain distributions and thus improve generalization performance. However, while generative adversarial networks (GANs) show compelling visualizations, they are not optimal on discriminative tasks and can be limited to smaller shifts. On the other hand, discriminative approaches can handle larger domain shifts, but impose tied weights on the model and do not exploit a GAN-based loss. In this work, we first outline a novel generalized framework for adversarial adaptation, which subsumes recent state-of-the-art approaches as special cases, and use this generalized view to better relate prior approaches. We then propose a previously unexplored instance of our general framework which combines discriminative modeling, untied weight sharing, and a GAN loss, which we call Adversarial Discriminative Domain Adaptation (ADDA). We show that ADDA is more effective yet considerably simpler than competing domain-adversarial methods, and demonstrate the promise of our approach by exceeding state-of-the-art unsupervised adaptation results on standard domain adaptation tasks as well as a difficult cross-modality object classification task.

Regularization of Neural Networks using DropConnect <=SEP=> We introduce DropConnect, a generalization of Dropout (Hinton et al., 2012), for regularizing large fully-connected layers within neural networks. When training with Dropout, a randomly selected subset of activations are set to zero within each layer. DropConnect instead sets a randomly selected subset of weights within the network to zero. Each unit thus receives input from a random subset of units in the previous layer. We derive a bound on the generalization performance of both Dropout and DropConnect. We then evaluate DropConnect on a range of datasets, comparing to Dropout, and show state-of-the-art results on several image recognition benchmarks by aggregating multiple DropConnect-trained models.

Implications of integrating test-driven development into CS1/CS2 curricula <=SEP=> Many academic and industry professionals have called for more testing in computer science curricula. Test-driven development (TDD) has been proposed as a solution to improve testing in academia. This paper demonstrates how TDD can be integrated into existing course materials without reducing topic coverage. Two controlled experiments were conducted in a CS1/CS2 course in Winter 2008. Following a test-driven learning approach, unit testing was introduced at the beginning of the course and reinforced through example. Results indicate that while student work loads may increase with the incorporation of TDD, students are able to successfully develop unit tests while learning to program.

Quaternion-Based Unscented Kalman Filter for Accurate Indoor Heading Estimation Using Wearable Multi-Sensor System <=SEP=> Inertial navigation based on micro-electromechanical system (MEMS) inertial measurement units (IMUs) has attracted numerous researchers due to its high reliability and independence. The heading estimation, as one of the most important parts of inertial navigation, has been a research focus in this field. Heading estimation using magnetometers is perturbed by magnetic disturbances, such as indoor concrete structures and electronic equipment. The MEMS gyroscope is also used for heading estimation. However, the accuracy of gyroscope is unreliable with time. In this paper, a wearable multi-sensor system has been designed to obtain the high-accuracy indoor heading estimation, according to a quaternion-based unscented Kalman filter (UKF) algorithm. The proposed multi-sensor system including one three-axis accelerometer, three single-axis gyroscopes, one three-axis magnetometer and one microprocessor minimizes the size and cost. The wearable multi-sensor system was fixed on waist of pedestrian and the quadrotor unmanned aerial vehicle (UAV) for heading estimation experiments in our college building. The results show that the mean heading estimation errors are less 10° and 5° to multi-sensor system fixed on waist of pedestrian and the quadrotor UAV, respectively, compared to the reference path.

Mechanical recycling of waste electric and electronic equipment: a review. <=SEP=> The production of electric and electronic equipment (EEE) is one of the fastest growing areas. This development has resulted in an increase of waste electric and electronic equipment (WEEE). In view of the environmental problems involved in the management of WEEE, many counties and organizations have drafted national legislation to improve the reuse, recycling and other forms of recovery of such wastes so as to reduce disposal. Recycling of WEEE is an important subject not only from the point of waste treatment but also from the recovery of valuable materials.WEEE is diverse and complex, in terms of materials and components makeup as well as the original equipment's manufacturing processes. Characterization of this waste stream is of paramount importance for developing a cost-effective and environmentally friendly recycling system. In this paper, the physical and particle properties of WEEE are presented. Selective disassembly, targeting on singling out hazardous and/or valuable components, is an indispensable process in the practice of recycling of WEEE. Disassembly process planning and innovation of disassembly facilities are most active research areas. Mechanical/physical processing, based on the characterization of WEEE, provides an alternative means of recovering valuable materials. Mechanical processes, such as screening, shape separation, magnetic separation, Eddy current separation, electrostatic separation, and jigging have been widely utilized in recycling industry. However, recycling of WEEE is only beginning. For maximum separation of materials, WEEE should be shredded to small, even fine particles, generally below 5 or 10mm. Therefore, a discussion of mechanical separation processes for fine particles is highlighted in this paper. Consumer electronic equipment (brown goods), such as television sets, video recorders, are most common. It is very costly to perform manual dismantling of those products, due to the fact that brown goods contain very low-grade precious metals and copper. It is expected that a mechanical recycling process will be developed for the upgrading of low metal content scraps.

Query Term Suggestion in Academic Search <=SEP=> In this paper, we evaluate query term suggestion in the context of academic professional search. Our overall goal is to support scientists in their information seeking tasks. We set up an interactive search system in which terms are extracted from clicked documents and suggested to the user before every query specification step. We evaluated our method with the iSearch collection of academic information seeking behaviour and crowdsourced term relevance judgements. We found that query term suggestion can significantly improve recall in academic search.

Red Opal: product-feature scoring from reviews <=SEP=> Online shoppers are generally highly task-driven: they have a certain goal in mind, and they are looking for a product with features that are consistent with that goal. Unfortunately, finding a product with specific features is extremely time-consuming using the search functionality provided by existing web sites.In this paper, we present a new search system called Red Opal that enables users to locate products rapidly based on features. Our fully automatic system examines prior customer reviews, identifies product features, and scores each product on each feature. Red Opal uses these scores to determine which products to show when a user specifies a desired product feature. We evaluate our system on four dimensions: precision of feature extraction, efficiency of feature extraction, precision of product scores, and estimated time savings to customers. On each dimension, Red Opal performs better than a comparison system.

Online, interactive learning of gestures for human/robot interfaces <=SEP=> We have developed a gesture recognition system, based on Hidden Markov Models, which can interactively recognize gestures and perform online learning of new gestures. In addition, it is able to update its model of a gesture iteratively with each example it recognizes. This system has demonstrated reliable recognition of 14 di erent gestures after only one or two examples of each. The system is currently interfaced to a Cyberglove for use in recognition of gestures from the sign language alphabet. The system is being implemented as part of an interactive interface for robot teleoperation and programming by example.

Enterprise Architecture: Enabling Integration, Agility And Change <=SEP=> Three core imperatives are essential for modern businesses and organizations: seamless integration of customer and operational processes, agility, and the ability to change. These imperatives are thus relevant in view of successfully executing strategic choices, but all too often not satisfied. Businesses and organizations can be viewed as complex adaptive socio-technical systems. Two fundamentally different perspectives on systems play a role: the functional (black-box) perspective and the constructional (white-box) perspective. Management and governance of businesses and organizations regard the functional, black-box perspective, which is inherently ill-suited for addressing the imperatives mentioned. Rather, establishing system integration, agility and change requires a focus on the system’s design, hence entails the constructional perspective. Both perspectives are relevant. The concept of architecture plays a fundamental role for operationalizing the constructional perspective. Next to the more familiar notion of technology architecture, the concepts of business and organizational architecture are formally introduced and elucidated. In view of the important role of information in customer and operational processes, the notion of information architecture will be additionally discussed, specifically the relationships with other architectures. Various domains within these architectures will be highlighted, whereby the importance of coherence and consistency is stressed, especially in view of the ability to change. Collectively, the four architectures are labeled Enterprise Architecture. Finally, enterprise architecture will be positioned as a crucial means for linking strategy development and execution. The functional and constructional perspective Function and construction A system may be defined as an identifiable bounded set of functionally and/or methodically related elements or principles with a certain operational purpose. Within this definition, a plethora of systems can be mentioned: a payment system, an accounting system, a transport

Compact substrate integrated waveguide based active and passive circularly polarized composite right/left handed leaky wave antennas <=SEP=> Two compact substrate integrated waveguide (SIW) based circularly polarized (CP) composite right/left handed (CRLH) leaky wave antennas (LWAs) are designed and presented. Besides wide-band matching enhancement, the proposed antennas are shortened by 39.8 % along the scanning plane compared to the previous work [1]. Additionally, the current amplitude distribution of the proposed antenna can be controlled by using negative resistance based reflection type amplifiers (RTAs). The compensated uniform distribution yields an enhanced directivity without compromising full space frequency scanning capability.

Crowd Geofencing <=SEP=> Geofencing mechanisms allow for timely message delivery to the visitors of predefined target areas. However, conventional geofencing approaches poorly support mobile data collection scenarios in which experts need in situ assistance. In this paper, we propose crowd geofencing environments, in which a large number of crowdworkers generate geofences to support mobile experts. As a first step to open up the possibilities of crowd geofencing, we have tested its feasibility by collecting more than one thousand geofences in an unfamiliar city prior to the visit to look into urban water and air quality issues. Our experience has revealed the strengths and weaknesses of crowd geofencing in terms of geofence quality and crowd-powered situated actions.

A theorem on polygon cutting with applications <=SEP=> Let P be a simple polygon with N vertices, each being assigned a weight ∈ {0,1}, and let C, the weight of P, be the added weight of all vertices. We prove that it is possible, in O(N) time, to find two vertices a,b in P, such that the segment ab lies entirely inside the polygon P and partitions it into two polygons, each with a weight not exceeding 2C/3. This computation assumes that all the vertices have been sorted along some axis, which can be done in O(Nlog N) time. We use this result to derive a number of efficient divide-and-conquer algorithms for: 1. Triangulating an N-gon in O(Nlog N) time. 2. Decomposing an N-gon into (few) convex pieces in O(Nlog N) time. 3. Given an O(Nlog N) preprocessing, computing the shortest distance between two arbitrary points inside an N-gon (i.e., the internal distance), in O(N) time. 4. Computing the longest internal path in an N-gon in O(N2) time. In all cases, the algorithms achieve significant improvements over previously known methods, either by displaying better performance or by gaining in simplicity. In particular, the best algorithms for Problems 2,3,4, known so far, performed respectively in O(N2), O(N2), and O(N4) time.

Analysis and design of block cipher constructions <=SEP=> This thesis is dedicated to symmetric cryptographic algorithms. The major focus of the work is on block ciphers themselves as well as on hash functions and message authentication codes based on block ciphers. Three main approaches to the cryptanalysis of symmetric cryptographic algorithms are pursued. First, several block cipher constructions are analyzed mathematically using statistical cryptanalysis. Second, practical attacks on real-world symmetric cryptosystems are considered. Finally, novel cryptanalytic techniques using side-channel leakage are studied with applications to block ciphers and message authentication codes. Differential and linear cryptanalyses are well-known statistical attacks on block ciphers. This thesis studies the security of unbalanced Feistel networks with contracting MDS diffusion with respect to differential and linear cryptanalysis. Upper bounds on the differential trail probabilities and linear probabilities of linear trails in such constructions are proven. It is shown that such unbalanced Feistel networks can be highly efficient and are comparable to many known balanced Feistel network constructions with respect to differential and linear cryptanalysis. Ultra-lightweight substitution-permutation networks with diffusion layers based on the co-design of S-boxes and bit permutations are proposed. This results in lightweight block ciphers and block cipher based compression functions for hash functions designed and analyzed. These constructions have very small footprint and can be efficiently implemented on the majority of RFID tags This work also studies practical attacks on real-world symmetric cryptographic systems. Attacks are proposed on the KeeLoq block cipher and authentication systems widely used for automotive access control and component identification. Cryptanalysis of the A5/2 stream cipher used for protecting GSM connections worldwide is performed. Linear slide attacks on KeeLoq are proposed resulting in the fastest known attack on the KeeLoq block cipher working for all keys. Severe weaknesses of the KeeLoq key management are identified. The KeeLoq real-world authentication protocols for access control and component identification are also analyzed. A special-purpose hardware architecture for attacking A5/2 is developed that allows for real-time key recovery within one second for different GSM channels. This engine is based on an optimized hardware algorithm for fast Gaussian elimination over binary finite fields.

Does Music Predictability Improve Spatial-Temporal Reasoning ? <=SEP=> In 1993, it was found that Mozart’s music temporarily enhanced performance on spatialtemporal reasoning tasks. This effect later became termed the Mozart Effect. Since then, the mechanisms of the Mozart Effect have been hotly debated among the scientific community. Recent research has called for studying the Mozart Effect by analyzing music as a series of components. The present study took the components of music into account by testing if predictable music could enhance spatial-temporal reasoning compared to non-predictable music. Participants were administered a task designed to test spatial-temporal reasoning after listening to either predictable or non-predictable music. Additionally, as a control condition, they performed the same task after listening to a short story. Listening to music did not affect reasoning performance, regardless of the predictability of the music. The results indicate that predictability in music alone may not be a major element of the Mozart Effect.

Wireless Hand Gesture Recognition Based on Continuous-Wave Doppler Radar Sensors <=SEP=> Short-range continuous-wave Doppler radar sensors have been mainly used for noncontact detection of various motions. In this paper, we investigate the feasibility to implement the function of a remote mouse, an input device of a computer, by recognizing human gestures based on a dual-channel Doppler radar sensor. Direct conversion architecture, symmetric subcarrier modulation, and bandpass sampling techniques are used to obtain a cost-effective solution. An arcsine algorithm and a motion imaging algorithm are proposed to linearly reconstruct the hand and finger motions in a 2-D plane from the demodulated Doppler phase shifts. Experimental results verified the effectiveness of the proposed architecture and algorithms. Different from the frequency-domain “micro-Doppler” approach, the proposed remote gesture recognition based on linear motion reconstruction is able to recognize definitive signatures for the corresponding motions, exhibiting promising potential in practical applications of human-computer interaction.

Design Optimization of Transverse Flux Linear Motor for Weight Reduction and Performance Improvement Using Response Surface Methodology and Genetic Algorithms <=SEP=> Permanent magnet (PM) type transverse flux linear motors (TFLMs) are electromagnetic devices, which can develop directly powerful linear motion. These motors have been developed to apply to high power system, such as railway traction, electrodynamics vibrator, free-piston generator, etc. This paper presents an optimum design of a PM-type TFLM to reduce the weight of motor with constraints of thrust and detent force using response surface methodology (RSM) and genetic algorithms (GAs). RSM is well adapted to make analytical model of motor weight with constraints of thrust and detent forces, and enable objective function to be easily created and a great computational time to be saved. Finite element computations have been used for numerical experiments on geometrical design variables in order to determine the coefficients of a second-order analytical model for the RSM. GAs are used as a searching tool for design optimization of TFLM to reduce the weight of motor and improve the motor performance.

Glioblastoma multiforme tissue histopathology images based disease stage classification with deep CNN <=SEP=> Recently, many feature extraction methods for histopathology images have been reported for automatic quantitative analysis. One of the severe brain tumors is the Glioblastoma multiforme (GBM) and histopathology tissue images can provide unique insights into identifying and grading disease stages. However, the number of tissue samples to be examined is enormous, and is a burden to pathologists because of tedious manual evaluation traditionally required for efficient evaluation. In this study, we consider feature extraction and disease stage classification for brain tumor histopathology images using automatic image analysis methods. In particular, we utilized an automatic feature extraction and labeling for histopathology imagery data given by The Cancer Genome Atlas (TCGA) and checked the classification accuracy of disease stages in GBM tissue images using deep Convolutional Neural Network (CNN). Experimental results indicate promise in automatic disease stage classification and high level of accuracy were obtained for tested image data.

Template Deformation for Point Cloud Fitting <=SEP=> The reconstruction of high-quality surface meshes from measured data is a vital stage in digital shape processing. We present a new approach to this problem that deforms a template surface to fit a given point cloud. Our method takes a template mesh and a point cloud as input, the latter typically shows missing parts and measurement noise. The deformation process is initially guided by user specified correspondences between template and data, then during iterative fitting new correspondences are established. This approach is based on a Laplacian setting for the template without need of any additional meshing of the data or cross-parameterization. The reconstructed surface fits to the point cloud while it inherits shape properties and topology of the template. We demonstrate the effectiveness of the approach for several point data sets from different sources.

Bystander Responses to a Violent Incident in an Immersive Virtual Environment <=SEP=> Under what conditions will a bystander intervene to try to stop a violent attack by one person on another? It is generally believed that the greater the size of the crowd of bystanders, the less the chance that any of them will intervene. A complementary model is that social identity is critical as an explanatory variable. For example, when the bystander shares common social identity with the victim the probability of intervention is enhanced, other things being equal. However, it is generally not possible to study such hypotheses experimentally for practical and ethical reasons. Here we show that an experiment that depicts a violent incident at life-size in immersive virtual reality lends support to the social identity explanation. 40 male supporters of Arsenal Football Club in England were recruited for a two-factor between-groups experiment: the victim was either an Arsenal supporter or not (in-group/out-group), and looked towards the participant for help or not during the confrontation. The response variables were the numbers of verbal and physical interventions by the participant during the violent argument. The number of physical interventions had a significantly greater mean in the in-group condition compared to the out-group. The more that participants perceived that the Victim was looking to them for help the greater the number of interventions in the in-group but not in the out-group. These results are supported by standard statistical analysis of variance, with more detailed findings obtained by a symbolic regression procedure based on genetic programming. Verbal interventions made during their experience, and analysis of post-experiment interview data suggest that in-group members were more prone to confrontational intervention compared to the out-group who were more prone to make statements to try to diffuse the situation.

Point cloud compression based on hierarchical point clustering <=SEP=> In this work we propose an algorithm for compressing the geometry of a 3D point cloud (3D point-based model). The proposed algorithm is based on the hierarchical clustering of the points. Starting from the input model, it performs clustering to the points to generate a coarser approximation, or a coarser level of detail (LOD). Iterating this clustering process, a sequence of LODs are generated, forming an LOD hierarchy. Then, the LOD hierarchy is traversed top down in a width-first order. For each node encountered during the traversal, the corresponding geometric updates associated with its children are encoded, leading to a progressive encoding of the original model. Special efforts are made in the clustering to maintain high quality of the intermediate LODs. As a result, the proposed algorithm achieves both generic topology applicability and good ratedistortion performance at low bitrates, facilitating its applications for low-end bandwidth and/or platform configurations.

INTERNAL COMPACT PRINTED LOOP ANTENNA WITH MATCHING ELEMENT FOR LAPTOP APPLICATIONS <=SEP=> An internal compact printed loop antenna with matching element is presented for laptop applications. Bending to the printed loop structure is employed to reduce the size of antenna. A matching element is used at backside of the substrate to enhance the bandwidth of the antenna. The matching element is of rectangular shape with inverted U shape slot in it. The proposed antenna with wideband characteristics covers GSM900, GSM1900, UMTS, LTE2300, WLAN, WiMAX 3.3/3.5/3.7 bands and is suitable for laptop applications. The antenna structure is simulated using IE3D software. Keywordsbended; multiband antenna; printed loop antenna; tablet; wideband antenna.

Anti-phishing detection of phishing attacks using genetic algorithm <=SEP=> An approach to detection of phishing hyperlinks using the rule based system formed by genetic algorithm is proposed, which can be utilized as a part of an enterprise solution to anti-phishing. A legitimate webpage owner can use this approach to search the web for suspicious hyperlinks. In this approach, genetic algorithm is used to evolve rules that are used to differentiate phishing link from legitimate link. Evaluating the parameters like evaluation function, crossover and mutation, GA generates a ruleset that matches only the phishing links. This ruleset is stored in a database and a link is reported as a phishing link if it matches any of the rules in the rule based system and thus it keeps safe from fake hackers. Preliminary experiments show that this approach is effective to detect phishing hyperlink with minimal false negatives at a speed adequate for online application.

SDN and OpenFlow for Dynamic Flex-Grid Optical Access and Aggregation Networks <=SEP=> We propose and discuss the extension of software-defined networking (SDN) and OpenFlow principles to optical access/aggregation networks for dynamic flex-grid wavelength circuit creation. The first experimental demonstration of an OpenFlow1.0-based flex-grid λ-flow architecture for dynamic 150 Mb/s per-cell 4 G Orthogonal Frequency Division Multiple Access (OFDMA) mobile backhaul (MBH) overlays onto 10 Gb/s passive optical networks (PON) without optical network unit (ONU)-side optical filtering, amplification, or coherent detection, over 20 km standard single mode fiber (SSMF) with a 1:64 passive split is also detailed. The proposed approach can be attractive for monetizing optical access/aggregation networks via on-demand support for high-speed, low latency, high quality of service (QoS) applications over legacy fiber infrastructure.

Physics Informed Deep Learning (Part I): Data-driven Solutions of Nonlinear Partial Differential Equations <=SEP=> We introduce physics informed neural networks – neural networks that are trained to solve supervised learning tasks while respecting any given law of physics described by general nonlinear partial differential equations. In this two part treatise, we present our developments in the context of solving two main classes of problems: data-driven solution and data-driven discovery of partial differential equations. Depending on the nature and arrangement of the available data, we devise two distinct classes of algorithms, namely continuous time and discrete time models. The resulting neural networks form a new class of data-efficient universal function approximators that naturally encode any underlying physical laws as prior information. In this first part, we demonstrate how these networks can be used to infer solutions to partial differential equations, and obtain physics-informed surrogate models that are fully differentiable with respect to all input coordinates and free parameters.

Children's moral motivation, sympathy, and prosocial behavior. <=SEP=> Two studies investigated the role of children's moral motivation and sympathy in prosocial behavior. Study 1 measured other-reported prosocial behavior and self- and other-reported sympathy. Moral motivation was assessed by emotion attributions and moral reasoning following hypothetical transgressions in a representative longitudinal sample of Swiss 6-year-old children (N = 1,273). Prosocial behavior increased with increasing sympathy, especially if children displayed low moral motivation. Moral motivation and sympathy were also independently related to prosocial behavior. Study 2 extended the findings of Study 1 with a second longitudinal sample of Swiss 6-year-old children (N = 175) using supplementary measures of prosocial behavior, sympathy, and moral motivation. The results are discussed in regard to the precursors of the moral self in childhood.

Earliest Deadline Scheduling for Real-Time Database Systems <=SEP=> Earlier studies have observed that in moderately-loaded real-time database systems, using an Earliest Deadline policy to schedule tasks results in the fewest missed deadlines. When the real-time system is overloaded, however, an Earliest Deadline schedule performs worse than most other policies. This is due to Earliest Deadline giving the highest priority to transactions that are close to missing their deadlines. In this paper, we present a new priority assignment algorithm called Adaptive Earliest Deadline (AED), which features a feedback control mechanism that detects overload conditions and modifies transaction priority assignments accordingly. Using a detailed simulation model, we compare the performance of AED with respect to Earliest Deadline and other fixed priority schemes. We also present and evaluate an extension of the AED algorithm called Hierarchical Earliest Deadline (HED), which is designed to handle applications that assign different values to transactions and where the goal is to maximize the total value of the in-time transactions.

Reinforcement Learning for Spoken Dialogue Systems <=SEP=> Recently, a number of authors have proposed treating dialog ue systems as Markov decision processes (MDPs). However, the practical applica tion of MDP algorithms to dialogue systems faces a number of severe technical chall enges. We have built a general software tool (RLDS, for Reinforcement Learning fo r Dialogue Systems) based on the MDP framework, and have applied it to dialogue co rpora gathered from two dialogue systems built at AT&T Labs. Our experiment s demonstrate that RLDS holds promise as a tool for “browsing” and understandin g correlations in complex, temporally dependent dialogue corpora.