A Cloud-based Framework for Security Analysis of Browser Extensions

In today's internet world, web browsers are an integral part of our day-to-day activities. Therefore, web browser security is a serious concern for all of us. Browsers can be breached in different ways. Because of the over privileged access, extensions are responsible for many security issues. Browser vendors try to keep safe extensions in their official extension galleries. However, their security control measures are not always effective and adequate. The distribution of unsafe extensions through different social engineering techniques is also a very common practice. Therefore, before installation, users should thoroughly analyze the security of browser extensions. Extensions are not only available for desktop browsers, but many mobile browsers, for example, Firefox for Android and UC browser for Android, are also furnished with extension features. Mobile devices have various resource constraints in terms of computational capabilities, power, network bandwidth, etc. Hence, conventional extension security analysis techniques cannot be efficiently used by end users to examine mobile browser extension security issues. To overcome the inadequacies of the existing approaches, we propose CLOUBEX, a CLOUd-based security analysis framework for both desktop and mobile Browser EXtensions. This framework uses a client-server architecture model. In this framework, compute-intensive security analysis tasks are generally executed in a high-speed computing server hosted in a cloud environment. CLOUBEX is also enriched with a number of essential features, such as client-side analysis, requirements-driven analysis, high performance, and dynamic decision making. At present, the Firefox extension ecosystem is most susceptible to different security attacks. Hence, the framework is implemented for the security analysis of the Firefox desktop and Firefox for Android mobile browser extensions. A static taint analysis is used to identify malicious information flows in the Firefox extensions. In CLOUBEX, there are three analysis modes. A dynamic decision making algorithm assists us to select the best option based on some important parameters, such as the processing speed of a client device and network connection speed. Using the best analysis mode, performance and power consumption are improved significantly. In the future, this framework can be leveraged for the security analysis of other desktop and mobile browser extensions, too.

English essays : from Sir Philip Sidney to Macaulay ; with introductions and notes.

Series title on spine: Harvard classics : the five foot shelf of books.

Referral to rehabilitation following traumatic brain injury: practitioners and the process of decision-making

The study aimed to examine the factors influencing referral to rehabilitation following traumatic brain injury (TBI) by using social problems theory as a conceptual model to focus on practitioners and the process of decision-making in two Australian hospitals. The research design involved semi-structured interviews with 18 practitioners and observations of 10 team meetings, and was part of a larger study on factors influencing referral to rehabilitation in the same settings. Analysis revealed that referral decisions were influenced primarily by practitioners' selection and their interpretation of clinical and non-clinical patient factors. Further, practitioners generally considered patient factors concurrently during an ongoing process of decision-making, with the combinations and interactions of these factors forming the basis for interpretations of problems and referral justifications. Key patient factors considered in referral decisions included functional and tracheostomy status, time since injury, age, family, place of residence and Indigenous status. However, rate and extent of progress, recovery potential, safety and burden of care, potential for independence and capacity to cope were five interpretative themes, which emerged as the justifications for referral decisions. The subsequent negotiation of referral based on patient factors was in turn shaped by the involvement of practitioners. While multi-disciplinary processes of decision-making were the norm, allied health professionals occupied a central role in referral to rehabilitation, and involvement of medical, nursing and allied health practitioners varied. Finally, the organizational pressures and resource constraints, combined with practitioners' assimilation of the broader efficiency agenda were central factors shaping referral. (C) 2004 Elsevier Ltd. All rights reserved.

Multiple paths extraction in images using a constrained expanded trellis

Single shortest path extraction algorithms have been used in a number of areas such as network flow and image analysis. In image analysis, shortest path techniques can be used for object boundary detection, crack detection, or stereo disparity estimation. Sometimes one needs to find multiple paths as opposed to a single path in a network or an image where the paths must satisfy certain constraints. In this paper, we propose a new algorithm to extract multiple paths simultaneously within an image using a constrained expanded trellis (CET) for feature extraction and object segmentation. We also give a number of application examples for our multiple paths extraction algorithm.

Models of adding relations to an organization structure of a complete K-ary tree

This paper proposes three models of adding relations to an organization structure which is a complete K-ary tree of height H: (i) a model of adding an edge between two nodes with the same depth N, (ii) a model of adding edges between every pair of nodes with the same depth N and (iii) a model of adding edges between every pair of siblings with the same depth N. For each of the three models, an optimal depth N* is obtained by maximizing the total shortening path length which is the sum of shortening lengths of shortest paths between every pair of all nodes. (c) 2005 Elsevier B.V. All rights reserved.

