ppxscal/embedding_network huggingface dataset:
Share: run-time system for high-performance virtualized routers
Authors: Harrick M. Vin
Venue:  (2005)

The enormous size and scope of today's Internet make the deployment of new network technologies and advanced services difficult. One strategy to address such ossification is to combine two evolving trends in building network services---overlay networks and network virtualization. The combination allows multiple overlay networks providing alternate end-to-end services to co-exist on a shared virtualized substrate. The building blocks of such a substrate---termed virtualized routers---utilize programmable multi-processor hardware to provide the flexibility of hosting diverse services simultaneously, and process packets at high rates. In this dissertation, we describe the design and implementation of ShaRE, the first run-time system for such high-performance, multi-service virtualized routers. ShaRE provides two functionalities. First, ShaRE multiplexes hardware resources among multiple services while preventing damaging interactions and instabilities. Second, ShaRE exposes a packet-processing-oriented resource abstraction layer and includes a set of adaptation mechanisms to simplify the programmability and portability of high-performance network services. Virtualized routers exhibit several unique characteristics that make the above functionalities challenging. First, network services are required to process packets within a small delay from their arrivals. Second, at these time-scales, network traffic is bursty and often hard-to-predict. Third, the overhead of reallocating processors from one service to another in current router hardware is larger than the packet processing time. Finally, to achieve high performance, router hardware (unlike conventional systems) includes a complex array of resources such as multi-core processors, fixed-function co-processors, and inter-processor communication mechanisms. In designing ShaRE, we make three contributions. First, we design Everest, an agile and wary scheduler for allocating processors to services in high-performance routers. Everest's agility and wariness help cope with stringent delay tolerance, and difficult-to-predict and significant fluctuations in packet arrival rates, and large context-switch overheads. Second, we demonstrate that the efficacy of a scheduler depends on various system, workload and service characteristics, and design variants of Everest that perform the best under different characteristics. Finally, to minimize the overhead of replicating services or check-pointing and migrating services from one processor to another, we identify and exploit several unique characteristics of network services. We instantiate our contributions on Intel's IXP2400 programmable router hardware.
Efficient pricing of barrier options with the variance-gamma model
Authors: Athanassios N. Avramidis
Venue: Proceedings of the 36th conference on Winter simulation (2004)

We develop an efficient Monte Carlo algorithm for pricing barrier options with the variance gamma model (Madan, Carr, and Chang 1998). After generalizing the double-gamma bridge sampling algorithm of Avramidis, L'Ecuyer, and Tremblay (2003), we develop conditional bounds on the process paths and exploit these bounds to price barrier options. The algorithm's efficiency stems from sampling the process paths up to a random resolution that is usually much coarser than the original path resolution. We obtain unbiased estimators, including the case of continuous-time monitoring of the barrier crossing. Our numerical examples show large efficiency gain relative to full-dimensional path sampling.
Cooperation Model of Multi-agent System Based on the Situation Calculus
Authors: Yisong Liu, Lili Dong, Yamin Sun
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

In multi-agent system, the Requirement/Service is a cooperation way that is simple, efficient, and wildly applied. Under the framework of Situation Calculus, the agents' belief and intention are formalized, and some new communication actions are introduced into the earlier ConGolog. Consequently, we propose a Requirement/Service cooperative model and semantics for multi-agent System based on the extended ConGolog. What's more, in terms of the model and semantics, we specify a case of the multi-agent system in the dynamic and incompletely known environment for achieving the cooperation based on reason about action.
Apriori Rate Allocation in Wavelet-Based Image Compression
Authors: Sven Grottke, Thomas Richter, Ruedi Seiler
Venue: Proceedings of the Second International Conference on Automated Production of Cross Media Content for Multi-Channel Distribution (2006)

We present a rate allocation scheme that pre-computes optimal quantisation bucket sizes based on a mathematical model of wavelet transformed natural images prior entropy encoding. We combine the proposed scheme with the JPEG2000 embedded rate-allocator and find in our experiments that it is able to increase JPEG2000 encoding speed by a factor of two without loosing image quality.
TRICam - An Embedded Platform for Remote Traffic Surveillance
Authors: Clemens Arth, Horst Bischof, Christian Leistner
Venue: Proceedings of the 2006 Conference on Computer Vision and Pattern Recognition Workshop (2006)

