Search

This paper studies ordering and pricing issues of a retailer who faces a linear-sensitive demand. The definition of a reasonable retail price is put forward. After that, a deterministic model for trading off sales revenue and total cost is constructed, in which the retailer determines the optimal ordering schedule and the optimal retail price simultaneously for the sake of maximizing its total profit. It is shown that the acquired retail prices are all reasonable. During the process of derivation, both ordering time points and the optimal retail price are expressed as functions of ordering times. By solving a quadratic programming model with an undetermined parameter, we demonstrate that the optimal ordering time points of the retailer are equidistant time points on the given selling periods. Further, the sensitivity of each parameter is analyzed and some meaningful conclusions are drawn. Finally, the ordering times is obtained by analyzing the derivatives of the profit function.

The present study compared the effects of reinforcement or punishment versus no additional consequences for instruction following on instructional control and subsequent rule-governed insensitivity. In two experiments, adult participants were presented with repeated choices between a short progressive-time schedule and either a fixed time-schedule or a longer progressive-time schedule. In Experiment 1, three groups were given an initially accurate instruction relative to the direct contingency. A control group experienced no additional consequences for compliance with instructions, whereas compliance resulted in additional points for a second group, and noncompliance led to the subtraction of points for a third group. In a subsequent phase, instructions became inaccurate and there were no additional consequences for compliance or noncompliance for any group. Consistent with previous results, rule-governed insensitivity was observed in all participants. Experiment 2 employed the same procedure, except instructions were inaccurate throughout all sessions, and compliance in the subsequent phase resulted in diminishing points per session. Reinforcement for following instructions increased instructional control and subsequent rule-governed insensitivity. This increase was maintained even after the termination of additional consequences, a result that supports theoretical suggestions that a history of reinforcement for complying with instructions and rules is an important factor in rule-governed insensitivity.

Two rival records management models emerged during the 1990s. Duranti’s model involved moving records out of business applications into a repository which has a structure/schema optimised for recordkeeping. Bearman’s model involved intervening in business applications to ensure that their functionality and structure/schema are optimised for record keeping. In 2013 the US National Archives and Records Administration began asking Federal agencies to schedule important email accounts for permanent preservation. This approach cannot be mapped to either Duranti or Bearman’s model. A third records management model has therefore emerged, a model in which records are managed in place within business applications even where those applications have a sub-optimal structure/schema. This model can also be seen in the records retention features of the Microsoft 365 cloud suite. This paper asks whether there are any circumstances in which the in-place model could be preferable to Duranti and Bearman’s models. It explores the question by examining the evolution of archival theory on the organisation of records. The main perspectives deployed are those of realism and of records continuum theory. The paper characterises the first two decades of this century as an era of partial automation, during which organisations have had a general capability to automate the assignment of business correspondence to a sub-optimal structure/schema (that of their email system and/or other messaging system) but not to an optimal structure/schema. In such an era any insistence on optimising the structure/schema within which correspondence is managed may paradoxically result in a reduction in recordkeeping efficiency and reliability.

The paper studies the systems of paired contracts between agents of two complementary groups (workers and firms, students and universities, depositors and banks). Multiple contracts are allowed, as well as flexible contracts when the contract is concluded with some intensity. Agent preferences are described using choice functions. It is shown that if these choice functions satisfy the condition that we call conservativeness, then there are so-called stable systems of contracts, when it is unprofitable for any pair of counterparties to change the concluded contracts. The existence of a stable system of contracts is established using the transfinite process of sequential approximation, which generalizes the classical Gale−Shapley algorithm. As a result, we relieved of the finiteness conditions of the set of contracts. Such properties of stable systems as polarization and latticeness are also studied.

The Supreme Court’s recent decision in R v Adams [2020] UKSC 19 was made partly on the basis of an assumption that the invalidity of the interim custody order made in respect of the appellant would automatically result in the quashing of his convictions for escaping detention on the basis of that order under paragraph 38(a) of Schedule 1 to the Northern Ireland (Emergency Provisions) Act 1973. However, to make this assumption is to skip a crucial step in the required reasoning: construction of the statutory offence the appellant was convicted of. Several arguments are put forward suggesting an alternative construction of paragraph 38(a). That construction holds that the paragraph 38(a) offence not only prohibits escape from detention under a valid interim custody order, but also from detention under an ostensibly valid, but nonetheless technically invalid, interim custody order.

To address delay and backlog at civil courts, we propose a procedural rule that we refer to as preordered service to replace sequential service of low-profile cases for breach of contract. Courts preannounce a list that uses uniquely identifying information to rank potential low-profile contracts, like a combination of contracting parties' taxpayer numbers. They use this list to schedule initial hearings of filed low-profile contract cases in that order. In theory, unlike sequential service, preordered service ensures efficiency in a population of investment games through unraveling. Results from a laboratory experiment suggest that it may substantially reduce court caseloads.

Doodle polls allow people to schedule meetings or events based on time preferences of participants. Each participant indicates on a web-based poll form which time slots they find acceptable and a time slot with the most votes is chosen. This is a social choice mechanism known as approval voting, in which a standard assumption is that all voters vote sincerely—no one votes “no” on a time slot they prefer to a time slot they have voted “yes” on. We take a game-theoretic approach to understanding what happens in approval voting assuming participants vote sincerely. While our instances are framed in the context of the Doodle poll application, the results apply more broadly to approval voting. First we characterize Doodle poll instances where sincere pure Nash Equilibria (NE) exist, under lexicographic tie-breaking, random candidate, and random voter tie-breaking. We then study the quality of such NE voting profiles in Doodle polls, showing the price of anarchy and price of stability are both unbounded, even when a time slot that many participants vote yes for is selected. Finally, we find some reasonable conditions under which the quality of the NE (and strong NE) is good.

