ppxscal/embedding_network huggingface dataset:
Virtual Reality and Simulation of the Earthquake-Induced Urban Hazard Based on Artificial Neural Network and COMGIS Technique
Authors: Hao Tang, Guo-xin Chen
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

A method for virtual reality and simulation of the earthquake-induced urban hazard is developed using an artificial neural network (ANN) and components geography information system (COMGIS). The research shows that: a. COMGIS technique is an effective method to realize the coupling of the GIS module and hazard simulation module. b. The site earthquake influence field under the scenario earthquake can be simulated by utilizing the external commercial program-SHAKE91. c. ANN toolbox in Matlab is modularized to extend the virtual reality and simulation function of the earthquake-induced urban hazard. d. By GIS module, the simulated results can be perfectly matched with the spatial information. Thus the potential earthquake-induced urban hazard can also be simulated by assuming the exact earthquake magnitude.
BlackJack: Hard Error Detection with Redundant Threads on SMT
Authors: Ethan Schuchman, T. N. Vijaykumar
Venue: Proceedings of the 37th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (2007)

Testing is a difficult process that becomes more difficult with scaling. With smaller and faster devices, tolerance for errors shrinks and devices may act correctly under certain condition and not under others. As such, hard errors may exist but are only exercised by very specific machine state and signal pathways. Targeting these errors is difficult, and creating test cases that cover all machine states and pathways is not possible. In addition, new complications during burn-in may mean latent hard errors are not exposed in the fab and reach the customer before becoming active. To address this problem, we propose an architecture we call BlackJack that allows hard errors to be detected using redundant threads running on a single SMT core. This technique provides a safety-net that catches hard errors that were either latent during test or just not covered by the test cases at all. Like SRT, our technique works by executing redundant copies and verifying that their resulting machine states agree. Unlike SRT, BlackJack is able to achieve high hard error instruction coverage by executing redundant threads on different front and backend resources in the pipeline. We show that for a 15% performance penalty over SRT, BlackJack achieves 97% hard error instruction coverage compared to SRT's 35%.
Technological information extraction of free form surfaces using neural networks
Authors: Marjan Korosec
Venue: Neural Computing and Applications (2007)

The aim of this paper is to show how to predict the accurate machining technology for the particular free form NURBS or B-spline surface. Since that kind of a surface is very hard to describe in an analytical manner, the topological and geometrical information about the surface was acquired with the help of self-organized neural networks (NNs) and first- or second-order statistic parameters. It is proved that the most significant parameter in this process is the curvature, especially when rapid changes of curvature on a free form surface occurred. As the Gaussian distribution of surface curvatures and slope gradient data were presumed, the mean and variance was used for one-dimensional data presentation, and the Hebbian output data vector was used to assess probability, density function and distribution of the presented data. For collecting the maximum amount of surface information, the principal component analysis method inside the Hebbian NN was used.
Genre, Narrative and the "Nigerian Letter" in Electronic Mail
Authors: Wendy L. Cukier, Eva J. Nesselroth, Susan Cody
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Spam, or unsolicited email, has become an unavoidable fact of life for anyone with an email account. Spam emails generally reflect genres seen in traditional print format such as advertisements, memos, etc. One particularly interesting form of spam is the "Nigerian letter". Nigerian letters offer "get rich quick" schemes to engage recipients into advance fee fraud activities. This paper provides an empirical analysis of 111 Nigerian letters received by email to explore key elements including the use of form, purpose, and tone. We propose that the use of rich narrative appeals to strong emotions like greed, guilt and lust, and invokes archetypal myths of windfall fortunes in an effort to illicit behaviors which, for the most part, are counter- factual.
A Shared Memory Environment for Hypercubes
Authors: Amit Agarwala, Chita R. Das
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

This paper describes the design and implementation of a shared virtual memory (SVM) system for the nCUBE 2 hypercube multicomputer. The SVM system provides the user a single coherent address space across all nodes. It is implemented at the user level in a C programming environment using high level constructs to support data sharing. Shared variables are treated as objects rather than pages. We have improved upon an existing algorithm for maintaining coherency in the SVM system, thus achieving a reduction in the number of inter-node messages required in coherency maintenance. Detailed timing analysis is conducted to analyze the feasibility of this shared environment. Experimental results indicate that parallel programs running under an SVM system show linear speedup, suggesting that SVM systems could provide an effective programming environment for the next generation of distributed memory parallel computers. A bottleneck of this implementation seems to be the expensive interrupt handling by the nCUBE 2 kernel.
Extracting the main patterns of natural time series for long-term neurofuzzy prediction
Authors: Ali Gholipour, Caro Lucas, Babak N. Araabi, Masoud Mirmomeni, Masoud Shafiee
Venue: Neural Computing and Applications (2007)

