ppxscal/embedding_network huggingface dataset:
What You Always Wanted to Know About Datalog (And Never Dared to Ask)
Authors: S. Ceri, G. Gottlob, L. Tanca
Venue: IEEE Transactions on Knowledge and Data Engineering (1989)

Datalog, a database query language based on the logic programming paradigm, is described. The syntax and semantics of Datalog and its use for querying a relational database are presented. Optimization methods for achieving efficient evaluations of Datalog queries are classified, and the most relevant methods are presented. Various improvements of Datalog currently under study are discussed, and what is still needed in order to extend Datalog's applicability to the solution of real-life problems is indicated.
FlexWare: A Retargetable Embedded-Software Development Environment
Authors: Pierre G. Paulin, Miguel Santana
Venue: IEEE Design Test (2002)

Complex systemson chips (SoCs) use embedded processors to deliver a combination of flexibility and competitive cost, power, and performance. Embedded processors that use reduced-instruction-set computers (RISCs) are the most common, but they do not offer any particular competitive advantage, because all companies have access to the same general-purpose embedded processor. Traditionally, special-purpose hardware (digital or analog) is necessary to gain a competitive advantage in performance,cost, or power. An increasingly popular alternative is the application-specific instruction-set processor (ASIP), which combines the flexibility of general-purpose processors with an optimized application-or domain-specific architecture thatcan significantly improve performance. Using a more effective architecture helps reduce voltage and save power.
Trends in Shared Memory Multiprocessing
Authors: Per Stenström, Erik Hagersten, David J. Lilja, Margaret Martonosi, Madan Venugopal
Venue: Computer (1997)

Shared memory multiprocessing is recognized by industry as a key technology for domains such as decision support systems and multimedia processing. Like uniprocessors, shared memory multiprocessors are often built from high-performance microprocessors, so there is a clear transition path from uniprocessor to multiprocessor program implementations. The challenge lies in making this transition as smooth as possible, both in performance and the programming required to achieve it. The first step is to examine the current use of shared memory multiprocessing and arrive at intelligent projections of future use. The second step is to begin filling gaps in programming models and architectures for shared memory multiprocessing. The third step-possibly taken concurrently with the second-is to make the development of parallel software more feasible. Perhaps the greatest challenge is to develop new techniques in the face of a moving hardware target. The community must somehow improve the software and keep pace with constant increases in integration level, on-chip parallelism, and memory hierarchy complexity.
Image Processing Techniques for Wafer Defect Cluster Identification
Authors: Chenn-Jung Huang, Chua-Chin Wang, Chi-Feng Wu
Venue: IEEE Design Test (2002)

An automatic, wafer-scale, defect cluster identifier finds and marks all defective dies, further automating wafer testing. A prototype tool screens 45,000 wafers, saving a Philips Semiconductor test facility $100,000 in expenses per month.
Energy Advantages of Microprocessor Platforms with On-Chip Configurable Logic
Authors: Greg Stitt, Frank Vahid
Venue: IEEE Design Test (2002)

System chips that incorporate configurable logic can reduce the energy consumed in executingsoftware. The key is to use the configurable logic to execute performance-critical loops, producing an average energy savings of 25% to 71% for embedded-system benchmarks.
Analytic Models of Adaptive Load Sharing Schemes in Distributed Real-Time Systems
Authors: K. G. Shin, C. J. Hou
Venue: IEEE Transactions on Parallel and Distributed Systems (1993)

In a distributed real-time system, nonuniform task arrivals may temporarily overload some nodes while leaving some other nodes idle. As a result, some of the tasks on anoverloaded node may miss their deadlines even if the overall system has the capacity tomeet the deadlines of all tasks. A decentralized, dynamic load sharing (LS) scheme hasbeen proposed as a solution to this problem. Analytic queuing models to comparativelyevaluate this LS scheme as well as three other schemes-no LS, LS with random selectionof a receiver node, and LS with perfect information- are developed. The evolution of anode's load state is modeled as a continuous-time semi-Markov process, wherecumulative execution time (CET), rather than the commonly-used queue length (QL), isemployed to describe the workload of a node. The proposed scheme is compared againstother LS schemes. The validity of analytic models is checked with simulations. Bothanalytic and simulation results indicate that by using judicious exchange/use of stateinformation and Bayesian decision mechanism, the proposed scheme makes a significantimprovement over other existing LS schemes in minimizing the probability of dynamicfailure.
Fast, Portable Application Mirroring
Authors: T. Ming Jiang, Lakshmanan Sankaran
Venue: IEEE Software (1995)

