ppxscal/embedding_network huggingface dataset:
Fuzzy multiobjective decision making for navigation of mobile robots in dynamic, unstructured environments
Authors: Earl B. Smith, Reza Langari
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2003)

In this work we apply the notion of fuzzy multi-objective decision making to the problem of navigation of mobile robots in unstructured environments such as lunar and planetary surfaces and military zones. In particular the proposed approach is concerned with multi-objective decision making in a dynamic setting where limited a priori information, say only a coarse image of the robot surroundings may be available. To this end, the proposed approach first constructs a coarse motion plan and subsequently employs a sensor-based navigation scheme based on fuzzy multi-objective decision making to detect any intervening obstacles, dynamically define its objectives and preferences based on the relative locations of the obstacles, and move towards is goal. This process is comparable to human decision-making where an initial assessment of the surroundings and one's own sensing capability provide the basis for navigating and moving around in unstructured environments. In particular it is shown that the proposed approach offers a viable alternative to existing approaches to mobile robotics by providing a flexible architecture for addressing the complexity of motion planning and navigation in dynamic environments.
Extending Attribute Grammars with Collection Attributes--Evaluation and Applications
Authors: Eva Magnusson, Torbjorn Ekman, Gorel Hedin
Venue: Proceedings of the Seventh IEEE International Working Conference on Source Code Analysis and Manipulation (2007)

Collection attributes, as defined by Boyland, can be used as a mechanism for concisely specifying cross-referencelike properties such as callee sets, subclass sets, and sets of variable uses. We have implemented collection attributes in our declarative meta programming system JastAdd, and used them for a variety of applications including devirtualization analysis, metrics, and flow analysis. We propose a series of evaluation algorithms for collection attributes, and compare their performance and applicability. The key design criteria for our algorithms are 1) that they work well with demand evaluation, i.e., defined properties are computed only if they are actually needed for a particular source code analysis problem and a particular source program, and 2) that they work in the presence of circular (fixed-point) definitions that are common for many source code analysis problems, e.g., flow analysis. We show that the best algorithms work well on large practical problems, including the analysis of large Java programs.
Application of Principal Component Analysis-Artificial Neural Network in Near Infrared Spectroscopy for Determination of Compound Rifampicin Tablets
Authors: Jia-hui Lu, Wei-liang Guo, Yi-bo Zhang, Ting-ting Li, Yan-zhen Wang, Li-rong Teng
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 03 (2007)

We have applied principal component analysis -artificial neural network (PCA-ANN) in near infrared (NIR) spectroscopy to synchronous and rapid determining the contents of rifampicin (RMP), isoniazide (INH) and pyrazinamide (PZA) in compound rifampicin tablets. Back-Propagation (BP) Networks which adopt Levenberg- Marquardt training algorithm have been developed. Via analyzing the NIR spectra matrix by principal component analysis (PCA) method, we have obtained the principal components (PC) scores. The original NIR spectra and PC scores were respectively used as input data. These developed BP Networks have been optimized by selecting suitable topologic parameters and the best numbers of training. Compare with original NIR spectra, using the PC scores as input data, the capabilities of BP networks were much better. Using these optimized BP Networks for predicting the contents of RMP, INH and PZA in prediction set, the root mean square error of prediction (RMSEP) are 0.00423, 0.00320 and 0.00608. These results are so satisfied and NIR spectroscopy technology is convenient, rapid, no pretreatment and no pollution that this method could be popularized in the in situ measurement and the on-line quality control for drug production.
Threshold SKI Protocol for ID-based Cryptosystems
Authors: Ashutosh Saxena
Venue: Proceedings of the Third International Symposium on Information Assurance and Security (2007)

Traditional public key cryptography uses certificates to bind the users with their public keys and are considered the best alternative for key distribution, but requires to have a very involved key management process. Identity based cryptography makes the key management easier but suffers from the key escrow problem and requires secure channel to issue the private keys to the users. Key issuing protocols deal with secret key issuing (SKI) process to overcome the two problems. We present an efficient and secure key issuing protocol which enables the identity based cryptosystems to be more acceptable and applicable in the real world. In the protocol, neither key generating center nor key privacy authority can impersonate the users to obtain the private keys. Performance and security analysis are being carried out for the protocol and is shown that it is efficient and secure against replay, man-in-the-middle and insider attacks.
Robust stability of fuzzy feedback linearization control system for Takagi-Sugeno fuzzy model
Authors: Young-Wan Cho, Sung-Ryul Lee, Kyung-Ok Park, Mignon Park
Venue: Journal of Intelligent Fuzzy Systems: Applications in Engineering and Technology (2001)

