Query: ContexloT: Towards Providing Contextual Integrity to Appified IoT Platforms

Relevant passages:
FlowFence: Practical Data Protection for Emerging IoT Application Frameworks <=SEP=> Emerging IoT programming frameworks enable building apps that compute on sensitive data produced by smart homes and wearables. However, these frameworks only support permission-based access control on sensitive data, which is ineffective at controlling how apps use data once they gain access. To address this limitation, we present FlowFence, a system that requires consumers of sensitive data to declare their intended data flow patterns, which it enforces with low overhead, while blocking all other undeclared flows. FlowFence achieves this by explicitly embedding data flows and the related control flows within app structure. Developers use FlowFence support to split their apps into two components: (1) A set of Quarantined Modules that operate on sensitive data in sandboxes, and (2) Code that does not operate on sensitive data but orchestrates execution by chaining Quarantined Modules together via taint-tracked opaque handles—references to data that can only be dereferenced inside sandboxes. We studied three existing IoT frameworks to derive key functionality goals for FlowFence, and we then ported three existing IoT apps. Securing these apps using FlowFence resulted in an average increase in size from 232 lines to 332 lines of source code. Performance results on ported apps indicate that FlowFence is practical: A face-recognition based doorcontroller app incurred a 4.9% latency overhead to recognize a face and unlock a door.

Smart Locks: Lessons for Securing Commodity Internet of Things Devices <=SEP=> We examine the security of home smart locks: cyber-physical devices that replace traditional door locks with deadbolts that can be electronically controlled by mobile devices or the lock manufacturer's remote servers. We present two categories of attacks against smart locks and analyze the security of five commercially-available locks with respect to these attacks. Our security analysis reveals that flaws in the design, implementation, and interaction models of existing locks can be exploited by several classes of adversaries, allowing them to learn private information about users and gain unauthorized home access. To guide future development of smart locks and similar Internet of Things devices, we propose several defenses that mitigate the attacks we present. One of these defenses is a novel approach to securely and usably communicate a user's intended actions to smart locks, which we prototype and evaluate. Ultimately, our work takes a first step towards illuminating security challenges in the system design and novel functionality introduced by emerging IoT systems.

Unauthorized origin crossing on mobile platforms: threats and mitigation <=SEP=> With the progress in mobile computing, web services are increasingly delivered to their users through mobile apps, instead of web browsers. However, unlike the browser, which enforces origin-based security policies to mediate the interactions between the web content from different sources, today's mobile OSes do not have a comparable security mechanism to control the cross-origin communications between apps, as well as those between an app and the web. As a result, a mobile user's sensitive web resources could be exposed to the harms from a malicious origin. In this paper, we report the first systematic study on this mobile cross-origin risk. Our study inspects the main cross-origin channels on Android and iOS, including intent, scheme and web-accessing utility classes, and further analyzes the ways popular web services (e.g., Facebook, Dropbox, etc.) and their apps utilize those channels to serve other apps. The research shows that lack of origin-based protection opens the door to a wide spectrum of cross-origin attacks. These attacks are unique to mobile platforms, and their consequences are serious: for example, using carefully designed techniques for mobile cross-site scripting and request forgery, an unauthorized party can obtain a mobile user's Facebook/Dropbox authentication credentials and record her text input. We report our findings to related software vendors, who all acknowledged their importance. To address this threat, we designed an origin-based protection mechanism, called Morbs, for mobile OSes. Morbs labels every message with its origin information, lets developers easily specify security policies, and enforce the policies on the mobile channels based on origins. Our evaluation demonstrates the effectiveness of our new technique in defeating unauthorized origin crossing, its efficiency and the convenience for the developers to use such protection.

Aurasium: Practical Policy Enforcement for Android Applications <=SEP=> The increasing popularity of Google’s mobile platform Android makes it the prime target of the latest surge in mobile malware. Most research on enhancing the platform’s security and privacy controls requires extensive modification to the operating system, which has significant usability issues and hinders efforts for widespread adoption. We develop a novel solution called Aurasium that bypasses the need to modify the Android OS while providing much of the security and privacy that users desire. We automatically repackage arbitrary applications to attach user-level sandboxing and policy enforcement code, which closely watches the application’s behavior for security and privacy violations such as attempts to retrieve a user’s sensitive information, send SMS covertly to premium numbers, or access malicious IP addresses. Aurasium can also detect and prevent cases of privilege escalation attacks. Experiments show that we can apply this solution to a large sample of benign and malicious applications with a near 100 percent success rate, without significant performance and space overhead. Aurasium has been tested on three versions of the Android OS, and is freely available.