In this paper we present a novel embedded platform, dedicated especially to the surveillance of remote locations under harsh environmental conditions, featuring various video and audio compression algorithms as well as support for local systems and devices. The presented solution follows a radically decentralized approach and is able to act as an autonomous video server. Using up to three Texas InstrumentsTM TMS320C6414 DSPs, it is possible to use high-level computer vision algorithms in real-time in order to extract the information from the video stream which is relevant to the surveillance task. The focus of this paper is on the task of vehicle detection and tracking in images. In particular, we discuss the issues specific for embedded systems, and we describe how they influenced our work. We give a detailed description of several algorithms and justify their use in our implementation. The power of our approach is shown on two real-world applications, namely vehicle detection on highways and license plate detection on urban traffic videos.
A new collision resistant hash function based on optimum dimensionality reduction using Walsh-Hadamard transform
Authors: Barzan Mozafari, Mohammad Hasan Savoji
Venue: Proceedings of the 9th International Conference on Information Technology (2006)

Hash functions play the most important role in various cryptologic applications, ranging from data integrity checking to digital signatures. Our goal is to introduce a new hash function using Walsh-Hadamard transform for achieving dimensionality reduction (compression) with a regular and one-way distribution. Merkle-Damgard (MD) transform is applied to this compression function in order to turn it into a hash function. Our algorithm has a flexible framework in which some parameters and steps could be changed according to different needs for more security or less computation time. Our emphasis is on its resistance against some variations of birthday attack. We evaluate collision resistant behavior of this algorithm for some configurations by calculating the balance factor. As we will see our balance factor is very close to SHA-1's. We present some experimental results to determine the balance factor of this algorithm for several output lengths. The experiment is done first, by converting the hash function to a similar one with a lower range size for an exact evaluation. Moreover, for larger range size, we use some bits of the output with a fraction of possible inputs, randomly chosen, to obtain another approximation of its balance factor. We also analyze avalanche effect of our proposed function which is another common measurement for cryptographic hash functions.
Modeling Multi-View Software Process with Object Petri Nets
Authors: Jidong Ge, Hao Hu, Qing Gu, Jian Lu
Venue: Proceedings of the International Conference on Software Engineering Advances (2006)

PSEE (Process-centered Software Engineering Environment) can manage and monitor software process. Software process modeling language is a core element in PSEE system. Due to the particularity and the complexity, software process model includes multi-views: activity view, product view and role view, which should be considered in modeling software process. Based on the similarity between multi-view software process modeling and object Petri nets, this paper proposes the MOPN-SP-net model which is a multi-view software process model based on multi-object Petri nets. The model includes twolevel models: system net and object net. A multi-view paradigm including activity views and product views is provided. Activity views are described by system nets and product views are described by object nets. MOPN-SP-net includes multi-views of software process model, which is characterized with clearer hierarchy, simpler structure, and more extendibility.
Boosting-Based Learning Agents for Experience Classification
Authors: Po-Chun Chen, Xiaocong Fan, Shizhuo Zhu, John Yen
Venue: Proceedings of the IEEE/WIC/ACM international conference on Intelligent Agent Technology (2006)

The capability of learning from experience is of critical importance in developing multi-agent systems supporting dynamic group decision making. In this paper, we introduce a hierarchical learning approach, aiming to support hierarchical group decision making where the decision makers at lower levels only have partial view of the whole picture. To further understand such a hierarchical learning concept, we implemented a learning component within the R-CAST agent architecture, with lower-level learners using the LogitBoost algorithm with decision stumps. The boosting-based learning agents were then used in our experiments to classify experience instances. The results indicate that hierarchical learning can largely improve decision accuracy when lower-level decision makers only have limited information accessibility.
Multiple Nose Region Matching for 3D Face Recognition under Varying Facial Expression
Authors: Kyong I. Chang Kevin W. Bowyer, Patrick J. Flynn
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

An algorithm is proposed for 3D face recognition in the presence of varied facial expressions. It is based on combining the match scores from matching multiple overlapping regions around the nose. Experimental results are presented using the largest database employed to date in 3D face recognition studies, over 4,000 scans of 449 subjects. Results show substantial improvement over matching the shape of a single larger frontal face region. This is the first approach to use multiple overlapping regions around the nose to handle the problem of expression variation.
Publish/Subscribe on the top of Overlay networks: when subscription dynamics meet churn
Authors: Roberto Baldoni
Venue: Proceedings of the 26th IEEE International ConferenceWorkshops on Distributed Computing Systems (2006)

Distributed event routing on the top of overlay networks has emerged as a key technology for achieving scalable information dissemination. In particular it has been used as preferential communication backbone within publish/ subscribe communication system. Its aim is to reduce the network and computational overhead per event diffusion to a set (possibly large) of interested recipients despite churn and subscription changes. This talk points out the functional decomposition between event-based routing layer, the overlay infrastructure layer (structured and unstructured) and the network protocols layer. Hence the talk surveys solutions for event based routing on overlay infrastructures discussing their inherent limitations and constraints related to both the process of arrival and departure of nodes from the overlay network and the process of subscription changes at the application level.
A Process for Performing Security Code Reviews
Authors: Michael Howard
Venue: IEEE Security and Privacy (2006)

