ppxscal/embedding_network huggingface dataset:
Collecting Statistics Over Runtime Executions
Authors: Bernd Finkbeiner, Sriram Sankaranarayanan, Henny B. Sipma
Venue: Formal Methods in System Design (2005)

We present an extension to linear-time temporal logic (LTL) that combines the temporal specification with the collection of statistical data. By collecting statistics over runtime executions of a program we can answer complex queries, such as "what is the average number of packet transmissions'' in a communication protocol, or "how often does a particular process enter the critical section while another process remains waiting'' in a mutual exclusion algorithm. To decouple the evaluation strategy of the queries from the definition of the temporal operators, we introduce algebraic alternating automata as an automata-based intermediate representation. Algebraic alternating automata are an extension of alternating automata that produce a value instead of acceptance or rejection for each trace. Based on the translation of the formulas from the query language to algebraic alternating automata, we obtain a simple and efficient query evaluation algorithm. The approach is illustrated with examples and experimental results.
Modeling of aircraft movements at airports
Authors: Stephen L. M. Hockaday, Donald Maddison
Venue: ACM SIGSIM Simulation Digest (1974)

The airport is a key element in the total air transportation system, and is a facility for the movement and temporary storage of passengers, vehicles, baggage, cargo, and aircraft. Its basic function is to permit the transfer of people and goods between air and ground transport vehicles and from one aircraft to another. The airport airside consists of the runways, taxiways, and gates within the airport confines, plus approach and departure airspace. Exhibit 1 illustrates the relationship between the airport airside and other elements of the air transportation system. Exhibit 2 lists the more significant factors influencing the operation of aircraft on the airport airside.
Formal Control Techniques for Power-Performance Management
Authors: Qiang Wu, Philo Juang, Margaret Martonosi, Li-Shiuan Peh, Douglas W. Clark
Venue: IEEE Micro (2005)

These techniques determine when to speed up a processor to reach performance targets and when to slow it down to save energy. They use dynamic voltage and frequency scaling to balance speed and avoid worst case frequency limitations for both multiple-clock-domain and chip multiprocessors.
A Study of the Energy Consumption Characteristics of Cryptographic Algorithms and Security Protocols
Authors: Nachiketh R. Potlapally, Srivaths Ravi, Anand Raghunathan, Niraj K. Jha
Venue: IEEE Transactions on Mobile Computing (2006)

Security is becoming an everyday concern for a wide range of electronic systems that manipulate, communicate, and store sensitive data. An important and emerging category of such electronic systems are battery-powered mobile appliances, such as personal digital assistants (PDAs) and cell phones, which are severely constrained in the resources they possess, namely, processor, battery, and memory. This work focuses on one important constraint of such devices—battery life—and examines how it is impacted by the use of various security mechanisms. In this paper, we first present a comprehensive analysis of the energy requirements of a wide range of cryptographic algorithms that form the building blocks of security mechanisms such as security protocols. We then study the energy consumption requirements of the most popular transport-layer security protocol: Secure Sockets Layer (SSL). We investigate the impact of various parameters at the protocol level (such as cipher suites, authentication mechanisms, and transaction sizes, etc.) and the cryptographic algorithm level (cipher modes, strength) on the overall energy consumption for secure data transactions. To our knowledge, this is the first comprehensive analysis of the energy requirements of SSL. For our studies, we have developed a measurement-based experimental testbed that consists of an iPAQ PDA connected to a wireless local area network (LAN) and running Linux, a PC-based data acquisition system for real-time current measurement, the OpenSSL implementation of the SSL protocol, and parameterizable SSL client and server test programs. Based on our results, we also discuss various opportunities for realizing energy-efficient implementations of security protocols. We believe such investigations to be an important first step toward addressing the challenges of energy-efficient security for battery-constrained systems.
Simulating tree growth based on internal and environmental factors
Authors: Zhuming Lam, Scott A. King
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

