ppxscal/embedding_network huggingface dataset:
Privacy in video surveilled spaces
Authors: Torsten Spindler, Christoph Wartmann, Ludger Hovestadt, Daniel Roth, Luc Van Gool, Andreas Steffen
Venue: Journal of Computer Security (2008)

We present a system prototype for self-determination and privacy enhancement in video surveilled areas by integrating computer vision and cryptographic techniques into networked building automation systems. This paper describes a system prototype and research work that has been conducted by an interdisciplinary team of researchers. People appearing in a video stream control their visibility on a per-viewer basis and can choose to allow either the real view or an obscured image to be seen. The parts of the video stream containing a person's image are protected by an AES cipher and can be sent over untrusted networks. This paper presents experimental results with the example of a meeting room scenario. We conclude with remarks on the system's usability and on the problems encountered.
Polymers below the critical molecular weight for thermal imprint lithography
Authors: Nicolas Bogdanski, Matthias Wissen, Saskia Möllenbeck, Hella-Christin Scheer
Venue: Microelectronic Engineering (2008)

Under mechanical load, the reaction of polymers with a low molecular weight features small time constants. To test their actual behaviour in a thermal imprint, two polystyrenes (PS 10kg/mol, PS 30kg/mol) were imprinted under partial cavity filling conditions. The imprints were inspected regarding recovery and physical self-assembly of the polymer by means of an optical microscope. The results show that such low molecular weight polymers obviously are not suited for thermal imprint. In contrast to polymers with higher molecular weight, physical self-assembly and recovery occur at an identical imprint temperature, so that processing conditions for defect-free imprint cannot be identified. In case of a polymer with higher molecular weight this is possible by adequate choice of the processing temperature.
New blind equalization techniques based on improved square contour algorithm
Authors: Shahzad Amin Sheikh, Pingzhi Fan
Venue: Digital Signal Processing (2008)

New blind equalization techniques for QAM signaling are presented in this paper. These schemes are based on the improved square contour algorithm (ISCA) which employs the estimated outputs from the decision device in the cost function guiding equalizer outputs to reside on multiple zero error square moduli. This mechanism reduces the misadjustment between transmitted constellation and the new cost function in an efficient manner, which leads to a noteworthy increase in convergence speed and inter symbol interference (ISI) suppression. For further diminution of misadjustment, some modifications have been suggested in ISCA cost function by presenting a new scheme named as constellation matched square contour algorithm (CM-SCA), which makes the multiple zero error square moduli of the ISCA collinear with the source constellation contours. To achieve better performance in severe channel conditions or equalizing higher order QAM signals, a fusion of SCA and CM-SCA, named as modified constellation matched square contour algorithm (MCM-SCA) is proposed. The convergence characteristics of the proposed schemes demonstrated by the simulation results for 16- and 64-QAM signal constellations reveal the effectiveness of new blind equalizers over the existing square contour algorithm (SCA) and recently proposed modified square contour algorithm (MSCA).
Model-driven refinement of software architectures with π-ARL
Authors: Flavio Oquendo
Venue: Proceedings of the 4th WSEAS International Conference on Applied Mathematics and Computer Science (2005)

In model-driven development, architecture descriptions and their refinements are explicitly represented and manipulated as models. π-ADL and π-ARL are formal (executable) architecture description and refinement languages providing architecture-centric modelling constructs. When applied, refinement actions expressed in π-ARL refine architecture description models described in π-ADL outputting new refined models described in π-ADL. Enabling model-driven refinement of software architectures is a new challenge for the model-driven development of complex software systems. This paper gives an overview of π-ARL and illustrates the expressiveness and usefulness of model-driven refinement with π-ARL through a case study.
Sensing with One or with Four? A Comparison of Two IEEE 802.15.x Protocols for Use in Sensor Networks
Authors: Vojislav B. Misic, Jelena Misic
Venue: International Journal of Distributed Sensor Networks (2007)

In this paper we compare the pertinent features of the two emerging technologies for wireless sensor networks: IEEE Standards 802.15.1 and 802.15.4. We review the main features of the MAC protocols defined by those standards, describe their operation, and compare them in terms of characteristics such as performance (access and end-to-end packet delays), bandwidth utilization, and scalability for the deployment of large networks. Our findings indicate that there is no clear winner in all categories; the best protocol (and the underlying technology) to use, are heavily dependent upon the requirements for a particular sensing application. While the main focus of our analysis is the MAC layer, certain important parameters of the Physical (PHY) layer are considered as well, together with some other networking aspects. The results of this analysis should be of interest to the designer and operators of wireless sensor networks.
Parameterized complexity of the clique partition problem
Authors: Egbert Mujuni, Frances Rosamond
Venue: Proceedings of the fourteenth symposium on Computing: the Australasian theory - Volume 77 (2008)

