Query: Thoughts on Vehicular Ad Hoc Networks ( VANETs ) in the Real World Traffic Scenarios

Relevant passages:
Vehicular Ad Hoc Networks (VANETs): Challenges and Perspectives <=SEP=> Vehicular ad hoc network (VANET), a subclass of mobile ad hoc networks (MANETs), is a promising approach for future intelligent transportation system (ITS). These networks have no fixed infrastructure and instead rely on the vehicles themselves to provide network functionality. However, due to mobility constraints, driver behavior, and high mobility, VANETs exhibit characteristics that are dramatically different from many generic MANETs. This article provides a comprehensive study of challenges in these networks, which we concentrate on the problems and proposed solutions. Then we outline current state of the research and future perspectives. With this article, readers can have a more thorough understanding of vehicle ad hoc networking and the research trends in this area

Design of 5.9 ghz dsrc-based vehicular safety communication <=SEP=> The automotive industry is moving aggressively in the direction of advanced active safety. Dedicated short-range communication (DSRC) is a key enabling technology for the next generation of communication-based safety applications. One aspect of vehicular safety communication is the routine broadcast of messages among all equipped vehicles. Therefore, channel congestion control and broadcast performance improvement are of particular concern and need to be addressed in the overall protocol design. Furthermore, the explicit multichannel nature of DSRC necessitates a concurrent multichannel operational scheme for safety and non-safety applications. This article provides an overview of DSRC based vehicular safety communications and proposes a coherent set of protocols to address these requirements

Group signatures with verifier-local revocation <=SEP=> Group signatures have recently become important for enabling privacy-preserving attestation in projects such as Microsoft's ngscb effort (formerly Palladium). Revocation is critical to the security of such systems. We construct a short group signature scheme that supports Verifier-Local Revocation (VLR). In this model, revocation messages are only sent to signature verifiers (as opposed to both signers and verifiers). Consequently there is no need to contact individual signers when some user is revoked. This model is appealing for systems providing attestation capabilities. Our signatures are as short as standard RSA signatures with comparable security. Security of our group signature (in the random oracle model) is based on the Strong Diffie-Hellman assumption and the Decision Linear assumption in bilinear groups. We give a precise model for VLR group signatures and discuss its implications.

A Survey of Inter-Vehicle Communication ∗ <=SEP=> As a component of the intelligent transportation system (ITS) and one of the concrete applications of mobile ad hoc networks, inter-vehicle communication (IVC) has attracted research attention from both the academia and industry of, notably, US, EU, and Japan. The most important feature of IVC is its ability to extend the horizon of drivers and on-board devices (e.g., radar or sensors) and, thus, to improve road traffic safety and efficiency. This paper surveys IVC with respect to key enabling technologies ranging from physical radio frequency to group communication primitives and security issues. The mobility models used to evaluate the feasibility of these technologies are also briefly described. We focus on the discussion of various MAC protocols that seem to be indispensable components in the network protocol stack of IVC. By analyzing the application requirements and the protocols built upon the MAC layer to meet these requirements, we also advocate our perspective that ad hoc routing protocols and group communication primitives migrated from wired networks might not be an efficient way to support the envisioned applications, and that new coordination algorithms directly based on MAC could be designed for this purpose.

Detecting Satire in the News with Machine Learning <=SEP=> We built models with Logistic Regression and linear Support Vector Machines on a large dataset consisting of regular news articles and news from satirical websites, and showed that such linear classifiers on a corpus with about 60,000 articles can perform with a precision of 98.7% and a recall of 95.2% on a random test set of the news. On the other hand, when testing the classifier on “publication sources” which are completely unknown during training, only an accuracy of 88.2% and an F1-score of 76.3% are achieved. As another result, we showed that the same algorithm can distinguish between news written by the news agency itself and paid articles from customers. Here the results had an accuracy of 99%.