Establishing a zone where technology innovation is supported

Learning technologies are now a ubiquitous force in the higher education sector however we continue to pursue more inventive ways to use them for teaching and learning. Many teaching academics that seek to be innovative do not have access to a supportive technology innovation zone. The aim of this study was to investigate the articulated staff development needs of academics involved in a faculty based technology innovation project and create the conditions that would cultivate innovation. The study sought to find out how academics perceived they might best be assisted through their technology innovation process so that participants’ needs were incorporated into planning. A questionnaire was used to elicit background information about the academics’ experience, skills and self diagnosed skill deficits in this context. Participants were also requested to provide information about how they thought they would best acquire the skills given their time and other resource constraints. A modified Delphi Technique was utilised to achieve some consensus on what academics required to support technology innovation. Complemented by an enabling and empowering team based approach, the academics were provided with an innovation zone to achieve significant goals for the project.

Comparing transport emissions and impacts for energy recovery from domestic waste (EfW): centralised and distributed disposal options for two UK Counties

Many local authorities (LAs) are currently working to reduce both greenhouse gas emissions and the amount of municipal solid waste (MSW) sent to landfill. The recovery of energy from waste (EfW) can assist in meeting both of these objectives. The choice of an EfW policy combines spatial and non-spatial decisions which may be handled using Multi-Criteria Analysis (MCA) and Geographic Information Systems (GIS). This paper addresses the impact of transporting MSW to EfW facilities, analysed as part of a larger decision support system designed to make an overall policy assessment of centralised (large-scale) and distributed (local-scale) approaches. Custom-written ArcMap extensions are used to compare centralised versus distributed approaches, using shortest-path routing based on expected road speed. Results are intersected with 1-kilometre grids and census geographies for meaningful maps of cumulative impact. Case studies are described for two counties in the United Kingdom (UK); Cornwall and Warwickshire. For both case study areas, centralised scenarios generate more traffic, fuel costs and emitted carbon per tonne of MSW processed.

Network lifetime maximization with cross-layer design in wireless sensor networks

This paper investigates a cross-layer design approach for minimizing energy consumption and maximizing network lifetime (NL) of a multiple-source and single-sink (MSSS) WSN with energy constraints. The optimization problem for MSSS WSN can be formulated as a mixed integer convex optimization problem with the adoption of time division multiple access (TDMA) in medium access control (MAC) layer, and it becomes a convex problem by relaxing the integer constraint on time slots. Impacts of data rate, link access and routing are jointly taken into account in the optimization problem formulation. Both linear and planar network topologies are considered for NL maximization (NLM). With linear MSSS and planar single-source and single-sink (SSSS) topologies, we successfully use Karush-Kuhn-Tucker (KKT) optimality conditions to derive analytical expressions of the optimal NL when all nodes are exhausted simultaneously. The problem for planar MSSS topology is more complicated, and a decomposition and combination (D&C) approach is proposed to compute suboptimal solutions. An analytical expression of the suboptimal NL is derived for a small scale planar network. To deal with larger scale planar network, an iterative algorithm is proposed for the D&C approach. Numerical results show that the upper-bounds of the network lifetime obtained by our proposed optimization models are tight. Important insights into the NL and benefits of cross-layer design for WSN NLM are obtained.

Investment efficiency among a cross-section of UK firms:implications for the debate on financing constraints

In this paper, we address this policy issue using a stylised methodology that relies on estimates of the cash flow sensitivity of firms’ investment, as well as a relatively new methodology that enables us to generate a (0, 1) bounded measure of investment efficiency of firms, i.e., the efficiency with which firms can convert their sales into investment, after controlling for unobserved year- and industry-specific effects. Higher investment efficiency is associated with lower financing constraint. Our results indicate that there is considerable heterogeneity in investment efficiency across firms, during a given year; the range being 0.57-0.82. However, the average investment efficiency measure is similar across years, regions and NACE 2-digit industries. We also do not find discernible patterns in the relationship between investment efficiency and firm size, both before and during the financial crisis. The results suggest that while some firms are clearly less efficient at translating their performance into investment, broad policies targeting firms of a certain size, or those within a particular industry or region, may not successfully address the problem of financing constraint in the United Kingdom. The targeting of firms with financing constraints may have to be considerably more refined, and look at not easily observable factors such as credit history/events and organisational capacity of the firms.

