Systemic Design for Applying the Combined Use of SSM and CDA to Social Practices

In this paper, we propose a framework for applying the combined use of soft systems methodology (SSM) and critical discourse analysis (CDA) based on social semiotic systemic functional linguistics to social practices. In the social practice, ‘participation’ mode of Checkland’s SSM is used for ‘problem-solving’ whilst CDA is used to problematize ‘problem-solving’ processes within the practice. During the meta-process of problematization of our research, we used Churchman’s systems approach and its theory of ‘boundary critique’ in order to explore issues such as governance, inequality of power, and social values within the organization examined for this study. In other words, the process-oriented methodology proposed in this paper consists of two processes: that of ‘problem-solving’ based on SSM and of problematization of naturalized discourse from the perspective of CDA and two phases of boundary critique in social practice. A detailed account of a case study of Korean social enterprise is given to demonstrate how our proposed framework of the combined use of SSM and CDA is applied into practice. Reflecting the outcome of the case study, this paper argues that critical social research from systemic inquiry using what we call ‘process-oriented methodology’ is useful to address some of the social and complex issues related to understanding dynamic relation between power and discourse amongst participants in the social enterprise in Korean contexts.     

On implementing the symbolic preprocessing function over Boolean polynomial rings in Gröbner basis algorithms using linear algebra

Some techniques using linear algebra was introduced by Faugère in F4 to speed up the reduction process during Gr?bner basis computations.These techniques can also be used in fast implementations of F5 and some other signature-based Gr?bner basis algorithms.When these techniques are applied,a very important step is constructing matrices from critical pairs and existing polynomials by the Symbolic Preprocessing function(given in F4).Since multiplications of monomials and polynomials are involved in the Symbolic Preprocessing function,this step can be very costly when the number of involved polynomials/monomials is huge.In this paper,multiplications of monomials and polynomials for a Boolean polynomial ring are investigated and a specific method of implementing the Symbolic Preprocessing function over Boolean polynomial rings is reported.Many examples have been tested by using this method,and the experimental data shows that the new method is very efficient.     

Comments on a Paper on Alleged Misconceptions Regarding the History of Analysis: Who Has Misconceptions?

This comment is analysing the last section of a paper by Piotr Blaszczyk, Mikhail G. Katz, and David Sherry on alleged misconceptions committed by historians of mathematics regarding the history of analysis, published in this journal in the first issue of 2013. Since this section abounds of wrong attributions and denouncing statements regarding my research and a key publication, the comment serves to rectify them and to recall some minimal methodological requirements for historical research.     

An M-Objective Penalty Function Algorithm Under Big Penalty Parameters

Some classical penalty function algorithms may not always be convergent under big penalty parameters in Matlab software, which makes them impossible to find out an optimal solution to constrained optimization problems. In this paper, a novel penalty function (called M-objective penalty function) with one penalty parameter added to both objective and constrained functions of inequality constrained optimization problems is proposed. Based on the M-objective penalty function, an algorithm is developed to solve an optimal solution to the inequality constrained optimization problems, with its convergence proved under some conditions. Furthermore, numerical results show that the proposed algorithm has a much better convergence than the classical penalty function algorithms under big penalty parameters, and is efficient in choosing a penalty parameter in a large range in Matlab software.     

An improved LP model for energy optimization of the integrated iron and steel plant with a cogeneration system in China

In an integrated iron and steel plant with a cogeneration system, recycled energy is continuously transported into the cogeneration system and the electricity is continuously generated, and both of them could not be stored for a long time. Moreover, the generation and consumption of electricity is irregular, which may bring about more unexpected imbalances. Therefore, it is a crucial issue to schedule the entire energy system by optimizing the operation of energy utilization, which includes the raw energy in the production system, the generation electricity in the cogeneration system and the recycled energy in these two systems. In this paper, an improved Linear Programming model for energy optimization in the integrated iron and steel plant with a cogeneration system is established. The improved model focuses on controlling the whole energy flow and scheduling the whole energy consumption in the entire energy system between the production system and cogeneration system through optimizing all kinds of energy distribution and utilization in an integrated iron and steel plant with a cogeneration system. Case study shows that the improved model offers the optimal operation conditions at the higher energy utilization, lower energy cost and lower pollution emissions.     

IFT54 regulates IFT20 stability but is not essential for tubulin transport during ciliogenesis

Intraflagellar transport (IFT) is required for ciliogenesis by ferrying ciliary components using IFT complexes as cargo adaptors. IFT54 is a component of the IFT-B complex and is also associated with cytoplasmic microtubules (MTs). Loss of IFT54 impairs cilia assembly as well as cytoplasmic MT dynamics. The N-terminal calponin homology (CH) domain of IFT54 interacts with tubulins/MTs and has been proposed to transport tubulin during ciliogenesis, whereas the C-terminal coiled-coil (CC) domain binds IFT20. However, the precise function of these domains in vivo is not well understood. We showed that in Chlamydomonas, loss of IFT54 completely blocks ciliogenesis but does not affect spindle formation and proper cell cycle progression, even though IFT54 interacts with mitotic MTs. Interestingly, IFT54 lacking the CH domain allows proper flagellar assembly. The CH domain is required for the association of IFT54 with the axoneme but not with mitotic MTs, and also regulates the flagellar import of IFT54 but not IFT81 and IFT46. The C-terminal CC domain is essential for IFT54 to bind IFT20, and for its recruitment to the basal body and incorporation into IFT complexes. Complete loss of IFT54 or the CC domain destabilizes IFT20. ift54 mutant cells expressing the CC domain alone rescue the stability of IFT20 and form stunted flagella with accumulation of both IFT-A component IFT43 and IFT-B component IFT46, indicating that IFT54 also functions in IFT turn-around at the flagellar tip.     

Profilin1 biology and its mutation,actin(g) in disease

Profilins were discovered in the 1970s and were extensively studied for their significant physiological roles. Profilin1 is the most prominent isoform and has drawn special attention due to its role in the cytoskeleton, cell signaling, and its link to conditions such as cancer and vascular hypertrophy. Recently, multiple mutations in the profilin1 gene were linked to amyotrophic lateral sclerosis (ALS). In this review, we will discuss the physiological and pathological roles of profilin1. We will further highlight the cytoskeletal function and dysfunction caused by profilin1 dysregulation. Finally, we will discuss the implications of mutant profilin1 in various diseases with an emphasis on its contribution to the pathogenesis of ALS.