Timing Control Mechanism Research Articles

Action‐time‐controlled tabletop gamification improves physician‒nurse collaborative emergency room evacuation training

AbstractThis article is an example of Lessons from the Field highlighting the practical implementation of a novel time‐controlled mechanism in the gamification of emergency department evacuation training via tabletop exercise. Tabletop exercise is one of the most common drill types for disaster preparedness. It is easy to use, effective, and low in cost, but it has some shortcomings. For example, its lack of authenticity is often criticized. We add a time‐control mechanism to the tabletop exercise and use settings similar to real events in an attempt to increase the authenticity of the tabletop exercise and the learning effect. We completed a 3‐h tabletop gamification of emergency room evacuation, which included a time control mechanism. Medical staff in our emergency department were asked to join this tabletop training. We evaluated the effectiveness of the time‐control tabletop exercise through the results of the pretest and posttests and feedback from the participants. A total of 97 emergency medical staff from the Emergency Department of Cheng Kung University Hospital, including 64 nurses, 29 emergency doctors and four nurse practitioners, participated in this tabletop exercise. After experiencing the time‐control tabletop exercise, the participants significantly improved their approach to mass casualty incidents, their method for evacuating patients, and their triage skills. The correct answer rate for the pretest and post‐test rose from 68.75% to 94.33% with statistically significant. The feedback from the participants also showed that the time‐control tabletop exercise was interesting and could increase learning motivation. The time‐control mechanism had a positive impact on the learning effect. It increased the reality of tabletop exercises, promoted participants' learning motivation, and improved their performance on the test.

A Novel Hybrid Algorithm Based on Jellyfish Search and Particle Swarm Optimization

Metaheuristic optimization is considered one of the most efficient and powerful techniques of recent decades as it can deal effectively with complex optimization problems. The performance of the optimization technique relies on two main components: exploration and exploitation. Unfortunately, the performance is limited by a weakness in one of the components. This study aims to tackle the issue with the exploration of the existing jellyfish search optimizer (JSO) by introducing a hybrid jellyfish search and particle swarm optimization (HJSPSO). HJSPSO is mainly based on a JSO structure, but the following ocean current movement operator is replaced with PSO to benefit from its exploration capability. The search process alternates between PSO and JSO operators through a time control mechanism. Furthermore, nonlinear and time-varying inertia weight, cognitive, and social coefficients are added to the PSO and JSO operators to balance between exploration and exploitation. Sixty benchmark test functions, including 10 CEC-C06 2019 large-scale benchmark test functions with various dimensions, are used to showcase the optimization performance. Then, the traveling salesman problem (TSP) is used to validate the performance of HJSPSO for a nonconvex optimization problem. Results demonstrate that compared to existing JSO and PSO techniques, HJSPSO contributes in terms of exploration and exploitation improvements, where it outperforms other well-known metaheuristic optimization techniques that include a hybrid algorithm. In this case, HJSPSO secures the first rank in classical and large-scale benchmark test functions by achieving the highest hit rates of 64% and 30%, respectively. Moreover, HJSPSO demonstrates good applicability in solving an exemplar TSP after attaining the shortest distance with the lowest mean and best fitness at 37.87 and 36.12, respectively. Overall, HJSPSO shows superior performance in solving most benchmark test functions compared to other optimization techniques, including JSO and PSO. As a conclusion, HJSPSO is a robust technique that can be applied to solve most optimization problems with a promising solution.

Measuring the Performance of the Completed Construction Projects through Users Committees: A Case of Khairahani Municipality, Chitwan, Nepal

The projects in Nepal continuously faces issues of expected performance though at local level performance is strictly time bounded. To measure the performance of the completed construction projects through Users Committees in terms of execution time & cost contribution. The study was solely the project performance of the Municipality implementing through UCs of the 33 sites using Opinion survey, checklist survey. The primary and secondary data and information were collected through different tools as questionnaire survey, Key Informant’s Interview, Checklist and field visits. The Descriptive content analysis produces the measures of selected project performance. Overall performance of project executing by UCs was satisfactory. The projects through UCs have been completed within the budget. There is not time control mechanism in the projects since work schedule was not prepared and followed. Most of projects were completed on time of one year and all projects were completed within estimated cost. Due to less managerial and technical skill of UCs, inadequate supervision by the technicians, unavailability of skill persons at local levels and with no laboratory provision in the projects implementing through UCs, the quality of construction work could not be assured as QAP was not in use. For the transparency, the project information board is displayed at sites in the projects budgeting equal to or greater than 10 lakhs. Public Audits are also conducted in all the projects. The projects after the work completion have been examined and cleared within 30 days after completion. The empirical aspects of project implemented through users committee has been analyzed and pragmatic recommendations have been made for assuring effective performance.

