In our fast-paced, hectic time, which is stamped by an ever-increasing degree of nervousness, unrest, and unsteadiness it has become customary for mankind to relax for a shorter or longer period of time from the habits of everyday life and recreation. To search for strength somewhere on earth that is away from the place of business, that invites you to rest from everyday worries and toils. So lures the Black Forest. With these words, the Sommerberg-Hotel was advertised already over 100 years ago. Nowadays stress has become a fashionable term in our modern and digital world. For many, it is almost a status symbol - because those who are stressed have a lot on their plate and are therefore important. This attitude is leading to increasing health issues and to a society that is not able to breathe anymore because they have to be in working order. After decades of being empty and unused, the Sommerberg-Hotel occupies a unique location on top of the mountain in the Black Forest. Following its rich past and responding to society's needs it becomes once more a refuge to escape the rush. In close dialogue with the existing, this project investigates a possible transformation and a repurposing of the old structures of the Sommerberg-Hotel. Making it to The Mental Wellbeing Place.

No description available.

Maude es un lenguaje de programación declarativo basado en la lógica de reescritura que incorpora muchas características que lo hacen muy potente. Sin embargo, a la hora de probar ciertas propiedades computacionales esto conlleva dificultades. La tarea de probar la terminación de sistemas de reesctritura es de hecho bastante dura, pero aplicada a lenguajes de programación reales se concierte en más complicada debido a estas características inherentes. Esto provoca que métodos para probar la terminación de este tipo de programas requieran técnicas específicas y un análisis cuidadoso. Varios trabajos han intentado probar terminación de (un subconjunto de) programas Maude. Sin embargo, todos ellos siguen una aproximación transformacional, donde el programa original es trasformado hasta alcanzar un sistema de reescritura capaz de ser manejado con las técnicas y herramientas de terminación existentes. En la práctica, el hecho de transformar los sistemas originales suele complicar la demostración de la terminación ya que esto introduce nuevos símbolos y reglas en el sistema. En esta tesis, llevamos a cabo el problema de probar terminación de (un subconjunto de) programas Maude mediante métodos directos. Por un lado, nos centramos en la estrategia de Maude. Maude es un lenguaje impaciente donde los argumentos de una función son evaluados siempre antes de la aplicación de la función que los usa. Esta estrategia (conocida como llamada por valor) puede provocar la no terminación si los programas no están escritos cuidadosamente. Por esta razón, Maude (en concreto) incorpora mecanismos para controlar la ejecución de programas como las anotaciones sintácticas que están asociadas a los argumentos de los símbolos. En reescritura, esta estrategia sería conocida como reescritura sensible al contexto innermost (RSCI). Por otro lado, Maude también incorpora la posibilidad de declarar atributos. / Alarcón Jiménez, B. (2011). Towards a Framework for Proving Termination of Maude Programs [Tesis doctoral]. Universitat Politècnica de València. https://doi.org/10.4995/Thesis/10251/11003

Conselho Nacional de Desenvolvimento CientÃfico e TecnolÃgico / Em razÃo da crescente demanda de usuÃrios mÃveis por conteÃdos criados com formato especÃfico e personalizado, ou adaptado para atender suas necessidades e preferÃncias no uso da web, as redes convergentes sensÃveis ao contexto incorporam uma promissora tecnologia para permitir aplicaÃÃes de serviÃos personalizados a mÃltiplos usuÃrios. O projeto C-CAST (Context Casting) (C-CAST, 2012) foi estabelecido para arquiteturas de redes convergentes sensÃveis ao contexto para suportar sessÃes com qualidade de serviÃo (QoS - Quality of Service) de forma garantida a mÃltiplos usuÃrios, simultaneamente, independentemente de suas tecnologias de conexÃo sem fio. O mecanismo de controle do C-CAST Legado introduz questÃes de degradaÃÃo de desempenho, visto que a abordagem de sinalizaÃÃo adotada à direcionada por fluxo. Isto significa que a carga de sinalizaÃÃo aumenta exponencialmente com o nÃmero de admissÃes de fluxo. Este trabalho propÃe o C-CAST AvanÃado, o qual aperfeiÃoa o sistema do C-CAST Legado pela extensÃo de mecanismos inovadores que integram um controle dinÃmico da largura de banda sobreaprovisionada por classes de serviÃo e alocaÃÃo de Ãrvores overlay. Por meio dessa estratÃgia, busca-se reduzir taxas de sinalizaÃÃo de controle e alocaÃÃo de recursos em todo o sistema. A avaliaÃÃo do C-CAST AvanÃado à conduzida por meio de simulaÃÃo, demonstrando seus benefÃcios em relaÃÃo ao C-CAST Legado, por otimizar significativamente os nÃveis de desempenho de todo o sistema de rede, enquanto mantÃm usuÃrios com a melhor percepÃÃo de qualidade. / Due to the increase demand of mobile users for content created in a specific and customized way, or adapted to comply with the needs and preferences in web usage, converged networks which are context-sensitive have been incorporated to a promising technology and enabled applications of personalized services to multiple users. The C-CAST project (Context Casting) was established to converged network architectures to support context-sensitive sessions with quality of service (QoS - Quality of Service) in a manner to guarantee to multiple users simultaneously, regardless of their wireless technologies. The C-CAST control mechanism of the Legacy introduces issues of performance degradation, once the signaling approach adopted is directed per-flow, which means that the signaling load increases exponentially with the number of admissions flow. This work proposes the Advanced of C-CAST, which reconstruct the C-CAST legacy system by the extent of innovative mechanisms that integrate dynamic control of provisioned bandwidth by the service classes and allocation overlay trees. Through this strategy, it seeks to reduce rates of control signaling and allocating resources throughout the system. The C-CAST Advanced evaluation is conducted through simulation, demonstrating its benefits in relation to C-CAST Legacy, by significantly optimization the performance levels of the entire network system while keep the network users with the best quality perception.

