**Commenced**in January 2007

**Frequency:**Monthly

**Edition:**International

**Paper Count:**41

# Search results for: B-cell subsets

##### 41 Definable Subsets in Covering Approximation Spaces

**Authors:**
Xun Ge,
Zhaowen Li

**Abstract:**

**Keywords:**
Covering approximation space,
covering approximation operator,
definable subset,
inner definable subset,
outer definable subset.

##### 40 Phenotypes of B Cells Differ in EBV-positive Burkitt-s lymphoma Derived Cell Lines

**Authors:**
Irina Spaka,
Rita Birkenfelde,
Svetlana Kozireva,
Jevgenija Osmjana,
Madara Upmane,
ElenaKashuba,
Irina Kholodnyuk Holodnuka

**Abstract:**

Epstein-Barr virus (EBV) is implicated in the pathogenesis of the endemic Burkitt-s lymphoma (BL). The EBVpositive BL-derived cell lines initially maintain the original tumor phenotype of EBV infection (latency I, LatI), but most of them drift toward a lymphoblast phenotype of EBV latency III (LatIII) during in vitro culturing. The aim of the present work was to characterize the B-cell subsets in EBV-positive BL cell lines and to verify whether a particular cell subset correlates with the type of EBV infection. The phenotype analysis of two EBV-negative and eleven EBV-positive (three of LatI and eight of LatIII) BL cell lines was performed by polychromatic flow cytomery, based on expression pattern of CD19, CD10, CD38, CD27, and CD5 markers. Two cell subsets, CD19+CD10+ and CD19+CD10-, were defined in LatIII BL cell lines. In both subsets, the CD27 and CD5 cell surface expression was detected in a proportion of the cells.

**Keywords:**
B-cell subsets,
Burkitt's lymphoma cell lines,
EBV
latency,
phenotype profiles.

##### 39 Computing Visibility Subsets in an Orthogonal Polyhedron

**Authors:**
Jefri Marzal,
Hong Xie,
Chun Che Fung

**Abstract:**

Visibility problems are central to many computational geometry applications. One of the typical visibility problems is computing the view from a given point. In this paper, a linear time procedure is proposed to compute the visibility subsets from a corner of a rectangular prism in an orthogonal polyhedron. The proposed algorithm could be useful to solve classic 3D problems.

**Keywords:**
Visibility,
rectangular prism,
orthogonal polyhedron.

##### 38 Algebras over an Integral Domain and Immediate Neighbors

**Authors:**
Shai Sarussi

**Abstract:**

**Keywords:**
Algebras over integral domains,
Alexandroff topology,
immediate neighbors,
integral domains.

##### 37 On an Open Problem for Definable Subsets of Covering Approximation Spaces

**Authors:**
Mei He,
Ying Ge,
Jingyu Qian

**Abstract:**

**Keywords:**
Covering approximation space,
covering approximation operator,
definable subset,
inner definable subset,
outer definable subset.

##### 36 2n Almost Periodic Attractors for Cohen-Grossberg Neural Networks with Variable and Distribute Delays

**Abstract:**

In this paper, we investigate dynamics of 2n almost periodic attractors for Cohen-Grossberg neural networks (CGNNs) with variable and distribute time delays. By imposing some new assumptions on activation functions and system parameters, we split invariant basin of CGNNs into 2n compact convex subsets. Then the existence of 2n almost periodic solutions lying in compact convex subsets is attained due to employment of the theory of exponential dichotomy and Schauder-s fixed point theorem. Meanwhile, we derive some new criteria for the networks to converge toward these 2n almost periodic solutions and exponential attracting domains are also given correspondingly.

**Keywords:**
CGNNs,
almost periodic solution,
invariant basins,
attracting domains.

##### 35 Intuitionistic Fuzzy Dual Positive Implicative Hyper K- Ideals

**Authors:**
M.M. Zahedi,
L. Torkzadeh

**Abstract:**

**Keywords:**
hyper K-algebra,
intuitionistic fuzzy dual positive implicative hyper K-ideal.

##### 34 A Calibration Approach towards Reducing ASM2d Parameter Subsets in Phosphorus Removal Processes

**Authors:**
N.Boontian

**Abstract:**

**Keywords:**
ASM2d,
calibration approach,
iteration
methodology,
sensitivity,
phosphorus removal

##### 33 A Study on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based On Bipartite Graphs

