ppxscal/embedding_network huggingface dataset:
Hybrid method analysis of electromagnetic transmission through apertures of arbitrary shape in a thick conducting screen
Authors: Abungu N. Odero, Dominic B. O. Konditi, Alfred V. Otieno
Venue: Proceedings of the 4th WSEAS International Conference on Applied Informatics and Communications (2004)

In this paper a hybrid numerical technique is presented, suitable for analyzing transmission properties of an arbitrarily shaped slot in a thick conducting plane. The slot is excited by an electromagnetic source of arbitrary orientation. The analysis of the problem is based on the "generalized network formulation" for aperture problems. The problem is solved using the method of moments(MOM) and the finite element method(FEM) in a hybrid format. The finite element method is applicable to inhomogeneously filled slots of arbitrary shape while the method of moments is used for solving the electromagnetic fields in unbounded regions of the slot. The cavity region has been subdivided into tetrahedral elements resulting in triangular elements on the surfaces of the apertures. Validation results for rectangular slots are presented. Close agreement between our data and published results is observed. Thereafter, new data has been generated for cross-shaped, H-shaped and circular apertures.
Moving Vehicle Registration and Super-Resolution
Authors: Frederick W. Wheeler, Anthony J. Hoogs
Venue: Proceedings of the 36th Applied Imagery Pattern Recognition Workshop (2007)

We describe a method for registering and super-resolving moving vehicles from aerial surveillance video. The challenge of vehicle super-resolution lies in the fact that vehicles may be very small and thus frame-to-frame registration does not offer enough constraints to yield registration with sub-pixel accuracy. To overcome this, we first register the large-scale image backgrounds and then, relative to the background registration, register the small-scale moving vehicle over all frames simultaneously using a vehicle motion model. To solve for the vehicle motion parameters we optimize a cost function that incorporates both vehicle appearance and background appearance consistency. Once this process accurately registers a moving vehicle, it is super-resolved. We apply both a frequency domain and a spatial domain approach. The frequency domain approach can be used when the final registered vehicle motion is well approximated by shifts in the image plane. The robust regularized spatial domain approach handles all cases of vehicle motion.
Scalar conservation laws with vanishing and highly nonlinear diffusive-dispersive terms
Authors: Naoki Fujino
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

We investigate the initial value problem for a scalar conservation law with highly nonlinear diffusive-dispersive terms: ut + f(u)x = ε(ux2l-1)x - δ(ux2l-1)xx (l≥1). In this paper, for a sequence of solutions to the equation with initial data, we give convergence results that a sequence converges to the unique entropy solution to the hyperbolic conservation law. In particular, our main theorem implies the results of Kondo-LeFloch [15] and Schonbek [26], furthermore makes up for insufficiency of the results in Fujino-Yamazaki [9] and LeFloch-Natalini [22]. Applying the technique of compensated compactness, the Young measure and the entropy measure-valued solutions as main tools, we establish the convergence property of the sequence. The final step of our proof is to show that the measure-valued mapping associated to the sequence of solutions is reduced to an entropy solution and this step is mainly based on the approach of LeFloch-Natalini [22].
Cost-driven repair optimization of reconfigurable nanowire crossbar systems with clustered defects
Authors: Yadunandana Yellambalase, Minsu Choi
Venue: Journal of Systems Architecture: the EUROMICRO Journal (2008)

With the recent development of nanoscale materials and assembly techniques, it is envisioned to build high-density reconfigurable systems which have never been achieved by the photolithography. Various reconfigurable architectures have been proposed based on nanowire crossbar structure as the primitive building block. Unfortunately, high-density systems consisting of nanometer-scale elements are likely to have many imperfections and variations; thus, defect tolerance is considered as one of the most exigent challenges. In this paper, we evaluate three different logic mapping algorithms with defect tolerance to circumvent clustered defective crosspoints in nanowire reconfigurable crossbar architectures. The effectiveness of inherited redundancy and configurability utilization is demonstrated through extensive parametric simulations. Then, costs associated with the repair process are analyzed and a method to find the most cost-effective repair solution is presented.
Investigating Wireless Sensor Network Lifetime Using a Realistic Radio Communication Model
Authors: Michael Mallinson, Sajid Hussain, Jong Hyuk Park
Venue: Proceedings of the 2008 International Conference on Multimedia and Ubiquitous Engineering (2008)

Investigating realistic simulations in wireless sensor networks has been an area which has drawn a lot of research interest. These simulations are used to predict the lifetime of wireless sensor networks, evaluation of network performance and data dissemination algorithms. A discrete radio model can be used for calculating more realistic power consumption and determining which links between sensor motes are available for transmission. In this work, we apply a discrete power dissipation model to investigate performance of a few data dissemination algorithms and techniques. We also define an upper bound upon network lifetime which is derived from the discrete radio model.
Caustic spot light for rendering caustics
Authors: Xinguo Liu, Zhao Dong, Hujun Bao, Qunsheng Peng
Venue: The Visual Computer: International Journal of Computer Graphics (2008)

