ppxscal/embedding_network huggingface dataset:
Predictive vector quantization of 3-D mesh geometry by representation of vertices in local coordinate systems
Authors: Ulug Bayazit, Ozgur Orcay, Umut Konur, Fikret S. Gurgen
Venue: Journal of Visual Communication and Image Representation (2007)

In predictive 3-D mesh geometry coding, the position of each vertex is predicted from the previously coded neighboring vertices and the resultant prediction error vectors are coded. In this work, the prediction error vectors are represented in a local coordinate system in order to cluster them around a subset of a 2-D planar subspace and thereby increase block coding efficiency. Alphabet entropy constrained vector quantization (AECVQ) of Rao and Pearlman is preferred to the previously employed minimum distortion vector quantization (MDVQ) for block coding the prediction error vectors with high coding efficiency and low implementation complexity. Estimation and compensation of the bias in the parallelogram prediction rule and partial adaptation of the AECVQ codebook to the encoded vector source by normalization using source statistics, are the other salient features of the proposed coding system. Experimental results verify the advantage of the use of the local coordinate system over the global one. The visual error of the proposed coding system is lower than the predictive coding method of Touma and Gotsman especially at low rates, and lower than the spectral coding method of Karni and Gotsman at medium-to-high rates.
Comparison of target detection algorithms using adaptive background models
Authors: D. Hall, J. Nascimento, P. Ribeiro, E. Andrade
Venue: Proceedings of the 14th International Conference on Computer Communications and Networks (2005)

This article compares the performance of target detectors based on adaptive background differencing on public benchmark data. Five state of the art methods are described. The performance is evaluated using state of the art measures with respect to ground truth. The original points are the comparison to hand labelled ground truth and the evaluation on a large database. The simpler methods LOTS and SGM are more appropriate to the particular task as MGM using a more complex background model.
System issues in implementing high speed distributed parallel storage systems
Authors: Brian Tierney, Bill Johnston, Hanan Herzog, Gary Hoo, Guojun Jin, Jason Lee
Venue: Proceedings of the High-Speed Networking Symposium on USENIX 1994 High-Speed Networking Symposium (1994)

In this paper we describe several aspects of implementing a high speed network-based distributed application. We describe the design and implementation of a distributed parallel storage system that uses high speed ATM networks as a key element of the architecture. The architecture provides what amounts to a collection of network-based disk block servers, and an associated name server that provides some file system functionality. The implementation approach is that of user level software that runs on UNIX workstations. Both the architecture and the implementation are intended to provide for easy and economical scalability in both performance and capacity. We describe the software architecture, the implementation and operating system overhead issues, and our experiences with this approach in an IP-over-ATM WAN. Although most of the paper is specific to a distributed parallel data server, we believe many of the issues we encountered are generally applicable to any high speed network-based application.
SlideSeer: a digital library of aligned document and presentation pairs
Authors: Min-Yen Kan
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

Research findings are often transmitted both as written documents and narrated slide presentations. As these two forms of media contain both unique and replicated information, it is useful to combine and align these two views to create a single synchronized medium. We introduce SlideSeer, a digital library that discovers, aligns and presents such presentation and document pairs. We discuss the three major system components of the SlideSeer DL: 1) the resource discovery, 2) the fine-grained alignment and 3) the user interface. For resource discovery, we have bootstrapped our collection building process using metadata from DBLP and CiteSeer. For alignment, we modify maximum similarity alignment to favor monotonic alignments and incorporate a classifier to handle slides which should not be aligned. For the user interface, we allow the user to seamlessly switch between four carefully motivated views of the resulting synchronized media pairs.
Conference Reports
Authors: C. P. Ravikumar, Jari Nurmi
Venue: IEEE Design Test (2007)

1. TTTC Forum honors Melvin Breuer--at the 2006 International Test Conference, a half-day technical forum was held to honor Melvin Breuer, a pioneer in the areas of VLSI design automation and test; 2. Design flow and methodology addressed at SOC 2006--The International Symposium on System-on-Chip took place on 13-16 November 2006 in Tampere, Finland. The theme was "SoC Design Flow and Methodology." There were nine high-caliber, 45-minute invited talks, covering different approaches and application areas in SoC design.
A Closed-Form Formula for Queueing Delays in Disk Arrays
Authors: Tao Yang, Shengbin Hu, Qing Yang
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 02 (1994)

