ppxscal/embedding_network huggingface dataset:
Note on "the design of a user interface to large Fortran subroutine packages under IBM 360/370 OS"
Authors: James M. Boyle
Venue: ACM SIGNUM Newsletter (1975)

The article by Tweedale and Chan in the Jan. 75 SIGNUM Newsletter mentions the control program supplied with EISPACK without giving a suitable reference. Unfortunately, they seem not to be aware that its design and operation, and the philosophy behind them, are thoroughly documented in [1]. In particular, [1] discusses programming techniques which simplify the interpretation of the arguments and the selection of subroutines to perform the computation.
Improved algorithms for link-based non-tree clock networks for skew variability reduction
Authors: Anand Rajaram, David Z. Pan, Jiang Hu
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

In the nanometer VLSI technology, the variation effects like manufacturing variation, power supply noise, temperature etc. become very significant. As one of the most vital nets in any synchronous VLSI chip, the Clock Distribution Network (CDN) is especially sensitive to these variations. Recently proposed link-based non-tree [1] addresses this problem by constructing a non-tree that is significantly more tolerant to variations when compared to a clock tree. Although the two algorithms proposed in [1] are effective in reducing the skew variability, they have a few drawbacks including high complexity, lengthy links and uneven link distribution across the clock network. In this paper, we propose two new algorithms that can overcome these disadvantages. The effectiveness of the proposed algorithms has been validated using HSPICE based Monte Carlo simulations. Experimental results show that the new algorithms are able to achieve the same or better skew reduction with an average of 5% wire length increase when compared to the 15% wire length increase of the existing algorithms in [1]. Moreover, the new algorithms scale extremely well to big clock networks, i.e., the bigger the clock network, the less overall link cost (less than 2% for the biggest benchmark we have).
Fully automatic wrapper generation for search engines
Authors: Hongkun Zhao, Weiyi Meng, Zonghuan Wu, Vijay Raghavan, Clement Yu
Venue: Proceedings of the 14th international conference on World Wide Web (2005)

When a query is submitted to a search engine, the search engine returns a dynamically generated result page containing the result records, each of which usually consists of a link to and/or snippet of a retrieved Web page. In addition, such a result page often also contains information irrelevant to the query, such as information related to the hosting site of the search engine and advertisements. In this paper, we present a technique for automatically producing wrappers that can be used to extract search result records from dynamically generated result pages returned by search engines. Automatic search result record extraction is very important for many applications that need to interact with search engines such as automatic construction and maintenance of metasearch engines and deep Web crawling. The novel aspect of the proposed technique is that it utilizes both the visual content features on the result page as displayed on a browser and the HTML tag structures of the HTML source file of the result page. Experimental results indicate that this technique can achieve very high extraction accuracy.
Energy ordering of catacondensed hexagonal systems
Authors: Juan Rada
Venue: Discrete Applied Mathematics (2005)

The energy of a graph G is defined as E(G) = Σi=1n |λi|, where λi (i = 1,..., n) are the eigenvalues of G. In this work we define the coalescence of two graphs with respect to (oriented) edges, and show that for the graphs X and Y in Fig. 2, which are obtained by coalescence of bipartite graphs around the six-vertex cycle C6, E(X)≥E(Y). As a by-product, we give energy ordering relations in the class of catacondensed hexagonal systems.
Deriving refactorings for AspectJ
Authors: Leonardo Cole, Paulo Borba
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

In this paper we present aspect-oriented programming laws that are useful for deriving refactorings for AspectJ. The laws help developers to verify if the transformations they define preserve behaviour. We illustrate that by deriving several AspectJ refactorings. We also show that our laws are useful for restructuring two Java applications with the aim of using aspects to modularize common crosscutting concerns.
A Novel Monte Carlo Noise Reduction Operator
Authors: Ruifeng Xu, Sumanta N. Pattanaik
Venue: IEEE Computer Graphics and Applications (2005)

We propose a novel Monte Carlo noise reduction operator in this article. We apply and extend the standard bilateral filtering method and build a new local adaptive noise reduction kernel. It first computes an initial estimate for the value of each pixel, and then applies bilateral filtering using this initial estimate in its range filter kernel. It is simple both in formulation and implementation. The new operator is robust and fast in the sense that it can suppress the outliers, as well as the interpixel incoherence in a noniterative way. It can be easily integrated into existing rendering systems as a postprocessing step. The results of our approach are compared with those of other methods. A GPU implementation of our algorithm runs in 500ms for a 512X512image.
Construction of association schemes from difference sets
Authors: Sejeong Bang, Mitsugu Hirasaka
Venue: European Journal of Combinatorics (2005)

