ppxscal/embedding_network huggingface dataset:
Mircea Mihaescu Director, Technology and Innovation, CIO Office IBM
Authors: Mircea Mihaescu
Venue: Proceedings of the 11th IEEE International Enterprise Distributed Object Computing Conference (2007)

Mr. Mihaescu, Director, WebAhead Development and Security Innovations, has 25 years of experience in information technology systems. Mircea is responsible for the development and adoption of social networking technologies used by the IBM community.
New Literature
Venue: Computer (1979)

Line printers. A four-page brochure covering four 600-lpm to 1200-lpm horizontal moving-font line printers in the Chain-Train 1200 Series can be obtained from Data Printer Corp., 99 Middlesex St., Malden, MA 02148; (617) 321-2400. 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
Semantic Modeling for Deductive Question-Answering
Authors: K. Biss
Venue: IEEE Transactions on Computers (1976)

A description of techniques used for semantic modeling in a deductive question-answering system is given. The system maintains a dialog and is able to understand situations which can be expressed as a series of sequential time-frames. Specific relevant questions are asked by the system when it is unable to succeed in a given task. It can also provide reasons for its previous actions.
Model-Driven Software Development for Pervasive Information Systems Implementation
Authors: Jose Eduardo Fernandes, Ricardo J. Machado, Joao Alvaro Carvalho
Venue: Proceedings of the 6th International Conference on Quality of Information and Communications Technology (2007)

Model-driven development (MDD) conceptions and techniques essentially centre the focus of development on models. They are subject of current research as they allow enhanced productivity, technological platform independence and longevity of software artifacts. Another area of current research is the ubiquitous/pervasive computing area. This field of computing research focuses on the widespread adoption of embedded or mobile heterogeneous computing devices, which, when properly orchestrated, globally compose pervasive information systems (PIS). This work intends to clarify how should be MDD concepts and techniques structurally consolidated into an approach to software development for PIS. It involves two projects as case studies. From these case studies, it will be proposed methodological insights to design approaches for software development of PIS. While clarifying several issues pertaining to MDD for PIS, it shall promote other research works based on issues needing further study.
Lazy Error Detection for Microprocessor Functional Units
Authors: Mahmut Yilmaz, Albert Meixner, Sule Ozev, Daniel J. Sorin
Venue: Proceedings of the 22nd IEEE International Symposium on Defect and Fault-Tolerance in VLSI Systems (2007)

We propose and evaluate the use of lazy error detection for a superscalar, out-of-order microprocessor's functional units. The key insight is that error detection is off the critical path, because an instruction's results are speculative for at least a cycle after being computed. The time between computing and committing the results can be used to lazily detect errors, and laziness allows us to use cheaper error detection logic. We show that lazy error detection is feasible, we develop a low-cost mechanism for detecting errors in adders that exploits laziness, and we show that an existing error detection scheme for multipliers can exploit laziness.
Efficient IR-style keyword search over relational databases
Authors: Vagelis Hristidis, Luis Gravano, Yannis Papakonstantinou
Venue: Proceedings of the 29th international conference on Very large data bases - Volume 29 (2003)

Applications in which plain text coexists with structured data are pervasive. Commercial relational database management systems (RDBMSs) generally provide querying capabilities for text attributes that incorporate state-of-the-art information retrieval (IR) relevance ranking strategies, but this search functionality requires that queries specify the exact column or columns against which a given list of keywords is to be matched. This requirement can be cumbersome and inflexible from a user perspective: good answers to a keyword query might need to be "assembled" -in perhaps unforeseen ways- by joining tuples from multiple relations. This observation has motivated recent research on free-form keyword search over RDBMSs. In this paper, we adapt IR-style document-relevance ranking strategies to the problem of processing free-form keyword queries over RDBMSs. Our query model can handle queries with both AND and OR semantics, and exploits the sophisticated single-column text-search functionality often available in commercial RDBMSs. We develop query-processing strategies that build on a crucial characteristic of IR-style keyword search: only the few most relevant matches -according to some definition of "relevance"- are generally of interest. Consequently, rather than computing all matches for a keyword query, which leads to inefficient executions, our techniques focus on the top-k matches for the query, for moderate values of k. A thorough experimental evaluation over real data shows the performance advantages of our approach.
Separation of Duty in Role-Based Access Control Model through Fuzzy Relations
Authors: Hassan Takabi, Morteza Amini, Rasool Jalili
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

