ppxscal/embedding_network huggingface dataset:
A Core of Standards to Support T-learning
Authors: Martin Lopez-Nores, Jose Juan Pazos-Arias, Jorge Garcia-Duque, Yolanda Blanco-Fernandez, Alberto Gil-Solla
Venue: Proceedings of the Sixth IEEE International Conference on Advanced Learning Technologies (2006)

The possibility of transmitting interactive applications along with the audiovisual contents will turn the television into a universal platform to access the Information Society. Nowadays, there is growing interest in exploiting that potential to develop distance learning policies, to supplement the facilities offered by the current e-learning technologies. This short paper describes the implementation of a software module that enables the provision of educational services over Interactive Digital TV (t-learning). This module has been designed according to the technical peculiarities of an IDTV receiver, and resorts to existing standards to favor the convergence of all distance learning mediums.
Using Line and Texture to Visualize Higher-Order Voronoi Diagrams
Authors: James Dean Palmer
Venue: Proceedings of the 3rd International Symposium on Voronoi Diagrams in Science and Engineering (2006)

Higher-order Voronoi diagrams provide a useful tool for studying problems where more than one nearest site is of interest. Understanding and visualizing higher-order Voronoi diagrams is more difficult than ordinary Voronoi diagrams. We propose new techniques using color, line and texture to visualize k-order diagrams. Approaches we develop have several interesting characteristics such as providing useful multi-dimensional information when even a small portion of the figure is available.
Interpolation of lowpass signals at half the Nyquist rate
Authors: F. Marvasti
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1995. on International Conference - Volume 02 (1995)

We describe the interpolation of low pass signals from a class of stable sampling sets at half the Nyquist rate. We also develop formulas based on Lagrange interpolation and suggest practical reconstruction algorithms.
Correctness-preserving synthesis for real-time control software
Authors: Jinfeng Huang, Jeroen Voeten, Henk Corporaal
Venue: Proceedings of the Sixth International Conference on Quality Software (2006)

Formal theories for real-time systems (such as timed process algebra, timed automata and timed petri nets) have gained great success in the modelling of concurrent timing behavior and in the analysis of real-time properties. However, due to the ineliminable timing differences between a model and its realization, synthesising a software realization from a model in a correctness-preserving way is still a challenging research topic. In this paper, we tackle this problem by solving a set of sub-problems. First, we introduce property relations between real-time systems on the basis of their absolute and relative timing differences. Second, we bridge the timing differences between a model and its realization by a sequence of (absolute and relative) timing differences. Third, we propose two parameterised hypotheses to capture the timing differences between the model and its realization. The parameters of both hypotheses are used to predict the real-time properties of the realization from those of the model. Finally, we introduce a synthesis tool, which shows that the two hypotheses can be satisfied during software synthesis.
The Culebra Algorithm for Path Planning and Obstacle Avoidance in Kat-5
Authors: Jorge Nagel, Paul G. Trepagnier, Cris Koutsougeras, Powell M. Kinney, Matthew Dooner
Venue: Proceedings of the 18th IEEE International Conference on Tools with Artificial Intelligence (2006)

Kat-5 was the fourth vehicle to successfully finish the DARPA 2005 Grand Challenge; the first time ever that autonomous vehicles were able to successfully complete such a task. In this paper, we describe the methods that were used to develop the vehicle's path planning and obstacle avoidance algorithms, which allowed Kat-5 to successfully navigate completely autonomously the 132 miles course over rough and previously unrehearsed and unknown terrain at relatively high speeds.
Selective Attention and Multisensory Integration: Multiple Phases of Effects on the Evoked Brain Activity
Authors: Durk Talsma, Marty G. Woldorff
Venue: Journal of Cognitive Neuroscience (2005)

