ppxscal/embedding_network huggingface dataset:
Modeling Plants Language for definition of L-Systems
Authors: Konrad Lukasik, Elzbieta Hudyma
Venue: Proceedings of the 5th International Conference on Intelligent Systems Design and Applications (2005)

Proper language for formal definition of L-Systems is crucial to easy creation, modification and comparison between plant models. This paper introduces special purpose language, which allows effortless description of D0L-Systems(simplest class of L-Systems) and their extensions (e.g. context-sensitive, parametric productions with probability). The proposed language enables as well specification of high-level model parameters.
A Full Rank Perfect Code of Length 31
Authors: Olof Heden
Venue: Designs, Codes and Cryptography (2006)

A full rank perfect 1-error correcting binary code of length 31 with a kernel of dimension 21 is described. This was the last open case of the rank-kernel problem of Etzion and Vardy.
Distributive Lattices, Bipartite Graphs and Alexander Duality
Authors: Jürgen Herzog, Takayuki Hibi
Venue: Journal of Algebraic Combinatorics: An International Journal (2005)

A certain squarefree monomial ideal HP arising from a finite partially ordered set P will be studied from viewpoints of both commutative algbera and combinatorics. First, it is proved that the defining ideal of the Rees algebra of HP possesses a quadratic Gröbner basis. Thus in particular all powers of HP have linear resolutions. Second, the minimal free graded resolution of HP will be constructed explicitly and a combinatorial formula to compute the Betti numbers of HP will be presented. Third, by using the fact that the Alexander dual of the simplicial complex ¿ whose Stanley---Reisner ideal coincides with HP is Cohen---Macaulay, all the Cohen---Macaulay bipartite graphs will be classified.
Determining the cost-quality trade-off for automated software traceability
Authors: Alexander Egyed, Stefan Biffl, Matthias Heindl, Paul Grünbacher
Venue: Proceedings of the 20th IEEE/ACM international Conference on Automated software engineering (2005)

Major software development standards mandate the establishment of trace links among software artifacts such as requirements, architectural elements, or source code without explicitly stating the required level of detail of these links. However, the level of detail vastly affects the cost and quality of trace link generation and important applications of trace analysis such as conflict analysis, consistency checking, or change impact analysis. In this paper, we explore these cost-quality trade-offs with three case study systems from different contexts - the open-source ArgoUML modeling tool, an industrial route-planning system, and a movie player. We report the cost-quality trade-off of automated trace generation with the Trace Analyzer approach and discuss its expected impact onto several applications that consume its trace information. In the study we explore simple techniques to predict and manipulate the cost-benefit trade-off with threshold-based filtering. We found that (a) 80% of the benefit comes from only 20% of the cost and (b) weak trace links are predominantly false trace links and can be efficiently eliminated through thresholds.
Java to Hardware Compilation for non Data Flow Applications
Authors: Per Andersson, Krzysztof Kuchcinski
Venue: Proceedings of the 8th Euromicro Conference on Digital System Design (2005)

Java has proven to be a powerful language for software development. In this paper we show that it is also suitable for hardware compilation, making it an attractive language for embedded system development. Our compilation technique, which is presented here, is based on separating different aspects of the program and use dedicated and specialised optimisations and code generators for each aspect. In this paper we focus on efficient implementation of random memory accesses, i.e. reference intensive tasks, such as graph traversal. We show that for these tasks the hardware generated by our compiler is up to 1.8 times faster than a software implementation. We also show how recursive algorithms can be mapped to hardware using our tool.
Multiple Coordinated Views for Network Attack Graphs
Authors: Steven Noel, Michael Jacobs, Pramod Kalapa, Sushil Jajodia
Venue: Proceedings of the IEEE Workshops on Visualization for Computer Security (2005)

