A new hand finger movements’ classification system based on bicoherence analysis of two-channel surface EMG signals

Neural Computing and Applications - In this study, two-channel surface electromyography (sEMG) signals were used to classify hand finger movements. Bicoherence analysis of the sEMG signal recorded...     

Abstraction of levels of abstraction

The notion of level of abstraction (LoA) is one of the foundations of the Floridi's Philosophy of Information. It also serves for many practical purposes as in information ethics. But the notion of abstraction is not new; it has been given many different meanings in various fields, especially in scientific disciplines and, in particular, in computer science. Our purpose here is to examine the use of abstraction in Floridi's works in conjunction with some of the meanings of abstraction in computer science. The article is divided into five sections. After a general introduction to the Floridi's method of abstraction (MoA) in Section 1, Section 2 revisits Floridi's definition of abstraction and Section 3 gives the different senses of abstraction in computer science. The Section 4 compares them with the Floridi's LoAs and proposes to generalise the Floridi's approach to abstraction using an abstraction of the LoAs, while Section 5 concludes on what we think to be some new arguments in favour of MoA and LoA.     

Soft groups and normalistic soft groups

Soft set theory, proposed by Molodtsov, has been regarded as an effective mathematical tool to deal with uncertainties. In this paper, first we correct some of the problematic cases in a previous paper by Akta? and Çag˜man [H. Akta?, N. Çag˜man, Soft sets and soft groups, Inf. Sci. 177 (2007) 2726-2735]. Moreover, we introduce the concepts of normalistic soft group and normalistic soft group homomorphism, study their several related properties, and investigate some structures that are preserved under normalistic soft group homomorphisms.     

Computing the Duquenne–Guigues basis: an algorithm for choosing the order

This paper presents an algorithm for choosing the order in which pseudo-intents are enumerated when computing the Duquenne–Guigues basis of a formal context. Sets are constructed through the use of a spanning tree to ensure they are all found once. The time and space complexities of the algorithm are empirically evaluated using, respectively, the number of logical closures and the number of sets in memory as measures. It is found that only the space complexity depends on the enumeration order.     

Exact and heuristic algorithms for the aerial refueling parallel machine scheduling problem with due date-to-deadline window and ready times

The Aerial Refueling Scheduling Problem (ARSP) can be defined as determining the refueling completion times for fighter aircrafts (jobs) on multiple tankers (machines) to minimize the total weighted tardiness. ARSP can be modeled as a parallel machine scheduling with ready times and due date-to-deadline window to minimize total weighted tardiness. ARSP assumes that the jobs have different ready times and a due date-to-deadline window between refueling due date and a deadline to return without refueling. In this paper, we first formulate the ARSP as a mixed integer programming model. The objective function is a piece-wise tardiness cost that takes into account due date-to-deadline windows and job priorities. Since ARSP is NP-hard, two heuristics are proposed to obtain solutions in reasonable computation times, namely (1) modified ATC rule (MATC), (2) a simulated annealing method (SA). The proposed heuristic algorithms are tested in terms of solution quality and CPU time through computational experiments with data randomly generated to represent aerial refueling operations of an in-theater air operation. Solutions provided by both algorithms were compared to optimal solutions for problems with up to 12 jobs and to each other for larger problems with up to 60 jobs. The results show that, MATC is more likely to outperform SA especially when the problem size increases, although it has significantly worse performance than SA in terms of deviation from optimal solution for small size problems. Moreover CPU time performance of MATC is significantly better than SA in both cases.     

The geometry of flex tangents to a cubic curve and its parameterizations

We show how the study of the geometry of the nine flex tangents to a cubic produces pseudo-parameterizations, including the ones given by Icart, Kammerer, Lercier, Renault and Farashahi, and infinitely many new ones.     

Efficient manganese decorated cobalt based catalysts for hydrogenation of 5-hydroxymethylfurfural (HMF) to 2,5-dimethylfuran (DMF) biofuel

2,5-dimethylfuran (DMF) is a promising compound in the production of biofuel with high-quality properties. In this study, it is aimed to develop new efficient catalysts to synthesize DMF from 5-hydroxymethylfurfural (HMF). Co, Mn/Co, and Ru/Co catalysts were prepared using the NaBH₄ reduction method. The catalysts were subjected to activity tests for the hydrogenation of HMF to DMF by changing the reaction parameters, such as temperature and time. Mn/Co catalysts prepared from metal precursors at various molar ratios of Mn/Co were found to be effective in hydrogenation reactions of HMF to DMF. A 91.8% DMF yield was achieved in the presence of a Mn/Co (50/50) catalyst without noble metal at 180°C for 4 hours. The Brunauer-Emmet-Teller (BET) method, x-ray diffraction (XRD), x-ray photoelectron spectroscopy (XPS), and induction coupled plasma mass spectroscopy (ICP-MS) techniques were used to characterize the efficient Mn/Co catalyst.     

Performance Analysis and Modeling of Thermally Sprayed Resistive Heaters

Many processes and systems require hot surfaces. These are usually heated using electrical elements located in their vicinity. However, this solution is subject to intrinsic limitations associated with heating element geometry and physical location. Thermally spraying electrical elements directly on surfaces can overcome these limitations by tailoring the geometry of the heating element to the application. Moreover, the element heat transfer is maximized by minimizing the distance between the heater and the surface to be heated. This article is aimed at modeling and characterizing resistive heaters sprayed on metallic substrates. Heaters were fabricated by using a plasma-sprayed alumina dielectric insulator and a wire flame-sprayed iron-based alloy resistive element. Samples were energized and kept at a constant temperature of 425 °C for up to 4 months. SEM cross-sectional observations revealed the formation of cracks at very specific locations in the alumina layer after thermal use. Finite-element modeling shows that these cracks originate from high local thermal stresses and can be predicted according to the considered geometry. The simulation model was refined using experimental parameters obtained by several techniques such as emissivity and time-dependent temperature profile (infra-red camera), resistivity (four-probe technique), thermal diffusivity (laser flash method), and mechanical properties (micro and nanoindentation). The influence of the alumina thickness and the substrate material on crack formation was evaluated.     

Polyoxalactones and their cationic complexes

Summary Some polyoxalactones were synthesised from the dichlorides of glycolic acids and polyethyleneglycoles in the presence of pyridine. The polyoxalactones were also complexed with some of alkaline and alkaline earth salts and quite stable polyoxalactone-salt complexes were obtained including the Ca⁺⁺ cation. Complexes obtained exhibited mostly 11 type of complex stoichiometry regardles from radius of the cation and the nature of lactone ring.Submitted for the partial fullfillment of Ph.D. degree in Organic Chemistry at Diyarbakir University, 1981.