A combination of singular spectrum analysis and locally linear neurofuzzy modeling technique is proposed to make accurate long-term prediction of natural phenomena. The principal components (PCs) obtained from spectral analysis have narrow band frequency spectra and definite linear or nonlinear trends and periodic patterns; hence they are predictable in large prediction horizon. The incremental learning algorithm initiates a model for each of the components as an optimal linear least squares estimation, and adds the nonlinear neurons if they help to reduce error indices over training and validation sets. Therefore, the algorithm automatically constructs the best linear or nonlinear model for each of the PCs to achieve maximum generalization, and the long-term prediction of the original time series is obtained by recombining the predicted components. The proposed method has been primarily tested in long-term prediction of some well-known nonlinear time series obtained from Mackey&#x2013;Glass, Lorenz, and Ikeda map chaotic systems, and the results have been compared to the predictions made by multi-layered perceptron (MLP) and radial basis functions (RBF) networks. As a real world case study, the method has been applied to the long-term prediction of solar activity where the results have been compared to the long-term predictions of physical precursor and solar dynamo methods.
Future internet research and experimentation: the FIRE initiative
Authors: Anastasius Gavras, Arto Karila, Serge Fdida, Martin May, Martin Potts
Venue: ACM SIGCOMM Computer Communication Review (2007)

The research community worldwide has increasingly drawn its attention to the weaknesses of the current Internet. Many proposals are addressing the perceived problems, ranging from new enhanced protocols to fix specific problems up to the most radical proposal to redesign and deploy a fully new Internet. Most of the problems in the current Internet are rooted in the tremendous pace of increase of its use. As a consequence there was little time to address the deficiencies of the Internet from an architectural point of view. Within FP7, the European Commission has facilitated the creation of European expert groups around the theme FIRE "Future Internet Research and Experimentation". FIRE has two related dimensions: on one hand, promoting experimentally-driven long-term, visionary research on new paradigms and networking concepts and architectures for the future Internet; on the other hand, building a large-scale experimentation facility supporting both medium- and long-term research on networks and services by gradually federating existing and new testbeds for emerging or future Internet technologies. By addressing future challenges for the Internet such as mobility, scalability, security and privacy, this new experimentally-driven approach is challenging the mainstream perceptions for future Internet development. This new initiative is intended to complement the more industrially-driven approaches which are addressed under the FP7 Objective "The Network of the Future" within the FP7-ICT Workprogramme 2007-08. FIRE is focused on exploring new and radically better technological solutions for the future Internet, while preserving the "good" aspects of the current Internet, in terms of openness, freedom of expression and ubiquitous access. The FIRE activities are being launched in the 2nd ICT call, which closes in October 2007, under the FP7-ICT Objective 1.6 "New Paradigms and Experimental Facilities" (budget ε40m). Projects are envisaged to start in early 2008.
BDL: a language to control the behavior of concurrent objects
Authors: Frédéric Bertrand, Michel Augeraud
Venue: Proceedings of the Conference on Domain-Specific Languages on Conference on Domain-Specific Languages (DSL), 1997 (1997)

Combining concurrency and object orientation is still difficult. In an approach where methods are concurrency units, one of the main difficulties is the control of the behavior of objects. Our proposal is BDL a language allowing to express and to achieve this control. We propose a model where each object includes a so called "execution controller" programmed with BDL. This introduces a conceptually clean separation between processing (method execution) and control. The controller ensures the respect of scheduling constraints between the executions of methods. Similarly the behavior of aggregate objects can be controlled. This language has a convenient formal base. Thus, using the expression of control, behavioral properties of an object, or even of a group of interesting objects can be verified. Our approach allows, for example, deadlock detection or verification of safety properties while the compiled object controller keeps a reasonable size. A compiler has been implemented allowing to automatically generate the controller code from a BDL program. This compilation is achieved by producing an Esterel (reactive programming language) code from a BDL program, the Esterel compiler giving the executable code. Inter-method concurrency is implemented using lightweight processes.
Supporting Knowledge and Expertise Finding within Australia's Defence Science and Technology Organisation
Authors: Paul Prekop
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

This paper reports on work aimed at supporting knowledge and expertise finding within a large Research and Development (R&D) organisation. The paper first discusses the nature of knowledge important to R&D organisations and presents a prototype information system developed to support knowledge and expertise finding. The paper then discusses a trial of the system within an R&D organisation, the implications and limitations of the trial, and discusses future research questions.
A Real-time Dynamic Simulation Scheme for Large-Scale Flood Hazard Using 3D Real World Data
Authors: C Wang, T. R. Wan, I. J. Palmer
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

