ppxscal/embedding_network huggingface dataset:
Building Knowledge Flow of Textual Topics for the e-Science Knowledge Grid
Authors: Xiangfeng Luo, Zhian Yu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

In order to build knowledge flow of textual topics, the enormous topics of scientific texts are needed to be managed and organized. Island is proposed to manage the topic of scientific text belonging to the same domain. Interest Table is presented to store the textual topics that researcher is interested recently. KM-Chord is introduced to organize KM, which not only reflects the concepts (keywords) of textual topic, but also takes the relationships between concepts into account. So KM-Chord has more strong semantic information than traditional Chord. Knowledge Map (KM) representing textual topic can be located quickly with the help of KM-Chord, and the semantic information between KMs can be found (eg. similar and subtype relationship) for building the knowledge flow of the textual topics. The knowledge flow of textual topics can support knowledge innovation, cooperative teamwork, problem-solving and decision-making in e-Science Knowledge Grid. Experiments show KM-Chord not only can locate and route the textual topic, but also build the knowledge flow of textual topic effectively. So the proposed KM-Chord is a good method to build the Knowledge Flow of textual topics for the e-science Knowledge Grid, Semantic Grid and current Web.
Evaluating the Performance Impact of Xen on MPI and Process Execution For HPC Systems
Authors: Lamia Youseff, Rich Wolski, Brent Gorda, Chandra Krintz
Venue: Proceedings of the 2nd International Workshop on Virtualization Technology in Distributed Computing (2006)

Virtualization has become increasingly popular for enabling full system isolation, load balancing, and hardware multiplexing for high-end server systems. Virtualizing software has the potential to benefit HPC systems similarly by facilitating efficient cluster management, application isolation, full-system customization, and process migration. However, virtualizing software is not currently employed in HPC environments due to its perceived overhead. In this work, we investigate the overhead imposed by the popular, open-source, Xen virtualization system, on performance-critical HPC kernels and applications. We empirically evaluate the impact of Xen on both communication and computation and compare its use to that of a customized kernel using HPC cluster resources at Lawrence Livermore National Lab (LLNL). We also employ statistically sound methods to compare the performance of a paravirtualized kernel against three popular Linux operating systems: RedHat Enterprise 4 (RHEL4) for build versions 2.6.9 and 2.6.12 and the LLNL CHAOS kernel, a specialized version of RHEL4. Our results indicate that Xen is very efficient and practical for HPC systems.
Mining web multi-resolution community-based popularity for information retrieval
Authors: Laurence A. F. Park, Kotagiri Ramamohanarao
Venue: Proceedings of the sixteenth ACM conference on Conference on information and knowledge management (2007)

The PageRank algorithm is used in Web information retrieval to calculate a single list of popularity scores for each page in the Web. These popularity scores are used to rank query results when presented to the user. By using the structure of the entire Web to calculate one score per document, we are calculating a general popularity score, not particular to any community. Therefore, the PageRank scores are more suited to general queries. In this paper, we introduce a more general form of PageRank, using Web multi-resolution community-based popularity scores, where each document obtains a popularity score dependent on a given Web community. When a query is related to a specific community, we choose the associated set of popularity scores and order the query results accordingly. Using Web-community based popularity scores, we achieved an 11% increase in precision over PageRank.
Hybrid Digital/Analog Computer Systems
Authors: P. Landauer
Venue: Computer (1976)

In contrast to the crude analog-digital combinations of the 1960's, today's hybrids are true multiprocessors supported by realtime operating systems. Their solid-state analog computing elements loaded digitally in microseconds, together with their equation-oriented compilers, provide efficient, automatic setup and high productivity. Teamed with flexible, low-cost alphanumeric/graphic displays, modern hybrids are being applied over the full spectrum of scientific and engineering studies. Since the average hybrid system has an equivalent digital processing speed of over 10 million operations per second, at less than one-tenth the cost of large digital data processors, typical users realize cost savings of over 100/1. 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
Parallel motion estimation on the MDSP multiprocessor
Authors: Yen-Chun Lin, Chuan-Da Hsiung
Venue: Neural, Parallel Scientific Computations (2007)

Motion estimation (ME) is a process for removing temporal redundancies in video sequences. It contributes most of the compression ratio and consumes typically 60-80% of the video encoding time. This paper investigates parallel execution of ME on the Multiprocessor DSP (MDSP) architecture, a software programmable, scalable multiprocessor platform. We use a low-overhead data distribution scheme and achieve load balancing among processors. In addition, we assign different tasks of an ME algorithm to suitable types of processors. Many sequential ME algorithms can be adapted to run on the MDSP in parallel, and the experimental results show that very good speedup can be obtained. Since the MDSP is software programmable, our design can be easily integrated into a video encoder, modified to meet different standards, and used in various video applications.
Special Feature: Putting Petri Nets to Work
Authors: T. Agerwala
Venue: Computer (1979)

