ppxscal/embedding_network huggingface dataset:
The multics virtual memory
Authors: A. Bensoussan, C. T. Clingen, R. C. Daley
Venue: Proceedings of the second symposium on Operating systems principles (1969)

As experience with use of on-line operating systems has grown, the need to share information among system users has become increasingly apparent. Many contemporary systems permit some degree of sharing. Usually, sharing is accomplished by allowing several users to share data via input and output of information stored in files kept in secondary storage. Through the use of segmentation, however, Multics provides direct hardware addressing by user and system programs of all information, independent of its physical storage location. Information is stored in segments each of which is potentially sharable and carries its own independent attributes of size and access privilege.Here, the design and implementation considerations of segmentation and sharing in Multics are first discussed under the assumption that all information resides in a large, segmented main memory. Since the size of main memory on contemporary systems is rather limited, it is then shown how the Multics software achieves the effect of a large segmented main memory through the use of the GE 645 segmentation and paging hardware.
A unified decimal floating-point architecture for the support of high-level languages
Authors: Frederic N. Ris
Venue: ACM SIGPLAN Notices (1977)

This paper summarizes a proposal for a decimal floating-point arithmetic interface for the support of high-level languages, consisting both of the arithmetic operations observed by application programs and facilities to produce subroutine libraries accessible from these programs. What is not included here are the detailed motivations, examinations of alternatives, and implementation considerations which will appear in the full work.
Wavelet-Based Progressive Compression Scheme for Triangle Meshes: Wavemesh
Authors: Sébastien Valette, Rémy Prost
Venue: IEEE Transactions on Visualization and Computer Graphics (2004)

Abstract--This paper proposes a new lossy to lossless progressive compression scheme for triangular meshes, based on a wavelet multiresolution theory for irregular 3D meshes. Although remeshing techniques obtain better compression ratios for geometric compression, this approach can be very effective when one wants to keep the connectivity and geometry of the processed mesh completely unchanged. The simplification is based on the solving of an inverse problem. Optimization of both the connectivity and geometry of the processed mesh improves the approximation quality and the compression ratio of the scheme at each resolution level. We show why this algorithm provides an efficient means of compression for both connectivity and geometry of 3D meshes and it is illustrated by experimental results on various sets of reference meshes, where our algorithm performs better than previously published approaches for both lossless and progressive compression.
Evaluating the Reliability of Defect-Tolerant Architectures for Nanotechnology with Probabilistic Model Checking
Authors: Gethin Norman, David Parker, Marta Kwiatkowska, Sandeep K. Shukla
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

As we move from deep submicron technology to nanotechnologyfor device manufacture, the need for defect-tolerantarchitectures is gaining importance. This is because, at thenanoscale, devices will be prone to errors due to manufacturingdefects, ageing, and transient faults. Micro-architectswill be required to design their logic around defect tolerancethrough redundancy. However, measures of reliabilitymust be quantified in order for such design methodologiesto be acceptable. We propose a CAD framework basedon probabilistic model checking which provides efficientevaluation of the reliability/redundancy trade-off for defect-tolerantarchitectures. This framework can model probabilisticassumptions about defects, easily compute reliabilityfigures and help designers make the right decisions.We demonstrate the power of our framework by evaluatingthe reliability/redundancy trade-off of a canonical example,namely NAND multiplexing. We not only find errors in analyticallycomputed bounds published recently, but we alsoshow how to use our framework to evaluate various facetsof design trade-off for reliability.
The emergence of a giant component in random subgraphs of pseudo-random graphs
Authors: Alan Frieze, Michael Krivelevich, Ryan Martin
Venue: Random Structures Algorithms (2004)

Let G be a d-regular graph G on n vertices. Suppose that the adjacency matrix of G is such that the eigenvalue λ which is second largest in absolute value satisfies λ = o(d). Let Gp with p = α/d be obtained from G by including each edge of G independently with probability p. We show that if α < 1, then whp the maximum component size of Gp is O(log n) and if α > 1, then Gp contains a unique giant component of size Ω(n), with all other components of size O(log n).
Teaching computer graphics constructively
Authors: Gustav Taxén
Venue: ACM SIGGRAPH 2003 Educators Program (2003)

This paper is concerned with the teaching of interactive computer graphics. It provides a short overview of two influential constructivist epistemologies and describes a preliminary attempt to apply them in practical graphics education.
Content-based image indexing and query: feature extraction, evidence combination and relevance feedback
Authors: Raj S. Acharya
Venue:  (2003)

