ppxscal/embedding_network huggingface dataset:
Application of Spectral Exhaustive Method for Object Identification and Mapping Using EO-1 Hyperion Data
Authors: Yuanjin Xu, Guangdao Hu, Zhijun Chen
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

Due to the uncertainty of thresholds, different results are often obtained in object identification and classification of the same hyperspectral image. This paper presents a new approach to object identification based on the spectral exhaustive method (SEM). Each pixel spectrum in hyperspectral imagery has an optimal matching spectrum (OMS) among all possible spectra that are correlated with the study area by an algorithm for computing the maximal angle cosine or correlation coefficient. Hyperspectral image is mapped using OMS with different colors so that all pixels can be identified. Thus, the image becomes a color map in which those pixels corresponding to the same OMS have the same color. A gray map is created by calculating the correlation coefficient between each pixel spectrum and its OMS to determine the degree of match. This approach requires all possible reference spectra, mostly from the spectral library (built by us), and various pretreatments of the hyperspectral data. This approach was applied to an EO-1 Hyperion hyperspectral image of the Pulang area, Zhongdian county, Yunnan province, China, to obtain identification maps of the study area. Examination of the outlined objects in the map indicated that the SEM- based approach is effective. Keywords: Hyperspectral image; The spectral exhaustive method (SEM); Object identification.
Storage Resource Managers: Recent International Experience on Requirements and Multiple Co-Operating Implementations
Authors: Lana Abadie, Paolo Badino, Jean-Philippe Baud, Ezio Corso, Matt Crawford, Shaun De Witt, Flavia Donno, Alberto Forti, Akos Frohner, Patrick Fuhrmann, Gilbert Grosdidier, Junmin Gu, Jens Jensen, Birger Koblitz, Sophie Lemaitre, Maarten Litmaath, Dmitry Litvinsev, Giuseppe Lo Presti, Luca Magnoni, Tigran Mkrtchan, Alexander Moibenko, Remi Mollon, Vijaya Natarajan, Gene Oleynik, Timur Perelmutov, Don Petravick, Arie Shoshani, Alex Sim, David Smith, Massimo Sponza, Paolo Tedesco, Riccardo Zappi
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Storage management is one of the most important enabling technologies for large-scale scientific investigations. Having to deal with multiple heterogeneous storage and file systems is one of the major bottlenecks in managing, replicating, and accessing files in distributed environments. Storage Resource Managers (SRMs), named after their web services control protocol, provide the technology needed to manage the rapidly growing distributed data volumes, as a result of faster and larger computational facilities. SRMs are Grid storage services providing interfaces to storage resources, as well as advanced functionality such as dynamic space allocation and file management on shared storage systems. They call on transport services to bring files into their space transparently and provide effective sharing of files. SRMs are based on a common specification that emerged over time and evolved into an international collaboration. This approach of an open specification that can be used by various institutions to adapt to their own storage systems has proven to be a remarkable success -- the challenge has been to provide a consistent homogeneous interface to the Grid, while allowing sites to have diverse infrastructures. In particular, supporting optional features while preserving interoperability is one of the main challenges we describe in this paper. We also describe using SRM in a large international High Energy Physics collaboration, called WLCG, to prepare to handle the large volume of data expected when the Large Hadron Collider (LHC) goes online at CERN. This intense collaboration led to refinements and additional functionality in the SRM specification, and the development of multiple interoperating implementations of SRM for various complex multi-component storage systems.
On the device design assessment of multigate FETs (MuGFETs) using full process and device simulation with 3D TCAD
Authors: Muhammad Nawaz, Wolfgang Molzer, Stefan Decker, Luis-Felipe Giles, Thomas Schulz
Venue: Microelectronics Journal (2007)

A design evaluation is reported for multigate FETs (MuGFETs) by implementing a full process flow using a commercial three-dimensional technology CAD (TCAD) tool within the context of optimizing the device design and underlying fabrication processes. The simulation is based on and refers to the development of the SOI-based 30nm MuGFET devices. Using our real process flow, various process simulation parameters from diffusion and activation models are first calibrated to the experimental data. Device simulations are then performed with varying fin doping, fin width, fin height, L"d"d and halo implant tilt, and box thickness. For a given fin thickness and increasing fin height, the threshold voltage, off-current, delay and short channel effects (SCEs) remain approximately insensitive, while the on-current and transconductance increases approximately linearly with the increase in fin height. On the other hand drain-induced barrier lowering (DIBL), subthreshold slope (S) and off-current I"O"F"F are quite sensitive to the variations in fin width (at fixed fin height). We found that the lower L"d"d and halo implant tilt angle (20-30^o) are beneficial in reducing the SCEs and off-current. Finally, a comparison of the simulation results with electrical measurement data is presented, which shows fairly good agreement.
Proving the Correctness of Multiprocess Programs
Authors: L. Lamport
Venue: IEEE Transactions on Software Engineering (1977)

