ppxscal/embedding_network huggingface dataset:
Distinguishing 3D-Topological Configurations of Two Tori
Authors: Adrian Ion, Thomas Illetschko, Yll Haxhimusa, Walter G. Kropatsch
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

Most of the existing work regarding topology preserving hierarchies is mainly preoccupied with 2D domains. But recently attention has turned to 3D, and more generally, nD representations. Even more than in 2D, the necessity for reducing these representations exists and motivates the research in hierarchical structures i.e. pyramids. Using representations that support any dimension, like e.g. the combinatorial map, n dimensional irregular pyramids can be built, thus obtaining reduced representations of the original data, while preserving the topology. This paper presents 3D combinatorial maps and the primitive operations needed to simplify such representations. Minimal configurations of the three primitive topological configurations, simplex, hole, and tunnel, and two possible configurations for two tori are presented. Experimental results and possible applications show the potential of the approach.
Tangible Cubes as Programming Objects
Authors: Andrew C. Smith
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

In this paper, we describe early results in the development of an alternative programming method which uses large, three-dimensional acrylic blocks to construct programming sequences. Computer-illiterate children can create a symbolic program to control a humanoid robot toy. We describe the physical design of the blocks, problems encountered, comments made by primary school participants, and make recommendations for further development.
High resolution detector for signals in random noise using wavelet-based Wigner distribution
Authors: A. Ohsumi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 01 (2000)

A new signal detector of a chain of solitary signals corrupted by random noise is proposed by modifying the conventional Wigner distribution with wavelet. The efficacy of the proposed detector is shown by simulation studies.
A DNS filter and switch for packet-filtering gateways
Authors: Bill Cheswick, Steven M. Bellovin
Venue: Proceedings of the 6th conference on USENIX Security Symposium, Focusing on Applications of Cryptography - Volume 6 (1996)

IP-transparent firewalls require access to the external Domain Name System (DNS) from protected internal hosts. Misconfigurations and misuse of this system can create internal administrative and security problems. Dnsproxy provides access to and protection from untrusted DNS services. It runs on a firewall, or on a trusted host just inside the firewall. The program receives (or intercepts) DNS queries and forwards them to an appropriate internal or external "realm" for processing. The responses can be checked, filtered, and modified before they are returned to the requester. The logging and consistency checks can provide information about possible DNS attacks and irregularities that are not available from most DNS implementations.
Density-Fitting Method in Symmetry-Adapted Perturbation Theory Based on Kohn-Sham Description of Monomers
Authors: Rafal Podes, Robert Bukowski, Krzysztof Szalewicz
Venue: Proceedings of the HPCMP Users Group Conference (2006)

Symmetry-adapted perturbation theory (SAPT) provides a framework for calculating accurate intermolecular interaction energies and is a powerful tool for understanding physical effects contributing to intermolecular forces.[1-3] SAPT has been used to obtain numerous interaction potentials of high accuracy, as confirmed by comparisons of the computed spectra with experiments. As it is well known, the wave-function-based ab initio methods such as SAPT are computationally expensive and the calculations just mentioned were limited to molecules containing no more than about ten atoms. Much faster calculations are possible if the density-functional theory (DFT) methods are used, but, unfortunately, these methods are known to fail to describe an important part of the van der Waals forces, the dispersion interaction. It has recently been shown that it is possible to bring together the best features of both approaches by creating SAPT that utilizes a DFT description of monomers.[46] Such a method, now called SAPT(DFT), has been introduced by Williams and Chabalowski[7] and later developed by Misquitta et al.[4,5] and independently by Hesselmann and Jansen.[8] The method is applicable for all separations between interacting molecules since it does not rely on asymptotic expansions. The SAPT(DFT) approach avoids the problems of supermolecular DFT by using this method only to describe isolated monomers, but calculating the interaction energies from expressions beyond DFT. The initial problem of SAPT(DFT) was a wrong long-range behavior of monomer densities computed by DFT. This problem was fixed by applying an asymptotic correction to the exchange-correlation potential in the Kohn-Sham equations. SAPT(DFT) calculations require only a small fraction of computer resources used by the regular SAPT. The majority of time in the latter case is spent on correlating each monomer. In SAPT(DFT), this task is left to DFT, resulting in minimal expenditures of computer time.
A nonlinear diffusion equation as a fast and optimal solver of edge detection problems
Authors: I. Pollak
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 06 (1999)

A nonlinear diffusion process known to be effective for image segmentation is analyzed in 1-D. It is shown that it optimally solves certain edge detection problems. A fast implementation of the algorithm is introduced.
A non-myopic approach to visual search
Authors: Julia Vogel, Kevin Murphy
Venue: Proceedings of the Fourth Canadian Conference on Computer and Robot Vision (2007)