Application enhancement refers to a software process to increase the value of an application without modifying its code. A typical example is adding the graphical user interface to a character-oriented application. Although the value of such an application is increased (more user friendly), its basic functionality doesn't change. This paper presents a new dimension of enhancement called the Mirror Enhancement. Mirror enhancement allows an application running on one workstation to have its mirror copy shown on another workstation. Any changes to the application at one workstation are reflected to the other immediately. With this enhancement an ordinary drawing program becomes a powerful teleconferencing tool for groupware development. A single user computer game becomes multi-user entertainment with the mirror enhancement.
Hardware Efficient Algorithms for Trigonometric Functions
Authors: R. E. Fowkes
Venue: IEEE Transactions on Computers (1993)

A new algorithm is presented which significantly reduces the minimum amount of logic required to calculate sine, cosine, and square root. It is derived from an old method for computing certain inverse functions which was once considered for use in software, but then abandoned because of efficiency concerns. However, when reversed and combined with a restoring square root algorithm, a unique new design emerges which performs trigonometric calculations without the use of pre-stored constants or any internal operation more complex than binary subtraction. The design has been implemented with common TTL MSI logic and is found to be reasonably fast, very accurate, and to require considerably less hardware than a comparable CORDIC algorithm.
Test and Testability of a Monolithic MEMS for Magnetic Field Sensing
Authors: V. Beroulle, Y. Bertrand, L. Latorre, P. Nouet
Venue: Journal of Electronic Testing: Theory and Applications (2001)

This paper addresses MEMS testing through a case study: a micromachined magnetic field sensor with on-chip electronics. The sensor element is based on a cantilever beam that is deflected by means of the Lorentz force. Embedded piezoresistors are used to detect strain in the cantilever beam and thus to detect the magnetic field. A test approach is presented for the whole system focussing on fault classification, on design for testability and on production test costs. Fault classification introduces several catastrophic and parametric faults on both mechanical and electrical elements. Simple and low-cost design for testability such as test point insertion is then discussed for test cost reduction and for fault coverage enhancement.
Topology alteration for virtual sculpting using spatial deformation
Authors: B. Steyn, J. E. Gain
Venue: Proceedings of the 2nd international conference on Computer graphics, virtual Reality, visualisation and interaction in Africa (2003)

Virtual sculpting enables the creation of computer models by emulating traditional sculpting. It can be implemented using spatial deformation, an interactive versatile modelling technique. Unfortunately, spatial deformation is limited to topology preserving warping. This is overcome by space-time objects, a variant of spatial deformation, which alters topology by extruding an object into 4-D, deforming the 4-D object and extracting a topologically altered object. However, they are specifically targeted to animation. In this paper, we adapt space-time objects to interactive modelling by: employing a tetrahedral rather than parallelepiped representation; exploiting coherence during the constant projection into four dimensions; and limiting projection to the portions of an object undergoing topology changes and thereby producing simpler triangulations of undeformed regions. Each of these adaptations is discussed in the context of the space-time object stages: extrusion, deformation and extraction. We also present preliminary results demonstrating the efficiency of our improvements.
GaAs field effect transistors fabricated by imprint lithography
Authors: I. Martini, J. Dechow, M. Kamp, A. Forchel, J. Koeth
Venue: Microelectronic Engineering (2002)

A GaAs metal-semiconductor field-effect transistor (MESFET) has been realized based on mix-and-match fabrication using optical lithography for the ohmic contacts and imprint lithography for the gate. The gate length and width are 1.2 and 80 µm, respectively, the channel length is 4 µm. For the gate definition a Si-mold is embossed into a thin polymer film located on top of an n-doped GaAs layer. The gate is fabricated by metal evaporation and lift-off.
Universal Analytical Forms for Modeling Image Probabilities
Authors: Anuj Srivastava, Xiuwen Liu, Ulf Grenander
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2002)

Seeking probability models for images, we employ a spectral approach where the images are decomposed using bandpass filters and probability models are imposed on the filter outputs (also called spectral components). We employ a (two-parameter) family of probability densities, introduced in [11] and called Bessel K forms, for modeling the marginal densities of the spectral components, and demonstrate their fit to the observed histograms for video, infrared, and range images. Motivated by object-based models for image analysis, a relationship between the Bessel parameters and the imaged objects is established. Using \big. L^2\hbox{-}{\rm{metric}}\bigr. on the set of Bessel K forms, we propose a pseudometric on the image space for quantifying image similarities/differences. Some applications, including clutter classification and pruning of hypotheses for target recognition, are presented.
Buying Travel Services on the Internet
Authors: Durant Imboden
Venue:  (1999)