The inductive assertion method is generalized to permit formal, machine-verifiable proofs of correctness for multiprocess programs. Individual processes are represented by ordinary flowcharts, and no special synchronization mechanisms are assumed, so the method can be applied to a large class of multiprocess programs. A correctness proof can be designed together with the program by a hierarchical process of stepwise refinement, making the method practical for larger programs. The resulting proofs tend to be natural formalizations of the informal proofs that are now used.
Data Exchanging in Hierarchical Infostation Systems
Authors: Mazen Tlais, Frederic Weis
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

Infostation systems, based on pico-cells, provide intermittent but very high speed rates. Many problems appear because of discontinuous coverage and the mobile environment (mainly service disruptions). These problems directly affect applications performance. In this paper, we propose a hierarchical architecture that enables the network to resolve these problems. A new entity called access controller has been introduced and validated. Then, we focus on applications made possible using this architecture. Mainly, a distributed data storage model is described that proposes many classes of service to give more flexibility to users. Finally, we present a middleware adapted to the architecture that implements the storage model and class of services.
Improving dependability by revisiting operating system design
Authors: Francis M. David, Jeffrey C. Carlyle, Ellick M. Chan, Philip A. Reames, Roy H. Campbell
Venue: Proceedings of the 3rd workshop on on Hot Topics in System Dependability (2007)

Existing operating system (OS) designs provide inadequate isolation of user applications from errors that occur in OS services. If an error causes the failure of an OS service, all dependent applications are affected. The OS design described in this paper ameliorates this problem by reorganizing OS state in an effort to make OS services transparently restartable. This is achieved by partitioning application-related OS state into isolated per-application memory regions. Access to these memory regions is provided to OS services on a "need-to-know" basis when processing application requests. Applications are not allowed access to these memory regions for security. This design helps improve the dependability of the system.
A novel analytical model for switches with shared buffer
Authors: Zhenghao Zhang, Yuanyuan Yang
Venue: IEEE/ACM Transactions on Networking (TON) (2007)

Switches with a shared buffer have lower packet loss probabilities than other types of switches when the sizes of the buffers are the same. In the past, the performance of shared buffer switches has been studied extensively. However, due to the strong dependencies of the output queues in the buffer, it is very difficult to find a good analytical model. Existing models are either accurate but have exponential complexities or not very accurate. In this paper, we propose a novel analytical model called the Aggregation model for switches with shared buffer. The model is based on the idea of induction: first find the behavior of two queues, then aggregate them into one block; then find the behavior of three queues while regarding two of the queues as one block, then aggregate the three queues into one block; then aggregate four queues, and so on. When all queues have been aggregated, the behavior of the entire switch will be found. This model has perfect accuracies under all tested conditions and has polynomial complexity.
Concurrent Modified Square Contour Algorithm and Soft Decision-Directed Scheme for Blind Equalization
Authors: Shunlan Liu, Mingzeng Dai, Caiyi Lou
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 03 (2007)

A new blind equalization scheme is proposed based on concurrent modified square contour algorithm (MSCA) and a novel soft decision-directed (SDD) adaptation. This pro- posed blind equalization scheme (MSCA+SDD) may be viewed as operating a MSCA equalizer and a SDD equal- izer concurrently. The MSCA term provides good steady- state equalization performance and global convergence, moving the equalizer weight vector on the correct direc- tion; after the equalizer enters the fine local convergence region, the SDD term helps to accelerate convergence. The performance is measured for realistic microwave channel models and the simulation results demonstrate that both the MSCA+SDD and the MSCA have the same steady-state equalization performance, but the former has a faster con- vergence speed.
Short-Term Load Forecasting Based on Fuzzy C-Mean Clustering and Weighted Support Vector Machines
Authors: Guo-sheng Hu, Feng-feng Zhu, You-zhi Zhang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

In this paper, a new short-term load forecasting method is presented by conjunctive use of fuzzy C- mean clustering algorithm and weighted support vector machines(WSVMs). According to the similarity degree of input samples, the training samples are clustered, i.e., by means of the clustering of study samples the data possessed of homogenous characteristic are chosen and used as the input of forecast model, thus the consistency of data is intensified. It is obvious that newer data are more important for forecasting than older ones. So, according to time, we endow each data a weight factor si, and construct a new learning machines, named WSVMs for regression. Practical application results show that the proposed method can be used as an attractive and effective means for short-term load forecasting.
TILT detection of connectors using phase shifting
Authors: V. Retnasamy, Mani Maran Ratnam, K. Sundaraj, Zaliman Sauli
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

