ppxscal/embedding_network huggingface dataset:
Local adaptive de-noising techniques in transform domain for EMCG de-noising
Authors: H. Oktem
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

There are various de-noising algorithms and optimization methods for different signal and noise characteristics. However, the signals used in real application may deviate from the model. For example: signal and/or noise may not be stationary or a proper model for them may nor be available. MCG (magnetocardiography) is an example signal, where conventional de-noising methods are not giving satisfactory results. Local adaptive processing allows to modify filtering parameters according to the specific properties of different "portions" of a signal. In this paper a methodology for adopting the transform domain local adaptive processing to the specific task of MCG signal de-noising is introduced.
Empirical Analysis of Libs Images for Ovarian Cancer Detection
Authors: Claude Tameze, Robert Vincelette, Noureddine Melikechi, Vesna Zeljkovic, Ebroul Izquierdo
Venue: Proceedings of the Eight International Workshop on Image Analysis for Multimedia Interactive Services (2007)

To develop a way to detect early epithelial ovarian cancer we expose blood samples to a laser. Using Laser induced breakdown spectroscopy, (LIBS) plasma images of the blood samples are generated and analyzed. In this paper we compare the images from blood specimens of cancer free mice to those of transgenic mice; that is, mice that are currently developing epithelial ovarian cancer and are approximately the same age as the disease free mice. Our ultimate goal is to look for changes in the shape and edges of the image that might indicate the presence of cancer.To analyze the images we use a nonlinear diffusion filter for enhancement of relevant image edges and removal of noise and irrelevant texture.
Multi-Projector Seamless Display System Based on PC-Cluster
Authors: Lingyun Yu, Cui Yu, Yigang Wang
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

A large display system usually consists of many projectors, whose projections are merged together to form a large screen. In this paper, we discuss technologies to join multiple projections into a large display system for multimedia entertainment and virtual reality applications. In contrast to using expensive hardware-based seamlessly merging modules, we adopt a software-based seamlessly merging solution, which is used to calibrate the color brightness and the geometry in superposed regions. And in order to enlarging its application, we adapt technology to several kinds of screens (plane screen and camber screen). We use PC cluster with accelerated graphics cards to lower rendering costs. Our software merge system can run on a variety of large display platforms. The experiment shows our system obtain the satisfying results. It can seamlessly play videos with different encoding formats, such as avi, wmv, rm etc, and can seamlessly render 3D scenes in real time.
Executing Large Parameter Sweep Applications on a Multi-VO Testbed
Authors: Shahaan Ayyub, David Abramson, Colin Enticott, Slavisa Garic, Jefferson Tan
Venue: Proceedings of the Seventh IEEE International Symposium on Cluster Computing and the Grid (2007)

Applications that span multiple virtual organizations (VOs) are of great interest to the eScience community. However, recent attempts to execute large-scale parameter sweep applications (PSAs) with the Nimrod/G tool have exposed problems in the areas of fault tolerance, data storage and trust management. In response, we have implemented a task-splitting approach, which breaks up large PSAs into a sequence of dependent subtasks, improving fault tolerance; provides a garbage collection technique, which deletes unnecessary data; and employs a trust delegation technique that facilitates flexible third party data transfers across different VOs.
Impurity Heat Capacity and its Relation to Entanglement in Dilute Magnetic Alloys
Authors: J. Maćkowiak
Venue: Open Systems Information Dynamics (2007)

Using an asymptotic solution of the thermodynamics of a dilute s-d system comprising M magnetic impurities interacting with the electron gas, the impurity energy and impurity heat capacity ΔC(T) are derived for dilute magnetic alloys with spin 1/2 and spin 3/2 impurities. ΔC(T) can be viewed as a measure of entanglement between impurities and electrons in a dilute magnetic alloy. The parameters which enter ΔC are adjusted to fit experimental data on impurity heat capacity of CuCr and (La1-x Ce x ) Al2. Agreement is satisfactory for CuCr, at temperatures below 1K, and good for (La1-x Ce x ) Al2. The magnitude of theoretical ΔC(T) agrees with experiment and does not require scaling as in previous s-d theories. Nonlinear dependence of ΔC(T) on impurity concentration has been accounted for the first time.
On approximate triangular decompositions in dimension zero
Authors: Marc Moreno Maza, Greg Reid, Robin Scott, Wenyuan Wu
Venue: Journal of Symbolic Computation (2007)

