ppxscal/embedding_network huggingface dataset:
Intention Scheduling for BDI Agent Systems
Authors: Zu-Nien Lin, Hsun-Jen Hsu, Feng-Jian Wang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

BDI is one of the models in Agent Systems. Currently, most of BDI agents' researches are focused on the ability for agents to dynamically select plans to achieve a goal. There are fewer discussions on Intention Scheduling, the order in which the selected plans are executed. Agents must adapt to dynamical and unpredictable changes. Without a proper scheduling scheme, an agent may repeat unnecessary works, waste valuable resource or even fail the users' expect altogether. In this paper, we present an effective intention-scheduling scheme in BDI reasoning process, to make BDI agents more efficient and suitable for execution.
Mobile k&auml;rp&auml;t: a case study in wireless personal area networking
Authors: Timo Ojala, Jani Korhonen, Tiia Sutinen, Pekka Parhi, Lauri Aalto
Venue: Proceedings of the 3rd international conference on Mobile and ubiquitous multimedia (2004)

The advanced smartphones entering the mass market are capable of playing audio and video files back, which paves the way for new types of rich mobile multimedia services. However, these services impose high data rate requirements on the wireless link, which can not necessarily be satisfied with the current mobile phone networks. This can be compensated with a wireless personal area network based for example on Bluetooth connectivity, or with a wireless local area network. This paper presents a case study demonstrating complementary distribution of static and dynamic multimedia content with Bluetooth equipped WPAN service points, a wireless local area network and mobile phone networks. The empirical evaluation conducted in the real environment of use shows that the proposed service is meaningful with commercial potential.
Reducing blendshape interference by selected motion attenuation
Authors: J. P. Lewis, Jonathan Mooser, Zhigang Deng, Ulrich Neumann
Venue: Proceedings of the 2005 symposium on Interactive 3D graphics and games (2005)

Blendshapes (linear shape interpolation models) are perhaps the most commonly employed technique in facial animation practice. A major problem in creating blendshape animation is that of blendshape interference: the adjustment of a single blendshape "slider" may degrade the effects obtained with previous slider movements, because the blendshapes have overlapping, non-orthogonal effects. Because models used in commercial practice may have 100 or more individual blendshapes, the interference problem is the subject of considerable manual effort. Modelers iteratively resculpt models to reduce interference where possible, and animators must compensate for those interference effects that remain. In this short paper we consider the blendshape interference problem from a linear algebra point of view. We find that while full orthogonality is not desirable, the goal of preserving previous adjustments to the model can be effectively approached by allowing the user to temporarily designate a set of points as representative of the previous (desired) adjustments. We then simply solve for blendshape slider values that mimic desired new movement while moving these "tagged" points as little as possible. The resulting algorithm is easy to implement and demonstrably reduces cases of blendshape interference found in existing models.
The Answer is 42 of Course
Authors: Thomas Wadlow
Venue: Queue (2005)

Why is security so hard? As a security consultant, I&rsquo;m glad that people feel that way, because that perception pays my mortgage. But is it really so difficult to build systems that are impenetrable to the bad guys?
Hierarchical LU Decomposition-based Preconditioners for BEM
Authors: M. Bebendorf
Venue: Computing (2005)

The adaptive cross approximation method can be used to efficiently approximate stiffness matrices arising from boundary element applications by hierarchical matrices. In this article an approximative LU decomposition in the same format is presented which can be used for preconditioning the resulting coefficient matrices efficiently. If the LU decomposition is computed with high precision, it may even be used as a direct yet efficient solver.
Evaluations of Protein Sequence Alignments using Structural Information
Authors: Andy Auyeung, Ulrich Melcher
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Correct alignment of protein sequences is critical for accurate understanding of the evolution of the protein. Therefore, it is important to know how likely an alignment is correct. Any approach that uses randomized sequences to access significance uses only part of the information inherent in an amino acid sequence. Offset alignment evaluation is a method to model and estimate the confidence of a given protein sequence alignment, which takes into account the inherent information from the protein sequence secondary structures. The confidence of a given alignment is estimated by a significance score based on the set of offset alignments. Finally, we introduce OAE, a Java implementation of the Offset alignment evaluation which is freely available to the public.
On limitations of V.S. Cherniavsky: "on limitations of artificial intelligence" information system 5 (1980), 121--126
Authors: Peter Schefe
Venue: Issue 73 (October 1980) (1980)