El presente trabajo de investigación pretendió demostrar como la Ejecución curricular se relaciona con el desempeño docente en cuanto al cumplimiento de lo programado en los respectivos sílabos universitarios y en las diversas áreas temáticas de acuerdo a un cronograma, metodología, materiales, evaluación. La metodología utilizada es de Tipo Básico, Diseño no experimental de Nivel de contraste de Hipótesis descriptiva - correlacional, porque se establece una relación entre las variables Ejecución curricular y Desempeño docente, según la perspectiva de los propios estudiantes de la Facultad de educación. La técnica empleada fue la encuesta. La muestra estuvo conformada por 80 estudiantes, el muestreo se efectuó por selección aleatoria. Los resultados fueron, p=0.000. Entonces, existe suficiente evidencia estadística para rechazar la H0. En consecuencia, se demostró que existe relación entre las variables y no al azar. Por lo tanto, se concluye que existe una relación significativa entre la Ejecución curricular y el Desempeño docente, según los estudiantes de formación profesional universitaria. (r=0,895 y p=0,000); es decir, a mejor Ejecución curricular mejor Desempeño docente.

More than 70% of characters in the source code are used to label identifiers. Consequently, identifiers are one of the most important source for program comprehension. Meaningful identifiers are crucial to understand and maintain programs. However, for reasons like constrained schedule, inexperience, and unplanned evolution, identifiers may fail to convey the semantics of the entities associated with them. As a result, such entities should be renamed to improve software quality. However, manual renaming and recommendation are fastidious, time consuming, and error prone, whereas automating the process of renamings is challenging: (1) It involves complex natural language processing to understand the meaning of identifers; (2) It also involves difficult semantic analysis to determine the role of software entities. Researchers proposed a number of approaches and tools to facilitate renamings. We present a survey on existing approaches and classify them into identification of renaming opportunities, execution of renamings, and detection of renamings. We find that there is an imbalance between the three type of approaches, and most of implementation of approaches and evaluation dataset are not publicly available. We also discuss the challenges and present potential research directions. To the best of our knowledge, this survey is the first comprehensive study on renamings of software entities.

The general principles of automatic control of aircraft engines and functionally related systems in the conditions of their stand tests are suggested. These principles are prospectively reduced to six sequentially implemented procedures or steps. In accordance with these principles, the control of aircraft engine parameters is carried out by a computer-aided test equipment (CTE) based on a computer complex that implements algorithms based on Boolean algebra and the algebra of events and states. These algorithms allow control procedures to be carried out in dynamic mode in accordance with the schedule of testing an aircraft engine. With this control, the specified sequence of operating modes of the aircraft engine undergoing testing is observed without fixing them in time and with the possibility of skipping or repeating individual modes. Parameters are monitored at each of the next aircraft engine operating modes only after all parameters are checked in the previous mode and the value of the main determining parameter reaches the value determined for this mode. During the period of transient processes, parameters are controlled only at the points of extremum of the values of the main determining parameter with fixing the time of transient processes and determining that. "In the tolerance" or "not in the tolerance" is the checked parameter and the fixed time interval. Upon arrival of the signals from the monitoring object, the time of occurrence of which is unknown, and only the time interval during which they can appear is known, any of the CTE operation modes are terminated, tolerance control of the parameters provided by the program is performed, and the previously interrupted mode is restored. Simultaneously with the tolerance control of the parameters, the time of arrival of the above signals is recorded. The group of emergency parameters is monitored continuously throughout the entire period of stand test.

Temporal consistency analysis is an important problem in Real-Time Database Systems (RTDBSs). Most of existing works on hybrid transaction co-scheduling focus on exploring effective deadline and period assignment methods which can guarantee the temporal consistency of data objects and the schedulability of transactions. To the best of our knowledge, all existing researches have not yet invested sufficient efforts on guaranteeing the Quality of Service (QoS) of control transactions and allow control transactions finish their execution after the data obtained by these control transactions expire. In this paper, we define a new problem of how to schedule a hybrid transaction set under the guarantee on QoS of control transactions. Two deadline and period assignment methods for addressing the defined problem are proposed in this work. Both the proposed methods support the Earliest Deadline First (EDF) scheduling. Extensive experiments are conducted to evaluate the performances of the proposed methods in terms of acceptance ratio, processor workload and efficiency.

This study aimed to develop a medical record retention information system with a case study at Dustira Cimahi Hospital. The data collection techniques used were by observations and completed by literature study which had related with the problems. Software development methods was made using waterfull. From the research conducted, it was found several problems associated with the retention information system which has running, such as: the implementation of retention was done directly with sorting out medical record file without the computer, the absence of a retention schedule medical record file, there is no storage space inactive and off medical record file. Therefore it is necessary to develop a medical record retention information system in the form of an application implemented with the Microsoft Visual Basic.Net 2010 programming language and the Database Access System / DBMS Microsoft Access. So that this application is expected to help hospitals in overcoming file retention problems and data retention processing can be better in the future.

Background Evaluating blood ordering and subsequent development of a blood ordering schedule can decrease over-ordering of blood among pediatric surgical patients. The objective is to assess our practice of blood utilization using various blood utilization indices and calculate the Maximal Surgical Blood Order Schedule (MSBOS). This is a cross-sectional study for 3 years that included patients (≤ 18 years old) who underwent major surgical procedures in the Philippine Children’s Medical Center. Data included type of surgery, age and sex, number of units crossmatched, number of units transfused, and timing of transfusion. Indices were calculated. Results This study revealed that the utilization rate was only 39.1% of blood among a total of 5314 cases done. The indices were analyzed according to different procedures among different age groups. Procedures for head and neck, colorectal, ostomy, solid tumors, genitourinary abnormalities, upper gastrointestinal, and appendectomy had CT (crossmatched to transfusion) ratio exceeding 2.0, indicating inappropriate blood ordering. Major abdominal, major thoracic, and hepatobiliary surgery all have CT ratio Conclusions The MSBOS is largely utilized to the adult population but its creation can also be utilized among pediatric patients. Our data shows that in majority of elective pediatric surgical procedures, routine crossmatch is not necessary which is proven by our high underutilization of requested blood products.

