ppxscal/embedding_network huggingface dataset:
Drafting behind Akamai (travelocity-based detouring)
Authors: Ao-Jan Su, David R. Choffnes, Aleksandar Kuzmanovic, Fabián E. Bustamante
Venue: Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications (2006)

To enhance web browsing experiences, content distribution networks (CDNs) move web content "closer" to clients by caching copies of web objects on thousands of servers worldwide. Additionally, to minimize client download times, such systems perform extensive network and server measurements, and use them to redirect clients to different servers over short time scales. In this paper, we explore techniques for inferring and exploiting network measurements performed by the largest CDN, Akamai; our objective is to locate and utilize quality Internet paths without performing extensive path probing or monitoring.Our contributions are threefold. First, we conduct a broad measurement study of Akamai's CDN. We probe Akamai's network from 140 PlanetLab vantage points for two months. We find that Akamai redirection times, while slightly higher than advertised, are sufficiently low to be useful for network control. Second, we empirically show that Akamai redirections overwhelmingly correlate with network latencies on the paths between clients and the Akamai servers. Finally, we illustrate how large-scale overlay networks can exploit Akamai redirections to identify the best detouring nodes for one-hop source routing. Our research shows that in more than 50% of investigated scenarios, it is better to route through the nodes "recommended" by Akamai, than to use the direct paths. Because this is not the case for the rest of the scenarios, we develop lowoverhead pruning algorithms that avoid Akamai-driven paths when they are not beneficial.
An evaluation of RQL: a relational data base system for a low end microcomputer configuration
Authors: Susan Masters, James R. Driscoll
Venue: ACM SIGSMALL Newsletter (1983)

Microcomputers for data-base applications are available in a wide range of prices. At the low-end, the minimum configuration for any serious Data Base work would be a processor and memory unit, two floppy diskette drives, a keyboard, a video display unit, and a printer [2]. This configuration would be adequate for small applications. As an example, an Apple II computer with two floppy disk drives, video display, and printer retails for approximately $3000.00.The availability of Data Base Management Systems for low-end microcomputers is very limited [1,2]. There appear to be only two relational systems commercially available for low-end configurations - RQL (Relational Query Language) and RMS (Relational Menu System). Both of these systems are available from Hello Software, 8380 Roanne Drive, Orlando, Florida 32817, U.S.A. The RQL system runs on the Apple II microcomputer. Although it was designed for use in a classroom environment, RQL may also be suitable in a small business environment.RQL is a relationally complete system [3,4]. Through a combination of automatic navigation and a relational processing query language, the RQL system allows the unsophisticated user direct interaction with data bases. Furthermore, RQL can manage multiple data bases with each data base extending across a maximum of eight volumes (floppy diskettes) [4]. However, since low-end configurations are inherently slow, the RQL system is unavoidably sluggish at times.The purpose of this paper is to demonstrate features of the RQL system and discuss its recent use in a learning environment and its potential use in a small business environment. For demonstration purposes a real-world situation typical of a small business organization will be used and a data base will be established for it using the RQL system (Release 3).
Retrieval Success is Accompanied by Enhanced Activation in Anterior Prefrontal Cortex During Recognition Memory: An Event-Related fMRI Study
Authors: Kathleen B. McDermott, Todd C. Jones, Steven E. Petersen, Sarah K. Lageman, Henry L. Roediger,  III
Venue: Journal of Cognitive Neuroscience (2000)

