ppxscal/embedding_network huggingface dataset:
Real-Rate Scheduling
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Traditionally, real-time scheduling mechanismshave been used to provide predictable scheduling latency butthese mechanisms are difficult to use in general-purpose operatingsystems (OSs) because they require precise specification ofthread requirements in terms of low-level resources such as CPUcycles. In a general-purpose environment such a specificationmay not be statically available. In this paper, we present thedesign, implementation and evaluation of a novel feedback-basedreal-rate scheduler that automatically infers thread requirementsand thus makes it easier to use real-time scheduling mechanismsin general-purpose OSs. The real-rate controller uses thread-specifiedtime-stamps that indicate a threadýs progress to estimateresource requirements. The goal of the controller is to regulatethe overallocation of resources and the delay experienced by athread. It meets these goals by using gain compensation and bychoosing an appropriate sampling period for the controller thatdepends only on the granularity of thread time-stamps. A keybenefit of the real-rate approach is that it can be easily appliedin a general-purpose environment across different applicationsbecause the controller does not require any tuning.
Data Management in Real-Time Systems: a Case of On-Demand Updates in Vehicle Control Systems
Venue: Proceedings of the 10th IEEE Real-Time and Embedded Technology and Applications Symposium (2004)

Real-time and embedded applications normally haveconstraints both with respect to timeliness and freshness ofdata they use. At the same time it is important that the resourcesare utilized as efficient as possible, e.g., for CPUresources unnecessary calculations should be lowered asmuch as possible. This is especially true for vehicle controlsystems, which are our targeting application area. The contributionof this paper is a new algorithm (ODTB) for updatingdata items that can skip unnecessary updates allowingfor better utilization of the CPU. Performance evaluationson an engine electronic control unit for automobilesshow that a database system using the new updating algorithmreduces the number of recalculations to zero in steadystates. We also evaluate the algorithm using a simulator andshow that the ODTB performs better than well-establishedupdating algorithms (up to 50% more committed transactions).
Maximum Cardinality Search for Computing Minimal Triangulations of Graphs
Authors: Anne Berry, Jean R. S. Blair, Pinar Heggernes, Barry W. Peyton
Venue: Algorithmica (2004)

We present a new algorithm, called MCS-M, for computing minimal triangulations of graphs. Lex-BFS, a seminal algorithm for recognizing chordal graphs, was the genesis for two other classical algorithms: LEX M and MCS. LEX M extends the fundamental concept used in Lex-BFS, resulting in an algorithm that not only recognizes chordality, but also computes a minimal triangulation of an arbitrary graph. MCS simplifies the fundamental concept used in Lex-BFS, resulting in a simpler algorithm for recognizing chordal graphs. The new algorithm MCS-M combines the extension of LEX M with the simplification of MCS, achieving all the results of LEX M in the same time complexity.
On the Minimization of Multiple-Valued Input Binary-Valued Output Functions
Venue: Proceedings of the 34th International Symposium on Multiple-Valued Logic (2004)

The success of the local covering approachto multiple-valued input two-valued output (MVITVO)functions minimization depends vastly on the properchoice of the base minterms from the ON set of thesome new techniques to improve the performance of thisapproach. We have introduced a graph called anenhanced assignment graph (EAG) for the efficientgrouping of the Boolean variables. In order to make thebest choice of the proper base minterm we have defineda new technique to find the potential canonical cube(PCC) covering it. In this process we have succeeded infinding out the essential primes efficiently whichenhances the total computation time and producesbetter sum of products (SOP).
A Heuristic to Determine Low Leakage Sleep State Vectors for CMOS Combinational Circuits
Authors: Rahul M. Rao, Frank Liu, Jeffrey L. Burns, Richard B. Brown
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Input vector control has been used to minimize the leakage powerconsumption of a circuit in sleep state. In this paper, we presenta novel heuristic for determining a low leakage vector to beapplied to a circuit in sleep state. The heuristic is a greedy searchbased on the controllability of nodes in the circuit and uses thefunctional dependencies among cells in the circuit to guide thesearch. Results on a set of ISCAS and MCNC benchmark circuitsshow that in all cases our heuristic returns a vector having aleakage within 5% of that of the vector obtained using an extensiverandom search, with orders of magnitude improvement incomputational speed.
Personalised E-Learning Opportunities - Call for a Pedagogical Domain Knowledge Model
Authors: Alex G. Buchner, David Patterson
Venue: Proceedings of the Database and Expert Systems Applications, 15th International Workshop (2004)

