15,003 research outputs found
Multi-Objective Trust-Region Filter Method for Nonlinear Constraints using Inexact Gradients
In this article, we build on previous work to present an optimization
algorithm for nonlinearly constrained multi-objective optimization problems.
The algorithm combines a surrogate-assisted derivative-free trust-region
approach with the filter method known from single-objective optimization.
Instead of the true objective and constraint functions, so-called fully linear
models are employed, and we show how to deal with the gradient inexactness in
the composite step setting, adapted from single-objective optimization as well.
Under standard assumptions, we prove convergence of a subset of iterates to a
quasi-stationary point and if constraint qualifications hold, then the limit
point is also a KKT-point of the multi-objective problem
Decentralized projected Riemannian gradient method for smooth optimization on compact submanifolds
We consider the problem of decentralized nonconvex optimization over a
compact submanifold, where each local agent's objective function defined by the
local dataset is smooth. Leveraging the powerful tool of proximal smoothness,
we establish local linear convergence of the projected gradient descent method
with unit step size for solving the consensus problem over the compact
manifold. This serves as the basis for analyzing decentralized algorithms on
manifolds. Then, we propose two decentralized methods, namely the decentralized
projected Riemannian gradient descent (DPRGD) and the decentralized projected
Riemannian gradient tracking (DPRGT) methods. We establish their convergence
rates of and , respectively, to
reach a stationary point. To the best of our knowledge, DPRGT is the first
decentralized algorithm to achieve exact convergence for solving decentralized
optimization over a compact manifold. The key ingredients in the proof are the
Lipschitz-type inequalities of the projection operator on the compact manifold
and smooth functions on the manifold, which could be of independent interest.
Finally, we demonstrate the effectiveness of our proposed methods compared to
state-of-the-art ones through numerical experiments on eigenvalue problems and
low-rank matrix completion.Comment: 32 page
The Viability and Potential Consequences of IoT-Based Ransomware
With the increased threat of ransomware and the substantial growth of the Internet of Things (IoT) market, there is significant motivation for attackers to carry out IoT-based ransomware campaigns. In this thesis, the viability of such malware is tested.
As part of this work, various techniques that could be used by ransomware developers to attack commercial IoT devices were explored. First, methods that attackers could use to communicate with the victim were examined, such that a ransom note was able to be reliably sent to a victim. Next, the viability of using "bricking" as a method of ransom was evaluated, such that devices could be remotely disabled unless the victim makes a payment to the attacker. Research was then performed to ascertain whether it was possible to remotely gain persistence on IoT devices, which would improve the efficacy of existing ransomware methods, and provide opportunities for more advanced ransomware to be created. Finally, after successfully identifying a number of persistence techniques, the viability of privacy-invasion based ransomware was analysed.
For each assessed technique, proofs of concept were developed. A range of devices -- with various intended purposes, such as routers, cameras and phones -- were used to test the viability of these proofs of concept. To test communication hijacking, devices' "channels of communication" -- such as web services and embedded screens -- were identified, then hijacked to display custom ransom notes. During the analysis of bricking-based ransomware, a working proof of concept was created, which was then able to remotely brick five IoT devices. After analysing the storage design of an assortment of IoT devices, six different persistence techniques were identified, which were then successfully tested on four devices, such that malicious filesystem modifications would be retained after the device was rebooted. When researching privacy-invasion based ransomware, several methods were created to extract information from data sources that can be commonly found on IoT devices, such as nearby WiFi signals, images from cameras, or audio from microphones. These were successfully implemented in a test environment such that ransomable data could be extracted, processed, and stored for later use to blackmail the victim.
Overall, IoT-based ransomware has not only been shown to be viable but also highly damaging to both IoT devices and their users. While the use of IoT-ransomware is still very uncommon "in the wild", the techniques demonstrated within this work highlight an urgent need to improve the security of IoT devices to avoid the risk of IoT-based ransomware causing havoc in our society. Finally, during the development of these proofs of concept, a number of potential countermeasures were identified, which can be used to limit the effectiveness of the attacking techniques discovered in this PhD research
Constrained Assortment Optimization under the Cross-Nested Logit Model
We study the assortment optimization problem under general linear
constraints, where the customer choice behavior is captured by the Cross-Nested
Logit model. In this problem, there is a set of products organized into
multiple subsets (or nests), where each product can belong to more than one
nest. The aim is to find an assortment to offer to customers so that the
expected revenue is maximized. We show that, under the Cross-Nested Logit
model, the assortment problem is NP-hard, even without any constraints. To
tackle the assortment optimization problem, we develop a new discretization
mechanism to approximate the problem by a linear fractional program with a
performance guarantee of , for any accuracy
level . We then show that optimal solutions to the approximate
problem can be obtained by solving mixed-integer linear programs. We further
show that our discretization approach can also be applied to solve a joint
assortment optimization and pricing problem, as well as an assortment problem
under a mixture of Cross-Nested Logit models to account for multiple classes of
customers. Our empirical results on a large number of randomly generated test
instances demonstrate that, under a performance guarantee of 90%, the
percentage gaps between the objective values obtained from our approximation
methods and the optimal expected revenues are no larger than 1.2%
Classification of annotation semirings over containment of conjunctive queries
Funding: This work is supported under SOCIAM: The Theory and Practice of Social Machines, a project funded by the UK Engineering and Physical Sciences Research Council (EPSRC) under grant number EP/J017728/1. This work was also supported by FET-Open Project FoX, grant agreement 233599; EPSRC grants EP/F028288/1, G049165 and J015377; and the Laboratory for Foundations of Computer Science.We study the problem of query containment of conjunctive queries over annotated databases. Annotations are typically attached to tuples and represent metadata, such as probability, multiplicity, comments, or provenance. It is usually assumed that annotations are drawn from a commutative semiring. Such databases pose new challenges in query optimization, since many related fundamental tasks, such as query containment, have to be reconsidered in the presence of propagation of annotations. We axiomatize several classes of semirings for each of which containment of conjunctive queries is equivalent to existence of a particular type of homomorphism. For each of these types, we also specify all semirings for which existence of a corresponding homomorphism is a sufficient (or necessary) condition for the containment. We develop new decision procedures for containment for some semirings which are not in any of these classes. This generalizes and systematizes previous approaches.PostprintPeer reviewe
The determinants of value addition: a crtitical analysis of global software engineering industry in Sri Lanka
It was evident through the literature that the perceived value delivery of the global software
engineering industry is low due to various facts. Therefore, this research concerns global
software product companies in Sri Lanka to explore the software engineering methods and
practices in increasing the value addition. The overall aim of the study is to identify the key
determinants for value addition in the global software engineering industry and critically
evaluate the impact of them for the software product companies to help maximise the value
addition to ultimately assure the sustainability of the industry.
An exploratory research approach was used initially since findings would emerge while the
study unfolds. Mixed method was employed as the literature itself was inadequate to
investigate the problem effectively to formulate the research framework. Twenty-three face-to-face online interviews were conducted with the subject matter experts covering all the
disciplines from the targeted organisations which was combined with the literature findings as
well as the outcomes of the market research outcomes conducted by both government and nongovernment institutes. Data from the interviews were analysed using NVivo 12. The findings
of the existing literature were verified through the exploratory study and the outcomes were
used to formulate the questionnaire for the public survey. 371 responses were considered after
cleansing the total responses received for the data analysis through SPSS 21 with alpha level
0.05. Internal consistency test was done before the descriptive analysis. After assuring the
reliability of the dataset, the correlation test, multiple regression test and analysis of variance
(ANOVA) test were carried out to fulfil the requirements of meeting the research objectives.
Five determinants for value addition were identified along with the key themes for each area.
They are staffing, delivery process, use of tools, governance, and technology infrastructure.
The cross-functional and self-organised teams built around the value streams, employing a
properly interconnected software delivery process with the right governance in the delivery
pipelines, selection of tools and providing the right infrastructure increases the value delivery.
Moreover, the constraints for value addition are poor interconnection in the internal processes,
rigid functional hierarchies, inaccurate selections and uses of tools, inflexible team
arrangements and inadequate focus for the technology infrastructure. The findings add to the
existing body of knowledge on increasing the value addition by employing effective processes,
practices and tools and the impacts of inaccurate applications the same in the global software
engineering industry
Educating Sub-Saharan Africa:Assessing Mobile Application Use in a Higher Learning Engineering Programme
In the institution where I teach, insufficient laboratory equipment for engineering education pushed students to learn via mobile phones or devices. Using mobile technologies to learn and practice is not the issue, but the more important question lies in finding out where and how they use mobile tools for learning. Through the lens of Kearney et al.’s (2012) pedagogical model, using authenticity, personalisation, and collaboration as constructs, this case study adopts a mixed-method approach to investigate the mobile learning activities of students and find out their experiences of what works and what does not work. Four questions are borne out of the over-arching research question, ‘How do students studying at a University in Nigeria perceive mobile learning in electrical and electronic engineering education?’ The first three questions are answered from qualitative, interview data analysed using thematic analysis. The fourth question investigates their collaborations on two mobile social networks using social network and message analysis. The study found how students’ mobile learning relates to the real-world practice of engineering and explained ways of adapting and overcoming the mobile tools’ limitations, and the nature of the collaborations that the students adopted, naturally, when they learn in mobile social networks. It found that mobile engineering learning can be possibly located in an offline mobile zone. It also demonstrates that investigating the effectiveness of mobile learning in the mobile social environment is possible by examining users’ interactions. The study shows how mobile learning personalisation that leads to impactful engineering learning can be achieved. The study shows how to manage most interface and technical challenges associated with mobile engineering learning and provides a new guide for educators on where and how mobile learning can be harnessed. And it revealed how engineering education can be successfully implemented through mobile tools
Foundations for programming and implementing effect handlers
First-class control operators provide programmers with an expressive and efficient
means for manipulating control through reification of the current control state as a first-class object, enabling programmers to implement their own computational effects and
control idioms as shareable libraries. Effect handlers provide a particularly structured
approach to programming with first-class control by naming control reifying operations
and separating from their handling.
This thesis is composed of three strands of work in which I develop operational
foundations for programming and implementing effect handlers as well as exploring
the expressive power of effect handlers.
The first strand develops a fine-grain call-by-value core calculus of a statically
typed programming language with a structural notion of effect types, as opposed to the
nominal notion of effect types that dominates the literature. With the structural approach,
effects need not be declared before use. The usual safety properties of statically typed
programming are retained by making crucial use of row polymorphism to build and
track effect signatures. The calculus features three forms of handlers: deep, shallow,
and parameterised. They each offer a different approach to manipulate the control state
of programs. Traditional deep handlers are defined by folds over computation trees,
and are the original con-struct proposed by Plotkin and Pretnar. Shallow handlers are
defined by case splits (rather than folds) over computation trees. Parameterised handlers
are deep handlers extended with a state value that is threaded through the folds over
computation trees. To demonstrate the usefulness of effects and handlers as a practical
programming abstraction I implement the essence of a small UNIX-style operating
system complete with multi-user environment, time-sharing, and file I/O.
The second strand studies continuation passing style (CPS) and abstract machine
semantics, which are foundational techniques that admit a unified basis for implementing deep, shallow, and parameterised effect handlers in the same environment. The
CPS translation is obtained through a series of refinements of a basic first-order CPS
translation for a fine-grain call-by-value language into an untyped language. Each refinement moves toward a more intensional representation of continuations eventually
arriving at the notion of generalised continuation, which admit simultaneous support for
deep, shallow, and parameterised handlers. The initial refinement adds support for deep
handlers by representing stacks of continuations and handlers as a curried sequence of
arguments. The image of the resulting translation is not properly tail-recursive, meaning some function application terms do not appear in tail position. To rectify this the
CPS translation is refined once more to obtain an uncurried representation of stacks
of continuations and handlers. Finally, the translation is made higher-order in order to
contract administrative redexes at translation time. The generalised continuation representation is used to construct an abstract machine that provide simultaneous support for
deep, shallow, and parameterised effect handlers. kinds of effect handlers.
The third strand explores the expressiveness of effect handlers. First, I show that
deep, shallow, and parameterised notions of handlers are interdefinable by way of typed
macro-expressiveness, which provides a syntactic notion of expressiveness that affirms
the existence of encodings between handlers, but it provides no information about the
computational content of the encodings. Second, using the semantic notion of expressiveness I show that for a class of programs a programming language with first-class
control (e.g. effect handlers) admits asymptotically faster implementations than possible in a language without first-class control
BECOMEBECOME - A TRANSDISCIPLINARY METHODOLOGY BASED ON INFORMATION ABOUT THE OBSERVER
ABSTRACT
Andrea T. R. Traldi
BECOMEBECOME
A Transdisciplinary Methodology Based on Information about the Observer
The present research dissertation has been developed with the intention to provide practical strategies and discover new intellectual operations which can be used to generate Transdisciplinary insight. For this reason, this thesis creates access to new knowledge at different scales.
Firstly, as it pertains to the scale of new knowledge generated by those who attend Becomebecome events. The open-source nature of the Becomebecome methodology makes it possible for participants in Becomebecome workshops, training programmes and residencies to generate new insight about the specific project they are working on, which then reinforce and expand the foundational principles of the theoretical background.
Secondly, as it pertains to the scale of the Becomebecome framework, which remains independent of location and moment in time. The method proposed to access Transdisciplinary knowledge constitutes new knowledge in itself because the sequence of activities, described as physical and mental procedures and listed as essential criteria, have never been found organised
6
in such a specific order before. It is indeed the order in time, i.e. the sequence of the ideas and activities proposed, which allows one to transform Disciplinary knowledge via a new Transdisciplinary frame of reference.
Lastly, new knowledge about Transdisciplinarity as a field of study is created as a consequence of the heretofore listed two processes.
The first part of the thesis is designated ‘Becomebecome Theory’ and focuses on the theoretical background and the intellectual operations necessary to support the creation of new Transdisciplinary knowledge. The second part of the thesis is designated ‘Becomebecome Practice’ and provides practical examples of the application of such operations. Crucially, the theoretical model described as the foundation for the Becomebecome methodology (Becomebecome Theory) is process-based and constantly checked against the insight generated through Becomebecome Practice.
To this effect, ‘information about the observer’ is proposed as a key notion which binds together Transdisciplinary resources from several studies in the hard sciences and humanities. It is a concept that enables understanding about why and how information that is generated through Becomebecome Practice is considered of paramount importance for establishing the reference parameters necessary to access Transdisciplinary insight which is meaningful to a specific project, a specific person, or a specific moment in time
Information Flow Guided Synthesis
Compositional synthesis relies on the discovery of assumptions, i.e., restrictions on the behavior of the remainder of the system that allow a component to realize its specification.
In order to avoid losing valid solutions, these assumptions should be necessary conditions for realizability. However, because there are typically many different behaviors that realize the same specification, necessary behavioral restrictions often do not exist.
In this paper, we introduce a new class of assumptions for compositional synthesis, which we call information flow assumptions. Such assumptions capture an essential aspect of distributed computing, because components often need to act upon information that is available only in other components. The presence of a certain flow of information is therefore often a necessary requirement, while
the actual behavior that establishes the information flow is unconstrained.
In contrast to behavioral assumptions, which are properties of individual computation traces, information flow assumptions are hyperproperties, i.e., properties of sets of traces. We present a method for the automatic derivation of information-flow assumptions from a temporal logic specification of the system. We then provide a technique for the automatic synthesis of component implementations based on information flow assumptions. This provides a new compositional approach to the synthesis of distributed systems. We report on encouraging first experiments with the approach, carried out with the BoSyHyper synthesis tool
- …