Desenho e Análise de Processo de Candidatura ao P.2020: estudo de caso via CTC/GP, do IPL

Melhorar o desempenho organizacional, através do (re)desenho dos processos de negócios, é uma premente e desafiadora questão para promover a eficiência e eficácia organizacional. O presente trabalho aborda a Gestão de Processos de Negócio e conceitos que lhe estão subjacente, enquanto ferramenta ao dispor da gestão para planear, modelar, executar, analisar, controlar e melhorar o operacional do processo. Para tal, recorreu-se a um estudo de caso, realizado no Centro de Transferência e Valorização de Conhecimento e Gabinete de Projetos (CTC/GP), do Instituto Politécnico de Leiria (IPL), referente ao processo de candidatura de projetos em co-promoção, no novo quadro comunitário. A escolha deste estudo de caso prendeu-se com o facto de o CTC/GP ser uma unidade orgânica do IPL que, entre outras atividades, articula a academia com o tecido empresarial da região de Leiria, contribuindo para a criação de uma economia de valor acrescentado, suportada por produtos exportáveis e competitivos ao nível da qualidade. Por outro lado, o processo de candidatura de projetos em co-promoção é um processo de grande rendibilidade para o instituto. A grande contribuição deste trabalho foi, por um lado, munir a equipa de um fluxograma do supra citado processo, numa ferramenta de fácil utilização e premiável às mudanças de paradigma e, por outro, apresentar várias questões de partida para investigações futuras.

Promoção de sucesso académico e bem-estar em estudantes do IPL : alguns contributos do Serviço de Apoio ao Estudante (SAPE)

A promoção do sucesso académico e bem-estar em geral dos estudantes do Instituto Politécnico de Leiria (IPL), bem como o desenvolvimento de competências que lhes permitam lidar com os desafios inerentes aos diferentes processos de transição, gerindo da melhor forma os recursos pessoais, sociais e académicos/profissionais, são os principais objetivos do Serviço de Apoio ao Estudante (SAPE), constituído como Unidade Funcional em julho de 2008. Considerando a importância do estudante se tornar num gestor eficaz de competências comunicacionais, relacionais e autorreguladoras do estudo para melhor lidar com os diversos desafios, tanto na transição para o Ensino Superior como na entrada na vida ativa, o SAPE-IPL tem vindo a intervir ao nível do apoio psicológico e vocacional, apoio psicopedagógico e orientação pessoal, com o objetivo de promover e otimizar, nos estudantes, a utilização e desenvolvimento de estratégias adaptativas, potenciadoras de um maior sucesso académico e de bemestar em geral. Com este artigo apresentamos as principais linhas de ação e alguns resultados da intervenção que tem vindo a ser desenvolvida pelo SAPE nas cinco Escolas, presentes em três cidades, que integram o IPL. Procuraremos dar conta de alguns dos programas desenvolvidos ao nível da promoção de competências transversais, de estratégias de promoção do sucesso, das atividades no âmbito do apoio psicológico e do tipo de problemáticas mais identificadas. Sistematizaremos ainda informação relativa ao tipo de acompanhamento disponibilizado a públicos mais específicos, como sejam os estudantes M23, os estudantes com Necessidades Educativas Especiais ou os estudantes de CETs. Abordaremos também alguns dos contributos do SAPE ao nível da formação de colaboradores docentes e não docentes.

Practical attack on NLM-MAC scheme

The NLM stream cipher designed by Hoon Jae Lee, Sang Min Sung, Hyeong Rag Kim is a strengthened version of the LM summation generator that combines linear and non-linear feedback shift registers. In recent works, the NLM cipher has been used for message authentication in lightweight communication over wireless sensor networks and for RFID authentication protocols. The work analyses the security of the NLM stream cipher and the NLM-MAC scheme that is built on the top of the NLM cipher. We first show that the NLM cipher suffers from two major weaknesses that lead to key recovery and forgery attacks. We prove the internal state of the NLM cipher can be recovered with time complexity about nlog7×2, where the total length of internal state is 2⋅n+22⋅n+2 bits. The attack needs about n2n2 key-stream bits. We also show adversary is able to forge any MAC tag very efficiently by having only one pair (MAC tag, ciphertext). The proposed attacks are practical and break the scheme with a negligible error probability.

Classic identity negative priming involves accessing semantic representations in the left anterior temporal cortex