It is difficult to render caustic patterns at interactive frame rates. This paper introduces new rendering techniques that relax current constraints, allowing scenes with moving, non-rigid scene objects, rigid caustic objects, and rotating directional light sources to be rendered in real-time with GPU hardware acceleration. Because our algorithm estimates the intensity and the direction of caustic light, rendering of non-Lambertian surfaces is supported. Previous caustics algorithms have separated the problem into pre-rendering and rendering phases, storing intermediate results in data structures such as photon maps or radiance transfer functions. Our central idea is to use specially parameterized spot lights, called caustic spot lights (CSLs), as the intermediate representation of a two-phase algorithm. CSLs are flexible enough that a small number can approximate the light leaving a caustic object, yet simple enough that they can be efficiently evaluated by a pixel shader program during accelerated rendering.We extend our approach to support changing lighting direction by further dividing the pre-rendering phase into per-scene and per-frame components: the per-frame phase computes frame-specific CSLs by interpolating between CSLs that were pre-computed with differing light directions.
Policy decomposition for collaborative access control
Authors: Dan Lin, Prathima Rao, Elisa Bertino, Ninghui Li, Jorge Lobo
Venue: Proceedings of the 13th ACM symposium on Access control models and technologies (2008)

With the advances in web service techniques, new collaborative applications have emerged like supply chain arrangements and coalition in government agencies. In such applications, the collaborating parties are responsible for managing and protecting resources entrusted to them. Access control decisions thus become a collaborative activity in which a global policy must be enforced by a set of collaborating parties without compromising the autonomy or confidentiality requirements of these parties. Unfortunately, none of the conventional access control systems meets these new requirements. To support collaborative access control, in this paper, we propose a novel policy-based access control model. Our main idea is based on the notion of policy decomposition and we propose an extension to the reference architecture for XACML. We present algorithms for decomposing a global policy and efficiently evaluating requests.
Electrical characterization of human mesenchymal stem cell growth on microelectrode
Authors: Sungbo Cho, Hagen Thielecke
Venue: Microelectronic Engineering (2008)

To support the development of stem cell therapies with in vitro assays, non-destructive methods are required for the quality control of stem cell culture. In this article, it was investigated whether an electrode based chip with electrical impedance spectroscopy can be used to characterize the growth of human mesenchymal stem cells on electrodes without any chemical marker. From finite element method simulations, the electrical characteristics of cell layer under weak alternating electric fields were investigated with respect to the different cell/cell or cell/substrate gap, and modelled as an equivalent circuit. The impedance spectra were measured during the long-term cultivation of human mesenchymal stem cells on platinum electrodes. By fitting analyses the equivalent circuit to measured spectra, an extra cellular resistance reflecting the cell growth was extrapolated.
Ensemble motion planning in trees
Authors: G. N. Frederickson, D. J. Guan
Venue: Proceedings of the 30th Annual Symposium on Foundations of Computer Science (1989)

The problem of transporting a set of objects between the vertices of a tree by a unit capacity vehicle that travels along the edges of the tree is considered. For the case in which any object can be dropped at intermediate vertices along its route and picked up later, the authors present algorithms for finding a minimum cost transportation that run in O(k+qn) time and in O(k+n log n) time, where n is the number of vertices in the tree, k is the number of objects to be moved, and q
Measurement and analysis of LDAP performance
Authors: Xin Wang, Henning Schulzrinne, Dilip Kandlur, Dinesh Verma
Venue: IEEE/ACM Transactions on Networking (TON) (2008)

The Lightweight Directory Access Protocol (LDAP) is being used for an increasing number of distributed directory applications. We describe a tool to analyze the performance of LDAP directories, and study the performance of a LDAP directory under a variety of access patterns. In the experiments, we use a LDAP schema proposed for the administration of Service Level Specifications (SLSs) in a differentiated services network. Individual modules in the server and client code are instrumented to obtain a detailed profile of their contributions to the overall system latency and throughput. We first study the performance under our default experiment setup. We then study the importance of the factors in determining scalability, namely front-end versus back-end processes, CPU capability, and available memory. At high loads, the connection management latency increases sharply to dominate the response in most cases. The TCP Nagle algorithm is found to introduce a very large additional latency, and it appears beneficial to disable it in the LDAP server. The CPU capability is found to be significant in limiting the performance of the LDAP server, and for larger directories, which cannot be kept in memory, data transfer from the disk also plays a major role. The scaling of server performance with the number of directory entries is determined by the increase in back-end search latency, and scaling with directory entry size is limited by the front-end encoding of search results, and, for out-of-memory directories, by the disk access latency. We investigate different mechanisms to improve the server performance.
A pattern recognition approach to infer time-lagged genetic interactions
Authors: Cheng-Long Chuang, Chih-Hung Jen, Chung-Ming Chen, Grace S. Shieh
Venue: Bioinformatics (2008)