Submitted by Fabio Sobreira Campos da Costa (fabio.sobreira@ufpe.br) on 2016-03-31T15:37:57Z No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertacao Julierme Araujo _ Versão Final_Biblioteca Central.pdf: 5689636 bytes, checksum: 17f1c9468e867914d378e2fef1626269 (MD5) / Made available in DSpace on 2016-03-31T15:37:57Z (GMT). No. of bitstreams: 2 license_rdf: 1232 bytes, checksum: 66e71c371cc565284e70f40736c94386 (MD5) Dissertacao Julierme Araujo _ Versão Final_Biblioteca Central.pdf: 5689636 bytes, checksum: 17f1c9468e867914d378e2fef1626269 (MD5) Previous issue date: 2014-09-12 / Vários fatores interligados ou isolados podem desencadear graves anormalidades no Sistema Elétrico de Potência (SEP). Dentre estes fatores, um de fundamental importância é o humano. Os operadores (OP) são aqueles que estão constantemente em contato com os equipamentos das instalações (presencialmente ou remotamente) e desempenham papel vital na correta operação do SEP. Um das principais atividades do OP é a execução de manobras em tempo real, seguindo o estabelecido pelo documento de plano de manobras (PM). No entanto, devido à natureza repetitiva destas atividades os OPs estão sujeitos a cometerem falhas operacionais. Tais eventos podem ocorrer através de uma mera desatenção na execução dos PMs ou na total negligência destes. Operações em equipamentos a partir de manobras mal elaboradas, bem como softwares que não favoreçam a elaboração e a validação de tais manobras, também são fatores que promovem a ocorrência de falhas humanas e anormalidades no processo. Neste trabalho é apresentada uma arquitetura para implementação de um conceito de sistema baseado em software, hardware e sensibilidade a contexto. Em simulações referentes às operações sobre manobras, foi possível observar o sistema atuando de forma preventiva ao alertar o usuário sobre possíveis atividades inconsistentes. A execução de manobras em subestações ocorreu através de uma versão do sistema para dispositivos móveis. Essa abordagem promoveu vários benefícios como, por exemplo, a eliminação de falhas oriundas de atividades repetitivas, o estabelecimento de um mecanismo de confirmação da execução da manobra e o aperfeiçoamento do processo de interação entre os operadores de sistemas e operadores de subestações. Tendo como referência resultados que apontam uma redução de 47% da taxa de anormalidades geradas pelos processos de elaboração e validação de manobras operativas, chegou-se a conclusão que o conceito de sistema apresentado neste trabalho promoveu uma considerável diminuição nas deficiências oriundas desses processos e aumentou a qualidade e a segurança no processo de execução de manobras. / Several factors, interconnected or isolated, may be the cause of abnormalities on the Electric Power Systems (EPS). Among such factors, human factors play a fundamental role. Operators (OPs) are the staff responsible to deal with installations equipment, operated both presently or remotely, playing a vital part to the correct operation of the EPS. One of OP’s main activities is executing maneuvers in real time, following what was established by the maneuvers plan (MP) establishes. However, due to the repetitive nature of these activities, OPs are subject to commit operational failures. These events may occur through a mere inattention in the execution of the MPs or in their total neglect. Equipment operations from poorly elaborated maneuvers, as well as softwares that do not favor the elaboration and validation of those maneuvers are also factors that promote the occurrence of human failure and abnormalities in the process. Herein this work we present a hardware - software architecture sensible to context. In simulations related to operations on maneuvers it was possible to observe the system’s prototype acting preventively when it alerts the user about possible inconsistent activities. The maneuvering in substations occurred through a system version for mobile devices. This approach promoted several benefits such as the correction of the faults originated from repetitive activities, the establishment of a mechanism for confirmation of the maneuvering and the improvement of the interaction process between system and substation operators. Having as reference results which show a reduction of 47% in the rate of abnormalities generated by the drafting and validation of operational maneuvers, we concluded that the concept of system presented in this paper promoted a considerable decrease in deficiencies originated from these processes and increased the quality and safety maneuvers in the process.

