Patrones individuales de dispersión de larvas de góbidos en un estudiaro indicados por la composición elemental de los otolitos

Otolith trace elements were used as natural tags to study the dispersal patterns of goby larvae in an estuary. Ninety-six larval gobies representing 10 species were collected in the estuary of Gongshytyan Creek in northwestern Taiwan in September 1997. Fifteen trace elements in fish otoliths were analysed with solution-based ICPMS. Trace elemental composition in otoliths differed significantly among the species. Habitat use by the larvae of the 10 species can be divided into four groups, based on principal component analysis of otolith elemental composition. All 10 goby species used the estuary as a nursery area irrespective of the fish being amphidromous or non-amphidromous. A part of the population may be lost during larval dispersal, as indicated from trace elemental composition recorded in the otolith.Se utilizó la composición elemental en los otolitos de larvas de góbidos como trazadores naturales para estudiar los patrones de dispersión en un estuario. Durante septiembre de 1997 se recolectaron 96 larvas de góbidos pertenecientes a 10 especies distintas en el estuario de Gongshytyan Creek situado en el noroeste de Taiwan . Se analizaron 15 elementos traza mediante espectroscopia de masas (ICPMS). La composición de elementos traza en los otolitos difirió significativamente entre especies. En base al Análisis de Componentes Principales de la composición elemental de los otolitos, los hábitats utilizados por las 10 especies pudieron dividirse en 4 grupos. Las 10 especies de góbidos usan el estuario como área de cría, independientemente de que las especies sean anfidromas o no-anfidromas. La composición elemental determinada para los otolitos analizados, permitió comprobar que una parte de la población puede ser perdida durante la dispersión larvaria

Project Final Report: Ubiquitous Computing and Monitoring System (UCoMS) for Discovery and Management of Energy Resources

The UCoMS research cluster has spearheaded three research areas since August 2004, including wireless and sensor networks, Grid computing, and petroleum applications. The primary goals of UCoMS research are three-fold: (1) creating new knowledge to push forward the technology forefronts on pertinent research on the computing and monitoring aspects of energy resource management, (2) developing and disseminating software codes and toolkits for the research community and the public, and (3) establishing system prototypes and testbeds for evaluating innovative techniques and methods. Substantial progress and diverse accomplishment have been made by research investigators in their respective areas of expertise cooperatively on such topics as sensors and sensor networks, wireless communication and systems, computational Grids, particularly relevant to petroleum applications

FedClust: Optimizing Federated Learning on Non-IID Data through Weight-Driven Client Clustering

Federated learning (FL) is an emerging distributed machine learning paradigm enabling collaborative model training on decentralized devices without exposing their local data. A key challenge in FL is the uneven data distribution across client devices, violating the well-known assumption of independent-and-identically-distributed (IID) training samples in conventional machine learning. Clustered federated learning (CFL) addresses this challenge by grouping clients based on the similarity of their data distributions. However, existing CFL approaches require a large number of communication rounds for stable cluster formation and rely on a predefined number of clusters, thus limiting their flexibility and adaptability. This paper proposes FedClust, a novel CFL approach leveraging correlations between local model weights and client data distributions. FedClust groups clients into clusters in a one-shot manner using strategically selected partial model weights and dynamically accommodates newcomers in real-time. Experimental results demonstrate FedClust outperforms baseline approaches in terms of accuracy and communication costs

Quantum Vulnerability Analysis to Guide Robust Quantum Computing System Design

While quantum computers provide exciting opportunities for information processing, they currently suffer from noise during computation that is not fully understood. Incomplete noise models have led to discrepancies between quantum program success rate (SR) estimates and actual machine outcomes. For example, the estimated probability of success (ESP) is the state-of-the-art metric used to gauge quantum program performance. The ESP suffers poor prediction since it fails to account for the unique combination of circuit structure, quantum state, and quantum computer properties specific to each program execution. Thus, an urgent need exists for a systematic approach that can elucidate various noise impacts and accurately and robustly predict quantum computer success rates, emphasizing application and device scaling. In this article, we propose quantum vulnerability analysis (QVA) to systematically quantify the error impact on quantum applications and address the gap between current success rate (SR) estimators and real quantum computer results. The QVA determines the cumulative quantum vulnerability (CQV) of the target quantum computation, which quantifies the quantum error impact based on the entire algorithm applied to the target quantum machine. By evaluating the CQV with well-known benchmarks on three 27-qubit quantum computers, the CQV success estimation outperforms the estimated probability of success state-of-the-art prediction technique by achieving on average six times less relative prediction error, with best cases at 30 times, for benchmarks with a real SR rate above 0.1%. Direct application of QVA has been provided that helps researchers choose a promising compiling strategy at compile time

Creating disjoint paths in gamma interconnection networks

[[abstract]]The Gamma interconnection network (GIN) is composed of 3×3 basic building blocks, with interconnecting patterns between stages following the plus-minus-2i functions. The authors consider modifications to the GIN by altering the interconnecting patterns between stages so as to achieve high terminal reliability between any source-destination pair, resulting in the reliable GIN (REGIN). A type of REGIN's ensures totally disjoint paths in existence from any source to any destination, thereby capable of tolerating an arbitrary single fault. If several building blocks (i.e., 3×3 switches) are fabricated in one chip with very large scale integrated (VLSI) technology, the layout area and the pin count are less for the REGIN than for its GIN counterpart as a result of the change in the interconnecting patterns, giving rise to potential cost reduction. The terminal reliability of the REGIN is derived and compared with that of a compatible GIN. In addition, the performance of the REGIN is evaluated using simulatio

Embeddings in incomplete hypercubes

[[notice]]需補會議地點、主辦單位[[conferencetype]]國內[[conferencedate]]19900101~1990010

Fault-Tolerant Multiprocessor Interconnection Networks and Their Fault-Diagnoses

138 p.Thesis (Ph.D.)--University of Illinois at Urbana-Champaign, 1986.Interconnection networks have long been recognized as one of the key issues in designing a multiprocessor. A new scheme to provide multistage interconnection networks with fault-tolerance is introduced. Multiple paths between any input/output pair are created by connecting switching elements in the same stage together. The fault-tolerant interconnection network is investigated in both its reliability and its performance. Because the maximum number of possible alternative paths inherent in a network is exploited, the proposed fault-tolerant network possesses long mean lifetime and demonstrates high bandwidth. This scheme can be applied to notably enhance reliability and performance of any known multistage interconnection networks.To diagnose a fault in a redundant-path interconnection network is far more involved than in a regular one. Based on a novel fault-model, a diagnostic procedure is developed to effectively detect and locate any single fault existing in the multiple-path network. The fault-model is practical and has potential usefulness as a tool for modeling faulty states of larger switching elements (e.g., n x n switching elements with n > 2). To facilitate this procedure, faults are classified into two groups in each of which the necessary test vectors are provided for correctly setting switching elements in the network under diagnosis when the procedure is conducted.U of I OnlyRestricted to the U of I community idenfinitely during batch ingest of legacy ETD

Fault-tolerant gamma interconnection networks

[[notice]]需補會議地點、主辦單位[[conferencetype]]國內[[conferencedate]]19910601~1991060