ppxscal/embedding_network huggingface dataset:
Data structural bootstrapping, linear path compression, and catenable heap ordered double ended queues
Authors: A. L. Buchsbaum, R. Sundar, R. E. Tarjan
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The authors provide an efficient implementation of catenable mindeques. To prove that the resulting data structure achieves constant amortized time per operation, they consider order preserving path compression. They prove a linear bound on deque ordered spine-only path compression, a case of order persevering path compression employed by the data structure.
Modeling Ethical Decision-Making
Authors: Reggie Davidrajuh
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

This paper explores whether it is possible to build an autonomous computing system that can make online ethical decisions, and if it possible, then what it takes to build such a system. Firstly, this paper introduces ethical decision-making in the networked economy. Secondly, three ethical theories that are relevant to the business environment are presented. Thirdly, a literature study is presented on the existing models for ethical decision-making. Fourthly, a new model is proposed. This paper concludes with a discussion on how an autonomous computing system could be built based on the new model.
An MDA-Based System Development Lifecycle
Authors: Mohsen Asadi, Mahdy Ravakhah, Raman Ramsin
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

OMG’s Model Driven Architecture (MDA) has deeply influenced modern-day software development, not only by providing promising means for automating the software process, but also through revitalizing the role of modeling in software development, the importance of which had been neglected during the recent euphoria over lightweight development methods. However, MDA’s need to remain reasonably abstract means that it is more a software development approach rather than a standalone methodology, and therefore needs methodology support to be practically useful. Several MDA-based methodologies exist today, yet the need remains for the definition of an instantiable MDA-based development process. We propose a generic lifecycle for MDA-based software development that can be used as a basis for constructing MDA-based methodologies through a Method Engineering (ME) process. The phases and activities of the proposed lifecycle are described herein, with a number of prominent MDA-based methodologies assessed as to their degree of conformance to the proposed lifecycle.
The influence of variables on Boolean functions
Authors: J. Kahn
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

Methods from harmonic analysis are used to prove some general theorems on Boolean functions. These connections with harmonic analysis viewed by the authors are very promising; besides the results on Boolean functions they enable them to prove theorems on the rapid mixing of the random walk on the cube and in the extremal theory of finite sets.
Pervasive Digital Monitoring and Transmission of Pre-Care Patient Biostatics with an OSGi, MOM and SOA Based Remote Health Care System
Authors: Ing-Yi Chen, Chen-Hsin Tsai
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

Telemedicine applications are evolving quickly as information technologies improve. New requirements from users and changes in business processes make it necessary to frequently alter applications. Developers are responsible for redesigning the applications on both the user and server sides to meet the latest requirements. This is both time consuming and expensive. A new approach is needed to improve the support of application construction and to reduce the costs involved.In this paper, we use OSGi as a platform, on which to combine components in order to form new functionalities used pervasively in different devices on the user side. Examples include cell phones, PDAs, and home gateways. For server side applications, we divided the health care system into several layers and combined the services provided by these modules using a loose-coupling mechanism - process choreography. When the requirements or system flows of the telemedicine server are changed, the proposed system can adapt to meet new needs by replacing the bundles on the edge server and reconfiguring the business process used in the health care system.
GIS techniques for creating river terrain models for hydrodynamic modeling and flood inundation mapping
Authors: Venkatesh Merwade, Aaron Cook, Julie Coonrod
Venue: Environmental Modelling Software (2008)

Two- and three-dimensional (2D/3D) hydrodynamic models require the geometric description of river bathymetry and its surrounding area as a continuous surface. These surface representations of river systems are also required in mapping flood inundation extents. Creating surface representations of river systems is a challenging task because of issues associated with interpolating river bathymetry, and then integrating this bathymetry with surrounding topography. The objectives of this paper are to highlight key issues associated with creating an integrated river terrain, and propose GIS techniques to overcome these issues. The following techniques are presented in this paper: mapping and analyzing river channel data in a channel fitted coordinate system; interpolation of river cross-sections to create a 3D mesh for main channel; and integration of interpolated 3D mesh with surrounding topography. These techniques are applied and cross-validated by using datasets from Brazos River in Texas, Kootenai River in Montana, and Strouds Creek in North Carolina. Creation of a 3D mesh for the main channel using a channel-fitted coordinate system and subsequent integration with surrounding topography produces a coherent river terrain model, which can be used for 2D/3D hydrodynamic modeling and flood inundation mapping. Although techniques presented in this paper produce better results compared to existing GIS methods, the linear approach has some limitations which can be overcome by accounting for channel meanders, sinuosity and thalweg location.
A Parallel Steiner Tree Construction on the Server-Client Model of Computation
Authors: Rashid Bin Muhammad
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

