ppxscal/embedding_network huggingface dataset:
Computation of Waveform Sensitivity Using Geometric Transforms for SSTA
Authors: Ratnakar Goyal, Harindranath Parameswaran, Sachin Shrivastava
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

With shrinking process node sizes, the inherent effect of process variations is playing a larger factor in defining the behavior of a circuit and this has resulted in the promotion of Statistical Static Timing Analysis (SSTA) as a method for estimating the yield of a circuit in terms of timing activities. The accuracy of SSTA depends on the accuracy of timing sensitivities as computed using a Statistical Delay calculation (S-DC) Engine. The accuracy of the S-DC engine in turn depends on the accuracy and availability of the required information in the timing library. For statistical analysis, these libraries need to contain information on the effect that process variations have on the library timing data. New generation delay calculators also require change in waveform shape (waveform sensitivity) with process variation to be modeled in timing library for better accuracy. Waveform sensitivities are required for accurate computation of gate delay sensitivities for gates driving large interconnect loads or a large number of fanouts. However, modeling waveform sensitivities in the timing library increases the library size significantly (~40% per process parameter). Also in different scenarios the characterization of waveform sensitivities may not be possible. In this paper, we propose a technique for computing waveform sensitivities during analysis when such information is not part of the standard cell library. We use geometric transforms and the nominal waveform information, along with available sensitivities of the timing activities in non-linear delay models to derive waveform sensitivities. We show that using our approach the size of a statistical library with 700 cells is reduced by ~65% as compared to a statistical library with characterized waveform sensitivities. We also show that the computed waveform sensitivities provide an accuracy improvement of 15-20% in the computation of standard deviation.
Nadir and off-nadir hyperspectral field data: strengths and limitations in estimating grassland biophysical characteristics
Authors: D. Gianelle, F. Guastella
Venue: International Journal of Remote Sensing (2007)

In recent years, hyperspectral and multi-angular approaches for quantifying biophysical characteristics of vegetation have become more widely used. In fact, as both hyperspectral and multi-angle reflectance decrease the level of noise on retrieved geophysical parameter values, they increase their reliability by also reducing the saturation problem of the relationships between vegetation indices and biophysical characteristics. To test which is the best methodology in estimating some important biophysical grassland parameters (biomass, total and percent biomass nitrogen content, phytomass and its total and percent nitrogen content), nadir and off-nadir measurements were carried out, three times during the vegetative period of 2004, in a permanent flat meadow located in the experimental farm of the University of Padua, Italy. The two approaches and the broad band vegetation indices calculated using Landsat bands were compared considering both the best determination coefficients of five vegetation indices, calculated with the two analysis, and through a partial least squares regression using different spectral regions measured at different angles as predictive variables. Using nadir data the red edge region was the most useful for the prediction of biophysical variables, especially phytomass, but also nitrogen content. The off-nadir data did not provide any significance differences in results to that of data obtained in nadir view but both methods seem to be better adapted to describe biophysical parameters of vegetation than the use of broad band vegetation indices.
Management and data frames: a new QoS metric for vertical handover in next generation (wireless) networks - NGN
Authors: Rajender Kumar, Brahmjit Singh
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

Wireless Communication in Next Generation Networks (NGN) is envisioned to integrate heterogeneous networks (WLAN/WiPAN/UMTS). Each network having individual different coverage and capacity i.e. covering hotspots with high data rates and mobile cellular systems with full coverage. To attain seamless transfer of an ongoing session in NGN, we need an optimized Vertical Handover (VHO) i.e. handover between two different air-interface standards. We have some VHO decision algorithm which helps in network selection during VHO like SAW, MEW, GRA, TOPSIS and etc. These decision algorithms are based on certain Quality of Service (QoS) metrics include bandwidth, jitter, BER, delay. It is very important to know how these metrics have been measured. Based on this parameter-measurement, a decision has to be made to execute VHO. This paper investigates performance characteristic measurements of PHY and MAC layer in IEEE802.11x i.e. baseband measurements in terms NAV and EVM for Data and management frames. Finally, EVM is introduced as a new trigger to initiate Vertical handovers. This paper is supported by simulated experimental results to propose a new QoS trigger to initiate a new session to execute a Vertical Handover. Suggestions are accompanied with this paper for improvement in modulation schemes for Network selection criteria for emerging WLAN technology.
Tighter bounds on the exact complexity of string matching
Authors: R. Cole, R. Hariharan
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The paper considers how many character comparisons are needed to find all occurrences of a pattern of length m in a text of length n. The main contribution is to show an upper bound of the form n + O(n/m) character comparisons, following preprocessing. Specifically, the authors show an upper bound of n+8/3(m+1)(n-m) character comparisons. This bound is achieved by an online algorithm which performs O(n) work in total, requires O(m) space and O(m/sup 2/) time for preprocessing. In addition the following lower bounds are shown: for online algorithms, a bound of n+11/5(m+1) (n-m) character comparisons for m = 10 + 11 k, for any integer k >or= 1, and for general algorithms, a bound of n+2(n-m)/m+3 character comparisons, for m=2 k+l, for any integer k>or=1.
Multi router traffic grapher (MRTG) for body area network (BAN) surveillance
Authors: Josep Riudavets, Karla Félix Navarro, Elaine Lawrence, Robert Steele, Marco Messina
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

