ppxscal/embedding_network huggingface dataset:
A Class of Detection Filters for Targets and Anomalies in Multispectral / Hyperspectral Imagery
Authors: Stefan A. Robila
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper we present a class of detection filters based on variations of the spectral screening. Spectral screening is a technique used in reducing the multispectral / hyperspectral data to a representative subset of spectra. The subset is formed such that any two spectra in it are dissimilar and, for any spectrum in the original image cube, there is a similar spectrum in the subset. Spectral screening is performed in a sequential manner, at each step, the subset being increased with a spectrum dissimilar from all the spectra already selected. The procedure, using the spectral angle as similarity measure is employed in a variety of algorithms for linear unmixing and data compression. We modified the algorithm such that at the selection step the spectrum with the largest distance from the set is selected. While not introducing additional computational complexity, the Maximum Spectral Screening (MSS) algorithm ensures that the overlap among the representatives is minimized. MSS is further improved by choosing as first spectra the one with the largest distance to the diagonal, thus transforming the screening into a deterministic process. Second, we investigated the alternative approach where at each step the spectra with the smallest distance (but larger than a threshold value) is selected (Minimum Spectral ScreeningmSS). The detection filters were obtained as the classification projector matrices based on the spectral subset. The developed algorithms were tested on HYDICE hyperspectral data using the spectral angle and the spectral information divergence. The results indicate that MSS outperforms regular spectral screening detection and mSS.
Address Space Layout Permutation (ASLP): Towards Fine-Grained Randomization of Commodity Software
Authors: Chongkyung Kil, Jinsuk Jun, Christopher Bookholt, Jun Xu, Peng Ning
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

Address space randomization is an emerging and promising method for stopping a broad range of memory corruption attacks. By randomly shifting critical memory regions at process initialization time, address space randomization converts an otherwise successful malicious attack into a benign process crash. However, existing approaches either introduce insufficient randomness, or require source code modification. While insufficient randomness allows successful brute-force attacks, as shown in recent studies, the required source code modification prevents this effective method from being used for commodity software, which is the major source of exploited vulnerabilities on the Internet. We propose Address Space Layout Permutation (ASLP) that introduces high degree of randomness (or high entropy) with minimal performance overhead. Essential to ASLP is a novel binary rewriting tool that can place the static code and data segments of a compiled executable to a randomly specified location and performs fine-grained permutation of procedure bodies in the code segment as well as static data objects in the data segment. We have also modified the Linux operating system kernel to permute stack, heap, and memory mapped regions. Together, ASLP completely permutes memory regions in an application. Our security and performance evaluation shows minimal performance overhead with orders of magnitude improvement in randomness (e.g., up to 29 bits of randomness on a 32-bit architecture).
Complex Event Processing using Simple Rule-based Event Correlation Engines for Business Performance Management
Authors: Shyh-Kwei Chen, Jun-Jang Jeng, Henry Chang
Venue: Proceedings of the The 8th IEEE International Conference on E-Commerce Technology and The 3rd IEEE International Conference on Enterprise Computing, E-Commerce, and E-Services (2006)

Event correlation is an important component in business performance management. Simple rule-based event correlation engines, like Zurich Correlation Engine (ZCE), usually accept input events that include only name-value pairs. However, when input events are in XML format, the ZCE needs to be adapted to accept complex/structural events. In this paper, we present a model-driven approach to derive solutions for adapting the new type of events, so that the light weight correlation engine can still be used for event monitoring and correlation.
A Computational Model of Prefrontal Control in Free Recall: Strategic Memory Use in the California Verbal Learning Task
Authors: Suzanna Becker, Jean Lim
Venue: Journal of Cognitive Neuroscience (2003)

Several decades of research into the function of the frontal lobes in brain-damaged patients, and more recently in intact individuals using function brain imaging, has delineated the complex executive functions of the frontal cortex. And yet, the mechanisms by which the brain achieves these functions remain poorly understood. Here, we present a computational model of the role of the prefrontal cortex (PFC) in controlled memory use that may help to shed light on the mechanisms underlying one aspect of frontal control: the development and deployment of recall strategies. The model accounts for interactions between the PFC and medial temporal lobe in strategic memory use. The PFC self-organizes its own mnemonic codes using internally derived performance measures. These mnemonic codes serve as retrieval cues by biasing retrieval in the medial temporal lobe memory system. We present data from three simulation experiments that demonstrate strategic encoding and retrieval in the free recall of categorized lists of words. Experiment 1 compares the performance of the model with two control networks to evaluate the contribution of various components of the model. Experiment 2 compares the performance of normal and frontally lesioned models to data from several studies using frontally intact and frontally lesioned individuals, as well as normal, healthy individuals under conditions of divided attention. Experiment 3 compares the model's performance on the recall of blocked and unblocked categorized lists of words to data from Stuss et al. (1994) for individuals with control and frontal lobe lesions. Overall, our model captures a number of aspects of human performance on free recall tasks: an increase in total words recalled and in semantic clustering scores across trials, superiority on blocked lists of related items compared to unblocked lists of related items, and similar patterns of performance across trials in the normal and frontally lesioned models, with poorer overall performance of the lesioned models on all measures. The model also has a number of shortcomings, in light of which we suggest extensions to the model that would enable more sophisticated forms of strategic control.
3D-Visualization Techniques, Including Samples and Applications
Authors: Walter Schuhr, Erich Kanngieser
Venue: Proceedings of the International Conference on Computer Graphics, Imaging and Visualisation (2006)

