Search

Although every educational institution has a code of academic honesty, they still encounter incidents of plagiarism. These are difficult and time-consuming to detect and deal with. This paper explores the use of personalized assessments with the goal of reducing incidents of plagiarism, proposing a personalized assessment software framework through which each student receives a unique problem set. The framework not only auto-generates the problem set but also auto-marks the solutions when submitted. The experience of using this framework is discussed, from the perspective of both students and staff, particularly with respect to its ability to mitigate plagiarism. A comparison of personalized and traditional assignments in the same class confirms that the former had far fewer observed plagiarism incidents. Although personalized assessment may not be cost-effective in all courses (such as language courses), it still can be effective in areas such as mathematics, engineering, science, and computing. This paper concludes that personalized assessment is a promising approach to counter plagiarism. [ABSTRACT FROM PUBLISHER]

The read channel of a Flash memory cell degrades after repetitive program and erase (P/E) operations. This degradation is often modeled as a function of the number of P/E cycles. In contrast, this paper models the degradation as a function of the cumulative effect of the charge written and erased from the cell. Based on this modeling approach, this paper dynamically allocates voltage using lower voltage write thresholds at the beginning of the device lifetime and increasing the thresholds as needed to maintain the mutual information of the read channel in the face of degradation. This paper introduces the technique in an idealized setting and then removes ideal assumptions about channel knowledge and available voltage resolution to conclude with a practical scheme with performance close to that of the idealized setting. [ABSTRACT FROM PUBLISHER]

In supply chain networks of large companies, how to determine the location for establishing distribution centers is an important strategic-level decision problem. This paper proposes a stochastic programming model to determine distribution centers’ locations as well as their scales. The objective of the model is to minimize the expected total transportation cost under uncertain demands of customers. An improved particle swarm optimization algorithm and a Lagrangean relaxation-based solution approach are proposed to solve the model. This paper also performs a case study on applying this model to the largest retailer in China. In addition, some numerical experiments are conducted to validate the effectiveness of the proposed model and the efficiency of the proposed solution methods. [ABSTRACT FROM AUTHOR]

Hardware non-idealities are among the main performance restrictions for upcoming wireless communication systems. Asymmetric hardware distortions (HWD) happen when the impairments of the I/Q branches are correlated or imbalanced, which in turn generate improper additive interference at the receiver side. When the interference is improper, as well as in other interference-limited scenarios, improper Gaussian signaling (IGS) has been shown to provide rate and/or power efficiency benefits. In this paper, we investigate the rate benefits of IGS in a two-user interference channel (IC) with additive asymmetric HWD when interference is treated as noise. We propose two iterative algorithms to optimize the parameters of the improper transmit signals. We first rewrite the rate region as an pseudo-signal-to-interference-plus-noise-ratio (PSINR) region and employ majorization minimization and fractional programming to find a suboptimal solution for the achievable user rates. Then, we propose a simplified algorithm based on a separate optimization of the powers and complementary variances of the users, which exhibits lower computational complexity. We show that IGS can improve the performance of the two-user IC with additive HWD. Our proposed algorithms outperform proper Gaussian signaling and competing IGS algorithms in the literature that do not consider asymmetric HWD. [ABSTRACT FROM AUTHOR]

In this paper, we propose a vertical transistor with n-bridge and body on gate (BOG-DRAM) for Low-power 1T-DRAM application. The vertical channel of the device can reduce the short-channel effect and improve scalability. The storage region stacked on the gate leads to the efficient utilization of storage space. The device with junctionless channel layers on three sides can improve writing time. The conventional current bridge device only has one side gatecontrol depletion region, but the proposed BOG-DRAM has triple-side gate-control depletion region which can improve programming window at shorter gate lengths. BOG-DRAM achieves programming window of 33.6 μA/μm when the storage length is 20 nm. In addition, the work function offset is exploited for low-power application. [ABSTRACT FROM AUTHOR]

This paper proposes a semi-analytical method to obtain the equilibrium bidding strategies for generation and demand units in a combined oligopoly and oligopsony wholesale electricity market. Such market structure is the outcome of the increasing deployment of demand response programs that facilitate active participation of demand-side players in the price-setting process. In this analysis, the concept of supply function equilibrium (SFE) is used to investigate the oligopolistic competition among generation units. The SFE model is extended and the demand function equilibrium (DFE) is obtained to study the oligopsonistic competition among demand units. The economic behavior of a market participant is formulated as a bi-level programming (BLP) problem. The imperfect competition among generation units, as well as among demand units, are modeled as a non-cooperative game. Next, a direct method is developed to calculate all candidate equilibriums of the market, and the locational marginal prices (LMPs) in terms of the bidding strategies of the market participants. The BLP problem is solved by obtaining the coordinated Pareto-dominant Nash equilibrium of the market participants’ non-cooperative games. Finally, the proposed analysis is examined in case studies. Accordingly, we report insightful observations with respect to the impact of the changes in the new market structure, at firm-level and market-level, such as in terms of mitigating market power of generation units, the market clearing prices and quantities, surplus for generation units and demand units, and potential impact on market efficiency. [ABSTRACT FROM AUTHOR]

