ppxscal/embedding_network huggingface dataset:
Security in Wireless Actor & Sensor Networks (WASN): Towards A Hierarchical Re-Keying Design
Authors: Fei Hu, Xiaojun Cao
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Our work aims to address the challenging security issues in an important information infrastructure - large-scale and low-energy Wireless Actuator and Sensor Networks (WASN). Since WASNs have specific network constraints and data transmission requirements compared to general ad hoc networks and other wireless/wired networks, the security issues need to be tackled accordingly. We propose to seamlessly integrate WASN security with a promising routing architecture that is scalable and energy-efficient. To protect from active attacks in mobile sensor networks, we propose two-level re-keying/re-routing schemes that can not only adapt to a dynamic network topology but also securely update keys for each data transmission session. Moreover, to provide the security for the innetworking processing such as data aggregation in WASNs, we define a multiple-key management scheme in conjunction with the proposed Tree-Ripple-Zone (TRZ) routing architecture.
Privacy policies of the largest privately held companies: a review and analysis of the forbes private 50
Authors: Alan R. Peslak
Venue: Proceedings of the 2005 ACM SIGMIS CPR conference on Computer personnel research (2005)

This study reviews the Internet privacy policies of the 50 largest privately held companies in the US as identified by Forbes magazine. The study builds on work of prior researchers who analyzed popular and random e-commerce websites. In this study, the websites of privately held firms were reviewed and analyzed for the inclusion of the Federal Trade Commission's Fair Information Practices as well as a series of other consumer-centered factors. A comparison was also made between the policies of largest US publicly traded companies and the privately held companies. Overall the study finds that privately held companies do not demonstrate consistency in following Fair Information Practices or consumer-centered Internet policies. Also, the 50 largest privately held companies are generally less likely to publicly reveal their policies relative to Fair Information Practices or consumer-centered policies than the 50 largest publicly held companies. This is due to a large extent to lack of any privacy policies for many privately held companies. If only those companies with privacy policies are analyzed, two factors show significant differences between public and private company privacy policies.
GE NLTooLSET: MUC-3 test results and analysis
Authors: George Krupka, Lucja Iwańska, Paul Jacobs, Lisa Rau
Venue: Proceedings of the 3rd conference on Message understanding (1991)

This paper reports on the GE NLTooLSET customization effort for MUC-3, and analyzes the results of the TST2 run. Although our own tests had shown steady improvement between TST1 and TST2, our official scores on TST2 were lower than on TST1. The analysis of this unexpected result explains some of the details of the MUC-3 test, and we propose ways of looking at the scores to distinguish different aspects of system performance.
A General Architecture for Demand Migration in a Demand-Driven Execution Engine in a Heterogeneous and Distributed Environment
Authors: E. Vassev, J. Paquet
Venue: Proceedings of the 3rd Annual Communication Networks and Services Research Conference (2005)

This article is an overview of the GIPSY Demand Migration System (DMS). This system brings a Demand Driven Execution Engine like the one used in the GIPSY to a high level of distributiveness and interoperability of operational nodes, by mixing together advanced distributed technologies. The main Demand Migration Systemýs artifacts are discussed, and their different distributions within the GIPSY are surveyed. The article concludes with a presentation of a successful GIPSY Demand Migration implementation, based on JINI. This paper describes only the aspects of the GIPSY Demand Migration, i.e. it does not deal with load balancing and efficiency aspects of the GIPSY, as these are to be tackled by other subsystems of the GIPSY.
The Tool Dæmon Protocol (TDP)
Authors: Barton Miller, Ana Cortes, Miquel A. Senar, Miron Livny
Venue: Proceedings of the 2003 ACM/IEEE conference on Supercomputing (2003)

