ppxscal/embedding_network huggingface dataset:
Modeling scheduling uncertainty in capital construction projects
Authors: Nathan D. Boskers, S. M. AbouRizk
Venue: Proceedings of the 37th conference on Winter simulation (2005)

Capital infrastructure projects with long-term implementation time frames are generally uncertain in nature. Engineers and planners attempting to estimate the costs of such projects often resort to using contingencies based on their experience without proper modeling of the uncertainty of costs, durations, or economic conditions. This paper presents a simulation-based model for assessing uncertainty associated with these projects. In particular the model accounts for expected fluctuations in the costs and durations of various work packages and, most significantly, it accounts for the inflation of costs over time based on when the work packages occur. The model uses Monte Carlo simulation techniques to account for time and cost and uses non-stationary time series modeling techniques to predict inflation rates. The model is implemented as a special purpose simulation template available in the public domain.
On stationarity in Internet measurements through an information-theoretic lens
Authors: Balachander Krishnamurthy, Suresh Venkatasubramanian, Harsha V. Madhyastha
Venue: Proceedings of the 21st International Conference on Data Engineering Workshops (2005)

Streaming change detection schemes are of great interest in the context of data warehouses, data cleaning systems, network traffic anomaly detection and other measurement scenarios. The goal of change detection systems is to determine whether fundamental characteristics of a data stream have changed, either temporally (with respect to prior data) or spatially (with respect to other streams). We present an application of an information-theoretic change detection scheme to determining stationarity in Internet measurements. Our experiments indicate that this generic scheme, despite being oblivious to the nature of the data, matches a more domain specific approach for this problem, and requires no domain knowledge to work effectively.
Joint blind signal detection and carrier recovery over fading channels
Authors: Lang Tong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

A scheme of joint blind signal detection and carrier recovery is developed for intersymbol interference channels. Using a blind sequence estimation scheme, the proposed approach does not require explicit channel identification. It shows robustness against timing error and carrier phase uncertainty. The efficacy of the proposed approach is demonstrated in a simulation involving frequency selective fast fading channel with substantial Doppler shifts.
Automated product-forms with Meercat
Authors: Ashok Argent-Katwala
Venue: Proceeding from the 2006 workshop on Tools for solving structured Markov chains (2006)

The Reversed Compound Agent Theorem (RCAT) is a compositional result that uses Markovian process algebra to derive the reversed process of two cooperating continuous time Markov chains at equilibrium, under certain conditions. From this reversed process, together with the given, forward process, the joint state probabilities can be expressed as a product-form.We introduce MEERCAT, the first implementation of the RCAT, which classifies models where the theorem can be applied, and generates their product-form solutions.
Lower and upper bounds for the mixed capacitated arc routing problem
Authors: José-Manuel Belenguer, Enrique Benavent, Philippe Lacomme, Christian Prins
Venue: Computers and Operations Research (2006)

This paper presents a linear formulation, valid inequalities, and a lower bounding procedure for the mixed capacitated arc routing problem (MCARP). Moreover, three constructive heuristics and a memetic algorithm are described. Lower and upper bounds have been compared on two sets of randomly generated instances. Computational results show that the average gaps between lower and upper bounds are 0.51% and 0.33%, respectively.
Revisiting Previously Searched Locations in Visual Neglect: Role of Right Parietal and Frontal Lesions in Misjudging Old Locations as New
Authors: Sabira K. Mannan, Dominic J. Mort, Tim L. Hodgson, Jon Driver, Christopher Kennard, Masud Husain
Venue: Journal of Cognitive Neuroscience (2005)

Right-hemisphere patients with left neglect often demonstrate abnormal visual search, re-examining stimuli to the right while ignoring those to the left. But re-fixations alone do not reveal if patients misjudge whether they have searched a location before. Here, we not only tracked the eye movements of 16 neglect patients during search, but also asked them to click a response button only when they judged they were fixating a target for the very first time. ''Re-clicking'' on previously found targets would indicate that patients erroneously respond to these as new discoveries. Lesions were mapped with high-resolution MRI. Neglect patients with damage involving the right intraparietal sulcus or right inferior frontal lobe ''re-clicked'' on previously found targets on the right at a pathological rate, whereas those with medial occipito-temporal lesions did not. For the intraparietal sulcus patients, the probability of erroneous re-clicks on an old target increased with time since first discovering it; whereas for frontal patients it was independent of search time, suggesting different underlying mechanisms in these two types of patient. Re-click deficits correlated with degree of leftward neglect, mainly due to both being severe in intraparietal cases. These results demonstrate that misjudging previously searched locations for new ones can contribute to pathological search in neglect, with potentially different mechanisms being involved in intraparietal versus inferior frontal patients. When combined with a spatial bias to the right, such deficits might explain why many neglect patients often re-examine rightward locations, at the expense of items to their left.
Robust estimation of mean Doppler frequency for the measurement of average wind velocity in a weather radar
Authors: Jonggil Lee
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