Triangular decompositions for systems of polynomial equations with n variables, with exact coefficients, are well developed theoretically and in terms of implemented algorithms in computer algebra systems. However there is much less research concerning triangular decompositions for systems with approximate coefficients. In this paper we discuss the zero-dimensional case of systems having finitely many roots. Our methods depend on having approximations for all the roots, and these are provided by the homotopy continuation methods of Sommese, Verschelde and Wampler. We introduce approximate equiprojectable decompositions for such systems, which represent a generalization of the recently developed analogous concept for exact systems. We demonstrate experimentally the favorable computational features of this new approach, and give a statistical analysis of its error.
Proceedings of the 7th ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering
Venue: Workshop on Program Analysis for Software Tools and Engineering (2007)

This volume contains the papers presented at the 7th ACM SIGPLAN-SIGSOFT Workshop on Program Analysis for Software Tools and Engineering. This edition of PASTE is co-located with PLDI, which in turn is part of FCRC 2007, held in San Diego, CA in June 2007. As in previous years, the goal of PASTE remains to bring together researchers and practitioners of program analysis techniques, with a particular eye on the application of these techniques to software engineering tasks. We received 35 submissions from around the world, of which we accepted 11. We rejected 2 papers that were well beyond the prescribed page limit; each remaining paper was reviewed by 3 PC members. In some cases we solicited additional reviews from independent experts. In particular, we would like to thank Jeffrey Foster, Ondrej Lhotak, Koushik Sen, Tim Sherwood, and Clark Verbrugge. We thank the PC for their diligence with the review process. This year, we chose to solicit proposals for one-hour research-group presentations in lieu of invited talks. Each presentation includes an overview of a research direction followed by a few short presentations on particular aspects of the work. We received 4 strong submissions, and the PC chose to accept all 4. We believe this format achieves many goals including fostering a workshop atmosphere aligned with the interests of the community, providing agenda-oriented talks typically seen only with invited speakers, and giving students an opportunity to present work as part of a larger research program. We thank the presenters for embracing this new format, and we look forward to their presentations at the workshop.
Visualization of Knowledge Structures
Authors: Xia Lin, Dongming Zhang
Venue: Proceedings of the 11th International Conference Information Visualization (2007)

In this article, Visual Concept Explorer (VCE), a concept mapping tool, is introduced and its design principles are described. VCE creates dynamic concept maps for the user and facilitates user's visual interaction to concepts and documents. Its central idea is to make implicit knowledge structures explicit. As an example of practical knowledge mapping application, VCE has characteristics of both information visualization and knowledge visualization.
Coloured solutions of equations in finite groups
Authors: Éric Balandraud
Venue: Journal of Combinatorial Theory Series A (2007)

In this article, we consider the relations between colourings and some equations in finite groups. We will express relations linking the numbers of the differently coloured solutions of an equation that depend only on the cardinality of the colouring and not on the distribution of the colours. This gives a link between Ramsey theory that investigates the existence of monochromatic solutions and what is now called anti-Ramsey theory that investigates the existence of rainbow solutions. Both theories are in expansion. We will apply these results to the counting of rainbow 3-term arithmetic progressions in any abelian group with equinumerous three-colouring and to the counting of points on a conic defined on a finite field. We will end by discussing the generalised case of a system of equations.
A unified platform for archival description and access
Authors: Christopher J. Prom, Christopher A. Rishel, Scott W. Schwartz, Kyle J. Fox
Venue: Proceedings of the 7th ACM/IEEE-CS joint conference on Digital libraries (2007)

The archival community has developed content and data structure standards to facilitate access to the diverse and unique sets of archival records, personal papers, and manuscript collections that are held by archival repositories and special collections libraries. However, these standards are difficult for archivists to use and are often implemented in ways that negatively affect materials-handling workflows, depriving archival users of the best possible access to the totality of materials available within an individual repository. The authors propose that archival descriptive problems can be addressed by implementing a web/database application that is tailored specifically to archival needs and can be implemented with little technical knowledge. This paper describes the system architecture of one such tool, the Archon software package, which was developed at the University of Illinois at Urbana-Champaign. Archon automates many technical tasks, such as producing a searchable website, an EAD instance or a MARC record. Although the system utilizes sophisticated algorithms and optimizations, it is easily extensible because most development takes place in an easy-to-use, object-oriented environment.
Sketch interpretation using multiscale stochastic models of temporal patterns
Authors: Randall Davis
Venue:  (2006)

