Differential supervision and cognitive structure effects on empathy and counseling effectiveness

Forensic watermarking is used in large-scale video-distribution applications to track digital pirates after they illegally leak videos. Existing methods either have a high embedding complexity or have troubles providing imperceptibility and robustness. Therefore, this paper proposes a novel watermarking method that has a low embedding complexity, as well as sufficient imperceptibility and robustness. The main novelty is that frames are replaced out of the loop, which has a very low complexity. This is inspired by A/B watermarking, yet applied on frame level rather than video-segment level. The resulting drift-error artifacts are used for robust watermark detection. Additionally, a faster watermark detection method is proposed at the cost of a decrease in embedding capacity. We show that the drift errors caused by frame replacement are imperceptible, and that our method has a negligible impact on the video bitrate. Moreover, we demonstrate a high level of robustness. These interesting properties come at the cost of a non-blind detection with a relatively high complexity, that is partially solved by the proposed fast detection method. Additionally, a high detection complexity is not necessarily a problem since detection occurs infrequently and recent speed-up solutions exist. In conclusion, the proposed method is a novel and scalable solution that enables secure large-scale video distribution.

When Ss view less complex geometric shapes longer than they do more complex ones when the instruction is for the inverse effect occurs but Ss reverse this preference, in favor of the more complex shapes, when viewing for In an earlier viewing-time study Ss were exposed to the same randomly generated and distrib uted polygons twice (Kirkland, 1974). As that study was designed to examine sequential effects Ss received different instructions in each phase. The inverse effect occurred only when the instruction of preceded the instruction of Interest. The present study reports sequential effects obtained with rating scales and a group administration procedure. Two intact and independent mixed-sex groups of 15 Ss (M.A. and Diploma of Education srudents) in each were formed: 8 males in the Pleasure-to-Interest group and 6 males in the reverse instructional group. Five-page booklets were randomly distributed in each of two separate sessions. An identical cover-page contained general instructions and an example of the 7-point rating scales with two end anchors: 1 = least, 7 = most. In half these booklets the subsequent pair of pages were exchanged for the final pair to ensure balance within sessions. The first member of each pair instructed Ss to rate either for Interest or for Aesthetic Pleasure. The second member contained all the appropriately labelled rating scales. Between each experimental phase Ss were told the study was not related to memory testing. The stimuli and the order of stimuli between phases have been described previously. All slides were displayed for 4 sec. each. Dependent variables were S's mean ratings given to high and low complexity polygons under each instruction. Analyses were by 3-way analysis of variance. Separate analysis was run for each group where Ss were crossed with instruction and level of polygon complexity. Only the critical interaction of instruction by polygon complexity (demonstrating the inverse effecc) is relevant. This interaction was significant only for the Pleasure-to-Interest group (RJ, = 17.19, p < .01; with means for Pleasure; low complexity = 3.36 and high complexity = 3.83 and, for Interest; low complexity = 3.22 and high complexity = 5.56). These results support the suggestion that aesthetic pleasure may be considered as a subset of interest. It appears that instruction to view or rate Interest is more demanding of assimilatory cognitive processes than is either viewing or rating the same shapes for Aesthetic Pleasure (Berlyne, 1971). But once Interest demands have been made they will affect subsequent viewings or ratings.

In the era of modern technology, object detection using the Gray Level Co-occurrence Matrix (GLCM) extraction method plays a crucial role in object recognition processes. It finds applications in real-time scenarios such as security surveillance and autonomous vehicle navigation, among others. Computational efficiency becomes a critical factor in achieving real-time object detection. Hence, there is a need for a detection model with low complexity and satisfactory accuracy. This research aims to enhance computational efficiency by selecting appropriate features within the GLCM framework. Two classification models, namely K-Nearest Neighbours (K-NN) and Support Vector Machine (SVM), were employed, with the results indicating that K-Nearest Neighbours (K-NN) outperforms SVM in terms of computational complexity. Specifically, K-NN, when utilizing a combination of Correlation, Energy, and Homogeneity features, achieves a 100% accuracy rate with low complexity. Moreover, when using a combination of Energy and Homogeneity features, K-NN attains an almost perfect accuracy level of 99.9889%, while maintaining low complexity. On the other hand, despite SVM achieving 100% accuracy in certain feature combinations, its high or very high complexity can pose challenges, particularly in real-time applications. Therefore, based on the trade-off between accuracy and complexity, the K-NN model with a combination of Correlation, Energy, and Homogeneity features emerges as a more suitable choice for real-time applications that demand high accuracy and low complexity. This research provides valuable insights for optimizing object detection in various applications requiring both high accuracy and rapid responsiveness.

