ppxscal/embedding_network huggingface dataset:
Memory-Based State-Estimation
Authors: Matthias Jüngel, Heinrich Mellmann
Venue: Fundamenta Informaticae (2008)

In this paper we introduce a state-estimation method that uses a short-term memory to calculate the current state. A common way to solve state estimation problems is to use implementations of the Bayesian algorithmlike Kalman filters or particle filters. When implementing a Bayesian filter several problems can arise. One difficulty is to obtain error models for the sensors and for the state transitions. The other difficulty is to find an adequate compromise between the accuracy of the belief probability distribution and the computational costs that are needed to update it. In this paper we show how a short-term memory of perceptions and actions can be used to calculate the state. In contrast to the Bayesian filter, this method does not need an internal representation of the state which is updated by the sensor and motion information. It is shown that this is especially useful when information of sparse sensors (sensors with non-uniquemeasurements with respect of the state) has to be integrated.
Energy-optimal synchronization primitives for single-chip multi-processors
Authors: Cesare Ferri, Ruth Iris Bahar, Mirko Loghi, Massimo Poncino
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

Synchronization among tasks accounts for a sizable fraction of the energy consumption and execution time of applications running on Multi-Processor Systems-on-Chips platforms. In order to achieve fast and energy-efficient operations, it is therefore essential to implement efficient and power-frugal synchronization primitives. The design of such primitives is complicated by several software and hardware issues, such as: processors running at different speeds, different implementations of the waiting phase upon entering the critical section, and the ratio between static and dynamic power. In this work, we compare a set of classical implementations (i.e., based on busy waiting, or on sleep states) of mutex semaphores, and propose a hybrid (wait/sleep) semaphore in which the sleep state is entered only after a number of busywait cycles. The proposed scheme provides the best overall energy-delay product with respect to previously proposed schemes. Furthermore, we identify an optimal length of the busy-wait cycles, which is empirically shown to depend on the time required to switch from the sleep to the active state.
Issues in programming language design: an overview
Authors: Anthony I. Wasserman
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The past few years have witnessed an increased understanding of the relationship between programming languages and problem solving. Programming is now understood to be a rather difficult task which requires the simultaneous application of principles, skills, and art. Computer scientists have recognized that the features of a programming language can have a significant effect upon the ease with which reliable programs can be developed. It has also been observed that certain languages and language features are particularly well suited for the use of systematic programming techniques, while others hinder or discourage such discipline. Of course, it is possible to write well-structured, clearly organized programs in any programming language, but such programs have often been the exception rather than the rule.
3D MDCT-based system for planning peripheral bronchoscopic procedures
Authors: Jason D. Gibbs, Michael W. Graham, William E. Higgins
Venue: Computers in Biology and Medicine (2009)

The diagnosis and staging of lung cancer often begins with the assessment of a suspect peripheral chest site. Such suspicious peripheral sites may be solitary pulmonary nodules or other abnormally appearing regions of interest (ROIs). The state-of-the-art process for assessing such peripheral ROIs involves off-line procedure planning using a three-dimensional (3D) multidetector computed tomography (MDCT) chest scan followed by bronchoscopy with an ultrathin bronchoscope. We present an integrated computer-based system for planning peripheral bronchoscopic procedures. The system takes a 3D MDCT chest image as input and performs nearly all operations automatically. The only interaction required by the physician is the selection of ROI locations. The system is computationally efficient and fits smoothly within the clinical work flow. Integrated into the system and described in detail in the paper is a new surface-definition method, which is vital for effective analysis and planning to peripheral sites. Results demonstrate the efficacy of the system and its usage for the live guidance of ultrathin bronchoscopy to the periphery.
A Novel Region-based Image Annotation Using Multi-instance Learning
Authors: Xiaohong Hu, Xu Qian, Xinming Ma, Ziqiang Wang
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper, we formulate image annotation as a semi-supervised learning problem under multi-instance learning framework. A novel graph based semi-supervised learning approach to image annotation using multiple instances is presented, which extends the conventional semi-supervised learning to multi-instance setting by introducing the adaptive geometric relationship between two bags of instances. The experiments over Corel images have shown that this approach outperforms other methods and is effective for image annotation.
Computing intersections of planar spline curves using knot insertion
Authors: Knut Mørken, Martin Reimers, Christian Schulz
Venue: Computer Aided Geometric Design (2009)

We present a new method for computing intersections of two parametric B-spline curves. We use an intersection of the control polygons as an approximation for an intersection of the curves in combination with knot insertion. The resulting algorithm is asymptotically Newton-like, but without the need of a starting value. Like Newton's method, it converges quadratically at transversal intersections, the analogue to simple roots. It is a generalization of an algorithm developed by two of the authors for computing zeros of spline functions.
A Digital Image Encryption Algorithm Based on Hyper-chaotic Cellular Neural Network
Authors: Jun Peng, Du Zhang, Xiaofeng Liao
Venue: Fundamenta Informaticae (2009)

