Search

Transportation sharing in goods (bike sharing), distinguished from service sharing (ride), has been one of the most active sectors of the sharing economy recently. Such a business model, facilitated by the mobile Internet and cloud computing platforms, seeks supplies in vehicles on demands at matched times and rental locations. The success has attracted more competitors into it, counter-effectively resulted in redundancies in total supplies, reducing social efficiency. In this work, we take electric car sharing as an example to propose a business solution to deal with such a dilemma. Our main idea is to set up a joint venture to provide shared electric cars for different competitors to operate on. These competitors provide their differentiated service for their customers through their own electric mobile Apps, while reducing the infrastructure cost through the joint venture. We study this business model as a two-stage Stackelberg game to analyze the optimal pricing and the sharing scheme of the leader (joint venture) and its followers (car sharing operators). Our model places the sharing of the electric vehicles in two tiers: One among the customers (to reduce the cost of time sharing) and the other among the operators (to reduce the cost of space sharing).

O presente artigo trata da multipropriedade imobiliária e da hipótese de incidência do Imposto sobre a Propriedade Predial e Territorial Urbana (IPTU), pelo qual se empreende uma análise da sujeição passiva dos multiproprietários e da ocorrência do fato gerador da obrigação tributária principal, considerando o tratamento dado ao instituto pelo Direito Civil como forma de expressão contemporânea da propriedade. A pesquisa se justifica em face da necessidade de se apurar com exatidão o polo passivo da obrigação tributária na ocorrência de fracionamento da propriedade por período e na existência de várias matrículas para cada multiproprietário. O objetivo deste artigo é analisar o polo passivo da relação tributária, levando em consideração a posição dos tribunais e dos doutrinadores acerca do artigo 110 do CTN. Para o atingimento de tal finalidade, utilizou-se como metodologia as pesquisas bibliográfica, doutrinária e jurisprudencial e o método hipotético-dedutivo. Ao final, constatou-se que não constitui quebra de conteúdo de Direito Privado, no âmbito do assunto multipropriedade, a cobrança solidária pelo Município do tributo predial sobre a unidade.

Identifying the location of partial discharges (PDs) and providing clear information on insulation vulnerabilities in power systems can help utility companies to improve their maintenance efficiency. This paper presents a PD monitoring and locating system for medium-voltage switchgears using a set of transient earth voltage (TEV) detectors. A time-of-flight methodology was used to identify the switchgear affected by PD among a row of switchgears. A time sharing access mechanism, which was implemented by multiple high-frequency surface mounting relays integrated into each TEV detector, was applied to automatically identify the site of PD and minimize the number of expensive high-speed acquisition cards. The operation principle and implementation of the modular system were formulated, and the efficiency of the proposed system in identifying the switchgear with PD among three 10 kV metal-clad switchgears was confirmed experimentally.

In the two-user Gaussian interference channel (IFC) with Gaussian inputs and treating interference as noise (TIN), it depends on the assumptions about time-sharing whether improper signals (asymmetric complex signals) can bring benefits over proper signals. If no time-sharing is allowed (pure strategies) or the convex hull formulation is used (only data rates can be averaged), improper signaling can lead to a larger rate region than optimal proper signaling. However, when coded time-sharing is allowed, i.e., both the data rates and the transmit powers can be averaged, the whole rate region can be achieved by proper signaling. Here, we show that the same is true in the multiple-input/single-output (MISO) Z-interference channel (ZIFC). We provide an analytical proof for the optimality of proper signaling in the case of coded time-sharing, and we numerically demonstrate gains by improper signaling in the cases without coded time-sharing.

In this letter, we study the computational energy efficiency (EE) fairness in a backscatter-assisted wireless powered mobile edge computing (MEC) network, where multiple edge users (EUs) can offload tasks to the MEC server via passive backscatter communications (BackComs) and active transmissions (ATs) under the guidance of the harvest-then-transfer protocol. Specifically, with the practical non-linear energy harvesting (EH) model and the partial offloading scheme considered at each EU, we propose a max-min computational EE-based resource allocation scheme to ensure the fairness among multiple EUs by jointly optimizing the reflection coefficient, transmit power, local computing frequency and execution time of each EU, as well as EUs’ time sharing between BackComs and ATs, and then develop a Dinkelbach-based iterative algorithm to obtain the optimal solutions. We further employ the Lagrange duality method to obtain instrumental insights on the max-min computational EE-based resource allocation scheme. Simulation results verify the superiority of the proposed scheme over benchmark schemes in terms of computational EE fairness.

The best-known achievable rate region for the two-user Gaussian interference channel corresponds to the Han-Kobayashi scheme. However, mathematical expressions that characterize the Han-Kobayashi rate region are complicated. This complexity hinders a comprehensive understanding of the rate region. For instance, when interference is weak, the maximum achievable sum-rate of the Han-Kobayashi scheme has been unknown. This paper studies the sum-rate of the Han-Kobayashi scheme with Gaussian inputs and fully characterizes the maximum achievable sum-rate, when no time sharing is used. The optimal power-splitting variables and the corresponding maximum achievable sum-rate are explicitly expressed in closed forms. With the same approach, the maximum weighted sum-rate is expressed that characterizes the boundary of the Han-Kobayashi region without time sharing. Moreover, when time sharing is used, the boundary is expressed in terms of the upper concave envelope of a function of transmitters’ powers.