A neural architecture search based framework for liquid state machine design

Background: In Italy, Diagnosis-Related Groups (DRGs) have been adopted for hospital services reimbursement. In some Italian regions, nurse staffing allocation is purely volume-based, with different minutes/patient/day categories determined by the type of hospital ward. The Information System of Nursing Performance (SIPI) is a valid and reliable tool assessing nursing care complexity as an indicator of the actual nursing care demand. Evidence is lacking about the ability of current resource allocation methods to account for the nursing care demand. Objective: To evaluate the association between (1) DRG rates and nursing care complexity and (2) hospital ward categories of nurse staffing and nursing care complexity. Methods: All patients discharged from the medical department of an Italian hospital over a data collection period were eligible. To assess the association between nursing care complexity (SIPI) and DRGs, the distribution of the DRG rate (median and first–third quartile) was compared for cases with high or low complexity. To evaluate the association between nursing care complexity (SIPI) and nurse staffing, the frequency of high complexity within nurse staffing categories (120/180/240 min/patient/day) was compared. Because the sample was very large, methods of statistical inference were not applied, and only descriptive measures were reported. Results: 6872 hospitalizations were included. The median DRG rate for high and low complexity admissions were very similar (EUR 3536 and EUR 3285, respectively). The proportion of admissions with high complexity decreased for wards with higher staffing allocation rates. Conclusion: DRG reimbursement and the nurse staffing allocation systems were ineffective in accounting for nursing care complexity. The SIPI could help identify areas requiring more financial and staffing resources for nursing care.

The objective of the study was to investigate how creep feed pellet size and diet complexity influenced piglets’ pre-weaning feed consumption and eating behavior, as well as pre- and post-weaning (PW) growth performance. In total, 180 litters were allocated to one of six dietary treatments: positive control (commercial crumble feed, PCON; n=30 litters), negative control (no creep feed provided; NCON: n=30 litters), high complexity large pellets (HCLP; n=30 litters), low complexity small pellets (LCSP; n=30 litters), low complexity large pellets (LCLP; n=30 litters), or bakery meal large pellets (BMLP; n=30 litters) offered from day 8 in the lactation period until weaning. Large pellets (LP) had a diameter of 12 mm and a length of 10-40 mm, whereas small pellets (SP) had a diameter of 2 mm and a length of 5-15 mm. The term “high or low complexity” of diets refers to the choice of ingredients included; both diets were wheat-based, but the high-complexity diet included more digestible protein sources and functional additives such as aromas and probiotics. Piglets from 36 litters (PCON; n=6 litters, NCON; n=6 litters, HCLP; n=6 litters, LCSP; n=6 litters, LCLP; n=6 litters, and BMLP; n=6 litters) were recorded individually during the lactation period until 15 days PW. The litters and piglets were weighed on days 0, 8, and 15 of lactation and at weaning on day 21. In addition, the individually monitored piglets were also weighed at days 9 and 15 PW. Creep feed disappearance was measured in litters with individually monitored piglets during the entire creep feeding period, as were behavioral observations (on days 9, 16, and 19 of lactation), to assess how many piglets in each litter had their head in the feeder or feed items in their mouth. Dietary treatment had no effect on pre-weaning BW, BW gain, or ADG (P>0.05). However, piglets fed large pellets (HCLP, LCLP, and BMLP) showed a significantly (P<.0001) higher feed disappearance than piglets fed PCON and LCSP, which was supported by a higher number of piglets observed eating on days 16 and 20 of lactation for these treatments (P=0.001 and <0.001, respectively). Post-weaning, piglets fed PCON had a 40% numerically higher ADG compared with piglets fed NCON. In conclusion, the physical form of the creep feed affected the piglets’ feeding activity, although this was not reflected in their growth performance. Also, diet complexity did not seem to impact growth performance when the piglets were weaned on day 21 of lactation.