This paper presents a multi-period active distribution network planning (ADNP) with distributed generation (DG). The objective of the proposed ADNP is to minimize the total planning cost, subject to both investment and operation constraints. The paper proposes a multi-stage stochastic optimization model to address DG uncertainties over several periods, in which the decisions are made sequentially by only using the present-stage information. A nested decomposition method is proposed which applies the stochastic dual dynamic integer programming (SDDIP) method to address computational intractabilities of the proposed ADNP approach. The presented numerical results and discussions on a 33-bus distribution system and a large-scale 906-bus system verify the effectiveness of the proposed ADNP method and its solution method. [ABSTRACT FROM AUTHOR]

As a challenging attempt to replace a traditional data structure with a learned model, this paper proposes a learned functional Bloom filter (L-FBF) for a key–value storage. The learned model in the proposed L-FBF learns the characteristics and the distribution of given data and classifies each input. It is shown through theoretical analysis that the L-FBF provides a lower search failure rate than a single FBF in the same memory size, while providing the same semantic guarantees. For model training, character-level neural networks are used with pretrained embeddings. In experiments, four types of different character-level neural networks are trained: a single gated recurrent unit (GRU), two GRUs, a single long short-term memory (LSTM), and a single one-dimensional convolutional neural network (1D-CNN). Experimental results prove the validity of theoretical results, and show that the L-FBF reduces the search failures by 82.8% to 83.9% when compared with a single FBF under the same amount of memory used. [ABSTRACT FROM AUTHOR]

This paper proposes a new reentry trajectory generation method, which mainly comprises two parts: reentry profile design and trajectory optimization. Different from conventional methods that design angle-of-attack (AOA) and bank-angle profiles, a height-range profile is proposed in this paper. Using this profile, the AOA can be directly derived and the quasi-equilibrium glide condition is easily satisfied. In addition, the bank angle is analytically derived with the heading error, with only one reversal. Finally, the original problem is transformed into a parameter optimization problem and solved by an improved particle swarm optimization (PSO) method. In PSO, a comparison principle is proposed to tackle constraints and three modifications are applied to the swarm evolution to enhance the searching capacity. To conquer disturbances, an online profile updating strategy is developed based on the nominal profile, so complicated work of designing a trajectory tracker is avoided. Simulation validates the effectiveness of the proposed method and demonstrates that the improved PSO is comparable to the pseudospectral method and is better than the basic PSO. [ABSTRACT FROM AUTHOR]

The rank modulation scheme has been proposed for efficient writing and storing data in nonvolatile memory storage. Error correction in the rank modulation scheme is done by considering permutation codes. In this paper, we consider codes in the set of all permutations on n elements, S_{n} , using the Kendall \tau -metric. The main goal of this paper is to derive new bounds on the size of such codes. For this purpose, we also consider perfect codes, diameter perfect codes, and the size of optimal anticodes in the Kendall \tau -metric, structures which have their own considerable interest. We prove that there are no perfect single-error-correcting codes in S_{n} , where n>4 is a prime or 4\leq n\leq 10 . We present lower bounds on the size of optimal anticodes with odd diameter. As a consequence, we obtain a new upper bound on the size of codes in S_{n} with even minimum Kendall \tau -distance. We present larger single-error-correcting codes than the known ones in S5 and S7 . [ABSTRACT FROM AUTHOR]

This paper is concerned with optimal mobile sensor motion coordination for source localization and tracking, taking into account of communication constraints. It is well known that this is a constrained nonlinear optimization problem. The usual way to solve this problem is to adopt a gradient like search algorithm or control strategy to obtain a local optimal solution. In this paper, we propose a novel method, which targets at a global solution for optimal mobile sensor placement in time-difference-of-arrival (TDOA) and hybrid TDOA/angle of arrival-based far-field source localization problems. In the proposed method, first, an analytic solution to optimal mobile sensor positions for source localization and tracking is derived. Then, control laws are designed to force mobile sensors to converge to the expected optimal positions. Simulation results demonstrate our proposed method. [ABSTRACT FROM AUTHOR]

Volt/VAr Optimization (VVO) is becoming increasingly crucial in distribution management systems with renewable sources that require setting their reactive power in coordination with legacy voltage and reactive power control devices. This paper presents a VVO method that operates in complex variables based on the Wirtinger calculus; it employs a penalty method that keeps voltage magnitudes and controller parameters within limits together with a probabilistic rounding technique for handling switched device variables. The complex variable implementation permits using the compensation technique when solving the Karush-Kuhn Tucker (KKT) system, thus achieving a significant speedup due to limiting the number of linear system factorizations. The proposed method is contrasted with a classical VVO implementation employing discrete coordinate search from the current operating point and an enhanced version that uses sensitivity information. Numerical results on distribution networks having up to 3147 nodes show that the proposed method is significantly faster than classical methods and gives operating points free of voltage magnitude violations and lower power loss. [ABSTRACT FROM AUTHOR]

