ppxscal/embedding_network huggingface dataset:
Some averaging methods in the micromechanics of composite materials with periodic structure
Authors: Horatiu Teodorescu, Sorin Vlase, Ioan Candea, Dana Luca Motoc
Venue: Proceedings of the 10th WSEAS International Conference on Automatic Control, Modelling & Simulation (2008)

The paper presents some averaging methods that authors have been used in the micromechanics of pre-impregnated composite materials like Sheet- and Bulk Molding Compounds, in order to predict their basic elastic properties. These averaging methods are applied to compute the homogenized elastic coefficients for Sheet Molding Compounds with various fibers volume fractions. A comparison between theoretical approach and experimental data is presented.
Genetic Granular Neural Networks
Authors: Yan-Qing Zhang, Bo Jin, Yuchun Tang
Venue: Proceedings of the 4th international symposium on Neural Networks: Part II--Advances in Neural Networks (2007)

To make interval-valued granular reasoning efficiently and optimize interval membership functions based on training data effectively, a new Genetic Granular Neural Network (GGNN) is desinged. Simulation results have shown that the GGNN is able to extract useful fuzzy knowledge effectively and efficiently from training data to have high training accuracy.
A Method for Ensuring Consistency of Software Design Information in Retrospective Computer Validation
Authors: Masakazu Takahashi, Satoru Takahashi, Yoshikatsu Fujita
Venue: Proceedings of the 12th international conference on Knowledge-Based Intelligent Information and Engineering Systems, Part II (2008)

This paper proposes a method for ensuring consistency of software design information when we conduct Retrospective Computer Validation (RCV). RCV is proof tasks that quality of in-service software related to drug manufacturing (DMSW) is adequate. When we conduct RCV in first time, we show design adequacy of DMSW to collect existing documents and running records. When we remodel DMSW, we show design adequacy to develop new documents and conduct enough tests. It is difficult to ensure consistency because there are some differences of description items and fineness between existing and new documents. This problem made RCV enforcement difficult. We will solve this problem to conduct following countermeasures; 1) define document architecture, 2) define description items and contents in every document, and 3) implement database that manages description items and relationships between documents. Consequently, we can clarify affected range, when some remodeling occurs. To modify design information in affected range, we can maintain adequacy of design information of DMSW. As the result, we can conduct RCV smoothly.
Meta-Logical Frameworks and Formal Digital Libraries
Authors: Carsten Schürmann
Venue: Verified Software: Theories, Tools, Experiments: First IFIP TC 2/WG 2.3 Conference, VSTTE 2005, Zurich, Switzerland, October 10-13, 2005, Revised Selected Papers and Discussions (2005)

Software verification research has become once again a very exciting research area and simultaneously a melting pot for many different subareas within computer science. In this position paper, I emphasize two of the areas that I am particularly interested in and consider to be of significant importance to this endeavor; metalogical frameworks and formal digital libraries.
Multi-label Lazy Associative Classification
Authors: Adriano Veloso, Wagner Meira,  Jr., Marcos Gonçalves, Mohammed Zaki
Venue: Proceedings of the 11th European conference on Principles and Practice of Knowledge Discovery in Databases (2007)

Most current work on classification has been focused on learning from a set of instances that are associated with a single label (i.e., single-label classification). However, many applications, such as gene functional prediction and text categorization, may allow the instances to be associated with multiple labels simultaneously. Multi-label classification is a generalization of single-label classification, and its generality makes it much more difficult to solve.Despite its importance, research on multi-label classification is still lacking. Common approaches simply learn independent binary classifiers for each label, and do not exploit dependencies among labels. Also, several small disjuncts may appear due to the possibly large number of label combinations, and neglecting these small disjuncts may degrade classification accuracy. In this paper we propose a multi-label lazy associative classifier, which progressively exploits dependencies among labels. Further, since in our lazy strategy the classification model is induced on an instance-based fashion, the proposed approach can provide a better coverage of small disjuncts. Gains of up to 24% are observed when the proposed approach is compared against the state-of-the-art multi-label classifiers.
Propositional Clausal Defeasible Logic
Authors: David Billington
Venue: Proceedings of the 11th European conference on Logics in Artificial Intelligence (2008)

Defeasible logics are non-monotonic reasoning systems that have efficient implementations and practical applications. We list several desirable properties and note that each defeasible logic fails to have some of these properties. We define and explain a new defeasible logic, called clausal defeasible logic (CDL), which has all these properties. CDL is easy to implement, consistent, detects loops, terminates, and has a range of deduction algorithms to cater for a range of intuitions.
A Testing Framework for Mobile Computing Software
Authors: Ichiro Satoh
Venue: IEEE Transactions on Software Engineering (2003)

