A fuzzy k-modes algorithm for clustering categorical data

This correspondence describes extensions to the fuzzy k-means algorithm for clustering categorical data. By using a simple matching dissimilarity measure for categorical objects and modes instead of means for clusters, a new approach is developed, which allows the use of the k-means paradigm to efficiently cluster large categorical data sets. A fuzzy k-modes algorithm is presented and the effectiveness of the algorithm is demonstrated with experimental results.published_or_final_versio

Testing Cluster Structure of Graphs

We study the problem of recognizing the cluster structure of a graph in the framework of property testing in the bounded degree model. Given a parameter $\varepsilon$, a $d$-bounded degree graph is defined to be $(k, \phi)$-clusterable, if it can be partitioned into no more than $k$ parts, such that the (inner) conductance of the induced subgraph on each part is at least $\phi$ and the (outer) conductance of each part is at most $c_{d,k}\varepsilon^4\phi^2$, where $c_{d,k}$ depends only on $d,k$. Our main result is a sublinear algorithm with the running time $\widetilde{O}(\sqrt{n}\cdot\mathrm{poly}(\phi,k,1/\varepsilon))$ that takes as input a graph with maximum degree bounded by $d$, parameters $k$, $\phi$, $\varepsilon$, and with probability at least $\frac23$, accepts the graph if it is $(k,\phi)$-clusterable and rejects the graph if it is $\varepsilon$-far from $(k, \phi^*)$-clusterable for $\phi^* = c'_{d,k}\frac{\phi^2 \varepsilon^4}{\log n}$, where $c'_{d,k}$ depends only on $d,k$. By the lower bound of $\Omega(\sqrt{n})$ on the number of queries needed for testing graph expansion, which corresponds to $k=1$ in our problem, our algorithm is asymptotically optimal up to polylogarithmic factors.Comment: Full version of STOC 201

Chapter Development of Sustainable High-Strength Self-Consolidating Concrete Utilising Fly Ash, Shale Ash and Microsilica

With high flowability and passing ability, self-consolidating concrete (SCC) does not require compaction during casting and can improve constructability. The favourable properties of SCC have enabled its widespread adoption in many parts of the world. However, there are two major issues associated with the SCC mixes commonly used in practice. First, the cement content is usually at the high side. Since the production of cement involves calcination at high temperature and is an energy-intensive process, the high cement content imparts high embodied energy and carbon footprint to the SCC mixes. Besides, the exothermic reaction of cement hydration would cause high heat generation and early thermal cracking problem that would impair structural integrity and necessitate repair. Second, the strength is usually limited to around grade 60, which is considered as medium strength in nowadays achievable norm. With a view to develop sustainable high-strength self-consolidating concrete (HS-SCC), experimental research utilising fly ash (FA), shale ash (SA), and microsilica (MS) in the production of SCC has been conducted, as reported herein

An ultrafast 1 x M all-optical WDM packet-switched router based on the PPM header address

This paper presents an all-optical 1 x M WDM router architecture for packet routing at multiple wavelengths simultaneously, with no wavelength conversion modules. The packet header address adopted is based on the pulse position modulation (PPM) format, thus enabling the use of only a singlebitwise optical AND gate for fast header address correlation. It offers multicast as well as broadcast capabilities. It is shown that a high speed packet routing at 160 Gb/s can be achieved with a low channel crosstalk (CXT) of ~ -27 dB at a channel spacing of greater than 0.4 THz and a demultiplexer bandwidth of 500 GHz