Disk arrays have become increasingly popular as a means of improving performance of secondary storage systems. In making design decisions, it is essential to understand the performances of different configurations as well as effects of system parameters on their performance. Analytical performance models are desirable in both configuring and designing disk arrays since they provide designers with a quick and efficient tool to evaluate and understand a system with a wide range of system and workload parameters.
A pyramidal edge detector based on anisotropic diffusion
Authors: S. T. Acton
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1996. on Conference Proceedings., 1996 IEEE International Conference - Volume 04 (1996)

A novel approach to diffusion-based edge detection is presented. The method utilizes a multiresolution, multiscale pyramidal structure created via successive anisotropic diffusion and subsampling of the original image. Coarse, low resolution image representations of the anisotropic diffusion pyramid (ADP) guide boundary detection at higher resolutions. The edges computed by this hierarchical technique are resilient to image corruption and reflect features of a desired scale. The ADP edge detector offers the advantages of decreased edge localization error and region merging, as compared to Gaussian-based pyramid edge detectors. The ADP-based approach also improves upon the performance of fixed-resolution anisotropic diffusion in noise and alleviates the need for post-processing such as edge thinning and linking.
A FMECA framework for Service Oriented Systems based on Web Services
Authors: Andrzej Zalewski
Venue: Proceedings of the 2nd International Conference on Dependability of Computer Systems (2007)

Service Oriented-Architecture (SOA) is becoming more and more important as a paradigm for the development of distributed software systems. In this approach user applications are built of a set of collaborating services running in a distributed environment of Internet. Although the idea of SOA appeals strongly to the software development practitioners, there are also numerous pitfalls that cause risks of different severity for SOA software reliability. The paper provides a survey of these critical risks and proposes a framework for Failure Modes, Effects and Criticality Analysis (FMECA) of SOA systems based on Web Services.
Moving the ensemble communication system to NT and Wolfpack
Authors: K. Birman, W. Vogels, K. Guo, M. Hayden, T. Hickey, R. Friedman, R. van Renesse, Al. Vaysburd, S. Maffeis
Venue: Proceedings of the USENIX Windows NT Workshop on The USENIX Windows NT Workshop 1997 (1997)

Cornell University has developed a group communications and membership management tool, called the Ensemble system, which provides the basis for introducing guarantees such as reliability, high availability, fault-tolerance, consistency, security and real-time responsiveness into applications that run on clustered parallel computers or high speed networks. Ensemble tools are flexible, extremely transparent, and achieve high performance. Our development started under Unix in 1995, but by 1996 had enlarged to include NT as a primary target. This paper reviews Ensemble and then discusses the technical issues that arose when repositioning it to fit naturally and perform well under NT.
An Architectural Style for Solving Computationally Intensive Problems on Large Networks
Authors: Yuriy Brun, Nenad Medvidovic
Venue: Proceedings of the 2007 International Workshop on Software Engineering for Adaptive and Self-Managing Systems (2007)

Large networks, such as the Internet, pose an ideal medium for solving computationally intensive problems, such as NP-complete problems, yet no well-scaling architecture for computational Internet-sized systems exists. We propose a software architectural style for large networks, based on a formal mathematical study of crystal growth that will exhibit properties of (1) discreetness (nodes on the network cannot learn the algorithm or input of the computation), (2) fault-tolerance (malicious, faulty, and unstable nodes may not break the computation), and (3) scalability (communication among the nodes does not increase with network or problem size).
Total Colorings Of Degenerate Graphs
Authors: Shuji Isobe, Xiao Zhou, Takao Nishizeki
Venue: Combinatorica (2007)

A total coloring of a graph G is a coloring of all elements of G, i.e. vertices and edges, such that no two adjacent or incident elements receive the same color. A graph G is s-degenerate for a positive integer s if G can be reduced to a trivial graph by successive removal of vertices with degree &#x2264;s. We prove that an s-degenerate graph G has a total coloring with &#x0394;+1 colors if the maximum degree &#x0394; of G is sufficiently large, say &#x0394;&#x2265;4s+3. Our proof yields an efficient algorithm to find such a total coloring. We also give a lineartime algorithm to find a total coloring of a graph G with the minimum number of colors if G is a partial k-tree, that is, the tree-width of G is bounded by a fixed integer k.
Surface Deformation Models for Nonrigid 3D Shape Recovery
Authors: Mathieu Salzmann Julien Pilet Slobodan Ilic Pascal Fua
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Three-dimensional detection and shape recovery of a nonrigid surface from video sequences require deformation models to effectively take advantage of potentially noisy image data. Here, we introduce an approach to creating such models for deformable 3D surfaces. We exploit the fact that the shape of an inextensible triangulated mesh can be parameterized in terms of a small subset of the angles between its facets. We use this set of angles to create a representative set of potential shapes, which we feed to a simple dimensionality reduction technique to produce low-dimensional 3D deformation models. We show that these models can be used to accurately model a wide range of deforming 3D surfaces from video sequences acquired under realistic conditions.
Approaching a parallelized XML parser optimized for multi-coreprocessors
Authors: Michael R. Head, Madhusudhan Govindaraju
Venue: Proceedings of the 2007 workshop on Service-oriented computing performance: aspects, issues, and approaches (2007)