Wireless sensors are capable of gathering real-time data not only from the environment, but also from the signals that the human body can generate. These tiny and smart tags may act as another layer of infrastructure between the physical world and the Internet. However, a complete system of software tools, gateway devices and reliable communication channels are needed to achieve this bridging. In our testbed we tested the limits of implementing a motes based system using commodity based hardware In this paper, the authors discuss a portable and remote health monitoring system using wireless sensors, based on a persistent monitoring of bio-signals from an unwell or elderly person, using the concept of Body Area Network (BAN). All the signals not only from the body but also from the environment, will be stored in a web server and displayed graphically using an existing tool for monitoring network traffic, namely MRTG (Multi Router Traffic Grapher). The aim is to allow secure remote access to certain health parameters in order to alert carers to abnormal body signs, and provide a complete data collection at doctor's disposal. Consequently MRTG can facilitate the determination of how changes in the environment affect vital signs (e.g. correlation between weather and health). The researchers demonstrate that wireless sensors have a very high level of integration with existing tools related to network monitoring. This will enable a new and powerful method for joining physical and networks layers.
An adaptive 3D virtual environment for learning the X3D language
Authors: Luca Chittaro, Roberto Ranon
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

This demo will illustrate the adaptive interface of an application (whose architecture and implementation have been presented in detail in [2]) for learning 3D Graphics programming (in the X3D ISO standard). The application situates users in a 3D Virtual Environment where they can learn by selecting and inspecting actual examples.
Genome Regions Involved in Multiple Regulatory Pathways Identified Using GSEL, A Genome-Wide Database of Regulatory Sequence Elements of Geobacter sulfurreducens
Authors: Julia Krushkal, Marko Puljic, Bin Yan, Jose F. Barbe, Radhakrishnan Mahadevan, Bradley Postier, Regina A. O'Neil, Gemma Reguera, Ching Leang, Laurie N. DiDonato, Cinthia Núñez, Barbara A. Methé, Ronald M. Adkins, Derek R. Lovley
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Organisms from the metal-reducing family Geobacteraceae participate in bioremediation of contaminated environments and in energy harvesting. We have developed a database and an accompanying online query system, GSEL, for Geobacter Sequence Elements (available from http://www.geobacter.org/research/gsel/). It compiles information on predicted transcription regulatory elements in the genome of G. sulfurreducens. These elements were derived from analyses that employed genome-wide transcription profiling, comparative genomics, and similarity searches. Clustering was employed to group overlapping sequence elements with similar genome locations. Subsequent scoring and sorting allowed us to identify individual sequence elements and regulatory clusters that were predicted by the highest number of independent microarray gene expression and sequence comparison data sets. These sequence elements and genome regions are likely to be involved in gene regulation under a variety of conditions or in multiple biological pathways.
Misuse Intrusion Detection Using a Fuzzy-Metaheuristic Approach
Authors: Hamid Mohamadi, Jafar Habibi, Mohammad Saniee Abadeh
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In this paper, we use simulated annealing heuristics for constructing an intrusion detection system (IDS). The proposed IDS combines the learning ability of simulated annealing heuristics with the approximate reasoning method of fuzzy systems. The use of simulated annealing is an effort to effectively explore the large search space related to intrusion detection problems, and find the optimum set of fuzzy if-then rules. The aim of this paper is to present the capability of simulated annealing based fuzzy system to deal with intrusion detection classification problem as a new real-world application area. Experiments were performed with KDD-Cup99 intrusion detection benchmark data set.
Turnpike properties of a class of aquifer control problems
Authors: Arie Leizarowitz
Venue: Automatica (Journal of IFAC) (2008)

In this paper we are concerned with the long-run behavior of solutions to infinite horizon optimal control systems, where the state equation is given by a non-linear parabolic equation. The goal is to establish convergence to steady state of solutions of the optimal control problems under consideration. Our motivation to consider this problem is the study of agricultural economics models concerned with the optimal management of groundwater. The main object of the study towards achieving this goal is the continuity of solutions of the state equation with respect to the initial condition and the non-homogeneous term. We establish this continuity by employing well-known norm estimates for linear parabolic equations.
Detrended Fluctuation Analysis of Heartbeat Interval Signal: Alternans Lowers the Scaling Exponent of Heartbeat Fluctuation Dynamics in Animal Models and Humans
Authors: Toru Yazawa, Katsunori Tanaka, Tomoo Katsuyama
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

“Alternans” is an arrhythmia exhibiting alternating amplitude or alternating interval from heartbeat to heartbeat, which was first described in 1872 by Traube. Recently alternans was finally recognized as the harbinger of a cardiac disease because physicians noticed that an ischemic heart exhibits alternans. To quantify irregularity of the heartbeat including alternans, we used the detrended fluctuation analysis (DFA). We revealed that in both, animal models and humans, the alternans rhythm lowers the scaling exponent. This correspondence describes that the scaling exponent calculated by the DFA reflects a risk for the “failing” heart.
Distributed Online Simultaneous Fault Detection for Multiple Sensors
Authors: Ram Rajagopal, XuanLong Nguyen, Sinem Coleri Ergen, Pravin Varaiya
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

Monitoring its health by detecting its failed sensors is essential to the reliable functioning of any sensor network. This paper presents a distributed, online, sequential algorithm for detecting multiple faults in a sensor network. The algorithm works by detecting change points in the correlation statistics of neighboring sensors, requiring only neighbors to exchange information. The algorithm provides guarantees on detection delay and false alarm probability. This appears to be the first work to offer such guarantees for a multiple sensor network. Based on the performance guarantees, we compute a tradeoff between sensor node density, detection delay and energy consumption. We also address synchronization, finite storage and data quantization. We validate our approach with some example applications.
Contrail observations over Southern and Eastern Asia in NOAA/AVHRR data and comparisons to contrail simulations in a GCM
Authors: R. Meyer, R. Buell, C. Leiter, H. Mannstein, S. Pechtl, T. Oki, P. Wendling
Venue: International Journal of Remote Sensing (2007)

For the first time the contrail cover for a region covering Thailand and surrounding regions as well as for the region of Japan and its surroundings are determined by remote sensing observations. Locally received NOAA/AVHRR satellite data are analysed by a fully automated contrail detection algorithm. For both regions approx. 400 NOAA-14 satellite scenes from four months of the year 1998 were analysed. Both regions show sufficient air traffic to produce an observable amount of contrails. Thus we are able to measure for the first time contrail frequencies in the tropics and compare it to a nearby mid latitudinal region. The annual average of the daily mean contrail cloud coverage is 0.13% for the Thailand region and about 0.25% for the Japan region. For both regions the contrail cover is largest during spring. The daily cycle shows surprisingly high contrail coverage during night in spite of lower air traffic densities during night time. The satellite observed contrail cover is compared with simulations of contrails by use of the general circulation model ECHAM4 related to air traffic emissions of 1992. While the derived patterns of the regional contrail distributions agree well, the contrail coverage derived from satellite data is larger than the simulated coverage. This discrepancy appears to be mainly due to an increase in air traffic in the time period between the model study and the observations.
Some tools for approximate 3-coloring
Authors: A. Blum
Venue: Proceedings of the 31st Annual Symposium on Foundations of Computer Science (1990)

Several tools for use in approximation algorithms to color 3-chromatic graphs are presented. The techniques are used in an algorithm that colors any 3-chromatic graph with O(n/sup 3/8/)+O(n/sup 3/8+O(1)/) colors (or more precisely) O(n/sup 3/8/log/sup 5/8/ n) colors, which improves the previous best bound of O(n/sup 0.4+0(1)/) colors. The techniques are illustrated by considering a problem in which the 3-chromatic graph is created not by a worst-case adversary, but by an adversary each of whose decisions (whether or not to include an edge) is reversed with some small probability or noise rate p. This type of adversary is equivalent to the semirandom source of M. Santha and U.V. Vazirani (1986). An algorithm that will actually 3-color such a graph with high probability even for quite low noise rates (p>or=n/sup -1/2+ epsilon / for constant epsilon >0), is presented.
Layer decomposition and constitution modelling for rapid prototyping
Authors: S. Sriram, S. W. Lye
Venue: International Journal of Computer Integrated Manufacturing (2007)

Current rapid prototyping techniques have been used to produce freeform solid models. This usually involves new dedicated fabrication machines incurring costly capital additions, maintenance and materials. In the current paper, an approach is proposed where rapid layered prototypes are fabricated using standard generic 2D machining systems and commonly available sheet materials. The process necessitates the decomposition of a computer aided design (CAD) object into cross-sectional profile layers. From these machined profiles, they are then constituted to form the prototype. Several prototypes of varying sizes having quite complex internal and external profiles have been fabricated. A discussion into the merits and potential limitations of this approach is also made.
Dynamic Software Product Lines
Authors: Svein Hallsteinsen, Mike Hinchey, Sooyong Park, Klaus Schmid
Venue: Computer (2008)

DSPLs produce software capable of adapting to changes in user needs and resource constraints.
An Internet Traffic Forecasting Model Adopting Radical Based on Function Neural Network Optimized by Genetic Algorithm
Authors: Cong Wang, Xiaoxia Zhang, Han Yan, Linlin Zheng
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Traditional traffic forecasting model is hard to show non-liner characteristic of Internet. Neural networks and genetic algorithm are representatives of modern algorithms. Considering that BP neural networks model is easy to take local convergence, this paper put forward genetic algorithm optimizing weight and bias value of Radial Based Function Network(GA-RBF), made a Internet traffic forecasting model which is relative with p steps and ahead of l steps, overcame the limitations of traditional forecasting algorithm model and BP neural networks algorithm. To prove the effectiveness and rationality of this algorithm, we forecasted the China Education Network Main Port traffic with GA-RBF neural networks. According to the analysis, we find that the GA-RBF forecasting effect is obviously better than BP neural networks. The conclusion shows that it is one of available and effective ways to use GA-RBF artificial neural networks to do Internet traffic forecast.
Creating surveys for the visualizers generation: the use of affective imagery to capture perceptions of the computing discipline
Authors: Tracy L. Lewis, Kayenda T. Johnson, Nicolas Dishon, Matthew Firtion
Venue: Journal of Computing Sciences in Colleges (2008)

In light of the decline in computing student enrollment, the need to attract undeclared majors to the IT discipline, and the need to gather qualitative data on the current "visualizers" generation (of college students), an affective imagery survey was developed and administered to 26 undergraduates. This survey was designed to assess the perceptions of the computing discipline, particularly, non-IT majors' perceptions of IT students and IT professionals. The results of the preliminary study show that the use of this novel affective imagery survey was as reliable as traditional online text based surveys. However, the sampled student population preferred the affective imagery survey. Considering the recent decline in survey response rates from collegeaged (18--23) students, affective imagery surveys may provide a more effective alternative to traditional online surveys. Furthermore, results of the preliminary study also show that non-IT majors frequently perceived that an IT person (student or professional) is "a nerd/geek" or "someone that is always sitting in front of a computer"; and, the IT majors reported that an IT person is "a successful money-maker" and "an industrious person."
Outlines of a model of general ontology
Authors: Károly Varasdi, Zsófia Gyarmathy, András Simonyi, Dániel Szeredi
Venue: Acta Cybernetica (2007)

This article outlines a new model of general ontology that draws significantly on the results of contemporary philosophy and cognitive science. It combines ideas from Gärdenfors's Conceptual Spaces Model and Edmund Husserl's philosophical insights concerning ontology and dependency. We put forth a possible architecture for general ontologies based on a "horizontal" (dependency-based) and a "vertical" (abstraction-based) arrangement of the concepts in the ontology.
Identifying, tabulating, and analyzing contacts between branched neuron morphologies
Authors: J. Kozloski, K. Sfyrakis, S. Hill, F. Schürmann, C. Peck, H. Markram
Venue: IBM Journal of Research and Development (2008)

Simulating neural tissue requires the construction of models of the anatomical structure and physiological function of neural microcircuitry. The Blue Brain Project is simulating the microcircuitry of a neocortical column with very high structural and physiological precision. This paper describes how we model anatomical structure by identfying, tabulating, and analyzing contacts between 104 neurons in a morphologically precise model of a column. A contact occurs when one element touches another, providing the opportunity for the subsequent creation of a simulated synapse. The architecture of our application divides the problem of detecting and analyzing contacts among thousands of processors on the IBM Blue Gene/L™ supercomputer. Data required for contact tabulation is encoded with geometrical data for contact detection and is exchanged among processors. Each processor selects a subset of neurons and then iteratively 1) divides the number of points that represents each neuron among column subvolumes, 2) detects contacts in a subvolume, 3) tabulates arbitrary categories of local contacts, 4) aggregates and analyzes global contacts, and 5) revises the contents of a column to achieve a statistical objective. Computing, analyzing, and optimizing local data in parallel across distributed global data objects involve problems common to other domains (such as three-dimensional image processing and registration). Thus, we discuss the generic nature of the application architecture.
A software development course for CC2001: the third time is charming
Authors: John F. Dooley
Venue: ACM SIGCSE Bulletin (2008)

In this poster, we describe our experiences over the past three years in developing and delivering a compressed course in Software Development and Professional Practice for our computer science major. This course is one of the core courses in the CC2001 small department model and brings topics in software engineering, design, code writing and reading, computer ethics, and professional practice into the heart of the major. The poster describes the course, the topics we cover, how the course is delivered, what's worked and not worked, and how it has evolved over the last three years.