ppxscal/embedding_network huggingface dataset:
Fractal analysis of the structure and dynamics of a satellite-detected urban heat island
Authors: Y. Chen, D. Z. Sui, T. Fung, W. Dou
Venue: International Journal of Remote Sensing (2007)

In this Letter, three fractal models-surface, profile and pixel models are developed to analyse the structure and dynamics of an urban heat island (UHI). These three models were tested using data from Shanghai taken in 1990, 1995 and 1998. The surface model is capable of capturing the fractal dimension of the entire study area. The profile model can be used to analyse the structural characteristics of the UHI along certain directions and is capable of revealing changes in the texture characteristics of UHI. The pixel model can describe the changes in thermal characteristics surrounding each pixel in a particular locale and is suitable for analysing the micro-structure of the UHI.
Electrical and interface state density properties of the 4H-nSiC/[6,6]-phenyl C61-butyric acid methyl ester/Au diode
Authors: M. E. Aydin, Fahrettin Yakuphanoglu
Venue: Microelectronic Engineering (2008)

The electrical and interface state density properties of the Ni/4H-nSiC/PCBM/Au diode have been investigated by current-voltage, capacitance-voltage and conductance-frequency methods. The ideality factor, barrier height and series resistance values of the diode were found to be 2.28, 1.10eV and 3.76x10^4@W, respectively. The diode shows a non-ideal I-V behaviour with an ideality factor greater than unity that could be ascribed to the interfacial layer, interface states and series resistance. The obtained barrier height (1.10eV) of the Ni/4H-nSiC/PCBM/Au diode is lower than that of Ni/4H-nSiC diode (1.32eV). This indicates that the PCBM organic layer induces a change of 160meV in the barrier height of the Ni/4H-nSiC diode. The interface state density of the diode was determined from G"p/@w-f plots and was of order of 5.61x10^1^2eV^-^1cm^-^2.
The iterative design of a project charter for interdisciplinary research
Authors: Stan Ruecker, Milena Radzikowska
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

