824 resultados para trust graph
Resumo:
In the UK it is estimated that over 33% of psychiatric patients with enduring mental illness have a substance misuse problem, whilst over 50 % of clients currently accessing drug and alcohol services have a mental health problem. Between 2003 and 2013 in Northern Ireland, there were 741 recorded suicides by patients who were in contact with mental health services. Of this number, 68% (n=501) had a history of either alcohol or drug misuse or both, resulting in an average of 46 patient suicides per year associated with dual diagnosis (University of Manchester 2015).
The current evaluation examined staff attitudes towards working with dual diagnosis (co-existing difficulties) issues, staff confidence in working with clients with dual diagnosis, workers’ perceptions of the South Eastern dual diagnosis strategy and service user perspectives of dual diagnosis service provision.
The purpose of the evaluation was to provide evidence regarding the following in accordance with the current dual diagnosis strategy;
Staff understanding of the concept of dual diagnosis,
Staff attitudes towards working with dual diagnosis,
Staff confidence in working with individuals, who present with dual diagnosis,
Service users’ perspectives of SE Trust provision for dual diagnosis.
Staff views on the South Eastern Trust Dual Diagnosis Strategy.
Resumo:
A family of quadratic programming problems whose optimal values are upper bounds on the independence number of a graph is introduced. Among this family, the quadratic programming problem which gives the best upper bound is identified. Also the proof that the upper bound introduced by Hoffman and Lovász for regular graphs is a particular case of this family is given. In addition, some new results characterizing the class of graphs for which the independence number attains the optimal value of the above best upper bound are given. Finally a polynomial-time algorithm for approximating the size of the maximum independent set of an arbitrary graph is described and the computational experiments carried out on 36 DIMACS clique benchmark instances are reported.
Resumo:
A graph is singular if the zero eigenvalue is in the spectrum of its 0-1 adjacency matrix A. If an eigenvector belonging to the zero eigenspace of A has no zero entries, then the singular graph is said to be a core graph. A ( k,t)-regular set is a subset of the vertices inducing a k -regular subgraph such that every vertex not in the subset has t neighbours in it. We consider the case when k=t which relates to the eigenvalue zero under certain conditions. We show that if a regular graph has a ( k,k )-regular set, then it is a core graph. By considering the walk matrix we develop an algorithm to extract ( k,k )-regular sets and formulate a necessary and sufficient condition for a graph to be Hamiltonian.
Resumo:
Taking a Fiedler’s result on the spectrum of a matrix formed from two symmetric matrices as a motivation, a more general result is deduced and applied to the determination of adjacency and Laplacian spectra of graphs obtained by a generalized join graph operation on families of graphs (regular in the case of adjacency spectra and arbitrary in the case of Laplacian spectra). Some additional consequences are explored, namely regarding the largest eigenvalue and algebraic connectivity.
Rare, Threatened and Endangered Species and Communities Tracked by the SC DNR Heritage Trust Program
Resumo:
This species lists for South Carolina provides the scientific name, common name, USESA designation, state protection level, global rank, and state rank of rare, threatened, and endangered species and communities known to occur in the state.
Resumo:
Tese de doutoramento, Direito (Ciências Jurídico-Civis), Universidade de Lisboa, Faculdade de Direito, 2014
Resumo:
During the late twentieth century, the United Kingdom’s football infrastructure and spectatorship underwent transformation as successive stadia disasters heightened political and public scrutiny of the game and prompted industry change. Central to this process was the government’s formation of an independent charitable organization to oversee subsequent policy implementation and grant-aid provision to clubs for safety, crowd, and spectator requirements. This entity, which began in 1975 focusing on ground improvement, developed into the Football Trust. The Trust was funded directly by the football pools companies who ran popular low-stakes football betting enterprises. Working in association with the Pools Promoters Association (PPA), and demonstrating their social responsibility towards the game’s constituents, the pools resourced a wide array of Trust activities. Yet irrespective of government mandate, the PPA and Trust were continually confronted by political and economic obstacles that threatened the effectiveness of their arrangements. In this paper the history of the Football Trust is investigated, along with its partnership with the PPA, and its relationship with the government within the context of broader political shifts, stadia catastrophes, official inquiries, and commercial threats. It is contended that while the Trust/PPA partnership had a respectable legacy, their history afforded little protection against adverse contemporary conditions.
Resumo:
Thesis (Master's)--University of Washington, 2016-03
Resumo:
Inspired in dynamic systems theory and Brewer’s contributions to apply it to economics, this paper establishes a bond graph model. Two main variables, a set of inter-connectivities based on nodes and links (bonds) and a fractional order dynamical perspective, prove to be a good macro-economic representation of countries’ potential performance in nowadays globalization. The estimations based on time series for 50 countries throughout the last 50 decades confirm the accuracy of the model and the importance of scale for economic performance.
Resumo:
In the fields of marketing and general management, many are the contributions of literature relating trust and e‐commerce. Trust is perceived as an issue that concerns the consumers’ intention to purchase. As so, in this research, a path model is empirically tested in order to develop solutions for Internet vendors on how to deal with consumers and increase their trust. The path model measures how the dimensions of trust, named as competence, integrity and benevolence positively influence the overall trust of the consumers and at the same time how the sources of trust – consumer characteristics, firm characteristics, website infrastructure and interactions influence those dimensions. The data used to test the model was collected in Portugal, through 365 valid cases. Findings revealed that consumers, which have high level of overall trust, are more likely to intent to purchase online.
Resumo:
Strategic alliances represent a key driver for internationalization and growth, being the purpose of this work project to better understand the intertwined relationship between trust and the existence of an alliance management position. Previous research supports the positive impact of such position in stock market returns. However, little attention has been given to the impact of such position on the level of trust in the collaborative arrangement, which is deemed to be a key driver for alliance success. A qualitative comparative case-study of three Portuguese SMEs is used to draw conclusions from the literature to real life business cases and it demonstrates the positive impact of an alliance management position on trust.
Resumo:
When assessing investment options, investors focus on the graphs of annual reports, despite lack of auditing. If poorly constructed, graphs distort perceptions and lead to inaccurate decisions. This study examines graph usage in all the companies listed on Euronext Lisbon in 2013. The findings suggest that graphs are common in the annual reports of Portuguese companies and that, while there is no evidence of Selectivity Distortion, both Measurement and Orientation Distortions are pervasive. The study recommends the auditing of financial graphs, and urges preparers and users of annual reports to be wary of the possibility of graph distortion.