This paper presents the computational analysis of the Steiner tree problem on the Server-Client model of computation. In particular, this work analyzes the time delays among server and clients for the parallel Steiner tree algorithm and examines some consequences of time delays on the execution time by considering constant and variable delays.
Multiobjective optimization problems with equilibrium constraints
Authors: Boris S. Mordukhovich
Venue: Mathematical Programming: Series A and B (2008)

The paper is devoted to new applications of advanced tools of modern variational analysis and generalized differentiation to the study of broad classes of multiobjective optimization problems subject to equilibrium constraints in both finite-dimensional and infinite-dimensional settings. Performance criteria in multiobjective/vector optimization are defined by general preference relationships satisfying natural requirements, while equilibrium constraints are described by parameterized generalized equations/variational conditions in the sense of Robinson. Such problems are intrinsically nonsmooth and are handled in this paper via appropriate normal/coderivative/subdifferential constructions that exhibit full calculi. Most of the results obtained are new even in finite dimensions, while the case of infinite-dimensional spaces is significantly more involved requiring in addition certain &#x201c;sequential normal compactness&#x201d; properties of sets and mappings that are preserved under a broad spectrum of operations.
Regional crop monitoring and discrimination based on simulated ENVISAT ASAR wide swath mode images
Authors: X. Blaes, F. Holecz, H. J. C. van Leeuwen, P. Defourny
Venue: International Journal of Remote Sensing (2007)

The current paper investigates the potential contribution of ENVISAT wide swath (WS) images for discrimination and monitoring of crops at a regional scale. The study was based on synthetic aperture radar (SAR) images acquired throughout an entire growing season. Advanced synthetic aperture radar sensor (ASAR) images in both narrow swath (NS) and WS modes were simulated based on 15 European Remote Sensing (ERS) satellite images recorded over Belgium. Unlike 'real' ASAR imagery, this exercise provided a consistent data set (i.e. same incidence angle, same acquisition date, same acquisition hour) to study the impact of spatial resolution on the SAR signal information content. A quantitative approach using 787 parcels of medium field size and various data combinations assessed monitoring and discrimination capabilities for six crop types: wheat, barley, grasses, sugar beet, maize and potato. The spatial resolution impact of the ASAR sensor was discussed with respect to the field size by comparing the results obtained from NS (30 m) and WS (150 m) mode images. WS temporal profiles were able to discriminate the various crops of interest and were representative of the crop development observed in the region. Furthermore, parcel-based unsupervised classifications successfully discriminated between grass, wheat, barley and other crops of large parcels (success rate of 83%). Dedicated interpretation schemes were developed in order to discriminate between cereal crops.
Technical note: Quantitative monitoring of a Saharan dust event with SEVIRI on Meteosat-8
Authors: J. Li, P. Zhang, T. J. Schmit, J. Schmetz, W. P. Menzel
Venue: International Journal of Remote Sensing (2007)

An algorithm has been developed to quantitatively retrieve dust properties (identification, optical thickness, particle radius, and dust density) from the Spinning Enhanced Visible and Infrared Imager (SEVIRI) aboard Meteosat-8, the first of the Meteosat Second Generation (MSG). Two SEVIRI thermal infrared (IR) window channels (10.8 µm and 12 µm) were used to monitor the dust event of 3 March 2004 over the Sahara in northern Africa. The identification and evolution of dust are well depicted by SEVIRI data with high spatial resolution (approximately 3 km) and high temporal resolution (15 minutes). This demonstrates the capability of a geostationary advanced imager to monitor dust events over land, their migration and the corresponding air quality.
Robust neuro-identification of nonlinear plants in electric power systems with missing sensor measurements
Authors: Wei Qiao, Zhi Gao, Ronald G. Harley, Ganesh K. Venayagamoorthy
Venue: Engineering Applications of Artificial Intelligence (2008)

Fault tolerant measurements are an essential requirement for system identification, control and protection. Measurements can be corrupted or interrupted due to sensor failure, broken or bad connections, bad communication, or malfunction of some hardware or software. This paper proposes a novel robust artificial neural network identifier (RANNI) by combining a sensor evaluation and (missing sensor) restoration scheme (SERS) and an ANN identifier (ANNI) in a cascading structure. This RANNI is able to provide continuous on-line identification of nonlinear plants when some crucial sensor measurements are unavailable. A static synchronous series compensator (SSSC) connected to a power system is used as a test system to examine the validity of the proposed model. Simulation studies are carried out with single and multiple phase current sensors missing; results show that the proposed RANNI continuously tracks the plant dynamics with good precision during the steady state, the small disturbance, the transient state after a large disturbance and the unbalanced three-phase operations. The proposed RANNI is readily applicable to other plant models in power systems.
Creating agents that entertain
Authors: Colleen van Lent, Kelly Christoffersen, Hsiu-Chin Lin
Venue: Journal of Computing Sciences in Colleges (2008)