Using Chaotic characteristics of dynamic system is a promising direction to design cryptosystems that play a pivotal role in a very important engineering application of cognitive informatics, i.e., information assurance and security. However, encryption algorithms based on the lowdimensional chaotic maps face a potential risk of the keystream being reconstructed via return map technique or neural network method. In this paper, we propose a new digital image encryption algorithm that employs a hyper-chaotic cellular neural network. To substantiate its security characteristics, we conduct the following security analyses of the proposed algorithm: key space analysis, sensitivity analysis, information entropy analysis and correlation coefficients analysis of adjacent pixels. The results demonstrate that the proposed encryption algorithm has desirable security properties and can be deployed as a cornerstone in a sound security cryptosystem. The comparison of the proposed algorithm with five other chaos-based image encryption algorithms indicates that our algorithm has a better security performance.
Can the grammar of schooling be changed?
Authors: Asunción Martínez Arbelaiz, José Miguel Correa Gorospe
Venue: Computers Education (2009)

In this article we propose that the grammar of schooling [Tyack, D., & Tobin, W. (1994). The ''grammar'' of schooling: Why has it been so hard to change? American Educational Research Journal, 31(3), 453-479.] is responsible not only for the well-known and world-wide difficulties in integrating ICT into formal educational settings, but also for the replication of traditional models when this integration occurs. In clear contrast with this domain, in out-of-school projects ICT is integrated in innovative and truly ''disruptive'' [Blin, F., & Munro, M. (2008). Why hasn't technology disrupted academics' teaching practices. Understanding resistance to change through the lens of activity theory. Computers and Education, 50(2), 475-490.] ways. To exemplify this integration, we have selected and described two successful, although different in nature, out-of-school projects. The first one, Pincel y Raton, seeks to develop creativity in children and to educate them to use ICT in a reflexive and useful manner. The second project, Menosca, pursues children's understanding of their historical and social environment through the use of GPSs, digital photography and web-page design. Both experiences underscore the multiple and varied possibilities that ICT affords for meaningful learning when the constraints inherent to the school setting do not seem to apply. By contrasting the formal and the out-of-school experiences, it is possible to unveil and bring to consciousness the principles and rules of the ''grammar of schooling''. We propose that becoming aware of the features of this grammar, i.e., philosophy, course design, time and place, tasks, resources, outcomes and products and assessment, is the first step toward change.
Multidisciplinary informatics: a primer for course development
Authors: Jody K. Smith, John P. Buerck, Lee L. McDurmont,  Jr., Patricia G. Bagsby
Venue: Journal of Computing Sciences in Colleges (2009)

The discipline of informatics continues to emerge as an integral component of information technology. Informatics is defined by the authors as the multidimensional use of technology to support knowledge discovery and dissemination, assisting the decision maker across a variety of academic disciplines and professional fields. As informatics continues to grow, so does the need to provide educational opportunities for students. This paper outlines the purpose, development and teaching methodology of a primer course in informatics. The paper will include a set of topics that may be used as the foundation for a text to accompany the course along with a discussion of lessons learned from teaching the course for the first time.
Efficient Enumeration of Ordered Trees with k Leaves (Extended Abstract)
Authors: Katsuhisa Yamanaka, Yota Otachi, Shin-Ichi Nakano
Venue: Proceedings of the 3rd International Workshop on Algorithms and Computation (2009)

In this paper, we give a simple algorithm to generate all ordered trees with exactly n vertices including exactly k leaves. The best known algorithm generates such trees in O(n&thinsp;&minus;&thinsp;k) time for each, while our algorithm generates such trees in O(1) time for each in worst case.
O3-SAN based on resource joint scheduling model in service-oriented optical networks
Authors: Xiuzhong Chen, Jie Zhang, Wanyi Gu
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

Traditional SAN (Storage Area Networks) are deployed by organization and used by themselves. These SAN are characterized by SAN islands-pockets of noninterconnected SAN infrastructure and SMEs (Small and medium-sized enterprises) cannot afford the expensive private SAN. The O3-SAN are Open, Optimized and Optical SAN architecture based on the service-oriented optical networks. A novel model of joint scheduling of optical resource (lightpath) and storage devices are presented, and then O3-SAN are implemented on the service plane based on web services (ws-sp). Results are showed and explained finally.
Third International Workshop on Engineering Service-Oriented Applications: Analysis, Design & Composition
Authors: George Feuerlicht, Christian Zirpins, Guadalupe Ortiz, Yen-Jao Chung, Winfried Lamersdorf, Wolfgang Emmerich
Venue: Service-Oriented Computing - ICSOC 2007 Workshops: ICSOC 2007, International Workshops, Vienna, Austria, September 17, 2007, Revised Selected Papers (2009)

