ppxscal/embedding_network huggingface dataset:
Pedestrian Behavior at Bottlenecks
Authors: Serge P. Hoogendoorn, W. Daamen
Venue: Transportation Science (2005)

Traffic operations in public walking spaces are to a large extent determined by differences in pedestrian traffic demand and infrastructure supply. Congestion occurs when pedestrian traffic demand exceeds the capacity. In turn, the latter is determined by a number of factors, such as the width of the bottleneck and the wall surface, as well as the interaction behavior of the pedestrians passing the bottleneck.This article discusses experimental findings of microscopic pedestrian behavior in case of bottlenecks. Results for both a narrow bottleneck and a wide bottleneck are discussed and compared to the results of an experiment without a bottleneck. It is shown how pedestrians inside bottlenecks effectively form layers or trails, the distance between which is approximately 45 cm. This is less than the effective width of a single pedestrian, which is around 55 cm. The layers are thus overlapping, a phenomenon which is referred to as the "zipper" effect. The pedestrians within these layers follow each other at 1.3 seconds, irrespective of the considered experiment. For the narrow bottleneck case (width of one meter) two layers are formed; for the wide bottleneck case (width of two meters), four or five layers are formed, although the life span of these layers is rather small.The zipper effect causes the capacity of the bottleneck to increase in a stepwise fashion with the width of the bottleneck, at least for bottlenecks of moderate width (less than 3 m). This has substantial implications for the design of walking facilities.
Efficient geographic routing in multihop wireless networks
Authors: Seungjoon Lee, Bobby Bhattacharjee, Suman Banerjee
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

We propose a new link metric called normalized advance (NADV) for geographic routing in multihop wireless networks. NADV selects neighbors with the optimal trade-off between proximity and link cost. Coupled with the local next hop decision in geographic routing, NADV enables an adaptive and efficient cost-aware routing strategy. Depending on the objective or message priority, applications can use the NADV framework to minimize various types of link cost.We present efficient methods for link cost estimation and perform detailed simulations in diverse scenarios. Our results show that NADV outperforms current schemes in many aspects: for example, in high noise environments with frequent packet losses, the use of NADV leads to 81% higher delivery ratio. When compared to centralized routing under certain settings, geographic routing using NADV finds paths whose cost is close to the optimum.
Attributing mental attitudes to roles: the agent metaphor applied to e-trade organizations
Authors: Guido Boella, Leendert van der Torre
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

In this paper we address the problem of defining roles in organizations like e-trade ones. The methodology we use is to model roles according to the agent metaphor: we attribute to roles mental attitudes, like beliefs, desires and goals, we relate them to the agent's required expertise and responsibilities, and we model role behavior in game theoretic terms. Analogously, the organization is modelled as an agent which acts as a normative system: it imposes obligations to roles and to the agents playing the roles.
Constructive dimension equals Kolmogorov complexity
Authors: Ludwig Staiger
Venue: Information Processing Letters (2005)

We derive the coincidence of Lutz's constructive dimension and Kolmogorov complexity for sets of infinite strings from Levin's early result on the existence of an optimal left computable cylindrical semi-measure M via simple calculations.
Balanced metric labeling
Authors: Joseph (Seffi) Naor, Roy Schwartz
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