Dual Grid Array Antennas in a Thin-Profile Package for Flip-Chip Interconnection to Highly Integrated 60-GHz Radios <=SEP=> We examine the current development of highly integrated 60-GHz radios with an interest in antenna-circuit interfaces. We design and analyze grid array antennas with special attention to the differential feeding and the patterned ground plane. More importantly, we integrate two grid array antennas in a package; propose the way of assembling it to the system printed circuit board; and demonstrate a total solution of low cost and thin profile to highly integrated 60-GHz radios. We show that the package in low temperature cofired ceramic (LTCC) technology measures only 13×13×0.575 mm3 ; can carry a 60-GHz radio die of current and future sizes with flip-chip bonding; and achieves good antenna performance in the 60-GHz band with maximum gain of 13.5 and 14.5 dBi for the single-ended and differential antennas, respectively.

NLOS Identification in Range-Based Source Localization: Statistical Approach <=SEP=> Least squares estimation is a widely-used technique for range-based source localization, which obtains the most probable position of mobile station. These methods cannot provide desirable accuracy in the case with a non line of sight (NLOS) path between mobile station and base stations. To circumvent this drawback, many algorithms have been proposed to identify and mitigate this error; however, they have a large run-time overhead. On the other hand, new positioning systems utilize a large set of base stations, and a practical algorithm should be fast enough to deal with them. In this paper, we propose a novel algorithm based on subspace method to identify and eliminate the NLOS error. Simulation studies show that our algorithm is faster and more accurate compared with other conventional methods, especially in the large-scale cases.

Visual Place Recognition: A Survey <=SEP=> Visual place recognition is a challenging problem due to the vast range of ways in which the appearance of real-world places can vary. In recent years, improvements in visual sensing capabilities, an ever-increasing focus on long-term mobile robot autonomy, and the ability to draw on state-of-the-art research in other disciplines-particularly recognition in computer vision and animal navigation in neuroscience-have all contributed to significant advances in visual place recognition systems. This paper presents a survey of the visual place recognition research landscape. We start by introducing the concepts behind place recognition-the role of place recognition in the animal kingdom, how a “place” is defined in a robotics context, and the major components of a place recognition system. Long-term robot operations have revealed that changing appearance can be a significant factor in visual place recognition failure; therefore, we discuss how place recognition solutions can implicitly or explicitly account for appearance change within the environment. Finally, we close with a discussion on the future of visual place recognition, in particular with respect to the rapid advances being made in the related fields of deep learning, semantic scene understanding, and video description.

Defect detection and identification in textile fabrics using Multi Resolution Combined Statistical and Spatial Frequency Method <=SEP=> In textile industry, reliable and accurate quality control and inspection becomes an important element. Presently, this is still accomplished by human experience, which is more time consuming and is also prone to errors. Hence automated visual inspection systems become mandatory in textile industries. This Paper presents a novel algorithm of fabric defect detection by making use of Multi Resolution Combined Statistical and Spatial Frequency Method. Defect detection consists of two phases, first is the training and next is the testing phase. In the training phase, the reference fabric images are cropped into non-overlapping sub-windows. By applying MRCSF the features of the textile fabrics are extracted and stored in the database. During the testing phase the same procedure is applied for test fabric and the features are compared with database information. Based on the comparison results, each sub-window is categorized as defective or non-defective. The classification rate obtained by the process of simulation using MATLAB was found to be 99%.

Concepts Not Alone: Exploring Pairwise Relationships for Zero-Shot Video Activity Recognition <=SEP=> Vast quantities of videos are now being captured at astonishing rates, but the majority of these are not labelled. To cope with such data, we consider the task of content-based activity recognition in videos without any manually labelled examples, also known as zero-shot video recognition. To achieve this, videos are represented in terms of detected visual concepts, which are then scored as relevant or irrelevant according to their similarity with a given textual query. In this paper, we propose a more robust approach for scoring concepts in order to alleviate many of the brittleness and low precision problems of previous work. Not only do we jointly consider semantic relatedness, visual reliability, and discriminative power. To handle noise and non-linearities in the ranking scores of the selected concepts, we propose a novel pairwise order matrix approach for score aggregation. Extensive experiments on the large-scale TRECVID Multimedia Event Detection data show the superiority of our approach.