This paper describes a method using L-systems that models tree growth based on the interaction of the tree's internal attributes with themselves and with environmental conditions. Modeled components include chemical flow and water distribution within the tree, phototropism, space tropism, energy generation and usage, weight support, and self-pruning.Our system is described and many results are presented which show how the individual factors affect tree growth, and also how they interact with each other.
A Qualitative Evaluation of a Software Development and Re-Engineering Project
Authors: Thomas Panas, Rudiger Lincke, Jonas Lundberg, Welf Lowe
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

The VizzAnalyzer is a framework for analyses and visualizations of software. It has been developed over years, to a great deal by students and PhD students. In between it has been re-engineered to improve the software quality. In this paper, we publish the results of the software quality measurements over different versions of the VizzAnalyzer framework with well established quality metrics. Some metrics uncover qualities we were aiming at in our re-engineering, e.g. maintainability, some others uncover qualities we were deliberately ignoring or did not even think about, e.g. good "object-orientedness". Our measurements validate our expectation: the former metrics signi?cantly improve over the versions whereas the latter contain positive as well as negative surprises.
Algorithms for delay constrained group multicast routing: Research Articles
Authors: Kun-Cheng Tsai, Chyouhwa Chen
Venue: International Journal of Communication Systems (2005)

Multicast routing allows network sources to use network resources efficiently by sending only a single copy of data to all group members. In the delay constrained group multicast routing problem (DCGMRP), every group member is also a source, and has an individual minimal delay and bandwidth requirement. The routing algorithm must, for each member of the group, construct a source-based routing tree spanning all the other member nodes without exceeding the capacities of the traversed links, while satisfying the stated delay constraints. Previous work adopted the direct, intuitive approach by first creating a source-based multicast tree independently for each member node, and then iteratively locating network links whose capacity constraint are violated and eliminating the violation by rerouting the trees. In this paper, we investigate a number of efficient and effective algorithms, DCGM&lowbar;IA+, DCGM&lowbar;GR and DCGM&lowbar;CP, for solving DCGMRP and compare their performance with previous proposals. Through extensive experiments, our proposals are shown to outperform previous algorithms in constructing group multicast trees with low costs and high success ratios. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Speciation in the computing sciences: digital forensics as an emerging academic discipline
Authors: Peter Cooper
Venue: Proceedings of the 2nd annual conference on Information security curriculum development (2005)

In evolutionary terms, speciation occurs when members of a species, pressured by the environment, diverge to the point where they are recognizable as separate species. This paper explores the concept as applied to Digital Forensics as a distinct academic discipline from other computing sciences. What are the pressures that have resulted in the emergence of Digital Forensics, how might the domain be defined and, what interdisciplinary connections does Digital Forensics have?This paper examines the domain content of Digital Forensics and its potential in the development of viable undergraduate and graduate degree programs to satisfy professional and scholarly demand.
Communication Protection in IP-based Video Surveillance Systems
Authors: Zhaoyu Liu, Dichao Peng, Yuliang Zheng, Jeffrey Liu
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

For decades video surveillance systems have been crucial in protecting critical infrastructures. Currently the systems are adopting the emerging internetworking digital technology, changing from the traditional isolated analog technology. While there are several advantages of IP-based video surveillance systems, the systems are also exposed to additional new security threats. Security is a critical factor to make the IP-based video surveillance systems practical and usable. In this paper we address the security threats to the data communications in IP-based video surveillance systems. We first analyze the current approaches, mainly naive and selective methods, to secure real-time video data, and identify their limitations to IP-based video surveillance systems. Then we propose a system design of secure internetworking video surveillance systems. Our proposed approach adopts a randomly adjustable encryption method to provide confidentiality to the data. Our implementation and performance study demonstrate that our approach achieves a good balance of cost-efficiency and security.
Data grid for large-scale medical image archive and analysis
Authors: H. K. Huang, Aifeng Zhang, Brent Liu, Zheng Zhou, Jorge Documet, Nelson King, L. W. C. Chan
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