AVI's are playing important roles in quality inspection in the electronic industry. Most existing AVIs are single overhead camera and are incapable detecting 3D defects. This work presents solving the shortcoming stated using an angle fringe projection. This work was done using a noncollimated light source, whereas other researches on surface metrology usually used collimated light source. For precise surface or height measurements collimated light or laser source is commonly used., this work has demonstrated a successful manipulation of the non-collimated light source in height measurement by calibration of the illumination angle and development of the reference table.
Handwritten Signature Authentication Scheme using Integrated Statistical Analysis of Bi-Color Images
Authors: Debnath Bhattacharyya, Samir Kumar Bandyopadhyay, Deepsikha Choudhury
Venue: Proceedings of the The 2007 International Conference Computational Science and its Applications (2007)

In this paper, we propose data hiding, extraction and Handwritten Signature authentication algorithms for binary images. Handwritten Signature Image can be transmitted from source to target securely over network after processing the source image by using this proposed Data Hiding Algorithm. According to the algorithm, size of the carrier image must be double (or more) the size of source image. If necessary then additional bytes or noise needed to be injected into carrier image to attain the required size. To do this, the header is updated by the new value (sum of original size of file and amount of noise). There are numerous Biometric authentication methods also proposed. In this paper, we propose a novel and new alternative. Entire work can be divided into two phases- a. security on transmission; and b. Recognition and authentication. Our scheme supports the application environment and we strongly believe that "User Authentication by Statistical Analysis" could be a solid platform for future research and study. This proposed scheme could be applied for ownership protection, copy control, annotation and authentication of digital media. This work is focused on Authentication of Handwritten Signature.
Fault-Tolerant Computing Concepts and Examples
Authors: D. A. Rennels
Venue: IEEE Transactions on Computers (1984)

This paper presents a brief history of fault-tolerant computing. This is followed by a survey of architectural approaches to fault-tolerant design, emphasizing the basic concepts employed in the design of these systems, and the tradeoffs and alternatives available to the system designer in attempting to meet applications requirements. Classes of fault-tolerance applications are identified, along with design approaches which are applicable, and several problem areas are identified in which new research results are badly needed.
An adaptive communication architecture for wireless sensor networks
Authors: Adam Dunkels, Fredrik Österlind, Zhitao He
Venue: Proceedings of the 5th international conference on Embedded networked sensor systems (2007)

As sensor networks move towards increasing heterogeneity, the number of link layers, MAC protocols, and underlying transportation mechanisms increases. System developers must adapt their applications and systems to accommodate a wide range of underlying protocols and mechanisms. However, existing communication architectures for sensor networks are not designed for this heterogeneity and therefore the system developer must redevelop their systems for each underlying communication protocol or mechanism. To remedy this situation, we present a communication architecture that adapts to a wide range of underlying communication mechanisms, from the MAC layer to the transport layer, without requiring any changes to applications or protocols. We show that the architecture is expressive enough to accommodate typical sensor network protocols. Measurements show that the increase in execution time over a non-adaptive architecture is small.
A Model for Computer Configuration Design
Authors: K. S. Trivedi
Venue: Computer (1980)

The Lagrange multiplier method unravels the configuration design problem. It guarantees a global solution that optimizes device speeds and main memory size.
Generosity and gluttony in GEMS: grid enabled molecular simulations
Authors: J. M. Wozniak, P. Brenner, D. Thain, A. Striegel, J. A. Izaguirre
Venue: Proceedings of the High Performance Distributed Computing, 2005. HPDC-14. Proceedings. 14th IEEE International Symposium (2005)

Biomolecular simulations produce more output data than can be managed effectively by traditional computing systems. Researchers need distributed systems that allow the pooling of resources, the sharing of simulation data, and the reliable publication of both tentative and final results. To address this need, we have designed GEMS, a system that enables biomolecular researchers to store, search, and share large scale simulation data. The primary design problem is striking a balance between generosity and gluttony. On one hand, storage providers wish to be generous and share resources with their collaborators. On the other hand, an unchecked data producer can be gluttonous and easily replicate data unnecessarily until it fills all available space. To balance generosity and gluttony, GEMS allows both storage providers and data producers to state and enforce policies on the consumption of storage and the replication of data. By taking advantage of known properties of simulation data, the system is able to distinguish between high value final results that must be preserved and low value intermediate results that can be deleted and regenerated if necessary. We have built a prototype of GEMS on a cluster of workstations and demonstrate its ability to store new data, to replicate within policy limits, and to recover from failures.
Formal specification generator for KAOS: model transformation approach to generate formal specifications from KAOS requirements models
Authors: Hiroyuki Nakagawa, Kenji Taguchi, Shinichi Honiden
Venue: Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering (2007)

