#Pontiff-Ex : the Twitter community’s reaction to the Papal resignation

In this paper, we provide an account-centric analysis of the tweeting activity of, and public response to, Pope Benedict XVI via the @pontifex Twitter account(s). We focus our investigation on the particular phase around Pope Benedict XVI’s resignation to generate insights into the use of Twitter in response to a celebrity crisis event. Through a combined qualitative and quantitative methodological approach we generate an overview of the follower-base and tweeting activity of the @pontifex account. We identify a very one-directional communication pattern (many @mentions by followers yet zero @replies from the papal account itself), which prompts us to enquire further into what the public resonance of the @pontifex account is. We also examine reactions to the resurrection of the papal Twitter account by Pope Benedict XVI’s successor. In this way, we provide a comprehensive analysis of the public response to the immediate events around the crisis event of Pope Benedict XVI’s resignation and its aftermath via the network of users involved in the @pontifex account.

The application of social network analysis in the construction industry of Hong Kong

The Hong Kong construction industry is currently facing ageing problem and labour shortage. There are opportunities for employing ethnic minority construction workers to join this hazardous industry. These ethnic minority workers are prone to accidents due to communication barriers. Safety communication is playing an important role for avoiding the accidents on construction sites. However, the ethnic minority workers are not very fluent in the local language and facing safety communication problems while working with local workers. Social network analysis (SNA), being an effective tool to identify the safety communication flow on the construction site, is used to attain the measures of safety communication like centrality, density and betweenness within the ethnic minorities and local workers, and to generate sociograms that visually represent communication pattern within the effective and ineffective safety networks. The aim of this paper is to present the application of SNA for improving the safety communication of ethnic minorities in the construction industry of Hong Kong. The paper provides the theoretical background of SNA approaches for the data collection and analysis using the software UCINET and NetDraw, to determine the predominant safety communication network structure and pattern of ethnic minorities on site.

Redefine: Runtime Reconfigurable Polymorphic ASIC

Emerging embedded applications are based on evolving standards (e.g., MPEG2/4, H.264/265, IEEE802.11a/b/g/n). Since most of these applications run on handheld devices, there is an increasing need for a single chip solution that can dynamically interoperate between different standards and their derivatives. In order to achieve high resource utilization and low power dissipation, we propose REDEFINE, a polymorphic ASIC in which specialized hardware units are replaced with basic hardware units that can create the same functionality by runtime re-composition. It is a ``future-proof'' custom hardware solution for multiple applications and their derivatives in a domain. In this article, we describe a compiler framework and supporting hardware comprising compute, storage, and communication resources. Applications described in high-level language (e.g., C) are compiled into application substructures. For each application substructure, a set of compute elements on the hardware are interconnected during runtime to form a pattern that closely matches the communication pattern of that particular application. The advantage is that the bounded CEs are neither processor cores nor logic elements as in FPGAs. Hence, REDEFINE offers the power and performance advantage of an ASIC and the hardware reconfigurability and programmability of that of an FPGA/instruction set processor. In addition, the hardware supports custom instruction pipelining. Existing instruction-set extensible processors determine a sequence of instructions that repeatedly occur within the application to create custom instructions at design time to speed up the execution of this sequence. We extend this scheme further, where a kernel is compiled into custom instructions that bear strong producer-consumer relationship (and not limited to frequently occurring sequences of instructions). Custom instructions, realized as hardware compositions effected at runtime, allow several instances of the same to be active in parallel. A key distinguishing factor in majority of the emerging embedded applications is stream processing. To reduce the overheads of data transfer between custom instructions, direct communication paths are employed among custom instructions. In this article, we present the overview of the hardware-aware compiler framework, which determines the NoC-aware schedule of transports of the data exchanged between the custom instructions on the interconnect. The results for the FFT kernel indicate a 25% reduction in the number of loads/stores, and throughput improves by log(n) for n-point FFT when compared to sequential implementation. Overall, REDEFINE offers flexibility and a runtime reconfigurability at the expense of 1.16x in power and 8x in area when compared to an ASIC. REDEFINE implementation consumes 0.1x the power of an FPGA implementation. In addition, the configuration overhead of the FPGA implementation is 1,000x more than that of REDEFINE.