Addressing non-convexity plays a fundamental role in solving the optimal electricity-gas flow models. In this paper, an improved spatial branch-and-bound algorithm is proposed to solve the non-convex problem, which is formulated as a mixed-integer bilinear programming, for its exact solution. The core of the algorithm is to divide the non-convex model into convex and small sub-models by branching on specific continuous variables, so that the non-convex problem can be equivalent to a rooted tree for exploration. The exactness of the algorithm is guaranteed by the same criterion as the classical branch-and-bound algorithm. To alleviate the computational burden, a novel two-stage spatial branching strategy is developed to improve the effectiveness and efficiency of the branching operations. The performance of the proposed algorithm is verified on two integrated electricity-gas systems with different sizes. Numerical results demonstrate that our method achieves a balance among feasibility, optimality, and efficiency. The comparison with another 6 convexification-based methods, 3 state-of-the-art non-convex optimization solvers, and 2 spatial branch-and-bound algorithms with classical branching rules further shows the superiority of our algorithm. [ABSTRACT FROM AUTHOR]

The proliferation of distributed energy resources (DERs), located at the Distribution System Operator (DSO) level, bring new opportunities as well as new challenges to the operations within the grid, specifically, when it comes to the interaction with the Transmission System Operator (TSO). To enable interoperability, while ensuring higher flexibility and cost-efficiency, DSOs and the TSO need to be efficiently coordinated. Difficulties behind creating such TSO-DSO coordination include the combinatorial nature of the operational planning problem involved at the transmission level as well as the nonlinearity of AC power flow within both systems. These considerations significantly increase the complexity even under the deterministic setting. In this paper, a deterministic TSO-DSO operational planning coordination problem is considered and a novel decomposition and coordination approach is developed. Within the new method, the problem is decomposed into TSO and DSO subproblems, which are efficiently coordinated by updating Lagrangian multipliers. The nonlinearities at the TSO level caused by AC power flow constraints are resolved through a dynamic linearization while guaranteeing feasibility through “ $l_1-$ proximal” terms. Numerical results based on the coordination of the 118-bus TSO system with up to 32 DSO 34-bus systems indicate that the method efficiently overcomes the computational difficulties of the problem. [ABSTRACT FROM AUTHOR]

It is hard to obtain precise wind power forecasting due to the chaotic nature of weather systems. Prediction intervals become an efficient tool to quantify the uncertainty involved in wind power forecasting. Traditional central prediction intervals are widely produced by forecasters, however, which might be conservative with respect to interval width and not well fit the practical conditions. This paper develops a novel adaptive bilevel programming (ABP) model, with extreme learning machine based quantile regression as the follower's problem and tuning hyperparameters of quantile proportions as the leader's problem. The proposed ABP model aims at minimizing the average interval width subject to well calibration. In order to overcome the difficulties in disposing of the intractable nested structure of bilevel programming, the ABP model is equivalently transformed into a single-level nonlinear programming problem with bilinear terms. An improved spatial branch-and-bound (ISBB) algorithm is proposed to efficiently solve the reformulated bilinear programming problem. In the ISBB algorithm, an innovative bounds tightening method is developed to tighten the convex relaxation of the bilinear constraint and enhance the convergence. Experimental studies based on actual wind farm of USA under four seasons show the significant effectiveness and high robustness of the developed ABP model, as well as the excellent global optimum attainment and convergence performance of the proposed ISBB algorithm. Moreover, the widely used traditional interval scores are first verified to be prejudiced in probabilistic wind power forecasting evaluation. [ABSTRACT FROM AUTHOR]

Multi-objective optimization of power converters is a time-consuming task, especially when multiple operating points and multiple converter topologies must be considered. As a result, various steps are often taken to simplify the design problem and restrict the size of the design space prior to going through an optimization procedure. While this saves time, it produces potentially sub-optimal designs, and existing approaches must tradeoff between running time and design optimality. This paper presents an optimization-oriented method for modeling power converters and their components as posynomial functions, allowing multi-objective optimization of converters to be formulated as a geometric program, a type of convex optimization problem. This allows the use of fast, powerful solvers that guarantee global optimality of solutions. The method is demonstrated using the example of low-power multi-level flying capacitor step-down converters. Results show that, using geometric programming, sets of globally Pareto-optimal designs of two-, three-, and four-level converters with respect to efficiency and power density, for one design space and one operating point, can be generated in as little as 25 s, on a mid- to upper range laptop computer. Thus, optimal designs for three different converter topologies for hundreds of different operating points and/or design spaces can be generated in several hours—less than the time required to globally optimize one converter topology at one operating point for one design space using currently prevalent methods. This paper also demonstrates how geometric programming can be used to quickly perform sensitivity and tradeoff analysis of optimal converter designs. [ABSTRACT FROM AUTHOR]

