ppxscal/embedding_network huggingface dataset:
Mailbox-Based Communications Scheme for Mobile Agent Overloading-balance and Message-priority
Authors: Shengbo Chen, HuaiKou Miao, Qingguo Xu
Venue: Proceedings of the Sixth International Conference on Grid and Cooperative Computing (2007)

Mobile agent technology has great potential in network, distributed systems and Grid. Agent mobility presents challenges to the design of efficient message transport protocols for mobile agent communications. Currently, in all mobile agent communication protocols, the urgent message could not get the response first. Furthermore, the overloading problem of the mobile agent was not taken into account. An improved mailbox-based mobile agent communication scheme is proposed in this paper. It can overcome message loss and ensure the message delivering reliability, provide an effective solution to overloading problem of the mobile agent and ensure that urgent message gets priority processing. This algorithm can also decrease the message waiting time effectively and reduce the resources occupied over the network dynamically. Furthermore, the mobile agent can be updated automatically in this algorithm. Additionally, it provides a better way to deploy agent applications on the Internet and the Grid. In our scheme, agent actions and behaviors are all visible and predictable.
Efficient Algorithms for Mining Closed Multidimensional Sequential Patterns
Authors: Veera Boonjing, Panida Songram
Venue: Proceedings of the Fourth International Conference on Fuzzy Systems and Knowledge Discovery - Volume 02 (2007)

A combination of closed sequential pattern mining and closed itemset pattern mining was proposed to mine closed multidimensional sequential patterns. There are two ways for this combination; (1) mining closed itemset patterns from multidimensional information followed by mining closed sequential patterns from sequences associated with closed itemset patterns, and (2) mining closed sequential patterns from sequences followed by mining closed itemset patterns from multidimensional information associated with closed sequential patterns. In the first way the major cost is mining all sequences associated with closed itemset patterns. A similar problem occurs with the second way, the major cost is mining all multidimensional information associated with closed sequential patterns. Therefore, this paper proposes two new combinations that don't need to mine all sequences in the first combination, and all multidimensional information in the second combination. Both combinations can be effected by exploiting two concepts. In the first combination, any closed sequential patterns associated with a closed itemset patten I can be found from a set of closed sequential patterns associated with a closed itemset pattern I if I I . In the second combination, any closed itemset patterns associated with a closed sequential pattern s can be found from a set of closed sequential patterns associated with a closed itemset pattern s if s s .
Specification-based testing for refinement
Venue: Proceedings of the Fifth IEEE International Conference on Software Engineering and Formal Methods (2007)

In this paper, we present a theory for the evaluation of test cases with respect to formal specifications. In particular, we use the specification language CSP-CASL to define and evaluate black-box tests for reactive systems. Using loose semantics and three-valued test oracles, our approach is well-suited to deal with the refinement of specifications. In a structured development process of computational systems, abstract specifications are gradually refined into more concrete ones. With our approach, it is possible to develop test cases already from very abstract and basic specifications, and to reuse them later on in more refined systems.
Scaling Conditional Random Field with Application to Chinese Word Segmentation
Authors: Hai Zhao, Chunyu Kit
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

As a powerful sequence labeling model, conditional ran- dom field (CRF) has been applied to a number of natural language processing (NLP) tasks successfully. However, the high complexity of CRF training only allows a very small tag (or label) set, because the training becomes intractable as the tag set enlarges. This paper proposes an improved decomposed training and joint decoding algorithm for CRF learning. Instead of training a single CRF model for all tags, it trains a binary sub-CRF independently for each tag. A predicted tag sequence is then produced by a joint decoding algorithm based on the probabilistic output of all sub-CRFs involved. To test its effectiveness, this approach is applied to tackle Chinese word segmentation (CWS) as a character tagging problem. Our evaluation shows that it can reduce time and memory cost by 20-39% and 44- 50%, respectively, without any significant performance loss on various large-scale data sets.
A grid-free abstraction of the Navier-Stokes equations in Fortran 95/2003
Authors: Damian W. I. Rouson, Robert Rosenberg, Xiaofeng Xu, Irene Moulitsas, Stavros C. Kassinos
Venue: ACM Transactions on Mathematical Software (TOMS) (2008)