This paper describes our experience with the iterative development and use of a project charter for helping to manage expectations of the various members of interdisciplinary research teams. Some of our team members may be working with other researchers for the first time, and many of them have not worked previously with researchers from other disciplines. The charter is based on the need to explicitly discuss principles and policies of research practice with people from different disciplines at the start of the project, and to have a common agreement to refer to if necessary during the project. Our current template contains the following principles: &bull; We are interested in disseminating the results of this project as widely as possible, with credit to us for doing it. &bull; We intend this work to move forward at a steady pace, given due awareness of the vagaries of life. &bull; We would prefer for this work to be funded. &bull; We understand that the work we do on this project may have future phases. Modifications and additions may be made to further the project by other members. &bull; We wish to communicate in such a way as to preserve professional dignity. &bull; We would like to foster goodwill among all the participants. Although these seem on the surface like motherhood statements that would go without saying, in practical terms these principles, and the longer list of policies that emerge from them, is actually the basis of fundamental misunderstandings between disciplines.
A lower bound for the monotone depth of connectivity
Authors: A. C. -C. Yao
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We show that any monotone circuit for computing graph connectivity must have a depth greater than /spl Omega/((log n)/sup 3/2// log log n). This proves that UCONN/sub n/ is not in monotone NC/sup 1/. The proof technique, which is an adaptation of Razborov's approximation method, is also used to derive lower bounds for a general class of graph problems.
Adaptive Data Integrity through Dynamically Redundant Data Structures
Authors: Vincenzo De Florio, Chris Blondia
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

This paper introduces a tool that allows designers to make use of adaptively redundant data structures with commodity programming languages such as C or Java. Designers using such tool can define redundant data structures in which the degree of redundancy is not fixed once and for all at design time, but rather it changes dynamically with respect to the disturbances experienced during the run time. Our approach attunes the degree of redundancy required to ensure data integrity to the actual faults being experienced by the system and provides an example of adaptive fault-tolerant software. We prove the effectiveness of our tool by showing that adaptive replication reaches the same effectiveness of static replication but consuming much less resources and computing time.
Novel Window Functions for Digital Filters
Authors: Arulalan M. Rajan, H. S. Jamadagni, Ashok Rao
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Window technique is one of the simplest methods to design Finite Impulse Response (FIR) filters. It uses special functions to truncate an infinite sequence to a finite one. In this paper, we propose window techniques based on integer sequences. The striking feature of the proposed work is that it overcomes all the problems posed by floating point numbers and inaccuracy, as the sequences are made of only integers. Some of these integer window sequences, yield sharp transition, while some of them result in zero ripple in passband and stopband.
Detecting and Tracing DDoS Attacks by Intelligent Decision Prototype
Authors: Ashley Chonka, Wanlei Zhou, Jaipal Singh, Yang Xiang
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Over the last couple of months a large number of Distributed Denial of Service (DDoS) attacks have occurred across the world, especially targeting those who provide web services. IP traceback, a counter measure against DDoS, is the ability to trace IP packets back to the true source/s of the attack. In this paper, an IP traceback scheme using a machine learning technique called Intelligent Decision Prototype (IDP), is proposed. IDP can be used on both Probabilistic Packet Marking (PPM) and Deterministic Packet Marking (DPM) traceback schemes to identify DDoS attacks. This will greatly reduce the packets that are marked and in effect make the system more efficient and effective at tracing the source of an attack compared with other methods. IDP can be applied to many security systems such as Data Mining, Forensic Analysis, Intrusion Detection Systems (IDS) and DDoS defense systems.
Case-based reasoning for procedure learning by instruction
Authors: Jim Blythe, Thomas Russ
Venue: Proceedings of the 13th international conference on Intelligent user interfaces (2008)

To control intelligent tools that perform a variety of complex procedures, users need to be able to both modify existing procedure descriptions and communicate new procedures. In one approach, the user describes fragments of a procedure with text, and the tool searches the space of potential procedures for a match. This approach sometimes provides too little guidance for users, yet providing templates for guidance can require an expensive knowledge engineering effort in each new domain. We investigate the use of case-based reasoning to help guide the user, treating previously-defined procedures in the domain as cases. We describe domainindependent methods to find similar procedures while the user creates or modifies a procedure, to suggest potential steps to copy and to manage mapping the variables from the existing procedure into the procedure being edited. In some cases, the mapping tool suggests auxiliary steps to copy along with the desired steps, following an approach similar to derivational analogy. We evaluate the potential of this approach with an implemented tool, CB-Tailor, in a travel domain containing a number of procedures that may be added by the user. Our experiences suggest that the tool can provide useful guidance in a realistic set of situations.
Shoot & copy: phonecam-based information transfer from public displays onto mobile phones
Authors: Sebastian Boring, Manuela Altendorfer, Gregor Broll, Otmar Hilliges, Andreas Butz
Venue: Proceedings of the 4th international conference on mobile technology, applications, and systems and the 1st international symposium on Computer human interaction in mobile technology (2007)

Large public displays have become pervasive in our everyday lives, but up to now, they are mostly information screens without any interaction possibilities. Users tend to forget what they saw relatively fast after leaving such a display. In this paper, we present a new interaction technique for transferring information from a public display onto a personal mobile phone with its built-in camera. Instead of having to rely on their memory, users simply take a picture of the information of interest. Instead of just storing the image, our system then retrieves the actual data represented on the screen, such as a stock quote, news text, or piece of music. The Shoot & Copy technique does not require visual codes that interfere with shown content or reduce screen real estate. Our prototype allows users to capture an arbitrary region of a standard desktop screen, containing icons, which represent pieces of data. The captured image is then analyzed and a reference to the corresponding data is sent back to the mobile phone. Once the user has time to view the information in more detail, our system allows retrieving the actual data from this reference. We present our prototype and the methods it uses for image processing, as well as an evaluation of our interaction technique illustrating its potential use and applications.
Laser copper plasma X-ray source debris characterization
Authors: Dryver Huston, Brent Boerger, Robert Selzer, David Hurley, Shan Garcia, Brian Grenon
Venue: Microelectronic Engineering (2008)

Laser copper plasma sources are a compact, economical means of producing high intensity X-rays at the correct wavelengths for X-ray lithography. Copper debris in the form of vapor, ions, dust, and high speed particles is an unwanted byproduct of the laser copper plasma technique. Improved methods for debris mitigation are essential for production X-ray lithography using laser copper plasma sources. The main objective of this project is to characterize the debris, particularly the size, amount, and velocity spectrum of high speed particles. The measurements used a source-laser-pulse-synchronized high speed spinning disc. An optical scanning boom microscope analyzed debris collected on a target. Kinematic triangulation using the location of the debris indicates the velocity of debris particles. Velocities of copper debris particles were found to be in the hundreds of meters per second, roughly one order of magnitude slower than previously believed. The precision of results was limited by a mismatched sampling rate for particle collection. This discovery opens up the possibility of a host of mechanical debris blocking countermeasures previously thought to be too slow to effectively stop high speed debris particles. This study also suggests that X-rays emitted at high laser pulse rates could be blocked by debris generated during the previous laser pulse. An area requiring further refinement and study is in the mechanics of plasma generation. The target location and laser spot size and focal point are critical factors in the process and have a low tolerance for variation.
Optimization of pattern matching circuits for regular expression on FPGA
Authors: Cheng-Hung Lin, Chih-Tsun Huang, Chang-Ping Jiang, Shih-Chieh Chang
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

Regular expressions are widely used in the network intrusion detection system (NIDS) to represent attack patterns. Previously, many hardware architectures have been proposed to accelerate regular expression matching using field-programmable gate array (FPGA) because FPGAs allow updating of new attack patterns. Because of the increasing number of attacks, we need to accommodate a large number of regular expressions on FPGAs. Although the minimization of logic equations has been studied intensively in the area of computer-aided design (CAD), the minimization of multiple regular expressions has been largely neglected. This paper presents a novel sharing architecture allowing our algorithm to extract and share common subregular expressions. Experimental results show that our sharing scheme significantly reduces the area of pattern matching circuits for regular expression.
Additive Schwarz preconditioners for the h-p version boundary-element approximation to the hypersingular operator in three dimensions
Authors: Thanh Tran
Venue: International Journal of Computer Mathematics (2007)

We study different preconditioners for the h-p version of the Galerkin boundary-element method when used to solve hypersingular integral equations of the first kind on a surface in 3. These integral equations result from Neumann problems for the Laplace and Lamé equations in the exterior of the surface. The preconditioners are of additive Schwarz type (non-overlapping and overlapping). In all cases, we prove that the condition numbers grow at most logarithmically with the degrees of freedom.
Extended Prefix Hash Trees for a distributed phone book application
Authors: Fabian Staber, Gerald Kunzmann, Jorg P. Muller
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

IP telephony has become one of the most successful applications of the peer-to-peer paradigm. However, providing a scalable peer-to-peer-based distributed telephone directory for searching user entries is still an unsolved challenge. In this paper we present the Extended Prefix Hash Tree algorithm that can be used to implement an indexing infrastructure supporting range queries on top of Distributed Hash Tables. The algorithm supports hierarchical keywords, and is especially designed for situations where a few keywords are very common while others are very uncommon. The design of our algorithm perfectly matches the requirements found in a distributed phone book scenario. We point out the difficulties that previous algorithms had with data that is distributed that way, and evaluate the performance of Extended Prefix Hash Trees with a real-world phone book. The results can be transferred to other scenarios where support for range queries is needed in combination with the decentralization, self-organization, and resilience of an underlying peer-to-peer infrastructure.
Brief paper: Stability properties of reset systems
Authors: Dragan Nešić, Luca Zaccarian, Andrew R. Teel
Venue: Automatica (Journal of IFAC) (2008)

Stability properties for a class of reset systems, such as systems containing a Clegg integrator, are investigated. We present Lyapunov based results for verifying L"2 and exponential stability of reset systems. Our results generalize the available results in the literature and can be easily modified to cover L"p stability for arbitrary p@?[1,~]. Several examples illustrate that introducing resets in a linear system may reduce the L"2 gain if the reset controller parameters are carefully tuned.
Efficient modeling of transmission lines with electromagnetic wave coupling by using the finite difference quadrature method
Authors: Qinwei Xu, Pinaki Mazumder
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2007)

