ppxscal/embedding_network huggingface dataset:
Curriculum Knowledge Representation and Manipulation in Knowledge-Based Tutoring Systems
Authors: Gang Zhou, Jason T. -L. Wang, Peter A. Ng
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

A Knowledge-Based Tutoring System (KBTS) is a computer-based instructional system that uses artificial intelligence techniques to help people learn some subjects. We found that the knowledge communication process involving a KBTS and a human student can be decomposed into a series of communication cycles, where each cycle concentrates on one topic and contains four major phases: planning, discussing, evaluating and remedying. The major contributions of this work are the development of a generic architecture for supporting the knowledge communication between a KBTS and a student, and a graphical notation and schema for supporting the curriculum knowledge representation and manipulation during the planning phase of a tutoring process. The curriculum knowledge about a course can help a tutoring system determine the sequences in which the topics will be discussed with the students effectively and diagnose the students' mistakes. The curriculum knowledge base contains the goal structure of the course, prerequisite relations, and multiple ways of organizing topics, among others. As an example, we have focused on developing SQL-TUTOR, a KBTS for the domain of SQL programming. This system has features such as efficient control mechanism, explicit curriculum knowledge representation, and individualized private tutoring. For allowing the students relative freedom to decide how to study the domain knowledge about a subject, the system provides the students with a group of operators to hand-tailor the learning schedules according to their special backgrounds, requests, and interests.
Moore's Law: Change or Die
Authors: Ted J. Biggerstaff
Venue: IEEE Software (1996)

In June, members of IEEE Software's Editorial Board and Industry Advisory Board met on how to make the magazine even better. Lots of fascinating and educational discussions and debates ensued. Our boards are not populated by many shy people! One IAB member, Ted Biggerstaff, offered to write down his perceptions of the challenges that we are likely to face soon, and the opportunities we have to leverage those challenges. The intent was that Ted's position paper would stir further controversy among the board members, and so it has! But it is so well-written and so challenging to the software industry in general, and to our magazine specifically, that I felt it was important to share it with our readers. I do not necessarily agree with everything that is written here, but Ted states his case very well. Please write us and let us know what you think.¿Al Davis
A Fine-Grain Architecture for Relational Database Aggregation Operations
Authors: M. Abdelguerfi, A. K. Sood
Venue: IEEE Micro (1991)

The design and simulation of a bit-sliced processor for relational database aggregation functions, are discussed. The processor, which addresses an important, computationally expensive problem in database computers, takes two tuples as input (one bit at a time) and returns two bits as output every clock cycle. A larger aggregation unit uses a number of identical slice processors, connected according to odd-even network topology, to achieve improved performance on a parallel pipelined processor. The data processing time is completely overlapped with the input and output of data to and from the unit. The design is independent of the tuple size, and since a bit-serial computation is used, the system requires limited interconnection.
Data Mining: An Overview from a Database Perspective
Authors: Ming-Syan Chen, Jiawei Han, Philip S. Yu
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Mining information and knowledge from large databases has been recognized by many researchers as a key research topic in database systems and machine learning, and by many industrial companies as an important area with an opportunity of major revenues. Researchers in many different fields have shown great interest in data mining. Several emerging applications in information providing services, such as data warehousing and on-line services over the Internet, also call for various data mining techniques to better understand user behavior, to improve the service provided, and to increase the business opportunities. In response to such a demand, this article is to provide a survey, from a database researcher's point of view, on the data mining techniques developed recently. A classification of the available data mining techniques is provided, and a comparative study of such techniques is presented.
Using metrics in management decision making
Authors: George Stark, Robert C. Durst, C. W. Vowell
Venue: Computer (1994)

The amount of code in NASA systems has continued to grow over the past 30 years. This growth brings with it the increased risk of system failure caused by software. Thus, managing the risks inherent in software development and maintenance is becoming a highly visible and important field. The metrics effort within NASA's Mission Operations Directorate has helped managers and engineers better understand their processes and products. The toolkit helps ensure consistent data collection across projects and increases the number and types of analysis options available to project personnel. The decisions made on the basis of metrics analysis have helped project engineers make decisions about project and mission readiness by removing the inherent optimism of "engineering judgment".
Structural and electrical characterisation of Titanium and Nickel silicide contacts on Silicon carbide
Authors: F. La Via, F. Roccaforte, A. Makhtari, V. Raineri, P. Musumeci, L. Calcagno
Venue: Microelectronic Engineering (2002)