A multi-objective service composition method considering the interests of tri-stakeholders in cloud manufacturing based on an enhanced jellyfish search optimizer

Service composition (SC) plays an important role in cloud manufacturing (CMfg), and the comprehensive qualities of CMfg tasks depend on the solution quality of SC largely. The current SC models are mostly customer-centric, which ignore to a great extent the interests of CMfg service platform (CMSP) and cloud service providers (CSPs). However, all of the three roles involved are indispensable in the CMfg system, only by taking all their interests into account simultaneously can the CMfg system get stable development and extensive use. To this end, after analyzing the core interests of the tri-stakeholders, a three-objective SC (TOSC) model is proposed considering the quality of service (QoS), sustainability and cooperativity at the same time in this paper. Then, an enhanced multi-objective jellyfish search (EMOJS) is developed to solve the complex TOSC model efficiently, in which four improvement strategies are designed to enhance its search capacity, respectively are the elitist improvement by Cauchy mutation, the modification for position update, the adjustment for time control mechanism and the interspecific synergistic mechanism. Finally, 30 benchmark functions and TOSC problems with different scales are used to verify the effectiveness of the proposed model and algorithm. Experiment results suggest that the TOSC model can well balance the interests of tri-stakeholders in CMfg and the EMOJS is superior to the common-used algorithms in overall performance.

An efficient chaos-LSA integrated game theory algorithm for a QoS-assured delay time control mechanism with a unique parent selection strategy for a 6LOWPAN wireless body area network

An efficient chaos-LSA integrated game theory algorithm for a QoS-assured delay time control mechanism with a unique parent selection strategy for a 6LOWPAN wireless body area network

КИНЕМАТИКА ГАЗОРАСПРЕДЕЛИТЕЛЬНОГО МЕХАНИЗМА ДВИГАТЕЛЯ HYUNDAI С РЕГУЛИРУЕМЫМ ВРЕМЕНЕМ РАБОТЫ КЛАПАНОВ

Increasing the efficiency of modern internal combustion engines is going in the direction of optimizing the gas distribution phases in order to adjust them to the operating conditions of motor vehicles. Hyundai has announced the development of the first production engine with continuously variable valve operation time – Continuously Variable Valve Duration. (Research purpose) The research purpose is in conducting a kinematic analysis of the gas distribution mechanism with an adjustable valve operating time, identifying the theoretical possibilities of this mechanism in comparison with the information provided in the prospects. (Materials and methods) The methods of kinematic analysis of lever mechanisms were used in the work. (Results and discussion) The analysis of the design of the gas distribution mechanism with an adjustable valve operating time made it possible to choose a suitable structural scheme that is equivalent to the original mechanism. The article presents the most effective method of kinematic analysis of this mechanism and developed on its basis a program for calculating the angles of rotation of the cam and the shaft of the gas distribution mechanism. (Conclusions) An engine with a valve operating time control system allows you to more effectively adjust the cylinder filling depending on the operating conditions due to the variable phase of rotation of the camshaft. The valve timing control system offered by Hyundai should only work with the valve timing control mechanism, since when the cam rotation speed changes, it starts working in the wrong phase that should be at a given time. With a slow rotation of the cam, it lags behind in phase from the shaft of the gas distribution mechanism, and with a fast rotation of the cam, on the contrary, the phase advance of the shaft of the gas distribution mechanism occurs.

An Improved Case-Based Reasoning Model for Simulating Urban Growth

Developing urban growth models enables a better understanding and planning of sustainable urban areas. Case-based reasoning (CBR), in which historical experience is used to solve problems, can be applied to the simulation of complex dynamic systems. However, when applying CBR to urban growth simulation, problems such as inaccurate case description, a single retrieval method, and the lack of a time control mechanism limit its application accuracy. In order to tackle these barriers, this study proposes a CBR model for simulating urban growth. This model includes three parts: (1) the case expression mode containing the “initial state-geographical feature-result” is proposed to adapt the case expression to the urban growth process; (2) in order to improve the reliability of the results, we propose a strategy to introduce the “retrieval quantity” parameter and retrieve multiple similar cases; and (3) a time factor control method based on demand constraints is proposed to improve the power of time control in the algorithm. Finally, the city of Jixi was used as the study area for simulation, and when the “retrieval quantity” is 10, the simulation accuracy reaches 97.02%, kappa is 85.51, and figure of merit (FoM) is 0.1699. The results showed that the proposed method could accurately analyze urban growth.