This paper reviews what changed in the reliability of NAND Flash memory arrays after the paradigm shift in technology evolution determined by the transition from 2-D to 3-D integration schemes. Starting from a quick glance at the fundamentals of raw array reliability, the reasons for its worsening with the evolution of 2-D technologies will be discussed, focusing on the physical phenomena which contributed more to that outcome. By exploring the dependence of the magnitude of these phenomena on cell and array parameters, the abrupt improvements achieved from the 3-D transition in terms of raw array reliability will then be explained, highlighting also that these improvements were turned into new opportunities for the technology. Finally, the physical issues specific to 3-D arrays will be addressed, providing a glimpse of the challenges that the NAND Flash technology will have to face from the standpoint of array reliability in the near future. [ABSTRACT FROM AUTHOR]

This paper proposes a probabilistic optimal power flow (POPF) for unbalanced three-phase electrical distribution systems considering robust constraints. Wind velocity, solar irradiation, and demands are considered as exogenous random variables with dissimilar probability distribution functions. The proposed two-stage POPF model determines the optimal generation dispatch that minimizes the average production cost while satisfying probabilistically robust constraints. The robustness of the solution is adjusted through a parameter involving the first two moments of the random state variables. The $2m+1$ point estimate method (PEM) provides the scenarios for the proposed POPF model, which can be solved using commercial solvers. The model's accuracy is evaluated by comparing the results obtained with the PEM and with a classical scenario generator technique. The model is validated through two IEEE distribution feeders with 13 and 123 nodes, comprising dispatchable and renewable generation. Results show that the model can accurately estimate the mean and standard deviation of the state random variables when compared with results obtained through Monte Carlo simulations. Various levels of conservatism are assessed, demonstrating the model's flexibility and applicability. [ABSTRACT FROM AUTHOR]

Most of the existing caching solutions for wireless networks rest on the ideal assumption that the file popularity distribution is perfectly known. In this paper, we consider optimal random caching designs for perfect, imperfect, and unknown file popularity distributions in a large-scale multi-tier wireless network. First, in the case of perfect file popularity distribution, we formulate the successful transmission probability (STP) optimization problem, which is nonconvex. We propose an efficient parallel iterative algorithm to obtain a stationary point based on parallel successive convex approximation (SCA). Then, in the case of imperfect file popularity distribution, we formulate the worst-case STP maximization problem. To solve this challenging robust optimization problem, we transform it into an equivalent complementary geometric programming (CGP) and propose an efficient iterative algorithm to obtain a stationary point based on the SCA. To the best of our knowledge, this is the first work explicitly considering the estimation error of file popularity distribution in the optimization of caching design. Next, in the case of unknown file popularity distribution, we formulate the stochastic STP (i.e., the STP in the stochastic form) maximization problem. This is a challenging nonconvex stochastic optimization problem, and we propose an efficient iterative algorithm to obtain a stationary point based on stochastic parallel SCA. As far as we know, this is the first work considering stochastic optimization in a large-scale wireless network. Finally, by numerical results, we show that the proposed solutions achieve notable gains over existing schemes in all three cases and reveal the values of the robust caching optimization and stochastic caching optimization in the cases of imperfect file popularity distribution and unknown file popularity distribution, respectively. [ABSTRACT FROM AUTHOR]

Signal to interference plus noise ratio (SINR) is an important index for wireless communications. This paper shows a method to derive spreading sequences utilized in code division multiple access systems as the solutions of the non-linear programming: maximize SINR. To this end, we consider a frequency-selective wide-sense-stationary uncorrelated-scattering channel and obtain the worst case of SINR. In the course of the evaluation, we derive an expression of SINR, whose main terms consist of periodic correlation terms and odd periodic correlation terms. Also, we show a relation between SINR and mean square correlations. With our expression, we obtain the problem: maximize SINR. Since this problem is not convex, we obtain the relaxed problem with a semidefinite relaxation technique. From this relaxed problem, we obtain the approximated solutions and evaluate the bit error rate for the solutions. [ABSTRACT FROM AUTHOR]

In this paper, we study a model that mimics the programming operation of memory cells. This model was first introduced by Lastras-Montano et al. for continuous-alphabet channels, and later by Bunte and Lapidoth for discrete memoryless channels (DMC). Under this paradigm we assume that cells are programmed sequentially and individually. The programming process is modeled as transmission over a channel, such that it is possible to read the cell state in order to determine its programming success, and in case of programming failure, to reprogram the cell again. Reprogramming a cell can reduce the bit error rate, however this comes with the price of increasing the overall programming time and thereby affecting the writing speed of the memory. An iterative programming scheme is an algorithm which specifies the number of attempts to program each cell. Given the programming channel and constraints on the average and maximum number of attempts to program a cell, we study programming schemes which maximize the number of bits that can be reliably stored in the memory. We extend the results by Bunte and Lapidoth and study this problem when the programming channel is either discrete-input memoryless symmetric channel (including the BSC,BEC, BI-AWGN) or the $Z$ channel. For the BSC and the BEC our analysis is also extended for the case where the error probabilities on consecutive writes are not necessarily the same. Lastly, we also study a related model which is motivated by the synthesis process of DNA molecules. [ABSTRACT FROM AUTHOR]