Very large scientific datasets are increasingly becoming available in XML formats. At the same time, multi-core processing is increasingly becoming available on desktop- and laptop-class computing machines. Unfortunately, most XML parsers are still using algorithms that are inherently serial, which show little improvement on newer computing hardware. The current XML implementation landscape does not adequately meet the performance requirements of large scale applications. Thus far, applications using Web services (in the grid community, for example) have largely focused on XML protocol standardization and tool building efforts, and not on addressing the performance bottlenecks when dealing with large volumes of XML data. Generic parallel parsing has been studied in depth over the past thirty years. However, as yet, these results have not been applied to the problem of XML parsing. XML documents have some structural properties that make it more amenable to parallelized parsing than general context-free languages. As has been previously shown, XML parsers spend a large percentage of time tokenizing the input in aninherently serial process, typically running a deterministic finite automaton on the input. Our initial approach, described here, separates the process of parsing the XML from the process of reading the input. We take a well-known high performance parser, Piccolo, and apply two different strategies, Runahead and Piped, and examine the timing of the file read time and hence the overall time to parse large scientific XML files. Under the conditions tested here, performance decreases.
Reduced-parameter modeling for cost estimation models
Authors: Barry W. Boehm
Venue:  (2006)

In this research, parametric software cost estimation models and their related calibration methods have been analyzed, especially for the COCOMO model and the Bayesian calibration approach. This research combines machine learning techniques and statistical techniques. With this approach, the prediction powers of the COCOMO parametric software cost model are shown to be significantly improved while the variability is decreased with respect to the dataset being analyzed. This research studies not only the accuracy but also the variances of the model and the variables. It can improve the confidence of people who use software cost estimation models, show the prediction power of software cost estimation models after calibration, and make it easier and better to perform software data collection and analysis. However, the research also identifies risks in using the approach, such as dropping parameters that will vary on future projects. This research provides methods that can help an organization to reason about the relationship between the characteristics of the organization and its projects' software development costs and schedules. The methods can thus help the organization to make more cost-effective development decisions and investment decisions. The research also provides new insights on how to combine calibration, stratification, hold-out, and machine learning techniques to produce more accurate parametric models for particular organizations or situations.
Analysis of the behavioral styles of ET students and the inherent implications of this knowledge
Authors: S. Pisarski
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 02 (2000)

Success in corporate organizational life depends upon two requirements and universities have a responsibility to acquaint the students with this reality. First, industry requires its employees to perform a specific job function and to achieve certain corporate goals. Second, companies expect employees to work effectively with others and to contribute to the spirit and well being of the team(s) to which they are assigned In this regard there are no trade-offs and firms expect their employees to succeed in both of these areas. Getting the job done occurs with, through, and because of the people one work with in their professional environment and this requires interpersonal skills not taught in most undergraduate programs. Leaders within teams must know how to build enthusiasm, confidence and morale because of the task at hand and not in spite of the job that needs to be done. In order to be truly effective from an interpersonal perspective, leaders must understand their own behavioral style and that of their subordinates. While general in nature, behavioral styles have various subsets, each directly related to their overall effectiveness. The subsets include styles or preferences for learning, for leading, for communicating for building teams and for presenting thoughts, ideas and reports. Making students aware of their dominant behavioral style, and implications associated with it, provides them with valuable insights into their personal preferences as well as the preferences of others. These insights provide important information that enables the student to effectively deal with people that have conflicting behavioral styles. In turn, this leads to greater appreciation and respect for others resulting in a new level of understanding and effectiveness when working with others of a different style. This paper presents the initial findings on behavioral styles of 80% of the students enrolled in UPJ's Engineering Technology Program. A collective analysis of the entire student body revealed the predominant style while individual classes were surveyed to determine the "class" style. The study shows student behavioral styles in the above areas with special emphasis on each student's learning style. Showing students how they can develop new ways to become more effective as an undergraduate and future employee gave them insights into an area they would not normally be exposed to in their undergraduate education.
Fuzzy-Granular Gene Selection from Microarray Expression Data
Authors: Yuanchen He, Yuchun Tang, Yan-Qing Zhang, Rajshekhar Sunderraman
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Selecting informative and discriminative genes from huge microarray gene expression data is an important and challenging bioinformatics research topic. This paper proposes a fuzzy-granular method for the gene selection task. Firstly, genes are grouped into different function granules with the Fuzzy C-Means algorithm (FCM). And then informative genes in each cluster are selected with the Signal to Noise metric (S2N). With fuzzy granulation, information loss in the process of gene selection is decreased. As a result, more informative genes for cancer classification are selected and more accurate classifiers can be modeled. The simulation results on two publicly available microarray expression datasets show that the proposed method is more accurate than traditional algorithms for cancer classification. And hence we expect that genes being selected can be more helpful for further biological studies.
A real-coded genetic algorithm involving a hybrid crossover method for power plant control system design
Authors: K. Y. Lee, P. S. Mohamed
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

