ppxscal/embedding_network huggingface dataset:
Application of the Active Learning Method for the estimation of geophysical variables in the Caspian Sea from satellite ocean colour observations
Authors: Taheri H. Shahraiyni, M. Schaale, F. Fell, J. Fischer, R. Preusker, M. Vatandoust, Bagheri S. Shouraki, M. Tajrishy, H. Khodaparast, A. Tavakoli
Venue: International Journal of Remote Sensing (2007)

Remotely sensed data inherently contain noise. The development of inverse modelling methods with a low sensitivity to noise is in demand for the estimation of geophysical variables from remotely sensed data. The Active Learning Method (ALM) is well known to have a low sensitivity to noise. For the first time, ALM was utilized for the inversion of radiative transfer calculations with the aim of estimating chlorophyll a (Chl a), coloured dissolved organic matter (CDOM), and suspended particulate matter (SPM) in the Caspian Sea using MERIS (MEdium Resolution Imaging Spectrometer) data. ALM training is straightforward and fast. The ALM inversion models revealed the most relevant variables and showed a short processing time in operational applications for the estimation of geophysical variables. The mean absolute percentage errors of Chl a, SPM, and CDOM estimation using ALM inversion models were 44, 70, and 73%, respectively. According to the ALM results, it can be introduced as a new method for inverse modelling of ocean colour observations.
Proposing a Formal Method to Reduce RTS Logical Model Complexity
Authors: Francisco Supino Marcondes, Emilia de Menezes Colonese, Ítalo Santiago Vega, Luiz Alberto Vieira Dias
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

Complex Real Time Systems (RTS) often come with many requirements, which have a difficult description with a large number of scenarios. In order to control this complexity and improve the system QoS, a formal method was applied to decrease the complexity of logical model descriptions, related to state diagrams. The approach introduces a mapping of states diagrams to automata, in order to bring in formal methods into the system development process. By applying the Myhill Nerode Minimization Process for automata, the authors could recognize some decrease of the model complexity. The case study validates the approach by reducing the initial state diagram of a RTS from 5 states and 40 transitions to 1 state with 5 transitions. This finding can motivate the software engineers’ community to research formal methods that could be applied to software development processes.
Fuzzy Logic based Identification of Operator Functional States Using Multiple Physiological and Performance Measures
Authors: Jian-Hua Zhang, Xing-Yu Wang, M. Mahfouf, D. A. Linkens
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

This paper assesses the operator functional state (OFS) based on a collection of psychophysiological and performance measures. Two types of adaptive fuzzy models, namely ANFIS (adaptive-network-based fuzzy inference system) and GA (genetic algorithm) based Mamdani fuzzy model, are employed to estimate the OFSs under a set of simulated process control tasks involved in an automation-enhanced cabin air management system (aCAMS). The adaptive fuzzy modelling procedures are described and then validated using real-life data measured from such a simulated human-machine process control system.
Bicriterion scheduling with equal processing times on a batch processing machine
Authors: L. L. Liu, C. T. Ng, T. C. E. Cheng
Venue: Computers and Operations Research (2009)

In this paper we consider the problem of scheduling jobs with equal processing times on a single batch processing machine so as to minimize a primary and a secondary criteria. We provide optimal polynomial time algorithms for various combinations of the primary and secondary criteria.
Filling trenches on a SiO2 substrate with Cu using a hot refractory anode vacuum arc
Authors: I. I. Beilis, D. Grach, A. Shashurin, R. L. Boxman
Venue: Microelectronic Engineering (2008)