The interfacial reaction and phase formation as a function of the annealing temperature (600-1000°C) and time were investigated on both titanium and nickel thin films evaporated on n-type 6H-SiC (0001) substrate. The study was carried out employing a combination of Rutherford backscattering spectrometry, X-ray diffraction, transmission electron microscopy and sheet resistance measurements. A correlation has been found between the annealing process and the electrical measurements on transmission line method (TLM) structures and Schottky diodes. In the case of titanium, the formation of different phases in the analysed temperature ranges significantly changes the electrical properties. In fact, while a double layer of TiC and Ti5Si3 was formed at 900 and 950°C, the ternary phase Ti3SiC2 was observed only at 1000°C. With this high temperature process the specific contact resistance decreases from 10-4 to 6.7 × 10-5 Ωcm2. In the case of nickel silicide the only phase that has been observed between 600 and 950°C was the Ni2Si. The carbon of the consumed silicon carbide layer has been dissolved in the silicide film, during the reaction, forming carbon precipitates. The specific contact resistance reaches the lowest value (3.6 × 10-5 Ωcm2) after the highest temperature anneal. The Ni2Si/SiC Schottky diodes show almost ideal characteristics (n = 1.07) and a barrier height of ∼1.3 eV. From the electrical characterisation, a non-uniform Schottky barrier height seems to be formed.
Identifying Minimal Shift Counters: A Search Technique
Authors: A. M. Tokarnia
Venue: IEEE Transactions on Computers (1994)

A minimal modulo-m n-stage shift counter is defined as a shift counter with a feedback function of the form Y/sub 1/=y/sub n/.
Computationally Convenient Distributional Assumptions for Common-ValueAuctions
Authors: Michael B. Gordy
Venue: Computational Economics (1998)

Although the mathematical foundations of common-value auctions have been well understood since Milgrom and Weber (1982), equilibrium bidding strategies are computationally complex. Very few calculated examples can be found in the literature, and only for highly specialized cases. This paper introduces two sets of distributional assumptions that are flexible enough for theoretical and empirical applications, yet permit straightforward calculation of equilibrium bidding strategies.
An APL system for increased engineering productivity
Authors: Harold R. Ward
Venue: ACM SIGAPL APL Quote Quad (1984)

Choosing APL as the primary environment for engineering computer usage requires careful consideration of the extremes of computer usage sophistication, amounts of computation and storage, and types of computer programs. A system of APL workspaces is described which enables a small group of engineering technicians to provide appropriate computing support to a large group of users in and outside the Engineering Department.ENGLIB is developed as a working model for a practical, conceptually simple environment for engineering data processing with facilities for handling and expediting all phases of engineering computer usage. Computer support, ranging from routine job production to highly technical engineering programming to computer education, is accomplished using APL as the background for man-made synergy and interpersonal communication. Featured are interfaces to non-APL software and data storage/retrieval systems and a general description of the major subsystems and key peripheral functions which enable ENGLIB to fit and increase engineering productivity. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Knowledge Systems for Planning Support
Authors: Joseph Fiksel, Frederick Hayes-Roth
Venue: IEEE Expert: Intelligent Systems and Their Applications (1989)

The nature of organizational planning is examined, and the status of planning research is discussed. Several major recurrent technical hurdles that have emerged in planning research, and for which satisfactory solutions have yet to be found are identified. To circumvent these problems and accelerate the near-term availability of intelligent planning aids, an alternative approach is suggested. It consists of bifurcating planning research by decoupling the problem-solving component of planning systems from the knowledge-representation and plan-evaluation components. This allows the development of interactive planning systems in which humans play the role of problem solver and machines assist by analyzing, monitoring, and refining plans initiated by humans. Eventually, as research on problem-solving methods matures, it should be possible to recouple this component gradually to achieve true system autonomy.
Output models of MAP/PH/1(/K) queues for an efficient network decomposition
Authors: Armin Heindl, Miklós Telek
Venue: Performance Evaluation (2002)

For non-trivial (open) queueing networks, traffic-based decomposition often represents the only feasible--and at the same time fast--solution method besides simulation. The network is partitioned into individual nodes which are analyzed in isolation with respect to approximate internal traffic representations. Since the correlations of network traffic may have a considerable impact on performance measures, they must be captured to some extent by the employed traffic descriptors. The decomposition methodology presented in this paper is based on Markovian arrival processes (MAPs), whose correlation structure is determined from the busy-period behavior of the upstream queues. The resulting compact MAPs in connection with sophisticated moment-matching techniques allow an efficient decomposition of large queueing networks. Numerical experiments demonstrate the substantially enhanced precision due to improved output models compared with the experiments of Heindl and Telek [MAP-based decomposition of tandem networks of ./PH/1(/K) queues with MAP input, in: Proceedings of the 11th GI/ITG Conference on Measuring, Modelling and Evaluation of Computer and Communication Systems, Aachen, Germany, 2001, pp. 179-194].
Making Pointer-Based Data Structures Cache Conscious
Authors: Trishul M. Chilimbi, Mark D. Hill, James R. Larus
Venue: Computer (2000)