In this paper, a non-orthogonal multiple access based cooperative relaying system (NOMA-CRS) is considered to increase spectral efficiency. Besides, the simultaneous wireless information and power transfer (SWIPT) is proposed for the relay in NOMA-CRS. In SWIPT-NOMA-CRS, three different energy harvesting (EH) protocols, power sharing (PS), time sharing (TS) and ideal protocols are implemented. The outage performances of the SWIPT-NOMA-CRS are studied for all three EH protocols. In the analysis, to represent practical/reasonable scenarios, imperfect successive interference canceler (SIC) and imperfect channel state information (CSI) are taken into consideration. The derived outage probability (OP) expressions are validated via computer simulations. Besides, the OP for the benchmark scheme, NOMA-CRS without EH, is also derived under imperfect SIC and CSI. Based on extensive simulations, it is revealed that the SWIPT-NOMA-CRS outperforms NOMA-CRS without EH. Finally, the effects of all parameters on the outage performance of the SWIPT-NOMA-CRS are discussed and for the given scenarios, the optimum PS factor, TS factor and power allocation coefficients are demonstrated., Accepted for publication in TURKISH JOURNAL OF ELECTRICAL ENGINEERING & COMPUTER SCIENCES

Multi-resonance NMR experiments are powerful analytical and structural tools. Their conceptualization assumes that RF fields may be combined independently to manipulate spin interactions. However, practical implementation can compromise performance. One limitation is the generation of combination bands when two or more RF fields are applied simultaneously within the NMR probe. The combination bands can lead to significant interference with the detection circuitry. A facile approach to combined multi-band decoupling can resolve these problems and increase sensitivity two-fold (or more), by time sharing the application of the individual frequencies rather than time sharing decoupling and data acquisition.

For the various imbalances of series-connected cells, the existing balancing methods has the disadvantages of limited energy flow direction and unnecessary charge transfer. Based on flyback converter, this paper proposes a multi-winding input and multi-winding output bi-directional equalization topology. It can realize any cell (s) to any cell (s) balancing, which has the advantage of flexible balancing energy flow path. This paper adopts the control strategy of time-sharing participation in equalization according to the order of the initial state of charge (SOC) of cells, it can solve the problem of unnecessary energy transfer and simplify the control logic. In addition, it gets rid of the influence of energy loss of the circuit components on the setting of the fixed equalization end judgment value, whether equalization ends or not depends on the difference between the discharge cells and the charge cells in this paper, which has the advantage of random adaptive adjustment. In this paper, the operational principle of the proposed circuit are analyzed and the equalization strategy is described in detail. A comparison in balancing performance between the conventional equalization topology based on flyback converter and proposed topology is shown in static state. To verify the validity of the proposed method, the simulation experiment of four cells series-connected is carried out, and the simulation results show that the balancing method proposed in this paper has faster equalization speed and higher equalization energy transfer efficiency.

Giving messages or information seems to be a habit, yet at the same time become a liaison between people each other throughout the world from one single access platform. Interactivity on internet which has more value in giving, receiving and even editing and commenting on the information rather than offline communication becomes the main attraction for the global community. Most people are using internet as it is become daily basis phenomena around the world. The flood of information about the unknown event will kindly occurs, even though the news that is displayed is only a few and bits - the slightest news will still be needed when the lack of information happen. TI is not surprising when a terror event occurs, the flood of information is so overwhelming in various media, because everyone is able to be a provider of information by post it quickly and easily everywhere, online. The purpose of this service is to provide training, giving information and at the same time sharing experiences related to the healthy internet as a learning media for teachers at SMAN-1 Kuala Kapuas. The training methods used in this service are the lecture, discussion and practice methods. Based on the results of the evaluation, all training/outreach participants are having a better understaning about the importance of using the internet in a healthy manner as a learning media.

The proliferation of system virtualization poses a new challenge for the coarse-grained time sharing techniques for consolidation, since operating systems are running on virtual CPUs. The current system stack was designed under the assumption that operating systems can seize CPU resources at any moment. However, for the guest operating system on a virtual machine (VM), such assumption cannot be guaranteed, since virtual CPUs of VMs share a limited number of physical cores. Due to the time-sharing of physical cores, the execution of a virtual CPU is not contiguous, with a gap between the virtual and real time spaces. Such a virtual time discontinuity problem leads to significant inefficiency for lock and interrupt handling, which rely on the immediate availability of CPUs whenever the operating system requires computation. To reduce scheduling latencies of virtual CPUs, shortening time slices can be a straightforward strategy, but it may lead to the increased overhead of context switching costs across virtual machines for some workloads. It is challenging to determine a single time slice to satisfy all the VMs. In this article, we propose to have dual time slice to resolve the time slice conflict problem occurred in different types of virtual machines.