Classic identity negative priming (NP) refers to the finding that when an object is ignored, subsequent naming responses to it are slower than when it has not been previously ignored (Tipper, S.P., 1985. The negative priming effect: inhibitory priming by ignored objects. Q. J. Exp. Psychol. 37A, 571-590). It is unclear whether this phenomenon arises due to the involvement of abstract semantic representations that the ignored object accesses automatically. Contemporary connectionist models propose a key role for the anterior temporal cortex in the representation of abstract semantic knowledge (e.g., McClelland, J.L., Rogers, T.T., 2003. The parallel distributed processing approach to semantic cognition. Nat. Rev. Neurosci. 4, 310-322), suggesting that this region should be involved during performance of the classic identity NP task if it involves semantic access. Using high-field (4 T) event-related functional magnetic resonance imaging, we observed increased BOLD responses in the left anterolateral temporal cortex including the temporal pole that was directly related to the magnitude of each individual's NP effect, supporting a semantic locus. Additional signal increases were observed in the supplementary eye fields (SEF) and left inferior parietal lobule (IPL).

The introduction of an Inter-professional learning unit: staff and student perspectives

Background The School of Clinical Sciences comprises a number of health disciplines including podiatry, paramedic science, pharmacy, medical imaging and radiation therapy. A new inter-professional unit was introduced in 2014, which covered key introductory learnings applicable for future health practitioners. This study examined teaching staff and student perspectives about their experience with the new unit for first year students. Methods Qualitative interviews with teaching staff (n=9) and focus group interviews with students (5 groups which ranged in size from 4-30) were conducted. Extensive notes were taken during the interviews Issues emerging from the interviews were identified and organised according to themes and subthemes. Results Four major themes were identified namely: Something new; To be or not to be that is the question; Advantages of the new unit; and Areas for improvement. Previous staff experience with inter-professional learning (IPL) had been ad-hoc, whereas the new unit brought together several disciplines in a planned and deliberate way. There was strong philosophical agreement about the value of IPL but some debate about the extent to which the unit provided IPL experience. The unit was seen as assisting students’ social and academic adjustment to university and provided opportunity for professional socialisation, exposure to macro and micro aspects of the Australian health care system and various types of communication. For podiatry students it was their first opportunity to formally meet and work with other podiatry students and moved their identity from ‘university student’ to ‘podiatry student’. Other positives included providing the opportunity for staff and students to interact at an early stage with the perceived benefit of reducing attrition. Areas for unit improvement included institutional arrangements, unit administration aspects and assessment. Conclusion The unit was seen as beneficial by staff and students however, students were more polarised in their views than staff. There was a tension between feeling apart of and learning about one's own profession and feeling apart of and learning about the roles of other health professionals in relation to patient care and the health care system.

Evolution in design of integral leg prosthesis leads to improved outcomes

Developments of surgical attachments for bone-anchored prostheses are slowly but surely winning over the initial disbelief in the orthopedic community. Clearly, this option is becoming accessible to a wide range of individuals with limb loss. Seminal studies have demonstrated that the pioneering procedure relying on screw-type fixation engenders major clinical benefits and acceptable safety. The surgical procedure for press-fit implants, such as the Integral-Leg-Prosthesis (ILP) has been described Dr Aschoff and his team. Some clinical benefits of press-fit implants have been also established. Here, his team is once again taking a leading role by sharing the progression over 15 years of the rate of deep infections for 69 individuals with transfemoral amputation fitted with three successive refined versions of the ILP. By definition, a double-blind randomized clinical trial to test the effect of different fixation’s design is difficult. Alternatively, Juhnke and colleagues are reporting the outcomes of action-research study for a cohort of participants. The first and foremost important outcome of this study is the confirmation that the current design of the IPL and rehabilitation program are altogether leading to an acceptable rate of deep infection and other adverse events (e.g., structural failure of implant, periprosthetic factures). This study is also providing a strong insight onto the effect of major phases in redesign of an implant on the risk of infection. This is an important reminder that the development of a successful osseointegrated implant is unlikely to be immediate but the results of a learning curve made of empirical and sequential changes led by a reflective clinical practice. Clearly, this study provided better understanding of the safety of the ILP surgical and rehabilitation procedure while establishing standards and benchmark data for future studies focusing on design and infection of press-fit implants. Complementary observations of relationship between infection and cofounders such as loading of the prosthesis and prosthetic components used would be beneficial.Further definitive evidences of the clinical benefits with the latest design would be valuable, although an increase in health related quality of life and functional outcomes are likely to be confirmed. Altogether, the authors are providing compelling evidence that bone-anchored attachments particularly those relying on press-fit implants are an established alternative to socket prostheses.

A simple local 3-approximation algorithm for vertex cover