Storage and retrieval technology for large-scale medical image systems has matured significantly during the past ten years but many implementations still lack cost-effective backup and recovery solutions. As an example, a PACS (Picture Archiving and Communication system) in a general medical center requires about 40 Terabytes of storage capacity for seven years. Despite many healthcare centers are relying on PACS for 24/7 clinical operation, current PACS lacks affordable fault-tolerance storage strategies for archive, backup, and disaster recovery. Existing solutions are difficult to administer, and often time consuming for effective recovery after a disaster. For this reason, PACS still encounters unexpected downtime for hours or days, which could cripple daily clinical service and research operations. Grid Computing represents the latest and most exciting technology to evolve from the familiar realm of parallel, peer-to-peer, and client-server models that can address the problem of fault-tolerant storage for backup and recovery of medical images. We have researched and developed a novel Data Grid testbed involving several federated PAC systems based on grid computing architecture. By integrating grid architecture to the PACS DICOM (Digital Imaging and Communication in Medicine) environment, in addition to use its own storage device, a PACS also uses a federated Data Grid composing of several PAC systems for off-site backup archive. In case its own storage fails, the PACS can retrieve its image data from the Data Grid timely and seamlessly. The design reflects the Globus Toolkit 3.0 five-layer architecture of the grid computing: Fabric, Resource, Connectivity, Collective, and Application Layers. The testbed consists of three federated PAC systems, the Fault-Tolerant PACS archive server at the Image Processing and Informatics Laboratory, the clinical PACS at Saint John's Health Center, and the clinical PACS at the Healthcare Consultation Center II, USC Health Science Campus.In the testbed, we also implement computational services in the Data Grid for image analysis and data mining. The federated PAC systems can use this resource by sharing image data and computational services available in the Data Grid for image analysis and data mining application.In the paper, we first review PACS and its clinical operation, followed by the description of the Data Grid architecture in the testbed. Different scenarios of using the DICOM store and query/retrieve functions of the laboratory model to demonstrate the fault-tolerance features of the Data Grid are illustrated. The status of current clinical implementation of the Data Grid is reported. An example of using the digital hand atlas for bone age assessment of children is presented to describe the concept of computational services in the Data Grid.
Adoption of the IPsec-VPN for the Ubiquitous Network
Authors: Shingo Fujimoto, Masahiko Takenaka
Venue: Proceedings of the International Symposium on Applications on Internet (2006)

In the ubiquitous network, it is important to provide not only the continuous connectivity but also the strong security. The IPsec-VPN technology archives some kind of the ubiquitous network with providing one virtual IP address and the encrypted communication channel. However, if the user's terminal moves between networks, its IP address will be changed by roaming process, and the IPsec-VPN connection must be disconnected until IPsec-SA is shared with new IP address. In this paper, we propose the new method to solve this problem.
Accurate Long-tailed Network Traffic Approximation and Its Queueing Analysis by Hyper-Erlang Distributions
Authors: Junfeng Wang, Hongxia Zhou, Lei Li, Fanjiang Xu
Venue: Proceedings of the The IEEE Conference on Local Computer Networks 30th Anniversary (2005)

Internet traffic has been proven to be long-tailedness and often modeled by Lognormal distribution, Weibull or Pareto distributions theoretically. However, these mathematical models hinder us in traf- fic analysis and evaluation studies due to their complex representations and theoretical properties. This paper proposes a Hyper-Erlang Model (Mixed Erlang distribution) for such long-tailed network traffic approximation. It fits network traffic with long-tailed characteristic into a mixed Erlang distribution directly to facilitate our further analysis. Compared with the wellknown hyperexponential based method, the mixed Erlang model is more accurate in fitting the tail behavior and also computationally efficient. Further investigations on the M/G/1 queueing behavior also prove the efficiency of the Mixed Erlang based approximation.
Vehicle License Plate Location Based on Histogramming and Mathematical Morphology
Authors: Feng Yang, Zheng Ma
Venue: Proceedings of the Fourth IEEE Workshop on Automatic Identification Advanced Technologies (2005)

