We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands, minimizing the makespan criterion. A sequence dependent setup time is required be...
详细信息
We study a problem of optimal scheduling and lot-sizing a number of products on m unrelated parallel machines to satisfy given demands, minimizing the makespan criterion. A sequence dependent setup time is required between lots of different products. The products are assumed to be all continuously divisible or all discrete. The problem is motivated by the real-life scheduling applications in multi-product plants. We derive properties of optimal solutions, NP -hardness proof, enumeration and dynamic programming algorithms for various special cases of the problem. A greedy-type heuristic is proposed and tested in computational experiment.
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if ...
详细信息
ISBN:
(纸本)3540857796
Finite words and their overlap properties are considered in this paper. Let w be a finite word of length n with period p and where the maximum length of its unbordered factors equals k. A word is called unbordered if it possesses no proper prefix that is also a suffix of that word. Suppose ki , with two different letters a and b and i1, and b i occurs exactly once in w. This answers a conjecture by Harju and the second author of this paper about a structural property of maximum Duval extensions. Moreover, we show here that i
We describe a novel incremental diagnostic system based on a statistical model that is trained from empirical data. The system guides the user by calculating what additional information would be most helpful for the d...
详细信息
We describe a novel incremental diagnostic system based on a statistical model that is trained from empirical data. The system guides the user by calculating what additional information would be most helpful for the diagnosis. We show that our diagnostic system can produce satisfactory classification rates, using only small amounts of available background information, such that the need of collecting vast quantities of initial training data is reduced. Further, we show that incorporation of inconsistency-checking mechanisms in our diagnostic system reduces the number of incorrect diagnoses caused by erroneous input.
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state enco...
详细信息
Signal Transition Graphs (STGs) are a popular formalism for the specification of asynchronous circuits. A necessary condition for the implementability of an STG is the existence of a consistent and complete state encoding. For an important subclass of STGs, the marked graph STGs, we show that checking consistency is polynomial, but checking the existence of a complete state coding is co-NP-complete. In fact, co-NP-completeness already holds for acyclic and 1-bounded marked graph STGs and for live and 1-bounded marked graph STGs. We add some relevant results for free-choice, bounded, and general STGs.
A stochastic generalization of renormalization-group transformation for continuous-time random walk processes is proposed. The renormalization consists in replacing the jump events from a randomly sized cluster by a s...
详细信息
A stochastic generalization of renormalization-group transformation for continuous-time random walk processes is proposed. The renormalization consists in replacing the jump events from a randomly sized cluster by a single renormalized (i.e., overall) jump. The clustering of the jumps, followed by the corresponding transformation of the interjump time intervals, yields a new class of coupled continuous-time random walks which, applied to modeling of relaxation, lead to the general power-law properties usually fitted with the empirical Havriliak-Negami function.
In this paper, we analyse web log data from user trials of the WHURLE-LS adaptive educational hypermedia (AEH) system from a behavioural perspective. This system allows users to switch from one presentational mode to ...
详细信息
ISBN:
(纸本)1595938206
In this paper, we analyse web log data from user trials of the WHURLE-LS adaptive educational hypermedia (AEH) system from a behavioural perspective. This system allows users to switch from one presentational mode to another (visual, verbal or neutral), and this paper investigates users' choice of mode as they interacted with the system. We present the main findings of the browsing behaviours within the framework of rational choice theory, and discuss why and when switching might have occurred. Copyright 2007 ACM.
There has been no large-scale study looking at the proportion of social work students in the UK who achieve the professional qualification, although there is some evidence that different groups experience different ra...
详细信息
There has been no large-scale study looking at the proportion of social work students in the UK who achieve the professional qualification, although there is some evidence that different groups experience different rates of progression. This article examines progression rates among students studying for the DipSW in England and analyses the factors that influence whether students achieve an award on time (defined as achieving an award without being referred, deferred, failing or withdrawing). The results show that male students, students from a black and minority ethnic group, and students with a self-reported disability have poorer progression rates. However, contrary to the picture in higher education as a whole, older students and students with previously lower levels of educational attainment do not have poorer progression rates. Social work education has important lessons to share with higher-education colleagues in terms of working with an increasingly diverse student group. However, work is needed to identify students at greater risk of non-progression than others and to develop more effective student support strategies.
作者:
Kwang-Hyun ParkZeungnam BienDivision of EE
Department of EECS Korea Advanced Institute of Science and Technology 373–1 Kusong-dong Yusong-gu Taejon 305–701 Korea. Zeungname Bien:received the B.S. degree in electronics engineering from Seoul National University
Seoul Korea in 1969 and the M.S. and Ph.D. degrees in electrical engineering from the University of Iowa Iowa City Iowa U.S.A. in 1972 and 1975 respectively. During 1976–1977 academic years he taught as assistant professor at the Department of Electrical Engineering University of Iowa. Then Dr. Bien joined Korea Advanced Institute of Science and Technology summer 1977 and is now Professor of Control Engineering at the Department of Electrical Engineering and Computer Science KAIST. Dr. Bien was the president of the Korea Fuzzy Logic and Intelligent Systems Society during 1990–1995 and also the general chair of IFSA World Congress 1993 and for FUZZ-IEEE99 respectively. He is currently co-Editor-in-Chief for International Journal of Fuzzy Systems (IJFS) Associate Editor for IEEE Transactions on Fuzzy Systems and a regional editor for the International Journal of Intelligent Automation and Soft Computing. He has been serving as Vice President for IFSA since 1997 and is now Chief Chairman of Institute of Electronics Engineers of Korea and Director of Humanfriendly Welfare Robot System Research Center. His current research interests include intelligent control methods with emphasis on fuzzy logic systems service robotics and rehabilitation engineering and large-scale industrial control systems. Kwang-Hyun Park:received the B.S.
M.S. and Ph.D. degrees in electrical engineering and computer science from KAIST Korea in 1994 19997 and 2001 respectively. He is now a researcher at Human-friendly Welfare Robot System Research Center. His research interests include learning control machine learning human-friendly interfaces and service robotics.
It has been found that some huge overshoot in the sense of sup-norm may be observed when typical iterative learning control (ILC) algorithms are applied to LTI systems, even though monotone convergence in the sense of...
详细信息
It has been found that some huge overshoot in the sense of sup-norm may be observed when typical iterative learning control (ILC) algorithms are applied to LTI systems, even though monotone convergence in the sense of λ-norm is guaranteed. In this paper, a new ILC algorithm with adjustment of learning interval is proposed to resolve such an undesirable phenomenon, and it is shown that the output error can be monotonically converged to zero in the sense of sup-norm when the proposed ILC algorithm is applied. A numerical example is given to show the effectiveness of the proposed algorithm.
We consider a system of agents as a layer between services and the network hosts. We present a self-organizing system of agents able to offer services with an increase of the speed, and decrease of the network traffic...
详细信息
ISBN:
(纸本)0769525288
We consider a system of agents as a layer between services and the network hosts. We present a self-organizing system of agents able to offer services with an increase of the speed, and decrease of the network traffic. A coordination model defines how the agents interact, and how their interactions can be controlled;this includes dynamic creation and destruction of agents, control of communication flows among agents, control of spatial distribution of agents, as well as synchronization of actions over time. Various distances and topological relations are used to explain our self-organizing mechanism. We analyze the stability of the system, and provide a new result regarding a weak form of stability depending only on the moment of the first requests of agents by hosts. Finally we provide a visualization of the services evolution using self-organizing maps, and presenting a service clustering structure.
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CPS (concurrent pushdown systems) [QR05...
详细信息
暂无评论