PurposeThis study aimed to compare perioperative outcomes of open partial nephrectomy (OPN) and laparoscopic partial nephrectomy (LPN) from a retrospective single-center dataset.Patients and MethodsA retrospective single-center analysis of 210 patients who underwent open (n=91) or laparoscopic (n =119) partial nephrectomy for RCC was conducted between 2012 and 2015. All patients were grouped into low complexity, moderate complexity, and high complexity according to the R.E.N.A.L. Nephrometry Score, respectively. The rates of intraoperative and postoperative complications estimated blood loss, warm ischemia time, operative time, conversion of laparoscopic procedure to open surgery, and postoperative length of stay were assessed for both procedures.ResultsIn low complexity group (n=93), patients undergoing LPN (n=52) under ischemia conditions had significantly longer renal artery clamp time (p < 0.001) and operative time (p = 0.001) compared with OPN (n=41). However, patients undergoing LPN had a significantly less postoperative length of stay (p=0.005) and estimated blood loss (p < 0.001) compared with OPN. There was no statistically significant difference in the rates of complications between LPN and OPN. In the moderate complexity group (n=114), 67 and 47 patients underwent LPN and OPN, respectively. LPN had notably longer warm ischemia time (p < 0.001) and operative time (p < 0.001) compared with OPN. There were no statistically significant differences in the rates of complications, estimated blood loss, and postoperative length of stay between LPN and OPN. In the high complexity group (n=3), all patients underwent OPN.ConclusionOPN and LPN procedures performed in patients with low and moderate complexity tumors based on the RENAL Nephrometry score offer acceptable and comparable results. When applied to low complexity tumors, our data suggest that laparoscopic NSS is an effective, minimally invasive therapeutic approach with the advantages of less blood loss, earlier hospital discharge, and more rapid convalescence.

AimsTo identify comorbidity patterns in elderly Chinese patients with atrial fibrillation (AF), their clinical course, and the effectiveness of the Atrial fibrillation Better Care (ABC) pathway adherence among these phenotypes.Methods and resultsFrom the ChiOTEAF Registry, we performed a latent class analysis based on 16 cardiovascular (CV) and non-CV conditions. The association between classes of patients, management, and outcomes was evaluated. The primary outcome was a composite of all‐cause death and major adverse CV events. We assessed the impact of ABC adherence on outcomes in the whole cohort and among phenotypes. We included 4765 AF patients [median age 77 (68–83) years, 39.1% females]. Four phenotypes were identified: (i) low complexity (48.9%); (ii) atherosclerotic (19.3%); (iii) heart failure (19.4%); and (iv) high complexity (12.3%). During a 1-year follow-up, compared to the ‘low complexity’ class, the risk of adverse events was higher in ‘high complexity’ [aOR, 95% confidence interval (CI): 3.20, 2.21–4.66] and ‘heart failure’ classes (aOR, 95% CI: 1.50, 1.04–2.17). Among 2654 patients [median age 75 (66–81) years, 43.3% females] with available information to assess the ABC pathway, 1094 (41.2%) were adherent. ABC pathway adherence was associated with a lower risk of adverse events (aOR, 95% CI: 0.37, 0.20–0.65). On interaction analysis, its beneficial effect was similar across different clinical phenotypes (Pint = 0.122).ConclusionDifferent clinical phenotypes can be identified in Asian AF patients, with specific patterns of comorbidities and different risks of adverse events. Full ABC pathway adherence was associated with improved outcomes, regardless of the clinical phenotype.

A systems perspective on rural and remote colorectal cancer screening access

The delay and throughput characteristics of a packet switch depend mainly on the queueing scheme and the scheduling algorithm deployed at the switch. Early research on scheduling algorithms has mainly focused on maximum weight matching scheduling algorithms. It is known that maximum weight matching algorithms guarantee the stability of input-queued switches, but are impractical due to their high computational complexity. Later research showed that the less complex maximal matching algorithms can stabilize input-queued switches when they are deployed with a speed-up of two. For practical purposes, neither a high computational complexity nor a speed-up of two is desirable.In this paper, we investigate the application of matching algorithms that approximate maximum weight matching algorithms to scheduling problems. We show that while having a low computational complexity, they guarantee the stability of input queued switches when they are deployed with a moderate speed-up.In particular, we show that the improve_matching algorithm stabilizes input-queued switches when it is deployed with a speed-up of 3&lt;over&gt;2+ε.In a second step, we further improve on these results by proposing a class of maximal weight matching algorithms that stabilize an input-queued switch without any speed-up.Whereas initial research has only focused on scheduling algorithms that guarantee the stability of a single switch, recent work has shown how scheduling algorithms for single switches can be modified in order to design distributed scheduling algorithms that stabilize networks of input-queued switches. Using those results, we show that the switching algorithms proposed in this paper do not only stabilize a single switch, but also networks of input-queued switches.

