ppxscal/embedding_network huggingface dataset:
A Novel Representation and Feature Matching Algorithm for Automatic Pairwise Registration of Range Images
Authors: A. S. Mian, M. Bennamoun, R. A. Owens
Venue: International Journal of Computer Vision (2006)

Automatic registration of range images is a fundamental problem in 3D modeling of free-from objects. Various feature matching algorithms have been proposed for this purpose. However, these algorithms suffer from various limitations mainly related to their applicability, efficiency, robustness to resolution, and the discriminating capability of the used feature representation. We present a novel feature matching algorithm for automatic pairwise registration of range images which overcomes these limitations. Our algorithm uses a novel tensor representation which represents semi-local 3D surface patches of a range image by third order tensors. Multiple tensors are used to represent each range image. Tensors of two range images are matched to identify correspondences between them. Correspondences are verified and then used for pairwise registration of the range images. Experimental results show that our algorithm is accurate and efficient. Moreover, it is robust to the resolution of the range images, the number of tensors per view, the required amount of overlap, and noise. Comparisons with the spin image representation revealed that our representation has more discriminating capabilities and performs better at a low resolution of the range images.
A Study on the Application of DVE to a Mental Support System for the Aged Segregated from Family
Authors: Yasuyuki Okano, Yoshinori Ito, Tohei Nitta
Venue: Proceedings of the First IEEE International Workshop on Horizontal Interactive Human-Computer Systems (2006)

A DVE system is proposed to support the aged people mentally when they are segregated from family. It gives a new way for them to get together with family members, relatives and old friends who are living at distant locations. All the participants show up on the screen in front of each participant in the form of avatars and share a common virtual place through the Internet. By the system, they can play games, watch pictures and videos together with other participants. They may even sing together. The system is designed putting more emphasis to the pleasant atmosphere of being together rather than mimicking a real meeting. Plural TableTop devices are used for the participants at distant locations to input data to manipulate their avatars and move the objects in the virtual place. As those TableTop devices collect data by simply touching and dragging a part of the projection image on top, the burdens of the aged users are greatly eased by this scheme.
A Pitch-Based Rapid Speech Segmentation for Speaker Indexing
Authors: Min Yang, Yingchun Yang, Zhaohui Wu
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

Segmentation of continuous audio is an important processing in many applications. In speaker indexing, the reliability of speaker model depends much on segmentation. Commonly used methods are based on the Bayesian Information Criteria (BIC), which is however not so capable when dealing with short utterances. In this paper, we present a pitch-based speech segmentation method, which can detect frequent speaker changes accurately and rapidly. In our algorithm, pitch is introduced in speaker segmentation. Firstly, utterance segments are detected by pitch. Then distances of pitch are computed, and compared with a self-adaptable threshold. Speaker changes are finally decided among utterance segments. We applied our method and three comparative methods on the HUB4-NE broadcast data. Speaker indexing experiments have been taken following each algorithm. We also suggested two indicators as complements of false alarm and missing rate in the evaluation of segmentation. The experiment results show that our algorithm works faster and better, with most of short time speaker changes detected. Speaker indexing equal error rate of our method is 10.43%, which is much lower than 12.94%, 25.84% and 15.91% of other methods.
Synthetic Aperture Focusing using a Shear-Warp Factorization of the Viewing Transform
Authors: Vaibhav Vaish, Gaurav Garg, Eino-Ville Talvala, Emilio Antunez, Bennett Wilburn, Mark Horowitz, Marc Levoy
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Workshops - Volume 03 (2005)

Synthetic aperture focusing consists of warping and adding together the images in a 4D light field so that objects lying on a specified surface are aligned and thus in focus, while objects lying of this surface are misaligned and hence blurred. This provides the ability to see through partial occluders such as foliage and crowds, making it a potentially powerful tool for surveillance. If the cameras lie on a plane, it has been previously shown that after an initial homography, one can move the focus through a family of planes that are parallel to the camera plane by merely shifting and adding the images. In this paper, we analyze the warps required for tilted focal planes and arbitrary camera configurations. We characterize the warps using a new rank- 1 constraint that lets us focus on any plane, without having to perform a metric calibration of the cameras. We also show that there are camera configurations and families of tilted focal planes for which the warps can be factorized into an initial homography followed by shifts. This shear-warp factorization permits these tilted focal planes to be synthesized as efficiently as frontoparallel planes. Being able to vary the focus by simply shifting and adding images is relatively simple to implement in hardware and facilitates a real-time implementation. We demonstrate this using an array of 30 videoresolution cameras; initial homographies and shifts are performed on per-camera FPGAs, and additions and a final warp are performed on 3 PCs.
Equivalent finite fuzzy sets and Stirling numbers
Authors: V. Murali
Venue: Information Sciences: an International Journal (2005)

