ppxscal/embedding_network huggingface dataset:
2009 Special Issue: Discrete combinatorial circuits emerging in neural networks: A mechanism for rules of grammar in the human brain?
Authors: Friedemann Pulvermüller, Andreas Knoblauch
Venue: Neural Networks (2009)

In neural network research on language, the existence of discrete combinatorial rule representations is commonly denied. Combinatorial capacity of networks and brains is rather attributed to probability mapping and pattern overlay. Here, we demonstrate that networks incorporating relevant features of neuroanatomical connectivity and neuronal function give rise to discrete neuronal circuits that store combinatorial information and exhibit a function similar to elementary rules of grammar. Key properties of these networks are rich auto- and hetero-associative connectivity, availability of sequence detectors similar to those found in a range of animals, and unsupervised Hebbian learning. Input of specific word sequences establishes sequence detectors in the network, and substitutions of words and larger string segments from one syntactic category, occurring in the context of elements of a second syntactic class, lead to binding between them into neuronal assemblies. Critically, these newly formed aggregates of sequence detectors now respond in a discrete generalizing fashion when members of specific substitution classes of string elements are combined with each other. The discrete combinatorial neuronal assemblies (DCNAs) even respond in the same way to learned strings and to word sequences that never appeared in the input but conform to a rule. We also show how combinatorial information interacts with information about functional and anatomical properties of the brain in the emergence of discrete neuronal circuits that may implement rules and discuss the model in the wider context of brain mechanism for syntax and grammar. Implications for the evolution of human language are discussed in closing.
On the properties of an adaptive TCP Minimum RTO
Authors: Ioannis Psaras, Vassilis Tsaoussidis
Venue: Computer Communications (2009)

The Internet Engineering Task Force (IETF) specified in RFC 2988 the Minimum TCP-RTO and recommended that the TCP Retransmission Timeout (RTO) should not be smaller than 1s. According to RFC 2988, there are two main limitations that call for a lower bound to protect TCP from spurious timeouts: (i) the OS clock granularity (500ms for most OSs at the time of RFC 2988 publication) and (ii) the Delayed Acknowledgments (usually set to 200ms). We evaluate the correctness of the suggested policy and investigate the impact of the conservative 1-s Minimum TCP-RTO under modern networking conditions. We define a Cost Function to capture the impact of the extra waiting time, due to the conservative IETF specification. Our experimental analysis reveals that the OS clock granularity should not be a matter of concern for modern OSs; we carefully design a mechanism to deal with Delayed ACKs. We call the proposed mechanism Adaptive MINRTO (AdMINRTO) to reflect its operational properties. In particular, the mechanism identifies the packets whose ACKs are (possibly) going to be delayed and applies extended Minimum RTO to these packets only, in order to avoid spurious timeout expirations; otherwise, the Minimum RTO is adjusted to smaller values in order to avoid extensive idle periods. We show, through simulations, that the Adaptive MINRTO improves TCP performance significantly, especially in case of next generation's high-speed, wireless-access networks. The impact of the proposed mechanism, performance-wise, depends on several network conditions. For example, the impact of the Adaptive MINRTO increases (i) with the Packet Error Rate (PER), (ii) when the path Round-Trip Time is short and (iii) for fast transmission links (i.e., high-speeds).
Communicating News via Weblogs: An Innovative Strategy in Readership Bonding
Authors: Ulrike Michels
Venue:  (2007)

Newspapers which concentrate on their traditional information channels are faced with a decreasing readership. At the same time, innovative communication tools like CMS-based weblogs, podcasts and RSS feeds conquer the WWW. Can weblogs help the information industry to increase readership loyalty? This study examines in how far the news language of weblogs differs from the news language in traditional print or online newspapers. A particular focus is set on oral language and its sociolinguistic functions. The analysis should help to answer the questions: - Can weblogs help to minimize the distance between journalists and readers? - Can weblogs assist in attracting a new kind of readership? - Can weblogs assist in raising readership loyalty? All results can also be transferred from journalism to public relations and marketing: - Can weblogs help to provide you closer insight into your customer needs? - Can weblogs assist in attracting new target groups? - Can weblogs assist in raising customer loyalty? The book is addressed to professionals in Communications like editors, journalists and Communications Managers. It is also directed towards researchers in Linguistics, Communications and Journalism.
Low-power, process-variation tolerant on-chip thermal monitoring using track and hold based thermal sensors
Authors: Basab Datta, Wayne Burleson
Venue: Proceedings of the 19th ACM Great Lakes symposium on VLSI (2009)

