ppxscal/embedding_network huggingface dataset:
A Model-View Separation Architecture for GUI Application Components
Authors: Hironori Washizaki, Yoshiaki Fukazawa
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Graphical User Interface (GUI) application component is a compound component, which consists of fine-grained components (such as GUI widgets) and specific logic. GUI application components fabricated by conventional techniques expose low extensibility because of the incomplete separation between the application logic part and GUI part inside the components. In this paper, we propose a new component architecture, "BeaM", which realizes complete separation between both parts inside the GUI application components. We have implemented a development environment corresponding to the proposed architecture in Java language. As a result of experimental evaluations, it is found that BeaM is useful to develop GUI application components as JavaBeans components with high extensibility.
Reduced order dynamic model for polysaccharides molecule attached to an atomic force microscope
Authors: Deman Tang, Aiqin Li, Peter Attar, Earl H. Dowell
Venue: Journal of Computational Physics (2004)

A dynamic analysis and numerical simulation has been conducted of a polysaccharides molecular structure (a ten (10) single-α-D-glucose molecule chain) connected to a moving atomic force microscope (AFM). Sinusoidal base excitation of the AFM cantilevered beam is considered. First a linearized perturbation model is constructed for the complex polysaccharides molecular structure. Then reduced order (dynamic) models based upon a proper orthogonal decomposition (POD) technique are constructed using global modes for both the linearized perturbation model and for the full nonlinear model. The agreement between the original and reduced order models (ROM/POD) is very good even when only a few global modes are included in the ROM for either the linear case or for the nonlinear case. The computational advantage of the reduced order model is clear from the results presented.
Adaptive data parallel computing on workstation clusters
Authors: Anirban Mahanti, Derek L. Eager
Venue: Journal of Parallel and Distributed Computing (2004)

Many important parallel applications are data parallel, and may be efficiently implemented on a workstation cluster by allocating each workstation a contiguous partition of the data domain. Implementation on non-dedicated clusters, however, is complicated by the possibility of changes in workstation availability. For example, a personal workstation may be reclaimed by its primary user for interactive use. In such situations, a node must be removed from the collection of workstations forming the ''virtual parallel machine'' allocated to the application, and data redistributed accordingly. Conversely, workstations may become available to join the virtual parallel machine. This paper identifies fundamental characteristics of efficient policies for data redistribution following addition/removal of workstations from the cluster. The following conclusions are obtained based on mathematical analysis and simulations: (a) allocating data to a new node from the center of the data domain substantially reduces data migration costs compared to allocation from the edge; (b) addition in groups is beneficial compared to repeated single additions; and (c) even a large number of incremental adjustments of the data domain partitions, owing to successive additions/removals of nodes, do not appear to substantially degrade partition quality compared to that obtained by partitioning from scratch. We believe that these observations can be fruitfully incorporated in the design of workstation cluster support systems for data parallel computing.
A CSP-Based Agent Modeling Framework for the Cougaar Agent-Based Architecture
Authors: Denis Gracanin, H. Lally Singh, Michael G. Hinchey, Mohamed Eltoweissy, Shawn A. Bohner
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

Cognitive Agent Architecture (Cougaar) is a Java-based architecture for large-scale distributed agent-based applications. A Cougaar agent is an autonomous software entity with behaviors that represent a real-world entity (e.g., a business process). A Cougaar-basedModel Driven Architecture approach, currently under development, uses a description of systemýs functionality (requirements) to automatically implement the system in Cougaar. The Communicating Sequential Processes (CSP) formalism is used for the formal validation of the generated system. Two main agent components, a blackboard and a plugin, are modeled as CSP processes. A set of channels represents communications between the blackboard and individual plugins. The blackboard is represented as a CSP process that communicates with every agent in the collection. The developed CSP-based Cougaar modeling framework provides a starting point for a more complete formal verification of the automatically generated Cougaar code. Currently it is used to verify the behavior of an individual agent in terms of CSP properties and to analyze the corresponding Cougaar society.
Performance of MIMO spatial multiplexing algorithms using indoor channel measurements and models: Research Articles
Authors: Quentin H. Spencer, Thomas Svantesson, A. Lee Swindlehurst
Venue: Wireless Communications Mobile Computing (2004)