In this paper we study the number of k-level equivalence classes of fuzzy subsets of a finite set of n elements under a natural equivalence. This number is related to Stirling numbers. Viewing fuzzy subsets as functions from a set into the unit interval, we also associate a kernel partition with every equivalence class of fuzzy subsets. After some elementary properties of the equivalence, we provide a recurrence relation and a generating function concerning the number of k-level fuzzy subsets using Stirling numbers.
Evaluating the effectiveness of and patterns of interactions with automated searching assistance: Research Articles
Authors: Bernard J. Jansen, Michael D. McNeese
Venue: Journal of the American Society for Information Science and Technology (2005)

We report quantitative and qualitative results of an empirical evaluation to determine whether automated assistance improves searching performance and when searchers desire system intervention in the search process. Forty participants interacted with two fully functional information retrieval systems in a counterbalanced, within-participant study. The systems were identical in all respects except that one offered automated assistance and the other did not. The study used a client-side automated assistance application, an approximately 500,000-document Text REtrieval Conference content collection, and six topics. Results indicate that automated assistance can improve searching performance. However, the improvement is less dramatic than one might expect, with an approximately 20&percnt; performance increase, as measured by the number of user-selected relevant documents. Concerning patterns of interaction, we identified 1,879 occurrences of searcher&ndash; system interactions and classified them into 9 major categories and 27 subcategories or states. Results indicate that there are predictable patterns of times when searchers desire and implement searching assistance. The most common three-state pattern is Execute Query&ndash;View Results: With Scrolling&ndash;View Assistance. Searchers appear receptive to automated assistance; there is a 71&percnt; implementation rate. There does not seem to be a correlation between the use of assistance and previous searching performance. We discuss the implications for the design of information retrieval systems and future research directions. &copy; 2005 Wiley Periodicals, Inc.
A Multi-Property Trust Model for Reconfiguring Component Software
Authors: Minghui Zhou, Hong Mei, Lu Zhang
Venue: Proceedings of the Fifth International Conference on Quality Software (2005)

While component software continues to grow in size and complexity, it becomes increasingly difficult to ensure qualities for component services, especially at run-time. This paper focuses on a framework on middleware for dynamic re-configuration of components of different qualities from the view of trust. Firstly, a trust management model is built, in which the management framework and measurement model are presented. Secondly, the reconfiguration algorithm is described based on the model. Thirdly, the trust management is implemented as a kind of public services and some tools on a J2EE-compliant middleware platform, i.e., PKUAS. Finally, the related work is discussed and compared with our research.
Prudent Semantics for Argumentation Frameworks
Authors: Sylvie Coste-Marquis, Caroline Devred, Pierre Marquis
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

We present new prudent semantics within Dung's theory of argumentation. Under such prudent semantics, two arguments cannot belong to the same extension whenever one of them attacks indirectly the other one. We argue that our semantics lead to a better handling of controversial arguments than Dung's ones. We compare the prudent inference relations induced by our semantics w.r.t. cautiousness; we also compare them with the inference relations induced by Dung's semantics.
Code Placement and Replacement Schemes for WCDMA Rotated-OVSF Code Tree Management
Authors: Yuh-Shyan Chen
Venue: IEEE Transactions on Mobile Computing (2006)

Orthogonal variable spreading factor (OVSF) channelization codes are widely used to provide variable data rates for supporting different bandwidth requirements in wideband code division multiple access (WCDMA) systems. Many novel works in the literature have intensively investigated code placement and replacement schemes in OVSF code trees to reduce the code blocking probability and the code reassignment cost. In this paper, we introduce a new code tree structure, namely, a rotated-orthogonal variable spreading factor (ROVSF) code tree, whose code capacity is the same as that of the traditional OVSF code tree. This work addresses both code placement and replacement schemes in the ROVSF code tree system, where ROVSF codes can be used at the forward link of WCDMA systems. Some valuable properties of the developed ROVSF code tree are presented to develop code placement/replacement schemes with lower code blocking probability and less code reassignment cost. The main contribution of our scheme is to identify linear-code chains (LCCs) and nonlinear-code trees (NCTs) in the ROVSF code tree. This work exploits the unsequence property of linear-code chains to design a new code placement and replacement mechanism. Our code placement/replacement schemes initially attempt to allocate request codes on LCCs and, then, to allocate them to NCTs. Using LCCs with the unsequence property allows us to efficiently reduce the code blocking probability and the code reassignment cost. Extensive simulations are conducted to illustrate that our code placement/replacement results based on the ROVSF code tree actually improve the code blocking probability and the code reassignment cost.
Impact of prospective computerized clinical decision support information and targeted assistance on nursing home resident outcomes
Authors: Colene M. Byrne
Venue:  (2005)

