ppxscal/embedding_network huggingface dataset:
On the maximal distance between triangular embeddings of a complete graph
Authors: Vladimir P. Korzhik
Venue: Journal of Combinatorial Theory Series B (2006)

The distance d(f, f') between two triangular embeddings f and f' of a complete graph is the minimal number t such that we can replace t faces in f by t new faces to obtain a triangular embedding isomorphic to f'. We consider the problem of determining the maximum value of d(f, f') as f and f' range over all triangular embeddings of a complete graph. The following theorem is proved: for every integer s ≥ 9, if 4s + 1 is prime and 2 is a primitive root modulo (4s + 1), then there are nonorientable triangular embeddings f and f of K12s+4 such that d(f, f') ≥ (1/2)(4s + 1)(12s + 4) - O(s), where (4s + 1)(12s + 4) is the number of faces in a triangular embedding of K12s+4. Some number-theoretical arguments are advanced that there may be an infinite number of odd integers s satisfying the hypothesis of the theorem.
Negotiating Agents for Internet Commerce
Authors: John Debenham, Elaine Lawrence
Venue: Proceedings of the International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (2006)

A new breed of "information-based" agents aims to deliver effective negotiators to Internet commerce. They are founded on concepts from information theory, and are designed to operate with information flows of varying and questionable integrity. These agents are part of a larger project that aims to make informed automated trading in applications such as eProcurement a reality.
A Stateful Approach to Spyware Detection and Removal
Authors: Ming-Wei Wu, Yennun Huang, Yi-Min Wang, Sy-Yen Kuo
Venue: Proceedings of the 12th Pacific Rim International Symposium on Dependable Computing (2006)

Spyware, a type of potentially unwanted programs (PUPs), has become a significant threat to most Internet users as it introduces serious privacy disclosure and potential security breach to the systems. Current anti-spyware tools use signatures to detect spyware programs. Over time, spyware programs have grown more resilient to this technique; they utilize critical areas of the system to survive reboots and set up mini-installers that re-install a spyware program after it's been detected and removed. Since existing anti-spyware tools are stateless in the sense that they do not remember and monitor the spyware programs that were removed, they fail to permanently remove these self-healing spyware programs. This paper proposes STARS (Stateful Threat-Aware Removal System): a tool that at run time intercepts critical system accesses and assures removed spyware does not re-install itself after a successful removal of spyware program in the system. If a re-installation (self-healing) is detected, STARS infers the source of such activities and discovers additional "suspicious" programs. Experimental results show that STARS is effective in removing self-healing spyware programs that existing anti-spyware tools fail to do.
Role of the Prefrontal Cortex in Attentional Control over Bistable Vision
Authors: Sabine Windmann, Michaela Wehrmann, Pasquale Calabrese, Onur Güntürkün
Venue: Journal of Cognitive Neuroscience (2006)

The primary source of top-down attentional control in object perception is the prefrontal cortex. This region is involved in the maintenance of goal-related information as well as in attentional selection and set shifting. Recent approaches have emphasized the role of top-down processes during elementary visual processes as exemplified in bistable vision where perception oscillates automatically between two mutually exclusive states. The prefrontal cortex might influence this process either by maintaining the dominant pattern while protecting it against the competing representation, or by facilitating perceptual switches between the two competing representations. To address this issue, we investigated reported perceptual reversals in patients with circumscribed lesions of the prefrontal cortex and healthy control participants in three experimental conditions: hold (maintaining the dominant view), speed (inducing as many perceptual switches as possible), and neutral (no intervention). Results indicated that although the patients showed normal switching rates in the neutral condition and were able to control perceptual switches in the hold condition as much as control subjects were, they were less able to facilitate reversals specifically in the speed condition. These results suggest that the prefrontal cortex is necessary to bias the selection of visual representations in accord with current goals, but is less essential for maintaining selected information active that is continuously available in the environment. As for attentional selection, the present results suggest that the prefrontal cortex initiates perceptual reversals by withdrawing top-down support from the dominant representation without (or prior to) boosting the suppressed view.
Recovery with lost subband data in overcomplete image coding
Authors: G. Gonzalez-Rosiles, S. D. Cabrera, Sing-Wai Wu
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

This paper deals with the recovery of an image when some partially redundant subband data has been irreversibly corrupted. The approach presented assumes an overcomplete subband decomposition and uses a local optimal recovery estimator that works as a block processing scheme. The method takes advantage of the inherent correlation and redundancy among the remaining uncorrupted subband data. We view this approach as an alternative or as a complementary method to be used with forward error correcting codes requiring only error detection capability. We test the performance using row/column separable processing on images.
Content-Based Image Query on Color Feature in the Image Databases Obtained from DICOM Files
Authors: Liana Stanescu, Dan Burdescu, Anca Ion, Marius Brezovan
Venue: Proceedings of the International Multi-Conference on Computing in the Global Information Technology (2006)

