ppxscal/embedding_network huggingface dataset:
Multilevel multipole-free fast algorithm for electromagnetic scattering problems in layered media
Authors: Weng Cho Chew
Venue:  (2006)

A multilevel multipole-free algorithm is presented for solving electromagnetic scattering problems in the vicinity of a half space or layered medium. By replacing the multipole expansion in the fast inhomogeneous plane wave algorithm (FIPWA) with a multipole-free expansion, this new algorithm is simpler to derive and retains O (N log N) scaling in memory and processing time. To develop this new algorithm, known as the multipole-free fast inhomogeneous plane wave algorithm (MF-FIPWA), error control is established for arbitrary accuracy. In addition, comparison of the memory usage and simulation time is presented for FIPWA and MF-FIPWA for moderate to large scale problems. Various alternate approaches to implementing MF-FIPWA are discussed in terms of how the fast algorithms set up translation matrices and where gains can be made. Finally, details of the advantages of using nonuniform sampling are provided. Results show 30% savings in memory usage and up to 20% savings in computing the matrix-vector product.
Table of Contents
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The nature of the engineering workplace is changing rapidly. Due to technology and the globalization of the marketplace, engineers must often work with diverse colleagues on team projects from a distance. Yet, given the logistics of today's traditional classroom, many instructors establish local student teams to solve engineering problems. While these local teams certainly improve student team-building skills, they do not "force" engineers to communicate in writing at the highest level, since face-to-face communication enables one to provide oral explanations to local team members. This paper discusses a successful collaborative classroom effort begun in 1994 between faculty at Arizona State University (ASU) in Tempe, AZ and Temple University (Temple) in Philadelphia, PA, USA. The result has been a dynamic, long-distance classroom that has helped diverse engineering and technology students work in teams to solve engineering problems and improve written communication using electronic technology. Through this unique classroom effort, students learn about the value of clear, precise and frequent technical and interpersonal communication. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Combining Formal Concept Analysis with Information Retrieval for Concept Location in Source Code
Authors: Denys Poshyvanyk, Andrian Marcus
Venue: Proceedings of the 15th IEEE International Conference on Program Comprehension (2007)

The paper addresses the problem of concept location in source code by presenting an approach which combines Formal Concept Analysis (FCA) and Latent Semantic Indexing (LSI). In the proposed approach, LSI is used to map the concepts expressed in queries written by the programmer to relevant parts of the source code, presented as a ranked list of search results. Given the ranked list of source code elements, our approach selects most relevant attributes from these documents and organizes the results in a concept lattice, generated via FCA. The approach is evaluated in a case study on concept location in the source code of Eclipse, an industrial size integrated development environment. The results of the case study show that the proposed approach is effective in organizing different concepts and their relationships present in the subset of the search results. The proposed concept location method outperforms the simple ranking of the search results, reducing the programmers' effort.
Biometric Recognition Using 3D Ear Shape
Authors: Ping Yan Kevin W. Bowyer
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

Previous works have shown that the ear is a promising candidate for biometric identification. However, in prior work, the preprocessing of ear images has had manual steps and algorithms have not necessarily handled problems caused by hair and earrings. We present a complete system for ear biometrics, including automated segmentation of the ear in a profile view image and 3D shape matching for recognition. We evaluated this system with the largest experimental study to date in ear biometrics, achieving a rank-one recognition rate of 97.8 percent for an identification scenario and an equal error rate of 1.2 percent for a verification scenario on a database of 415 subjects and 1,386 total probes.
Role playing in concurrent programming as a way of developing active learning
Authors: O. Clua
Venue: Proceedings of the Frontiers in Education Conference, 2001. 31st Annual - Volume 02 (2001)

Concurrent programming is not only a programming paradigm, but a powerful structuring tool for applications that are logically comprised of asynchronous components. Although it is a conceptually simple abstraction, concurrent programming is challenging because processes interact with themselves in several obscure ways. When students are caught in the synchronization traps, they tend to blame the compiler; the operating system, the synchronization primitives, but they are not ready to discover their programming errors. We tried several methods of sequencing the material and guided problems without result; students failed to attack the concurrent issues with the necessary ingenuity. During the last term we tried a more integral "kinesthetic" way, with promissory results.
Adaptive Triangular Deployment Algorithm for Unattended Mobile Sensor Networks
Authors: Ming Ma, Yuanyuan Yang
Venue: IEEE Transactions on Computers (2007)