In a Doppler weather radar, high resolution windspeed profile measurements are needed to provide reliable detection of a hazardous weather condition. For this purpose, the pulse pair method is generally considered to be the most efficient estimator. However, this estimator has some bias errors due to nonsymmetric spectra and may yield meaningless results in the case of a multimodal return spectrum. The bias errors were analyzed and an improved method was suggested to reduce these errors. For the case of a multimodal or seriously skewed spectrum, the modes of the spectrum may provide more reliable information than the statistical mean. Therefore, the idea of a relatively simple mode estimator is also developed. 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
Computer use has no demonstrated impact on the well-being of older adults
Authors: Anna Dickinson, Peter Gregor
Venue: International Journal of Human-Computer Studies (2006)

Technology is frequently presented as a panacea for the support needs of the ageing population, based in part upon the commonly cited assertion that computer and internet use has an empirically verified positive effect on the well-being of older people. In this paper we review the studies that this assertion is based on and conclude that they do not support it. While the original studies rarely make unsupportable claims, the secondary literature which cites them is frequently very misleading; limitations include, failure to distinguish between the effects of training/support and computer use; misattributing causality; inappropriately generalising results from a different population.
An Ontology-Driven Mediator for Querying Time-Oriented Biomedical Data
Authors: Martin O'Connor, Ravi Shankar, Amar Das
Venue: Proceedings of the 19th IEEE Symposium on Computer-Based Medical Systems (2006)

Most biomedical research databases contain considerable amounts of time-oriented data. However, temporal knowledge about the contextual meaning of such data is not usually represented in a principled fashion. As a result, investigators often develop custom techniques for temporal data analysis that are difficult to reuse. We addressed this problem by developing a set of knowledgedriven methods and tools for temporally representing and querying biomedical data, and have integrated them using a mediator approach. A central issue driving our work is a need to integrate temporal representations of data in relational databases with the domain-specific semantics of temporal patterns used in querying. This paper presents a formal temporal knowledge model using the Semantic Web ontology and rule languages, OWL and SWRL, respectively. The model informs the mediator of the temporal semantics used for data analysis. We show that our approach provides the computational foundation for much-needed software to make sense of complex temporal patterns in two biomedical research domains.
Authentication Control Point and Its Implications For Secure Processor Design
Authors: Weidong Shi, Hsien-Hsin S. Lee
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

Secure processor architecture enables tamper-proof protec- tion on software that addresses many dificult security prob- lems such as reverse-engineering prevention, trusted com- puting, secure mobile agents by providing a secure comput- ing environment that is resistant to both physical tamper- ing and software exploits. Two essential features offered by a secure processor are software encryption for protect- ing software privacy and integrity verification for prevent- ing tampering of the protected software. Despite a number of secure processor designs have been proposed, the delicate relationship between privacy and integrity protection in the context of modern out-of-order processor design is not well understood. This paper aims to remedy this research deficiency by evaluatingdifferent designs that integrate soft- ware decryption and integrity verification into an out-of- order pipeline. Our paper provides an in-depth analysis of the security and performance trade-offs, implications of sev- eral designs in the context of memory fetch side-channel ex- ploits. Among the evaluated spectrum of design alternatives are (1) authentication-then-issue, (2) authentication-then- commit, (3) authentication-then-write, (4) authentication- then-fetch, and (5) authentication-then-commit + address obfuscation. Performance of various designs was evaluated using a cycle based processor model and SPEC 2000 bench- mark suite.
Recognition of the "Fractional" kinetics in complex systems: dielectric properties of fresh fruits and vegetables from 0.01 to 1.8 GHz
Authors: R. R. Nigmatullin, S. O. Nelson
Venue: Signal Processing (2006)