We used event-related potentials (ERPs) to evaluate the role of attention in the integration of visual and auditory features of multisensory objects. This was done by contrasting the ERPs to multisensory stimuli (AV) to the sum of the ERPs to the corresponding auditory-only (A) and visual-only (V) stimuli [i.e., AV vs. (A + V)]. V, A, and VA stimuli were presented in random order to the left and right hemispaces. Subjects attended to a designated side to detect infrequent target stimuli in either modality there. The focus of this report is on the ERPs to the standard (i.e., nontarget) stimuli. We used rapid variable stimulus onset asynchronies (350&ndash;650 msec) to mitigate anticipatory activity and included "no-stim" trials to estimate and remove ERP overlap from residual anticipatory processes and from adjacent stimuli in the sequence. Spatial attention effects on the processing of the unisensory stimuli consisted of a modulation of visual P1 and N1 components (at 90&ndash;130 msec and 160&ndash;200 msec, respectively) and of the auditory N1 and processing negativity (100&ndash;200 msec). Attended versus unattended multisensory ERPs elicited a combination of these effects. Multisensory integration effects consisted of an initial frontal positivity around 100 msec that was larger for attended stimuli. This was followed by three phases of centro-medially distributed effects of integration and/or attention beginning at around 160 msec, and peaking at 190 (scalp positivity), 250 (negativity), and 300&ndash;500 msec (positivity) after stimulus onset. These integration effects were larger in amplitude for attended than for unattended stimuli, providing neural evidence that attention can modulate multisensory-integration processes at multiple stages.
Compositional Performance Analysis of Component-Based Systems on Heterogeneous Multiprocessor Platforms
Authors: Egor Bondarev, Michel R. V. Chaudron, Peter H. N. de With
Venue: Proceedings of the 32nd EUROMICRO Conference on Software Engineering and Advanced Applications (2006)

This paper presents a compositional performance analysis technique, enabling predictable deployment of software components on heterogeneous multiprocessor architectures. This analysis technique introduces (a) composable software and hardware component models representing abstract specification of the component behaviour and corresponding resources, (b) operational semantics enabling composition of the models into an executable system model, and (c) simulation-based analysis of the obtained executable model resulting in predicted performance attributes. Example attributes are response time, throughput, utilization of processors, memory and communication lines. Special attention is paid to modeling of both passive and active components exploiting synchronous method invocation and asynchronous message passing interaction. We made an experimental validation of the above framework for two case studies: an MPEG-4 decoder and a car navigation system. It was found that the prediction error on task latencies and processor usage was within 10%.
Symmetric Encryption in RFID Authentication Protocol for Strong Location Privacy and Forward-Security
Authors: Hun-Wook Kim, Shu-Yun Lim, Hoon-Jae Lee
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

RFID tag carries vital information in their operation and thus concerns on privacy and security issues do arise. The problem of traceability is critical in open radio frequency environments. An adversary can trace and interact with tag and this is referred as tracking. Nevertheless, with a strong authentication mechanism, uprising security problems in RFID systems can be solved. We had demonstrated current vulnerabilities and proposed our authentication mechanism to overcome them. As long as the secret information stays secret, tag forgery is not possible. Targeting RFID tag with short tag ID, we employ a resource friendly symmetric encryption scheme, which is a stream cipher building block to enhance the security features in active type RFID tag.
Automation of Java Card component development using the B method
Authors: David Deharbe, Bruno Gurgel Gomes, Anamaria Martins Moreira
Venue: Proceedings of the 11th IEEE International Conference on Engineering of Complex Computer Systems (2006)

This paper presents a method for the rigorous development of Java Card smart card applications, using the B Method. Its main feature is to abstract the particularities of Java Card and smart card aware applications from the specifier as much as possible. In the proposed approach, the specification of the application logic does not need to take into account the specific aspects of the Java Card platform (in particular, communication between the card acceptance device and the smart card itself). A sequence of preestablished refinements is then applied to the original specification to yield an implementation-level B description of the component, which can then be used to synthesize Java Card code. This method reduces significantly the required amount of user-interaction and improves productivity. An interesting side-effect of this approach is that the specification may be reused with any other platform of implementation.
AI Research in China: 50 Years down the Road
Authors: Ruqian Lu, Daniel Zeng, Fei-Yue Wang
Venue: IEEE Intelligent Systems (2006)

