ppxscal/embedding_network huggingface dataset:
Analysis of PVT composite structure images using a search through algorithm
Authors: Nidal F. Shilbayeh, Mahmoud Z. Iskandarani
Venue: Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation (2006)

An effective NDT (Non-Destructive Testing) image analysis technique for detecting materials damage and defects existence has been developed successfully and applied to PVT images of composite structures. The developed technique is based on converting an image to its equivalent pixel values and then applying Search Through (ST) algorithm to the converted image such that the presence of damage in the composite structure and its extent can be easily verified. The technique has a novel approach to data analysis by employing intensity, RGB signal re-mix and wavelength variation of a thermally generated IR-beam onto the specimen under test which can be sensed and displayed on a computer screen as an image. Specimen inspection and data analysis are carried out through pixel level re-ordering and shelving techniques within a transformed image file using a sequence grouping and regrouping software system, which is specifically developed for this work.
"Large" abstractions for software engineering
Authors: Dewayne E. Perry
Venue: Proceedings of the 2nd international workshop on The role of abstraction in software engineering (2008)

Abstraction is one of the primary intellectual tools we have for managing complexity in software systems. When we think of abstractions we usually think about "small" abstractions, such as data abstraction (parameterization), type abstraction (polymorphism) and procedural or functional abstraction. These are the everyday kinds of things we work with - finding the right concepts to make the expression of our software solutions easier to understand and easier to reason about. Here I propose we thing about "large" abstractions - abstractions that provide critical distinctions about our field of software engineering as a whole; abstractions that enable us to see what we do in different and important ways and provide significant improvements in how we do software engineering. I give a number of examples and delineate why I think they have been, and still are, important.
Adaptive Geometry Image
Authors: Chih-Yuan Yao, Tong-Yee Lee
Venue: IEEE Transactions on Visualization and Computer Graphics (2008)

We present a novel post-processing utility called adaptive geometry image (AGIM) for global parameterization techniques that can embed a 3D surface onto a rectangular1 domain. This utility first converts a single rectangular parameterization into many different tessellations of square geometry images(GIMs) and then efficiently packs these GIMs into an image called AGIM. Therefore, undersampled regions of the input parameterization can be upsampled accordingly until the local reconstruction error bound is met. The connectivity of AGIM can be quickly computed and dynamically changed at rendering time. AGIM does not have T-vertices and therefore no crack is generated between two neighboring GIMs at different tessellations. Experimental results show that AGIM can achieve significant PSNR gain over the input parameterization, AGIM retains the advantages of the original GIM and reduces the reconstruction error present in the original GIM technique. The AGIM is also very useful and suitable for global parameterization techniques based on quadrilateral complexes. Using the approximate sampling rates, the PolyCube-based quadrilateral complexes with AGIM can outperform state-of-the-art multi-chart geometry image technique in terms of PSNR.
A parallel dynamic compiler for CIL bytecode
Authors: Simone Campanoni, Giovanni Agosta, Stefano Crespi Reghizzi
Venue: ACM SIGPLAN Notices (2008)

Multi-core technology is being employed in most recent high-performance architectures. Such architectures need specifically designed multi-threaded software to exploit all the potentialities of their hardware parallelism. At the same time, object code virtualization technologies are achieving a growing popularity, as they allow higher levels of software portability and reuse. Thus, a virtual execution environment running on a multi-core processor has to run complex, high-level applications and to exploit as much as possible the underlying parallel hardware. We propose an approach that leverages on CMP features to expose a novel pipeline synchronization model for the internal threads of the dynamic compiler. Thanks to compilation latency masking effect of the pipeline organization, our dynamic compiler, ILDJIT, is able to achieve significant speedups (26% on average) with respect to the baseline, when the underlying hardware exposes at least two cores.
Peers and Spheres of Influence: Situating Rob Kling
Authors: Blaise Cronin, Debora Shaw
Venue: The Information Society (2007)

