ppxscal/embedding_network huggingface dataset:
The Economics of Privacy-Privacy: People, Policy and Technology
Authors: Justin Zhan, Vaidyanathan Rajamani
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Privacy of personal information is an area of growing concern and importance in the digital age. Privacy as an issue rises when there is a conflict of interest between its commercial value and respect for an individual’s right to privacy. This lends itself to the fact this trade off is of economic value and the issue of privacy is an economic problem and hence justifies the emergence of the economics of privacy as an important discipline which is a complex interplay of regulation, technology and people dynamics and the efficiency of doing business. In this survey paper we look into the work done by eminent people on the issue of privacy and its relationship with people, technology and regulation from an economic perspective and its increasing relevance today. Privacy affects each one of us in some way that we cannot afford to ignore it and it helps to be in cognizance of what is going on around us.
Compilation of procedural models
Authors: Torsten Ullrich, Ulrich Krispel, Dieter W. Fellner
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

Scripting techniques are used in various contexts. The field of application ranges from layout description languages (PostScript), user interface description languages (XUL) and classical scripting languages (JavaScript) to action nodes in scene graphs (VRMLScript) and web-based desktop applications (AJAX). All these applications have an increase of scripted components in common -- especially in computer graphics. As the interpretation of a geometric script is computationally more intensive than the handling of static geometry, optimization techniques, such as just-in-time compilation, are of great interest. Unfortunately, scripting languages tend to support features such as higher order functions or self-modification, etc. These language characteristic are difficult to compile into machine/byte-code. Therefore, we present a hybrid approach: an interpreter with an integrated compiler. In this way we speed up the script evaluation without having to remove any language features e.g. the possibility of self-modifications. We demonstrate its usage at XGML -- a dialect of the generative modeling language GML, which is characterized by its dynamic behavior.
Localized sensor self-deployment with coverage guarantee
Authors: Xu Li, Hannes Frey, Nicola Santoro, Ivan Stojmenovic
Venue: ACM SIGMOBILE Mobile Computing and Communications Review (2008)

We pinpoint a new sensor self-deployment problem, achieving focused coverage around a Point of Interest (POI), and introduce an evaluation metric, coverage radius. We propose two purely localized solution protocols Greedy Advance (GA) and Greedy-Rotation-Greedy (GRG), both of which are resilient to node failures and work regardless of network partition. The two algorithms drive sensors to move along a locally-computed triangle tessellation (TT) to surround the POI. In GA, nodes greedily proceed as close to the POI as they can; in GRG, when their greedy advance is blocked, nodes rotate around the POI to a TT vertex where greedy advance can resume. They both yield a connected network of TT layout with hole-free coverage. Further, GRG ensures a hexagon coverage shape centered at the POI.
Short communication: A Lagrangian tool for modelling ichthyoplankton dynamics
Authors: Christophe Lett, Philippe Verley, Christian Mullon, Carolina Parada, Timothée Brochier, Pierrick Penven, Bruno Blanke
Venue: Environmental Modelling Software (2008)

Ichthyop is a free Java tool designed to study the effects of physical and biological factors on ichthyoplankton dynamics. It incorporates the most important processes involved in fish early life: spawning, movement, growth, mortality and recruitment. The tool uses as input time series of velocity, temperature and salinity fields archived from ROMS or MARS oceanic models. It runs with a user-friendly graphic interface and generates output files that can be post-processed easily using graphic and statistical software.
Solving a non-smooth eigenvalue problem using operator-splitting methods
Authors: K. Majava, R. Glowinski, T. Kärkkäinen
Venue: International Journal of Computer Mathematics (2007)

In this paper, we study the solution of a certain non-smooth eigenvalue problem, using operator-splitting methods to solve an equivalent, constrained minimization problem. We present the Marchuk-Yanenko and Peaceman-Rachford schemes for solving the problem and compare their performance numerically on some model problems. The Peaceman-Rachford scheme turns out to be superior to the Marchuk-Yanenko scheme in terms of accuracy and computational efficiency.
The W-CDMA scheme with parallel matched filter and its enhancement
Authors: Shigenori Tani, Cindy Bernadeth Tjitrosoewarno, Atsushi Fukasawa, Yumi Takizawa
Venue: Proceedings of the 4th WSEAS International Conference on Telecommunications and Informatics (2005)

Enhancement of the W-CDMA scheme is studied in this paper based on its characteristic evaluation of the scheme provided by the authors. The advantages of the W-CDMA are wide spreading and coherent demodulation with a pilot channel. The pilot level is optimized to give the maximum capacity of the system. New configuration of the W-CDMA is then investigated to increase transmission data rate and capacity of mobile communications. This structure, with parallel matched filter, has been proposed for synchronization and demodulation under severe multipath environments. The parallel matched filter is configured by an analog MOS device with the conventional digital circuits. The power consumption and dimension of the LSI are reduced effectively by the simultaneous approach to the system and circuit configuration.
Topological multi-contour decomposition for image analysis and image retrieval
Authors: Odemir Martinez Bruno, Luis Gustavo Nonato, Mario Augusto Pazoti, Joao Batista Neto
Venue: Pattern Recognition Letters (2008)