Year 2006 marks the 50th anniversary of the birth of modern artificial intelligence research. Chinese researchers have been conducting AI research for decades. Here, the authors sample some of the most promising areas Chinese AI researchers are studying and discuss related future activities.This article is part of a special issue on the Future of AI.
Optimal Bit Allocation for Wavelet-Based Distributed Video Coding
Authors: Yoshihide Tonomura, Daisuke Shirai, Takayuki Nakachi, Tetsuro Fujii
Venue: Proceedings of the Eighth IEEE International Symposium on Multimedia (2006)

Distributed Video Coding(DVC), based on the theorems proposed by Slepian-Wolf and Wyner-Ziv, is attracting attention as a new paradigm for video compression. Some of the DVC systems use intra-frame compression based on DCT. Correspondingly, we proposed a wavelet-based DVC system that utilizes the current JPEG 2000 standard. The scheme has scalability with regard to resolution and quality. However, related works does not offer that optimal bit allocation method for each sub-band coefficients. In this report, we propose a bit allocation method for a wavelet-based DVC scheme. Tests confirm that the PSNR is increased about 1-2[dB] by propose method.
Analysis of Bidding Behavior on eBay Auctions
Authors: Li Du, Qiying Hu
Venue: Proceedings of the IEEE International Conference on e-Business Engineering (2006)

eBay is the most successful online auction site. In this paper, we study bidding behavior on eBay auctions. First, we show that under the assumption of IPV, the truthful and early bidding is approximately optimal. Then, we compare the truthful and early bidding strategy with the late bidding strategy and point out that the optimal bidding strategies rely on the influence of bidders' valuations, i.e., IPV or AV (affiliated valuations). In the following, we analyze the advantages of the truthful and early bidding strategy from different aspects and the influence of auction components on bidding strategies, such as proxy bidding, bid increment, the number of bidders, and stopping rules. Finally, we discuss preliminary their optimal bidding behavior under the assumption of the hybrid valuations of IPV and AV and obtain some conclusions.
Recovering Camera Motion Using L\infty Minimization
Authors: Kristy Sim, Richard Hartley
Venue: Proceedings of the 2006 IEEE Computer Society Conference on Computer Vision and Pattern Recognition - Volume 1 (2006)

Recently, there has been interest in formulating various geometric problems in Computer Vision as L\infty optimization problems. The advantage of this approach is that under L\infty norm, such problems typically have a single minimum, and may be efficiently solved using Second-Order Cone Programming (SOCP). This paper shows that such techniques may be used effectively on the problem of determining the track of a camera given observations of features in the environment. The approach to this problem involves two steps: determination of the orientation of the camera by estimation of relative orientation between pairs of views, followed by determination of the translation of the camera. This paper focusses on the second step, that of determining the motion of the camera. It is shown that it may be solved effectively by using SOCP to reconcile translation estimates obtained for pairs or triples of views. In addition, it is observed that the individual translation estimates are not known with equal certainty in all directions. To account for this anisotropy in uncertainty, we introduce the use of covariances into the L\infty optimization framework.
On Modeling the Restoration Probability of Active Restoration-Based Optical Networks with Correlation Among Backup Routes
Authors: Mohamed Mostafa A. Azim, Xiaohong Jiang, Susumu Horiguchi
Venue: Proceedings of the Japan-China Joint Workshop on Frontier of Computer Science and Technology (2006)

