ppxscal/embedding_network huggingface dataset:
Generation and Visualization of 3-D Realistic Natural Terrain Based on FBM
Authors: Qing-Zhong Li, Xiu-Rong Gao
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

Based on fractal Brownian motion (FBM) model this paper presents a method for generating controllable and predictable natural terrains. The whole base-plane of the terrain to be simulated is first divided into several triangles by using the coordinates of limited known characteristic points on the plane. And then for each triangle, the three dimensional data of the simulated terrain are recursively generated according to a subdividing criterion based on the modified random midpoint displacement (RMD) method. Finally, the realistic visualization of the generated terrain data is implemented with PC computer by using VC++6.0 and OpenGL software programming. The simulation results show that the proposed algorithm provides a good performance in generating various terrains such as multi-peak mountains, general flat terrains, and complex combined terrains in divinable and controllable manner; and it is a better solution to the shape uncontrollable problem encountered in the traditional FBM based methods for modeling natural terrains.
An empirical study of slice-based cohesion and coupling metrics
Authors: Timothy M. Meyers, David Binkley
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2007)

Software reengineering is a costly endeavor, due in part to the ambiguity of where to focus reengineering effort. Coupling and Cohesion metrics, particularly quantitative cohesion metrics, have the potential to aid in this identification and to measure progress. The most extensive work on such metrics is with slice-based cohesion metrics. While their use of semantic dependence information should make them an excellent choice for cohesion measurement, their wide spread use has been impeded in part by a lack of empirical study. Recent advances in software tools make, for the first time, a large-scale empirical study of slice-based cohesion and coupling metrics possible. Four results from such a study are presented. First, &ldquo;head-to-head&rdquo; qualitative and quantitative comparisons of the metrics identify which metrics provide similar views of a program and which provide unique views of a program. This study includes statistical analysis showing that slice-based metrics are not proxies for simple size-based metrics such as lines of code. Second, two longitudinal studies show that slice-based metrics quantify the deterioration of a program as it ages. This serves to validate the metrics: the metrics quantify the degradation that exists during development; turning this around, the metrics can be used to measure the progress of a reengineering effort. Third, baseline values for slice-based metrics are provided. These values act as targets for reengineering efforts with modules having values outside the expected range being the most in need of attention. Finally, slice-based coupling is correlated and compared with slice-based cohesion.
Wireless Dynamic Token Protocol for MANET
Authors: Xianpu Sun, Yanling Zhang, Jiandong Li
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

A novel multiple access control protocol for MANET, named wireless dynamic token protocol (WDTP), is presented in this paper which is based on the Wireless Token Ring protocol (WTRP). In WDTP, The token dynamic transfer algorithm, which is similar to the traversal of graph by depth first search, is proposed to substitute the method of token transfer in WTRP to control the token transfer. With this proposed algorithm, the path that the token passing through can be adjusted automatically corresponding to the subnet's dynamic topology and has not to be a ring. Furthermore, the operation of token path maintenance is simplified and the channel efficiency is increased also in WDTP. The result of the simulation identified that WDTP can make the average number of nodes in each subnet be maximized in any network topology, so the adaptability to network topology is improved and the throughput is increased.
Load Distribution Method and Admission control for Streaming Media QoS in Distributed Transcoding Servers
Authors: Nansook Heo, Dongsun Lim, Dongmahn Seo, Inbum Jung, Yoon Kim
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

The recent advance in wireless network technologies has enabled the streaming media service on the mobile devices such as PDAs and cellular phones. Since the wireless network has low bandwidth channels and mobile devices are actually composed of limited hardware specifications, the transcoding technology is needed to adapt streaming media to the given mobile devices. When large scale mobile clients demand the streaming service, load distribution Methods among transcoding servers highly impact on the total number of QoS streams. In this paper, the resource weighted load distribution Method is proposed for the fair load distribution and the more scalable performance in distributed transcoding servers. Our proposed Method is based on the weight of resources consumed for transcoding to classified client grades and the maximum number of QoS streams actually measured in transcoding servers. The proposed policy is implemented on distributed transcoding system. In experiments, we evaluate its fair load distribution and scalable performance according to the increase of transcoding servers.
The illusion of security
Authors: David Wright, Michael Friedewald, Wim Schreurs, Michiel Verlinden Serge Gutwirth, Yves Punie, Ioannis Maghiros, Elena Vildjiounaite, Petteri Alahuhta
Venue: Communications of the ACM (2008)

A fictional scenario of daily life in a world networked with ambient intelligence illustrates the dark side of the technology and the need for appropriate safeguards.
Sequential Hierarchical Scene Matching
Authors: R. Y. Wong
Venue: IEEE Transactions on Computers (1978)