Several algorithms have recently been proposed for multiplexing multiple users in multiple input multiple output (MIMO) downlinks. The ability of a transmitter to accomplish this using spatial methods is generally dependent on whether the users' channels are correlated. Up to this point, most of the multiplexing algorithms have been tested on uncorrelated Gaussian channels, a best-case scenario. In this paper, we examine the performance of multiplexing multiple users under more realistic channel conditions by using indoor channel measurements and a statistical model for test cases. We use a block zero-forcing algorithm to test performance at various user separation distances, optimizing for both maximum throughput under a power constraint and minimum power under a rate constraint. The results show that for the measured indoor environment (rich scattering, non-line-of-sight), a separation of five wavelengths is enough to achieve close to the maximum available performance for two users. Since many spatial multiplexing algorithms require channel state information (CSI) at the transmitter, we also examine the performance loss due to CSI error. The results show that a user can move up to one-half wavelength before the original channel measurement becomes unusable. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Listing all rectangular drawings with certain properties
Authors: Masahiro Takagi, Shin-Ichi Nakano
Venue: Systems and Computers in Japan (2004)

A plane drawing of a plane graph is called a rectangular drawing if every face (including the outer face) is a rectangle. An algorithm to generate all based rectangular drawings with maximum degree three is known. In this paper by generalizing the algorithm we give a simple algorithm to generate all based rectangular drawings having n faces without the degree constraint. The algorithm generates without duplications all rectangular drawings having exactly n faces in O(n) time per drawing. By modifying the algorithm we give three more algorithms to generate all rectangular drawings with certain properties. Those algorithms use O(n) space in total. &copy; 2004 Wiley Periodicals, Inc. Syst Comp Jpn, 35(4): 1&ndash;8, 2004; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.10563
SOM-based class discovery exploring the ICA-reduced features of microarray expression profiles: Research Paper
Authors: Andrei Dragomir, Seferina Mavroudi, Anastasios Bezerianos
Venue: Comparative and Functional Genomics (2004)

Gene expression datasets are large and complex, having many variables and unknown internal structure. We apply independent component analysis (ICA) to derive a less redundant representation of the expression data. The decomposition produces components with minimal statistical dependence and reveals biologically relevant information. Consequently, to the transformed data, we apply cluster analysis (an important and popular analysis tool for obtaining an initial understanding of the data, usually employed for class discovery). The proposed self-organizing map (SOM)-based clustering algorithm automatically determines the number of &lsquo;natural&rsquo; subgroups of the data, being aided at this task by the available prior knowledge of the functional categories of genes. An entropy criterion allows each gene to be assigned to multiple classes, which is closer to the biological representation. These features, however, are not achieved at the cost of the simplicity of the algorithm, since the map grows on a simple grid structure and the learning algorithm remains equal to Kohonen's one. Copyright &copy; 2005 John Wiley & Sons, Ltd.
Automatic accessibility evaluation of dynamic web pages generated through XSLT
Authors: André Pimenta Freire, Renata Pontin de Mattos Fortes
Venue: Proceedings of the 2005 International Cross-Disciplinary Workshop on Web Accessibility (W4A) (2005)

Much effort has been dedicated to develop software aids for authoring and evaluating Web pages using accessibility guidelines and standards. The evaluation of dynamic Web pages is a problem still unsolved in the field of automatic evaluation tools, since the current evaluators are only able to evaluate static Web pages. Stone and Dhiensa have addressed this problem, and proposed a method for evaluating the accessibility of dynamic Web pages using a generalized page which contains all possible outputs that can be generated by a script. In this paper, we present another approach for evaluating the accessibility of dynamic Web pages generated using XML and XSLT. The approach consists of analysing an XSLT using a structure descriptor such as DTD or XSD to determine the different types of XML documents that can be generated. The strength of the presented approach is given by the fact that the use of XML features enhances the results gathered from automatic accesibility evaluation of dynamic Web pages.
Hierarchical composition of industrial components
Authors: Ursula Scheben
Venue: Science of Computer Programming (2005)

In this paper we focus on the hierarchical composition of instances of arbitrary industrial component models yielding new (compound) components with specified capabilities and requirements which can themselves be composed to yield higher level components. For this purpose special component interfaces and component implementations are defined which ensure a smooth integration of industrial components. The component implementations of compound components enable a late binding by referring to enclosed component instances only by their component interfaces. But also explicit bindings between component interfaces and component implementations can be defined. A type system for components is introduced enabling a formal definition of exchangeability and interoperability of components. Using this type system, tools are able to decide which components may be exchanged by others and which components fit together. They can also support the creation of new components from existing ones by checking a new assembly for consistency.
Comparison Criteria for Parallel Orderings in ILU Preconditioning
Authors: Takeshi Iwashita, Yuuichi Nakanishi, Masaaki Shimasaki
Venue: SIAM Journal on Scientific Computing (2005)