Sketching is a natural mode of interaction used in a variety of settings. For example, people sketch during early design and brainstorming sessions to guide the thought process; when we communicate certain ideas, we use sketching as an additional modality to convey ideas that can not be put in words. The emergence of hardware such as PDAs and Tablet PCs has enabled capturing freehand sketches, enabling the routine use of sketching as an additional human-computer interaction modality. But despite the availability of pen based information capture hardware, relatively little effort has been put into developing software capable of understanding and reasoning about sketches. To date, most approaches to sketch recognition have treated sketches as images (i.e., static finished products) and have applied vision algorithms for recognition. However, unlike images, sketches are produced incrementally and interactively, one stroke at a time and their processing should take advantage of this. This thesis explores ways of doing sketch recognition by extracting as much information as possible from temporal patterns that appear during sketching. We present a sketch recognition framework based on hierarchical statistical models of temporal patterns. We show that in certain domains, stroke orderings used in the course of drawing individual objects contain temporal patterns that can aid recognition. We build on this work to show how sketch recognition systems can use knowledge of both common stroke orderings and common object orderings. We describe a statistical framework based on Dynamic Bayesian Networks that can learn temporal models of object-level and stroke-level patterns for recognition. Our framework supports multi-object strokes, multi-stroke objects, and allows interspersed drawing of objects---relaxing the assumption that objects are drawn one at a time. Our system also supports real-valued feature representations using a numerically stable recognition algorithm. We present recognition results for hand-drawn electronic circuit diagrams. The results show that modeling temporal patterns at multiple scales provides a significant increase in correct recognition rates, with no added computational penalties. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Estimating the entropy of a signal with applications
Authors: J.-F. Bercher
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 03 (1999)

We present an estimator of the entropy of a signal. The basic idea is to adopt a model of the probability law, in the form of an AR spectrum. Then, the law parameters can be estimated from the data. We examine the statistical behavior of our estimates of laws and entropy. Finally, we give several examples of applications: an adaptive version of our entropy estimator is applied to detection of law changes, blind deconvolution and sources separation.
Simulation model of the LS-DRMTA adaptive algorithm for multiple antenna system for DS-CDMA
Authors: Lei Jin, Z. Salcic, C. F. Mecklenbrauker
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

We present the development of a simulation model and for a conceptual DS-CDMA system and simulation baseband models for the least-square despread respread multitarget array (LS-DRMTA) algorithm with two, four and six antenna elements in the Matlab/Simulink environment. The models are used to compare the performance of single and multiple adaptive antenna systems in an AWGN channel. The simulation models show the clear advantage of multiple antenna systems and represent a first step towards their implementation on an FPGA platform.
Teamed courses: two case studies
Authors: M. Bowman
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

One of the major struggles in launching a new degree option is having a critical mass of students to fill new courses. Five courses have been created for the new degree of Computer Integrated Manufacturing Technology Electronics Manufacturing Option offered by the Purdue School of Engineering and Technology, USA. Although industry is very interested in these courses, enrollment in the courses has been a real concern. Two of the new Electronics Manufacturing II (EET M200) and Techniques for Electronics Manufacturing (IET 240) have been teamed with existing courses to ease the enrollment concerns. Lectures are combined for the teamed courses, thus solving the enrollment concerns. Each course has separate laboratories and projects are coordinated so that students in different courses have very different experiences. This ensures that students sitting in the same lecture can learn content different enough to warrant unique course numbers.
Mining Frequent Induced Subtree Patterns with Subtree-Constraint
Authors: Lei Zou, Yansheng Lu, Huaming Zhang, Rong Hu
Venue: Proceedings of the Sixth IEEE International Conference on Data Mining - Workshops (2006)

Mining frequent induced subtree patterns is very useful in domains such as XML databases, web log analyzing. However, because of the combinatorial explosion, mining all frequent subtree patterns becomes infeasible for a large and dense tree database. And too many frequent subtree patterns also confuse users. Usually only a small set of the mining results can arouse users' interests. In this paper, we propose a problem to discover frequent induced subtree patterns that are super trees of a given pattern tree specified by users, i.e. frequent induced subtree patterns with subtree-constraint. Most existing frequent subtree mining algorithms are based on right-most extension, which does not work well in the new problem. So free extension is presented to replace right-most extension in this paper. To avoid the duplicate pattern problem caused by free extension, we develop an efficient method that ensures no duplicate patterns in mining process or results. Then Subtree- Constraint Frequent Subtree Patterns Mining Algorithm, i.e.SCFS algorithm, is given. The experiment results also show that our algorithm achieves good performance.
Digit-serial modular multiplication using skew-tolerant domino CMOS
Authors: S. Kim
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 200. on IEEE International Conference - Volume 02 (2001)

A novel connection between digit-serial computing and skew-tolerant domino circuit design is developed and applied to the design of a 512-bit modular multiplier. In our design, a digit size of four bits is efficiently mapped onto a four-phase overlapping clocking scheme, so that four bits are processed during each full clock cycle. Our architecture is based on a modified interleaved multiplication algorithm and uses precomputed complements of the modulus and a carry save adder scheme. We also present a technique for modeling the time borrowing behavior in skew-tolerant domino using a VHDL behavioral description. This allows very large skew-tolerant domino circuits to be simulated efficiently in such a way that the essential time borrowing behavior is correctly represented. This simulation methodology is used to verify the correctness of our design and to determine its throughput.
Level topologies of fuzzifying topological linear spaces and their applications
Authors: Cong-Hua Yan
Venue: Fuzzy Sets and Systems (2007)