A considerable amount of e-learning content is being delivered via virtual or managed learning environments. These platforms keep track of learners' activities including content viewed, time spent and quiz results. This monitoring trawl provides appropriate data to enable personalised e-learning experiences through the application of existing data mining and knowledge discovery techniques. The reasons for not providing this type of bespoke teaching is, in addition to technical and financial constraints, largely due to the plethora of educational and pedagogical issues which have to be overcome. This paper presents these obstacles and suggests solutions thus challenging the community to focus on a new research area which concentrates on facilitating the specification and application of pedagogical domain knowledge for incorporation into existing data mining and knowledge discovery frameworks. This includes educational thresholds, constraints, taxonomies and previously discovered knowledge as well as pedagogical interestingness and metrics.
An Empirical Study on Keyword-based Web Site Clustering
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

Web site evolution is characterized by a limited supportto the understanding activities offered to the developers. Infact, design diagrams are often missing or outdated. A potentiallyinteresting option is to reverse engineer high levelviews of Web sites from the content of the Web pages. Clusteringis a valuable technique that can be used in this respect.Web pages can be clustered together based on thesimilarity of summary information about their content, representedas a list of automatically extracted keywords.This paper presents an empirical study that was conductedto determine the meaningfulness for Web developersof clusters automatically produced from the analysis ofthe Web page content. Natural Language Processing (NLP)plays a central role in content analysis and keyword extraction.Thus, a second objective of the study was to assess thecontribution of some shallow NLP techniques to the clusteringtask.
The difficulty of testing for isomorphism against a graph that is given in advance
Authors: Eldar Fischer
Venue: Proceedings of the thirty-sixth annual ACM symposium on Theory of computing (2004)

Motivated by a question from [6], we investigate the number of queries required for testing that an input graph G is isomorphic to a graph H that is given in advance. Our main result is that the more "complex" H is, the more queries it takes to test an input graph G for the property of being isomorphic to H. This is provided in terms of an upper bound and a lower bound on the number of queries, giving a relation between this number and a natural measure of the complexity of H.
Approaching the Maximum Energy Saving on Embedded Systems with Multiple Voltages
Authors: Shaoxiong Hua, Gang Qu
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Dynamic voltage scaling (DVS) is arguably the most effectiveenergy reduction technique. The multiple-voltage DVS systems,which can operate only at pre-determined discrete voltages, arepractical and have been well studied. However, one importantunsolved problem is how many levels and at which values shouldvoltages be implemented on a multiple-voltage DVS system toachieve the maximum energy saving. We refer this as the voltageset-up problem. In this paper, (1) we derive analytical solutionsfor dual-voltage system. (2) For the general case that does nothave analytic solutions, we develop efficient numerical methods.(3) We demonstrate how to apply the proposed algorithms onsystem design. (4) Interestingly, the experimental results suggestthat the multiple-voltage DVS system, when the voltages are setup properly, can reach DVS techniqueýs full potential in energysaving. Specifically, on the design of an ad hoc application-specificsystem and the design of the MPEG video encoder, wefind that the best single-voltage systems consume 150% and 20%more energy than the tight theoretical lower bounds, respectively.However, our approach gives dual-, 3-, and 4-voltage DVS systemsettings that are only 17.6%, 4.9%, and 2.6% for the ad hocsystem, and 4.0%, 1.1%, and 0.2% for the MPEG video encoder,over the same lower bounds.
Simplification of Three-Dimensional Density Maps
Authors: Vijay Natarajan, Herbert Edelsbrunner
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