RETRACTED ARTICLE: An improved source location privacy protection using adaptive trust sector-based authentication with honey encryption algorithm in WSN

A wireless sensor network is a set of sensor nodes used to identify the environment and the corresponding object. It collects all the data of the situation and transmits this detected data to the central node through a wireless network. However, some challenges are encountered in wireless sensor networks i.e., the efficient deployment of sensor nodes in an environment. Some of the issues are limited sources of energy, limited transmission bandwidth, short coverage, data distribution, data persistence, faulty node, and data security redundancy. The Discovery Configuration Protocol (DCP) has been signed for a period of time to monitor the applications. It is required for alternate use, which is very important to recreate the correct data source. Recently, Source Location Privacy (SLP) security at the WSN has attracted a way to prevent opponents from pursuing a backtracking strategy to capture the data source. Delivery of messages from different source nodes to sink nodes is done through an end-to-end location privacy process. With location-based services, data must be retrieved by users who do not have information about the data’s location. So, introduce a proposed Adaptive Trust Sector-Based Authenticated System (ATSAS), which is meant to evaluate the trust confidence value of each node with the help of agent sinks node. When the joining nodes discover their neighbors, they exchange information about the number of single-hop neighbors. The updated confidence value of the node is formed in the network algorithm. The first stage is done using the Honey Encryption (HE) for message authentication and packet encryption to provide security in WSN. These encryptions are making Distribution-Transforming Encoder (DTE) for space of the un-encrypted plain text message into the seed space of n-bit string. The output encryption point is the input to feedback for key generation. To the next level, both direct and indirect observations, such as its neighbor’s trust value, are calculated based on two sources of information. This protocol thereby increases secure communication in a hierarchical WSN. The trust rate control of the network at the source of the packet, which helps drive the time control mechanism. Such Network Control Point (NCP) system development methods provide security and reduce the occurrence of overload on distributed sensor nodes. The theoretical analysis and test results demonstrate that the proposed method improves security, reduces directional attacks, and increases the network’s longevity.

A novel metaheuristic optimizer inspired by behavior of jellyfish in ocean

This study develops a novel metaheuristic algorithm that is motivated by the behavior of jellyfish in the ocean and is called artificial Jellyfish Search (JS) optimizer. The simulation of the search behavior of jellyfish involves their following the ocean current, their motions inside a jellyfish swarm (active motions and passive motions), a time control mechanism for switching among these movements, and their convergences into jellyfish bloom. JS optimizer is tested using a comprehensive set of mathematical benchmark functions and applied to a series of structural engineering problems. Fifty small/average-scale and twenty-five large-scale functions involving various dimensions were used to validate JS optimizer, which was compared with ten well-known metaheuristic algorithms. JS optimizer was found to outperform those algorithms in solving mathematical benchmark functions. The JS algorithm was then used to solve structural optimization problems, including 25-bar tower design, 52-bar tower design and 582-bar tower design problems. In those cases, JS not only performed best but also required the fewest evaluations of objective functions. Therefore, JS is potentially an excellent metaheuristic algorithm for solving optimization problems.

TimelyRep: Timing deterministic replay for Android web applications

SummaryWith the constantly growing and changing requirements of app users, web techniques are used in mobile application development for better cross‐platform compatibility and online update. As the embedded web contents gain complexity, debugging web apps become a critical demand. Web replay tools can record program inputs and reproduce the same execution for debugging and performance tuning. However, traditional replay approaches are largely intended for apps with desktop interaction methods (keyboard, mouse) and require modification to the browser, which limits their applicability in mobile platforms.In this paper, we develop TimelyRep, which provides deterministic record‐and‐replay as a software library, running on commodity Android. TimelyRep can be used for app development with unmodified Android devices and for production to collect faulty execution from users. Also, we propose an efficient replay timing control mechanism and achieve higher timing precision as facing higher event rate on touchscreen devices. TimelyRep also supports cross‐device replay and can replay logged event traces on different devices, which is useful for developers to reproduce user inputs on their own devices. We evaluate TimelyRep with real‐world web applications. The results show that TimelyRep is useful for recreating program bugs and maintaining low delays for touch‐intensive web games.

The kinematics of cyclic human movement