Today's modeling tools, appropriate for conventional sequential systems, will be inadequate for the complex concurrent systems of the 80's. Petri nets may offer a solution.
Direct 5-axis tool-path generation from point cloud input using 3D biarc fitting
Authors: K. L. Chui, W. K. Chiu, K. M. Yu
Venue: Robotics and Computer-Integrated Manufacturing (2008)

In reverse engineering, geometrical information of a product is obtained directly from a physical shape by a digitizing device. To fabricate the product, manufacturing information (usually tool-path) must be generated from a CAD model. The data digitized must be processed and in most cases, a surface model is constructed from them using some of the surface fitting technologies. However, these technologies are usually complicated and the process for constructing a surface patch from a massive digitizing data is time-consuming. To simplify the process for getting tool-path information, a simple algorithm is proposed in this paper. The algorithm is used to generate a 5-axis machining tool-path. Instead of implementing any complicated surface fitting techniques, a direct method is proposed for constructing three-dimensional (3D) triangular mesh from the digitizing data with the mesh points considered as the tool contact locations. Depending on the locations of the points digitized, a decimation procedure is applied such that some of the digitizing data will be filtered out. Then, the tool axis orientations which must be determined in 5-axis tool-path are calculated and the tool center locations are determined accordingly. A 3D biarc fitting technique is applied for all the tool center locations so that a complete 5-axis tool-path is obtained.
A Community-Based Approach to Personalizing Web Search
Authors: Barry Smyth
Venue: Computer (2007)

Researchers can leverage the latent knowledge crated within search communities by recording users' search activities—the queries they submit and the results they select—at the community level. They can use this data to build a relevance model that guides the promotion of community-relevant results during regular Web search.
Workshop Report: The Challenge of Complexity
Authors: W. Rosenbluth
Venue: Computer (1977)

The multiplicity of choices available to the designer in applying the technology peripheral devices to specific system products often constitutes a problem in itself. Thus, "The Challenge of Complexity" was selected by the Computer Elements Technical Committee as the theme of their recent Phoenix Workshop. Held at Carefree, Arizona, this past December 5-8, the meeting drew 55 attendees from 17 companies and four universities.
Minimizing XML Queries Using a Family of Constraints
Authors: Xiping Liu, Changxuan Wan
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

An effective way to optimize XML queries is to minimize XML queries. In this paper, we improve redundance elimination in XPath queries greatly by incorporating two novel kinds of constraints: parent constraint and sibling constraint, and by extending the tractable fragment to include descendant-or-self axis. The two novel kinds of constraints, together with child constraint and descendant constraint, form a family of constraints, which complicate the problem but offer possibilities for further minimization. Two techniques, tree augmentation and simulation augmentation, are employed to cope with constraints. We elaborate on the minimizing algorithms and running efficiencies both in the absence and in the presence of various kinds of constraints.
A New Threshold Group Signature Scheme Based on Discrete Logarithm Problem
Authors: Fengyin Li, Jiguo Yu, Hongwei Ju
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

The threshold group signature is an important kind of signature. So far, many threshold group signature schemes have been proposed, but most of them suffer from conspiracy attack and are insecure. In this paper, based on the discrete logarithm problem and the group signature model of Camenisch and Groth [6], a secure threshold group signature scheme is proposed. The scheme is not only threshold-signing, but also threshold-verifying. Performances analysis shows that it can not only satisfy the properties of threshold group signatures , but also withstand the conspiracy attack.
Multi-sensor Satellite Image Sub-pixel Registration
Authors: Shuai Xing, Qing Xu, Dongyang Ma
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