In the two-user Gaussian interference channel with Gaussian inputs and treating interference as noise (TIN), improper complex signals can be beneficial if time-sharing is not allowed or if only the data rates are averaged over several transmit strategies (convex hull formulation). On the other hand, proper (circularly symmetric) signals have recently been shown to be optimal if coded time-sharing is considered, i.e., if both the data rates and the transmit powers are averaged. In this paper, we show that both conclusions remain the same if single-input multiple-output (SIMO) systems with multiple antennas at the receivers are considered. The proof for the case with coded time-sharing is via a novel enhanced channel concept for the two-user SIMO interference channel, which turns out to deliver a tight outer bound to the TIN rate region with coded time-sharing. The result for the case without coded time-sharing is demonstrated by studying specific examples in which a newly proposed composite real gradient-projection method for improper signaling can outperform the globally optimal proper signaling strategy. In addition, we discuss how the achievable TIN rate region with coded time-sharing can be computed numerically.

Close-distance coal seams are widely distributed in China, and there is a problem of stopping mining in a large number of working faces. Taking Yanzishan mine as the engineering background, the mined-out area and the remaining end-mining coal pillar of No.4 coal seam (upper coal seam) mined in advance caused strong interference to the stopping mining of N316 working face of No.3 coal seam under it. Through field observation, laboratory experiment, and support data collection, the mechanical parameters of coal and rock mass and periodic weighting condition of the working face were mastered, and numerical simulation and similar model experiments were carried out. Three positional relationships between the stopping position of the underlying N316 working face and the upper stopping line were obtained: “externally staggered with the upper stopping line” (ESUL), “overlapped with upper stopping line” (OUL), and “internally staggered with the upper stop line” (ISUL, ISUL-SD for shorter internal staggered distances, ISUL-LD for longer ones). The formation and evolution of the stress arch structure of ESUL → OUL → ISUL-SD → ISUL-LD are obtained from the analysis: ① ESUL: there is a double stress arch structure of goaf side and end-mining coal pillar side in the overburden and stress superposition appears in the middle arch foot (stopping mining place). ② OUL: it evolved into a single arch structure of goaf-solid coal, and the stress at the stop of mining was relatively minimum. ③ ISUL-SD: it is still a single arch structure, and the stress at the stop of mining is still small. ④ ISUL-LD: the double stress arch is regenerated and stress superposition occurs at the front arch foot (stopping mining place). At the same time, the morphological evolution process of stress arch is as follows: “front and back stress arches, superimposed with middle arch foot” → “front arch gradually decreases” → “front arch dies, and two arches merge into single arch” → “single arch gradually increases” → “two arches are regenerated, superimposed with front arch foot”. On-the-spot analysis from the combination of stress and overburden structure: ① ESUL: the stress concentration degree is the highest above the stopping space, and the overburden block in the large-scale caving zone directly acts on the support, which makes the stopping operation difficult. ② OUL: although the stress environment is the best, the overlying key blocks will have hidden dangers of overall rotation or sliding instability. ③ ISUL-SD: the stress environment is good, and the overlying rock can realize the stable structure of the cantilever plate (the internal staggered distance is less than the periodic weighting step), and the mining is stopped at this position to realize the safe and smooth withdrawal of the support. ④ ISUL-LD: it is basically consistent with stopping mining when single-layer coal is used but is limited by the limited length of the end-mining coal pillar. In addition, the self-digging retracement channel is designed to serve the whole retracement process, and the idea of time-sharing partition support for a large cross-section of mining stoppage and its corresponding scheme is put forward according to the retracement process. Through the simulation of prestressed field and field practice, the roof overlying rock structure is stable during the whole retracement period, thus realizing the safe and smooth mining stoppage and retracement of the working face.

The ALOHA System, an experimental UHF radio computer communication network, was developed at the University of Hawaii during 1970-76. In this survey paper, we give a general overview of packet communication techniques applied to computer networks. Then we discuss the concept of packet broadcasting and give a short discription of the ALOHANET. Next, a discussion of the application of ALOHA techniques to satellite communications is presented. Finally, a short survey of present-day research and development efforts in packet broadcasting is presented. (Author)

In conventional public clouds, designing a suitable initial cluster for a given application workload is important in reducing the computational foot-print during run-time. In edge or on-premise clouds, cold-start rightsizing the cluster at the time of installation is crucial in avoiding the recurrent capital expenditure. In both these cases, rightsizing has to balance cost-performance trade-off for a given application with multiple tasks, where each task can demand multiple resources, and the cloud offers nodes with different capacity and cost. Multidimensional bin-packing can address this cold-start rightsizing problem, but assumes that every task is always active. In contrast, real-world tasks (e.g. load bursts, batch and dead-lined tasks with time-limits) may be active only during specific time-periods or may have dynamic load profiles. The cluster cost can be reduced by reusing resources via time sharing and optimal packing. This motivates our generalized problem of cold-start rightsizing for time-limited tasks: given a timeline, time-periods and resource demands for tasks, the objective is to place the tasks on a minimum cost cluster of nodes without violating node capacities at any time instance. We design a baseline two-phase algorithm that performs penalty-based mapping of task to node-type and then, solves each node-type independently. We prove that the algorithm has an approximation ratio of O(D min(m, T)), where D, m and T are the number of resources, node-types and timeslots, respectively. We then present an improved linear programming based mapping strategy, enhanced further with a cross-node-type filling mechanism. Our experiments on synthetic and real-world cluster traces show significant cost reduction by LP-based mapping compared to the baseline, and the filling mechanism improves further to produce solutions within 20% of (a lower-bound to) the optimal solution., An abridged version appears in IEEE Cloud 2021