Thanks to the strong ability against the inter-cell interference, cell-free network is considered as a promising technique to improve network capacity. However, further capacity improvement requires to deploy more base stations (BSs) with high cost and power consumption. To address this issue, inspired by the recently developed reconfigurable intelligent surface (RIS) technique, we propose the concept of RIS-aided cell-free network to improve the capacity with low cost and power consumption. The key idea is to replace some of the required BSs by low-cost and energy-efficient RISs. Then, in a wideband RIS-aided cell-free network, we formulate the problem of joint precoding design at BSs and RISs to maximize the network capacity. Due to the non-convexity and high complexity of the formulated problem, we develop an alternating optimization framework to solve this challenging problem. In particular, we decouple this problem via fractional programming, and solve the subproblems alternatively. Note that most of the scenarios considered in existing works are special cases of the general scenario studied in this paper, and the proposed joint precoding framework can serve as a general solution to maximize the capacity in most existing RIS-aided scenarios. Finally, simulation results demonstrate that, compared with the conventional cell-free network, the network capacity under the proposed scheme can be improved significantly. [ABSTRACT FROM AUTHOR]

This paper is concerned with the problem of Security-Constrained Unit Commitment (SCUC) which is a long-standing challenge in power system engineering faced by system operators and utility companies on a daily basis. We consider a detailed variant of this problem that suffers from complexities posed by the presence of binary variables, the uncertainty of renewable sources and security constraints. A convex relaxation is formulated which is capable of finding feasible solutions within a provable distance from global optimality. We demonstrate the performance of this approach on detailed and challenging instances of SCUC with IEEE and PEGASE benchmark cases from Matpower. The proposed approach is able to handle over 12,000 binary variables and 2 million continuous variables with significant improvement in solution quality over commonly-used off-the-shelf solvers and other methods of convex relaxation. [ABSTRACT FROM AUTHOR]

Conventionally, power flow equations are used for distribution systems (DS) analysis to find the nodal voltages. For the particular form of the DS reconfiguration problem, however, a direct formulation in terms of branch flows allows a substantial increase in solution efficiency from an optimization point of view. In this paper, a set of linear current flow (LCF) equations are derived for DS. This formulation is then used within the network reconfiguration problem for loss minimization. A mixed-integer quadratically constrained programming (MIQCP) formulation, together with a mixed-integer linear programming (MILP) formulation, are proposed in this paper and assessed through simulations. In these comparisons, the MILP formulation shows computational advantages over the MIQCP version and the preceding literature. The proposed methods are evaluated on several test systems. [ABSTRACT FROM PUBLISHER]

Due to uncertainties in generation and load, optimal decision making in electrical energy markets is a complicated and challenging task. Participating agents in the market have to estimate optimal bidding strategies based on incomplete public information and private assessment of the future state of the market, to maximize their expected profit at different time scales. In this paper, we present an agent-based model to address the problem of short-term strategic bidding of conventional generation companies (GenCos) in a power pool. Based on the proposed model, each GenCo agent develops a private probabilistic model of the market (using dynamic Bayesian networks), employs an online learning algorithm to train the model (sparse Bayesian learning), and infers the future state of the market to estimate the optimal bidding function. We show that by using this multiagent framework, the agents will be able to predict and adapt to approximate Nash equilibrium of the market through time using local reasoning and incomplete publicly available data. The model is implemented in MATLAB and is tested on four test case systems: two generic systems with 5 and 15 GenCo agents, and two IEEE benchmarks (9-bus and 30-bus systems). Both the day-ahead (DA) and hour-ahead (HA) bidding schemes are implemented. The results show a drop in market power in the 15-agent system compared to 5-agent system, along with a Pareto superior equilibrium in the HA scheme compared to the DA scheme, which corroborates the validity of the proposed decision making model. Also, the simulations show that introduction of an HA decision making stage as an uncertainty containment tool, leads to a more stable and less volatile price signal in the market, which consequently results in flatter and improved profit curves for the GenCos. [ABSTRACT FROM PUBLISHER]

Operational performance in the low-voltage distribution network (LVDN) can be undermined by its inherent unbalances, which may become worse as the penetration of rooftop solar continuously increases. To address this issue, load balancing via phase-reconfiguration devices (PRDs), which can change phase positions of residential customers as required, provides a cost-efficient option. However, most reported approaches to control PRDs require that demands of all residential customers are available, which are not viable for many LVDNs without smart meters or advanced metering infrastructure (AMI) installed. To bridging the gap in this field, this paper proposes a novel method to control PRDs purely based on measurable data from PRDs, and its controller. Based on limited information, sensitivity analysis in the network with PRDs is studied, followed by the optimization model that comprehensively considers operational requirements in the network. Moreover, slack variables are introduced to the model, and penalized in the objective function to assure either a strategy that is secure or with minimized violations can always be provided. The model is a challenging mixed-integer non-convex programming (MINCP) problem, which is reformulated as an efficient solvable mixed-integer second-order cone programming (MISOCP) based on exact reformulations or accurate linear approximations. Simulations based on two modified IEEE systems, and a real system in Australia demonstrate that an efficient strategy can be provided to mitigate unbalances in the network. [ABSTRACT FROM AUTHOR]