This thesis examines pupils’ justice conceptions regarding educational assessment. Due to the context-dependency of norms and values as well as of assessment, the study compares the justice conceptions of pupils in two different’socio-educational’ contexts: Sweden and Germany. The main interest of the study is to understand and to reconstruct pupils’ own relevance structures and what just assessment means from a pupils’ point of view. Here, the study aims to reach beyond the level of mere description by providing theoretical conceptualisations of pupils’ justice conceptions regarding assessment. Thus, the study´s methodological foundation is characterised by a combination of a context-sensitive comparative approach on the one hand, and on the other hand a pragmatist Grounded Theory approach. Data were mainly generated through focus group interviews with pupils attending the last year of the lower secondary level in the Swedish comprehensive school as well as in different school types in the German school system. In total, the sample consists of 95 pupils, who were interviewed in 21 focus group interviews. In addition, other sources of data were included, such as regulations and guidelines that supported a context-sensitive analysis of pupils’ conceptions. The theoretical conceptualisation that explains pupils’ justice conceptions is ‘meta-assessment’. ‘Meta-assessment’ refers to pupils’ evaluation of the assessment they experience in terms of justice and represents the shared, abductively derived and overlying analytical category regarding pupils’ conceptions. Pupils’ ‘meta-assessment’ is based on normative justice conceptions as well as on justice conceptions that are related to pupils’ situation and context-bound experiences with assessment. The first ones are about the ethico-moral character of pupils’ justice conceptions. The second shed light on the contextual conditions and consequences of the logics and practices underlying educational assessment as experienced by pupils on an everyday basis. This implies that just assessment from a pupils’ perspective needs to be understood in its wider contextual embedment; and in relation to teaching and learning in order to understand the complex interrelations of what just assessment ‘is’, and ‘should be’ from the perspective of those, who are mainly affected by it.

Pointer analysis is one of the key static analyses during compilation. The efficiency of several compiler optimizations and transformations depends directly on the scalability and precision of the underlying pointer analysis. Recent advances still lack an efficient and scalable context-sensitive inclusion-based pointer analysis. In this work, we propose four novel techniques to improve the scalability of context-sensitive points-to analysis for C/C++ programs. First, we develop an efficient way of storing the approximate points-to information using a multi-dimensional bloom filter (multibloom). By making use of fast hash functions and exploiting the spatial locality of the points-to information, our multibloom-based points-to analysis offers significant savings in both analysis time and memory requirement. Since the representation never resets any bit in the multibloom, no points-to information is ever lost; and the analysis is sound, though approximate. This allows a client to trade off a minimal amount of precision but gain huge savings(two orders less) in memory requirement. By making use of multiple random and independent hash functions, the algorithm also achieves high precision and runs, on an average,2×faster than Andersen’s points-to analysis. Using Mod/Ref analysis as a client, we illustrate that the precision is above 98% of that of Andersen’s analysis. Second, we devise a sound randomized algorithm that processes a group of constraints in a less precise but efficient manner and the remaining constraints in a more precise manner. By randomly choosing different groups of constraints across different runs, the analysis results in different points-to information, each of which is guaranteed to be sound. By joining the results of a few runs, the analysis obtains an approximation that is very close to the one obtained by the more precise analysis and still proves efficient in terms of the analysis time. We instantiate our technique to develop a randomized context-sensitive points-to analysis. By varying the level of randomization, a client of points-to analysis can trade off minimal precision (less than 5%) for large gain in efficiency(over 50% reduction in analysis time). We also develop an adaptive version of the randomized algorithm that carefully varies the randomization across different runs to achieve maximum benefit in terms of analysis time and precision without pre-setting the randomization percentage and the number of runs. Third, we transform the points-to analysis problem into finding a solution to a system of linear equations. By making novel use of prime factorization, we illustrate how to transform complex points-to constraints into a set of linear equations and transform the solution back as a points-to solution. We prove that our algorithm is sound and show that our technique is 1.8×faster than Andersen’s analysis for large benchmarks. Finally, we observe that the order in which points-to constraints are processed plays a vital role in the algorithm efficiency. We prove that finding an optimal ordering to compute the fixpoint solution is NP-Hard. We then propose a greedy heuristic based on the amount of points-to information computed by a constraint to prioritize the constraints. This results in a dynamic ordering of the constraint evaluation which, in turn, results in skewed evaluation of constraints where each constraint is evaluated repeatedly and different number of times in a single iteration. Our prioritized analysis achieves, on an average, an improvement of 33% over Andersen’s points-to analysis. We illustrate that our algorithms help in scaling the state-of-the-art pointer analyses. We also believe that the techniques developed would be useful for other program analyses and transformations.