In this paper, we present a novel sensor deployment algorithm, called the adaptive triangular deployment (ATRI) algorithm, for large-scale unattended mobile sensor networks. The ATRI algorithm aims at maximizing coverage area and minimizing coverage gaps and overlaps by adjusting the deployment layout of nodes close to equilateral triangulation, which is proven to be the optimal layout to provide the maximum no-gap coverage. The algorithm only needs the location information of nearby nodes, thereby avoiding communication cost for exchanging global information. By dividing the transmission range into six sectors, each node adjusts the relative distance to its one-hop neighbors in each sector separately. The distance threshold strategy and the movement state diagram strategy are adopted to avoid the oscillation of nodes. The simulation results show that the ATRI algorithm achieves a much larger coverage area and smaller average moving distance of nodes than existing algorithms. We also show that the ATRI algorithm is applicable to practical environments and tasks such as working in both bounded and unbounded areas and avoiding irregularly shaped obstacles. In addition, the density of nodes can be adjusted adaptively to different requirements of tasks.
Ray tracing on the desktop: when and how?
Authors: P. Shirley
Venue: Proceedings of the Computer Graphics International 2005 (2005)

The chaotic attractors with symmetries of the triangle groups are visualized in the hyperbolic plane. Using probabilistic iterated function systems that involve both affine transformations of the plane and isometries of triangle groups, we can create intriguing and exotic attractor's images. The derived images are of self-similarity and of infinitely fine structure; they contain symmetries associated with the triangle groups as well. The method provides a novel approach for devising tiling patterns with symmetries. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
What Anyone Can Know: The Privacy Risks of Social Networking Sites
Authors: David Rosenblum
Venue: IEEE Security and Privacy (2007)

For the Net generation, social networking sites have become the preferred forum for social interactions, from posturing and role playing to simply sounding off. However, because such forums are relatively easy to access, posted content can be reviewed by anyone with an interest in the users' personal information.
On the solution set of convex problems and its numerical application
Authors: S. Ketabchi, E. Ansari-Piri
Venue: Journal of Computational and Applied Mathematics (2007)

The solution set of a convex problem is enough interested. In this paper we have a discussion to determine it. The conditions and proofs in this note essentially differs from the previous well-known works. We also have a new result determining the solution of minimum norm for quadratic problems.
An Adaptive Double-layer Workflow Scheduling Approach for Grid Computing
Authors: Fangpeng Dong, Selim G. Akl
Venue: Proceedings of the 21st International Symposium on High Performance Computing Systems and Applications (2007)

Based on our previous work, an algorithm called AWS is proposed in this paper for a double-layer workflow scheduling approach for the Grid. AWS aims to overcome difficulties brought about by the clustered resource distribution within the Grid. It partitions a workflow graph according to features of available resource clusters and of the graph itself. It does not require detailed status information or control privilege on every Grid resource for Grid schedulers at the global Grid level. As a result, the dependence on Grid information services is reduced and, at the same time, the higher priority of local resource management policies is respected. Experimental results show that AWS is adaptive to the Grid circumstances and its performance approaches ideal global fine-granularity scheduling methods.
PGP in constrained wireless devices
Authors: Michael Brown, Donny Cheung, Darrel Hankerson, Julio Lopez Hernandez, Michael Kirkup, Alfred Menezes
Venue: Proceedings of the 9th conference on USENIX Security Symposium - Volume 9 (2000)

The market for Personal Digital Assistants (PDAs) is growing at a rapid pace. An increasing number of products, such as the PalmPilot, are adding wireless communications capabilities. PDA users are now able to send and receive email just as they would from their networked desktop machines. Because of the inherent insecurity of wireless environments, a system is needed for secure email communications. The requirements for the security system will likely be influenced by the constraints of the PDA, including limited memory, limited processing power, limited bandwidth, and a limited user interface. This paper describes our experience with porting PGP to the Research in Motion (RIM) two-way pager, and incorporating elliptic curve cryptography into PGP's suite of public-key ciphers. Our main conclusion is that PGP is a viable solution for providing secure and interoperable email communications between constrained wireless devices and desktop machines.
On Scaling Multi-Agent Task Reallocation Using Market-Based Approach
Authors: Rajesh K. Karmani, Timo Latvala, Gul Agha
Venue: Proceedings of the First International Conference on Self-Adaptive and Self-Organizing Systems (2007)

Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of the computationally intractable Multi- Depot Traveling Salesman Problem (MDTSP). We propose a novel market-based approach, called Market-based Approach with Look-ahead Agents (MALA), to address the problem. In MALA, agents use look ahead to optimize their behavior. Each agent plans a preferred, reward-maximizing tour for itself using our proposed algorithm which is based on the Universal TSP algorithm. The agent then uses the preferred tour to evaluate potential trades with other agents in linear timea necessary prerequisite for scalability of market-based approach. We use simulations in a two dimensional world to study the performance of MALA and compare it with O-contracts and TraderBots, respectively, a centralized approach and a distributed approach. Experiments suggest that MALA efficiently scales to thousands of tasks and hundreds of agents in terms of both computation and communication complexity, while delivering relatively good-quality but approximate solutions.
Iteratively constructing preconditioners via the conjugate gradient method
Authors: John Dunagan, Nicholas J.A. Harvey
Venue: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing (2007)