We developed Tourgether, an app that enables tourists' mutual sharing of their experiences via check-ins in real time, to enhance their awareness and exploration of various points of interest (POIs) in a tourism region. We conducted formative studies and a between-subjects field experiment to assess how tourists used Tourgether in their travels, and the influence of real-time experience-sharing on unplanned POI visits, respectively. The results of the formative studies indicated that seeing shared real-time experiences encouraged tourists to explore and make unplanned visits to less well-known POIs, and that their decisions to make unplanned POI visits were dependent on familiarity, worthiness, and convenience. The app also created a feeling of co-presence among tourists, boosting their desire to interact with others. Two strong motivators for tourists to check in on the app were identified: contributing to other tourists, and recording journeys. Our experimental results further showed that seeing shared real-time experiences prompted the participants to make more unplanned visits than would have been the case if they had not seen them. This influence was more prominent among tourists who planned more POI visits. Other differences in the usage and influence of Tourgether across these two groups will also be discussed.

Driver distraction is one of the leading causes of vehicle crashes. The introduction of higher levels of vehicle control automation is expected to alleviate the negative effects of distraction by delegating the driving task to automation, thus enabling drivers to engage in non-driving-related tasks more safely. However, before fully automated vehicles are realized, drivers are still expected to play a supervisory role and intervene with the driving task if necessary while potentially having more spare capacity for engaging in non-driving-related tasks. Traditional distraction mitigation perspectives need to be shifted for automated vehicles from mainly preventing the occurrence of non-driving-related tasks to dynamically coordinating time-sharing between driving and non-driving-related tasks. In this paper, we provide a revised and expanded taxonomy of driver distraction mitigation strategies, discuss how the different strategies can be used in an automated driving context, and propose directions for future research in supporting time-sharing in automated vehicles.

In this letter, a novel spectrum sharing system referred to as cognitive backscatter network (CBN) is proposed to support passive Internet of Things (IoT) transmission via backscatter modulation, in which the primary system transmits a sinusoidal carrier in addition to its own signal. In contrast to existing ambient backscatter communications, the proposed CBN does not require perfect symbol synchronization between the IoT and the primary transmissions. We maximize the data rate of the IoT transmission subject to the minimum rate requirement of the primary system by jointly optimizing the time sharing and power allocation parameters. Numerical results have demonstrated the superiority of the proposed CBN over conventional TDMA scheme.

Sharing of autonomous vehicles between multiple users can potentially be the ultimate solution for increasing the efficiency of the transportation system. In a time-sharing scenario, autonomous vehicles (AV) owners share their vehicles to others at their unwanted times without incurring any human efforts. However, such sharing service requires the disclosure of users’ locations and route information, raising severe privacy concerns and issues. In this paper, we propose a privacy-preserving task scheduling scheme for time-sharing services of autonomous vehicles. First, we design a matching scheme that finds the feasible requesters for each available AV. Then, we propose a scheduling scheme using different approaches for assigning requesters to the AVs based on different system parameters. Both schemes work efficiently without requiring users to share their exact locations and route details while maximizing the AV owner profit and minimizing the requester cost. Specifically, our schemes enable an untrusted matching server to match owners and requesters using a set of intermediate destination (ID) locations in the travel paths. Only if the service can be given to the requester efficiently, the owner and the requester share the details of the routes. All the calculations for verification of the feasibility of the service are done on the untrusted server. We show the accuracy of our proposed scheme through extensive simulations on real data. The results confirm that our traffic-based ID selection scheme, with consideration of the traffic information and patterns in the area, outperforms the baseline scheme where the IDs are chosen randomly. Furthermore, the effectiveness of different scheduling schemes including greedy-based and first come first served are evaluated.

With the liberalization of China’s electricity sales side, a large number of power sales companies emerge and occupy the market, forming a pattern that many power sales companies are competing for the market. Based on the analysis of the connotation, type and purchasing and selling electricity flow of the power selling company, this paper first proposes the power user response model based on peak and valley time-sharing electricity price, then constructs the purchasing and selling electricity model of the power selling company considering differentiated time-sharing electricity price, and finally analyzes the purchasing and selling electricity model through the example. The results show that the model can optimize the load curve of power users and reduce the cost of electricity while maximizing the profit of power selling companies.