Motivation: For any time-course microarray data in which the gene interactions and the associated paired patterns are dependent, the proposed pattern recognition (PARE) approach can infer time-lagged genetic interactions, a challenging task due to the small number of time points and large number of genes. PARE utilizes a non-linear score to identify subclasses of gene pairs with different time lags. In each subclass, PARE extracts non-linear characteristics of paired gene-expression curves and learns weights of the decision score applying an optimization algorithm to microarray gene-expression data (MGED) of some known interactions, from biological experiments or published literature. Namely, PARE integrates both MGED and existing knowledge via machine learning, and subsequently predicts the other genetic interactions in the subclass. Results: PARE, a time-lagged correlation approach and the latest advance in graphical Gaussian models were applied to predict 112 (132) pairs of TC/TD (transcriptional regulatory) interactions. Checked against qRT-PCR results (published literature), their true positive rates are 73% (77%), 46% (51%), and 52% (59%), respectively. The false positive rates of predicting TC and TD (AT and RT) interactions in the yeast genome are bounded by 13 and 10% (10 and 14%), respectively. Several predicted TC/TD interactions are shown to coincide with existing pathways involving Sgs1, Srs2 and Mus81. This reinforces the possibility of applying genetic interactions to predict pathways of protein complexes. Moreover, some experimentally testable gene interactions involving DNA repair are predicted. Availability: Supplementary data and PARE software are available at http://www.stat.sinica.edu.tw/~gshieh/pare.htm. Contact: gshieh@stat.sinica.edu.tw
A Non-linear Split Error Detection Code
Authors: Michael Gössel, Egor Sogomonyan
Venue: Fundamenta Informaticae (2008)

In this paper a new non-linear error detection code with three non-linear check bits and an even number of k information bits is introduced. The proposed code may be considered as a modified parity code. The parity bit is split into two non-linear check bits and a third non-linear check bit is added. All odd errors are detected with certainty. All (also even) errors of arbitrary multiplicity for which at least one of the information bits is correct are detected with a probability greater than or equal to 1/2.
Approximation of anisotropic classes by standard information
Authors: Jiang Yanjie
Venue: Journal of Complexity (2008)

This paper deals with the approximation problem on anisotropic Besov classes S"p"@q^rB(R^d),p=(p"1,...,p"d), and Besov-Wiener classes S"p"q"@q^rB(R^d) using standard information. The asymptotic decay rates of the best algorithms in the worst-case setting are determined.
Streaming web services for 3D portal applications
Authors: Xiaoyu Zhang, Denis Gračanin
Venue: Proceedings of the 13th international symposium on 3D web technology (2008)

3D Portal application is a multi-user Virtual Environment that creates its content from distributed 3D components. The users can explore the shared virtual space and interact with the virtual objects contributed from various providers. Service Oriented Architecture (SOA) is often used for the distributed Web applications as well as some real-time distributed simulations. SOA has its advantages in service integration and data interoperation based on the underlying Web services technology. However, the request-response communication style of the service invocation sets up a real-time performance barrier for the distributed 3D applications using SOA. We introduce a framework for real-time 3D portal applications using SOA. The proposed framework introduces additional streaming channels in the scene aggregation and uses profiles to coordinate the application integration. Both MPEG-4 and X3D are used as the standards for the 3D content delivery and presentation. We discuss the performance challenges based on the experiment results from a pilot study. Considering the performance impact of SOA, we suggest a set of applications that fit the proposed framework.
Glove-Based Approach to Online Signature Verification
Authors: Nidal S. Kamel, Shohel Sayeed, Grant A. Ellis
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2008)

Utilizing the multiple degrees of freedom offered by the data glove for each finger and the hand, a novel on-line signature verification system using the Singular Value Decomposition (SVD) numerical tool for signature classification and verification is presented. The proposed technique is based on the Singular Value Decomposition in finding r singular vectors sensing the maximal energy of glove data matrix A, called principal subspace, so the effective dimensionality of A can be reduced. Having modeled the data glove signature through its r-principal subspace, signature authentication is performed by finding the angles between the different subspaces. A demonstration of the data glove is presented as an effective high-bandwidth data entry device for signature verification. This SVD-based signature verification technique is tested and its performance is shown to be able to recognize forgery signatures with a false acceptance rate of less than 1.2%.
Raster-network regionalization for watershed data processing
Authors: T. L. Whiteaker, D. R. Maidment, H. Gopalan, C. Patino, D. C. Mckinney
Venue: International Journal of Geographical Information Science (2007)