The general approach to matching two scenes by a digital computer is usually costly in computations. A match is determined by selecting the position of maximum cross correlation between the window and each possible shift position of the search region. A new approach which is logarithmically efficient is presented in this paper. Its logarithmic efficiency and computational savings will be demonstrated both theoretically and in practical examples. Experimental results are presented for matching an image region corrupted by noise and for matching images from optical and radar sensors. The significance of this approach is that scene matching can be accomplished by the use of a computer even in cases which are difficult for humans or standard correlation techniques, and can be accomplished with greatly reduced computations.
Considerations for the design of exergames
Authors: Jeff Sinclair, Philip Hingston, Martin Masek
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

Exergaming is the use of video games in an exercise activity. In this paper we consider game design for successful exergames. To do this, we review the history of exergaming and the current state of research in this field. We find that there exists some research aimed at evaluating the physical and health characteristics of exergames, but research on how to design exercise games is still in the early stages. From an analysis of this information, and drawing on established principles from sports science for the prescription of exercise programs, we then attempt to identify success factors to guide designers of exergaming systems.
Stochastic extended Krylov subspace method for variational analysis of on-chip power grid networks
Authors: Ning Mi, Sheldon X.-D. Tan, Pu Liu, Jian Cui, Yici Cai, Xianlong Hong
Venue: Proceedings of the 2007 IEEE/ACM international conference on Computer-aided design (2007)

In this paper, we propose a novel stochastic method for analyzing the voltage drop variations of on-chip power grid networks with log-normal leakage current variations. The new method, called StoEKS, applies Hermite polynomial chaos (PC) to represent the random variables in both power grid networks and input leakage currents. But different from the existing Hermit PC based stochastic simulation method, extended Krylov subspace method (EKS) is employed to compute variational responses using the augmented matrices consisting of the coefficients of Hermite polynomials. Our contribution lies in the combination of the statistical spectrum method with the extended Krylov subspace method to fast solve the variational circuit equations for the first time. Experimental results show that the proposed method is about two-order magnitude faster than the existing Her-mite PC based simulation method and more order of magnitudes faster than Monte Carlo methods with marginal errors. StoEKS also can analyze much larger circuits than the exiting Hermit PC based methods.
MaramaTatau: Extending a Domain Specific Visual Language Meta Tool with a Declarative Constraint Mechanism
Authors: Na Liu, John Hosking, John Grundy
Venue: Proceedings of the IEEE Symposium on Visual Languages and Human-Centric Computing (2007)

It is increasingly common to use metatools to specify and generate domain specific visual language tools. A common problem for such metatools is specification of model level behaviours, such as constraints and dependencies. These often need to be specified using conventional code in the form of event handlers or the like. We report our experience in integrating a declarative constraint/dependency specification mechanism into a domain specific visual language metatool, focussing on the tradeoffs we have made in the notational design and environmental support used. The expressive power of the mechanism developed is illustrated by a substantial case study where we have redeveloped a complex visual tool for architectural modelling, eliminating conventional event handlers.
lightweight decentralized authorization model for inter-domain collaborations
Authors: Hannah K. Lee, Heiko Luedemann
Venue: Proceedings of the 2007 ACM workshop on Secure web services (2007)

Inter-domain collaborations comprise of a series of tasks, whose run-time environment stretches over heterogeneous systems governed by different set of policies and where participating organizations desire to preserve control over their resources. One of the major security challenges in modeling those inter-domain collaborations is providing a decentralized authorization solution. At the core of this challenge lie two problems: 1) an authorization decision maker does not know who a principal is and 2) which set of privileges this principal owns if the principal is originated from outside of the decision maker's domain. Currently, a number of different approaches tackle this problem and claim to provide a full-fledged solution. These approaches, however, often require particular use of infrastructures and their own policy languages. In this paper, we propose a lightweight model using the concept of distributed roles from the dRBAC model to bridge different domain boundaries. Based on e-Government collaboration scenarios, we identify a set of requirements of decentralized authorization and propose an extension to the current XACML specification as a realization of our model.
Fault Dictionary Based Scan Chain Failure Diagnosis
Authors: Ruifeng Guo, Yu Huang, Wu-Tung Cheng
Venue: Proceedings of the 16th Asian Test Symposium (2007)

In this paper, we present a fault dictionary based scan chain failure diagnosis technique. We first describe a technique to create small dictionaries for scan chain faults by storing differential signatures. Based on the differential signatures stored in a fault dictionary, we can quickly identify single stuck-at fault or timing fault in a faulty chain. We further develop a novel technique to diagnose some multiple stuck-at faults in a single scan chain. Comparing with fault simulation based diagnosis technique, the proposed fault dictionary based diagnosis technique is up to 130 times faster with same level of diagnosis accuracy and resolution.
HomologMiner
Authors: Minmei Hou, Piotr Berman, Chih-Hao Hsu, Robert S. Harris
Venue: Bioinformatics (2007)