Unfolding kernel embeddings of graphs:enhancing class separation through manifold learning

In this paper, we investigate the use of manifold learning techniques to enhance the separation properties of standard graph kernels. The idea stems from the observation that when we perform multidimensional scaling on the distance matrices extracted from the kernels, the resulting data tends to be clustered along a curve that wraps around the embedding space, a behavior that suggests that long range distances are not estimated accurately, resulting in an increased curvature of the embedding space. Hence, we propose to use a number of manifold learning techniques to compute a low-dimensional embedding of the graphs in an attempt to unfold the embedding manifold, and increase the class separation. We perform an extensive experimental evaluation on a number of standard graph datasets using the shortest-path (Borgwardt and Kriegel, 2005), graphlet (Shervashidze et al., 2009), random walk (Kashima et al., 2003) and Weisfeiler-Lehman (Shervashidze et al., 2011) kernels. We observe the most significant improvement in the case of the graphlet kernel, which fits with the observation that neglecting the locational information of the substructures leads to a stronger curvature of the embedding manifold. On the other hand, the Weisfeiler-Lehman kernel partially mitigates the locality problem by using the node labels information, and thus does not clearly benefit from the manifold learning. Interestingly, our experiments also show that the unfolding of the space seems to reduce the performance gap between the examined kernels.

Optimal redistricting under geographical constraints: Why "pack and crack" does not work

We show that optimal partisan redistricting with geographical constraints is a computationally intractable (NP-complete) problem. In particular, even when voter's preferences are deterministic, a solution is generally not obtained by concentrating opponent's supporters in \unwinnable" districts ("packing") and spreading one's own supporters evenly among the other districts in order to produce many slight marginal wins ("cracking").

The Relationship of Heteroptera Species Richness, Abundance, and Morphology to Elevation Gradients and Land-use Regimes on Mt. Kilimanjaro

Insect biodiversity is unevenly distributed on local, regional, and global scales. Elevation is a key factor in the uneven distribution of insect diversity, serving as a proxy for a host of environmental variables. My study examines the relationship of Heteroptera (true bugs) species diversity, abundance, and morphology to elevational gradients and land-use regimes on Mt. Kilimanjaro, Tanzania, East Africa. Heteroptera specimens were collected from 60 research sites covering an elevational range of 3684m (866-4550m above sea level). Thirty of the sites were classified as natural, while the remaining 30 were classified as disturbed (e.g., agricultural use or converted to grasslands). I measured aspects of the body size of adult specimens and recorded their location of origin. I used regression models to analyze the relationships of Heteroptera species richness, abundance, and body measurements to elevation and land-use regime. Richness and abundance declined with greater elevation, controlling for land use. The declines were linear or logarithmic in form, depending on the model. Richness and abundance were greater in natural than disturbed sites, controlling for elevation. According to an interaction, richness decreased more in natural than disturbed sites with rising elevation. Body length increased as a quadratic function of elevation, adjusting for land use. Body width X length decreased as a logarithmic function of elevation, while leg length/body length decreased as a quadratic function. Leg length/body length was greater in disturbed than natural sites. Interactions indicated that body length and body width X length were greater in natural than disturbed sites as elevation rose, although the general trend was downward. Future research should examine the relative importance of land area, temperature, and resource constraints for Heteroptera diversity and morphology on Mt. Kilimanjaro.

Resource, Strategies, Location Determinants, And Host Country Location Choice By Emerging Market Firms

The extant literature had studied the determinants of the firms’ location decisions with help of host country characteristics and distances between home and host countries. Firm resources and its internationalization strategies had found limited attention in this literature. To address this gap, the research question in this dissertation was whether and how firms’ resources and internationalization strategies impacted the international location decisions of emerging market firms. To explore the research question, data were hand-collected from Indian software firms on their location decisions taken between April 2000 and March 2009. To analyze the multi-level longitudinal dataset, hierarchical linear modeling was used. The results showed that the internationalization strategies, namely market-seeking or labor-seeking had direct impact on firms’ location decision. This direct relationship was moderated by firm resource which, in case of Indian software firms, was the appraisal at CMMI level-5. Indian software firms located in developed countries with a market-seeking strategy and in emerging markets with a labor-seeking strategy. However, software firms with resource such as CMMI level-5 appraisal, when in a labor-seeking mode, were more likely to locate in a developed country over emerging market than firms without the appraisal. Software firms with CMMI level-5 appraisal, when in market-seeking mode, were more likely to locate in a developed country over an emerging market than firms without the appraisal. It was concluded that the internationalization strategies and resources of companies predicted their location choices, over and above the variables studied in the theoretical field of location determinants.