Difficulties exist in calculating watershed parameters from raster datasets over large regions because of the excessive computation time involved. A technique is presented which divides a large region into hydrologically distinct subregions, in each of which raster analyses are performed, in order to efficiently process large raster datasets. The results of raster analyses are stored as attributes on the resulting vector data. The vector data are then merged, and appropriate values accumulated to obtain regional parameter values for points of interest along the stream network. The technique, called Raster-Network Regionalization, uses the vector stream network as the backbone for the integration of subregions into a single region. A case study is presented which utilizes the technique to prepare geospatial inputs for the Water Rights Analysis Package simulation model.
Acrobat Connect Professional Essential Training
Authors: Tim Plumer
Venue:  (2007)

Good business depends on good communication, and Acrobat Connect Professional can help facilitate the process. Instructor Tim Plumer has spent more than a decade teaching people how to best utilize Acrobat in business. In these tutorials, he demonstrates in detail how to use Adobe s latest professional-level meeting, presentation, and instructional tool to its fullest potential. He shows how to use the application to bring people together via online meetings in real time, with the ability to collaborate at various levels with other participants and control content flow. He also covers how to deliver smart presentations with or without audience participation, and how to use Acrobat Connect Professional with work teams in various locations to share files and streamline communication. Exercise files accompany the tutorials.Topics Include:Organizing layouts and podsSetting up for a presentationAdding file sharing and web linksStarting and running a meetingCollaborating with othersCreating a self-running presentationDeveloping presentations for e-learningDuration: 6 hoursOn 1 CD-ROM
Prevent In-Game Cheat in Network Games
Authors: Shaolong Li, Changja Chen, Lei Li
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

Network games have become a popular social experience, while problem of in-game cheat (e.g. trade cheat, fraud and so on) has not an effective solution by now. In this paper, we propose a method to help players to prevent in-game cheat on the basis of group interaction analysis in massive multiplayer online role playing games (MMORPG). Frequency of group interactions reflects how possible two players like to play together. So, group interactions of all players can help a given player to distinguish between righteous players who have high frequency of group interactions with famous virtuous roles or his dependable friends and suspectable players who have high frequency of group interactions with notorious roles. In this paper, we develop an algorithm to visualize group interactions according to psychology of players and rules of the game system, and then we propose a simple method to prevent in-game cheat. Keywords network games, group activity, interaction, correlation, in-game cheat, degree of relationship.
Design of the Java HotSpot&trade; client compiler for Java 6
Authors: Thomas Kotzmann, Christian Wimmer, Hanspeter Mössenböck, Thomas Rodriguez, Kenneth Russell, David Cox
Venue: ACM Transactions on Architecture and Code Optimization (TACO) (2008)

Version 6 of Sun Microsystems' Java HotSpot&trade; VM ships with a redesigned version of the client just-in-time compiler that includes several research results of the last years. The client compiler is at the heart of the VM configuration used by default for interactive desktop applications. For such applications, low startup and pause times are more important than peak performance. This paper outlines the new architecture of the client compiler and shows how it interacts with the VM. It presents the intermediate representation that now uses static single-assignment (SSA) form and the linear scan algorithm for global register allocation. Efficient support for exception handling and deoptimization fulfills the demands that are imposed by the dynamic features of the Java programming language. The evaluation shows that the new client compiler generates better code in less time. The popular SPECjvm98 benchmark suite is executed 45&percnt; faster, while the compilation speed is also up to 40&percnt; better. This indicates that a carefully selected set of global optimizations can also be integrated in just-in-time compilers that focus on compilation speed and not on peak performance. In addition, the paper presents the impact of several optimizations on execution and compilation speed. As the source code is freely available, the Java HotSpot&trade; VM and the client compiler are the ideal basis for experiments with new feedback-directed optimizations in a production-level Java just-in-time compiler. The paper outlines research projects that add fast algorithms for escape analysis, automatic object inlining, and array bounds check elimination.
A new study on optimal calculation of partial transmission ratios of three-step helical reducers for getting minimal cross section dimension
Authors: Vu Ngoc Pi
Venue: Proceedings of the 2nd WSEAS International Conference on Computer Engineering and Applications (2008)

This paper introduces a new study on the applications of the optimization and computer techniques for optimal determination of partial ratios of three-step helical reducers (or gearboxes) in order to get the minimal cross section dimension. In the paper, basing on moment equilibrium condition of a mechanic system including three gear units and their regular resistance condition, effective models for calculating the partial ratios of three-step helical reducers were proposed. In particular, explicit models for determination of the partial ratios are suggested by using regression analysis. These models allow calculating the ratios accurately and simply.