We consider scientific data sets that describe density functions over three-dimensional geometric domains. Such data sets are often large and coarsened representations are needed for visualization and analysis. Assuming a tetrahedral mesh representation, we construct such representations with a simplification algorithm that combines three goals: the approximation of the function, the preservation of the mesh topology, and the improvement of the mesh quality. The third goal is achieved with a novel extension of the well-known quadric error metric. We perform a number of computational experiments to understand the effect of mesh quality improvement on the density map approximation. In addition, we study the effect of geometric simplification on the topological features of the function by monitoring its critical points.
Statistics of progressive breakdown in ultra-thin Oxides
Authors: B. P. Linder, J. H. Stathis
Venue: Microelectronic Engineering (2004)

Electrical breakdown manifests itself in ultra-thin oxides by a gradual and systematic rise in gate leakage current. On average, this progressive breakdown is shown to increase the gate leakage exponentially with time, with the time constant exponentially dependent on the gate voltage. Because thin oxides do not instantaneously short at the commencement of breakdown, the definition of oxide failure may be altered from the first jump in gate current to the leakage value that disrupts circuit operation. Depending on the ratio of the defect production rate to the defect growth rate, multiple breakdowns may form in a single device. A Monte Carlo simulator combines these results and calculates the oxide failure distribution with failure defined by a leakage level. The simulations reveal that updating the definition of oxide failure increases the projected reliability by many orders of magnitude.
A Framework for Polysensometric Multidimensional Spatial Visualization
Authors: Javed Khan, Xuebin Xu, Yongbin Ma
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualization (2004)

Typically any single sensor instrument suffers from physical/observation constraints. This paper discusses a generalized framework, called polymorphic visual information fusion framework (PVIF) that can enable information from multiple sensors to be fused and compared to gain broader understanding of a target of observation in multidimensional space. An automate software system supporting comparative cognition has been developed to form 3D models based on the datasets from different sensors, such as XPS and LSCM. This fusion framework not only provides an information engineering based tool to overcome the limitations of individual sensorýs scope of observation but also provides a means where theoretical understanding surrounding a complex target can be mutually validated by comparative cognition about the object of interest and 3D model refinement. Some polysensometric data classification metrics are provided to measure the quality of input datasets for fusion visualization.
State Pruning for Test Vector Generation for a Multiprocessor Cache Coherence Protocol
Authors: Ying Chen, Dennis Abts, David J. Lilja
Venue: Proceedings of the 15th IEEE International Workshop on Rapid System Prototyping (2004)

Verification is extremely important in designingdigital systems such as a cache coherence protocol.Generating traces for system verification using a modelchecker and then using the traces to drive the RTLlogic design simulation is an efficient method fordebugging. This method has been called the witnessstring method [2], which is based on DFS. Weinvestigate a state pruning method that exploitsmultiple search heuristics in simultaneous DFSsearches to choose the most efficient traces. Wedistribute the hash table of the entire state spaceamong the simultaneous searches so that theycooperate to avoid redundant state exploration. Toevaluate this new search algorithm, we implant severalprotocol bugs in the Stanford DASH cache coherenceprotocol. Using an IBM Power4 system with theBerkeley Active Message library, we show animprovement in witness strings generation through thestate pruning method over a pure DFS and a guidedDFS.
Static Determination of Probabilistic Execution Times
Authors: Laurent David, Isabelle Puaut
Venue: Proceedings of the 16th Euromicro Conference on Real-Time Systems (2004)

Most previous research done in probabilistic schedulabilityanalysis assumes a known distribution of executiontimes for each task of a real-time application. This is howevernot trivial to determine it with a high level of confidence. Methods based on measurements are often biased since not in general exhaustive on all the possible executionpaths, whereas methods based on static analysis aremostly Worst-Case Execution Time ¿ WCET ¿ oriented. Usingstatic analysis, this work proposes a method to obtainprobabilistic distributions of execution times. It assumesthat the given real time application is divided into multipletasks, whose source code is known. Ignoring in this paperhardware considerations and based only on the sourcecode of the tasks, the proposed technique allows designersto associate to any execution path an execution time and aprobability to go through this path. A source code exampleis presented to illustrate the method.
A Map-growing Localization Algorithm for Ad-hoc Wireless Sensor Networks
Authors: Xiaoli Li, Hongchi Shi, Yi Shang
Venue: Proceedings of the Parallel and Distributed Systems, Tenth International Conference (2004)