Sedimentary record of the western Amundsen Sea Embayment after the last glacial maximum

Reliable dating of glaciomarine sediments deposited on the Antarctic shelf since the Last Glacial Maximum (LGM) is very challenging because of the general absence of calcareous (micro-) fossils and the recycling of fossil organic matter. As a consequence, radiocarbon (14C) ages of the acid-insoluble organic fraction (AIO) of the sediments bear uncertainties that are very difficult to quantify. In this paper we present the results of three different chronostratigraphic methods to date a sedimentary unit consisting of diatomaceous ooze and diatomaceous mud that was deposited following the last deglaciation at five core sites on the inner shelf in the western Amundsen Sea (West Antarctica). In three cores conventional 14C dating of the AIO in bulk sediment samples yielded age reversals down-core, but at all sites the AIO 14C ages obtained from diatomaceous ooze within the diatom-rich unit yielded similar uncorrected 14C ages ranging from 13,517±56 to 11,543±47 years before present (yr BP). Correction of these ages by subtracting the core-top ages, which are assumed to reflect present-day deposition (as indicated by 21044 Pb dating of the sediment surface at one core site), yielded ages between ca. 10,500 and 8,400 calibrated years before present (cal yr BP). Correction of the AIO ages of the diatomaceous ooze by only subtracting the marine reservoir effect (MRE) of 1,300 years indicated deposition of the diatom-rich sediments between 14,100 and 11,900 cal yr BP. Most of these ages are consistent with age constraints between 13.0 and 8.0 ka BP for the diatom-rich unit, which we obtained by correlating the relative palaeomagnetic intensity (RPI) records of three of the sediment cores with global and regional reference curves for palaeomagnetic intensity. As a third dating technique we applied conventional 53 radiocarbon dating of the AIO included in acid-cleaned diatom hard parts that were extracted from the diatomaceous ooze. This method yielded uncorrected 14C ages of only 5,111±38 and 5,106±38 yr BP, respectively. We reject these young ages, because they are likely to be overprinted by the adsorption of modern atmospheric carbon dioxide onto the surfaces of the extracted diatom hard parts prior to sample graphitisation and combustion for 14C dating. The deposition of the diatom-rich unit in the western Amundsen Sea suggests deglaciation of the inner shelf before ca. 13 ka BP. The deposition of diatomaceous oozes on other parts of the Antarctic shelf around the same time, however, seems to be coincidental rather than directly related.

Algorithms for Geometric Matching, Clustering, and Covering

With the popularization of GPS-enabled devices such as mobile phones, location data are becoming available at an unprecedented scale. The locations may be collected from many different sources such as vehicles moving around a city, user check-ins in social networks, and geo-tagged micro-blogging photos or messages. Besides the longitude and latitude, each location record may also have a timestamp and additional information such as the name of the location. Time-ordered sequences of these locations form trajectories, which together contain useful high-level information about people's movement patterns.

The first part of this thesis focuses on a few geometric problems motivated by the matching and clustering of trajectories. We first give a new algorithm for computing a matching between a pair of curves under existing models such as dynamic time warping (DTW). The algorithm is more efficient than standard dynamic programming algorithms both theoretically and practically. We then propose a new matching model for trajectories that avoids the drawbacks of existing models. For trajectory clustering, we present an algorithm that computes clusters of subtrajectories, which correspond to common movement patterns. We also consider trajectories of check-ins, and propose a statistical generative model, which identifies check-in clusters as well as the transition patterns between the clusters.

The second part of the thesis considers the problem of covering shortest paths in a road network, motivated by an EV charging station placement problem. More specifically, a subset of vertices in the road network are selected to place charging stations so that every shortest path contains enough charging stations and can be traveled by an EV without draining the battery. We first introduce a general technique for the geometric set cover problem. This technique leads to near-linear-time approximation algorithms, which are the state-of-the-art algorithms for this problem in either running time or approximation ratio. We then use this technique to develop a near-linear-time algorithm for this

shortest-path cover problem.