Lessons learned from the deployment of a smartphone-based access-control system <=SEP=> Grey is a smartphone-based system by which a user can exercise her authority to gain access to rooms in our university building, and by which she can delegate that authority to other users. We present findings from a trial of Grey, with emphasis on how common usability principles manifest themselves in a smartphone-based security application. In particular, we demonstrate aspects of the system that gave rise to failures, misunderstandings, misperceptions, and unintended uses; network effects and new flexibility enabled by Grey; and the implications of these for user behavior. We argue that the manner in which usability principles emerged in the context of Grey can inform the design of other such applications.

NL-InSAR: Nonlocal Interferogram Estimation <=SEP=> Interferometric synthetic aperture radar (SAR) data provide reflectivity, interferometric phase, and coherence images, which are paramount to scene interpretation or low-level processing tasks such as segmentation and 3-D reconstruction. These images are estimated in practice from a Hermitian product on local windows. These windows lead to biases and resolution losses due to the local heterogeneity caused by edges and textures. This paper proposes a nonlocal approach for the joint estimation of the reflectivity, the interferometric phase, and the coherence images from an interferometric pair of coregistered single-look complex (SLC) SAR images. Nonlocal techniques are known to efficiently reduce noise while preserving structures by performing the weighted averaging of similar pixels. Two pixels are considered similar if the surrounding image patches are “resembling.” Patch similarity is usually defined as the Euclidean distance between the vectors of graylevels. In this paper, a statistically grounded patch-similarity criterion suitable to SLC images is derived. A weighted maximum likelihood estimation of the SAR interferogram is then computed with weights derived in a data-driven way. Weights are defined from the intensity and interferometric phase and are iteratively refined based both on the similarity between noisy patches and on the similarity of patches from the previous estimate. The efficiency of this new interferogram construction technique is illustrated both qualitatively and quantitatively on synthetic and true data.

Pattern Recognition: Possible Research Areas and Issues <=SEP=> Pattern recognition is a tough problem for computers, although humans are wired for it. Pattern recognition is becoming increasingly important in the age of automation and information handling and retrieval. This paper reviews possible application areas of Pattern recognition. Author covers various sub-disciplines of pattern recognition based on learning methods, such as supervised, unsupervised, semi-supervised learning and key research areas such as grammar induction. Novel solutions to these possible problems could be well deployed for character recognition, speech analysis, man and machine diagnostics, person identification, industrial inspection and so on. The paper concludes with brief discussion on open issues that need to be addressed by future researchers.

A Dataset for Web-Scale Knowledge Base Population <=SEP=> For many domains, structured knowledge is in short supply, while unstructured text is plentiful. Knowledge Base Population (KBP) is the task of building or extending a knowledge base from text, and systems for KBP have grown in capability and scope. However, existing datasets for KBP are all limited by multiple issues: small in size, not open or accessible, only capable of benchmarking a fraction of the KBP process, or only suitable for extracting knowledge from title-oriented documents (documents that describe a particular entity, such as Wikipedia pages). We introduce and release CC-DBP, a web-scale dataset for training and benchmarking KBP systems. The dataset is based on Common Crawl as the corpus and DBpedia as the target knowledge base. Critically, by releasing the tools to build the dataset, we enable the dataset to remain current as new crawls and DBpedia dumps are released. Also, the modularity of the released tool set resolves a crucial tension between the ease that a dataset can be used for a particular subtask in KBP and the number of different subtasks it can be used to train or benchmark.

WebGLStudio: a pipeline for WebGL scene creation <=SEP=> We present WebGLStudio - a pipeline for the creation and editing of high-quality 3D scenes using WebGL. The pipeline features a 3D Scene-Graph rendering engine; an interactive scene editor allowing detailed setup and configuration of assets in real-time; a web-based asset manager; and a stand-alone rendering module ready to embedded in target applications. We further present a series of implementational details discovered to overcome limitations of the web browser context to enable realistic rendering and performance. The principal contribution of this work to the graphics community is the methodology used to take advantage of several unique aspects of Javascript when used as a 3D programming language; and the demonstration of possibilities involved in real-time editing of the parameters of materials, shaders and post-processing effects, in order for the user/artist to create a 3D scene as desired.