Many theories of conditioning describe learning as a process by which stored information about the relationship between a conditioned stimulus (CS) and unconditioned stimulus (US) is progressively updated upon each occasion (trial) that the CS occurs with, or without, the US. These simple trial-based descriptions can provide a powerful and efficient means of extracting information about the correlation between 2 events, but they fail to explain how animals learn about the timing of events. This failure has motivated models of conditioning in which animals learn continuously, either by explicitly representing temporal intervals between events or by sequentially updating an array of associations between temporally distributed elements of the CS and US. Here, I review evidence that some aspects of conditioning are not the consequence of a continuous learning process but reflect a trial-based process. In particular, the way that animals learn about the absence of a predicted US during extinction suggests that they encode and remember trials as single complete episodes rather than as a continuous experience of unfulfilled expectation of the US. These memories allow the animal to recognize repeated instances of nonreinforcement and encode these as a sequence that, in the case of a partial reinforcement schedule, can become associated with the US. The animal is thus able to remember details about the pattern of a CS's reinforcement history, information that affects how long the animal continues to respond to the CS when all reinforcement ceases. (PsycINFO Database Record (c) 2019 APA, all rights reserved).

The need for countering Advanced Persistent Threat (APT) attacks has led to the solutions that ubiquitously monitor system activities in each enterprise host, and perform timely attack investigation over the monitoring data for uncovering the attack sequence. However, existing general-purpose query systems lack explicit language constructs for expressing key properties of major attack behaviors, and their semantics-agnostic design often produces inefficient execution plans for queries. To address these limitations, we build AIQL, a novel query system that is designed with novel types of domain-specific optimizations to enable efficient attack investigation. AIQL provides (1) domain-specific data model and storage for storing the massive system monitoring data, (2) a domain-specific query language, Attack Investigation Query Language (AIQL) that integrates critical primitives for expressing major attack behaviors, and (3) an optimized query engine based on the characteristics of the data and the semantics of the query to efficiently schedule the execution. We have deployed AIQL in NEC Labs America comprising 150 hosts. In our demo, we aim to show the complete usage scenario of AIQL by (1) performing an APT attack in a controlled environment, and (2) using AIQL to investigate such attack by querying the collected system monitoring data that contains the attack traces. The audience will have the option to perform the APT attack themselves under our guidance, and interact with the system and investigate the attack via issuing queries and checking the query results through our web UI., Comment: demo paper, 4 pages. arXiv admin note: text overlap with arXiv:1806.02290

In the mid-1980s, the Anthropology Division of the American Museum of Natural History (AMNH) began the creation of digital resources as a means of collections access. Much of the database work was a secondary component of projects funded by outside grants and driven by new accountability mandates. The ongoing upgrading process was sporadic in its progress, but it still accomplished the primary goals of improved housing for collections and an exhaustive database. This paper discusses how the historical complications of the data, the scale of the database, its irregular schedule of funding, and deadline-driven projects resulted in inconsistency in data and difficulty in use. Although the examples provided will be specific to the AMNH Anthropology database, the circumstances and issues are common to many databases and the approaches presented broadly applicable. The discussion includes the practices used to mitigate the negative impact of these problems and the way the Division is positioning itself for the future, even as the database continues to provide unprecedented public and institutional access to and utility for the AMNH Anthropology collections.

Optimistic concurrency control (OCC) protocols validate whether a transaction has conflicts with other concurrent transactions after this transaction completes its execution. In this work, we demonstrate that the validation phase has a great influence on the performance of modern in-memory database systems, especially under heterogeneous workloads. The cost of validating operations in a transaction is determined by two main factors. The first factor is the operation type. An OCC protocol would take much less cost on validating a single-record read operation than validating a key-range scan operation. The second factor is the workload type. Existing schemes in OCC variants for validating key-range scan perform differently under various workloads. Although various validation schemes share the same goal of guaranteeing a transaction schedule to be serializable, there are remarkable differences between the costs they introduced. These observations motivate us to design an optimistic concurrency control which can choose a low-cost validation scheme at runtime, referred to as adaptive optimistic concurrency control (AOCC). First, at transaction-level granularity, AOCC can assign a validation method to a transaction according to the features of its operations. Furthermore, for each operation in a transaction, the validation method is selected according to not only the number of accessed records but also the instant characteristics of workloads. Experimental results show that AOCC has good performance and scalability under heterogeneous workloads mixed with point accesses and predicate queries.

This article presents a modular approach that reduces the labor costs for the technological preparation of small-scale metalworking production. Its idea is to formalize the technological processes, allowing generating them and their documentation from pre-prepared parameterized templates stored in the special database. Details to be processed are represented as the structures of their basic geometric components. For the template of machining operations for each component, symbolic parameters are fixed, defining the workpiece used, cutting tools options, machining modes, etc. The result of formalization is an automatically generated technological route in the form of an MSC diagram encoding it as a sequence of macro-operations for the machinery. This symbolic model is adapted to a specific instance of the detail being manufactured by replacing the symbolic variables with specific values set by the technologist. The MSC diagram is supplemented with the results of time and cost calculations of technological routes, which allows selection of the most efficient one. The correctness of the technological routes is ensured in the process of symbolic verification by checking the permissible ranges of parameters of the MSC diagram, as well as checking the correctness of order and compatibility of operations in the sequence. The results of the whole process obtained from the MSC diagram are the set of technological documentation of preproduction, which, in particular, includes a set of operating cards, and the fine-tuned schedule of production after its digital modeling with the real resources of the workshop taken into account. According to technologists, by applying the described automation, the time to prepare documentation for details of medium complexity is reduced from several weeks to 1-2 days.

