Technical communication in the global context : a heuristic approach to disciplinary identity and pedagogical practices

There is nothing new or original in stating that the global economy directly impacts the profession of technical communicators. The globalization of the workplace requires that technical communicators be prepared to work in increasingly linguistically and culturally diverse contexts. These new exigencies have natural repercussions on the research and educational practices of the field In this work, I draw on rhetoric, linguistics, and literacy theory to explore the definition, role and meaning of the global context for the disciplinary construction of professional and technical communication. By adopting an interdisciplinary and diachronic perspective, I assert that the global context is a heuristic means for sophisticating the disciplinary identity of the field and for reinforcing its place within the humanities. Consequently, I contend that the globalization of the workplace is a kairotic moment for underscoring the rhetorical dimension of professional and technical communication.

Data-driven estimates of the number of clusters in multivariate time series

An important problem in unsupervised data clustering is how to determine the number of clusters. Here we investigate how this can be achieved in an automated way by using interrelation matrices of multivariate time series. Two nonparametric and purely data driven algorithms are expounded and compared. The first exploits the eigenvalue spectra of surrogate data, while the second employs the eigenvector components of the interrelation matrix. Compared to the first algorithm, the second approach is computationally faster and not limited to linear interrelation measures.

A COMPARATIVE STUDY OF HEURISTIC OPTIMIZATION ALGORITHMS

Heuristic optimization algorithms are of great importance for reaching solutions to various real world problems. These algorithms have a wide range of applications such as cost reduction, artificial intelligence, and medicine. By the term cost, one could imply that that cost is associated with, for instance, the value of a function of several independent variables. Often, when dealing with engineering problems, we want to minimize the value of a function in order to achieve an optimum, or to maximize another parameter which increases with a decrease in the cost (the value of this function). The heuristic cost reduction algorithms work by finding the optimum values of the independent variables for which the value of the function (the “cost”) is the minimum. There is an abundance of heuristic cost reduction algorithms to choose from. We will start with a discussion of various optimization algorithms such as Memetic algorithms, force-directed placement, and evolution-based algorithms. Following this initial discussion, we will take up the working of three algorithms and implement the same in MATLAB. The focus of this report is to provide detailed information on the working of three different heuristic optimization algorithms, and conclude with a comparative study on the performance of these algorithms when implemented in MATLAB. In this report, the three algorithms we will take in to consideration will be the non-adaptive simulated annealing algorithm, the adaptive simulated annealing algorithm, and random restart hill climbing algorithm. The algorithms are heuristic in nature, that is, the solution these achieve may not be the best of all the solutions but provide a means to reach a quick solution that may be a reasonably good solution without taking an indefinite time to implement.

Prosthetically driven, computer-guided implant planning for the edentulous maxilla: a model study

OBJECTIVES: To analyze computer-assisted diagnostics and virtual implant planning and to evaluate the indication for template-guided flapless surgery and immediate loading in the rehabilitation of the edentulous maxilla. MATERIALS AND METHODS: Forty patients with an edentulous maxilla were selected for this study. The three-dimensional analysis and virtual implant planning was performed with the NobelGuide software program (Nobel Biocare, Göteborg, Sweden). Prior to the computer tomography aesthetics and functional aspects were checked clinically. Either a well-fitting denture or an optimized prosthetic setup was used and then converted to a radiographic template. This allowed for a computer-guided analysis of the jaw together with the prosthesis. Accordingly, the best implant position was determined in relation to the bone structure and prospective tooth position. For all jaws, the hypothetical indication for (1) four implants with a bar overdenture and (2) six implants with a simple fixed prosthesis were planned. The planning of the optimized implant position was then analyzed as follows: the number of implants was calculated that could be placed in sufficient quantity of bone. Additional surgical procedures (guided bone regeneration, sinus floor elevation) that would be necessary due the reduced bone quality and quantity were identified. The indication of template-guided, flapless surgery or an immediate loaded protocol was evaluated. RESULTS: Model (a) - bar overdentures: for 28 patients (70%), all four implants could be placed in sufficient bone (total 112 implants). Thus, a full, flapless procedure could be suggested. For six patients (15%), sufficient bone was not available for any of their planned implants. The remaining six patients had exhibited a combination of sufficient or insufficient bone. Model (b) - simple fixed prosthesis: for 12 patients (30%), all six implants could be placed in sufficient bone (total 72 implants). Thus, a full, flapless procedure could be suggested. For seven patients (17%), sufficient bone was not available for any of their planned implants. The remaining 21 patients had exhibited a combination of sufficient or insufficient bone. DISCUSSION: In the maxilla, advanced atrophy is often observed, and implant placement becomes difficult or impossible. Thus, flapless surgery or an immediate loading protocol can be performed just in a selected number of patients. Nevertheless, the use of a computer program for prosthetically driven implant planning is highly efficient and safe. The three-dimensional view of the maxilla allows the determination of the best implant position, the optimization of the implant axis, and the definition of the best surgical and prosthetic solution for the patient. Thus, a protocol that combines a computer-guided technique with conventional surgical procedures becomes a promising option, which needs to be further evaluated and improved.

Hepatitis C virus drug resistance and immune-driven adaptations: relevance to new antiviral therapy

The efficacy of specifically targeted anti-viral therapy for hepatitis C virus (HCV) (STAT-C), including HCV protease and polymerase inhibitors, is limited by the presence of drug-specific viral resistance mutations within the targeted proteins. Genetic diversity within these viral proteins also evolves under selective pressures provided by host human leukocyte antigen (HLA)-restricted immune responses, which may therefore influence STAT-C treatment response. Here, the prevalence of drug resistance mutations relevant to 27 developmental STAT-C drugs, and the potential for drug and immune selective pressures to intersect at sites along the HCV genome, is explored. HCV nonstructural (NS) 3 protease or NS5B polymerase sequences and HLA assignment were obtained from study populations from Australia, Switzerland, and the United Kingdom. Four hundred five treatment-naïve individuals with chronic HCV infection were considered (259 genotype 1, 146 genotype 3), of which 38.5% were coinfected with human immunodeficiency virus (HIV). We identified preexisting STAT-C drug resistance mutations in sequences from this large cohort. The frequency of the variations varied according to individual STAT-C drug and HCV genotype/subtype. Of individuals infected with subtype 1a, 21.5% exhibited genetic variation at a known drug resistance site. Furthermore, we identified areas in HCV protease and polymerase that are under both potential HLA-driven pressure and therapy selection and identified six HLA-associated polymorphisms (P