The paper presents a qualitative study of the contentbased image query process over the image databases resulting from the standard DICOM files produced by the medical devices used in the diagnosis process. There were implemented and studied several methods of transformation and quantization of the color space (HSV quantized at 166 colors, RGB quantized at 64 colors and CIE-LUV quantized at 512 colors) and also three methods for dissimilitude computing between the query and the target image (Euclidian distance, histograms intersection and quadratic distance between histograms). The algorithms that permit the extraction of the alphanumeric and imagistic information from the standard DICOM files and the algorithms for transforming and quantization of the color spaces are also presented. The experimental results displayed in a tabular and graphical form, permit the formulation of some useful conclusion, because the color medical images are more complex than the usual images.
A 0-1 Hardware/Software Partitioning Algorithm over IP cores
Authors: Jiang Kaizhong, Lu Zhao, Gu Junzhong
Venue: Proceedings of the International Conference on Autonomic and Autonomous Systems (2006)

Recently, researches on the Hardware and Software Co-Design over IP cores have become a new domain. A critical phase in the HW-SW Co-design process is HW-SW Co-Partitioning which decomposing an expected system into hardware or software parts. This paper proposes an innovative 0-1 partitioning algorithm (named 0-1 algorithm) over IP cores which can efficiently partition an expected system into hardware or software parts. The correctness of the 0- 1algorithm is verified here. It's illustrated that the result of optimization using the algorithm is better than using genetic algorithm, with similar convergence speed. The algorithm has also the advantage that its convergence is quicker than the ILP (Integer Linear Programming) approach.
Low-voltage low-power 100 MHz programmable gain amplifier in 0.35 μm CMOS
Authors: B. Calvo, S. Celma, M. T. Sanz
Venue: Analog Integrated Circuits and Signal Processing (2006)

This paper presents a low-voltage low-power intermediate-frequency programmable gain amplifier (PGA). To achieve low-voltage low-power and wideband operation while preserving linearity, the proposed cell is based on a very simple g m -boosted differential pair degenerated with a hybrid polysilicon-MOS programmable resistor structure. Fabricated in a 0.35 ¿m CMOS technology, the PGA consumes less than 0.5 mW at a single 1.8 V supply. Measured results for a 3-bit implementation show a 0 to 18 dB linear-in-dB programmable gain with a constant bandwidth of 100 MHz when driving 150 fF capacitive loads. Distortion levels are below ¿72 dB over the whole gain range at 10 MHz for a 0.2 V p ¿ p differential output. Compared with other previously reported designs, it shows a good trade-off when all PGA parameters are considered.
Visual support for medical communication by using projector-based augmented reality and thermal markers
Authors: Jeremy Bluteau, Itaru Kitahara, Yoshinari Kameda, Haruo Noma, Kiyoshi Kogure, Yuichi Ohta
Venue: Proceedings of the 2005 international conference on Augmented tele-existence (2005)

This paper presents a system that allows patients and physicians to experience better communication during medical consultations using Augmented Reality (AR) technology. The AR system can superimpose augmentations (i.e., human body components) onto the real patient's body, and such annotated information serves to form the cornerstone for collaborative work between the two actors. We focus on the advantages of projector-based technology and ARToolKit. Our technique, based on thermal markers (i.e., using human body temperature as a source of information) is used for tracking the location of pain in the patient through the projected augmentations. The second aim of using thermal markers is to protect the patient's privacy. The required calibration method between thermal-camera and projector is also presented. The system's feasibility is demonstrated through development of a complete application.
Informing the Design of Direct-Touch Tabletops
Authors: Chia Shen, Kathy Ryall, Clifton Forlines, Alan Esenther, Frederic D. Vernier, Katherine Everitt, Mike Wu, Daniel Wigdor, Meredith Ringel Morris, Mark Hancock, Edward Tse
Venue: IEEE Computer Graphics and Applications (2006)