Let H and F be two finite groups. In group theory it is known that an extension G of H by F is characterized by the action of F on H and a factor set associated with the action, and the two-dimensional cohomology group with respect to the action is defined when H is Abelian. In this paper we consider an analogy of the above for association schemes and construct such extensions of association schemes from a difference set when H is an elementary Abelian group.
Security issues in IEEE 802.11 wireless local area networks: a survey: Research Articles
Authors: Arunesh Mishra, Nick L. Petroni,  Jr., William A. Arbaugh, Timothy Fraser
Venue: Wireless Communications Mobile Computing (2004)

In the past few years, wireless networks, specifically those based on the IEEE 802.11 standard, have experienced tremendous growth. However, numerous security problems have dampened this growth. The IEEE and vendors sensitive to these issues began a wholesale redesign of the security architecture, while simultaneously producing measures for mitigating existing problems. In this paper, we describe the past and future security architectures as well as the problems and concerns with both. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Verification and change-impact analysis of access-control policies
Authors: Kathi Fisler, Shriram Krishnamurthi, Leo A. Meyerovich, Michael Carl Tschantz
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Sensitive data are increasingly available on-line through the Web and other distributed protocols. This heightens the need to carefully control access to data. Control means not only preventing the leakage of data but also permitting access to necessary information. Indeed, the same datum is often treated differently depending on context.System designers create policies to express conditions on the access to data. To reduce source clutter and improve maintenance, developers increasingly use domain-specific, declarative languages to express these policies. In turn, administrators need to analyze policies relative to properties, and to understand the effect of policy changes even in the absence of properties.This paper presents Margrave, a software suite for analyzing role-based access-control policies. Margrave includes a verifier that analyzes policies written in the XACML language, translating them into a form of decision-diagram to answer queries. It also provides semantic differencing information between versions of policies. We have implemented these techniques and applied them to policies from a working software application.
Will earlier projects plus a disciplined process enforce SE principles throughout the CS curriculum?
Authors: Linda B. Sherrell, Sajjan G. Shiva
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This paper discusses two related challenges faced by software engineering instructors. First, assuming that projects are necessary to produce successful computer science majors, what should be the role of projects and how best do we integrate theory and application? Second, what life cycle models and associated processes should students have the opportunity to experience, and where in the curriculum should a disciplined process first appear? We review several curriculum plans that have been employed to address these problems. We also offer recommendations based on our experiences both with undergraduate computer science majors and with high school students in project Tri-P-LETS, where beginning programming students are taught to develop games and software simulations following a process.
A Wireless Monitoring Approach for a HA-OSCAR Cluster Environment
Authors: M. A. R. Dantas, C. Rista
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

Cluster computing approach nowadays is an ordinary configuration found in many organizations to target requirements of high performance computing. The OSCAR (Open Source Cluster Application Resource) software environment is an interesting single system illusion (SSi) for the management of cluster of workstations (COW). This software environment has a new feature for high availability called as HA-OSCAR (High Availability-Open Source Cluster Application Resource). In this article we present a prototype implementation project which creates an extra facility to enhance the high availability scheme using a wireless LAN to monitor a HA-OSCAR cluster environment. Our experimental results indicate that the prototype can be considered as an interesting tool to efficiently monitor the configuration from mobile devices.
Silhouette and stereo fusion for 3D object modeling
Authors: Carlos Hernández Esteban, Francis Schmitt
Venue: Computer Vision and Image Understanding (2004)

In this paper, we present a new approach to high quality 3D object reconstruction. Starting from a calibrated sequence of color images, the algorithm is able to reconstruct both the 3D geometry and the texture. The core of the method is based on a deformable model, which defines the framework where texture and silhouette information can be fused. This is achieved by defining two external forces based on the images: a texture driven force and a silhouette driven force. The texture force is computed in two steps: a multi-stereo correlation voting approach and a gradient vector flow diffusion. Due to the high resolution of the voting approach, a multi-grid version of the gradient vector flow has been developed. Concerning the silhouette force, a new formulation of the silhouette constraint is derived. It provides a robust way to integrate the silhouettes in the evolution algorithm. As a consequence, we are able to recover the contour generators of the model at the end of the iteration process. Finally, a texture map is computed from the original images for the reconstructed 3D model.
A 3-D space-time motion detection for an invariant image registration approach in digital subtraction angiography
Authors: Y. Bentoutou, N. Taleb
Venue: Computer Vision and Image Understanding (2005)