This paper proposes an efficient numerical technique, called the finite difference quadrature (FDQ) method, to model the transmission line with radiated electromagnetic (EM) wave noise coupling. A discrete modeling approach, the FDQ method adapts coarse grid points along the transmission line to compute the finite difference between adjacent grid points. A global approximation scheme is formulated in the form of a weighted sum of quantities beyond the local grid points. Unlike the Gaussian quadrature method that computes numerical integrals by using global approximation framework, the FDQ method uses a global quadrature method to construct the approximation schemes for the computation of, however, numerical finite differences. As a global approximation technique, the FDQ method has superior numerical dispersion to the finite difference (FD) method, and, therefore, needs much sparser grid points than the FD method to achieve comparable accuracy. Equivalent voltage and current sources are derived, exciting the transmission line at the grid points. Equivalent circuit models are consequently derived to represent the transmission line subject to radiated electromagnetic wave noise. The FDQ-based equivalent models can be integrated into a simulator like SPICE.
Introducing the Theory of Computation, 1 edition
Authors: Wayne Goddard
Venue:  (2008)

Introducing the Theory of Computation is the ideal text for any undergraduate, introductory course on formal languages, automata, and computability. The author provides a concise, yet complete introduction to the important models of finite automata, grammars, and Turing machines, as well as undecidability and the basics of complexity theory. Numerous problems and programming exercises, varying in level of difficulty, round out each chapter and allow students to test themselves on key topics. Answers to selected exercises are included as an appendix and a complete instructor s solutions manual is available on the text s web site.
On representations by low-degree polynomials
Authors: R. Smolensky
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

