ppxscal/embedding_network huggingface dataset:
Dense Photometric Stereo Using Tensorial Belief Propagation
Authors: Kam-Lun Tang, Chi-Keung Tang, Tien-Tsin Wong
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 1 - Volume 01 (2005)

We address the normal reconstruction problem by photometric stereo using a uniform and dense set of photometric images captured at fixed viewpoint. Our method is robust to spurious noises caused by highlight and shadows and non-Lambertian reflections. To simultaneously recover normal orientations and preserve discontinuities, we model the dense photometric stereo problem into two coupled Markov Random Fields (MRFs): a smooth field for normal orientations, and a spatial line process for normal orientation discontinuities. We propose a very fast tensorial belief propagation method to approximate the maximum a posteriori (MAP) solution of the Markov network. Our tensor-based message passing scheme not only improves the normal orientation estimation from one of discrete to continuous, but also reduces storage and running time drastically. A convenient handheld device was built to collect a scattered set of photometric samples, from which a dense and uniform set on the lighting direction sphere is obtained. We present very encouraging results on a wide range of difficult objects to show the efficacy of our approach.
Chebyshev approximation with non-continuous weight functions
Authors: Charles B. Dunham
Venue: ACM SIGNUM Newsletter (1976)

The theory of Chebyshev approximation with respect to a positive continuous (ordinary) weight function is well understood and the Remez algorithm can be used in most cases of practical interest. The problem of Chebyshev approximation with respect to a non-negative, non-continuous weight function is now under investigation by the author, who would like to hear from any reader having a problem of this type. In return for such information the author will supply the theory and methods developed to date.
On the Lp Minkowski Problem for Polytopes
Authors: Daniel Hug, Erwin Lutwak, Deane Yang, Gaoyong Zhang
Venue: Discrete Computational Geometry (2005)

Two new approaches are presented to establish the existence of polytopal solutions to the discrete-data Lp Minkowski problem for all p > 1.
File under "unknowable!"
Authors: Stan Kelly-Bootle
Venue: Queue (2005)

It's been a hard day's night--proving nonexistence! The Yellow Pages used to advertise along the following lines: "If you can't find it here, it does not exist." Shannan Hobbes, my favorite epistemologist, and I would ponder this claim well into the wee hours, testing its validity by searching for vendors of "Square Circles," "Pet Unicorns," "Cold Fusion," "The Largest Prime Number," "Reigning Bald Kings of France," and similar quiddities oft debated in the PhilTrans (Philosophical Transactions). Our mounting failures - or, to quickly remove the scandalous ambiguity - our growing number of "not founds" amounted to some sort of inductive verification (of which, more anon). The Yellow Pages, considered as a merely finite hierarchy of marketable strings, has nothing much to tell us of contingent, objective existence. Indeed, we searched in vain for many incontrovertibly real, corporeal "thingies." No sign of the Renaissance crypto-text, Hypnerotomachia Poliphili, which will be on everyone's lips as soon as The Da Vinci Code mercifully fades from the best-seller lists.
The impact of webpage content characteristics on webpage visibility in search engine results (part I)
Authors: Jin Zhang, Alexandra Dimitroff
Venue: Information Processing and Management: an International Journal (2005)

Content characteristics of a webpage include factors such as keyword position in a webpage, keyword duplication, layout, and their combination. These factors may impact webpage visibility in a search engine. Four hypotheses are presented relating to the impact of selected content characteristics on webpage visibility in search engine results lists. Webpage visibility can be improved by increasing the frequency of keywords in the title, in the full-text and in both the title and full-text.
A study of simulated control of a robot: adaptibility, generation and execution of plans
Authors: M. Cayrol, B. Fade, H. Farreny
Venue: Issue 69 (January 1980) (1980)

This work constitutes the development of a project previously presented in Sigart Newsletter (August 1976).
Applying Neighborhood Consistency for Fast Clustering and Kernel Density Estimation
Authors: Kai Zhang, Ming Tang, James T. Kwok
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Nearest neighborhood consistency is an important concept in statistical pattern recognition, which underlies the well-known k-nearest neighbor method. In this paper we combine this idea with kernel density estimation based clustering, and derive the fast mean shift algorithm (FMS). FMS greatly reduces the complexity of feature space analysis, resulting satisfactory precision of classification. More importantly, we show that with FMS algorithm, we are in fact relying on a conceptually novel approach of density estimation, the fast kernel density estimation (FKDE) for clustering. The FKDE combines smooth and non-smooth estimators and thus inherits advantages from both. Asymptotic analysis reveals the approximation of the FKDE to standard kernel density estimator. Data clustering and image segmentation experiments demonstrate the efficiency of FMS.
Quotients of Fully Nonlinear Control Systems
Authors: Paulo Tabuada, George J. Pappas
Venue: SIAM Journal on Control and Optimization (2005)