We consider the problem of solving a symmetric, positive definite system of linear equations.The most well-known and widely-used method for solving such systemsis the preconditioned Conjugate Gradient method.The performance of this method depends crucially on knowing a good preconditioner matrix.We show that the Conjugate Gradient method itself canproduce good preconditioners as a by-product. These preconditioners allow us to derive new asymptotic bounds on the timeto solve multiple related linear systems.
Fast, automatic checking of security protocols
Authors: Darrell Kindred, Jeannette M. Wing
Venue: Proceedings of the 2nd conference on Proceedings of the Second USENIX Workshop on Electronic Commerce - Volume 2 (1996)

Protocols in electronic commerce and other security-sensitive applications require careful reasoning to demonstrate their robustness against attacks. Several logics have been developed for doing this reasoning formally, but protocol designers usually do the proofs by hand, a process which is time-consuming and error-prone. We present a new approach, theory checking, to analyzing and verifying properties of security protocols. In this approach we generate the entire finite theory, Th, of a logic for reasoning about a security protocol; determining whether it satisfies a property, φ, is thus a simple membership test: φ ∈ Th. Our approach relies on (1) modeling a finite instance of a protocol in the way that the security community naturally, though informally, presents a security protocol, and (2) placing restrictions on a logic's rules of inference to guarantee that our algorithm terminates, generating a finite theory. A novel benefit to our approach is that because of these restrictions we can provide an automatic theory-checker generator. We applied our approach and our theory-checker generator to three different logics for reasoning about authentication and electronic commerce protocols: the Burrows-Abadi-Needham logic of authentication, AUTLOG, and Kailar's accountability logic [4, 8, 6]. For each we verified the desired properties using specialized theory checkers; most checks took less than two minutes, and all less than fifteen.
Algorithms and Design for an Autonomous Biological System
Authors: Swapnoneel Roy, Ashok Kumar Thakur, Anupama Pande, Minhazur Rahman
Venue: Proceedings of the Third International Conference on Autonomic and Autonomous Systems (2007)

Various global rearrangements of permutations, such as reversals and transpositions, have recently become of interest because of their applications in computational molecular biology, to be more specific, genome rearrangement. Many primitives have been formulated in this regard. These primitives find their applications hugely in the study of the similarity of different organisms. In this paper, we formulate a new primitive for genome rearrangement, the strip exchanges . An approximation algorithm for the strip exchanges problem with an approximation guarantee of 2.66 has been designed. We present this algorithm along with its mathematical analysis. We propose the design of an autonomous biological system which detects the similarity of different species by matching their genomes. We use the primitive strip exchanges to match two genomes in our system. A comparison of the other existing primitives with strip exchanges has been given. Various other pragmatic applications of such a system have also been touched upon.
An Adaptive and Optimized Security Policy Manager for Wireless Networks
Authors: Debabrata Nayak
Venue: Proceedings of the First Asia International Conference on Modelling & Simulation (2007)

The security policy Manager resides on each AP. Its sole responsibility is to receive the security policy, transform it into a stack-specific format and then help implement the policy via the underlying protocol stack. Security policy Manager receives the policy in a stack-independent XML format. It transforms the policy into a stack-specific format and then determines the changes in the new policy compared to the currently running one. After completing these initial tasks, the Security policy Manager helps to carry out these changes in the policy while interacting with the underlying protocol stack, if there will be any conflicts then the Security policy manager calls the adaptive security policy optimizer to remove some part of policy and maximizes the output. Changes might require only adding/deleting a new NE to the policy.
Image registration based on both feature and intensity matching
Authors: Yao Jianchao
Venue: Proceedings of the Acoustics, Speech, and Signal Processing, 2001. on IEEE International Conference - Volume 03 (2001)

Image registration is one of the most important tasks in image processing. The algorithms of image registration are classified into two categories: the feature-based matching and intensity-based matching. Each of them has its strength and weakness. In this paper, by combining these two techniques together, we developed a new algorithm for image registration. The algorithm utilises a parametric projective model accounting for geometrical variation and a polynomial model with a small number of polynomial coefficients explicating the smooth spatially varying illumination variation. The initial projective model parameters are first estimated by using feature-based approach. Subsequently, the coefficients of the illumination model are determined simultaneously with the projective transformation parameters through the process of intensity matching. The experimental results demonstrated the algorithm is of robustness, efficiency and accuracy. The ACM Portal is published by the Association for Computing Machinery. Copyright © 2010 ACM, Inc. Terms of Usage Privacy Policy Code of Ethics Contact Us Useful downloads: Adobe Acrobat QuickTime Windows Media Player Real Player
Packet transmission on the WCDMA air interface using a rate matched bandwidth allocation technique
Authors: P. Das, J. Y. Khan
Venue: Proceedings of the The 8th International Conference on Communication Systems - Volume 02 (2002)