Based on the new theoretical approach and the self-consistent iteration procedure for calculating the limiting values (ε(∞) and ε(0)) of the frequency-dependent permittivity, it becomes possible to recognize the fitting function for the function ε(jω) measured for a complex system representing plant tissues of fresh fruits and vegetables in the frequency range (107-1.8 × 109 Hz). The recognized fitting function is common for all of a set of nine fruits and vegetables (apple, avocado, banana, cantaloupe, carrot, cucumber, grape, orange, and potato) and contains seven fitting parameters. These parameters are varied for different fruits and vegetables, and their behavior with respect to temperature is different but nevertheless exhibits some common features. This fitting function containing power-law exponents and confirming the existence of relaxation processes described in terms of fractional kinetic equations for some complex biological systems can be used for practical purposes to construct a desired calibration curve with respect to quality factors, as for example, moisture content or degree of maturity. The discovered common "universality" in dielectric behavior of such complex materials as plant tissues opens a possibility to use dielectric spectroscopy as a nondestructive method of control in analysis of electrical behavior (measured in the form of complex permittivity or impedance) for other complex materials.
Optimising Performance in Network-Based Information Systems: Virtual Organisations and Customised Views
Authors: Nickolas J. G. Falkner, Paul D. Coddington, Andrew L. Wendelborn
Venue: Proceedings of the 17th International Conference on Database and Expert Systems Applications (2006)

Network-based information systems use well-defined standards to ensure interoperability and also have a tightly coupled relationship between their internal data representation and the external network representation. Virtual organisations (VOs), where members share a problem-solving purpose rather than a location-based or formal organisation, constitute an environment where user requirements may not be met by these standards. A virtual organisation has no formal body to manage change requests for these standards so the user requirements cannot be met. We show how the decoupling of the internal and external representations, through the use of ontologies, can enhance the operation of these systems by enabling flexibility and extensibility. We illustrate this by demonstrating a system that implements and enhances the Domain Name System, a global network-based information system. Migrating an existing system to a decoupled, knowledge-driven system is neither simple nor effortless but can provide significant benefits.
User-Level Fine-Grained Adaptive Real-Time Scheduling via Temporal Reflection
Authors: Sergio Ruocco
Venue: Proceedings of the 27th IEEE International Real-Time Systems Symposium (2006)

Real-time systems must adapt their behaviour when the timing assumptions they are based on change at run time. A viable approach leading to effective adaptations consists of exploiting application-specific knowledge, but limitations of ordinary schedulers constrain its applicability. In this paper this problem is tackled using a reflective scheduler, which enables a computing system to perform temporal reflection, that is to fully observe and control its own temporal behaviour. The scheduler is implemented for the L4 microkernel, and validated by solving a real-time image analysis problem. Compared with other approaches the reflective scheduler is orders of magnitude more precise, achieving microsecond-level accuracy, while its implementation is entirely at user-level, and it does not require any changes to be made to the microkernel itself.
Design of a Wireless Sensor Network for Detecting Occupancy of Vehicle Berth in Car Park
Authors: Ying Wang, Guangrong Zhou, Tong Li
Venue: Proceedings of the Seventh International Conference on Parallel and Distributed Computing, Applications and Technologies (2006)

Wireless sensor networks can enable the reliable information gathering and transmission for a variety of applications that range from environment protection and civil structure monitoring to battlefield surveillance. This paper presents an innovate detecting system based on wireless sensor networks for detecting occupancy of vehicle berth in car park. The battery-powered wireless sensor nodes can be easily deployed in car park, and the measurements are transmitted to control center through wireless channel. The network topology, communication protocol and sensor node hardware are described, and energy efficiency is an important concern in the design of the system.
Delay-period Activity in the Prefrontal Cortex: One Function Is Sensory Gating
Authors: Bradley R. Postle
Venue: Journal of Cognitive Neuroscience (2005)

The prefrontal cortex (PFC) contributes to working memory functions via executive control processes that do not entail the storage, per se, of mnemonic representations. One of these control processes may be a sensory gating mechanism that facilitates retention of representations in working memory by down-regulating the gain of the sensory processing of intervening irrelevant stimuli. This idea was tested by scanning healthy young adults with functional magnetic resonance imaging while they performed a delayed face-recognition task. The 2 &times; 2 factorial design varied the factors of Memory (present, absent) and Distraction (present, absent). During memory-present trials, target and probe stimuli were individual gray-scale male faces. Memory-absent trials were identical, except that they employed the same recurring female faces (denoting a "no memory" trial). Distraction-present trials featured rapid serial visual presentation of bespectacled male faces during the two middle seconds of the delay. The first step of the analyses identified dorsolateral PFC (dlPFC) and inferior occipitotemporal cortex (IOTC) voxels exhibiting delay-period activity in memory-present/distraction-absent trials, that is, the "unfilled" delay. Within these voxels, distraction-evoked activity in the dlPFC was markedly higher during trials that required the concurrent short-term retention of information than on those that did not, whereas the opposite effect was seen in the IOTC. These results are consistent with the view that processes related to sensory gating account for a portion of the delay-period activity that is routinely observed in the dlPFC.
Mining Generalized Graph Patterns Based on User Examples
Authors: Pavel Dmitriev, Carl Lagoze
Venue: Proceedings of the Sixth International Conference on Data Mining (2006)

