The primary challenge for remote sensing bathymetry inversion in shallow waters lies in the limited water penetration depth and the significant interference from complex optical environmentson the correlation between spectral signatures and water depth. To address this difficulty and advance high-precision remote sensing inversion methods for shallowwater depths, this study utilizes WorldView-2 multispectral remote sensing imagery alongside bathymetric data from nautical charts. We establish single-band models, dual-band ratio models, and multifactor combinatorial models, employing both linear regression algorithms and nonlinear regression algorithms to fit the mathematical relationships between the spectral reflectance values derived from the imagery and the corresponding water depth values. Using the coefficient of determination (R2), root mean square error (RMSE), and average relative error (ARE) as accuracy evaluation metrics, the precision of 14 algorithms across the three models was compared. Experimental results indicate that the Random Forest nonlinear algorithm within the multifactor model achieved the highest precision, with R2=0.86, RMSE=2.06, and ARE=0.25.

This study investigates the pattern of information interaction at the cortical level during deception, aiming to reveal the cognitive processes involved in the deception task. Our study involves the 64-channel EEG signals of 28 subjects (14 for innocent and 14 for guilty groups) acquired under the guilty knowledge test (GKT) lie-detection protocol. Additionally, we establish the functional connectivity network at the cortical level considering volume conduction effects, use a data-driven approach to select the regions of interest (ROIs) on the subject's cortex based on scalp electrical activity, and perform cortical current density estimation on 15 ROIs. The nonlinear dependence between the cortical waveforms of the ROIs is quantified based on mutual information, and a network of cortical mutual information connections is constructed in four frequency bands: delta, theta, alpha, and beta. The feature extraction and classification process are performed in each frequency band, and the mutual information connections statistically different between the innocent and guilty groups are first selected as features using statistical tests. Moreover, the optimal feature subset (OFS) is found by combining the SVM classifier and the wrapper feature selection strategy. Furthermore, the most important mutual information connections (MIMICs) per frequency band are obtained by refining the OFS according to the classification performance curve. The average test accuracies of MIMICs in the delta, theta, alpha, and beta bands reached 99.76%, 96.42%, 84.04%, and 97.61%, respectively. Finally, the physiological significance of each frequency sub-band and the physiological function of MIMICs are combined to explore the cognitive mechanism of lies and provide new evidence for cognitive activity in lying states.

We study three multicast schemes, namely separate multicasting (S-MCAST), multiple uni-casting (M-UCAST), and tree-share multicasting (TS-MCAST), in optical burst-switched WDM networks taking into consideration the overheads due to control packets and guard band (GBs) of bursts on separate channels (wavelengths). In TS-MCAST, we describe four tree sharing strategies based on equal coverage (EC), super coverage (SC), overlapping coverage (OC) and overlapping coverage by maximization (OC-MAX) for deciding which multicast sessions should mix their multicast traffic, and also consider an algorithm to construct shared trees (STs). Jeong, Xiong, Cankaya, Vandenhoute and Qiao (see Proc. of IEEE ICC 2000, p.1289-91, 2000) proposed the tree sharing strategies and reported the performance of three multicast schemes for static multicast sessions and membership. In this paper, we propose efficient heuristic algorithms for managing dynamic sessions and memberships under the TS-MCAST scheme, and evaluate the efficiency of the heuristic algorithms and compare the TS-MCAST scheme with the other two schemes in terms of the bandwidth consumed and processing load assuming an unlimited bandwidth.

In this paper, we study several multicast schemes in optical burst-switched WDM networks taking into consideration of the overheads due to control packets and guard bands (GBs) of bursts on separate channels (wavelengths). A straightforward scheme is called separate multicasting (S-MCAST) where each source node constructs separate bursts for its multicast (per each multicast session) and unicast traffic. To reduce the overhead due to GBs (and control packets), one may piggyback the multicast traffic in bursts containing unicast traffic using a scheme called multiple unicasting (M-UCAST). The third scheme is called tree-shared multicasting (TS-MCAST) whereby multicast traffic belonging to multiple multicast sessions can be mixed together in a burst, which is delivered via a shared multicast tree. The multicast schemes (M-UCAST and TS-MCAST) are compared with S-MCAST in terms of bandwidth consumed and processing load.

