Добірка наукової літератури з теми "Framework RWA"

In a recent model of employability, Hogan, Chamorro-Premuzic, and Kaiser (2013) defined employability as the ability to gain and maintain employment and find new employment when necessary. The authors presented employability as a formative construct containing an ability dimension (the ability to do the job), a social skills dimension (being rewarding to work with), and a motivational dimension (being willing to work hard). There is no question as to whether these three dimensions affect one’s level of employability; research is abundant on the positive relationships between intelligence, social and emotional skills, motivation and career success. However, little research has been conducted to empirically test employability models in their entirety. Thus, the purpose of this research was to test the RAW model of employability, using various indicators of the three RAW dimensions of employability using structural equation modelling. Surveys were administered electronically eliciting both a student and community sample. Marginal support was found for the hypothesized model with post hoc modifications producing an acceptable fitting model. Findings suggest that having the ability and motivation to do the job are related to being employable. However, being rewarding to work may not impact levels of employability, suggesting that employers may be asking for one thing while rewarding another.

Mestrado em Gestão de Sistemas de Informação<br>A tecnologia está em constante evolução, aparecendo diariamente novas formas de simplificar as atividades humanas, contribuindo para a evolução do tecido empresarial. O impacto desta evolução é visível em todas as áreas de negócio, não sendo diferente na área de auditoria, onde o grande recurso para o efetivo desempenho da função, é o recurso humano. Esta dissertação usa uma nova tecnologia denominada Robotic Process Automation (RPA) e estuda a possibilidade de desenvolver e implementar um protótipo, aplicado a um subprocesso específico do processo de auditoria, com o propósito de combinar a Inteligência Artificial e o RPA. Tendo isto em consideração, o projeto tem os seguintes objetivos: i) propor uma abordagem de implementação de um RPA no processo de auditoria (Framework); ii) validar e analisar a metodologia proposta através da utilização da ferramenta UiPath; e iii) estudar o impacto da implementação desta ferramenta nas diversas fases, desde o seu desenvolvimento até a pós-implementação. De forma a atingir estes objetivos, o projeto tem por base a metodologia Design Science in Information Systems Research que visa resolver um problema permite propor uma solução para um problema organizacional relacionado com a alocação dos recursos humanos a tarefas padrão e repetitivas libertando esforço para atividades cognitivas, mais produtivas e orientadas à criação de valor. Este estudo conclui que é possível desenvolver e implementar um RPA efetivamente no processo de auditoria, recorrendo a um recurso externo.<br>Technology is constantly evolving, with new ways of simplifying daily human activities, contributing to the evolution of the business. The impact of this evolution is visible in all business areas, even in the audit area, where the greatest resource for the effective performance of the function, is the human resource. This thesis uses a new technology called Robotic Process Automation (RPA) and studies the possibility of developing and implementing a prototype, applied to a specific sub-process of the audit process, with the purpose of combining Artificial Intelligence with RPA. Having this in mind, the project has the following objectives: i) propose an RPA implementation approach in the audit process (Framework); ii) validate and analyse the proposed methodology using the UIPATH tool; and iii) study the impact of implementing this tool at different levels, from development to post-implementation. In order to achieve this, the project uses a Design Science in Information Systems Research methodology that aims to solve an issue related to repetitive and standard tasks executed by human resources in an organisation, towards more productive, value-oriented and cognitive tasks. Furthermore, it develops a prototype for a sub-process selected together with the said company, using UiPath (RPAs development tool), according to a framework developed by us. This study concludes that it is possible to effectively develop and implement an RPA in the audit process resorting to an external source, and without changes to previous procedures and documentation.<br>info:eu-repo/semantics/publishedVersion

