ppxscal/embedding_network huggingface dataset:
Simulation modeling and methodology
Authors: Robert E. Shannon
Venue: ACM SIGSIM Simulation Digest (1977)

Simulation is one of the most powerful analysis tools available to those responsible for the design and/or operation of complex processes or systems. It is heavily based upon computer science, mathematics, probability theory and statistics: yet the process of simulation modeling and experimentation remains very much an intuitive art. Simulation is a very general and somewhat ill-defined subject. For the purpose of this paper, we will define simulation as, "the or process of designing a computerized model of a system (or process) and conducting experiments with this model for the purpose either of understanding the behavior of the system and/or of evaluating various strategies for the operation of the system." Thus we will understand the process of simulation to include both the construction of the model and the analytical use of the model for studying a Problem.
Local Shape Association Based Retrieval of Infrared Satellite Images
Authors: Aiyesha Ma, Ishwar K. Sethi
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

This paper presents a shape-based retrieval system and its application to infrared satellite images. A complete system is presented, from region extraction of a full hemisphere scan to the actual retrieval mechanism. After region extraction, polygonal approximation is applied to the region shape, and local features of the polygons are hashed to provide an association space. This space becomes the indexing structure through which retrieval takes place. Although the indexing stage, containing region extraction and polygonal approximation, is slow, the actual retrieval is very fast. On average, retrieval of a query shape from a database of 1965 shapes takes 0.7 seconds for the more reduced representation, and 2.8 seconds for the less reduced representation consisting of 1914 shapes. The overall design is good for a moderately sized database, and extensions could be made to apply the method to a massive database. The results show that the approach performs well, and that there is a substantial speed benefit for using the local association hashing method.
Using Resource and Portfolio Management Solution to Align IT Investment with Business
Authors: Rongzeng Cao, Wei Ding, Chunhua Tian
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2005)

With business survival increasingly tied to technology performance, CIOs and their IT organizations should be able to map, relate, and articulate IT spending and productivity to business revenue to support their value proposition. There is a rise in the use of project portfolio management as IT organizations shift to provide customer driven solutions. Implementing a project portfolio management process is crucial to optimizing corporate investments under shared service environment. This paper reviews actions that CIO can take to create an environment for more successful projects in the IT organizations. Specifically, the authors discuss some key advanced technologies such as resource allocation, together with major experiences gained from a bank in Asia Pacific.
A Linear Feature Extraction for Multiclass Classification Problems Based on Class Mean and Covariance Discriminant Information
Authors: Pi-Fuei Hsieh, Deng-Shiang Wang, Chia-Wei Hsu
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

A parametric linear feature extraction method is proposed for multiclass classification. The skeleton of the proposed method consists of two types of schemes that are complementary to each other with regard to the discriminant information used. The approximate pairwise accuracy criterion (aPAC) and the common-mean feature extraction (CMFE) are chosen to exploit the discriminant information about class mean and about class covariance, respectively. Choosing aPAC rather than the linear discriminant analysis (LDA) can also resolve the problem of overemphasized large distances introduced by LDA, while maintaining other decent properties of LDA. To alleviate the suboptimum problem caused by a direct cascading of the two different types of schemes, there should be a mechanism for sorting and merging features based on their effectiveness. Usage of a sample-based classification error estimation for evaluation of effectiveness of features usually costs a lot of computational time. Therefore, we develop a fast spanning-tree-based parametric classification accuracy estimator as an intermediary for the aPAC and CMFE combination. The entire framework is parametric-based. This avoids paying a costly price in computation, which normally happens to the sample-based approach. Our experiments have shown that the proposed method can achieve a satisfactory performance on real data as well as simulated data.
The Future Evolution of High-Performance Microprocessors
Authors: Norm Jouppi
Venue: Proceedings of the 38th annual IEEE/ACM International Symposium on Microarchitecture (2005)

The evolution of high-performance microprocessors has reached several significant inflection points. First, the marginal utility of additional single-core complexity is now rapidly diminishing due to a number of factors. The increase in instructions per cycle from increases in sizes and numbers of functional units has plateaued. Meanwhile the increasing sizes of functional units and cores are having a significant negative impact on pipeline depths and the scalability of processor clock cycle times. Second, the power of high performance microprocessors has increased rapidly over the last two decades, even as device switching energies have been significantly reduced by supply voltage scaling. However future voltage scaling will be limited by minimum practical threshold voltages. Current high-performance microprocessors are already near limits of acceptable power dissipation. Thus scaling microprocessor performance while maintaining or even reducing overall power dissipation will prove especially challenging. This keynote talk will discuss these issues and propose likely scenarios for the future evolution of high-performance microprocessors.
Integrated Knowledge Base for Environmental Research
Authors: Sevki Erdogan, Ted Shaneyfelt, Andrew Honma, Cam Muir
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

