ppxscal/embedding_network huggingface dataset:
Haptizing a Surface Height Change with Varying Stiffness Based on Force Constancy: Effect of Surface Normal Render
Authors: Jaeyoung Cheon, Seungmoon Choi
Venue: Proceedings of the Second Joint EuroHaptics Conference and Symposium on Haptic Interfaces for Virtual Environment and Teleoperator Systems (2007)

This work has been motivated by our prior efforts for perceptualizing the scientific data sets of surface topography and stiffness distribution measured with a scanning probe microscope. Previously, we showed that the surface topography information with varying stiffness rendered with the conventional penalty-based method can be distorted [5], and developed a topography compensation algorithm based on the theory of force constancy in order to resolve the problem [3]. The theory of force constancy states that the user maintains an invariant contact force level when s/he strokes a surface to perceive its topography. As a follow-up study, this paper investigates the benefits of including surface normal rendering in the haptization of a surface height change with varying stiffness, through a simulation and a psychophysical experiment. Adequate surface normal rendering creates lateral force cues when a haptic interface tool crosses a height change interval. The results indicated that surface normal rendering facilitates correct perception of surface height changes, in particular, for very low height changes.
Channel estimation from known preamble sequences
Authors: K. Raja Rajeswari, N. Gangatharan, E. MorrisG, G. S. V. Radhakrishna Rao, B. Visvesvara Rao, G. N. Swamy
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 01 (2002)

The least sum of squared estimation (LSSE)channel estimation algorithm is applied for determining a channel impulse response from known preamble sequences. Optimum training sequences are designed for different channel responses and training sequence lengths. The effect of channel estimation errors on the performance of some data detectors is also investigated. As a special case some non-maximal length sequences and ternary sequences (with alphabet 0, /spl plusmn/1) are also considered for performance evaluation.
An Empirical Exploration of How Process Standardization Reduces Outsourcing Risks
Authors: Kim Wullenweber, Tim Weitzel
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Are standardized business processes less risky to outsource? Despite the importance of both areas, neither the outsourcing nor standardization literature has so far offered a conclusive picture of the value of standards to outsourcing. We aim to provide an exploratory first step by suggesting that process standards have a positive impact on business process outsourcing (BPO) risk. Theoretically drawing from perceived risk theory and the theory of reasoned action we develop a model of BPO risk and empirically show that indeed risk perception is higher for less standardized processes. Using data from 126 German banks, it turns out that financial and performance risks significantly differ between high- and low-standardized processes and are consistently higher for low-standardized processes. While this work is very exploratory and the findings are quite preliminary, they are very encouraging as they indicate promising further research into the value of standards for business processes and outsourcing.
The refdbms distributed bibliographic database system
Authors: Richard A. Golding, Darrell D. E. Long, John Wilkes
Venue: Proceedings of the USENIX Winter 1994 Technical Conference on USENIX Winter 1994 Technical Conference (1994)

Refdbms is a database system for sharing bibliographic references among many users at sites on a wide-area network such as the Internet. This paper describes our experiences in building and using refdbms for the last two years. It summarizes the collection of facilities that refdbms provides, and gives detailed information on how well refdbms functions as a collaborative, wide-area, distributed information system.
Enhanced unified modeling language model-checking for business software applications
Authors: David C. Rine
Venue:  (2007)

The industry standard Unified Modeling Language (UML) tool provides the software developer little guidance about whether proposed sets of UML diagrams are sensible representations approaching satisfaction of domain application requirements. Standard automated-UML-checkers do not check for omission of critical types of domain UML elements, nor for dependency relationships between different functional types of these elements. This dissertation developed an enhanced UML-checking-tool which focuses on three conceptual groups of keystone UML elements that organize automated-UML-checking for business applications software design. In addition, a complementary UML methodology is proposed which further organizes UML business software application development by emphasizing preference of reusable UML elements representing software from legacy applications, from commercial-off-the-shelf (COTS) components, and from software design patterns. Evaluations of the dissertation prototype against the industry standard automated-UML-checker showed improved checking that highlights conflicts and dependencies among conceptual building-blocks for a specific domain. This research demonstrates how knowledge representation in the form of UML elements can be translated into a format that can be subjected to enhanced automated-rule-checking.
A Partition-of-Unity Based Algorithm for Implicit Surface Reconstruction Using Belief Propagation
Authors: Yi-Ling Chen, Shang-Hong Lai
Venue: Proceedings of the IEEE International Conference on Shape Modeling and Applications 2007 (2007)