BOSCH RARE SOUND EVENTS DETECTION SYSTEMS FOR DCASE 2017 CHALLENGE <=SEP=> In this report, we describe three systems designed at BOSCH for rare audio sound events detection task of DCASE 2017 challenge. The first system is an end-to-end audio event segmentation using embeddings based on deep convolutional neural network (DCNN) and deep recurrent neural network (DRNN) trained on Mel-filter banks and spectogram features. Both system 2 and 3 contain two parts: audio event tagging and audio event segmentation. Audio event tagging selects the positive audio recordings (containing audio events), which are later processed by the audio segmentation part. Feature selection method has been deployed to select a subset of features in both systems. System 2 employs Dilated convolutional neural network on the selected features for audio tagging, and an audio-codebook approach to convert audio features to audio vectors (Audio2vec system) which are then passed to an LSTM network for audio events boundary prediction. System 3 is based on multiple instance learning problem using variational auto encoder (VAE) to perform audio event tagging and segmentation. Similar to system 2, here a LSTM network is used for audio segmentation. Finally, we have utilized models based on score-fusion among different systems to improve the final results.

Semantic homophily in online communication: Evidence from Twitter <=SEP=> People are observed to assortatively connect on a set of traits. This phenomenon, termed assortative mixing or sometimes homophily, can be quantified through assortativity coefficient in social networks. Uncovering the exact causes of strong assortative mixing found in social networks has been a research challenge. Among the main suggested causes from sociology are the tendency of similar individuals to connect (often itself referred as homophily) and the social influence among already connected individuals. Distinguishing between these tendencies and other plausible causes and quantifying their contribution to the amount of assortative mixing has been a difficult task, and proven not even possible from observational data. However, another task of similar importance to researchers and in practice can be tackled, as we present here: understanding the exact mechanisms of interplay between these tendencies and the underlying social network structure. Namely, in addition to the mentioned assortativity coefficient, there are several other static and temporal network properties and substructures that can be linked to the tendencies of homophily and social influence in the social network and we herein investigate those. Concretely, we tackle a computer-mediated communication network (based on Twitter mentions) and a particular type of assortative mixing that can be inferred from the semantic features of communication content that we term semantic homophily. Our work, to the best of our knowledge, is the first to offer an in-depth analysis on semantic homophily in a communication network and the interplay between them. We quantify diverse levels of semantic homophily, identify the semantic aspects that are the drivers of observed homophily, show insights in its temporal evolution and finally, we present its intricate interplay with the communication network on Twitter. By analyzing these mechanisms we increase understanding on what are the semantic aspects that shape and how they shape the human computer-mediated communication. In addition, our analysis framework presented on this concrete case can be easily adapted, extended and applied on other type of social networks and for different types of homophily.

An Iterative Algorithm for Camera Pose Estimation with Lie Group Representation <=SEP=> For solving camera pose problem, a novel accurate and fast pose estimation algorithm based on Lie group representation is proposed. Firstly, object function based on total space error of all feature points is built. Secondly, object function is linearized based on Lie group representation. The Jacobian matrix of camera pose is deduced and pose parameters are updated. Finally, the computation efficiency of algorithm is promoted by using Kronecker product to optimize the iteration process. Simulation and real experiments show that the proposed algorithm is able to obtain camera pose with high precision, but consumes less time compared with the existing algorithms. The proposed algorithm is capable of estimating camera pose with high precision and efficiency.

Accurate human motion capture in large areas by combining IMU- and laser-based people tracking <=SEP=> A large number of applications use motion capture systems to track the location and the body posture of people. For instance, the movie industry captures actors to animate virtual characters that perform stunts. Today's tracking systems either operate with statically mounted cameras and thus can be used in confined areas only or rely on inertial sensors that allow for free and large-scale motion but suffer from drift in the pose estimate. This paper presents a novel tracking approach that aims to provide globally aligned full body posture estimates by combining a mobile robot and an inertial motion capture system. In our approach, a mobile robot equipped with a laser scanner is used to anchor the pose estimates of a person given a map of the environment. It uses a particle filter to globally localize a person wearing a motion capture suit and to robustly track the person's position. To obtain a smooth and globally aligned trajectory of the person, we solve a least squares optimization problem formulated from the motion capture suite and tracking data. Our approach has been implemented on a real robot and exhaustively tested. As the experimental evaluation shows, our system is able to provide locally precise and globally aligned estimates of the person's full body posture.

