ppxscal/embedding_network huggingface dataset:
Dreaming and Episodic Memory: A Functional Dissociation?
Authors: Magdalena J. Fosse, Roar Fosse, J. Allan Hobson, Robert J. Stickgold
Venue: Journal of Cognitive Neuroscience (2003)

The activity that takes place in memory systems during sleep is likely to be related to the role of sleep in memory consolidation and learning, as well as to the generation of dream hallucinations. This study addressed the often-stated hypothesis that replay of whole episodic memories contributes to the multimodal hallucinations of sleep. Over a period of 14 days, 29 subjects kept a log of daytime activities, events, and concerns, wrote down any recalled dreams, and scored the dreams for incorporation of any waking experiences. While 65&percnt; of a total of 299 sleep mentation reports were judged to reflect aspects of recent waking life experiences, the episodic replay of waking events was found in no more than 1 &ndash; 2&percnt; of the dream reports. This finding has implications for understanding the unique memory processing that takes place during the night and is consistent with evidence that sleep has no role in episodic memory consolidation.
An Australasian study of reading and comprehension skills in novice programmers, using the bloom and SOLO taxonomies
Authors: Jacqueline L. Whalley, Raymond Lister, Errol Thompson, Tony Clear, Phil Robbins, P. K. Ajith Kumar, Christine Prasad
Venue: Proceedings of the 8th Austalian conference on Computing education - Volume 52 (2006)

In this paper we report on a multiinstitutional investigation into the reading and comprehension skills of novice programmers. This work extends previous studies (Lister 2004, McCracken 2001) by developing a question set within two key pedagogical frameworks: the Bloom and SOLO taxonomies. From this framework of analysis some interesting emergent patterns relating the cognitive level of the questions to student performance have been identified.
Detecting Web Content Function Using Generalized Hidden Markov Model
Authors: Jinlin Chen, Ping Zhong, Terry Cook
Venue: Proceedings of the 5th International Conference on Machine Learning and Applications (2006)

Web content function indicates authors' intension towards the purpose of the content and therefore plays an important role for web information processing. In this paper we propose a Generalized Hidden Markov Model which extends traditional Hidden Markov Model for web content function detection. By incorporating multiple emission features and detecting state transition sequence based on layout structure, Generalized Hidden Markov Model can effectively make use of web-specific information and achieve better performance comparing to traditional Hidden Markov Model. Comparing to previous approaches on function detection, our approach has the advantages of domain-independency and extensibility for other applications. Experiments show promising results with our approach.
Introduction to modeling and generating probabilistic input processes for simulation
Authors: Emily K. Lada, Mary Ann Wagner, Natalie M. Steiger, James R. Wilson
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Techniques are presented for modeling and generating the univariate and multivariate probabilistic input processes that drive many simulation experiments. Among univariate input models, emphasis is given to the generalized beta distribution family, the Johnson translation system of distributions, and the B&eacute;zier distribution family. Among bivariate and higher-dimensional input models, emphasis is given to computationally tractable extensions of univariate Johnson distributions. Also discussed are nonparametric techniques for modeling and simulating time-dependent arrival streams using nonhomogeneous Poisson processes.
The National Grid Service of the UK
Authors: Neil Geddes
Venue: Proceedings of the Second IEEE International Conference on e-Science and Grid Computing (2006)

This paper describes the current status and programme of continued development and support for the UK's National Grid Service (NGS). Through the activities presented in this paper, the NGS will evolve to form the central component of the UK's e- Infrastructure for research, providing integrated access to research facilities and resources across the UK and internationally.
2005 Special issue: Functional role of entorhinal cortex in working memory processing
Authors: Erik Fransén
Venue: Neural Networks (2005)

Our learning and memory system has the challenge to work in a world where items to learn are dispersed in space and time. From the information extracted by the perceptual systems, the learning system must select and combine information. Both these operations may require a temporary storage where significance and correlations could be assessed. This work builds on the common hypothesis that hippocampus and subicular, entorhinal and parahippocampal/postrhinal areas are essential for the above-mentioned functions. We bring up two examples of models; the first one is modeling of in vivo and in vitro data from entorhinal cortex layer II of delayed match-to-sample working memory experiments, the second one studying mechanisms in theta rhythmicity in EC. In both cases, we discuss how cationic currents might be involved and relate their kinetics and pharmacology to behavioral and cellular experimental results.
Reflectance Sharing: Predicting Appearance from a Sparse Set of Images of a Known Shape
Authors: Todd Zickler
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