While efficient graph-based representations have been developed for modeling combinations of low-level network attacks, relatively little attention has been paid to effective techniques for visualizing such attack graphs. This paper describes a number of new attack graph visualization techniques, each having certain desirable properties and offering different perspectives for solving different kinds of problems. Moreover, the techniques we describe can be applied not only separately, but can also be combined into coordinated attack graph views. We apply improved visual clustering to previously described network protection domains (attack graph cliques), which reduces graph complexity and makes the overall attack flow easier to understand. We also visualize the attack graph adjacency matrix, which shows patterns of network attack while avoiding the clutter usually associated with drawing large graphs. We show how the attack graph adjacency matrix concisely conveys the impact of network configuration changes on attack graphs. We also describe a novel attack graph filtering technique based on the interactive navigation of a hierarchy of attack graph constraints. Overall, our techniques scale quadratically with the number of machines in the attack graph.
Semantics of UML 2.0 Activity Diagram for Business Modeling by Means of Virtual Machine
Authors: Valdis Vitolins, Audris Kalnins
Venue: Proceedings of the Ninth IEEE International EDOC Enterprise Computing Conference (2005)

The paper proposes a more formalized definition of UML 2.0 Activity Diagram semantics. A subset of activity diagram constructs relevant for business process modeling is considered. The semantics definition is based on the original token flow methodology, but a more constructive approach is used. The Activity Diagram Virtual machine is defined by means of a metamodel, with operations defined by a mix of pseudocode and OCL pre- and postconditions. A formal procedure is described which builds the virtual machine for any activity diagram. The relatively complicated original token movement rules in control nodes and edges are combined into paths from an action to action. A new approach is the use of different (push and pull) engines, which move tokens along the paths. Pull engines are used for paths containing join nodes, where the movement of several tokens must be coordinated. The proposed virtual machine approach makes the activity semantics definition more transparent where the token movement can be easily traced. However, the main benefit of the approach is the possibility to use the defined virtual machine as a basis for UML activity diagram based workflow or simulation engine.
Learning environment dynamics from self-adaptation: a preliminary investigation
Authors: Amine Boumaza
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

We present an experimental study that shows a relationship between the dynamics of the environment and the adaptation of strategy parameters. Experiments conducted on two adaptive evolutionary strategies SA-ES and CMA-ES on the dynamic sphere function, show that the nature of the movements of the function's optimum are reflected in the evolution of the mutation steps. Three types of movements are presented: constant, linear and quadratic velocity, in all, the evolution of mutation steps during adaptation reflect distinctly the nature of the movements. Furthermore with CMA-ES, the direction of movement of the optimum can be extracted.
Triple Jump Acceleration for the EM Algorithm
Authors: Han-Shen Huang, Bou-Ho Yang, Chun-Nan Hsu
Venue: Proceedings of the Fifth IEEE International Conference on Data Mining (2005)

This paper presents the triple jump framework for accelerating the EM algorithm and other bound optimization methods. The idea is to extrapolate the third search point based on the previous two search points found by regular EM. As the convergence rate of regular EM becomes slower, the distance of the triple jump will be longer, and thus provide higher speedup for data sets where EM converges slowly. Experimental results show that the triple jump framework significantly outperforms EM and other acceleration methods of EM for a variety of probabilistic models, especially when the data set is sparse. The results also show that the triple jump framework is particularly effective for Cluster Models.
Proceedings of the 2005 ACM workshop on Storage security and survivability
Venue: Workshop On Storage Security And Survivability (2005)