Active restoration (AR) is a novel lightpath restoration scheme proposed recently to guarantee a certain degree of survivability in WDM optical networks with a reasonable tradeoff between capacity requirement and restoration time. An analytical model has been proposed to analyze the restoration probability behavior of a connection request in optical networks employing AR based on the assumption that all the backup routes of the connection are independent. In a real AR-based optical network, however, the backup routes of a connection are likely to be correlated since they may share some common links along their routes. Therefore, an analytical approach was proposed recently to model the restoration probability of the connection by considering all the possible correlation between any two of its successive backup routes. Although the proposed approach achieves better approximation to the restoration probability, it overestimates the restoration probability of the connection when its non-successive backup routes are being correlated. However, considering all the possible correlations among backup routes is computationally Intractable. In this paper, we conduct a comprehensive performance analysis for AR-based optical networks. In particular, we propose a novel analytical framework for modelling the restoration probability of a connection when the possible correlations among any three successive backup routes are fully incorporated.
A Longitudinal Study of the Use of a Collaboration Tool: A Breadth and Depth Analysis
Authors: Jean Scholtz, Emile Morse, Michelle Potts Steves
Venue: Proceedings of the International Symposium on Collaborative Technologies and Systems (2006)

In this paper we present both a broad and deep look at the use of a collaboration tool in the intelligence community. Through an experimental program, intelligence analysts are given the opportunity to explore and use tools to determine if the tools provide sufficient value to be certified and moved into the analytic work environment. The goal of this program is to bring advanced technologies to the intelligence community through research and experimentation. New tools are evaluated using a metrics based assessment. Tools that successfully pass these evaluations are then introduced on an experimental network. Analysts employed by the experimental program work along side analysts in the intelligence community and look for opportunities where the experimental tools could be useful in current analytic processes. These uses are also evaluated to determine the value of the tools in the analytic environment.
An improved algorithm for fractal estimation from noisy measurements
Authors: L. M. Kaplan, C.-C. J. Kuo
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 1993. ICASSP-93 Vol 4., 1993 IEEE International Conference on - Volume 04 (1993)

The authors first show that when the increments of sampled fractional Brownian motion (fBm), also known as discrete fractional Gaussian noise (DFGN), are set equal to the finest scale wavelet approximation coefficients and when the Haar basis is selected, the discrete wavelet transform (DWT) coefficients are weakly correlated and have a variance that is exponentially related to scale. The observation motivates a new fractal estimation algorithm, which is a variant of an algorithm introduced by Wornell and Oppenheim (IEEE Trans. vol.SP-40, no.3, p.611-23, March 1992) with the sampled fBm replaced by the increments of the sampled fBm. The performance of the new algorithm is compared with that of Wornell and Oppenheim's algorithm in numerical simulation results.
Modeling and Customization of Fault Tolerant Architecture using Object-Z/XVCL
Authors: Ling Yuan, Jin Song Dong, Jing Sun
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

This paper proposes a novel heterogeneous software architecture FTA (Fault Tolerant Architecture). FTA incorporates idealized fault tolerant component concept and coordinated error recovery mechanism in the early system design phase. It can be reused in the high level model design of specific mission critical distributed systems with reliability requirements. The formal model of FTA in the Object- Z language is presented to provide precise idioms to the system designers. Formal proof using the Object-Z reasoning rules are constructed to demonstrate the fault tolerant properties of FTA. By analyzing the customization process, we also present a FTA template, expressed in x-frames using XVCL (XML-based Variant Configuration Language) methodology, to automate the customization process. We apply a sales control system case study to illustrate the customization of FTA.
A Robust and Energy Efficient Routing Scheme for Wireless Sensor Networks
Authors: Haiguang Wang, Peng-Yong Kong, Winston Seah Khoon Guan
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