This research addresses two major research topics: (1) the role of nursing informatics in improving clinical decision-making and reducing errors, and (2) acceptance and adoption of health information technology (IT) for improved patient safety and quality. The goal of this research was to determine whether preventable adverse outcomes in long-term care (LTC) settings such as nursing homes could be reduced by providing prospective computerized information to alert nursing and other staff to the resident-specific risk factors and likelihood of the problem occurring, so that preventive actions could be taken. A quasi-experimental research design was used to compare outcomes between nursing homes that had access to this information via web-based risk reports with a matched control group of nursing homes that did not have access to the risk reports. This research in patient safety and nursing informatics is pertinent to LTC, and focuses on two very common, serious, and preventable patient safety issues&mdash;falls and pressure ulcers, which account for an estimated 75% of all nursing home litigation and often result in poor regulatory surveys. Most nursing home staff do not have timely and ready access to their own resident assessment data called the Minimum Data Set (MDS), despite the fact that nursing homes collect and submit this data at least every quarter. Clinical support tools for nurses, especially LTC nurses, have been limited and slow to be adopted, due to many factors, such as low investment in IT and computer training, and the lack of useful, high-quality clinical decision-support applications relevant to the nursing home population. The MDS, risk assessment data, and surveys and interviews with nursing home staff were used to determine if the MDS-based risk models predicted falls and pressure ulcers better than common risk assessment tools, and to identify factors that facilitated and inhibited use and integration of the computerized clinical decision-making tools by nursing home staff. These factors included nursing home characteristics, facilitation, and organizational climate. A framework for understanding the use of new informatics tools is presented, based on research on organizational culture, change, and adoption of evidence-based information in health care.
Performance Analysis of Grinding Process via Particle Swarm Optimization
Authors: T. O. Ting, T. S. Lee, Than H. Tay
Venue: Proceedings of the Sixth International Conference on Computational Intelligence and Multimedia Applications (2005)

Optimization is necessary for the control of any process to achieve better product quality, high productivity with low cost. The grinding of silicon carbide is not an easy task due to its low fracture toughness, making the material sensitive to cracking. The efficient grinding involves the optimal selection of operating parameters to maximize the Material Removal Rate (MRR) while maintaining the required surface finish and limiting surface damage. In this work, optimization based on the available model has been carried out to obtain optimum parameters for silicon carbide grinding via Particle Swarm Optimization (PSO) based on the objective of maximizing MRR with reference to surface finish and damage. Results obtained are superior in comparison with Genetic Algorithm (GA) approach.
Estimation of a fluorescent lamp spectral distribution for color image in machine vision
Authors: Galo Corzo, Antonio Pe&#x00f1;aranda, Peter Peer
Venue: Machine Vision and Applications (2005)

We present a technique to quickly estimate the Illumination Spectral Distribution (ISD) in an image illuminated by a fluorescent lamp. It is assumed that the object colors are a set of colors for which spectral reflectances are available (in our experiments we use spectral measurements of 12 colors checker chart), the sensitivities of the camera sensors are known and the camera response is linear. Thus, the ISD can be approximated by a finite linear combinations of a small number of basis functions.
Performance Analysis of Multi-Fiber Synchronous Photonic Share-per-link Packet Switches
Authors: Ayman G. Fayoumi, Fahad A. Al-Zahrani, Abdulgader A. Habiballa, Anura P. Jayasumana
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

A performance model is presented for an optical packet switch architecture in which the wavelength converters are shared per output link and each output link consists of multiple fibers. Symmetry of the switch is exploited to derive the packet loss probability for the case where traffic is destined to different output ports with equal probability. The architecture performance is evaluated by means of an analytical model and confirmed by simulations under different switch parameter configurations. Wavelength converters are shown to improve the packet loss probability of the switch. The study shows that synchronous switches equipped with full conversion would have the least conversion utilization rate indicating that the use of a switch with less converter count, i.e., partial conversion, would offer better switch resources utilization and comparable packet loss performance.
Repair and capping of porous MSQ films using chlorosilanes and supercritical CO2
Authors: B. Xie, L. Choate, A. J. Muscat
Venue: Microelectronic Engineering (2005)

article-77-abstract
Reasoning about static and dynamic properties in alloy: A purely relational approach
Authors: Marcelo F. Frias, Carlos G. López Pombo, Gabriel A. Baum, Nazareno M. Aguirre, Thomas S. E. Maibaum
Venue: ACM Transactions on Software Engineering and Methodology (TOSEM) (2005)