A systolic algorithm for hidden surface removal

With the advent of VLSI it has become possible to map parallel algorithms for compute-bound problems directly on silicon. Systolic architecture is very good candidate for VLSI implementation because of its regular and simple design, and regular communication pattern. In this paper, a systolic algorithm and corresponding systolic architecture, a linear systolic array, for the scanline-based hidden surface removal problem in three-dimensional computer graphics have been proposed. The algorithm is based on the concept of sample spans or intervals. The worst case time taken by the algorithm is O(n), n being the number of segments in a scanline. The time taken by the algorithm for a given scene depends on the scene itself, and on an average considerable improvement over the worst case behaviour is expected. A pipeline scheme for handling the I/O process has also been proposed which is suitable for VLSI implementation of the algorithm.

Compiler/Runtime Framework for Dynamic Dataflow Parallelization of Tiled Programs

Task-parallel languages are increasingly popular. Many of them provide expressive mechanisms for intertask synchronization. For example, OpenMP 4.0 will integrate data-driven execution semantics derived from the StarSs research language. Compared to the more restrictive data-parallel and fork-join concurrency models, the advanced features being introduced into task-parallelmodels in turn enable improved scalability through load balancing, memory latency hiding, mitigation of the pressure on memory bandwidth, and, as a side effect, reduced power consumption. In this article, we develop a systematic approach to compile loop nests into concurrent, dynamically constructed graphs of dependent tasks. We propose a simple and effective heuristic that selects the most profitable parallelization idiom for every dependence type and communication pattern. This heuristic enables the extraction of interband parallelism (cross-barrier parallelism) in a number of numerical computations that range from linear algebra to structured grids and image processing. The proposed static analysis and code generation alleviates the burden of a full-blown dependence resolver to track the readiness of tasks at runtime. We evaluate our approach and algorithms in the PPCG compiler, targeting OpenStream, a representative dataflow task-parallel language with explicit intertask dependences and a lightweight runtime. Experimental results demonstrate the effectiveness of the approach.

集群网络评测模型的新探索

传统集群网络(cluster area network,简称cLAN)的评测模型主要考虑了延迟、带宽、路由、拥塞、网络拓扑结构等因素.但这些因素是否足以描述实际应用程序在集群上的通信行为,或者对其在集群系统上的性能给出一个很好的预测呢?当对NAS Parallel Benchmark(2.4版本)在集群系统深腾1800(DeepComp 1800)上进行大量测试时发现,集群网络的通信性能可以被一种特殊的通信模式(LU模式)所严重影响.更深入的研究表明,这个影响LU模式的因素是独立于前面所述的如延迟、带宽、路由、拥塞、网络拓扑结构等因素的.因此有必要对集群网络的评测模型重新进行审视,并增加一个新的性能评测因子以反映这个新发现的现象.从研究结果来看,这个重新审视也将对集群系统上的并行算法设计以及实际大规模科学计算的应用程序性能的优化提供一些新的思路.

Interpretação e comunicação em ambientes de aprendizagem gerados pelo processo de modelagem matemática