Successful classification, information retrieval and image analysis tools are intimately related with the quality of the features employed in the process. Pixel intensities, color, texture and shape are, generally, the basis from which most of the features are computed and used in such fields. This papers presents a novel shape-based feature extraction approach where an image is decomposed into multiple contours, and further characterized by Fourier descriptors. Unlike traditional approaches we make use of topological knowledge to generate well-defined closed contours, which are efficient signatures for image retrieval. The method has been evaluated in the CBIR context and image analysis. The results have shown that the multi-contour decomposition, as opposed to a single shape information, introduced a significant improvement in the discrimination power.
Fair stateless model checking
Authors: Madanlal Musuvathi, Shaz Qadeer
Venue: ACM SIGPLAN Notices (2008)

Stateless model checking is a useful state-space exploration technique for systematically testing complex real-world software. Existing stateless model checkers are limited to the verification of safety properties on terminating programs. However, realistic concurrent programs are nonterminating, a property that significantly reduces the efficacy of stateless model checking in testing them. Moreover, existing stateless model checkers are unable to verify that a nonterminating program satisfies the important liveness property of livelock-freedom, a property that requires the program to make continuous progress for any input. To address these shortcomings, this paper argues for incorporating a fair scheduler in stateless exploration. The key contribution of this paper is an explicit scheduler that is (strongly) fair and at the same time sufficiently nondeterministic to guarantee full coverage of safety properties.We have implemented the fair scheduler in the CHESS model checker. We show through theoretical arguments and empirical evaluation that our algorithm satisfies two important properties: 1) it visits all states of a finite-state program achieving state coverage at a faster rate than existing techniques, and 2) it finds all livelocks in a finite-state program. Before this work, nonterminating programs had to be manually modified in order to apply CHESS to them. The addition of fairness has allowed CHESS to be effectively applied to real-world nonterminating programs without any modification. For example, we have successfully booted the Singularity operating system under the control of CHESS.
Accelerating 3-D capacitance extraction in deep sub-micron VLSI design using vector/parallel computing
Authors: Nima Shahbazi, Hamid Sarbazi-Azad
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 02 (2007)

The widespread application of deep sub-micron and multilayer routing techniques makes the interconnection parasitic influence become the main factor to limit the performance of VLSI circuits. Therefore, fast and accurate 3D capacitance extraction is essential for ultra deep sub-micron design (UDSM) of integrated circuits. Parallel processing provides an approach to reducing the simulation turn-around time. In this paper, we present parallel formulations for 3D capacitance extraction based on P-FFT algorithm, on a personal computer (PC) or on a network of PCs. We implement both vector and parallel versions of 3D capacitance extraction algorithm simultaneously and evaluate our implementation quality in terms of speed up achieved.
A case for flash memory ssd in enterprise database applications
Authors: Sang-Won Lee, Bongki Moon, Chanik Park, Jae-Myung Kim, Sang-Woo Kim
Venue: Proceedings of the 2008 ACM SIGMOD international conference on Management of data (2008)

Due to its superiority such as low access latency, low energy consumption, light weight, and shock resistance, the success of flash memory as a storage alternative for mobile computing devices has been steadily expanded into personal computer and enterprise server markets with ever increasing capacity of its storage. However, since flash memory exhibits poor performance for small-to-moderate sized writes requested in a random order, existing database systems may not be able to take full advantage of flash memory without elaborate flash-aware data structures and algorithms. The objective of this work is to understand the applicability and potential impact that flash memory SSD (Solid State Drive) has for certain type of storage spaces of a database server where sequential writes and random reads are prevalent. We show empirically that up to more than an order of magnitude improvement can be achieved in transaction processing by replacing magnetic disk with flash memory SSD for transaction log, rollback segments, and temporary table spaces.
Selective etching of III-V nanowires for molecular junctions
Authors: Christian Kallesøe, Kristian Mølhave, Thomas Mårtensson, Torben Mikael Hansen, Lars Samuelson, Peter Bøggild
Venue: Microelectronic Engineering (2008)

Selective etching of heterostructure III-V nanowires can be used to form tips and narrow gaps simultaneously on multiple nanowires on a single wafer. In this study we tested bromine based etching of gallium arsenide segments in gallium phosphide nanowires. Depending on the etchant and etching conditions, a variety of gap topologies and tip-like structures were observed. The method is compatible with wafer-scale integration of molecular electronics within existing silicon technology, offering control of materials composition, morphology and electronic band gap of the electrodes that can be made so small they might be used as contact electrodes for individual molecules.
Eco-environmental evaluation with remote sensing in the middle and upper areas of the Yellow River drainage basin
Authors: X. Wang, Z. Ren, K. Tan
Venue: International Journal of Remote Sensing (2007)