Strategic human resource management ( SHRM ) practices and its effect on financial performance : evidence from some selected scheduled private commercial banks in Bangladesh <=SEP=> Formulation and execution of Strategic Human Resource Management (SHRM) practices and its effect on perceived financial performance of any organization is a burning issue in the globalized competitive business era. This study aims to find out the relationship between SHRM and financial performance to ensure the sustainability and competitive advantage of the selected scheduled private commercial banks in Bangladesh. The research has been conducted on managers as sample of some private commercial banks during the period of January to November 2012 to collect the primary data. To evaluate the financial performance researchers have used annual reports of 2011 and 2012, journals, web sites etc. as secondary source. Survey research findings indicate that strategic integration and development of HRM were practiced to a full extent in the sampled firms. From the cross sectional analysis, the financial performance indicators show that the capital adequacy was mostly at satisfactory level compared with eh industry average. The quality of assets loan varies from bank to bank but most of them are performing at the desired level. Management efficiency was out-performing the standard in most of the cases. The profitability indicators ratio was also better than the average of private commercial banks. The result presented in this study suggests practicing intensive SHRM so that improved financial performance can be asserted to sustain in the competitive environment.

Design of a haptic arm exoskeleton for training and rehabilitation <=SEP=> A high-quality haptic interface is typically characterized by low apparent inertia and damping, high structural stiffness, minimal backlash, and absence of mechanical singularities in the workspace. In addition to these specifications, exoskeleton haptic interface design involves consideration of space and weight limitations, workspace requirements, and the kinematic constraints placed on the device by the human arm. These constraints impose conflicting design requirements on the engineer attempting to design an arm exoskeleton. In this paper, the authors present a detailed review of the requirements and constraints that are involved in the design of a high-quality haptic arm exoskeleton. In this context, the design of a five-degree-of-freedom haptic arm exoskeleton for training and rehabilitation in virtual environments is presented. The device is capable of providing kinesthetic feedback to the joints of the lower arm and wrist of the operator, and will be used in future work for robot-assisted rehabilitation and training. Motivation for such applications is based on findings that show robot-assisted physical therapy aids in the rehabilitation process following neurological injuries. As a training tool, the device provides a means to implement flexible, repeatable, and safe training methodologies.

Stock Market Classification Model Using Sentiment Analysis on Twitter Based on Hybrid Naive Bayes Classifiers <=SEP=> Sentiment analysis has become one of the most popular process to predict stock market behaviour based on consumer reactions. Concurrently, the availability of data from Twitter has also attracted researchers towards this research area. Most of the models related to sentiment analysis are still suffering from inaccuracies. The low accuracy in classification has a direct effect on the reliability of stock market indicators. The study primarily focuses on the analysis of the Twitter dataset. Moreover, an improved model is proposed in this study; it is designed to enhance the classification accuracy. The first phase of this model is data collection, and the second involves the filtration and transformation, which are conducted to get only relevant data. The most crucial phase is labelling, in which polarity of data is determined and negative, positive or neutral values are assigned to people opinion. The fourth phase is the classification phase in which suitable patterns of the stock market are identified by hybridizing Naïve Bayes Classifiers (NBCs), and the final phase is the performance and evaluation. This study proposes Hybrid Naïve Bayes Classifiers (HNBCs) as a machine learning method for stock market classification. The outcome is instrumental for investors, companies, and researchers whereby it will enable them to formulate their plans according to the sentiments of people. The proposed method has produced a significant result; it has achieved accuracy equals 90.38%.

