ppxscal/embedding_network huggingface dataset:
An integrated and adaptive decision-support framework for high-tech manufacturing and service networks
Authors: Peter Lendermann, Malcolm Yoke Hean Low, Boon Ping Gan, Nirupam Julka, Lai Peng Chan, Loo Hay Lee, Simon J. E. Taylor, Stephen J. Turner, Wentong Cai, Xiaoguang Wang, Terence Hung, Leon F. McGinnis, Stephen Buckley
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This article describes the results of one of the ten pilot programmes under the Integrated Manufacturing and Service Systems (IMSS) initiative pursued by the Agency for Science, Technology and Research (A* STAR) in Singapore. The objective of this particular programme is to investigate how design, analysis, enhancement and implementation of critical business processes in a manufacturing and service network can be realised using one single simulation/application framework. The overall architecture of the framework outlines how commercial simulation packages and web-service based business process application components would have to be connected through a commercial application framework to achieve maximum leverage and re-usability of the applications involved. In the pilot phase of this programme, research issues were also addressed with regard to mechanisms for interoperation between commercial simulation packages, symbiotic interaction between simulation-based decision support components and physical systems, and simulation speed-up through multi-objective optimal computing budget allocation techniques on a grid infrastructure.
Dynamic Data Scheduling and Resource Management Using Max-utility Estimation in Next Generation Wireless Networks
Authors: Kunqi Guo, Lixin Sun, Shilou Jia, Mingji Yang
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

A constrained resource allocation scheme is proposed in this paper to achieve optimized dynamic data scheduling in next generation wireless networks (NGWN). By modeling the problem as the solution to the maximization of the total utility function, we derive the optimization resource allocation model by instantaneously estimating the integrated information on channel condition and queue length of each user node as well as the set of subcarriers available. On the problem of maximizing the total utility function with respect to the average waiting time of each user queue over time window, we present an algorithm with low computation complexity for dynamic subcarrier allocation. Simulation results and mathematical analyses demonstrate that compared with the conventional approach, this scheme achieves higher efficiency due to making the most use of diversity of time, frequency and multiuser and can provide different required level of fairness by appropriately devising the utility function.
Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams
Authors: Elsa Loekito, James Bailey
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

Patterns of contrast are a very important way of comparing multi-dimensional datasets. Such patterns are able to capture regions of high difference between two classes of data, and are useful for human experts and the construction of classifiers. However, mining such patterns is particularly challenging when the number of dimensions is large. This paper describes a new technique for mining several varieties of contrast pattern, based on the use of Zero-Suppressed Binary Decision Diagrams (ZBDDs), a powerful data structure for manipulating sparse data. We study the mining of both simple contrast patterns, such as emerging patterns, and more novel and complex contrasts, which we call disjunctive emerging patterns. A performance study demonstrates our ZBDD technique is highly scalable, substantially improves on state of the art mining for emerging patterns and can be effective for discovering complex contrasts from datasets with thousands of attributes.
Affinity Hybrid Tree: An Indexing Technique for Content-Based Image Retrieval in Multimedia Databases
Authors: Kasturi Chatterjee, Shu-Ching Chen
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

A novel indexing and access method, called Affinity Hybrid Tree (AH-Tree), is proposed to organize large image data sets efficiently and to support popular image access mechanisms like Content-Based Image Retrieval (CBIR) by embedding the high-level semantic image-relationship in the access mechanism as it is. AH-Tree combines Space- Based and Distance-Based indexing techniques to form a hybrid structure which is efficient in terms of computational overhead and fairly accurate in producing query results close to human perception. Algorithms for similarity (range and k-nearest neighbor) queries are implemented. Results from elaborate experiments are reported which depict a low computational overhead in terms of the number of I/O and distance computations and a high relevance of query results. The proposed index structure solves the existing problems of introducing high-level image relationships in a retrieval mechanism without going through the pain of translating the content-similarity measurement into feature-level equivalence and yet maintaining an efficient structure to organize the large sets of images.
Building a Game Development Program
Authors: Lawrence Argent, Bill Depper, Rafael Fajardo, Sarah Gjertson, Scott T. Leutenegger, Mario A. Lopez, Jeff Rutenbeck
Venue: Computer (2006)

In 2004, the University of Denver began offering majors in game development, with research and scholarship directed toward "humane gaming," a term that includes medical and educational game applications and socially conscious gaming.
Reviving a mechanistic view of CPM schedules in the age of information technology
Authors: Gunnar Lucko
Venue: Proceedings of the 37th conference on Winter simulation (2005)