Run-time tools are crucial to program development. In our desktop computer environments, we take for granted the availability of tools for operations such as debugging, profiling, tracing, checkpointing, and visualization. When programs move into distributed or Grid environments, it is difficult to find such tools. This difficulty is caused by the complex interactions necessary between application program, operating system and layers of job scheduling and process management software. As a result, each run-time tool must be individually ported to run under a particular job management system; for m tools and n environments, the problem becomes an m \times n effort, rather than the hoped-for m + n effort. Variations in underlying operating systems can make this problem even worse. The consequence of this situation is a paucity of tools in distributed and Grid computing environments. In response to the problem, we have analyzed a variety of job scheduling environments and run-time tools to better understand their interactions. From this analysis, we isolated what we believe are the essential interactions between the run-time tool, job scheduler and resource manager, and application program. We are proposing a standard interface, called the Tool Dæmon Protocol (TDP) that codifies these interactions and provides the necessary communication functions. We have implemented a pilot TDP library and experimented with Parador, a prototype using the Paradyn Parallel Performance tools profiling jobs running under the Condor batch-scheduling environment.
Dominance analysis of irreducible CFGs by reduction
Authors: Tetsuo Saitou, Mitsugu Suzuki, Tan Watanabe
Venue: ACM SIGPLAN Notices (2005)

This paper presents a simple and fast algorithm with proof of correctness for analyzing dominance relations of control flow graphs (CFGs). A dominator tree and dominance frontiers are obtained by reducing a DAG, which is obtained by adding dummy vertexes to the original CFG to transmit dominance relation of irreducible loops to the resultant DAG. A specific order of stacking vertexes eliminates the necessity to search for reduction candidates. The computational complexity of the algorithm for a real-world CFG with M edges is O(M), which is also confirmed by analyzing about 1700 CFGs extracted from real programs.
Presenting Micro-Theories of Program Comprehension in Pattern Form
Authors: Adam Murray, Timothy C. Lethbridge
Venue: Proceedings of the 13th International Workshop on Program Comprehension (2005)

We present the notion of cognitive patterns, and provide several examples. A cognitive pattern is the written record of a solution to a recurring cognitive problem typically employed by experienced practitioners. We focus on those relevant to program comprehension, which we have developed through studying the literature and conducting field studies. Collectively the set of patterns constitute a rich theory of program comprehension, which is why we call each one a micro-theory. We expand on one pattern, Temporal Details, which is also a 'pattern language since it breaks down into sub-patterns'. A key use of cognitive patterns is to suggest useful features for tool designers to implement.
Post-Cu CMP cleaning for colloidal silica abrasive removal
Authors: Po-Lin Chen, Jyh-Herng Chen, Ming-Shih Tsai, Bau-Tong Dai, Ching-Fa Yeh
Venue: Microelectronic Engineering (2004)

In this study, an efficient approach for the removal of colloidal silica abrasives from the polished copper surface was proposed and demonstrated. This post-chemical mechanical polishing (CMP) cleaning process combines a buffing process with dilute HNO"3/benzotriazole (BTA) aqueous solution for copper surface passivation and a polyvinyl alcohol (PVA) brush scrubbing process with wetting surfactants, Triton X-100, for colloidal silica removal. Buffing with HNO"3/BTA aqueous solution was able to remove copper oxide and form the Cu(I)-BTA hydrophobic passivation. Scrubbing with Triton X-100 surfactant is to enhance the wettability on Cu(I)-BTA surface for the removal of residual silica abrasives. The wetting ability of Triton X-100 was determined by a contact angle and surface tension measurements. It was demonstrated that silica abrasives could be removed efficiently without copper corrosion by this cleaning process.
Synthetic Exercises on the Web
Authors: Pavel Azalov
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

This paper considers a teaching approach applied to an introductory Computer Science course. The individual work with each of the students attending such a course consists of assigning examples, exercises and problems corresponding to the respective level of the student's preparation. These exercises and problems are generated by a system that uses templates which are developed in advance. Each template is a parameterized program or program fragment written in a programming language such as C, C++, Java, etc. The parameters are XML-like elements and represent statements interpreted by a specific system. As a consequence of this, items similar to the initial program text are generated. Simultaneously, the system also generates the results from their execution. The generated examples are in HTML format and are stored on the class website.
An Extended Particle Swarm Optimizer
Authors: Xu Jun-jie, Xin Zhan-hong
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 6 - Volume 07 (2005)