Quadrature spatial modulation (QSM) is one of the most prevalent transmission techniques for future wireless mobile network due to its high spectral efficiency (SE) and low complexity. However, it is restrictive to downlink of the cellular network deployments. Therefore, this paper proposes QSM for the multiuser uplink data transmission that increases the SE of the network by deploying multiple antennas at the mobile user with only two radio frequency (RF) chains. Maximum likelihood (ML) decoder is used to detect the received signal and attains the optimal detection performance but it is impractical because of its high computational complexity. Consequently, this paper proposes compressed sensing (CS) based orthogonal matching pursuit (OMP) detection as it has a suboptimal performance with a low computational complexity which can be a practical solution in the high‐density uplink multiuser network. However, conventional OMP algorithm has a low estimation performance due to multiuser interference which corrupt channel matrix. Thus, this work design an equalizer that mitigates the multiuser interference and improve the detection performance by orthonormalizing the columns of channel matrix. Simulation analysis confirm that the proposed QSM technique based on CS detector outperforms the conventional schemes in terms of SE and bit error rate (BER).

A computationally efficient ranging scheme that estimates time of arrival (TOA) by a low complexity minimum mean square error (MMSE) and a matrix pencil techniques is proposed for IEEE 802.15.4a chirp spread spectrum system. In TOA estimation, it is known that accurate channel delay can be estimated by the MMSE technique. However, the major drawback of the MMSE is its high computational complexity, which grows with number of signal samples. In this paper, thus, a computational efficient MMSE technique based on the chirp spectrum characteristic is proposed for a low complexity ranging algorithm. The proposed TOA estimation method consists of two-step signal processing: proposed low complexity MMSE-based channel impulse response (CIR) estimation and the channel delay tracking by matrix pencil algorithm. The proposed TOA estimation method not only has low computational complexity, but also achieves small ranging error. The effectiveness of the proposed algorithm is demonstrated by simulation results.

PD41-11 A DEEPER LOOK INTO SURGEON USE OF 3D VIRTUAL IMAGING PLATFORM (IRISTM): ANALYSIS OF GAZE PATTERNS AND PUPIL METRICS USING HEAD MOUNTED EYE TRACKERS (HMET)

In multiple input multiple output-orthogonal frequency division multiplexing (MIMO-OFDM) systems, several detection schemes have been developed for high error performance and low complexity. In several detection schemes, maximum likelihood (ML) and QRD-M have optimal error performance. However, these detection schemes have very high complexity. Thus, this paper proposes reduced complexity of QRD-M detection scheme in MIMO-OFDM systems. The proposed detection scheme has two stages, i.e. partial zero-forcing (ZF) and conventional QRD-M. The proposed detection scheme has higher error performance and lower complexity than the decision feedback equalizer (DFE).

In this paper, we propose and demonstrate a low-complexity fiber nonlinearity impairments compensation (NLC) scheme based on simple recurrent neural network (SRNN), combining with the triplets derived from the first-order perturbation solution of the coupled nonlinear Schrodinger equation. Benefitting from the time memory of SRNN, the proposed NLC can reduce the computational complexity without sacrificing the compensation performance compared with the schemes based on memoryless feedforward neural networks. To verify the feasibility of the proposed NLC, the simulation systems of single channel and three channel 30 GBaud polarization division multiplexing (PDM) 16 quadrature amplitude modulation (QAM) over 2400 km standard single mode fiber transmission are constructed respectively. Comprehensive numerical simulation results demonstrate that although the NLC performance of proposed scheme is inferior to that of digital back propagation (DBP) with much higher complexity and impracticality, it can still achieve the competitive NLC performance with lower computational complexity compared to the schemes based on deep neural network (DNN) and artificial neural network (ANN). Moreover, it is further proved that using triplets as the feature required for NLC can cause the pattern of pseudo random bit sequence to be destroyed, resulting in the neural network-based NLC scheme not suffering from the problem of overestimation for performance. Additionally, the time memory of SRNN enables the number of triplets in training set required by the SRNN-based NLC to be reduced by 169% compared to that of DNN and ANN. The experimental results of 16 GBaud PDM-16QAM wavelength division multiplexing coherent systems demonstrate that compared to with ANN and DNN, the comparable NLC performance can also be achieved by the proposed scheme with lower complexity.