This volume contains the papers presented at the International Workshop on Storage Security and Survivability (StorageSS) which was held November 11th, 2005 at George Mason University in conjunction with the Twelfth ACM Conference on Computer and Communications Security (CCS).There has been an evolution of protection solutions for networked computer systems mirrored in both the security and survivability research communities: (1) from physical protection solutions targeting people, (2) to system protection solutions targeting networked-systems, (3) and now the new emerging paradigm of information-centric solutions targeting the data itself. This workshop focuses on stimulating thought on info-centric solutions in order to reshape computer storage protection strategies. Clearly storage security and survivability is a complex, multi-dimensional problem with dynamics over time so a large variety of approaches may be appropriate including prevention, monitoring, measurements, mitigation, and recovery.The StorageSS'05 call-for-papers attracted thirty paper submissions. After peer-review from at least three reviewers per paper, fifteen papers were accepted. Two additional papers not included in the call-for-papers peer review process were invited by the Chair. Industry participation in this workshop includes six companies represented on the program committee, four accepted papers from industry, and even one accepted paper about the storage industry (storage service providers). While the workshop papers are USA-centric, there are accepted international papers from Israel and Italy in addition to a session chair from China and program committee members from Ecuador, Australia, Japan, and Italy. Future StorageSS workshops will seek to increase international participation.
Drapeability
Authors: John M. Maki, John E. Wetzel, Wacharin Wichiramala
Venue: Discrete Computational Geometry (2005)

An arc in the plane is drapeable if it lies in the convex hull of a convex arc of the same length. We establish some fundamental properties of drapeability, and we investigate some sufficient conditions for an arc to be drapeable.
An Artificial Intelligent Approach on Longevity Modeling
Authors: Xiaohui Zhang, Shangshang Sun, Mingjiang Zhang
Venue: Proceedings of the 17th IEEE International Conference on Tools with Artificial Intelligence (2005)

Longevity and life science are active topics in biomedicine and other research areas. Because human life is a complex multi-variant natural process, it is complicated yet important to extract expert knowledge that can describe the interactions among different factors and influence of the factors on human life. In this paper, expert knowledge is extracted into a longevity model by using artificial intelligent (AI) techniques: fuzzy logic that reflects prior expert knowledge is used in the preprocessing of bio-medical data; multiple classifier network and decision level data fusion are then applied to improve the modeling accuracy. The test results show that the proposed model is able to identify individuals who belong to longevity group with 93 percent accuracy. This research creates a new approach to explore the cause of human longevity based on comprehensive medical data rather than just from one medical subject. Therefore this methodology accords with the nature of human life more closely.
LaAlO3 films prepared by MBE on LaAlO3(001) and Si(001) substrates
Authors: S. Gaillard, Y. Rozier, C. Merckling, F. Ducroquet, M. Gendry, G. Hollinger
Venue: Microelectronic Engineering (2005)

The aim of this work was to investigate the potentiality of molecular beam epitaxy techniques to prepare high-κ LaAlO3 (LAO) films on silicon (001). First, the homoepitaxial growth of LAO was demonstrated for growth temperatures higher than 520°C. Then, amorphous LAO films were prepared on p-type Si(001) substrates with no interfacial SiO2 formation. LAO layers directly grown on Si(001) appear to be single crystalline at growth temperatures higher than 600°C but show interfacial reactions. Electrical measurements demonstrate that the growth temperature has a critical impact on leakage current. LAO films grown under atomic oxygen have a higher permittivity and a lower charge density than films grown under molecular oxygen.
Information Fusion from Databases, Sensors and Simulations: A Collaborative Research Program
Authors: Sten F. Andler, Lars Niklasson, Bjorn Olsson, Anne Persson, Leo J. de Vin, Benkt Wangler, Tom Ziemke, Tomas Planstedt
Venue: Proceedings of the 29th Annual IEEE/NASA on Software Engineering Workshop (2005)

This paper provides an overview of a collaborative research program in information fusion from databases, sensors and simulations. Information fusion entails the combination of data from multiple sources, to generate information that cannot be derived from the individual sources. This area is of strategic importance for industry and defense, as well as public administration areas such as health care, and needs to be pursued as an academic subject. A large number of industrial partners are supporting and participating in the development of the area. The paper describes the program's general approach and main research areas, with a particular focus on the role of information fusion in systems development.
Source-tracking unification
Authors: Venkatesh Choppella, Christopher T. Haynes
Venue: Information and Computation (2005)