An extended particle swarm optimizer (EPSO) is proposed in this paper. In this new algorithm, not only the local but also the global best positions found so far will involve in the particle's velocity updating process. EPSO is an integration of two paradigms of canonical PSO and is presumed to yield a more steady progress of optimization. The experiment results have proved that EPSO is an applicable means to utilize the population information and it deserves to be investigated in future.
Kernels and best approximations related to the system of ultraspherical polynomials
Authors: V. I. Kolyada, F. Marcellán
Venue: Journal of Approximation Theory (2005)

We study the uniformly bounded orthonormal system Uλ of functions un(λ)(x) = ϕn(λ) (cos x) (sin x)(λ), x ∈ [0, π], where {ϕn(λ)}n=0∞ (λ > 0) is the normalized system of ultraspherical polynomials. We investigate some approximation properties of the system Uλ, and we show that these properties are similar to one's of the trigonometric system. First, we obtain estimates of Lp-norms of the kernels of the system Uλ. These estimates enable us to prove Nikol'skii-type inequalities for Uλ-polynomials. Next, we prove directly that Uλ is a basis in each Lwp, 1 < p < ∞, where w is an arbitrary Ap-weight function. Finally, we apply these results to get sharp inequalities for the best Uλ-approximations in Lq in terms of the best Uλ-approximations in Lp (1 ≤ p < q < ∞). For the trigonometric system such inequalities have been already known.
Multi-View Head Pose Estimation using Neural Networks
Authors: Michael Voit, Kai Nickel, Rainer Stiefelhagen
Venue: Proceedings of the 2nd Canadian conference on Computer and Robot Vision (2005)

In the context of human-computer interaction, information about head pose is an important cue for building a statement about humans' focus of attention. In this paper, we present an approach to estimate horizontal head rotation of people inside a smart-room. This room is equipped with multiple cameras that aim to provide at least one facial view of the user at any location in the room. We use neural networks that were trained on samples of rotated heads in order to classify each camera view. Whenever there is more than one estimate of head rotation, we combine the different estimates into one joint hypothesis. We show experimentally, that by using the proposed combination scheme, the mean error for unknown users could be reduced by up to 50% when combining the estimates from multiple cameras.
A tamper resistant hardware accelerator for RSA cryptographic applications
Authors: G. P. Saggese, L. Romano, N. Mazzocca, A. Mazzeo
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2004)

This paper presents an hardware accelerator which can effectively improve the security and the performance of virtually any RSA cryptographic application. The accelerator integrates two crucial security- and performanceenhancing facilities: an RSA processor and an RSA key-store. An RSA processor is a dedicated hardware block which executes the RSA algorithm. An RSA key-store is a dedicated device for securely storing RSA key-pairs. We chose RSA since it is by far the most widely adopted standard in public key cryptography. We describe the main functional blocks of the hardware accelerator and their interactions, and comment architectural solutions we adopted for maximizing security and performance while minimizing the cost in terms of hardware resources. We then present an FPGA-based implementation of the proposed architecture, which relies on a Commercial Off The Shelf (COTS) programmable hardware board. Finally, we evaluate the system in terms of performance and chip area occupation, and comment the design trade-offs resulting from different levels of parallelism.
Exploiting Multithreaded Programming on Cluster Architectures
Authors: Otavio Correa Cordeiro, Daniela Saccol Peranconi, Lucas Correia Villa Real, Evandro Clivatti Dall'Agnol, Gerson Geraldo H. Cavalheiro
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