Computational complexity theory inspires a grid-free abstraction of the Navier-Stokes equations in Fortran 95/2003. A novel complexity analysis estimates that structured programming time grows at least quadratically with the number of program lines. Further analysis demonstrates how an object-oriented strategy focused on mathematical objects renders the quadratic estimate scale-invariant, so the time required for the limiting factor in program development (debugging) no longer grows as the code grows. Compared to the coordinate-free C&plus;&plus; programming of Grant et al. [2000], grid-free Fortran programming eliminates a layer of procedure calls, eliminates a related need for the C&plus;&plus; template construct, and offers a shorter migration path for Fortran programmers. The grid-free strategy is demonstrated by constructing a physical-space driver for a Fourier-space Navier-Stokes solver. Separating the expression of the continuous mathematical model from the discrete numerics clarifies issues that are otherwise easily conflated. A run-time profile suggests that grid-free design substantially reduces the fraction of the procedures that significantly impact runtime, freeing more code to be structured in ways that reduce development time. Applying Amdahl's law to the total solution time (development time plus run time) leads to a strategy that negligibly impacts development time but achieves 58&percnt; of the maximum possible speedup.
Partial Verification of Software Components: Heuristics for Environment Construction
Authors: Pavel Parizek, Frantisek Plasil
Venue: Proceedings of the 33rd EUROMICRO Conference on Software Engineering and Advanced Applications (2007)

Code model checking of software components suffers from the well-known problem of state explosion when applied to highly parallel components, despite the fact that a single component typically comprises a smaller state space than the whole system. We present a technique that mitigates the problem of state explosion in code checking of primitive components with the Java PathFinder in case the checked property is absence of concurrency errors. The key idea is to reduce parallelism in the calling protocol on the basis of the information provided by static analysis searching for concurrency-related patterns in the component code; by a heuristic, some of the pattern instances are denoted as "suspicious". Then, the environment (needed to be available since Java PathFinder checks only complete programs) is generated from a reduced calling protocol so that it exercises in parallel only those parts of the component's code that likely contain concurrency errors.
BUCOLIC: A Program for Teaching Color Theory to Art Students
Authors: Barbara Meier
Venue: IEEE Computer Graphics and Applications (1985)

The standard method of teaching color theory is cumbersome at best. Computer graphics can solve problems of time and tedium and cover much more material as well.
Proceedings of the 5th international conference on Embedded networked sensor systems
Venue: Conference On Embedded Networked Sensor Systems (2007)

Welcome to SenSys'07, the 5th ACM International Conference on Embedded Networked Sensor Systems! We have what promises to be an exciting technical program, highlighted by 25 excellent technical papers, a fascinating keynote talk by Seth Goldstein (CMU) entitled "On the Path Towards Programmable Matter", three interesting workshops, and a lively demo and poster session. For the first time, we will also have a special "soap box" talks session, for expressing strong, controversial and/or outrageous opinions on a topic within the scope of SenSys. There will be a best paper award, a best talk award, and several best demo awards (in different categories). These will be announced at the conference. The 25 technical papers were selected from 149 completed paper submissions. Submissions were received from 21 countries across 6 continents. Each submitted paper was reviewed by at least three experts, one external reviewer and at least two Technical Program Committee (TPC) members, in the first round. Approximately half of the papers made it to the second round and received 1 to 4 additional reviews. Most of these reviews were done by the TPC, but some papers with conflicting reviews were judged by additional external experts as well. Finally, 46 papers were discussed during the TPC meeting in Pittsburgh in June. All paper reviews and TPC discussions were double-blind, preserving both author and reviewer anonymity. Ultimately, 25 papers were selected for the final program. All these papers were carefully shepherded by a TPC member to ensure that all important reviewer comments were addressed.
Parallelized segmentation of a serially sectioned whole human brain
Authors: Oliver Schmitt, Sven Bethke, Peter Sobe, Steffen Prehn, Erik Maehle
Venue: Image and Vision Computing (2008)

Building a digital three dimensional representation of a human brain is a challenging task. Such a model provides insights into the microstructure of cortical layering and columns. The presented work is based on a complete dissected and preserved human brain that has been serially sectioned at a coronal resolution that is suitable for single cell detection. More than 6000 sections have been generated and exist as digital images. To obtain a valuable three dimensional representation, morphology preserving affine linear and nonlinear registration schemes are necessary steps. To rebuild a serially sectioned brain, reference images derived from a non deformed object, e.g., MRI or block face images, are necessary for a faithful affine linear and nonlinear registration. In the case of block face images the brain regions must be separated from highly variable background regions to obtain a suitable stack of segmentation images. Among the image segmentation algorithms we found fuzzy c-means techniques as a promising starting point for a sophisticated segmentation framework of either gray level or color images within 2- and 3-dimensions. With respect to algorithmic complexity and computation cost, two fuzzy c-means algorithms were implemented. A proper image preprocessing strategy turned out to be necessary for accurate and robust segmentation results. Primarily, the algorithms work in a parametric resp. supervised mode. Additionally, an automatic mode helps to explore the parameter space within a reasonable range and to compare the segmentation result with an optimal one, provided by an expert. By minimizing the differences we can set up parameters that are used for series of adjacent images. So, it is possible to obtain optimal segmentations independent of illumination disturbances, artifacts and defocusing. We present a complete high resolution and accurate segmentation of the first complete human brain that was sectioned, photographed and digitized at histologic resolution. Based on these images, a succeeding 3D representation is presented. Finally, a segmented and spatially correct straightened data set is available now for coregistration tasks together with the high resolution histologic data set.
Quantitative Estimates of Debugging Requirements
Authors: L. M. Ottenstein
Venue: IEEE Transactions on Software Engineering (1979)

