ppxscal/embedding_network huggingface dataset:
Interpolation Method for a Function with a Singular Component
Authors: A. I. Zadorin
Venue: Numerical Analysis and Its Applications: 4th International Conference, NAA 2008, Lozenetz, Bulgaria, June 16-20, 2008. Revised Selected Papers (2009)

An interpolation formula for functions with boundary layer components is proposed. It is exact on the singular boundary layer component, that leads to uniform accuracy of the interpolation. It is shown, that the proposed formula can be used for interpolation of numerical solutions of boundary value problems with exponential and power layers.
Gr8 designs for Gr8 girls: a middle-school program and its evaluation
Authors: Michelle Craig, Diane Horton
Venue: ACM SIGCSE Bulletin (2009)

In order to address the under-representation of women in Computer Science, we have created a program for middle-school girls that specifically aims to change their attitudes about CS and encourages them to see it as a potential career. Our assessment of the program shows that it did indeed have a significant, positive impact and suggests that this was still in effect three months later. This paper describes the program and its assessment, and makes suggestions for those considering offering a similar program.
Integrating contrast invariance into a model for cortical orientation map formation
Authors: Laura Y. Zhao, Bertram E. Shi
Venue: Neurocomputing (2009)

Hebbian models of orientation map formation in the primary visual cortex typically represent the cortex as an array of neurons that are excited by both ON and OFF lateral geniculate nucleus neurons. However, simple cells with only thalamic excitation exhibit tuning curves that widen with stimulus contrast. This is inconsistent with the contrast-invariant width actually observed. We propose a map formation model that achieves contrast invariance through anti-phase inhibition. We describe how inhibition between columns implements the coverage constraint to ensure orientations are uniformly sampled. We find that the model exhibits more robust receptive field formation than a simpler model without anti-phase inhibition.
Off line signature recognition based on wavelet, curvelet and contourlet transforms
Authors: M. Fakhlai, H. Pourreza
Venue: Proceedings of the 8th conference on Signal processing, computational geometry and artificial vision (2008)

In this paper we proposed new offline signature recognition based on the three different kinds of feature extractors, wavelet, curvelet and contourlet transform. The curvature and orientation of a signature image was used as feature. We utilized Support vector machine (SVM) as a tool to evaluate the performance of the proposed methods. The comparison of the three transforms for identifying the kind of signatures showed that contourlet transform can extract better features among the proposed.
Key technology trends - Ground terminals
Authors: William T. Brandon, Christoph E. Mahle
Venue: Space Communications (2000)

This paper presents an overview of the status of pertinent technologies for the ground segment of communications satellite systems. It is derived from the 1997/98 NASA/NSF sponsored commercial communications satellite study of technology, markets and services. It is recognized that the ground system technology is often more important than that of the satellites, especially as satellites are increasingly being used to provide services directly to the end-customer. The current state of technology for several classes of ground terminals is reviewed. This includes Very Small Aperture Terminals (VSAT) for Ku- and Ka-bands, Television Receive-Only (TVRO) Terminals, handheld terminals, portable and mobile terminals for multimedia and business use, airborne and ship-borne terminals, hubs and gateways and military terminals.
Microcode compaction: looking backward and looking forward
Authors: Joseph A. Fisher, David Landskov, Bruce D. Shriver
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

The past decade has seen significant advances in the state of the art in microcode compaction. Microprograms are compacted by placing several microoperations into each microinstruction, subject to the constraints of data dependency in the program and legal resource usage in the machine on which the microcode will execute. The compaction process attempts to make the code run as fast as possible. In this paper we will not only survey the most recent past in microcode compaction but will also speculate about the near future.
Existence of multiple nontrivial solutions for semilinear elliptic problems
Authors: A. R. El Amrouss, F. Moradi, M. Moussaoui
Venue: Computers Mathematics with Applications (2009)

The aim of this paper is to prove the existence of multiple nontrivial solutions to a semilinear elliptic problem at resonance. The proofs used here are based on combining the Morse theory and the minimax methods.
Evaluations of Graph Polynomials
Authors: Benny Godlin, Tomer Kotek, Johann A. Makowsky
Venue: Graph-Theoretic Concepts in Computer Science: 34th International Workshop, WG 2008, Durham, UK, June 30 --- July 2, 2008. Revised Papers (2008)

