The Simplicial Characterisation of TS networks: Theory and applications

We use the visibility algorithm to construct the time series networks obtained from the time series of different dynamical regimes of the logistic map. We define the simplicial characterisers of networks which can analyse the simplicial structure at both the global and local levels. These characterisers are used to analyse the TS networks obtained in different dynamical regimes of the logisitic map. It is seen that the simplicial characterisers are able to distinguish between distinct dynamical regimes. We also apply the simplicial characterisers to time series networks constructed from fMRI data, where the preliminary results indicate that the characterisers are able to differentiate between distinct TS networks.Comment: 11 pages, 2 figures, 4 tables. Accepted for publication in Proceedings of the 4th International Conference on Applications in Nonlinear Dynamics (ICAND 2016

Horizontal partial laryngectomy for supraglottic squamous cell carcinoma

Between 1981-1999, 75 patients treated for supraglottic SCC with horizontal supraglottic laryngectomy (HSL) at the Otolaryngology Head and Neck Surgery Department of Lausanne University Hospital were retrospectively studied. There were 16 patients with T1, 46 with T2 and 13 with T3 tumors. Among these, 16 patients (21%) had clinical neck disease corresponding to stage I, II, III and IV in 12, 39, 18 and 6 patients, respectively. All patients had HSL. Most patients had either elective or therapeutic bilateral level II-IV selective neck dissection. Six patients (8%) with advanced neck disease had ipsilateral radical and controlateral elective II-IV selective neck dissections. Adjuvant radiotherapy was given to 25 patients (30%) for either positive surgical margins (n=8), pathological nodal status (n=14) or both (n=3). Median follow-up was 48months (range, 24-199). Five-year disease-specific survival and locoregional and local control were 92, 90 and 92.5%, respectively. Among five patients who were diagnosed with local recurrence, one had a total laryngectomy (1.4%); the others were treated by endoscopic laser surgery. Two patients had both a local and regional recurrence. They were salvaged with combined surgery and radiotherapy, but eventually died of their disease. Cartilage infiltration seems to influence both local control (P=0.03) and disease-specific survival (P=0.06). There was a trend for worse survival with pathological node involvement (P=0.15) and extralaryngeal extension of the cancer (P=0.1). All patients except one recovered a close to normal function after the treatment. Aspiration was present in 16 patients (26%) in the early postoperative period. A median of 16days (7-9) was necessary to recover a close to normal diet. Decannulation took a median of 17days (8-93). Seven patients kept a tracheotomy tube for up to 3months because of persistent aspiration. There was no permanent tracheostomy or total laryngectomy for functional purposes. Horizontal supraglottic laryngectomy remains an adequate therapeutic alternative for supraglottic squamous cell carcinoma, offering an excellent oncological outcome. The postoperative functional morbidity is substantial, indicating the need for careful patient selection, but good laryngeal function recovery is the rule. The surgical alternative is endoscopic laser surgery, which may offer comparable oncological results with less functional morbidity. Nevertheless, these two different techniques need to be compared prospectivel

Aging of bone marrow mesenchymal stromal cells: Hematopoiesis disturbances and potential role in the development of hematologic cancers

Aging of bone marrow is a complex process that is involved in the development of many diseases, including hematologic cancers. The results obtained in this field of research, year after year, underline the important role of cross-talk between hematopoietic stem cells and their close environment. In bone marrow, mesenchymal stromal cells (MSCs) are a major player in cell-to-cell communication, presenting a wide range of functionalities, sometimes opposite, depending on the environmental conditions. Although these cells are actively studied for their therapeutic properties, their role in tumor progression remains unclear. One of the reasons for this is that the aging of MSCs has a direct impact on their behavior and on hematopoiesis. In addition, tumor progression is accompanied by dynamic remodeling of the bone marrow niche that may interfere with MSC functions. The present review presents the main features of MSC senescence in bone marrow and their implications in hematologic cancer progression

An investigation into feature effectiveness for multimedia hyperlinking

The increasing amount of archival multimedia content available online is creating increasing opportunities for users who are interested in exploratory search behaviour such as browsing. The user experience with online collections could therefore be improved by enabling navigation and recommendation within multimedia archives, which can be supported by allowing a user to follow a set of hyperlinks created within or across documents. The main goal of this study is to compare the performance of dierent multimedia features for automatic hyperlink generation. In our work we construct multimedia hyperlinks by indexing and searching textual and visual features extracted from the blip.tv dataset. A user-driven evaluation strategy is then proposed by applying the Amazon Mechanical Turk (AMT) crowdsourcing platform, since we believe that AMT workers represent a good example of "real world" users. We conclude that textual features exhibit better performance than visual features for multimedia hyperlink construction. In general, a combination of ASR transcripts and metadata provides the best results

Pattern matching and pattern discovery algorithms for protein topologies

We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted class of ordered graphs. We have developed a subgraph isomorphism algorithm for ordered graphs, which performs well on the given set of data. The maximal common subgraph problem then is solved by repeated subgraph extension and checking for isomorphisms. Despite the apparent inefficiency such approach gives an algorithm with time complexity proportional to the number of graphs in the input set and is still practical on the given set of data. As a result we obtain fast methods which can be used for building a database of protein topological motifs, and for the comparison of a given protein of known secondary structure against a motif database