As a security principle, separation of duty (SoD) is widely considered in computer security. In the role-based access control(RBAC)model, separation of duty constraints enforce conflict of interest policies. There are two main types of separation of duty policies in RBAC, Static SoD (SSoD) and Dynamic SoD (DSoD). In RBAC, Statically-Mutually Exclusive Role (SMER) constraints are used to enforce Static Separation of Duty policies. Dynamic Separation of duty policies, like SSoD policies, are intended to limit the permissions that are available to a user. However, DSoD policies differ from SSoD policies by the context in which these limitations are imposed. A DSoD policy limits the availability of the permissions over a users permission space by placing constraints on the roles that can be activated within or across a users sessions. Like SMER, in RBAC Dynamically Mutually Exclusive Role (DMER) constraints are used to enforce DSoD policies. We investigated using of a fuzzy approach to address the issue in order to provide a more practical solution. In this paper, we propose a model to express the separation of duty policies in RBAC using the fuzzy set theory. The concept of trustworthiness, which is fuzzy in nature, is used to express this model. In comparison with non-fuzzy methods, our method is more pragmatic and more consistent with the real world. The expressiveness of our method is higher than the non-fuzzy ones. We show expression of some constraints in our method which cannot be expressed by non-fuzzy methods. Applicability of the method is shown through an example of the real world.
Advanced Querying Architecture for DICOM Systems
Authors: Rui Agostinho, Manuela Pereira, Mario Freire
Venue: Proceedings of the Second International Conference on Systems and Networks Communications (2007)

Radiology, which deals with medical images for diagnosis purposes, has seen a lot of improvements during the last decades thanks to information technology. The migration from studies based on physical media to studies based on digital media brought new possibilities and new challenges. One of the most important marks occurred in 1993 with Digital Image Communication in Medicine (DICOM), a standard used to produce, store, display, process and print medical images. DICOM enabled the development of Picture Archiving and Communication Systems (PACS), complex systems that allow all the major operations needed in medical imaging. In this paper we describe an add-on that brings advanced search possibilities to basic DICOM systems, which usually don't implement anything similar, since the standard doesn't require them to. The system we present here is based on a client-server architecture and uses the relational model.
Residual dynamic typestate analysis exploiting static analysis: results to reformulate and reduce the cost of dynamic analysis
Authors: Matthew B. Dwyer, Rahul Purandare
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Programmers using complex libraries and frameworks are faced with the difficult task of ensuring that their implementations comply with complex and informally described rules for proper sequencing of API calls. Recent advances in static and dynamic techniques for checking explicit specifications of program typestate properties have shown promise in addressing this challenge. Unfortunately, static typestate analyses are limited in their scalability and dynamic analyses can suffer from significant run-time overhead. In this paper, we present an approach that exploits information calculated by flow-sensitive static typestate analyses to reformulate the original analysis problem as a residual dynamic typestate analysis. We demonstrate that residual analyses retain the error reporting of unoptimized dynamic analysis while offering the potential for significantly reducing analysis cost
A Video Display System for Image Processing by Computer
Authors: N. H. Kreitzer
Venue: IEEE Transactions on Computers (1973)

A core-refreshed video display system that can display gray-scale images of 32 intensity levels on a standard monochrome video monitor will be described. The system can also display flicker-free black and white images of more than 800 000 picture elements. There are special features that allow overlaying black and white images on 16-level gray-scale images and manual cursor control via an X-Y tablet. Multiple reduced size images can be accommodated by features that allow independent manipulation of images in separate areas on the display screen. This permits simultaneous display of images before and after processing.
New Products
Authors: D. A. Michalopoulos
Venue: Computer (1980)

According to Genisco Computers, the GCT-3032-8 graphics/imaging postprocessor significantly extends the capability of high-resolution (1280x1024x8) color or monochrome display systems.
The Good News and the Bad News
Authors: Wayne Wolf
Venue: Computer (2007)

Clean and robust embedded systems require new ways to think about computing.
Users Are Doing It For Themselves: Pedestrian Navigation With User Generated Content
Authors: Harald Holone, Gunnar Misund, Hakon Holmstedt
Venue: Proceedings of the The 2007 International Conference on Next Generation Mobile Applications, Services and Technologies (2007)

Route planning has over the few past years become common in the context of driving cars and other vehicles. However, with the advent of powerful mobile devices, such as smart-phones, systems helping pedestrians finding their way in complex urban environments have emerged. We present a prototype system for mobile pedestrian navigation, called OurWay, based on user generated maps and collaborative annotations of network segments. We are particularly concerned with users with various permanent or temporary disabilities, like wheelchair users, or parents pushing baby strollers. By letting users rate the accessibility of locations, the system will compute bespoke routes matching their abilities and preferences. We explore the potential of the concept through a combination of field work and lab trials, using real life data. We also demonstrate that collaboratively collected geodata has promising properties as a foundation for innovative geospatial applications. Initial results indicate that few user annotations are needed to produce good routes.
Effectiveness of additional representations for the search result presentation on the web
Authors: Hideo Joho, Joemon M. Jose
Venue: Information Processing and Management: an International Journal (2008)