The development of programs for parallel architectures focusing to achieve high indices of performance is a hard task. The programmer must deal with two classes of problems, one related to describing the application concurrency and data dependencies, and other related to exploiting efficiently the processing resources of the architecture, in order to obtain anefficient implementation for a specific hardware configuration. Since cluster technology allows building parallel computers are highly scalable ¿ particularly in terms of number of nodes, processors and amount of memory ¿ programming and execution levels must be considered independently to achieve performance portability. This paper presents Anahy, an environment for exploiting High Performance Computing on cluster architectures. It is highlighted the Anahy programming interface and some features of its implementation as well as a performance evaluation.
The largest Cartesian closed category of domains, considered constructively
Authors: Dieter Spreen
Venue: Mathematical Structures in Computer Science (2005)

This paper addresses a conjecture of Smyth that says that if $D$ and $[D \rightarrow D]$ are effectively algebraic directed-complete partial orders with least element (cpo's), then $D$ is an effectively strongly algebraic cpo, though what is meant by an effectively algebraic and an effectively strongly algebraic cpo was not made precise.Notions of an effectively strongly algebraic cpo and an effective SFP domain are introduced and shown to be (effectively) equivalent. Moreover, the conjecture is shown to hold if instead of being effectively algebraic, $[D \rightarrow D]$ is only required to be $\omega$-algebraic and $D$ is forced to have a completeness test, that is a procedure that decides for any two finite sets $X$ and $Y$ of compact cpo elements whether $X$ is a complete set of upper bounds of $Y$. As a consequence, the category of effective SFP objects and continuous maps turns out to be the largest Cartesian closed full subcategory of the category of $\omega$-algebraic cpo's that have a completeness test.We then consider whether such a result also holds in a constructive framework, where one considers categories with constructive domains as objects, that is, domains consisting only of the constructive (computable) elements of an indexed $\omega$-algebraic cpo, and computable maps as morphisms. This is indeed the case: the category of constructive SFP domains is the largest constructively Cartesian closed weakly indexed effectively full subcategory of the category of constructive domains that have a completeness test and satisfy a further effectivity requirement.
Statistical Cue Integration for Foveated Wide-Field Surveillance
Authors: Simon J. D. Prince, James H. Elder, Yuqian Hou, Mikhail Sizintsev, Yevgen Olevskiy
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

Reliable wide-field detection of human activity is an unsolved problem. The main difficulty is that low resolution and the unconstrained nature of realistic environments and human behaviour make form cues unreliable. Here we argue that reliability in far- or wide-field detection can still be achieved by probabilistic combination of multiple weak but complementary visual cues that do not depend on detailed form analysis. To demonstrate, we describe a real-time Bayesian algorithm for localizing human activity in relatively unconstrained scenes, using motion, background subtraction and skin colour cues. Fast sampling of scale space is achieved using integral images and a flexible norm that can handle sparse cues without loss of statistical power. We show that the probabilistic approach far outperforms a representative logical approach (12) in which skin and background subtraction classifiers are combined conjunctively Our method is currently used in a pre-attentive human activity sensor, generating saccadic targets for an attentive foveated vision system that reliably fixates faces over a 130 deg field of view, allowing high-resolution capture of facial images over a large dynamic scene.
Lofting curve networks using subdivision surfaces
Authors: S. Schaefer, J. Warren, D. Zorin
Venue: Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing (2004)

Lofting is a traditional technique for creating a curved shape by first specifying a network of curves that approximates the desired shape and then interpolating these curves with a smooth surface. This paper addresses the problem of lofting from the viewpoint of subdivision. First, we develop a subdivision scheme for an arbitrary network of cubic B-splines capable of being interpolated by a smooth surface. Second, we provide a quadrangulation algorithm to construct the topology of the surface control mesh. Finally, we extend the Catmull-Clark scheme to produce surfaces that interpolate the given curve network. Near the curve network, these lofted subdivision surfaces are C2 bicubic splines, except for those points where three or more curves meet. We prove that the surface is C1 with bounded curvature at these points in the most common cases; empirical results suggest that the surface is also C1 in the general case.
Beyond the Storage Area Network: Data Intensive Computing in a Distributed Environment
Authors: Daniel Duffy, Nicko Acks, Vaughn Noga, Tom Schardt, J. Patrick Gary, Bill Fink, Ben Kobler, Mike Donovan, Jim McElvaney, Kent Kamischke
Venue: Proceedings of the 22nd IEEE / 13th NASA Goddard Conference on Mass Storage Systems and Technologies (2005)

NASA Earth and space science applications are currently utilizing geographically distributed computational platforms. These codes typically require the most compute cycles and generate the largest amount of data over any other applications currently supported by NASA. Furthermore, with the development of a leadership class SGI system at NASA Ames (Project Columbia), NASA has created an agency wide computational resource. This resource will be heavily employed by Earth and space science users resulting in large amounts of data. The management of this data in a distributed environment requires a significant amount of effort from the users. This paper defines the approach taken to create an enabling infrastructure to help users easily access and move data across distributed computational resources. Specifically, this paper discusses the approach taken to create a wide area Storage Area Network (SAN) using the SGI CXFS file system over standard TCP/IP. In addition, an emerging technology test bed initiative is described to show how NASA is creating an environment to continually evaluate new technology for data intensive computing.
Application-Driven Coordination-Free Distributed Checkpointing
Authors: Adnan Agbaria, William H. Sanders
Venue: Proceedings of the 25th IEEE International Conference on Distributed Computing Systems (2005)

Distributed checkpointing is an important concept in providing fault tolerance in distributed systems. In todayýs applications, e.g., grid and massively parallel applications, the imposed overhead of taking a distributed checkpoint using the known approaches can often outweigh its benefits due to coordination and other overhead from the processes. This paper presents an innovative approach for distributed checkpointing. In this approach, the checkpoints are obtained using offline analysis based on the application level. During execution, no coordination is required. After presenting our approach, we prove its safety and present a performance analysis of it using stochastic models.
Characterizing Secure Dynamic Web Applications Scalability
Authors: Jordi Guitart, Vicenc Beltran, David Carrera, Jordi Torres, Eduard Ayguade
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Papers - Volume 01 (2005)

Security in the access to web contents and the interaction with web sites is becoming one of the most important issues in Internet. Servers need to provide certain levels of security so that the user feels comfortable when running the applications that provide the services he/she requires. HTTP over SSL is the most used solution, providing mutual authentication between the two interacting parts. The SSL protocol does not introduce complexity in web applications but increases the computational demand on the server, reducing its capacity to serve large number of clients and increasing the time to serve them. In order to compensate the degradation in the quality of service, the server needs to be upgraded with additional resources, mainly processors and memory. In this paper we analyze the scalability of servers that run secure dynamic web applications. We analyze how the server behaves when it is stressed with different number of clients and how the quality of service is degraded. We perform a detailed analysis of the server behavior and analyze the impact of adding more processors to the system that runs the server. The analysis is done using a fine-grained analysis framework that considers all levels in the application server execution (i.e. application, server, JVM and OS kernel). The RUBiS auction site benchmark is used to stress a Tomcat application server running on a commodity 4-way multiprocessor Intel platform with Linux.
Long-time averaging for integrable Hamiltonian dynamics
Authors: Eric Canc&#x00e8;s, Fran&#x00e7;ois Castella, Philippe Chartier, Erwan Faou, Claude Le Bris, Fr&#x00e9;d&#x00e9;ric Legoll, Gabriel Turinici
Venue: Numerische Mathematik (2005)

Given a Hamiltonian dynamical system, we address the question of computing the limit of the time-average of an observable. For a completely integrable system, it is known that ergodicity can be characterized by a diophantine condition on its frequencies and that this limit coincides with the space-average over an invariant manifold. In this paper, we show that we can improve the rate of convergence upon using a filter function in the time-averages. We then show that this convergence persists when a symplectic numerical scheme is applied to the system, up to the order of the integrator.