nils-herrmann/clean_scirepeval huggingface dataset:
A real-time machine vision system for bottle finish inspection

Finish chinks are regarded as the most critical defects of recycled bottles adopted in beverage production. This paper presents a bottle finish inspection system utilizing state-of-art machine vision technologies to implement high-speed online inspection. The system architecture is illustrated in detail. An algorithm derived from Hough transform is applied for real-time determination of area of interest. As for detection, two artificial neural networks are used for low-level inspection and high-level judgment respectively. A prototype is developed and experimental results demonstrate the feasibility of the inspection system. The proposed algorithms are proved to be efficient in automatic finish inspection.
Generalized MBER-Based Vector Precoding Design for Multiuser Transmission

We propose a generalized vector precoding (VP) design based on the minimum bit error rate (MBER) criterion for multiuser transmission in the downlink of a multiuser system, where the base station (BS) equipped with multiple transmitting antennas communicates with single-receiving-antenna mobile station (MS) receivers each having a modulo device. Given the knowledge of the channel state information and the current information symbol vector to be transmitted, our scheme directly generates the effective symbol vector based on the MBER criterion using the particle swarm optimization (PSO) algorithm. The proposed PSO-aided generalized MBER VP scheme is shown to outperform the powerful minimum mean-square-error (MMSE) VP and improved MMSE-VP benchmarks, particularly for rank-deficient systems, where the number of BS transmitting antennas is lower than the number of MSs supported.
Same-destination-intermediate grouping vs. end-to-end grouping for waveband switching in WDM mesh networks

We investigate waveband switching (WBS) with different grouping strategies in wavelength-division multiplexing (WDM) mesh networks. End-to-end waveband switching (ETE-WBS) and same-destination-intermediate waveband switching (SD-IT-WBS) are analyzed and compared in terms of blocking probability and cost savings. First, an analytical model for ETE-WBS is proposed to determine the network blocking probability in a mesh network. For SD-IT-WBS, a simple waveband switching algorithm is presented. An analytical model to determine the network blocking probability is proposed for SD-IT-WBS based on the algorithm. The analytical results are validated by comparing with simulation results. Both results match well and show that ETE-WBS slightly outperforms SD-IT-WBS in terms of blocking probability. On the other hand, simulation results show that SD-IT-WBS outperforms ETE-WBS in terms of cost savings.
Optimizing the beam pattern of a forward-viewing ring-annular ultrasound array for intravascular imaging

Intravascular ultrasound (IVUS) imaging systems using circumferential arrays mounted on cardiac catheter tips fire beams orthogonal to the principal axis of the catheter. The system produces high resolution cross-sectional images but must be guided by conventional angioscopy. A real-time forward-viewing array, integrated into the same catheter, could greatly reduce radiation exposure by decreasing angiographic guidance. Unfortunately, the mounting requirement of a catheter guide wire prohibits a full-disk imaging aperture. Given only an annulus of array elements, prior theoretical investigations have only considered a circular ring of point transceivers and focusing strategies using all elements in the highly dense array, both impractical assumptions. In this paper, we consider a practical array geometry and signal processing architecture for a forward-viewing IVUS system. Our specific design uses a total of 210 transceiver firings with synthetic reconstruction for a given 3-D image frame. Simulation results demonstrate this design can achieve side-lobes under -40 dB for on-axis situations and under -30 dB for steering to the edge of a 60/spl deg/ cone.
Agent Based Supply Chain Research

Using MAS theory to set up modeling systems for four lever no-liner orders needs of supply chain. At the same time study the structure of Agent System, Agent interaction and decision-making. On this basis, research sharing information in the value of simulation for MAS-based supply chain. In the simulation example. Analysis of information-sharing effects throughout the supply chain system as well as members costs of the supply chain. And discuss the information-sharing influence on the bullwhip effect.
Bit allocation for MPEG-4 video coding with spatio-temporal tradeoffs

This paper describes rate-control algorithms that consider the tradeoff between coded quality and temporal rate. We target improved coding efficiency for both frame-based and object-based video coding. We propose models that estimate the rate-distortion characteristics for coded frames and objects, as well as skipped frames and objects. Based on the proposed models, we propose three types of rate-control algorithms. The first is for frame-based coding, in which the distortion of coded frames is balanced with the distortion incurred by frame skipping. The second algorithm applies to object-based coding, where the temporal rate of all objects is constrained to be the same, but the bit allocation is performed at the object level. The third algorithm also targets object-based coding, but in contrast to the second algorithm, the temporal rates of each object may vary. The algorithm also takes into account the composition problem, which may cause holes in the reconstructed frame when objects are encoded at different temporal rates. We propose a solution to this problem that is based on first detecting changes in the shape boundaries over time at the encoder, then employing a hole detection and recovery algorithm at the decoder. Overall, the proposed algorithms are able to achieve the target bit rate, effectively code frames and objects with different temporal rates, and maintain a stable buffer level.
On the support of bandwidth on demand service over wide-area WDM optical networks

