Статті в журналах: "Function batch"

1

STAMBOLIADIS, E. "BREAKAGE FUNCTION FOR BATCH GRINDING." Canadian Metallurgical Quarterly 45, no. 3 (January 2006): 359–64. http://dx.doi.org/10.1179/cmq.2006.45.3.359.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

2

Haumaier, Anton. "Economic function tolerances for the batch production." ATZ worldwide 106, no. 2 (February 2004): 17–20. http://dx.doi.org/10.1007/bf03224648.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

3

Miller, Kathryn, Mark Walterfang, Sharan Randhawa, Amelia Scholes, Ramon Mocellin, and Dennis Velakoulis. "Validity and Reliability of the Behavioural Assessment Tool for Cognition and Higher Function (BATCH) in Neuropsychiatric Patients." Australian & New Zealand Journal of Psychiatry 41, no. 8 (August 2007): 697–704. http://dx.doi.org/10.1080/00048670701449203.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Objective: Patients with mental health disorders frequently have difficulties with their cognitive functioning. Assessment of cognition in this population can be complicated by psychiatric symptomatology, making standard written and verbal assessment methods difficult. In these situations, observations by nursing and allied staff of patients’ routine activities provide an important source of information about cognitive ability. The Behavioural Assessment Tool for Cognition and Higher Function (BATCH) was developed to record observations of patients’ daily functioning under subheadings that reflect cognitive domains. Its capacity to provide a measure of cognitive function through observational means was assessed in a neuropsychiatric unit. Method: A consecutive sample of 76 adult neuropsychiatry inpatients were assessed over 6 months using BATCH. BATCH measures the frequency of given behaviours grouped under 10 functional and cognitive domains: orientation, attention/concentration, personal responsibility, volition, adaptation, problem-solving/judgement, executive function, memory, language, and visuospatial function. Data from routine standardized cognitive (Mini-Mental Status Examination, MMSE; Neuropsychiatry Unit Cognitive Screening Tool, NUCOG), psychiatric (Neuropsychiatric Inventory; Health of the Nation Outcome Scale) and functional (Bristol Activities of Daily Living Scale; Barthel Index) instruments were collected to determine the relative contribution of cognitive function to scores on the BATCH. Results: A strong correlation was found between total BATCH scores and total NUCOG and MMSE scores. BATCH and NUCOG subdomains correlated significantly in all subscales. BATCH demonstrated very high internal consistency. Linear regression analysis showed that the strongest determinant of BATCH scores was cognitive function as measured on the NUCOG. A significant subscale×group effect showed lower BATCH scores in memory, orientation, attention, executive function and language in dementia sufferers compared to psychiatric and neurological patient groups. Conclusion: BATCH scores correlated strongly with pencil-and-paper measures of cognitive function. BATCH provides clinicians with a means of assessing cognitive function through behavioural observation, thus enabling assessment of patients with behavioural disturbance or severe psychopathology. This tool has practical application for adult and aged clients across all observational mental health settings.

4

Ahmadianshalchi, Alaleh, Syrine Belakaria, and Janardhan Rao Doppa. "Pareto Front-Diverse Batch Multi-Objective Bayesian Optimization." Proceedings of the AAAI Conference on Artificial Intelligence 38, no. 10 (March 24, 2024): 10784–94. http://dx.doi.org/10.1609/aaai.v38i10.28951.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We consider the problem of multi-objective optimization (MOO) of expensive black-box functions with the goal of discovering high-quality and diverse Pareto fronts where we are allowed to evaluate a batch of inputs. This problem arises in many real-world applications including penicillin production where diversity of solutions is critical. We solve this problem in the framework of Bayesian optimization (BO) and propose a novel approach referred to as Pareto front-Diverse Batch Multi-Objective BO (PDBO). PDBO tackles two important challenges: 1) How to automatically select the best acquisition function in each BO iteration, and 2) How to select a diverse batch of inputs by considering multiple objectives. We propose principled solutions to address these two challenges. First, PDBO employs a multi-armed bandit approach to select one acquisition function from a given library. We solve a cheap MOO problem by assigning the selected acquisition function for each expensive objective function to obtain a candidate set of inputs for evaluation. Second, it utilizes Determinantal Point Processes (DPPs) to choose a Pareto-front-diverse batch of inputs for evaluation from the candidate set obtained from the first step. The key parameters for the methods behind these two steps are updated after each round of function evaluations. Experiments on multiple MOO benchmarks demonstrate that PDBO outperforms prior methods in terms of both the quality and diversity of Pareto solutions.

5

Lehmann, Uwe. "Notice to the function of batch-operated sluices." Minerals Engineering 146 (January 2020): 106144. http://dx.doi.org/10.1016/j.mineng.2019.106144.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

6

Matijašic, G., and A. Glasnovic. "Batch Grinding in Laboratory Ball Mills: Selection Function." Chemical Engineering & Technology 32, no. 10 (October 2009): 1560–66. http://dx.doi.org/10.1002/ceat.200900114.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

7

Hsu, Che-Wei, and Jeffrey D. Ward. "The best objective function for seeded batch crystallization." AIChE Journal 59, no. 2 (June 14, 2012): 390–98. http://dx.doi.org/10.1002/aic.13855.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

8