Game AI research is moving away from the creation of dominant computer agents to the idea of creating agents that focus on entertainment. The development of a realistic definition of entertainment, or "fun", requires a qualitative measure on subjective assessments from a large, diverse field of participants. We present our work in the early stages of creating a web-based system for testing different opponent behaviors. We have augmented the Link4 game[6] to compete again human players using three different opponent strategies. Human players will rank the entertainment value of these agents, as well as personal information that may affect their ranking. This paper describes the simple behaviors we have coded for testing purposes and the challenge of capturing user the experience while not detracting from it.
A Statistical Mechanic View of Macro-dynamics in Economics
Authors: Simone Landini, Mariacristina Uberti
Venue: Computational Economics (2008)

In this study, based on a statistical mechanic perspective, some technical insights for macroeconomic analysis are presented with regard to (1) "modeling the behaviour of a many-interacting-heterogeneous agents system through the analysis of fractions' stochastic dynamics over a state space" (Delli Gatti and Gallegati, Eterogeneità degli agenti economici ed interazione sociale: teorie e verifiche empiriche, 2005) and (2) suggesting a new microfoundation method based on jump Markov processes to mimic fluctuation dynamics of macro variables (Aoki, New approaches to macroeconomic modeling, 1996; Aoki, Modeling aggregate behaviour and fluctuations in economics, 2002; Aoki and Yoshikawa, Reconstructuring macroeconomics. A perspective from statistical physics and combinatorial stochastic processes, 2006). The main aim is to review and to describe how the statistical mechanic methodology provides systematic methods to solve master equation problems to be applied in macroscopic dynamics analysis in economics. The results are achieved in terms of a mean field system of equations to model average and volatility of a macroscopic quantity. By means of a macroscopic ordinary differential equation, the drift component is detached and, by means of a Fokker---Planck equation, the spread component around such a deterministic path is derived.
A note on the construction of error detecting/correcting prefix codes
Authors: Artur Alves Pessoa
Venue: Information Processing Letters (2008)