We present a framework for testing applications for mobile computing devices. When a device is moved into and attached to a new network, the proper functioning of applications running on the device often depends on the resources and services provided locally in the current network. This framework provides an application-level emulator for mobile computing devices to solve this problem. Since the emulator is constructed as a mobile agent, it can carry applications across networks on behalf of its target device and allow the applications to connect to local servers in its current network in the same way as if they had been moved with and executed on the device itself. This paper also demonstrates the utility of this framework by describing the development of typical network-dependent applications in mobile and ubiquitous computing settings.
Object-Oriented Heterogeneous Database for Materials Science
Authors: David Hansen, David Maier, James Stanley, Jonathan Walpole
Venue: Scientific Programming (1992)

As a part of the scientific database research underway at the Oregon Graduate Institute, we are collaborating with materials scientists in the research and development of an extensible modeling and computation environment for materials science. Materials scientists are prolific users of computers for scientific research. Modeling techniques and algorithms are well known and refined, and computerized databases of chemical and physical property data abound. However, applications are typically developed in isolation, using information models specifically tailored for the needs of each application. Furthermore, available computerized databases in the form of CDs and on-line information services are still accessed manually by the scientist in an off-line fashion. Thus researchers are repeatedly constructing and populating new custom databases for each application. The goal of our research is to bridge this gulf between applications and sources of data. We believe that object-oriented technology in general and data-bases in particular, provide powerful tools for transparently bridging the gap between programs and data. An object-oriented database that not only manages data generated by user applications, but also provides access to relevant external data sources can be used to bridge this gap. An object-oriented database for materials science data is described that brings together data from heterogeneous non-object-oriented sources and formats, and presents the user with a single, uniform object-oriented schema that transparently integrates these diverse databases. A unique multilevel architecture is presented that provides a mechanism for efficiently accessing both heterogeneous external data sources and new data stored within the database.
Bounding Demand Paging Costs in Fixed Priority Real-Time Systems
Authors: Young-Ho Lee, Hoyoung Hwang, Kanghee Kim, Sung-Soo Lim
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In real-time systems, demand paging has not been used since worst case performance analysis technique for demand paging is not available. In this paper, we propose a technique to obtain the worst case bound on the demand paging costs and devise a worst case response time analysis framework considering the demand paging costs. We divide the technique into two different methods, DP-Pessimistic and DP-Accurate, depending on the accuracy and the complexity of analysis. DP-Accurate considers the page reuses among task instances and thus gives more accurate analysis results. We evaluate the accuracy of the proposed techniques comparing the analysis results from DP-Accurate and DP-Pessimistic.
Evaluation of Semantic and Social Technologies for Digital Libraries
Authors: Sebastian Ryszard Kruk, Ewelina Kruk, Katarzyna Stankiewicz
Venue: Proceedings of the 12th European conference on Research and Advanced Technology for Digital Libraries (2008)

Libraries are the tools we use to learn and to answer our questions. The quality of our work depends, among others, on the quality of the tools we use. Recently, the semantic web and social networking technologies are being introduced to the digital libraries domain. In this article we present the results of an evaluation of social and semantic end-user information discovery services for the digital libraries.
Image Auto-Mosaic for Large Angle of Obliquity Close-Range Sequential Images to Realize Cyber City
Authors: Chang Li, Jinlai Guo, Yu Xia
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Image mosaic technique is used to create vast scene images and panoramic images. It has widespread use value in the cultural heritage protection and virtual reality field. As we know, there are many methods of image mosaic, such as feature points and binary image region matching, etc. However, the traditional processing methods always ignore speed or precision or practical scale; that is to say, they are unlikely to give attention to two or more things. In order to achieve much better and optimal effect of image mosaic, we propose a model of least square adjustment, which is similar to the strip block adjustment in traditional Aerophotogrammetry. This model determines the relatively spatial relationship of the image facade texture. Experimental results show that it is a robust, efficient and practical image mosaics algorithm. Furthermore, this algorithm expands the applicable scope of the transitional the strip block adjustment in Aerophotogrammetry.
CyberIR --- A Technological Approach to Fight Cybercrime
Authors: Shihchieh Chou, Weiping Chang
Venue: Proceedings of the IEEE ISI 2008 PAISI, PACCF, and SOCO international workshops on Intelligence and Security Informatics (2008)