Large visual information systems require effective and efficient means of indexing and accessing images. Content Based Image Retrieval (CBIR) systems have gained prominence over the past few years as a means of indexing and retrieving image data using pictorial examples as query objects. A typical query might entail the location of all images in a database that contain an image similar to a given query image. Most CBIR systems use low level features such as texture, color and shape to formulate the query. A number of methods of extracting features from images have been proposed, almost all of them are domain dependent. There have been a few approaches that combine these features to formulate a more complex query. Relevance feedback (RF) from the environment has also been used as a means of training CBIR systems and improving the performance of feature based query schemes. These methods typically use image classification based approaches, where image query results are returned based on membership of different &ldquo;classes&rdquo;. Current systems use probabilistic approaches to adjust the contributions of the different low level features. Query schemes based on feature extraction methods generally make recognition errors of different types, and hence a scheme that would exploit this &ldquo;error independence&rdquo; among these schemes could be used to improve the performance of a combined system using these features. Further, if the RF mechanism can be &ldquo;decoupled&rdquo; at a system level from the feature extraction methods, new low level feature extraction methods can be added and irrelevant ones removed from the system during training sessions. A new scheme for combining results from a number of low level feature based image classifiers based on the relative relevance of the features is proposed here. This is achieved using evidence combination. A scheme for distributing RF from the environment to each of the low level classifiers is also proposed. This improves the performance of each individual classifier, and in some cases where the feature is not relevant, to remove them from the scheme. The scheme improves the overall relevance of the returned results and hence improves accuracy over other methods.
Normalization by evaluation with typed abstract syntax
Authors: Olivier Danvy, Morten Rhiger, Kristoffer H. Rose
Venue: Journal of Functional Programming (2001)

In higher-order abstract syntax, the variables and bindings of an object language are represented by variables and bindings of a meta-language. Let us consider the simply typed &lambda;-calculus as object language and Haskell as meta-language. For concreteness, we also throw in integers and addition, but only in this section.
Risk Management Is Still Where the Money Is
Authors: Dan Geer
Venue: Computer (2003)

Security is not a product but a process. The question is only what tradeoffs to make. The answer is interdisciplinary.
Perceptual issues for the use of 3D auditory displays in operational environments
Authors: Derek Brock, James A. Ballas, Brian McClimens
Venue: Proceedings of the 1st international symposium on Information and communication technologies (2003)

Recent laboratory studies have demonstrated that properly designed uses of 3-dimensional (3D) sound are an effective technique for managing attention, improving performance, balancing workload, and reducing effort in information-rich decision environments (Brock, Stroup, & Ballas, 2002). However, a number of practical difficulties remain to be addressed before these benefits can be operationalized in real-world settings where listeners must regularly cope with extraneous noise and listen for auditory information in the external environment that may be germane to their assignments. In many routine operational environments, such concerns make fixed, event-driven auditory display designs readily susceptible to auditory masking and presentation conflicts. Strategies for overcoming these particular vulnerabilities are needed to avoid unacceptable levels of performance and information loss. Advances in sound processing technology and artificial intelligence techniques make it possible to imagine auditory displays that are capable of self-organizing presentation behaviors, but a body of perceptual studies must be carried out to support the manipulations such a system would implement. In this short paper, the notion of a self-organizing auditory display is characterized and relevant auditory perception research at the Naval Research Laboratory (NRL) is described.
Ensemble modelling or selecting the best model: Many could be better than one
Authors: S. V. Barai, Yoram Reich
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (1999)

In the course of data modelling, many models could be created. Much work has been done on formulating guidelines for model selection. However, by and large, these guidelines are conservative or too specific. Instead of using general guidelines, models could be selected for a particular task based on statistical tests. When selecting one model, others are discarded. Instead of losing potential sources of information, models could be combined to yield better performance. We review the basics of model selection and combination and discuss their differences. Two examples of opportunistic and principled combinations are presented. The first demonstrates that mediocre quality models could be combined to yield significantly better performance. The latter is the main contribution of the paper; it describes and illustrates a novel heuristic approach called the SG(k-NN) ensemble for the generation of good-quality and diverse models that can even improve excellent quality models.
Leakage Reduction techniques in a 0.13um SRAM Cell
Authors: Sergey Romanovsky, Arun Achyuthan, Sreedhar Natarajan, Wing Leung
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

SRAM standby leakage isvery becoming critical with technologyscaling to meet the industry'sdemanding low power requirements..This paper discusses some of the leakagereduction techniques in a 0.13um SRAMcell in a standard foundry process. Varyingthe cell bias voltages (VDD, VSS, wellbiases, bit-line pre-charge, and wordline off)to different standby levels helps achievereduced leakage. Variation of these biasvoltages by 0.3v from normal voltage levelsreduces the leakage to 10pA/Cell at roomtemperature. The VDD and bit-line pre-chargelevels need to be restored to at least95% of the normal level before an activecycle for reliable noise margin. Dependingon the bias voltage (VDD or VSS or both)variation, the access time and the staticnoise margin will be affected. This paperstudies the details of critical SRAM cellparameters for different bias voltagesvariations to reduce standby leakage andtheir impact to the overall design.
Coordinating work in hospitals through a global tool: implications for the implementation of electronic patient records in hospitals
Authors: Gunnar Ellingsen
Venue: Scandinavian Journal of Information Systems (2003)