Rapid increases in processor speed and slower increases in memory speed have produced memory access times that exceed the cost of simple, arithmetic operations. The ubiquitous hardware solution to this problem is memory caches, which exploit program locality to reduce the average latency. Other techniques use complex hardware and software to reduce or hide the high cost of memory accesses.The processor-memory gap requires a hierarchy of two or more caches between the processor and memory. The cost of finding data in this hierarchy undercuts the fundamental RAM model assumption that all memory accesses have unit cost.To narrow the widening gap between processor and memory performance, the authors propose using pointer structures to bolster performance by placing elements in a compound data structure in different memory and cache locations. This careful placement of structure elements enhances the performance of pointer-minipulating programs by improving their cache locality.
Loop Coalescing and Scheduling for Barrier MIMD Architectures
Authors: M. T. O'Keefe, H. G. Dietz
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

Barrier MIMD's are asynchronous multiple instruction stream, multiple data stream architectures capable of parallel execution of variable execution time instructions and arbitrary control flow (e.g., while loops and calls); however, they differ from conventional MIMD's in that the need for run-time synchronization is significantly reduced. The authors consider the problem of scheduling nested loop structures on a barrier MIMD. The basic approach employs loop coalescing, a technique for transforming a multiply-nested loop into a single loop. Loop coalescing is extended to nested triangular loops, in which inner loop bounds are functions of outer loop indices. In addition, a more efficient scheme to generate the original loop indices from the coalesced index is proposed for the case of constant loop bounds. These results are general, and can be applied to extend previous work using loop coalescing techniques. The authors concentrate on using loop coalescing for scheduling barrier MIMDs, and show how previous work in loop transformations and linear scheduling theory can be applied to this problem.
Temporal Data Management Systems: A Comparative View
Authors: R. Maiocchi, B. Pernici
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Characteristics and requirements of systems for temporal data management in the areas of data and knowledge bases, artificial intelligence, and software engineering are investigated and discussed on the basis of a case study. Six representative approaches were selected for this analysis, with the goal of identifying particular features of systems proposed in different areas. The six approaches are: Allen's interval-based logic, Dean and McDermott's time map management, Kowalski and Sergot's event calculus, Maiocchi and Pernici's TSOS. Snodgrass' TQuel, and Hagelstein's ERAE. The characteristics of each system are classified and compared. On the basis of this analysis, a framework for the evaluation of temporal systems and for the specification of temporal data management systems is proposed.
Sequential Hardware Prefetching in Shared-Memory Multiprocessors
Authors: Fredrik Dahlgren, Michel Dubois, Per Stenström
Venue: IEEE Transactions on Parallel and Distributed Systems (1995)

To offset the effect of read miss penalties on processor utilization in shared-memory multiprocessors, several software- and hardware-based data prefetching schemes have been proposed. A major advantage of hardware techniques is that they need no support from the programmer or compiler.Sequential prefetching is a simple hardware-controlled prefetching technique which relies on the automatic prefetch of consecutive blocks following the block that misses in the cache, thus exploiting spatial locality. In its simplest form, the number of prefetched blocks on each miss is fixed throughout the execution. However, since the prefetching efficiency varies during the execution of a program, we propose to adapt the number of prefetched blocks according to a dynamic measure of prefetching effectiveness. Simulations of this adaptive scheme show reductions of the number of read misses, the read penalty, and of the execution time by up to 78%, 58%, and 25% respectively.
Energy Scavenging with Shoe-Mounted Piezoelectrics
Authors: Nathan S. Shenck, Joseph A. Paradiso
Venue: IEEE Micro (2001)

Decreasing size and power requirements of wearable microelectronics make it possible to replace batteries with systems that capture energy from the user's environment. Unobtrusive devices developed at the MIT Media Lab scavenge electricity from the forces exerted on a shoe during walking: a flexible piezoelectric foil stave to harness sole-bending energy and a reinforced PZT dimorph to capture heel-strike energy.
The Windows NT Kernel Architecture
Authors: David A. Solomon
Venue: Computer (1998)

Windows NT 5.0 is a massive release, with significant new operating system and network functionality being added to many areas of the system. It is not, however, a rewrite-many aspects of the kernel system architecture remain the same or are being extended. In other words, the fundamental operating system architecture is not changing in Windows NT 5.0. This article is intended as a brief introduction to the NT architecture, including those features-notably Plug and Play, the job object, and 64-bit large memory support-that necessitated extensions to the executive and the kernel. The author briefly describes major new features in NT 5.0, such as the Active Directory and the Distributed Security Services. The companion articles describe major new extensions to the NT file system and the Microsoft Clustering Service.
On the reconstruction of perfect codes
Authors: Olof Heden
Venue: Discrete Mathematics (2002)