Nakamura, Ayane, and Tuan Phung-Duc . "Equilibrium Analysis for Batch Service Queueing Systems with Strategic Choice of Batch Size." Mathematics 11, no. 18 (September 18, 2023): 3956. http://dx.doi.org/10.3390/math11183956.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Various transportation services exist, such as ride-sharing or shared taxis, in which customers receive services in a batch of flexible sizes and share fees. In this study, we conducted an equilibrium analysis of a variable batch service model in which customers who observe no waiting customers in an incomplete batch can strategically select a batch size to maximize the individual utilities. We formulated this model as a three-dimensional Markov chain and created a book-type transition diagram. To consider the joining/balking dilemma of customers for this model, we proposed an effective algorithm to construct a necessary and sufficient size of state space for the Markov chain provided that all customers adopt the threshold-type equilibrium strategy. Moreover, we proved that the best batch size is a non-decreasing function for i if the reward for the completion of batch service with size l is an increasing function of l assuming that a tagged customer observes i complete batches in the system upon arrival; in other words, the fee decreases as the batch becomes larger. We then derive several performance measures, such as throughput, social welfare, and monopolist’s revenue. Throughout the numerical experiment, a comparison between the present variable batch service model and regular batch service model in which customers were served in a constant batch, was discussed. It was demonstrated that the three performance measures can be optimized simultaneously in the variable batch service model, as long as the fee was set relatively high.

9

Zhang, Lianfu, Aixiang Wu, Hongjiang Wang, and Leiming Wang. "Representation of batch settling via fitting a logistic function." Minerals Engineering 128 (November 2018): 160–67. http://dx.doi.org/10.1016/j.mineng.2018.08.039.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

10

Sugiyama, Hiro, Yasuhiro Umehara, and Ernest Smith. "A sequential function chart (SFC) language for batch control." ISA Transactions 29, no. 2 (January 1990): 63–69. http://dx.doi.org/10.1016/0019-0578(90)90064-r.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

11

Harrison, P. G., and J. Bor. "Response Time Distribution in a Tandem Pair of Queues with Batch Processing." Journal of the ACM 68, no. 4 (June 30, 2021): 1–41. http://dx.doi.org/10.1145/3448973.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Response time density is obtained in a tandem pair of Markovian queues with both batch arrivals and batch departures. The method uses conditional forward and reversed node sojourn times and derives the Laplace transform of the response time probability density function in the case that batch sizes are finite. The result is derived by a generating function method that takes into account that the path is not overtake-free in the sense that the tagged task being tracked is affected by later arrivals at the second queue. A novel aspect of the method is that a vector of generating functions is solved for, rather than a single scalar-valued function, which requires investigation of the singularities of a certain matrix. A recurrence formula is derived to obtain arbitrary moments of response time by differentiation of the Laplace transform at the origin, and these can be computed rapidly by iteration. Numerical results for the first four moments of response time are displayed for some sample networks that have product-form solutions for their equilibrium queue length probabilities, along with the densities themselves by numerical inversion of the Laplace transform. Corresponding approximations are also obtained for (non-product-form) pairs of “raw” batch-queues—with no special arrivals—and validated against regenerative simulation, which indicates good accuracy. The methods are appropriate for modeling bursty internet and cloud traffic and a possible role in energy-saving is considered.

12

Sukoyo, Sukoyo, TMA Ari Samadhi, Bermawi P. Iskandar, and Abdul Hakim Halim. "Model Penjadwalan Batch Multi Item dengan Dependent Processing Time." Jurnal Teknik Industri 12, no. 2 (December 6, 2010): 69–80. http://dx.doi.org/10.9744/jti.12.2.69-80.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper investigates a development of single machine batch scheduling for multi items with dependent processing time. The batch scheduling problem is to determine simultaneously number of batch (N), which item and its size allocated for each batch, and processing sequences of resulting batches. We use total actual flow time as the objective of schedule performance. The multi item batch scheduling problem could be formulated into a biner-integer nonlinear programming model because the number of batch should be in integer value, the allocation of items to resulting batch need binary values, and also there are some non-linearity on objective function and constraint due to the dependent processing time. By applying relaxation on the decision variable of number of batch (N) as parameter, a heuristic procedure could be applied to find solution of the single machine batch scheduling problem for multi items.

13

Asfaw, Temesgen A. "Deep learning hyperparameter’s impact on potato disease detection." Scientific Temper 14, no. 03 (September 26, 2023): 582–90. http://dx.doi.org/10.58414/scientifictemper.2023.14.3.04.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this study, we reviewed various published works that used deep learning techniques to detect potato leaf disease. Deep learning techniques have shown remarkable detection performance for potato leaf disease. In particular, CNN has been shown to be efficient in extracting features from images and in identifying patterns that are challenging to identify using machine learning techniques. However, CNN architectures with different activation functions, batch sizes, and optimizers can cause different results. Therefore, in this work, a CNN model has been implemented to analyze the effect of different activation functions, batch sizes, and optimizers for the detection of potato leaf diseases. Based on the findings of three experiments, the leaky rectifier function performed best as the activation function for the convolutional neural network (CNN) model. AdaGrad’s optimizer showed superior accuracy compared to stochastic gradient descent (SGD), Adam, Adamax, and RMSProp algorithms. We also discovered that the model’s performance was even better, but only when the batch size used in the model was smaller than the size of the test dataset. The work is based on deep learning to identify potato leaf disease and provide researchers and practitioners with heuristic knowledge to help increase potato production when CNN is employed in the agricultural sector.

14