Three-dimensional appearance models consisting of spatially varying reflectance functions defined on a known shape can be used in analysis-by-synthesis approaches to a number of visual tasks. The construction of these models requires the measurement of reflectance, and the problem of recovering spatially varying reflectance from images of known shape has drawn considerable interest. To date, existing methods rely on either: 1) low-dimensional (e.g., parametric) reflectance models, or 2) large data sets involving thousands of images (or more) per object. Appearance models based on the former have limited accuracy and generality since they require the selection of a specific reflectance model a priori, and while approaches based on the latter may be suitable for certain applications, they are generally too costly and cumbersome to be used for image analysis. We present an alternative approach that seeks to combine the benefits of existing methods by enabling the estimation of a nonparametric spatially varying reflectance function from a small number of images. We frame the problem as scattered-data interpolation in a mixed spatial and angular domain, and we present a theory demonstrating that the angular accuracy of a recovered reflectance function can be increased in exchange for a decrease in its spatial resolution. We also present a practical solution to this interpolation problem using a new representation of reflectance based on radial basis functions. This representation is evaluated experimentally by testing its ability to predict appearance under novel view and lighting conditions. Our results suggest that since reflectance typically varies slowly from point to point over much of an object's surface, we can often obtain a nonparametric reflectance function from a sparse set of images. In fact, in some cases, we can obtain reasonable results in the limiting case of only a single input image.
Inferior Temporal Neurons Show Greater Sensitivity to Nonaccidental than to Metric Shape Differences
Authors: Rufin Vogels, Irving Biederman, Moshe Bar, Andras Lorincz
Venue: Journal of Cognitive Neuroscience (2001)

It has long been known that macaque inferior temporal (IT) neurons tend to fire more strongly to some shapes than to others, and that different IT neurons can show markedly different shape preferences. Beyond the discovery that these preferences can be elicited by features of moderate complexity, no general principle of (nonface) object recognition had emerged by which this enormous variation in selectivity could be understood. Psychophysical, as well as computational work, suggests that one such principle is the difference between viewpoint-invariant, nonaccidental (NAP) and view-dependent, metric shape properties (MPs). We measured the responses of single IT neurons to objects differing in either a NAP (namely, a change in a geon) or an MP of a single part, shown at two orientations in depth. The cells were more sensitive to changes in NAPs than in MPs, even though the image variation (as assessed by wavelet-like measures) produced by the former were smaller than the latter. The magnitude of the response modulation from the rotation itself was, on average, similar to that produced by the NAP differences, although the image changes from the rotation were much greater than that produced by NAP differences. Multidimensional scaling of the neural responses indicated a NAP/MP dimension, independent of an orientation dimension. The present results thus demonstrate that a significant portion of the neural code of IT cells represents differences in NAPs rather than MPs. This code may enable immediate recognition of novel objects at new views.
Fast Algorithm of Trigonometric Function of Specific Angle
Authors: Qiusheng He, Wending Liu, Fuzeng Wang, Jianjun Hao, Hui Li, Yaqi Cheng
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A modified CORDIC algorithm is presented, based on computing the trigonometric function of specific angle in one cycle, which can be expressed with 2k\pi / 2^N and used in Fast Fourier Transform, Direct digital synthesis at al. Simulation results prove that the computing efficiency can be increased by about 50% and better precision may be obtained compared with the classic CORDIC algorithm. Therefore the algorithm is feasible and high availability.
Combined pattern search and ranking and selection for simulation optimization
Authors: Todd A. Sriver, James W. Chrissis
Venue: Proceedings of the 36th conference on Winter simulation (2004)

A new algorithm class is presented for optimization of stochastic simulation models. The algorithms, which combine generalized pattern search (GPS) with ranking and selection (R&S), require "black-box" simulation evaluations and are applicable to problems with mixed variables (continuous, discrete numeric, and categorical). Implementation of the Mixed-variable Generalized Pattern Search with Ranking and Selection (MGPS-RS) algorithm with three different R&S procedures is demonstrated and tested on a small set of standard test functions. Results of this preliminary performance evaluation are summarized and compared with existing search methods.
A New and Efficient Field-Partition Based Code Compression and Its Pipelined Decompression System
Authors: Yuan-Long Jeang, Chih-Chung Tai, Yong-Zong Lin
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 2 (2006)

