ppxscal/embedding_network huggingface dataset:
On the homology of two-dimensional elimination
Authors: Jooyoun Hong, Aron Simis, Wolmer V. Vasconcelos
Venue: Journal of Symbolic Computation (2008)

We study birational maps with empty base locus defined by almost complete intersection ideals. Birationality is shown to be expressed by the equality of two Chern numbers. We provide a relatively effective method for their calculation in terms of certain Hilbert coefficients. In dimension 2 the structure of the irreducible ideals-always complete intersections by a classical theorem of Serre-leads by a natural approach to the calculation of Sylvester determinants. We introduce a computer-assisted method (with a minimal intervention by the computer) which succeeds, in degree @?5, in producing the full sets of equations of the ideals. In the process, it answers affirmatively some questions raised by Cox [Cox, D.A., 2006. Four conjectures: Two for the moving curve ideal and two for the Bezoutian. In: Proceedings of Commutative Algebra and its Interactions with Algebraic Geometry, CIRM, Luminy, France, May 2006 (available in CD media)].
Survival in cyberspace
Authors: Robert Ghanea-Hercock
Venue: Information Security Tech. Report (2007)

The immune system response of the vertebrates demonstrates an extremely adaptive and resilient defensive capability against a broad spectrum of pathogenic attacks. The field of artificial immune systems (AISs) aims to replicate this capability in the digital environment. In particular, we would like to understand adaptive survivability and defence in large-scale computing networks. In this paper we discuss some of the background concepts to AIS and focus on one specific aspect required to achieve a digital immune system, i.e. the social dynamics of competitive and co-operative defence. In particular, the ability of an information network to maintain itself in the face of continuous perturbation raises more complex issues related to system metabolism and network topology. In order to investigate these processes a multi-agent simulation model has been developed that demonstrates a self-organising group formation capability and a collective immune response. In this model each agent is susceptible to viral infections passed between the agents and has local sensors and a complex metabolic state that reflects its current health. We then introduced an artificial immune system to each agent that allowed learned 'antibody' solutions to be exchanged between the agents within a social group. The health of a co-operative group was observed to improve by over 90%, relative to isolated agents or non-cooperative groups. The specific solutions advocated are therefore to utilise distributed defence mechanisms and the monitoring of metabolic processes to detect intrusions. Finally, the paper considers the problem of how we might utilise such knowledge to develop greater security and robustness in real-world networks using distributed agent systems.
Strongly reducing variants of the Krivine abstract machine
Authors: Pierre Crégut
Venue: Higher-Order and Symbolic Computation (2007)

We present two variants of the Krivine abstract machine that reduce lambda-terms to full normal form. We give a proof of their correctness by interpreting their behaviour in the ¿ ¿-calculus.
Abstract, Multifaceted Modeling of Embedded Processors for System Level Design
Authors: Gunar Schirner, Andreas Gerstlauer, Rainer Domer
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Embedded software is playing an increasing role in todays SoC designs. It allows a flexible adaptation to evolving standards and to customer specific demands. As software emerges more and more as a design bottleneck, early, fast, and accurate simulation of software becomes crucial. Therefore, an efficient modeling of programmable processors at high levels of abstraction is required. In this article, we focus on abstraction of computation and describe our abstract modeling of embedded processors. We combine the computation modeling with task scheduling support and accurate interrupt handling into a versatile, multi-faceted processor model with varying levels of features. Incorporating the abstract processor model into a communication model, we achieve fast co-simulation of a complete custom target architecture for a system level design exploration. We demonstrate the effectiveness of our approach using an industrial strength telecommunication example executing on a Motorola DSP architecture. Our results indicate the tremendous value of abstract processor modeling. Different feature levels achieve a simulation speedup of up to 6600 times with an error of less than 8% over a ISS based simulation. On the other hand, our full featured model exhibits a 3% error in simulated timing with a 1800 times speedup.
On the tip-of-the-tongue: Neural correlates of increased word-finding failures in normal aging
Authors: Meredith A. Shafto, Deborah M. Burke, Emmanuel A. Stamatakis, Phyllis P. Tam, Lorraine K. Tyler
Venue: Journal of Cognitive Neuroscience (2007)

