ppxscal/embedding_network huggingface dataset:
Optimal Sensor Placement for Damage Detection: Role of Global Search
Authors: Prakash Kripakaran, Sandro Saitta, Suraj Ravindran, Ian F. C. Smith
Venue: Proceedings of the 18th International Conference on Database and Expert Systems Applications (2007)

Optimal sensor placement is one that maximizes the likelihood of identifying future damage models. Based on assumptions from engineers, damage models of a structure are simulated and their predictions are computed. Computational approaches are used to place sensors at locations that maximize the chances of identifying damage. This paper studies the application of global search for optimal sensor placement. The global search methodology uses stochastic sampling to find optimal locations for sensors. In a previous study, Robert-Nicoud et al. proposed a greedy strategy that places sensors sequentially at locations where model predictions have maximum entropy. Performance of the two strategies are compared for the Schwandbach bridge in Switzerland. The results show that global search is better for designing measurement systems on a previously unmonitored structure while the greedy algorithm is better for incremental measurement-interpretation strategies.
To CMP or not to CMP: analyzing packet classification on modern and traditional parallel architectures
Authors: Randy Smith, Dan Gibson, Shijin Kong
Venue: Proceedings of the 3rd ACM/IEEE Symposium on Architecture for networking and communications systems (2007)

Packet classification is central to modern network functionality, yet satisfactory memory usage and performance remains elusive at the highest speeds. The recent emergence of low-cost, highly parallel architectures provides a promising platform on which to realize increased classification performance. We analyze two classic algorithms (ABV and HiCuts) in multiple parallel contexts. Our results show that performance depends strongly on many factors, including algorithm choice, hardware platform, and parallelization scheme. We find that there is no clear "best solution," but in the best cases hardware constraints are mitigated by the parallelization scheme and vice versa, yielding near-linear speedups as the degree of parallelization increases.
A Nonlinear Contour Preserving Transform for Geometrical Image Compression
Authors: W. Van Aerschot, M. Jansen, A. Bultheel
Venue: Proceedings of the International Machine Vision and Image Processing Conference (2007)

Recently the performance of nonlinear transforms have been given a lot of attention to overcome the suboptimal nterms approximation power of tensor product wavelet methods on higher dimensions. The suboptimal performance prevails when those transforms are used for a sparse representation of functions consisting of smoothly varying areas separated by smooth contours. This paper introduces a method creating normal meshes with nonsubdivision connectivity to approximate the nonsmoothness of such images efficiently. From a domain decomposition viewpoint, the method is a triangulation refinement method preserving contours. The so-called normal offset decomposition searches from the midpoint of the edges in the previous approximation along the normal direction until it pierces the surface that represents the image and adds the piercing points to the approximation. The transform is nonlinear as it depends on the actual image. In this paper, we propose a normal offset based compression algorithm for digital images. The discrete setting causes the transform to become redundant. We also propose a model to encode the obtained coefficients. We show rate distortion curves and compare the results with the JPEG2000 encoder.
An approach to XML path matching
Authors: Alexander R. Vinson, Carlos A. Heuser, Altigran S. da Silva, Edleno S. de Moura
Venue: Proceedings of the 9th annual ACM international workshop on Web information and data management (2007)

In applications that accomplish XML data integration and XML instance querying, the problem of XML path matching plays a central role. This paper presents an approach for matching XML paths that consists of (1) PathSim, a similarity function specifically designed for matching XML paths and (2) a set of pre-processing functions to be applied to XML paths that are to be compared by a similarity function. The reported experiments demonstrate that PathSim achieves matches of higher quality than a similarity function for XML paths found in literature. The experiments further show that matches of higher quality are achieved when the proposed pre-processing functions are employed.
A Synopsis Model for Deterministic Behavioral Specifications of an Adaptable Agent
Authors: Dussadee Praserttitipong, Peraphon Sophatsathit
Venue: Proceedings of the 5th ACIS International Conference on Software Engineering Research, Management & Applications (2007)

This paper proposes a deterministic behavioral approach that encompasses a service discovery model addressing service specifications and matchmaking processes. For service specifications, a synopsis of deterministic intention specification is nominated. Instead of using narrative description, the synopsis is formulated based on behavioral specifications and described by graphical representations to enable visual matching between service intention and advertised specifications. Moreover, an inequivalent matchmaking of this synopsis visualization model is also proposed as a means to investigate and assess various essential characteristic matchings between incomplete intention specification and complete service advertisement.
High-dimensional OLAP: a minimal cubing approach
Authors: Xiaolei Li, Jiawei Han, Hector Gonzalez
Venue: Proceedings of the Thirtieth international conference on Very large data bases - Volume 30 (2004)