First results of complete filling of 100nm widex300 nm deep trenches with Cu using the expanding plasma plume from a hot refractory anode vacuum arc (HRAVA) plasma source are presented. The arc was ignited between a consumed water-cooled cylindrical Cu cathode (30mm diameter) and a non-consumed W cylindrical anode (32mm diameter, 30mm height) that was heated by the arc. An arc current of 200A was applied for periods of 180s. The films were deposited on a Si substrate with a top SiO"2 layer. The substrates were exposed to the plasma plume for 120s, while a shutter was open. The distance to the substrate from the electrode axis was varied over the range of about 74-122mm. A pulsed bias voltage of -75 or -100V, with a 60kHz pulse repetition rate and a 50-80% duty cycle was applied to the substrate. The films were examined using a scanning electron microscope. The average film resistivity was measured with a four point probe. The deposition rate was as high as 425nm/min, and the minimum average resistivity was 5.5@m@Wcm.
Recovering Variable-Argument Functions from Binary Executables
Authors: Wen Fu, Rongcai Zhao, Jianmin Pang, Jingbo Zhang
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Variable-argument functions, such as printf(), are broadly used in C programs because of its flexible usage of pointers. However, the recovery of such a function from a binary executable is not an easy task in the field of reverse compilation. The first problem is how to distinguish a variable-argument function from other functions in binary code. The second is how to implement avariable-argument function in a target program. The aim of this paper is to deal with these problems for IA-64 binary executables. We analyzed a large number of is assembled C programs to see how to implement variable-argument functions in machine code. According to calling conventions on IA-64/Linux platform, we abstracted some instruction patterns to recognize variable-argument functions from binary executables. Besides that, we put forward a normalization method to recover variable-argumentlists. We use an example compiled by GCC with -O0 option for demonstration, but our methods are not limited to any particular compiler and compiling option.
Code-Shifted Reference Ultra-Wideband (UWB) Radio
Authors: Hong Nie, Zhizhang Chen
Venue: Proceedings of the Communication Networks and Services Research Conference (2008)

In this paper, a code-shifted reference ultra-wideband (CSR-UWB) transceiver, which separates the reference pulse sequence and the data pulse sequences with a set of shifting and detection codes selected from Walsh codes, has been proposed to remove the ultra wideband delay element required by the transmitted reference UWB transceiver. As compared to the frequency-shifted reference UWB transceiver, which also can remove the delay element through separating the reference pulse sequence and the data pulse sequences with a group of analog carriers, the CSR-UWB transceiver has lower complexity as well as much better bit-error rate performance.
Separating financial from commercial customer churn: A modeling step towards resolving the conflict between the sales and credit department
Authors: Jonathan Burez, Dirk Van den Poel
Venue: Expert Systems with Applications: An International Journal (2008)

In subscription services, customers who leave the company can be divided into two groups: customers who do not renew their fixed-term contract at the end of that contract, and others who just stop paying during their contract to which they are legally bound. Those two separate processes are often modeled together in a so-called churn-prediction model, but are actually two different processes. The first type of churn can be considered commercial churn, i.e., customers making a studied choice not to renew their subscriptions. The second phenomenon is defined as financial churn, people who stop paying because they can no longer afford the service. The so-called marketing dilemma arises, as conflicting interests exist between the sales and marketing department on the one hand, and the legal and credit department on the other hand. This paper shows that the two different processes mentioned can be separated by using information from the internal database of the company and that previous bad-payment behavior is more important as a driver for financial than for commercial churn. Finally, it is shown on real-life data that one can more accurately predict financial churn than commercial churn (increasing within period as well as out-of-period prediction performance). Conversely, when trying to persuade customers to stay with the company, the impact of 'loyalty' actions is far greater with potential commercial churners as compared to financial churners. Evidence comes from a real-life field experiment.
A Regularity-Oriented Service Model with Sub-Day-Scale User Classifications for Mobile Internet
Authors: Toshihiko Yamakami
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