Beh, Jounghoon. "Sequential Estimation of Relative Transfer Function in Application of Acoustic Beamforming." Information 11, no. 11 (October 28, 2020): 505. http://dx.doi.org/10.3390/info11110505.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this paper, a sequential approach is proposed to estimate the relative transfer functions (RTF) used in developing a generalized sidelobe canceller (GSC). The latency in calibrating microphone arrays for GSC, often suffered by conventional approaches involving batch operations, is significantly reduced in the proposed sequential method. This is accomplished by an immediate generation of the RTF from initial input segments and subsequent updates of the RTF as the input stream continues. From the experimental results via the mean square error (MSE) criterion, it has been shown that the proposed method exhibits improved performance over the conventional batch approach as well as over recently introduced least mean squares approaches.

15

Mehta, Shubham, Harish Ramani, Nileshkumar N. Yelgatte, and Imran Rahman. "Recursive Orthogonal Least Square Based Soft Sensor for Batch Distillation." Chemical Product and Process Modeling 11, no. 3 (September 1, 2016): 241–63. http://dx.doi.org/10.1515/cppm-2015-0071.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Abstract A multiple-input and multiple-output (MIMO) model, namely Recursive Orthogonal Least Square (ROLS) based radial basis function (RBF) is developed to estimate product compositions in a batch distillation process from temperature measurements. The process data is generated by simulating the differential equations of the batch distillation process, changing the initial feed composition and boiluprate from batch to batch. Moreover, the reflux ratio is also randomly varied within each batch to represent the exact dynamics of the batch distillation. Temperature and distillate composition is correlated by the RBF trained by ROLS algorithm. A Single RBF network estimate the quality of products in real-time. The results show that ROLS based estimator give correct composition estimations for a batch distillation process. The robustness of the ROLS algorithm and low computational requirement makes the estimator attractive for on-line use.

16

Ela, Arora, and Detroja P. Ketan. "Uneven Length Batch Process Monitoring using Function Space Correspondence Analysis." IFAC Proceedings Volumes 46, no. 32 (December 2013): 613–18. http://dx.doi.org/10.3182/20131218-3-in-2045.00044.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

17

Ma, Junshui, James Theiler, and Simon Perkins. "Accurate On-line Support Vector Regression." Neural Computation 15, no. 11 (November 1, 2003): 2683–703. http://dx.doi.org/10.1162/089976603322385117.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Batch implementations of support vector regression (SVR) are inefficient when used in an on-line setting because they must be retrained from scratch every time the training set is modified. Following an incremental support vector classification algorithm introduced by Cauwenberghs and Poggio (2001), we have developed an accurate on-line support vector regression (AOSVR) that efficiently updates a trained SVR function whenever a sample is added to or removed from the training set. The updated SVR function is identical to that produced by a batch algorithm. Applications of AOSVR in both on-line and cross-validation scenarios are presented.Inbothscenarios, numerical experiments indicate that AOSVR is faster than batch SVR algorithms with both cold and warm start.

18

Cong, Tang Dac. "On the MX/G/∞ queue by heterogeneous customers in a batch." Journal of Applied Probability 31, no. 1 (March 1994): 280–86. http://dx.doi.org/10.2307/3215256.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We consider the Mx/G/∞ queue in which customers in a batch belong to k different types, and a customer of type i requires a non-negative service time with general distribution function Bi(s) (1 ≦ i ≦ k). The number of customers in a batch is stochastic. The joint probability generating function of the number of customers of type i being served at a fixed time t > 0 is derived by the method of collective marks.

19

Cong, Tang Dac. "On the MX/G/∞ queue by heterogeneous customers in a batch." Journal of Applied Probability 31, no. 01 (March 1994): 280–86. http://dx.doi.org/10.1017/s0021900200107545.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We consider the Mx/G/∞ queue in which customers in a batch belong to k different types, and a customer of type i requires a non-negative service time with general distribution function Bi (s) (1 ≦ i ≦ k). The number of customers in a batch is stochastic. The joint probability generating function of the number of customers of type i being served at a fixed time t > 0 is derived by the method of collective marks.

20

Wang, Hanmo, Runwu Zhou, and Yi-Dong Shen. "Bounding Uncertainty for Active Batch Selection." Proceedings of the AAAI Conference on Artificial Intelligence 33 (July 17, 2019): 5240–47. http://dx.doi.org/10.1609/aaai.v33i01.33015240.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The success of batch mode active learning (BMAL) methods lies in selecting both representative and uncertain samples. Representative samples quickly capture the global structure of the whole dataset, while the uncertain ones refine the decision boundary. There are two principles, namely the direct approach and the screening approach, to make a trade-off between representativeness and uncertainty. Although widely used in literature, little is known about the relationship between these two principles. In this paper, we discover that the two approaches both have shortcomings in the initial stage of BMAL. To alleviate the shortcomings, we bound the certainty scores of unlabeled samples from below and directly combine this lower-bounded certainty with representativeness in the objective function. Additionally, we show that the two aforementioned approaches are mathematically equivalent to two special cases of our approach. To the best of our knowledge, this is the first work that tries to generalize the direct and screening approaches. The objective function is then solved by super-modularity optimization. Extensive experiments on fifteen datasets indicate that our method has significantly higher classification accuracy on testing data than the latest state-of-the-art BMAL methods, and also scales better even when the size of the unlabeled pool reaches 106.

21