Data cube has been playing an essential role in fast OLAP (online analytical processing) in many multi-dimensional data warehouses. However, there exist data sets in applications like bioinformatics, statistics, and text processing that are characterized by high dimensionality, e.g., over 100 dimensions, and moderate size, e.g., around 106 tuples. No feasible data cube can be constructed with such data sets. In this paper we will address the problem of developing an efficient algorithm to perform OLAP on such data sets. Experience tells us that although data analysis tasks may involve a high dimensional space, most OLAP operations are performed only on a small number of dimensions at a time. Based on this observation, we propose a novel method that computes a thin layer of the data cube together with associated value-list indices. This layer, while being manageable in size, will be capable of supporting flexible and fast OLAP operations in the original high dimensional space. Through experiments we will show that the method has I/O costs that scale nicely with dimensionality. Furthermore, the costs are comparable to that of accessing an existing data cube when full materialization is possible.
The ChoicePoint Dilemma: How Data Brokers Should Handle the Privacy of Personal Information
Authors: Paul N. Otto, Annie I. Anton, David L. Baumer
Venue: IEEE Security and Privacy (2007)

Before 2005, data broker ChoicePoint suffered fraudulent access to its databases, exposing thousands of customers' personal information. This article examines ChoicePoint's data breach, explores what went wrong from the perspective of consumers, executives, policy, and IT systems, and offers recommendations for the future.
A study on the usage of cross-layer power control and forward error correction for embedded video transmission over wireless links
Authors: Fabrizio Granelli, Cristina E. Costa, Aggelos K. Katsaggelos
Venue: Advances in Multimedia (2007)

Cross-layering is a design paradigm for overcoming the limitations deriving from the ISO/OSI layering principle, thus improving the performance of communications in specific scenarios, such as wireless multimedia communications. However, most available solutions are based on empirical considerations, and do not provide a theoretical background supporting such approaches. The paper aims at providing an analytical framework for the study of single-hop video delivery over a wireless link, enabling cross-layer interactions for performance optimization using power control and FEC and providing a useful tool to determine the potential gain deriving from the employment of such design paradigm. The analysis is performed using rate-distortion information of an embedded video bitstream jointly with a Lagrangian power minimization approach. Simulation results underline that cross-layering can provide relevant improvement in specific environments and that the proposed approach is able to capitalize on the advantage deriving from its deployment.
Empirical Data Reference Behavior in Data Base Systems
Authors: J. Rodriguez-Rosell
Venue: Computer (1976)

During the past several years a considerable amount of effort has gone into the measurement, analysis, and modeling of program behavior. Most of the work either assumes the existence of a reference string, which is then used in various ways, or attempts to produce a model for the process by which such reference strings are generated. With very few exceptions the reference strings that have been measured characterize virtual memory utilization, reflecting the fact that the motivating force behind these research activities is the desire to understand the behavior of virtual memory paging systems.
Research on Fault Fuzzy Clustering Method for Reducing False Alarm by New Three States Demarcation
Authors: Shunming Li, Xianglei Chu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Reducing false alarm have important signification for accurate diagnosis of equipments' faults. The classification of Built in Test is introduced in the paper. Then the equipments status is redefined to three kinds of state (namely as fault state, quasi fault state, health state). Among them, the intermittent fault, transient fault, and the critical fault are included in the quasi fault. The 3-state Markov model is contrasted and analyzed with 2-state Markov model on theory. The advantage to divide the equipments status as new three kinds of states is pointed out. Joining together the method of fuzzy clustering theories, running fault condition of rotor system are classified and identified. The intermittence fault and transient fault of rotor are successfully separated on the verifying platform. It is show by computation and analysis that the method of judging the threshold value of the equipments status is viable by choosing the F- statistic. The method introduced in the paper has important reference value for reducing false alarm of the equipment.
Efficient Broadcast Scheduling Based on Hybrid Fuzzy Hopfield Network for Ad Hoc Networks
Authors: Xi-zheng Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

Due to the mutual interference and sharing of wireless links in TDMA Ad hoc networks, conflicts will occur when data message are transmitting between nodes. The broadcast scheduling problem (BSP) is aim to schedule each node in different slot of fixed length frame at least once, and the objective of BSP is to seek for the optimal feasible solution, which has the shortest length of frame slots as well as the maximum node transmission. In this paper, we propose a two stage hybrid algorithm based on fuzzy hopfield neural network to solve this BSP in Ad hoc. In the first stage, we use a modified sequential vertex coloring algorithm to obtain a minimal TDMA frame length. Experimental results, obtained from the running on three benchmark graph, show that our algorithm can achieve better performance with shorter frame length and higher channel utilizing ratio than other exit BSP solutions.
An Investigation of Human Factors in Software Development
Authors: V. R. Basili
Venue: Computer (1979)

The effects of human factors on "high-level" software properties-too intangible to quantify directly-can be inferred from the collective behavior of related "low-level" aspects.
Techniques for tuning workflows in cluster environments
Authors: B. L. Tierney, D. K. Gunter
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