Neural regions associated with retrieval success were identified using event-related fMRI procedures and randomly ordered trials on a recognition memory test. Differences between hits and correct rejections (CRs) occurred multiple regions, including bilateral anterior and right dorsolateral prefrontal cortex, bilateral inferior pariet cortex, and right superior parietal cortex (all hits > CRs), and right occipital cortex (CRs > hits). The hit > CR pattern is not compromised by time-on-task explanations because response latencies for correctly rejected words exceeded those for hits. Converging evidence for the claim that the hit > CR pattern identified neural correlates of retrieval success was obtained by unconfounding item history and retrieval success. That is, we implemented a third condition in which nonstudied words were presented, yet retrieval success was hypothesized to facilitate CRs of these lures. Specifically, in when confronted with a familiar, yet nonstudied word, (e.g., nosedive after studying nosebleed and skydive), subjects al might adopt a strategy whereby they recall the studied word(s) that gave rise to the familiarity (nosebleed, skydive) and thereby reject the lure. This method of instantiating retrieval success under conditions in which the target word had not been studied offers converging evidence for the claim that anterior-prefrontal cortex (among other regions) demonstrates enhanced activation during retrieval success.
A detector tree of boosted classifiers for real-time object detection and tracking
Authors: R. Lienhart, Luhong Liang, A. Kuranov
Venue: Proceedings of the 2003 International Conference on Multimedia and Expo - Volume 1 (2003)

This paper presents a novel tree classifier for complex object detection tasks together with a general framework for real-time object tracking in videos using the novel tree classifier. A boosted training algorithm with a clustering-and-splitting step is employed to construct branches in the nodes recursively, if and only if it improves the discriminative power compared to a single monolithic node classifier and has a lower computational complexity. A mouth tracking system that integrates the tree classifier under the proposed framework is built and tested on XM2FDB database. Experimental results show that the detection accuracy is equal or better than a single or multiple cascade classifier, while being computational less demanding.
Collaborative technology for facilitating progressive inquiry: future learning environment tools
Authors: Hanni Muukkonen, Kai Hakkarainen, Minna Lakkala
Venue: Proceedings of the 1999 conference on Computer support for collaborative learning (1999)

The design of a web-based, networked learning environment, Future Learning Environment (FLE-Tools) embodies a model of progressive inquiry. In this paper, we introduce the progressive inquiry model and describe how different modules of FLE-Tools are designed to facilitate participation in this kind of inquiry. Results of a pilot experiment of using FLE-Tools in higher education are presented. The study was based on an analysis of 125 messages posted by thirteen university students to the FLE-Tools database. The results indicated that the course provided positive evidence for an integration of progressive inquiry and online discussion. The pedagogical and design challenges with which we are currently struggling are discussed.
ViChaR: A Dynamic Virtual Channel Regulator for Network-on-Chip Routers
Authors: Chrysostomos A. Nicopoulos, Dongkook Park, Jongman Kim, N. Vijaykrishnan, Mazin S. Yousif, Chita R. Das
Venue: Proceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture (2006)

The advent of deep sub-micron technology has recently highlighted the criticality of the on-chip interconnects. As diminishing feature sizes have led to increases in global wiring delays, Network-on-Chip (NoC) architectures are viewed as a possible solution to the wiring challenge and have recently crystallized into a significant research thrust. Both NoC performance and energy budget depend heavily on the routers' buffer resources. This paper introduces a novel unified buffer structure, called the dynamic Virtual Channel Regulator (ViChaR), which dynamically allocates Virtual Channels (VC) and buffer resources according to network traffic conditions. ViChaR maximizes throughput by dispensing a variable number of VCs on demand. Simulation results using a cycle-accurate simulator show a performance increase of 25% on average over an equal-size generic router buffer, or similar performance using a 50% smaller buffer. ViChaR's ability to provide similar performance with half the buffer size of a generic router is of paramount importance, since this can yield total area and power savings of 30% and 34%, respectively, based on synthesized designs in 90 nm technology.
Content-aware Trust Statement for semantic Grid
Authors: Li Wang, Wenli Wu, YingJie Li, XueLi Yu
Venue: Proceedings of the Second International Conference on Semantics, Knowledge, and Grid (2006)

Grid computing is a dynamic system and trust changes over time. A kind of flexible trust management is urgently required that could obtain new, not foreseen trust value by computing or reasoning. Semantic grid makes it easier for resources to be discovered and joined up automatically. But there are not explicit semantic content for trust management. By taking full advantage of the content of semantic grid service, trust content model and content-included trust statement model are designed in this paper. In order to obtaining new trust value by the content of trust semantic and grid service semantic information, semTrustStatement ontology, service content model, context model, situation model are defined and the influence relationship between them are shown. At last an example is taken verifying the method valid.
Cerebellum and Speech Perception: A Functional Magnetic Resonance Imaging Study
Authors: Klaus Mathiak, Ingo Hertrich, Wolfgang Grodd, Hermann Ackermann
Venue: Journal of Cognitive Neuroscience (2002)