When and why do retrieval attempts enhance subsequent encoding? <=SEP=> Unsuccessful retrieval attempts can enhance subsequent encoding and learning. In three experiments, subjects either attempted to retrieve word pairs prior to studying them (e.g., attempting to recall tide-? before studying tide-beach) or did not attempt retrieval and retention of the studied targets was assessed on a subsequent cued recall test. Experiment 1 showed that attempting retrieval enhanced subsequent encoding and recall relative to not attempting retrieval when the word pairs were semantically related, but not when the pairs were unrelated. In Experiment 2, studying a different word pair prior to the correct pair (e.g., studying tide-wave prior to tide-beach) did not produce the same effect as attempting retrieval prior to studying. Constraining retrieval to a particular candidate word prior to study (e.g., recalling tide-wa__ before studying tide-beach) produced a negative effect on subsequent recall. Experiment 3 showed that attempting retrieval did not enhance encoding when a brief delay occurred between the retrieval attempt and the subsequent study trial. The results support the idea that a search set of candidates related to the retrieval cue is activated during retrieval and that this retrieval-specific activation can enhance subsequent encoding of those candidates.

A Comparison of learning algorithms on the Arcade Learning Environment <=SEP=> Reinforcement learning agents have traditionally been evaluated on small toy problems. With advances in computing power and the advent of the Arcade Learning Environment, it is now possible to evaluate algorithms on diverse and difficult problems within a consistent framework. We discuss some challenges posed by the arcade learning environment which do not manifest in simpler environments. We then provide a comparison of model-free, linear learning algorithms on this challenging problem set.

The price of power: power seeking and backlash against female politicians. <=SEP=> Two experimental studies examined the effect of power-seeking intentions on backlash toward women in political office. It was hypothesized that a female politician's career progress may be hindered by the belief that she seeks power, as this desire may violate prescribed communal expectations for women and thereby elicit interpersonal penalties. Results suggested that voting preferences for female candidates were negatively influenced by her power-seeking intentions (actual or perceived) but that preferences for male candidates were unaffected by power-seeking intentions. These differential reactions were partly explained by the perceived lack of communality implied by women's power-seeking intentions, resulting in lower perceived competence and feelings of moral outrage. The presence of moral-emotional reactions suggests that backlash arises from the violation of communal prescriptions rather than normative deviations more generally. These findings illuminate one potential source of gender bias in politics.

Filling Knowledge Base Gaps for Distant Supervision of Relation Extraction <=SEP=> Distant supervision has attracted recent interest for training information extraction systems because it does not require any human annotation but rather employs existing knowledge bases to heuristically label a training corpus. However, previous work has failed to address the problem of false negative training examples mislabeled due to the incompleteness of knowledge bases. To tackle this problem, we propose a simple yet novel framework that combines a passage retrieval model using coarse features into a state-of-the-art relation extractor using multi-instance learning with fine features. We adapt the information retrieval technique of pseudorelevance feedback to expand knowledge bases, assuming entity pairs in top-ranked passages are more likely to express a relation. Our proposed technique significantly improves the quality of distantly supervised relation extraction, boosting recall from 47.7% to 61.2% with a consistently high level of precision of around 93% in the experiments.

Clustered Data Management in Virtual Docker Networks Spanning Geo-Redundant Data Centers : A Performance Evaluation Study of Docker Networking <=SEP=> ...................................................................................................................................... iii Acknowledgement ....................................................................................................................... iv Table of

Nonparametric variational inference <=SEP=> Variational methods are widely used for approximate posterior inference. However, their use is typically limited to families of distributions that enjoy particular conjugacy properties. To circumvent this limitation, we propose a family of variational approximations inspired by nonparametric kernel density estimation. The locations of these kernels and their bandwidth are treated as variational parameters and optimized to improve an approximate lower bound on the marginal likelihood of the data. Unlike most other variational approximations, using multiple kernels allows the approximation to capture multiple modes of the posterior. We demonstrate the efficacy of the nonparametric approximation with a hierarchical logistic regression model and a nonlinear matrix factorization model. We obtain predictive performance as good as or better than more specialized variational methods and MCMC approximations. The method is easy to apply to graphical models for which standard variational methods are difficult to derive.