Shinitzky, Hilla, Ron Stern, and Meir Kalech. "Batch Repair with Heuristic Search." Proceedings of the International Symposium on Combinatorial Search 7, no. 1 (September 1, 2021): 141–42. http://dx.doi.org/10.1609/socs.v7i1.18411.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Recent work has raised the challenge of efficient automated troubleshooting in domains where repairing a set of components in a single repair action is cheaper than repairing each of them separately. This corresponds to cases where there is a non-negligible overhead to initiating a repair action and to testing the system after a repair action. The problem can be formalized as a combinatorial search problem, propose a new objective function to optimize, and investigate several search frameworks to solve it. The resulting search space is not monotone, but we are able to devise an admissible heuristic for it that enables solving it optimally in some cases with A*. Empirical evaluation on standard model-based diagnosis benchmark systems compare the A*-based approach with other search algorithms

22

Cui, Qi Ming, Shao Gang Hu, Rui Zhao, Jun Liu, Sheng Wei Liu, Hong Xing Liu, and Zhen Qiang Fu. "Improvement of the Expert System Shell Pro/3 Sentence Input Function and Exploration of Batch Computers Security Assessment." Advanced Materials Research 684 (April 2013): 555–58. http://dx.doi.org/10.4028/www.scientific.net/amr.684.555.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Improvement of the expert system shell Pro/3 sentence record input function is introduced. The function of the Pro/3 inputting disposable a large quantities of sentence records corresponding to a sentence, i.e., batch inputting the sentence records, was implemented . The basic security condition assessment method of some desktop terminal computers in the power supply company was explored to achieve the expert system about these desktop terminal computers basic security condition assessment. Experimental results show that the batch inputting sentence records function is more effective and the desktop terminal computers basic security condition assessment expert system is feasible.

23

Kim, Yong-Jae, and Byung-Soo Kim. "Population-Based Meta-Heuristic Algorithms for Integrated Batch Manufacturing and Delivery Scheduling Problem." Mathematics 10, no. 21 (November 4, 2022): 4127. http://dx.doi.org/10.3390/math10214127.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper addresses an integrated scheduling problem of batch manufacturing and delivery processes with a single batch machine and direct-shipping trucks. In the manufacturing process, some jobs in the same family are simultaneously processed as a production batch in a single machine. The batch production time depends only on the family type assigned to the production batch and it is dynamically adjusted by batch deterioration and rate-modifying activities. Each job after the batch manufacturing is reassigned to delivery batches. In the delivery process, each delivery batch is directly shipped to the corresponding customer. The delivery time of delivery batches is determined by the distance between the manufacturing site and customer location. The total volume of jobs in each production or delivery batch must not exceed the machine or truck capacity. The objective function is to minimize the total tardiness of jobs delivered to customers with different due dates. To solve the problem, a mixed-integer linear programming model to find the optimal solution for small problem instances is formulated and meta-heuristic algorithms to find effective solutions for large problem instances are presented. Sensitivity analyses are conducted to find the effect of problem parameters on the manufacturing and delivery time.

24

Banik, A. D., M. L. Chaudhry, and James J. Kim. "A Note on the Waiting-Time Distribution in an Infinite-Buffer GI[X]/C-MSP/1 Queueing System." Journal of Probability and Statistics 2018 (September 2, 2018): 1–10. http://dx.doi.org/10.1155/2018/7462439.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper deals with a batch arrival infinite-buffer single server queue. The interbatch arrival times are generally distributed and arrivals are occurring in batches of random size. The service process is correlated and its structure is presented through a continuous-time Markovian service process (C-MSP). We obtain the probability density function (p.d.f.) of actual waiting time for the first and an arbitrary customer of an arrival batch. The proposed analysis is based on the roots of the characteristic equations involved in the Laplace-Stieltjes transform (LST) of waiting times in the system for the first, an arbitrary, and the last customer of an arrival batch. The corresponding mean sojourn times in the system may be obtained using these probability density functions or the above LSTs. Numerical results for some variants of the interbatch arrival distribution (Pareto and phase-type) have been presented to show the influence of model parameters on the waiting-time distribution. Finally, a simple computational procedure (through solving a set of simultaneous linear equations) is proposed to obtain the “R” matrix of the corresponding GI/M/1-type Markov chain embedded at a prearrival epoch of a batch.

25

Ma, Chun Long, Nan Li, and Ying Li. "Research on Positioning Algorithm Based on the Gaussian Distribution Function and Partial Estimation of the Fusion Theory." Applied Mechanics and Materials 851 (August 2016): 582–86. http://dx.doi.org/10.4028/www.scientific.net/amm.851.582.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

WSN’s practical application has high level of spontaneity in positioning information and is susceptible to the outside interference, which may lead to the reduction of positioning accuracy. This paper studies Gauss distribution function, the single sensor batch estimate fusion theory and RSSI positioning technique based on the design of the CC2430/1 wireless sensor network positioning system hardware and puts forward a kind of positioning algorithm of WSN based on the Gauss distribution function and batch estimation fusion theory. The algorithm first uses Gauss model to analyse RSSI, reject RSSI value of a small probability event through the Gauss model, and then applies single sensor batch estimation fusion theory to estimate in batches the fushion theory’s calculation of the RSSI value of high probability events as the RSSI value of the final positioning operation. Experiments show that using this algorithm, the positioning precision of the system can be improved to be within 0.5 meters.

26