This paper argues for reviving a more mechanistic view of CPM scheduling. It first reviews the clarity of displaying both the time and logic information of schedules in the graphics outputs of scheduling software used in construction practice. While such software offers an abundance of features, the true nature of schedules may remain hidden behind graphics defaults. Two methods introduced in the literature, fenced bar charts and a mechanical model, are then brought forth as examples of techniques supporting an intuitive structural understanding of schedules. Both stress the equal importance of activities and logic links for displaying schedules. Comparisons between these mechanistic methods and scheduling software are drawn and recommendations for achieving optimum graphical representations of schedules are provided. Eventually, a revised approach that acknowledges the complexity of schedules and the need for their unambiguous display can contribute to reducing errors and to an overall improved use of CPM scheduling.
Modeling and simulation of residents&#x2019; response in nuclear disaster
Authors: Taro Kanno, Tatsuya Shimizu, Kazuo Furuta
Venue: Cognition, Technology and Work (2006)

It is important to model and predict residents&#x2019; behaviors in an emergency in order to establish good evacuation schemes during disasters. This research presents modeling and simulation of residents&#x2019; behaviors in a nuclear disaster focusing on residents&#x2019; decision-making processes: information acquisition, situation assessment, and selecting actions. We selected qualitative causal relations between residents&#x2019; behaviors and the attributes of information, human, and situations from 57 reviews of the past 12 disaster cases. We then constructed a conceptual model of residents&#x2019; behaviors in a conventional stimulus&#x2013;organism&#x2013;response (S&#x2013;O&#x2013;R) model of human information processing. We adopted probabilistic reasoning (Bayesian belief network) to simulate the situation assessment of a resident in a nuclear disaster. We carried out a simulation using the announcement log of the JCO criticality accident and confirmed that the model could simulate the tendencies in residents&#x2019; behaviors observed in the actual disaster and can reflect various features of the conceptual model.
A Task Decomposition Algorithm Using Mixtures of Normal Distributions for Classification Problems
Authors: Seiji Ishihara, Harukazu Igarashi
Venue: Proceedings of the Sixth International Conference on Hybrid Intelligent Systems (2006)

This paper proposes an algorithm for decomposing a multi-class classification problem into a set of two-class classification problems. The algorithm divides a set of input pattern vectors in each class into subsets according to the distribution of the selected input pattern vectors. The distribution is represented by a mixture of normal distributions, and the number of subsets is defined by using MDL criterion. The algorithm can be applied for constructing an effective modular neural network. We show also the experimental results of the construction and the advantages of the algorithm.
ZIP60: an enhanced variant of the ZIP trading algorithm
Authors: Dave Cliff
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

The "ZIP" adaptive automated trading algorithm has been shown to outperform human traders in experimental studies of continuous double auction (CDA) markets populated by mixtures of human and "software robot" traders. This paper introduces a more sophisticated version of the ZIP algorithm, called ZIP60 because it requires the values of 60 parameters to be set correctly. ZIP60 is shown here to produce significantly improved results in comparison to the original ZIP algorithm (called "ZIP8" hereafter). A genetic algorithm is used to search the 60-dimensional parameter space, and it finds parameter values that yield ZIP60 traders with mean scores that are significantly better than those of ZIP8s. Principal component analysis of the best evolved ZIP60 parameter-sets establishes that no ZIP8 solutions are embedded in the 60-d space. Moreover, the results presented here cast doubt on earlier ZIP8 results concerning the evolution of new 'hybrid' auction mechanisms that appeared to be improvements on the CDA.
Research of Government Horizon Business Integration Management System Based on HRNM and Agent
Authors: Xin Ye, Xingkai Yang, Liming Zhu, Ning Wang, Jiangnan Qiu
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

Aiming at government horizon business integration that has becoming a focus problem in the field of e-government, the hierarchical role network model (HRNM) is presented in this paper. The HRNM is considered as the management and control model of horizon business integration. Furthermore, the architecture of the government horizon business integration management system (GHBIMS) based on HRNM and Agent is presented. The HRNM and GHBIMS proposed by this paper stress the importance of the role, satisfy the characteristics and requirements of government horizon business integration, and have a wide application prospect in practice.
Fractal Image Compression on Spiral Architecture
Authors: Xiangjian He, Huaqing Wang, Qiang Wu, Tom Hintz, Namho Hur
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

Image compression has many applications. For example, it is an important step for distributed and network based pattern recognition. For real time object recognition or reconstruction, image compression can greatly reduce the image size, and hence increase the processing speed and enhance performance. Fractal image compression is a relatively recent image compression method. Its basic idea is to represent images as a fixed point of a contractive Iterated Function System (IFS). Spiral Architecture (SA) is a novel image structure on which images are displayed as a collection of hexagonal pixels. The efficiency and accuracy of image processing on SA have been demonstrated in many recently published papers. We have shown the existence of contractive IFS's through the construction of a Complete Metric Space on SA. The selection of range and domain blocks for fractal image compression is highly related to the uniform image separation specific to SA. In this paper, we will review the current research work on fractal image compression based on SA. We will compare the results obtained on SA and the traditional square structure in terms of compression ratio and PSNR.
Optical and structural properties of sol-gel derived materials embedded in porous anodic alumina
Authors: N. V. Gaponenko, I. S. Molchan, D. A. Tsyrkunov, G. K. Maliarevich, M. Aegerter, J. Puetz, N. Al-Dahoudi, J. Misiewicz, R. Kudrawiec, V. Lambertini, N. Li Pira, P. Repetto
Venue: Microelectronic Engineering (2005)