We define the balanced metric labeling problem, a generalization of the metric labeling problem, in which each label has a capacity, i.e., at most l vertices can be assigned to it. The balanced metric labeling problem is a generalization of fundamental problems in the area of approximation algorithms, e.g., arrangements and balanced partitions of graphs. It is also motivated by resource limitations in certain practical scenarios. We focus on the case where the given metric is uniform and note that this case alone encompasses various well-known graph partitioning problems. We present the first (pseudo) approximation algorithm for this problem, achieving for any ε, 0 < ε < 1, an approximation factor of O((ln n)/ε), while assigning at most min {O(ln k)/1 - ε, l + 1| ( 1 + ε) l vertices to each label (k is the number of labels). Our approximation algorithm is based on a novel randomized rounding of a linear programming formulation that combines an embedding of the graph in a simplex together with spreading metrics and additional constraints that strengthen the formulation. Our randomized rounding technique uses both a randomized metric decomposition technique and a randomized label assignment technique. At the heart of our approach is the fact that only limited dependency is created between the labels assigned to different vertices, allowing us to bound the expected cost of the solution and the number of vertices assigned to each label, simultaneously. We note that the number of vertices assigned to each label is bounded via a new inequality of Janson[15] for tail bounds of (partly) dependent random variables.
Background Subtraction using Self-Identifying Patterns
Authors: Mark Fiala, Chang Shu
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

Separation of object foreground from background is used in 3D model creation and matting in video production.Robust background subtraction techniques that function in uncontrolled lighting environments would be useful for many applications.We introduce a method using bi-tonal self-identifying patterns as a background that can be used to recognize the foreground object despite the background intensity and colour being non-uniform across the image. Detection pattern points are used to sample the black and white colour levels in several image points.A surface is fitted to both the black and white colour levels allowing an estimated background image to be created.The background image is then subtracted from the original image to isolate the foreground objects. The method of using self-identifying patterns also provides the camera-pattern pose for use in 3D model creation.A visual hull 3D model can be created by identifying the outline of an object from several known camera poses.Examples of this method applied to both matting and 3D model creation are given.Experimental results are shown.
An Intelligent Semantic Agent for e-Learning Message Communication
Authors: Ying-Hong Wang, Wen-Nan Wang, Yi-Hsiang Yen
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This paper presents an English chat room system in which students discuss course contents and ask questions to and receive from teachers and other students. A novel mechanism is also proposed that does not require that supervisors constantly remain online to handle queries. The mechanism contains an agent that detects syntax errors in sentences written by the online users and also checks the semantics of each sentence. Learners may make a semantic level mistake imply that they do not understanding the course topic or particular issue. The agent can thus offer recommendations to the user and analyze the data of the learner corpus. When users query the system or others, this system will attempt to find the answers from the knowledge ontology or learner corpus that is stored in the records of previous user comments. If sufficient numbers of QA pairs can be obtained, the FAQ can be provided for the learners.
Distributed Proving in Access-Control Systems
Authors: Lujo Bauer, Scott Garriss, Michael K. Reiter
Venue: Proceedings of the 2005 IEEE Symposium on Security and Privacy (2005)

We present a distributed algorithm for assembling a proof that a request satisfies an access-control policy expressed in a formal logic, in the tradition of Lampson et al. We show analytically that our distributed proof-generation algorithm succeeds in assembling a proof whenever a centralized prover utilizing remote certificate retrieval would do so. In addition, we show empirically that our algorithm outperforms centralized approaches in various measures of performance and usability, notably the number of remote requests and the number of user interruptions. We show that when combined with additional optimizations including caching and automatic tactic generation, which we introduce here, our algorithm retains its advantage, while achieving practical performance. Finally, we briefly describe the utilization of these algorithms as the basis for an access-control framework being deployed for use at our institution.
A tour through the AVIS UIMS
Authors: Michel Beaudouin-Lafon
Venue: ACM SIGCHI Bulletin (1991)

Avis is a UIMS under active development as a subproject of the European Eureka Software Factory project. Avis aims at developing direct manipulation interfaces for the components of the factory. The development of Avis is carried out by several research and development teams in France and England.
Robust Power Plant Control Using Clonal Selection of Immune Algorithm Based Multiobjective
Authors: Dong Hwa Kim, Jae Hoon Jo, Hwan Lee
Venue: Proceedings of the Fourth International Conference on Hybrid Intelligent Systems (2004)

Strictly maintaining the steam temperature can be difficult due to heating value variation to the fuel source, time delay changes in the main steam temperature, the change of the dynamic characteristics in the reheater. Up to the present time, PID Controller has been used to operate this system. However, it is very difficult to achieve an optimal PID gain with no experience, since the gain of the PID controller has to be manually tuned by trial and error. This paper focuses on tuning of the Controller with disturbance rejection using immune based multiobjective approach. In this paper, an ITSE(Integral of time weighted squared error) is used to decide performance of tuning results.
The GapiDraw platform: high-performance cross-platform graphics on mobile devices
Authors: Johan Sanneblad, Lars Erik Holmquist
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

The GapiDraw platform supports the creation of high-performance graphical applications across a variety of handheld hardware configurations, including Palm, Symbian and Windows Mobile devices. Handheld computers makes it possible to create applications and services not possible with stationary computers, thus there is a need for a high performance development platform for rapid prototyping on mobile devices. Unlike desktop computers there has not yet evolved a single standard for graphics on handheld devices. Typically, handheld computers only provide direct frame buffer access, and there are major differences in implementation details across different hardware configurations, making it difficult to use mobile devices for prototyping. Using GapiDraw, developers can re-use the same code across a variety of devices and do not have to focus on device-specific implementation details. GapiDraw is actively used as an enabler platform in numerous research labs, and has also been used in over one hundred commercial games. We give an overview of the platform, and highlight some new mobile application concepts made possible through the use of GapiDraw.
Codes over F4 , Jacobi forms and Hilbert-Siegel modular forms over Q(√5)
Authors: Koichi Betsumiya, YoungJu Choie
Venue: European Journal of Combinatorics (2005)

We study codes over a finite field F4. We relate self-dual codes over F4 to real 5-modular lattices and to self-dual codes over F2 via a Gray map. We construct Jacobi forms over Q(√5) from the complete weight enumerators of self-dual codes over F4. Furthermore, we relate Hilbert-Siegel forms to the joint weight enumerators of self-dual codes over F4.
Random matrices in data analysis
Authors: Dimitris Achlioptas
Venue: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases (2004)

We show how carefully crafted random matrices can achieve distance-preserving dimensionality reduction, accelerate spectral computations, and reduce the sample complexity of certain kernel methods.
Object Class Recognition Using Multiple Layer Boosting with Heterogeneous Features
Authors: Wei Zhang, Bing Yu, Gregory J. Zelinsky, Dimitris Samaras
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

We combine local texture features (PCA-SIFT), global features (shape context), and spatial features within a single multi-layer AdaBoost model of object class recognition. The first layer selects PCA-SIFT and shape context features and combines the two feature types to form a strong classifier. Although previous approaches have used either feature type to train an AdaBoost model, our approach is the first to combine these complementary sources of information into a single feature pool and to use Adaboost to select those features most important for class recognition. The second layer adds to these local and global descriptions information about the spatial relationships between features. Through comparisons to the training sample, we first find the most prominent local features in Layer 1, then capture the spatial relationships between these features in Layer 2. Rather than discarding this spatial information, we therefore use it to improve the strength of our classifier. We compared our method to [4, 12, 13] and in all cases our approach outperformed these previous methods using a popular benchmark for object class recognition [4]. ROC equal error rates approached 99%. We also tested our method using a dataset of images that better equates the complexity between object and non-object images, and again found that our approach outperforms previous methods.
Finite Temperature Dynamics of the Total State in an Open System Model
Authors: Walter T. Strunz
Venue: Open Systems Information Dynamics (2005)

We determine the dynamics of the total state of a system and environment for an open system model, at finite temperature. Based on a partial Husimi representation, our framework describes the full dynamics very efficiently through equations in the Hilbert space of the open system only. We briefly review the zero-temperature case and present the corresponding new finite temperature theory, within the usual Born-Markov approximation. As we will show, from a reduced point of view, our approach amounts to the derivation of a stochastic Schrödinger equation description of the dynamics. We show how the reduced density operator evolves according to the expected (finite temperature) master equation of Lindblad form.
A randomized algorithm for gossiping in radio networks
Venue: Networks (2004)

We present an O&lpar;n log4n&rpar;-time randomized algorithm for gossiping in radio networks with unknown topology. This is the first algorithm for gossiping in this model whose running time is only a polylogarithmic factor away from the optimum. The fastest previously known &lpar;deterministic&rpar; algorithm for this problem works in time O&lpar;n3&sol;2log2n&rpar;. &copy; 2004 Wiley Periodicals, Inc.
Production Test Methods for Measuring 'Out-of-Band' Interference of Ultra Wide Band (UWB) Devices
Authors: Soumendu Bhattacharya, Abhijit Chatterjee
Venue: Proceedings of the 23rd IEEE VLSI Test Symposium (2005)

The recent increase in demand within the wireless user community for short-range, very high rate data transmission (data, video) devices has spurred the growth of a new generation of 4G devices, viz. ultra-wideband (UWB). Due to its wide band of operation (3.1-10.6GHz) and non-conventional transmit/receive scheme (using short-duration, narrow baseband pulses), spectral power leakage to outside frequency bands causes interference with other wireless standards. In this paper, we focus on 'out-of-band' interference testing of UWB devices during production test. Due to stringent FCC spectrum regulations and very low power spectral density levels of the associated signals (-41.3dBm/MHz), production testing for interference is a big challenge and can incur significant test time, resulting in increased test cost. We propose a simple, low-cost test methodology for testing UWB devices. Simulation results are presented for a typical home environment. The channel model used can be easily modified and incorporated in any production test environment. Results show that using simple tests, estimates of 'out-of-band' interference can be obtained easily using the proposed test methodology.
What Should We Do Before Running a Social Simulation?
Authors: Hsu-Chih Wu Chuen-Tsai Sun
Venue: Social Science Computer Review (2005)

Before running a model simulation, it is important to accumulate as much information about the model as possible. Although an analysis of relations among model components is considered a promising means of accomplishing this task, the social simulation literature offers very little guidance in performing such analyses. We use an analytical framework to demonstrate how model analysis can facilitate the simulation process, with the Iterated Prisoner's Dilemma serving as a primary example. Our results show that the analysis was helpful in identifying important strategies and simulation phenomena, thus reducing the amount of work required for the simulation. We suggest that this framework is applicable to other types of two-person matrix games, and that the methods we use are also suitable for other macro-or agent-based simulation models.
A phylogenomic study of the genus Alphavirus employing whole genome comparison: Research Articles
Authors: Aimée J. Luers, Sandra D. Adams, John V. Smalley, James J. Campanella
Venue: Comparative and Functional Genomics (2005)

The phylogenetics of the genus Alphavirus have historically been characterized using partial gene, single gene or partial proteomic data. We have mined cDNA and amino acid sequences from GenBank for all fully sequenced and some partially sequenced alphaviruses and generated phylogenomic analyses of the genus Alphavirus genus, employing capsid encoding structural regions, non-structural coding regions and complete viral genomes. Our studies support the presence of the previously reported recombination event that produced the Western Equine Encephalitis clade, and confirm many of the patterns of geographic radiation and divergence of the multiple species. Our data suggest that the Salmon Pancreatic Disease Virus and Sleeping Disease Virus are sufficiently divergent to form a separate clade from the other alphaviruses. Also, unlike previously reported studies employing limited sequence data for correlation of phylogeny, our results indicate that the Barmah Forest Virus and Middelburg Virus appear to be members of the Semliki Forest clade. Additionally, our analysis indicates that the Southern Elephant Seal Virus is part of the Semliki Forest clade, although still phylogenetically distant from all known members of the genus Alphavirus. Finally, we demonstrate that the whole Rubella viral genome provides an ideal outgroup for phylogenomic studies of the genus Alphavirus. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Urban probes: encountering our emerging urban atmospheres
Authors: Eric Paulos, Tom Jenkins
Venue: Proceedings of the SIGCHI conference on Human factors in computing systems (2005)

Urban Atmospheres captures a unique, synergistic moment - expanding urban populations, rapid adoption of Bluetooth mobile devices, tiny ad hoc sensor networks, and the widespread influence of wireless technologies across our growing urban landscapes. The United Nations recently reported that 48 percent of the world's population current live in urban areas and that this number is expected to exceed the 50 percent mark world wide by 2007 [1]. In developed nations the number of urban dwellers is even more dramatic - expected to exceed 75%. Current studies project Bluetooth-enabled devices to reach 5.4 billion units by 2005 - five times the number of mobile phones or Internet connections [2]. Mobile phone penetration already exceeds 80% of the population in places like the European Union (EU) and parts of Asia [3]. WiFi hardware is being deployed at the astonishing rate of one every 4 seconds globally [4]. We argue that now is the time to initiate inspirational research into the very essence of these newly emerging technological urban spaces. We desire to move towards an improved understanding of the emotional experience of urban life. This paper describes Urban Probes - a lightweight, provocative, intervention methodology designed to rapidly deconstruct urban situations, reveal new opportunities for technology in urban spaces, and guide future long term research in urban computing. We also describe a completed Urban Probe exploring urban trash.
Intrusion detection using an ensemble of intelligent paradigms
Authors: Srinivas Mukkamala, Andrew H. Sung, Ajith Abraham
Venue: Journal of Network and Computer Applications (2005)

Soft computing techniques are increasingly being used for problem solving. This paper addresses using an ensemble approach of different soft computing and hard computing techniques for intrusion detection. Due to increasing incidents of cyber attacks, building effective intrusion detection systems are essential for protecting information systems security, and yet it remains an elusive goal and a great challenge. We studied the performance of Artificial Neural Networks (ANNs), Support Vector Machines (SVMs) and Multivariate Adaptive Regression Splines (MARS). We show that an ensemble of ANNs, SVMs and MARS is superior to individual approaches for intrusion detection in terms of classification accuracy.
Extracting fuzzy if-then rules by using the information matrix technique
Authors: Chongfu Huang, Claudio Moraga
Venue: Journal of Computer and System Sciences (2005)

In this paper, we use the information matrix technique to extract fuzzy if-then rules from data including noise. With a normal diffusion function, we change all crisp observations of a given sample into fuzzy sets to make an information matrix. We extract rules according to the centroids of the rows of an information matrix. These rules are integrated into an additive fuzzy system with the same rule weight. Such fuzzy systems can be used as adaptive function approximators. Simulations show that this method is very effective compared with the conventional least-squares method and neural network. The best advantage of the suggested method is that, it may be the simplest way to extract fuzzy if-then rules from data.
Link prefetching in Mozilla: a server-driven approach
Authors: Darin Fisher, Gagan Saksena
Venue: Web content caching and distribution: proceedings of the 8th international workshop (2004)

This paper provides a synopsis of a server-driven link prefetching mechanism that we have designed and implemented for the Mozilla web browser, a popular Open Source web browser. The mechanism depends on the origin server or an intermediate proxy server determining the best set of documents for the browser to prefetch. The browser follows prefetch directives provided by the server, either embedded in an HTML document using the 〈LINK〉 tag or specified via Link HTTP response headers. The browser determines when best to prefetch the specified URLs based on its own heuristics. In this paper, we describe the mechanism and discuss some of the practical issues that impacted its design and implementation.
Building your own live CD
Authors: Daniel Barlow
Venue: Linux Journal (2005)

Live CDs let you turn any computer into a temporary Linux box. Make it a Linux box with your chosen software and configuration.