Gupta, U. C., and S. Pradhan. "Queue Length and Server Content Distribution in an Infinite-Buffer Batch-Service Queue with Batch-Size-Dependent Service." Advances in Operations Research 2015 (2015): 1–12. http://dx.doi.org/10.1155/2015/102824.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We analyze an infinite-buffer batch-size-dependent batch-service queue with Poisson arrival and arbitrarily distributed service time. Using supplementary variable technique, we derive a bivariate probability generating function from which the joint distribution of queue and server content at departure epoch of a batch is extracted and presented in terms of roots of the characteristic equation. We also obtain the joint distribution of queue and server content at arbitrary epoch. Finally, the utility of analytical results is demonstrated by the inclusion of some numerical examples which also includes the investigation of multiple zeros.

27

Choi, Bong Dae, and Kwang Kyu Park. "The Mk/M/∞ queue with heterogeneous customers in a batch." Journal of Applied Probability 29, no. 2 (June 1992): 477–81. http://dx.doi.org/10.2307/3214586.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We consider the Mk/M/∞ queue with k heterogeneous customers in a batch where the customer of type i in a batch requires an exponential service time with parameter µi. In steady state, the joint generating function of the number of customers of type i being served in the system is derived explicitly by solving a partial differential equation.

28

Choi, Bong Dae, and Kwang Kyu Park. "The Mk /M/∞ queue with heterogeneous customers in a batch." Journal of Applied Probability 29, no. 02 (June 1992): 477–81. http://dx.doi.org/10.1017/s0021900200043242.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We consider the Mk /M/∞ queue with k heterogeneous customers in a batch where the customer of type i in a batch requires an exponential service time with parameter µi. In steady state, the joint generating function of the number of customers of type i being served in the system is derived explicitly by solving a partial differential equation.

29

Tholudur, A., and W. F. Ramirez. "Optimization of Fed-Batch Bioreactors Using Neural Network Parameter Function Models." Biotechnology Progress 12, no. 3 (June 5, 1996): 302–9. http://dx.doi.org/10.1021/bp960012h.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

30

Chang, Jyh-Shyong, and Bo-Chang Hung. "Optimization of Batch Polymerization Reactors Using Neural-Network Rate-Function Models." Industrial & Engineering Chemistry Research 41, no. 11 (May 2002): 2716–27. http://dx.doi.org/10.1021/ie0100075.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

31

Czarna, Malgorzata, Francis E. Sluse, and Wieslawa Jarmuszkiewicz. "Mitochondrial function plasticity in Acanthamoeba castellanii during growth in batch culture." Journal of Bioenergetics and Biomembranes 39, no. 2 (April 14, 2007): 149–57. http://dx.doi.org/10.1007/s10863-007-9073-2.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

32

Mulenga, François K., Hojjat H. Gharehgheshlagh, and Sajjad Chehreghani. "Assessing the dependency of selection function parameters with batch mill design." Advanced Powder Technology 30, no. 10 (October 2019): 2042–51. http://dx.doi.org/10.1016/j.apt.2019.06.017.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

33

Glučina, Matko, Sandi Baressi Šegota, Nikola Anđelić, and Zlatan Car. "Automated Detection and Classification of Returnable Packaging Based on YOLOV4 Algorithm." Applied Sciences 12, no. 21 (November 2, 2022): 11131. http://dx.doi.org/10.3390/app122111131.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This article describes the implementation of the You Only Look Once (YOLO) detection algorithm for the detection of returnable packaging. The method of creating an original dataset and creating an augmented dataset is shown. The model was evaluated using mean Average Precision (mAP), F1score, Precision, Recall, Average Intersection over Union (Average IoU) score, and Average Loss. The training was conducted in four cycles, i.e., 6000, 8000, 10,000, and 20,000 max batches with three different activation functions Mish, ReLU, and Linear (used in 6000 and 8000 max batches). The influence train/test dataset ratio was also investigated. The conducted investigation showed that variation of hyperparameters (activation function and max batch sizes) have a significant influence on detection and classification accuracy with the best results obtained in the case of YOLO version 4 (YOLOV4) with the Mish activation function and max batch size of 20,000 that achieved the highest mAP of 99.96% and lowest average error of 0.3643.

34

Tarcsay, Bálint Levente, Éva Mihálykó-Orbán, and Csaba Mihálykó. "Optimal Design and Operation of Buffer Tanks Under Stochastic Conditions." Hungarian Journal of Industry and Chemistry 46, no. 2 (December 1, 2018): 91–100. http://dx.doi.org/10.1515/hjic-2018-0025.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Abstract Safety regulations demand the elimination of random mistakes and the reliable operation of production units. However, the control and maintenance of batch and semi-continuous processes haalways been difficult. In this paper, a way of preventing malfunctions in batch and semi-continuous processes is presented by using appropriately designed buffer tanks. A stochastic model was investigated in which batch and continuous subsystems were linked by an intermediate storage tank. The main concern was the reliability of the system. Reliable operation was defined as neither the exhaustion of raw materials nor the excessive accumulation of them. The counting processes that describe the random batch-input and random batch-output processes are supposed to be independent homogeneous Poisson processes with different rates. By introducing a function that describes the material in storage, reliable operation is defined as when this function satisfies two inequalities for a time interval of any duration. By applying probabilistic methods, an integral equation is set up for the the reliability. Nevertheless, its analytical solution cannot be determined, hence the values according to a Monte Carlo simulation are approximated. By applying this method, a link could be identified between the necessary initial buffer and tank capacities that belong to a reliability level. Economic investigations were conducted to help determine the optimal initial buffer and tank capacities that satisfy the appointed reliability level.

35