Based on remote sensing data and investigations, this paper focuses mainly on a general evaluation of environmental quality in the middle-upper areas of the Yellow River region using GIS technology, Arc/Info, and ArcView. In this paper, the upper areas of the Yellow River regions are divided into three parts: the north-east Qinghai-Tibet Plateau ecosystem areas, the Erdos Plateau-Hetao Plain ecosystem areas, and the Loess-Plateau ecosystem areas. The study analyses the current environmental situation and the overall environmental quality in each ecosystem area and determines the law of distribution of environmental quality in the three areas. Finally, the paper provides some suggestions to improve the ecological environment in each area, in the hope of yielding a scientific foundation based on planning ecological environment protection in the Yellow River basin.
Comparison of presmoothing methods in kernel density estimation under censoring
Authors: M. A. Jácome, I. Gijbels, R. Cao
Venue: Computational Statistics (2008)

The behavior of the presmoothed density estimator is studied when different ways to estimate the conditional probability of uncensoring are used. The Nadaraya---Watson, local linear and local logistic approach are compared via simulations with the classical Kaplan---Meier estimator. While the local logistic presmoothing estimator presents the best performance, the relative benefits of the local linear versus the Nadaraya---Watson estimator depend very much on the shape of some underlying functions.
Algebraic computation trees in characteristic p>0
Authors: M. Ben-Or
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We provide a simple and powerful combinatorial method for proving lower bounds for algebraic computation trees over algebraically closed fields of characteristic p>0. We apply our method to prove, for example, an /spl Omega/(n log n) lower bound for the n element distinctness problem, an /spl Omega/(n log(n/k)) lower bound to the "k-equal problem"-that is deciding whether there are k identical elements out of n input elements, and more. The proof of the main theorem relies on the deep work of B.M. Dwork, P. Deligne, and E. Bombieri on the Weil conjectures. In particular we make use of Bombieri's bound on the degree of the Zeta function of algebraic varieties over finite fields. Our bounds provide a natural extension to the recent topological lower bounds obtained by A. Bjorner, L. Lovasz and A.C. Yao for algebraic computation trees over the real numbers. For the special cases of real subspace arrangements and general complex varieties we can reformulate their specific results using our combinatorial approach without mentioning any topological invariants.
Use Cases for Identity Management in E-Government
Authors: Robin McKenzie, Malcolm Crompton, Colin Wallis
Venue: IEEE Security and Privacy (2008)

E-government provides a special and complex use case for identity management systems, first because the needs of some parts of the government (such as law enforcement and national security) are often at odds with the service-oriented aspects of government, and second because of the unique role government plays in the life of the citizen. The blurring of responsibility and accountability might facilitate this: e-government identity management systems aren't straightforward to implement. Culture and history strongly affect the nature of the identity management system that might be acceptable to citizens in particular circumstances, with levels of trust in government being a key factor. In this article, the authors discuss these issues, present an e-government use case from New Zealand, and describe how the New Zealand implementation differs from several other identity management systems around the globe.
Generation of pornographic blacklist and its incremental update using an inverse chi-square based method
Authors: Lung-Hao Lee, Cheng-Jye Luh
Venue: Information Processing and Management: an International Journal (2008)

This study presented an inverse chi-square based web content classification system that works along with an incremental update mechanism for incremental generation of pornographic blacklist. The proposed system, as indicated from the experimental results, can classify bilingual (English and Chinese) web pages at an average precision rate of 97.11%; while maintaining a favorably low false positive rate. Such satisfactory performance was obtained under a cost-effective parameter configuration used in inverse chi-square calculations. The proposed incremental update mechanism operates on the linking structure of pornographic hubs to locate newly added pornographic sites. The resulting blacklist has been empirically verified to be comparatively responsive to the growth dynamics of pornography sites than three public domain blacklists.
Analysis of Changes in Muscle Length of Lower Limbs during High-heeled Walking Based on the Musculoskeletal Model
Authors: Jongsang Son, Hueseok Choi, Youngho Kim
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 02 (2008)