In this article we employ a number of bibliometric techniques to capture Rob Kling's intellectual impact and influences over the course of his varied career. We analyze his many publications in terms of type, topic, impact, and rate of co-authorship. We provide a detailed deconstruction of his citation identity (all those scholars whom he cited) and also his citation image makers (all those scholars who cited his work). In addition, we analyze acknowledgment data to gain deeper insights into the sociocognitive networks that sustained, and were sustained by Kling throughout his career.
Face recognition using HOG-EBGM
Authors: Alberto Albiol, David Monzo, Antoine Martin, Jorge Sastre, Antonio Albiol
Venue: Pattern Recognition Letters (2008)

This paper presents a new face recognition algorithm based on the well-known EBGM which replaces Gabor features by HOG descriptors. The recognition results show a better performance of our approach compared to other face recognition approaches using public available databases. This better performance is explained by the properties of HOG descriptors which are more robust to changes in illumination, rotation and small displacements, and to the higher accuracy of the face graphs obtained compared to classical Gabor-EBGM ones.
Energy-aware compilation for wireless sensor networks
Authors: Daniel A. Sadilek
Venue: Proceedings of the 2nd international workshop on Middleware for sensor networks (2007)

An application for a reconfigurable virtual machine for wireless sensor networks consists of both bytecode and native code. Identifying the abstraction boundary between byte-code and native code has not been addressed systematically, yet. Up to now, a programmer has to specify the abstraction boundary manually without being able to judge his decision. We present a mathematical model for benchmarking the energy consumption of bytecode and native code. This model allows a founded specification of the abstraction boundary. In conjunction with an extended reconfigurable virtual machine architecture, it provides a flexible development method with less development effort than existing approaches.
A reinvestigation of robust scale estimation in finite samples
Authors: John A. Randal
Venue: Computational Statistics Data Analysis (2008)

This paper reworks and expands on the results of existing simulation studies, investigating the performance of various robust estimators of scale for Tukey's three corner distributions. We focus attention on the popular biweight A-estimator, but also propose a new estimator based on the Student's t-distribution, which attains an efficiency close to that of the A-estimator. We investigate the use of more efficient auxiliary location and scale estimators in two-pass estimators such as the A- and t-estimators, and find overall efficiency can be improved. Using much larger simulation sizes than previous studies, significant departures from existing efficiencies are obtained, and these lead to different recommendations for estimation.
Data Compression and Linear Modeling
Authors: Soosan Beheshti
Venue: Proceedings of the Data Compression Conference (2008)

This paper addresses problem of data compression when partial information on data structure is available and optimum code is known to be among a set of given parametric codes. The goal of the proposed method is to choose the optimum parametric code by using an observed finite length data that is generated by an unknown parameter. We provide a new approach that compares estimates of different order among the given parametric codes and chooses the one with minimum probabilistic worst-case average codelength (ACL).
Normative-informational positions: a modal-logical approach
Authors: Andrew J. I. Jones, Xavier Parent
Venue: Artificial Intelligence and Law (2008)

This paper is a preliminary investigation into the application of the formal-logical theory of normative positions to the characterisation of normative-informational positions, pertaining to rules that are meant to regulate the supply of information. First, we present the proposed framework. Next, we identify the kinds of nuances and distinctions that can be articulated in such a logical framework. Finally, we show how such nuances can arise in specific regulations. Reference is made to Data Protection Law and Contract Law, among others. The proposed approach is articulated around two essential steps. The first involves identifying the set of possible interpretations that can be given to a particular norm. This is done by using formal methods. The second involves picking out one of these interpretations as the most likely one. This second step can be resolved only by using further information (e.g., the context or other parts of the regulation).
Comparing design and code metrics for software quality prediction
Authors: Yue Jiang, Bojan Cuki, Tim Menzies, Nick Bartlow
Venue: Proceedings of the 4th international workshop on Predictor models in software engineering (2008)