There has been a lot of recent interest in mining patterns from graphs. Often, the exact structure of the patterns of interest is not known. This happens, for example, when molecular structures are mined to discover fragments useful as features in chemical compound classification task, or when web sites are mined to discover sets of web pages representing logical documents. Such patterns are often generated from a few small subgraphs (cores), according to certain generalization rules (GRs). We call such patterns "generalized patterns"(GPs). While being structurally different, GPs often perform the same function in the network. Previously proposed approaches to mining GPs either assumed that the cores and the GRs are given, or that all interesting GPs are frequent. These are strong assumptions, which often do not hold in practical applications. In this paper, we propose an approach to mining GPs that is free from the above assumptions. Given a small number of GPs selected by the user, our algorithm discovers all GPs similar to the user examples. First, a machine learning-style approach is used to find the cores. Second, generalizations of the cores in the graph are computed to identify GPs. Evaluation on synthetic data, generated using real cores and GRs from biological and web domains, demonstrates effectiveness of our approach.
Semantics Recognition in Service Composition Using Conceptual Graph
Authors: Xiaofeng Du, William Song, Malcolm Munro
Venue: Proceedings of the 2006 IEEE/WIC/ACM international conference on Web Intelligence and Intelligent Agent Technology (2006)

This paper addresses the issues of semantic representation of composite services and the relationships among the atomic services used to build the composite service, which have not been addressed sufficiently in current service description frameworks. Clear semantics and relationships among internal atomic services can enhance a composite service's reusability and comprehensibility. In this paper conceptual graph is used to address the issues. A composite service can be represented by merging atomic services' conceptual graphs into a larger and more specialized conceptual graph. The semantics and relations of this composite service can be clearly represented in the graph. Service requirements can be converted into conceptual graph too, and thus graph matching methods could be used to search for required services.
At home with mathematics: meanings and uses among families
Authors: Reed Stevens, Veronique Mertl, Sheldon Levias, Laurie McCarthy, Shelley Goldman, Lee Martin, Roy Pea, Angela Booker, Kristen Pilner Blair, Na'ilah Suad Nasir, Michael Heimlich, Grace Atukpawu, Kathleen O'Connor
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

Everyday mathematics research has examined the activities of buyers (Lave, 1988) and sellers in markets (Nunes, Schliemann, & Carraher, 1993; Saxe, 1990); it has examined the practices of both high and lower status occupational work (e.g. Hall & Stevens, 1995; Scribner, 1985; Stevens & Hall, 1998), and it has examined the mathematics that is embedded in competitive play (Nasir, 2000) but the family as locus of mathematical activity is understudied. The three projects represented in this symposium focus on mathematical practices in the context of families. The first project takes an activity focus, examining mathematical practices in the context of a consequential context of family activity---money and its uses. The second project takes a topical focus, describing a wide range of practices in families that are seen as mathematical. The third paper focuses on a particular cultural group, attending to the meanings and uses of both informal and schooled mathematics in the family context. Together the papers provide a new perspective on qualities of mathematical practice outside of school and its actual, and potential, relations to school mathematics.
Dynamic Control of Adaptive Mixture-of-Gaussians Background Model
Authors: Atsushi Shimada, Daisaku Arita, Rin-ichiro Taniguchi
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

We propose a method for create a background model in non-stationary scenes. Each pixel has a dynamic Gaussian mixture model. Our approach can automatically change the number of Gaussians in each pixel. The number of Gaussians increases when pixel values often change because of Illumination change, object moving and so on. On the other hand, when pixel values are constant in a while, some Gaussians are eliminated or integrated. This process helps reduce computational time. We conducted experiments to investigate the effectiveness of our approach.
Enhanced High Dimensional Data Visualization through Dimension Reduction and Attribute Arrangement
Authors: Almir Olivette Artero, Maria Cristina F. de Oliveira, Haim Levkowitz
Venue: Proceedings of the conference on Information Visualization (2006)

Researchers and users are well aware of the difficulties related to finding an appropriate configuration of the axes mapping attributes in multidimensional visualization techniques, particularly in visualizations that show a large number of attributes simultaneously. We address this problem with a simple strategy that offers both dimension ordering and dimension reduction. Dimension ordering is based on attribute similarity heuristics, and the basic rationale is extended to support dimension reduction. We discuss the performance of our algorithms and present some results of their application to several data sets. The algorithms improve the capability of visualization techniques to segregate clusters present in the data and reduce the visual clutter aggravated by arbitrary distributions of the axes.