A major portion of the problems associated with software development might be blamed on the lack of appropriate tools to aid in the planning and testing phases of software projects. As one step towards solving this problem, this paper presents a model to estimate the number of bugs remaining in a system at the beginning of the testing and integration phases of development. The model, based on software science metrics, was tested using data currently available in the literature. Extensions to the model are also presented which can be used to obtain such estimates as the expected amount of personnel and computer time required for project validation.
Key Management Scheme for Sensor Networks with Proactive Key Revocation and Sleep State Consideration
Authors: Rabia Riaz, Ali Hammad Akbar, Mustafa Hasan, Ki-Hyung Kim, Kyungsuk Lhee, Ayesha Naureen, Attiya Akram, H. Farooq Ahmed
Venue: Proceedings of the 2007 IFIP International Conference on Network and Parallel Computing Workshops (2007)

In Dynamic key management systems, while frequent control messaging may be necessary for robustness of security, it is detrimental to energy resources of wireless sensor networks. The problem is further exacerbated for sleep enabled sensor networks as a) malicious nodes penetrate into a network by spoofing the ids of legitimate nodes that are in sleeping state b) it is possible for legitimate sensor nodes to be entirely compromised. In this paper, the abovementioned aspects of keying are addressed as tierce to optimize communication. First a secure key generation mechanism is presented that aims at optimizing communication. Second, a sleep schedule cognizant protocol is presented to prevent id spoofing of sleeping nodes. Third, a post attack mechanism is proposed to prevent the compromised nodes to join the network. Our threesome solution not only saves energy by minimizing the communication overhead in establishing keys among sensor nodes but also provides high but secure connectivity for sleep state nodes.
An Enhanced Dynamic and Distributed Domain-Based Handoff Scheme for Mobile IPv6
Authors: Xuebin Ma, Tao Wen, Quan Guo, Gang Wang
Venue: Proceedings of the 7th IEEE International Conference on Computer and Information Technology (2007)

IP mobility problem in the next generation Internet Protocol (IPv6) by which mobile nodes are reachable while roaming in the Internet. Despite many advantages it offers in comparison to Mobile IPv4, handover management still remains an issue for Mobile IPv6. For real-time connections, the handover latency and signaling overhead incurred by the protocol may become significant. In this paper, we present an enhanced dynamic and distributed domain-based handoff scheme for MIPv6 where the signaling burden is evenly distributed and the regional network boundary is dynamically adjusted according to the up-to-date mobility of each terminal. We describe the basic protocol operations and examine the performance improvement of our mobility management over the previous mobile IP mobility management method by using simulations. We show that the dynamic approach provides the optimal mobility solution for MIPv6 and the distributed approach can decentralize the network load. Keywords-Mobile IPv6; handoff scheme; dynamic and distributed domain; NS-2
Studies on CAD Systems with Artificial Intelligence
Authors: Jun Wang, Sun Huixue
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

This paper presents a new CAD prototype with artificial intelligence specially designed for bucket elevator design. This system integrates artificial intelligence into a CAD system, so the design process is different from the conventional design process, and much similar to the way human engineers solve problems. It is a case-based and rule-based reasoning system used to design mechanical products which have complex structure. Also, this paper discusses the case representation method and a fuzzy mathematics is used to choose the most similar existing design for the incoming product design. The proposed system described has been realized on a computer prototype program.
Communication Optimization Algorithms based on Extend Data Flow Graph
Authors: Xue-rong Gong, Zhao Rong-cai, Lin-sheng Lu
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 03 (2007)

Reducing communication overhead is extremely important for parallelizing compiler to generate efficient codes for distributed memory machines. In this paper, a redundant parallel execution model (RPEM) is used as the model for target programs. The extend data flow graph is introducedCand optimization algorithms based on the data-flow analysis are discussed. The overhead of data flow analysis can be reduced by performing analysis on the extend data flow graph. The analysis helps to reduce the redundant communication overhead. These optimization algorithms are able to perform inter-loop and inter-procedure analysis. Experimental results prove that these optimizations algorithms are effective in reducing both the number of communications and the communication volume.
Enhancing Reusability of Learning Objects with Object-Oriented Inheritance Relationships
Authors: Yung-Hui Chen, Chun-Chia Wang, Lawrence Y. Deng, Mei-Chung Chen, Timothy K. Shih
Venue: Proceedings of the 2007 International Conference on Parallel Processing Workshops (2007)