This paper deals with networking and knowledge base design to support researchers from various fields. The project is been implemented as a working prototype for investigating an integrated model for environmental research, which concentrates on the application spatial, and temporal analysis techniques to large-scale ecological data sets and includes satellite imagery and ground-based sensor data. The primary objective of the paper is to present the current state of the art for capturing and displaying live location information of a moving target in a wildlife environment as well as environmental parameters from static monitoring stations.
Face Recognition Using Landmark-Based Bidimensional Regression
Authors: Jiazheng Shi, Ashok Samal, David Marx
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

This paper studies how biologically meaningful landmarks extracted from face images can be exploited for face recognition using the bidimensional regression. Incorporating the correlation statistics of landmarks, this paper also proposes a new approach called eigenvalue weighted bidimensional regression. Complex principal component analysis is used for computing eigenvalues and removing correlation among landmarks. We evaluate our approach using two standard face databases: the Purdue AR and the NIST FERET. Experimental results show that the bidimensional regression is an efficient method to exploit geometry information of face images.
Efficient and Highly Scalable Route Discovey for On-demand Routing Protocols in Ad hoc Networks
Authors: Mehran Abolhasan, Justin Lipman
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

This paper presents a number of different route discovery strategies for on-demand routing protocols, which provide more control to each intermediate node make during the route discovery phase to make intelligent forwarding decisions. This is achieved through the idea of selfselection. In self-selecting route discovery each node independently makes Route Request (RREQ) forwarding decisions based upon a selection criterion or by satisfying certain conditions. The nodes which do not satisfy the selection criterion do not rebroadcast the routing packets. We implemented our self-selecting route discovery strategies over AODV using the GloMoSim network simulation package, and compared the performance with existing route discovery strategies used in AODV. Our simulation results show that a significant drop in the number of control packets can be achieved by giving each intermediate node more authority for self-selection during route discovery. Furthermore, a significant increase in throughput is achieved as the number nodes in the network is increased.
Grid coordination by using the Grid coordination protocol
Authors: R. Harakaly, P. Primet, F. Bonnassieux
Venue: Proceedings of the 2004 IEEE International Symposium on Cluster Computing and the Grid (2004)

In grids, many control subsystems are implemented by group of distributed agents that need to be coordinated and synchronised. In this paper we present a tool that implements a coordination protocol based on a generic, extensible and personalisable token passing protocol. We show how this tool performs different types of synchronisation tasks in a real Grid testbed. The Grid coordination protocol (GCP) is described, then its implementation, validation and usage, in the context of the European DataGrid project, are presented. We illustrate how GCP is used for network performance measurement coordination, for monitoring equipment configuration synchronisation and also for Grid network topology discovery operations.
The Generalized Eigenvalue Problem for Nonsquare Pencils Using a Minimal Perturbation Approach
Authors: Gregory Boutry, Michael Elad, Gene H. Golub, Peyman Milanfar
Venue: SIAM Journal on Matrix Analysis and Applications (2005)

This work focuses on nonsquare matrix pencils $A - \lambda B$, where $A,B \in {\cal M}^{m \times n}$ and $m> n$. Traditional methods for solving such nonsquare generalized eigenvalue problems $(A - \lambda B)\underline{v} = \underline{0}$ are expected to lead to no solutions in most cases. In this paper we propose a different treatment: We search for the minimal perturbation to the pair $(A,B)$ such that these solutions are indeed possible. Two cases are considered and analyzed: (i) the case when $n=1$ (vector pencils); and (ii) more generally, the $n>1$ case with the existence of one eigenpair. For both, this paper proposes insight into the characteristics of the described problems along with practical numerical algorithms toward their solution. We also present a simplifying factorization for such nonsquare pencils, and some relations to the notion of pseudospectra.
Considerations in selecting a terminal
Authors: Gregory A. Marks
Venue: ACM SIGSOC Bulletin (1978)

The computer terminal marketplace is expanding and changing rapidly. Prices are dropping as a result of both technological factors and because of sales volume. An increasing variety of special features and capabilities are appearing. However, the selection process can be a confusing one. This article is intended to help anyone interested in terminals by setting forth the major trade-offs and considerations that may be relevant.
Generalized Nonlinear Lagrangian Formulation for Bounded Integer Programming
Authors: Yifan Xu, Chunli Liu, Duan Li
Venue: Journal of Global Optimization (2005)