We study a number of restrictions associated with the first-order relational specification language Alloy. The main shortcomings we address are:---the lack of a complete calculus for deduction in Alloy's underlying formalism, the so called relational logic,---the inappropriateness of the Alloy language for describing (and analyzing) properties regarding execution traces.The first of these points was not regarded as an important issue during the genesis of Alloy, and therefore has not been taken into account in the design of the relational logic. The second point is a consequence of the static nature of Alloy specifications, and has been partly solved by the developers of Alloy; however, their proposed solution requires a complicated and unstructured characterization of executions.We propose to overcome the first problem by translating relational logic to the equational calculus of fork algebras. Fork algebras provide a purely relational formalism close to Alloy, which possesses a complete equational deductive calculus. Regarding the second problem, we propose to extend Alloy by adding actions. These actions, unlike Alloy functions, do modify the state. Much the same as programs in dynamic logic, actions can be sequentially composed and iterated, allowing them to state properties of execution traces at an appropriate level of abstraction.Since automatic analysis is one of Alloy's main features, and this article aims to provide a deductive calculus for Alloy, we show that:---the extension hereby proposed does not sacrifice the possibility of using SAT solving techniques for automated analysis,---the complete calculus for the relational logic is straightforwardly extended to a complete calculus for the extension of Alloy.
A Rate Control Framework for Supporting Multiple Classes of Traffic in Sensor Networks
Authors: Kyriakos Karenos, Vana Kalogeraki, Srikanth V. Krishnamurthy
Venue: Proceedings of the 26th IEEE International Real-Time Systems Symposium (2005)

Wireless sensor network applications typically integrate, within the same network, a variety of sensing devices including those for imaging, sound and temperature. In these settings, multiple flows of packets with different requirements in terms of transmission rates, bandwidth and jitter demands may be initiated towards the sink. Uncontrolled introduction of traffic from sources can cause network overload in areas of the network where the paths of the different flows interfere with each other. Such interference effects may result in congestion which leads to high packet loss and excessive delays. In this paper, we present CoBRA, a framework which incorporates distributed, cluster-based mechanisms to address the problem of congestion by enforcing rate control, for supporting multiple classes of traffic in sensor networks. Towards this goal, CoBRA periodically estimates the collective traffic load and, based on the current conditions, allocates and adjusts rates to sources on per-cluster bases. While doing so, CoBRA takes into consideration interference effects and rate requirements of concurrent flows. We have applied two different rate allocation policies using our framework and, through extensive simulation results we demonstrate its feasibility, effectiveness and performance advantages over traditional approaches.
Swarm-based Sequencing Recommendations in E-learning
Authors: Bert Van den Berg, Rene Van Es, Colin Tattersall, Jose Janssen, Jocelyn Manderveld, Francis Brouns, Hub Kurvers, Rob Koper
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Open and distance Learning (ODL) gives learners freedom of time, place and pace of study, putting learner self-direction centre-stage. However, increased responsibility should not come at the price of over-burdening or abandonment of learners as they progress along their learning journey. This paper introduces an approach to recommending the sequencing of e-learning modules for distance learners based on self-organisation theory. It describes an architecture which supports the recording, processing and presentation of collective learner behaviour designed to create a feedback loop informing learners of successful paths towards the attainment of learning goals. The article includes initial results from a large-scale experiment designed to validate the approach .
New dynamic fuzzy structure and dynamic system identification
Authors: Musa Alci
Venue: Soft Computing - A Fusion of Foundations, Methodologies and Applications (2006)

In this study, a new fuzzy system structure that reduces the number of inputs is proposed for dynamic system identification applications. Algebraic fuzzy systems have some disadvantages due to many inputs. As the number of inputs increase, the number of parameters in the training process increase and hence the classical fuzzy system becomes more complex. In the conventional fuzzy system structure, the past information of both inputs and outputs are also regarded as inputs for dynamic systems, therefore the number of inputs may not be manageable even for &#x201c;single input and single output&#x201d; systems. The new dynamic fuzzy system module (DFM) proposed here has only a single input and a single output. We have carried out identification simulations to test the proposed approach and shown that the DFM can successfully identify non-linear dynamic systems and it performs better than the classical fuzzy system.
Performance evaluation of wireless cellular networks under more realistic assumptions: Research Articles
Authors: Yuguang Fang
Venue: Wireless Communications Mobile Computing (2005)

In wireless cellular networks, performance evaluation is an important part in modeling and designing effective schemes to utilize the limited resource. In the past, performance evaluation was carried out either under restricted assumption on some time variables such as exponential assumption or via simulations. In this paper, we present a survey on a new analytical approach we have developed in the last few years to evaluate the performance of wireless cellular networks under more realistic assumptions. In particular, we apply this approach to the analysis of call connection performance and mobility management under assumptions that many time variables such as call holding time, cell residence time, channel holding time, registration area (RA) residence time, and inter-service time are assumed to be generally distributed and show how we can obtain more general analytical results. Copyright &copy; 2005 John Wiley & Sons, Ltd.