Modem organisations increasingly have to face the challenge of increased complexity and specialisation. The specialisation of work requires professionals, people possessing specialised skills and often having a high level of education. Organisations that face this kind of problem are large hospitals. The implementation of Electronic Patient Records (EPRs) in these hospitals is accordingly expected to reduce complexity and curb specialisation by coordinating work among contexts and different types of users. The paper is based on a hospital department with several different professionals working together. The professionals successfully organise their work and the production of their reports according to a global classification system. This makes the case an illustrative example on how hospitals might take a starting point in EPRs through such a mechanism and may provide some strategies for the implementation of EPRs.
Analysis of a Wavelet-based Watermarking Algorithm
Authors: Víctor V. Hernández Guzmán, Mariko Nakano Miyatake, Héctor M. Pérez Meana
Venue: Proceedings of the 14th International Conference on Electronics, Communications and Computers (2004)

In this paper the analysis of a wavelet-basedwatermarking algorithm is presented, in whichDiscrete Wavelet Transform (DWT) is used forwatermark embedding and detection. In imagecompression field, the relation between DWTcoefficients and Human Visual System (HVS) isresearched intensively to get better compressionperformance. Recently this knowledge is applied tothe watermarking algorithms based on DWT domain.The watermarking algorithm to analyze is adaptive tothe image characteristics, such as texture andluminance contents, and it is realized using pixel bypixel masking in DWT domain to embed watermarkwith maximum energy.The detection process consists of cross-correlationbetween marked image and pseudorandom sequences,and in this process the original image is not required.The computer simulation results show robustness andperceptual invisibility of the algorithm.
Performance of Bluetooth bridges in scatternets with limited service scheduling
Authors: Vojislav B. Mišic´, Jelena Mišic´
Venue: Mobile Networks and Applications (2004)

The performance of two Bluetooth piconets linked through a bridge device is analyzed using the tools of queueing theory. We analyze both possible cases, i.e., when the bridge device is the master in one of the piconets and a slave in the other (MS bridge), as well as when the bridge device is the slave in both of the piconets (SS bridge). Analytical results are derived for the probability distribution of access delay (i.e., the time that a packet has to wait before being serviced) and end-to-end delay, for both intra- and inter-piconet bursty traffic. The scatternet with an SS bridge was found to provide lower end-to-end delay for local traffic as well as lower access delay, while the scatternet with an MS bridge offers lower end-to-end delay for non-local traffic. The scatternet with an SS bridge was also found to be less sensitive to increased probability of non-local traffic and low values of time interval between bridge exchanges, than its counterpart with an MS bridge. All analytical results have been confirmed through simulations.
Bluetooth dynamic scheduling and interference mitigation
Authors: N. Golmie
Venue: Mobile Networks and Applications (2004)

Bluetooth is a cable replacement technology for Wireless Personal Area Networks. It is designed to support a wide variety of applications such as voice, streamed audio and video, web browsing, printing, and file sharing, each imposing a number of quality of service constraints including packet loss, latency, delay variation, and throughput. In addition to QOS support, another challenge for Bluetooth stems from having to share the 2.4 GHz ISM band with other wireless devices such as IEEE 802.11. The main goal of this paper is to investigate the use of a dynamic scheduling algorithm that guarantees QoS while reducing the impact of interference. We propose a mapping between some common QoS parameters such as latency and bit rate and the parameters used in the algorithm. We study the algorithm's performance and obtain simulation results for selected scenarios and configurations of interest.
Persistent triangulations
Authors: Guy Blelloch, Hal Burch, Karl Crary, Robert Harper, Gary Miller, Noel Walkington
Venue: Journal of Functional Programming (2001)

