In recent years, practical software development exercises have been carried out in many higher education institutions. To carry out the exercises effectively, it is important that teachers understand the difficulty of...
详细信息
In recent years, practical software development exercises have been carried out in many higher education institutions. To carry out the exercises effectively, it is important that teachers understand the difficulty of learners in exercises and advise appropriately for it. Currently, a common way to check the results of the exercises is that teachers review artifacts which learners submitted. However, there is a problem in this way that it can't obtain information regarding the learners' artifacts creation process. Therefore, teachers can't fully understand difficulties of the learners. We focus on the learners' artifacts creation process and propose a method for detecting learners' difficult points during the exercises. We develop a tool that collects the class diagram creation process by learners during exercises and analyze it.
This paper investigates the maximum torque capability and torque ripple reduction using the asymmetric stator teeth for interior permanence magnet (IPM) synchronous machines. Traditional electric machines have the ide...
详细信息
This paper investigates the maximum torque capability and torque ripple reduction using the asymmetric stator teeth for interior permanence magnet (IPM) synchronous machines. Traditional electric machines have the identical width for all stator teeth and the winding function is fixed. Using different widths for different stator teeth changes the winding function, therefore, the torque ripple components. The mathematical modeling of interior permanent magnet (IPM) synchronous machine torque ripple and finite element analysis simulation results for the characteristic properties of electric machines are presented. Compared with a similar rating IPM machine, certain combinations of the teeth widths can reduce the torque ripple by 80% with less than 4% average torque decline.
The requirement for high performance detailed placement continues to grow in modern physical synthesis flows. During the optimization of placement, HPWL is the most basic and important objective while some other impor...
详细信息
ISBN:
(纸本)9781479934331
The requirement for high performance detailed placement continues to grow in modern physical synthesis flows. During the optimization of placement, HPWL is the most basic and important objective while some other important metrics such as placement density also needs to be carefully monitored, preserving the overall quality of a given placement. We present an effective detailed placement algorithm for total HPWL and density optimization. First, we perform a density-aware cell swapping technique to improve wirelength. Second, cell re-ordering is performed to handle left-right order problem of cells within a segment, picking the order with the best HPWL. Third, a bloating and refinement technique is performed to evenly distribute the cells in regular bins, reducing bin utilization. Wirelength and cell density are iteratively optimized until the improvement is converged. The algorithm is tested on ICCAD13 benchmark suites [1]. Using the evaluation script of ICCAD13 contest, we achieved an average of 4.86% reduction in HPWL and 10.48% reduction in scaled HPWL.
This paper discusses a face image abstraction method by using SIFT features and Ford-Fulkerson algorithm. Ford-Fulkerson algorithm is used to compute the maximum flow in a flow network drawn on SIFT features extracted...
详细信息
This paper discusses a face image abstraction method by using SIFT features and Ford-Fulkerson algorithm. Ford-Fulkerson algorithm is used to compute the maximum flow in a flow network drawn on SIFT features extracted from a face image. The idea is to obtain an augmenting path which is a path from the source vertex to destination vertex with the available capacities on all edges along a set of paths and flow is calculated along one of these paths. The process is repeated until it is obtained more paths with the available capacities. At the initial stage, face image is characterized by SIFT (Scale Invariant Feature Transform) features and the keypoints descriptor information is taken as features set for further processing. Keypoints descriptor is used to generate several face representations by using a series of matrix operations which are further used to determine a Directed Acyclic Graph (DAG). The resultant directed graph contains sparse and distinctive face characteristics of a subject from which the face image is captured. We then apply the Ford-Fulkerson algorithm on the directed graph to maintain the capacity constraints, skew symmetry and flow conservation to obtain an augmenting path with available capacities (relation between SIFT points). Finally, we obtain a mathematical representation of a face image and this representation is further encoded to be used as a set of distinctive features for matching. The time complexity of the proposed face abstraction algorithm is found to be O(VE 2 ) where V is the set of vertices and E is the set of edges in a directed graph.
To support mobility, wireless mobile devices are powered by batteries;however, a battery can only store a limited amount of energy. According to the experiment, for a 3G handheld device, the wireless interface consume...
详细信息
UML is a modeling language commonly used in contemporary software or system development. Using UML models at the design stage is relatively simpler and better visualized than using one of the PLC languages specified i...
详细信息
The Object Modelling System (OMS) platform supports initiatives to build or re-factor agro-environmental models and deploy them in different business contexts as model services on cloud computing platforms. Whether tr...
详细信息
The Object Modelling System (OMS) platform supports initiatives to build or re-factor agro-environmental models and deploy them in different business contexts as model services on cloud computing platforms. Whether traditional desktop, client-server, or emerging cloud deployments, success especially at the enterprise level relies on stable and efficient data provisioning to the models. In this paper we describe recent experience and trends with tools and services to supply data for model inputs. Solutions range from simple pre-processing tools to data services deployed to cloud platforms. Also, systematic, sustained data stewardship and alignment with standards organizations impart stability to data provisioning efforts.
Infrastructure-as-a-service (laaS) clouds provide a new medium for deployment of environmental modeling applications. Harnessing advancements in virtualization, laaS clouds can provide dynamic scalable infrastructure ...
详细信息
Infrastructure-as-a-service (laaS) clouds provide a new medium for deployment of environmental modeling applications. Harnessing advancements in virtualization, laaS clouds can provide dynamic scalable infrastructure to better support scientific modeling computational demands. Providing scientific modeling "as-a-service" requires dynamic scaling of server infrastructure to adapt to changing user workloads. This paper presents the Virtual Machine (VM) Scaler, an autonomic resource manager for laaS Clouds. We have developed VM-Scaler, a REST/JSON-based web services application which supports infrastructure provisioning and management to support scientific modeling for the Cloud Services Innovation Platform (CSIP) [Lloyd et al. 2012]. VM-Scaler harnesses the Amazon Elastic Compute Cloud (EC2) application programming interface to support model-service scalability, cloud management, and infrastructure configuration for supporting modeling workloads. VM-Scaler provides "cloud control" while abstracting the underlying laaS cloud from the end user. VM-Scaler is extensible to support any EC2 compatible cloud and currently supports the Amazon public cloud and Eucalyptus private clouds versions 3.1 and 3.3. VM-Scaler provides a platform to improve scientific model deployment by supporting experimentation with: hot spot detection schemes, VM management and placement approaches, and model job scheduling/proxy services.
A novel on-line diagnosis method is proposed in this paper that uses a qualitative dynamic model of the system and its colored Petri nets model. The model contains both the normal and the possible faulty operational m...
详细信息
ISBN:
(纸本)9789077381861
A novel on-line diagnosis method is proposed in this paper that uses a qualitative dynamic model of the system and its colored Petri nets model. The model contains both the normal and the possible faulty operational modes of the system. The deviation between the normal and faulty modes is characterized based on P-HAZID tables. The actual system state can be searched on the occurrence graph constructed in advance. Starting from this node the possible consequences and root causes can be determined on-line with traversing on the graph. The proposed method is illustrated on simple case studies.
Time-Domain worst case or performance bound estimation for analog integrated circuits and interconnect circuits are crucial for both analog and digital circuit design and optimization in the presence of process variat...
详细信息
Time-Domain worst case or performance bound estimation for analog integrated circuits and interconnect circuits are crucial for both analog and digital circuit design and optimization in the presence of process variations. In this paper, we present a novel non-Monte-Carlo (MC) performance bound analysis technique in time domain. The new method consists of several steps. First the symbolic transient modified nodal analysis (MNA) formulation of the circuit matrices of (linearized) analog and interconnect circuits at a time step is formed. Then the closed-form expressions of the interested performance in terms of variational parameters of the circuit matrices of (linearized) analog and interconnect circuits are derived via a graph-based symbolic analysis method. Then time-domain performance response bound of current time step are obtained by a nonlinear constrained optimization process subject to the parameter variations and variational circuit state bounds computed from the previous time step. We study the bounds computed by the proposed against the different sigma bounds by the standard MC method, which shows that the proposed method is more efficient for computing high sigma bounds than the MC method. Experimental results show that the new method can deliver order of magnitudes speedup over the standard Monte Carlo simulation on some typical analog circuits and interconnect circuits with high accuracy.
暂无评论