A graph polynomial $p(G, \bar{X})$ can code numeric information about the underlying graph G in various ways: as its degree, as one of its specific coefficients or as evaluations at specific points $\bar{X}= \bar{x}_0$. In this paper we study the question how to prove that a given graph parameter, say ¿(G), the size of the maximal clique of G, cannot be a fixed coefficient or the evaluation at any point of the Tutte polynomial, the interlace polynomial, or any graph polynomial of some infinite family of graph polynomials.Our result is very general. We give a sufficient condition in terms of the connection matrix of graph parameter f(G) which implies that it cannot be the evaluation of any graph polynomial which is invariantly definable in CMSOL, the Monadic Second Order Logic augmented with modular counting quantifiers. This criterion covers most of the graph polynomials known from the literature.
A Novel Approach to Classify Imbalanced Dataset Based on Rare Attributes and Double Confidences
Authors: Yingjie Li, Yixin Yin
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

The major weakness of associative classification is examined. A novel approach for classifying imbalanced dataset is proposed. It is an associative classification. Rules which are un-frequent are used to build the classifier rule set. Besides the confidence of pattern “X→Y”, the confidence of pattern “Y→X” is used in the approach. Further more, only features of rare classes are preserved while training. The good performance of the approach is shown by the experiments.
Development and implementation of a medical/management information system at the harvard community health plan
Authors: Norma Justice, G. Octo Barnett, Robert Lurie, William Cass
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The Harvard Community Health Plan (HCHP) is a multi-clinic prepaid group practice currently serving 37,000 greater Boston subscribers. The original clinic in Kenmore Square, Boston opened in October, 1969. A second clinic opened in Cambridge in July, 1973, in order to meet a projected subscriber population of 75,000 by 1977.
Practicing What We Preach: IEEE VR 2009 Virtual Program Committee Meeting
Authors: Robert W. Lindeman, Dirk Reiners, Anthony Steed
Venue: IEEE Computer Graphics and Applications (2009)

This article reports on the experience of conducting the program committee (PC) meeting for the IEEE VR 2009 conference in Second Life. More than 50 PC members from around the globe met virtually over a two-day period to decide which papers to accept for presentation at the conference. Survey responses from 42 of the PC members indicate generally positive feelings toward this meeting format, although several alterations will help improve interaction between attendees in future meetings.
Contour Grouping with Partial Shape Similarity
Authors: Chengqian Wu, Xiang Bai, Quannan Li, Xingwei Yang, Wenyu Liu
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

In this paper, a novel algorithm is introduced to group contours from clutter images by integrating high-level information (prior of part segments) and low-level information (paths of segmentations of clutter images). The partial shape similarity between these two levels of information is embedded into the particle filter framework, an effective recursively estimating model. The particles in the framework are modeled as the paths on the edges of segmentation results (Normalized Cuts in this paper). At prediction step, the paths extend along the edges of Normalized Cuts; while, at the update step, the weights of particles update according to their partial shape similarity with priors of the trained contour segments. Successful results are achieved against the noise of the testing image, the inaccuracy of the segmentation result as well as the inexactness of the similarity between the contour segment and edges segmentation. The experimental results also demonstrate robust contour grouping performance in the presence of occlusion and large texture variation within the segmented objects.
Physics-based ball tracking and 3D trajectory reconstruction with applications to shooting location estimation in basketball video
Authors: Hua-Tsung Chen, Ming-Chun Tien, Yi-Wen Chen, Wen-Jiin Tsai, Suh-Yin Lee
Venue: Journal of Visual Communication and Image Representation (2009)

The demand for computer-assisted game study in sports is growing dramatically. This paper presents a practical video analysis system to facilitate semantic content understanding. A physics-based algorithm is designed for ball tracking and 3D trajectory reconstruction in basketball videos and shooting location statistics can be obtained. The 2D-to-3D inference is intrinsically a challenging problem due to the loss of 3D information in projection to 2D frames. One significant contribution of the proposed system lies in the integrated scheme incorporating domain knowledge and physical characteristics of ball motion into object tracking to overcome the problem of 2D-to-3D inference. With the 2D trajectory extracted and the camera parameters calibrated, physical characteristics of ball motion are involved to reconstruct the 3D trajectories and estimate the shooting locations. Our experiments on broadcast basketball videos show promising results. We believe the proposed system will greatly assist intelligence collection and statistics analysis in basketball games.
Spatial Interaction with Haptic Holograms
Authors: Wendy Plesniak, Ravikanth Pappu
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

We present a comprehensive report of our work in the design and implementation of systems that combine holography with haptic feedback. Two separate holo-haptic systems are described. First, we describe a static system wherein a user can see a free-standing static holographic image and inspect its shape using a force-feedback stylus. In the second system, visual display is provided by a dynamic holographic video system, and the user can modify the geometry of the image in near real-time. We also suggest a preliminary set of guidelines for presenting physically believable multimodal simulations in coincident visual-haptic workspaces.
Operationalization of the UFuRT methodology for usability analysis in the clinical research data management domain
Authors: Meredith Nahm, Jiajie Zhang
Venue: Journal of Biomedical Informatics (2009)