We propose a new dynamic simulation scheme for large-scale flood hazard modelling and prevention. The approach consists of a number of core parts: Digital terrain modelling with GIS data, Nona-tree space partitions (NTSP), Automatic River object recognition and registration, and a flood spreading model. The digital terrain modelling method allows the creation of a geometric real terrain model for augmented 3D environments with very large GIS data, and it can also use information gathered from aviation and satellite images with a ROAM algorithm. A spatial image segmentation scheme is described for river and flood identification and for a 3D terrain map of flooding region growth and visualisation. The region merging is then implemented by adopting Flood Region Spreading Algorithm (FRSA). Compared with the conventional methods, our approach has the advantages of being capable of realistically visualising the flooding in geometrically-real 3D environments, of handling dynamic flood behaviour in real-time and of dealing with very large-scale data modelling and visualisation.
Authentication Mechanisms for Mobile Agents
Authors: Leila Ismail
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

This paper describes authentication mechanisms for mobile agents. In these mechanisms, the authentication of mobile agents is controlled by the mobile-agents platform using digital signature and a Public Key Infrastructure. Agents are authenticated via the authentication of their running platforms. An important advantage of our technique is transparency of the mechanisms and the portability of non-secure applications onto a secure environment. The authentication mechanisms are integrated within the transportation layer of a mobile-agents system. A minimal mobile agent system and the authentication mechanisms have been implemented. The implementation experiments have shown the feasibility and the advantage of these mechanisms.
Data fusion algorithms for network anomaly detection: classification and evaluation
Authors: V. Chatzigiannakis, G. Androulidakis, K. Pelechrinis, S. Papavassiliou, V. Maglaris
Venue: Proceedings of the Third International Conference on Networking and Services (2007)

In this paper, the problem of discovering anomalies in a large-scale network based on the data fusion of heterogeneous monitors is considered. We present a classification of anomaly detection algorithms based on data fusion, and motivated by this classification, the operational principles and characteristics of two different representative approaches, one based on the Demster-Shafer Theory of Evidence and one based on Principal Component Analysis, are described. The detection effectiveness of these strategies are evaluated and compared under different attack scenarios, based on both real data and simulations. Our study and corresponding numerical results revealed that in principle the conditions under which they operate efficiently are complementary, and therefore could be used effectively in an integrated way to detect a wider range of attacks..
Debugging in Parallel
Authors: James A. Jones, James F. Bowring, Mary Jean Harrold
Venue: Proceedings of the 2007 international symposium on Software testing and analysis (2007)

The presence of multiple faults in a program can inhibit the ability of fault-localization techniques to locate the faults. This problem occurs for two reasons: when a program fails, the number of faults is, in general, unknown; and certain faults may mask or obfuscate other faults. This paper presents our approach to solving this problem that leverages the well-known advantages of parallel work flows to reduce the time-to-release of a program. Our approach consists of a technique that enables more effective debugging in the presence of multiple faults and a methodology that enables multiple developers to simultaneously debug multiple faults. The paper also presents an empirical study that demonstrates that our parallel-debugging technique and methodology can yield a dramatic decrease in total debugging time compared to a one-fault-at-a-time, or conventionally sequential, approach.
conTACT - A Vibrotactile Display for Computer Aided Surgery
Authors: Andreas Hein, Melina Brell
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

In this paper the concept and the first proving experiments of a navigation system for assistance during surgical interventions is presented. Novel aspects of this system are a new approach to transmit the navigation information to the surgeon. Contrary to known navigation systems the proposed approach does not only use visual support but provides information primarily by tactile stimuli. So the surgeon is not constrained to avert the gaze from the field of surgery during the navigation process. This paper concludes with the experimental evaluation of signal perception and a positioning task with tactile transmission of the navigation information.
Quality-aware data management
Authors: Sharad Mehrotra
Venue:  (2006)

Traditional data management systems operate over precise data and produce exact answers to posed queries. When data is imprecise, or when query processing is expensive, it may be costly or impossible to give perfect answers to applications. Quality-Aware Data Management attempts to deal with this problem by emphasizing (i) quality-performance tradeoffs that can be exploited to meet applications' quality requirements or minimize the use of resources, and (ii) quality guarantees about imprecise data and the approximate results produced by queries, allowing users to properly interpret them. This dissertation examines quality-aware data management techniques for approximate aggregate query processing over large datasets, for data capture and archival of highly dynamic data sources, for approximate selection queries over imprecise objects that can be probed to reveal their precise versions, and for multi-version selection queries.
Managing energy-performance tradeoffs for multithreaded applications on multiprocessor architectures
Authors: Soyeon Park, Weihang Jiang, Yuanyuan Zhou, Sarita Adve
Venue: Proceedings of the 2007 ACM SIGMETRICS international conference on Measurement and modeling of computer systems (2007)

