nils-herrmann/clean_scirepeval huggingface dataset:
Estimate weather impacted airport capacity using ensemble learning

Ensemble BDT consistently outperforms the single SVM classifier. This demonstrates that multiple classifier systems are more robust in the presence of noise and other imperfections in data as compared to a single classifier system. • The BDT classifier provides very good estimates of the runway configuration using the airport weather. • The AAR classification predictions by BDT for 2 and 4 hour look-ahead times are excellent. For 6-hour AAR prediction, the performance of the BDT classifier is not bad, AUC is 86% for EWR and 92% for ORD. • The AAR prediction results using BDT models for EWR are not as good as for ORD (Weather factors).
Analysis of multi-hop traffic grooming in WDM mesh networks

Traffic grooming is an essential functionality of WDM optical networks to provision multi-granularity subwave-length connections. Depending on the number of lightpaths allowed in a connection route, traffic grooming can be classified as single-hop traffic grooming (SH-TG) and multi-hop traffic grooming (MH-TG). MH-TG is more general and resource-efficient than SH-TG, because it allows connections from different source-destination pairs to share the bandwidth of a lightpath. In this paper, we propose a MH-TG algorithm, namely the fixed-order multi-hop (FOMH) grooming algorithm, based on the fixed-alternate routing approach. We introduce the grooming node selection (GNS) problem in MH-TG and propose three grooming policies, namely exhaustive sequential (ES), limited-hop sequential (LHS) and load sharing (LS) policies, to address the GNS problem. Given that the analysis of MH-TG is a relatively unexplored area, we propose an analytical model to evaluate the blocking performance of MH-TG using FOMH and the LS grooming policy. To address the multi-layered routing and multi-rate connection characteristics of traffic grooming, we introduce a novel multi-level decomposition approach in our analytical model which decomposes traffic at four different levels, namely alternate path, connection route, lightpath and link levels. The Erlang fixed-point approximation method is used to solve the analytical model. Numerical results show that analytical results matches well with simulation results. We also evaluate the effect of the grooming policies, the number of virtual hops (lightpaths) within a connection route and the number of alternate paths on the performance of the grooming algorithm.
Formation control of quadrotor UAVs without linear velocity measurements

The problem of formation control of a group of quadrotors without linear velocity measurements is addressed in this paper. A distributed controller is developed directly on the orthogonal group SE(3) to avoid the singularities associated with Euler-angles and the ambiguity of quaternions. The control design procedure can be divided into two main steps. First, an intermediary control input is designed to achieve the formation objective, where some auxiliary systems are introduced to obviate the need for linear-velocity measurements. After decoding the intermediary control input into the trust force and reference angular velocity, then the torque input for each quadrotor is designed to drive the actual angular velocity to the desired ones. The asymptotic stability analysis is presented with Lyapunov-like tools. Simulation results on three quadrotors show the effectiveness of the proposed strategy.
Synthesis and verification of cyclic combinational circuits

Prior works have demonstrated opportunities for achieving more minimized combinational circuits by introducing combinational loops during the synthesis. However, they achieved this by using a branch-and-bound technique to explore possible cyclic dependencies of circuits, which may not scale well for complex designs. Instead of using exploration, this paper proposes a formal algorithm using logic implication to identify cyclifiable structure candidates directly, or to create them aggressively in circuits. Additionally, we also propose a SAT-based algorithm to validate whether the formed loops are combinational or not. The effectiveness and scalability of the identification and validation algorithms are demonstrated in the experimental results performed on a set of IWLS 2005 benchmarks. As compared to the state-of-the-art algorithm, our validation algorithm produces speedups ranging from 2 to 2350 times.
Lip-based visual speech recognition system