Esta pesquisa teve por objetivo observar, compreender e descrever a produção de sentidos mediante as interações dos alunos entre si, e destes com o professor ao desenvolverem projetos de modelagem matemática. A investigação foi realizada em uma turma de 5ª série de uma Escola de Ensino Fundamental e Médio da Rede Federal de Ensino na cidade de Belém do Pará. A observação participante foi à técnica predominantemente utilizada para a coleta de dados, que foram registrados através do diário de campo, de vídeos-gravações das aulas e áudios capitados nos grupos de alunos, quando desenvolviam as atividades propostas, constituindo assim a metodologia adotada. Desse modo, a pesquisa, de cunho qualitativo, se caracterizou como pesquisa-participante. O referencial teórico que subsidiou a pesquisa foi composto, predominantemente pela filosofia da matemática de Ludwig Wittgenstein, que entende o jogo de linguagem como uma forma de vida, ressaltando que a aplicação de regras e seus sentidos fazem parte desse jogo; o conceito de resíduo de Gilles-Gaston Granger, que se refere aos significados que estão além do texto matemático formal, ou seja, os aspectos que escaparam da malhas da rede lingüística; o conceito da educação matemática crítica, que se refere aos aspectos políticos da educação matemática e que traz para o debate, questões ligadas ao tema poder, que refletem nas interações entre os sujeitos no ato cognoscitivo, estabelecendo padrões de comunicação; além dos autores que tratam da modelagem matemática no ensino. As análises apontam para possibilidades de produção de ambientes de aprendizagem apropriados para transitar um padrão de comunicação que desempenhe sua função primordial em situação de ensinoaprendizagem: a comunicação através da linguagem ou dos jogos de linguagem.

Latino Family Involvement: An Exploratory Study of Latina Mother-Daughter Relationships and their Effects on Educational Attainment and Resiliency

Latino family involvement is an important issue in the field of education. Effective strategies to promote family involvement in the Latino community are vital for the educational attainment of Latino students and emotional wellbeing of Latino families. This study used focus groups, in-depth interviews, and observations to examine Latino family involvement and the relationships and communication patterns between Latina mothers and daughters. The Latina mother-daughter relationship was studied in an effort to gain a better understanding of how this relationship affects a Latina daughter's educational attainment and sense of resiliency. Results indicated that a positive relationship between a Latina mother and daughter can increase a Latina daughter's level of educational attainment and sense of resiliency. Additionally, a Latina daughter's level of self-motivation can affect her level of educational attainment as well. Cultural narratives were found to be a common type of communication pattern used between Latina mothers and daughters. They were used to teach cultural values, life lessons, and experiential learning. By improving family involvement efforts within the Latino culture, Latino students will likely see drastic improvements in their overall levels of educational attainment and emotional wellbeing in schools. Implications for Latino students and families, schools that work with Latino families, and educational policy are also discussed.

The cross layer RMPA handover: a reliable mobility pattern aware handover strategy for broadband wireless communication in a high-speed railway domain

Enhancing the handover process in broadband wireless communication deployment has traditionally motivated many research initiatives. In a high-speed railway domain, the challenge is even greater. Owing to the long distances covered, the mobile node gets involved in a compulsory sequence of handover processes. Consequently, poor performance during the execution of these handover processes significantly degrades the global end-to-end performance. This article proposes a new handover strategy for the railway domain: the RMPA handover, a Reliable Mobility Pattern Aware IEEE 802.16 handover strategy "customized" for a high-speed mobility scenario. The stringent high mobility feature is balanced with three other positive features in a high-speed context: mobility pattern awareness, different sources for location discovery techniques, and a previously known traffic data profile. To the best of the authors' knowledge, there is no IEEE 802.16 handover scheme that simultaneously covers the optimization of the handover process itself and the efficient timing of the handover process. Our strategy covers both areas of research while providing a cost-effective and standards-based solution. To schedule the handover process efficiently, the RMPA strategy makes use of a context aware handover policy; that is, a handover policy based on the mobile node mobility pattern, the time required to perform the handover, the neighboring network conditions, the data traffic profile, the received power signal, and current location and speed information of the train. Our proposal merges all these variables in a cross layer interaction in the handover policy engine. It also enhances the handover process itself by establishing the values for the set of handover configuration parameters and mechanisms of the handover process. RMPA is a cost-effective strategy because compatibility with standards-based equipment is guaranteed. The major contributions of the RMPA handover are in areas that have been left open to the handover designer's discretion. Our simulation analysis validates the RMPA handover decision rules and design choices. Our results supporting a high-demand video application in the uplink stream show a significant improvement in the end-to-end quality of service parameters, including end-to-end delay (22%) and jitter (80%), when compared with a policy based on signal-to-noise-ratio information.

Wireless optical communication-based spatial pattern