Motivation: Complex genomes contain numerous repeated sequences, and genomic duplication is believed to be a main evolutionary mechanism to obtain new functions. Several tools are available for de novo repeat sequence identification, and many approaches exist for clustering homologous protein sequences. We present an efficient new approach to identify and cluster homologous DNA sequences with high accuracy at the level of whole genomes, excluding low-complexity repeats, tandem repeats and annotated interspersed repeats. We also determine the boundaries of each group member so that it closely represents a biological unit, e.g. a complete gene, or a partial gene coding a protein domain. Results: We developed a program called HomologMiner to identify homologous groups applicable to genome sequences that have been properly marked for low-complexity repeats and annotated interspersed repeats. We applied it to the whole genomes of human (hg17), macaque (rheMac2) and mouse (mm8). Groups obtained include gene families (e.g. olfactory receptor gene family, zinc finger families), unannotated interspersed repeats and additional homologous groups that resulted from recent segmental duplications. Our program incorporates several new methods: a new abstract definition of consistent duplicate units, a new criterion to remove moderately frequent tandem repeats, and new algorithmic techniques. We also provide preliminary analysis of the output on the three genomes mentioned above, and show several applications including identifying boundaries of tandem gene clusters and novel interspersed repeat families. Availability: All programs and datasets are downloadable from www.bx.psu.edu/miller_lab Contact: mhou@cse.psu.edu
Neural Evidence Integration Model and Its Application
Authors: Shouzhi Wei, Ningde Jin, Hui Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

The oilfield remaining oil distribution forecast is called world-level difficult problems by oil domain specialists in the world. The source of low forecast correctness are only consider objective evidences or subjective evidence, so the forecast results still exist limitation, it result in low accuracy, reliability and so on to identify the classification characteristics and to compute quantitative parameters. So, how to fuse all objective evidences and subjective evidences is a key problem to research remaining oil distribution. A new model is proposed, it integrated BP neural networks combination models and two-level D-S evidence reasoning models, the exact classification results are implemented about many remaining oil distribution characteristics. The classification output reliability of each BP network and the reasoning result reliability of each domain fuzzy expert system are regarded as basic probability assignment of input evidence in D-S evidence reasoning model. The model has applied successfully in Daqing Oilfield of China.
A Novel Epsilon-Dominance Multi-objective Evolutionary Algorithms for Solving DRS Multi-objective Optimization Problems
Authors: Liu Liu, Minqiang Li, Dan Lin
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

A new kind of multiobjective optimization model is constructed in this paper, which contains various solutions apart from the true Pareto-optimums but hardly dominated. These solutions are defined as dominance resistant solutions (DRSs). It is proved that the evolutionary algorithms based on Paretodominance relationship fail to find the true Pareto fronts for the DRS MOP. Hence a new algorithm based on \varepsilon -dominance relationship, called \varepsilon -dominance MOEA( EDMOEA), is proposed to improve the DRSs in population effectively. Finally, experiments on a set of DRS MOOPs and other regular test functions are conducted, the EDMOEA outperforms the NSGA-II, and can be applied easily to complex multiobjective optimization problems.
Graph-based Object Tracking Using Structural Pattern Recognition
Authors: Ana B. V. Graciano, Roberto M. Cesar-Jr., Isabelle Bloch
Venue: Proceedings of the XX Brazilian Symposium on Computer Graphics and Image Processing (2007)

This paper proposes a model-based methodology for recognizing and tracking objects in digital image sequences. Objects are represented by attributed relational graphs (or ARGs), which carry both local and relational information about them. The recognition is performed by inexact graph matching, which consists in finding an approximate homomorphism between ARGs derived from an input video and a model image. Searching for a suitable homomorphism is achieved through a tree-search optimization algorithm and the minimization of a pre-defined cost function. Motion smoothness between successive frames is exploited to achieve the recognition over the whole sequence, with improved spatio-temporal coherence.
Webview selection from user access patterns
Authors: Samia Saidi, Yahya Slimani, Khedija Arour
Venue: Proceedings of the ACM first Ph.D. workshop in CIKM (2007)