In this paper, we analyzed changes in muscle length of lower limbs during high-heel walking based on the musculoskeletal model. Twenty young healthy women participated in this study. For each subject, the 3D motion analysis was performed for four different cases; walking with flat shoe, 3cm high-heel, 6cm high-heel, and 9cm high-heel. Then the musculoskeletal model, with modified Hill-type muscles, was made from subjects' anthropometric data and 3D motion capture data. Results showed that heel height did not show significant difference in hip joint motion. However, for 6cm and 9cm high-heels, knee flexion increased during loading response due to the insufficient extension of biceps femoris short head. Changes in muscle length of soleus and tibialis anterior significantly decreased and the muscle force of soleus decreased. Our results showed that the ankle joint played most important role to adapt high-heel lower than 6cm, but the contribution of other lower extremity joints, especially knee joint, would be required for the higher heel. Changes in muscle length provided more valuable information to determine gait characteristics in various clinical conditions.
Style-learning with feature-based texture synthesis
Authors: Xuexiang Xie, Feng Tian, Hock Soon Seah
Venue: Computers in Entertainment (CIE) (2008)

The objective of artistic style learning is to synthesize a new image from a source image with the style learnt from example images. Existing example-based texture synthesis (EBTS) techniques model style with low-level statistical properties. These methods work well with some artistic styles such as oil painting, but have difficulties in preserving image details and features for other styles, such as pencil hatching. In this article, an improved artistic style-learning algorithm with feature-based texture synthesis (FBTS) is introduced. Compared with existing EBTS methods, in our FBTS algorithm, image details and features are better defined with a feature field generated from the source image. Also, an improved L2 neighborhood distance metric which provides better measures of perceptual similarity is proposed. Results and comparisons are given to demonstrate the effectiveness of the FBTS algorithm with applications in the areas of stylized shading and artistic style transfer.
A Formal Model of Memory Peculiarities for the Verification of Low-Level Operating-System Code
Authors: Hendrik Tews, Tjark Weber, Marcus Völp
Venue: Electronic Notes in Theoretical Computer Science (ENTCS) (2008)

This paper presents our solutions to some problems we encountered in an ongoing attempt to verify the micro-hypervisor currently developed within the Robin project. The problems that we discuss are (1) efficient automatic reasoning for type-correct programs in virtual memory, and (2) modeling memory-mapped devices with alignment requirements. The discussed solutions are integrated in our verification environment for operating-system kernels in the interactive theorem prover PVS. This verification environment will ultimately be used for the verification of the Robin micro-hypervisor. As a proof of concept we include an example verification of a very simple piece of code in our environment.
An Architecture for Mobile P2P File Sharing in Marine Domain
Authors: Huafeng Wu, Chaojian Shi, Haiguang Chen, Xi Zhou, Chuanshan Gao
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

The Peer-to-Pee (P2P) applications have become quite popular in the terrestrial domain mainly due to its strong capability of sharing distributed files. However, in the marine environment, where the ship is almost isolated from the world, the p2p file sharing system could be more demanding, but not available so far. By virtues of the rapid development of the wireless telecommunications, especially the INMARSAT Fleet satellite communications, along with the provided Mobile Packet Data Service (MPDS), we propose a Mobile P2P (MP2P) architecture, which could be further utilized to implement a MP2P file-sharing system at sea. To achieve this goal, in this paper, we firstly proposed an architecture concept for Next Generation Maritime Communication Network (NGMCN). Then, on this basis, we design our layered MP2P file-sharing architecture. Finally, we use simulations to evaluate the performance of the proposed architecture and applicability to the marine environment.
Enabling environment for software engineering industry: a strategic framework of eSEE eAgenda 2002 and eSEE eAgenda+ 2007
Authors: Zlatan Šabić, Tarik Zaimovi, Nera Nazecic, Timur Gadzo, Merima Avdagi
Venue: Proceedings of the 2008 international workshop on Software Engineering in east and south europe (2008)

Modern technologies have the tremendous capacity to unleash the potential of the South Eastern Europe (SEE) countries, and to help increase their economic growth and foster their integration in world market. This paper is set forth to analyze the policy impact of "eSEE Agenda for the Development of the Information Society" (eSEE Agenda), as a regional action plan for Information Society development in SEE region implemented from 2002 to 2007, including the policy impact to development of national software engineering industries. As several reviews and reports from recent South Eastern Europe Ministerial Conference on Information Society Development (Sarajevo, October 2007) indicate, the initial Agenda's aims have in good measure been attained. Development of an enabling framework is largely complete, new ICT infrastructure is being introduced in government departments and public institutions, a very wide range of e-services for the public and business are either already operational or close to becoming so. Recognition of this fact by the members of the Initiative has led to an extension of the initiative, with the agreement of a second phase, "eSEE Agenda Plus for the Development of Information Society in South Eastern Europe 2007-2012", signed in Sarajevo on 29 October 2007 at the South Eastern Europe Ministerial Conference on Information Society Development. This paper will also look into current trends and perspectives articulated in the second generation of Initiative activities and the Action Plan of the Taskforce for Broadband, and their implications for Information Society development in South Eastern Europe as the basic software engineering development environment.