In many practical applications, dynamic systems to be controlled have uncertain parameters. To cope with the parametric uncertainties, analysis and design methods of a robust control scheme are proposed using the feedback linearization of a class of nonlinear systems represented by Takagi-Sugeno fuzzy model. A fuzzy feedback linearization controller is proposed to stabilize the nominal fuzzy system, and a sufficient condition is derived to guarantee the stability of the closed-loop system with bounded parameter uncertainties. For the systems with bounded uncertainty, we can design a robust fuzzy controller by choosing the control parameters satisfying the robust stability condition. Because the design scheme is not a trial and error manner, it provides us freedom of selecting the control parameters showing the desired characteristics. The design methodologies are illustrated by examples and the simulation results are given to verify the validity and effectiveness of the proposed control scheme.
Simultaneous Layout Style and Logical Entity Recognition in a Heterogeneous Collection of Documents
Authors: S. Chen, S. Mao, G. Thoma
Venue: Proceedings of the Ninth International Conference on Document Analysis and Recognition - Volume 01 (2007)

Logical entity recognition in heterogeneous collections of document page images remains a challenging problem since the performance of traditional supervised methods de- grades dramatically in case of many distinct layout styles. In this paper we present an unsupervised method where lay- out style information is explicitly used in both training and recognition phases. We represent the layout style, local fea- tures, and logical labels of physical regions of a document compactly by an ordered labeled X-Y tree. Style dissimi- larity of two document pages is represented by the distance between their respective trees. During the training phase, document pages with true logical labels in training set are classified into distinct layout styles by unsupervised clus- tering. During the recognition phase, the layout style and logical entities of an input document are recognized simul- taneously by matching the input tree to the trees in closest- matched layout style cluster of training set. Experimental results show that our algorithm is robust with both balanced and unbalanced style cluster sizes, zone over-segmentation, zone length variation, and variation in tree representations of the same layout style.
Tlink-tree: main memory index structure with concurrency control and recovery
Authors: Jan Lindström
Venue: Proceedings of the third conference on IASTED International Conference: Advances in Computer Science and Technology (2007)

While B+trees are the most popular index structure for disk databases, the T-tree has been widely accepted as a promising index structure for main memory databases. For over two decades the speed of CPUs has increased faster than the speed of the main memory. Therefore, the speed gap of the CPU and memory has rapidly become steeper, and memory access has become the new bottleneck in databases. In this paper we explore concurrency control and recovery in a new index structure Tlink-tree which enhances the cache usage, reduces the number of rotate operations and the overhead required for balancing the tree by delayed split and deletion.
Internal fixation of the spine in traumatic and scoliotic cases. The potential of pedicle screws
Authors: K. Van Brussel, J. Vander Sloten, R. Van Audekercke, G. Fabry
Venue: Technology and Health Care (1996)

Internal fixation techniques are in common used to stabilize vertebral fractures and correct severe scoliosis. Consolidation of injured vertebrae with neighbouring intact vertebra is the goal in the former case whilst fusion of the vertebrae in a corrected position is aimed at in the latter case. Degenerative spine diseases are not considered in this paper. Classical instrumentation consists of rods (e.g., Cotrel-Dubousset, Harrington, Luque-Galveston) attached to the bone by means of hooks or wires. More recently, transpedicular screws are introduced as an alternative bone/implant interface. Comparing the results of several studies, the posterior pedicle screw based devices demonstrate the ability to produce the most rigid constructs. However, the insertion of pedicle screws implicates a relatively high complication risk and its succes strongly depends on the experience of the surgeon. Incorrect drilled holes or malplacement of the screws can result in nerve root injuries and fracture of the pedicle. Studies reported complication ratios up to 30% with substantial neurological implications. A certain degree of automation of the critical actions may be necessary to enhance the safety of pedicle screw insertion. Two techniques of computer assisted spine surgery are compared. Both techniques permit a computer assisted surgical planning based on CT images. During operation the first system permanently observes the position of the drill relative to the spine and informs the surgeon on the deviation of the actual drill path to the planned drill path. The second system uses a pre-operative surgical planning to design and construct a mechanical drill guide, fitting perfectly on the patient&rsquo;s spine.
Controller Design and Verification for A Pipeline Image Processor based on An Extended Petri net
Authors: Katsumi Wasaki, Toshiaki Harai, Tamotsu Hayashi, Kenichi Arai
Venue: Proceedings of the 10th Euromicro Conference on Digital System Design Architectures, Methods and Tools (2007)