Localization is an important process in deploying ad-hocwireless sensor networks.Several localization algorithmshave been developed.However, they do not achieve satisfactoryperformance on irregular networks.In this paper,we present a localization algorithm based on an idea ofgrowing local maps.Simulation was performed on networksof different shapes with different connectivity and anchor.Compared with APS DV-distance [Ad-hoc positioning system], the map-growingalgorithm is about two times more accurate for C-shpaedgrid or hexagon networks with the same coverage as of APSDV-distance, when the range error is less than or equal to10%R, where R is the radio range.Compared with APSEuclidean [Ad-hoc positioning system], the coverage of map-growing is 100% withlow GPS ratio while APS Euclidean requires a higher GPSratio to get a better coverage.
On Application of Output Masking to Undetectable Faults in Synchronous Sequential Circuits with Design-for-Testability Logic
Authors: Irith Pomeranz, Sudhakar M. Reddy
Venue: Proceedings of the 2003 IEEE/ACM international conference on Computer-aided design (2003)

Design-for-testability (DFT ) for synchronous sequentialcircuits causes redundant faults in the original circuit to bedetectable in the circuit with DFT logic. It has beenargued that such faults should not be detected in order toavoid reducing the yield unnecessarily. One way to dealwith such faults is to mask (or ignore) their fault effectswhen they appear on the circuit outputs, without maskingthe detection of faults that need to be detected. To investigatethe extent to which this can be accomplished, wedescribe a procedure for masking the effects of redundantfaults of the original circuit under a given test set generatedfor the circuit with DFT logic. The procedureattempts to maximize the number of redundant faults thatare masked while minimizing (or holding to zero) thenumber of other masked faults.
CQoS: a framework for enabling QoS in shared caches of CMP platforms
Authors: Ravi Iyer
Venue: Proceedings of the 18th annual international conference on Supercomputing (2004)

Cache hierarchies have been traditionally designed for usage by a single application, thread or core. As multi-threaded (MT) and multi-core (CMP) platform architectures emerge and their workloads range from single-threaded and multithreaded applications to complex virtual machines (VMs), a shared cache resource will be consumed by these different entities generating heterogeneous memory access streams exhibiting different locality properties and varying memory sensitivity. As a result, conventional cache management approaches that treat all memory accesses equally are bound to result in inefficient space utilization and poor performance even for applications with good locality properties. To address this problem, this paper presents a new cache management framework (CQoS) that (1) recognizes the heterogeneity in memory access streams, (2) introduces the notion of QoS to handle the varying degrees of locality and latency sensitivity and (3) assigns and enforces priorities to streams based on latency sensitivity, locality degree and application performance needs. To achieve this, we propose CQoS options for priority classification, priority assignment and priority enforcement. We briefly describe CQoS priority classification and assignment options -- ranging from user-driven and developer-driven to compiler-detected and flow-based approaches. Our focus in this paper is on CQoS mechanisms for priority enforcement -- these include (1) selective cache allocation, (2) static/dynamic set partitioning and (3) heterogeneous cache regions. We discuss the architectural design and implementation complexity of these CQoS options. To evaluate the performance trade-offs for these options, we have modeled these CQoS options in a cache simulator and evaluated their performance in CMP platforms running network-intensive server workloads. Our simulation results show the effectiveness of our proposed options and make the case for CQoS in future multi-threaded/multi-core platforms since it improves shared cache efficiency and increases overall system performance as a result.
Experience from computer supported prototyping for information flow in hospitals
Authors: Hans Gill, Roland Lindvall, Olle Rosin, Erik Sandewall, Henrik Sörensen, Ove Wigertz
Venue: Proceedings of the workshop on Rapid prototyping (1982)