Wide adoption of SOA (Service-Oriented Architecture) by the industry and the growing number of large-scale Web Services projects have created an urgent need for research community and industry practitioners to develop comprehensive methodologies that support the entire SDLC (Software Development Lifecycle) of service-oriented applications. To ensure that resulting services are stable, reusable and extendable, such methodologies must be based on sound engineering principles and guide developers through the analysis, design, implementation and deployment phases of the service-oriented SDLC.
A meetings flow approach for conducting student final-year projects
Authors: Chung-Yang Vincent Chen
Venue: Journal of Computing Sciences in Colleges (2009)

This paper presents a brief introduction of the meetings-flow approach for conducting student final-year group projects and uses a project case to validate it. The preliminary results show that the approach is (1) an aid for teachers to direct and supervise student project development, and (2) a group process for students to carry out and for stakeholders to participate in expected collaborative activities.
ReDSOM: Relative Density Visualization of Temporal Changes in Cluster Structures Using Self-Organizing Maps
Authors: Denny, Graham J. Williams, Peter Christen
Venue: Proceedings of the 2008 Eighth IEEE International Conference on Data Mining (2008)

We introduce a Self-Organizing Map (SOM) based visualization method that compares cluster structures in temporal datasets using Relative Density SOM (ReDSOM) visualization. Our method, combined with a distance matrix-based visualization, is capable of visually identifying emerging clusters, disappearing clusters, enlarging clusters, contracting clusters, the shifting of cluster centroids, and changes in cluster density. For example, when a region in a SOM becomes significantly more dense compared to an earlier SOM, and well separated from other regions, then the new region can be said to represent a new cluster. The capabilities of ReDSOM are demonstrated using synthetic datasets, as well as real-life datasets from the World Bank and the Australian Taxation Office. The results on the real-life datasets demonstrate that changes identified interactively can be related to actual changes. The identification of such cluster changes is important in many contexts, including the exploration of changes in population behavior in the context of compliance and fraud in taxation.
Parametric polynomial spectral factorization using the sum of roots and its application to a control design problem
Authors: Hirokazu Anai, Shinji Hara, Masaaki Kanno, Kazuhiro Yokoyama
Venue: Journal of Symbolic Computation (2009)

This paper presents an algebraic approach to polynomial spectral factorization, an important mathematical tool in signal processing and control. The approach exploits an intriguing relationship between the theory of Grobner bases and polynomial spectral factorization which can be observed through the sum of roots, and allows us to perform polynomial spectral factorization in the presence of real parameters. It is discussed that parametric polynomial spectral factorization enables us to express quantities such as the optimal cost in terms of parameters and the sum of roots. Furthermore an optimization method over parameters is suggested that makes use of the results from parametric polynomial spectral factorization and also employs two quantifier elimination techniques. This proposed approach is demonstrated in a numerical example of a particular control problem.
Remote data collection case study: telephone order processing system (TOPS)
Authors: M. H. Resnick
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The IBM System/7 touch-tone order/entry inventory allocation system has been installed at Forman Bros. since January 1973. While the system is a Field Developed Program (F.D.P.) we at Forman Bros. feel we had a great deal to do with its development and implementation. The F.D.P. has been modified in the past year to fit our business requirements. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Effects of the number of hidden nodes used in a structured-based neural network on the reliability of image classification
Authors: Weibao Zou, Yan Li, Arthur Tang
Venue: Neural Computing and Applications (2009)

A structured-based neural network (NN) with backpropagation through structure (BPTS) algorithm is conducted for image classification in organizing a large image database, which is a challenging problem under investigation. Many factors can affect the results of image classification. One of the most important factors is the architecture of a NN, which consists of input layer, hidden layer and output layer. In this study, only the numbers of nodes in hidden layer (hidden nodes) of a NN are considered. Other factors are kept unchanged. Two groups of experiments including 2,940 images in each group are used for the analysis. The assessment of the effects for the first group is carried out with features described by image intensities, and, the second group uses features described by wavelet coefficients. Experimental results demonstrate that the effects of the numbers of hidden nodes on the reliability of classification are significant and non-linear. When the number of hidden nodes is 17, the classification rate on training set is up to 95%, and arrives at 90% on the testing set. The results indicate that 17 is an appropriate choice for the number of hidden nodes for the image classification when a structured-based NN with BPTS algorithm is applied.
Performance analysis of database join processors
Authors: Fu Tong, S. Bing Yao
Venue: Proceedings of the June 7-10, 1982, national computer conference (1982)