Several nonlinear Lagrangian formulations have been recently proposed for bounded integer programming problems. While possessing an asymptotic strong duality property, these formulations offer a success guarantee for the identification of an optimal primal solution via a dual search. Investigating common features of nonlinear Lagrangian formulations in constructing a nonlinear support for nonconvex piecewise constant perturbation function, this paper proposes a generalized nonlinear Lagrangian formulation of which many existing nonlinear Lagrangian formulations become special cases.
Computing the Diameters of 14- and 15-Pancake Graphs
Authors: Yuusuke Kounoike, Keiichi Kaneko, Yuji Shimano
Venue: Proceedings of the 8th International Symposium on Parallel Architectures,Algorithms and Networks (2005)

Computing the diameter of a pancake graph is equivalent to solving the "pancake sorting problem" (or "prefix reversal problem"), which is basically the problem of finding the maximum number of pancake flips one would need to perform in order to sort an arbitrary stack of pancakes. The diameter of a pancake graph can be computed by solving the shortest path problems from a certain vertex to every other vertex in the graph. However, finding the diameter of an n-pancake graph is known to be very hard problem. In fact, n = 13 is the maximum size of n-pancake graphs whose diameter have been computed. Heydari et al. developed a method for calculating the diameter of the13-pancake graph. In this paper, an extension of that method is proposed and used to obtain the diameters of the 14- and 15-panckae graph.
Design of 12-bit 100-MHz Current-Steering DAC for SoC Applications
Authors: Chun-Yueh Huang, Tsung-Tien Hou, Chi-Chieh Chuang, Hung-Yu Wang
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

In this paper, we propose a 12-bit 100-MHz current-steering digital-to-analog converter (DAC) for system-on-a-chip (SOC) applications. We adapt the segmented architecture to design this DAC to obtain better performances of LVL, Glitch energy, and monotonicity. The segmented architecture includes 7- MSBs which are decoded into 127 equally weighted current sources and 5-LSBs which are corresponding to binary-weighted current sources. Based on the TSMC 0.35um 2p4m CMOS technology, we use HSPICE to simulate the proposed DAC. The simulation results show that the proposed DAC has the following characteristics: INL
The effect of applying principles of reformed teaching and learning to an asynchronous online environment on student cognition of physics concepts in kinematics
Authors: Michael Lloyd Turner
Venue:  (2005)

Research on student difficulties in learning physics concepts has been coincident with a general reform movement in science education with the aim of increasing the level of inquiry in the teaching and learning of science. Coincident with these efforts has been a dramatic increase in the offering of online courses. Generally, this movement toward online course offerings has taken place without the inclusion of laboratory science offerings. The Learn Anytime Anywhere Physics (LAAPhysics) program for asynchronous online introductory physics learning is a notable exception. LAAPhysics software attempts to implement the principles of reformed science teaching and learning in an online environment. The purpose of this study was to measure how student cognition of physics concepts in kinematics was effected through use of LAAPhysics online kinematics tutorials. The normalized gains between pre-instruction and post-instruction scores on the Test of Understanding Graphs in Kinematics (TUG-K) for a treatment group of LAAPhysics testers was calculated. This normalized gain was compared to normalized gains typically found for students taking face-to-face physics courses. The normalized gain scores for LAAPhysics testers were also tested for correlation against time on task variables as measured by connectivity to the online software. Finally, a content analysis of student responses recorded in the LAAPhysics software was conducted. Normalized gain scores for LAAPhysics testers were not found to be greater than gain scores typically found in face-to-face courses. The number of student connections to the software and their total time working in the software were found to be significantly related to normalized gain on the TUG-K. The content analysis of student responses in the LAAPhysics software revealed variation in initial understanding of physics concepts in kinematics as well as variation in change in understanding across students.
Adaptive OCR with Limited User Feedback
Authors: Huanfeng Ma, David Doermann
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

A methodology is proposed for processing noisy printed documents with limited user feedback. Without the support of ground truth, a specific collection of scanned documents can be processed to extract character templates. The adaptiveness of this approach lies in that the extracted templates are used to train an OCR classifier quickly and with limited user feedback. Experimental results show that this approach is extremely useful for the processing of noisy documents with many touching characters.
Yield-aware Floorplanning
Authors: Zhaojun Wo, Israel Koren, Maciej J. Ciesielski
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Yield is normally ignored during the floorplanning stage. Recently, it has been shown that floorplanning can affect the yield with the increased sizes of chips. With the "medium-area clustering" model [1], yield can be evaluated during the floorplanning stage. Therefore, it¿s straightforward to incorporate yield in modern floorplanners. However, conventional Simulate-Annealing(SA) based moves are only designed for the combination of the area and/or the wire length minimizations. In this paper, we proposed a heuristic scheme of "moves" directly targeting on the yield improvement. The experimental results show a great yield improvement with little penalty for the area and/or the total wire length.
A Statistical Learning Approach To Document Image Analysis
Authors: Kevin Laven, Scott Leishman, Sam Roweis
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