Formal methods and requirements analysis are techniques for developing complex systems. However, there is little research on reconciling the requirements phase with the formal specification phase. To bridge this gap, we propose a formal specification generator based on model transformation techniques. This tool transforms KAOS models (requirements specifications) into VDM++ formal specifications. Our generator enables consistent and effective software development activities.
SceBoost Learning Algorithm for Feature Selection
Authors: Min Zhang, Qingsheng Zhu, Feng Liu
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 01 (2007)

This paper proposes an improved boost learning algorithm, the SceBoost algorithm, and its application in developing fast and robust features for citrus canker detection by machine vision. The algorithm use symmetric cross entropy to eliminate redundancy among selected features using AdaBoost algorithm. Selected features are subjected to recognize citrus canker symptoms on given pictures of citrus foliage. Compared with related feature selection algorithm our method can get improvements in classification accuracy and significantly reduce computation time when reach the same requirements.
An Adaptive Diamond Searching Algorithm on Space-time Correlation
Authors: Yan-ni Wang, Yang-yu Fan
Venue: Proceedings of the Fourth International Conference on Image and Graphics (2007)

An adaptive diamond search algorithm is proposed for motion estimation algorithm of H.264 video compression standard, owing to the relationship between the quality of video and the running time of algorithm, using the motion vector of space-time correlation and center biased distribution in the neighboring images and in the same image. Based on the SAD of present point, forecast its motive type, reduce the searching range and numbers. Compared with other algorithms, experimental results showed that the time of motion estimation is reduced to 4ms and the PSNR is increased about 1.3dB by the adaptive diamond search algorithm.
Chaotic Ant Colony Algorithm for Preliminary Ship Design
Authors: Yan Jin, Yao Zhao
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 04 (2007)

This paper describes the improved chaotic ant colony algorithm (CACA) for the preliminary ship design. An optimization model for ship design has been identified as a problem with multiple local optima representing widely varying sets of designs. The model as developed handles the ship design optimization problem as a multivariable nonlinear optimization process and aims at a global optimum solution of the problem. Ant colony algorithm (ACA) is a multi-agent optimization algorithm, which simulates the foraging behavior of ants for solving various complex combinatorial optimization problems. The CACA is based on the ACA combined with multiple scale optimization and tabu search which can improve efficiently the deficiency of long searching time and sinking into local optima of simple ACA. This algorithm was tested on some standard test functions and satisfying results were obtained. After that an attempt on solving the preliminary ship design problem, it performance was observed to be in effect.
Formation of porous InP by cathodic decomposition
Authors: Zhankun Weng, Aimin Liu, Yanhong Liu, Huijing Luo, Feng Xu, Xiuping Liang, Guotong Du
Venue: Microelectronics Journal (2007)

Here we present a way to fabricate porous structure of InP by cathodic decomposition in a mixture of HCl and HNO"3. The direction of main pores was observed with a misorientation of ~8^o relative to [100]. Parallel side pores were grown on wall with a misorientation of ~54^o and ~43^o relative to [100] at -1.8 and -2.3V, respectively. If the applied potential becomes more negative, the side pores interconnected is more obvious. Most of the electrons are concentrated on tips of the pores due to field enhancement effects, which results in the prior decomposition of InP at the tips of the pores in the process. The growth of the main pore is along with electric field direction. The formation of nonsymmetrical side pores is also discussed in the article.
The implication problem for measure-based constraints
Authors: Bassem Sayrafi, Dirk Van Gucht, Marc Gyssens
Venue: Information Systems (2008)

We study the implication problem of measure-based constraints. These constraints are formulated in a framework for measures generalizing that for mathematical measures. Measures arise naturally in a wide variety of domains. We show that measure constraints, for particular measures, correspond to constraints that occur in relational databases, data mining applications, cooperative game theory, and in the Dempster-Shafer and possibility theories of reasoning about uncertainty. We prove that the implication problem for measure constraints is in general decidable. We introduce inference systems for particular classes of measure constraints and show that some of these are complete, yielding tractability for the corresponding implication problem.