High die temperatures adversely impact CMOS device operation degrading both performance and reliability of integrated circuits. Dynamic thermal management (DTM) schemes rely on physical sensors to provide them with feedback to ensure an accurate and closed-loop throttling mechanism. Power-density trends in current-generation, high-performance processors motivate the need for multiple, low-power and highly accurate thermal monitoring circuits. Studies performed on power-thermal-characteristics of current processors suggest that better sensor-measurement accuracy translates into power-savings and better system-performance. To this end, we propose a novel, track and hold-based on-chip thermal sensor which provides an accuracy of
Event-B Patterns for Specifying Fault-Tolerance in Multi-agent Interaction
Authors: Elisabeth Ball, Michael Butler
Venue: Methods, Models and Tools for Fault Tolerance (2009)

Interaction in a multi-agent system is susceptible to failure. A rigorous development of a multi-agent system must include the treatment of fault-tolerance of agent interactions for the agents to be able to continue to function independently. Patterns can be used to capture fault-tolerance techniques. A set of modelling patterns is presented that specify fault-tolerance in Event-B specifications of multi-agent interactions. The purpose of these patterns is to capture common modelling structures for distributed agent interaction in a form that is re-usable on other related developments. The patterns have been applied to a case study of the contract net interaction protocol.
A Comparative Analysis of Latent Variable Models for Web Page Classification
Authors: Istvan Biro, Andras Benczur, Jacint Szabo, Ana Maguitman
Venue: Proceedings of the 2008 Latin American Web Conference (2008)

A main challenge for Web content classification is how to model the input data. This paper discusses the application of two text modeling approaches, Latent Semantic Analysis (LSA) and Latent Dirichlet Allocation (LDA), in the Web page classification task. We report results on a comparison of these two approaches using different vocabularies consisting of links and text. Both models are evaluated using different numbers of latent topics. Finally, we evaluate a hybrid latent variable model that combines the latent topics resulting from both LSA and LDA. This new approach turns out to be superior to the basic LSA and LDA models. In our experiments with categories and pages obtained from the ODP web directory the hybrid model achieves an averaged F-measure value of 0.852 and an averaged ROC value of 0.96.
A sustainable identity: the creativity of an everyday designer
Authors: Ron Wakkary, Karen Tanenbaum
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

In this paper we explore sustainability in interaction design by reframing concepts of user identity and use in a domestic setting. Building on our own work on everyday design and Blevis's Sustainable Interaction Design principles, we present examples from an ethnographic study of families in their homes which illustrate design-in-use: the creative and sustainable ways people appropriate and adapt designed artifacts. We claim that adopting a conception of the user as a creative everyday designer generates a new set of design principles that promote sustainable interaction design.
Characteristics of YouTube network traffic at a campus network - Measurements, models, and implications
Authors: Michael Zink, Kyoungwon Suh, Yu Gu, Jim Kurose
Venue: Computer Networks: The International Journal of Computer and Telecommunications Networking (2009)

User-Generated Content has become very popular since new web services such as YouTube allow for the distribution of user-produced media content. YouTube-like services are different from existing traditional VoD services in that the service provider has only limited control over the creation of new content. We analyze how content distribution in YouTube is realized and then conduct a measurement study of YouTube traffic in a large university campus network. Based on these measurements, we analyzed the duration and the data rate of streaming sessions, the popularity of videos, and access patterns for video clips from the clients in the campus network. The analysis of the traffic shows that trace statistics are relatively stable over short-term periods while long-term trends can be observed. We demonstrate how synthetic traces can be generated from the measured traces and show how these synthetic traces can be used as inputs to trace-driven simulations. We also analyze the benefits of alternative distribution infrastructures to improve the performance of a YouTube-like VoD service. The results of these simulations show that P2P-based distribution and proxy caching can reduce network traffic significantly and allow for faster access to video clips.
Variable selection in multivariate methods using global score estimation
Authors: Kaoru Fueda, Masaya Iizuka, Yuichi Mori
Venue: Computational Statistics (2009)

A variable selection method using global score estimation is proposed, which is applicable as a selection criterion in any multivariate method without external variables such as principal component analysis, factor analysis and correspondence analysis. This method selects a subset of variables by which we approximate the original global scores as much as possible in the context of least squares, where the global scores, e.g. principal component scores, factor scores and individual scores, are computed based on the selected variables. Global scores are usually orthogonal. Therefore, the estimated global scores should be restricted to being mutually orthogonal. According to how to satisfy that restriction, we propose three computational steps to estimate the scores. Example data is analyzed to demonstrate the performance and usefulness of the proposed method, in which the proposed algorithm is evaluated and the results obtained using four cost-saving selection procedures are compared. This example shows that combining these steps and procedures yields more accurate results quickly.
The compressible hybrid RANS/LES formulation using an additive operator
Authors: Martín Sánchez-Rocha, Suresh Menon
Venue: Journal of Computational Physics (2009)