The presentation of search results on the web has been dominated by the textual form of document representation. On the other hand, the document's visual aspects such as the layout, colour scheme, or presence of images have been studied in a limited context with regard to their effectiveness of search result presentation. This article presents a comparative evaluation of textual and visual forms of document representation as additional components of document surrogates. A total of 24 people were recruited for our task-based user study. The experimental results suggest that an increased level of document representation available in the search results can facilitate users' interaction with a search interface. The results also suggest that the two forms of additional representations are likely beneficial to users' information searching process in different contexts.
VGRAM: improving performance of approximate queries on string collections using variable-length grams
Authors: Chen Li, Bin Wang, Xiaochun Yang
Venue: Proceedings of the 33rd international conference on Very large data bases (2007)

Many applications need to solve the following problem of approximate string matching: from a collection of strings, how to find those similar to a given string, or the strings in another (possibly the same) collection of strings? Many algorithms are developed using fixed-length grams, which are substrings of a string used as signatures to identify similar strings. In this paper we develop a novel technique, called VGRAM, to improve the performance of these algorithms. Its main idea is to judiciously choose high-quality grams of variable lengths from a collection of strings to support queries on the collection. We give a full specification of this technique, including how to select high-quality grams from the collection, how to generate variable-length grams for a string based on the preselected grams, and what is the relationship between the similarity of the gram sets of two strings and their edit distance. A primary advantage of the technique is that it can be adopted by a plethora of approximate string algorithms without the need to modify them substantially. We present our extensive experiments on real data sets to evaluate the technique, and show the significant performance improvements on three existing algorithms.
Coping with API Evolution for Running, Mission-Critical Applications Using Virtual Execution Environment
Authors: Bashar Gharaibeh, Tien N. Nguyen, J. Morris Chang
Venue: Proceedings of the Seventh International Conference on Quality Software (2007)

Recent research showed that the majority of compatibility-breaking changes in a component-based, object-oriented software system are refactorings [5]. The software updating process in such system with the presence of heavily refactored application programming interface (API) is largely manual and disruptive to running, mission-critical applications, which are expected to run continuously without any interruptions. To address the online, API update issue for mission-critical systems, we have developed an online updating framework based on Virtual Execution Environment (VEE) such as Java Virtual Machine. The framework extends the VEE to take the API change log, which records changes to API components, and seamlessly apply proper updates to the running system without human intervention and without shutting down the system. This framework was implemented as an extension to Jikes Research Virtual Machine. Our experimental study showed that our online update tool requires little overhead while maintaining the consistent state of the updated running application.
Computer-Aided Synthesis or Multiple-Output Multilevel NAND Networks witk Fan-in and Fan-out Constraints
Authors: S. Y. H. Su, Chong-Woo Nam
Venue: IEEE Transactions on Computers (1971)

A straightforward efficient computer algorithm for synthesizing multiple-output NAND (NOR) switching networks is presented which takes practical fan-in and fan-out limitations of logic gates into account. The algorithm is highly iterative and hence is very suitable for realizing large-size switching functions by a digital computer. The algorithm has been programmed in Fortran and a great deal of statistical data has been obtained to demonstrate its efficiency in terms of gate count as well as computing time. It is also efficient for hand execution
Alternative scenarios to the
Authors: Nolan J. Taylor, Eleanor T. Loiacono, Richard T. Watson
Venue: Communications of the ACM (2008)

A test of alternative formats to Web banner ads.
Multivariable backward-shift-invariant subspaces and observability operators
Authors: Joseph A. Ball, Vladimir Bolotnikov, Quanlei Fang
Venue: Multidimensional Systems and Signal Processing (2007)