:The world's leading e-commerce association shows how to find the best travel deals online. Looking for rock-bottom prices on airline tickets and car rentals? In search of the perfect hotel or resort? Checking out cruises? Doing research on business desitnations,family vacations,orromantic getaways? Travel already draws more people to the Internet than any other topic - and online travel revenues will reach an astounding $12 billion by 2002,according to The Industry Standard,which tracks Net economy. It all adds up to a huge built-in audience for this taime-saving guide. Like a well-connected travel agent,it takes netsurfing travelers straight to the best deals. Special features include: Guided tours of key sites like Travelocity and City. net; Tips on using Priceline and similar "name your price" services; Advice on comparison-shopping and bargaining; Questions to ask and scams to avoid. Where do you want to go today? Fly direct to the best travel information on the Web! Did you know that travel is the most sought-for topic on the world wide web? With good reason. Wherever you want to go,whatever you want to know,it's there somewhere on the Internet: the cheap fares,the hard-to-find information,the time-saving services. But how do you find what you need without wandering all across cyberspace? Start your trip here: Buying Travel Services on the Internet. Travel writer Durant Imboden and CommerceNet,the foremost nonprofit organization for e-commerce,have done the legwork for you. They sifted thousands of sitesthey even researched the search enginesto collect only the best into one definitive,unibiased guidebook that puts your destination justa click away! Whether you're heading for Machu Pichu or Missoula,on the road for business or pleasure,this URL-packed,globe-trotting,web-navigating guidebook is your best ticket to the most useful,money-saving,and interesting travel-related sites on the Internet. Get right to the sites that help you: comparison shop for airline and cruise bargains virtual-visit almost every spot on earthfrom Algarve to Zimbabwe; check into lodging,from 5-star hotels to eco-campgrounds; rent a car,track a rail route,book a berth on a freighter; map door-to-door travel directions; apply for a passport and visas; plan family vacations,gay/lesbian travel,adventures,and other special-interest trips; prepare with health and safety into,and weather forecasts; calculate currency conversions. 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 Specification of an Expert System
Authors: James S. Slagle, David A. Gardiner, Kyungsook Han
Venue: IEEE Expert: Intelligent Systems and Their Applications (1990)

It is proposed that knowledge specifications be used as bases for developing and maintaining expert systems. It is suggested that through knowledge acquisition, a knowledge specification representing the kinds of knowledge and reasoning processes used to perform a task can be produced. A prototype can then be built to test and improve the knowledge specification. When a stable and satisfactory specification is obtained, a production system for end users, based on the specification rather than on the prototype, can be implemented. The knowledge specification guides system changes during maintenance. An experimental study to assess and improve this methodology is reported. Prototyping is discussed, an expert system knowledge specification is presented, and a methodology for creating a knowledge specification using conceptual structures is described. The methodology is compared with a currently popular methodology for expert system development. The proposal is primarily intended for medium- to large-scale expert systems, which may have several developers and whose users will not be developing the systems.
An FPGA-Based Approach for Speeding-Up Fault Injection Campaigns on Safety-Critical Circuits
Authors: P. Civera, L. Macchiarulo, M. Rebaudengo, M. Sonza Reorda, M. Violante
Venue: Journal of Electronic Testing: Theory and Applications (2002)

In this paper we describe an FPGA-based approach to speed-up fault injection campaigns for the evaluation of the fault-tolerance of VLSI circuits. Suitable techniques are proposed, allowing emulating the effects of faults and observing faulty behavior. The proposed approach combines the efficiency of hardware-based techniques, and the flexibility of simulation-based techniques. Experimental results are provided showing that significant speed-up figures can be achieved with respect to state-of-the-art simulation-based fault injection techniques.
Supporting awareness of shared interests and experiences in community
Authors: Yasuyuki Sumi, Kenji Mase
Venue: ACM SIGGROUP Bulletin (2000)

In this paper, we propose a notion of facilitating encounters and knowledge sharing among people having shared interests and experiences in museums, conferences, etc. In order to show our approach and current status, this paper presents our project to build a communityware system situated in real-world contexts. The aims of the project are to build a tour guidance system personalized according to its user's individual contexts, and to facilitate knowledge communications among communities by matchmaking users having shared interests and providing real and/or virtual places for their meetings. In this paper, we first show PalmGuide, hand-held tour guidance system. After that, we show two systems to increase "community-awareness". One is Semantic Map, a visual interface for exploring community information, such as exhibits and people (exhibitors and visitors). Another is AgentSalon, a display showing conversations between personal agents according to their users' profiles and interests.
A 160 Mpixel/s IDCT Processor for HDTV
Authors: Peter A. Ruetz, Po Tong
Venue: IEEE Micro (1992)

The architecture and characteristics of a fully functional 40 MHz device that performs the 8*8 inverse discrete cosine transform (IDCT) for digital HDTV decoders are presented. The IDCT chip converts four 14-b DCT coefficients into four 11-b pixel values each cycle. Fixed-coefficient multiplier Wallace trees in which partial products are rounded before summation help compute the inner products. The 31000-gate device was implemented in a 10.5 mm die using 1 mu m CMOS array-based process.
On quasiabelian Cayley graphs and graphical doubly regular representations
Authors: Boris Zgrablić
Venue: Discrete Mathematics (2002)