Future broadband networks must support integrated services and offer flexible bandwidth usage. Most existing proposals for wide-area wavelength division multiplexed (WDM) networks employ circuit switching adopting the concept of lightpath, in which each circuit or lightpath occupies an entire wavelength. This, however, is not suited for end-to-end transport of information streams, typically with each stream having its unique traffic characteristics such as the bandwidth needed, different traffic bursty nature, and diverse service requirements. We explore the extensions of the functions of what we refer as the optical link control (OLC) layer, native on top of optical layer, to offer finer granularity of wavelength usage and further enable the possibility of bandwidth on-demand (BoD) service directly over WDM networks. The objective is to facilitate the support of integrated services over WDM networks and to mitigate the changes needed in the upper layers as well. The proposed approach attempts to exploit the strengths of both optics and electronics, in which packets are either routed end-to-end over a lightpath transparently, or forwarded from wavelength to wavelength by electronic switching, whenever required. Furthermore, in order to establish an end-to-end BoD connection, the issue of how to select the best wavelength to route the given connection is also investigated. The effectiveness of the proposal is evaluated by simulation.
Dependent-Latch Identification in Reachable State Space

The large number of latches in current digital designs increases the complexity of formal verification and logic synthesis, since an increase in latch numbers leads to an exponential expansion of the state space. One solution to this problem is to find the functional dependences among these latches. With the information of functional dependences, these latches can be identified as dependent or essential latches, and the state space can be constructed using only the essential latches. Although much research has been devoted to exploring the functional dependences among latches using binary-decision-diagram (BDD)-based symbolic algorithms, this issue is still unresolved for large sequential circuits. In this paper, we propose a heuristic to identify the dependent latches based on the state-of-the-art work. In addition, our proposed approach detects sequential functional dependences existing in the reachable state space only. The sequential functional dependences can identify additional dependent latches after a specific time frame in order to achieve additional reduction of the state space. Experimental results show that this approach can deal with large sequential circuits with up to 9000 latches in a reasonable time while simultaneously identifying their combinational and sequential dependent latches. For instance, with s13207 in ISCAS'89, 23% of the latches are identified as combinational dependent latches, and an additional 13% of the latches are identified as sequential dependent latches. For the reachability analysis of s13207, with the benefits of dependent-latch identification, 70.70% of the BDD size and 73.32% of the CPU time can be reduced within the same time frame. Furthermore, 2890.76% more states can be reached under the 600 000-s run-time limit.
Coordinating a supply chain for a newsvendor-type product with sales effort effects

In this paper, we investigate the issue of how to coordinate a supply chain for a newsvendor-type product where demand is sensitive to both retail price and sales effort. Most related studies have shown that many of the well-known “channel coordination” contracts will fail in such a with-effort supply chain. To remedy this situation, we propose a continuous “volume discount” schedule which not only can perfectly coordinate this with-effort channel, but also enables the dominant manufacturer to arbitrarily allocate the channel profit and leave only a subsistence profit for the retailer.
A DWT-based lossless intra coding scheme for HEVC

To improve the intra lossless video coding efficiency by introducing frequency domain compression, this paper presents a new intra coding scheme for lossless mode in HEVC. The proposed method utilizes reversible lifting DWT and DC level shifting to transform one frame into four sub-bands of frequency coefficients for the original coding tools to process. To recover the transformed frequency coefficients of signed type loss-lessly, a modified reconstruction are applied to HEVC. By implementing the method in HM-16.5 reference software, the experimental results show that compared with the original HEVC lossless intra coding, the new scheme can achieve 7.122% bitrate saving and take 92.443% encoding time averagely.
ICAS: An inter-VM IDS Log Cloud Analysis System

Cloud computing can reduce mainframe management costs, so more and more users choose to build their own cloud hosting environment. In cloud computing, all the commands through the network connection, therefore, information security is particularly important. In this paper, we will explore the types of intrusion detection systems, and integration of these types, provided an effective and output reports, so system administrators can understand the attacks and damage quickly. With the popularity of cloud computing, intrusion detection system log files are also increasing rapidly, the effect is limited and inefficient by using the conventional analysis system. In this paper, we use Hadoop's MapReduce algorithm analysis of intrusion detection System log files, the experimental results also confirmed that the calculation speed can be increased by about 89%. For the system administrator, IDS Log Cloud Analysis System (called ICAS) can provide fast and high reliability of the system.
A new fuzzy fingerprint vault using multivariable linear function based on Lorenz Chaotic System