Aufgrund der stetig wachsenden Weltbevölkerung bei gleichzeitig sinkenden Agrarressourcen ist die Automatisierung auf dem Feld notwendig. Die dafür erforderlichen Maschinen, Technologien und Datenströme sind im entstehen und z. T. verfügbar. Jedoch ist die Automatisierung auf dem Feld im Vergleich zur Fabrikautomation zusätzlichen Störgrößen ausgesetzt, die eine permanent verfügbare Eingriffsressource notwendig machen. Der Autor postuliert die Entstehung von Maschinen Teams, die von einem besetzten Schlepper geführt werden. Durch die Führung der zusätzlichen Automaten, in deren Programmablauf eingegriffen werden muss, wird die Komplexität der Mensch-Maschine Schnittstelle zunehmen. Hier ist aber schon eine Grenze erreicht, sodaß zusätzliche Bedienelemente oder weitere Displays keine Lösung darstellen. Als Lösung werden hier Elemente aufgezeigt, die Flexibilität in der Bedienung und in der Darstellung optimieren und so zu einem permanenten Wechsel in puncto Maschinenbedienung fähig sind. An einem realisierten Prototyp werden Technologien und Funktionsumfänge deutlich gemacht.

This paper addresses the issue of design and implementation of syntactic analysis based on the context sensitive languages, respectively, grammars that contains constructs, which isn't possible to analyze with the help of the standard parsers based on the context free grammars. More specifically, this paper deals with the possibility of adding context sensitive support to the classic LL-analysis by replacing the standard pushdown automata (PDA) with deep pushdown automata (DP), which were introduced and published by prof. Alexander Meduna.

Within the area of context-sensitive code completion there is a need for accurate predictive models in order to provide useful code completion predictions. The traditional method for optimizing the performance of code completion systems is to empirically evaluate the effect of each system parameter individually and fine-tune the parameters. This thesis presents a genetic algorithm that can optimize the system parameters with a degree-of-freedom equal to the number of parameters to optimize. The study evaluates the effect of the optimized parameters on the prediction quality of the studied code completion system. Previous evaluation of the reference code completion system is also extended to include model size and inference speed. The results of the study shows that the genetic algorithm is able to improve the prediction quality of the studied code completion system. Compared with the reference system, the enhanced system is able to recognize 1 in 10 additional previously unseen code patterns. This increase in prediction quality does not significantly impact the system performance, as the inference speed remains less than 1 ms for both systems. / Inom området kontextkänslig kodkomplettering finns det ett behov av precisa förutsägande modeller för att kunna föreslå användbara kodkompletteringar. Den traditionella metoden för att optimera prestanda hos kodkompletteringssystem är att empiriskt utvärdera effekten av varje systemparameter individuellt och finjustera parametrarna. Det här arbetet presenterar en genetisk algoritm som kan optimera systemparametrarna med en frihetsgrad som är lika stor som antalet parametrar att optimera. Studien utvärderar effekten av de optimerade parametrarna på det studerade kodkompletteringssystemets pre- diktiva kvalitet. Tidigare utvärdering av referenssystemet utökades genom att även inkludera modellstorlek och slutledningstid. Resultaten av studien visar att den genetiska algoritmen kan förbättra den prediktiva kvali- teten för det studerade kodkompletteringssystemet. Jämfört med referenssystemet så lyckas det förbättrade systemet korrekt känna igen 1 av 10 ytterligare kodmönster som tidigare varit osedda. Förbättringen av prediktiv kvalietet har inte en signifikant inverkan på systemet, då slutledningstiden förblir mindre än 1 ms för båda systemen.