In this work, the compressible governing equations for the hybrid Reynolds-averaged/large-eddy simulations are formally derived by applying a hybrid filter to the Navier-Stokes equations. This filter is constructed by linearly combining the Reynolds-average (RANS) and large-eddy simulation (LES) operators with a continuous blending function. The derived hybrid equations include additional terms that represent the interactions between RANS and LES formulations. The relevance of these terms is investigated in flat-plate turbulent boundary layer simulations and indicate that these additional terms play a fundamental role in compensating for the turbulence that is neither modeled nor resolved in the transition region between RANS and LES. Results also show that when the additional terms are included, the calculations are not very sensitive to the blending function implemented in the hybrid filter. In the contrary, when these terms are neglected and a step function is implemented in the hybrid filter, nonphysical discontinuities are predicted in the flow statistics.
Pseudo d-algebras
Authors: Young Bae Jun, Hee Sik Kim, J. Neggers
Venue: Information Sciences: an International Journal (2009)

We introduce the notion of a pseudo d-algebra as a generalization of the idea of a d-algebra. The class of pseudo d-algebras can be included in the class of coupled d-algebras. We show that the class of pseudo d-algebras behaves well with respect to standard mappings such as direct products and standard mappings such as homomorphisms. Indeed, we are able to prove a fundamental theorem of homomorphisms and we are able to identify kernel objects as d-ideals in this theory. We also discuss several large classes of examples of pseudo d-algebras which occur in different settings and we identify properties sufficient for or equivalent to membership in important subclasses of the class of pseudo d-algebras in these settings.
Cryptanalysis of an Identity Based Proxy Multi-Signature Scheme
Authors: Fagen Li, Shijie Zhou, Rong Sun
Venue: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences (2008)

In a proxy multi-signature scheme, a designated proxy signer can generate the signature on behalf of a group of original signers. Recently, Wang and Cao proposed an identity based proxy multi-signature scheme along with a security model. Although they proved that their scheme is secure under this model, we disprove their claim and show that their scheme is not secure.
Research and analysis of simulation-based networks through multi-objective visualization
Authors: J. Mark Belue, Stuart H. Kurkowski, Scott R. Graham, Kenneth M. Hopkinson, Ryan W. Thomas, Joshua W. Abernathy
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Visualization of individual network events is a crucial part of testing new network designs and analyzing network performance and efficiency. This research designed and developed a framework for visualizing complex military and non-military wired and wireless networks. Our framework provides a robust network simulator trace file parser, multiple network visualization layouts-including user-defined layouts, and precise visualization controls. The parser architecture is capable of accepting trace files from different network simulators and provides one common visualization environment to study network scenarios run on different simulators. The many dynamic multi-objective network views add to the analyst's suite of tools available for analyzing networks. Analysts can toggle between the different views to provide even greater analysis capability. We describe our methodologies for the design and provide example analysis scenarios. Our framework will allow researchers to advance the state of network simulation-based analysis.
H.264/AVC Video Encoder Realization and Acceleration on TI DM642 DSP
Authors: Daw-Tung Lin, Chung-Yu Yang
Venue: Proceedings of the 3rd Pacific Rim Symposium on Advances in Image and Video Technology (2009)

This work develops and optimizes H.264/AVC video encoder on the TM320DM642 DSP platform. In order to transplant x264 source program onto the DSP and to accelerate the coding speed, a series of optimization methods have been proposed in this paper, including 2-D fast mode decision, sub-pixel optimization for motion estimation, and weighted matrix quantization. Furthermore, based on the architectural features of TM320DM642, various system level optimization techniques have been utilized. This paper focuses on the reduction of algorithm complexity. Experimental results reveal that the optimized H.264 video encoder retains satisfactory quality with very low degradation. The implemented codec can achieve the coding speed of 22.6fps and more than 40fps for VGA (640&times;480) and CIF (352&times;288) resolution, respectively. The proposed H.264 codec can be employed in many real-time applications.
ARABIC CHARACTER RECOGNITION USING MODIFIED FOURIER SPECTRUM (MFS) VS. FOURIER DESCRIPTORS
Authors: Sabri A. Mahmoud, Ashraf S. Mahmoud
Venue: Cybernetics and Systems (2009)