Tensor Cores have been an important unit to accelerate Fused Matrix Multiplication Accumulation (MMA) in all NVIDIA GPUs since Volta Architecture. To program Tensor Cores, users have to use either legacy wmma APIs or current mma APIs. Legacy wmma APIs are more easy-to-use but can only exploit limited features and power of Tensor Cores. Specifically, wmma APIs support fewer operand shapes and can not leverage the new sparse matrix multiplication feature of the newest Ampere Tensor Cores. However, the performance of current programming interface has not been well explored. Furthermore, the computation numeric behaviors of low-precision floating points (TF32, BF16, and FP16) supported by the newest Ampere Tensor Cores are also mysterious. In this paper, we explore the throughput and latency of current programming APIs. We also intuitively study the numeric behaviors of Tensor Cores MMA and profile the intermediate operations including multiplication, addition of inner product, and accumulation. All codes used in this work can be found in https://github.com/sunlex0717/DissectingTensorCores. [ABSTRACT FROM AUTHOR]

Nonlinear unmixing algorithms are playing a key role in modern earth observation analysis thanks to their ability to characterize complex phenomena occurring in the instantaneous field of view. When unmixing hyperspectral images according to nonlinear mixture models by means of state-of-the-art methods, actual abundances of the elements in the scene can be only indirectly estimated. Thus, the reliability of the investigation can be dramatically jeopardized, hence degrading the accuracy of the characterization of the surface composition. In order to overcome this issue, we propose in this paper a nonlinear programming scheme that aims at providing direct estimation of the end members fractions. The method we introduce is based on a structural optimization approach where the abundances are directly assessed, so that no epistemic uncertainties are injected in the framework. Experimental results show that the proposed method is able to deliver accurate and reliable estimates of these quantities in hyperspectral images. [ABSTRACT FROM AUTHOR]

In this paper, we study the acceleration of applications that identify all the occurrences of thousands of string-patterns in an input data-stream using the Automata Processor (AP). For this evaluation, we use two applications from two fields, namely, cybersecurity and bioinformatics. The first application, called Fast-SNAP, scans network data for 4312 signatures of intrusion derived from the popular open-source Snort database. Using the resources of a single AP-board, Fast-SNAP can scan for all these signatures at 1 Gbps. The second application, called PROTOMATA, looks for all the occurrences of 1,309 motifs from the PROSITE database in protein sequences. PROTOMATA is up to 68 times faster than the state-of-the-art CPU implementation. As a comparison, we emulate the execution of the same NFAs by programming FPGAs using state-of-the-art techniques. We find that the performance derived by using the resources of a single AP-board, which houses 32 AP-chips, is comparable to that of the resources of five to six large FPGAs. The design techniques used in this paper are generic and may be applicable to the development of similar applications on the AP. [ABSTRACT FROM AUTHOR]

Local rank modulation (LRM) scheme was suggested for representing the information in flash memories in order to overcome the drawbacks of rank modulation. For $0 < s\leq t\leq n$ with $s$ dividing $n$ , an $(s,t,n)$ -LRM scheme is a LRM scheme where the $n$ cells are locally viewed cyclically through a sliding window of size $t$ resulting in a sequence of small permutations, which requires less comparisons and less distinct values. The gap between two such windows equals to $s$. In this paper, encoding, decoding, and asymptotic enumeration of the $(1,t,n)$ -LRM scheme are studied. [ABSTRACT FROM AUTHOR]

A grid-tied microgrid (MG) with a battery energy storage system (BESS) is studied in this paper. The energy storage efficiencies of the BESS are considered to optimize the operational cost of the MG. Two quadratic functions are verified and utilized to formulate the efficiencies of BESS in both charge and discharge process. Afterward, constraints of MG power scheme are investigated based on aforementioned equations. Furthermore, the 24-h ahead forecasting data of photovoltaic (PV) generation and loads demand are also utilized during MG modeling. To minimize the operational electricity cost of the MG in the next 24 h, a nonlinear programming with discontinuous derivatives solver is applied based on the proposed constraints. Additionally, to balance the power flow of MG and reduce the effects of the forecasting error of PV generation, a two steps MG management strategy is therefore developed based on the scheduled power. Experiments are conducted to verify the relationship between battery energy storage efficiency and charging/discharging current of the lithium-ion battery. Moreover, the proposed energy management strategy is validated by the hardware-in-the-loop experiments for real-time MG operation. [ABSTRACT FROM AUTHOR]