Structures comprising a xerogel, doped with lanthanide ions (erbium, terbium and europium), embedded in porous anodic alumina (PAA) have been fabricated and their optical and electrical characteristics have been studied. Erbium photoluminescence at 1.53@mm from titania xerogel/PAA was found to increase with the number of xerogel layers and erbium concentration for the excitation wavelength 532nm, matching the area of transparency of both titania xerogel and PAA. Visible green and red electroluminescence was observed for terbium- and europium-doped In"2O"3 and SnO"2 xerogels embedded in porous anodic alumina. The improvement of the electrical properties of the xerogel/PAA cell is discussed, taking into account the observed ability of conducting In"2O"3:Sn (ITO) nanoparticles to penetrate into the anodic alumina pores.
A multiple computer system for reliable transaction processing
Authors: John V. Levy
Venue: ACM SIGSMALL Newsletter (1978)

The Tandem 16 system is a novel solution to the problem of providing a cost-effective and reliable computer system for commercial transaction processing. The system design goal is to continue operation in spite of any single component failure.This paper presents an overview of the hardware structure of the system. It is a multiple computer system, with no shared main memory. The software structure that implements "NonStop" (or fault-tolerant) computing is then described. The key concept is "paired processes". For every software module that is to run "NonStop", there is a backup copy sleeping in an alternate processor module. On detection of a failure, the backup copy is activated, and it takes over processing at the last checkpoint. All system processes are fault-tolerant, and considerable care is taken to avoid duplication of I/O operations during recovery.
Sustained Mnemonic Response in the Human Middle Frontal Gyrus during On-Line Storage of Spatial Memoranda
Authors: H.-C. Leung, J. C. Gore, P. S. Goldman-Rakic
Venue: Journal of Cognitive Neuroscience (2002)

The mapping of cognitive functions to neural systems is a central goal of cognitive neuroscience. On the basis of homology with lesion and physiological studies in nonhuman primates, Brodmann's area (BA) 46/9 in the middle frontal gyrus (MFG) has been proposed as the cortical focus for both the storage as well as processing components of working memory in the human brain, but the evidence on the segregation of these components and their exact areal localization has been inconsistent. In order to study this issue and increase the temporal resolution of functional mapping, we disambiguated the storage component of working memory from sensory and motor responses by employing functional magnetic resonance imaging (fMRI) in spatial delayed-response (DR) tasks with long delay intervals and different conditions of demand. We here show that BA 46 can support a sustained mnemonic response for as long as 24 sec in a high-demand task and the signal change in this area exceeded that in the other prefrontal areas examined. Our findings support a conservation of functional architecture between human and nonhuman primate in showing that the MFG is prominently engaged in the storage of spatial information.
Type-theoretic design patterns
Authors: Ondrej Rypacek, Roland Backhouse, Henrik Nilsson
Venue: Proceedings of the 2006 ACM SIGPLAN workshop on Generic programming (2006)

The development of design patterns in object-oriented programming aims at capturing good software design in a reusable generic form. However, design patterns are not expressible in conventional object-oriented programming languages. To address this shortcoming, we need to model and understand design patterns precisely. We achieve this by identifying operators characterising the most fundamental design patterns in a way that enables the construction of object-oriented programs with provable structural and behavioural properties. We use dependent-type theory to define a simplified, functional model of object-oriented programming. Design patterns are modelled in this setting as operators on object signatures and implementations. We present examples of several basic design operators and design patterns modelled in this setting and show how properties of their composition can be proven.
Vertex-transformation streams
Authors: Youngmin Kim, Chang Ha Lee, Amitabh Varshney
Venue: Graphical Models (2006)

Recent trends in parallel computer architecture strongly suggest the need to improve the arithmetic intensity (the compute to bandwidth ratio) for greater performance in time-critical applications, such as interactive 3D graphics. At the same time, advances in stream programming abstraction for graphics processors (GPUs) have enabled us to use parallel algorithm design methods for GPU programming. Inspired by these developments, this paper explores the interactions between multiple data streams to improve arithmetic intensity and address the input geometry bandwidth bottleneck for interactive 3D graphics applications. We introduce the idea of creating vertex and transformation streams that represent large point datasets via their interaction. We discuss how to factor such point datasets into a set of source vertices and transformation streams by identifying the most common translations amongst vertices. We accomplish this by identifying peaks in the cross-power spectrum of the dataset in the Fourier domain. We validate our approach by integrating it with a view-dependent point rendering system and show significant improvements in input geometry bandwidth requirements as well as rendering frame rates.
What makes a good programmer?
Authors: Casey G. Cegielski, Dianne J. Hall
Venue: Communications of the ACM (2006)