This study aims to melakukakan analysis of the effect of the transaction log on a computer based system either on a single system tired, and two tiered through simulated transactions bank system with technology client / server to get a log of transactions on the database system Microsoft Windows SQL Server 2008 R2 management studio a data base. Methods or algorithms are used to analyze the transaction log on the system used is a log-based recovery algorithm.The results based on the analysis, showed that the use of query local database and query the database using sotere procedure to get the transaction log for troubleshooting transactions on the database system via a user interface is built to help job database administrator (DBA), much more good compared with conventional systems. Based on the experiments that the log of transactions to be controlled, in-undo, Re-do, or Rolled-Back, even deleted if no longer required automatically to maintain the scalability of computer users in the future, by setting the growth of a standard database from 10% to > 32%, and the establishment of a maintenance schedule to ensure that the reserve database is always available and up to date.

This research was designed for the purpose of patients with eye defects who have difficulty visiting their doctors due to age, distance, or the manual processes involved in the existing system. We designed an approach to assist people get attended to by building a system that allows users register and log into the system, book appointments, view doctors and equipment used or available in the existing system. Joint Application Development (JAD) was the system methodology used, this is because it involves continuous interaction with the users and different designers of the system in development. Quantitative and qualitative research methodology were employed, and method of data collection used were questionnaire, interview, and internet. The resultant website developed using JavaScript, CSS, PHP, HTML, and MySQL allows users register and log in, schedule doctor’s appointment, and book surgery.

Throughput performance is a critical issue in blockchain technology, especially in blockchain sharding systems. Although sharding proposals can improve transaction throughput by parallel processing, the essence of each shard is still a small blockchain. Using serial execution of smart contract transactions, performance has not significantly improved, and there is still room for improvement. A smart contract concurrent execution strategy based on concurrency degree optimization is proposed for performance optimization within a single shard. This strategy is applied to each shard. First, it characterizes the conflicting contract feature information by executing a smart contract, analyzing the factors that affect the concurrent execution of the smart contracts, and clustering the contract transaction. Second, in shards with high transaction frequency, considering the execution time, conflict rate, and available resources of contract transactions, finding a serializable schedule of contract transactions by redundant computation and a Variable Shadow Speculative Concurrency Control (SCC-VS) algorithm for smart contract scheduling is proposed. Finally, experimental results show that the strategy increases the concurrency of smart contract execution by 39% on average and the transaction throughput of the whole system by 21% on average.

In the current world, time is considered an immense treasure. People never want to waste the time and schedule their day with prioritized works. The thing people fail to understand is trying to balance the time they forget to balance their mental states. For a healthy run of the body, we not only require a healthy exterior but also a fruitful interior. When our mind runs smoothly then the body reflects the same. Failing to understand this concept the people ignore their mental balance, resulting in effects such as stress, sensation to commit extreme measures, etc. This type of behavior is always dangerous to them and also to the society around them. To contain this type of sociopathic behavior, psychologists and other professionals were trying to develop a system which detects such type of behaviors. But in this paper, we propose a system that intends to cut the problem in its roots than identifying it later. The system proposed is a semi-robotic interface that interacts with the user in toil and solves their cause of distress and maintains a mental equilibrium of that particular user. The introduction of this system brings a drastic change in the society which always struggles to maintain peace and equilibrium with itself.

The study aims to discuss about legal protection for buyers (car indenters) considering that in new car sale-purchase transactions on indent basis, often having various problems done by the seller (car dealer). The problem included in the transaction in sale-purchase transaction because the legal position of the customer (indenter) was weaker than the position of the businessman (seller). Another problem was the long period of indentation and sometimes exceeding the promised schedule The research method used was normative juridical approach by comparison between das sein (the facts found) and das sollen (which should be based on statutory regulations). The results of the study show that based on the problems that occur in new car sale-purchase transactions on indent basis, guided by Law on Customer Protection in Article 2, Article 7, Article 15, Article 16, Article 18 (1a), and Article 1338 verse (3) of Civil Code, legal protection for indenter car was required. The legal protection was prioritized in the aspect of equality, in line with the injustice between the seller and the buyer, especially in their legal positions. Furthermore, as a form of civil accountability for a businessman who had bad deed, in legally formal, Article 60 of Law on Customer Protection was imposed as a form of civil accountability and Article 62 of Law on Customer Protection as a form of criminal sanction.

House prices have increased faster than average income in many countries over the last decade, raising concerns on the affordability of housing. We study the impact of transaction taxes on the real estate market and the effectiveness of tax subsidies to make housing more affordable. We show how the demand and supply elasticities for housing determine the price impact of tax subsidies and the distribution of gains between buyers and sellers. We then use data on all real estate transactions in Luxembourg from 2007 to 2018 to estimate the elasticity of housing supply and demand. For identification, we exploit discontinuities in the transaction tax schedule as well as rules on tax subsidies for new constructions. Our estimates suggest that the elasticity of house prices to transaction taxes is 0.27, so buyers capture a large part of the surplus from the subsidies.

When a major corruption scandal emerged during the organisation of the 2015 Universal Exposition in Milan, the government set up a brand-new system of preliminary controls for the procurement of all Expo contracts. Controls can certainly be beneficial in many respects, but they inevitably complicate procedures and even produce delays and red tape. Indeed, for a time-pressed schedule as that of the 2015 Expo, preliminary controls were considered a fatal blow. Contrary to expectations, not only bureaucratic delays did not materialise, but controls actually sped up procedures. Therefore, it is worth explaining and learning from this unique outcome. Can it be replicated in other cases? We answer this question by building a model of controls based on programme and non-programme features that support three causal mechanisms: threat attribution, repeated interactions, and actor certification. Such a model is an indispensable tool for designers; it allows to explain how controls work in practice and provide clues on how to adjust the design of the policy to changing contexts. In this respect, the analysis of the Expo controls and their subsequent replications raises several methodological issues relevant to extrapolation-oriented research.