Data management software applications specifically designed for the clinical research environment are increasingly available from commercial vendors and open-source communities, however, general-purpose spreadsheets remain widely employed in clinical research data management (CRDM). The suitability of spreadsheets for this use is controversial, and no formal comparative usability evaluations have been performed. We report on an application of the UFuRT (user, function, representation, and task (analyses) methodology to create a domain-specific process for usability evaluation. We demonstrate this process in an evaluation of differences in usability between a spreadsheet program (Microsoft(R) Excel) and a commercially available clinical research data management system (Phase Forward Clintrial(TM)). Through this domain-specific operationalization of UFuRT methodology, we successfully identified usability differences and quantified task and cost differences, while differentiating these from socio-technical aspects. UFuRT can be generalized to other domains.
CoreLab: an emerging network testbed employing hosted virtual machine monitor
Authors: Akihiro Nakao, Ryota Ozaki, Yuji Nishida
Venue: Proceedings of the 2008 ACM CoNEXT Conference (2008)

Network testbeds for developing, deploying, and experimenting with new network services have evolved as recent rapid progress in virtualization technology. This paper proposes a new network testbed that enhances PlanetLab and is based on a hosted virtual machine monitor (VMM) as a virtual execution environment (VEE) for network services to run on. This paper reports our experiences in developing such a prototype network testbed employing Kernel-based Virtual Machine (KVM) as a hosted VMM. The paper examines the performance and scalability of the prototype to see whether or not it fulfills what we believe to be the requirements for a new network testbed.
Comparison of Cluster Representations from Partial Second- to Full Fourth-Order Cross Moments for Data Stream Clustering
Authors: Mingzhou (Joe) Song, Lin Zhang
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

Under seven external clustering evaluation measures, a comparison is made for cluster representations from the partial second order to the fourth order in data stream clustering. Two external clustering evaluation measures, purity and cross entropy, adopted for data stream clustering performance evaluation in the past, penalize the performance of an algorithm when each hypothesized cluster contains points in different target classes or true clusters, while ignoring the issue of points in a target class falling into different hypothesized clusters. The seven measures will address both sides of the clustering performance. The represented geometry by the partial second-order statistics of a cluster is non-oblique ellipsoidal and cannot describe the orientation, asymmetry, or peakedness of a cluster. The higher-order cluster representation presented in this paper introduces the third and fourth cross moments, enabling the cluster geometry to be beyond an ellipsoid. The higher-order statistics allow two clusters with different representations to merge into a multivariate normal cluster, using normality tests based on multivariate skewness and kurtosis. The clustering performance under the seven external clustering evaluation measures with a synthetic and two real data streams demonstrates the effectiveness of the higher-order cluster representations.
Latched CMOS DRAM Sense Amplifier Yield Analysis and Optimization
Authors: Yan Li, Helmut Schneider, Florian Schnabel, Roland Thewes, Doris Schmitt-Landsiedel
Venue: Integrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation: 18th International Workshop, PATMOS 2008, Lisbon, Portugal, September 10-12, 2008. Revised Selected Papers (2009)

Aiming for a systematic evaluation of DRAM sense amplifier (SA) performance, the SA is modeled using small signal equivalent circuit approach in order to analyze mismatch effects and to support design robustness concerning technology variations. The statistical mismatch of the SA is replaced by equivalent voltage sources. The switching delay between n- and p-sensing transistors of the SA is also analyzed. This approach supports yield consideration of DRAM sense amplifiers in future technologies.
Based on the Possibility of an Association Rule Mining Algorithm
Authors: Zhi-Wei Xu, Xue-Feng Zhang, Hai-Wang Zhang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, first raised the possibility of such a tendency on Services Framework -- a degree of dependence. The framework and support-confidence framework completely different. D database is the tendency of the incident and the extent of the incidents linked to the degree of measure contains rules. Comparatively speaking, more direct causal relationship between the events described, a more effective solution to the problem of redundant Mining Association Rules. In chromosomes, using a novel factor-encoding methods. D. effective compression of the database storage space and improves the speed of operation. From experimental results, using a genetic algorithm to find value in the efficiency and precision rate rules have certain advantages.
Demonstration of cooperative diversity using a custom software-defined radio prototype
Authors: Glenn Bradford, Brian Dunn, Michael Dickens, Zhanwei Sun, J. Nicholas Laneman
Venue: Proceedings of the tenth ACM international symposium on Mobile ad hoc networking and computing (2009)

The goals of this demonstration are twofold. First, the demonstration seeks to provide an easy visualization of the effects multipath fading has on a wireless link and the benefits that cooperative communications can offer in mitigating this channel impairment. It does so by offering visual display of channel quality and receiver statistics. Second, it highlights the usefulness of software-defined radio (SDR) as a tool for wireless experimentation. This second objective is accomplished through the use of a custom SDR prototype within the cooperative demonstration.
A Matrix Inversion Method with YML/OmniRPC on a Large Scale Platform
Authors: Maxime Hugues, Serge G. Petiton
Venue: High Performance Computing for Computational Science - VECPAR 2008: 8th International Conference, Toulouse, France, June 24-27, 2008. Revised Selected Papers (2008)

YML is a dedicated framework to develop and run parallel applications over a large scale middleware. This framework makes easier the use of a grid and provides a high level programming tool. It is independent from middlewares and users are not in charge to manage communications. In consequence, it introduces a new level of communications and it generates an overhead. In this paper, we proposed to show the overhead of YML is tolerable in comparison to a direct use of a middleware. This is based on a matrix inversion method and a large scale platform, Grid'5000.
The Reinforcement Pedagogical Pattern for Industrial Training
Authors: Brian Berenbach, Sascha Konrad
Venue: Proceedings of the 2008 Requirements Engineering Education and Training (2008)

Industrial training imposes some unique restrictions on pedagogical methods, both in terms of ascertaining retention, fostering class participation, and reinforcement. The Reinforcement pedagogical pattern has now been used successfully in training courses and workshops at Siemens AG with positive results. This brief paper describing the Reinforcement pattern explains the rationale for the pattern and its use. Finally our experience of using the pattern in teaching foundation and advanced requirements engineering courses are described.
First International Workshop on Telecom Service Oriented Architectures (TSOA-07)
Authors: Paolo Falcarin, Mariano Belaunde
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Telecommunication services and network features are often tightly coupled, separate, and vertically integrated. This vertical approach has an extremely weakening effect on service provider's ability to develop more complex services that could span over heterogeneous telecom networks and IT services.
Integration of an artificial neural network to predict electrical energy consumption
Authors: Stylianos Sp. Pappas
Venue: Proceedings of the 8th conference on Systems theory and scientific computation (2008)

The scope of this paper is to present an artificial neural network (ANN) capable to perform a midrange estimation and prediction of the Hellenic electricity load demand. The inputs of the ANN are: (a) temperature, (b) relative humidity, (c) day of the week, (d) month and number of air conditioners. The proposed ANN model implements one hidden layer consisted of eighteen neurons. The learning method used is Levenberg - Marquardt and the transfer function is the Hyperbolic Tangent Sigmoid. Matlab Neural Network Toolbox is used throughout the whole simulation process.
Pattern Learning and Decision Making in a Photovoltaic System
Authors: Rongxin Li, Peter Wang
Venue: Proceedings of the 7th International Conference on Simulated Evolution and Learning (2008)

We study the effects of different decision making schemes on the accumulative rewards when photovoltaic (PV) facilities are intended as a potential replacement for conventional peaking power plants. As the amount of solar irradiance usable by a PV module follows a stochastic process, we compare the outcomes using the following two strategies in a stochastic environment: (1) employing an optimal decision making approach without any specific knowledge of the environment; and (2) optimal decision making based upon learning patterns of the environment process. We examine the possibility of integrating a pattern learning approach --- called an &epsilon;-Machine --- with a Partially Observable Markov Decision Process (POMDP). This approach has been motivated in part by the fact that efforts in extending traditional learning approaches to POMDPs have so far achieved only limited success. The PV facility in our model consists of a PV panel and a battery, with an associated local, non-critical load. Under the assumption that any PV generated power exceeding the maximum local consumption capacity must be dumped when the battery is full, the goal of the autonomous control agent is to maintain the maximum output potential to most effectively offset unexpected demand peaks, while minimizing energy wastage in the presence of strong solar irradiance. The environment is assumed to follow a Markov process of a different order than the part of the system under the influence of the agent.
Research on anycast routing algorithm based on genetic algorithm
Authors: Zhu Chun, Jin Min
Venue: Proceedings of the 3rd WSEAS international conference on Circuits, systems, signal and telecommunications (2009)

Anycast is a new network service, has been defined a standard communication model of IP version 6. In order to implement multi-destination and multi-path anycast routing on the heavy load network, this paper proposes a new anycast routing algorithm based on genetic algorithm and presents a heuristic genetic algorithmic to solve shortest path routing optimization problem. The network experimental simulation results show that this algorithm can get more resolution at less time and more balanced network load, enhance search ratio and the availability of network resource and improve the quality of service.