We describe a case study of the design and verification of a parallel and pipe-lined image processing unit based on an extended Petri net, which is called a Logical Colored Petri net (LCPN). This is suitable for Flexible-Manufacturing System (FMS) modeling and discussion of structural properties. LCPN is another family of colored p/t-net(CPN) with the addition of the following features: integer value assignment of marks, representation of firing conditions as marks' value based formulae, and coupling of output procedures with transition firing. Therefore, to study the behavior of a system modeled with this net, we provide a means of searching the reachability tree for markings.
Research on Logical Function Blocks in ForCES-Based Routers
Authors: Ligang Dong, Bin Zhuge, Weiming Wang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

ForCES brings flexible, programmable, and cost-effective advantages over traditional architectures. According to drafts from ForCES, resources in the forwarding element are described in the form of Logical Function Blocks (LFBs). In this paper, we carry out a detailed study on LFBs. We analyze key technologies including definition and operation of LFBs. Based on these technologies, we construct a ForCES-based router (called ForTER). Experiments on ForTER have demonstrated proposed technologies on LFBs.
Tuning the dielectric properties of hafnium silicate films
Authors: Christian Fachmann, Lothar Frey, Stephan Kudelka, Tim Boescke, Stefan Nawka, Elke Erben, Theodor Doll
Venue: Microelectronic Engineering (2007)

The influence of Si concentration in hafnium silicate dielectrics on thermal stability and dielectric permittivity was analyzed. A phase diagram was developed using GIXRD and FTIR measurement. The stabilization of the ''higher-k'' cubic/tetragonal phase for annealing temperatures up to 1000^oC with a steady increase in capacitance was demonstrated for Hf"0"."9"4Si"0"."0"6O"2 films. It was also shown that the stabilization of nano-crystalline Hf"0"."8"0Si"0"."2"0O"2 films can be realized for annealing temperatures up to 900^oC. The influence of TiN electrodes on the dielectric constant and the leakage current characteristic was also investigated. A permittivity increase for annealing temperatures up to 1000^oC without degradation of leakage current was shown.
Revenue logics of mobile entertainment software: observations from companies producing mobile games
Authors: Risto Rajala, Matti Rossi, Virpi Kristiina Tuunainen, Janne Vihinen
Venue: Journal of Theoretical and Applied Electronic Commerce Research (2007)

While growing at a fast phase, mobile gaming industry is facing a transformation both in terms of technical infrastructures as well as business models. At the users' end, formerly preferred specific game consoles are increasingly being replaced by mobile phone platforms. From the game developers' perspective, the new possibilities to distribute games over mobile phone networks as well as over the Internet, affect both the viable partner relationships and possible revenue stream options. In this paper we introduce analytical tools to evaluate business models of software companies producing mobile games. With the help of these tools, we explore and analyze the revenue logics and related product distribution models of four companies producing mobile games to the international market. The results indicate that even though the fast growing market offers a plethora of opportunities to agile software companies, the revenue models are governed by telecom-operators, who are currently reaping the largest benefits from the business.
A study of the development of students' visualizations of program state during an elementary object-oriented programming course
Authors: Jorma Sajaniemi, Marja Kuittinen, Taina Tikansalo
Venue: Journal on Educational Resources in Computing (JERIC) (2008)

Students' understanding of object-oriented (OO) program execution was studied by asking students to draw a picture of a program state at a specific moment. Students were given minimal instructions on what to include in their drawings in order to see what they considered to be central concepts and relationships in program execution. Three drawing tasks were given at different phases of an elementary OO programming course where two animation tools were used for program visualization. The drawings were analyzed for their overall approaches and their detailed contents. There was a large variability in the overall approaches and the popularity of various approaches changed during the course. The results indicate that students' mental representations of OO concepts and program execution not only grow as new material is covered in teaching, but they also change. The first drawings treat methods as having primarily a static existence; later methods are seen as dynamic invocations that call each other. The role of classes in program execution fluctuates during learning, indicating problems in locating the notion of class with respect to, for example, objects. Two major sources of problems that manifested in many different forms were the relationship between object and method, and the role of the main method with respect to program state. Other problems were caused by overly simplistic understanding of object identification and improper use of application domain knowledge.
The Research on Hierarchical Risk Element Transmission Theory Based on Fuzzy Theory and Data Mining
Authors: Cunbin Li, Jianjun Wang
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 01 (2007)