**Authors:**
Hui-Chuan Lu

**Abstract:**

A perfect secret-sharing scheme is a method to distribute a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of participants in any unqualified subset is statistically independent of the secret. The collection of all qualified subsets is called the access structure of the perfect secret-sharing scheme. In a graph-based access structure, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing the access structure based on G is defined as AR = (Pv2V (G) H(v))/(|V (G)|H(s)), where s is the secret and v is the share of v, both are random variables from and H is the Shannon entropy. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing a given access structure is called the optimal average information ratio of that access structure. Most known results about the optimal average information ratio give upper bounds or lower bounds on it. In this present structures based on bipartite graphs and determine the exact values of the optimal average information ratio of some infinite classes of them.

**Keywords:**
secret-sharing scheme,
average information ratio,
star covering,
core sequence.

##### 32 A New Bound on the Average Information Ratio of Perfect Secret-Sharing Schemes for Access Structures Based On Bipartite Graphs of Larger Girth

**Authors:**
Hui-Chuan Lu

**Abstract:**

In a perfect secret-sharing scheme, a dealer distributes a secret among a set of participants in such a way that only qualified subsets of participants can recover the secret and the joint share of the participants in any unqualified subset is statistically independent of the secret. The access structure of the scheme refers to the collection of all qualified subsets. In a graph-based access structures, each vertex of a graph G represents a participant and each edge of G represents a minimal qualified subset. The average information ratio of a perfect secret-sharing scheme realizing a given access structure is the ratio of the average length of the shares given to the participants to the length of the secret. The infimum of the average information ratio of all possible perfect secret-sharing schemes realizing an access structure is called the optimal average information ratio of that access structure. We study the optimal average information ratio of the access structures based on bipartite graphs. Based on some previous results, we give a bound on the optimal average information ratio for all bipartite graphs of girth at least six. This bound is the best possible for some classes of bipartite graphs using our approach.

**Keywords:**
Secret-sharing scheme,
average information ratio,
star
covering,
deduction,
core cluster.

##### 31 Implementing an Intuitive Reasoner with a Large Weather Database

**Authors:**
Yung-Chien Sun,
O. Grant Clark

**Abstract:**

**Keywords:**
Artificial intelligence,
intuition,
knowledge acquisition,
limited certainty.

##### 30 Reductions of Control Flow Graphs

**Authors:**
Robert Gold

**Abstract:**

Control ﬂow graphs are a well-known representation of the sequential control ﬂow structure of programs with a multitude of applications. Not only single functions but also sets of functions or complete programs can be modeled by control ﬂow graphs. In this case the size of the graphs can grow considerably and thus makes it difﬁcult for software engineers to analyze the control ﬂow. Graph reductions are helpful in this situation. In this paper we deﬁne reductions to subsets of nodes. Since executions of programs are represented by paths through the control ﬂow graphs, paths should be preserved. Furthermore, the composition of reductions makes a stepwise analysis approach possible.

**Keywords:**
Control ﬂow graph,
graph reduction.

##### 29 Characterizations of Star-Shaped, L-Convex, and Convex Polygons

**Authors:**
Thomas Shermer,
Godfried T. Toussaint

**Abstract:**

**Keywords:**
Convex polygons,
L-convex polygons,
star-shaped
polygons,
chords,
weak visibility,
discrete and computational
geometry

##### 28 Feature Selection for Breast Cancer Diagnosis: A Case-Based Wrapper Approach

**Authors:**
Mohammad Darzi,
Ali AsgharLiaei,
Mahdi Hosseini,
HabibollahAsghari

**Abstract:**

**Keywords:**
Case-based reasoning; Breast cancer diagnosis;
Genetic algorithm; Wrapper feature selection

##### 27 Approximation to the Hardy Operator on Topological Measure Spaces

**Authors:**
Kairat T. Mynbaev,
Elena N. Lomakina

**Abstract:**

We consider a Hardy type operator generated by a family of open subsets of a Hausdorff topological space. The family is indexed with non-negative real numbers and is totally ordered. For this operator, we obtain two-sided bounds of its norm, a compactness criterion and bounds for its approximation numbers. Previously bounds for its approximation numbers have been established only in the one-dimensional case, while we do not impose any restrictions on the dimension of the Hausdorff space. The bounds for the norm and conditions for compactness have been found earlier but our approach is different in that we use domain partitions for all problems under consideration.