In the field of computer analysis of document images, the problems of physical and logical layout analysis have been approached through a variety of heuristic, rule-based, and grammar-based techniques. In this paper we investigate the effectiveness of statistical pattern recognition algorithms for solving these two problems, and report results suggesting that these more complex and powerful techniques are worth pursuing. First, we developed a new software environment for manual page image segmentation and labeling, and used it to create a dataset containing 932 page images from academic journals. Next, a physical layout analysis algorithm based on a logistic regression classifier was developed, and found to outperform existing algorithms of comparable complexity. Finally, three statistical classifiers were applied to the logical layout analysis problem, also with encouraging results.
CTC — Correlating Tree Patterns for Classification
Authors: Albrecht Zimmermann, Bjorn Bringmann
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

We present CTC, a new approach to structural classification. It uses the predictive power of tree patterns correlating with the class values, combining state-of-the-art tree mining with sophisticated pruning techniques to find the k most discriminative pattern in a dataset. In contrast to existing methods, CTC uses no heuristics and the only parameters to be chosen by the user are the maximum size of the rule set and a single, statistically well founded cut-off value. The experiments show that CTC classifiers achieve good accuracies while the induced models are smaller than those of existing approaches, facilitating comprehensibility.
Reducing Jitter in Embedded Systems Employing a Time-Triggered Software Architecture and Dynamic Voltage Scaling
Authors: Teera Phatrapornnant Michael J. Pont
Venue: IEEE Transactions on Computers (2006)

We have previously demonstrated that use of an appropriate Dynamic Voltage Scaling (DVS) algorithm can lead to a substantial reduction in CPU power consumption in systems employing a time-triggered cooperative (TTC) scheduler. In this paper, we consider the impact that the use of DVS has on the levels of both clock and task jitter in TTC applications. We go on to describe a modified DVS algorithm (TTC-jDVS) which can be used where low jitter is an important design consideration. We then demonstrate the effectiveness of the modified algorithm on a data set made up of artificial tasks and in a realistic case study.
Oxygen vacancies in amorphous silica: structure and distribution of properties
Authors: P. V. Sushko, S. Mukhopadhyay, A. M. Stoneham, A. L. Shluger
Venue: Microelectronic Engineering (2005)

We used an ab initio embedded cluster method to study and compare three charged states of the Si-Si dimer configurations of oxygen vacancies in a-quartz and amorphous silica. The Si-Si bond in the neutral vacancy remains largely the same in both crystalline and amorphous SiO2. In α-quartz the positively charged dimer E' centre exists only as a metastable configuration, whereas in amorphous silica stable dimer configuration can be formed at favorable precursor sites. Our results demonstrate that negatively charged dimer oxygen vacancies can be formed in α-quartz.
An Integrated Commit Protocol for Mobile Network Databases
Authors: Joos-Hendrik Bose, Stefan Bottcher, Le Gruenwald, Sebastian Obermeier, Heinz Schweppe, Thorsten Steenweg
Venue: Proceedings of the 9th International Database Engineering & Application Symposium (2005)

While traditional fixed-wired network protocols like 2-Phase-Commitguarantee atomicity, we cannot use them in mobile low bandwidth networks where network partitioning, node failure, and message loss may result in blocking. To deploy traditional database applications easily into a mobile environment, there is a demand for a protocol which guarantees an atomic commit of transactions. This paper introduces a protocol which can guarantee such atomic commitment in mobile environments using a combination of commit and consensus protocols. In addition, it takes advantage of mobile network sub-structures like single-hop-environments to reduce message transfer costs.
Sample Selection for Statistical Parsing
Authors: Rebecca Hwa
Venue: Computational Linguistics (2004)

Corpus-based statistical parsing relies on using large quantities of annotated text as training examples. Building this kind of resource is expensive and labor-intensive. This work proposes to use sample selection to find helpful training examples and reduce human effort spent on annotating less informative ones. We consider several criteria for predicting whether unlabeled data might be a helpful training example. Experiments are performed across two syntactic learning tasks and within the single task of parsing across two learning models to compare the effect of different predictive criteria. We find that sample selection can significantly reduce the size of annotated training corpora and that uncertainty is a robust predictive criterion that can be easily applied to different learning models.