3D Gaussian Splatting (3DGS) has gained significant attention in the 3D field; however, achieving precise and controllable editing remains a challenging problem. This paper introduces MarkEditor, a framework for precise and localized editing of 3D Gaussians. It uses a text-driven approach, beginning with a marked region as a coarse editing guide. The process consists of three stages. First, we use text-to-3D model to generate an initial 3DGS from a textual description. Second, we align it with the marked area through geometric optimization. Third, we employ a freezing mechanism and utilize Score Distillation Sampling (SDS) for global optimization of the appearance, while updating only the content within the marked region, resulting in the final edited 3D Gaussian scene. MarkEditor provides a precise and controllable approach for 3D Gaussians editing, achieving results that outperform state-of-the-art methods.

3D Gaussian Splatting (3DGS) is a powerful and computationally efficient representation for 3D reconstruction. Despite its strengths, 3DGS often produces floating artifacts, which are erroneous structures detached from the actual geometry and significantly degrade visual fidelity. The underlying mechanisms causing these artifacts, particularly in low-quality initialization scenarios, have not been fully explored. In this paper, we investigate the origins of floating artifacts from a frequency-domain perspective and identify under-optimized Gaussians as the primary source. Based on our analysis, we propose Eliminating-Floating-Artifacts Gaussian Splatting (EFA-GS), which selectively expands under-optimized Gaussians to prioritize accurate low-frequency learning. Additionally, we introduce complementary depth-based and scale-based strategies to dynamically refine Gaussian expansion, effectively mitigating detail erosion. Extensive experiments on both synthetic and real-world datasets demonstrate that EFA-GS substantially reduces floating artifacts while preserving high-frequency details, achieving an improvement of$\text{1. 6 8 ~ d B}$in PSNR over baseline method on our RWLQ dataset. Furthermore, we validate the effectiveness of our approach in downstream 3D editing tasks. We provide our implementation in https://jcwang-gh.github.io/EFA-GS.

We develop a new integrated communications and security (ICAS) design paradigm by leveraging the concept of reconfigurable intelligent surfaces (RISs). In particular, we propose RIS-assisted simultaneous transmission and secret key generation by sharing the RIS for these two tasks. Specifically, the legitimate transceivers intend to jointly optimize the data transmission rate and the key generation rate by configuring the phase-shift of the RIS in the presence of a smart attacker. We first derive the key generation rate of the RIS-assisted physical layer key generation (PLKG). Then, to obtain the optimal RIS configuration, we formulate the problem as a secure transmission (ST) game and prove the existence of the Nash equilibrium (NE), and then derive the NE point of the static game. For the dynamic ST game, we model the problem as a finite Markov decision process and propose a model-free reinforcement learning approach to obtain the NE point. Particularly, considering that the legitimate transceivers cannot obtain the channel state information (CSI) of the attacker in real-world conditions, we develop a deep recurrent Q-network (DRQN) based dynamic ST strategy to learn the optimal RIS configuration. The details of the algorithm are provided, and then, the system complexity is analyzed. Our simulation results show that the proposed DRQN based dynamic ST strategy has a better performance than the benchmarks even with a partial observation information, and achieves “one time pad” communication by allocating a suitable weight factor for data transmission and PLKG.

As one of the sensing tasks for integrated sensing and communications (ISAC), location distinction based specific emitter identification (SEI) plays an important role in location based services. In this paper, we propose a reconfigurable intelligent surface (RIS)-assisted SEI system, in which the legitimate emitter installs an RIS to customize the wireless link signature by controlling the ON-OFF state of RIS. Specifically, we consider the worst-case that the legitimate and a suspicious emitter are in the same spatial location. The received signal strength (RSS) of the specific emitter is adopted to analyze the feasibility of the proposed system. Then, we derive the statistical properties of this wireless link signature, and find the interesting insights about the phase-shift matrix configuration and the signal-to-noise-rate (SNR) gain, which showcase the huge potential of the proposed system on the integrated communications and security (ICAS) design in the near future. Afterwards, we derive the optimal detection threshold in the context of the presented metrics. Next, considering the acquisition difficulty of the RSS samples of the suspicious emitter, we use a one-class support vector machine (OC-SVM) to identify the specific emitter. Finally, the actual feasibility of the proposed system is verified via proof-of-concept experiments. The experiment results show that there are 76% and 99% performance improvements for the test statistic based and the OC-SVM based RIS-assisted SEI, respectively.

Reconfigurable intelligent surface (RIS)-empowered communication, has been considered widely as one of the revolutionary technologies for next generation networks. However, due to the novel propagation characteristics of RISs, underlying RIS channel modeling and measurement research is still in its infancy and not fully investigated. In this paper, we conduct multi-scenario broadband channel measurements and modeling for RIS-assisted communications at the sub-6 GHz band. The measurements are carried out in three scenarios covering outdoor, indoor, and outdoor-to-indoor (O2I) environments, which suffer from non-line-of-sight (NLOS) propagation inherently. Three propagation modes including intelligent reflection with RIS, specular reflection with RIS and the mode without RIS, are taken into account in each scenario. In addition, considering the cascaded characteristics of RIS-assisted channel by nature, two modified empirical models including floating-intercept (FI) and close-in (CI) are proposed, which cover distance and angle domains. The measurement results rooted in 2096 channel acquisitions verify the prediction accuracy of these proposed models. Moreover, the propagation characteristics for RIS-assisted channels, including path loss (PL) gain, PL exponent, spatial consistency, time dispersion, frequency stationarity, etc., are compared and analyzed comprehensively. These channel measurement and modeling results may lay the groundwork for future applications of RIS-assisted communication systems in practice.