**Keywords:**
Approximation numbers,
boundedness and
compactness,
multidimensional Hardy operator,
Hausdorff
topological space.

##### 26 A PSO-based End-Member Selection Method for Spectral Unmixing of Multispectral Satellite Images

**Authors:**
Mahamed G.H. Omran,
Andries P Engelbrecht,
Ayed Salman

**Abstract:**

An end-member selection method for spectral unmixing that is based on Particle Swarm Optimization (PSO) is developed in this paper. The algorithm uses the K-means clustering algorithm and a method of dynamic selection of end-members subsets to find the appropriate set of end-members for a given set of multispectral images. The proposed algorithm has been successfully applied to test image sets from various platforms such as LANDSAT 5 MSS and NOAA's AVHRR. The experimental results of the proposed algorithm are encouraging. The influence of different values of the algorithm control parameters on performance is studied. Furthermore, the performance of different versions of PSO is also investigated.

**Keywords:**
End-members selection,
multispectral satellite imagery,
particle swarm optimization,
spectral unmixing.

##### 25 On Weakly Prime and Weakly Quasi-Prime Fuzzy Left Ideals in Ordered Semigroups

**Authors:**
Jian Tang

**Abstract:**

In this paper, we first introduce the concepts of weakly prime and weakly quasi-prime fuzzy left ideals of an ordered semigroup S. Furthermore, we give some characterizations of weakly prime and weakly quasi-prime fuzzy left ideals of an ordered semigroup S by the ordered fuzzy points and fuzzy subsets of S.

**Keywords:**
Ordered semigroup,
ordered fuzzy point,
weakly prime
fuzzy left ideal,
weakly quasi-prime fuzzy left ideal.

##### 24 On Some Signs of a Recurrent Climate Scenario Advent

**Authors:**
Vladimir I. Byshev,
Victor G. Neiman,
Yuri A. Romanov,
Ilya V. Serykh

**Abstract:**

**Keywords:**
Climate change,
climatic scenario,
fields of environmental characteristics,
North Atlantic region.

##### 23 CT Reconstruction from a Limited Number of X-Ray Projections

**Authors:**
Tao Quang Bang,
Insu Jeon

**Abstract:**

**Keywords:**
CT reconstruction,
X-ray projections,
Interpolation
technique,
OSEM

##### 22 A Hybrid GMM/SVM System for Text Independent Speaker Identification

**Authors:**
Rafik Djemili,
Mouldi Bedda,
Hocine Bourouba

**Abstract:**

**Keywords:**
Speaker identification,
Gaussian mixture model
(GMM),
support vector machine (SVM),
hybrid GMM/SVM.

##### 21 Introduction of Self-Healing Concrete and Different Methods of Its Scientific Implementation

**Authors:**
Davoud Beheshtizadeh,
Davood Jafari

**Abstract:**

Concrete, with its unique properties and advantages, has gained widespread and increasing use in the construction industry, particularly in a country's infrastructure. However, concrete exhibits certain defects, most notably the presence of micro-cracks that occur after the setting process, leading to increased costs for infrastructure repair and maintenance. As a result, self-healing concretes have garnered attention in various countries in recent years. These concretes employ different mechanisms for repair, including physical, chemical, biological, and combined approaches, each with its own subsets and implementation methods. Certain mechanisms hold significant importance, leading to specialized production methods. Given the novelty of this subject in Iran, there is limited knowledge or, in some cases, a complete lack of understanding. This paper presents various self-healing concrete mechanisms and the advantages, disadvantages, and application scope of each method.

**Keywords:**
Micro-cracks,
self-healing concrete,
microcapsules,
concrete,
cement,
self-sensitive.

##### 20 An Optimal Feature Subset Selection for Leaf Analysis

**Authors:**
N. Valliammal,
S.N. Geethalakshmi

**Abstract:**

**Keywords:**
Optimization,
Feature extraction,
Feature subset,
Classification,
GA,
KPCA,
SVM and Computation

##### 19 Binary Classification Tree with Tuned Observation-based Clustering

**Authors:**
Maythapolnun Athimethphat,
Boontarika Lerteerawong

**Abstract:**