A field partition based instruction compression/ decompression system for ARM series architecture is proposed. We could get a statistics of the appearances of each field in all instructions of a program. Depending on the statistics, we partition each instruction into three fields and compress each field using Huffman coding method. Experimental results show that our method is better than others with a 55% of average compression ratio. For decompression, single buffering, double buffering and pipeline techniques have been proposed. However, due to jump penalty, these techniques incur more delays in pipeline or have to stop and fill in the cache buffers. We proposed a Pipeline with Back-up for Flushing technique that incurs no delay and without stopping due to jump. The average performance is increased about 10% to 60%.
Extreme Selling in the Early Stage Space
Authors: Wade A. Lee, Gareth Powell
Venue: Proceedings of the conference on AGILE 2006 (2006)

Agile software development practices have revolutionized the craft of building software in today's market. Those who have gone down this path may not realize that they also have a very powerful marketing story to tell. The software industry has spent decades building an unparalleled and well-deserved reputation for missing deadlines, exceeding budgets, and generally underachieving. Perhaps the most unfortunate aspect is the degree to which failure is accepted. Offshore development, while offering attractive hourly rates, has only exacerbated the problem. Failure is still the norm -it just costs less per hour! At the end of the day, Software Development has become synonymous with risk. Agile development offers the first effective vehicle to mitigate that risk. Contractor firms who have succeeded in building effective Agile Development shops should be looking to wield this as a marketing club! Moreover, they should carefully examine their market niches to see how Agile Development most effectively addresses the salient risk areas.
Enhancing Web Services in the Framework of Service-Oriented Architectures
Authors: Dionisis X. Adamopoulos
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Web services are emerging technologies that can be considered as the result of the continuous improvement of Internet services due to the tremendous increase in demand that is being placed on them. In this paper, the different facets of Web services are identified and a flexible approach to engineering complex Web services is adopted in the form of a proposed framework for the development of Web services. After the examination of its main constituent parts, it is argued that its full potential and that of Web service engineering in general, is realized through the gradual formation of a rich service grid offering value-added supporting functionality and therefore the main desirable properties of such a service grid are highlighted. Finally, the paper outlines a validation approach for the proposed framework and assembles important pointers for future work and concluding remarks.
Simulating and designing the stochastic inbound inventory routing problem
Authors: Malini Natarajarathinam, Charles R. Sox
Venue: Proceedings of the 37th conference on Winter simulation (2005)

We consider the situation where parts from suppliers have to be picked up by a capacitated vehicle for an assembly plant that faces stochastic demand. We propose a twophase heuristic to calculate "good" base stock policies for the stochastic inbound inventory routing problem. In this paper, we calculate multiple performance measures for the results obtained from the analytical model. The results show that the maximum average utilization of the vehicle is a significant factor in determining our fill rate. We consider several test cases to substantiate the results. The interactions between the performance measures for different situations are also discussed.
A New Scheme Combining Space-time Bit Interleave Coded Modulation with Phase Sweeping
Authors: Tao Huang, Chaowei Yuan, Chuanglu Sun
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A phase-sweeping space-time bit interleaved coded modulation (PS-ST-BICM) is presented. By expanding the dimensions of sweeping matrix we achieve the correlation between the adjacent code matrices, and further time diversity is realized, and by further time diversity higher diversity gain is realized which effectively avoid possible burst errors in block fading channels. The optimum criterion of the rotation matrix to maximize both diversity and coding gain is presented. And we also describe the construction of an interleaver that optimizes the total diversity order for a given error-correcting code. Then the Singleton bound, channel capacity and BER performances are theoretically analyzed. The simulation results prove that the performance of the new scheme is improved greatly in the Rayleigh block fading channels.
Linear estimation of moments for non-stationary signals
Authors: P. W. Wu, H. Lev-Ari
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The behavior of linear estimation of moments in a non-stationary environment is analyzed. A quantitative performance measure is introduced to evaluate the performance of these estimators. Optimal estimators are derived and their performance is compared with that of conventional (exponentially-windowed) moment estimators.
Guest Editors' Introduction: Computer Architecture Simulation and Modeling
Authors: Timothy Sherwood, Joshua J. Yi
Venue: IEEE Micro (2006)

Guest Editors Timothy Sherwood and Joshua J. Yi talk about what went into the presentation of IEEE Micro's Computer Architecture Simulation and Modeling special issue.
Adaptive Compression Scheme for Video Delivery over the QoS-Aware Residential Gateway
Authors: Pei-Chen Tseng, Ching-Tuey Sung, Wen-Shyang Hwang
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A simple adaptive subsampling/de-subsampling scheme for video delivery over the QoS-aware residential gateway (QRG) during network congestion is presented. The network performs better by transmitting fewer data by fewer bits required during network congestion. The proposed subsampling scheme can be adaptively adjust with variable compression ratio using different kind of subsampling algorithms according to the feedback information from the QRG; no subsampling is allowed in normal operation, which provided sufficient network bandwidth; intra-frame subsampling scheme is adopted for medium, and interframe subsampling scheme for heavily traffic during network congestion. The receiver adaptively desubsamples the subsampled frame with a simple linear interpolation to reconstruct the image-frame. QRG is experimentally implemented in a FDIXP425 networkbased embedded system on a Linux platform. Experimental results prove the proposed scheme successfully performs across QRG.
SLF4SS: Facilitating Flexible Services Selection
Authors: Hongbing Wang, Yifei Wang, Joshua Zhexue Huang, Xun Xu
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