One way of geocoding a remote sensing image is to register it to an existing orthoimage. A multi-sensor and multi-resolution remote sensing image sub-pixel registration scheme is proposed in this paper. In this registration scheme, point feature, three image matching algorithms (ICM, PRM, LSM) and three constraints (APC, CDM, TCC) are used. They guarantee that the precision of point matching reaches sub-pixel and the distribution of feature points are self-adapted to the area terrain. Then TIN is constructed with feature points. Finally the target image is rectified based on TIN with the improved triangle filling algorithm. Experiment results demonstrate that the registration accuracy of SPOT5 panchromatic image (2.5 m/pixel) is 2-3 m and SPOT5 multi-spectral image (10 m/pixel) is 5-6 m. Since the method has good feasibility, efficiency and accuracy, it has been used in some emergencies such as disaster evaluation, paroxysmal epidemic situation and local war.
Using Context Distance Measurement to Analyze Results across Studies
Authors: Daniela Cruzes, Manoel Gomes Mendonça, Victor Basili, Forrest Shull, Mario Jino
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Providing robust decision support for software engineering (SE) requires the collection of data across multiple contexts so that one can begin to elicit the context variables that can influence the results of applying a technology. However, the task of comparing contexts is complex due to the large number of variables involved. This works extends a previous one in which we proposed a practical and rigorous process for identifying evidence and context information from SE papers. The current work proposes a specific template to collect context information from SE papers and an interactive approach to compare context information about these studies. It uses visualization and clustering algorithms to help the exploration of similarities and differences among empirical studies. This paper presents this approach and a feasibility study in which the approach is applied to cluster a set of papers that were independently grouped by experts.
Application of Pattern Recognition and Artificial Neural Network to Load Forecasting in Electric Power System
Authors: Wenjin Dai, Ping Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

Electric power system load forecasting plays an important role in the Energy Management System (EMS), which has great influence on the operation, controlling and planning of electric power system. A precise electric power system short term load forecasting will result in economic cost saving and improving security operation condition. With the develop-ment of deregulation in electric power system, the method of short term load forecasting with high accuracy is becoming more and more important. Due to the complicacy and uncertainty of load forecasting, electric power load is difficult to be forecasted precisely if no analysis model and numerical value algorithm model is applied. In order to improve the precision of electric power system short term load forecasting, a new load forecasting model is put foreword in this paper .This paper presents a short-term load forecasting method using pattern recognition which obtains input sets belong to multi-layered fed-forward neural network, and artificial neural network in which BP learning algorithm is used to train samples. Load forecasting has become one of the major areas of research in electrical engineering in recent years. The artificial neural network used in short-time load forecasting can grasp interior rule in factors and complete complex mathematic mapping. Therefore, it is world wide applied effectively for power system short-term load forecasting.
A multiple-window video embedding transcoder based on H.264/AVC standard
Authors: Chih-Hung Li, Chung-Neng Wang, Tihao Chiang
Venue: EURASIP Journal on Advances in Signal Processing (2007)

This paper proposes a low-complexity multiple-window video embedding transcoder (MW-VET) based on H.264/AVC standard for various applications that require video embedding services including picture-in-picture (PIP), multichannel mosaic, screen-split, pay-per-view, channel browsing, commercials and logo insertion, and other visual information embedding services. The MW-VET embeds multiple foreground pictures at macroblock-aligned positions. It improves the transcoding speed with three block level adaptive techniques including slice group based transcoding (SGT), reduced frame memory transcoder (RFMT), and syntax level bypassing (SLB). The SGT utilizes prediction from the slice-aligned data partitions in the original bitstreams such that the transcoder simply merges the bitstreams by parsing. When the prediction comes from the newly covered area without slice-group data partitions, the pixels at the affected macroblocks are transcoded with the RFMT based on the concept of partial reencoding to minimize the number of refined blocks. The RFMT employs motion vector remapping (MVR) and intra mode switching (IMS) to handle intercoded blocks and intracoded blocks, respectively. The pixels outside the macroblocks that are affected by newly covered reference frame are transcoded by the SLB. Experimental results show that, as compared to the cascaded pixel domain transcoder (CPDT) with the highest complexity, our MW-VET can significantly reduce the processing complexity by 25 times and retain the rate-distortion performance close to the CPDT. At certain bit rates, the MW-VET can achieve up to 1.5 dB quality improvement in peak signal-to-noise-ratio (PSNR).
Semi-Split TCP: Maintaining End-to-End Semantics for Split TCP
Authors: Fei Xie, Ning Jiang, Yao Hua Ho, Kien A. Hua
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