This paper proposes a system to address the problem of visual speech recognition. The proposed system is based on visual lip movement recognition by applying video content analysis technique. Using spatiotemporal features descriptors, we extracted features from video containing visual lip information. A preprocessing step is employed by removing the noise and enhancing the contrast of images in every frames of video. Extracted feature are used to build a dictionary for kernel sparse representation classifier (K-SRC) in the classification step. We adopted non-negative matrix factorization (NMF) method to reduce the dimensionality of the extracted features. We evaluated the performance of our system using AVLetters and AVLetters2 dataset. To evaluate the performance of our system, we used the same configuration as another previous works. Using AVLetters dataset, the promising accuracies of 67.13%, 45.37%, and 63.12% can be achieved in semi speaker dependent, speaker independent, and speaker dependent, respectively. Using AVLetters2 dataset, our method can achieve accuracy rate of 89.02% for speaker dependent case and 25.9% for speaker independent. This result showed that our proposed method outperforms another methods using same configuration.
Improvement of ZigBee Cluster-Tree Routing Algorithm Based on Energy Saving

In order to realize the energy balance of ZigBee, prolonging the survival time of the network, avoiding the paralysis of the network, this paper improves the tree algorithm. This paper firstly introduces ZigBee and the results of some routing algorithms, and then analyzing and comparing the original tree algorithm and AODVjr algorithm, finding out the inadequacies. The original tree algorithm is improved by routing table, eliminating invalid neighbor nodes and balancing energy. Experiment results of simulation show that: Sending 1000 packets, the improved algorithm is 750 hops less than the original algorithm, and high load nodes 5 less than the original. Therefore, the improved algorithm is effective, it saves the number of hops, that is to save energy.
A modulation technique of neutral point clamped converters with common-mode voltage reduction and neutral-point potential balance

Common mode voltage output is closely associated with switching states in three-phase three-wire neutral-point clamped inverter. Detailed analysis shows avoiding redundant states can effectively improve the common mode voltage, so this paper proposes a pulse width modulation (PWM) technique with zero redundant states to reduce the common mode voltage output, and evaluate their performance with the conventional PWM scheme. This study also takes the issue of neutral point potential deviation compensation into consideration. Laboratory test results are presented to verify the effectiveness of proposed scheme.
A novel neutral point potential control for the three-level neutral-point-clamped converter

Three-level neutral-point-clamped (NPC) converters/inverters have become a popular topology for not only medium-voltage (1k–33k) but also low-voltage level industrial application because of its reduced transistor block voltage and lower output current distortion. The neutral point voltage balancing control is one of the important issues of NPC converter to ensure system operation since the voltage drift in neutral point could lead to low-frequency current distortion and increases the risk of over-voltage in power electronic semiconductor devices. This paper provides a zero-sequence voltage (ZSV) injection to charge and discharge electric potential in the upper or the lower capacitor for unipolar switching. In addition, a novel neutral point potential control by bipolar switching is presented in this paper, which has better control dynamic under pure reactive power operation. The concept of these two neutral point potential control methods will be introduced, and then the laboratory test results are presented for verification.
Perceptual Quality Maximization for Video Calls With Packet Losses by Optimizing FEC, Frame Rate, and Quantization

We consider video calls affected by bursty packet losses, where frame-level forward error correction (FEC) is employed due to delay constraints, and damaged frames and others predicted from them are discarded. Here, a high frame rate (FR) at low bitrates leads to large quantization step sizes (QS), small frames, and suboptimal FEC, whereas a low FR at high bitrates reduces the perceptual quality. To mitigate frame losses and freezing, hierarchical-P (hierP) temporal layering can be used with lower coding efficiency than IPPP coding. We study the received quality maximization for hierP and IPPP, by jointly optimizing the encoding FR, QS, and the FEC redundancy, under sending bitrate constraints. Building upon Q-STAR perceptual quality and R-STAR bitrate models, which depend on QS, and the decoded and encoding FR, respectively, we cast the problem as a combinatorial optimization problem. We solve for the encoding FR and the bitrate using exhaustive search, hill-climbing, and a greedy FEC distribution algorithm to determine the FEC redundancies. We show that, for random losses, the FEC bitrate ratio is an affine function of the packet-loss rate; low encoding FR is preferred at wider sending bitrate ranges with higher packet loss; layer protection is more even at higher bitrates; and IPPP, while achieving higher Q-STAR scores, is prone to freezing. For bursty losses, we show that layer redundancies are higher, rising with the mean burst length, reaching 80%; and hierP achieves higher Q-STAR scores than IPPP for longer bursts, and a smaller mean and variance of decoded frame distances.
Performance evaluation of on-chip sensor network (SENoC) in MPSoC