Predicting the severity of a reported bug <=SEP=> The severity of a reported bug is a critical factor in deciding how soon it needs to be fixed. Unfortunately, while clear guidelines exist on how to assign the severity of a bug, it remains an inherent manual process left to the person reporting the bug. In this paper we investigate whether we can accurately predict the severity of a reported bug by analyzing its textual description using text mining algorithms. Based on three cases drawn from the open-source community (Mozilla, Eclipse and GNOME), we conclude that given a training set of sufficient size (approximately 500 reports per severity), it is possible to predict the severity with a reasonable accuracy (both precision and recall vary between 0.65–0.75 with Mozilla and Eclipse; 0.70–0.85 in the case of GNOME).

BLASX: A High Performance Level-3 BLAS Library for Heterogeneous Multi-GPU Computing <=SEP=> Basic Linear Algebra Subprograms (BLAS) are a set of low level linear algebra kernels widely adopted by applications involved with the deep learning and scientific computing. The massive and economic computing power brought forth by the emerging GPU architectures drives interest in implementation of compute-intensive level 3 BLAS on multi-GPU systems. In this paper, we investigate existing multi-GPU level 3 BLAS and present that 1) issues, such as the improper load balancing, inefficient communication, insufficient GPU stream level concurrency and data caching, impede current implementations from fully harnessing heterogeneous computing resources; 2) and the inter-GPU Peer-to-Peer(P2P) communication remains unexplored. We then present BLASX: a highly optimized multi-GPU level-3 BLAS. We adopt the concepts of algorithms-by-tiles treating a matrix tile as the basic data unit and operations on tiles as the basic task. Tasks are guided with a dynamic asynchronous runtime, which is cache and locality aware. The communication cost under BLASX becomes trivial as it perfectly overlaps communication and computation across multiple streams during asynchronous task progression. It also takes the current tile cache scheme one step further by proposing an innovative 2-level hierarchical tile cache, taking advantage of inter-GPU P2P communication. As a result, linear speedup is observable with BLASX under multi-GPU configurations; and the extensive benchmarks demonstrate that BLASX consistently outperforms the related leading industrial and academic implementations such as cuBLAS-XT, SuperMatrix, MAGMA.

Self-Attentional Acoustic Models <=SEP=> Self-attention is a method of encoding sequences of vectors by relating these vectors to each-other based on pairwise similarities. These models have recently shown promising results for modeling discrete sequences, but they are non-trivial to apply to acoustic modeling due to computational and modeling issues. In this paper, we apply self-attention to acoustic modeling, proposing several improvements to mitigate these issues: First, self-attention memory grows quadratically in the sequence length, which we address through a downsampling technique. Second, we find that previous approaches to incorporate position information into the model are unsuitable and explore other representations and hybrid models to this end. Third, to stress the importance of local context in the acoustic signal, we propose a Gaussian biasing approach that allows explicit control over the context range. Experiments find that our model approaches a strong baseline based on LSTMs with networkin-network connections while being much faster to compute. Besides speed, we find that interpretability is a strength of selfattentional acoustic models, and demonstrate that self-attention heads learn a linguistically plausible division of labor.

Peginterferon alfa-2a plus ribavirin for chronic hepatitis C virus infection. <=SEP=> BACKGROUND
Treatment with peginterferon alfa-2a alone produces significantly higher sustained virologic responses than treatment with interferon alfa-2a alone in patients with chronic hepatitis C virus (HCV) infection. We compared the efficacy and safety of peginterferon alfa-2a plus ribavirin, interferon alfa-2b plus ribavirin, and peginterferon alfa-2a alone in the initial treatment of chronic hepatitis C.


METHODS
A total of 1121 patients were randomly assigned to treatment and received at least one dose of study medication, consisting of 180 microg of peginterferon alfa-2a once weekly plus daily ribavirin (1000 or 1200 mg, depending on body weight), weekly peginterferon alfa-2a plus daily placebo, or 3 million units of interferon alfa-2b thrice weekly plus daily ribavirin for 48 weeks.