The architecture and performance of a two-dimensional join processor for relational databases are introduced in this paper. The performance of several recently proposed join processor designs is also analyzed. The processing time (performance) and hardware complexity (cost) of these different join processor approaches are compared in detail. The result shows that the two-dimensional join processor array has the best performance/cost ratio among the design approaches considered.
The crossing numbers of generalized Petersen graphs with small order
Authors: Xiaohui Lin, Yuansheng Yang, Wenping Zheng, Lei Shi, Weiming Lu
Venue: Discrete Applied Mathematics (2009)

The generalized Petersen graph P(n,k) is an undirected graph on 2n vertices with V(P(n,k))={a"i,b"i:0@?i@?n-1} and E(P(n,k))={a"ib"i,a"ia"i"+"1,b"ib"i"+"k:0@?i@?n-1,subscripts modulo n}. Fiorini claimed to have determined the crossing numbers of P(n,3) and showed all the values of cr(P(n,k)) for n up to 14, except 12 unknown values. Lovrecic Sarazin proved cr(P(10,4))=cr(P(10,6))=4. Richter and Salazar found a gap in Fiorini's paper, which invalidated his principal results about cr(P(n,3)), and gave the correct proof for cr(P(n,3)). In this paper, we show the crossing numbers of all P(n,k) for n up to 16.
Architecture for a graduate level educational program in the area of computer systems in medicine
Authors: Laurens V. Ackerman, Daniel K. Harris
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

A professional discipline, in its embryonic stages of development yields practitioners who, through interest and/or circumstance, avail themselves of fragmented knowledge from other disciplines, synthesize intellectual common denominators, and apply these common denominators consistently to a multiplicity of problem situations. Eventually, the embryonic discipline will generate additional knowledge from within, which is generally considered to be a necessary precursor to formal acknowledgment by society that a new discipline has in fact emerged.
Graph nodes clustering with the sigmoid commute-time kernel: A comparative study
Authors: Luh Yen, Francois Fouss, Christine Decaestecker, Pascal Francq, Marco Saerens
Venue: Data Knowledge Engineering (2009)

This work addresses the problem of detecting clusters in a weighted, undirected, graph by using kernel-based clustering methods, directly partitioning the graph according to a well-defined similarity measure between the nodes (a kernel on a graph). The proposed algorithms are based on a two-step procedure. First, a kernel or similarity matrix, providing a meaningful similarity measure between any couple of nodes, is computed from the adjacency matrix of the graph. Then, the nodes of the graph are clustered by performing a kernel clustering on this similarity matrix. Besides the introduction of a prototype-based kernel version of the gaussian mixtures model and Ward's hierarchical clustering, in addition to the already known kernel k-means and fuzzy k-means, a new kernel, called the sigmoid commute-time kernel (K"C"T^S) is presented. The joint use of the K"C"T^S kernel matrix and kernel clustering appears to be quite effective. Indeed, this methodology provides the best results on a systematic comparison with a selection of graph clustering and communities detection algorithms on three real-world databases. Finally, some links between the proposed hierarchical kernel clustering and spectral clustering are examined.
Parallel LDPC Decoding on the Cell/B.E. Processor
Authors: Gabriel Falcão, Leonel Sousa, Vitor Silva, José Marinho
Venue: Proceedings of the 4th International Conference on High Performance Embedded Architectures and Compilers (2008)

Low-Density Parity-Check (LDPC) codes are among the best error correcting codes known and have been recently adopted by data transmission standards, such as the second generation for Satellite Digital Video Broadcasting (DVB-S2) and WiMAX. LDPC codes are based on sparse parity-check matrices and use message-passing algorithms, also known as belief propagation, which demands very intensive computation. For that reason, VLSI dedicated architectures have been proposed in the past few years, to achieve real-time processing. This paper proposes a new flexible and programmable approach for LDPC decoding on a heterogeneous multicore Cell Broadband Engine (Cell/B.E.) architecture. Very compact data structures were developed to represent the bipartite graph for both regular and irregular LDPC codes. They are used to map the irregular behavior of the Sum-Product Algorithm (SPA) used in LDPC decoding into a computing model that expresses parallelism and locality of data by decoupling computation and memory accesses. This model can be used in general for exploiting capabilities of modern multicore architectures. For the Cell/B.E., in particular, stream-based programs were developed for simultaneous multicodeword LDPC decoding by using SIMD features and a low-latency DMA-based data communication mechanism between processors. Experimental results show significant throughputs that compare well with state-of-the-art VLSI-based solutions.
Understanding software through empirical reliability analysis
Authors: T. A. Thayer
Venue: Proceedings of the May 19-22, 1975, national computer conference and exposition (1975)

The need for improving the reliability of delivered software is becoming increasingly obvious to both the purchasers and producers of today's software systems. As noted by Boehm, the records show many examples of software systems which, when delivered for operational use, either performed in a degraded fashion or failed to perform at all. The results are higher software costs and delays in operational usage.