Th.--Sci. math.--Besançon, 1978. N°: 131.

With the rapid proliferation of the internet, web browsers have evolved from single-purpose remote document viewers into multifaceted systems for executing dynamic, interactive web applications. In order to enhance the web browsing experience of users and to facilitate on-demand customizability, most web browsers now can be fitted with extensions: pieces of software that utilize the underlying web platform of a browser and provide a wide range of features such as advertisement blocking, safety ratings of websites, in-browser web development, and many more. Extensible web browsers provide access to their powerful privileged components in order to facilitate the development of feature-rich extensions. This exposure comes at a price, though, as a vulnerable extension can introduce a security hole through which an attacker can access the privileged components and penetrate a victim user’s browser, steal the user’s sensitive information, and even execute arbitrary code in the user’s computer. The current browser security model is inadequate for preventing attacks via such vulnerable extensions. Therefore, an effective protection mechanism is required that would provide web browsers adequate security while still allowing them to be extended. In this thesis, we propose a runtime protection mechanism for JavaScript-based browser extensions. Our protection mechanism performs offline randomization of an extension’s source code and augments the corresponding browser with appropriate modifications. The protection from malicious injection attacks is enforced at runtime by distinguishing attack code from the randomized extension code. Furthermore, for maximum backward compatibility with existing extensions, we propose a complementary static points-to analysis technique that can be invoked on-demand for assessing the security of dynamic code generation functions present in the source code of extensions. Our combined approach of runtime protection and static analysis is independent of the existing extension platforms, thus obviating the need of radically changing the platforms and requiring developers to rewrite their extensions. We implement our protection mechanism in the popular Mozilla Firefox browser and evaluate our approach on a set of vulnerable and non-vulnerable Mozilla Firefox extensions. The evaluation results indicate that our approach can be a viable solution for preventing attacks on JavaScript-based browser extensions while incurring negligible performance overhead and maintaining backward compatibility with existing extensions. / Thesis (Master, Computing) -- Queen's University, 2012-09-27 23:41:46.455

Th. 3e cycle--Méthodes d'approximation et algorithmes en anal. et théor. des nombres--Besançon, 1979. N°: 315.

Purpose: This paper seeks to examine whether the follower extensions with superior alignable differences can overcome the pioneer extensions with regard to brands. Design/methodology/approach: Three laboratory experiments were conducted to test hypotheses. Findings: Findings suggest that the effect of superior alignable differences on consumer evaluations of followers vs pioneers is moderated by two factors - the perceived fit between the parent brand and extensions, and order of market entry. High fit followers with superior alignable differences easily overcome pioneers; however, such alignable differences do not help low fit followers to overcome pioneers. Although the low fit followers with better quality and superior alignable differences can overcome the low fit pioneer, they cannot overcome the high fit pioneer. Research limitations/implications: The limitation of the study is that it does not explore how low fit followers can overcome high fit pioneers. Practical implications: Managers can better determine whether and how to introduce brand extensions as a pioneer or follower. Originality/value: The originality and value lie in first examining whether follower extensions can overcome pioneer extensions.

As Internet applications continue to gain popularity, users are becoming increasingly comfortable with using the Web as part of their daily lives. Content is becoming digitized on a massive scale, and web browsers are emerging as the platform of choice. Library catalogs, or OPACs, have become widely digitized as part of this trend. Unlike modern search engines, however, many OPACs require antiquated, boolean-based search queries. Consequently, OPAC usage has declined. Libraries have recently begun to introduce modernized services that enable Google-like queries with convenient syntaxes; however, these services are not widely adopted since Google remains more accessible and familiar. LibX 2.0 is a browser extension for Mozilla Firefox and Google Chrome that provides an interface for locating library resources. LibX 2.0 gives users instant access to library searches, links, and proxies. It provides support for the modernized search services that libraries are beginning to offer. Additionally, as a browser extension, LibX 2.0 is more accessible than the OPACs themselves. LibX 2.0 is the next iteration of the popular LibX extension. LibX 2.0 borrows several software engineering concepts for its design, including code reuse and modularity. As a result, we have created and updated many components to be compatible with these software engineering goals. We have designed a new user interface, inspired by Google Chrome, whose design we share between browsers. We have developed a framework for library applications, or LibApps, which enable user-created, extensible code. We have also developed custom caching, internationalization, and user preferences libraries to support our new design. / Master of Science

Thesis (Ph. D.)--University of Texas at Austin, 2000. / Vita. Includes bibliographical references (leaves 112-116). Available also in a digital version from Dissertation Abstracts.

Let K/F be a separable extension. (i) If K = F(α) with αⁿ ∈ F for some n, K/F is said to be a radical extension. (ii) If there exists a sequence of fields F = F₀ ⊆ F₁ ⊆ ... ⊆ F(s) = K so that Fᵢ₊₁ = Fᵢ(αᵢ) with αᵢⁿ⁽ⁱ⁾ ∈ Fᵢ for some nᵢ ∈ N, charF ∧nᵢ for every i, and [Fᵢ₊₁ : Fᵢ] = nᵢ, K/F is said to be a radical tower. In the first part of this work, we present two theorems which give sufficient conditions for a field extension K/F to be radical. In the second part, we present results which provide conditions under which every subfield of a radical tower is also a radical tower.

Given a signed graph (G, Σ) with an embedding on a surface S, we are interested in "extending" (G, Σ) by adding edges and splitting vertices, such that the resulting graph has no embedding on S. We show (assuming 3-connectivity for (G, Σ)) that there are a small number of minimal extensions of (G, Σ) with no such embedding, and describe them explicitly. We also give conditions, for several surfaces S, for an embedding of a signed graph on S to extend uniquely. These results find application in characterizing the signed graphs with no odd-K_5 minor.

Thesis (M.Sc.) -- Dept. of Pure Mathematics, University of Adelaide1983. / Typescript (photocopy).

No description available.