A variety of data indicate that the cerebellum participates in perceptual tasks requiring the precise representation of temporal information. Access to the word form of a lexical item requires, among other functions, the processing of durational parameters of verbal utterances. Therefore, cerebellar dysfunctions must be expected to impair word recognition. In order to specify the topography of the assumed cerebellar speech perception mechanism, a functional magnetic resonance imaging study was performed using the German lexical items "Boden" ([bodn], Engl. "floor") and "Boten" ([botn], "messengers") as test materials. The contrast in sound structure of these two lexical items can be signaled either by the length of the wordmedial pause (closure time, CLT; an exclusively temporal measure) or by the aspiration noise of wordmedial "d" or "t" (voice onset time, VOT; an intrasegmental cue). A previous study found bilateral cerebellar disorders to compromise word recognition based on CLT whereas the encoding of VOT remained unimpaired. In the present study, two series of "Boden - Boten" utterances were resynthesized, systematically varying either in CLT or VOT. Subjects had to identify both words "Boden" and "Boten" by analysis of either the durational parameter CLT or the VOT aspiration segment. In a subtraction design, CLT categorization as compared to VOT identification (CLT - VOT) yielded a significant hemodynamic response of the right cerebellar hemisphere (neocerebellum Crus I) and the frontal lobe (anterior to Broca's area). The reversed contrast ( VOT - CLT) resulted in a single activation cluster located at the level of the supratemporal plane of the dominant hemisphere. These findings provide first evidence for a distinct contribution of the right cerebellar hemisphere to speech perception in terms of encoding of durational parameters of verbal utterances. Verbal working memory tasks, lexical response selection, and auditory imagery of word strings have been reported to elicit activation clusters of a similar location. Conceivably, representation of the temporal structure of speech sound sequences represents the common denominator of cerebellar participation in cognitive tasks acting on a phonetic code.
API Automation Test with API Relation Diagram
Authors: Se-Hun Jang, Jae-Woong Kim, Seok-Kyu Shin
Venue: Proceedings of the 2006 International Conference on Hybrid Information Technology - Volume 02 (2006)

The automation test is a useful method for test the standard platform that is equipped with APIs (application program interface) that observe the standard. But their test case codes use APIs that is the test target. And that is the reason that test of APIs can not be realized more efficient and more trust than now. We suggest API relation diagram that shows the dependency of the result of APIs execution. That prevents the incorrect decisions from the bad APIs in test cases and the code of test case is simpler because consideration about the bed API exception is needless. Keyword: API, Automation test.
Rhesus Monkeys Behave As If They Perceive the Duncker Illusion
Authors: A. Z. Zivotofsky, M. E. Goldberg, K. D. Powell
Venue: Journal of Cognitive Neuroscience (2005)

The visual system uses the pattern of motion on the retina to analyze the motion of objects in the world, and the motion of the observer him/herself. Distinguishing between retinal motion evoked by movement of the retina in space and retinal motion evoked by movement of objects in the environment is computationally difficult, and the human visual system frequently misinterprets the meaning of retinal motion. In this study, we demonstrate that the visual system of the Rhesus monkey also misinterprets retinal motion. We show that monkeys erroneously report the trajectories of pursuit targets or their own pursuit eye movements during an epoch of smooth pursuit across an orthogonally moving background. Furthermore, when they make saccades to the spatial location of stimuli that flashed early in an epoch of smooth pursuit or fixation, they make large errors that appear to take into account the erroneous smooth eye movement that they report in the first experiment, and not the eye movement that they actually make.
Conditional length distributions induced by the coverage of two points by a Poisson Vorono&iuml; tessellation: application to a telecommunication model: Research Articles
Authors: Catherine Gloaguen
Venue: Applied Stochastic Models in Business and Industry (2006)

The end points of a fixed segment in the Euclidian plane covered by a Poisson Vorono&iuml; tessellation belong to the same cell or to two distinct cells. This marks off one or two points of the underlying Poisson process that are the nucleus(i) of the cell(s). Our interest lies in the geometrical relationship between these nuclei and the segment end points as well as between the nuclei. We investigate their probability distribution functions conditioning on the number of nuclei, taking into account the length of the segment. The aim of the study is to establish some tools to be used for the analysis of a telecommunication problem related to the pricing of leased lines. We motivate and give accurate approximations of the probability of common coverage and of the length distributions that can be included in spreadsheet codes as an element of simple cost functions. Copyright &copy; 2006 John Wiley & Sons, Ltd.
Singular functions of a nonlinear pendulum on finite time intervals
Authors: L. A. Mironovsky, X. Y. Petrova
Venue: Proceedings of the 2003 International Conference on Physics and Control - Volume 4 (2003)

Concept of singular functions of linear systems introduced in the previous works of the authors is extended to the nonlinear case. Singular functions of the nonlinear pendulum are studied. Three approaches to finding singular functions are considered: the classical variational approach, combined approach of variational calculus and flip-method, and genetic algorithm.
Asynchronous Packet-Switching for Networks-on-Chip
Authors: Jun Xu, Reza Sotudeh, Mark B. Josephs
Venue: Proceedings of the Sixth International Conference on Application of Concurrency to System Design (2006)

System-on-Chip design is facing increasing challenges in its integration, global wiring delay and power dissipation. Interconnection network technology has the advantage over conventional bus technology in its scalability; on the other hand, asynchronous circuit design technology may offer power saving and tackle the clock-skew problem. Chip designers are thus turning their attention to Network-on-Chip solutions. Packetswitches play a key role in interconnection networks and this paper focuses on their implementation as asynchronous circuits. The results of experiments run to evaluate several aspects of the routing switch implementation are presented.
Computer-based calculus on campus and at a distance
Authors: Debra Woods, J. J. Uhl
Venue: Proceedings of the 1996 international conference on Learning sciences (1996)

The computer-based calculus course, Calculus&Mathematica (C&M), which was developed with NSF support, will be demonstrated by University of Illinois faculty and undergraduate students. Particular emphasis will be placed on how this new course is delivered on the Internet for distance learners.
Photoluminescence of GaN quantum dots in AlN matrix
Authors: D. D. Ree, V. G. Mansurov, K. S. Zhuravlev
Venue: Microelectronic Engineering (2005)

In the present work steady-state and time-resolved photoluminescence (PL) from self-assembled GaN quantum dots (QDs) embedded in AlN matrix has been studied. The maximum of low-temperature PL is near 2.55 eV that is below the band gap of bulk GaN. The PL peak is not shifted with variation of excitation power. When temperature is increasing the PL peak exhibits a red shift in accordance with a temperature dependence of the band gap of bulk GaN. A huge red shift of the PL maximum from 3.0 down to 2.2 eV is observed as a function of the delay time after the excitation pulse. The PL decay is non-exponential and spectral dependent. The PL decay time varies from about 10 @ms to more than 100 @ms over the spectrum. The experimental results interpreted in framework of a model taking into account an internal electric field in QDs and transport of the non-equilibrium carriers between QDs.
A Dynamic Clustering Algorithm Based on PSO and Its Application in Fuzzy Identification
Authors: Dingxue Zhang, Xinzhi Liu, Zhihong Guan
Venue: Proceedings of the 2006 International Conference on Intelligent Information Hiding and Multimedia (2006)

A dynamic clustering algorithm based on Particle Swarm Optimization (PSO) algorithm is proposed, in which a novel coding and operation on the basis of standard PSO is introduced and DB Index rule is used to determine the validity of clustering. The simulation results illustrate its veracity and efficiency. In the first place, the proper fuzzy rule number and exact premise parameters can be obtained by using the dynamic clustering algorithm to identify fuzzy models, and result parameters by the least squared method (LSM). The effectiveness and practicability is demonstrated by the simulation results of the Box-Jenkins gas furnace data comparing with other methods.
Robustness improvement of known-host-state data-hiding using host statistics
Authors: O. Koval, S. Voloshynovskiy, J. E. Vila-Forcén, F. Pérez-González, F. Deguillaume, T. Pun
Venue: Signal Processing (2006)

In this paper we considered the problem of performance improvement of known-host-state (quantization-based) watermarking methods undergo additive white Gaussian noise (AWGN) and uniform noise attacks. We question the optimality of uniform high rate quantizer based design of dither modulation and distortion compensate dither modulation methods from their robustness to these attacks point of view in terms of bit error rate probability. Motivated by superior performance of uniform deadzone quantizer over the uniform one in lossy source coding, we propose to replace the latter one by a former one designed according to the statistics of the host data. Based on suggested modifications we obtained analytical expressions for bit error rate probability analysis of quantization-based watermarking methods in AWGN and uniform noise channels. Experimental results of computer simulations demonstrated performance enhancement of known-host-state watermarking techniques in comparison to the classically elaborated schemes at negative watermark-to-noise ratios.
An overview of scalar quantization based data hiding methods
Authors: Husrev T. Sencar, Mahalingam Ramkumar, Ali N. Akansu
Venue: Signal Processing (2006)

In Ref. [Costa, Writing on dirty paper, IEEE Trans. Inform. Theory 29 (1983) 439-441.], Costa presented a communications framework that provided useful insights into the study of data hiding. We present an alternate and equivalent framework with a more direct data hiding perspective. The difference between the two frameworks is in how channel dependent nature is reflected in optimal encoding and decoding operations. The connection between the suggested encoding/decoding scheme and practical embedding/detection techniques is examined. We analyze quantization based embedding/detection techniques in terms of the proposed framework based on three key aspects. The first aspect is the type of postprocessing utilized at the embedder (i.e. distortion compensation [Chen, Wornell, Preprocessed and postprocessed quantization index modulation methods for digital watermarking, in: Proceedings of SPIE: Security and Watermarking of Multimedia Contents II, vol. 3971, 2000, pp. 48-59; Eggers, Su, Girod, A blind watermarking scheme based on structured codebooks, IEE Colloq. Secure Images Image Authentication 4 (2001) 1-6.], thresholding [Ramkumar, Akansu, Self-noise suppression schemes for blind image steganography, in: Proceedings of SPIE International Workshop on Voice, Video and Data Communication, Multimedia Applications, vol. 3845, 1999.], Gaussian mapping [Perez-Gonzalez, Balado, Hernandez Martin, Performance analysis of existing and new methods for data hiding with known-host information in additive channels, IEEE Trans. Signal Process. 51(4) (2003) 960-980].). The second key aspect is the form of demodulation used at the extractor. The third is the criteria used to optimize the embedding/detection parameters. The embedding/detection techniques are compared in terms of probability of error, correlation, and mutual information (hiding rate) performance merits.
Vulnerability Analysis of MMS User Agents
Authors: Collin Mulliner, Giovanni Vigna
Venue: Proceedings of the 22nd Annual Computer Security Applications Conference (2006)

The Multimedia Messaging Service (MMS) is becoming more popular, as mobile phones integrate audio and video recording functionality. Multimedia messages are delivered to users through a multi-step process, whose end-points are the MMS User Agents that reside on the users' mobile phones. The security of these components is critical, be- cause they might have access to private information and, if compromised, could be leveraged to spread an MMS-based worm. Unfortunately, the vulnerability analysis of these components is made more difficult by the fact that they are mostly closed-source and the testing has to be performed through the mobile phone network, which makes the testing time-consuming and costly. This paper presents a novel approach to the security testing of MMS User Agents. Our approach takes into account the effects of the infrastructure on the delivery of MMS messages and then uses a virtual infrastructure to speed up the testing process. Our testing approach was able to identify a number of previously unknown vulnerabilities, which, in one case, allowed for the execution of arbitrary code.