The Internet has been rapidly mobilized by increasing penetration to wireless users. Important issues in mobile user behaviors include identification of long-term regular users in dynamic 24-hour behaviors. The author proposes a regularity-oriented service model to outline the mobile-specific aspects of usage regularity to obtain clues to user preferences on content and services. Then, the author performs some user surveys to identify the diversity of mobile Internet use. It brings our attention on user segment awareness to identification of regularity. The author proposes a clustering method based on an assumption of three different segments of mobile users. The author examines the clustering result with the revisit ratio in the next month to demonstrate the usefulness of the method in the context of long-term use regularity.
A surface reflectance model for aerosol remote sensing over land
Authors: R. Santer, D. Ramon, J. Vidot, E. Dilligeard
Venue: International Journal of Remote Sensing (2007)

MERIS aerosol remote sensing over land is based on the use of pixels covered by vegetation. Dense Dark Vegetation pixels are selected using the Atmospheric Resistant Vegetation Index as spectral index. Above an ARVI threshold, TARVI, at a given wavelength, a standard DDV reflectance ρDDV is set to a constant value. Initially, 11 biomes and 20 DDV models have been selected from the POLDER 1 imagery. A clear limitation to the initial process was the limited spatial coverage of DDV pixels. That the reason why, the DDV concept has been extended to include less dark pixels. Preliminary results indicated that a simple linear regression between surface reflectance ρ and ARVI applies. The goal of this paper is to investigate the scope for such linear relationship. The first step is to start from the current DDV models and to complementary define the slope χ which describes the linear decrease of ρ with ARVI and the ARVI range on which it applies.An extensive archive of MERIS images has been fully corrected from the atmosphere using ground based measurements. The outputs are the surface reflectances from which the reflectance model can be built. An independent validation on the surface reflectance model has been conducted on a large SeaWiFS archive on which the MERIS algorithm has been processed. The outputs of this work are new monthly Look Up Tables in the spectral bands used for aerosol remote sensing: 412 nm, 443 nm and 670 nm. For each of the 11 biomes used in MERIS, the slope χ and the ARVI domain on which the linear fit applied, are used as auxiliary data in the new version of the MERIS ground segment. The second MERIS processing includes this new reflectance model. We investigate the limitations of this model in two aspects. First, locally, we use ground based solar extinction measurements to validate the aerosol products. The aerosol optical thicknesses are quite well retrieved in the blue while MERIS underestimate by a factor two the aerosol optical thickness at 670 nm. We also analysed MERIS level 3 aerosol products on which the spatial continuity of the DDV models is poor between biomes. In both cases, the new surface reflectance model does not appear responsible but instead the initial DDV model has to be consolidated through more accurate values of the DDV surface albedo and through a better global mapping.
PSecGCM: Process for the Development of Secure Grid Computing based Systems with Mobile Devices
Authors: David G. Rosado, Eduardo Fernandez-Medina, Javier López, Mario Piattini
Venue: Proceedings of the 2008 Third International Conference on Availability, Reliability and Security (2008)

Mobile Grid, in relevance to both Grid and Mobile Computing, is a full inheritor of Grid with the additional feature of supporting mobile users and resources in a seamless, transparent, secure and efficient way. Security of these systems, due to their distributed and open nature, receives great interest. A formal approach to security in the software life cycle is essential to protect corporate resources. However, little thought has been given to this aspect of software development. Due to its criticality, security should be integrated as a formal approach in the software life cycle. A methodology of development for secure mobile Grid computing based systems is defined, that is to say, an engineering process that defines the steps to follow so that starting from the necessities to solve, we can design and construct a secure Grid system with support for mobile devices that is able to solve and cover these necessities.
Fast Partial Distortion Elimination Algorithm for Lossless and Lossy Motion Estimation Using Hadamard Transform and Probability Model
Authors: Soonjong Jin, Hyuk Lee, Jechang Jeong
Venue: Proceedings of the Data Compression Conference (2008)