There is a natural question the reader of Cherniavsky's publications of the last years may ask: Are there limitations of V.S. Cherniavsky? Cherniavsky's question is still, "whether artificial intelligence is limited in the sense of being separated from intelligence of the human by some natural boundary." He answers it roughly this way: if we assume it is not, we get into trouble. The `Main Assumption' of artificial intelligence is that human thinking is as deterministic as machines are:Given some text t and some evidence i (of t), a deterministic device can (after some time) judge it "true" eventually.
Arabic Stemming Without A Root Dictionary
Authors: Kazem Taghva, Rania Elkhoury, Jeffrey Coombs
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

We have implemented a root-extraction stemmer for Arabic which is similar to the Khoja stemmer but without a root dictionary. Our stemmer was found to perform equivalently to the Khoja stemmer as well as so-called llightm stemmers in monolingual document retrieval tasks performed on the Arabic Trec-2001 collection. A root dictionary, therefore, does not improve Arabic monolingual document retrieval.
Non-euclidean restricted memory level method for large-scale convex optimization
Authors: Aharon Ben-Tal, Arkadi Nemirovski
Venue: Mathematical Programming: Series A and B (2005)

We propose a new subgradient-type method for minimizing extremely large-scale nonsmooth convex functions over &#x201c;simple&#x201d; domains. The characteristic features of the method are (a) the possibility to adjust the scheme to the geometry of the feasible set, thus allowing to get (nearly) dimension-independent (and nearly optimal in the large-scale case) rate-of-convergence results for minimization of a convex Lipschitz continuous function over a Euclidean ball, a standard simplex, and a spectahedron (the set of positive semidefinite symmetric matrices, of given size, with unit trace); (b) flexible handling of accumulated information, allowing for tradeoff between the level of utilizing this information and iteration&#x2019;s complexity. We present extensions of the scheme for the cases of minimizing non-Lipschitzian convex objectives, finding saddle points of convex-concave functions and solving variational inequalities with monotone operators. Finally, we report on encouraging numerical results of experiments with test problems of dimensions up to 66,000.
The Opie compiler from row-major source to Morton-ordered matrices
Authors: Steven T. Gabriel, David S. Wise
Venue: Proceedings of the 3rd workshop on Memory performance issues: in conjunction with the 31st international symposium on computer architecture (2004)

The Opie Project aims to develop a compiler to transform C codes written for row-major matrix representation into equivalent codes for Morton-order matrix representation, and to apply its techniques to other languages. Accepting a possible reduction in performance we seek to compile a library of usable code to support future development of new algorithms better suited to Morton-ordered matrices.This paper reports the formalism behind the OPIE compiler for C, its status: now compiling several standard Level-2 and Level-3 linear algebra operations, and a demonstration of a breakthrough reflected in a huge reduction of L1, L2, TLB misses. Overall performance improves on the Intel Xeon architecture.
Forcing standardization or accommodating diversity?: a framework for applying the WCAG in the real world
Authors: Brian Kelly, David Sloan, Lawrie Phipps, Helen Petrie, Fraser Hamilton
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Since 1999 the W3C's Web Content Accessibility Guidelines (WCAG) have provided a solid basis for implementation of accessible Web design. However it is argued that in the context of evaluation and policymaking, inappropriate reference to the WCAG may lead to serious practical difficulties in implementation and monitoring of an effective accessibility policy. There is a pressing need for a framework that guides appropriate application of the WCAG in a holistic way, taking into account the diversity -- or homogeneity -- of factors such as context of use, audience and audience capability, and access environment. In particular, the current promotion of W3C technologies at the expense of widely used and accessible proprietary technologies may be problematic, as is the apparent reliance of the WCAG on compliant browsing technology.In this paper, a holistic application of the WCAG is proposed by the authors, whereby the context of the Web resource in question and other factors surrounding its use are used to shape an approach to accessible design. Its potential application in a real world environment is discussed.
A Location Management Scheme Using Direction Characteristics of Mobile Terminals in Mobile Communication Networks
Authors: Ui-Sung Song, Joon-Min Gil, Chong-Sun Hwang
Venue: Wireless Personal Communications: An International Journal (2005)

Recently, as the number of mobile terminals (or users) keeps explosively increasing, the location management to track the mobile terminals in mobile communication networks is becoming more important. However, previous schemes have used static location information without any consideration about the moving direction of a mobile terminal. For a fixed paging area, this results in unnecessary pagings, thus increasing the location management cost. In this paper, we propose a new location management scheme using the direction characteristics of a mobile terminal. The direction vector is defined to represent the moving direction of a mobile terminal and to compute a distance from the cell where a location update occurs to the current cell. The offset operation of direction vectors is also presented to represent the position of a mobile terminal in a paging area. This allows the mobile terminal to determine whether a location update will be performed or not. The mobile terminal can also vary its own paging area dynamically according to its moving direction whenever it moves across its paging area. In addition, we develop an analytical model for the proposed scheme which captures the direction characteristics of a mobile terminal based on the Markov model. Analytical results show that the proposed scheme can reduce location management cost by forming a dynamic paging area along the moving direction of a mobile terminal when compared to other schemes.
Evolving interfaces via gradients of geometry-dependent interior Poisson problems: application to tumor growth
Authors: Paul Macklin, John Lowengrub
Venue: Journal of Computational Physics (2005)

We develop an algorithm for the evolution of interfaces whose normal velocity is given by the normal derivative of a solution to an interior Poisson equation with curvature-dependent boundary conditions. We improve upon existing techniques and develop new finite difference, ghost fluid/level set methods to attain full second-order accuracy for the first time in the context of a fully coupled, nonlinear moving boundary problem with geometric boundary conditions (curvature). The algorithm is capable of describing complex morphologies, including pinchoff and merger of interfaces. Our new methods include a robust, high-order boundary condition-capturing Poisson solver tailored to the interior problem, improved discretizations of the normal vector and curvature, a new technique for extending variables beyond the zero level set, a new orthogonal velocity extension technique that is both faster and more accurate than traditional PDE-based approaches, and a new application of Gaussian filter technology ordinarily associated with image processing. While our discussion focuses on two-dimensional problems, the techniques presented can be readily extended to three dimensions. We apply our techniques to a model for tumor growth and present several 2D simulations. Our algorithm is validated by comparison to an exact solution, by resolution studies, and by comparison to the results of a spectrally accurate method boundary integral method (BIM). We go beyond morphologies that can be described by the BIM and present accurate simulations of complex, evolving tumor morphologies that demonstrate the repeated encapsulation of healthy tissue in the primary tumor domain - an effect seen in the growth of real tumors.
A framework for fast 3D solid model exchange in integrated design environment
Authors: Di Wu, Radha Sarma
Venue: Computers in Industry (2005)

Exchanging 3D solid models across engineering applications has become increasingly important to integrated design environments (IDEs). However, transferring models among distributed locations via computer networks usually consumes large amounts of network bandwidth, requires powerful machines, and introduces potentially unacceptable latency. This paper presents a software framework to realize fast solid model exchange in IDEs. In particular, this framework integrates two key components: (a) incremental editing that allows solid models to be edited, modified, and propagated in an incremental form, and (b) progressive streaming that enables solid models to be stored, retrieved, transmitted, and reconstructed in a progressive manner. The benefits of this framework include obtaining real-time interaction with complex geometry, and obviating the burden of transferring large amounts of data over networks.
A groupware environment for transient virtual organization building
Authors: Ludovic Collet, Xavier Le Pallec, Alain Derycke, Frédéric Hoogstoel
Venue: Proceedings of the 15th French-speaking conference on human-computer interaction on 15eme Conference Francophone sur l'Interaction Homme-Machine (2003)

The Reciprocity project aims to provide an environment for inter-organisational collaborations. The main goal of this project, based on a peer-to-peer approach, is to not bother social mechanisms that are inherent in such organisations. The major contributions of this project concern the respect of social hierarchy, resource sharing mechanisms that are less restricted and a reliable reflect of contributions of each participant.
Research at Texas Instruments, Inc.
Authors: William M. Fisher, James A. Hendler, Tom P. Kehler, Paul R. Michaelis, James R. Miller, Brian Phillips, Kenneth M. Ross, Shirley Steele, Harry R. Tennant, Craig Thompson
Venue: Issue 79 (January 1982) (1982)

We are developing a pseudo-parallel, message-passing control structure to allow syntactic, semantic, discourse, and pragmatic information to be accessed at any point in the analysis. The advantages of this approach are two-fold. Firstly, partial results can be exchanged among components in a timely manner to be used to constrain the search space of the components. Secondly, the control structure will permit the nature and context of errors in ill-formed input to be broadcast to other components to find ways to circumvent the error but still comprehend the input. The system is being applied to an analysis of TI's patent descriptions.
A robust method for recognition of monetary amount printed by checkwriter
Authors: Masashi Koga, Ryuji Mine, Tsukasa Yasue, Hiroshi Sako, Hiromichi Fujisawa
Venue: Systems and Computers in Japan (2004)

We propose a new method to recognize monetary amounts printed by checkwriters. We applied a character segmentation method robust to noise and a bottom-up parsing for postprocessing. In the proposed method, the input image is segmented both horizontally and vertically in the presegmentation step. A context-free grammar describes the linguistic constraints in the monetary amounts. We devised a new bottom-up parsing technique that interprets the results of character classification. We tested the validity of the new method using 1314 images. The correct ratio was 72.7&percnt;, which is 8.4 points higher than that of the conventional method. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(7): 49&ndash;60, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10616
Mapping Low-Level Features to High-Level Semantic Concepts in Region-Based Image Retrieval
Authors: Wei Jiang, Kap Luk Chan, Mingjing Li, Hongjiang Zhang
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In this paper, a novel offline supervised learning method is proposed to map low-level visual features to high-level semantic conceptsfor region-based image retrieval. The contributions of thispaper lie in threefolds. ( I ) For each semantic concept, a set of low-level tokens are extracted fmm the segmented regions of training images. Those tokens capture the representative information for describing the semantic meaning of that concept; (2)A set of posteriors are generated based on the low-level tokens through pairwise classification, which denote the probabilities of images belonging to the semantic concepts. The posteriors are treated as high-level features that connect images with high-level semantic concepts. Long-term relevance feedback learning is incorporated to provide the supervisory information needed in the above offline learning process, including the concept information and the relevant training setfor each concept; (3)An integrated algorithm is implemented to combine two kinds of informationfor retrieval: the information from the offline feature-to-concept mapping process and the high-level semantic information from the long-tern learned memory. Experimental evaluation on 10,000 images proves the effectiveness of our method.
MPLS VPN Security
Authors: Michael H Behringer, Monique Morrow
Venue:  (2005)

A practical guide to hardening MPLS networks Define "zones of trust" for your MPLS VPN environment Understand fundamental security principles and how MPLS VPNs work Build an MPLS VPN threat model that defines attack points, such as VPN separation, VPN spoofing, DoS against the network's backbone, misconfigurations, sniffing, and inside attack forms Identify VPN security requirements, including robustness against attacks, hiding of the core infrastructure, protection against spoofing, and ATM/Frame Relay security comparisons Interpret complex architectures such as extranet access with recommendations of Inter-AS, carrier-supporting carriers, Layer 2 security considerations, and multiple provider trust model issues Operate and maintain a secure MPLS core with industry best practices Integrate IPsec into your MPLS VPN for extra security in encryption and data origin verification Build VPNs by interconnecting Layer 2 networks with new available architectures such as virtual private wire service (VPWS) and virtual private LAN service (VPLS) Protect your core network from attack by considering Operations, Administration, and Management (OAM) and MPLS backbone security incidentsMultiprotocol Label Switching (MPLS) is becoming a widely deployed technology, specifically for providing virtual private network (VPN) services. Security is a major concern for companies migrating to MPLS VPNs from existing VPN technologies such as ATM. Organizations deploying MPLS VPNs need security best practices for protecting their networks, specifically for the more complex deployment models such as inter-provider networks and Internet provisioning on the network.MPLS VPN Security is the first book to address the security features of MPLS VPN networks and to show you how to harden and securely operate an MPLS network. Divided into four parts, the book begins with an overview of security and VPN technology. A chapter on threats and attack points provides a foundation for the discussion in later chapters. Part II addresses overall security from various perspectives, including architectural, design, and operation components. Part III provides practical guidelines for implementing MPLS VPN security. Part IV presents real-world case studies that encompass details from all the previous chapters to provide examples of overall secure solutions.Drawing upon the authors' considerable experience in attack mitigation and infrastructure security, MPLS VPN Security is your practical guide to understanding how to effectively secure communications in an MPLS environment. "The authors of this book, Michael Behringer and Monique Morrow, have a deep and rich understanding of security issues, such as denial-of-service attack prevention and infrastructure protection from network vulnerabilities. They offer a very practical perspective on the deployment scenarios, thereby demystifying a complex topic. I hope you enjoy their insights into the design of self-defending networks." -Jayshree V. Ullal, Senior VP/GM Security Technology Group, Cisco Systems®
A Novel Approach of Palm-Line Extraction
Authors: Xiangqian Wu, Kuanquan Wang, David Zhang
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Palm-lines, including the principal lines and wrinkles, can describe a palmprint clearly. This paper presents a novel approach of palm-line extraction for the online palm-prints. This approach is composed of two stages: coarse-level extraction stage and fine-level extraction stage. In the first stage, morphological operations are used to extract palm-lines in different directions. In the second stage, for each extracted line, a recursive process is devised to further extract and trace the palm-line using the local information of the extracted part. Experimental results show that the proposed approach is suitable for palm-line extraction.