ppxscal/embedding_network huggingface dataset:
Electrodynamics of a Rotating Body: Relativistic Theory of Circular and Axial Birefringence
Authors: M. W. Evans
Venue:  (1990)

The theory of the electrodynamics of a rotating body is used to show that there exists: 1) circular birefringence of purely relativistic origin, composed of dispersive aether drag and residual, ensemble averaged, magnetisation; 2) non-relativistic circular birefringence due to the angular velocity of the body in the observer frame; 3) non-relativistic axial birefringence in chiral media due to the angular velocity of the body; 4) second order, relativistic equivalents of 2).
Basic study for local short-range weather forecast system with GPS
Authors: S. Tanaka, H. Furuta, M. Hirokane, T. Takada, T. Sada, K. Uchino
Venue: Proceedings of the sixth international conference on Application of artificial intelligence to civil & structural engineering (2001)

The GPS is used in surveying recently. The results of GPS surveying contain errors due to the delay of GPS radio waves caused by vapor in the atmosphere. Developed in this study is a system which forecasts local weather by making use of GPS data under the influence of the vapor. The neural network technology was used to relate GPS data to weather conditions. In a preliminary experiment, the simulation of weather forecasting was carried out to select GPS data items to be used in the main experiment. A pilot system was constructed on the GPS data items of the preliminary experiment. The pilot system forecast sunny and rainy weathers correctly. Then the main experiment was carried out, the results of the preliminary one taken into account. In the main experiment, meteorological factors in addition to GPS data were used to construct a forecasting system, which forecast all weathers correctly except a mixture of sunny and cloudy weathers.
Fault Analysis of the Multiple Valued Logic Using Spectral Method
Authors: Jong O. Kim, Parag Lala, Young Gun Kim, Heung Soo Kim
Venue: Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic (2000)

A method for detecting faults in Multiple Valued Logic (MVL) is proposed. The method depends on analyzing the spectral coefficients that are transformed from the Chrestenson spectral domain. The fault detecting conditions are derived for a single input stuck-at fault, multiple inputs s-a-f, a s-a-f at internal lines, and Min/Max bridging fault of the MVL. Fault detection is done based on the number of coefficients affected by a fault, and hence it is independent of the technology used for construction of networks and the types of fault. This method allows detection of the fault without the test vector, and minimizes the memory size for storing test vectors and response data.
Overlapping Schwarz methods for elasticity and Stokes problems
Authors: Luca F. Pavarino
Venue:  (1997)

We introduce and study a class of overlapping domain decomposition preconditioners for saddle point problems with a penalty term, such as Stokes problems and the mixed formulations of the linear elasticity system. Finite element and finite difference discretizations of these problems produce large symmetric indefinite linear systems. We solve these indefinite systems by using an appropriate accelerator, such as GMRES, with an indefinite preconditioner obtained by overlapping Schwarz techniques. This preconditioner is based on the solution of local saddle point problems on overlapping subdomains and the solution of a coarse saddle point problem. As in the positive definite case, our method is parallelizable, scalable and has a simple coarse problem. The numerical experiments reported in the last section indicate that the rate of convergence of the preconditioned operator is independent of the mesh size $h$, the number of subdomains $N$ and the penalty parameter. We also show experimentally that the classical conjugate gradient method, generally divergent for such indefinite problems, can converge when preconditioned with the overlapping Schwarz preconditioner. EMAIL:: ian@microian.pv.cnr.it
Multiple-Valued Logic-in-Memory VLSI Based on Ferroelectric Capacitor Storage and Charge Addition
Authors: Hiromitsu Kimura, Takahiro Hanyu, Michitaka Kameyama
Venue: Proceedings of the 32nd International Symposium on Multiple-Valued Logic (2002)

A multiple-valued logic-in-memory VLSI using ferroelectric capacitors isproposed to realize an arithmetic-oriented VLSI with real-timeprogrammable capacitor storage. The use of a remnant-polarization chargeon a ferroelectric capacitor makes it possible to perform not only areal-time programmable storage function, but also a linear-sum function,thereby resulting in a compact hardware while maintaining a high-speedprocessing capability. As a design example, a full adder with a storagecapability is evaluated. Its performance is superior to that of acorresponding binary CMOS implementation.
Load Profiling in Distributed Real-Time Systems
Authors: Azer Bestavros
Venue:  (1996)