With the large-scale deployment and commercialization of 5G, the traditional coverage enhancement technology is facing severe challenges due to high hardware cost and power consumption. At the same time, the emerging reconfigurable intelligent surface (RIS) technology, which can flexibly regulate incident waves and optimize the transmission path of wireless signals, is considered to be one of the most potential 6G key enabling technologies. This paper presents a 5G commercial network coverage enhancement prototype system based on RIS, which directly uses the base station in China Mobile 5G commercial network as transmitter, 5G network signal test terminal as receiver, and RIS code optimization algorithm is employed. The whole system forms a closed optimization loop of “obtaining data-analyzing data-feedback code” and is tested in multiple scenarios. In selected scenarios, the prototype system achieves a received power gain of about 6 dB, which is significant for the research of RIS in 5G commercial network.

The advancement of object detection algorithms makes them widely used in autonomous systems. However, due to high computational complexity of Convolutional Neural Networks(CNN), stringent latency requirement is hard to meet for real-time object detection. To address this problem, a low-latency accelerator architecture is proposed in this paper. A fine-grained column-based pipeline architecture with padding skip technique is implemented to reduce the start-up time of pipeline. In order to cut down the computational time of CNN, double signed-multiplication correcting circuit is introduced. In addition, pooling unit with share buffer is proposed to reduce storage cost for pooling layer. To demonstrate our new architecture, we implement the YOLOv2-tiny deep neural network (you-only-look-once) with input size 1280×384 on ZC706 development board, improving the latency by 2.125× to 2.34× compared to previous FPGA accelerator for YOLOv2-tiny.

The aim of PeerSpace is to promote peer support and peer learning in introductory Computer Science (CS) courses by providing the students with online collaborative tools for convenient synchronous and asynchronous interactions on course related topics and social matters. This paper presents the development of various social and learning components in PeerSpace that are unique in promoting collaborative learning. Analysis of preliminary results is presented.

This study examined the sterol compositions of 102 dinoflagellates (including several previously unexamined species) using clustering techniques as a means of determining the relatedness of the organisms. In addition, dinoflagellate sterol-based relationships were compared statistically to dinoflagellate 18S rDNA-based phylogeny relationships using the Mantel test. Our results indicated that the examined dinoflagellates form six clusters based on sterol composition and that several, but not all, dinoflagellate genera that form discrete clusters in the 18S rDNA-based phylogeny share similar sterol compositions. This and other correspondences suggest that the sterol compositions of dinoflagellates are explained, to a certain extent, by the evolutionary history of this lineage.

Finding the optimal teaching strategy for an individual student is difficult even for an experienced teacher. Identifying and incorporating multiple optimal teaching strategies for different students in a class is even harder. This paper presents an Adaptive tutor for online Learning, AtoL, for Computer Science laboratories that identifies and applies the appropriate teaching strategies for students on an individual basis. The optimal strategy for a student is identified in two steps. First, a basic strategy for a student is identified using rules learned from a supervised learning system. Then the basic strategy is refined to better fit the student using models learned using an unsupervised learning system that takes into account the temporal nature of the problem solving process. The learning algorithms as well as the initial experimental results are presented.

Presents a similarity-based agglomerative clustering (SBAC) algorithm that works well for data with mixed numeric and nominal features. A similarity measure proposed by D.W. Goodall (1966) for biological taxonomy, that gives greater weight to uncommon feature value matches in similarity computations and makes no assumptions about the underlying distributions of the feature values, is adopted to define the similarity measure between pairs of objects. An agglomerative algorithm is employed to construct a dendrogram, and a simple distinctness heuristic is used to extract a partition of the data. The performance of the SBAC algorithm has been studied on real and artificially-generated data sets. The results demonstrate the effectiveness of this algorithm in unsupervised discovery tasks. Comparisons with other clustering schemes illustrate the superior performance of this approach.

This paper presents a Bayesian clustering methodology that partitions temporal data into homogeneous groups, and constructs state based profiles for each group in the hidden Markov model (HMM) framework. We propose a Bayesian HMM clustering methodology that improves upon existing HMM clustering algorithm by incorporating HMM model size selection into the clustering control structure. Experimental results indicate the effectiveness of our methodology.

We briefly review each paper of the Fourteenth International Conference on Machine Learning, along with some general observations on the conference as a whole. The major topics of papers include data reduction, feature selection, ensembles of classifiers, natural language learning, text categorization, inductive logic programming, stochastic models, and reinforcement learning.

For any connection admission control (CAC) algorithm to work correctly and efficiently, accurate information of the traffic flow out of the host systems is required. We develop several approximation approaches for modeling the traffic flows of hard real-time connections. We show that without accurate traffic characterization, the CAC algorithm may do either of the following: (1) admit connections that may cause network congestions which results in violating connection deadline requirements; or (2) pessimistically reject many connections whose QoS can be guaranteed. We propose a traffic approximation model that can characterize the traffic correctly and efficiently, achieving a higher admission probability. From our experimental data we observe that the source traffic from a typical host is bursty. This burstiness may cause congestion within the network. To overcome this problem, we propose and analyze a simple traffic regulation mechanism at the application layer. The performance evaluation data shows that in the regulated system the traffic burstiness is lower and the probability of a connection being admitted is higher than the unregulated system.