This paper deals with new aspects of 3Dvisualization Techniques as state-of-the-art tools for recording, documentation, interpretation etc.. To give an idea of the outstanding documentary value of 3D-images and of its broad range of applications, masterpieces for stereoviews and for forensic 3Dphotography are initially presented (see the authors`RecorDIM -website 3dsite.icomos.org). Since these samples represent huge stereoviewcollections, this paper also deals with international 3D-image- archives. First time gaining "3D-niche-photography" based on a telescope-rod-Lite-platform is introduced. In the following are highlighted advantages for the practical use of stereoviews, e. g.,, - the still underestimated effect of gaining a complete additional dimension and - advantages of 3D-visualization for the enhancement of spatial structures, as well as - pointing to the extremely high detail resolution and to - the probative force of forensic 3Dphotography. Finally a new way to derive terrain-heights from image-parallax-values is shown for aerial photography and for SAR-imagery, as well as a completed list of virtual 3D-visualizationmethodology, including "Down-Under"and Felix- Solid-State type 3D-screens to replace the 2D-PC(- screen).
Vicarious learning from educational dialogue
Authors: Keith Stenning, Jean McKendree, John Lee, Richard Cox, Finbar Dineen, Terry Mayes
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

The Vicarious Learner project is investigating the role of dialogue in learning and, more specifically, how learners benefit from opportunities to 'overhear' other learners. We describe evidence of such learning by students using "vicarious learning resources" in a computer-supported learning environment. We argue that education dialogue has properties that are different from "everyday" dialogue. We see educational dialogues in particular as being about the complex alignment of concepts where the participants know that an initial misalignment is fairly certain. We focus on the distinction between exposition and derivation in discourse and discuss how this might describe what happens in learning dialogues.
Game Based Flow Rate Control for Networks
Authors: Bocheng Zhong, Jianghong Han, Zhaofang Du, Yuan Ming, Ming Tan
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

Traditional rate control protocols for networks such as TCP require cooperation between traffic sources to achieve optimal network performance. However, traffic sources may not be cooperative due to a widely heterogeneous demand of end-users. We propose a flow rate control framework using noncooperative game theory. The scheme is based on the idea of the Stackelberg solution from noncooperative game theory. The network as a leader designs a pricing mechanism for network bandwidth that attempts to drive the users' flow to the social optimal solution. Each user as a follower is charged by network, and chooses a willingness-to-pay to maximize his own net profit. We prove that the rate control game admits a unique Stackelberg equilibrium point and the bandwidth allocation is efficient and fair.
Evaluation of Source Code Updates in Software Development Based on Component Rank
Authors: Reishi Yokomori, Masami Noro, Katsuro Inoue
Venue: Proceedings of the XIII Asia Pacific Software Engineering Conference (2006)

Essential activities for the achievement of trouble-free software development are monitoring a software product and management of a software project. Monitoring changes that have major impact, however, is usually a very hard to complete because every engineer usually could not know entire source code in detail. In this paper, we propose our metric for source code updates based on component rank. Software components and their use-relation alter as development goes. The component rank also changes as a response to the changes of use-relation among components. We use the degree representing change of component rank as a metric of impact for a source code update in a development. We applied the metric to open source projects, and demonstrated that the metric is useful to know refactoring activities or important updates. We also discuss how the metric can contribute for process management.
Web 3D based dialogue for public participation and the VEPs Project
Authors: John Counsell, Steve Smith, Nadezda Bates-Brkljac
Venue: Proceedings of the conference on Information Visualization (2006)

It is becoming increasingly important to European democratic governments to increase public participation. One of the areas that gives rise to significant public dissatisfaction and feelings of dis-empowerment is that of local planning. "Not in my backyard" or 'NIMBYism' is now often quoted as the almost automatic response to local planning proposals. We argue that more effective tools are required to clearly display local planning proposals in web based interactive 3D, free at the point of access. Initial workshops have shown that such tools are only likely to be used if those so doing can influence the outcome. Consensus needs to be obtained among a broad group to exert strong influence. Tools are therefore needed to share concerns, examine alternatives, and propose solutions through collaborative citizen based examination and discussion. This paper describes the development and trialling in itself constitutes an important element of the dialogue. of prototype tools for this purpose in the Virtual Environmental Planning System (VEPs) project. The focus of this paper is on tools to support collaborative dialogue and to draw attention to or to focus on specific issues in a 3D web based interactive environment. The issues may be presented synchronously in the form of whiteboard conferencing, or asynchronously. Playback facilities for previous synchronous discussion may be useful as a record of points of agreement, and in this respect require subsequent additional more expansive description for full understanding by others. Similar tools are required to support asynchronous debate. It is suggested that effective, easy to use, to understand and review records of synchronous exchanges of views or tools for asynchronous discussion may need to create an illustrated narrative, and in this respect adopt the readily understood language of film.
Robust audio watermarking using a chirp based technique
Authors: S. Erkucuk, S. Krishnan, M. Zeytinoglu
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

In this study, we propose a new spread spectrum audio watermarking algorithm that embeds linear chirps as watermark messages. Different chirp rates, i.e., slopes on the time-frequency (TF) plane, represent watermark messages such that each slope corresponds to a different message. We extract the watermark message using a line detection algorithm based on the Hough-Radon transform (HRT). The HRT detects the directional elements that satisfy a parametric constraint in the image of a TF plane. The proposed method not only detects the presence of watermark, but also extracts the embedded watermark bits and ensures the message is received correctly. The results show that the HRT detects the embedded watermark message even after common signal processing operations such as MPEG audio coding, resampling, lowpass filtering and amplitude re-scaling.
Long-distance 802.11b links: performance measurements and experience
Authors: Kameswari Chebrolu, Bhaskaran Raman, Sayandeep Sen
Venue: Proceedings of the 12th annual international conference on Mobile computing and networking (2006)

The use of 802.11 long-distance links is a cost-effective means of providing wireless connectivity to rural areas. Although deployments in this setting are increasing, a systematic study of the performance of 802.11 in these settings is lacking. The contributions of this paper are two-fold: (a)we present a detailed performance study of a set of long-distance 802.11b links at various layers of the network stack, and (b)we document the various non-obvious experiences during our study.Our study includes eight long-distance links, ranging from 1km to 37km in length. Unlike prior studies of outdoor 802.11 links, we find that the error rate as a function of the received signal strength behaves close to theory. Time correlation of any packet errors is negligible across a range of time-scales. We have observed at least one of the link to be robust to rain and fog. But any interference on the long-distance links can be detrimental to performance. Apart from this however, such long-distance links can be planned to work well with predictable performance. During our measurements, we have observed a few hardware/driver quirks as well as system bottlenecks apart from the wireless link itself. We believe that our measurements and the documentation of our experience will help future network planning as well as protocol design for these networks.
A Key-Recovery System for Long-term Encrypted Documents
Authors: Eric K. Wang, Joe C. K. Yau, Lucas C. K. Hui, Zoe L. Jiang, S. M. Yiu
Venue: Proceedings of the 10th IEEE on International Enterprise Distributed Object Computing Conference Workshops (2006)

Confidentiality is often one of the primary requirements for electronic documents. Often, encryption is used for achieving these confidential documents. From the perspective of an electronic document system, key management for long-term encrypted documents could become problematic, especially for big organizations. There are a number of non-trivial issues to be handled by such a system. In particular, some of the encrypted confidential documents need to be stored for a long period of time. It is possible that the keys for accessing these documents may get loss or corrupted. On the other hand, storing duplicates of these keys may not be secure. To handle this problem, we propose an electronic document system, which makes use of cryptographic hardware tokens. In this paper, we will describe the key recovery mechanism for this system. We use the secret sharing scheme, and integrate it into our system. It securely protects longterm encrypted documents without sacrificing users' convenience or system's scalability. Prototype has been implemented, and preliminary results have been encouraging.
Scaling of unitary synaptic strength in the context of network dynamics
Authors: Guosong Liu
Venue:  (2005)

A fundamental consideration in understanding neuronal networks is determining what sets the unitary functional strength of a synaptic connection between two cells, and what meta-processes such mechanisms answer to. This question can be asked either mechanistically, by characterizing the molecular processes that regulate the synapse's transmission, or ontologically, by considering the impact of this transmission from the standpoint of neighboring synapses, the postsynaptic cell itself, or the network of neurons in which it is situated. The work presented here practices both approaches, by identifying a new molecular mechanism to which the quantal size of excitatory synapses can be attributed, and then beginning to explore how quanta) size might be influenced by network activity and architecture. Chapter 1 identifies a new molecular control point for specifying the quantal size of excitatory transmission in the mammalian brain, and provides the first known demonstration that such specification can be provided by a presynaptic process. It then details how this mechanism is regulated by network activity. Chapter 2 makes use of a new methodology for designing the physical structure of cultured networks in order to begin to perturb network parameters and explore the role of quantal size in a network context. Applying this methodology I demonstrate that the quantal size of excitatory synapses is scaled by neurons inversely with their number of synaptic connections, and identify a set of mechanisms by which network firing is maintained at a constant level when the number of active synaptic partners is scaled. Chapter 3 demonstrates progress towards a methodology capable of producing and detecting changes in the unitary strength of multiple synapses with respect to one another within a dendritic tree. Future efforts can hopefully make use of similar principles to directly visualize how heterosynaptic processes establish and maintain a contrast in the strengths of unitary synapses to enable representation by synaptically-based memory traces. (Copies available exclusively from MIT Libraries, Rm. 14-0551, Cambridge, MA 02139-4307. Ph. 617-253-5668; Fax 617-253-1690.)
Reading Speech from Still and Moving Faces: The Neural Substrates of Visible Speech
Authors: Gemma A. Calvert, Ruth Campbell
Venue: Journal of Cognitive Neuroscience (2003)

Speech is perceived both by ear and by eye. Unlike heard speech, some seen speech gestures can be captured in stilled image sequences. Previous studies have shown that in hearing people, natural time-varying silent seen speech can access the auditory cortex (left superior temporal regions). Using functional magnetic resonance imaging (fMRI), the present study explored the extent to which this circuitry was activated when seen speech was deprived of its time-varying characteristics.In the scanner, hearing participants were instructed to look for a prespecified visible speech target sequence ("voo" or "ahv") among other monosyllables. In one condition, the image sequence comprised a series of stilled key frames showing apical gestures (e.g., separate frames for "v" and "oo" [from the target] or "ee" and "m" [i.e., from nontarget syllables]). In the other condition, natural speech movement of the same overall segment duration was seen.In contrast to a baseline condition in which the letter "V" was superimposed on a resting face, stilled speech face images generated activation in posterior cortical regions associated with the perception of biological movement, despite the lack of apparent movement in the speech image sequence. Activation was also detected in traditional speech-processing regions including the left inferior frontal (Broca's) area, left superior temporal sulcus (STS), and left supramarginal gyrus (the dorsal aspect of Wernicke's area). Stilled speech sequences also generated activation in the ventral premotor cortex and anterior inferior parietal sulcus bilaterally.Moving faces generated significantly greater cortical activation than stilled face sequences, and in similar regions. However, a number of differences between stilled and moving speech were also observed. In the visual cortex, stilled faces generated relatively more activation in primary visual regions (V1/V2), while visual movement areas (V5/MT+) were activated to a greater extent by moving faces. Cortical regions activated more by naturally moving speaking faces included the auditory cortex (Brodmann's Areas 41/42; lateral parts of Heschl's gyrus) and the left STS and inferior frontal gyrus.Seen speech with normal time-varying characteristics appears to have preferential access to "purely" auditory processing regions specialized for language, possibly via acquired dynamic audiovisual integration mechanisms in STS. When seen speech lacks natural time-varying characteristics, access to speech-processing systems in the left temporal lobe may be achieved predominantly via action-based speech representations, realized in the ventral premotor cortex.
Optimal Resource Allocation in Overlay Multicast
Authors: Yi Cui, Yuan Xue, Klara Nahrstedt
Venue: IEEE Transactions on Parallel and Distributed Systems (2006)

Although initially proposed as the deployable alternative to IP multicast, the overlay network actually revolutionizes the way network applications can be built. In this paper, we study the rate allocation problem in overlay-based multirate multicast, which can be understood as a utility-based resource allocation problem. Each receiver is associated with a utility defined as a function of its streaming rate. Our goal is to maximize the aggregate utility of all receivers, subject to network capacity constraint and data constraint. The latter constraint is unique in overlay multicast, mainly due to the dual role of end hosts as both receivers and senders. We use a price-based approach to address this problem. Two types of prices, network price and data price, are generated with regard to the two constraints of the problem. A distributed algorithm is proposed, where each receiver adjusts its flow rate according to the associated network price and data price. The algorithm is proved to converge to the optimal point, where the aggregate utility of all receivers is maximized. We implement our algorithm using an end-host-based protocol. Our protocol purely relies on the coordination of end hosts to accomplish tasks originally assigned to network routers, which makes it directly deployable to the existing network infrastructure.