Abstract Load balancing is often used to ensure that nodes in a distributed systems are equally loaded. In this paper, we show that for real-time systems, load balancing is not desirable. In particular, we propose a new load-profiling strategy that allows the nodes of a distributed system to be unequally loaded. Using load profiling, the system attempts to distribute the load amongst its nodes so as to maximize the chances of finding a node that would satisfy the computational needs of incoming real-time tasks. To that end, we describe and evaluate a distributed load-profiling protocol for dynamically scheduling time-constrained tasks in a loosely-coupled distributed environment. When a task is submitted to a node, the scheduling software tries to schedule the task locally so as to meet its deadline. If that is not feasible, it tries to locate another node where this could be done with a high probability of success, while attempting to maintain an overall load profile for the system. Nodes in the system inform each other about their state using a combination of multicasting and gossiping. The performance of the proposed protocol is evaluated via simulation, and is contrasted to other dynamic scheduling protocols for real-time distributed systems. Based on our findings, we argue that keeping a diverse availability profile and using passive bidding (through gossiping) are both advantageous to distributed scheduling for real-time systems.
Multi-Node Multicast in Three and Higher Dimensional Wormhole Tori and Meshes with Load Balance
Authors: Ming-Hour Yang, Yu-Chee Tseng, Ming-Shian Jian, Chao Lin
Venue: Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing (2000)

This paper considers the multi-node multicast problem in a multi-dimensional wormhole-routed torus/mesh, where there are an arbitrary number of source nodes each intending to multicast a message to an arbitrary set of destinations. This problem requires a large amount of bandwidth, and thus typically incurs heavy contention and congestion. Evenly balancing the traffic load around the network is a critic al issue to achieve good performance. We show how to use a network-partitioning approach to achieve this goal. Simulation results show significant improvement over existing results in 3D tori and meshes. This work is an extension of our earlier work [12] from 2D tori/meshes to higher dimensional ones.
CONVECTION EFFECTS ON RADIAL SEGREGATION AND CRYSTAL MELT INTERFACE IN VERTICAL BRIDGMAN GROWTH
Authors: S. Tanveer
Venue:  (1993)

We analytically study the influence of convection caused by horizontal heat transfer through the sides of a vertical Bridgman apparatus. We consider the case when the heat transfer across the side walls is small so that the resulting interfacial deformation and fluid velocities are also small. This allows us to linearize the Navier-Stokes equations and express the interfacial conditions about a planar interface through a Taylor expansion. Using a no tangential stress conditions on the side walls, asymptotic expressions for both the interfacial slope and radial segregation at the crystal-melt interface are obtained in closed form in the limit of large thermal Rayleigh number. It is suggested that these can be reduced by appropriately controlling a specific heat transfer property at the edge of the insulation zone in the solid side. 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
Cliche Programming in PROLOG
Authors: Dave Barker-Plummer
Venue:  (1989)

In this paper I describe an extension to the PROLOG language which allows programmers to define procedures by analogy with existing generalized procedures, called {\em cliches}. This method of programming allows programmers to write commonly occurring program forms just once, but to reuse them in a variety of ways as they wish. One advantage of programming in this manner is that the cliches have properties that are guaranteed to be inherited by their instantiations. I discuss the logical basis for cliche programming, and relate it to previously described work on the implicit definition of logic programs. Finally I describe issues in the implementation of the cliche programming system. A version of the system has been implemented in Quintus PROLOG and is being used as part of the programming environment that I use to develop programs.
Double Sylvester sums for subresultants and multi-Schur functions
Authors: Alain Lascoux, Piotr Pragacz
Venue: Journal of Symbolic Computation (2003)

Sylvester has announced formulas expressing the subresultants (or the successive polynomial remainders for the Euclidean division) of two polynomials, in terms of some double sums over the roots of the two polynomials. We prove Sylvester formulas using the techniques of multivariate polynomials involving multi-Schur functions and divided differences.
Puzzling with microcode
Authors: Jeremy Jones
Venue: ACM SIGARCH Computer Architecture News (1983)