In this paper, we introduce and study quotients of fully nonlinear control systems. Our definition is inspired by categorical definitions of quotients as well as recent work on abstractions of affine control systems. We show that quotients exist under mild regularity assumptions and characterize the structure of the quotient state/input space. This allows one to understand how states and inputs of the quotient system are related to states and inputs of the original system. We also introduce a notion of projectability which turns out to be equivalent to controlled invariance. This allows one to regard previous work on symmetries, partial symmetries, and controlled invariance as leading to special types of quotients. We also show the existence of quotients that are not induced by symmetries or controlled invariance. Such decompositions have a potential use in a theory of hierarchical control based on quotients.
Characterization and modeling of run-time techniques for leakage power reduction
Authors: Yuh-Fang Tsai, David E. Duarte, N. Vijaykrishnan, Mary Jane Irwin
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2004)

While some leakage power reduction techniques require modification of the process technology, others are based on circuit-level optimizations and are applied at run-time. We focus our study on the latter and compare three techniques: input vector control, body bias control, and power supply gating. We determine their limits and benefits in terms of the potential leakage reduction, performance penalty, and area and power overhead. The leakage power savings trends considering technology scaling are also presented. Due to the differences in the properties of datapath logic and memory structures, different implementations are recommended. Finally, the use of the "minimum idle time" parameter, as a metric for evaluating different leakage control mechanisms, is showed.
PathScape: indexing audio-visual digital media
Authors: Mike Leggett
Venue: Proceedings of the 5th conference on Creativity cognition (2005)

The contemporary burgeoning usage of digital movies, photos, audio and text, their distribution through networks both electronic and physical, will be considered in the context of a convergence of these media with a contemporary engagement with personal and community history.An interactive experimental prototype, PathScape, will be described and evaluated and further practice-based research approaches to author-defined storage and retrieval systems will be outlined.
Constraint languages for computer aided design
Authors: Wm Leler
Venue: ACM SIGDA Newsletter (1985)

In a typical algorithmic language such as Fortran or Pascal a program is a sequence of steps for the language interpreter to follow to achieve a desired result. In a constraint language a program is a set of relationships, called constraints, that describe the desired result. It is up to the language interpreter to determine the steps required to satisfy the constraints and achieve the result.
The annotation graph toolkit: software components for building linguistic annotation tools
Authors: Kazuaki Maeda, Steven Bird, Xiaoyi Ma, Haejoong Lee
Venue: Proceedings of the first international conference on Human language technology research (2001)

Annotation graphs provide an efficient and expressive data model for linguistic annotations of time-series data. This paper reports progress on a complete software infrastructure supporting the rapid development of tools for transcribing and annotating time-series data. This general-purpose infrastructure uses annotation graphs as the underlying model, and allows developers to quickly create special-purpose annotation tools using common components. An application programming interface, an I/O library, and graphical user interfaces are described. Our experience has shown us that it is a straightforward task to create new special-purpose annotation tools based on this general-purpose infrastructure.
Iterative Partial Soft Interference Cancellation with MMSE Multiuser Detection for Uplink Turbo-Coded MC-CDMA System
Authors: P. Kumpoopong, S. Kunaruttanapruk, S. Jitapunkul
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

In this paper, we improve the conventional iterative soft interference cancellation by introducing the partial cancellation technique and minimum mean square error (MMSE) multiuser detection technique in an uplink turbo-coded multicarrier code division multiple access (MC-CDMA) system. The performance of our proposed receiver is evaluated in Rayleigh multipath fading channel by using computer simulation. Simulation results demonstrate the advantages of the proposed technique over the conventional technique.
Special interest tracks and posters of the 14th international conference on World Wide Web
Venue: International World Wide Web Conference (2005)