The prediction of fault-prone modules continues to attract interest due to the significant impact it has on software quality assurance. One of the most important goals of such techniques is to accurately predict the modules where faults are likely to hide as early as possible in the development lifecycle. Design, code, and most recently, requirements metrics have been successfully used for predicting fault-prone modules. The goal of this paper is to compare the performance of predictive models which use design-level metrics with those that use code-level metrics and those that use both. We analyze thirteen datasets from NASA Metrics Data Program which offer design as well as code metrics. Using a range of modeling techniques and statistical significance tests, we confirmed that models built from code metrics typically outperform design metrics based models. However, both types of models prove to be useful as they can be constructed in different project phases. Code-based models can be used to increase the performance of design-level models and, thus, increase the efficiency of assigning verification and validation activities late in the development lifecycle. We also conclude that models that utilize a combination of design and code level metrics outperform models which use either one or the other metric set.
Adaptive filtering for selective subband transmission based on interference detection
Authors: Pingzhou Tu, Xiaojing Huang, Eryk Dutkiewicz
Venue: Proceeding of the 1st ACM international workshop on Heterogeneous sensor and actor networks (2008)

In a shared radio spectrum environment, multiple systems may interfere with each other. In this paper we propose an adaptive filtering method to suppress interference and select the most suitable subbands according to predetermined interference thresholds. Two methods to determine these interference thresholds in Gaussian and multipath fading channels are introduced. The adaptive filtering method enables a system to dynamically use frequency subbands without employing frequency hopping techniques. The flexible received signal bandwidth with different number of subbands provides great potential for systems to coexist with each other, resulting in higher spectrum utilization efficiency. To verify the ectiveness of the proposed adaptive filtering method, the system bit error rates (BERs) under different interference conditions are simulated and compared.
Every polynomial-time 1-degree collapses iff P=PSPACE
Authors: S. A. Fenner, S. A. Kurtz
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

A set A is m-reducible (or Karp-reducible) to B if and only if there is a polynomial-time computable function f such that for all x, x in A if and only if f(x) in B. Two sets are 1-equivalent if each is m-reducible to the other by one-one reductions; p-invertible equivalent iff each is m-reducible to the other by one-one, polynomial-time invertible reductions; and p-isomorphic iff there is an m-reduction from one set to the other that is one-one, onto, and polynomial-time invertible. It is proved that the following statements are equivalent: (1) P=PSPACE. (2) Every two 1-equivalent sets are p-isomorphic. (3) Every two p-invertible equivalent sets are p-isomorphic.
Towards software defined radios using coarse-grained reconfigurable hardware
Authors: Gerard K. Rauwerda, Paul M. Heysters, Gerard J. M. Smit
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

Mobile wireless terminals tend to become multimode wireless communication devices. Furthermore, these devices become adaptive. Heterogeneous reconfigurable hardware provides the flexibility, performance, and efficiency to enable the implementation of these devices. The implementation of a wide-band code division multiple access and an orthogonal frequency division multiplexing receiver using the same coarse-grained reconfigurable MONTIUM tile processor is discussed. Besides the baseband processing part of the receiver, the same reconfigurable processor has also been used to implement Viterbi and Turbo channel decoders.
The Study of Metal Resource Management Module and Process by Analyzing Information
Authors: Sungmo Jung, Seoksoo Kim
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Following the trend of constructing high rise and multi-complex buildings, the importance of resource management from the aspect of construction project management is being emphasized. Metal work resources are critical in most of construction projects, it became a target for special management. However, existing improvement measures for resource management are merely concentrating on the document automation only. In addition, such improvements rarely benefit metal millwork management. Therefore, the study has determined work process of metal work resource management, for the metal millwork is one of the most important construction materials in most of construction projects, and proposed a web based module for improving such management task.
Design of a CMOS on-chip high voltage generator
Authors: M. Zhang, N. Llaser, J.-A. Esclafer De La Rode
Venue: Proceedings of the 9th International Conference on Circuits (2005)