Movie trailer quality evaluation using real-time human electroencephalogram <=SEP=> The total US box office revenue exceeds ten billion dollars a year. Inevitably, new product forecasting and diagnosis have high financially stakes. The motion picture industry has a huge incentive to perform early prediction of movie success or failure. In this paper, we present a study that evaluate viewer responses to short movie trailers using a cap instrumented with Electroencephalogram (EEG) sensors. The method can be used to evaluate prerelease movies regarding how engaging they are to viewers. The primary advantage of our approach is that responses of a viewer can be recorded without any manual inputs from the viewer. The data collected, if analyzed properly, can reveal more accurate information regarding the viewer's emotion states while watching the movie than post-viewing surveys. This approach also enables the delivery of personalized entertainment through the brain interface.

Device analyzer: largescale mobile data collection <=SEP=> We collected usage information from 12,500 Android devices in the wild over the course of nearly 2 years. Our dataset contains 53 billion data points from 894 models of devices running 687 versions of Android. Processing the collected data presents a number of challenges ranging from scalability to consistency and privacy considerations. We present our system architecture for collection and analysis of this highly-distributed dataset, discuss how our system can reliably collect time-series data in the presence of unreliable timing information, and discuss issues and lessons learned that we believe apply to many other big data collection projects.

A fast procedure for computing the distance between complex objects in three-dimensional space <=SEP=> An efficient and reliable algorithm for computing the Euclidean distance between a pair of convex sets in Rm is described. Extensive numerical experience with a broad family of polytopes in R 3 shows that the computational cost is approximately linear in the total number of vertices specifying the two polytopes. The algorithm has special features which makes its application in a variety of robotics problems attractive. These are discussed and an example of collision

Real-time capable methods to determine the magnet temperature of permanent magnet synchronous motors — A review <=SEP=> The permanent magnet synchronous motor (PMSM) is widely used in highly utilised automotive traction drives and other industrial applications. With regards to the device life-time, safe operation and control performance, the magnet temperature is of great interest. Since a direct magnet temperature measurement is not feasible in most cases, this contribution gives a review on state-of-the-art model-based magnet temperature determination methods in PMSM. In this context, the existing publications can be classified into thermal models, flux observers and voltage signal injection approaches. Firstly, brief introductions of these methods are given, followed by a direct comparison regarding drawbacks and benefits. Finally, this contribution concludes with an outlook of potential further investigations in this research field.

Docker Layer Placement for On-Demand Provisioning of Services on Edge Clouds <=SEP=> Driven by the increasing popularity of the microservice architecture, we see an increase in services with unknown demand pattern located in the edge network. Pre-deployed instances of such services would be idle most of the time, which is economically infeasible. Also, the finite storage capacity limits the amount of deployed instances we can offer. Instead, we present an on-demand deployment scheme using the Docker platform. In Docker, service images consist of layers, each layer adding specific functionality. This allows different services to reuse layers, avoiding cluttering the storages with redundant replicas. We propose a layer placement method which allows users to connect to a server, retrieve all necessary layers -possibly from multiple locations- and deploy an instance of the requested service within the desired response time. We search for the best layer placement which maximizes the satisfied demand given the storage and delay constraints. We developed an iterative optimization heuristic which is less exhaustive by dividing the global problem in smaller subproblems. Our simulation results show that our heuristic is able to solve the problem with less system resources. Last, we present interesting use-cases to use this approach in real-life scenarios.

FPGA Implementations of the Round Two SHA-3 Candidates <=SEP=> The second round of the NIST-run public competition is underway to find a new hash algorithm(s) for inclusion in the NIST Secure Hash Standard (SHA-3). This paper presents the full implementations of all of the second round candidates in hardware with all of their variants. In order to determine their computational efficiency, an important aspect in NIST's round two evaluation criteria, this paper gives an area/speed comparison of each design both with and without a hardware interface, thereby giving an overall impression of their performance in resource constrained and resource abundant environments. The implementation results are provided for a Virtex-5 FPGA device. The efficiency of the architectures for the hash functions are compared in terms of throughput per unit area.