Biometric cryptosystem has emerged as a promising technique in information security. Fuzzy vault is a widely used scheme binding biometric data and cryptography effectively. However, there are some drawbacks in the existing fuzzy vault scheme. The number of matching-minutiae is determined by the length of the key, and time complexity in coefficient reconstruction is high. To resolve these problems, firstly, we proposed a new fuzzy fingerprint vault scheme, in which the number of variables is determined by the required number of matching-minutiae. Then, fingerprint minutiae are used as the seed of Lorenz Chaotic System to obtain a set of random data. A new key deprived from the random data is bound with the key in cryptographic. Last, the bound data is protected by the chaff points, which is also generated by the Lorenz Chaotic System. The experimental results of the proposed scheme are encouraging.
A compact estimation of distribution algorithm for solving hybrid flow-shop scheduling problem

According to the characteristics of the hybrid flow-shop scheduling problem (HFSP), the permutation based encoding and decoding schemes are designed and a probability model for describing the distribution of the solution space is built to propose a compact estimation of distribution algorithm (cEDA) in this paper. The algorithm uses only two individuals by sampling based on the probability model and updates the parameters of the probability model with the selected individual. The cEDA is efficient and easy to implement due to its low complexity and comparatively few parameters. Simulation results based on some widely-used instances and comparisons with some existing algorithms demonstrate the effectiveness and efficiency of the proposed compact estimation of distribution algorithm. The influence of the key parameter on the performance is investigated as well.
Integrating Service Composition Flow with User Interactions

Web service technologies are best exploited by composing services, and BPEL (Web Services Business Process Execution Language) is adopted industrial-wide as the defacto service composition standard. However, BPEL is applied mainly in the design of composite services and fully automated processes, and user interaction, that should be included in service delivery, but presently is not included in the BPEL standard. To integrate the composite service flow with user interactions, in this work we propose a framework to extend BPEL to new activities that describe user involvement and user interfaces. An enhanced BPEL engine with a UI rendering engine was accordingly developed.
A wind farm configuration for load-following control and its application to primary frequency support

As penetration of wind energy goes high, many relevant issues have been dealt with. Among them, a novel active power control strategy named load-following has been investigated recently. While the conventional way is to extract energy from wind as much as possible, the load-following mode allows wind-turbine generator (WTG) to work away from the maximum power extraction. Although part of wind energy is sacrificed, it is meaningful in some islanded micro-grid case where the energy should be limited to meet the local load demand. This paper continues to investigate a possible method to realize a better load-following feature of WTG. The problems it encounters with WTG inertia are analyzed and solved with the Speed-Up/Down Averaging (SUDA) method. A configuration for wind farm with improved load-following is then proposed. Based on this improved feature, an important application in terms of primary frequency support is investigated.
On reconfigurable Single-Electron Transistor arrays synthesis using reordering techniques

Power consumption has become one of the primary challenges in meeting Moore's law. Fortunately, Single-Electron Transistor (SET) at room temperature has been demonstrated as a promising device for extending Moore's law due to its ultra low power consumption during operation. An automated mapping approach for the SET architecture has been proposed recently for facilitating design realization. In this paper, we propose an enhanced approach consisting of variable reordering, product term reordering, and mapping constraint relaxation techniques to minimizing the area of mapped SET arrays. The experimental results show that our enhanced approach, on average, saves 40% in area and 17% in mapping time compared to the state-of-the-art approach for a set of MCNC and IWLS 2005 benchmarks.
On Synthesizing Memristor-Based Logic Circuits With Minimal Operational Pulses

Memristor, which is a two-terminal nanodevice, widely used in various fields, e.g., machine learning and neuromorphic systems, has attracted much attention these years. Memristor can also be used to realize an implication logic gate and thus logic circuits. However, the fanouts in a memristor-based logic circuit have some constraints and need to be processed with special care. On the other hand, in addition to the number of memristors, the number of operational pulses is another metric to measure the quality of a memristor-based logic circuit. Hence, in this paper, we propose a synthesis algorithm to deal with the fanout problems in memristor-based logic circuits using implication logic gates for having a minimal number of operational pulses. We conducted experiments on a set of MCNC benchmarks. The experimental results show that the proposed algorithm can reduce 29% operational pulses and 36% memristor count on average compared with the state-of-the-art.
Particle Swarm Optimisation Aided Minimum Bit Error Rate Multiuser Transmission

We consider the downlink of multiuser system from a transmitter equipped with multiple antennas to multiple non-cooperative single-antenna mobile receivers. Particle swarm optimisation (PSO) algorithm is invoked to solve the constrained nonlinear optimisation problem for the minimum bit error rate (MBER) multiuser transmission (MUT). The proposed PSO aided MBER-MUT scheme provides much better performance over the conventional minimum mean-square-error MUT scheme, and it achieves a much lower complexity compared to the state-of-the-art sequential quadratic programming based MBER MUT.
Edge measurements during Alfven wave heating and current drive on the Phaedrus-T tokamak