Fighting cybercrime is an international engagement. Therefore, the understanding and cooperation of legal, organizational and technological affairs across countries become an important issue. Many difficulties exist over this international cooperation and the very first one is the accessing and sharing of related information. Since there are no standards or unification over these affairs across countries, the related information which is dynamically changing and separately stored in free text format is hard to manage. In this study, we have developed a method and information retrieval (IR) system to relieve the difficulty. Techniques of vector space model, genetic algorithm (GA), relevance feedback and document clustering have been applied.
A System Model for Real-Time Sensorimotor Processing in Brain
Authors: Yutaka Sakaguchi
Venue: Neural Information Processing: 14th International Conference, ICONIP 2007, Kitakyushu, Japan, November 13-16, 2007, Revised Selected Papers, Part I (2007)

The present paper addresses a general diagram to investigate the real-time parallel computation mechanism in the brain, using an idea of "Gantt chart." This diagram explicitly represents the temporal relationship between the computations running in various functional modules in the brain, and helps us to understand how the brain computation proceeds along the time. The author illustrates how we can utilize this diagram, taking a motor planning model of reaching movement as an example. Moreover, the author discusses the mechanism of intra- and inter-module computations on this diagram and addresses a tentative view that can explain the relationship between the movement variability and reaction time.
Object Recognition with Discriminative Elastic Grids
Authors: Krzysztof Slot, Hubert Nowak
Venue: Proceedings of the 2008 19th International Conference on Systems Engineering (2008)

The following paper presents a concept of Discriminative Elastic Grids (DEG) – an object recognition approach derived from the Deformable Template paradigm. DEG is an array of appropriately preset nodes, which interact with each other and with an image. Node information is derived to ensure distinctive grid deformations for objects of different categories. Grid deformations are summarized using descriptors, determined using supervised-PCA analysis of matched-grid node displacements. Speech-reading hasbeen selected as an application for experimental verification of the proposed concept. It has been shown that DEG-based representation of phone images provides high recognition rates for the considered, difficult image processing task.
Utilizing acoustic propagation delay to design MAC protocols for underwater wireless sensor networks
Authors: Peng Guo, Tao Jiang, Guangxi Zhu, Hsiao-Hwa Chen
Venue: Wireless Communications Mobile Computing (2008)

Long propagation delay is one of the most important characteristics in underwater wireless sensor networks (UWSNs) and poses a great challenge for medium access control (MAC) protocol design, especially for contention-based MAC protocols due to intolerable delay caused by unpredictable retransmissions in UWSNs. Recently, some MAC protocols for UWSNs have been suggested in the literature, and most of them are based on random access with their capabilities to compensate propagation delay. However, two issues should still be resolved in these protocols: (a) they need to make measurements to realize duty cycle synchronization and (b) packet collisions exist, which not only reduce the throughput (thus increasing delays) but also waste energy. In this paper, we propose a novel MAC protocol explicitly designed for UWSNs, which makes the best use of the propagation delay to resolve collision problem and reduce overhead of control-packet to save energy. The proposed MAC protocol can assure that the number of retransmissions is not more than one. To validate the analytical results, simulations have been conducted to show that the proposed MAC protocol can offer a low energy consumption while avoiding collisions in UWSNs. Copyright &copy; 2008 John Wiley & Sons, Ltd.
A Column Generation Based Destructive Lower Bound for Resource Constrained Project Scheduling Problems
Authors: J. Marjan Akker, Guido Diepen, J. A. Hoogeveen
Venue: Proceedings of the 4th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems (2007)

In this paper we present a destructive lower bound for a number of resource constrained project scheduling (RCPS) problems, which is based on column generation. We first look at the problem with only one resource. We show how to adapt the procedure by Van den Akker et al. [1] for the problem of minimizing maximum lateness on a set of identical, parallel machines such that it can be used to solve these RCPS problems. We then consider a number of variants of the RCPS problem with one or more resources and show how these can be solved by our approach. Because of the close relation between RCPS and the cumulative constraint in constraint programming, our method can be used as an efficient filtering algorithm for the cumulative constraint as well.
Dynamic Aggregation of Relational Attributes Based on Feature Construction
Authors: Rayner Alfred
Venue: Proceedings of the 12th East European conference on Advances in Databases and Information Systems (2008)

The importance of input representation has been recognised already in machine learning. This paper discusses the application of genetic-based feature construction methods to generate input data for the data summarisation method called Dynamic Aggregation of Relational Attributes (DARA). Here, feature construction methods are applied in order to improve the descriptive accuracy of the DARA algorithm. The DARA algorithm is designed to summarise data stored in the non-target tables by clustering them into groups, where multiple records stored in non-target tables correspond to a single record stored in a target table. This paper addresses the question whether or not the descriptive accuracy of the DARA algorithm benefits from the feature construction process. This involves solving the problem of constructing a relevant set of features for the DARA algorithm by using a genetic-based algorithm. This work also evaluates several scoring measures used as fitness functions to find the best set of constructed features.
Services Mashups: The New Generation of Web Applications
Authors: Djamal Benslimane, Schahram Dustdar, Amit Sheth
Venue: IEEE Internet Computing (2008)