On behalf of the program committee, welcome to the Industrial and Practical Experience track of WWW2005, the 14th International World Wide Web Conference. We received many excellent papers as submissions and it is unfortunate that our schedule constraints did not allow us to accept all of them. The number of submissions was forty one, from which we accepted eight. All submissions were submitted to three referees, all received at least two reviews and most received three. In addition to the eight talks corresponding to the accepted refereed papers, we have six invited speakers who will present what we anticipate will be excellent talks. Finally, we have assembled a panel of five distinguished members to discuss the ways in which search engines have and will affect the evolution of the web.
Accounting for the skin effect during repeater insertion
Authors: Daniel A. Andersson, Lars J. Svensson, Per Larsson-Edefors
Venue: Proceedings of the 15th ACM Great Lakes symposium on VLSI (2005)

Since the skin effect will increase the propagation delay in an interconnect, it will also affect how to optimally select the number and size of the buffers. Failing to include the skin effect during buffer design may result in as much as 35% extra delay compared to the optimal repeater chain. We present a new method with closed-form expressions for repeater insertion where we take into account the skin effect and also the relationship between interconnect resistance, capacitance and inductance that are determined from the geometrical parameters. We also investigate the skin-effect influence on power dissipation for an optimally designed repeater chain, and find that the increase is at most 10% of the dynamic power dissipation.
Introduction to Research Papers
Authors: William Griswold, Bashar Nuseibeh
Venue: Proceedings of the 27th international conference on Software engineering (2005)

At the heart of the ICSE-2005 program are the 44 research papers selected by the Program Committee (PC) from the 313 submissions to the conference. All submissions were rigorously reviewed by the PC -- each submission received reviews from at least three different PC members. The PC then met on 5-6 November 2004 in Newport Beach, California, USA, to discuss the submissions and make the final selections for the program. Each of the papers selected for publication in the proceedings and presentation at the conference was chosen on its own merits and without comparison to any others.The papers selected cover a wide range of research areas, which are not always amenable to a simple classification. Nevertheless, the papers are clustered into sessions that broadly represent the dominant research themes of the work described.The PC comprised 43 members drawn from a wide cross section of the software engineering community. The PC members worked hard to put the program of research papers together. Each PC member received an average of 22 papers to review prior to the PC meeting, followed by a substantial e-mail conversation and two full days discussing papers at the PC meeting. It was our pleasure and privilege to work with such a professional group of people to produce the quality of the program before you. Our deepest thanks go to the PC.We must also thank the organizers of SIGSOFT FSE 2005, who generously hosted our PC meeting and assisted in numerous local arrangements. In particular, we thank Dick Taylor, Debra Brodbeck, and Susan Knight. Their help in producing a trouble-free, enjoyable PC meeting helped keep the PC's spirits high through two long days.We would be remiss if we did not lavish praise and thanks on Richard van de Stadt and the CyberChair conference management system. CyberChair streamlined many of the PC's activities, and Richard added several new features to CyberChair that saved us days of work in staging the PC meeting.Finally, we thank our General Chair, Catalin Roman, for bringing us together, making us partners in creating ICSE 2005, and giving us the guidance and freedom we needed to create the best possible research program. In doing so, he has given us one of the most rewarding experiences of our professional lives.
Combinatorial completion by rule definition with interactive value colouring
Authors: Michael Breen
Venue: ACM SIGSOFT Software Engineering Notes (2005)

The combinatorial completion problem arises where one wishes to define a set of rules which collectively address all possible combinations of circumstances, as, for example, in a decision table. After some rules have been defined but, e.g., millions of cases remain to be addressed, how can the specifier best be helped to complete the remaining rules so that they cover every possible scenario? A novel technique is described based on providing interactive feedback to the user during rule definition. This can be used with non-tabular as well as tabular rules. Where previously quality would have depended on essentially sample-based approaches like testing, this technique makes it easy to adopt a rigorously complete approach to considering large numbers of possibilities.
Simulation Verification and Validation by Dynamic Policy Enforcement
Authors: W. T. Tsai, X. Liu, Y. Chen, R. Paul
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

This paper presents a new verification and validation (V&V) technique for simulation using dynamic policy enforcement. Constraints are formally specified as policies, and they will be used to check whether simulation satisfies these policies at runtime. This paper also proposes a development framework where policies are developed along with system development and V&V. Once policies are extracted from requirements and specified in a policy specification language, the rest of the development work is automatically performed by the tools in the framework. Both security requirements and functional requirements can be specified as policies and dynamically enforced during the simulation. An automated tool is available for policy specification and enforcement, and it is fully integrated with the simulation infrastructure. This paper also presents a sample system that is modeled and simulated, and policies are used to verify and validate the system model. The paper also discusses the overhead imposed to perform this kind of automated policy-based V&V compared to the hard-coded implementation of the same approach.
Constrained Global Optimization of Expensive Black Box Functions Using Radial Basis Functions
Authors: Rommel G. Regis, Christine A. Shoemaker
Venue: Journal of Global Optimization (2005)