A Cayley graph Γ of a group G is a graphical doubly regular representation (GDRR) of the group G if Aut Γ is generated by the left and the right regular representations L(G) and R(G) of G, and by the involution g ↦ g-1 on G. Examples and properties of GDRRs and their automorphism groups are studied. The problem of determining groups having a GDRR is considered, and some obstructions for a group to have a GDRR are found. Necessary and sufficient conditions for a graph to be a GDRR of two nonisomorphic groups are given. Further, disconnected GDRRs are determined, and imprimitive block systems of GDRRs are characterized.
A Study of the Dennis-Wolkowicz Method on Convex Functions
Authors: Guanghui Liu, Lixing Han
Venue: Computational Optimization and Applications (2001)

In this paper, we analyze the global convergence of the least-change secant method proposed by Dennis and Wolkowicz, when applied to convex objective functions. One of the most distinguished features of this method is that the Dennis-Wolkowicz update doesn't necessarily belong to the Broyden convex family and can be close to the DFP update, but it still has the self-correcting property. We prove that, for convex objective functions, this method with the commonly used Wolfe line search is globally convergent. We also provide some numerical results.
LEAP: An Accurate Defect-Free IDDQ Estimator
Authors: Antoni Ferré, Joan Figueras
Venue: Journal of Electronic Testing: Theory and Applications (2001)

The quiescent current (IDDQ) consumed by a CMOS IC is a good indicator of the presence of a large class of defects. However, the effectiveness of IDDQ testing requires appropriate discriminability of defective and defect-free currents, and hence it becomes necessary to estimate the currents involved in order to design the IDDQ test. In this work, we present a method to estimate accurately the non-defective IDDQ consumption based on a hierarchical approach at electrical (cell) and logic (circuit) levels. This accurate estimator is used in conjunction with an ATPG (Automatic Test Pattern Generation) to obtain vectors having low/high defect-free IDDQ currents.
SIGACT News Complexity Theory Column 10
Authors: Lane A. Hemaspaandra
Venue: ACM SIGACT News (1995)

We survey techniques and results obtained over the past thirty years for space-bounded probabilistic computation. We use a common framework for the study of both finite-state automata and logarithmic-space-bounded Turing machines. In particular, we present recent advances on space-efficient deterministic simulation of probabilistic automata.
Sequential combination methods for data clustering analysis
Authors: Qian Yuntao, Ching Y. Suen, Tang Yuanyan
Venue: Journal of Computer Science and Technology (2002)

This paper proposes the use of more than one clustering method to improve clustering performance. Clustering is an optimization procedure based on a specific clustering criterion. Clustering combination can be regarded as a technique that constructs and processes multiple clustering criteria. Since the global and local clustering criteria are complementary rather than competitive, combining these two types of clustering criteria may enhance the clustering performance. In our past work, a multi-objective programming based simultaneous clustering combination algorithm has been proposed, which incorporates multiple criteria into an objective function by a weighting method, and solves this problem with constrained nonlinear optimization programming. But this algorithm has high computational complexity. Here a sequential combination approach is investigated, which first uses the global criterion based clustering to produce an initial result, then uses the local criterion based information to improve the initial result with a probabilistic relaxation algorithm or linear additive model. Compared with the simultaneous combination method, sequential combination has low computational complexity. Results on some simulated data and standard test data are reported. It appears that clustering performance improvement can be achieved at low cost through sequential combination.
Weighted Constraint Aggregation in Fuzzy Optimization
Authors: U. Kaymak, J. M. Sousa
Venue: Constraints (2003)

Many practical optimization problems are characterized by some flexibility in the problem constraints, where this flexibility can be exploited for additional trade-off between improving the objective function and satisfying the constraints. Fuzzy sets have proven to be a suitable representation for modeling this type of soft constraints. Conventionally, the fuzzy optimization problem in such a setting is defined as the simultaneous satisfaction of the constraints and the goals. No additional distinction is assumed to exist amongst the constraints and the goals. This paper proposes an extension of this model for satisfying the problem constraints and the goals, where preference for different constraints and goals can be specified by the decision-maker. The difference in the preference for the constraints is represented by a set of associated weight factors, which influence the nature of trade-off between improving the optimization objectives and satisfying various constraints. Simultaneous weighted satisfaction of various criteria is modeled by using the recently proposed weighted extensions of (Archimedean) fuzzy t-norms. The weighted satisfaction of the problem constraints and goals are demonstrated by using a simple fuzzy linear programming problem. The framework, however, is more general, and it can also be applied to fuzzy mathematical programming problems and multi-objective fuzzy optimization.