The number of Web Usage Mining (WUM) applications is growing continuously, especially due to the business interest in e-commerce Web sites and the related Web-marketing applications.The application of WUM results goes beyond the subject of our thesis since one important part of our thesis deals with the problem of selection of WebViews using technicsof WUM. View materialization is an important issue ifwe want to improve the efficiency of many applications likeOLAP, Database and Web applications. In this proposal wesuggest a novel approach for selecting webviews to be materialized in order to optimize the response time of web queries since satisfying the needs of users is vital for Web sites. The selection of Webviews to be materialized was mainly based on the estimation of metrics requiring hard collects of multiple statistics [10] that's why, we believe on a solution based on mining an interesting set of webviews to be materialized from realistic data: Web log files. Thus, Web log files will be parsed, analyzed and treated to give a set of webviews, based on frequent closed itemsets.
Locating Charts from Scanned Document Pages
Authors: W. Huang, C.-L. Tan
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

This paper presents our work on automatically locating charts from document pages, which is an important stage in our chart image recognition and understanding system currently being developed. To achieve this, there are two sub-goals to be reached: locating figure blocks in a given document image, and building a classifier to differentiate charts from non- chart figures. For the first sub-goal, besides traditional logical block labelling, relevant text blocks such as text descriptions and labels in a figure must be included in the located figure blocks to facilitate the interpretation processes in the following stages. For the second sub- goal, we propose a set of simple statistical features for building the classifier. We tested our system with the entire collection of scanned journal pages in the University of Washington database I. The experimental results are discussed in this paper.
On Graphs Whose Spectral Radius is Bounded by 3/2 √2
Authors: Renee Woo, Arnold Neumaier
Venue: Graphs and Combinatorics (2007)

The structure of graphs whose largest eigenvalue is bounded by 3/2 &radic;2 (≆2.1312) is investigated. In particular, such a graph can have at most one circuit, and has a natural quipu structure.
High-quality high-k HfON formed with plasma jet assisted PVD process and application as tunnel dielectric for flash memories
Authors: Yanxiang Liu, Sun Il Shim, X. W. Wang, Lurng-Shehng Lee, Ming-Jinn Tsai, T. P. Ma
Venue: Microelectronic Engineering (2008)

We demonstrate low-trap-density HfON film made by the molecular-atomic deposition (MAD) technique, which is an Ar/N"2 plasma jet assisted physical vapor deposition process. This high-k HfON can be deposited on top of the nearly trap-free MAD-Si"3N"4 to form a single-side crested tunnel barrier. The Al/(HfON-Si"3N"4)/Si capacitor structure with HfON/Si"3N"4 stack as the tunnel barrier demonstrates steeper I-V slope than that of a single layer SiO"2 with the same EOT, and is readily applicable to improve the programming speed and data retention of flash memories.
Extended abstract: a race-free hardware modeling language
Authors: P. Schaumont, Sandeep Shukla, I. Verbauwhede
Venue: Proceedings of the 2nd ACM/IEEE International Conference on Formal Methods and Models for Co-Design (2005)

We describe race-free properties of a hardware description language called GEZEL. The language describes networks of cycle-true finite-state-machines with datapaths (FSMDs). We derive a set of four rules under which a network of such FSMDs satisfies the Kahn principle. When applying those rules, GEZEL programs will be determinate and a designer will thus obtain race-free hardware. We define extended FSMD networks as FSMD networks for which some components are user-defined and not specified as FSMDs. An important result is that the determinate properties of the FSMD network are also valid for the extended FSMD network provided that the user-defined components are determinate. Most hardware description languages do not have this determinacy. Their simulation semantics are dependent on simulator implementation, and on a run-time race resolution mechanism. We therefore position GEZEL as a model of computation that RTL designers should have in mind while creating RTL models. In fact, we can generate SystemC and other HDL code from GEZEL models, thereby guaranteeing the determinacy in the generated HDL code.
Speckle reduction using the discrete Fourier filtering technique
Authors: Jonathan Maycock, Bryan M. Hennelly, John B. McDonald, Yann Frauel, Albertina Castro, Bahram Javidi, Thomas J. Naughton
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

We present a digital signal processing technique that reduces the speckle content in reconstructed digital holograms. The method is based on sequential sampling of the discrete Fourier transform of the reconstructed image field. The resulting images show a reduction in speckle.
An Efficient and Universal Security Architecture of Implementing IPSec in Broadband Router
Authors: Xiaozhuo Gu, Jianzu Yang, Jing Yu, Julong Lan
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

With the demand of providing data security and integrity, IPSec is implemented in hardware of router to accelerate processing speed. After analyzing advantages and disadvantages of two traditional security architectures, Look-aside architecture and FlowThrough architecture, we propose parallel security processing architecture to achieve better time efficiency. This parallel security architecture adopts mechanism of processing IP packets and IPSec packets simultaneously, which optimizes the processing flow and improves the processing efficiency. The design of parallel security architecture is based on universal architecture of broadband, thus requires minimal change of hardware architecture when implemented in broadband router. Testing results based on SR1880s routers demonstrate that the proposed parallel security architecture is efficient and satisfies the security need of broadband networks.