Demand side management (DSM) is one of the key features of electricity networks of the future, as it is a promising way to control energy use in order to allocate more energy efficiency and stable power supplies. In addition, using DSM provides an opportunity to integrate large amount of renewable resources in the power system generation mix and promising solution for maintaining generation and demand balance in the presence of uncertainty in operation. As a result, it can reduce penalty cost due to imbalance between demand and production for the electricity market participants. This paper presents a general structure for an electricity retail market within Microgrids based on game theory concept. A combination of Nikaido-Isoda algorithm (based on non-cooperative game theory) and a relaxation algorithm (NIRA) is employed in this study (Called REM-NIRA algorithm). In the proposed approach, consumers aim to minimize market-clearing prices whilst producers aim to maximize profit through local operations and distributed generation management, energy storage resource, and responsive load demands in relation to the upstream network.
A new low-power capacitive structure and its switching scheme for Successive Approximation Register (SAR) Digital to Analog Converter (DAC) is presented. The proposed method reduces power consumption by 93% and area by 50% compared to the conventional binary-weighted DAC. Moreover, only one reference voltage is used to avoid the effect of common mode voltage (Vcm) non-idealities on precision.
There is a growing trend toward using resting-state functional magnetic resonance imaging (rs-fMRI) data in studying brain network, and finding altered brain regions in neurological and psychiatric disorders. In this paper, we investigated the brain network of 15 normal and 15 Alzheimer subjects, using rs-fMRI data. To overcome the shortcomings of anatomical atlases in functional connectivity studies, we defined the regions based on functional atlases. We produced two functional parcellations: an individual parcellation for each subject separately, and a group-wise parcellation based on the whole dataset. For each subject, two functional graphs were constructed through these atlases. Finally, common network measures such as clustering coefficient and also assortativity coefficient were extracted from the resulted graphs. Comparison between corresponding network measures in patients and normal groups indicate that assortativity coefficient is significantly lower in both group-wise atlas-driven graphs (p-value = 0.0429), and individual atlas-driven graphs (p-value = 0.0334). Reduced assortativity coefficient, which might reveal disturbed primary order in vertices' degrees, can help in better distinguishing Alzheimer's subjects from normal ones.
This paper addresses integral input-to-state stability (iISS) analysis for interconnected systems via small-gain conditions. In particular, we unify and generalise existing results for continuous-time systems and discrete-time systems to the case of hybrid systems, namely those that combine continuous time and discrete time. As an application of our results, we verify iISS for a reset control system.
: While the demand for bandwidth increases exponentially with the growing number of internet based devices, traditional TCP algorithms are turning to be sub optimal. Delay-based congestion control algorithms which are designed to overcome this challenge, are proven to be more satisfactory than loss-based congestion algorithms. On the one hand, Loss base congestion detection technique depends solely on packet loss. On the other hand delay-based algorithms have the advantage of proactively detecting congestion occurrences based on packet delays and as a result avoiding unnecessary packet loss. TCP-Vegas as the most referred variant of delay-based algorithms is promised to achieve between 40 and 70 percent better throughput. However there is some problems which are preventing TCP-Vegas to become widespread. One of these problems is lack of fairness in bandwidth allocation while delay and loss-based connection share a link. In this paper we made some modifications on the original TCP-Vegas which enabled the new algorithm to compete fairly with loss-based algorithm.