In this paper, we describe our system for the AAAI 2021 shared task of COVID-19 Fake News Detection in English, where we achieved the 3rd position with the weighted \(F_1\) score of 0.9859 on the test set. Specifically, we proposed an ensemble method of different pre-trained language models such as BERT, Roberta, Ernie, etc. with various training strategies including warm-up, learning rate schedule and k-fold cross-validation. We also conduct an extensive analysis of the samples that are not correctly classified. The code is available at: https://github.com/archersama/3rd-solution-COVID19-Fake-News-Detection-in-English.

The transition from construction to operations of the Thirty-Meter-Telescope (TMT) will happen over a phase of "early-operations” that will last several years to encompass the technical and science commissioning of its main systems, and will conclude when the facility enters "steady-state operations” (early 2030s according to the current schedule). In this talk, we will present the current plan for technical and scientific operations of the Thirty-Meter-Telescope, including a description of its organizational structure, staffing and day-to-day activities. TMT's science operations model will be aimed at optimizing the science impact of the TMT and its operations efficiency, while providing a high-level of support to TMT users over all phases (submission, implementation and (post-)execution) of their science programs.

A magnetoencephalography (MEG) recording for clinical purposes requires a different level of attention and detail than that for research. As contrasted with a research subject, the MEG technologist must work with a patient that may not fully cooperate with instructions. The patient is on a clinical schedule, with generally no opportunity to return due an erroneous or poor acquisition. The data will generally be processed by separate MEG analysts, who require a consistent and high-quality recording in order to complete their analysis and clinical report. To assure a quality recording, (1) MEG technologists must immediately recheck their scalp measurement data during the patient preparation, in order to catch disturbances and ensure registration accuracy of the patient fiducials, electrodes, and head position indicator (HPI) coils. During the recording, (2) the technologist must ensure that the patient remains quiet and as far in as possible in the helmet. After the recording, (3) the technologist must consistently prepare the data for subsequent clinical analysis. This paper aims to comprehensively address these matters for practitioners of clinical MEG in a helpful and practical way. Based on the authors’ experiences in recording over three thousand patients between them, presented here are a collection of techniques for implementation into daily routines that ensure good operation and high data quality. The techniques address a gap in the clinical literature addressing the multitude of potential sources of error during patient preparation and data acquisition, and how to prevent, recognize, or correct those.

We consider a basic admission control problem in which jobs with deadlines arrive online and our goal is to maximize the total volume of executed job processing times. We assume that the deadlines have a slack of at least e, that is, each deadline d satisfies d≥ (1+e)· p+r with processing time p and release date r. In addition, we require the admission policy to support immediate commitment, that is, upon a job's submission, we must immediately make the decision of if and where we schedule the job, and this decision is irreversible. Our main contribution is a deterministic algorithm with nearly optimal competitive ratio for load maximization on multiple machines in the non-preemptive model. Previous results either only held for a single machine, did not support commitment, or required job preemption and migration.

Advent of modern means of living and busy schedule, a person generally forget to look after the health and thereby prone to some of severe health disorders. From various researches it is clear that Parkinson Disease (PD) basically occur due to negligence of an individual. It is a disorderliness that affects a small part of the brain that manages the gesture and mental order. The syndrome vary from person. Generally PD is identified from a certain age level but recent studies shown that people of any age group can suffer from PD. Considering the extremity, if there is an system to identify the major factors of PD then it would be of great importance. Thus an expert system named Transparent Decision Rules for Parkinson Disease (TD-Rules-PD) is proposed in this paper which finds out the high risk factor of PD. TD-Rules-PD consist of four phases: Rule Production, Rule selection, Rule pruning and Merging and Identify High Risk Factor. Rule Production stage uses Decision tree to produce rules. Rule selection step choose the most efficient rules, from the so collected rules Rule Pruning and Merging step drops the confusing and insignificant rules and then combines the flittered rule set to a single rule and finally Identify High Risk Factor stage finds out the most prevailing factor of PD.

Many sports leagues are played in a tightly scheduled round-robin format, leaving a limited time window to postpone matches. If the season cannot resume due to an external shock such as the coronavirus pandemic in 2020, the ranking of the teams becomes non-trivial: it is necessary to account for schedule imbalances and possibly for the different number of matches played. First in the literature, we identify a set of desired axioms for ranking in these incomplete tournaments. It is verified that the generalised row sum, a parametric family of scoring rules, satisfies all of them. In particular, the well-established least squares method maximizes the influence of the strength of opponents on the ranking. Our approach is applied for six major premier European soccer competitions, where the rankings are found to be robust concerning the weight of adjustment for the strength of the opponents. Some methodologically simpler alternative policies are also discussed., Comment: 16 pages, 3 tables

International audience; In [10] and [12] the authors showed that elementary cellular automata rules 0, 3, 8, 12, 15, 28, 32, 34, 44, 51, 60, 128, 136, 140, 160, 162, 170, 200 and 204 (and their conjugation, reflection, reflected-conjugation) are not maximum sensitive to synchronism, i.e., they do not have a different dynamics for each (non-equivalent) block-sequential update schedule (defined as ordered partitions of cell positions). In this work we present exact measurements of the sensitivity to synchronism for these rules, as functions of the size. These exhibit a surprising variety of values and associated proof methods, such as the special pairs of rule 128, and the connection to the bissection of Lucas numbers of rule 8.