Based on the ordered Hadamard transform and probability model, we propose a fast partial distortion elimination algorithm. In this paper, we intuitively derive DC and AC constraints to model local block complexities using ordered Hadamard transform from pixel based gradient method. For lossless motion estimation, we obtain the optimized search order in the matching error calculation by descending order of local constraints using sum of these constraints. And for lossy motion estimation, using probability model which is approximated by the cumulative distribution function of constraints, we also propose the accurate total matching error prediction algorithm in the middle of calculation without all matching error calculations. Compared with the conventional full search algorithm, the proposed algorithm reduces the motion estimation complexity up to 92.4% for lossy motion estimation and 89.4% for lossless motion estimation on average.
Towards a framework for software navigation techniques
Authors: Andrew Sutherland, Kevin Schneider
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

Making a change to a large software system requires investing time in understanding the system first. In the context of programming, navigation refers to the process of finding one's way through a complex network of programming constructs and other software artifacts. The process consists of answering questions such as "What am I looking at?" and "What do I want to look at next?", along with the question of "How do I get there?". This paper looks at the range of techniques used to aid navigation, and categorizes them using three perspectives: perceptual techniques, which use graphical representations and exploit spatial memory to aid navigation; filtering techniques, which operate by automatically reducing the amount of information provided so that the appropriate pieces of information are easy to find; and enrichment techniques, which involve augmenting the view of the software with peripheral information, so that the relative information can be more easily identified.
On the reducibility of compartmental matrices
Authors: Jin-Zhi Lei, Chang-Yi Wang
Venue: Computers in Biology and Medicine (2008)

Compartmental analysis is the most important modeling tool in biology and medicine. The perturbation due to a tracer in a biomedical system usually leads to a linear system that can be described by a compartmental matrix. The reducibility of the compartmental matrix has important implications on the system, both analytically and computationally. This note provides an efficient algorithm to determine the reducibility of a compartmental system. Furthermore, if reducible, the algorithm provides a means to delineate the sub-systems to be successively solved.
Empty versus overabundant answers to flexible relational queries
Authors: Patrick Bosc, Allel Hadjali, Olivier Pivert
Venue: Fuzzy Sets and Systems (2008)

When retrieving and searching desired data over large databases accessible in the web, users might be confronted with two common problems: overabundant answers and empty answers. In the former, the user is provided with an avalanche of responses that satisfy his/her query, while in the latter, no data are returned to the query asked. In this paper, we attempt to address those problems in the context of flexible queries. The basic idea behind the solutions proposed consists in modulating the fuzzy conditions involved in the user query by applying appropriate transformations. According to the problem at hand, this operation leads to a relaxation or an intensification of the user query. Two particular transformations that rely on a convenient parameterized proximity relation are introduced. The predicates of the modified queries are obtained by means of fuzzy arithmetic. The main properties of our proposal are investigated and a comparison with other approaches is outlined.
Graphs whose choice number is equal to their chromatic number
Authors: Sylvain Gravier, Frédéric Maffray
Venue: Journal of Graph Theory (1998)

A graph G is k-choosable if it admits a vertex-coloring whenever the colors allowed at each vertex are restricted to a list of length k. If X denotes the usual chromatic number of G, we are interested in which kind of G is X-choosable. This question contains a famous conjecture, which states that every line-graph is X-choosable. We present some other classes of graphs that are X-choosable; all these classes are related to claw-free graphs. &copy; 1998 John Wiley Sons, Inc. J Graph Theory 27: 8797, 1998
Approximation of satisfactory bisection problems
Authors: Cristina Bazgan, Zsolt Tuza, Daniel Vanderpooten
Venue: Journal of Computer and System Sciences (2008)