This paper introduces a new hybrid crossover method for a real-coded genetic algorithm and its application to control system design of a power plant. Determining gains for controllers by using a genetic algorithm method usually involves multiple training stages. This method is not necessarily optimal. This paper applies a hybrid crossover method in a real-coded genetic algorithm to simultaneously find gains of three PI control loops and six other coupled gains in a boiler-turbine control system. The real-coded genetic algorithm with the hybrid crossover method has a better convergence rate when applied to this problem, as compared to other methods. A better convergence rate reduces execution time and is particularly relevant to problems having significant simulation times. A comparison between hybrid crossover and convex crossover in a real-coded genetic algorithm together with multi point crossover using a binary coded genetic algorithm has also been made.
Simultaneous mobility: analytical framework, theorems and solutions: Research Articles
Authors: K. Daniel Wong, A. Dutta, H. Schulzrinne, K. Young
Venue: Wireless Communications Mobile Computing (2007)

The original Mobile IP (MIP) protocol does not perform Route Optimisation but uses Home Agents to forward traffic. Thus, it does not have problems with simultaneous mobility, that is, the special case when both end hosts are mobile and move at about the same time. However, MIP for IPv6 (MIPv6) uses binding updates that are sent directly to a correspondent node. Session Initiation Protocol based mobility management (SIPMM) and MIP with location registers (MIP-LR) also use direct binding updates between a mobile host and a correspondent node. Thus, MIPv6, MIP-LR and SIPMM are vulnerable to the simultaneous mobility problem. In this paper, we analyse the simultaneous mobility problem and solution mechanisms, and propose new ways for MIPv6, MIP-LR and SIPMM to handle simultaneous mobility. Copyright &copy; 2006 John Wiley & Sons, Ltd.
An Alternative Scattered Pattern for Flexible Macroblock Ordering in H.264/AVC
Authors: Yves Dhondt, Stefaan Mys, Saar De Zutter, Rik Van de Walle
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

Spatial error concealment methods in block-based video codecs use information from surrounding macroblocks to repair lost macroblocks. Using the slice group tool of H.264/AVC, it is possible to encode the macroblocks of a frame based on a scattered pattern, hereby allowing an encoder to actively help concealment methods at the decoder side. In this paper, the requirements for such a pattern are presented. Two commonly used patterns are verified against those requirements and an alternative scattered pattern is presented. Experiments show that our alternative pattern outperforms the old scattered patterns by up to 1.5 dB in case two or more slice groups are lost.
Kerberos interoperability issues
Authors: Paul B. Hill
Venue: Proceedings of the 3rd conference on Large Installation System Administration of Windows NT - Volume 3 (2000)

MIT's computing environment is a heterogeneous environment that has used Kerberos as a primary authentication method for over a decade. Instead of migrating our existing KDCs to Windows 2000 we have chosen to use cross realm trust to support our Windows 2000 computing environment. During our deployment project we have encountered some interoperability problems and have worked with Microsoft to resolve these. We have also encountered protocol extensions that have been used by Microsoft and we have been working with Microsoft under the umbrella of the IETF to have these documented. Some of the problems were only identified and resolved by analyzing network traffic.
Spectral analysis of connection utilization masking in ATM networks
Authors: A. Cay
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 05 (2000)

"Cell injection" is a technique for masking virtual connection (VC) utilization in ATM networks from third parties by providing a constant or near-constant flow of traffic over the connection. This paper models the cell injection process as a Markov modulated Poisson process (MMPP) and discusses both the theoretical and applied aspects of the cell injection approach. Analytic results are compared with measurements of real cell-injected ATM traffic and the effects of injection on the original traffic are summarized. Second order statistics, autocorrelation and power spectral density, of the cell-injected and original streams are used compare and justify these effects. These measurements show that cell injection shifts the power in the mid and high frequency regions towards low frequency regions, which is the dominant factor in queue length distributions.