In a vehicle license plate identification system, plate region detection is the key step before the final recognition. This paper presents a license plate detection algorithm from complex background based on histogramming and mathematical morphology. The proposed algorithm consists of two main modules: license plate region's rough detection and license plate exactly location. The former characterized by vertical gradients detection extracts candidate regions from an input image, while the latter conceptualized in terms of mathematical morphology aims to locate the license plate fast and accurately. Experiments have been conducted for this algorithm, and 360 images taken from various scenes were employed, including diverse angles, different lightening conditions and the dynamic conditions. The algorithm can quickly and correctly detect the region of license plate and the license plate detecting rate of success is 97.78%.
A comparison of clock pulse and event algorithms for simulation of traffic flow
Authors: Chung-Man Ho, James E. Gentle
Venue: ACM SIGSIM Simulation Digest (1976)

The clock pulse and event algorithms are compared for efficiency at various activity levels of a simulation of traffic flow. For low levels of system activity the event algorithm is more efficient (in terms of ratio of real time to similar time). As system activity is raised the increase in the relative efficiency of the clock pulse algorithm is studied empirically.
Recovering Articulated Pose: A Comparison of Two Pre and Postimposed Constraint Methods
Authors: Teofilo E. de Campos Ben J. Tordoff David W. Murray
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2006)

We contrast the performance of two methods of imposing constraints during the tracking of articulated objects, the first method preimposing the kinematic constraints during tracking and, thus, using the minimum degrees of freedom, and the second imposing constraints after tracking and, hence, using the maximum. Despite their very different formulations, the methods recover the same pose change. Further comparisons are drawn in terms of computational speed and algorithmic simplicity and robustness, and it is the last area which is the most telling. The results suggest that using built-in constraints is well-suited to tracking individual articulated objects, whereas applying constraints afterward is most suited to problems involving contact and breakage between articulated (or rigid) objects, where the ability to test tracking performance quickly with constraints turned on or off is desirable.
Performance Evaluation and Improvement of Algorithmic Approaches for Packet Classification
Authors: Yaxuan Qi, Bo Xu, Jun Li
Venue: Proceedings of the Joint International Conference on Autonomic and Autonomous Systems and International Conference on Networking and Services (2005)

Packet classification is crucial to the implementation of several advanced services that require the capability to distinguish traffic in different flows, such as firewalls, intrusion detection systems, and many QoS implementations. Although hardware solutions, such as TCAMs, provide high search speed, they do not scale to large rulesets. Instead, some of the most promising algorithmic research embraces the practice of leveraging the data redundancy in real-life rulesets to improve high performance packet classification. In this paper, we provide a general framework for discerning relationships and distinctions of the design-space of existing packet classification algorithms. Several best-known algorithms, such as RFC and HiCuts/HyperCuts, are carefully analyzed based on this framework, and an improved scheme for each algorithm is proposed. All algorithms studied in this paper, along with their variations, are objectively assessed using both real-life and synthetic rulesets. The source codes of these algorithms are made publicly available on web-site.
Reconfigurable Platform for Content Science Research
Authors: Chi-Sheng Shih, Chia-Lin Yang, Mong-Kai Ku, Tei-Wei Kuo, Shao-Yi Chien, Yao-Wen Chang, Liang-Gee Chen
Venue: Proceedings of the 11th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications (2005)