We present a local algorithm (constant-time distributed algorithm) for finding a 3-approximate vertex cover in bounded-degree graphs. The algorithm is deterministic, and no auxiliary information besides port numbering is required. (c) 2009 Elsevier B.V. All rights reserved.

Non-contractible non-edges in 2-connected graphs

Any pair of non-adjacent vertices forms a non-edge in a graph. Contraction of a non-edge merges two non-adjacent vertices into a single vertex such that the edges incident on the non-adjacent vertices are now incident on the merged vertex. In this paper, we consider simple connected graphs, hence parallel edges are removed after contraction. The minimum number of nodes whose removal disconnects the graph is the connectivity of the graph. We say a graph is k-connected, if its connectivity is k. A non-edge in a k-connected graph is contractible if its contraction does not result in a graph of lower connectivity. Otherwise the non-edge is non-contractible. We focus our study on non-contractible non-edges in 2-connected graphs. We show that cycles are the only 2-connected graphs in which every non-edge is non-contractible. (C) 2010 Elsevier B.V. All rights reserved.

Algorithmic aspects of k-tuple total domination in graphs

For a fixed positive integer k, a k-tuple total dominating set of a graph G = (V. E) is a subset T D-k of V such that every vertex in V is adjacent to at least k vertices of T Dk. In minimum k-tuple total dominating set problem (MIN k-TUPLE TOTAL DOM SET), it is required to find a k-tuple total dominating set of minimum cardinality and DECIDE MIN k-TUPLE TOTAL DOM SET is the decision version of MIN k-TUPLE TOTAL DOM SET problem. In this paper, we show that DECIDE MIN k-TUPLE TOTAL DOM SET is NP-complete for split graphs, doubly chordal graphs and bipartite graphs. For chordal bipartite graphs, we show that MIN k-TUPLE TOTAL DOM SET can be solved in polynomial time. We also propose some hardness results and approximation algorithms for MIN k-TUPLE TOTAL DOM SET problem. (c) 2012 Elsevier B.V. All rights reserved.

Loss ratio of the EDF scheduling policy with early discarding technique

This paper considers a firm real-time M/M/1 system, where jobs have stochastic deadlines till the end of service. A method for approximately specifying the loss ratio of the earliest-deadline-first scheduling policy along with exit control through the early discarding technique is presented. This approximation uses the arrival rate and the mean relative deadline, normalized with respect to the mean service time, for exponential and uniform distributions of relative deadlines. Simulations show that the maximum approximation error is less than 4% and 2% for the two distributions, respectively, for a wide range of arrival rates and mean relative deadlines. (C) 2013 Elsevier B.V. All rights reserved.

Parameterized Algorithms for MAX COLORABLE INDUCED SUBGRAPH Problem on Perfect Graphs

We address the parameterized complexity ofMaxColorable Induced Subgraph on perfect graphs. The problem asks for a maximum sized q-colorable induced subgraph of an input graph G. Yannakakis and Gavril IPL 1987] showed that this problem is NP-complete even on split graphs if q is part of input, but gave a n(O(q)) algorithm on chordal graphs. We first observe that the problem is W2]-hard parameterized by q, even on split graphs. However, when parameterized by l, the number of vertices in the solution, we give two fixed-parameter tractable algorithms. The first algorithm runs in time 5.44(l) (n+#alpha(G))(O(1)) where #alpha(G) is the number of maximal independent sets of the input graph. The second algorithm runs in time q(l+o()l())n(O(1))T(alpha) where T-alpha is the time required to find a maximum independent set in any induced subgraph of G. The first algorithm is efficient when the input graph contains only polynomially many maximal independent sets; for example split graphs and co-chordal graphs. The running time of the second algorithm is FPT in l alone (whenever T-alpha is a polynomial in n), since q <= l for all non-trivial situations. Finally, we show that (under standard complexitytheoretic assumptions) the problem does not admit a polynomial kernel on split and perfect graphs in the following sense: (a) On split graphs, we do not expect a polynomial kernel if q is a part of the input. (b) On perfect graphs, we do not expect a polynomial kernel even for fixed values of q >= 2.

On strong centerpoints

Let P be a set of n points in R-d and F be a family of geometric objects. We call a point x is an element of P a strong centerpoint of P w.r.t..F if x is contained in all F is an element of F that contains more than cn points of P, where c is a fixed constant. A strong centerpoint does not exist even when F is the family of halfspaces in the plane. We prove the existence of strong centerpoints with exact constants for convex polytopes defined by a fixed set of orientations. We also prove the existence of strong centerpoints for abstract set systems with bounded intersection. (C) 2014 Elsevier B.V. All rights reserved.