Tables provide a large and natural interface for supporting direct manipulation of visualcontent for human-to-human interactions. Such surfaces also support collaboration, coordination, andparallel problem solving. However, the direct-touch table metaphor also presents considerablechallenges, including the need for input methods that transcend traditional mouse- and keyboard-based designs.
Homography from Coplanar Ellipses with Application to Forensic Blood Splatter Reconstruction
Authors: John Wright, Andrew Wagner, Shankar Rao, Yi Ma
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Reconstruction of the point source of blood splatter in a crime scene is an important and difficult problem in forensic science. We study the problem of automatically reconstructing the 3-D location of the victim of a shooting from photographs of planar surfaces with blood splattered on them. We analyze this problem in terms of the multiple-view geometry of planar conic sections. Using projective invariants associated with pairs of conic sections, we match images of multiple conic sections taken from widely separated viewpoints. We further recover the homography between two views using the common tangents of pairs of conic sections. The location of the point source is then retrieved from the reconstructed scene geometry. We suggest how to extend these results to scenes containing multiple planar surfaces, and verify the proposed method with experiments on both synthetic and real images.
Two Architectures of a General Digit-Serial Normal Basis Multiplier
Authors: Martin Novotny, Jan Schmidt
Venue: Proceedings of the 9th EUROMICRO Conference on Digital System Design (2006)

We present two architectures of digit-serial normal basis multiplier over GF(2^m). Proposed multipliers are scalable by the digit width of general value in difference of the multiplier of Agnew et al. that may be scaled only by digit width that divides the degree m. This helps designers to trade area for speed e.g. in cryptographic systems, where m should be a prime number. Functionality of multipliers has been tested by simulation and implemented in Xilinx Virtex 4 FPGA.
E-portfolios along the Lifelong Learning Cycle: Differences between Use, Pedagogy and Context.
Authors: Christopher Murray, Neil Currant
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

This short paper will discuss the initial evaluation findings of an on-going project utilising the use of eportfolios at key stages of transition. The mid-point data will illustrate that e-portfolios offer different benefits within the lifelong learning cycle. There are differences in the pedagogical outcomes, the use of the e-portfolios and learner and mentor/supervisor engagement within different contexts, particularly between the educational and work spheres.
Globalization of law and electronic commerce toward a consistent international regulatory framework
Authors: Ali. Z. Marossi
Venue: Proceedings of the 8th international conference on Electronic commerce: The new e-commerce: innovations for conquering current barriers, obstacles and limitations to conducting successful business on the internet (2006)

In principle, this Article seeks to discuss some controversial issues regarding international economic cooperation in the light of new technology. The Article focuses particularly on the relation between international economic cooperation, e-commerce and technology from a legal point of view and provides an introductory roadmap of entry points into relevant issues of international e-commerce.
Serving Web 2.0 with SOA: Providing the Technology for Innovation and Specialization
Authors: Kwei-Jay Lin
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

Service-Oriented Architecture (SOA) using Web services has emerged as a major software architecture. The SOA concept evolves from earlier component-based software frameworks. However, since Web services standards are based on readily and openly available Internet protocols, and thus much cheaper and easier for companies to adopt, major computer and IT companies have quickly embraced SOA. Web 2.0 promotes Web experiences that encourage users to participate in sharing information and enriching services. Users may offer their own contributions as open services to be composed into new components and services. In addition, the combined network effects of pervasive two-way participation are creating a phenomenal communal service architecture on the Web. In order for users and companies to share knowledge and co-produce with peers anywhere, without synchronization, delay, or maintenance, they need to use some powerful underlying set of technologies and paradigms. This is where SOA may provide some help. This talk will discuss the service technology challenges and opportunities that are introduced by the dynamism of Web 2.0 services and requirements. The issues may require new concepts, methods, models, and technologies along with flexible and adaptive infrastructures for services composition and management in order to facilitate the two-way integration and formation of services across different sources. The future success of SOA will rely on the development of novel technologies to meet these new demands from the evolving Web 2.0 paradigm.
Exploiting AUC for optimal linear combinations of dichotomizers
Authors: Claudio Marrocco, Mario Molinara, Francesco Tortorella
Venue: Pattern Recognition Letters (2006)

The combination of classifiers is an established technique to improve the classification performance. The possible combination rules proposed up to now generally try to decrease the classification error rate, which is a performance measure not suitable in many real situations and particularly when dealing with two-class problems. In this case, a good alternative is given by the area under the receiver operating characteristic curve (AUC), whose effectiveness in measuring the classification quality has been proved in many recent papers. In this paper, we propose a method to achieve the optimal linear combination of two dichotomizers based on the maximization of the AUC of the resulting classification system. The effectiveness of the approach has been confirmed by the tests performed on standard datasets.
A Novel Approach to Provide Lane Departure Warning Using Only One Forward-Looking Camera
Authors: Xiangjing An, Mo Wu, Hangen He
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