The College of Electrical Engineering and Computer Science at the National Taiwan University has identied the area of content science for media-rich life, broadly construed, as one of core areas for the college¿s future directions. One major aspect of this project is to develop the enabling technology for reconfigurable platforms for multimedia applications. Specifically, the goal is to develop reconfigurableplatforms of system-on-a-chip (SoC) components for the applications to support the needs of multi-modal multimedia contents and to provide rapid system prototyping. The faculties in the College of Electrical Engineering and Computer Science have formed a multi-discipline team to develop such technology. Our team includes seven faculties and more than thirty students from the college. This short report describes the reconfigurable platform for content science research activities currently underway by our team. Our current activities include to develop the technology to analyze the critical path for avoiding hardware contention, to minimize the use of logic components, to design the multimedia IPs, to optimally route the bus and place the logic units, to design energy efficient cache, to evaluate the performance and power consumption, to design the algorithm for temporal floor-planning/placement.
Solving The Multi-Constrained Path Selection Problem By Using Depth First Search
Authors: Zhenjiang Li, J. J. Garcia-Luna-Aceves
Venue: Proceedings of the Second International Conference on Quality of Service in Heterogeneous Wired/Wireless Networks (2005)

An extended depth-first-search (EDFS) algorithm is proposed to solve the multi-constrained path (MCP) problem in quality-of-service (QoS) routing, which is NP-Complete when the number of independent routing constraints is more than one. EDFS solves the general k- constrained MCP problem with pseudo-polynomial time complexity O(m^2 · EN + N^2),where E andN are the number of links and nodes of a graph respectively, and m is the maximum number of feasible paths maintained for each destination. This is achieved by deducing potential feasible paths from knowledge of previous explorations, without re-exploring finished nodes and their descendants in the process of the DFS search. One unique property of EDFS is that the tighter the constraints are, the better the performance it can achieve, w.r.t. both time complexity and routing success ratio. Analysis and extensive simulation are conducted to study the performance of EDFS in finding feasible paths that satisfy multiple QoS constraints. The main results show that EDFS is insensitive to the number of constraints, and outperforms other popular MCP algorithms when the routing constraints are tight or moderate. The performance of EDFS is comparable with that of the other algorithms when the constraints are loose.
On the Performance Evaluation of a Dynamic Bandwidth Reservation Mechanism for Integrated H.263 Video, IP and MP3 Traffic over Wireless Networks
Authors: H. Papadakis, P. Koutsakis, M. Vafiadis
Venue: Proceedings of the Seventh IEEE International Symposium on Multimedia (2005)

In this paper we explore, via an extensive simulation study, the performance of a new medium access control (MAC) protocol when integrating video and data packet traffic over a wireless picocellular system of very high capacity, with errors. Mobile terminals are considered to be high performance devices with extended storage capabilities which can act like cache memories streaming multimedia material. Our scheme achieves high aggregate channel throughput in all cases of traffic load, despite the very bursty nature of the examined traffic and the introduction of errors in the system.
Real-time high-quality View-Dependent Texture Mapping using per-pixel visibility
Authors: Damien Porquet, Jean-Michel Dischler, Djamchid Ghazanfarpour
Venue: Proceedings of the 3rd international conference on Computer graphics and interactive techniques in Australasia and South East Asia (2005)

We present an extension of View-Dependent Texture Mapping (VDTM) allowing rendering of complex geometric meshes at high frame rates without usual blurring or skinning artifacts. We combine a hybrid geometric and image-based representation of a given 3D object to speed-up rendering at the cost of a little loss of visual accuracy.During a precomputation step, we store an image-based version of the original mesh by simply and quickly computing textures from viewpoints positionned around it by the user. During the rendering step, we use these textures in order to map on the fly colors and geometric details onto the surface of a low-polygon-count version of the mesh.Real-time rendering is achieved while combining up to three viewpoints at a time, using pixel shaders. No parameterization of the mesh is needed and occlusion effects are taken into account while computing on the fly the best viewpoints for a given pixel. Moreover, the integration of this method in common real-time rendering systems is straightforward and allows applying self-shadowing as well as other z-buffer effects.