The properties of tokamak boundary plasmas play an important role in the success of using waves in the ion cyclotron range of frequency for heating and current drive. Edge measurements have been conducted on the Phaedrus-T tokamak under a variety of operating conditions to study the relevant processes in coupling Alfven wave power to plasma and the effects of Alfven waves on the plasma boundary. With the adjustment of gas puffing, the line density during rf can be successfully controlled and kept at the same constant level as ohmic on the Phaedrus-T tokamak. The edge density is then found to have no significant change with the application of Alfven waves. Edge electron temperature, however, is found to increase with increasing rf power and the rise time is much shorter than the energy confinement time, which indicates direct power deposition in the boundary of the plasma. Some data suggest less edge heating corresponds to better rf power coupling to the bulk plasma. Edge electrostatic fluctuation measurements show increases in the fluctuation induced particle flux and heat flux during rf, indicating a degradation of particle and energy confinement time by the Alfven waves. The effects of rf phasing will also be discussed.
Optimal Design on FIR Digital Filters Using the Parallel Algorithm of Neural Networks

This paper introduces in detail the optimal design approach of high-order FIR digital filter and differentiator using the algorithm of neural networks. The main idea is to minimize the sum of the square errors between the amplitude response of the ideal FIR digital filter or digital differentiator and that of the designed by training the weight vector of neural networks, then obtaining the impulse response of FIR digital filter or differentiator. The convergence theorem of the neural-network algorithm is presented and proved, and the optimal design approach is introduced by examples of high-order FIR digital filter and digital differentiator. The results show that the high-order FIR digital filter or digital differentiator designed by training the weights of neural networks has a very high precision and very fast convergence speed, and initial weights are stochastic. Therefore, the presented optimum design method in the paper is significantly effective
Planar Bulk MOSFETs With Self-Aligned Pocket Well to Improve Short-Channel Effects and Enhance Device Performance

We present and demonstrate a self-aligned pocket well (SPW) structure used in planar bulk MOSFETs with a metal gate length of 25 nm and an effective channel length less than 20 nm. The SPW features a retrograde doping profile in vertical direction and a doping profile self-aligned with drain/extension in lateral direction. A novel process, called replacement spacer gate (RSG), is designed to avoid challenges in gate patterning and high-k metal gate filling. Planar bulk pMOSFETs, with SPW and halo doping, respectively, were simulated and fabricated adopting the RSG process. Due to its retrograde feature, the SPW can achieve low drain-induced barrier lowering (DIBL) along with low VT. Compared with halo doping with the same VT,sat at VDD = 0.8 V, despite no ION enhancement, the SPW reduces DIBL by 45% and enhances IEFF by 18%. Compared with halo doping with the same IOFF = 100 nA/μm at VDD = 0.8 V, the SPW structure reduces DIBL by 16%, enhances ION by 5%, and improves IEFF by 30%. In addition, with the self-aligned feature, the SPW does not deteriorate junction band-to-band tunneling (BTBT)
A Multiple Rendezvous Multichannel MAC Protocol for Underwater Sensor Networks

Compared with traditional terrestrial radio transmissions in Wireless Sensor Networks (WSNs), the challenges of transmissions in UnderWater Sensor Networks (UWSNs) include lower transmission rate, longer delay time, and higher power consumption. In such a circumstance, the negative effects of transmission collisions deteriorate. Most of the existing UWSN MAC protocols handle the collision problem in a single hop or light-loaded environment. They fail to function effectively in a multi-hop network consisting of more sensor nodes with heavier traffic loads. In this paper, using the concept of cyclic quorum systems, we propose a distributed multiple rendezvous multichannel MAC protocol, MM-MAC, to reduce collision probability. The advantages of the proposed protocol are threefold: 1) Only one modem is needed for each node to solve the missing receiver problem which is often encountered in multichannel protocols. 2) Multiple sensor node pairs can complete their channel negotiations on different channels simultaneously. 3) Data packets will not be collided by control packets, and vice versa. Simulation results verify that our protocol can reduce collision probability significantly which enhances the network performance in a multi-hop UWSN.
Delivery of telematics services using OSGi and mobile agents

Delivering distributed telematics services has gained increasing attention in mobile computing and advanced traveler information fields. In this paper, to design and implement telematics applications, OSGi technology is exploited to support interoperability of various telematics services. Moreover, we propose a mobile agent approach to enabling the delivery of distributed OSGi services, which can gain better performance when applying it to mobile devices with limited resources and unstable connections. An application of telematics services, which assists drivers in reporting accident events when accident occurs and warns them of traffic accidents or jams on their planned routes is developed. In this application, OSGi is adopted as a service platform to manage services provided by diverse devices, while mobile agents are employed to migrate across multiple devices to access required services.