In this paper, we present GraphTM, an efficient and scalable framework for processing transactions in a distributed environment. The distributed environment is modeled as a graph where each node of the graph is a processing node that issues transactions. The objects that transactions use to execute are also on the graph nodes (the initial placement may be arbitrary). The transactions execute on the nodes which issue them after collecting all the objects that they need following the data-flow model of computation. This collection is done by issuing the requests for the objects as soon as transaction starts and wait until all required objects for the transaction come to the requesting node. The challenge is on how to schedule the transactions so that two crucial performance metrics, namely (i) total execution time to commit all the transactions, and (ii) total communication cost involved in moving the objects to the requesting nodes, are minimized. We implemented GraphTM in Java and assessed its performance through 3 micro-benchmarks and 5 complex benchmarks from STAMP benchmark suite on 5 different network topologies, namely, clique, line, grid, cluster, and star, that make an underlying communication network for a representative set of distributed systems commonly used in practice. The results show the efficiency and scalability of our approach.

Voice interaction is becoming one of the major methods of human interaction with computers. Several mobile service providers have introduced various types of voice assistant systems such as Bixby from Samsung, Siri from Apple, and Google Assistant from Google that provide information including the schedule for a day, the weather, or methods to control the device to perform a task such as playing music. Although the voice assistant system provides various types of functions, generally, the users do not understand what functions the system can support. We conducted a control task analysis based on expert interviews and found that the main bottleneck of using a voice assistant system is that the user cannot know all the commands. Thus, we believe that presenting recommendable commands is an effective way to increase user engagement. Through buzz data analysis, we discovered what functions could be used and determined the relevant usage context. Subsequently, we performed context modelling and designed the user interface (UI) of a voice assistant system and conducted a case study. Through this case study, we proved that presenting commands on a UI induced more user engagement and usability.

To improve the performance for high-contention workloads, modern main-memory database systems seek to design efficient lock managers. However, OLTP engines adopt the classic FCFS strategy to process operations, where the generated execution order does not take current and future conflicts into consideration. In this case, lock dependencies will happen more frequently and thus resulting in high transaction waiting time, referred to as lock thrashing, which is proved to be the main bottleneck of lock-based concurrency control mechanisms. In this paper, we present a transaction scheduler that generates efficient execution order to alleviate the lock thrashing issue. To proactively resolve conflicts, LOTAS predicts which data will be accessed by following operations through building Markov-based prediction graphs. Then LOTAS uses the information to schedule transactions by judging whether a transaction needs to be deferred to acquire locks. Experimental results demonstrate that LOTAS can significantly reduce the lock waiting time and improves the throughput up to 4.8x than the classic FCFS strategy under highly contended workloads.

It's the time of technology; individuals are extremely keen about concluding their business (money) transactions and virtually each task through internet-based services. A system is created to integrate all applications in one system by using Universal System victimization RF-ID (Radio Frequency Identification) card. A universal system strictly designed to require entire advantage of the facilities provided by the institute, that helps students to avoid wasting time exceedingly in during their busy schedule. This is achieved by automating the many services by the institute. This also includes automation of trip management of field to field bus services, all controlled through an applicable controller like Arduino, Raspberry-pi. An internet page access to administrator is provided to manage student wallet where students are connected to the system through a client- server system which stores the database of the student information.

Concurrency bugs are difficult to diagnose and fix, due to the nature of the bugs and how they manifest themselves during execution. Traditional approaches for diagnosing concurrency bugs attempt to reproduce the exact execution schedule which reveals the bug, resulting in high runtime overhead. In this paper, we present our work in identifying concurrency bugs using resource consumption footprints. This is based on the observation that resource access and consumption patterns are critical indications of the run-time behavior of concurrent software, and can be used as a powerful mechanism to guide the software debugging process. We demonstrate that monitoring resource footprints at runtime can effectively help detect software bugs. Specifically, for MPI programs, a simple SVM classifier can detect deadlocks with high accuracy using only the CPU usage patterns.

The present experiments studied impulsivity by manipulating the delay between target responses and presentation of a reinforcer. Food-deprived SHR, WKY, and Wistar rats were exposed to a fixed-time 30-s schedule of food pellet presentation until they developed stable patterns of water spout-licking and magazine-entering. In successive phases of the study, a resetting delay contingency postponed food delivery if target responses (licks or entries) occurred within the last 1, 2, 5, 10, 20, 25, or 28 s of the inter-food interval. Response-food delays were applied independently for the two behaviors during separate experimental phases, and order of presentation and the behavior that was punished first were counterbalanced. Licking was induced in the order of Wistar > SHR > WKY, and magazine entries were in the order of SHR > WKY > Wistar. Magazine entries showed steeper delay gradients than licking in SHR and Wistar rats but were of similar great inclination in the WKY rats. The different responses were differentially sensitive to delays. This suggests a different ordering of them in the interval between reinforcers. It also has implications for attempts to change impulsive behavior, both in terms of the nature of the response and its removal from reinforcing consequences.

Two extended preventive replacement models for systems that execute projects at random times are discussed in this paper. The system is subject to shocks at which the system experiences one of two kinds of failures whose probabilities depend on age. A type I failure will cause a minor failure of the system and is fixed by a minimal repair. A type II failure will lead to a catastrophic failure of the system, and a corrective replacement is required at such failure. First, we investigate a preventive replacement policy where the system is replaced at the m-th type I failure, or at the time instant when the n-th working project is completed, or at age τ, or at the first type II failure, whichever occurs first. In addition, we also investigate another preventive replacement model where the system is replaced preventively at the time instant when the n-th working project is completed, or at the m-th type I failure, or at age τ, whichever occurs last, and is replaced correctively at the first type II failure. We formulate the long-run expected cost rate for each replacement policy, and determine analytically the optimum preventive replacement policy. We also show that several previous replacement models in the literature are special cases of our models. Finally, a procedure for finding the optimum preventive replacement schedule is presented and some numerical examples are given illustrating the present policies.