It is one of the most important applications to improve the safety of vehicles using the technology of Intelligent Vehicle. A vision-based Lane Departure Warning System (LDWS) is such an active safety system prevents unintended lane departure using a single on board camera. In this paper, we described our vision-based Lane Departure Warning System at first. Then we discussed the method how to predict the lane departure using the information got from the forward-looking camera. In our system, we present a novel approach to predict lane departure, namely, the Changing Rate of Angle between Lanes (CRAL). Analyses show that this criterion has many advantages over TLC (Time to Lane Crossing). Our Lane Departure Warning Systems have been accomplished on the prototype HONGQI Autonomous Land Vehicle. Experiment results show that our vision-based LDWS does provide an efficient alarm when the vehicle is going to departure the lane.
A Color Correction System using a Color Compensation Chart
Authors: Seok-Han Lee, Tae-Yong Kim, Jong-Soo Choi
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 01 (2006)

In this paper, we propose a color correction system using a color compensation chart. The implementation target of the proposed system is the color image captured by digital imaging device, and the system introduces the color compensation chart designed for it to estimate the transformation between the colors in the image and the reference colors. The color correction process of the proposed system consists of two steps, i.e., the profile creation process and the profile application process. During the profile creation process, the relationships between the captured colors and the reference colors are estimated. And the system creates a color profile and embeds the estimation result. During the profile application process, the colors in the images which are captured under the same condition as that of the chart image are corrected using the created color profile. To evaluate the performance of the system, we perform experiments under various conditions. And we compare the results with those of widely used commercial applications.
Recursive CR bounds: algebraic and statistical acceleration
Authors: M. Usman, A. O. Hero
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Computation of the Cramer-Rao bound involves inversion of the Fisher information matrix (FIM). The inversion can become computationally intractable when the number of unknown parameters is large. Hero et. al. (see IEEE Nuclear Science Symposium and Medical Imaging Conference, Orlando, 1983) has presented a recursive, monotonically convergent and computationally efficient algorithm to invert sub-matrices of the FIM corresponding to a small region of interest in image reconstruction. The convergence rate of this algorithm depends on a splitting matrix which can be interpreted as a complete-data FIM. We investigate the acceleration of the algorithm using several different choices of the complete-data FIM. We also present a conjugate gradient based algorithm which achieves a much faster convergence rate at the expense of monotone convergence. We apply the methods developed in this paper to emission tomography.
Activity Analysis in Microtubule Videos by Mixture of Hidden Markov Models
Authors: Alphan Altinok, Motaz El-Saban, Austin J. Peck, Leslie Wilson, Stuart C. Feinstein, B. S. Manjunath, Kenneth Rose
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 2 (2006)

We present an automated method for the tracking and dynamics modeling of microtubules -a major component of the cytoskeleton- which provides researchers with a previously unattainable level of data analysis and quantification capabilities. The proposed method improves upon the manual tracking and analysis techniques by i) increasing accuracy and quantified sample size in data collection, ii) eliminating user bias and standardizing analysis, iii) making available new features that are impractical to capture manually, iv) enabling statistical extraction of dynamics patterns from cellular processes, and v) greatly reducing required time for entire studies. An automated procedure is proposed to track each resolvable microtubule, whose aggregate activity is then modeled by mixtures of Hidden Markov Models to uncover dynamics patterns of underlying cellular and experimental conditions. Our results support manually established findings on an actual microtubule dataset and illustrate how automated analysis of spatial and temporal patterns offers previously unattainable insights to cellular processes.
(No)good Recording and ROBDDs for Solving Structured (V)CSPs
Authors: Karim Boutaleb, Philippe Jegou, Cyril Terrioux
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

It was shown that constraint satisfaction problems (CSPs) with a low width can be solved efficiently by structural methods. However, these methods often present an important drawback: they generally require a large amount of memory space, what makes their use difficult or impossible. For instance, the BTD method solves efficiently difficult instances thanks to the recording of goods and nogoods. As this recording may require an exponential memory size, the exploitation of a compact data structure is crucial. In this paper, we propose to store (no)goods in Binary Decision Diagrams (BDD). BDDs are data structures which efficiently represent informations in a compact and canonical form. Finally, we assess the practical interest of this tradeoff which allows to save space memory and consequently to solve problems that cannot be solved without BDDs.
A deterministic approach to blind identification of multi-channel FIR systems
Authors: Hui Liu, Guanghan Xu, Lang Tong
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Conventional blind channel identification algorithms are based on channel outputs and the knowledge of the probabilistic model of a channel input. In some practical applications, however, the input statistical model may not be known, or there may not be sufficient data to obtain accurate enough estimates of certain statistics. We consider the system input to be an unknown deterministic signal and study the problem of blind identification of a channel which can be decomposed into multichannel FIR systems driven by a input signal. A new deterministic blind identification algorithm based solely on the system outputs are proposed. Necessary and sufficient identifiability conditions concerning the channel and the deterministic input signal are also presented.