Non-Orthogonal Multiple Access (NOMA) has recently been explored to address the challenges in 5G networks such as spectral efficiency, large number of devices, etc. Further, energy harvesting is a promising solution to address the challenges for energy efficiency in 5G networks. In this thesis, joint user grouping, power allocation, and time allocation for NOMA with RF energy harvesting is investigated. We mathematically modeled a framework to optimize user grouping, power allocation, and time allocation for energy harvesting and information transfers. The objective is to maximize data rate while satisfying the constraints on minimum data rate requirement of each user and transmit power. We adopted mesh adaptive direct search (MADS) algorithm to solve the formulated problem. The user grouping in MADS is comparable with the exhaustive search which is computationally very complex. The thesis is supported with simulation results in terms of user grouping, power allocation, user rate, and time sharing.

In this paper, we proposed a resource-efficient 'QRS' detector with superior detection accuracy. Inspired by the strategy of the folded architecture, we adopted a reconfigurable time-sharing computation unit with a pipeline schedule. To further precisely locate the position of the 'R' peak and minimize the extra hardware cost, we designed the position calibration unit (PCU) based on the data compression technique. The proposed architecture was implemented on Xilinx Zynq-7000 with Verilog programming language. The proposed architecture achieves a sensitivity, Se of 99.76%, a precision, +P of 99.85%, and a detection error rate, DER of 0.40% on MIT-BIH database, which attains the best performance compared to state-of-the-art designs. Furthermore, the proposed architecture achieves a better hardware efficiency with 13×, 1.28×, and 4.35× reductions in computing resources, storage memory, and power consumption, respectively.

Applying deep neural networks (DNNs) to video analytics tasks has drawn attention from both academic and industry communities. However, due to the high computational complexity of DNN models and the explosion of video data, it is challenging to process massive concurrent video queries efficiently and effectively. In this paper, we propose a video analytics system named DVQShare to process DNN-based video queries in a batch mode. The key idea is sharing, including time sharing, spatial sharing, and logical sharing. In principle, sharing across queries can help us reduce the overall amount of frames to be analyzed, which can help us improve the overall performance and reduce the monetary cost. Two modules are designed to process video queries by exploiting the above three sharing opportunities. First, an analysis module is integrated to guide the generation of query processing plans. Within this module, temporal sharing is considered to reuse historical results produced by other queries to remove pending frames that have been analyzed, and spatial sharing is adopted to avoid redundant processing over overlapping video clips. Additionally, we utilize logical sharing to further improve system’s overall performance by considering the logical relationship between queries. Second, a query processing engine is devised to execute the query pipeline generated by the analysis module and return the final results. In experiments, we implement a prototype of the DVQShare system based on MXNet, and results show that it can achieve up to 2X performance speedup.

With the large-scale wind power integration, this paper presents a time-sharing and multi-objective optimal response strategy of thermal power units to improve the flexibility of units and wind power consumption. Taking 15 minutes as the time scale, this strategy revises the output curve of thermal power units according to ultra-short-time forecasts, conventional constraints of thermal power units, and different optimization objectives. The numerical results indicate that strategy ensures both the largest wind power consumption and the economy of thermal power units.

Register renaming is the key for the performance of out-of-order processors. However, the release mechanism of the physical register may cause a waste from time dimension. The register reuse technique is the earliest solution to release a physical register at renaming stage, which takes the advantage of those register instances with only one time use. However, the range of possible reuse mined by this scheme is not high, and the physical structure of the register have to be modified. Aiming at these two problems, we propose an extended register reuse scheme. Our work presents: 1) prediction of the use times of the register instance, so as to reuse the physical registers at the end of the last use, to expand the range of possible reuse. 2) A design of time-sharing register file with little overheads which is implemented by Backup Registers, avoiding to modify the physical register structure. Compared with the original register reuse technique, this work achieves 8.5% performance improvement, alternatively, 9.6% decrease of the number of physical registers with minor hardware overhead.

A queueing system with conflicting non-ordinary input flows in considered. The flows are modulated by a random external environment with two states. Serviced customers may return instantly to waiting line, following the general Bernoulli feedback rules. After each service act, a setup-and-control act takes place. A mathematical model for the process is a discrete-time denumerable multivariate Markov chain which includes the server state, numbers in the queues and random environment state. The model extends the class of queueing models studied by G.P.Klimov, M.Yu.Kitaev, V.V.Rykov, M.A. Fedotkin et al. Functional equation for partial probability generating functions are studied for a class of non-preemptive priority service. An algorithm for solving these equations is proposed. Some steps of the algorithm are theoretically justified. Its implementation in an open-source computer algebra language is used to demonstrate practical usefulness of the algorithm, and to investigate inner properties of some important stationary probabilities.

Iot plays a vital role in solving real time problems in the field of Healthcare. Abundant problems can be rectified with optimal use of IOT Healthcare. It can be applied to detect Diabetes at early stages, detection of Foot ulcers, anomaly in heart rate and similar scenario. The paper proposed the plan and its working in Healthcare using IOT to detect ulcer in the foot of diabetic patients. The given model examines the medical condition of ulcer cause by diabetic and notify in case of aberration. Node MCU development board plays a vital role in its model development and stores and tracks the medical report of the Patient. It also helps in real time sharing of large chunks of data with great efficiency. Indeed this model slack off maj or time consuming efforts like regular visits to doctor and provide real time update with regards to patient.