Literature mentions two types of models describing cyclic movement-theory and data driven. Theory driven models include anatomical and physiological aspects. They are principally suitable for answering questions about the reasons for movement characteristics, but they are complicated and substantial simplifications do not allow generally valid results. Data driven models allow answering specific questions, but lack the understanding of the general movement characteristic. With this paper we try a compromise without having to rely on anatomy, neurology and muscle function. We hypothesize a general kinematic description of cyclic human motion is possible without having to specify the movement generating processes, and still get the kinematics right. The model proposed consists of a superposition of six contributions-subject's attractor, morphing, short time fluctuation, transient effect, control mechanism and sensor noise, while characterizing numbers and random contributions. We test the model with data from treadmill running and stationary biking. Applying the model in a simulation results in good agreement between measured data and simulation values. We find in all our cases the similarity analysis between measurement and simulation is best for the same subjects-[Formula: see text] and [Formula: see text]. All comparisons between different subjects are [Formula: see text] and [Formula: see text]. This uniquely allows for the identification of each measurement for the associated simulation. However, even different subject comparisons show good agreement between measurement and simulation results of differences δrun = 6.7±4.7% and δbike = 5.1±4.5%.

A Hybrid Temporal Reasoning Framework for Fall Monitoring

This paper presents a real-time method for detecting a fall at different phases using a wireless tri-axial accelerometer and reports the classification performance when the sensor is placed on different body parts. The proposed hybrid framework combines a rule-based knowledge representation scheme with a time control mechanism and machine-learning-based activity classification. Real-time temporal reasoning is performed using a standard rule-based inference engine. The framework is validated for fall detection performance, false alarm evaluation, and comparison with a highly cited baseline method. Based on a data set with 14 fall types (280 falls) collected from 16 subjects, the highest accuracy values of 86.54%, 87.31%, and 91.15% are obtained for fall detection at pre-impacts, impacts, and post-impacts, respectively. Without post-impact activity information, the side of the waist and chest are the best sensor positions, followed by the head, front of the waist, wrist, ankle, thigh, and upper arm. With post-impact activity information, the best sensor position is the side of the waist, followed by the head, wrist, front of the waist, thigh, chest, ankle, and upper arm. Most false alarms occur during transitions of lying postures. The proposed method is more robust to a variety of fall and activity types and yields better classification performance and false alarm rates compared with the baseline method. The results provide guidelines for sensor placement when developing a fall monitoring system.

Timing Control without Docket Control

AbstractThe Brazilian Supreme Court has developed an informal mechanism of timing control: each justice has the power (pedido de vista) to request more time to study the files of a given case. In this article, we use a database of over 1.5 million cases to calculate vista request duration and compare vista behavior to other activities in which caseload and the justice’s efficiency play a role. Our results show that vistas can function as an individual power, unconstrained by the Court’s internal rules of procedure, to indefinitely remove cases from the agenda, in ways that cannot be explained by the Court’s workload. We also find initial evidence of the vistas being used for strategic purposes, when justices wait for a case to be decided in a more favorable composition or political context. These results suggest that comparative analyses of courts should look beyond formal rules of docket control to study informal means of delay.

Minimizing total earliness and tardiness through unrelated parallel machine scheduling using distributed release time control

Using unrelated parallel machine scheduling to minimize the total earliness and tardiness of jobs with distinct due dates is a nondeterministic polynomial-hard problem. Delayed customer orders may result in penalties and reduce customer satisfaction. On the other hand, early completion creates inventory storage costs, which increase the total cost. Although parallel machines can increase productivity, machine assignments also increase the complexity of production. Therefore, the challenge in parallel machine scheduling is to dynamically adjust the machine assignment to complete the job within the shortest possible time. In this paper, we address an unrelated parallel machine scheduling problem for jobs with distinct due dates and dedicated machines. The objective is to dynamically allocate jobs to unrelated parallel machines in order to minimize the total earliness and tardiness time. We formulate the problem as a mixed integer linear programming (MILP) model and develop a modified genetic algorithm (GA) with a distributed release time control (GARTC) mechanism to obtain the near-optimal solution. A preliminary computational study indicates that the developed GARTC not only provides good quality solutions within a reasonable amount of time, but also outperforms the MILP model, a classic GA and heuristic approaches described in the literature.

At short telomeres Tel1 directs early replication and phosphorylates Rif1.

The replication time of Saccharomyces cerevisiae telomeres responds to TG1–3 repeat length, with telomeres of normal length replicating late during S phase and short telomeres replicating early. Here we show that Tel1 kinase, which is recruited to short telomeres, specifies their early replication, because we find a tel1Δ mutant has short telomeres that nonetheless replicate late. Consistent with a role for Tel1 in driving early telomere replication, initiation at a replication origin close to an induced short telomere was reduced in tel1Δ cells, in an S phase blocked by hydroxyurea. The telomeric chromatin component Rif1 mediates late replication of normal telomeres and is a potential substrate of Tel1 phosphorylation, so we tested whether Tel1 directs early replication of short telomeres by inactivating Rif1. A strain lacking both Rif1 and Tel1 behaves like a rif1Δ mutant by replicating its telomeres early, implying that Tel1 can counteract the delaying effect of Rif1 to control telomere replication time. Proteomic analyses reveals that in yku70Δ cells that have short telomeres, Rif1 is phosphorylated at Tel1 consensus sequences (S/TQ sites), with phosphorylation of Serine-1308 being completely dependent on Tel1. Replication timing analysis of a strain mutated at these phosphorylation sites, however, suggested that Tel1-mediated phosphorylation of Rif1 is not the sole mechanism of replication timing control at telomeres. Overall, our results reveal two new functions of Tel1 at shortened telomeres: phosphorylation of Rif1, and specification of early replication by counteracting the Rif1-mediated delay in initiation at nearby replication origins.