A security control system is the key element at an airport because each passenger must undergo security check before boarding. Security control must be performed efficiently while maintaining a high level of safety. This article presents a security control model that is applied at a given airport. A set of variable input data describing the model and data received by the user as a result of its use is presented. The security control model is developed using the FlexSim software and based on security control model implementation, for which algorithm for managing the security checkpoint operation schedule are used. The algorithm allows a capacity lack margin to be established in the security control system in order to lower the system operation cost and maintain an acceptable passenger service quality. We describe two basic patterns of implementing the security control process: single- and double-lane counters. The security control counter has been divided into specific areas (queues). The developed model was implemented into the management system of the security checkpoint at Wroclaw Airport. Measures of the system's capacity are determined for the following sample input data (system characteristics and the stream of passenger reports): the average duration of a passenger's stay in the security control system and the number of operator work hours depending on the adopted management strategy. The developed model can be used in existing security control systems and also to evaluate the operation of a system at its design stage.

Widespread agreement that a political reform is necessary is no guarantee that it is actually undertaken in a timely manner. There is often a delay before action is taken and reform packages that would be most efficient to implement all at once are often done only gradually. We propose a theoretical model explaining this behavior and show that when voters have present-biased, time-inconsistent preferences, gradualism can arise in equilibrium and be welfare-enhancing. This is because without the possibility for gradualism, time-inconsistent voters would delay implementing the reform even more. Using a citizen candidate model, we allow the agenda setter, who decides which reform schedule to put to vote, to be endogenously determined. We show that voters who are aware of their own time inconsistency use the election of the agenda setter as a commitment device and appoint an agent who is more patient than the median voter in order to avoid full procrastination and to achieve efficiency-maximizing gradualism.

Localizing concurrency faults that occur in production is hard because, (1) detailed field data, such as user input, file content and interleaving schedule, may not be available to developers to reproduce the failure; (2) it is often impractical to assume the availability of multiple failing executions to localize the faults using existing techniques; (3) it is challenging to search for buggy locations in an application given limited runtime data; and, (4) concurrency failures at the system level often involve multiple processes or event handlers (e.g., software signals), which can not be handled by existing tools for diagnosing intra-process(thread-level) failures. To address these problems, we present SCMiner, a practical online bug diagnosis tool to help developers understand how a system-level concurrency fault happens based on the logs collected by the default system audit tools. SCMiner achieves online bug diagnosis to obviate the need for offline bug reproduction. SCMiner does not require code instrumentation on the production system or rely on the assumption of the availability of multiple failing executions. Specifically, after the system call traces are collected, SCMiner uses data mining and statistical anomaly detection techniques to identify the failure-inducing system call sequences. It then maps each abnormal sequence to specific application functions. We have conducted an empirical study on 19 real-world benchmarks. The results show that SCMiner is both effective and efficient at localizing system-level concurrency faults.

Education is an essential element in our life in order to build a better future for young generations. A school must have a better communication platform between teachers and parents to ensure collaboration in monitoring the children’s education. Due to time confinement and restrictive schedule, parents nowadays are not able to monitor their children’s progress accordingly in terms of school activities and student’s performance. Furthermore, instruction from the teachers toward the parents were not delivered properly. These are caused by multiple factors such as the inability to deliver messages correctly due to young age. Therefore, this paper proposes online Parent-Teacher Assisting Monitoring Application (PTAMA) system. The PTAMA system will be built in web based and mobile application system. There are five features in PTAMA system involve attendance, announcements, homework, feedback and letters. In this system, student’s attendance is recorded using Quick Response (QR) Code that is printed into student matric card. This system is specifically designed for primary school students. Rapid Application Development (RAD) cycle is chosen as a methodology to develop this PTAMA system. By having this PTAMA system, parents and teachers can collaborate to monitor the students’ performance.

After the full liberalization of Japanese retail electricity market, a number of new entities started their business in the electricity industry. All entities are obligated to form the balancing responsible parties (BRPs) which keep individual supply and demand in balance over a given timeframe. As entities get diverse, more flexible utilization of bilateral contract is needed which accommodates the last minute change of agreed offtake schedule between the contract parties. However, this new model brings challenges concerning unclear responsibility, misunderstandings of the latest plan and complex operation. To solve these issues, we introduce a new blockchain-based bilateral transaction platform. It enables participants to change prescheduled multiple contracts simultaneously in a cost-effective way. After each transaction is agreed, the platform transmits updates to all participants concerned using blockchain functions. The feasibility of implemented logic was evaluated by simulations under three different system conditions. The results show that BRPs' imbalance was reduced in all scenarios by the proposed approach.