The problem of deciding whether the edge-set of a given graph can be partitioned into at most k cliques is well known to be NP-complete. In this paper we investigate this problem from the point of view of parameterized complexity. We show that this problem is fixed parameter tractable if we choose the number of cliques as parameter. In particular, we show that in polynomial time, a kernel bounded by k2 can be obtained, where k is the number of cliques. We also give an O(2((k+3) log k)/2n) algorithm for this problem in K4-free graphs.
A network view of capital market integration and disintegration: an example by VAR model
Authors: Hsiao-Tang Hsu
Venue: Proceedings of the 5th WSEAS International Conference on Applied Mathematics (2004)

Traditional empirical work on market integration based on looking at two countries at a time. This paper uses interaction between members (spillover effect) to examine the market integration and disintegration. Asian Currency Crisis in 1997 was said to happen because high market integration made crisis in one country contagious (through spillover effect) to other countries and caused the disaster. This paper chooses 7 Asian countries -Hong Kong, Singapore, Taiwan, Malaysia, Korea, Thailand and Indonesia -to study the integration and disintegration through interest rate spillover effect (lead-lad relationship) among them. This paper examines how the spillover effect worked before the crisis and how this relationship changed after the crisis. VAR (Vector Autoregressive) model is used to analyze the multivariate spillover effects. This paper examines capital market integration periods before and after crisis separately. We found that before Asian currency crisis, the market integration is strong. After Asian currency crisis, regional integration decreased and the spillover effects among the members in this region changed. The only exception is that Taiwan had the same spillover effect as before.
An Effective Data Classification Algorithm Based on the Decision Table Grid
Authors: Hongjie Liu, Boqin Feng, Jianjie Wei
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

In order to overcome the disadvantages that the traditional k-Nearest Neighbor classification technique makes inadquate use of distribution characteristics of homegeneous data, and that it is of slow speed and low efficiency, an effective data classification algorithm based on the decision table grid is presented. The main process is to construct the corresponding decision table after discretizing training samples, to map the training samples to the corresponding grid based on the decision condition, and to map the samples to be classified to the corresponding grid, then to judge the classification of the samples by the given principle. The algorithm can quickly classify the samples to be classified and can improve the precision as well. Experiments show that it has good effect, being more suitable for high dimension data classification and capable of dealing with the training samples with many classes.
Rubik's cube reconstruction from single view for Service robots
Authors: Włodzimierz Kasprzak, Wojciech Szynkiewicz, Łukasz Czajka
Venue: Machine Graphics Vision International Journal (2006)

The Rubik's cube puzzle is seen as a benchmark for service robots. In such an application, a computer vision subsystem is required to locate the object in space and to determine the configuration of its colored cells. This paper presents a robust algorithm for Rubik's cube reconstruction from a single view in real time. An issue of special interest is to obtain a good tade-off between the quality of results, and the computational complexity of the algorithm.
Security Through Deception
Authors: Stilianos Vidalis, Zafar Kazmi
Venue: Information Systems Security (2007)

For each layer of information security there is a number of techniques and tools that can be used to ensure information superiority. Indeed some experts would argue that you cannot have the former without the latter. In today's technological & interconnected world, however, information superiority is very hard to achieve and almost impossible to maintain. This paper will argue that the art of deception is a reliable and cost effective technique that can assure the security of an infrastructure. The paper will conclude by presenting a technical solution of the above statement.
Model and Simulation for Three-dimensional Medical Image Reconstruction of Spiral CT
Authors: Feng-rong Sun, Yan-ling Li, Ze Liu, Xiao-hong Qin, Jun-qing Geng, Yan-ping Zhang, Gui-hua Yao, Yun Zhang
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

2D Shepp-Logan head model is the classical model of simulations in 2D medical image reconstruction of computerized tomography (CT). A method, considering 3D Shepp-Logan head model as the reference model of simulations in 3D medical image reconstruction of spiral CT, is proposed in the paper. Designing of 3D Shepp-Logan head model as well as computing of the projection data is introduced, and then the simulation for 3D medical image reconstruction of spiral CT based on 3D Shepp-Logan head model is presented. The experimental results indicate the accuracy of the model computing, and the feasibility and validity of the method.
Design of a low-power, high performance, 8×8bit multiplier using a Shannon-based adder cell
Authors: C. Senthilpari, Ajay Kumar Singh, K. Diwakar
Venue: Microelectronics Journal (2008)