This paper introduces block red-black ordering in a general three-dimensional form for parallel incomplete LU (ILU) preconditioning. This parallel ordering method is designed to attain fast convergence with reduced synchronization among processors in parallelized forward and backward substitutions. In this method, the grid-nodes are divided into blocks and red-black ordering is applied to them. Since blocks with identical colors never have a data-dependency, the blocks in each color can be processed in parallel. Moreover, in order to compare parallel orderings, we propose a new tool for investigating orderings on convergence. The analytic index for convergence, which is based on the remainder matrix, is easily computed and has a unique value for a fixed ordering. Nodes are classified into seven groups, and the effect of each group on convergence is estimated. Numerical tests using a three-dimensional problem confirm the validity of both proposed parallel ordering and analytic convergence comparison methods.
Operation of storage reservoir for water quality by using optimization and artificial intelligence techniques
Authors: Paulo Chaves, Tsuneo Tsukatani, Toshiharu Kojiri
Venue: Mathematics and Computers in Simulation (2004)

Water quantity and quality are considered to be the main driving forces of the reservoir operation. Barra Bonita reservoir, located in the southeast region of Brazil, is chosen as the case study for the application of the proposed methodology. Herein, optimization and artificial intelligence (AI) techniques are applied in the simulation and operation of the reservoir. A fuzzy stochastic dynamic programming model (FSDP) is developed for calculating the optimal operation procedures. Optimization is applied to achieve multiple fuzzy objectives. Markov chain technique is applied to handle the stochastic characteristics of river flow. Water quality analysis is carried out using an artificial neural network model. Organic matter and nutrient loads are modeled as a function of river discharge through the application of a fuzzy regression model based on fuzzy performance functions. The obtained results show that the proposed methodology provides an effective and useful tool for reservoir operation.
Packings in Dense Regular Graphs
Authors: Daniela Kühn, Deryk Osthus
Venue: Combinatorics, Probability and Computing (2005)