We present a new strategy for the constrained global optimization of expensive black box functions using response surface models. A response surface model is simply a multivariate approximation of a continuous black box function which is used as a surrogate model for optimization in situations where function evaluations are computationally expensive. Prior global optimization methods that utilize response surface models were limited to box-constrained problems, but the new method can easily incorporate general nonlinear constraints. In the proposed method, which we refer to as the Constrained Optimization using Response Surfaces (CORS) Method, the next point for costly function evaluation is chosen to be the one that minimizes the current response surface model subject to the given constraints and to additional constraints that the point be of some distance from previously evaluated points. The distance requirement is allowed to cycle, starting from a high value (global search) and ending with a low value (local search). The purpose of the constraint is to drive the method towards unexplored regions of the domain and to prevent the premature convergence of the method to some point which may not even be a local minimizer of the black box function. The new method can be shown to converge to the global minimizer of any continuous function on a compact set regardless of the response surface model that is used. Finally, we considered two particular implementations of the CORS method which utilize a radial basis function model (CORS-RBF) and applied it on the box-constrained Dixon--Szegö test functions and on a simple nonlinearly constrained test function. The results indicate that the CORS-RBF algorithms are competitive with existing global optimization algorithms for costly functions on the box-constrained test problems. The results also show that the CORS-RBF algorithms are better than other algorithms for constrained global optimization on the nonlinearly constrained test problem.
A Simulated Annealing Approach for Mobile Location Management
Authors: Javid Taheri, Albert Y. Zomaya
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

In this paper, a new approach to solve the mobile location management problem that employs the location area scheme is proposed. Furthermore, the approach integrates the location areas scheme into the Simulated Annealing algorithm to find optimal configurations. The proposed approach is used to find the best configurations for a range of test networks. The results provide new insight into the mobility management problem.
Efficient Mapping of Hierarchical Trees on Coarse-Grain Reconfigurable Architectures
Authors: F. Rivera, M. Sanchez-Elez, M. Fernandez, R. Hermida, N. Bagherzadeh
Venue: Proceedings of the international conference on Hardware/Software Codesign and System Synthesis: 2004 (2004)

Reconfigurable architectures have become increasingly important in recent years. In this paper we present an approach to the problem of executing 3D graphics interactive applications onto these architectures. The hierarchical trees are usually implemented to reduce the data processed, thereby diminishing the execution time. We have developed a mapping scheme that parallelizes the tree execution onto a SIMD reconfigurable architecture. This mapping scheme considerably reduces the time penalty caused by the possibility of executing different tree nodes in SIMD fashion. We have developed a technique that achieves an efficient hierarchical tree execution taking decisions at execution time. It also promotes the possibility of data coherence in order to reduce the execution time. The experimental results show high performance and efficient resource utilization on tested applications.
An improved study of real-time fluid simulation on GPU: Research Articles
Authors: Enhua Wu, Youquan Liu, Xuehui Liu
Venue: Computer Animation and Virtual Worlds (2004)

Taking advantage of the parallelism and programmability of GPU, we solve the fluid dynamics problem completely on GPU. Different from previous methods, the whole computation is accelerated in our method by packing the scalar and vector variables into four channels of texels. In order to be adaptive to the arbitrary boundary conditions, we group the grid nodes into different types according to their positions relative to obstacles and search the node that determines the value of the current node. Then we compute the texture coordinates offsets according to the type of the boundary condition of each node to determine the corresponding variables and achieve the interaction of flows with obstacles set freely by users. The test results prove the efficiency of our method and exhibit the potential of GPU for general-purpose computations. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Robotic method of taking the initiative in eye contact
Authors: Yoshinori Kuno, Dai Miyauchi, Akio Nakamura
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

Eye contact is an effective means of controlling human communication, such as in starting communication. It seems that we can make eye contact if we simply look at each other. However, this alone does not establish eye contact. Both parties also need to be aware of being watched by the other. We proposed an eye-contact method between humans and robots satisfying these two conditions. In our previous work, however, we mainly consider eye contact from humans to robots. In this paper, we consider the reversal case. We deal with cases where a robot wants to start communication with a particular person. In such cases, the robot needs to make the person aware of its gaze. The robot should make the person feel clearly that it is none other than him/her who the robot is looking at. We show through experiments that the body action of the robot is effective for this.