As technology scaling, more processing units (PUs) are integrated in multiprocessor system-on-chip (MPSoC) to achieve higher performance. Due to the higher variations resulted from reducing feature sizes and the needs of lower power consumption, on-chip monitoring of environmental information, such as thermal, voltage, and frequency, is becoming increasingly important. To address this need, sensors are integrated into network-on-chip (NoC) to perform system monitoring. However, sensors which transfer their data through NOC will compete with PUs for the limited bandwidth resources, thus communication between PUs will be delayed. To evaluate the sensors' overhead on the regular data traffic, we implement a VC based NoC. The sensor data are transferred through NoC together with the regular data. We study the average delay of regular data and sensor data, respectively. We compare the experimental results with that of a NOC without sensors. The results show that the overhead of sensors is negligible, with a max delay overhead of 0.80% when the traffic is not that heavy.
Periodically chirped sampled fiber Bragg gratings for multichannel comb filters

Periodically chirped sampled fiber Bragg gratings (PC-SFBGs) are proposed as multichannel comb filters. A PC-SFBG consists of many chirp periods corresponding to the periodic chirp effect. With the same chirp coefficient released for a linearly chirped SFBG (LC-SFBG), the spectral self-imaging phenomenon is also observed in the PC-SFBG. Compared with a uniform SFBG, the PC-SFBG exhibits a narrower channel spacing and a similar group-delay characteristic in the reflection bands. Meanwhile, the PC-SFBG ensures a more accurate phase-shift condition (or a better tolerance on the chirp coefficient) and higher peak reflectivities than the LC-SFBG
Maximally smooth image recovery in transform coding

The authors consider the reconstruction of images from partial coefficients in block transform coders and its application to packet loss recovery in image transmission over asynchronous transfer mode (ATM) networks. The proposed algorithm uses the smoothness property of common image signals and produces a maximally smooth image among all those with the same coefficients and boundary conditions. It recovers each damaged block by minimizing the intersample variation within the block and across the block boundary. The optimal solution is achievable through two linear transformations, where the transform matrices depend on the loss pattern and can be calculated in advance. The reconstruction of contiguously damaged blocks is accomplished iteratively using the previous solution as the boundary conditions in each new step. This technique is applicable to any unitary block-transform and is effective for recovering the DC and low-frequency coefficients. When applied to still image coders using the discrete cosine transform (DCT), high quality images are reconstructed in the absence of many DC and low-frequency coefficients over spatially adjacent blocks. When the damaged blocks are isolated by block interleaving, satisfactory results have been obtained even when all the coefficients are missing.
Automatic mouse embryo brain ventricle segmentation from 3D 40-MHz ultrasound data