We show how a greedy approach to visual searchi.e., directly moving to the most likely location of the target - can be suboptimal, if the target object is hard to detect. Instead it is more efficient and leads to higher detection accuracy to first look for other related objects, that are easier to detect. These provide contextual priors for the target that make it easier to find. We demonstrate this in simulation using POMDP models, focussing on two special cases: where the target object is contained within the related object, and where the target object is spatially adjacent to the related object.
Development and industrialisation
Authors: Michel Riffiod, Paul Caspi, Christophe Piala, Jean-Luc Voirin
Venue: Proceedings of the conference on Design, automation and test in Europe (2007)

This second technical session illustrates the methodological dimensions of technology transfer. It elaborates on some methodologies deployed in critical steps of the whole embedded systems development process, particularly to specify safety critical embedded systems, to manage obsolescence of components and to certify the airworthiness of the final solutions.
Fast and accurate active appearance models
Authors: Iain Matthews
Venue: Proceedings of the HCSNet workshop on Use of vision in human-computer interaction - Volume 56 (2006)

Active Appearance Models (AAMs) are generative, non-rigid, parametric models of a particular visual phenomena. They are most often applied to faces, which are perhaps the most popular class of deformable objects in computer vision. There are two elements to using AAMs: first, how to create the model, and second: given a model, how to fit it to a given image? This keynote will give an overview of the standard methods of model construction, then go into detail on the fast, analytical fitting solutions we have developed.
A Comparison of Statistical Approaches for Genetic Anticipation with Application to Pancreatic Cancer
Authors: Gleb R. Haynatzki, Randall E. Brand, Vera R. Haynatzka, Henry T. Lynch
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Genetic anticipation for a particular disease can involve an earlier age at onset (or, diagnosis), greater severity, and/or a higher number of affected individuals in successive generations within a family. The variable of interest in our study of genetic anticipation was age at diagnosis of pancreatic cancer for different generations, with and without adjustment for time under observation. We compared nonparametric and semiparametric statistical tests for paired data. This comparison was illustrated on an example of familial pancreatic cancer where study subjects were taken from the Pancreatic Cancer Collaborative Registry (PCCR). The nonparametric test performed on our example better than the two semiparametric tests, and was more efficient in detecting risk differences at earlier ages. After adjusting for follow up time, all methods detected genetic anticipation.
Development of a teaching tool: the Texaco energy systems laboratory at Penn State
Authors: H. Perez-Blanco
Venue: Proceedings of the Frontiers in Education Conference,1997. on 27th Annual Conference. Teaching and Learning in an Era of Change. - Volume 01 (1997)

The importance of developing improved teaching tools for design of thermal systems has been recognized at Penn State University, USA. This paper describes an undergraduate energy systems laboratory to be implemented at the Mechanical Engineering Department, under primary sponsorship from Texaco, NSF and internal matching funds. This lab will be implemented by judicious selection of test stands allowing the students to experiment with actual machines. Three test stands have been procured in order to allow the students to exercise and reinforce the theoretical knowledge acquired in the thermal courses, and to appreciate the comprehensive nature of design activities. The authors plan to have an internal combustion engine, a steam Rankine cycle and a refrigeration system. Other issues illustrating the integrating nature of the design activity, such as considerations of vibration, noise, fatigue, material selection and environmental compliance will also be addressed as the laboratory develops.
Integration of CSAB and ABET
Authors: D. K. Lidtke
Venue: Proceedings of the 30th Annual Frontiers in Education - Volume 01 (2000)

The Accreditation Board for Engineering and Technology, Inc. (ABET) and the Computing Sciences Accreditation Board (CSAB) signed a Memorandum of Agreement in November 1998 to integrate CSAB's accreditation services with ABET, with a transition time of approximately two years. During the interim period, the operations of the Computer Science Accreditation Commission (CSAC) are contracted by CSAB to ABET. A committee with CSAC, CSAB, and ABET representation is working to set up the new commission for accrediting programs in the computing sciences. This new commission will probably be called the Computing Accreditation Commission (CAC). Other activities are underway to try to assure that this integration goes as smoothly as possible. This paper discusses from various points of view the current status of the integration and plans for the completion of the integration.
Direction estimation using conjugate cyclic cross-correlation: more signals than sensors
Authors: V. B. Manimohan
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 05 (1999)