We prove that for all $\alpha,c>0$ and for all bipartite graphs $H$, all but at most $\alpha n$ vertices of every $cn$-regular graph $G$ whose order $n$ is sufficiently large can be covered by vertex-disjoint copies of $H$. If the vertex classes of $H$ have different size, then even all but a constant number of vertices of $G$ can be covered. This implies that for all $c>0$ and all $r\geq 4$ there exists a constant $C$ such that, in every $cn$-regular graph $G$, all but at most $C$ vertices can be covered by vertex-disjoint subdivisions of $K_r$. We also show that for $r=4,5$ one can take $C=0$.
An Efficient Program for Phylogenetic Inference Using Simulated Annealing
Authors: Alexandros Stamatakis
Venue: Proceedings of the 19th IEEE International Parallel and Distributed Processing Symposium (IPDPS'05) - Workshop 7 - Volume 08 (2005)

Inference of phylogenetic trees comprising thousands of organisms based on the maximum likelihood method is computationally expensive. A new program RAxML-SA (Randomized Axelerated Maximum Likelihood with Simulated Annealing) is presented that combines simulated annealing and hill-climbing techniques to improve the quality of final trees. In addition, to the ability to perform backward steps and potentially escape local maxima provided by simulated annealing, a large number of "good" alternative topologies is generated which can be used to build a consensus tree on the fly. Though, slower than some of the fastest hill-climbing programs such as RAxML-III and PHYML, RAxML-SA finds better trees for large real data alignments containing more than 250 sequences. Furthermore, the performance on 40 simulated 500-taxon alignments is reasonable in comparison to PHYML. Finally, a straight-forward and efficient OpenMP parallelization of RAxML is presented.
Mobility Prediction's Influence on QoS in Wireless Networks: A Study on a Call Admission Algorithm
Authors: Jean-Marc Francois, Guy Leduc
Venue: Proceedings of the Third International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (2005)

Several mechanisms increase the QoS level of mobile networks thanks to an underlying mobility prediction method (i.e. a means to predict a mobileýs next access router). This paper aims at studying how the accuracy of the prediction method can influence the network QoS in the particular context of call admission control. It shows that (a) the mobiles behaviour must be adapted according to the prediction scheme accuracy in order to achieve good performance and (b) the admission algorithm can be modified to increase its fairness and to give mobiles an incentive to do such an adaptation.
Design of Reliable IP/GMPLS Networks: An Integrated Approach
Authors: Florent Mobiot, Brunilde Sansò, André Girard
Venue: Journal of Network and Systems Management (2005)

The increased bandwidth demand for new Internet applications suggests mapping IP directly over the wavelength-division multiplexing (WDM) layer. Since reliability is such a critical issue in these broadband networks, we propose an integrated design method which addresses the problem of survivability as viewed from the IP/MPLS layers but taking into account the failure mechanisms in the optical layer. This approach is becoming practical because of the emergence of generalized multiprotocol label switching (GMPLS) as a multilayer control plane that can support the signaling required for coordinating the restoration mechanisms in multiple layers.The model relies on network calculus to evaluate a quality of service (QoS) metric as actually perceived by end users and computes a preplanned restoration scheme to recover from failures. We discuss the numerical implementation, the convergence and the solutions produced by the algorithm and show that the resulting network can provide the prescribed QoS guarantees for all failure states.
The software engineer and the development, management and use of intellectual property
Authors: Howard B. Rockman, Vladimir Khodosh
Venue: Proceedings of the 27th international conference on Software engineering (2005)

This full day tutorial will offer instruction on patent, copyright, trade secret and other intellectual property issues faced by developers and users of software in protecting their innovations, including information on avoiding infringing the intellectual property rights of others in the software development process. The course is directed to conference attendees who are involved in any aspect of the development, management or use of intellectual property, including those in the private sector, universities and government. The course will be presented at a basic and understandable, level tailored for the software engineer audience. The course will comprise an oral presentation of nine (9) 30-35 minute segments, with 10 minute breaks for refreshments and specific attendee questions. The instructors will remain available for questions from attendees during breaks. Answers to questions will also be provided during each session. Power Point slides will be used, and actual anecdotal experiences will be presented to illustrate important points.
Predicate Derivation and Monotonicity Detection in DB2 UDB
Authors: T. Malkemus, S. Padmanabhan, B. Bhattacharjee, L. Cranston
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

DB2 Universal Database allows database schema designers to specify generated columns. These generated columns are useful for maintaining rollup hierarchy variables in warehouses (e.g., date, month, quarter). In order for the generated columns to be useful for query processing, queries must automatically make use of such columns when applicable. In particular, query predicates on the original columns should be rewritten to make use of the generated columns. In this paper, we describe two main aspects of this predicate rewriting technique that allows usage of the generated columns for a variety of query predicate types. The first aspect, monotonicity detection, allows for rewrites in the case of range predicates. The second aspect, predicate derivation, is the technique for using generating expressions for query processing. We show the value of this technique for providing significant performance improvement when combined with indexing or multidimensional clustering in DB2.
Implications for designing the user experience of DVD menus
Authors: Thomas Költringer, Martin Tomitsch, Karin Kappel, Daniel Kalbeck, Thomas Grechenig
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

DVD menus often miss out on usability and are complex and difficult to navigate through. One of the main problems is the lack of design standards. By conducting an expert walkthrough we identified typical usability issues of DVD menus and verified them with usability testing and a user survey. Our research goal is to develop a set of specific solutions for designing usable DVD menus to improve the overall user experience. As a first step towards this goal we present an initial set of usability issues that are specifically relevant for DVD menu design.
The emerging discourse of knowledge management: a new dawn for information science research?
Authors: Ashok Jashapara
Venue: Journal of Information Science (2005)

Information science has played a limited role in providing fresh insights into the emerging interdisciplinary discourse of knowledge management. There are opportunities and challenges posed by the new discourse. An analysis of the knowledge management literature within information science journals shows a need for a wider academic perspective and a more philosophically grounded one. As the current knowledge management discourse is fragmented, we propose an integrative, interdisciplinary framework that would be useful for resituating knowledge management among scholars and practitioners. The principal pillars of this theoretical framework are organizational learning; systems and technology; and culture and strategy. Current criticisms of the knowledge management discourse are closely examined. The notions of knowledge sharing, social capital and organizational learning processes provide fundamental insights into knowledge management. These processes are explored from a social, cognitive and technological perspective.
Using peer reviews in teaching framework development
Authors: Amir Zeid, Moemen Elswidi
Venue: Proceedings of the 27th international conference on Software engineering (2005)

Framework development is one of the most challenging software development tasks. Teaching framework development is even more challenging. In this paper, we propose a creative process to teach framework development. We propose using peer review in the process. We present the process and some examples and findings out of our experience.
Performance Issues of Grid Computing Based on Different Architecture Cluster Computing Platforms
Authors: Hsun-Chang Chang, Kuan-Ching Li, Yaw-Ling Lin, Chao-Tung Yang, Hsiao-Hsi Wang, Liang-Teh Lee
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

This research paper discusses performance issues of cluster and grid computing platforms, and reasons to support the implementation of these computing infrastructures. A number of benchmark programs are executed in these computing systems, in order to perform performance analysis of experimental results. We will be able to show that cluster platforms are excellent alternatives to access to supercomputing, due to its cost/performance, scalability and commodity components factors. In addition, we also show that grid technology is viable by increasing total system performance at no additional cost.