Tip-of-the-tongue (TOT) experiences are frustrating word-finding failures where people are temporarily unable to produce a word they are certain they know. TOT frequency increases with normal aging during adulthood, and behavioral evidence suggests that the underlying deficit is in retrieving the complete phonology of the target word during production. The present study investigated the neural correlates of this phonological retrieval deficit. We obtained 3-D T1-weighted structural magnetic resonance images (MRI) for healthy participants between 19 and 88 years old and used voxel-based morphometry to measure gray matter density throughout the brain. In a separate session, participants named celebrities cued by pictures and descriptions, indicating when they had a TOT, and also completed Raven's Progressive Matrices (RPM), a task that does not involve phonological production. The number of TOTs increased with age and also with gray matter atrophy in the left insula, an area implicated in phonological production. The relation between TOTs and left insula atrophy cannot be attributed to the correlation of each variable with age because TOTs were related to insula atrophy even with age effects removed. Moreover, errors on the RPM increased with age, but performance did not correlate with gray matter density in the insula. These results provide, for the first time, an association between a region in the neural language system and the rise in age-related word-finding failures and suggest that age-related atrophy in neural regions important for phonological production may contribute to age-related word production failures.
Clock Skew Scheduling with Delay Padding for Prescribed Skew Domains
Authors: Chuan Lin
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

Clock skew scheduling is a technique that intentionally introduces skews to memory elements to improve the performance of a sequential circuit. It was shown in (Ravindran, 2003) that the full optimization potential of clock skew scheduling can be reliably implemented using a few skew domains. In this paper we present an optimal skew scheduling algorithm for sequential circuits with flip-flops. Given a finite set of prescribed skew domains, the algorithm finds a domain assignment for each flip-flop such that the clock period is minimized with possible delay padding. Experimental results validate the efficiency of our algorithm and show 17% improvement on average in clock period.
Rank-Augmented LU-Algorithm for Computing Generalized Matrix Inverses
Authors: S. K. Sen
Venue: IEEE Transactions on Computers (1974)

A rank-augmnented LU-algorithm is suggested for computing a generalized inverse of a matrix. Initially suitable diagonal corrections are introduced in (the symmetrized form of) the given matrix to facilitate decomposition; a backward-correction scheme then yields a desired generalized inverse.
A Classification Method Based on Non-linear SVM Decision Tree
Authors: Hui Zhao, Yong Yao, Zhijing Liu
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

The induction of Classification of decision tree is an important algorithm for data mining now. The Support Vector Machine technology and the decision tree have combined into one multi-class classifier so as to solve multi-class classification problems. In this paper, SVM is extended to non-linear SVM by using kernel functions and a new method of NSVM decision tree is proposed based on traditional SVM decision tree. Classification experiments prove the method is effective.
Grid-enabling data mining applications with DataMiningGrid: An architectural perspective
Authors: Vlado Stankovski, Martin Swain, Valentin Kravtsov, Thomas Niessen, Dennis Wegener, Jörg Kindermann, Werner Dubitzky
Venue: Future Generation Computer Systems (2008)

The DataMiningGrid system has been designed to meet the requirements of modern and distributed data mining scenarios. Based on the Globus Toolkit and other open technology and standards, the DataMiningGrid system provides tools and services facilitating the grid-enabling of data mining applications without any intervention on the application side. Critical features of the system include flexibility, extensibility, scalability, efficiency, conceptual simplicity and ease of use. The system has been developed and evaluated on the basis of a diverse set of use cases from different sectors in science and technology. The DataMiningGrid software is freely available under Apache License 2.0.
Rishi: identify bot contaminated hosts by IRC nickname evaluation
Authors: Jan Goebel, Thorsten Holz
Venue: Proceedings of the first conference on First Workshop on Hot Topics in Understanding Botnets (2007)

In this paper, we describe a simple, yet effective method to detect bot-infected machines within a given network that relies on detection of the communication channel between bot and Command & Control server (C&C server). The presented techniques are mainly based on passively monitoring network traffic for unusual or suspicious IRC nicknames, IRC servers, and uncommon server ports. By using n-gram analysis and a scoring system, we are able to detect bots that use uncommon communication channels, which are commonly not detected by classical intrusion detection systems. Upon detection, it is possible to determine the IP address of the C&C server, as well as, the channels a bot joined and the additional parameters which were set. The software Rishi implements the mentioned features and is able to automatically generate warning emails to report infected machines to an administrator. Within the 10 GBit network of RWTH Aachen university, we detected 82 bot-infected machines within two weeks, some of them using communication channels not picked up by other intrusion detection systems.
Reconfigurable-computing technology
Authors: A. V. Palagin, V. N. Opanasenko
Venue: Cybernetics and Systems Analysis (2007)

Evolution of computers with flexible architecture is considered. Distinctive features of the architectural and structural organization of reconfigurable computer systems (RCSs) are described. Based on a modified logical-informational method and a configuration file library, a general algorithm is proposed to design RCSs. A new class of universal information processing means is proposed, namely, adaptive logical networks.
22-29GHz Ultra-Wideband CMOS Pulse Generator for Collision Avoidance Short Range Vehicular Radar Sensors
Authors: Ahmet Oncu, B. B. M. Wasanthamala Badalawa, Tong Wang, Minoru Fujishima
Venue: Proceedings of the 2007 Asia and South Pacific Design Automation Conference (2007)

