ppxscal/embedding_network huggingface dataset:
Some data and observations on research publication in the areas of numerical computation and programming languages and systems
Authors: J. R. Rice
Venue: ACM SIGNUM Newsletter (1976)

This report contains extensive data on the level of research publications in refereed journals for two areas in Computer Science: Numerical Computation and Programming Languages and Systems. It is concluded that the research output in Numerical Computation is about 5 times that in Programming Languages and Systems (as measured by refereed research articles). Some less complete data on the number of conferences is also presented which suggests the number of conferences in numerical computations substantially exceeds that of Programming Languages and Systems. Some comparisons are made with data derived from Computing Reviews. The data is for 1973 and 1974.
Corpus-Based Schema Matching
Authors: Jayant Madhavan, Philip A. Bernstein, AnHai Doan, Alon Halevy
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Schema Matching is the problem of identifying corresponding elements in different schemas. Discovering these correspondences or matches is inherently difficult to automate. Past solutions have proposed a principled combination of multiple algorithms. However, these solutions sometimes perform rather poorly due to the lack ofsufficient evidence in the schemas being matched. In this paper we show how a corpus of schemas and mappings can be used to augment the evidence about the schemas being matched, so they can be matched better. Such a corpus typically contains multiple schemas that model similar concepts and hence enables us to learn variations in the elements and their properties. We exploit such a corpus in two ways. First, we increase the evidence about each element being matched by including evidence from similar elements in the corpus. Second, we learn statistics about elements and their relationships and use them to infer constraints that we use to prune candidate mappings. We also describe how to use known mappings to learn the importance of domain and generic constraints. We present experimental results that demonstrate corpus-based matching outperforms direct matching (without the benefit of a corpus) in multiple domains.
Extensible multiplier-accumulator blocks for FPGAs
Authors: António B. Ferrari, Rui R. Almeida, Rui E. Martins
Venue: Proceedings of the 4th international symposium on Information and communication technologies (2005)

This paper presents an extensible multiplier block suitable for embedding in FPGAs. The block is based on the radix-4 modified Booth's algorithm and supports the multiplication of 2's complement, unsigned or mixed-mode operands. The blocks can be cascaded to support larger operand lengths, with the resulting configuration offering a significant speed advantage over existing schemes.
Optimization of a very cost-effective high voltage p-channel transistor implemented in a standard twin-tub CMOS technology
Authors: A. Pérez-Tomás, X. Jordí, P. Godignon
Venue: Microelectronic Engineering (2005)