Optical burst switching (OBS) is a promising solution for building terabit optical routers and realizing IP over WDM. In this paper, we describe the basic concept of OBS and present a general architecture of optical core routers and electronic edge routers in the OBS network. The key design issues related to the OBS are also discussed, namely, burst assembly (burstification), channel scheduling, burst offset-time management, and some dimensioning rules. A nonperiodic time-interval burst assembly mechanism is described. A class of data channel scheduling algorithms with void filling is proposed for optical routers using a fiber delay line buffer. The LAUC-VF (latest available unused channel with void filling) channel scheduling algorithm is studied in detail. Initial results on the burst traffic characteristics and on the performance of optical routers in the OBS network with self-similar traffic as inputs are reported in the paper.

This paper studies the capacity and flow assignment problem arising in the design of self-healing asynchronous transfer mode (ATM) networks using the virtual path concept. The problem is formulated here as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the restoration strategies used in the network. We compare several restoration strategies quantitatively in terms of spare cost, notably: global versus failure-oriented reconfiguration, path versus link restoration, and state-dependent versus state-independent restoration. The advantages and disadvantages of various restoration strategies are also highlighted. Such comparisons provide useful guidance for real network design. Further, a new heuristic algorithm based on the minimum cost route concept is developed for the design of large self-healing ATM networks using path restoration. Numerical results illustrate that the heuristic algorithm is efficient and gives near-optimal solutions for the spare capacity allocation and flow assignment for tested examples.

We first present a heuristic algorithm which is based on the minimum cost route concept for capacity allocation and flow assignment in self-healing networks, and show via numerical examples that it can yield near-optimal solutions for both spare and joint optimization. Based on the near-optimal solutions, we then compare two important path restoration schemes applicable in ATM VP networks, named state-independent (SI) and state-dependent (SD) schemes, in terms of spare capacity requirement (SCR), restoration speed, VPI redundancy and node storage capacity. The comparison is based on the common single link failure scenario and 100% restoration. It is found that SI scheme has advantages over the SD scheme if their difference in SCR is small. However, if the difference cannot be ignored and there is no shortage in VPI resources the SD scheme may be a good candidate. Further, fast restoration can be achieved by using bidirectional or group VP restoration.

This paper studies the capacity and flow assignment problem arising in the design of self-healing ATM networks using the virtual path (VP) concept. The problem is formulated as a linear programming problem which is solved using standard methods. The objective is to minimize the spare capacity cost for the given restoration requirement. The spare cost depends on the restoration strategies used in the network. We compare several restoration strategies, notably, global versus failure-oriented reconfiguration, path versus link based restoration and state-dependent versus state-independent restoration, quantitatively in terms of spare cost. The advantages and disadvanages of various restoration strategies are also highlighted. Such comparisons provide useful guidance for real network design. Further, a new heuristic algorithm is developed for the design of large self-healing ATM networks using path based restoration. Numerical results illustrate that the heuristic algorithm is efficient and can give near-optimal solutions for spare capacity allocation and flow assignment.

A (large) multicast ATM switch with an external structure of output queueing and an internal structure of buffered MINs (multistage interconnection networks) is considered, where the buffered MINs (also called a switching network) are composed of switching elements with shared buffer output queueing. A cell replication while routing scheme is used in the switch to implement the multicast function. In this paper, we study the performance of the switch with multicast traffic, mainly via computer simulations. The multicast traffic can be random and bursty. From our study we found that for multicast traffic with a truncated geometric distribution of cell fanouts it has only a slightly worse impact on the performance of the switching elements in isolation or in the last stage of the switching network. The multicast traffic has no worse effect on the switch output buffer behaviour and cell delay in the switching network. Moreover, traffic splitting can substantially improve the switching network performance for highly bursty traffic. Some analytical approximations are given which could be useful in the dimensioning of switching networks.

A multiserver discrete-time buffer system is studied. Packets arrive in the system according to a general correlated process, which is not further specified. The service times of the packets are of constant length. Explicit expressions are derived for the distribution, the probability generating function, and the mean and variance of the packet delay, in terms of the distribution, the probability generating function, and the mean and variance of the buffer contents. It is observed that knowledge of the exact nature of the arrival process is not required to be able to derive these relationships between the statistics of the delay and the occupancy.>

A slotted statistical multiplexer with a finite number of input links is considered. Messages arriving on each input link contain a fixed number of fixed-length packets and are carried to the multiplexer in the form of a packet train at the rate of one packet per slot. Several messages may arrive contiguously on an input link; idle periods are geometrically distributed. The multiplexer buffer is modeled as a discrete-time single-server queuing system with train arrivals. By means of a generating function approach, a technique to derive the moments of the buffer occupancy is developed, and an explicit expression for the mean buffer occupancy is given. Furthermore, an approximate method is presented to obtain a tight upper bound for the tail distribution of the buffer occupancy, especially for large traffic load.>