The advance of high-throughput sequencing technologies and their application on mRNA transcriptome sequencing (RNA-seq) have enabled comprehensive and unbiased profiling of the landscape of transcription in a cell. In order to address the current limitation of analyzing accuracy and scalability in transcriptome analysis, a novel computational framework has been developed on large-scale RNA-seq datasets with no dependence on transcript annotations. Directly from raw reads, a probabilistic approach is first applied to infer the best transcript fragment alignments from paired-end reads. Empowered by the identification of alternative splicing modules, this framework then performs precise and efficient differential analysis at automatically detected alternative splicing variants, which circumvents the need of full transcript reconstruction and quantification. Beyond the scope of classical group-wise analysis, a clustering scheme is further described for mining prominent consistency among samples in transcription, breaking the restriction of presumed grouping. The performance of the framework has been demonstrated by a series of simulation studies and real datasets, including the Cancer Genome Atlas (TCGA) breast cancer analysis. The successful applications have suggested the unprecedented opportunity in using differential transcription analysis to reveal variations in the mRNA transcriptome in response to cellular differentiation or effects of diseases.

<p>In object oriented programming, a Call Graph represents the calling relationships between the program’s methods. To be more precise, a Call Graph is a rooted directed graph where each node of the graph represents a method and each edge <em>(u, v)</em> represents a method call from method <em>u </em>to method <em>v.</em></p><p><em></em>Focus of this thesis is on building a framework for Call Graph construction algorithms which can be used in program analysis. Our framework is able to be initialized by different front-ends and constructs various Call Graph algorithms. Here, we instantiate framework with two bytecode readers (ASM and Soot) as front-ends and implement three Call Graph construction algorithms (CHA, RTA and CTA).<em></em></p><p>At first, we used two above mentioned bytecode readers to read the bytecode of a specific Java program, then we found reachable methods for each invoked method; meanwhile we kept obtained details on our own data structures.  Creating data structures for storing required information about Classes, Methods, Fields and Statements, gives us a great opportunity to implement an independent framework for applying well known Call Graph algorithms. As a result of these data structures, Call Graph construction will not depend on bytecode readers; since, whenever we read the bytecode of a program, we accumulate all necessary points in pre-defined data structures and implement our Call Graphs based on this accumulated data.</p><p>Finally, the result is a framework for different Call Graph construction algorithms which is the goal of this thesis. We tested and evaluated the algorithms with a variety of programs as the benchmark and compared the bytecode readers besides the three Call Graph algorithms in different aspects.</p>

Material flow-based indicators play an important role in indicator sets related to green and resource-efficient growth. This paper examines the global flows of materials and the amounts of materials directly and indirectly necessary to satisfy domestic final demand in different countries world-wide. We calculate the indicator Raw Material Consumption (RMC), also referred to as Material Footprint (MF), by applying a global, multi-regional input-output (MRIO) model based on the GTAP database and extended by material extraction data. We examine world-wide patterns of material extraction and materials embodied in trade and consumption, investigating changes between 1997 and 2007. We find that flows of materials related to international trade have increased by almost 60% between 1997 and 2007. We show that the differences in Material Footprints per capita are huge, ranging from up to 100 tonnes in the rich, oil-exporting countries to values as low as 1.5 to 2 tonnes in some developing countries. We also quantify the differences between the indicators Domestic Material Consumption (DMC) and RMC, illustrating that net material exporters generally have a DMC larger than RMC, while the reverse is observed for net importers. Finally, we confirm the fact that most countries with stable or declining DMCs actually show increasing RMCs, indicating the occurrence of leakage effects, which are not fully captured by DMC. This challenges the world-wide use of DMC as a headline indicator for national material consumption and calls for the consideration of upstream material requirements of international trade flows.