An important class of parallel processing jobs on clusters today are workflow-based applications that process large amounts of data in parallel. Traditional cluster performance tools are designed for tightly coupled parallel jobs, and not as effective for this type of application. We describe how the NetLogger Toolkit methodology is more appropriate for this class of cluster computing, and describe our new automatic workflow anomaly detection component. We also describe how this methodology is being used by the Nearby Supernova Factory (SNfactory) project at Lawrence Berkeley National Laboratory.
Identify LD blocks based on hierarchical spatial data
Authors: Makoto Tomita, Masahiro Hatsumichi, Koji Kurihara
Venue: Computational Statistics Data Analysis (2008)

A domain where recombination does not occur often, yet maintained linkage disequilibrium exists on DNA sequence is known as a ''haplotype block'' or ''LD block''. Many methods are available to identify LD blocks using disequilibrium parameters, such as the well-known Gabriel's method, Zhu's method and so on. We considered that Echelon analysis can be applied to identify LD block, and report herein that LD blocks can be identified according to our new method applying Echelon analysis. The results of numerical examples are also provided.
RDMA-based and SMP-aware Multi-port All-Gather on Multi-rail QsNet^II SMP Clusters
Authors: Ying Qian, Ahmad Afsahi
Venue: Proceedings of the 2007 International Conference on Parallel Processing (2007)

Clusters of Symmetric Multiprocessors (SMP) are more commonplace than ever in achieving high-performance. Scientific applications running on clusters employ collective communications extensively. Using shared memory communication among colocated processes on SMP nodes as well as Remote Direct Memory Access (RDMA) operations for internode communication and trying to overlap them is a proven technique in boosting the performance of collective operations. The effect is much more pronounced when efficient multi-port collectives on multi-rail networks are devised and implemented. In this work, we design and implement multi-port RDMA-based and SMP-aware all-gather algorithms with message striping over multi-rail QsNet^II directly at the Elan level. We compare our algorithms against RDMA-only traditional algorithms and the native elan_gather(). Our performance results indicate that the proposed SMP-aware Bruck all-gather gains an improvement of up to 1.96 for 4KB messages over the native elan_gather(). Meanwhile, the Direct algorithm achieves up to 1.49 improvement for 32KB messages.
Proceedings of the 2007 conference of the center for advanced studies on Collaborative research
Venue: IBM Centre for Advanced Studies Conference (2007)

Welcome to CASCON 2007! Each October we gather the foremost thought leaders from around the world together for CASCON, the annual conference on computer science technologies and research, hosted by the IBM Toronto Centre for Advanced Studies. Now, for the seventeenth year, CASCON (CAS Conference) is the showcase event of the year for CAS and the IBM Toronto Lab. With over 1500 attendees, this "Meeting of Minds" has evolved into a comprehensive forum that addresses questions and developments surrounding technology at large. CASCON, sponsored by the IBM Toronto Lab and CAS, in partnership with the National Research Council Canada is where innovations from the academic, public and industrial sectors converge. While CASCON has grown into an international conference, it is still the key event in Canada where important contacts are made and valuable alliances are formed. This year's conference brings an exciting mix of keynote and Frontiers of Software Practice (FoSP) plenary sessions, papers presentations, workshops, demos, and posters, and promises to be a catalyst for new ideas and collaboration. Each aspect of the conference is a result of the efforts of the many CASCON organizers and all of the participants of CASCON 2007, and we thank them for their time, enthusiasm, and commitment to innovation and collaboration. The 18 full and 12 short papers presented in this year's proceedings were selected from an impressive set of submissions from around the world. The program committee led by co-chairs, Bruce Spencer, of the National Research Council Canada, and Margaret-Anne Storey, of the University of Victoria, spent many hours soliciting high quality papers, ensuring expert reviews of each paper, and making the difficult selection of which papers would be presented at the conference and published in the proceedings. Our thanks to them and to the members of the Program Committee for their diligence and integrity. As with previous years, CASCON proceedings are also available online in the ACM Digital Library http://www.acm.org/ Also included here are the proceedings from the CAS Dublin Software and Systems Engineering Symposium 2007, which occurs on Wednesday, October 24.
Test Education in the Global Economy
Authors: Jacob Abraham, Salvador Mir, Yinghua Min, Jeremy Wang, Cheng-Wen Wu
Venue: Proceedings of the 16th Asian Test Symposium (2007)

There is an increasing demand for test and diagnosis expertise in the global semiconductor industry, in sectors ranging from foundries to test houses, to IDM companies, and from fabless design houses to EDA companies. Test education, however remains a niche, highly specialized subject area in the graduate curriculum and is seldom covered in undergraduate classes. In this panel, we evaluate the current health of academic test education and debate the role and goals of future test education, as well as those changes that need to be made to meet the global market demands.
Exploiting Videotext _Events_ for Improved Videotext Detection
Authors: H. Aradhye, G. Myers
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 02 (2007)