Background Healthcare delivery organizations face increasing pressure to manage the use of medications in terms of safety, waste reduction, and cost containment. Objective To describe a computerized provider order entry (CPOE) system intervention to optimize use of a commonly ordered, high‐cost therapeutic: intravenous immune globulin (IVIG). Design Description of IVIG order configuration, medication use patterns, and subsequent order set configuration development in a CPOE system. Measurements IVIG orders were extracted from the CPOE system before and after the implementation of a specialty orderset to determine the indications for use, dosing, and duration of therapy. Orders were compared to a theoretical dosing schedule created from published evidence and data from a prior medication use evaluation. Results During 36 months before the implementation of the IVIG order set, 1965 IVIG orders were reviewed. The prescribed IVIG dose varied considerably from the expected dose (mean = −1.8, range = −4.9‐1.5). In the 27 months after order set implementation, 848 IVIG orders were reviewed. The prescribed IVIG dose was closer to the expected dose (mean = −1.2, range = −3.9‐2.6, P

Cats, with latin names felis catus, has been cared by many people. Consequently, by pet owners, they need to pay attention to caring their cats. However, cat owners cannot be always together with their cat, so cat care cannot be carried out optimally. Thus, there's so many risks encountered by leaving the cat alone such as obesity, stress, negative interaction with other cat, etc. At the same time, cat daycare may not suitable with our cat behavior and that places are usually fully booked in holiday time. For that, a solution to the problems is needed. Solutions to the problems are defined by using internet of things technology. Hardware, software, and communication, as an aspect of internet of things, are considered to build the entire system. The system is divided into several sub-system that is cat feeder, cat playmate, automatic cat door, cat monitor, and mobile apps. Each of them representing certain problem which has been analyzed. The system is built to fulfill cat care needs to feed, play, keep them save, and monitor them. The features for caring the cats can be executed through a mobile phone with internet access or by schedule defined by users. This system is implemented by making four hardware prototypes, mobile apps, and communication processing through third party services and through own-built platform. The tests conducted in the prototypes showed good results with communication delay below 1.5 second, food amount measurement tolerance below 2 grams, working door functionality, and 15 fps video streaming with latency below 3 second.

Wheel running, especially in the homecage, has been widely used to study the neurobiology of exercise because animal tends to use it voluntarily. However, as for each reward, its consumption (in the present case, running performance) does not specifically provide information on its incentive value, i.e., the extent to which animals are motivated to run independently from their consumption of that reward. This is a major drawback, especially when focusing on the neurobiology governing the pathological imbalances between exercise and e.g., feeding (obesity, anorexia nervosa). Yet, few studies have shown that operant conditioning wherein wheel-running is used as a reinforcer that can be "consumed" after nose-poking or lever-pressing allows to distinguish motivation from consumption. Thus, nose-poking or lever-pressing under a progressive ratio schedule of reinforcement in animals trained under fixed ratio reinforcement schedules provides, through the so-called breakpoint, an index of running motivation. As compared to wheel-running, numerous studies have used food as a reinforcer, which helped to uncover the neurobiology of feeding. However, to our knowledge, there is no paradigm allowing the assessment of the choice between running and feeding when presented in concurrence, with the possibility to measure a priori the motivation for each reward. Herein, we describe a protocol that first permits to measure the drive for each of these two rewards before it allows to measure the preference for one over the other in a reward choice setting. This paradigm could help to better characterize the neurobiology underlying pathological imbalances between physical activity and feeding, which is the core feature of eating disorders.

Objetivo: Descrever o perfil dos erros de dispensação identificados através da instituição da conferência de tiras de medicamentos pelo farmacêutico hospitalar, e quantificar as discrepâncias geradas pelo indicador, em um hospital de alta complexidade do Estado do Paraná, no ano de 2015. Método: Estudo transversal e retrospectivo dos erros de dispensação que foram evitados pelo farmacêutico. Uma vez identificadas, as discrepâncias foram classificadas e contabilizadas, gerando um indicador do processo de trabalho (número de erros evitados/número de tiras dispensadas x 100). Posteriormente, fora realizada uma Análise de Pareto, a fim de priorizar ações de resolução de problemas. Resultados: Obteve-se um total de 27.980 prescrições, as quais originaram 48.451 tiras de medicamentos, no período estudado. Os erros de dispensação encontrados durante a conferência das tiras pelo farmacêutico somaram 1.453. O índice de erros de dispensação foi de 3 erros a cada 100 tiras. Os erros que ocorreram com maior frequência foram falta de medicamento prescrito e troca de horário do medicamento, representando juntos 61% da totalidade dos erros, sendo os mesmos erros identificados na análise no Diagrama de Pareto, como os principais alvos de intervenção na melhoria dos processos. Conclusão: A ocorrência de erros encontrada através do indicador “Índice de Erros de Dispensação” foi considerada baixa, frente aos dados encontrados na literatura. Através da Análise de Pareto, foi possível identificar os erros mais frequentes, para posterior planejamento de ações de melhoria, com vistas ao aumento da segurança do paciente.

The control of ongoing goal-directed reaches is influenced by both visual and nonvisual sensorimotor processes. Notably, intentions to produce accurate movements also influence reaching performance. However, it is not known whether these improvements associated with accuracy-based intentions can be attributed to changes in movement planning and/or online control. Notably, such improvements may come about via both visual and nonvisual online control processes. Using frequency domain analyses, the relative online contributions of visual and nonvisual subprocesses to reaching performance have been previously identified (e.g., de Grosbois & Tremblay, 2018a, 2018b). Thus, the current study tested whether the relative contributions of these online control subprocesses are influenced by instructions to be accurate. Reaching movements were completed in the presence of 3 experimental manipulations. First, vision during voluntary reaches was either provided or occluded. Second, high- and low-accuracy instruction sets were provided. And third, the predictability of visual information was manipulated through blocked and randomized feedback scheduling. The results indicated that the contribution of online visuomotor processes (i.e., visual subprocess) was increased by the availability of online vision and instructions to be accurate. In contrast, the nonvisual subprocess was promoted in the absence of online vision, but suppressed when a randomized feedback schedule was implemented with instructions to be accurate. Ultimately, instructions to be accurate increase the relative contribution of vision-based online sensorimotor processes and can decrease the contributions of nonvisual online sensorimotor processes. (PsycINFO Database Record (c) 2019 APA, all rights reserved).

Oracle Database includes a job scheduler. It can schedule jobs to run at a designated date and time. Though the Scheduler also includes chains, which are named groups of steps that work together to accomplish a task, there are some disadvantages: job dependency is not easy to set, job concurrency is not manageable, and it has no notice by text-message. The researchers designed, built and tested the Dependency Execution for Oracle Jobs for a long time. It is running smoothly after trial and trial. It is much easy to set a job which depends on other jobs by inserting a row into a configuration table, and the job can be scanned and run by background processes which are designed by researchers. On this way, this system can also record who is the job's creator, how to contact, and the time of created and estimated expires. It has concurrency control and the priority and private channel for the jobs execution of short time. Many companies have a lot of reports to do every day. It depends on the data from all over the systems to be extracted and processed. The database is so stressed every morning that it is needed to property schedule job execution. The designed system shall make a more convenient and easier configuration to create and rerun Oracle jobs. The system administrators can also analysis the log to remind the job creator to optimize the script and improve the execution efficiency and performance of the Oracle database.