The best coding scheme for Gaussian interference channel (GIC) is still an open problem so far, and has attracted much attention in the field of wireless communication due to it plays an important role in combating co-channel interference. In this paper, an adaptive power allocation and coding scheme based on time sharing (TS) strategy is proposed for the twouser GIC to coordinate the interference and achieve a higher sum-rate. In the proposed scheme, the codewords are divided into some segments, and the power of each segment is jointly optimized for the two users to maximize the sum-rate. To solve the power allocation problem, a heuristic search algorithm based on the optimal path planning algorithm is proposed. Simulation results show that the proposed scheme can achieve a higher sum-rate compared with the conventional coding schemes.

Cloud computing is a new age technology. The quality of services in the cloud depends on priority of the job, time taken to transfer the specific task, length of the task, number of CPUs available for every virtual machine and capacity of virtual machine. Previously, there were many researches done on the issue of task scheduling, about workflow and job scheduling in cloud computing. Scheduling in cloud has to cope with many issues like allocation of small request, workload characterization, different types of request, real-time allocation and provision for queuing. Throughput of the system depends on resources allocation to process which is performed by the CPU scheduling algorithms. The objective of scheduling algorithm is to minimize the waiting time, turnaround time, response time and context switching and highest degree of utilization of CPU. Round Robin is a pre-emptive algorithm which works on fixed time quantum and used in time sharing system. Round Robin is also known for its fairness task distribution and optimum utilization of CPU. In this paper, we have tried to introduce an improved Round Robin algorithm by calculating the quantum number by taking the average of burst time of all tasks which arrive at the same time and finish the execution of the tasks which have less quantum number and the task which has greater quantum number will be executed as per the existing Round Robin method. By simulating the proposed algorithm, we have observed that the waiting time and turnaround time decrease considerably.

This paper proposes the newest modified version of the original flower pollination algorithm (FPA) named the parallel flower pollination algorithm (PFPA) and its application to the fractional-order (FO) mathematical model identification of the brushless DC (BLDC) motor. Based on the time sharing or the multiple point single strategy (MPSS), the proposed PFPA is suitable for use on a single CPU platform. Some results of the PFPA’s performance test over five standard benchmark functions are reported in this paper. Then, the PFPA is applied to identify the model parameters of the BLDC motor. As results, the PFPA can optimally provide the BLDC motor model parameters of both integer-order (IO) and FO models. However, the FO model performs more accurate than the IO one.

Computer password was first used at the Massachusetts Institute of Technology around 1960 when researchers built a large-scale time-sharing computer called CTSS (Compatible Time Sharing System). There are many purposes where regular users require different passwords whenever they send and receive emails, do online shopping and numerous other activities on the internet. Surprisingly since the invention of the password, it has not been capable to protect the user accounts until now. There is no problem in using the similar password, but different passwords are often difficult to remember and mistakes can creep in rather easily. Many users do not know what kind of passwords should be chosen which will be strong enough to thwart all sorts of fraudulent activities. Thus, most passwords are not secure as they should be, and the users could become targets of attacks at any time. This research attempt, after a thorough literature review and in-depth empirical study, developed a software plug-in called ‘Password Strength Meter’, which can be used to visually inform the user about the durability of their chosen password and an estimate on the timeframe it may take to break the password using standard cracking mechanism. The output of this empirical study has been widely appreciated by the users who have tested the developed software, stating that the confidence on their chosen password increases significantly while using this tool to form a password.

Recently, Deep Learning (DL) is widely applied to intelligent systems equipped with resource-constraint hardware accelerators. With multiple DL applications sharing the resource, the execution model can be divided into two stages: (i) batching independent inference tasks initiated by each application, and (ii) scheduling batches to run in a time-sharing manner. The state-of-the-art DL serving systems employ the execution model by organizing sequential tasks into batches and then scheduling batches concerning their targeting deep neural network (DNN) models in a round-robin manner. However, we demonstrated that these practices fail to alleviate the slowdown of tasks, and there is a need to re-visit batching and scheduling in terms of efficiency and fairness. To this end, we formulated batching as a resource allocation problem and investigated scheduling in terms of each application’s utilization on the device. Then, we proposed the fine-grained batching scheme and fairness-driven scheduling scheme for DL serving and implemented a prototype system called DyBatch. To be exact, DyBatch accomplishes efficient batching by taking into account Pareto efficiency of and envy between batches. Besides, DyBatch’s fair scheduler monitors the resource utilization of all applications and assigns a batch from the application with the lowest utilization for execution first. Evaluation under various benchmarks with comparison to the baseline system Tensorflow Serving (TFS) shows the superiority of DyBatch, which achieves up to 55% reduction of slowdown, and up to 12% improvement of throughput.