We propose a path-based framework for deriving and simplifying source-tracking information for first-order term unification in the empty theory. Such a framework is useful for diagnosing unification-based systems, including debugging of type errors in programs and the generation of success and failure proofs in logic programming. The objects of source-tracking are deductions in the logic of term unification. The semantics of deductions are paths over a unification graph whose labels form the suffix language of a semi-Dyck set. Based on this idea of unification paths, two algorithms for generating proofs are presented: the first uses context-free labeled shortest-path algorithms to generate optimal (shortest) proofs in time O(n3) for a fixed signature, where n is the number of vertices of the unification graph. The second algorithm integrates easily with standard unification algorithms, entailing an overhead of only a constant factor, but generates non-optimal proofs. These non-optimal proofs may be further simplified by group rewrite rules.
A Monte Carlo simulation for data processing students
Authors: Michael Trombetta
Venue: ACM SIGSIM Simulation Digest (1977)

In the typical two-year data processing program there is so much material that must be covered that inevitably some important subjects are given abbreviated coverage or eliminated entirely. For example, almost all of our programming assignments and examples involve the use of computers in "accounting" type problems, in spite of the fact that computers are widely used to solve "operations research" type problems. This paper discusses a simple simulation problem which can be used to introduce data processing students to the use of computers to solve operations research type problems.
Using Fuzzy Logic to Analyze Superscript and Subscript Relations in Handwritten Mathematical Expressions
Authors: Ling Zhang, Dorothea Blostein, Richard Zanibbi
Venue: Proceedings of the Eighth International Conference on Document Analysis and Recognition (2005)

Handwritten mathematical notation contains ambiguities of various kinds. Here we focus on ambiguity in spatial relationships; in particular, we use fuzzy logic to treat ambiguity in subscript-or-inline and inline-or-superscript spatial relationships. We extend an existing system for recognizing handwritten mathematical notation, adding the capability of producing a ranked list of interpretations rather than a single top-choice interpretation. Fuzzy membership values are assigned to each spatial relationship; a given pair of symbols can have non-zero membership in fuzzy sets subscript and inline, or in fuzzy sets inline and superscript. These fuzzy membership values are combined to produce an overall confidence value for the entire interpretation. We have modified the user interface of our system so that a user can quickly view and select from the ranked interpretations when the highest confidence interpretation is incorrect.
A Novel Design of a 6-GHz 8 X 8-b Pipelined Multiplier
Authors: Amir Khatibzadeh, Kaamran Raahemifar
Venue: Proceedings of the Fifth International Workshop on System-on-Chip for Real-Time Applications (2005)

This paper presents a design of 8-bit x 8-bit unsigned multiplier for high-speed Digital Signal Processing (DSP) applications. High-speed is achieved by a new architecture implementing our earlier multiplication technique [1] in conventional register pipelining at the bit level. The multiplier is designed employing 0.18-µm CMOS process. HSPICE simulation results indicate that the proposed design performs multiplication rates up to 6 GHz under the supply voltage of 1.8V or 3.3 GHz under 1.4 V with about 25% times less power consumption. The comparison with Baugh-Wooley multiplier with same topology of the common elements shows that our multiplier consumes only 63% of the power ofBaugh-Wooley multiplier with 40% reduction in latency.
A resource-allocation mechanism for multiagent networks
Authors: Vishakh, Nicholas Urrea, Tadashi Nakano, Tatsuya Suda
Venue: Proceedings of the 2005 workshops on Genetic and evolutionary computation (2005)

The nature of computer networks and the manner in which network services are provided are changing dramatically. Network architectures that employ virtual mobile agents to provide services are under development. We describe Price Propagation, which is based on pricing in market economies. It is a decentralized adaptive mechanism for regulating agent behavior, with the goal of allocating computational resources optimally.
Automated translation of dynamic programming problems to java code and their solution via an intermediate petri net representation
Authors: Holger Mauch
Venue:  (2005)