In this paper, some properties of level topologies of fuzzifying topological linear spaces are discussed. Then the characterizations of fuzzy boundedness and fuzzy precompactness are obtained. They may be considered as reply to the problem suggested by Qiu [Fuzzifying topological linear spaces, Fuzzy Sets and Systems 147 (2004) 249-272]. As applications, in Menger probabilistic normed spaces with respect to t-norm minimum, unified fuzzifying topological characterizations of probabilistic bounded, probabilistic semi-bounded, probabilistic unbounded sets, and probabilistic precompact, probabilistic semi-precompact, probabilistic unprecompact sets are proved, respectively.
Understanding the complex chemistry of fluorocarbon plasmas in a long residence time icp reactor
Authors: Matthew J. Goeckner, Lawrence J. Overzet
Venue:  (2006)

The motivation behind this research is to understand the influence of plasma surface interactions on the gas phase chemistry and surface kinetics of polymerizing fluorocarbon plasmas. In order to achieve this, a modified GEC reference ICP reactor is used with in situ diagnostic tools like multipass Fourier transformed infrared (FTIR) spectroscopy, optical emission spectroscopy (OES) used in an actinometry mode, ellipsometry and self bias probe. A long residence time of 5.2 s was employed to maximize plasma surface interactions and electron impact collisions. This research is divided into three interdependent sections. In the first section a global gas phase model illustrating the gain and loss mechanisms of different fluorocarbon radicals and neutrals qualitatively and quantitatively as a function of source to chuck gap and feed gas stoichiometry has been developed. No bias is applied in that study. An upper bound translational temperature model is also developed. In the second section, a global model describing deposition and etch mechanisms has been developed which is further used to understand surface kinetics on SiO2 substrate as a function of ion energy, ion flux and feed gas stoichiometry. Influence of surface kinetics on gas phase chemistry of different neutrals and radicals is shown at two different bias powers (0 and 200 W). In the third section, upper bound sticking coefficients for different radicals are developed on the surface. Collectively, this research is an effort to understand the interdependence between gas phase chemistry and surface kinetics in a long residence time fluorocarbon inductively coupled plasma.
3D Tree-Structured Object Tracking for Autonomous Ground Vehicles
Authors: Changsoo Jeong, Alice C. Parker
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

Safe and effective vision analysis is a key capability for Autonomous Ground Vehicle (AGV) guidance systems. The complexity of natural settings requires the use of a robust image understanding technique. The proposed novel 3D tree-structured object tracking approach is implemented by tracking 2D objects in successive video frames using a Wavelet-domain tree structure. It is robust and reliable due to its powerful data structure and also adaptable for moving and stationary object tracking as well as the tracking problem when the vehicle itself is in motion. This approach consists of Wavelet Decomposition, Spatial Object Detection and Temporal Object Tracking. The results show this approach can produce precise detection and tracking results.
Cget, Cput, and stage: safe file transport tools for the internet
Authors: Bill Cheswick
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (1997)

Cget, cput, and stage are three simple programs that implement authenticated or encrypted file transfers on the Internet. Cget and cput read and write files to a remote host, and stage ensures that a remote directory accurately mirrors a local master directory. These routines use private key cryptography for authentication and privacy between pairs of secured hosts. They are simple, paranoid Unix tools that can be used to support systems that operate in a hostile environment.
Reuse of Process Knowledge in Enterprise Systems Development
Authors: Eunhee Park, Han G. Woo
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

To reuse process knowledge in enterprise systems development, the reference conceptual model is specified and a tool to support reuse of process knowledge is introduced. The tool uses a selected conceptual model to represent process knowledge deliberations and retrieves useful artifacts from a process knowledge graph library through the use of a matching facility. The overall approach to encoding graph format and to matching algorithm to graphs is described. A case study performed to evaluate the effectiveness of the tool.
Routing in mobile ad hoc networks with global knowledge
Authors: D. Platt
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper describes a method of routing in mobile ad hoc networks. The problem is exacerbated by the fact that the radio links between the nodes of the network are continually being made and broken. The method consists of using the known connections to construct a "map" of the network which is intended to reproduce the geographical layout of the network at any time. An algorithm is described which finds a route from one node to another by always attempting to move geographically closer to the destination at every hop. This produces nearly optimal performance with very short computation time. The signaling load on the system is quite low. The scaling properties of the system are investigated and it is found that the system is viable with nodes numbering in the hundreds.