In this paper, we propose a new algorithm for the fundamental problem of reconstructing surfaces from a large set of unorganized 3D data points. The local shapes of the surface are recovered by variational implicit surface represented as a weighted combination of radial basis functions. The variational implicit patches are then combined together to form the overall surface via a set of blending functions, which is also referred to as the partition-of-unity method. The reconstruction algorithm first partitions the input point set by octree subdivision and surface normal estimation is performed so as to orientate the local variational implicit patches. A new graph optimization scheme based on the belief propagation framework is proposed to determine the global consistent orientation for the entire set of data points. To achieve multi-scale reconstruction, we propose a novel progressive reconstruction algorithm which utilizes the Schur complement formula to reduce the computational cost of iteratively updating the radial basis function coefficients. Finally, we demonstrate the performance of the proposed algorithm by showing experimental results on some real-world 3D data sets.
Tangible User Interfaces for Cognitive Assistance
Authors: Baptiste Boussemart, Sylvain Giroux
Venue: Proceedings of the 21st International Conference on Advanced Information Networking and Applications Workshops - Volume 02 (2007)

Information technologies can help cognitively impaired people in planning and memory tasks. Though many projects already address such issues, they still use standard HCI and computers. Tangible User Interfaces (TUI) emerge as a new way to use a computer. They can improve the interactions and situatedness with respect to traditional HCI. In this paper, we present how we can use TUIs plan to build a cognitive assistant for activities of daily living on the form of an interactive table in a kitchen. Interactions are modelled with Token And Constraints paradigm (TAC), which may allow the user to have a better experience and to be more independent. We have implemented a Token and Constraint (TAC) layer using the capacities of object-oriented programming and XML architecture initialization.
MODIS Image Based Computation of Vegetation Indices in MedioGRID Architecture
Authors: Victor Bacu, Ovidiu Muresan, Dorian Gorgan
Venue: Proceedings of the Eighth International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (2006)

The paper presents MedioGRID platform as a general-purpose solution for satellite image processing on GRID architecture, and exemplifies by the Greenland application the computation of vegetation indices based on MODIS satellite images. The application provides efficient and simple user interactivity through the graphical user interface. The user selects the satellite images by time and geographical area, and specifies the particular processing operations. The performance of the GRID application architecture is evaluated considering a few variables such as number of jobs, number of workers and dimension of satellite images.
The ECE major: why is it so rare?
Authors: J. A. Orr
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

This work in progress paper reports the philosophy and curricular content of a newly-designed electrical and computer engineering major, together with the implementation plan for a change from the EE major to the ECE major. The reasons for the current small number of ECE programs are discussed, along with an explanation of changes which make the ECE major more feasible. The rationale for offering a single ECE major, rather than offering students the option of both EE and computer engineering majors is presented.
Knowledge and Choice Uncer tainty Affect Consumer Search and Buying Behavior
Authors: Theresa Lauraeus-Niinivaara, Timo Saarinen, Anssi Oorni
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Pre-purchase search is an activity which most consumers engage in frequently to extract up-to-date information for a purchase decision. Search is an interesting topic from the practical and academic point of view. We approach the topic by observing the information needs through the concept of uncertainty. Uncertainty is the driving force of consumer search. Search is costly and, thus, no search would be likely to occur if consumers had a perfect knowledge about their preferences and market offerings. While uncertainty is widely acknowledged as the driving force of search, few attempts have been made to relate uncertainty and the choice of pre-purchase information. We studied the generic types of consumer prepurchase uncertainty: knowledge uncertainty and choice uncertainty, and the connection between uncertainty dimensions and the extent of the search process. Our findings suggest that the aforementioned uncertainties markedly affect the consumer search process and are useful determinants of consumer behavior in pre-purchase deliberation.
Fuzzy color histogram: an efficient color feature for image indexing and retrieval
Authors: Ju Han
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2000. on IEEE International Conference - Volume 04 (2000)

The conventional color histogram (CCH) considers neither the color similarity across different bins nor the color dissimilarity in the same bin, thus it is sensitive to noisy interference such as illumination changes. We propose a new concept of color histogram representation, called fuzzy color histogram (FCH), to address the above mentioned issue by considering the color similarity of each pixel's color associated to all the histogram bins through fuzzy-set membership function, individually. A novel and fast approach for computing the membership values based on fuzzy c-means algorithm is introduced. The proposed FCH is further exploited in the application of image indexing and retrieval. Experimental results clearly show that FCH yields better retrieval results than CCH. In addition, in contrast with quadratic histogram distance, our method shifts the computation load from on-line retrieval to off-line indexing. Such computing methodology is fairly desirable for image retrieval over large image databases.
Two-Dimension Maximum Entropy Image Segmentation Approach Based on Chaotic Optimization
Authors: Xue-Feng Zhang, Jiu-Lun Fan, Feng Zhao
Venue: Proceedings of the 16th International Conference on Artificial Reality and Telexistence--Workshops (2006)