This paper presents rate matched adaptive bandwidth allocation algorithms to transmit packets from bursty traffic sources over the WCDMA air interface using the DCH channel. The algorithms developed allocate variable transmission bandwidth to bursty traffic sources to match its transmission requirements thus maximising multiplexing efficiencies and minimising end-to-end delay. Performances of the algorithms are examined using an OPNET simulation model.
Fuzzy Data in Local Optimal Strategy of Multistage Recognition
Authors: Robert Burduk
Venue: Proceedings of the 6th International Conference on Computer Information Systems and Industrial Management Applications (2007)

The paper deals with the recognition task with a full probabilistic information. In this problem of recognition the Bayesian statistic is applied and multistage recognition is considered. The information on objects features is fuzzy-valued. The decision rules minimize the mean risk, that is the mean value of the zero-one loss function. The probability of misclassification for local optimal strategy and the difference between probability of misclassification for the fuzzy-valued and crisp data are presented. Simple example conclude the work and influence of the width of the fuzzy number on this difference is discussed.
Analysis of Parallel Algorithms for Matrix Chain Product and Matrix Powers on Distributed Memory Systems
Authors: Keqin Li
Venue: IEEE Transactions on Parallel and Distributed Systems (2007)

Given N matrices A_{1}, A_{2}, \ldots, A_{N} of size N \times N, the matrix chain product problem is to compute A_{1} \times A_{2} \times \cdots \times A_{N}. Given an N \times N matrix A, the matrix powers problem is to calculate the first N powers of A, that is, A, A^{2}, A^{3}, \ldots, A^{N}. We solve the two problems on distributed memory systems (DMSs) with p processors that can support one-to-one communications in T(p) time. Assume that the fastest sequential matrix multiplication algorithm has time complexity O(N^{\alpha}), where the currently best value of \alpha is less than 2.3755. Let p be arbitrarily chosen in the range 1 \leq p \leq N^{\alpha + 1}/(\log N)^{2}. We show that the two problems can be solved by a DMS with p processors in T_{\rm chain}(N,p) = O({\frac{N^{\alpha + 1}}{p}} + T(p)(({\frac{N^{2(1 + 1/\alpha)}}{p^{2/\alpha}}})(\log^{+}{\frac{p}{N}})^{1 - 2/\alpha} + \log^{+}({\frac{p\log N}{N^{\alpha}}})\log N)) and T_{\rm power}(N,p) = O({\frac{N^{\alpha + 1}}{p}} + T(p)(({\frac{N^{2(1 + 1/\alpha)}}{p^{2/\alpha}}})(\log^{+}{\frac{p}{2\log N}})^{1 - 2/\alpha}+ (\log N)^{2})) times, respectively, where the function \log^{+} is defined as follows: \log^{+}x = \log x if x \geq 1 and \log^{+}x = 1 if 0
Running BSD kernels as user processes by partial emulation and rewriting of machine instructions
Authors: Hideki Eiraku, Yasushi Shinjo
Venue: Proceedings of the BSD Conference 2003 on BSD Conference (2003)

A user-level operating system (OS) can be implemented as a regular user process on top of another host operating system. Conventional user-level OSes, such as User Mode Linux, view the underlying host operating system as a specific hard-ware architecture. Therefore, the implementation of a user-level OS often requires porting of an existing kernel to a new hardware architecture. This paper proposes a new implementation method of user-level OSes by using partial emulation of hard-ware and static rewriting of machine instructions. In this method, privileged instructions and their related non-privileged instructions in a native operating system are statically translated into subroutine calls that perform emulation. The translated instructions of the user-level OS are executed by both the real CPU and the partial emulator. This method does not require detailed knowledge about kernel internals. By using the proposed method, NetBSD and FreeBSD are executed as user processes on NetBSD and Linux.
Using Synchronizers for Refining Synchronous Communication onto Hardware/Software Architectures
Authors: Zhonghai Lu, Jonas Sicking, Ingo Sander, Axel Jantsch
Venue: Proceedings of the 18th IEEE/IFIP International Workshop on Rapid System Prototyping (2007)

We have presented a formal set of synchronization components called synchronizers for refining synchronous communication onto HW/SW codesign architectures. Such an architecture imposes asynchronous communication between HW-HW, SW-SW and HW-SW components. The synchronizers enable local synchronization, thus satisfy the synchronization requirement of a typical IP core. In this paper, we present their implementations in HW, SW and HW/SW, as well as their application. To validate our concepts, we conduct a case study on a Nios FPGA that comprises a processor, memory and custom logic. The final HW/SW implementation achieves equivalent performance to pure HW implementation. Our prototyping experience suggests that the synchronizers can be standardized as library modules and effectively separate the design of computation from that of communication.