In this paper, an original CMOS on-chip high voltage generator has been proposed. Having a hybrid charge pump structure, this high voltage generator benefits advantages of two charge pumps used and allows obtaining an output voltage that neither of the two charges pumps can reach individually. Simulation results show that an output voltage as high as 41V, which is inferior to the breakdown voltage of the 0.8µ CMOS process used.
A new framework for understanding educational digital library use: re-examining digital divides in U.S. schools
Authors: Marcia A. Mardis, Ellen S. Hoffman, Todd E. Marshall
Venue: International Journal on Digital Libraries (2008)

Despite their decade of deployment, educational digital libraries have not achieved sustained use in elementary and secondary schools in the United States. Barriers to accessing the Internet and computers have been widely targeted by myriad initiatives, but efforts aimed at bridging this first-level &#x201c;digital divide&#x201d; have not led to increased use of the Internet and digital library resources in U.S. classrooms. In fact, such programs have revealed additional divides that affect educators&#x2019; use. This paper examines the additional digital divide levels and proposes a new framework for understanding technology innovation in schools that can improve development and outreach approaches by digital library developers.
Evolutionary Classifier Fusion for Optimizing Face Recognition
Authors: Suman Sedai, Phill Kyu Rhee
Venue: Proceedings of the 2007 Frontiers in the Convergence of Bioscience and Information Technologies (2007)

In this paper evolutionary classifier fusion method is used to optimize the performance of face recognition system. Initially different illumination environments are modeled as multiple contexts using unsupervised learning and then optimized classifier ensemble are searched for each context using Genetic Algorithm (GA). For each context multiple optimized classifiers are searched each of which are referred as context based classifier. Then evolutionary framework of combination of such classifiers is applied to optimize the face recognition as a whole. Evolutionary classifier fusion is compared with the single classifier system.Experiment is done using real time Inha database and FERET database. Experimental results show that the proposed multiple context based fusion method gives superior performance than the method without using fusion and optimize face recognition performance.
A new polyphase mixed-mode bandpass filter section using current-feedback operational amplifiers
Authors: Muhammad Taher Abuelma'atti, Sa'ad Muhammad Al-Shahrani
Venue: Proceedings of the 9th International Conference on Circuits (2005)

A new polyphase mixed-mode filter using commercially available integrated circuits is presented. The circuit uses two current-feedback operational amplifiers, four grounded resistors and two grounded capacitors. The proposed circuit enjoys independent grounded-resistance control of its parameters. Simulation results using are included.
On-line load balancing
Authors: Y. Azar, A. Z. Broder, A. R. Karlin
Venue: Proceedings of the 33rd Annual Symposium on Foundations of Computer Science (1992)

The setup for the authors' problem consists of n servers that must complete a set of tasks. Each task can be handled only by a subset of the servers, requires a different level of service, and once assigned can not be re-assigned. They make the natural assumption that the level of service is known at arrival time, but that the duration of service is not. The on-line load balancing problem is to assign each task to an appropriate server in such a way that the maximum load on the servers is minimized. The authors derive matching upper and lower bounds for the competitive ratio of the on-line greedy algorithm for this problem, namely /sup (3n)2/3///sub 2/(1+o(1)), and derive a lower bound, Omega ( square root n), for any other deterministic or randomized on-line algorithm.
Patterns in soil quality: Natural geochemical variability versus anthropogenic impact in soils of Zeeland, The Netherlands
Authors: P. F. M. van Gaans, J. Spijker, S. P. Vriend, J. N. de Jong
Venue: International Journal of Geographical Information Science (2007)