In a wireless sensor network, energy efficient transmissions are important because each node has a limited battery. On the other hand, the energy limitation should not compromise the robustness in end-to-end packet delivery. This paper proposes an energy efficient routing scheme that can ensure high robustness despite dynamic link quality. The key ideas are to form a routing tree with one degree of redundancy where each node maintains two parents, namely default and backup, toward the sink, and to dynamically switch between the default and backup links depending on the dynamic link quality. For energy efficiency, the default parents are selected based on the minimal expected transmission (METX) criterion while the backup parents are selected with a combination of METX and signal strength criteria. The switching mechanism is designed to be adaptive with inertia so that unnecessary changes in route can be avoided. The proposed routing scheme has been evaluated through NS-2 simulator. The results confirm that a 36% improvement in robustness can be achieved in a random topology without any significant degradation in energy efficiency.
Identifying bridging rules between conceptual clusters
Authors: Shichao Zhang, Feng Chen, Xindong Wu, Chengqi Zhang
Venue: Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining (2006)

A bridging rule in this paper has its antecedent and action from different conceptual clusters. We first design two algorithms for mining bridging rules between clusters in a database, and then propose two non-linear metrics for measuring the interestingness of bridging rules. Bridging rules can be distinct from association rules (or frequent itemsets). This is because (1) bridging rules can be generated by infrequent itemsets that are pruned in association rule mining; and (2) bridging rules are measured by the importance that includes the distance between two conceptual clusters, whereas frequent itemsets are measured by only the support.
The Distinctiveness of a Curve in a Parameterized Neighborhood: Extraction and Applications
Authors: Yu Chin Cheng
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

A new feature of curves pertaining to the acceptance/rejection decision in curve detection is proposed. The feature measures a curve's distinctiveness in its neighborhood, which is modeled by a one-parameter family of curves. A computational framework based on the Hough transform for extracting the distinctiveness feature is elaborated and examples of feature extractors for the circle and the ellipse are given. It is shown that the proposed feature can be extracted efficiently and is effective in separating signals from false positives. Experimental results with circle and ellipse testing that strongly support the efficiency and effectiveness claims are obtained. The results further demonstrate that the proposed feature exhibits good noise resiliency.
Neuropsychological Evidence of an Integrated Visuotactile Representation of Peripersonal Space in Humans
Authors: Elisabetta Làdavas, Giuseppe Di Pellegrino, Alessandro Farnè, Gabriele Zeloni
Venue: Journal of Cognitive Neuroscience (1998)

Current interpretations of extinction suggest that the disorder is due to an unbalanced competition between ipsilesional and contralesional representations of space. The question addressed in this study is whether the competition between left and right representations of space in one sensory modality (i.e., touch) can be reduced or exacerbated by the activation of an intact spatial representation in a different modality that is functionally linked to the damaged representation (i.e., vision). This hypothesis was tested in 10 right-hemisphere lesioned patients who suffered from reliable tactile extinction. We found that a visual stimulus presented near the patient's ipsilesional hand (i.e., visual peripersonal space) inhibited the processing of a tactile stimulus delivered on the contralesional hand (cross-modal visuotactile extinction) to the same extent as did an ipsilesional tactile stimulation (unimodal tactile extinction). It was also found that a visual stimulus presented near the contralesional hand improved the detection of a tactile stimulus applied to the same hand. In striking contrast, less modulatory effects of vision on touch perception were observed when a visual stimulus was presented far from the space immediately around the patient's hand (i.e., extrapersonal space). This study clearly demonstrates the existence of a visual peripersonal space centered on the hand in humans and its modulatory effects on tactile perception. These findings are explained by referring to the activity of bimodal neurons in premotor and parietal cortex of macaque, which have tactile receptive fields on the hand and corresponding visual receptive fields in the space immediately adjacent to the tactile fields.
Statistical control for sampling of metallurgical material: Research Articles
Authors: Hannah Gerber, Gary D. Sharp, Abebe Tessera
Venue: Applied Stochastic Models in Business and Industry (2006)

The study's aim was to assess the re-sampling rate of metallurgical material in a precious metal refinery. Three different methods were evaluated; including the refinery's existing means comparison method, an empirical distribution technique and a non-linear model. The objective was to assess these three methods to determine which would be the most appropriate for the existing sampling method in order to obtain a re-sampling rate of 5&percnt;. Copyright &copy; 2006 John Wiley & Sons, Ltd.