A serious problem encountered in digital subtraction angiography (DSA) is the presence of artifacts due to patient motion. The resulting artifacts which arise from the misalignment of successive images in the sequence frequently reduce the diagnostic value of the images and lead to misdiagnosis or rejection of a DSA image sequence. A possible solution is the use of image registration techniques. In this paper, an invariant approach to elastic registration based on local similarity detection according to a combined invariants-based similarity measure, in which the images are locally registered and elastically interpolated, is presented. To improve the registration, a 3-D space time motion-detection technique for extracting movement point pairs in a sequence of X-ray images is proposed. It is shown that such a technique is very efficient to correct for both global and local motion artifacts. The proposed algorithm for this technique has been successfully applied to register several clinical data sets including coronary applications. The results show that a fast and accurate image registration is achieved and that the algorithm is robust, which makes it clinically applicable.
Visualization across the pond: how a wireless PDA can collaborate with million-polygon datasets via 9,000km of cable
Authors: Ian J. Grimstead, Nick J. Avis, David W. Walker
Venue: Proceedings of the tenth international conference on 3D Web technology (2005)

We present an initial report on using our distributed, collaborative grid enabled visualization environment to link SuperComputing 2004 (Pittsburgh, PA, USA) with the Cardiff School of Computer Science (Cardiff, Wales, UK). A PDA was used to visualize large, shared datasets (in the range of 0.5--4.5 million polygons) stored in Cardiff, interacting with a laptop (rendering the data locally). The system used was the Resource-Aware Visualization Environment (RAVE), deployed as Web Services running in the background on remote machines. This enables us to use a wide range of heterogeneous machines without being concerned with the underlying implementation of RAVE, or the architecture of the machine.
An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path
Authors: Nen-Chung Wang, Chih-Ping Chu
Venue: The Journal of Supercomputing (2005)

Multicasting is an important issue for numerous applications in parallel and distributed computing. In multicasting, the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we propose an efficient and deadlock-free tree-based multi-cast routing scheme for wormhole-routed star graph networks with hamiltonian path. In our proposed routing scheme, the router is with the input-buffer-based asynchronous replication mechanism that requires extra hardware cost. Meanwhile, the router simultaneously sends incoming flits on more than one outgoing channel. We perform simulation experiments with the network latency and the network traffic. Experimental results show that the proposed scheme reduces multicast latency more efficiently than other schemes.
Integrated modeling: the key to holistic understanding of the enterprise
Authors: Dursun Delen, Nikunj P. Dalal, Perakath C. Benjamin
Venue: Communications of the ACM (2005)

Current business modeling methods are one-dimensional. Here, an integrated modeling approach helps decision makers study the enterprise as a whole from multiple perspectives.
HYPER: A Hybrid Approach to Efficient Content-Based Publish/Subscribe
Authors: Rongmei Zhang, Y. Charlie Hu
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Publish/Subscribe (pub/sub) is an important paradigm for distributed content delivery. Traditionally, there have been two approaches to supporting pub/sub service: subject-based and content-based. Content-based pub/sub allows fine-grained expressiveness, and thus is a more attractive solution for content dissemination. However, the performance of a content-based pub/sub network is bounded by the expensive matching cost of content messages. In this paper, we propose a hybrid approach capable of minimizing both the matching and forwarding overhead within the pub/sub network and the delay experienced by clients receiving the content. The hybrid approach aims to eliminate redundant matching and forwarding inside the pub/sub network. In particular, it identifies a number of virtual groups by exploring common subscription interests among clients, and messages for each virtual group are only matched once at the group entry point. In addition, for each virtual group, the content delivery tree embedded in the underlying pub/sub network can benefit from shortcutting forwarding-only paths. Simulations have shown that the hybrid approach is highly effective in improving the service efficiency and quality of a content-based pub/sub system.
The SDVM - An Approach for Future Adaptive Computer Clusters
Authors: Jan Haase, Frank Eschmann, Klaus Waldschmidt
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 16 - Volume 17 (2005)

The Self Distributing Virtual Machine (SDVM) is a parallel computing machine which consists of a cluster of customary computers. The participating machines may have different computing speed or actually different operating systems, and any network topology between them is supported. As the SDVM supports dynamic entry and exit at runtime, the cluster may even grow or shrink without disturbing the program flow. Among other features, the SDVMfeatures decentralized scheduling and automatic distribution of data and program code throughout the cluster. Therefore machines need no prerequisites apart from the SDVM daemon itself to join the cluster. The concept of the SDVM is implemented for the field of computer clusters (extensible to grid computing like the internet), but it can be designed for multi-processor-systems or Systems-on-Chip (SoC) as well. This paper presents the properties and the structure of the SDVM.
Improved estimation for just-noticeable visual distortion
Authors: X. H. Zhang, W. S. Lin, P. Xue
Venue: Signal Processing (2005)