We demonstrate a structured approach to identify natural as well as anthropogenic geochemical patterns in sedimentary soils, using statistical techniques that increase in complexity and the requirements for auxiliary data. Comparison with the average upper continental crust identified natural regional features, such as a relative enrichment of As, due to a low-lying deltaic environment, and of Cr and Zr, related to a specific heavy mineral association. Identification of diffuse contamination is best achieved by comparison with a local reference. The Zeeland subsoil is shown to have undergone only minor anthropogenic influence and to serve this purpose very well. A topsoil-subsoil comparison revealed anthropogenic enrichments for Cd, Cu, P, Pb, S, Sb, Sn, Zn, and partly for As, while typically 'non-anthropogenic' trace elements like Cs, Ga, La, and Rb were found not to be enriched. Except for P and S, the enriched components show a good correlation with Al2O3, a proxy for clay mineralogy, and a bivariate topsoil-subsoil comparison is made using a trimmed Reduced Major Axis regression. Two subregions are identified with different associations (Zn, Pb, and Cd, versus As, Cd, Cu, and Sn) of higher-than-average enrichments.
Retrenching the Purse: Hashing Injective CLEAR Codes, and Security Properties
Authors: Richard Banach, Michael Poppleton, Czeslaw Jeske, Susan Stepney
Venue: Proceedings of the Second International Symposium on Leveraging Applications of Formal Methods, Verification and Validation (2006)

The Mondex Electronic Purse is an outstanding example of industrial scale formal refinement, and was the first verification to achieve ITSEC level E6 certification. A formal abstract model and a formal concrete model were developed, and a formal refinement was hand-proved between them. Nevertheless, certain requirements issues were set beyond the scope of the formal development, or handled in an unnatural manner. The retrenchment Tower Pattern is used to address one such issue in detail: the use of a hash function rather than a total injective function when clearing the highly constrained purse logs. A retrenchment is constructed from the lowest level model to a model using a hash, and is then lifted to create two refinement developments, working at different levels of detail, and connected via retrenchments. The tower development is appropriately validated, vindicating the design used.
Difference approximation of Hamilton Jacobi equation convergence
Authors: Andrzej Nowakowski, Iwona Nowakowska
Venue: Proceedings of the 9th WSEAS International Conference on Systems (2005)

The aim of the paper is to describe numerical approximation of the difference Hamilton-Jacobi inequality -2ε ≤ Sε(t+h)-Sε(t,x)/h + H(t,x,-Sεx(t,x)) ≤ ε, and to prove its convergence. We find, by numerical construction, a function Sε(t,x) which satisfies the above inequality. The method applied in the paper bases on the constructions described in [1] for Bolza problem and significently extended in [3].
Integrated use of remote sensing and geographic information systems in riparian vegetation delineation and mapping
Authors: X. Yang
Venue: International Journal of Remote Sensing (2007)

This paper presents a pilot study on riparian vegetation delineation and mapping using remote sensing and geographic information systems (GIS) in the Hunter Region, Australia. The aim of the study was to develop appropriate and repeatable assessment and mapping techniques to quantify the extent of riparian vegetation within the region. Ortho-rectified digital aerial photographs, SPOT-4 multispectral (XS) and Landsat-7 ETM+ images were tested to delineate the riparian vegetation and to develop a quantifiable and repeatable method of mapping the extent of that vegetation. Image processing techniques such as parallelepiped classification, tasselled cap transformation, and vegetation index clustering were used in an attempt to delineate riparian vegetation from remotely sensed images. Specific GIS analysis techniques were used for riparian zone buffering and segmentation, vegetation cover estimation, and mapping. Specific GIS scripts were developed for those processes so that they were automatic, fast, and repeatable. Various vegetation indices (VI) were evaluated and compared for their ability to discriminate riparian vegetation and its extent. The riparian vegetation was assessed and mapped at designed segmental interval (e.g. 1 km) with polygon and lineal representations. The classification accuracy was assessed against field observation and air photo interpretation (API). The overall accuracy of the photo-based classification was about 81%, SPOT-4 63%, and Landsat-7 ETM+ 53%. Statistic analysis shows that there is little agreement between photo-based classification and that from satellite imagery.