Depression and Psychosocial Risk Factors among Community-Dwelling Older Adults in Singapore. <=SEP=> Depression is the most common mental and emotional disorder that emerges in the late stages of life. It is closely associated with poor health, disability, mortality, and suicide. The study examines the risk factors of depression in late life, especially the psychosocial factors, among a sample comprising 162 community-dwelling Singaporean adults aged 65 years and above. An interview-based structured survey was conducted in multiple senior activity centers located in different parts of Singapore. Results from the hierarchical regression analysis show that 32.9% of the variance in geriatric depression can be explained by the three psychosocial factors, among which loneliness, perceived social support, and the emotional regulation component of resilience are significantly associated with depression in older adults. Large-scale studies should be conducted to confirm the findings of the present study, and to further examine the predictive effects of these psychosocial factors on depression among older adults.

The least mean fourth (LMF) adaptive algorithm and its family <=SEP=> New steepest descent algorithms for adaptive filtering and have been devised which allow error minimization in the mean fourth and mean sixth, etc., sense. During adaptation, the weights undergo exponential relaxation toward their optimal solutions. T ime constants have been derived, and surprisingly they turn out to be proportional to the time constants that would have been obtained if the steepest descent least mean square (LMS) algorithm of Widrow and Hoff had been used. The new gradient algorithms are insignificantly more complicated to program and to compute than the LMS algorithm. Their general form is W J+l = w, t 2plqK-lx,, where W, is the present weight vector, W, + 1 is the next weight vector, r, is the present error, X, is the present input vector, u is a constant controlling stability and rate of convergence, and 2 K is the exponent of the error being minimized. Conditions have been derived for weight-vector convergence of the mean and of the variance for the new gradient algorithms. The behavior of the least mean fourth (LMF) algorithm is of special interest. In comparing this algorithm to the LMS algorithm, when both are set to have exactly the same time constants for the weight relaxation process, the LMF algorithm, under some circumstances, will have a substantially lower weight noise than the LMS algorithm. It is possible, therefore, that a min imum mean fourth error algorithm can do a better job of least squares estimation than a mean square error algorithm. This intriguing concept has implications for all forms of adaptive algorithms, whether they are based on steepest descent or otherwise.

Towards Linked Research Data: an Institutional Approach <=SEP=> For Open Science to be widely adopted, a strong institutional support for scientists will be essential. Bielefeld University and the associated Center of Excellence Cognitive Interaction Technology (CITEC) have developed a platform that enables researchers to manage their publications and the underlying research data in an easy and efficient way. Following a Linked Data approach we integrate this data into a unified linked data store and interlink it with additional data sources from inside the university and outside sources like DBpedia. Based on the existing platform, a concrete case study from the domain of biology is implemented that releases optical motion tracking data of stick insect locomotion. We investigate the cost and usefulness of such a detailed, domain-specific semantic enrichment in order to evaluate whether this approach might be considered for large-scale deployment.

Efficient Exploratory Learning of Inverse Kinematics on a Bionic Elephant Trunk <=SEP=> We present an approach to learn the inverse kinematics of the “bionic handling assistant”-an elephant trunk robot. This task comprises substantial challenges including high dimensionality, restrictive and unknown actuation ranges, and nonstationary system behavior. We use a recent exploration scheme, online goal babbling, which deals with these challenges by bootstrapping and adapting the inverse kinematics on the fly. We show the success of the method in extensive real-world experiments on the nonstationary robot, including a novel combination of learning and traditional feedback control. Simulations further investigate the impact of nonstationary actuation ranges, drifting sensors, and morphological changes. The experiments provide the first substantial quantitative real-world evidence for the success of goal-directed bootstrapping schemes, moreover with the challenge of nonstationary system behavior. We thereby provide the first functioning control concept for this challenging robot platform.