We consider the problem of estimating the directions of arrival of multiple communication signals arriving at a uniform linear array. By considering the conjugate cyclic cross-correlations of the sensor outputs and using a Bayesian framework, we propose a direction finding algorithm that allows us to estimate the directions of arrival for a more signals than sensors scenario. The algorithm does not need any training sequence and only requires a priori knowledge of the cyclic frequencies and the number of sources. It is also possible to estimate the directions of arrival in a multipath fading environment under certain conditions.
Monte Carlo methods in fuzzy linear regression
Authors: Areeg Abdalla, James J. Buckley
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2007)

We apply our new fuzzy Monte Carlo method to a certain fuzzy linear regression problem to estimate the best solution. The best solution is a vector of triangular fuzzy numbers, for the fuzzy coefficients in the model, which minimizes one of two error measures. We use a quasi-random number generator to produce random sequences of these fuzzy vectors which uniformly fill the search space. We consider an example problem and show this Monte Carlo method obtains the best solution for one error measure and is approximately best for the other error measure.
BTM - An Automated Rule-based BT Monitoring System for Piracy Detection
Authors: K. P. Chow, K. Y. Cheng, L. Y. Man, Pierre K. Y. Lai, Lucas C. K. Hui, C. F. Chong, K. H. Pun, W. W. Tsang, H. W. Chan, S. M. Yiu
Venue: Proceedings of the Second International Conference on Internet Monitoring and Protection (2007)

With the advent of peer-to-peer communication technologies, individuals can easily connect to one another over Internet for file sharing and online chatting. Although these technologies provide wonderful platforms for users to share their digital materials, its illegitimate use on unauthorized sharing of copyrighted files is increasingly rampant. With the BitTorrent (BT) technology, the tracking down of these illegal activities is even more difficult as the downloaders can also act as the distributors and cooperate to provide different parts of the same file for sharing. It is close to impossible for law enforcement agencies to trace these distributed and short-duration Internet piracy activities with limited resources. In this paper, we present the first automated rule-based software system, the BitTorrent Monitoring (BTM) System, for monitoring, recording, and analyzing suspicious BT traffic on the Internet. From a preliminary experiment on a real case, the system successfully located 126 distributors (a.k.a. seeders) for some Cantonese pop songs within 90 minutes.
Strategic and Institutional Perspectives in the Adoption and Early Integration of Radio Frequency Identification (RFID)
Authors: Aditya Sharma, Alex Citurs, Benn Konsynski
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Using multiple lenses of strategic choice theories (diffusion of innovation, organizational innovativeness) and institutional theory as the basis and reflecting data from semi-structured interviews and news reports, the study develops an integrative conceptual RFID adoption model and presents testable hypotheses at the construct and rationale levels. The model incorporates different rationales for adoption and integration of interorganizational systems (IOS) namely the strategic choice perspective where adoption is voluntary with a view to improve organizational efficiency and performance and the institutional perspective where adoption is more a result of conforming to pressures from organizations within an organization.s field of operation. Two technological factors (perceived benefit and perceived costs), three organizational readiness factors (top management support, financial readiness, IS infrastructure and capabilities) and three external environmental factors (perceived standards convergence, perceived consumer privacy and perceived stakeholder privacy) have been suggested as adoption and integration drivers from a strategic choice perspective while the three Interorganizational pressure factors (coercive, mimetic and normative pressures) have been proposed as predictors of adoption intent and expected integration from the institutional perspective . The study allows for a comparison of the relative influence of each rationale on the adoption and post adoption integration decisions by a firm.
Complementing two-way finite automata
Authors: Viliam Geffert, Carlo Mereghetti, Giovanni Pighizzini
Venue: Information and Computation (2007)

We study the relationship between the sizes of two-way finite automata accepting a language and its complement. In the deterministic case, for a given automaton (2dfa) with n states, we build an automaton accepting the complement with at most 4n states, independently of the size of the input alphabet. Actually, we show a stronger result, by presenting an equivalent 4n-state 2dfa that always halts. For the nondeterministic case, using a variant of inductive counting, we show that the complement of a unary language, accepted by an n-state two-way automaton (2nfa), can be accepted by an O(n^8)-state 2nfa. Here we also make 2nfa's halting. This allows the simulation of unary 2nfa's by probabilistic Las Vegas two-way automata with O(n^8) states.
Detecting Interaction Coupling from Task Interaction Histories
Authors: Lijie Zou, Michael W. Godfrey, Ahmed E. Hassan
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