Background：It is difficult to break the “production and marketing dilemma” by relying only on the production enterprises and consumers. This paper introduces the government into market subject and constructs a three-party dynamic evolution game model between government, enterprises, and consumers to reveal the control strategy. This paper makes a concrete analysis and verifies the model with a case study by revealing the game process between the regulation strategy and behavior decision of enterprises and consumers.Results：When the key parameters are in different numerical ranges, the system has four evolutionary stability results. By appropriately increasing the amount of subsidies and penalties, increasing the proportion of compensation coefficient to consumers, and urging enterprises to reduce operating costs, the government is conducive to the healthy development of the new energy timesharing automobile industry.Conclusions：The subsidy range and punishment intensity have a positive effect on the evolution of the system to the ideal state, the consumer compensation coefficient has a positive effect on the evolution of the system to the ideal state, the effort of operating costs has a negative effect on the evolution of the system to the ideal state. The study can provide a theoretical basis and a reference for policy formulation and decision-making.

Inductive power transfer is a form of wireless power transfer in which resonance phenomenon is applied for mutual coupling of sending and receiving coil. In this paper input high frequency inverter of class E type is used. Here, the class E type inverter is used with time sharing phenomenon. Time sharing provides equally shared time in the total time period allotted to each specified 2 phase class E inverter. Further, in the MATLAB simulation of the circuit we get total efficiency of 83%.

In this paper, we consider the uplink and downlink precoder design for two-user power-domain multiple-input multiple-output (MIMO) non-orthogonal multiple access (NOMA) systems. We propose novel uplink and downlink precoding and decoding schemes that lower the decoding complexity at the receiver by decomposing the MIMO-NOMA channels of the users into multiple single-input single-output (SISO)-NOMA channels via simultaneous triangularization (ST) of the MIMO channels of the users and a low-complexity self-interference cancellation at the receiver. The proposed ST MIMO-NOMA schemes avoid channel inversion at transmitter and receiver and take advantage of the null spaces of the MIMO channels of the users, which is beneficial for the ergodic achievable rate performance. We characterize the maximum ergodic achievable rate regions of the proposed uplink and downlink ST MIMO-NOMA schemes, and compare them with respective upper bounds, baseline MIMO-NOMA precoding schemes, and orthogonal multiple access (OMA). Our results illustrate that the proposed schemes significantly outperform the considered baseline MIMO-NOMA precoding schemes and OMA, and have a small gap to the respective upper bounds for most channel conditions and user rates. Moreover, we show that a hybrid scheme, which performs time sharing between the proposed uplink and downlink ST MIMO-NOMA and single-user MIMO, can improve performance even further., Comment: Accepted by the IEEE Transactions on Wireless Communications. This is the journal version of the submission arXiv:2006.04581 with 33 pages, 10 figures, and 2 tables. For associated code see https://gitlab.com/aravindh.krishnamoorthy/mimo-noma

An improved time-sharing control strategy was presented for the two-stage grid-tied PV inverter. To provide a stable reference voltage for the MPPT algorithm, a kind of digital notch filter for low frequency ripple was adopted. A kind of calculation of input decoupling capacitance was provided, and meanwhile, system loss analysis of two control strategies was given in detail. Finally, two prototypes were built, and the experimental results demonstrate the feasibility of the improved time-sharing control strategy and show the merits and drawbacks of these two control strategies.

Ensuring fairness in a system with scarce, preferred resources requires time sharing. We consider a heterogeneous system with a few “big” and many “small” processors. We allocate heterogeneous processors using a novel token mechanism, which frames the allocation problem as a repeated game. At each round, users request big processors and spend a token if their request is granted. We analyze the game and optimize users’ strategies to produce an equilibrium. In equilibrium, allocations balance performance and fairness. Our mechanism outperforms classical, fair mechanisms by 1.7×, on average, in performance gains, and is competitive with a performance maximizing mechanism.

For multiple robots to achieve complex tasks while cooperating autonomously, communication among those robots is indispensable. We have developed a local communication system, LOCISS, which uses infrared light as a medium to prevent the convergence of communication by restricting the communication area. In this system, eight pairs of transmitting and receiving elements are located all around a robot, surrounding it for communication. It is also possible for each element to transmit individual information. However, because of imperfections in their directivity, communication gaps exist between elements, preventing sequences of communication. As described in this paper, SS-LOCISS makes a robot’s surroundings spatially seamless in terms of communication by rotating transmitter and receiver. First, a method is given for restoring pulses that have an incomplete shape because of transmitter and receiver rotations. Next, restrictions that are needed for all pulses transmitted to be received are considered, and characteristics of communication strategies derived from the restrictions are verified. After that, areas of transmission and reception are defined, and transmitter and receiver structures that might allow for the exchange of individual information in every area are considered. A method of signal coding is also proposed, one that may eliminate inconsistencies occurring at the dividing lines between transmission areas due to transmitter and receiver rotations. Then, SS-LOCISS prototypes demonstrate its communication accuracy and consistency on these dividing lines. Finally, we consider ways to improve its transmission rate so that SS-LOCISS may be applied to systems.