It has long been acknowledged that TCP performance suffers in hybrid networks. A Split TCP approach has been proposed to address this problem. In this approach, a proxy is employed at the boundary of wired networks (e.g. the Internet) and wireless networks (e.g. Cellular #etworks, WLan or Mobile Ad Hoc #etworks). This strategy significantly improves TCP performance. However, it does not maintain the end-to-end semantics of TCP. The loss of end-to-end semantics may cause problems to applications that rely on such a guarantee provided by TCP. In this paper, we introduce a novel technique called Semi-Split TCP to address the problem without sacrificing the benefits of Split TCP. We present the architecture and algorithms of the proposed technique; and give implementation, simulation, and analytical results to illustrate the feasibility of this method. Our simulation results demonstrate that Semi-Split TCP can achieve similar performance as Split-TCP without sacrificing the end-to-end semantics.
Do background images improve "draw a secret" graphical passwords?
Authors: Paul Dunphy, Jeff Yan
Venue: Proceedings of the 14th ACM conference on Computer and communications security (2007)

Draw a secret (DAS) is a representative graphical password scheme. Rigorous theoretical analysis suggests that DAS supports an overall password space larger than that of the ubiquitous textual password scheme. However, recent research suggests that DAS users tend to choose weak passwords, and their choices would render this theoretically sound scheme less secure in real life. In this paper we investigate the novel idea of introducing background images to the DAS scheme, where users were initially supposed to draw passwords on a blank canvas overlaid with a grid. Encouraging results from our two user studies have shown that people aided with background images tended to set significantly more complicated passwords than their counterparts using the original scheme. The background images also reduced other predictable characteristics in DAS passwords such as symmetry and centering within the drawing grid, further improving the strength of the passwords. We estimate that the average strength of successfully recalled passwords in the enhanced scheme was increased over those created using the original scheme by more than 10 bits. Moreover, a positive effect was observed with respect to the memorability of the more complex passwords encouraged by the background images.
Fixation response of two cementless tibial implants under static and fatigue compression loading
Authors: M. Dammak, A. Shirazi-Adl, D. J. Zukor
Venue: Technology and Health Care (2003)

The short- and long-term success of tibial cementless implants depend on the initial fixation stability often provided by posts and screws. Excessive relative interface motions are known to inhibit bone ingrowth and, hence, biologic fixation. In the present study, the stability of two cementless tibial implants under static and cyclic loading was studied. An apparatus was developed to perform compression tests on tibial components fixed by screws or posts onto resurfaced tibiae. Motion transducers were placed to record liftoff and subsidence displacements. A load of 1000 N was eccentrically applied on the medial plateau via the femoral component. The response was measured under static and repetitive loading up to 4000 cycles at 1 Hz. Experimental results showed that the screw fixation yielded the stiffer response and, hence, provided greater initial stability. The tibial component fixed with posts demonstrated larger lift off displacements. Comparison of measured results of static tests before and after fatigue indicated that the load-displacement behavior was not significantly affected by the cyclic fatigue loading under 1000 N up to 4000 cycles at 1 Hz. Nevertheless, much larger permanent displacements were recorded for the post fixation systems. In contrast to screw fixation, posts fixation systems demonstrated marked deterioration under larger compression loads of &sim; 2000 N.
Storage technologies: an education opportunity
Authors: Ed Van Sickle, Efrem Mallach, Brian Cameron, Derrek B. Dunn, Denetra Rook, Frank Groom, Ronnie Rollins
Venue: Proceedings of the 8th ACM SIGITE conference on Information technology education (2007)

Are current IT students ready for the explosive growth in information? IDC reports that 988 billion gigabytes of new digital information will be created by 2010 [1]. IT managers face the task of creating an infrastructure which can Store, Protect, Manage, Optimize and Leverage this information. IT departments are implementing and using SAN (Storage Area Networks), NAS (Network Attached Storage), and Data Replication technologies to solve the problems of storage capacity, data availability, and data mobility. IDC predicts that IT spending on storage and services will exceed $60 billion in 2007 [2]. Increased spending on storage makes it the fastest growing segment of IT. EMC Corporation, the world leader in storage, created the EMC Academic Alliance Program. EMC partners with colleges by providing courses to teach students about storage technologies. Courses are taught by faculty. Several colleges are using courses, as upper level elective offerings, to teach students about the design of storage technologies and the "big picture" of an information infrastructure. The courses are "open" and focused on storage technologies, not products. EMC also provides knowledge transfer to faculty. There is no cost to join and no cost to obtain the courses.
Synthesis of Multiple-Valued Logic Networks Based on Tree-Type Universal Logic Module
Authors: M. Kameyama
Venue: IEEE Transactions on Computers (1977)

This correspondence presents a theoretical study on the synthesis of multiple-valued logic networks based on tree-type universal logic modules (T-ULM's). The mathematical notation of T-ULM is introduced. On the basis of the mathematical properties, an algorithm for synthesizing an arbitrary logic function of n variables with a smaller number of modules is presented. In this algorithm, only true and constant inputs are allowed at input terminals. The algorithm consists of two parts. The first one is a functional decomposition, and the other one is the proper order of the expansion which is the problem of zinding the most incomplete tree structure. Thus it is established that the systematic and nonexhaustive procedure of the algorithm gives a suboptimal solution for the reduction of the number of T-ULM's.