RESULTS
A significantly higher proportion of patients who received peginterferon alfa-2a plus ribavirin had a sustained virologic response (defined as the absence of detectable HCV RNA 24 weeks after cessation of therapy) than of patients who received interferon alfa-2b plus ribavirin (56 percent vs. 44 percent, P<0.001) or peginterferon alfa-2a alone (56 percent vs. 29 percent, P<0.001). The proportions of patients with HCV genotype 1 who had sustained virologic responses were 46 percent, 36 percent, and 21 percent, respectively, for the three regimens. Among patients with HCV genotype 1 and high base-line levels of HCV RNA, the proportions of those with sustained virologic responses were 41 percent, 33 percent, and 13 percent, respectively. The overall safety profiles of the three treatment regimens were similar; the incidence of influenza-like symptoms and depression was lower in the groups receiving peginterferon alfa-2a than in the group receiving interferon alfa-2b plus ribavirin.


CONCLUSIONS
In patients with chronic hepatitis C, once-weekly peginterferon alfa-2a plus ribavirin was tolerated as well as interferon alfa-2b plus ribavirin and produced significant improvements in the rate of sustained virologic response, as compared with interferon alfa-2b plus ribavirin or peginterferon alfa-2a alone.

The New Algorithms of Weighted Association Rules based on Apriori and FP-Growth Methods <=SEP=> In order to improve the frequent itemsets generated layer-wise efficiency, the paper uses the Apriori property to reduce the search space. FP-grow algorithm for mining frequent pattern steps mainly is divided into two steps: FP-tree and FP-tree to construct a recursive mining. Algorithm FP-Growth is to avoid the high cost of candidate itemsets generation, fewer, more efficient scanning. The paper puts forward the new algorithms of weighted association rules based on Apriori and FP-Growth methods. In the same support, this method is the most effective and stable maximum frequent itemsets mining capacity and minimum execution time. Through theoretical analysis and experimental simulation of the performance of the algorithm is discussed, it is proved that the algorithm is feasible and effective.

Athlete: A cargo handling and manipulation robot for the moon <=SEP=> 

A framework for thermal building parameter identification and simulation <=SEP=> Studies related to Smart Energy technologies have been highlighted in the last years, specially by significantly contributing to the saving of energy consumption, to the reduction of CO2 emissions and to the diminishing of the paid values in electricity bills. The electrical-thermal analogy can be used in order to simulate heating behavior in real situations and it also may be considered a contributor to Smart Energy technologies. This is the reason why several simulation tools are used. Taking this into account, this paper presents a framework using NGSpice simulator to identify both, the thermal capacitance and the thermal resistance parameters from a hypothetical monitored room which in a Smart Building context. The results from the proposed framework are compared to OpenModelica software and to the contributions from literature.

Estimating types in binaries using predictive modeling <=SEP=> Reverse engineering is an important tool in mitigating vulnerabilities in binaries. As a lot of software is developed in object-oriented languages, reverse engineering of object-oriented code is of critical importance. One of the major hurdles in reverse engineering binaries compiled from object-oriented code is the use of dynamic dispatch. In the absence of debug information, any dynamic dispatch may seem to jump to many possible targets, posing a significant challenge to a reverse engineer trying to track the program flow. We present a novel technique that allows us to statically determine the likely targets of virtual function calls. Our technique uses object tracelets – statically constructed sequences of operations performed on an object – to capture potential runtime behaviors of the object. Our analysis automatically pre-labels some of the object tracelets by relying on instances where the type of an object is known. The resulting type-labeled tracelets are then used to train a statistical language model (SLM) for each type.We then use the resulting ensemble of SLMs over unlabeled tracelets to generate a ranking of their most likely types, from which we deduce the likely targets of dynamic dispatches.We have implemented our technique and evaluated it over real-world C++ binaries. Our evaluation shows that when there are multiple alternative targets, our approach can drastically reduce the number of targets that have to be considered by a reverse engineer.