With the proposal of China’s goal of carbon peak and carbon neutralization, it is urgent for C5-PFK environment-friendly gas insulating medium to replace SF6 in key power equipment, and the research on C5-PFK mixed gas on-line detection technology should be carried out in advance. In view of this, this project is the first time to apply the time-sharing mutual optical fiber sensing detection technology to the C5-PFK mixed gas insulation and decomposition performance research. Theoretical and software analysis: the insulation and decomposition characteristics of C5-PFK gas mixture were simulated from the molecular dynamics level. The variation of absorption spectrum with the temperature and pressure was simulated by self programming simulation software platform, and coupling field distribution of electric power equipment in C5-PFK insulation environment was obtained. The grey system and the NSGA-II hybrid algorithm are applied to inverse and predict the decomposed gas concentration high coupling and nonlinear data series. Hardware and device development: develop a time-sharing and interactive optical fiber live detection device to achieve quantitative online acquisition of decomposition components of mixed gas. Build a real test platform for testing the power frequency, lightning and switching impulse performance of gas mixture. The influence of high frequency vibration and large temperature difference on the experimental results is solved by optimizing the optical system through structure iteration. The time-sharing and interactive optical fiber sensing detection technology can realize the detection of C5-PFK mixed gas with high sensitivity and wide concentration range, which provides theoretical and experimental basis for China’s dual carbon target construction demonstration project, and has good economic and social benefits.

Indicators based on visual time-sharing have been used to investigate drivers’ visual behaviour during additional task execution. However, visual time-sharing analyses have been restricted to additional tasks with well-defined temporal start and end points and a dedicated visual target area. We introduce a method to automatically extract visual time-sharing sequences directly from eye tracking data. This facilitates investigations of systems, providing continuous information without well-defined start and end points. Furthermore, it becomes possible to investigate time-sharing behavior with other types of glance targets such as the mirrors. Time-sharing sequences are here extracted based on between-glance durations. If glances to a particular target are separated by less than a time-based threshold value, we assume that they belong to the same information intake event. Our results indicate that a 4-s threshold is appropriate. Examples derived from 12 drivers (about 100 hours of eye tracking data), collected in an on-road investigation of an in-vehicle information system, are provided to illustrate sequence-based analyses. This includes the possibility to investigate human-machine interface designs based on the number of glances in the extracted sequences, and to increase the legibility of transition matrices by deriving them from time-sharing sequences instead of single glances. More object-oriented glance behavior analyses, based on additional sensor and information fusion, are identified as the next future step. This would enable automated extraction of time-sharing sequences not only for targets fixed in the vehicle’s coordinate system, but also for environmental and traffic targets that move independently of the driver’s vehicle.

In this study, we design a superposition polar code that can achieve the capacity region of binary-input less-noisy broadcast channels asymptotically. Simulation results show that a better rate region is achievable by superposition polar coding than by time sharing between two point-to-point channel polar codes.

Purpose The purpose of this paper is to study the performance metrics of redundant repairable machining system which is applicable in various systems like computer and communication system, manufacturing and production system, etc. Design/methodology/approach In the present investigation, the authors develop Markov model for the system consisting of identical active operating machines which are prone to breakdown. The operating machines are under the care of one permanent repair facility that provides time-sharing basis repair services. The maintenance is facilitated with the provision of standby machines of mixed type and permanent as well as additional repair facility. From the economic point of view, F-policy and N-policy to control the service and arrival of failed machines effectively are included. Findings For the performance analysis of the system in long run, the authors compute steady-state probabilities using product-type solution method recursively. Sensitivity analysis is performed numerically for various parameters by developing code in MATLAB. Social implications The performance prediction done may be helpful for the system designers and decision makers for the improvement of the existing machining systems in various industries. Originality/value Markovian model for the performance prediction of fault tolerant multi-identical operating and standby machines redundant system is developed in generic frameworks by incorporating many noble features which were not all taken together by other researchers working on the same lines. The key concepts incorporated for the modeling of the concerned system is: F-policy, N-policy, time-sharing, and sensitivity analysis of availability and cost function.

Bacteria are far more intelligent than we can think of. They adopt different survival strategies to make their life comfortable. Researches on bacterial communication to date suggest that bacteria can communicate with each other using chemical signaling molecules as well as using ion channel mediated electrical signaling. Though in past few decades the scopes of chemical signaling have been investigated extensively, those of electrical signaling have received less attention. In this article, we present a novel perspective on time-sharing behavior, which maintains the biofilm growth under reduced nutrient supply between two distant biofilms through electrical signaling based on the experimental evidence reported by Liu et al., in 2017. In addition, following the recent work by Humphries et al. Cell 168(1):200–209, in 2017, we highlight the consequences of long range electrical signaling within biofilm communities through spatially propagating waves of potassium. Furthermore, we address the possibility of two-way cellular communication between artificial and natural cells through chemical signaling being inspired by recent experimental observation (Lentini et al. 2017) where the efficiency of artificial cells in imitating the natural cells is estimated through cellular Turing test. These three spectacular observations lead us to envisage and devise new classical and quantum views of these complex biochemical networks that have never been realized previously.