Accounting for dynamic speed limit control in a stochastic traffic environment: A reinforcement learning approach

This paper proposes a novel dynamic speed limit control model accounting for uncertain traffic demand and supply in a stochastic traffic network. First, a link based dynamic network loading model is developed to simulate the traffic flow propagation allowing the change of speed limits. Shockwave propagation is well defined and captured by checking the difference between the queue forming end and the dissipation end. Second, the dynamic speed limit problem is formulated as a Markov Decision Process (MDP) problem and solved by a real time control mechanism. The speed limit controller is modeled as an intelligent agent interacting with the stochastic network environment stochastic network environment to assign time dependent link based speed limits. Based on different metrics, e.g. total network throughput, delay time, vehicular emissions are optimized in the modeling framework, the optimal speed limit scheme is obtained by applying the R-Markov Average Reward Technique (R-MART) based reinforcement learning algorithm. A case study of the Sioux Falls network is constructed to test the performance of the model. Results show that the total travel time and emissions (in terms of CO) are reduced by around 18% and 20% compared with the base case of non-speed limit control.

Pulse Exposure Timing Control Mechanism of X-Ray Machine

The paper analyses the basic exposure signal and types of X-ray machine, then propose a reusable pulse exposure timing control mechanism for X-ray machine, using of SCM program. It completes synchronization of X-ray machine pulse exposure and image capture.

Implementation of precision timed instructions for systems processors in cyber-physical

The physical processes is inherently concurrent and real-time,so to express these characteristics is required when developing Cyber-Physical Systems(CPS).While the traditional computing model for the convenience of the user logic description,along with the Abstract degree rise,description on the time characteristic was gradually discarded.On the basis of the embedded Java processor JPOR-32,a clock register and a clock counter were added for the CPS applications in this paper,and combined with the exception mechanisms,four time instructions were extended to face different requirements of the temporal characteristics,which enabled the user to control the time accurately according to different demands.Finally,the feasibility,validity and accuracy of this time control mechanism have been verified by analyzing the running results of the image processing program that uses time instructions in the CPS.

Practical design and implementation of recognition assisted dynamic surveillance system

Open Service Gateway Initiative (OSGi) and Open-source Computer Vision (OpenCV) are widely used for developing applications. OSGi is constructed to provide a service platform with high application interoperability while OpenCV is used to provide many application programming interfaces (APIs) about image processing. In this paper, we design a recognition assisted surveillance system based on OSGi and OpenCV platforms. The system features dynamic monitoring by a camera carried by a robot and a Java 2 Micro-Edition (J2ME) viewer on a mobile phone. With the assistance of image recognition techniques, the captured frames are adaptively reproduced for handheld phones in a limited bandwidth environment. The proposed adaptive pause time control mechanism can efficiently improve the synchronization relationship between captured and viewed frames across heterogeneous networks. The evaluation results show that the proposed scheme can save power for the moveable camera and have a shorter time delay between the captured and viewed frames.

Ｈ．２６４／ＡＶＣ Ｈｉｇｈ４２２Ｐ＠Ｌ４．１対応１チップＨＤＴＶエンコーダＬＳＩの開発

We have developed a single-chip HDTV encoder LSI for H.264/AVC High422P@L4.1 that is optimized for broadcasting transport systems. Significant bit-rate reduction around 50% or more relative to MPEG-2 can be achieved by originally developed motion vector coding algorithm and subjective quality enhancement through adaptive bit allocation considering human visual system. It also enables low-delay encoder implementation with at shortest 50ms encoding delay, with advanced coding control that optimizes the balance of buffering delay and coded image quality as well as variable delay time control mechanism. We adopt a hierarchical multi-CPU framework and CPU interface those enable flexible encoder control per GOP/Picture/MB, to realize various image quality and encoding delay adjustments. This LSI is fabricated in a 90-nm CMOS process and can be integrated in a 9x9 mm2 chip.