Special-purpose languages have several advantages for rapid prototyping purposes: they allow very fast development of applications; facilitate the dialogue with end users in the specification work; and simplify the work of updating the prototype iteratively. We have been working with a modelling language based on the concept of information flow in organizations, and a number of software tools which support this language. Previous papers from the project have described the first generation of tools; the present paper describes the experience from using the system in a large scale development effort, as well as the second generation of support tools.
Program Comprehension for the Purpose of Testing
Venue: Proceedings of the 12th IEEE International Workshop on Program Comprehension (2004)

In this paper program comprehensiontechniques are examined within the context of testing.First, the tasks of a tester are identified, then theinformation requirements of a tester to fulfill these tasks.Comprehension is viewed as a knowledge acquisitionprocess. The knowledge needed depends on the level atwhich one is testing. For system testing other knowledgeis required than for unit and integration testing. In lightof the scope of testing, the paper concludes that it is thetester who needs the broadest knowledge about asoftware system. Having established the informationrequirements of testing, a set of tools are presented whichhelp to satisfy these requirements and their practicalapplication discussed.
An Interactive Application for Removal of Bone Information in CT-Angiography
Authors: D. Maksimov, F. Finkel, T. Dietz, S. Diehl, C. Duber, P. Rebholz, J. Hesser, R. Manner
Venue: Proceedings of the 17th IEEE Symposium on Computer-Based Medical Systems (2004)

In this paper we present a method that allows removing bony structures and calcificationsfrom CT angiography (CTA) data. It relies on two data sets, one with (CA) and one without(NCA) contrast agent. In contrast to current approaches, the algorithm uses local rigidmatching of each single object. Therefore, it allows compensating motion of the patientduring acquisition. Furthermore, the method uses a highly accurate surface-matchingprocedure so that local mismatches can be as small as 3 voxels and therefore even arteriesnear the bone are mostly separated correctly.The overall system requires about 20 minutes on a Pentium 4 2.4 GHz with 1 GByte RAMfor a 700 MByte data set (CA+NCA) and is currently used in the clinic for evaluationpurposes.
A Comparative Capacity/Coverage Analysis for CDMA Cell in Different Propagation Environments
Authors: Aymen I. Zreikat, Khalid Al-Begain, Kevin Smith
Venue: Wireless Personal Communications: An International Journal (2004)

In the design of cells in mobile communication systems, path loss prediction models play an important role and have been the subject of the study for some time (M.F. Ibrahim and J.D. Parsons, IEE Proceedings, Vol. 130, No. 5, 1983). This paper presents the analysis of two main factors that affect the capacity bounds in a UMTS cell for different propagation models. These are the (i) interference levels at Node B, which increases with the number of active users, and (ii) the limited sending power of the user equipment (UE) which may not be able to send signals with enough power to reach Node B with the required received power level due to path loss. The aim of this paper is to analyse the capacity/coverage of the uplink of UMTS system in different propagation environments (free space, suburban, urban, dense urban, rural) and derive the capacity bounds for the UMTS cell. The capacity bounds have been extracted based on the extended COST-231 Hata model (http://cost.cordis.lu/src/whatiscost.cfm). COST-231 Hata is an extension of the Okumura&ndash;Hata model which covers the higher frequencies (G.L. St&uuml;ber, &ldquo;Principles of Mobile Communications,&rdquo; Kluwer, 1996) necessary for WCDMA. The basic model describes the propagation loss in an urban environment, but a number of correction factors can be applied to extend its application to a broader range of environments. The analysis takes into account a number of capacity influencing factors such as the CDMA code non-orthogonality, the inter-cell interference, imperfect power control, and different service specific factors. The simulation results show the effect of different system and varying environmental parameters upon the system's capacity in different environments. The results clearly demonstrate that it is too optimistic to rely on studies based on free space assumptions.