A repository of task structures can reveal important latent knowledge about the development of a software system. Although approaches have been proposed to recover artifacts within a task structure, identifying relations that are relevant to a task remains a problem. In this work, we propose to detect "interaction coupling" from task interaction histories (i.e., records of when the artifacts were being used or modified in a task, as observed by the IDE), and use this information to mine patterns to aid in the comprehension of maintenance activities. In our case study, we found we were able to recover latent information about the development process; for example, our results suggest that restructuring is more costly than any other maintenance activity.
Analysis of a transmit diversity scheme in fading channels and imperfect channel estimation
Authors: W. C. Ang, C. S. Ng
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The theoretical analysis of the error performance of a simple transmit diversity scheme is carried out for Rayleigh and Rician fading using QPSK. A closed form expression is derived for the SER. The computer simulations which are performed matches the results obtained through the closed form expressions. The performance of the scheme with imperfect channel estimation using pilot signals is investigated and analyzed. It is found that the deterioration of performance in transmit diversity when there is channel estimation error is about 5 dB. The sensitivity of the system to estimation error is investigated by analyzing the effects of reducing the error caused by noise when estimating the channel.
Recursive descent parsing for Boolean grammars
Authors: Alexander Okhotin
Venue: Acta Informatica (2007)

The recursive descent parsing method for the context-free grammars is extended for their generalization, Boolean grammars, which include explicit set-theoretic operations in the formalism of rules and which are formally defined by language equations. The algorithm is applicable to a subset of Boolean grammars. The complexity of a direct implementation varies between linear and exponential, while memoization keeps it down to linear.
Generalizing SPIHT: a family of efficient image compression algorithms
Authors: R. R. Shively
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

This paper describes a family of list-free tree-set scanning (LIFTS) algorithms, related to Shapiro's (1993) embedded zero-tree wavelet (EZW) coding and to Said and Pearlman's (see IEEE Trans. on Circuits and Systems for Video Technology, vol.6, no.3, p.243-9, 1996) set partitioning in hierarchical trees (SPIHT) algorithm. The principal advantage of the LIFTS algorithms is that they are parallelizable and require greatly reduced computational complexity and memory overhead, while nearly achieving the efficiency of SPIHT. The algorithms may be tailored to special requirements, such as transmission of a fully embedded bit-stream with sub-image refinement.
Technology roles and paths of influence in an ecosystem model of technology evolution
Authors: Gediminas Adomavicius, Jesse C. Bockstedt, Alok Gupta, Robert J. Kauffman
Venue: Information Technology and Management (2007)

We propose a new conceptual model for understanding technology evolution that highlights dynamic and highly interdependent relationships among multiple technologies. We argue that, instead of considering technologies in isolation, technology evolution is best viewed as a dynamic system or ecosystem that includes a variety of interrelated technologies. By considering the interdependent nature of technology evolution, we identify three roles that technologies play within a technology ecosystem. These roles are components, products and applications, and support and infrastructure. Technologies within an ecosystem interact through these roles and impact each others' evolution. We also classify types of interactions between technology roles, which we term paths of influence. We demonstrate the use of our proposed model through examples of wireless networking (Wi-Fi) technologies and a business mini-case on the digital music industry.
Realizing unstable social efficiency with mutual learning of meta-rules
Authors: Y. Murakami, H. Sato, A. Namatame
Venue: Proceedings of the Evolutionary Computation on 2002. CEC '02. Proceedings of the 2002 Congress - Volume 02 (2002)

It is an interesting question to answer how the society groups its way towards efficient equilibrium in an imperfect world when self-interested agents learn from others. In this paper, we focus on mutual learning. Each agent learns the rule of interaction in the negotiation situations formulated as hawk-dove games. It is known the mixed Nash strategy of hawk-dove games will result in an inefficient equilibrium. In this paper we consider both mimicry and crossover as the methodology of individual learning. We show that all agents mutually learn to behave as doves, which result in social efficiency. We also investigate the meta-rules acquired by agents through mutual learning. With mimicry the meta-rules of all agents are categorized into a few meta-rules. On the other hand, with crossover, almost all agents have acquired different meta-rules with one common feature.
Design of high flexible stream merging function
Authors: Bin-Yeong Yun, Whan-Woo Kim
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

A multiprotocol label-switching paradigm of integrating layer 3 routing with layer-2 technology such as ATM etc. has been proposed as an alternative to today's router architecture. When MPLS is applied to an ATM-LSR, a VC merging function that merges pluralities of ingress streams into one single stream is required to support scalability of MPLS networks. We will present the VC merging card that is implemented using a field programmable gate array (FPGA), and a high performance SAR device. The card provides not only high flexibility in the MPLS networks but also noble management method of connection setup and termination for multipoint-to-point connection essential to the VC merging function.