Volumetric analysis of brain ventricles is important to the study of normal and abnormal development of the central nervous system of mouse embryos. High-frequency ultrasound (HFU) is frequently used to image embryos because HFU is real-time, non-invasive, and provides fine-resolution images. However, manual segmentation of ventricles from 3D HFU volumes remains challenging and time consuming. In this study, in utero and in vivo volumetric ultrasound data were acquired from pregnant mice using a 5-element, 40-MHz annular array. An automatic segmentation algorithm based on active shape model (ASM) was developed to segment the brain ventricles of the embryos; ASM allows us to efficiently “learn” from training data (i.e., manually segmented data). The algorithm was further enhanced by using detail-preserving reference shapes (also learned from training data) and region growing constrained by the reference shape. The hybrid algorithm was applied to three 12.5-day-old embryos. Results were qualitatively analyzed and compared with manual segmentation results in regions typically difficult to segment (e.g., thin brain ventricle connections). In addition, quantitative analysis using the Dice similarity coefficient (DSC) was used to compare the automatic segmentation results with manual segmentation. We obtained average DSC values of 0.848±0.015 for the brain ventricles and our method produced morphologically accurate results. Therefore, our method could streamline current HFU longitudinal studies of brain development that require manual segmentation.
System Yield Based Spectrum Allocation Algorithm for Cognitive Radio

To solve the problem of low system yield of existing spectrum allocation algorithm in cognitive radio, an advanced algorithm based on system yield and maximal independent set (MIS) is proposed. The advanced algorithm is based on coloring model of spectrum allocation and the theory of MIS. The key part of this algorithm is to calculate priority of channels using system parameters such as amount of available channels and system yield. Spectrum source in every MIS is allocated according to priority of channels. The results of simulation prove the feasibility of advanced algorithm and shows that this method efficiently promotes total system yield.
A Hierarchical Peer-to-Peer SIP System for Heterogeneous Overlays Interworking

P2P SIP is proposed to leverage Peer-to-Peer computing to control multimedia sessions in a decentralized manner. The deployment and maintenance cost of P2PSIP is reduced compared to conventional SIP. In this paper, we propose a hierarchical P2PSIP system to address the connectivity and overhead problems which haven't been solved in the P2PSIP literature. The hierarchical P2PSIP system is implemented under Linux, which demonstrates the feasibility of the proposed scheme. Finally, exhaustive simulations are performed to evaluate the performance of various P2PSIP schemes. Results indicate that the hierarchical approach not only solves the connectivity problem caused by heterogeneous overlays, but also performs more efficiently than the flat scheme when the percentage of nodes in the upper level overlay is less than 10%.
A Virtual Wealth Trading Model: Design and Implementation

Internet and online virtual communities have become a part of our lives. They provide us with a convenient way to maintain social relationships with other people. In a virtual community, people can earn virtual goods and virtual wealth. If virtual wealth can be transferred between different virtual communities, e-commerce will become more popular among members of different virtual communities. In order to achieve this goal, some virtual money exchange regimes have been proposed in literature. However, it is only possible under the premise that virtual communities are opened up to one another. Thus, there still exist problems for virtual communities that are open to each other. To cope with this problem, this paper will propose a novel scheme to exchange virtual wealth across different virtual communities. The proposed approach aims to provide a trade model and process between non-open communities. The details of the interactive process between the central trade system, the buyer, the seller, and the virtual communities will be addressed in this paper. In order to observe the performance of these trading processes, we designed and built a prototype of a central trade system and carried out some simulations based on it.
Fast and energy-aware resource provisioning and task scheduling for cloud systems

Cloud computing has become an attractive computing paradigm in recent years to offer on demand computing resources for users worldwide. Through Virtual Machine (VM) technologies, the cloud service providers (CSPs) can provide users the infrastructure, platform, and software with a quite low cost. With the drastically growing number of data centers, the energy efficiency has drawn a global attention as CSPs are faced with the high energy cost of data centers. Many previous works have contributed to improving the energy efficiency in data centers. However, the computational complexity may lead to unacceptable run time. In this paper, we propose a fast and energy-aware resource provisioning and task scheduling algorithm to achieve low energy cost with reduced computational complexity for CSPs. In our iterative algorithm, we divide the provisioning and scheduling to multiple steps which can effectively reduce the complexity and minimize the run time while achieving a reasonable energy cost. Experimental results demonstrate that compared to the baseline algorithm, the proposed algorithm can achieve up to 79.94% runtime improvement with an acceptable energy cost increase.
Research on GNSS compatibility methodology based on CT-SSC