This thesis is comprised of three parts. The first part describes a novel framework for computing importance measures on graph vertices. The concept of a D-spectrum is introduced, based on vertex ranks within certain chains of nested sub-graphs. We show that the D- spectrum integrates the degree distribution and coreness information of the graph as two particular such chains. We prove that these spectra are realized as fixed points of certain monotone and contractive SDSs we call t-systems. Finally, we give a vertex deletion algorithm that efficiently computes D-spectra, and we illustrate their correlation with stochastic SIR-processes on real world networks. The second part deals with the topology of the intersection nerve for a bi-secondary structure, and its singular homology. A bi-secondary structure R, is a combinatorial object that can be viewed as a collection of cycles (loops) of certain at most tetravalent planar graphs. Bi-secondary structures arise naturally in the study of RNA riboswitches - molecules that have an MFE binary structural degeneracy. We prove that this loop nerve complex has a euclidean 3-space embedding characterized solely by H2(R), its second homology group. We show that this group is the only non-trivial one in the sequence and furthermore it is free abelian. The third part further describes the features of the loop nerve. We identify certain disjoint objects in the structure of R which we call crossing components (CC). These are non-trivial connected components of a graph that captures a particular non-planar embedding of R. We show that each CC contributes a unique generator to H2(R) and thus the total number of these crossing components in fact equals the rank of the second homology group.<br>Doctor of Philosophy<br>This Thesis is divided into three parts. The first part describes a novel mathematical framework for decomposing a real world network into layers. A network is comprised of interconnected nodes and can model anything from transportation of goods to the way the internet is organized. Two key numbers describe the local and global features of a network: the number of neighbors, and the number of neighbors in a certain layer, a node has. Our work shows that there are other numbers in-between the two, that better characterize a node. We also give explicit means of computing them. Finally, we show that these numbers are connected to the way information spreads on the network, uncovering a relation between the network’s structure and dynamics on said network. The last two parts of the thesis have a common theme and study the same mathematical object. In the first part of the two, we provide a new model for the way riboswtiches organize themselves. Riboswitches, are RNA molecules within a cell, that can take two mutually opposite conformations, depending on what function they need to perform within said cell. They are important from an evolutionary standpoint and are actively studied within that context, usually being modeled as networks. Our model captures the shapes of the two possible conformations, and encodes it within a mathematical object called a topological space. Once this is done, we prove that certain numbers that are attached to all topological spaces carry specific values for riboswitches. Namely, we show that the shapes of the two possible conformations for a riboswich are always characterized by a single integer. In the last part of the Thesis we identify what exactly in the structure of riboswitches contributes to this number being large or small. We prove that the more tangled the two conformations are, the larger the number. We can thus conclude that this number is directly proportional to how complex the riboswitch is.

The problem of performance and scalability of web applications is challenged by most of the software companies. It is difficult to maintain the performance of a web application while the number of users is continuously increasing. The common solution for this problem is scalability. A web application can handle incoming and outgoing requests using blocking or non-blocking Input/Output operation. The way that a single server handles requests affects its ability to scale and depends on a web framework that was used to build the web application. It is especially important for Resource Oriented Architecture (ROA) based applications which consist of distributed Representational State Transfer (REST) web services. This research was inspired by a real problem stated by a software company that was considering the migration to the non-blocking web framework but did not know the possible profits. The objective of the research was to evaluate the influence of web framework&apos;s type on the performance of ROA based applications and to provide guidelines for assessing profits of migration from blocking to non-blocking JVM web frameworks. First, internet ranking was used to obtain the list of the most popular web frameworks. Then, the web frameworks were used to conduct two experiments that investigated the influence of web framework&apos;s type on the performance of ROA based applications. Next, the consultations with software architects were arranged in order to find a method for approximating the performance of overall application. Finally, the guidelines were prepared based on the consultations and the results of the experiments. Three blocking and non-blocking highly ranked and JVM based web frameworks were selected. The first experiment showed that the non-blocking web frameworks can provide performance up to 2.5 times higher than blocking web frameworks in ROA based applications. The experiment performed on existing application showed average 27\% performance improvement after the migration. The elaborated guidelines successfully convinced the company that provided the application for testing to conduct the migration on the production environment. The experiment results proved that the migration from blocking to non-blocking web frameworks increases the performance of web application. The prepared guidelines can help software architects to decide if it is worth to migrate. However the guidelines are context depended and further investigation is needed to make it more general.

This thesis analyzes and defines requirements of framework, which helps with quick and effortless development of business information systems. The main goal of the framework is development acceleration, price reduction and overall improvement of product quality. The thesis also compares and evaluates existing tools. The result is detailed design and implementation of own flexible solution that fulfills all defined requirements and removes disadvantages of existing solutions. In the scope for further studies framework development possibilities and directions are listed.