The traditional analytic hierarchy process (AHP) models are usually based on the precise data and it is difficult to handle the uncertainty evaluation problems. Currently, the studies of AHP models usually evaluate the uncertainty problems based on fuzzy or interval number theory but the evaluation results can not provide complete decision information to the decision makers satisfactorily. Hierarchical Risk Element Transmission (HRET) theory is a new idea of the uncertain evaluation problems. This paper constructs a frame of HRET, at first, fuzzy extended analytic hierarchy process (FEAHP) is used to decide the weight of HRET model, then the triangle fuzzy numbers which is used to solve HRET problems is acquired by the data mining technology based on history data. By doing this, the concluded results can provide more complete information to the decision makers with the consideration of the risk.
Compressed Suffix Trees with Full Functionality
Authors: Kunihiko Sadakane
Venue: Theory of Computing Systems (2007)

We introduce new data structures for compressed suffix trees whose size are linear in the text size. The size is measured in bits; thus they occupy only O(n log|A|) bits for a text of length n on an alphabet A. This is a remarkable improvement on current suffix trees which require O(n log n) bits. Though some components of suffix trees have been compressed, there is no linear-size data structure for suffix trees with full functionality such as computing suffix links, string-depths and lowest common ancestors. The data structure proposed in this paper is the first one that has linear size and supports all operations efficiently. Any algorithm running on a suffix tree can also be executed on our compressed suffix trees with a slight slowdown of a factor of polylog(n).
Hybrid Computation 1976 and Its Future
Authors: A. I. Rubin
Venue: Computer (1976)

Simply defined, a hybrid computer is the sophisticated combination of a real-time interrupt-oriented digital computer with one or more parallel analog processors. Each device is used so as to exploit its own best advantage toward the orderly, rapid solution of the problem at hand in a synergistic manner. This typically involves the preparation and use of mathematical models that dynamically describe the system being studied, using both algebraic and differential relations.
Special Feature Exhaustive Cryptanalysis of the NBS Data Encryption Standard
Authors: W. Diffie
Venue: Computer (1977)

For centuries, cryptography has been a valuable asset of the military and diplomatic communities. Indeed, it is so valuable that its practice has usually been shrouded in secrecy and mystery.
Unsupervised Image Segmentation Using Automated Fuzzy c-Means
Authors: Supatra Sahaphong, Nualsawat Hiransakolwong
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

An unsupervised fuzzy clustering technique, Fuzzy c-means (FCM) clustering algorithm has been widely used in image segmentation. However, the conventional FCM algorithm must be estimated by expertise users to determine the cluster numbers. To overcome the limitation of FCM algorithm, an automated fuzzy c-mean (AFCM) algorithm is presented in this paper. The proposed algorithm initiates the first two centroids of clusters by a method based on Otsu algorithm and automatically determines the appropriate cluster number for image segmentation. The performance of the proposed technique has been tested with reference to conventional FCM. The experimental results demonstrate that AFCM can spontaneously estimate the appropriate number of clusters and its performance is faster convergence than the performance of the conventional FCM. Keywords : Fuzzy c-Means, Image segmentation, Clustering, Otsu algorithm.
Capability based Secure Access Control to Networked Storage Devices
Authors: Michael Factor, Dalit Naor, Eran Rom, Julian Satran, Sivan Tal
Venue: Proceedings of the 24th IEEE Conference on Mass Storage Systems and Technologies (2007)

Today, access control security for storage area networks (zoning and masking) is implemented by mechanisms that are inherently insecure, and are tied to the physical network components. However, what we want to secure is at a higher logical level independent of the transport network; raising security to a logical level simplifies management, provides a more natural fit to a virtualized infrastructure, and enables a finer grained access control. In this paper, we describe the problems with existing access control security solutions, and present our approach which leverages the OSD (Object-based Storage Device) security model to provide a logical, cryptographically secured, in-band access control for today's existing devices. We then show how this model can easily be integrated into existing systems and demonstrate that this in-band security mechanism has negligible performance impact while simplifying management, providing a clean match to compute virtualization and enabling fine grained access control.
Toward a Standard Hardware Description Language
Authors: Karl Lieberherr
Venue: IEEE Design Test (1985)

A hardware description language should be simple, expressive, orthogonal, easy to read, and extendable. It should have associatedefficient, user-friendly tools that produce good results, and it should have functional, structural and layout semantics.Zeus satisfies most of these requirements and therefore its features should be included in any HDL proposed as a standard.Zeus and its recent developments?its close integration with Modula-2 and its implementation in the context of a metaprogrammingenvironment?are presented here. Two example circuits, a comparator circuit and a music generation circuit, illustrate someessential features of Zeus. A number of CAD tools that will use Zeus are under development, and Zeus has been benchmarkedwith over 40 design examples. 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