Chaotic optimization is a new optimization technique. Conventional two-dimension chaotic sequence is not a good way to two-dimension gray histogram image segmentation because it is proportional distributing in [0,1] x [0,1] . In order to generate a better chaotic sequence that is fit to two-dimension gray histogram. A chaotic sequence generating method is proposed based on Arnold chaotic system and Bbzier curve generating algorithm. The main feature of the new chaotic sequence is that its distribution is approximately inside a disc whose center is (0.5,0.5), this means that the sequence is superior to Arnold chaotic sequences in image segmenting. As application, a two-dimension maximum entropy image segmentation method is presented based on chaotic optimization. Simulation results show that our method has better segmentation effect and lower computation time than the original two-dimension maximum entropy method.
Comparative models ruled by possibility and necessity: A conditional world
Authors: Giulianella Coletti, Barbara Vantaggi
Venue: International Journal of Approximate Reasoning (2007)

Any dynamic decision model needs to deal with conditional events and conditional uncertainty measures. Moreover, to avoid the introduction of not available information in decision processes, we should refer to domains containing only the elements of interest. According to the aforementioned guidelines we study the comparative uncertainty framework for decision models referring to possibility and necessity measures: we consider binary relations, defined on an arbitrary set of conditional events and we provide a complete characterization in terms of necessary and sufficient conditions for their representability by a conditional possibility and by a conditional necessity.
Is Return on Investment a Valid Criterion for Investing in Mobile Healthcare?
Authors: Norm
Venue: Proceedings of the International Conference on the Management of Mobile Business (2007)

The business model for adopting mobile solutions is the economic justification for an organization's use of the technology, or the means by which the technology generates a value proposition. However, the business model involves considerations of not just economic factors that lead to return on investment calculations, but intangible factors such as quality of life for caregivers and patients. This paper examines considerations of both economic and intangible factors, suggests possible approaches that support the rational consideration of all the relevant factors when evaluating mobile technologies for healthcare, and demonstrates an actual example of a return on investment model.
Data embedding in audio: where do we stand
Authors: A. H. Tewfik
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1999. on 1999 IEEE International Conference - Volume 04 (1999)

Summary form only given. Data embedding algorithms embed binary streams in host multimedia signals. The embedded data can add features to the host multimedia signal or provide copyright protection. We review requirements for transparent data embedding techniques in audio signals. We describe and contrast current approaches to data embedding in audio. In particular, we emphasize the advantages and limitations of the various approaches. We also describe possible signal processing and protocol level attacks on audio watermarking algorithms. We conclude with a discussion of future research directions.
Creating 3D virtual heads from video sequences: a recursive approach by combining EKF and DFFD
Authors: Kyoungho Choi
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

An automatic system for creating a virtual head that is compatible with MPEG-4 facial object specification is presented. Color classification and a valley detection filter are performed to find face and facial definition points (FDPs) at the initialization stage. Extracted FDPs are tracked by normalized correlation and their trajectories are fed into an extended Kalman filter (EKF) to recover camera geometry, facial orientation, and depth of selected FDPs. Based on a recovered point-wise 3D structure, Dirichlet free-form deformations (DFFD) is applied to deform a generic 3D model. Once a virtual head is created, the head can be used to track FDPs for large out-of-plane rotations and to update the head model continuously based on refined depth information. A complete texture map is created by mixing frontal and rotated faces based on the recovered face orientation.
Mean-variance performance optimization of response time in a tandem router network with batch arrivals
Authors: Nalan Gülpınar, Uli Harder, Peter Harrison, Tony Field, Berç Rustem, Louis-Francois Pau
Venue: Cluster Computing (2007)