A Pascal version of the puzzle program was executed on a user-microprogrammable HLL machine and a "runtime profile" obtained. The code sections where most of the execution time was spent were found and replaced with microcode. A six fold increase in execution speed was achieved by writing 25 microinstructions.
On-Line Load Balancing of Temporary Tasks on Identical Machines
Authors: Yossi Azar, Leah Epstein
Venue: Proceedings of the Fifth Israel Symposium on the Theory of Computing Systems (ISTCS '97) (1997)

We prove an exact lower bound of 2-1/m on the competitive ratio of any deterministic algorithm for load balancing of temporary tasks on m identical machines. We also show a lower bound of 2-1/m for randomized algorithms for small m and 2-2/(m+1) for general m. If in addition, we restrict the sequence to polynomial length, then the lower bound for randomized algorithms becomes 2-O((log log m)/(log m)) for general m.
Microsoft .NET: Jumpstart for Systems Administrators and Developers
Authors: Nigel Stanley
Venue:  (2003)

:Microsoft .NET is born out of a personal search for the Holy Grail of .NET for IT professionals. Unlike competing texts, it focuses on actual implementation and management issues critical to the success of an enterprise. Through Nigel Stanley's active consulting practice, he has gathered essential information for integrating the far-ranging components which .NET touches without hype or superfluous programming details. Microsoft .NET revolutionizes the development, deployment and support of business applications. It introduces new technologies and concepts which have to be understood by today's IT professionals if they are to continue to be successful.
Maintaining Maintainability
Authors: M. Ramage, K. Bennett
Venue: Proceedings of the International Conference on Software Maintenance (1998)

Conventionally, maintainability is seen as an attribute of software; measures which aim to quantify maintainability are all expressed in terms of attributes of the source code or related documentation. Such metrics do not correspond with intuition, and fail in important ways; for example they are not used by industry in assessing lifecycle costs. Maintainability is related to the skills of the maintenance team, the tools available, the maturity of the process and so on. We propose a new model, which takes a systemic view of the maintenance process and organisation as well as the software. The changing relationships between components of the model are identified as key properties for assessing maintainability. We suggest empirical approaches which could use the model to quantify maintainability. We hope the model could be used for assessing the effect of evolution, not only in the software, but in its environment.
Simulating User''s Preferences: Towards Automated Artificial Evolution for Computer Generated Images
Authors: Shumeet Baluja, Dean Pomerleau, Todd Jochem
Venue:  (1993)

In 1991, Karl Sims presented work on artificial evolution in which he used genetic algorithms to evolve complex structures for use in computer generated images and animations. The evolution of the computer generated images progressed from simple, randomly generated shapes to interesting images which the users interactively created. The evolution advanced under the constant guidance and supervision of the user. This paper describes attempts to automate the process of image evolution through the use of artificial neural networks. The central objective of this study is to learn the user''s preferences, and to apply this knowledge to evolve aesthetically pleasing images which are similar to those evolved through interactive sessions with the user. This paper presents a detailed analysis of both the shortcomings and successes encountered in the use of five artificial neural network architectures. Further possibilities for improving the performance of a fully automated system are also discussed.
How to Stop a Cheater: Secret Sharing with Dishonest Participation
Authors: Erik W. Selberg
Venue:  (2001)

Excellence in Undergraduate Research. Keywords: Cryptography, secret sharing, distributed security, simultaneously exchange, zero-exchange proof 16 pages [FTP: CMU-CS-93-182.ps] At times it is necessary to obtain a group decision from a number of different nodes over a large network. Secret sharing protocols allow a quorum q of a group of n people to arrive at decisions by having the quorum recompute a predetermined secret, such as an access code, while preventing less that q people from gaining any information about the secret. However, current protocols are vulnerable when participants cheat, for example by giving false information to other participants. In this work, I present a powerful new protocol which detects cheaters immediately and halts the exchange before any more information is revealed. In addition, it prevents cheaters from gaining any information without revealing an equal amount of their own. This protocol will present new paradigms in a variety of applications, such as electronic balloting and secure file system fault tolerance.
Using Knowledge-Based System with Hierarchical Architecture to Guide the Search of Evolutionary Computation
Authors: Xidong Jin, Robert G. Reynolds
Venue: Proceedings of the 11th IEEE International Conference on Tools with Artificial Intelligence (1999)

Regional knowledge is determined by function's fitness landscape patterns, such as basins, valleys and multi-modality. Furthermore, for constrained optimization problems, the knowledge of feasible/infeasible regions can also be regards as regional knowledge. Therefore, it will be very helpful if there exists a general tool to allow for the representation of regional knowledge, which can be acquired from evolutionary search and then be in reverse applied to guide the search. In this paper, we define region-based schemata, implemented as belief-cells, which can provide an explicit mechanism to support the acquisition, storage and manipulation of regional knowledge of a function landscape. In a Cultural Algorithm framework, the belief space can "contain" a set of these schemata, which can be arranged in a hierarchical architecture, and can be used to guide the search of the evolving population. I.e. region-based schemata can be used to guide the optimization search in a direct way by pruning the infeasible regions and promoting the promising regions. The experiments for an engineering problem with nonlinear constraints indicate the potential behind this approach.
A performance study of multiple access control protocols for wireless multimedia services
Authors: Yu-Kwong Kwok, V. K. N. Lau
Venue: Proceedings of the 2000 International Conference on Network Protocols (2000)

The multiple access control (MAC) problem in a wireless network has intrigued researchers for years. For a broadband wireless multimedia network such as wireless ATM, an effective MAC protocol is very much desired because efficient allocation of channel bandwidth is imperative in accommodating a large user population with satisfactory quality of service. Indeed, MAC protocols for a wireless ATM network, in which user traffic requirements are highly heterogeneous (classified into CBR, VBR, and ABR), are even more intricate to design. Considerable research efforts expended in tackling the problem have resulted in a myriad of MAC protocols. While each protocol is individually shown to be effective by the respective designers, it is unclear how these different protocols compare against each other on a unified basis. We quantitatively compare seven previously proposed TDMA-based MAC protocols for integrated wireless data and voice services. We first propose a taxonomy of TDMA-based protocols, from which we carefully select seven protocols, namely SCAMA, DTDMA/VR, DTDMA/PR, D4RUMA, DPRMA, DSA++, and PRMA/DA, such that they are devised based on rather orthogonal design philosophies. The objective of our comparison is to highlight the merits and demerits of different protocol designs.
Global Optimization of Multiplicative Programs
Authors: Hong-Seo Ryoo, Nikolaos V. Sahinidis
Venue: Journal of Global Optimization (2003)

This paper develops global optimization algorithms for linear multiplicative and generalized linear multiplicative programs based upon the lower bounding procedure of Ryoo and Sahinidis [30] and new greedy branching schemes that are applicable in the context of any rectangular branch-and-bound algorithm. Extensive computational results are presented on a wide range of problems from the literature, including quadratic and bilinear programs, and randomly generated large-scale multiplicative programs. It is shown that our algorithms make possible for the first time the solution of large and complex multiplicative programs to global optimality.
Addison-Wesley's Review for the Computer Science AP Exam in Java
Authors: Susan Horwitz
Venue:  (2003)

:This book provides the Java review, sample tests, and test-taking hints needed to help high-school students prepare for the AP Exam in Computer Science. Four comprehensive sample exams-just like the ones students take on exam day. Review of all the core Java topics needed to know to ace the exam. An extensive glossary that provides quick and easy reference of Java and general computer science terms. A multitude of test-taking hints that will focus readers on the important aspects of the questions so they can quickly move through the exam Students who are preparing to take the AP Computer Science exam.
XML in the visualisation pipeline
Authors: Warwick Irwin, Neville Churcher
Venue: Proceedings of the Pan-Sydney area workshop on Visual information processing - Volume 11 (2001)

The extensible markup language (XML) has been applied successfully in a wide range of application domains and is beginning to find applications in visualisation. We explore the possibility that, rather than simply being used as an exchange format, XML might become a fundamental medium in an extended visualisation pipeline. We present examples from our software visualisation research to illustrate that increased rigour, as well as flexibility, can be delivered by integrating XML into the visualisation pipeline.
Pre-computatio of Rotatio Bits in Unidirectional CORDIC for Trigonometric and Hyperbolic Computations
Authors: Satish Ravichandran, Vijayan Asari
Venue: Proceedings of the IEEE Computer Society Annual Symposium on VLSI (ISVLSI'03) (2003)

A novel technique for the pre-computation of rotationbits for unidirectional CORDIC is proposed in thispaper. The unidirectional CORDIC algorithms differsfrom the conventional CORDIC in the degree of rotation.A new technique is developed to pre-compute therotation bits from any given angle. The hardware designVLSI circuit is implemented in a FPGA using AlteraQuartus II VHDL. Experimental results obtained withcomputations of trigonometric and hyperbolic functionssing the pre-computed bits show the accuracy results inthe order of ~10-8 .
Robustness against separation and outliers in logistic regression
Authors: Peter J. Rousseeuw, Andreas Christmann
Venue: Computational Statistics Data Analysis (2003)

The logistic regression model is commonly used to describe the effect of one or several explanatory variables on a binary response variable. It suffers from the problem that its parameters are not identifiable when there is separation in the space of the explanatory variables. In that case, existing fitting techniques fail to converge or give the wrong answer. To remedy this, a slightly more general model is proposed under which the observed response is strongly related but not equal to the unobservable true response. This model will be called the hidden logistic regression model because the unobservable true responses are comparable to a hidden layer in a feedforward neural net. The maximum estimated likelihood estimator is proposed in this model. It is robust against separation, always exists, and is easy to compute. Outlier-robust estimation is also studied in this setting, yielding the weighted maximum estimated likelihood estimator.
Designing active objects in DEGAS
Authors: Johan F.P. Akker, Arno P.J.M. Siebes
Venue:  (1997)

This report discusses application design for active databases, in particular for the active object-based database programming language DEGAS. In DEGAS one modularisation principle, the object, is applied to all elements of the application, including rules. We discuss a design process consisting of four phases, corresponding with the four kinds of capabilities in a DEGAS object, attributes, methods, rules, lifecycles. The elements of this design process are similar to those found in a design methodology such as OMT. To illustrate the design process we use the example of workflow management. In addition, it shows that the application of one modularisation to all elements of an active database leads to a clear modularisation of the workflow application, Furthermore, this modularisation facilitates all important workflow evolutions.