Text in video, whether overlay or in-scene, contains a wealth of information vital to automated content analysis systems. However, low resolution of the imagery, coupled with richness of the background and compression artifacts limit the detection accuracy that can be achieved in practice using existing text detection algorithms. This paper presents a novel, non- causal temporal aggregation method that acts as a second pass over the output of an existing text detector over the entire video clip. A multiresolution change detection algorithm is used along the time axis to detect the appearance and disappearance of multiple, concurrent lines of text followed by recursive time- averaged projections on Y and X axes. This algorithm detects and rectifies instances of missed text and enhances spatial boundaries of detected text lines using consensus estimates. Experimental results, which demonstrate significant performance gain on publicly collected and annotated data, are presented.
Animation of ice melting phenomenon based on thermodynamics with thermal radiation
Authors: Makoto Fujisawa, Kenjiro T. Miura
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

This paper proposes a fast and efficient method for producing physically based animations of the ice melting phenomenon, including thermal radiation as well as thermal diffusion and convective thermal transfer. Our method adopts a simple color function called the VOF (Volume-of-Fluid) with advection to track the free surface, which enables straightforward simulation of the phase changes, such as ic&egrave; melting. Although advection of functions that vary abruptly, such as the step function, causes numerical problems, we have solved these by the RCIP (Rational-Constrained Interpolation Profile) method. We present an improvement to control numerical diffusion and to render anti-aliased surfaces. The method also introduces a technique analogous to photon mapping for calculating thermal radiation. By the photon mapping method tuned for heat calculation, the thermal radiation phenomenon in a scene is solved efficiently by storing thermal energy in each photon. Here, we report the results of several ice melting simulations produced by our method.
The Paint Problem
Authors: Copper Giloth, Jane Veeder
Venue: IEEE Computer Graphics and Applications (1985)

The paint interface: Is it a vehicle to easy electronic art or an obstacle to creative involvement with computer graphics?
Two Certificateless Aggregate Signatures From Bilinear Maps
Authors: Zheng Gong, Yu Long, Xuan Hong, Kefei Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

In this paper, we propose two certificateless aggregate signature schemes, which are the first aggregate signature schemes in the CL-PKC. The first scheme CAS -1 reduces the costs of communication and signer-side computation but loses on storage, while CAS - 2 minimizes the storage but sacrifices the communication. We can choose one of the above schemes by the consideration of the implementation requirement. Our schemes do not need the public key certificate anymore and achieve the trust level 3, the same level with traditional PKI. Both of the schemes are proven secure in the random oracle model(ROM) by assuming the intractability of the computational Diffie-Hellman(CDH) problem over groups with bilinear maps.
Shear Flows and Turbulence in Nature
Authors: David E. Newman, Paul W. Terry, Andrew S. Ware
Venue: Computing in Science and Engineering (2007)

Shear flows and turbulence have a major impact on the transport of quantities, from heat to material to pollutants. This article explores transport and its sensitivity to novel interactions between shear flow and turbulence.
Deletions That Preserve Randomness
Authors: D. E. Knuth
Venue: IEEE Transactions on Software Engineering (1977)

This paper discusses dynamic properties of data structures under insertions and deletions It is shown that, in certain circumstances, the result of n random insertions and m random deletions will be equivalent to n-m random insertions, under various interpretations of the world "random" and under various constraints on the order of insertions and deletions.
Preface
Authors: Martín Escardó, Achim Jung, Thomas Streicher
Venue: Mathematical Structures in Computer Science (2007)

This is the second part of a special issue in honour of Klaus Keimel – the first part appeared in Mathematical Structures in Computer Science16 (2). This second part consists of a single paper by John Longley, which could not be included in the earlier issue for reasons of size.
Rapid Trust Establishment for Pervasive Personal Computing
Authors: Ajay Surie, Adrian Perrig, Mahadev Satyanarayanan, David J. Farber
Venue: IEEE Pervasive Computing (2007)

The emergence of pervasive computing systems such as Internet Suspend/Resume has facilitated access to a user's personalized computing environment for transient use on unmanaged hardware. Trust-Sniffer, a tool that helps users gain confidence in using software on an untrusted machine, addresses this usage model's associated security risks. The root of trust is a small, user-carried device such as a USB memory stick. Trust-Sniffer verifies the target machine's on-disk boot image and incrementally expands the zone of trust by validating applications, including dynamically linked libraries, before they execute. Trust-Sniffer validates an application by comparing its checksum to a list of known good checksums. If it can't validate a binary, it blocks the binary's execution. This staged approach to establishing confidence in an untrusted machine strikes a balance between security and ease of use and facilitates rapid use of transient hardware. This article is part of a special issue on security and privacy.