The pseudo millimeter wave 22-29GHz ultra-wideband (UWB) is attractive for the applications in short-range (SR) automotive radar sensors in order to contribute to significant reduction of traffic fatalities. Although CMOS is suitable for the short-range radar since processing units can be implemented in the same chip with the UWB front-end building block, it is difficult to operate CMOS pulse generators at such a high frequency. To realize the pseudo-millimeter-wave band using CMOS, we have proposed a new pulse generator consisting of a series of delay cells and edge combiners with waveform shaping. As a result of measurement using 90nm CMOS technology, 1Gbps pulses are successfully generated with a power consumption of 1.4mW at a supply voltage of 0.9V. This result will be the key technology for a one-chip SR cost effective radar sensors.
Toward Fast Color-Shaded Images of CAD/CAM Geometry
Authors: Paolo Sabella, Michael Wozny
Venue: IEEE Computer Graphics and Applications (1983)

A software processor developed at RPI adds color-shaded imaging capability to 3-D geometric modeling systems, greatly enhancing their usefulness in industrial design applications.
An Efficient Hardware Architecture for Quarter-Pixel Accurate H.264 Motion Estimation
Authors: Serkan Oktem, Ilker Hamzaoglu
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

In this paper, we present an efficient hardware architecture for real-time implementation of quarter-pixel accurate variable block size motion estimation for H.264 / MPEG4 Part 10 video coding. The proposed hardware performs quarter-pixel interpolation dynamically, i.e. only the quarter pixels necessary for performing quarter-pixel accurate search at the location pointed by the half-pixel motion vector are calculated. This reduces the amount of computation performed for quarter-pixel interpolation, and therefore reduces the power consumption of the quarter-pixel accurate motion estimation hardware. This hardware is designed to be used as part of a complete H.264 video coding system for portable applications. The proposed hardware architecture is implemented in Verilog HDL. The Verilog RTL code is verified to work at 60 MHz in a Xilinx Virtex II FPGA. The FPGA implementation can process 34 VGA frames (640x480) per second.
Effective color space representation for wavelet based compression of HDR images
Authors: Masahiro Okuda, Nicola Adami
Venue: Proceedings of the 14th International Conference on Image Analysis and Processing (2007)

Effective color image and video coding is usually exploited coupling a compression method with the most suitable color space representation. This work extends a previously proposed High Dynamic Range (HDR) image coding method, which combines a logarithmic color adaptation module with a JPEG2000 codec. Here we propose to change the original preprocessing stage with a more adequate one, based on the LogLuv color space representation, in order to take fully advantage of wavelet based coding. The experimental comparisons confirm that the proposed method improves the compression performances and simplify the overall coding scheme.
Analysis ofWiMedia-based UWB Mesh Networks
Authors: Sebastian Max, Erik Weiss, Guido R. Hierz
Venue: Proceedings of the 32nd IEEE Conference on Local Computer Networks (2007)

Regarding maximum transmission rates, UltraWideband (UWB) seems to be the wireless technology which could successfully replace most of the data-cables in office and home environments: With up to 480 Mb/s gross data rate, wireless high-definition video streaming and data synchronization become feasible. Of course, these advantages come at a price: UWB is designed for short-range communication, limited to 10m. While this suffices for some application, it does not fulfill the vision of ubiquitous wireless access in the fully-connected home. A straightforward solution to increase the network coverage is given by Wireless Mesh Networks (WMNs). In this paper, we analyze if the combination of UWB and WMN is able to provide the required coverage and the expected data rates. Several different deployment concepts (including adhoc networking and dedicated mesh relays) are evaluated with a realistic system model, which is able to compute the resulting network capacity. The results show that under the assumptions of the model, i. e. a MAC which is able to exploit spatial divided frequency reuse, UWB mesh networks are able to provide a stable capacity of more than 100 Mb/s in a typical scenario of up to 250m2. Hence, the combination of the two technologies is able to succeed in much more application scenarios in comparison to the current UWB standard.
Bio-inspired promoters and inhibitors for self-organized network security facilities
Authors: Falko Dressler
Venue: Proceedings of the 1st international conference on Bio inspired models of network, information and computing systems (2006)

Self-organization techniques based on promoters and inhibitors has been intensively studied in biological systems. Promoters enable an on-demand amplification of reactions to a particular cause. This allows to react quickly with appropriate countermeasures. On the other hand, inhibitors are capable of regulating this uncontrolled amplification by suppressing the reaction. In this paper, we demonstrate the applicability of these mechanisms in a network security scenario consisting of network monitoring elements, attack detection, and firewall devices. Previous work identified most existing detection approaches as not suitable for high-speed networks. This problem can be alleviated by separating the methodologies for network monitoring and for subsequent data analysis. In this paper, we present an adaptation algorithm that allows to manage the individual configuration parameters in order to optimize the overall system. We show the advantages of self-regulating techniques based on promoters and inhibitors that lead to maximized security and that gracefully degradate in case of overload situations. We created a simulation model to verify the algorithms. The results of the conducted simulations encourage further studies in this field.
A Fuzzy Extension of ALC with Fuzzy Modifiers
Authors: Hailong Wang, Z. M. Ma, Li Yan, Gang Zhang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 04 (2007)