This paper discusses the optimization and fabrication of a high voltage p-channel extended drain MOSFET (ED-pMOSFET) using standard low cost 2.5 @mm twin-tub CMOS technology for digital applications, with only one extra processing step. The ED-pMOSFET transistor has been optimized using 2D simulators attending both specific on-resistance and breakdown voltage. Extended drain ED-pMOSFET transistors with low specific on-resistance (active area) R"o"n=6.0 m@Wcm^2 (at V"G=-5 V) and breakdown voltage of 36 V have been implemented demonstrating competitive performance values with other p-channel devices previously reported in more sophisticated technologies. The proposed device along with n-channel LDMOS high voltage devices and the standard low voltage CMOS devices, constitute a full smart power CMOS technology that can reach breakdown voltages up to 50 V and currents up to 1 A.
Review of "From Images to Surfaces: A Computational Study of the Human Early Visual System by William Eric Leifur Grimson"; MIT Press, 1981
Authors: Peter Blicher
Venue: Issue 82 (October 1982) (1982)

This book describes what must be today's most widely known stereoscopic correspondence system --- one based on the Marr-Poggio theory of stereopsis ([Marr 1977]).
On the tetraploid origin of the maize genome: Conference Reviews
Authors: Zuzana Swigonova, Jinsheng Lai, Jianxin Ma, Wusirika Ramakrishna, Victor Llaca, Jeffrey L. Bennetzen, Joachim Messing
Venue: Comparative and Functional Genomics (2004)

Data from cytological and genetic mapping studies suggest that maize arose as a tetraploid. Two previous studies investigating the most likely mode of maize origin arrived at different conclusions. Gaut and Doebley [7] proposed a segmental allotetraploid origin of the maize genome and estimated that the two maize progenitors diverged at 20.5 million years ago (mya). In a similar study, using larger data set, Brendel and colleagues (quoted in [8]) suggested a single genome duplication at 16 mya. One of the key components of such analyses is to examine sequence divergence among strictly orthologous genes. In order to identify such genes, Lai and colleagues [10] sequenced five duplicated chromosomal regions from the maize genome and the orthologous counterparts from the sorghum genome. They also identified the orthologous regions in rice. Using positional information of genetic components, they identified 11 orthologous genes across the two duplicated regions of maize, and the sorghum and rice regions. Swigonova et al. [12] analyzed the 11 orthologues, and showed that all five maize chromosomal regions duplicated at the same time, supporting a tetraploid origin of maize, and that the two maize progenitors diverged from each other at about the same time as each of them diverged from sorghum, about 11.9 mya. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An approximation algorithm for Stackelberg network pricing
Authors: Sébastien Roch, Gilles Savard, Patrice Marcotte
Venue: Networks (2005)

We consider the problem of maximizing the revenue raised from tolls set on the arcs of a transportation network, under the constraint that users are assigned to toll-compatible shortest paths. We first prove that this problem is strongly NP-hard. We then provide a polynomial time algorithm with a worst-case precision guarantee of ${{1 \over 2}\log_2 m_T+1}$, where mT denotes the number of toll arcs. Finally, we show that the approximation is tight with respect to a natural relaxation by constructing a family of instances for which the relaxation gap is reached. &copy; 2005 Wiley Periodicals, Inc. NETWORKS, Vol. 46(1), 57&ndash;67 2005
Access control in collaborative systems
Authors: William Tolone, Gail-Joon Ahn, Tanusree Pai, Seng-Phil Hong
Venue: ACM Computing Surveys (CSUR) (2005)

Balancing the competing goals of collaboration and security is a difficult, multidimensional problem. Collaborative systems often focus on building useful connections among people, tools, and information while security seeks to ensure the availability, confidentiality, and integrity of these same elements. In this article, we focus on one important dimension of this problem---access control. The article examines existing access control models as applied to collaboration, highlighting not only the benefits, but also the weaknesses of these models.
Dynamic Interaction between Deformable Surfaces and Nonsmooth Objects
Authors: Wingo Sai-Keung Wong George Baciu
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

In this paper, we introduce new techniques that enhance the computational performance for the interactions between sharp objects and deformable surfaces. The new formulation is based on a time-domain predictor-corrector model. For this purpose, we define a new kind of (\pi, \beta, {\bf I}){\hbox{-}}{\rm surface}. The partitioning of a deformable surface into a finite set of (\pi, \beta, {\bf I}){\hbox{-}}{\rm surfaces} allows us to prune a large number of noncolliding feature pairs. This leads to a significant performance improvement in the collision detection process. The intrinsic collision detection is performed in the time domain. Although it is more expensive compared to the static interference test, it avoids portions of the surfaces passing through each other in a single time step. In order to resolve all the possible collision events at a given time, a penetration-free motion space is constructed for each colliding particle. By keeping the velocity of each particle inside the motion space, we guarantee that the current colliding feature pairs will not penetrate each other in the subsequent motion. A static analysis approach is adopted to handle friction by considering the forces acting on the particles and their velocities. In our formulation, we further reduce the computational complexity by eliminating the need to compute repulsive forces.
Comparisons and computation of well-founded semantics for disjunctive logic programs
Authors: Kewen Wang, Lizhu Zhou
Venue: ACM Transactions on Computational Logic (TOCL) (2005)

Much work has been done on extending the well-founded semantics to general disjunctive logic programs and various approaches have been proposed. However, these semantics are different from each other and no consensus is reached about which semantics is the most intended. In this article, we look at disjunctive well-founded reasoning from different angles. We show that there is an intuitive form of the well-founded reasoning in disjunctive logic programming which can be characterized by slightly modifying some existing approaches to defining disjunctive well-founded semantics, including program transformations, argumentation, unfounded sets (and resolution-like procedure). By employing the techniques developed by Brass and Dix in their transformation-based approach, we also provide a bottom-up procedure for this semantics. The significance of our work is not only in clarifying the relationship among different approaches, but also shed some light on what is an intended well-founded semantics for disjunctive logic programs.
Improving text collection selection with coverage and overlap statistics
Authors: Thomas Hernandez, Subbarao Kambhampati
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

In an environment of distributed text collections, the first step in the information retrieval process is to identify which of all available collections are more relevant to a given query and which should thus be accessed to answer the query. We address the challenge of collection selection when there is full or partial overlap between the available text collections, a scenario which has not been examined previously despite its real-world applications. To that end, we present COSCO, a collection selection approach which uses collection-specific coverage and overlap statistics. We describe our experimental results which show that the presented approach displays the desired behavior of retrieving more new results early on in the collection order, and performs consistently and significantly better than CORI, previously considered to be one of the best collection selection systems.
19 Deadly Sins of Software Security, 1 edition
Authors: Michael Howard, David LeBlanc, John Viega
Venue:  (2005)

This essential book for all software developers--regardless of platform, language, or type of application--outlines the “19 deadly sins” of software security and shows how to fix each one. Best-selling authors Michael Howard and David LeBlanc, who teach Microsoft employees how to secure code, have partnered with John Viega, the man who uncovered the 19 deadly programming sins to write this much-needed book. Coverage includes: Windows, UNIX, Linux, and Mac OS X C, C++, C#, Java, PHP, Perl, and Visual Basic Web, small client, and smart-client applications
Generic mesh refinement on GPU
Authors: Tamy Boubekeur, Christophe Schlick
Venue: Proceedings of the ACM SIGGRAPH/EUROGRAPHICS conference on Graphics hardware (2005)

Many recent publications have shown that a large variety of computation involved in computer graphics can be moved from the CPU to the GPU, by a clever use of vertex or fragment shaders. Nonetheless there is still one kind of algorithms that is hard to translate from CPU to GPU: mesh refinement techniques. The main reason for this, is that vertex shaders available on current graphics hardware do not allow the generation of additional vertices on a mesh stored in graphics hardware. In this paper, we propose a general solution to generate mesh refinement on GPU. The main idea is to define a generic refinement pattern that will be used to virtually create additional inner vertices for a given polygon. These vertices are then translated according to some procedural displacement map defining the underlying geometry (similarly, the normal vectors may be transformed according to some procedural normal map). For illustration purpose, we use a tesselated triangular pattern, but many other refinement patterns may be employed. To show its flexibility, the technique has been applied on a large variety of refinement techniques: procedural displacement mapping, as well as more complex techniques such as curved PN-triangles or ST-meshes.
Enhancing Latin American History Teaching and Research With Computers
Authors: Richard W. Slatta, E. Kalé Haywood
Venue: Social Science Computer Review (2005)

Historians specializing in Latin America use a wide range of electronic tools in their research, publication, and teaching. Quality information for the region is now available in a wide variety of formats, including databases, spreadsheets, CD-ROMs, concept maps, and web sites, created by historians and librarians. Thanks to electronic finding aides, it is now quicker and more convenient to research and to teach students about Latin America's past. In addition, teachers can bring more of the richness and variety of Latin American culture to their students by using new technologies.
Design of an efficient VLSI architecture for non-linear spatial warping of wide-angle camera images
Authors: K. Vijayan Asari
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

Endoscopic images are subjected to spatial distortion due to the wide-angle configuration of the camera lenses. This barrel type of non-linear distortion should be corrected before these images are subjected to further analysis for diagnostic purposes. An efficient digital architecture suitable for an embedded system which can correct the barrel distortion in real-time is presented in this paper. The theoretical approach of this spatial warping technique is based on least-squares estimation. The images in the distorted image space are mapped onto the corrected image space by using a polynomial mapping model. The polynomial parameters include the expansion coefficients, back-mapping coefficients, distortion centre and corrected centre. Several experiments were conducted by applying the spatial warping algorithm on many endoscopic images. A digital architecture suitable for hardware implementation of the distortion correction technique is developed by mapping the algorithmic steps onto a linear array of processing modules. Each module of a particular unit communicates with its nearest neighbours. The spatial warping architecture implemented and simulated with Altera's Quartus II software shows an overall computation time of 1.8 ms with 50 MHz clock for an image of size 256×192 pixels, which confirms that the spatial warping module could be mounted as a dedicated unit in an endoscopy system for real-time applications.
Trustworthy Web Services: Actions for Now
Authors: Jia Zhang
Venue: IT Professional (2005)

For Web services to grow as predicted, researchers must not wait to address the challenges of software trustworthiness.
Speeding Up Fractal Image Compression by Genetic Algorithms
Authors: Faraoun Kamel Mohamed, Boukelif Aoued
Venue: Multidimensional Systems and Signal Processing (2005)

The main problem with all fractal compression implementation is execution time. Algorithms can spend hours to compress a single image. Most of the major variants of the standard algorithm for speeding up computation time have led to a bad-quality or a lower compression ratio. For example, the Fisher's [7] proposed classification pattern greatly accelerated the algorithm, but image quality was poor due to the search-space reduction imposed by the classification, which eleminates a lot of good solutions.By using genetic algorithms to address the problem, we optimize the domain blocks search. We explore all domain blocks present in the image but not in exhaustive way (like a standard algorithm) and without omitting any possible block (solution) as a classification pattern does. A genetic algorithm is the unique method for satisfying these constraints. And it is a way to do be a random search because the genetic one is directed by fitness selection, which produces optimal solutions.Our goal in this work is to use a genetic algorithm to solve the IFS inverse problem and to build a fractal compression algorithm based on the genetic optimization of a domain blocks search. we have also implemented standard Barnsley algorithm, the Y. Fisher based on classification, and the genetic compression algorithm with quadtree partitioning. A population of transformations was evolved for each range block, and the result is compared with the standard Barnsely algorithm and the Fisher algorithm = based classification.We deduced an optimal set of values for the best parameters combination, and we can also specify the best combination for each desired criteria: best compression ratio, best image quality, or quick compression process. By running many test images, we experimentally found the following set of optimal values of all the algorithm parameters that ensure compromise between execution time and solutions optimality: Population size = 100, Maximum generations = 20, Crossover rate = 0.7, Mutation rate = 0.1, RMS limit = 5, Decomposition error limit = 10, Flips and isometrics count = 8.In our proposed algorithm, results were much better than those obtained both vences and Rudomin [5] and Lankhorst [4] approaches.
Robot contest as a laboratory for experiential engineering education
Authors: Igor M. Verner, David J. Ahlgren
Venue: Journal on Educational Resources in Computing (JERIC) (2004)

By designing, building, and operating autonomous robots students learn key engineering subjects and develop systems-thinking, problem-solving, and teamwork skills. Such events as the Trinity College Fire-Fighting Home Robot Contest (TCFFHRC) offer rich opportunities for students to apply their skills by requiring design, and implementation of autonomous robots that are tested during competition. Started in 2003, the TCFFHRC Robotics Olympiad offers junior-high and high school students, working alone or in teams, to demonstrate their knowledge by taking a challenging 50-minute written examination in four key areas related to robotics: mechanics, sensors, software, and electronics. The Olympiad comprises a second evaluation medium that supplements a regular contest survey, which has been in place since 1999. The contest survey solicits information about motivation and progress in subject areas from all contest participants--a large and diverse group that includes junior-high and high school students, working engineers, university students, and team supervisors/guides. As a further evaluation step, we have conducted supplementary case studies of courses and curricula at Trinity College and at the Technion. Assessment indicates that the TCFFHRC has achieved its primary goal: to foster and improve robotics education on an international scale.
A user-centered framework for redesigning health care interfaces
Authors: Constance M. Johnson, Todd R. Johnson, Jiajie Zhang
Venue: Journal of Biomedical Informatics (2005)

Numerous health care systems are designed without consideration of user-centered design guidelines. Consequently, systems are created ad hoc, users are dissatisfied and often systems are abandoned. This is not only a waste of human resources, but economic resources as well. In order to salvage such systems, we have combined different methods from the area of computer science, cognitive science, psychology, and human-computer interaction to formulate a framework for guiding the redesign process. The paper provides a review of the different methods involved in this process and presents a life cycle of our redesign approach. Following the description of the methods, we present a case study, which shows a successfully applied example of the use of this framework. A comparison between the original and redesigned interfaces showed improvements in system usefulness, information quality, and interface quality.
Real-Time Streaming and Robust Streaming H.264/AVC Video
Authors: Zhi-Gang Li, Zhao-Yang Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

With the increasingly extensive applications for the new emerging video coding standard, H.264/AVC, it becomes more and more important that we transport H.264/AVC video over MPEG-2 system by exploiting all the existing large amount of the infrastructure of MPEG-2 systems. In this paper, we propose two solutions for it. The key technologies are as follows: Firstly we use an H.264/AVC video as an elementary stream of an MPEG-2 system and multiplex it into a TS (transport stream), then extend the T-STD (Transport stream-System Target Decoder) of MPEG-2 standard, so as to transport MPEG-2 TS through Internet and decode it in the client. Ordinarily, the decoded elementary stream should come from a container (a system layer encapsulation including a compression layer), such as AVI. However, we take MPEG-2 TS as a container herein. We encapsulate the H.264/AVC elementary stream into this container in the server, and extract the H.264/AVC video from it to be decoded and be represented. If we use the UDP (User Datagram Protocol) as a transport protocol, the streaming process will be a real-time one. The experiment result shows that we get a good result, with less than 5% frames whose PSNR
Towards more accurate separation bounds of empirical polynomials
Authors: Kosaku Nagasaka
Venue: ACM SIGSAM Bulletin (2004)

We study the problem of bounding a polynomial which is absolutely irreducible, away from polynomials which are not absolutely irreducible. These separation bounds are useful for testing whether an empirical polynomial is absolutely irreducible or not, for the given tolerance or error bound of its coefficients. Kaltofen and May studied a method which finds applicable separation bounds using an absolute irreducibility criterion due to Ruppert. In this paper, we study some improvements on their method, by which we are able to find more accurate separation bounds, for bivariate polynomials.
XML Data Stores: Emerging Practices
Authors: Athena Vakali, Barbara Catania, Anna Maddalena
Venue: IEEE Internet Computing (2005)

Because XML is rapidly becoming the Internet standard for data representation and exchange, efficient XML document storage has become a core data management issue. Most early XML storage practices rely on conventional database management systems. However, such systems involve mappings and transformations between XML and the underlying database structure. More recent efforts are based on specific XML-tailored systems that provide ad hoc functionalities. This overview of emerging XML storage approaches highlights current practices along with prospective research and implementation trends.