The Satisfactory Bisection problem means to decide whether a given graph has a partition of its vertex set into two parts of the same cardinality such that each vertex has at least as many neighbors in its part as in the other part. A related variant of this problem, called Co-Satisfactory Bisection, requires that each vertex has at most as many neighbors in its part as in the other part. A vertex satisfying the degree constraint above in a partition is called 'satisfied' or 'co-satisfied,' respectively. After stating the NP-completeness of both problems, we study approximation results in two directions. We prove that maximizing the number of (co-)satisfied vertices in a bisection has no polynomial-time approximation scheme (unless P=NP), whereas constant approximation algorithms can be obtained in polynomial time. Moreover, minimizing the difference of the cardinalities of vertex classes in a bipartition that (co-)satisfies all vertices has no polynomial-time approximation scheme either.
Retrieving articulated 3-D models using medial surfaces
Authors: Kaleem Siddiqi, Juan Zhang, Diego Macrini, Ali Shokoufandeh, Sylvain Bouix, Sven Dickinson
Venue: Machine Vision and Applications (2008)

We consider the use of medial surfaces to represent symmetries of 3-D objects. This allows for a qualitative abstraction based on a directed acyclic graph of components and also a degree of invariance to a variety of transformations including the articulation of parts. We demonstrate the use of this representation for 3-D object model retrieval. Our formulation uses the geometric information associated with each node along with an eigenvalue labeling of the adjacency matrix of the subgraph rooted at that node. We present comparative retrieval results against the techniques of shape distributions (Osada et&#x00a0;al.) and harmonic spheres (Kazhdan et&#x00a0;al.) on 425 models from the McGill Shape Benchmark, representing 19 object classes. For objects with articulating parts, the precision vs recall curves using our method are consistently above and to the right of those of the other two techniques, demonstrating superior retrieval performance. For objects that are rigid, our method gives results that compare favorably with these methods.
Computational Fluid Dynamics Modeling of Intracranial Aneurysms
Authors: Jialiang Chen, Shengzhang Wang, Wei Yao, Guanghong Ding
Venue: Proceedings of the 2008 International Conference on BioMedical Engineering and Informatics - Volume 01 (2008)

Hemodynamic factors like the wall shear stress (wss) play an important role in the pathogenesis and treatment of intracranial aneurysms. In this article, we applied computational fluid dynamic analysis on one patient-specific model of cerebral aneurysm and connected vessels constructed from 3D rotational angiography in order to understand the properties of blood flow around aneurysms and wall shear stress. Our whole simulation process is based on a series of CFD commercial software packages that is easy for clinicians to implement such method and use it in their daily practice. From the patient model analyzed in this investigation, we find that the comparatively maximum WSS occurs near the root of the aneurysm, which leads to damage in the aneurysmal wall, and the maximum displacement is at the peak of the aneurysm.
Net-Centric Supply Chain Management Based on Interoperable Simulation
Authors: Agostino G. Bruzzone
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

Netcentric Management is an interesting concept, born in military environment, that today is very promising in supply chain management for its contribution in term of robustness and risk management; in this context it is possible to develop a real distributed control system and to share available resources and information of logistics networks; however the effective development of these concepts is strictly related to the creation of interoperable simulators dynamically integrated in the Supply Chain. In this context M&S (Modelling & Simulation) is the real technology enabler for moving these interesting concepts to real competitiveness advantage.This paper presents the use of simulation as tool for policy re-engineer and decision support system in the netcentric supply chain management.by proposing advanced solutions under experimentation in this area.
On the Relaxation of n-detect Test Sets
Authors: Stelios Neophytou, Maria K. Michael
Venue: Proceedings of the 26th IEEE VLSI Test Symposium (2008)

While defect oriented testing in digital circuits is a hard process, detecting a modeled fault more than one time has been shown to result in high defect coverage. Previous workshows that such test sets, known as n-detect test sets, are of increased quality for a number of common defects in deep sub-micron technologies. n-detect test generation methods usually produce fully specified test patterns. This limits their usage in a number of important applications such as low power test and test compression. This work proposes a systematic methodology for identifying a large number of bits that can be unspecified in an n-detect test set, while preserving the n-detection property, in contrast to any other existing test set relaxation method. The experimental results demonstrate that the number of specified bits in, even compact, n-detect test sets can be significantly reduced without any impact on the n-detect property.