No one really likes reviewing source code for security vulnerabilities, but it's a critical componentof shipping secure software. Howard describes his approach to tackling the process. It won't identify allsecurity vulnerabilities in your code, but it's effective for scanning large amounts of code quickly forcommon issues and reviewing risky code in greater depth.
Theory in pieces: the communal development of a theory
Authors: Orit Parnafes, Andrea diSessa, Joseph Wagner, Jose Mestre, Tom Thaden-Koch, Bruce Sherin
Venue: Proceedings of the 7th international conference on Learning sciences (2006)

This symposium aims to expose some of the social dynamics of theory development in the learning sciences by examining one particular case. It examines how individual studies contribute to theory development by using and extending an original theory of conceptual development, coordination class theory. We show how the diversity of contexts in which these ideas have been applied has contributed, not so much to validation, but to genuine expansion of meaning and power of the theory. This pattern emphasizes the essentially social nature of theory construction, and also a striking parallel between theory development in professional science and ideas about conceptual development in students that emphasize the role of multiple contexts. We discuss theoretical and methodological issues of communal development of a theory, such as theoretical power, fit, extension and generality.
Large System Decision Fusion Performance in Inhomogeneous Sensor Networks
Authors: Sudharman K. Jayaweera, Kossai Al-Tarazi
Venue: Proceedings of the IEEE International Conference on Video and Signal Based Surveillance (2006)

The problem of decision fusion in a large wireless sensor system with many power-constrained distributed nodes is considered. The sensor network is assumed to be inhomogeneous. i.e. the channel statistics are not identical among the sensors. Assuming identical, binary local quantizing schemes at all the nodes, the optimal fusion scheme is derived. The large system performance of this optimal decision fusion detector is next analyzed. The asymptotic fusion performance is derived via the Lindberg-Feller central limit theorem for non-identical large samples. Numerical examples are used to show that the derived large system closed-form fusion error probability expressions provide a very close approximation to the exact finite-size sensor system fusion performance even for a relatively smaller number of nodes.
Overlay Multicast with Inferred Link Capacity Correlations
Authors: Ying Zhu, Baochun Li
Venue: Proceedings of the 26th IEEE International Conference on Distributed Computing Systems (2006)

We model the overlay using linear capacity constraints, which accurately and succinctly capture overlay link correlations. We show that finding a maximum-bandwidth multicast tree in an overlay with LCC is NP-complete and propose an efficient distributed heuristics algorithm.
Integrating the physical world with the web to enable context-enhanced mobile services
Authors: Philippe Debaty, Patrick Goddi, Alex Vorbau
Venue: Mobile Networks and Applications (2005)

This work has its roots in the HP Labs Cooltown project, whose core principle is that the integration of our physical world with the Web offers unique opportunities to enable ubiquitous computing applications. This paper describes our latest results in building a model and a software architecture called the Web presence manager (WPM) to support this physical-virtual integration. This software layer implements and specifies the services and information provided by Web representations of physical entities such as people, places, or things. We detail an extensive context-enhanced media-oriented application built on top of our platform. Our application enables mobile and context-aware access to personal contents and rendering on local appliances in a variety of ubiquitous computing environments.
Optimizing subroutines with optional parameters in F90 via function cloning
Authors: Dibyendu Das
Venue: ACM SIGPLAN Notices (2006)

Optional parameters are a feature of Fortran90. The objective of this feature is to allow the F90 programmer to declare a subroutine using a number of arguments and specify a subset of these parameters as optional, which in turn, allows the programmer to omit any of these optional parameters during invocation of the subroutine. The body of such a subroutine uses an F90 intrinsic function called present(), to test whether an optional parameter has meaningful values at run-time. The optional parameter can be written/read if and only if present() returns a true value. In this work, we describe a mechanism by which such subroutines which use optional parameters can be efficiently optimized using function cloning or specialization. Function Cloning is a well-known optimization technique that creates multiple copies of a function f(), in order to exploit better optimization opportunities. We will show how cloning/specialization can be utilized such that all calls to present() can be totally eliminated in the body of such subroutines. Cloning will also result in optimization opportunities not exploitable in the original source.
Using mobility as a conceptual framework for informing the design of mobile ICT for construction professionals
Authors: Val Mitchell, Andy May, Sarah Bowden, Tony Thorpe
Venue: Proceedings of the 8th conference on Human-computer interaction with mobile devices and services (2006)