It is well known that subspaces of the Hardy space over the unit disk which are invariant under the backward shift occur as the image of an observability operator associated with a discrete-time linear system with stable state-dynamics, as well as the functional-model space for a Hilbert space contraction operator. We discuss two multivariable extensions of this structure, where the classical Hardy space is replaced by (1) the Fock space of formal power series in a collection of d noncommuting indeterminates with norm-square-summable vector coefficients, and (2) the reproducing kernel Hilbert space (often now called the Arveson space) over the unit ball in $${\mathbb{C}^{d}}$$ with reproducing kernel $${k(\lambda, \zeta) = 1/(1 - \langle \lambda, \zeta \rangle) (\lambda, \zeta \in \mathbb{C}^{d} with \| \lambda \|, \| \zeta \| ). In the first case, the associated linear system is of noncommutative Fornasini---Marchesini type with evolution along a free semigroup with d generators, while in the second case the linear system is a standard (commutative) Fornasini---Marchesini-type system with evolution along the integer lattice $${\mathbb{Z}^{d}}$$ . An abelianization map (or symmetrization of the Fock space) links the first case with the second. The second case has special features depending on whether the operator-tuple defining the state dynamics is commutative or not. The paper focuses on multidimensional state-output linear systems and the associated observability operators; followup papers Ball, Bollotnikov, and Fang (2007a, 2007b) use the results here to extend the analysis to represent observability-operator ranges as reproducing kernel Hilbert spaces with reproducing kernels constructed from the transfer function of a conservative multidimensional (noncommutative or commutative) input-state-output linear system.
A classification scheme for bin packing theory
Authors: Edward G. Coffman,  Jr., János Csirik
Venue: Acta Cybernetica (2007)

Classifications of published research place new results in a historical context and in so doing identify open problems. An example in wide use classifies results in scheduling theory according to a scheme originated by Graham, Lawler, Lenstra and Rinnooy Kan [10]. A similar effort was made by Dyckhoff [6] for cutting and packing problems. Such classification schemes can be combined with comprehensive bibliographies, e.g., the one provided for scheduling theory by Bruckner. This paper describes a novel classification scheme for bin packing which is being applied by the authors to an extensive (and growing) bibliography of the theory. Problem classifications are supplemented by compact descriptions of the main results and of the corresponding algorithms. The usefulness of the scheme is extended by an online search engine. With the help of this software, one is easily able to determine whether results already exist for applications that appear to be new, and to assist in locating the cutting edge of the general theory.
Computer Processing of Biomedical Images
Authors: K. Preston
Venue: Computer (1976)

The 1970's have witnessed two dramatic innovations in the application of computers to image processing in medicine: computerized tomography (CT), a system where data gathered from an x-ray scanner are fed into a computer to produce cross-sectional images of the human body, and white blood cell differentiation (WBCD), a system that uses a television camera and a computer to replace the human eye and brain in the sophisticated task of visually observing and classifying human white blood cells through the microscope.
Formation of star-like and core-shell AuAg nanoparticles during two- and three-step preparation in batch and in microfluidic systems
Authors: J. Michael Köhler, H. Romanus, U. Hübner, J. Wagner
Venue: Journal of Nanomaterials (2007)

Regular dendrit-like metal nanoparticles and core-shell nanoparticles were formed by the reduction of mixtures of tetrachloroaurate and silver nitrate solutions with ascorbic acid at room temperature in two- and three-step procedures. The formation of these particles was found in batch experiments as well as in micro flow-through processes using static micromixers. The characteristic diameters of 4-branched star particles were in the range between 60 and 100 nm. The typical particles consist of four metal cores which are embedded in a common shell. Additionally, particles with five and more metallic cores were formed, to some extent, and aggregates of the 4-branched particles also were formed. Larger aggregates and network-like structures of connected star particles were formed after sedimentation. The properties of the formed particles are dependent on the educt concentrations as well as on the order of mixing steps and on the time interval between them. Obviously, the relation of nucleation and particle growth in relation to the concentrations of metal ions determines the composition and the properties of formed nanoparticles. So, starlike particles are observed in case of nucleation of Au in absence of silver ions but with silver deposition after short nucleation time. Spherical core shell particles are formed in case of silver salt addition after complete reduction of tetrachloroaurate in flow-through experiments with sufficient residence time between both mixing steps. Polymer layers are always found in the form of a second outer shell even if the polymer solutions are added in an early stage of particle formation.
A kernel-free boundary integral method for elliptic boundary value problems
Authors: Wenjun Ying, Craig S. Henriquez
Venue: Journal of Computational Physics (2007)

This paper presents a class of kernel-free boundary integral (KFBI) methods for general elliptic boundary value problems (BVPs). The boundary integral equations reformulated from the BVPs are solved iteratively with the GMRES method. During the iteration, the boundary and volume integrals involving Green's functions are approximated by structured grid-based numerical solutions, which avoids the need to know the analytical expressions of Green's functions. The KFBI method assumes that the larger regular domain, which embeds the original complex domain, can be easily partitioned into a hierarchy of structured grids so that fast elliptic solvers such as the fast Fourier transform (FFT) based Poisson/Helmholtz solvers or those based on geometric multigrid iterations are applicable. The structured grid-based solutions are obtained with standard finite difference method (FDM) or finite element method (FEM), where the right hand side of the resulting linear system is appropriately modified at irregular grid nodes to recover the formal accuracy of the underlying numerical scheme. Numerical results demonstrating the efficiency and accuracy of the KFBI methods are presented. It is observed that the number of GMRES iterations used by the method for solving isotropic and moderately anisotropic BVPs is independent of the sizes of the grids that are employed to approximate the boundary and volume integrals. With the standard second-order FEMs and FDMs, the KFBI method shows a second-order convergence rate in accuracy for all of the tested Dirichlet/Neumann BVPs when the anisotropy of the diffusion tensor is not too strong.