This paper presents, DeepTrain, an embedded platform for high-performance and energy-efficient training of deep neural network (DNN). The key architectural concept of DeepTrain is to develop a spatially homogeneous computing (and memory) fabric with temporally heterogeneous programmable data flows to optimize memory mapping and data reuse during different phases of training operation.The DeepTrain is demonstrated as an in-memory accelerator integrated in the logic layer of a 3-D memory module. A programming model and supporting architecture utilizes the flexible data flow to efficiently accelerate training of various types of DNNs. The cycle level simulation and synthesized design in 15 nm FinFET shows power efficiency of 500 GFLOPS/W, and almost similar throughput for a wide range of DNNs, including convolutional, recurrent, and mixed (CNN+RNN) networks. [ABSTRACT FROM AUTHOR]

The future Internet of Things (IoT) is expected to enable a new and wide range of decentralized systems (from small-scale smart homes to large-scale smart cities) in which “things” are able to sense/actuate, compute, and communicate, and thus play a central and crucial role. The growing importance of such novel networked cyber-physical context demands suitable and effective computing paradigms to fulfill the various requirements of IoT systems engineering. In this paper, we propose to explore an agent-based computing paradigm to support IoT systems analysis, design, and implementation. The synergic meeting of agents with IoT makes it possible to develop smart and dynamic IoT systems of diverse scales. Our agent-oriented approach is specifically based on the agent-based cooperating smart object (ACOSO) methodology and on the related ACOSO middleware: they provide effective agent design and programming models along with efficient tools for the actual construction of an IoT system in terms of a multiagent system. A case study concerning the development of a complex IoT system, namely a Smart University Campus, is described to show the effectiveness and efficiency of the proposed approach. [ABSTRACT FROM AUTHOR]

This paper presents a two-stage stochastic programming model with recourse for integrating the design and sequential preventive maintenance schedule of a system, which is subject to uncertain aperiodic-changing future usage stresses. Specifically, the usage stresses change as the system operates and preventive maintenance is conducted. The system undergoes imperfect repair according to the sequential preventive maintenance policy and minimal repair in response to emergency failures. The system is replaced when the maintenance is uneconomical due to the deterioration of the components. Under such future usage stresses and maintenance, this paper formulates the failure rates and lifetime distributions of components and the system, the failure rates increase with the usage stresses, and both the failure rates and usage stresses have an instantaneous incremental decrease at each preventive maintenance action. In the two-stage stochastic optimization model, the first-stage decision variables are the numbers of components to be used in the subsystems, and these variables affect the second-stage variables, which define the number of imperfect preventive maintenance actions before the replacement of the system and the aperiodic preventive maintenance time intervals for various future usage scenarios. Analytical properties about the failure rates of components and subsystems and the solution for minimizing expected system maintenance cost rate are derived. A decomposition method for solving the proposed two-stage stochastic model is designed based on the analytical results. Numerical examples and sensitivity analysis are provided for deep understanding of the proposed method. [ABSTRACT FROM AUTHOR]

The precise fluid and gas energy flow equations (FEFEs) are difficult to formulate due to the uncertain parameters. This paper proposes a data-driven approach to fit the FEFEs by polynomial functions through experimental data. Furthermore, a convex optimization model is set up to find the solution of the FEFEs, and a tight reformulation is proposed to exactly reformulate the proposed model as a second-order cone programming (SOCP) that can be tractably solved. Numerical results on several test systems show the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Aggressive scaling in integrated circuits creates new challenges such as an increase in power density, temperature, and especially process variation in designing Multiprocessor Systems-on-Chip (MPSoC). While most of the previous works attempt to mitigate the process variation effects at the system level, the eventual design still suffers from the variability of frequency and leakage power. In this paper, we propose a method called Stereo that combines stochastic and decomposition to solve task assignment and scheduling under process variation in MPSoCs. In our previous work, we formulated a Mixed Integer Linear Programming (MILP) problem for variation-aware task assignment and scheduling to optimize energy consumption while meeting the real-time constraints. To capture the stochastic behavior of process variation, we employed a chance-constrained programming technique to turn the problem into a corresponding stochastic optimization that can be solved by typical ILP solvers. However, it had a scalability problem. To address this issue, in this work, we leverage a Logic-based Benders Decomposition (LBD) approach to improve the running time for finding an optimal solution of assignments and schedulings under process variation phenomenon). We carried out extensive experiments using Embedded System Synthesis Benchmarks Suite (E3S). The experimental results of the Stereo method evince considerable improvements compared to the baseline method in terms of performance-yield and run-time. The Stereo-based MILP method ameliorates performance-yield up to 2× and run-time by 532×. Moreover, for manifold applications, the Stereo-based LBD method archives 3.47×-91.49× run-time improvement compared to the Stereo-based MILP approach and is capable of assigning and scheduling of more than 50 tasks on 9 processors. [ABSTRACT FROM AUTHOR]

This paper presents a reliability-aware metadata allocation strategy called scatter-single-level cell (SLC) for multiple-level cell (MLC) NAND flash memory storage systems. In scatter-SLC, metadata is kept in least significant bit (LSB) pages and corresponding most significant bit (MSB) pages are bypassed. Without partitioning SLC and MLC blocks, scatter-SLC can eliminate the unbalanced lifetime between SLC and MLC blocks while achieving the similar error rate as the method to store metadata in SLC blocks. We implemented scatter-SLC on a real-hardware platform. The experiment results show that scatter-SLC can reduce uncorrectable page errors by 93.54% while incurring less than 1% time overhead on average compared with the previous work. [ABSTRACT FROM AUTHOR]