A k-bit Hamming prefix code is a binary code with the following property: for any codeword x and any prefix y of another codeword, both x and y having the same length, the Hamming distance between x and y is at least k. Given an alphabet A=[a"1,...,a"n] with corresponding probabilities [p"1,...,p"n], the k-bit Hamming prefix code problem is to find a k-bit Hamming prefix code for A with minimum average codeword length @?"i"="1^np"i@?"i, where @?"i is the length of the codeword assigned to a"i. In this paper, we propose a general approximation algorithm for the k-bit Hamming prefix code problem. Let @a"k be an O(r"k(n))-time algorithm for calculating fixed-length codes with Hamming distances k whose codewords are d"k(n) bits longer than @?log"2n@?. Our algorithm uses @a"k to calculate a k-bit Hamming prefix code in O(r"k(n)+nlogn) time with an additive error of at most O(d"k(n)+log^*n) bits with respect to the optimal prefix code for A, under reasonable assumptions on the function d"k.
Predictive business forecasting using queue simulation
Authors: Ahmed Tarek
Venue: Proceedings of the 10th WSEAS International Conference on APPLIED MATHEMATICS (2006)

Queues are not merely an object to study. Queues are real world problems faced by customers at a business station that kill their valuable time. This results in decreased customer interest and the progress trends towards a loss. This is particularly frightful with smaller investments, where a single loss may permanently eliminate the business. It is not enough to know how queue behaves, but we are also required to know how to eliminate queues or at least how to reduce them to a manageable size. It is possible to reduce the queuing delay by changing the service mechanism. This involves increasing the rate at which customers are being served. Queues grow when customers happen to arrive at a faster rate than they are being served. This type of service dependent queues may be eliminated or at least reduced by developing a demand responsive service strategy that reduces the service time variation. Practical business transactions are too complex to be studied analytically. Besides, analysis using the collective practical data is hugely expensive and prohibitively time consuming that may affect the investment incentives. In this paper, a queuing model to simulate a small commercial establishment has been proposed, and a C++ program, which is founded on the model, is implemented. Simulation data plots are presented and the data tables are analyzed to make predictive forecasting over the significant transaction factors. Mathematical analysis fundamental to the proposed model is also incorporated, so that the model may be extended to a multitude of other similar applications in future.
Complexity Based Image Artifact Detection
Authors: Alexandre Mallet, Lionel Gueguen, Mihai Datcu
Venue: Proceedings of the Data Compression Conference (2008)

Images may contain blemishes or artificial structures which come from the processing or directly from the sensors. These artifacts decrease the quality of the images and can lead to analysis and interpretation problems. We are interested in detecting these defects automatically. A visual analysis of such artifacts brings to the conclusion that they constitute a local modification of the complexity of the image. Therefore this paper will give a complexity based approach for the detection of these defects. This approach will distinguich two different methods: firstly the artifacts will be looked for respectively to given example, with a complexity comparison. This method will involve both direct and model based means. From the weaknesses of that method a second one will be deducted which will not be attached to the given examples and will take into consideration the local complexity context of the image. These methods will be applied in the domain of Earth Observation images.
New Heritage: New Media and Cultural Heritage, 1 edition
Authors: Yehuda E. Kalay, Thomas Kvan, Janice Affleck, Yehuda E. Kalay, Thomas Kvan, Janice Affleck
Venue:  (2007)

The use of new media in the service of cultural heritage is a fast growing field, known variously as virtual or digital heritage. New Heritage, under this denomination, broadens the definition of the field to address the complexity of cultural heritage such as the related social, political and economic issues. This book is a collection of 20 key essays, of authors from 11 countries, representing a wide range of professions including architecture, philosophy, history, cultural heritage management, new media, museology and computer science, which examine the application of new media to cultural heritage from a different points of view. Issues surrounding heritage interpretation to the public and the attempts to capture the essence of both tangible (buildings, monuments) and intangible (customs, rituals) cultural heritage are investigated in a series of innovative case studies.
Scientific contributions of Leo Khachiyan (a short overview)
Authors: Endre Boros, Vladimir Gurvich
Venue: Discrete Applied Mathematics (2008)

On April 29, 2005, Leo Khachiyan passed away with tragic suddenness in the middle of his scientific career. He became famous for his polynomial time algorithm for linear programming (LP)[L. Khachiyan, A polynomial algorithm in linear programming, Soviet Math. Doklady 20 (1) (1979) 191-194; L. Khachiyan, Polynomial algorithms for linear programming, USSR Comp. Math. and Math. Phys. 20 (2) (1980) 51-68]. However, he contributed fundamentally to several other areas, as well. In this introductory paper, we would like to recall briefly his main contributions, and provide a complete (up to our best knowledge) list of his publications.
About the relationship between people and discoverable Bluetooth devices in urban environments
Authors: Tom Nicolai, Holger Kenn
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)

People are frequently carrying their Bluetooth enabled mobile phones in their pockets while moving through public spaces. With only a small fraction of these being set to discoverable mode, it is possible to estimate the number of persons in proximity by conducting Bluetooth device inquiries. In this paper, we present a method for the measurement of the percentage of people with discoverable devices. We did experiments using this method in Bremen, Germany and San Francisco, US, suggesting that about 2%, respectively 6%, are detectable. Further, we show that this measurement can well be implemented on common mobile phones, and that specialized scanners are not necessary.
Integrating Trust and Role for Secure Interoperation in Multi-Domain Environment
Authors: Jianfeng Lu, Ruixuan Li, Zhengding Lu, Bing Li
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Traditional access control disciplines such as RBAC has difficulty in covering open and decentralized multi-centric systems because it has focused on a closed system where all users are known and primarily utilizes a server-side reference monitor within the system. Trust management has relaxed this known user restriction and allowed authorize for strangers based on their credentials. However, trust management has also been found to be lacking because of certain inherent drawbacks with the notion of credential. In this work, a new access control model T&RBAC is presented in this paper. It integrates RBAC and TM. User can be assigned to local roles, also can be assigned to foreign roles based on his credential and local roles. We proof that there is no security constraints in T&RBAC. To some extends, T&RBAC is only a core model and can be extended for specific requirement.
Simulation-Based Analysis for GEAR Performance Optimization
Authors: Ismat K. Maarouf, Tarek R. Sheltami
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

GEAR is a geographic and energy aware routing protocol that tries to load balance routing operation to efficiently use energy resources. However, being more distance aware, by the geographic routing, or more energy aware creates several conflicting goals such as obtaining minimal delay, increasing energy balancing and increasing system delivery ratio. This work investigates the possibility to optimize GEAR operation to achieve best performance. The work simulates several approaches on selecting the preference in each node’s routing decision to distance or energy. This includes static centralized strategy, dynamic and adaptive de-centralized strategies. Results show that optimality is achievable at different operation points in all strategies.