In this paper, we apply a class of fuzzy modifiers based on fuzzy relations in description logics (DLs) to represent complex imprecise and incomplete knowledge. We investigate how to introduce the fuzzy modifiers into a fuzzy description logic ALC. The fuzzy description logic ALC with the fuzzy modifiers, called FALCM in the paper, has a more expressive capacity to represent imprecise and incomplete knowledge. At last, we give the reasoning algorithms for the satisfiability of FALCM concepts.
A Cell Transmission Model and Its Application in Optimizing the Location of Variable Message Signs
Authors: Hua-Yan Shang, Hai-Jun Huang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

The variable message signs (VMS) have been widely used in guiding and managing the dynamic traffic with development of intelligent transportation technologies. This paper employs a cell transmission model to study the location problem of VMS information board. Simulation results show that an optimal VMS location exists in deed for minimizing the total travel time of the traffic system. Route choice probabilities adopted before and after a traffic incident significantly affect the optimal VMS location. It is found that the VMS should be placed far from the incident site if the incident makes traffic be held up for long time.
Workshop Report: Computer Elements Committee Discusses Micros and Minis
Authors: S. M. Neville
Venue: Computer (1980)

System costs are shifting from hardware to packaging, testing, software/firmware, and communications. Thus, new hardware features to ease testing and software problems are essential.
Sliced data structure for particle-based simulations on GPUs
Authors: Takahiro Harada, Seiichi Koshizuka, Yoichiro Kawaguchi
Venue: Proceedings of the 5th international conference on Computer graphics and interactive techniques in Australia and Southeast Asia (2007)

We present a sliced data structure that is effective for use in neighboring particle search for particle-based simulations. In this method, a grid is dynamically constructed to fit to a particle distribution. Rather than computing the grid to fit perfectly to the particle distribution, it compute a grid with some margin to the distribution. This lowers the computation cost of constructing the data structure. Before storing particle indices on a grid, key values which are used to compute the index of a voxel are calculated. The proposed data structure can be introduced into particle-based simulations that run entirely on the Graphics Processing Unit (GPU) because the construction of this data structure and access to storing values can also be also performed entirely on the GPU. The proposed data structure removes the restriction of a computation region with a fixed grid and makes it possible to simulate particle motions over a larger area. Moreover, the cost of the proposed method is low enough for use in real-time applications. In this paper, we first introduce the sliced data structure and then describe its implementation on the GPU. Finally, we apply the propsed method to particle-based simulations and present its quantitative evaluations.
Modeling and Verifying WNT Signaling Pathway
Authors: Xian Xu, Yanbin Yu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 02 (2007)

WNT signaling pathway is an important pathway in the development and disease forming of a variety of animals, concerning such processes as hematopoiesis and oncogenesis. In this paper we use quantitative approach to study the canonical pathway of WNT signaling. We first present the basic knowledge of the WNT signaling pathway, including the necessary elements on the pathway, then introduce the modeling method, the tissue P system, which is a computational device inspired from the behavior of living cells. After that we construct the model of the WNT signaling pathway using the tissue P system. Moreover, we implement the model using Maude, a rewriting logic based interpreter software. Provided with the model implementation, we model check some critical properties on several nodes of the WNT signaling pathway, to show the effect of the modeling and implementation. We draw the conclusion in the end.
Impact Analysis of Missing Values on the Prediction Accuracy of Analogy-based Software Effort Estimation Method AQUA
Authors: Jingzhou Li, Ahmed Al-Emran, Guenther Ruhe
Venue: Proceedings of the First International Symposium on Empirical Software Engineering and Measurement (2007)

Effort estimation by analogy (EBA) is often confronted with missing values. Our former analogy-based method AUQA is able to tolerate missing values in the data set, but it is unclear how the percentage of missing values impacts the prediction accuracy and if there is an upper bound for how big this percentage might become in order to guarantee the applicability of AQUA. This paper investigates these questions through an impact analysis. The impact analysis is conducted for seven data sets being of different size and having different initial percentages of missing values. The major results are that (i) we confirm the intuition that the more missing values, the poorer the prediction accuracy of AQUA; (ii) there is a quadratic dependency between the prediction accuracy and the percentage of missing values; and (iii) the upper limit of missing values for the applicability of AQUA is determined as 40%. These results are obtained in the context of AQUA. Further analysis is necessary for other ways of applying EBA, such as using different similarity measures or analogy adaptation methods from those used in AQUA. For that purpose, the experimental design in this study can be adapted.