We show how to reconstruct a perfect 1-error correcting binary code of length n from the code words of weight (n+ 1)/2.
Semiregular Large Sets
Authors: Charles A. Cusack, Spyros S. Magliveras
Venue: Designs, Codes and Cryptography (1999)

We develop the notion of t-homogeneous, G-semiregular large sets of t-designs, show that there are infinitely many 3-homogeneous PSL(2, q)-semiregular large sets when q\equiv 3 \mod 4, two sporadic 3-homogeneous A \GammaL(1,32)-semiregular large sets, and no other interesting t-homogeneous G-semiregular large sets for t\ge 3.
Empirical Evidence for Ultrametric Structure in Multi-layer Perceptron Error Surfaces
Authors: Marcus Gallagher, Tom Downs, Ian Wood
Venue: Neural Processing Letters (2002)

Combinatorial optimization problems share an interesting property with spin glass systems in that their state spaces can exhibit ultrametric structure. We use sampling methods to analyse the error surfaces of feedforward multi-layer perceptron neural networks learning encoder problems. The third order statistics of these points of attraction are examined and found to be arranged in a highly ultrametric way. This is a unique result for a finite, continuous parameter space. The implications of this result are discussed.
Inference in MLS Database Systems
Authors: Donald G. Marks
Venue: IEEE Transactions on Knowledge and Data Engineering (1996)

Database systems that contain information of varying degrees of sensitivity pose the threat that some of the Low data may infer High data. This study derives conditions sufficient to identify such inference threats. First, it is reasoned that a database can only control material implications, as specified in formal logic systems. These material implications are found using Knowledge Discovery techniques. Material implications allow reasoning about outside knowledge, and provide the first assurance that outside knowledge does not assist in circumventing the inference controls. Database queries specify the properties of sets of data and are compared to help determine inferences. These queries are grouped into equivalence classes based upon their inference characteristics. A unique graph based model is developed for the equivalence classes that 1) makes such comparisons easy, and 2) allows implementation of an algorithm capable of finding those material implication rules where High data is inferred from Low data. This is the first method that offers assurance and sufficiency arguments that the mechanism is at least strong enough to protect the High data in the database from inference attacks that require Low data.
Organizing and Understanding Beliefs in Advice-Giving Diagnostic Systems
Authors: J. R. Bourne, H. -H. Liu, C. D. Orogo, G. C. Collins, N. S. Uckun, A. J. Brodersen
Venue: IEEE Transactions on Knowledge and Data Engineering (1991)

Reasoning based on belief functions and cause-effect hierarchies are combined to create a methodology for enhanced evidential reasoning. A description of the methodology is given as well as examples of the utilization of a complete system. The method provides reasoning about belief among alternatives, is extensible, and can be easily scaled up to large problems. It is asserted that belief manipulation coupled with information about fault history, events, and symptoms is sufficient to secure good diagnostic results.
Photoluminescence of GaAs under surface acoustic wave propagation in high magnetic fields
Authors: Y. Takagaki, E. Wiebicke, H. J. Zhu, R. Hey, M. Ramsteiner, K. H. Ploog
Venue: Microelectronic Engineering (2002)

We investigate the variation of the quenching of photoluminescence (PL) by surface acoustic waves (SAWs) when the depth profile of the SAW-induced electric fields is altered. The PL transition from the conduction band to acceptor states is restricted to regions near the GaAs surface. The acceptor-bound exciton recombination takes place in a region that extends far deeper than the laser-excited volume. The response of PL in high magnetic fields provides evidence for magnetic-field-induced trapping of electrons and holes around disorder potentials.
Numerically stable fast convergence least-squares algorithms for multichannel active sound cancellation systems and sound deconvolution systems
Authors: Martin Bouchard
Venue: Signal Processing (2002)

In recent years, recursive least-squares (RLS) algorithms and fast-transversal-filters (FTF) algorithms have been introduced for multichannel active sound cancellation (ASC) systems and multichannel sound deconvolution (MSD) systems. It was reported that these algorithms can greatly improve the convergence speed of the ASC/MSD systems using adaptive FIR filters. However, numerical instability of the algorithms is an issue that needs to be resolved. In this paper, extensions of numerically stable realisations of RLS algorithms such as the inverse QR-RLS, the QR decomposition least-squares-lattice (QRD-LSL) and the symmetry preserving RLS algorithms are introduced for the specific problem of multichannel ASC/MSD. Multichannel versions of some of these algorithms have previously been published for prediction or identification systems, but not for control systems. The case of underdetermined ASC/MSD systems (i.e. systems with more actuators than error sensors) is also considered, to show that in these cases it may be required to use constrained algorithms in order to have numerical stability. Constrained algorithms for multichannel ASC/MSD systems are therefore introduced for two types of constraints: minimisation of the actuator signals power and minimization of the adaptive filters square coefficients. Simulation results are shown to verify the numerical stability of the algorithms introduced in the paper.