This paper studies an integrated optimization problem on production and procurement for a manufacturer who faces stochastic demands of multiple products made by multiple components. This paper first proposes a deterministic model for the problem when the demands of products are known. Then the model is extended to the case of uncertain demands. A stochastic programming model and a robust optimization model are proposed to handle the production and procurement decisions under uncertain demands. The stochastic programming model can cope with arbitrary probability distributions of products’ random demands; while the robust optimization model applies to situations in which limited information about probability distributions is available. Some numerical experiments are performed to investigate the efficiency of the proposed models. We also compare the above two models and evaluate the potential benefits in practice. [ABSTRACT FROM PUBLISHER]

This paper proposes a bi-level branch-and-bound ((B&B) method to solve the economic dispatch problem with prohibited zones and network losses. The approach employs binary variables for each prohibited zone and utilizes the B-coefficient for network losses, which can be transformed into a mixed-integer quadratically constrained quadratic programming (MIQCQP), where linear relaxation technique is applied on each bilinear term. Due to the complexity in solving the MIQCQP problem, this paper proposes a bi-level B&B method to achieve global optimum. A spatial B&B method is utilized in the higher level to solve the quadratically constrained quadratic programming (QCQP) problem, whereas a simple B&B method is employed in the lower level to solve a mixed-integer quadratic programming (MIQP) problem. The bi-level B&B algorithm that combines spatial and simple B&B methods is actually a deterministic optimization method and can produce global optimal solutions. Numerical results on 6-unit, 15-unit, and 40-unit test systems show that the bi-level B&B method can solve the MIQCQP problem with superior solution quality and convergence characteristics. [ABSTRACT FROM PUBLISHER]

In this paper, we discuss three different design criteria for a distributed antenna system (DAS). They include maximizing throughput under the constraint of the overall transmit power, minimizing the overall transmit power while guaranteeing the minimum spectral efficiency (SE) requirements, and maximizing energy efficiency (EE) under the constraints of minimum SE requirements and overall transmit power. The optimization problems for the first two criteria are signomial programming (SP) problems when considering the interference among the mobile stations (MSs), which are nonlinear nonconvex and do not lead to the closed-form solutions directly. Exploiting the nature of geometric mean, we transform the SP problems into geometric programming (GP) problems, which can be solved by turning them into convex problems. For the third criterion, using the theorem of fractional programming, we first transform the fractional optimization problem into an equivalent optimization problem in a subtractive form, which is an SP problem. We then obtain its solution by transforming the SP to the GP problem as we have done for the previous two problems. Based on these design criteria, three power allocation algorithms are developed for the downlink multiuser DAS. Depending on the application environments, we can use the first and second criteria to achieve the highest throughput and to save energy, respectively, while balancing throughput and energy consumption using the third criterion. [ABSTRACT FROM AUTHOR]

Joule heating in phase change memory (PCM) controls programming characteristics, read disturb, and programming disturb. To optimize the energy consumption and reliability of PCM, a thorough understanding of Joule heating as a function of the electrical operation of the device is thus strongly required. This paper presents a comprehensive characterization of thermoelectric (TE) effects in PCM operated at positive and negative voltage polarity. The impact of polarity was studied for all major temperature-dependent properties of the PCM device, namely, melting, crystallization, ion migration, threshold switching, and holding. It was demonstrated that heating is less efficient under negative voltage, compared with positive voltage. It was also shown that the positive and negative voltages needed to induce all above phenomena display a universal correlation. We propose a unified finite-element model for the PCM, which correctly accounts for the observed polarity-dependent heating and the universal voltage characteristics. The impact of isotropic scaling on TE is finally addressed. [ABSTRACT FROM PUBLISHER]

In this paper, we consider an approximate weighted least squares (AWLS) estimate for the energy-based localization in wireless sensor networks, which is a quartic programming and is nonconvex in general. Based on a matrix rank-one decomposition (ROD) technique, we prove that this model can be transformed into a convex constrained programming model, and the proof is constructive. Furthermore, by a theoretical analysis of the semidefinite programming (SDP) model proposed by Wang, we present an easy verifiable condition that characterizes when the SDP model admits no gap with the primal AWLS model. By using this condition, we design a new algorithm that combines the SDP algorithm with the ROD technique. The new algorithm can solve the AWLS model exactly in theory and overcomes the shortcomings of the SDP algorithm. The numerical results show that, at low noise levels, the performance of the proposed algorithm is very close to Cramer–Rao bound accuracy, while the SDP method is not; at high noise levels, the performance of the proposed algorithm is similar to the SDP method while the SDP method is regarded best in the corresponding reference. Numerical simulations indicate that the proposed new algorithm performs better thanother existing methods. [ABSTRACT FROM PUBLISHER]