Mohd Ali, Nur Amirah, and Norashid Aziz. "Optimization of DMC Transesterification Based Biodiesel Production." Advanced Materials Research 1113 (July 2015): 370–75. http://dx.doi.org/10.4028/www.scientific.net/amr.1113.370.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this work, two types of optimization problems which are crucially related to batch reactor operation are considered. First problem is to maximize the conversion and second problem is to minimize the batch time. Both problems are solved using sequential quadratic programming (SQP) available in Aspen Plus. The manipulated variables i.e. reactor temperature and amount of palm oil are optimized simultaneously based on the specified objective function and equality constraint. Effect of intervals for both optimization problems are also evaluated in this paper. The results show that in maximizing conversion, the number of intervals did not significantly affect the amount of conversion. Meanwhile in minimizing batch time, the introduction of intervals was positively reduced the reactor temperature but negatively minimize the batch time.

36

Huang, Weifan, Chin-Chia Wu, and Shangchia Liu. "Single-machine batch scheduling problem with job rejection and resource dependent processing times." RAIRO - Operations Research 52, no. 2 (April 2018): 315–34. http://dx.doi.org/10.1051/ro/2017040.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This paper addresses single-machine batch scheduling with job rejection and convex resource allocation. A job is either rejected, in which case a rejection penalty will be incurred, or accepted and processed on the machine. The accepted jobs are combined to form batches containing contiguously scheduled jobs. For each batch, a batch-dependent machine setup time, which is a function of the number of batches processed previously, is required before the first job in the batch is processed. Both the setup times and job processing times are controllable by allocating a continuously divisible nonrenewable resource to the jobs. The objective is to determine an accepted job sequence, a rejected job set, a partition of the accepted job sequence into batches, and resource allocation that jointly minimize a cost function based on the total delivery dates of the accepted jobs, and the job holding, resource consumption, and rejection penalties. An dynamic programming solution algorithm with running time O (n6) is developed for the problem. It is also shown that the case of the problem with a common setup time can be solved in O (n5) time.

37

Kar, Sounak, Robin Rehrmann, Arpan Mukhopadhyay, Bastian Alt, Florin Ciucu, Heinz Koeppl, Carsten Binnig, and Amr Rizk. "On the Throughput Optimization in Large-Scale Batch-Processing Systems." ACM SIGMETRICS Performance Evaluation Review 48, no. 3 (March 5, 2021): 128–29. http://dx.doi.org/10.1145/3453953.3453982.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

We analyze a data-processing system with n clients producing jobs which are processed in batches by m parallel servers; the system throughput critically depends on the batch size and a corresponding sub-additive speedup function that arises due to overhead amortization. In practice, throughput optimization relies on numerical searches for the optimal batch size which is computationally cumbersome. In this paper, we model this system in terms of a closed queueing network assuming certain forms of service speedup; a standard Markovian analysis yields the optimal throughput in w n4 time. Our main contribution is a mean-field model that has a unique, globally attractive stationary point, derivable in closed form. This point characterizes the asymptotic throughput as a function of the batch size that can be calculated in O(1) time. Numerical settings from a large commercial system reveal that this asymptotic optimum is accurate in practical finite regimes.

38

Barketau, Maksim S., T. C. Edwin Cheng, Mikhail Y. Kovalyov, and C. T. Daniel Ng. "Batch Scheduling of Deteriorating Products." Decision Making in Manufacturing and Services 1, no. 2 (October 11, 2007): 25–34. http://dx.doi.org/10.7494/dmms.2007.1.2.25.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this paper we consider the problem of scheduling N jobs on a single machine, where the jobs are processed in batches and the processing time of each job is a simple linear increasing function depending on job’s waiting time, which is the time between the start of the processing of the batch to which the job belongs and the start of the processing of the job. Each batch starts from the setup time S. Jobs which are assigned to the batch are being prepared for the processing during time S0 S. After this preparation they are ready to be processed one by one. The non-negative number bi is associated with job i. The processing time of the i-th job is equal to bi(si − (sib + S0)), where sib and si are the starting time of the b-th batch to which the i-th job belongs and the starting time of this job, respectively. The objective is to minimize the completion time of the last job. We show that the problem is NP-hard. After that we present an O(N) time algorithm solving the problem optimally for the case bi = b. We further present an O(N2) time approximation algorithm with a performance guarantee 2.

39

Li, Meng Ling, and Liang Liang. "On Function Promotion and Sustainable Development Strategy of Old Industrial Relocation Area." Applied Mechanics and Materials 295-298 (February 2013): 2639–44. http://dx.doi.org/10.4028/www.scientific.net/amm.295-298.2639.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

With the acceleration of the development progress of industrialization and urbanization, a batch of old industrial relocation areas are playing the irreplaceable role in improving city functions, developing regional economics and integrating & configuring resources after their reconstruction. This paper discusses the function promotion methods of old industrial relocation area and the specific responding strategy of old industrial relocation area’s sustainable development from the angle of service industry development by taking Tiexi District, Shenyang as an example.

40

Chougradi, Abdeljalil, François Zaviska, Ahmed Abed, Jérôme Harmand, Jamal-Eddine Jellal, and Marc Heran. "Batch Reverse Osmosis Desalination Modeling under a Time-Dependent Pressure Profile." Membranes 11, no. 3 (February 28, 2021): 173. http://dx.doi.org/10.3390/membranes11030173.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