There are several approaches for handling multiclass classification. Aside from one-against-one (OAO) and one-against-all (OAA), hierarchical classification technique is also commonly used. A binary classification tree is a hierarchical classification structure that breaks down a k-class problem into binary sub-problems, each solved by a binary classifier. In each node, a set of classes is divided into two subsets. A good class partition should be able to group similar classes together. Many algorithms measure similarity in term of distance between class centroids. Classes are grouped together by a clustering algorithm when distances between their centroids are small. In this paper, we present a binary classification tree with tuned observation-based clustering (BCT-TOB) that finds a class partition by performing clustering on observations instead of class centroids. A merging step is introduced to merge any insignificant class split. The experiment shows that performance of BCT-TOB is comparable to other algorithms.

**Keywords:**
multiclass classification,
hierarchical classification,
binary classification tree,
clustering,
observation-based clustering

##### 18 A Decision Boundary based Discretization Technique using Resampling

**Authors:**
Taimur Qureshi,
Djamel A Zighed

**Abstract:**

**Keywords:**
Bootstrap,
discretization,
resampling,
soft decision
trees.

##### 17 Characterizations of Ordered Semigroups by (∈,∈ ∨q)-Fuzzy Ideals

**Authors:**
Jian Tang

**Abstract:**

Let S be an ordered semigroup. In this paper we first introduce the concepts of (∈,∈ ∨q)-fuzzy ideals, (∈,∈ ∨q)-fuzzy bi-ideals and (∈,∈ ∨q)-fuzzy generalized bi-ideals of an ordered semigroup S, and investigate their related properties. Furthermore, we also define the upper and lower parts of fuzzy subsets of an ordered semigroup S, and investigate the properties of (∈,∈ ∨q)-fuzzy ideals of S. Finally, characterizations of regular ordered semigroups and intra-regular ordered semigroups by means of the lower part of (∈ ,∈ ∨q)-fuzzy left ideals, (∈,∈ ∨q)-fuzzy right ideals and (∈,∈ ∨q)- fuzzy (generalized) bi-ideals are given.

**Keywords:**
Ordered semigroup,
regular ordered semigroup,
intraregular
ordered semigroup,
(∈,
∈ ∨q)-fuzzy left (right) ideal of an
ordered semigroup,
(∈,
∈ ∨q)-fuzzy (generalized) bi-ideal of an
ordered semigroup.

##### 16 A Hybrid Gene Selection Technique Using Improved Mutual Information and Fisher Score for Cancer Classification Using Microarrays

**Authors:**
M. Anidha,
K. Premalatha

**Abstract:**

Feature Selection is significant in order to perform constructive classification in the area of cancer diagnosis. However, a large number of features compared to the number of samples makes the task of classification computationally very hard and prone to errors in microarray gene expression datasets. In this paper, we present an innovative method for selecting highly informative gene subsets of gene expression data that effectively classifies the cancer data into tumorous and non-tumorous. The hybrid gene selection technique comprises of combined Mutual Information and Fisher score to select informative genes. The gene selection is validated by classification using Support Vector Machine (SVM) which is a supervised learning algorithm capable of solving complex classification problems. The results obtained from improved Mutual Information and F-Score with SVM as a classifier has produced efficient results.

**Keywords:**
Gene selection,
mutual information,
Fisher score,
classification,
SVM.

##### 15 The Feedback Control for Distributed Systems

**Authors:**
Kamil Aida-zade,
C. Ardil

**Abstract:**

**Keywords:**
Feedback control,
distributed systems,
smooth
optimization methods,
lumped control synthesis.

##### 14 FCNN-MR: A Parallel Instance Selection Method Based on Fast Condensed Nearest Neighbor Rule

**Authors:**
Lu Si,
Jie Yu,
Shasha Li,
Jun Ma,
Lei Luo,
Qingbo Wu,
Yongqi Ma,
Zhengji Liu

**Abstract:**

**Keywords:**
Instance selection,
data reduction,
MapReduce,
kNN.

##### 13 An Adaptive Hand-Talking System for the Hearing Impaired

**Authors:**
Zhou Yu,
Jiang Feng

**Abstract:**

**Keywords:**
sign language recognition,
signer adaptation,
eMAP/VFS,
polynomial segment model.

##### 12 Decision Trees for Predicting Risk of Mortality using Routinely Collected Data

**Authors:**
Tessy Badriyah,
Jim S. Briggs,
Dave R. Prytherch

**Abstract:**

**Keywords:**
Decision Trees,
Logistic Regression,
clinical
outcome,
risk of mortality.