The end-to-end performance of a simple wireless router network with batch arrivals is optimized in an M/G/1 queue-based, analytical model. The optimization minimizes both the mean and variance of the transmission delay (or `response time'), subject to an upper limit on the rate of losses and finite capacity queueing and recovery buffers. Losses may be due to either full buffers or corrupted data. The queueing model is also extended to higher order moments beyond the mean and variance of the response time. The trade-off between mean and variance of response time is assessed and the optimal ratio of arrival-buffer size to recovery-buffer size is determined, which is a critical quantity, affecting both loss rate and transmission time. Graphs illustrate performance in the near-optimal region of the critical parameters. Losses at a full buffer are inferred by a time-out whereas corrupted data is detected immediately on receipt of a packet at a router, causing a N-ACK to be sent upstream. Recovery buffers hold successfully transmitted packets so that on receiving a N-ACK, the packet, if present, can be retransmitted, avoiding an expensive resend from source. The impact of the retransmission probability is investigated similarly: too high a value leads to congestion and so higher response times, too low and packets are lost forever.
Process Replication with Log-Based Amnesia Support
Authors: Ruben de Juan-Marin, Luis Irun-Briz, Francesc D. Munoz-Escoi
Venue: Proceedings of the Sixth International Symposium on Parallel and Distributed Computing (2007)

Process replication is used for providing highly available and fault-tolerant systems. Traditionally, for simplicity reasons they have assumed the crash-stop failure model. This paper, instead, encourages the use of the crash-recovery with partial amnesia failure model when managing large state amounts, presenting the arising problems of this assumption and outlining how they can be managed. Finally, an overhead analysis is presented.
Automatic Alignment of Color Imagery onto 3D Laser Radar Data
Authors: Alexandru Vasile, Frederick R. Waugh, Daniel Greisokh, Richard M. Heinrichs
Venue: Proceedings of the 35th Applied Imagery and Pattern Recognition Workshop (2006)

We present an algorithm for the automatic fusion of city-sized, 2D color imagery to 3D laser radar imagery collected from distinct airborne platforms at different times. Our approach is to derive pseudo-intensity images from ladar imagery and to align these with color imagery using conventional 2D registration algorithms. To construct a pseudo-intensity image, the algorithm uses the color imagery's time of day and location to predict shadows in the 3D image, then determines ambient and sun lighting conditions by histogram matching the 3D-derived shadowed and non-shadowed regions to their 2D counterparts. A projection matrix is computed to bring the pseudoimage into 2D image coordinates, resulting in an initial alignment of the imagery to within 200 meters. Finally, the 2D intensity image and 3D generated pseudo-intensity image are registered using a modified normalized correlation algorithm to solve for rotation, translation, scale and lens distortion, resulting in a fused data set that is aligned to within 1 meter. Applications of the presented work include the areas of augmented reality and scene interpretation for persistent surveillance in heavily cluttered and occluded environments.
Combining Theorem Proving with Model Checking through Predicate Abstraction
Authors: Sandip Ray, Rob Sumners
Venue: IEEE Design Test (2007)

This article presents a procedure for proving invariants of infinite-state reactive systems using a combination of two formal verification techniques: theorem proving and model checking. This method uses term rewriting on the definition of the target system to reduce an invariant proof of the target system to a reachability analysis on a finite predicate abstraction, which can be discharged through model checking. The method affords substantial automation in invariant proofs, while preserving the expressiveness and control afforded by theorem proving. The authors discuss how their approach enables the two disparate techniques, theorem proving and model checking, to complement one another. The procedure has been interfaced with the ACL2 theorem prover, and the authors describe its use in verifying cache coherence protocols in ACL2.
Temporal Relations of Intervals with a Gap
Authors: Max J. Egenhofer
Venue: Proceedings of the 14th International Symposium on Temporal Representation and Reasoning (2007)

Forty-four relations are found between an interval and an interval with a gap ( r_IIg ), capturing semantics that are distinct from those of the sets of constituting intervals and at a higher semantic level than pure pointbased models. The relations' conceptual neighborhood graph evolves as a refinement of the graph of Allen's thirteen binary relations between intervals, primary due to more details revealed about five of the thirteen interval relations. The compositions of r_IIg with their converse relations r_IgI reveal that the interval compositions form an upper bound within which the gaps reduce the set of possible inferences, sometimes up to yielding unique inferences where interval compositions are fully undetermined.
Analysis for Topological Properties of the Network Feeding Usenet News
Authors: Yutaka Nakano, Motonori Nakamura, Yasuo Okabe
Venue: Proceedings of the 2007 International Symposium on Applications and the Internet (2007)

Recently, many studies have reported that various kinds of real networks, such as WWW, the Internet, metabolic system, BtoB transactions and so on, have the scale-free properties in common. We focus on the network feeding Usenet news where a node represents a news server and a link between two nodes represents a connection on which the two news servers exchane their articles. First we generate the whole topology map approximately from path information of a number of Usenet news articles. Then we examine topological properties of the network; degree distribution, degree correlation, average distance, clustering coefficient and community structures. We also compare these properties with those of theoretical network models. The analysis shows that there strongly exist a scale-free and a smallworld properties in the Usenet network. We also examine the community structure of this network and show that a small number of Usenet news servers that are highly contributive for article feeds forms the largest community and other servers tend to be categorized by their geographical locations.