In the first part of the paper we show that a subset S of a boolean cube B/sub n/ embedded in the projective space P/sup n/ can be approximated by a subset of B/sub n/ defined by nonzeroes of a low-degree polynomial only if the values of the Hilbert function of S are sufficiently small relative to the size of S. The use of this property provides a simple and direct technique for proving lower bounds on the size of ACC[p/sup r/] circuits. In the second part we look at the problem of computing many-output function by ACC[p/sup r/] circuit and give an example when such a circuit can be correct only at exponentially small fraction of assignments.
Sufficient Conditions for Secrecy under Any Equational Theories
Authors: Hanane Houmani, Mohamed Mejri
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

This paper gives sufficient conditions that guarantee the secrecy property for cryptographic protocols. Intuitively, these conditions state that agents should not decrease the security level of components when they send them in the network. Moreover, the verification of this condition can be performed using the standard description of cryptographic protocols and the verification process can be made automatic.
Micropipeline-Based Asynchronous Design Methodology for Robust System Design Using Nanoscale Crossbar
Authors: Rajat Subhra Chakraborty, Swarup Bhunia
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

System design with nanoscale molecular devices will require developing new circuit and architectural techniques to exploit highly dense and regular structures such as nano-crossbar. It also requires addressing some inherent limitations with these devices, such as large process variations, high defect rates, lack of voltage gain (preventing logic cascading), and large overhead of interfacing logic. We propose an asynchronous design paradigm for nanoscale crossbar that combines them with CMOS-based event driven bistable elements to implement micropipeline structures. An automated design platform for synthesizing these systems is also presented. The proposed asynchronous design approach addresses three main issues with nanoscale crossbar: 1) parameter variations, 2) logic cascading, and 3) large overhead of interfacing logic. Simulation results show considerable improvement in robustness under variations as well as in total area (up to 1.8X), delay (up to 2X) and power (up to 3.2X) compared to equivalent sequential implementation.
A probabilistic reasoning framework for smart homes
Authors: Todor Dimitrov, Josef Pauli, Edwin Naroska
Venue: Proceedings of the 5th international workshop on Middleware for pervasive and ad-hoc computing: held at the ACM/IFIP/USENIX 8th International Middleware Conference (2007)

Inference and reasoning in modern AmI (Ambient Intelligence) middlewares is still a complex task. Currently no common patterns for building smart applications can be identified. This paper presents an ongoing effort to build a generic probabilistic reasoning framework for the networked homes. The framework can be utilized for designing smart agents in a systematic and unified way. The developed modeling and reasoning algorithms make an extensive use of the information about the user and the way he/she interacts with the system. To achieve this, several levels of knowledge representation are combined. Each level enriches the domain knowledge in a way that a consistent, user-adaptable probabilistic knowledge base is constructed. The facts in the knowledge base can be used to encode the logic for a specific application scenario.
Predictive model of insolvency risk for Australian corporations
Authors: Rohan A. Baxter, Mark Gawler, Russell Ang
Venue: Proceedings of the sixth Australasian conference on Data mining and analytics - Volume 70 (2007)

This paper describes the development of a predictive model for corporate insolvency risk in Australia. The model building methodology is empirical with out-of-sample future year test sets. The regression method used is logistic regression after pre-processing by quantisation of interval (or numeric) attributes. We show that logistic regression matches the performance of ensemble methods, such as random forests and ada boost, provided that pre-processing and variable selection is performed. A distinctive feature of the insolvency risk model described in this paper is its breadth; since we are using income tax return data we are able to risk score one million companies across all industries, all corporation types (public, private) and all sizes, as measured either by assets or number of employees. This is an application paper that uses standard credit scoring methodology on a new data source. The contribution is to demonstrate that insolvency risk can be estimated using income tax return data. The corporate insolvency prediction model is still in development and so we welcome suggestions for improvements on the current methodology.
A Statistic-Based Approach to Testability Analysis
Authors: Chuang-Chi Chiou, Chun-Yao Wang, Yung-Chih Chen
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

This paper presents a statistic-based approach for evaluating the testability of nodes in combinational circuits. This testability measurement is obtained via Monte Carlo simulation governed by the formulated Monte Carlo model. The Monte Carlo simulation is terminated when the predefined error with respect to the Monte Carlo model, under a specified confidence level, is achieved. We conduct the experiments on a set of ISCAS’85 and MCNC benchmarks. As compared with previous work, our approach more efficiently evaluates the testability with less error rate.