A Soft Real-time Scheduling Server on the Windows NT
|
|
- Brett Dennis
- 8 years ago
- Views:
Transcription
1 A Soft Real-tie Scheduling Server on the Windows NT Chih-han Lin, Hao-hua Chu, Klara Nahrstedt Departent of Coputer Science University of Illinois at Urbana Chapaign clin2, h-chu3, Abstract We present the design and ipleentation of a soft real tie CPU server for the tie-sensitive ultiedia applications in the Windows NT environent. The server is a user-level daeon process fro which ultiedia applications can request and acquire periodic processing tie in the well-known for of (processing tie per period). Our server is based on a careful anipulation of the real tie(rt) priority class, and it does not require any odifications to the kernel. It provides () the rate onotonic scheduling algorith, (2) support for ultiple processors (SMP odel), (3) liited overrun protection aong realtie(rt) processes, (4) fair allocation between the RT and tie sharing (TS) processes so that TS processes are not starved for processing tie, (5) accessibility by a noral user privilege, and (6) an efficient ipleentation. We have ipleented the CPU scheduling server on top of the Windows NT 4. operating syste with dual Pentiu processors, and we have shown through experients that our CPU scheduling server provides good soft real tie support for the ultiedia applications.. Introduction Continuous edia processing, such as video/audio copression/decopression, and 3-D rendering and aniation, are becoing widely-used applications on coputers nowadays. To preserve their teporal behavior, ultiedia applications require that the underlying systes provide sufficient and periodic processing tie and enforce quality guarantees to the users (e.g. a fixed video playback rate). However, in the Windows NT ulti-process and tie-sharing environent, these ultiedia applications do not perfor well when they are scheduled concurrently with the traditional TS applications such as text editors, copilers, web browsers, or coputation-intensive jobs. Oftenties, the proble lies in untiely scheduling of the processes rather than insufficient processor capacity. This paper addresses this proble and presents a user-level iddleware solution on top of the Windows NT operating syste with ultiple processors. There have been several research results that address the issues of accoodating scheduling of soft RT processes in general purpose operating syste environent. They are the Constant Utilization Servers[2], the Processor Reserve of the RT Mach[8,6], the Hierarchical CPU scheduler[4], the User-level Real Tie Scheduler[7], the Real Tie Upcall[3], the Rate- Controlled Scheduling[], the Soft RT scheduling Server[9], the Rialto operating syste[5], the Neesis[], and the SMART syste[]. All except [] are based on the general concepts of reservation, resource allocation, and scheduling. The RT process first sends a reservation request, which specifies its resource deand, e.g., RT Mach convention of (requested CPU usage tie, period), to the resource anager. Then the resource anager perfors an adission control to deterine if there is enough available resource to allocate for this request. If the adission control test succeeds, the RT process is scheduled according to the reserv ation contract. Our scheduling echanis is based on the user-level RT scheduler(ursched) proposed by Kaada[7] in UNIX. The URSched echanis is based on the POSIX.4 fixed priority extension and its priority scheduling rule. The user-level scheduler is ipleented on top of the kernel scheduler, and it runs at the highest possible fixed-priority. The RT process waits its turn at the lowest possible priority (called the waiting priority), and the active RT processes run at the 2 nd highest fixed priority. The user-level scheduler wakes up periodically to dispatch the RT processes by oving the between the waiting and the running priority; during the other tie, it just sleeps. When the scheduler sleeps, the RT process executes at the running priority. When no RT processes are dispatched, the TS processes with dynaic priorities are scheduled by the underlying kernel scheduler. This approach has shown to have any desirable prope rties:
2 It requires no odification to the kernels. The RT scheduler is ipleented as a user-level process. It has low coputation overhead. It provides the flexibility to ipleent any scheduling algoriths in the user-level scheduler, e.g., rate onotonic, earliest deadline first, or a hierarchical scheduler. The above discussed scheduling echanis was used and further expanded by additional echaniss, algoriths, and policies in our QoS-aware resource anageent iddleware [9], called QualMan. In this context, the iddleware is understood as a syste software between operating syste and applications that provides access to extended and flexible OS services, e.g. real tie support, to applications without any odifications of the operating systes. Our iddleware provides the following ser vices : Rate Monotonic Scheduling algorith. Overrun Protection aong RT processes. Fair allocation between the RT and TS processes. Access to syste services with noral user privileges. Based on lessons learned fro the soft RT scheduling server in the UNIX environent, we design, ipleent, and test the soft real-tie scheduling server in the Windows NT environent. In addition, we provide support for scheduling of RT and TS processes on ultiple processors. The paper is organized as follows: section 2 explains the scheduling server architecture; section 3 describes the ipleentation on the Windows NT platfor, and discusses the differences between UNIX and the Windows NT operating syste; section 4 shows the experiental results; section 5 presents the concluding rearks. 2. Server Architecture and Design Our server architecture contains three ajor coponents the broker, the dispatcher, and the dispatch tables as shown in Figure. A RT Client is an external coponent representing an application which requests the scheduling services fro the scheduling server. because they play an iportant role in our architecture and design. Each NT process or its ain thread has a scheduling priority. Each thread s priority is deterined by the priority class of its process and the priority level of the thread within the priority class of its process. Note that our scheduler is a process scheduler and it does not schedule the various threads in each RT process. There are four possible priority classes for a process: IDLE_PRIORITY_CLASS 2 NORMAL_PRIORITY_CLASS 3 HIGH_PRIORITY_CLASS 4 REALTIME_PRIORITY_CLASS There are seven possible priority levels within each priority class: THREAD_PRIORITY_IDLE 2 THREAD_PRIORITY_LOWEST 3 THREAD_PRIORITY_BELOW_NORMAL 4 THREAD_PRIORITY_NORMAL 5 THREAD_PRIORITY_ABOVE_NORMAL 6 THREAD_PRIORITY_HIGHEST 7 THREAD_PRIORITY_TIME_CRITICAL 2. Client RT Process A RT process can reserve a certain aount of CPU tie fro the real-tie scheduling server. At a later tie, it can also free or odify a reservation through an application progra interface (API) defined in Table. The client s reservation request contains the process ID and its resource specification in the for: period=p(s), and CPU usage in percentage=u. The aount of CPU tie per period, denoted E, is coputed as E = U*P. For exaple, if a RT process requests a reservation for CPU usage = 3%, period = s, and the request is accepted by the scheduling server, then the scheduling server will guarantee that the RT process is scheduled for 3s of CPU tie every s, given that the RT process is runnable. Before we describe each coponent in detail, we discuss the priority levels in the Windows NT syste
3 Write Dispatch Table Read Broker Dispatcher Request RT Client Process Dispatch Figure : The Soft RT Server Architecture Table : Application progra interface int Cpu::reserve(int pid, double util, int period) Reserve CPU tie corresponding to util over the tie period for the process pid. Return / for resource adission su ccess/failure. int Cpu::freeReserve(int pid) Free the reservation hold by process pid. Return / for success/failure. double Cpu::getAvailResource() Return the aount of available CPU resource in the syste. int Cpu::odifyReserve(int pid, double newutil, int newperiod) Modify the reservation held by process pid. Return / for resource adission success/failure. The users start the RT process at the NOR- MAL_PRIORITY_CLASS which is like any other Tie Sharing (TS) processes. When the RT process calls the CPU reserve() API, it opens an inter-process counication (IPC) with the broker through which the reserve paraeters and the acceptance result are exchanged. To address the security proble which one process can odify or free another process s resource reservation through the API, the broker perfors an ownership check to ake sure that the calling process can be peritted to change the resource reservation of the specified RT process. Then the broker and the dispatcher schedule the RT process by anipulating its priority, the echanis is described below. 2.2 Broker and Dispatch Table The broker receives requests fro the client RT processes. It perfors an adission control test for the non-preeptive rate onotonic scheduling algorith [2] to deterine whether the new client RT process can be scheduled. Note that all equations ust be satisfied for the adission test to succeed. Given a total of periodic RT processes and a single processor syste (N=), let the RT processes be sorted according to sizes of their periods. Let e i and p i be the execution tie and the period of the i-th client RT process, e and p be the execution tie and period of the RT process with the sallest period, and r be the overall percentage of processor capacity allocated to the RT processes. e i r N (eq. ) i = p i p e + ax ( i < ) e (eq. 2) i p e + ax (, ) e + e F ( p e, p ) (eq. 3) i i j j i j j i j j j = i + x w here F ( x, y ) = ceil( ) + y Given an N processors syste, the broker needs to decide how to place the ultiple RT processes into the ultiple processors. The broker aintains a set of RT processes that are aditted and are assigned to run on each of the processors. The set of processes for each processor ust satisfy both eq. 2 and 3. When a new RT process request arrives, the broker tries to place the new RT process in each of the processors (..N) by perforing the above one-processor adission trial on the processor. During the one-processor adission trial, the new process is inserted into the existing set of processes corresponding to that processor, and eq. 2 and 3 are checked. If the trial succeeds, the broker will adit the new RT process which is assigned to that processor. If the trial fails, the broker will try to place the new RT process in the next processor. If the broker cannot find any processor that can accoo-
4 date the request, the RT process is rejected and not schedulable. If it is schedulable, the broker will put the RT process into the waiting RT process pool by changing its priority to the waiting priority at IDLE_PRIORITY_CLASS level. The broker is a daeon process running at a noral priority (The server s priority class is NOR- MAL_PRIORITY_CLASS and the priority of its priary thread is THREAD_PRIORITY_NORMAL). It can be started at the syste boot tie. It will wake up when a new client RT process request arrives. The broker needs to be run with the privilege of LocalSyste (equivalent to the root privilege in UNIX) so that it can start a RT process. The broker process does not perfor the actual dispatching of the RT processes and does not enforce reservations. However, it needs to start (at the startup tie) the dispatching process. The reason for separation between the broker process and the dispatcher process is that the adission and schedulability test in the broker ay have variable coputation tie, hence it ay affect the tiing of dispatching. The other reason is that the adission and schedulability tests do not need to be done in real tie. As a result, the broker runs at a noral priority and the dispatcher at a higher RT priority. The broker coputes its schedule for the RT processes in its dispatch table using the non-preeptive rate onotonic algorith. The dispatch table is a shared eory object where the broker writes the coputed schedule into it and the dispatcher reads fro it. The dispatch table contains a repeatable tie frae of slots, each slot corresponds to a tie slice of a processor. Each slot can be assigned to a RT process PID, or is free which eans yielding the control to the NT kernel scheduler to schedule TS processes. Note that Windows NT allows the syste to have ultiple processors in a syetric ultiprocessing odel (SMP). Given N processors, we can run N processes concurrently. Therefore the dispatch table has N coluns of repeatable tie slots, where the i-th colun corresponds to the schedule on the i-th processor. We show a saple dispatch table for a dual processors syste in Table 2. Note that it is possible that the broker ay ake a assive change to the dispatch table when accepting a new RT process, while the dispatcher is dispatching tie slots located at iddle of a tie frae. This assive change ay cause undesirable shifts in the rate onotonic schedule and ay disrupt the guaranteed tie slots assigned to soe RT processes. As a result, the dispatcher will keep a separate private copy of the dispatch table which it uses for dispatching. This private copy of the dispatch table is only updated with the broker when the dispatcher reaches the end of its tie frae. Table 2: A saple dispatch table for a dual processors syste. Slot Nuber Tie Process PID Process PID -2s 2 2-4s s s free free 4 8-s 2 5-2s free s s free free The repeatable frae in Table 2 has a length of 6s, and it contains 8 tie slots of 2s each. The saple dispatch table is a result of a rate onotonic schedule, where process is assigned to run on processor # and according to the contract (period=4s, execution tie=2s), process is assigned to run on processor # and according to the contract (period=6s, execution tie=2s), process 2 is assigned to run on processor #2 and according to the contract (period=4s, execution tie=2s), and processor 3 is assigned to run on processor #2 and according to the contract (period=8s, execution tie=2s). There are 4 free slots where TS processes can run. The iniu nuber of free slots is aintained by the broker to provide a fair share of the CPU tie to the TS processes. In the above dispatch table, a total of 3.25% (s out of possible 32s) of processing capacity is guaranteed to the TS processes. The site adinistrator can adjust this TS allocation value, which is (- r) in the adission control equations, to be what is considered as a fair allocation between the TS and RT processes. For exaple, if the coputer is used heavily for RT applications, the TS allocation value can be set to a sall percentage nuber. 2.3 Dispatcher The dispatcher is a periodic process running at the highest possible fixed priority with (REALTIME_PRIORITY_CLASS +THREAD_PRIORITY_TIME_CRITICAL). The
5 dispatcher aps the dispatch table into its address space, and its job is to dispatch the RT process recorded at the tie slot for all the processors. The dispatcher contains the next slot nuber. At the beginning of each dispatch slot, a periodic RT tier signals the dispatcher to schedule the next RT process. The length of tie to switch fro the end of one tie slot to the beginning of the next tie slot is called the dispatch latency. The dispatch latency is our scheduling overhead and it should be kept at a inial value. Consider the saple dispatch table in Table 2 at 2 s when the next slot nuber is. The following steps are taken by the dispatcher:. The periodic tier wakes up the dispatcher process at 2s. The dispatcher preepts RT process (or 2) if it is running on processor (or 2). 2. The dispatcher sets the RT processes and 2 to the waiting priority (IDLE_PRIORITY_CLASS) using the syste call SetPriorityClass(). 3. The dispatcher prootes the RT processes and 3 to the running priority (REALTIME_PRIORITY_CLASS). It binds the RT processes /2 to processors #/#2 using the syste call SetProcessAffinityMask(). 4. The dispatcher puts itself to sleep. As a result, the RT processes /2 are scheduled on processors #/#2 for 2s until the tier wakes up the dispatcher again. We have encountered a proble in the Windows NT that the periodic tier ay fail to wake up the dispatcher when the RT process overruns its assigned slot. Overrun is defined as an additional tie to the reserved processing tie of an aditted RT process. Take the exaple of process in Table 2 and it has reserved 2s out of every 6s. It would be overrunning when it uses ore than 2 s of processing tie (say 3s) to coplete one iteration run. When an overrun occurs, the invocation of the dispatcher will be delayed till the RT process finishes its overrun due to the tier proble. This eans that one process overrun can delay the dispatching of the process in the next tie slot. Hence, until we resolve the preeption tier proble in Windows NT, we assue wellbehaved RT processes. In the eantie, the dispatcher takes two actions to control the overrun. The first one is that the dispatcher will onitor for any isbehaving RT processes that are overrunning on a regular basis and it will reove the. We currently define a isbehaving process as one that is overrunning for ore than 2% of its reservation and for ore than 3 iterations during the ost recent iterations. Take the exaple of process in Table 2. It would be isbehaving if during the ost recent iteration runs, it uses ore than 24s (which is 2% ore than the 2s reservation) of processing tie for ore than 3 ties. The paraeters that define a isbehaving process can be set by the syste adinistration to be either ore strict or lax. The second action is that the dispatcher will use soe of the TS allocation, by teporarily assigning the free slots to the RT process whose tie slots are taken by overrunning RT processes. 3. Ipleentation We have ipleented our server architecture on a HP Vectra Xu syste which has two Intel Pentiu 2 processors and 96M of eory. It runs Windows NT 4. operating syste. The dispatch latency consists of 4 SetPriorityClass() syste calls, 2 SetProcessAffinityMask() syste calls, and 3 context switches. The average dispatch latency, over, runs, is easured as.64 s. The tie slot is set to be 2s, and the overhead coes to be 3.2%. 4. Experiental Result The experient consists of the following load of applications running concurrently: The MPEG player, written by MSSG (MPEG Software Siulation Group), plays a 32x24 MPEG- file twister.pg that contains a clip of the ovie Twister at 2 fraes per second (FPS). The sae MPEG player plays a second 32x24 MPEG- file lecture.pg that contains a speaker giving a lecture, at 2 fraes per second. The Microsoft Visual C++ Copiler copiles the MSSG MPEG player. Four copute progras calculate the sin and cos tables using the infinite series fo rula.
6 twister (NRT) lecture (NRT) twister (RT) lecture (RT) Figure 2: The inter-frae tie for the MPEG player that plays the twister.pg and lecture.pg files at 2 fraes per second. The y axis easures the inter-frae tie in s, and x axis shows the frae nubers. The top two graphs show the result for the Windows NT kernel scheduler, and the botto two graphs show the result for our scheduling server with processor reservation for the twister.pg at (%, 5s) and lecture.pg at (8%, 5s). The graphs in Figure 2 show the easureent of interfrae tie on the MPEG player under the above specified load. The top two graphs show the result for the twister.pg (upper left) and lecture.pg (upper right) under the Windows NT scheduler without our scheduling server. The botto two graphs show the result for the 2 FPS twister.pg (lower left) with % processor reserve every 5 s, and the 2 FPS lecture.pg (lower right) with 8% processor reserve every 5s. The twister.pg playback requires ore processor tie because it contains lots of action with rapid oving background, whereas the lecture.pg playback contains slow oving action with alost no changes in background. Using the Windows NT scheduler, jitter over 2s (equivalent to 4 fraes tie) occurs frequently for both MPEG video. Using our scheduling server, jitter over 2s does not occur at all. 5. Conclusion Our experients validate the design and ipleentation of the soft real-tie scheduling server for continuous edia processing. Our contribution is that under the control of our scheduling server within the Windows NT environent, () RT processes obtain a desired aount of CPU tie to satisfy soft real-tie requireents; (2) RT processes are onitored and protected against overruns of other RT processes; (3) RT processes have access to tiing QoS guarantees and systes services with noral user privileges; and (4) TS processes get a iniu aount of CPU tie and do not starve. References. Richard Black, Paul Barha, Austin Donnelly, Neil Stratford. Protocol Ipleentation in a Vertically Structured Operating Syste. IEEE LCN, Nov Z. Deng, J.W.-S. Liu, J. Sun. Dynaic Scheduling of Hard Real-Tie Applications in Open Syste Environent. Technical Report No. UIUCDCS-R-96-98, Departent of Coputer Science, University of Illinois at Urbana-Chapaign, Oct R. Gopalakrishnan. Efficient Quality of Service Support Within Endsystes for High Speed Multiedia Networking. PhD Thesis, Washington University. Dec. 96.
7 4. Pawan Goyal, Xingang Guo, Harrick Vin. A Hierarchical CPU Scheduler for Multiedia Operating Syste. The proceedings of Second Usenix Syposiu on Operating Syste Design and Ipleentation, Seattle WA, Oct Michael B. Jones, Daniela Rosu, Marcel-Catalin Rosu. CPU Reservations and Tie Constraints: Efficient, predictable Scheduling of Independent Activities. Proceedings of the 6th ACM Syposiu on Operating Systes Principles (SOSP '97), St. Malo, France, Oct Chen Lee, Ragunathan Rajkuar, Cliff Mercer. Experience with Processor Reservation and Dynaic QoS in Real-Tie Mach. Multiedia Japan, Jun Kaada, Masanobu Yuhara, Etsuo Ono. User-level Realtie Scheduler Exploiting Kernellevel Fixed Priority Scheduler. Multiedia Japan, March Clifford W. Mercer, Stefan Savage, Hideyuki Tokuda. Processor Capacity Reserves: Operating Syste Support for Multiedia Applications '. IEEE International Conference on Multiedia Coputing and Systes. May Klara Nahrstedt, Hao-hua Chu, Srinivas Narayan. QoS-Aware Resource Manageent for Distributed Multiedia Application. Technical Report No. UI- UCDCS-R-97-23, Departent of Coputer Science, University of Illinois at Urbana-Chapaign, Oct Jason Nieh, Monica La. The Design, Ipleentation and Evaluation of SMART: A Scheduler for Multiedia Applications. Proceedings of the Sixteenth ACM Syposiu on Operating Systes Principles, St. Malo, France, Oct David K.Y. Yau and Sion S. La. Adaptive Rate-Controlled Scheduling for Multiedia Applications. ACM Multiedia Conference, Boston, MA, Nov R. Nagarajan and C. Vogt. Guaranteed- Perforance Transport of Multiedia Traffic over the Token Ring. Technical Report 43.92, IBM European Networking Center, IBM Heidelberg, Gerany, 992.
An Innovate Dynamic Load Balancing Algorithm Based on Task
An Innovate Dynaic Load Balancing Algorith Based on Task Classification Hong-bin Wang,,a, Zhi-yi Fang, b, Guan-nan Qu,*,c, Xiao-dan Ren,d College of Coputer Science and Technology, Jilin University, Changchun
More informationModeling Parallel Applications Performance on Heterogeneous Systems
Modeling Parallel Applications Perforance on Heterogeneous Systes Jaeela Al-Jaroodi, Nader Mohaed, Hong Jiang and David Swanson Departent of Coputer Science and Engineering University of Nebraska Lincoln
More informationA framework for performance monitoring, load balancing, adaptive timeouts and quality of service in digital libraries
Int J Digit Libr (2000) 3: 9 35 INTERNATIONAL JOURNAL ON Digital Libraries Springer-Verlag 2000 A fraework for perforance onitoring, load balancing, adaptive tieouts and quality of service in digital libraries
More informationCPU Animation. Introduction. CPU skinning. CPUSkin Scalar:
CPU Aniation Introduction The iportance of real-tie character aniation has greatly increased in odern gaes. Aniating eshes ia 'skinning' can be perfored on both a general purpose CPU and a ore specialized
More informationDynamic Placement for Clustered Web Applications
Dynaic laceent for Clustered Web Applications A. Karve, T. Kibrel, G. acifici, M. Spreitzer, M. Steinder, M. Sviridenko, and A. Tantawi IBM T.J. Watson Research Center {karve,kibrel,giovanni,spreitz,steinder,sviri,tantawi}@us.ib.co
More informationSearching strategy for multi-target discovery in wireless networks
Searching strategy for ulti-target discovery in wireless networks Zhao Cheng, Wendi B. Heinzelan Departent of Electrical and Coputer Engineering University of Rochester Rochester, NY 467 (585) 75-{878,
More informationarxiv:0805.1434v1 [math.pr] 9 May 2008
Degree-distribution stability of scale-free networs Zhenting Hou, Xiangxing Kong, Dinghua Shi,2, and Guanrong Chen 3 School of Matheatics, Central South University, Changsha 40083, China 2 Departent of
More informationLocal Area Network Management
Technology Guidelines for School Coputer-based Technologies Local Area Network Manageent Local Area Network Manageent Introduction This docuent discusses the tasks associated with anageent of Local Area
More informationThe Application of Bandwidth Optimization Technique in SLA Negotiation Process
The Application of Bandwidth Optiization Technique in SLA egotiation Process Srecko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia
More informationThe Research of Measuring Approach and Energy Efficiency for Hadoop Periodic Jobs
Send Orders for Reprints to reprints@benthascience.ae 206 The Open Fuels & Energy Science Journal, 2015, 8, 206-210 Open Access The Research of Measuring Approach and Energy Efficiency for Hadoop Periodic
More informationAn Integrated Approach for Monitoring Service Level Parameters of Software-Defined Networking
International Journal of Future Generation Counication and Networking Vol. 8, No. 6 (15), pp. 197-4 http://d.doi.org/1.1457/ijfgcn.15.8.6.19 An Integrated Approach for Monitoring Service Level Paraeters
More informationEnergy Proportionality for Disk Storage Using Replication
Energy Proportionality for Disk Storage Using Replication Jinoh Ki and Doron Rote Lawrence Berkeley National Laboratory University of California, Berkeley, CA 94720 {jinohki,d rote}@lbl.gov Abstract Energy
More informationExploiting Hardware Heterogeneity within the Same Instance Type of Amazon EC2
Exploiting Hardware Heterogeneity within the Sae Instance Type of Aazon EC2 Zhonghong Ou, Hao Zhuang, Jukka K. Nurinen, Antti Ylä-Jääski, Pan Hui Aalto University, Finland; Deutsch Teleko Laboratories,
More informationPREDICTION OF POSSIBLE CONGESTIONS IN SLA CREATION PROCESS
PREDICTIO OF POSSIBLE COGESTIOS I SLA CREATIO PROCESS Srećko Krile University of Dubrovnik Departent of Electrical Engineering and Coputing Cira Carica 4, 20000 Dubrovnik, Croatia Tel +385 20 445-739,
More informationApplying Multiple Neural Networks on Large Scale Data
0 International Conference on Inforation and Electronics Engineering IPCSIT vol6 (0) (0) IACSIT Press, Singapore Applying Multiple Neural Networks on Large Scale Data Kritsanatt Boonkiatpong and Sukree
More informationImplementation of Active Queue Management in a Combined Input and Output Queued Switch
pleentation of Active Queue Manageent in a obined nput and Output Queued Switch Bartek Wydrowski and Moshe Zukeran AR Special Research entre for Ultra-Broadband nforation Networks, EEE Departent, The University
More informationAnalyzing Spatiotemporal Characteristics of Education Network Traffic with Flexible Multiscale Entropy
Vol. 9, No. 5 (2016), pp.303-312 http://dx.doi.org/10.14257/ijgdc.2016.9.5.26 Analyzing Spatioteporal Characteristics of Education Network Traffic with Flexible Multiscale Entropy Chen Yang, Renjie Zhou
More informationAn Application Research on the Workflow-based Large-scale Hospital Information System Integration
106 JOURNAL OF COMPUTERS, VOL. 6, NO. 1, JANUARY 2011 An Application Research on the Workflow-based Large-scale Hospital Inforation Syste Integration Yang Guojun School of Coputer, Neijiang Noral University,
More informationMedia Adaptation Framework in Biofeedback System for Stroke Patient Rehabilitation
Media Adaptation Fraework in Biofeedback Syste for Stroke Patient Rehabilitation Yinpeng Chen, Weiwei Xu, Hari Sundara, Thanassis Rikakis, Sheng-Min Liu Arts, Media and Engineering Progra Arizona State
More informationSoftware Quality Characteristics Tested For Mobile Application Development
Thesis no: MGSE-2015-02 Software Quality Characteristics Tested For Mobile Application Developent Literature Review and Epirical Survey WALEED ANWAR Faculty of Coputing Blekinge Institute of Technology
More informationApproximately-Perfect Hashing: Improving Network Throughput through Efficient Off-chip Routing Table Lookup
Approxiately-Perfect ing: Iproving Network Throughput through Efficient Off-chip Routing Table Lookup Zhuo Huang, Jih-Kwon Peir, Shigang Chen Departent of Coputer & Inforation Science & Engineering, University
More informationHow To Balance Over Redundant Wireless Sensor Networks Based On Diffluent
Load balancing over redundant wireless sensor networks based on diffluent Abstract Xikui Gao Yan ai Yun Ju School of Control and Coputer Engineering North China Electric ower University 02206 China Received
More informationReal Time Target Tracking with Binary Sensor Networks and Parallel Computing
Real Tie Target Tracking with Binary Sensor Networks and Parallel Coputing Hong Lin, John Rushing, Sara J. Graves, Steve Tanner, and Evans Criswell Abstract A parallel real tie data fusion and target tracking
More informationEvaluating Inventory Management Performance: a Preliminary Desk-Simulation Study Based on IOC Model
Evaluating Inventory Manageent Perforance: a Preliinary Desk-Siulation Study Based on IOC Model Flora Bernardel, Roberto Panizzolo, and Davide Martinazzo Abstract The focus of this study is on preliinary
More informationManaging Complex Network Operation with Predictive Analytics
Managing Coplex Network Operation with Predictive Analytics Zhenyu Huang, Pak Chung Wong, Patrick Mackey, Yousu Chen, Jian Ma, Kevin Schneider, and Frank L. Greitzer Pacific Northwest National Laboratory
More informationPERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO
Bulletin of the Transilvania University of Braşov Series I: Engineering Sciences Vol. 4 (53) No. - 0 PERFORMANCE METRICS FOR THE IT SERVICES PORTFOLIO V. CAZACU I. SZÉKELY F. SANDU 3 T. BĂLAN Abstract:
More informationSUPPORTING YOUR HIPAA COMPLIANCE EFFORTS
WHITE PAPER SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation HEALTHCARE SUPPORTING YOUR HIPAA COMPLIANCE EFFORTS Quanti Solutions. Advancing HIM through Innovation
More informationOnline Bagging and Boosting
Abstract Bagging and boosting are two of the ost well-known enseble learning ethods due to their theoretical perforance guarantees and strong experiental results. However, these algoriths have been used
More informationAn Improved Decision-making Model of Human Resource Outsourcing Based on Internet Collaboration
International Journal of Hybrid Inforation Technology, pp. 339-350 http://dx.doi.org/10.14257/hit.2016.9.4.28 An Iproved Decision-aking Model of Huan Resource Outsourcing Based on Internet Collaboration
More informationFuzzy Sets in HR Management
Acta Polytechnica Hungarica Vol. 8, No. 3, 2011 Fuzzy Sets in HR Manageent Blanka Zeková AXIOM SW, s.r.o., 760 01 Zlín, Czech Republic blanka.zekova@sezna.cz Jana Talašová Faculty of Science, Palacký Univerzity,
More informationASIC Design Project Management Supported by Multi Agent Simulation
ASIC Design Project Manageent Supported by Multi Agent Siulation Jana Blaschke, Christian Sebeke, Wolfgang Rosenstiel Abstract The coplexity of Application Specific Integrated Circuits (ASICs) is continuously
More informationCooperative Caching for Adaptive Bit Rate Streaming in Content Delivery Networks
Cooperative Caching for Adaptive Bit Rate Streaing in Content Delivery Networs Phuong Luu Vo Departent of Coputer Science and Engineering, International University - VNUHCM, Vietna vtlphuong@hciu.edu.vn
More informationProtecting Small Keys in Authentication Protocols for Wireless Sensor Networks
Protecting Sall Keys in Authentication Protocols for Wireless Sensor Networks Kalvinder Singh Australia Developent Laboratory, IBM and School of Inforation and Counication Technology, Griffith University
More informationREQUIREMENTS FOR A COMPUTER SCIENCE CURRICULUM EMPHASIZING INFORMATION TECHNOLOGY SUBJECT AREA: CURRICULUM ISSUES
REQUIREMENTS FOR A COMPUTER SCIENCE CURRICULUM EMPHASIZING INFORMATION TECHNOLOGY SUBJECT AREA: CURRICULUM ISSUES Charles Reynolds Christopher Fox reynolds @cs.ju.edu fox@cs.ju.edu Departent of Coputer
More informationCRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS
641 CRM FACTORS ASSESSMENT USING ANALYTIC HIERARCHY PROCESS Marketa Zajarosova 1* *Ph.D. VSB - Technical University of Ostrava, THE CZECH REPUBLIC arketa.zajarosova@vsb.cz Abstract Custoer relationship
More informationAudio Engineering Society. Convention Paper. Presented at the 119th Convention 2005 October 7 10 New York, New York USA
Audio Engineering Society Convention Paper Presented at the 119th Convention 2005 October 7 10 New York, New York USA This convention paper has been reproduced fro the authors advance anuscript, without
More informationA Scalable Application Placement Controller for Enterprise Data Centers
W WWW 7 / Track: Perforance and Scalability A Scalable Application Placeent Controller for Enterprise Data Centers Chunqiang Tang, Malgorzata Steinder, Michael Spreitzer, and Giovanni Pacifici IBM T.J.
More informationRECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION. Henrik Kure
RECURSIVE DYNAMIC PROGRAMMING: HEURISTIC RULES, BOUNDING AND STATE SPACE REDUCTION Henrik Kure Dina, Danish Inforatics Network In the Agricultural Sciences Royal Veterinary and Agricultural University
More informationAirline Yield Management with Overbooking, Cancellations, and No-Shows JANAKIRAM SUBRAMANIAN
Airline Yield Manageent with Overbooking, Cancellations, and No-Shows JANAKIRAM SUBRAMANIAN Integral Developent Corporation, 301 University Avenue, Suite 200, Palo Alto, California 94301 SHALER STIDHAM
More informationRed Hat Enterprise Linux: Creating a Scalable Open Source Storage Infrastructure
Red Hat Enterprise Linux: Creating a Scalable Open Source Storage Infrastructure By Alan Radding and Nick Carr Abstract This paper discusses the issues related to storage design and anageent when an IT
More informationAn Approach to Combating Free-riding in Peer-to-Peer Networks
An Approach to Cobating Free-riding in Peer-to-Peer Networks Victor Ponce, Jie Wu, and Xiuqi Li Departent of Coputer Science and Engineering Florida Atlantic University Boca Raton, FL 33431 April 7, 2008
More informationAn Optimal Task Allocation Model for System Cost Analysis in Heterogeneous Distributed Computing Systems: A Heuristic Approach
An Optial Tas Allocation Model for Syste Cost Analysis in Heterogeneous Distributed Coputing Systes: A Heuristic Approach P. K. Yadav Central Building Research Institute, Rooree- 247667, Uttarahand (INDIA)
More informationDesign of Model Reference Self Tuning Mechanism for PID like Fuzzy Controller
Research Article International Journal of Current Engineering and Technology EISSN 77 46, PISSN 347 56 4 INPRESSCO, All Rights Reserved Available at http://inpressco.co/category/ijcet Design of Model Reference
More informationEnergy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and migration algorithms
Energy Efficient VM Scheduling for Cloud Data Centers: Exact allocation and igration algoriths Chaia Ghribi, Makhlouf Hadji and Djaal Zeghlache Institut Mines-Téléco, Téléco SudParis UMR CNRS 5157 9, Rue
More informationThe Benefit of SMT in the Multi-Core Era: Flexibility towards Degrees of Thread-Level Parallelism
The enefit of SMT in the Multi-Core Era: Flexibility towards Degrees of Thread-Level Parallelis Stijn Eyeran Lieven Eeckhout Ghent University, elgiu Stijn.Eyeran@elis.UGent.be, Lieven.Eeckhout@elis.UGent.be
More informationNew for 2016! Get Licensed
Financial Manageent 2016 HS There s only one place you need to go for all your professional developent needs. The Power to Know. NEW Experience a different school of learning! New for 2016! Online courses
More informationStandards and Protocols for the Collection and Dissemination of Graduating Student Initial Career Outcomes Information For Undergraduates
National Association of Colleges and Eployers Standards and Protocols for the Collection and Disseination of Graduating Student Initial Career Outcoes Inforation For Undergraduates Developed by the NACE
More informationThis paper studies a rental firm that offers reusable products to price- and quality-of-service sensitive
MANUFACTURING & SERVICE OPERATIONS MANAGEMENT Vol., No. 3, Suer 28, pp. 429 447 issn 523-464 eissn 526-5498 8 3 429 infors doi.287/so.7.8 28 INFORMS INFORMS holds copyright to this article and distributed
More informationGenerating Certification Authority Authenticated Public Keys in Ad Hoc Networks
SECURITY AND COMMUNICATION NETWORKS Published online in Wiley InterScience (www.interscience.wiley.co). Generating Certification Authority Authenticated Public Keys in Ad Hoc Networks G. Kounga 1, C. J.
More informationResearch Article Performance Evaluation of Human Resource Outsourcing in Food Processing Enterprises
Advance Journal of Food Science and Technology 9(2): 964-969, 205 ISSN: 2042-4868; e-issn: 2042-4876 205 Maxwell Scientific Publication Corp. Subitted: August 0, 205 Accepted: Septeber 3, 205 Published:
More informationMachine Learning Applications in Grid Computing
Machine Learning Applications in Grid Coputing George Cybenko, Guofei Jiang and Daniel Bilar Thayer School of Engineering Dartouth College Hanover, NH 03755, USA gvc@dartouth.edu, guofei.jiang@dartouth.edu
More informationOptimal Resource-Constraint Project Scheduling with Overlapping Modes
Optial Resource-Constraint Proect Scheduling with Overlapping Modes François Berthaut Lucas Grèze Robert Pellerin Nathalie Perrier Adnène Hai February 20 CIRRELT-20-09 Bureaux de Montréal : Bureaux de
More informationImage restoration for a rectangular poor-pixels detector
Iage restoration for a rectangular poor-pixels detector Pengcheng Wen 1, Xiangjun Wang 1, Hong Wei 2 1 State Key Laboratory of Precision Measuring Technology and Instruents, Tianjin University, China 2
More informationReliability Constrained Packet-sizing for Linear Multi-hop Wireless Networks
Reliability Constrained acket-sizing for inear Multi-hop Wireless Networks Ning Wen, and Randall A. Berry Departent of Electrical Engineering and Coputer Science Northwestern University, Evanston, Illinois
More informationThe AGA Evaluating Model of Customer Loyalty Based on E-commerce Environment
6 JOURNAL OF SOFTWARE, VOL. 4, NO. 3, MAY 009 The AGA Evaluating Model of Custoer Loyalty Based on E-coerce Environent Shaoei Yang Econoics and Manageent Departent, North China Electric Power University,
More informationLeak detection in open water channels
Proceedings of the 17th World Congress The International Federation of Autoatic Control Seoul, Korea, July 6-11, 28 Leak detection in open water channels Erik Weyer Georges Bastin Departent of Electrical
More informationSOME APPLICATIONS OF FORECASTING Prof. Thomas B. Fomby Department of Economics Southern Methodist University May 2008
SOME APPLCATONS OF FORECASTNG Prof. Thoas B. Foby Departent of Econoics Southern Methodist University May 8 To deonstrate the usefulness of forecasting ethods this note discusses four applications of forecasting
More informationResource Allocation in Wireless Networks with Multiple Relays
Resource Allocation in Wireless Networks with Multiple Relays Kağan Bakanoğlu, Stefano Toasin, Elza Erkip Departent of Electrical and Coputer Engineering, Polytechnic Institute of NYU, Brooklyn, NY, 0
More informationMarkovian inventory policy with application to the paper industry
Coputers and Cheical Engineering 26 (2002) 1399 1413 www.elsevier.co/locate/copcheeng Markovian inventory policy with application to the paper industry K. Karen Yin a, *, Hu Liu a,1, Neil E. Johnson b,2
More informationUse of extrapolation to forecast the working capital in the mechanical engineering companies
ECONTECHMOD. AN INTERNATIONAL QUARTERLY JOURNAL 2014. Vol. 1. No. 1. 23 28 Use of extrapolation to forecast the working capital in the echanical engineering copanies A. Cherep, Y. Shvets Departent of finance
More informationImpact of Processing Costs on Service Chain Placement in Network Functions Virtualization
Ipact of Processing Costs on Service Chain Placeent in Network Functions Virtualization Marco Savi, Massio Tornatore, Giacoo Verticale Dipartiento di Elettronica, Inforazione e Bioingegneria, Politecnico
More informationLoad Control for Overloaded MPLS/DiffServ Networks during SLA Negotiation
Int J Counications, Network and Syste Sciences, 29, 5, 422-432 doi:14236/ijcns292547 Published Online August 29 (http://wwwscirporg/journal/ijcns/) Load Control for Overloaded MPLS/DiffServ Networks during
More informationConsiderations on Distributed Load Balancing for Fully Heterogeneous Machines: Two Particular Cases
Considerations on Distributed Load Balancing for Fully Heterogeneous Machines: Two Particular Cases Nathanaël Cheriere Departent of Coputer Science ENS Rennes Rennes, France nathanael.cheriere@ens-rennes.fr
More informationInternational Journal of Management & Information Systems First Quarter 2012 Volume 16, Number 1
International Journal of Manageent & Inforation Systes First Quarter 2012 Volue 16, Nuber 1 Proposal And Effectiveness Of A Highly Copelling Direct Mail Method - Establishent And Deployent Of PMOS-DM Hisatoshi
More informationMathematical Model for Glucose-Insulin Regulatory System of Diabetes Mellitus
Advances in Applied Matheatical Biosciences. ISSN 8-998 Volue, Nuber (0), pp. 9- International Research Publication House http://www.irphouse.co Matheatical Model for Glucose-Insulin Regulatory Syste of
More informationDriving Behavior Analysis Based on Vehicle OBD Information and AdaBoost Algorithms
, March 18-20, 2015, Hong Kong Driving Behavior Analysis Based on Vehicle OBD Inforation and AdaBoost Algoriths Shi-Huang Chen, Jeng-Shyang Pan, and Kaixuan Lu Abstract This paper proposes a novel driving
More informationEfficient Key Management for Secure Group Communications with Bursty Behavior
Efficient Key Manageent for Secure Group Counications with Bursty Behavior Xukai Zou, Byrav Raaurthy Departent of Coputer Science and Engineering University of Nebraska-Lincoln Lincoln, NE68588, USA Eail:
More informationA Fast Algorithm for Online Placement and Reorganization of Replicated Data
A Fast Algorith for Online Placeent and Reorganization of Replicated Data R. J. Honicky Storage Systes Research Center University of California, Santa Cruz Ethan L. Miller Storage Systes Research Center
More informationON SELF-ROUTING IN CLOS CONNECTION NETWORKS. BARRY G. DOUGLASS Electrical Engineering Department Texas A&M University College Station, TX 77843-3128
ON SELF-ROUTING IN CLOS CONNECTION NETWORKS BARRY G. DOUGLASS Electrical Engineering Departent Texas A&M University College Station, TX 778-8 A. YAVUZ ORUÇ Electrical Engineering Departent and Institute
More informationExtended-Horizon Analysis of Pressure Sensitivities for Leak Detection in Water Distribution Networks: Application to the Barcelona Network
2013 European Control Conference (ECC) July 17-19, 2013, Zürich, Switzerland. Extended-Horizon Analysis of Pressure Sensitivities for Leak Detection in Water Distribution Networks: Application to the Barcelona
More informationGeometrico-static Analysis of Under-constrained Cable-driven Parallel Robots
Geoetrico-static Analysis of Under-constrained Cable-driven Parallel Robots M. Carricato and J.-P. Merlet 1 DIEM - Dept. of Mechanical Engineering, University of Bologna, Italy, e-ail: arco.carricato@ail.ing.unibo.it
More informationA CHAOS MODEL OF SUBHARMONIC OSCILLATIONS IN CURRENT MODE PWM BOOST CONVERTERS
A CHAOS MODEL OF SUBHARMONIC OSCILLATIONS IN CURRENT MODE PWM BOOST CONVERTERS Isaac Zafrany and Sa BenYaakov Departent of Electrical and Coputer Engineering BenGurion University of the Negev P. O. Box
More informationPhysics 211: Lab Oscillations. Simple Harmonic Motion.
Physics 11: Lab Oscillations. Siple Haronic Motion. Reading Assignent: Chapter 15 Introduction: As we learned in class, physical systes will undergo an oscillatory otion, when displaced fro a stable equilibriu.
More informationThe Velocities of Gas Molecules
he Velocities of Gas Molecules by Flick Colean Departent of Cheistry Wellesley College Wellesley MA 8 Copyright Flick Colean 996 All rights reserved You are welcoe to use this docuent in your own classes
More informationEquivalent Tapped Delay Line Channel Responses with Reduced Taps
Equivalent Tapped Delay Line Channel Responses with Reduced Taps Shweta Sagari, Wade Trappe, Larry Greenstein {shsagari, trappe, ljg}@winlab.rutgers.edu WINLAB, Rutgers University, North Brunswick, NJ
More informationCLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY
CLOSED-LOOP SUPPLY CHAIN NETWORK OPTIMIZATION FOR HONG KONG CARTRIDGE RECYCLING INDUSTRY Y. T. Chen Departent of Industrial and Systes Engineering Hong Kong Polytechnic University, Hong Kong yongtong.chen@connect.polyu.hk
More informationMethod of supply chain optimization in E-commerce
MPRA Munich Personal RePEc Archive Method of supply chain optiization in E-coerce Petr Suchánek and Robert Bucki Silesian University - School of Business Adinistration, The College of Inforatics and Manageent
More informationEvaluating the Effectiveness of Task Overlapping as a Risk Response Strategy in Engineering Projects
Evaluating the Effectiveness of Task Overlapping as a Risk Response Strategy in Engineering Projects Lucas Grèze Robert Pellerin Nathalie Perrier Patrice Leclaire February 2011 CIRRELT-2011-11 Bureaux
More informationConstructing Services with Interposable Virtual Hardware
Constructing Services with Interposable Virtual Hardware Andrew Whitaker, Richard S. Cox, Marianne Shaw, and Steven D. Gribble University of Washington {andrew,rick,ar,gribble}@cs.washington.edu Abstract
More informationEntity Search Engine: Towards Agile Best-Effort Information Integration over the Web
Entity Search Engine: Towards Agile Best-Effort Inforation Integration over the Web Tao Cheng, Kevin Chen-Chuan Chang University of Illinois at Urbana-Chapaign {tcheng3, kcchang}@cs.uiuc.edu. INTRODUCTION
More informationThe individual neurons are complicated. They have a myriad of parts, subsystems and control mechanisms. They convey information via a host of
CHAPTER 4 ARTIFICIAL NEURAL NETWORKS 4. INTRODUCTION Artificial Neural Networks (ANNs) are relatively crude electronic odels based on the neural structure of the brain. The brain learns fro experience.
More informationWorkflow Management in Cloud Computing
Workflow Manageent in Cloud Coputing Monika Bharti M.E. student Coputer Science and Engineering Departent Thapar University, Patiala Anju Bala Assistant Professor Coputer Science and Engineering Departent
More informationINTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE SYSTEMS
Artificial Intelligence Methods and Techniques for Business and Engineering Applications 210 INTEGRATED ENVIRONMENT FOR STORING AND HANDLING INFORMATION IN TASKS OF INDUCTIVE MODELLING FOR BUSINESS INTELLIGENCE
More informationData Streaming Algorithms for Estimating Entropy of Network Traffic
Data Streaing Algoriths for Estiating Entropy of Network Traffic Ashwin Lall University of Rochester Vyas Sekar Carnegie Mellon University Mitsunori Ogihara University of Rochester Jun (Ji) Xu Georgia
More informationCalculation Method for evaluating Solar Assisted Heat Pump Systems in SAP 2009. 15 July 2013
Calculation Method for evaluating Solar Assisted Heat Pup Systes in SAP 2009 15 July 2013 Page 1 of 17 1 Introduction This docuent describes how Solar Assisted Heat Pup Systes are recognised in the National
More informationExercise 4 INVESTIGATION OF THE ONE-DEGREE-OF-FREEDOM SYSTEM
Eercise 4 IVESTIGATIO OF THE OE-DEGREE-OF-FREEDOM SYSTEM 1. Ai of the eercise Identification of paraeters of the euation describing a one-degree-of- freedo (1 DOF) atheatical odel of the real vibrating
More informationHalloween Costume Ideas for the Wii Game
Algorithica 2001) 30: 101 139 DOI: 101007/s00453-001-0003-0 Algorithica 2001 Springer-Verlag New York Inc Optial Search and One-Way Trading Online Algoriths R El-Yaniv, 1 A Fiat, 2 R M Karp, 3 and G Turpin
More informationA Multi-Core Pipelined Architecture for Parallel Computing
Parallel & Cloud Coputing PCC Vol, Iss A Multi-Core Pipelined Architecture for Parallel Coputing Duoduo Liao *1, Sion Y Berkovich Coputing for Geospatial Research Institute Departent of Coputer Science,
More informationModeling Cooperative Gene Regulation Using Fast Orthogonal Search
8 The Open Bioinforatics Journal, 28, 2, 8-89 Open Access odeling Cooperative Gene Regulation Using Fast Orthogonal Search Ian inz* and ichael J. Korenberg* Departent of Electrical and Coputer Engineering,
More information( C) CLASS 10. TEMPERATURE AND ATOMS
CLASS 10. EMPERAURE AND AOMS 10.1. INRODUCION Boyle s understanding of the pressure-volue relationship for gases occurred in the late 1600 s. he relationships between volue and teperature, and between
More informationCalculating the Return on Investment (ROI) for DMSMS Management. The Problem with Cost Avoidance
Calculating the Return on nvestent () for DMSMS Manageent Peter Sandborn CALCE, Departent of Mechanical Engineering (31) 45-3167 sandborn@calce.ud.edu www.ene.ud.edu/escml/obsolescence.ht October 28, 21
More informationADJUSTING FOR QUALITY CHANGE
ADJUSTING FOR QUALITY CHANGE 7 Introduction 7.1 The easureent of changes in the level of consuer prices is coplicated by the appearance and disappearance of new and old goods and services, as well as changes
More informationInformation Processing Letters
Inforation Processing Letters 111 2011) 178 183 Contents lists available at ScienceDirect Inforation Processing Letters www.elsevier.co/locate/ipl Offline file assignents for online load balancing Paul
More informationMarkov Models and Their Use for Calculations of Important Traffic Parameters of Contact Center
Markov Models and Their Use for Calculations of Iportant Traffic Paraeters of Contact Center ERIK CHROMY, JAN DIEZKA, MATEJ KAVACKY Institute of Telecounications Slovak University of Technology Bratislava
More informationThe Virtual Spring Mass System
The Virtual Spring Mass Syste J. S. Freudenberg EECS 6 Ebedded Control Systes Huan Coputer Interaction A force feedbac syste, such as the haptic heel used in the EECS 6 lab, is capable of exhibiting a
More informationAN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES
Int. J. Appl. Math. Coput. Sci., 2014, Vol. 24, No. 1, 133 149 DOI: 10.2478/acs-2014-0011 AN ALGORITHM FOR REDUCING THE DIMENSION AND SIZE OF A SAMPLE FOR DATA EXPLORATION PROCEDURES PIOTR KULCZYCKI,,
More informationPosition Auctions and Non-uniform Conversion Rates
Position Auctions and Non-unifor Conversion Rates Liad Blurosen Microsoft Research Mountain View, CA 944 liadbl@icrosoft.co Jason D. Hartline Shuzhen Nong Electrical Engineering and Microsoft AdCenter
More informationInsurance Spirals and the Lloyd s Market
Insurance Spirals and the Lloyd s Market Andrew Bain University of Glasgow Abstract This paper presents a odel of reinsurance arket spirals, and applies it to the situation that existed in the Lloyd s
More information6. Time (or Space) Series Analysis
ATM 55 otes: Tie Series Analysis - Section 6a Page 8 6. Tie (or Space) Series Analysis In this chapter we will consider soe coon aspects of tie series analysis including autocorrelation, statistical prediction,
More informationPreference-based Search and Multi-criteria Optimization
Fro: AAAI-02 Proceedings. Copyright 2002, AAAI (www.aaai.org). All rights reserved. Preference-based Search and Multi-criteria Optiization Ulrich Junker ILOG 1681, route des Dolines F-06560 Valbonne ujunker@ilog.fr
More information