Fast Fourier transform (FFT) is used successfully in computing the Fourier descriptors which are used in object and character recognition. In this article, an Arabic character recognition algorithm using modified fourier spectrum (MFS) is presented. Ten descriptors are estimated from the Fourier spectrum of the character contour by subtracting the imaginary part from the real part (and not from the amplitude of the Fourier spectrum as is usually the case). Ten MFS descriptors are extracted and used for the recognition of Arabic characters. Experimental results using 10 MFS descriptors resulted in an average recognition rate of 95.9%. The analysis of the sparse matrix indicates that the major part of the errors is due to few similar characters. The new technique, based on MFS descriptors, was compared with the Fourier descriptors calculated from the amplitude of the FFT spectrum. Experimental results have shown that the MFS-based technique is faster to compute than the FFT-based technique. However, the Fourier descriptors, initially, have a better recognition rate than MFS descriptors (96.9% vs. 95.9%). Using the holes' and dots' features to resolve the problematic characters reduces the error rate of the MFS technique more than that of the Fourier descriptor technique. This article introduced MFS-based features that are faster to compute than Fourier descriptors and have fewer errors utilizing the dots and holes features of Arabic characters. Both techniques may be used in combination or in a multi-classifier system to enhance the Arabic recognition system rate.
Push-to-Talk Service Investigation and Improvement
Authors: Jae-Hyung Cho, Je-Hyun Lee, Bi-Feng Yu, Jae-Oh Lee
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 02 (2009)

As we all know Push-to-talk service implemented in the Cellular network has deeply enhanced the advantages of traditional Walkie-Talkie service without the limitation of distance. In order to enrich the Multimedia network communication, we have tried to deploy the PoC service into the IMS Service Delivery Platform (SDP). Related work we have done is to simulate PoC service in IP Multimedia Subsystem (IMS) platform in our computer environment by programming. In this paper we will firstly introduce the basic OMA PoC 2.0 architectures with its media control protocols and show some scenarios of its session flow. Then focus on our practical implement of the simulation that has been instantiated by using Java programming to show its capability and convenience. At last we will make some conclusions.
An algorithm to estimate delay times in petri net models of signaling pathways with experimental data
Authors: Kanji Hioka, Yoshimasa Miwa, Chen Li, Qi-Wei Ge, Hiroshi Matsuno, Satoru Miyano
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

In this paper, we propose an algorithm to estimate delay times in a Petri net model of signaling pathways based on biological experimental data. Firstly, we demonstrate a modeling method of signaling pathways with discrete Petri net using ErbB4 signaling pathway. Then, we propose a delay time estimation algorithm for Petri net models with experimental data. The estimated delay times are assigned to the transitions of the Petri net model of the ErbB4 signaling pathway that is simulated on Cell Illustrator 3.0. The simulation results are evaluated by comparing with the experimental data.
E.T.A.
Authors: Henrik Bjerregaard Clausen
Venue: ACM SIGGRAPH ASIA 2008 computer animation festival (2008)

As Marvin pilots his cargo freighter through space, his only entertainment is a TV with the worst picture reception in recorded human history. He consoles himself with vast quantities of pizza and coffee to barely stay awake for the journey as random power outages interrupt the ride. But this time he may have more on board his vessel than he bargained for ...
QuickDraw: bringing graphics into first year
Authors: Ben Stephenson, Craig Taube-Schock
Venue: Proceedings of the 40th ACM technical symposium on Computer science education (2009)

This paper describes a new tool for introducing computer graphics and multimedia applications into first year, called QuickDraw, and our experience using it. QuickDraw provides an easy to use language and platform independent interface which permits students to create multimedia applications beginning with their first assignment in an introductory computer science course. QuickDraw has been carefully designed to avoid complex "magical" statements in order to setup, use, or tear down the multimedia environment, making it an appropriate tool for use with students with no prior programming experience. As instructors, we have found that QuickDraw effectively engages students by allowing them to create visually impressive programs with minimal complexity, while continuing to allow us to effectively teach fundamental computer science concepts.
VBR Video Data Scheduling using Window-Based Prefetching
Authors: In-Hwan Kim, Jeong-Won Kim, Seung-Won Lee, Ki-Dong Chung
Venue: Proceedings of the IEEE International Conference on Multimedia Computing and Systems - Volume 2 (1999)

The MPEG data used in a video server has variable bit rate(VBR) characteristics because each frame is different in size, and the difference of movements between frames is also variable. So, a video server must consider this VBR characteristic in resource management. So far for VBR data, many scheduling schemes have been proposed. When VBR video is displayed, tf disk bandwidth is allocated assuming the worst case, the utilization of disk bandwidth becomes very low. In order to raise the utilization of disk bandwidth, a prefetching scheme is used. But, this nee& extra buffers. In this paper, we propose a WVS (Window-based VBR data scheduling scheme) for VBR data. WVSprefetches data with a limited maximum bandwidth for each window unit. Moreover; WVS, which considers the state of system resources, can obtain a tradeoff between disk bandwidth and buffer allocation. The proposed scheme constructs in advance CTL (Constant Time Length) meta data about a video and dynamically allocates resources for each window unit. In simulations, we compared the proposed scheme with previous schemes in terms of the size of resource allocation and the number of concurrent users.