This paper points out relevant issues of object inheritance in the context of SCORM/CORDRA research communities. We propose a mechanism, as well as an implemented prototype system, that can be used to support searching and reusing of learning objects formed by a reusability tree in repositories. The underlying repository to store learning objects is constructed based on the architecture defined as CORDRA. We integrate the authoring tool, the LMS, and the repository as a total solution to SCORM-based distance learning. The proposed MINE Registry served as an instance of CORDRA-based repository is also discussed.
A New Dynamical Evolutionary Algorithm for Active Contour Optimization
Authors: Dingwen Wang, Yuanxiang Li, Lingling Wang
Venue: Proceedings of the Third International Conference on Natural Computation - Volume 05 (2007)

This paper proposes a new dynamical evolutionary algorithm for active contour optimization, called Dynamical Evolutionary Active Contour (DEAC). Compared with Evolutionary Active Contour (EAC), DEAC is to improve selecting strategies and to activate all individuals at the most possible with their population evolving, and preserves the diversity of individuals in a population. The experimental results with the synthetic and simple real images demonstrate the validation and robustness. Moreover, the proposed algorithm has been applied to X-ray color image. The results of the comparison with EAC show that the proposed algorithm has a more powerful global exploration capabil- ity, and can converge at the less contour energy function value with less time, as well as more accurate boundary.
Research on Technologies of Spatial Configuration Information Retrieval
Authors: Haibin Sun, Xin Chen
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 01 (2007)

The problem of spatial configuration information retrieval is a Constraint Satisfaction Problem (CSP), which can be solved using traditional CSP algorithms. But the spatial data are generally reorganized using index techniques like R-tree to improve the efficiency of query answering in spatial information systems, especially Geographic Information System (GIS), and the spatial data are approximated by their Minimum Bounding Rectangles (MBRs), so the spatial configuration information retrieval is actually based on the MBRs and some special techniques should be studied. This paper studies the mapping relationships among the spatial relations for real spatial objects, the corresponding spatial relations for their MBRs and the corresponding spatial relations between the intermediate nodes and the MBRs in R-tree. Based on these study results, three search algorithms are designed and presented.
Bifurcations in nonlinear integral models of biological systems
Authors: N. Hritonenko, Yuri Yatsenko
Venue: International Journal of Systems Science (2007)

A bifurcation analysis is suggested for nonlinear integral models of age-distributed biological populations. The analysis shows that the integral model of one-species population with intraspecies competition has zero and positive stationary states for some values of a bifurcation parameter. The nontrivial positive stationary state is initially stable and becomes unstable as the parameter grows. The obtained results are discussed and compared with the corresponding results in differential and difference models.
RLH: bitmap compression technique based on run-length and huffman encoding
Authors: Michal Stabno, Robert Wrembel
Venue: Proceedings of the ACM tenth international workshop on Data warehousing and OLAP (2007)

In this paper we present a technique of compressing bitmap indexes for application in data warehouses. The developed compression technique, called Run-Length Huffman (RLH), is based on the run-length encoding and on the Huffman encoding. RLH was implemented and experimentally compared to the well known Word Aligned Hybrid bitmap compression technique that has been reported to provide the shortest query execution time. The experiments discussed in this paper show that RLH offers shorter query response times than WAH, for certain cardinalities of indexed attributes. Moreover, bitmaps compressed with RLH are smaller than corresponding bitmaps compressed with WAH. Additionally, we propose a modified RLH, called RLH-1024, which is designed to better support bitmap updates.
Residue calculus and applications
Authors: Mohamed Elkadi, Alain Yger
Venue: Publications of the Research Institute for Mathematical Sciences (2007)

We present a new algorithm in order to compute the multidimensional residue of a polynomial map based on a perturbation argument and the Generalized Transformation Law. Then we use it for studying some fundamental problems in Computer Aided Geometric Design.
Study on Non-FIFO Arc in Time-Dependent Networks
Authors: Luo Wuming, Han Pingyang
Venue: Proceedings of the Eighth ACIS International Conference on Software Engineering, Artificial Intelligence, Networking, and Parallel/Distributed Computing - Volume 02 (2007)

This paper points out that the reason why the traditional shortest-path algorithms can not effectively find out the shortest paths in time-dependent networks is the existence of non-FIFO arc, and presents the discriminant theorem to distinguish non-FIFO arc from FIFO arc. The paper also provides the method to discriminate the non-FIFO arc and calculate the waiting interval and the optimal departure time of non-FIFO arc, and converts non-FIFO arc into FIFO arc. Based on the traditional Dijkstra algorithm, this paper develops the improved shortest-path algorithm in time-dependent network.