AXIAL-FLUX PERMANENT-MAGNET MOTOR DESIGN FOR ELECTRIC VEHICLE DIRECT DRIVE USING SIZING EQUATION AND FINITE ELEMENT ANALYSIS <=SEP=> The design process of a double-sided slotted TORUS axialflux permanent-magnet (AFPM) motor suitable for direct drive of electric vehicle (EV) is presented. It used sizing equation and Finite Element Analysis (FEA). AFPM motor is a high-torque-density motor easily mounted compactly onto a vehicle wheel, fitting the wheel rim perfectly. A preliminary design is a double-sided slotted AFPM motor with 6 rotor poles for high torque-density and stable rotation. In determining the design requirements, a simple vehicle-dynamics model that evaluates vehicle performance through the typical cruising trip of an automobile was considered. To obtain, with the highest possible torque, the initial design parameters of the motor, AFPM’s fundamental theory and sizing equation were applied. Vector Field Opera-3D 14.0 commercial software ran the FEA of the motor design, evaluating and enhancing accuracy of the design parameters. Results of the FEA simulation were compared with those obtained from the sizing equation; at no-load condition, the flux density at every part of the motor agreed. The motor’s design meets all the requirements and limits of EV, and fits the shape and size of a classical-vehicle wheel rim. The design process is comprehensive and can be used for an arbitrary EV with an arbitrary cruising scenario.

Hybrid context-sensitivity for points-to analysis <=SEP=> Context-sensitive points-to analysis is valuable for achieving high precision with good performance. The standard flavors of context-sensitivity are call-site-sensitivity (kCFA) and object-sensitivity. Combining both flavors of context-sensitivity increases precision but at an infeasibly high cost. We show that a selective combination of call-site- and object-sensitivity for Java points-to analysis is highly profitable. Namely, by keeping a combined context only when analyzing selected language features, we can closely approximate the precision of an analysis that keeps both contexts at all times. In terms of speed, the selective combination of both kinds of context not only vastly outperforms non-selective combinations but is also faster than a mere object-sensitive analysis. This result holds for a large array of analyses (e.g., 1-object-sensitive, 2-object-sensitive with a context-sensitive heap, type-sensitive) establishing a new set of performance/precision sweet spots.

Multimodal Machine Learning: A Survey and Taxonomy <=SEP=> Our experience of the world is multimodal - we see objects, hear sounds, feel texture, smell odors, and taste flavors. Modality refers to the way in which something happens or is experienced and a research problem is characterized as multimodal when it includes multiple such modalities. In order for Artificial Intelligence to make progress in understanding the world around us, it needs to be able to interpret such multimodal signals together. Multimodal machine learning aims to build models that can process and relate information from multiple modalities. It is a vibrant multi-disciplinary field of increasing importance and with extraordinary potential. Instead of focusing on specific multimodal applications, this paper surveys the recent advances in multimodal machine learning itself and presents them in a common taxonomy. We go beyond the typical early and late fusion categorization and identify broader challenges that are faced by multimodal machine learning, namely: representation, translation, alignment, fusion, and co-learning. This new taxonomy will enable researchers to better understand the state of the field and identify directions for future research.

Probabilistic neural networks <=SEP=> -By replacing the sigmoid activation function often used in neural networks with an exponential function, a probabilistic neural network ( PNN) that can compute nonlinear decision boundaries which approach the Bayes optimal is formed. Alternate activation functions having similar properties are also discussed. A fourlayer neural network of the type proposed can map any input pattern to any number of classifications. The decision boundaries can be modified in real-time using new data as they become available, and can be implemented using artificial hardware "'neurons" that operate entirely in parallel. Provision is also made for estimating the probability and reliability of a classification as well as making the decision. The technique offers a tremendous speed advantage for problems in which the incremental adaptation time of back propagation is a significant fraction of the total computation time. For one application, the PNN paradigm was 200,000 times faster than back-propagation. Keywords--Neural network, Probability density function, Parallel processor, "Neuron", Pattern recognition, Parzen window, Bayes strategy, Associative memory.

Multiband antenna for Bluetooth/ZigBee/ Wi-Fi/WiMAX/WLAN/X-band applications: Partial ground with periodic structures and EBG <=SEP=> A compact in size microstrip antenna with multiband resonance features is described in this paper. A circular antenna with the partial ground is used as a primary antenna which resonated for WiMAX band (3.3–3.7 GHz). Further, primary antenna embedded with mushroom shape EBG (Electromagnetic Band Gap) and periodic DGS (Defected Ground Structure) to operate over WLAN band (5.1–5.8 GHz) and X-band from 8–12 GHz. Proposed antenna covers 2.4/3.5/5.5 GHz bands and complete X-band which also reflects that it has novel suitability to use for a ZigBee/Wi-Fi/Bluetooth applications. The proposed antenna is etched on FR-4 substrate and overall dimension is 20×26×1.6 mm3. The projected antenna has wide-ranging bandwidth with VSWR < 2. It provides favorable agreement between measured and simulated results.