As world demand for clean water increases, reverse osmosis (RO) desalination has emerged as an attractive solution. Continuous RO is the most used desalination technology today. However, a new generation of configurations, working in unsteady-state feed concentration and pressure, have gained more attention recently, including the batch RO process. Our work presents a mathematical modeling for batch RO that offers the possibility of monitoring all variables of the process, including specific energy consumption, as a function of time and the recovery ratio. Validation is achieved by comparison with data from the experimental set-up and an existing model in the literature. Energetic comparison with continuous RO processes confirms that batch RO can be more energy efficient than can continuous RO, especially at a higher recovery ratio. It used, at recovery, 31% less energy for seawater and 19% less energy for brackish water. Modeling also proves that the batch RO process does not have to function under constant flux to deliver good energetic performance. In fact, under a linear pressure profile, batch RO can still deliver better energetic performance than can a continuous configuration. The parameters analysis shows that salinity, pump and energy recovery devices efficiencies are directly linked to the energy demand. While increasing feed volume has a limited effect after a certain volume due to dilution, it also shows, interestingly, a recovery ratio interval in which feed volume does not affect specific energy consumption.

41

Chandran, Nishanth, Divya Gupta, and Akash Shah. "Circuit-PSI With Linear Complexity via Relaxed Batch OPPRF." Proceedings on Privacy Enhancing Technologies 2022, no. 1 (November 20, 2021): 353–72. http://dx.doi.org/10.2478/popets-2022-0018.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Abstract In 2-party Circuit-based Private Set Intersection (Circuit-PSI), P 0 and P 1 hold sets S0 and S1 respectively and wish to securely compute a function f over the set S0 ∩ S1 (e.g., cardinality, sum over associated attributes, or threshold intersection). Following a long line of work, Pinkas et al. (PSTY, Eurocrypt 2019) showed how to construct a concretely efficient Circuit-PSI protocol with linear communication complexity. However, their protocol requires super-linear computation. In this work, we construct concretely efficient Circuit-PSI protocols with linear computational and communication cost. Further, our protocols are more performant than the state-of-the-art, PSTY – we are ≈ 2.3× more communication efficient and are up to 2.8× faster. We obtain our improvements through a new primitive called Relaxed Batch Oblivious Programmable Pseudorandom Functions (RB-OPPRF) that can be seen as a strict generalization of Batch OPPRFs that were used in PSTY. This primitive could be of independent interest.

42

K. Vijaya. "The Markovian Batch Arrival Queue with Differentiated Vacation." Communications on Applied Nonlinear Analysis 31, no. 3s (June 20, 2024): 197–211. http://dx.doi.org/10.52783/cana.v31.759.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

A Poisson Batch Arrival Queueing Model with a single server taking two different vacations at various rates is being considered for the study. The probability generating function method of the different states is considered for deriving the various performance measures of the states; numerical cases and cost studies are also extended.

43

Wang, Lei, Zhilong Xiu, Yuduo Zhang, and Enmin Feng. "Optimal Control for Multistage Nonlinear Dynamic System of Microbial Bioconversion in Batch Culture." Journal of Applied Mathematics 2011 (2011): 1–11. http://dx.doi.org/10.1155/2011/624516.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In batch culture of glycerol biodissimilation to 1,3-propanediol (1,3-PD), the aim of adding glycerol is to obtain as much 1,3-PD as possible. Taking the yield intensity of 1,3-PD as the performance index and the initial concentration of biomass, glycerol, and terminal time as the control vector, we propose an optimal control model subject to a multistage nonlinear dynamical system and constraints of continuous state. A computational approach is constructed to seek the solution of the above model. Firstly, we transform the optimal control problem into the one with fixed terminal time. Secondly, we transcribe the optimal control model into an unconstrained one based on the penalty functions and an extension of the state space. Finally, by approximating the control function with simple functions, we transform the unconstrained optimal control problem into a sequence of nonlinear programming problems, which can be solved using gradient-based optimization techniques. The convergence analysis and optimality function of the algorithm are also investigated. Numerical results show that, by employing the optimal control, the concentration of 1,3-PD at the terminal time can be increased, compared with the previous results.

44

SU, LING-HUEY, DAR-LI YANG, and HOU-KUAN CHOU. "A TWO-STAGE FLOWSHOP SCHEDULING WITH LIMITED BUFFER STORAGE." Asia-Pacific Journal of Operational Research 26, no. 04 (August 2009): 503–22. http://dx.doi.org/10.1142/s0217595909002328.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

This study addresses a two-stage flowshop with a batch machine in stage 1 and a discrete machine in stage 2, subject to the constraint that the input buffer of the discrete machine can only host limited number of jobs. The batch machine processes a batch of jobs simultaneously, and the discrete machine processes one job at a time. The objective function of the problem is the makespan minimization. Several properties are proposed to solve the special case of the problem optimally. An effective heuristic is presented, and a branch-and-bound procedure is proposed for benchmarking. Extensive experimentation shows that the heuristic yields good results.

45

Cheng, Yizong. "Convergence and Ordering of Kohonen's Batch Map." Neural Computation 9, no. 8 (November 1, 1997): 1667–76. http://dx.doi.org/10.1162/neco.1997.9.8.1667.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

The convergence and ordering of Kohonen's batch-mode self-organizing map with Heskes and Kappen's (1993) winner selection are proved. Selim and Ismail's (1984) objective function for k-means clustering is generalized in the convergence proof of the self-organizing map. It is shown that when the neighborhood relation is doubly decreasing, order in the map is preserved. An unordered map becomes ordered when a degenerate state of ordering is entered, where the number of distinct winners is one or two. One strategy to enter this state is to run the algorithm with a broad neighborhood relation.