In this paper, we present SLF4SS, a self-learning framework for services selection. The main features of SLF4SS include (1) learning from previous match samples to help users discover more appropriate services, (2) using multi-dimensional properties to represent services for evaluation and selection, (3) optimizing the overall property of composite service appropriate to customer's constraints and preferences, and (4) addressing user's uncertain, vague requests. SLF4SS can simplify selection of suitable Web services in building high level services for various business applications, reduce implementation cost, and shorten the time of deploying enterprises applications based on SOA.
PePe field study: constructing meanings for locations in the context of mobile presence
Authors: Jaakko T. Lehikoinen, Anne Kaikkonen
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

Location information contains a huge promise in the area of awareness technologies. In PePe project, automatic location detection was investigated as part of a mobile presence system. A field study with twelve young adults was conducted to explore the usage habits of sharing location information. The participants defined, named, and shared on average twenty meaningful locations with their friends. They found the location information as the most relevant mobile presence attribute, due to a fact that it gave good overview on the status of the other users. We focus on analyzing how the participants named locations and how they used location information in the context of mobile presence. The participants utilized shared meanings of locations in naming and storing them to the PePe system. We classified the created locations as generic locations, points of interest, and geographical areas. The presented results will facilitate in designing location enhanced mobile awareness systems.
Fast algorithms for matrix multiplication using pseudo-number-theoretic transforms
Authors: A. E. Yagle
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We provide a novel approach to the design of fast algorithms for matrix multiplication. The operation of matrix multiplication is reformulated as a convolution, which is implemented using pseudo-number-theoretic transforms. Writing the convolution as multiplication of polynomials evaluated off the unit circle reduces the number of multiplications without producing any error, since the (integer) elements of the product matrix are known to be bounded. The new algorithms are somewhat analogous to the arbitrary precision approximation (APA) algorithms, but have the following advantages: (1) a simple design procedure is specified for them; (2) they do not suffer from roundoff error; and (3) reasons for their existence is clear. The new algorithms are also non-commutative, so that they may be applied recursively to block matrix multiplication. This work establishes a link between matrix multiplication and fast convolution algorithms and so opens another line of enquiry for the fast matrix multiplication problem. Some numerical examples illustrate the operation of the new proposed algorithms.
Risk Stratification in Assessing Risk in Coronary Artery Bypass Surgery
Authors: Mike Rees, Jitesh Dineschandra
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

We present the need for risk stratification in the monitoring of cardiac surgical practice and review the frequentist and Bayesian approaches to the problem. Developments in the available databases are described. Enhancements to the Parsonnet and EuroSCORE systems are reviewed. We argue that in the UK, although the use of the Parsonnet system is inappropriate and that the EuroSCORE system is a clear improvement, there are advantages in adopting a system based on a Bayesian model for risk assessment.
Multirate detection of Gaussian signals of unknown bandwidth in noise
Authors: J. T. Reinking, G. E. Prescott
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

A method for detection of Gaussian signals with uncertain bandwidth in a background of stationary, white Gaussian noise is proposed. The proposed method is designed to improve over conventional energy detection, for which a signal bandwidth must be assumed. The method proposed here does not rely on estimates of signal parameters other than specifying a range of anticipated bandwidth, making it suitable for short duration signals. The performance of the proposed method is measured by the probability of detection for a given false-alarm probability and is compared with conventional energy detection.
Design Patterns of Scalable Cluster System Software
Authors: Bibo Tu, Ming Zou, Jianfeng Zhan, Lei Wang, Jianping Fan
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

The design pattern of cluster system software has an important influence on scalability of massive cluster system. The paper presents design patterns of scalable cluster system software, including scalable software topologies and optimized communication modes. These design patterns have been widely applied in Dawning series of supercomputers and some results of performance evaluation show their good scalability.
Letters to the Editor
Venue: IEEE Internet Computing (2006)

A letter about last issue's theme article, "Increasing QoS in Selfish Overlay Networks."