Philosophy in the Flesh : The Embodied Mind and its Challenge to Western Thought <=SEP=> Part I supports these sentences with findings from cognitive science "that human reason is a form of animal reason, a reason inextricably tied to our bodies and the peculiarities of our brains" and "that our bodies, brains, and interactions with our environment provide the mostly unconscious basis for our everyday metaphysics, that is, our sense of what is real." The third sentence is a summary of their earlier work on metaphor (Lakoff and Johnson 1980), which in Part II of this book they extend to a more detailed analysis of the metaphors underlying basic philosophical issues, such as time, events and causes, mind, self, and morality. Part III applies that analysis to the metaphors tacitly assumed by philosophers ranging from the Presocratics to Noam Chomsky. Part IV presents arguments for "empirically responsible philosophy" and its potential for understanding "who we are, how we experience our world, and how we ought to live." Finally, the appendix summarizes research inspired by this philosophy that has produced computational simulations of certain aspects of embodied minds. Given such a broad scope, the authors have not been able to cover all the topics with equal success. Instead of challenging all of western philosophy, they should have concentrated on their major opponent, Noam Chomsky and his philosophy of language. Lakoff began his career in linguistics as a student and later a teacher of Chomsky's version of transformational grammar. But in the late 1960s, he joined with other former students to promote generative semantics as an alternative to Chomsky's generative syntax. The result was a series of "linguistic wars," whose history has been retold by various participants over the past twenty years. Chapter 22 of this book presents a strong case against Chomsky's "autonomous syntax" and for an approach that bases syntax on semantics and semantics on the bodily mechanisms of perception and action. The philosophical and linguistic arguments of Chapter 22 are reinforced in the appendix by a summary of the Neural Theory of Language (NTL), which is being developed by Jerome Feldman, George Lakoff, Lokendra Shastri, and their students. To date, the NTL group has undertaken three major tasks in language understanding

A VoIP emergency services architecture and prototype <=SEP=> Providing emergency services in VoIP networks are vital to the success of VoIP. It not only presents design and implementation challenges, but also gives an opportunity to enhance the existing emergency call handling infrastructure. We propose an architecture to deliver emergency services in SIP-based VoIP networks, which can accommodate PSTN calls through PSTN to SIP gateways. Our architecture addresses the issues of identifying emergency calls, determining callers' locations, routing emergency calls to appropriate public safety answering points (PSAPs), and presenting required information to emergency call takers. We have developed a prototype implementation to prove our architecture's feasibility and scalability. We expect to undertake a pilot project at a working PSAP with our implementation once it is thoroughly tested.

Big data analytics on traditional HPC infrastructure using two-level storage <=SEP=> Data-intensive computing has become one of the major workloads on traditional high-performance computing (HPC) clusters. Currently, deploying data-intensive computing software framework on HPC clusters still faces performance and scalability issues. In this paper, we develop a new two-level storage system by integrating Tachyon, an in-memory file system with OrangeFS, a parallel file system. We model the I/O throughputs of four storage structures: HDFS, OrangeFS, Tachyon and two-level storage. We conduct computational experiments to characterize I/O throughput behavior of two-level storage and compare its performance to that of HDFS and OrangeFS, using TeraSort benchmark. Theoretical models and experimental tests both show that the two-level storage system can increase the aggregate I/O throughputs. This work lays a solid foundation for future work in designing and building HPC systems that can provide a better support on I/O intensive workloads with preserving existing computing resources.

Sharp Finite-Time Iterated-Logarithm Martingale Concentration <=SEP=> We give concentration bounds for martingales that are uniform over finite times and extend classical Hoeffding and Bernstein inequalities. We also demonstrate our concentration bounds to be optimal with a matching anti-concentration inequality, proved using the same method. Together these constitute a finite-time version of the law of the iterated logarithm, and shed light on the relationship between it and the central limit theorem.