In this paper, we have developed a new full-adder cell using multiplexing control input techniques (MCIT) for the sum operation and the Shannon-based technique to implement the carry. The proposed adder cell is applied to the design of several 8-bit array multipliers, namely a Braun array multiplier, a CSA multiplier, and Baugh-Wooley multipliers. The multiplier circuits are designed using DSCH2 VLSI CAD tools and their layouts are generated by Microwind 3 VLSI CAD tools. The output parameters such as propagation delay, total chip area, and power dissipation are calculated from the simulated results. We have also calculated energy per instruction (EPI), throughput, latency, signal-to-noise ratio (SNR), and the effect of temperature on the drain current by using the generated layout output parameter of a BSIM 4 advanced analyzer. The simulated results of the proposed adder-based multiplier circuit are compared with a cell multiplier that utilizes a MCIT-based adder, a cell multiplier composed of complementary pass transistor logic-based (CPL) adders and those of other published multipliers circuits. From the analysis of these simulated results, it was found that the proposed multiplier circuit gives better performance in terms of power, propagation delay, latency and throughput than other published results.
Comparison of different methods for simulating the effect of specular ion reflection on microtrenching during dry etching of polysilicon
Authors: D. Kunder, E. Bär
Venue: Microelectronic Engineering (2008)

For the simulation of etching processes, a key step is the calculation of the etch rates depending on the specific model and depending on the specific geometry of the feature. In this work, we demonstrate the calculation of etch rates using a Monte Carlo, a flux balancing, and an analytical approach. For a relatively simple model for etching of polysilicon in chlorine-based chemistry, the three approaches are compared and microtrenching is studied which results from the specular reflection of ions and depends on different parameters. The results for the different approaches are in good agreement for the cases studied.
The economics of mobile payments: Understanding stakeholder issues for an emerging financial technology application
Authors: Yoris A. Au, Robert J. Kauffman
Venue: Electronic Commerce Research and Applications (2008)

Economic theory provides a unique vantage point from which to examine issues with respect to emerging technologies, where standards and adoption, business process changes and implementation outcomes, information security, investments and business value, and industry impact require care and consideration on the part of senior management strategists and financial services leaders. In this article, we examine a new technology application which is coming into its own around the world, in association with the revolution in wireless connectivity: mobile payments. Although there are likely to be nuances and surprises with this technology application, we caution the reader to recognize that many of the same economic forces will be at work as were with other financial services and related technology applications in the past. We apply a robust evaluative framework that permits identification of the relevant stakeholders and applicable theory in the analysis of consumer, firm, business process, market, industrial and social issues. Our findings are intended to guide senior managers in dealing with the economic aspects of mobile payments, and to help identify some important directions for the research.
A relational model for XML structural joins and their size estimations
Authors: Cheng Luo, Zhewei Jiang, Wen-Chi Hou, Feng Yan, Qiang Zhu
Venue: Knowledge and Information Systems (2008)

XML structural joins, which evaluate the containment (ancestor-descendant) relationships between XML elements, are important operations of XML query processing. Estimating structural join size accurately and quickly is crucial to the success of XML query plan selection and the query optimization. XML structural joins are essentially complex &#x03b8;-joins, which render well-known estimation techniques for relational equijoins, such as discrete cosine transform, wavelet transform, and sketch, not applicable. In this paper, we model structural joins from a relational point of view and convert the complex &#x03b8;-joins to equijoins so that those well-known estimation techniques become applicable to structural join size estimation. Theoretical analyses and extensive experiments have been performed on these estimation methods. It is shown that discrete cosine transform requires the least memory and yields the best estimates among the three techniques. Compared with state-of-the-art method IM-DA-Est, discrete cosine transform is much faster, requires less memory, and yields comparable estimates.
Heads Up and Camera Down: A Vision-Based Tracking Modality for Mobile Mixed Reality
Authors: Stephen DiVerdi, Tobias Höllerer
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

Anywhere Augmentation pursues the goal of lowering the initial investment of time and money necessary to participate in mixed reality work, bridging the gap between researchers in the field and regular computer users. Our paper contributes to this goal by introducing the GroundCam, a cheap tracking modality with no significant setup necessary. By itself, the GroundCam provides high frequency, high resolution relative position information similar to an inertial navigation system, but with significantly less drift. We present the design and implementation of the GroundCam, analyze the impact of several design and run-time factors on tracking accuracy, and consider the implications of extending our GroundCam to different hardware configurations. Motivated by the performance analysis, we developed a hybrid tracker that couples the GroundCam with a wide area tracking modality via a complementary Kalman filter, resulting in a powerful base for indoor and outdoor mobile mixed reality work. To conclude, the performance of the hybrid tracker and its utility within mixed reality applications is discussed.
Tiny Web Services for Sensor Device Interoperability
Authors: Bodhi Priyantha, Aman Kansal, Michel Goraczko, Feng Zhao
Venue: Proceedings of the 7th international conference on Information processing in sensor networks (2008)

