Adnan Elegant | Politeknik Indramayu (original) (raw)
Papers by Adnan Elegant
Human histocompatibility leukocyte antigen (HLA)-E is a nonclassical major histocompatibility com... more Human histocompatibility leukocyte antigen (HLA)-E is a nonclassical major histocompatibility complex (MHC) class I molecule which presents a restricted set of nonameric peptides, derived mainly from the signal sequence of other MHC class I molecules. It interacts with CD94/ NKG2 receptors expressed on the surface of natural killer (NK) cells and T cell subsets. Here we demonstrate that HLA-E also presents a peptide derived from the leader sequence of human heat shock protein 60 (hsp60). This peptide gains access to HLA-E intracellularly, resulting in up-regulated HLA-E/hsp60 signal peptide cell-surface levels on stressed cells. Notably, HLA-E molecules in complex with the hsp60 signal peptide are no longer recognized by CD94/ NKG2A inhibitory receptors. Thus, during cellular stress an increased proportion of HLA-E molecules may bind the nonprotective hsp60 signal peptide, leading to a reduced capacity to inhibit a major NK cell population. Such stress induced peptide interference would gradually uncouple CD94/NKG2A inhibitory recognition and provide a mechanism for NK cells to detect stressed cells in a peptide-dependent manner.
Archive of Applied Mechanics, 2006
In this paper, we present a reduction method for modeling slender laminated elastomeric structure... more In this paper, we present a reduction method for modeling slender laminated elastomeric structures, which is developed in the context of nearly incompressible hyperelasticity. This method, based on a finite element formulation, consists in projecting the unknown fields onto a polynomial basis in order to reduce the dimension of the problem and the model size. Two types of finite elements are used, one for plane-strain and the other for 3D structures. Comparisons with classical finite element models on single layers show the reliability of the present method. The method proposed successfully predicts the global and local behavior and since it reduces both the model size and the computing time. It can be used to model slender bearing consisting of several layers.
International Journal of Computer Mathematics, 2009
In this paper, we give an elegant algorithm to generate all distributions of n identical objects ... more In this paper, we give an elegant algorithm to generate all distributions of n identical objects to m bins without repetition. The best known previous algorithm, due to Klingsberg, generates each distribution in constant time in average sense. Using a new technique of ...
Formal Aspects of Computing, 2010
Following the trend to combine techniques to cover several facets of the development of modern sy... more Following the trend to combine techniques to cover several facets of the development of modern systems, an integration of Z and CSP, called Circus, has been proposed as a refinement language; its relational model, based on the unifying theories of programming (UTP), justifies refinement in the context of both Z and CSP. In this paper, we introduce Circus Time, a timed extension of Circus, and present a new UTP time theory, which we use to give semantics to Circus Time and to validate some of its laws. In addition, we provide a framework for validation of timed programs based on FDR, the CSP model-checker. In this technique, a syntactic transformation strategy is used to split a timed program into two parallel components: an untimed program that uses timer events, and a collection of timers. We show that, with the timer events, it is possible to reason about time properties in the untimed language, and so, using FDR. Soundness is established using a Galois connection between the untimed UTP theory of Circus (and CSP) and our time theory.
IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 2000
We propose the use of the logic S1S as a mathematical framework for studying the synthesis of seq... more We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematically elegant solutions to problems arising in the synthesis and optimization of synchronous digital hardware. Specifically, we derive a logical expression which yields a single finite state automaton characterizing the set of implementations that can replace a component of a larger design. The power of our approach is demonstrated by the fact that it generalizes immediately to arbitrary interconnection topologies, and to designs containing nondeterminism and fairness. We also describe control aspects of sequential synthesis and relate controller realizability to classical work on program synthesis and tree automata.
IEEE Transactions on Signal Processing, 2002
The field of higher order statistics is emerging rapidly for analyzing non-Gaussian processes. Th... more The field of higher order statistics is emerging rapidly for analyzing non-Gaussian processes. There are several motivations behind the use of higher order statistics. The emphasis of this paper is based on the property that higher order cumulants are blind to any kind of Gaussian process. Hence, when the processed signal is non-Gaussian stationary and the additive noise is stationary Gaussian, the noise will vanish in the cumulant domain. This paper presents an extension to recent results by Liang et al. This extension is a straightforward generalization of Liang's approach to third-order cumulants (TOCs). The new cumulant-based algorithm provides a higher level of accuracy in the presence of noise than the original second-order algorithm. In addition, the original results of Liang have been extended to the case of colored Gaussian noise. Examples are given to demonstrate the performance of this algorithm even when the observed signal is heavily corrupted by Gaussian noise.
We present a mathematical framework for analyzing the synthesis of interacting finite state syste... more We present a mathematical framework for analyzing the synthesis of interacting finite state systems. The logic S1S is used to derive simple, rigorous, and constructive solutions to problems in sequential synthesis. We obtain exact and approximate sets of permissible FSM network behavior, and address the issue of FSM realizability. This approach is also applied to synthesizing systems with fairness and timed systems.
We propose the use of the logic S1S as a mathematical framework for studying the synthesis of seq... more We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematically elegant solutions to problems arising in the synthesis and optimization of synchronous digital hardware. Specifically, we derive a logical expression which yields a single finite state automaton characterizing the set of implementations that can replace a component of a larger design. The power of our approach is demonstrated by the fact that it generalizes immediately to arbitrary interconnection topologies, and to designs containing nondeterminism and fairness. We also describe control aspects of sequential synthesis and relate controller realizability to classical work on program synthesis and tree automata.
European Journal of Trauma and Emergency Surgery, 2006
Extensive bleeding from the perivertebral space is a rare encountered problem in abdominal trauma... more Extensive bleeding from the perivertebral space is a rare encountered problem in abdominal trauma surgery. In this report, we present a technique for the hemostasis of perivertebral hemorrhage apart from the conventional hemostatic measures in a patient with penetrating injury to the lumbar artery and tributaries. In order to construct a controlled compartment in the retroperitoneal perivertebral cavity, bone cement was plastered alongside the dissection plane near the vertebral wall and hemostasis was achieved. Bone cement application, therefore, may pose as an alternative hemostatic method for patients with uncontrollable bleeding in the perivertebral compartment.
Human histocompatibility leukocyte antigen (HLA)-E is a nonclassical major histocompatibility com... more Human histocompatibility leukocyte antigen (HLA)-E is a nonclassical major histocompatibility complex (MHC) class I molecule which presents a restricted set of nonameric peptides, derived mainly from the signal sequence of other MHC class I molecules. It interacts with CD94/ NKG2 receptors expressed on the surface of natural killer (NK) cells and T cell subsets. Here we demonstrate that HLA-E also presents a peptide derived from the leader sequence of human heat shock protein 60 (hsp60). This peptide gains access to HLA-E intracellularly, resulting in up-regulated HLA-E/hsp60 signal peptide cell-surface levels on stressed cells. Notably, HLA-E molecules in complex with the hsp60 signal peptide are no longer recognized by CD94/ NKG2A inhibitory receptors. Thus, during cellular stress an increased proportion of HLA-E molecules may bind the nonprotective hsp60 signal peptide, leading to a reduced capacity to inhibit a major NK cell population. Such stress induced peptide interference would gradually uncouple CD94/NKG2A inhibitory recognition and provide a mechanism for NK cells to detect stressed cells in a peptide-dependent manner.
Archive of Applied Mechanics, 2006
In this paper, we present a reduction method for modeling slender laminated elastomeric structure... more In this paper, we present a reduction method for modeling slender laminated elastomeric structures, which is developed in the context of nearly incompressible hyperelasticity. This method, based on a finite element formulation, consists in projecting the unknown fields onto a polynomial basis in order to reduce the dimension of the problem and the model size. Two types of finite elements are used, one for plane-strain and the other for 3D structures. Comparisons with classical finite element models on single layers show the reliability of the present method. The method proposed successfully predicts the global and local behavior and since it reduces both the model size and the computing time. It can be used to model slender bearing consisting of several layers.
International Journal of Computer Mathematics, 2009
In this paper, we give an elegant algorithm to generate all distributions of n identical objects ... more In this paper, we give an elegant algorithm to generate all distributions of n identical objects to m bins without repetition. The best known previous algorithm, due to Klingsberg, generates each distribution in constant time in average sense. Using a new technique of ...
Formal Aspects of Computing, 2010
Following the trend to combine techniques to cover several facets of the development of modern sy... more Following the trend to combine techniques to cover several facets of the development of modern systems, an integration of Z and CSP, called Circus, has been proposed as a refinement language; its relational model, based on the unifying theories of programming (UTP), justifies refinement in the context of both Z and CSP. In this paper, we introduce Circus Time, a timed extension of Circus, and present a new UTP time theory, which we use to give semantics to Circus Time and to validate some of its laws. In addition, we provide a framework for validation of timed programs based on FDR, the CSP model-checker. In this technique, a syntactic transformation strategy is used to split a timed program into two parallel components: an untimed program that uses timer events, and a collection of timers. We show that, with the timer events, it is possible to reason about time properties in the untimed language, and so, using FDR. Soundness is established using a Galois connection between the untimed UTP theory of Circus (and CSP) and our time theory.
IEEE Transactions on Computer-aided Design of Integrated Circuits and Systems, 2000
We propose the use of the logic S1S as a mathematical framework for studying the synthesis of seq... more We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematically elegant solutions to problems arising in the synthesis and optimization of synchronous digital hardware. Specifically, we derive a logical expression which yields a single finite state automaton characterizing the set of implementations that can replace a component of a larger design. The power of our approach is demonstrated by the fact that it generalizes immediately to arbitrary interconnection topologies, and to designs containing nondeterminism and fairness. We also describe control aspects of sequential synthesis and relate controller realizability to classical work on program synthesis and tree automata.
IEEE Transactions on Signal Processing, 2002
The field of higher order statistics is emerging rapidly for analyzing non-Gaussian processes. Th... more The field of higher order statistics is emerging rapidly for analyzing non-Gaussian processes. There are several motivations behind the use of higher order statistics. The emphasis of this paper is based on the property that higher order cumulants are blind to any kind of Gaussian process. Hence, when the processed signal is non-Gaussian stationary and the additive noise is stationary Gaussian, the noise will vanish in the cumulant domain. This paper presents an extension to recent results by Liang et al. This extension is a straightforward generalization of Liang's approach to third-order cumulants (TOCs). The new cumulant-based algorithm provides a higher level of accuracy in the presence of noise than the original second-order algorithm. In addition, the original results of Liang have been extended to the case of colored Gaussian noise. Examples are given to demonstrate the performance of this algorithm even when the observed signal is heavily corrupted by Gaussian noise.
We present a mathematical framework for analyzing the synthesis of interacting finite state syste... more We present a mathematical framework for analyzing the synthesis of interacting finite state systems. The logic S1S is used to derive simple, rigorous, and constructive solutions to problems in sequential synthesis. We obtain exact and approximate sets of permissible FSM network behavior, and address the issue of FSM realizability. This approach is also applied to synthesizing systems with fairness and timed systems.
We propose the use of the logic S1S as a mathematical framework for studying the synthesis of seq... more We propose the use of the logic S1S as a mathematical framework for studying the synthesis of sequential designs. We will show that this leads to simple and mathematically elegant solutions to problems arising in the synthesis and optimization of synchronous digital hardware. Specifically, we derive a logical expression which yields a single finite state automaton characterizing the set of implementations that can replace a component of a larger design. The power of our approach is demonstrated by the fact that it generalizes immediately to arbitrary interconnection topologies, and to designs containing nondeterminism and fairness. We also describe control aspects of sequential synthesis and relate controller realizability to classical work on program synthesis and tree automata.
European Journal of Trauma and Emergency Surgery, 2006
Extensive bleeding from the perivertebral space is a rare encountered problem in abdominal trauma... more Extensive bleeding from the perivertebral space is a rare encountered problem in abdominal trauma surgery. In this report, we present a technique for the hemostasis of perivertebral hemorrhage apart from the conventional hemostatic measures in a patient with penetrating injury to the lumbar artery and tributaries. In order to construct a controlled compartment in the retroperitoneal perivertebral cavity, bone cement was plastered alongside the dissection plane near the vertebral wall and hemostasis was achieved. Bone cement application, therefore, may pose as an alternative hemostatic method for patients with uncontrollable bleeding in the perivertebral compartment.