Dynamic programming (DP) is a very general technique for solving optimization problems. In this dissertation, we develop a software system called &ldquo;DP2PN2Solver&rdquo; that automates many of the tasks a user encounters in order to solve an instance of a discrete optimization problem by means of DP. The user gives a specification of the DP functional equation in a special purpose high-level language. Then the specification is transformed into an intermediate Petri net (PN) representation for the discrete DP problem to be solved. After consistency checks the PN is translated into JAVA code (or some other object code that can be run in an additional step, e.g. a spreadsheet file), which solves the problem instance. Theoretical investigations examine the space of DP problems amenable to automation, as well as theory about the specialized intermediate PN representation called a &ldquo;Bellman net&rdquo;. Bellman nets are defined in two flavors; one is based upon the high-level or colored PN definition, the other is based upon the low-level place/transition net definition. These two approaches are then put in contrast. It is shown that the novel low-level definition is sufficient for many common discrete DP problems, while the high-level definition is general enough to handle an extremely broad class of discrete DP problems.
A new parallel strategy for two-dimensional incompressible flow simulations using pseudo-spectral methods
Authors: Z. Yin, Li Yuan, Tao Tang
Venue: Journal of Computational Physics (2005)

A novel parallel technique for Fourier-Galerkin pseudo-spectral methods with applications to two-dimensional Navier-Stokes equations and inviscid Boussinesq approximation equations is presented. It takes advantage of the programming structure of the phase-shift de-aliased scheme for pseudo-spectral codes, and combines the task-distribution strategy [Z. Yin, H.J.H. Clercx, D.C. Montgomery, An easily implemented task-based parallel scheme for the Fourier pseudo-spectral solver applied to 2D Navier-Stokes turbulence, Comput. Fluid 33 (2004) 509] and parallelized Fast Fourier Transform scheme. The performances of the resulting MPI Fortran90 codes with the new procedure on SGI 3800 are reported. For fixed resolution of the same problem, the peak speed of the new scheme can be twice as fast as the old parallel methods. The parallelized codes are used to solve some challenging numerical problems governed by the Navier-Stokes equations and the Boussinesq equations. Two interesting physical problems, namely, the double-valued @w-@j structure in two-dimensional decaying turbulence and the collapse of the bubble cap in the Boussinesq simulation, are solved by using the proposed parallel algorithms.
Towards context-aware face recognition
Authors: Marc Davis, Michael Smith, John Canny, Nathan Good, Simon King, Rajkumar Janakiraman
Venue: Proceedings of the 13th annual ACM international conference on Multimedia (2005)

In this paper, we focus on the use of context-aware, collaborative filtering, machine-learning techniques that leverage automatically sensed and inferred contextual metadata together with computer vision analysis of image content to make accurate predictions about the human subjects depicted in cameraphone photos. We apply Sparse-Factor Analysis (SFA) to both the contextual metadata gathered in the MMM2 system and the results of PCA (Principal Components Analysis) of the photo content to achieve a 60% face recognition accuracy of people depicted in our cameraphone photos, which is 40% better than media analysis alone. In short, we use context-aware media analysis to solve the face recognition problem for cameraphone photos.
Location management in mobile ad hoc wireless networks using quorums and clusters: Research Articles
Authors: Maggie X. Cheng, David H.-C. Du, Ding-Zhu Du
Venue: Wireless Communications Mobile Computing (2005)

Position-based reactive routing is a scalable solution for routing in mobile ad hoc networks. The route discovery algorithm in position-based routing can be efficiently implemented only if the source knows the current address of the destination. In this paper, a quorum-based location management scheme is proposed. Location servers are selected using the minimum dominating set (MDS) approach, and are further organized into quorums for location update and location query. When a mobile node moves, it updates its location servers in the update quorum; when a node requests the location information of another node, it will send a query message to the location servers in the query quorum. We propose to use the position-based quorum system, which is easy to construct and guarantees that the update quorums always intersect with the query quorums so that at least one location server in the query quorum is aware of the most recent location of the mobile node. Clusters are introduced for large scale ad hoc networks for scalability. Experiment results show that the proposed scheme provides good scalability when network size increases. Copyright &copy; 2005 John Wiley & Sons, Ltd.