We propose a novel communication technique which utilizes a set of mutually distinguishable optical patterns instead of convergent facula to transmit information. The communication capacity is increased by exploiting the optical spatial bandwidth resources. An optimum detector for this communication is proposed based on maximum-likelihood decision. The fundamental rule of designing signal spatial pattern is formulated from analysis of the probability of error decision. Finally, we present a typical electro-optical system scheme of the proposed communication. (c) 2006 Elsevier GmbH. All rights reserved.

Multi-channel 2-D pattern transfer model based on imaging optics for submarine laser uplink communication

An optical communication scheme of 2-D pattern transfer based on imaging optics for submarine laser uplink communication (SLUC) is suggested. Unlike the methods aiming at avoiding neighboring crosstalk used in traditional multi-channel optical beam transferring, we make full use of the overlapping of each spreading beam other than controlling divergence effect of each beam to avoid interference noise. The apparent parameters have been introduced to simplify theoretical analysis of optical pattern transfer problem involving underwater condition, with the help of which the complex beam propagation inside two kinds of mediums can be easily reduced to brief beam transfer only inside air medium. In this paper, optical transmission path and receiver terminal optics geometry have been described in detail. The link range equation and system uplink performance analysis have also been given. At last, results of a proof-of-concept experiment indicate good feasibility of the proposed SLUC model. © 2007 Elsevier GmbH. All rights reserved.

Pattern-based analysis of EAI languages : the case of the business modelling language

Enterprise Application Integration (EAI) is a challenging area that is attracting growing attention from the software industry and the research community. A landscape of languages and techniques for EAI has emerged and is continuously being enriched with new proposals from different software vendors and coalitions. However, little or no effort has been dedicated to systematically evaluate and compare these languages and techniques. The work reported in this paper is a first step in this direction. It presents an in-depth analysis of a language, namely the Business Modeling Language, specifically developed for EAI. The framework used for this analysis is based on a number of workflow and communication patterns. This framework provides a basis for evaluating the advantages and drawbacks of EAI languages with respect to recurrent problems and situations.

Workflow resource pattern simulation and visualization

This thesis addresses the process simulation and validation in Business Process Management. It proposes that the hybrid Multi Agent System (MAS) / 3D Virtual World approach is a valid method for better simulating the behaviour of human resources in business processes, supporting a wide range of rich visualization applications that can facilitate communication between business analysts and stakeholders. It is expected that the findings of this thesis may be fruitfully extended from BPM to other application domains, such as social simulation in video games and computer-based training animations.

A pattern adaptive thinning algorithm

A simple sequential thinning algorithm for peeling off pixels along contours is described. An adaptive algorithm obtained by incorporating shape adaptivity into this sequential process is also given. The distortions in the skeleton at the right-angle and acute-angle corners are minimized in the adaptive algorithm. The asymmetry of the skeleton, which is a characteristic of sequential algorithm, and is due to the presence of T-corners in some of the even-thickness pattern is eliminated. The performance (in terms of time requirements and shape preservation) is compared with that of a modern thinning algorithm.

Multi Pattern Dynamic Time Warping For Automatic Speech Recognition

We are addressing the problem of jointly using multiple noisy speech patterns for automatic speech recognition (ASR), given that they come from the same class. If the user utters a word K times, the ASR system should try to use the information content in all the K patterns of the word simultaneously and improve its speech recognition accuracy compared to that of the single pattern based speech recognition. T address this problem, recently we proposed a Multi Pattern Dynamic Time Warping (MPDTW) algorithm to align the K patterns by finding the least distortion path between them. A Constrained Multi Pattern Viterbi algorithm was used on this aligned path for isolated word recognition (IWR). In this paper, we explore the possibility of using only the MPDTW algorithm for IWR. We also study the properties of the MPDTW algorithm. We show that using only 2 noisy test patterns (10 percent burst noise at -5 dB SNR) reduces the noisy speech recognition error rate by 37.66 percent when compared to the single pattern recognition using the Dynamic Time Warping algorithm.