Triangulations of a surface are of fundamental importance in computational geometry, computer graphics, and engineering and scientific simulations. Triangulations are ordinarily represented as mutable graph structures for which both adding and traversing edges take constant time per operation. These representations of triangulations make it difficult to support persistence, including &lsquo;multiple futures&rsquo;, the ability to use a data structure in several unrelated ways in a given computation; &lsquo;time travel&rsquo;, the ability to move freely among versions of a data structure; or parallel computation, the ability to operate concurrently on a data structure without interference. We present a purely functional interface and representation of triangulated surfaces, and more generally of simplicial complexes in higher dimensions. In addition to being persistent in the strongest sense, the interface more closely matches the mathematical definition of triangulations (simplicial complexes) than do interfaces based on mutable representations. The representation, however, comes at the cost of requiring O(lg n) time for traversing or adding triangles (simplices), where n is the number of triangles in the surface. We show both analytically and experimentally that for certain important cases, this extra cost does not seriously affect end-to-end running time. Analytically, we present a new randomized algorithm for 3-dimensional Convex Hull based on our representations for which the running time matches the &Omega;(n lg n) lower-bound for the problem. This is achieved by using only O(n) traversals of the surface. Experimentally, we present results for both an implementation of the 3-dimensional Convex Hull and for a terrain modeling algorithm, which demonstrate that, although there is some cost to persistence, it seems to be a small constant factor.
Instruction-Based Delay Fault Self-Testing of Processor Cores
Authors: Virendra Singh, Michiko Inoue, Kewal K. Saluja, Hideo Fujiwara
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper proposes an efficient methodology of delayfault testing of processor cores using its instruction set.These test vectors can be applied in the functional mode ofoperation, hence, self-testing of processor core becomespossible. Path delay fault model is used. The proposedapproach uses a graph theoretic model (represented as anInstruction Execution Graph) of the datapath and a finitestate machine model of the controller for the elimination offunctionally untestable paths at the early stage withoutlooking into the circuit details and extraction of constraintsfor the paths that can potentially be tested. Parwanprocessor is used to demonstrate the effectiveness of ourmethod.
Error Analysis of Pure Rotation-Based Self-Calibration
Authors: Lei Wang, Sing Bing Kang, Heung-Yeung Shum, Guangyou Xu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2004)

Abstract--Self-calibration using pure rotation is a well-known technique and has been shown to be a reliable means for recovering intrinsic camera parameters. However, in practice, it is virtually impossible to ensure that the camera motion for this type of self-calibration is a pure rotation. In this paper, we present an error analysis of recovered intrinsic camera parameters due to the presence of translation. We derived closed-form error expressions for a single pair of images with nondegenerate motion; for multiple rotations for which there are no closed-form solutions, analysis was done through repeated experiments. Among others, we show that translation-independent solutions do exist under certain practical conditions. Our analysis can be used to help choose the least error-prone approach (if multiple approaches exist) for a given set of conditions.
On the Ranks and Kernels Problem for Perfect Codes
Authors: S. V. Avgustinovich, F. I. Solov'eva, O. Heden
Venue: Problems of Information Transmission (2003)

A construction is proposed which, for n large enough, allows one to build perfect binary codes of length n and rank r, with kernel of dimension k, for any admissible pair (r, k) within the limits of known bounds.
MFSAT: A SAT Solver Using Multi-Flip Local Search
Authors: Amol Dattatraya Mali, Yevgeny Lipen
Venue: Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence (2003)

Local search-based methods of SAT solving have received a significant attention in the last decade. All local search-based methods choose the next truth assignment by flipping the value of only one variable. Simultaneously flipping values of multiple variables on an iteration can allow a local search-based solver to take long leaps in the search space. We report on SAT solver MFSAT, which has nine local search-based procedures. One of them is similar to conventional procedures which flip the value of one variable on an iteration. Other eight procedures are capable of simultaneously flipping values of multiple variables on an iterationto generate the successor truth assignment. We call these procedures "multi-flip" procedures. We report on the empirical evaluation of the nine procedures on more than 2700 benchmark SAT problems. Our results show that multi-flip procedures solve many more problems than the uni-flip procedure. Several multi-flip procedures solve problems many times faster than the uni-flip procedure.
Some implementation challenges of knowledge management systems: a CRM case study
Authors: Bendik Bygstad
Venue: Knowledge management: current issues and challenges (2003)

The promise of knowledge management systems is challenged by implementation problems. This CRM case illustrates that technology-driven approaches are not likely to succeed. It also indicates some limitations of top-down managerial interventions, arguing that we need a deeper understanding of learning processes to be able to implement KM systems successfully. A more experimental implementation strategy is suggested.
Neural networks application for induction motor faults diagnosis
Authors: Czeslaw T. Kowalski, Teresa Orlowska-Kowalska
Venue: Mathematics and Computers in Simulation (2003)

The paper deals with diagnosis problems of the induction motors in the case of rotor, stator and rolling bearing faults. Two kinds of neural networks (NN) were proposed for diagnostic purposes: multilayer perceptron networks and self organizing Kohonen networks. Neural networks were trained and tested using measurement data of stator current and mechanical vibration spectra. The efficiency of developed neural detectors was evaluated. Feedforward NN with very simple internal structure, used for the detection of all fault kinds, gave satisfactory results, which is very important in practical realization. Experiments with Kohonen networks indicated that they could be used for the initial classification of motor faults, as an introductory step before the proper neural detector based on multiplayer perceptron is used. The obtained results lead to a conclusion that neural detectors for rotor and stator faults as well as for rolling bearings and supply asymmetry faults can be developed based on measurement data acquired on-line in the drive system.