An examination of the relationship of values, cognitive ability, and personality as predictors of object-oriented programming performance.
Activity in Human Frontal Cortex Associated with Spatial Working Memory and Saccadic Behavior
Authors: Bradley R. Postle, Jeffrey S. Berger, Alexander M. Taich, Mark D'esposito
Venue: Journal of Cognitive Neuroscience (2000)

We examined, with event-related fMRI, two hypotheses about the organization of human working memory function in frontal cortex: (1) that a region immediately anterior to the frontal eye fields (FEF) (superior frontal cortex, SFC) is specialized for spatial working memory (Courtney, et al., 1998); and (2) that dorsolateral prefrontal cortex (PFC) plays a privileged role in the manipulation of spatial stimuli held in working memory (Owen, et al., 1996; Petrides 1994). Our delayed-response task featured 2-D arrays of irregularly arranged squares that were highlighted serially in a random sequence. The Forward Memory condition required maintenance of the spatio-temporal sequence, the Manipulate Memory condition required reordering this sequence into a new spatially defined order, the Guided Saccade condition required saccades to highlighted squares in the array, but no memory, and the Free Saccade condition required self-paced, horizontal saccades. The comparison of fMRI signal intensity associated with 2-D saccade generation (Guided Saccades) versus fMRI signal intensity associated with the delay period of the working memorials condition revealed no evidence for greater working memory-related activity than saccade-related activity in SFC in any individual subject, nor at the level of the group, and greater 2-D saccade than delay-period activity in three of five subjects. These results fail to support the hypothesis that spatial working memory-related activity is represented preferentially in a region of SFC anterior to the FEF (Courtney, et al., 1998). The comparison of maintenance versus manipulation of spatio-temporal information in working memory revealed significantly greater activity associated with the latter in dorsolateral PFC, but not in ventrolateral PFC or in SFC. These results suggest that the delay-related function of SFC is limited to the maintenance of spatial information, and that this region does not support the nonmnemonic executive control functions supported by dorsolateral PFC. These results also indicate that the preferential recruitment of dorsolateral PFC for the manipulation of information held in working memory applies to tasks employing spatial stimuli, as well as to tasks employing verbal stimuli (D'Esposito, et al., 1999); Petrides et al., 1993; Postle et al., 1999).
"Where to?" Remote Memory for Spatial Relations and Landmark Identity in Former Taxi Drivers with Alzheimer's Disease and Encephalitis
Authors: R. Shayna Rosenbaum, Fuqiang Gao, Brian Richards, Sandra E. Black, Morris Moscovitch
Venue: Journal of Cognitive Neuroscience (2005)

Recent research suggests that the hippocampus is not needed for the maintenance and recovery of extensively used environments learned long ago. Instead, a network of neocortical regions differentially supports memory for locationnavigation knowledge and visual appearance of well-known places. In this study, we present a patient, S. B., who was diagnosed with probable Alzheimer's disease long after retiring from his 40 years as a taxi driver in downtown Toronto, a place that he has visited rarely, if ever, in the last decade. His performance was compared to that of two other retired taxi drivers, L. R., who developed encephalitis after retirement, and I. L., who is without neurological illness, and a group of eight healthy control participants who were never taxi drivers but all of whom worked or lived in downtown Toronto until at least 10 years ago. Despite S. B.'s widespread atrophy, which has affected mainly his hippocampus and part of his occipitotemporal cortex, he performed at least as well as all other participants on remote memory tests of spatial location and mental navigation between well-known Toronto landmarks. Unlike the comparison populations, however, he was unable to discriminate between the appearances of landmarks that he had visited frequently in his many years as a taxi driver from unknown buildings. This profound deficit extended to famous world landmarks but not to famous faces and does not appear to be semantic in nature. These findings add further support to the claim that the hippocampus is not necessary for mental navigation of old environments and suggest that expertise is not sufficient to protect against landmark agnosia.
Fast algorithm for computing the forward and inverse MDCT in MPEG audio coding
Authors: T. K. Truong, P. D. Chen, T. C. Cheng
Venue: Signal Processing (2006)

The modified discrete cosine transform (MDCT) is always employed in transform-coding schemes as the analysis/synthesis filter bank. In this paper, an efficient algorithm for MDCT and inverse MDCT (IMDCT) computation for MPEG-1 audio layer III and MPEG-2 international audio-coding standards is proposed, using only the type-II DCT. Finally, the proposed algorithm is compared to the similar algorithms in this paper.