Compatibility Analysis of satellite navigation systems has become a research hotspot in recent years. Spectral separation coefficient (SSC), which is one of the most important quantities in GNSS compatibility, has been widely studied. In fact, it is suitable for impact of interfering on the receiver process steps which use prompt correlator channel, but it doesn't reflect the impact of code tracking processing. A code-tracking-based compatibility methodology is proposed, in which the code tracking spectral sensitivity coefficient (CT-SSC) is derived. Different from traditional compatibility methodology, this method does not only relate to power spectral density of desired signals and interfering signals, but also relates to early minus late spacing width. And through the analysis, it shows that the CT-SSCs can even vary 14dBs within one chip spacing and are larger than SSCs up to 5dBs for specific pairs of desired and interfering signals. Finally, the intra and intersystem interferences in GPS L1 band are simulated by both traditional and code-tracking-based compatibility methodology. It is concluded that the former would underestimate intra and intersystem interference.
Development of a Computerized Method to Inspect Empty Glass Bottle

The objective of this study was to develop a computerized empty glass bottle inspection method in an attempt to replace manual inspection. The inspection system structure based on machine vision was illustrated in the article. Morphologic methods and wavelet transform were used to extract features of the bottle body and the finish from images. The fuzzy support vector machine neural network was adopted as the classifier when the features were extracted. The results of our experiment indicated that it can reach up to 97% of accuracy by using the method developed in this study to inspect empty glass bottles.
The measurement of viscosity in rubber mixing process based on fuzzy modeling

Viscosity is one of the key quantities in rubber mixing process, online measurement of viscosity is very difficult to achieve. To cope with this problem, a soft sensing approach based on fuzzy modeling is proposed. During fuzzy modeling, T-S fuzzy model is employed to approximate the non-linearity of rubber mixing process, an improved Gustafon-Kessel fuzzy clustering algorithm based on similarity assessing is proposed to determine the optimum number of clusters. All these techniques make the fuzzy model simple and accurate. Based on it, test on BB370 internal mixer is carried out. The results show the proposed approach provides more accurate viscosity prediction than mathematical modeling approach. Compared with laboratory measurement, the error is small and acceptable. It improves production efficiency greatly and lays down the foundation for optimal control of viscosity.
Activating mobile agents from contactless smart cards through a Java bytecode extractor

As mobile agents reside on on-board units or mobile devices and act on behalf of drivers, it imposes a strong demand to devise mechanisms for protecting the algorithms that are exclusively coded in mobile agents for different drivers. Although contactless smart cards are widely used as a means to protecting personal information, it is still a challenge to protect the whole code of a mobile agent in a limited storage. In this paper, we propose a tool, called jExtractor, by which the private or sensitive data coded in a Java-based mobile agent can be extracted and moved to a contactless smart card, and can further be read from the card and merged to be the original mobile agent. Moreover, we use 30,000 Java classes as samples to validate jExtractor. In the experimental result, 79.4% of the sample classes can successfully be extracted and moved to Mifare Standard S50 (1K) smart card with our strictest configuration level.
Sorption and Desorption Behaviors of Chlorobenzene on the Sediment of Songhua River

The sorption and desorption behaviors of monochlorobenzene (MCB) on sediment were investigated at 12&#8451;, which was sampled at Songhuajiang Village section. The experimental data were analyzed by the Langmuir, Freundlich, and Linear models of sorption. Because the sediment was belonged to mild clay, the amount of adsorbed MCB was few, the sorption isotherm data were fitted well to Langmuir isotherm and the monolayer sorption capacity was found to be 1.18 µg/dg at 12&#8451;. The hysteresis phenomenon of MCB on sediment was exist, decreasing with increasing equilibrium concentration, which indicated that the hysteresis phenomenon was more evident at lower MCB equilibrium concentration.