46

Guo, Tiantian, Yang Chen, Minglei Shi, Xiangyu Li, and Michael Q. Zhang. "Integration of single cell data by disentangled representation learning." Nucleic Acids Research 50, no. 2 (November 24, 2021): e8-e8. http://dx.doi.org/10.1093/nar/gkab978.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Abstract Recent developments of single cell RNA-sequencing technologies lead to the exponential growth of single cell sequencing datasets across different conditions. Combining these datasets helps to better understand cellular identity and function. However, it is challenging to integrate different datasets from different laboratories or technologies due to batch effect, which are interspersed with biological variances. To overcome this problem, we have proposed Single Cell Integration by Disentangled Representation Learning (SCIDRL), a domain adaption-based method, to learn low-dimensional representations invariant to batch effect. This method can efficiently remove batch effect while retaining cell type purity. We applied it to thirteen diverse simulated and real datasets. Benchmark results show that SCIDRL outperforms other methods in most cases and exhibits excellent performances in two common situations: (i) effective integration of batch-shared rare cell types and preservation of batch-specific rare cell types; (ii) reliable integration of datasets with different cell compositions. This demonstrates SCIDRL will offer a valuable tool for researchers to decode the enigma of cell heterogeneity.

47

Yu, Ganhua. "A Coordination Mechanism for Scheduling Game on Parallel-Batch Machines with Deterioration Jobs." Mathematical Problems in Engineering 2022 (December 17, 2022): 1–7. http://dx.doi.org/10.1155/2022/3780331.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

In this study, we consider a parallel-batch machines scheduling game problem with deterioration jobs. The processing time of a job is a simple linear function of its starting time. Each of the parallel-batch machines can process up to B jobs simultaneously as a batch. The processing time of a batch is the processing time of the job with the longest deteriorating rate in the batch. All jobs in the same batch start and complete at the same time. Each job as an agent and its individual cost is the completion time of the job. We present a coordination mechanism for the scheduling game problem with social cost of minimizing the makespan in this paper, namely fully batch longest deteriorating rate. For this problem, we precisely quantify the inefficiency of Nash equilibrium by the logarithm price of anarchy. It is defined to be the ratio between the logarithm of social cost of the worst Nash equilibrium and the logarithm of social cost of an optimum schedule. In addition, we discuss the existence of Nash equilibrium and present an upper bound and lower bounds on the logarithm price of anarchy of the coordination mechanism. We show that the mechanism has a logarithm price of anarchy at most 2 − 1 / 3 m a x m , B − 2 / 3 B .

48

Fried, J., and H. Lemmer. "On the dynamics and function of ciliates in sequencing batch biofilm reactors." Water Science and Technology 47, no. 5 (March 1, 2003): 189–96. http://dx.doi.org/10.2166/wst.2003.0316.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Ciliates are known to directly influence the performance of wastewater treatment plants mainly by feeding on suspended particles. By monitoring two lab-scale sequencing batch biofilm reactors (SBBR), one filled with expanded shale (clay spheres), the other with “Kaldnes” particles (PE-carriers), the succession of biofilm communities with special emphasis on ciliates was monitored for one year. Ciliates were identified and quantified at the species level and compared to rotifer and nematode abundances. Members of the subclass Peritrichia clearly dominated the community of protozoa. Epistylis cf. coronata and Opercularia asymmetrica were the dominant species within this group. The tree-like structure of their colonies provided a distinctive augmentation of the area available for bacterial colonization. The flux of water, produced by E. cf. coronata due to cilia motility, has been visualized and measured by video processing. This flux of water was still measurable at distances > 500 mm and maximum water currents raised up to 180 mm s−1. Therefore, the role of ciliates is not only restricted to the ingestion of bacteria and suspended particles. They also alter water flux and carry nutrients to the inner parts of the biofilm. Thus, monitoring biofilm formation in wastewater treatment plants should always consider the impact of protists such as ciliates.

49

Zhu, Qiuyu, Zikuang He, Tao Zhang, and Wennan Cui. "Improving Classification Performance of Softmax Loss Function Based on Scalable Batch-Normalization." Applied Sciences 10, no. 8 (April 24, 2020): 2950. http://dx.doi.org/10.3390/app10082950.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Анотація:

Convolutional neural networks (CNNs) have made great achievements on computer vision tasks, especially the image classification. With the improvement of network structure and loss functions, the performance of image classification is getting higher and higher. The classic Softmax + cross-entropy loss has been the norm for training neural networks for years, which is calculated from the output probability of the ground-truth class. Then the network’s weight is updated by gradient calculation of the loss. However, after several epochs of training, the back-propagation errors usually become almost negligible. For the above considerations, we proposed that batch normalization with adjustable scale could be added after network output to alleviate the problem of vanishing gradient problem in deep learning. The experimental results show that our method can significantly improve the final classification accuracy on different network structures, and is also better than many other improved classification Loss.

50

Ayati, Bruce P. "Microbial dormancy in batch cultures as a function of substrate-dependent mortality." Journal of Theoretical Biology 293 (January 2012): 34–40. http://dx.doi.org/10.1016/j.jtbi.2011.10.003.

Повний текст джерела

Стилі APA, Harvard, Vancouver, ISO та ін.

Статті в журналах з теми "Function batch"

Оформте джерело за APA, MLA, Chicago, Harvard та іншими стилями