Perceptual visibility threshold estimation, based upon characteristics of the human visual system (HVS), has wide applications in digital image/video processing. An improved scheme for estimating just-noticeable distortion (JND) is proposed in this paper. It is proved to outperform the DCTune model, with the major contributions of a new formula for luminance adaptation adjustment and the incorporation of block classification for contrast masking. The HVS visibility threshold for digital images exhibits an approximately parabolic curve versus gray levels and this has been formulated to yield a more accurate base threshold. Moreover, edge regions have been differentiated via block classification to effectively avoid over-estimation of JND in the said regions. Experiments with different images and the associated subjective tests show improved performance of the proposed scheme over the DCTune model for luminance adaptation (especially in dark regions) and masking effect in edge regions. Our model has further demonstrated to achieve favorable results in perceptual visual distortion gauge and image compression. The improvement in JND estimation facilitates better visual distortion measurement and visual signal compression.
The "Bubble" Technique: Interacting with Large Virtual Environments Using Haptic Devices with Limited Workspace
Authors: Lionel Dominjon, Anatole Lecuyer, Jean-Marie Burkhardt, Guillermo Andrade-Barroso, Simon Richir
Venue: Proceedings of the First Joint Eurohaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2005)

The "Bubble" technique is a novel interaction technique to interact with large Virtual Environments (VE) using a haptic device with a limited workspace. It is based on a hybrid position/rate control which enables both accurate interaction and coarse positioning in a large VE. The haptic workspace is displayed visually using a semi-transparent sphere (looking like a bubble) that surrounds the manipulated cursor. When the cursor is located inside the bubble, its motion is position-controlled. When the cursor is outside, it is rate-controlled. The user may also "feel" the inner surface of the bubble, since the spherical workspace is "haptically" displayed by applying an elastic force-feedback when crossing the surface of the bubble.
A game approach to production, storage, and marketing problems
Authors: Yu. I. Paraev
Venue: Automation and Remote Control (2005)

Dynamic control of production, storage, and marketing processes is regarded as a cooperative game or as a two-criteria optimal control problem. The problem is solved under the assumption that producer controls production and consumer, buying process. Necessary conditions for the producer and buyer to have a positive profit are formulated.
New Modeling Techniques in Multi-Space CAD
Authors: Jinxiang Ying, Guanlong Chen, Zhongqin Lin
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

This paper investigates new wavelet-based multiresolution modeling techniques in CAD. MRA techniques are extended to detail feature transplanting and detail feature copying from previous MRA editing including sweep editing, fractional editing, synthesis editing and detail blending. Two new editing methods called detail feature transplanting and detail feature copying are added to previous sweep editing, fractional editing, synthesis editing and detail blending. Detail feature transplanting editing is a way to transplant detail features of a curve/surface to another curve/surface. Detail feature copying editing is a way to copy or move detail features on the same curve/surface.
A 10 GHz 4:1 MUX and 1:4 DEMUX implemented by a Gigahertz SiGe FPGA for fast ADC
Authors: Jong-Ru Guo, Chao You, Kuan Zhou, Michael Chu, Peter F. Curran, Jiedong Diao, Bryan Goda, Russell P. Kraft, John F. McDonald
Venue: Integration, the VLSI Journal (2005)

This paper describes the implementation of a scalable SiGe FPGA that serves as an interleaving and deinterleaving block in a high-speed reconfigurable data acquisition system. In this paper, the different generations of SiGe configurable blocks (Basic Cells(BC)) evolved from the Xilinx 6200 are presented and measured. The latest generation has a 94% reduction in power consumption (from 71 to 4.2mW) and an 82.5% reduction of the propagation delay (from 238 to 42 ps) compared to the first generation design. To demonstrate the SiGe FPGA's capabilities of handling gigahertz signals, the SiGe FPGAs configured as the 4:1 multiplexer and 1:4 demultiplexer were designed to run at 10 Gbps. The comparisons between the SiGe and CMOS FPGAs are also provided. With these design results, the SiGe FPGA is able to process gigahertz signals such as S and K microwave bands.
Tool Demonstration: JIVE and JOVE: Java as it Happens
Authors: Steven P. Reiss, Emmanuel Manos Renieris
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

Dynamic software visualization is designed to provide programmers with insights as to what the program is doing. Most current visualizations either use program traces to show information about prior runs, slow the program down substantially, show only minimal information, or force the programmer to indicate when to turn visualizations on or off. We have developed a dynamic Java visualizer that provides a statement-level view of a Java program in action with low enough overhead so that it can be used almost all the time by programmers to understand what their program is doing while it is doing it.