There are many scenarios where interoperability is required for sensor devices. We demonstrate one approach to achieve interoperability: using web services. Hosting a web service challenges the battery-life, bandwidth, and processing power constraints of low power sensor nodes. We demonstrate a lightweight implementation on MSP430 based sensor nodes with 802.15.4 radios. The implementation allows standards compliant web service clients to use the sensors but minimizes code size and energy at the sensor nodes. It allows sensor nodes to enter sleep modes. We prototype an example application for a home sensor network along with two types of sensor nodes required for it. We also show how our system enables sensor nodes to be used easily from applications written in high level languages using existing development tools.
From laser point clouds to surfaces: Statistical nonparametric methods for three-dimensional reconstruction
Authors: J. Roca-Pardiñas, H. Lorenzo, P. Arias, J. Armesto
Venue: Computer-Aided Design (2008)

This paper presents a new method for the reconstruction of three-dimensional objects surveyed with a terrestrial laser scanner. The method is a 2.5D surface modelling technique which is based on the application of statistical nonparametric regression methods for point cloud regularization and mesh smoothing, specifically the kernel-smoothing techniques. The proposed algorithm was tested in a theoretical model-simulations being carried out with the aim of evaluating the ability of the method to filter random noise and oscillations related to the acquisition of data during the fieldwork-and the results were satisfactory. The method was then applied, as a reverse engineering tool, to real-world data in the field of naval construction. A precise solution to the problem of obtaining realistic surfaces and sections of large industrial objects from laser 3D point clouds is provided, which has proved to be efficient in terms of computational time.
A more precise rounding algorithm for rational numbers
Authors: M. Thill
Venue: Computing (2008)

We adjoin a more precise companion to the classical mediant rounding algorithm for rational numbers.
Spike-timing-dependent plasticity in small-world networks
Authors: Karsten Kube, Andreas Herzog, Bernd Michaelis, Ana D. de Lima, Thomas Voigt
Venue: Neurocomputing (2008)

Biologically plausible excitatory neural networks develop a persistent synchronized pattern of activity depending on spontaneous activity and synaptic refractoriness (short term depression). By fixed synaptic weights synchronous bursts of oscillatory activity are stable and involve the whole network. In our modeling study we investigate the effect of a dynamic Hebbian-like learning mechanism, spike-timing-dependent plasticity (STDP), on the changes of synaptic weights depending on synchronous activity and network connection strategies (small-world topology). We show that STDP modifies the weights of synaptic connections in such a way that synchronization of neuronal activity is considerably weakened. Networks with a higher proportion of long connections can sustain a higher level of synchronization in spite of STDP influence. The resulting distribution of the synaptic weights in single neurons depends both on the global statistics of firing dynamics and on the number of incoming and outgoing connections.
End-to-end performance management for scalable distributed storage
Authors: David O. Bigelow, Suresh Iyer, Tim Kaldewey, Roberto C. Pineiro, Anna Povzner, Scott A. Brandt, Richard A. Golding, Theodore M. Wong, Carlos Maltzahn
Venue: Proceedings of the 2nd international workshop on Petascale data storage: held in conjunction with Supercomputing '07 (2007)

Many applications---for example, scientific simulation, real-time data acquisition, and distributed reservation systems---have I/O performance requirements, yet most large, distributed storage systems lack the ability to guarantee I/O performance. We are working on end-to-end performance management in scalable, distributed storage systems. The kinds of storage systems we are targeting include large high-performance computing (HPC) clusters, which require both large data volumes and high I/O rates, as well as large-scale general-purpose storage systems.
A Trusted Data Storage Infrastructure for Grid-Based Medical Applications
Authors: Guido J. van 't Noordende, Silvia D. Olabarriaga, Matthijs R. Koot, Cees Th. A. M. de Laat
Venue: Proceedings of the 2008 Eighth IEEE International Symposium on Cluster Computing and the Grid (2008)

Most existing Grid technology has been foremost designed with performance and scalability in mind. When using Grid infrastructure for medical applications, privacy and security considerations become paramount. This leads to are-thinking of implementation and deployment aspects of common components of the current Grid architecture. This paper describes the impact of privacy and security considerations on the Grid infrastructure design,and enumerates trust aspects which must underpin the design of Grid technology to support medical applications.We propose a novel security framework for securely handling privacy sensitive information on the Grid.
Pedagogical Enrichment Of Information Objects
Authors: Susanne Heyer
Venue: Journal of Integrated Design Process Science (2006)

This paper presents a distinction between content parts (information objects) and educational parts of learning objects. A plea is made for the separation of content and educational context references to maintain the content's high potential for reusability. Since content alone does not constitute a didactical situation, however, after its separation content needs to be enriched with educational elements such as learning objectives and learning activities. This paper proposes ways of rejoining content with educational elements in a repository using an educational objectives taxonomy. The taxonomy could be further implemented to collect data on the different pedagogical purposes an information object was used for. Pedagogical repurposing, however, is not just understood as a reuse within different subject matter but also as a reuse for different pedagogical goals, such as the promotion of higher cognitive processes in learning.