In modern computers, non-performance metrics such as energy consumption have become increasingly important, requiring tradeoff with performance. A recent work has proposed performance-guaranteed energy management, but it is designed specifically for sequential applications and cannot be used to a large class of multithreaded applications running on high end computers and data servers. To address the above problem, this paper makes the first attempt to provide performance-guaranteed energy management for multithreaded applications on multiprocessor architectures. We first conduct a comprehensive study on the effects of energy adaptation on thread synchronizations and show that a multithreaded application suffers from not only local slowdowns due to energy adaptation, but also significant slowdowns propagated from other threads because of synchronization. Based on these findings, we design three Synchronization-Aware (SA) algorithms, LWT (Lock Waiting Time-based), CSL (Critical Section Length-based) and ODP (Operation Delay Propagation-based) algorithms, to estimate the energy adaptation-induced slowdowns on each thread. The local slowdowns are then combined across multiple threads via three aggregation methods (MAX, AVG and SUM) to estimate the overall application slowdown. We evaluate our methods using a large multithreaded commercial application, IBM DB2 with industrial-strength online transaction processing (OLTP) workloads, and six SPLASH parallel scientific applications. Our experimental results show that LWT combined with the MAX aggregation method not only controls the performance slow down within the specified limits but also conserves the most energy.
Hybrid Wordlength Optimization Methods of Pipelined FFT Processors
Authors: Cheng-Yeh Wang, Chih-Bin Kuo, Jing-Yang Jou
Venue: IEEE Transactions on Computers (2007)

Quickly and accurately predicting of the performance based on the requirements for IP-based system implementations optimizes design and reduces design time and overall cost. This study describes a novel hybrid method for the wordlength optimization of pipelined FFT processors that is the arithmetic kernel of OFDM-based systems. This methodology utilizes the rapid computing of statistical analysis and the accurate evaluation of simulation-based analysis to investigate a speedy optimization flow. A statistical error model for varying wordlengths of PE stages of an FFT processor was developed to support this optimization flow. Experimental results designate that the wordlength optimization employing the speedy flow reduces the percentage of the total area of the FFT processor that increases with an increasing FFT length. Finally, the proposed hybrid method requires shorter prediction time than the absolute simulation-based method does and achieves more accurate outcomes than a statistical calculation does.
Probabilistic system-on-a-chip architectures
Authors: Lakshmi N. Chakrapani, Pinar Korkmaz, Bilge E. S. Akgul, Krishna V. Palem
Venue: ACM Transactions on Design Automation of Electronic Systems (TODAES) (2007)

Parameter variations, noise susceptibility, and increasing energy dissipation of cmos devices have been recognized as major challenges in circuit and microarchitecture design in the nanometer regime. Among these, parameter variations and noise susceptibility are increasingly causing cmos devices to behave in an &ldquo;unreliable&rdquo; or &ldquo;probabilistic&rdquo; manner. To address these challenges, a shift in design paradigm from current-day deterministic designs to &ldquo;statistical&rdquo; or &ldquo;probabilistic&rdquo; designs is deemed inevitable. To respond to this need, in this article, we introduce and study an entirely novel family of probabilistic architectures: the probabilistic system-on-a-chip (psoc). psoc architectures are based on cmos devices rendered probabilistic due to noise, referred to as probabilistic CMOS or PCMOS devices. We demonstrate that in addition to harnessing the probabilistic behavior of pcmos devices, psoc architectures yield significant improvements, both in energy consumed as well as performance in the context of probabilistic or randomized applications with broad utility. All of our application and architectural savings are quantified using the product of the energy and performance, denoted (energy &times; performance): The pcmos-based gains are as high as a substantial multiplicative factor of over 560 when compared to a competing energy-efficient cmos-based realization. Our architectural design is application specific and involves navigating design space spanning the algorithm (application), its architecture (psoc), and the probabilistic technology (pcmos).
Computing synchronizer failure probabilities
Authors: Suwen Yang, Mark Greenstreet
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

System-on-Chip designs often have a large number of timing domains. Communication between these domains requires synchronization, and the failure probabilities of these synchronizers must be characterized accurately to ensure the robustness of the complete system. We present a novel approach for determining the failure probabilities of synchronizer circuits. Our approach using numerical integration to account for the nonlinear behaviour of real synchronizer circuits. We complement this with small-signal techniques to enable accurate estimation of extremely small failure probabilities. Our approach is fully automated, is suitable for integration into circuit simulation tools such as SPICE and enables accurate characterization of extremely small failure probabilities.