This paper illustrates how the concept of mobility can be used to consider how contextual factors shape user requirements for mobile ICT. The spatial, temporal and contextual mobility of construction professionals is described based on fieldwork conducted within the UK. A distinction between the mobility of workers when they are operating remotely within a geographically distributed team and when they are working cooperatively with others co-located on site is reported. The implications of this finding are discussed in relation to the mobile ICT needs of construction professionals.
Two-Dimensional Channel Estimation Based on Sliding Window for Digital Amplitude Modulation Broadcasting System
Authors: Jikang Wang, Heqin Zhou
Venue: Proceedings of the First International Conference on Innovative Computing, Information and Control - Volume 1 (2006)

A novel two-dimensional channel estimation method based on sliding window is proposed for OFDM-based digital broadcasting system. The method first estimates the channel transfer function at the same subcarrier with an interpolator in time direction, and then processes the received pilots in both multipath spread domain and Doppler spread domain. In this way, it significantly reduces the inter-carrier interference (ICI) due to time-variant shortwave channel and additive white Gaussian noise (AWGN). Moreover, with the sliding window and adjustable sliding step, it can effectively handle the case of different path number as well as different path delays, which demonstrates our method's robust feature. Simulation demonstrates that the proposed method performs well at typical midwave and short-wave broadcasting channels.
On channel estimation for RAKE receiver in a mobile multipath fading channel
Authors: Fu Li, Heng Xiao, Jin Yang
Venue: Proceedings of the Acoustics, Speech, and Signal Processing,1994. on IEEE International Conference - Volume 04 (1994)

Multipath fading is one of the major practical concerns in wireless communications. Multipath problem always exists in the mobile environment, especially for a mobile unit which is often embedded in its surroundings. The RAKE receiver has been used to reduce the multipath fading in a wideband spread spectrum mobile system. However, the tap weights of the multipath channel model need to be estimated. We explore the possibility of using advanced signal processing algorithms to estimate the multipath channels and propose a least-squares approach to tap weight estimation based on chip rate channel estimates to investigate the performance of the RAKE receiver in a realistic mobile environment. Simulations show that the new approach outperforms the existing approaches.
Emerging Neurophysiological Specialization for Letter Strings
Authors: Urs Maurer, Silvia Brem, Kerstin Bucher, Daniel Brandeis
Venue: Journal of Cognitive Neuroscience (2005)

In adult readers, printed words and other letter strings activate specialized visual functions within 200 msec, as evident from neurophysiological recordings of brain activity. These fast, specialized responses to letter strings are thought to develop through plastic changes in the visual system. However, it is unknown whether this specialization emerges only with the onset of word reading, or represents a precursor of literacy. We compared 6-year-old kindergarten children who could not yet read words to adult readers. Both age groups detected immediate repetitions of visually presented words, pseudowords, symbol strings, and pictures during event-related potential (ERP) mapping. Maps from seven corresponding ERP segments in children and adults were analyzed regarding fast (<250 msec) and slow (>300 msec) specialization for letter strings. Adults reliably differentiated words through increased fast (<150 msec) occipito-temporal N1 activity from symbols. Children showed a later, more mid-occipital N1 with marginal word&ndash;symbol differences, which were absent in those children with low letter knowledge. Children with high letter knowledge showed some fast sensitivity to letter strings, which was confined to right occipito-temporal sites, unlike the stronger adult N1 specialization. This suggests that a critical degree of early literacy induces some immature, but fast, specialization for letter strings before word reading becomes possible. Children also differentiated words from symbols in later segments through increased right occipito-temporal negativity for words. This slow specialization for letter strings was not modulated by letter knowledge and was absent in adults, possibly reflecting a visual precursor of literacy due to visual familiarity with letter strings.
Performance evaluation of agent-based material handling systems using simulation techniques
Authors: Radu F. Babiceanu, F. Frank Chen
Venue: Proceedings of the 37th conference on Winter simulation (2005)

The increasing influence of global economy is changing the conventional approach to managing manufacturing companies. Real-time reaction to changes in shop-floor operations, quick and quality response in satisfying customer requests, and reconfigurability in both hardware equipment and software modules, are already viewed as essential characteristics for next generation manufacturing systems. Part of a larger research that employs agent-based modeling techniques in manufacturing planning and control, this work proposes an agent-based material handling system and contrasts the centralized and decentralized scheduling approaches for allocation of material handling operations to the available resources in the system. To justify the use of the decentralized agent-based approach and assess its performance compared to conventional scheduling systems, a series of validation tests and a simulation study are carried out. As illustrated by the preliminary results obtained in the simulation study the decentralized agentbased approach can give good feasible solutions in a short amount of time.