Web services are becoming a major technology for deploying automated interactions between distributed and heterogeneous applications, and for connecting business processes. Service mashups indicate a way to create new Web applications by combining existing Web resources utilizing data and Web APIs. They facilitate the design and development of novel and modern Web applications based on easy-to-accomplish end-user service compositions.
Volume Estimation of Small Particles Using Three-Dimensional Reconstruction from Multiple Views
Authors: Eduardo Castillo-Castaneda, Christelle Turchiuli
Venue: Proceedings of the 3rd international conference on Image and Signal Processing (2008)

This work presents a methodology and experimental results about the three dimensional reconstruction of small objects from an image sequence. The three dimensional model obtained from this methodology allows the volume estimation of particles less than 1 mm. More precisely, the particles studied were generated by an agglomeration process from milk powder. To validate this methodology, a mechanical device with six degrees of freedom was built; it allows the montage of the image acquisition system as well as the turning system that rotates the particles. The algorithm for image processing and volume estimation was implemented using a high level language.
QoS-Aware Web Service Compositions Using Non-intrusive Policy Attachment to BPEL
Authors: Anis Charfi, Rania Khalaf, Nirmal Mukhi
Venue: Proceedings of the 5th international conference on Service-Oriented Computing (2007)

Supporting Quality of Service properties in BPEL processes is essential to enable Web Service based production workflows. In fact, when implementing a Web Service composition with a BPEL process, appropriate means are needed to express and enforce various QoS properties such as security, reliable messaging, and transactions.In this paper, we present a generic and non-proprietary approach to express QoS properties in BPEL processes using policies. This approach uses XPath, WS-Policy, and the external policy attachment mechanism of WS-PolicyAttachment to enable a separate and non-intrusive specification of both the messaging-level and process-level QoS requirements in BPEL processes. We also present a prototype implementation on top of the Colombo BPEL engine, which supports the enforcement of policies that are attached to BPEL activities.
PIRD: P2P-Based Intelligent Resource Discovery in Internet-Based Distributed Systems
Authors: Haiying Shen, Ze Li, Ting Li, Yingwu Zhu
Venue: Proceedings of the 2008 The 28th International Conference on Distributed Computing Systems (2008)

Internet-based distributed systems enable globally scattered resources to be collectively pooled and used in a cooperative manner to achieve unprecedented petascale super computing capabilities. Numerous resource discovery approaches have been proposed to help achieve this goal. To report or discover a multi-attribute resource, most approaches use multiple messages with each message for an attribute, leading to high overhead. Anther approach can reduce multi-attribute to one index, but it is not practically effective in an environment with a large number of different resource attributes. Furthermore, few approaches are able to locate resources geographically close to the requesters, which is critical to system performance. This paper presents a P2P-based intelligent resource discovery (PIRD) mechanism that weaves all attributes into a set of indices using locality sensitive hashing, and then maps the indices to a structured P2P. It further incorporates Lempel-Ziv-Welch algorithm to compress attribute information for higher efficiency. In addition, it helps to search resources geographically close to requesters by relying on a hierarchical P2P structure. PIRD significantly reduces overhead and improves the efficiency and effectiveness of resource discovery. Theoretical analysis and simulation results demonstrate the efficiency of PIRD in comparison with other approaches. It dramatically reduces overhead and yields significant improvements on the efficiency of resource discovery.
Composite-Type Optical Fiberscope for Laser Surgery for Twin-to-Twin Transfusion Syndrome
Authors: Kiyoshi Oka, Akihiro Naganawa, Hiromasa Yamashita, Tetsuya Nakamura, Toshio Chiba
Venue: Proceedings of the 4th international workshop on Medical Imaging and Augmented Reality (2008)

We present our new laser device for prospective human fetoplacental surgery including that of twin-twin transfusion syndrome. We developed a composite-type optical fiberscope (2.2-mm in diameter) that enables transmission of 40-W Yb fiber laser light alongside of coaxial fetoscopic images. Using a laser condensing lens on the fiberscope tip, Yb fiber laser light can be focused 10-mm off. Using porcine liver tissue, despite changes in delivered laser energy, the diameter and depth of cauterized areas remained constant when the liver position agreed with the laser focal point, although the laser output altered the extent of tissue ablation. In conclusion, the performance of the fiberscope can be well controlled with accurate and efficient ablation of the target tissue. This Yb fiber laser fiberscope is expected to work much better if mounted on a miniature bending manipulator and if provided with additional functions (real-time distance and blood flow measurements).