ppxscal/embedding_network huggingface dataset:
K-means Clustering Algorithm with Improved Initial Center
Authors: Chen Zhang, Shixiong Xia
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

In this paper we present a new clustering method based on k-means that have avoided alternative randomness of initial center. This paper focused on K-means algorithm to the initial value of the dependence of k selected from the aspects of the algorithm is improved. First,the initial clustering number is. Second, through the application of the sub-merger strategy the categories were combined.The algorithm does not require the user is given in advance the number of cluster. Experiments on synthetic datasets are presented to have shown significant improvements in clustering accuracy in comparison with the random k-means.
Generating MDA's platform independent model using URDAD
Authors: Fritz Solms, Dawid Loubser
Venue: Knowledge-Based Systems (2009)

This paper formulates a set of minimal requirements for the Platform Independent Model (PIM) of the Model Driven Architecture (MDA). It then defines the Use Case, Responsibility Driven Analysis and Design methodology (URDAD) which provides a simple, algorithmic design methodology generating a PIM satisfying the specified PIM requirements.
An interactive sorting method for additive utility functions
Authors: Murat Köksalan, Selin Bilgin Özpeynirci
Venue: Computers and Operations Research (2009)

In this paper, we consider the problem of placing alternatives that are defined by multiple criteria into preference-ordered categories. We consider a method that estimates an additive utility function and demonstrate that it may misclassify many alternatives even when substantial preference information is obtained from the decision maker (DM) to estimate the function. To resolve this difficulty, we develop an interactive approach. Our approach occasionally requires the DM to place some reference alternatives into categories during the solution process and uses this information to categorize other alternatives. The approach guarantees to place all alternatives correctly for a DM whose preferences are consistent with any additive utility function. We demonstrate that the approach works well using data derived from ranking global MBA programs as well as on several randomly generated problems.
Isolation points: Creating performance-robust enterprise systems
Authors: Mohamed S. Mansour, Karsten Schwan, Sameh Abdelaziz
Venue: ACM Transactions on Autonomous and Adaptive Systems (TAAS) (2009)

This article explores a performance isolation-based approach to creating robust distributed applications. For each application, the approach is to understand the performance dependencies that pervade it and then impose constraints on the possible &lsquo;spread&rsquo; of such dependencies through the application. The mechanisms used for this purpose, termed isolation points, are software abstractions inserted at key program locations: (1) in application interfaces, (2) in middleware implementations for making remote requests, and (3) in the system interfaces used by middleware and applications. This article demonstrates the utility of isolation points by using them to implement higher level abstractions that improve the performance-robustness of representative enterprise applications. The I-Queue abstraction uses isolation points to implement performance-robust messaging, targeting the message queues used in distributed enterprise codes. By appropriately orchestrating message dispatching, I-Queue can achieve an improvement of 16--32&percnt; in dispatched message locality based on traces obtained from the large-scale e-Pricing&reg; search engine operated by Worldspan L.P.
A statistical analysis of relation degree of compound pair on online biological pathway databases
Authors: Myungha Jang, Arang Rhie, Jiyoung Whang, Sanduk Yang, Hyun S. Park
Venue: Proceedings of the 3rd International Conference on Ubiquitous Information Management and Communication (2009)

The basic graph layout technique, one of the visualization techniques, deals with the problem of positioning the vertices in a way to maximize understandability and usability in a graph. This technique is becoming a vital part for further development in the field of systems biology. However, applying the appropriate automatic graph layout techniques to the genome scale flow of metabolism requires understanding of the characteristics of metabolites and reactions, which suggest valuable information to bioinformatics software developers for better visualization of automatic graph layout. In this paper, we define the term relation degree of a compound pair to provide a reasonable way to visualize metabolic pathway atlas, based on the parsing result of the publicly available XML files. It is a preliminary step for future research in the area of automatic layout techniques in large-scale biological pathway domain.
Optical fiber sensor for localizing heating positions in multiple points using multichannel gratings with phase sampling and wavelength division multiplexing techniques
Authors: Li Xia, P. Shum
Venue: Proceedings of the 2008 International Conference on Advanced Infocomm Technology (2008)

An optical fiber sensor system with multichannel fiber Bragg gratings (FBGs) is proposed. The gratings are designed and fabricated by phase sampling technique within strongly chirped phase masks. The sensing application can be realized at multiple points through wavelength division multiplexing (WDM) technique. It means that the different point can be monitored by different gratings, which occupies different wavelength region, according to the central pitch and chirp coefficient of phase masks. The heating position with high resolution can be analyzed through three corresponding channel shifts in the multichannel profile. In our experiment, the two multichannel gratings with channel spacing of 0.8 and 1.6 nm, respectively, are fabricated and used to sensing in two points. At last, the 400 &mu;m accuracy of localizing the heating position is achieved.
Bee-inspired data collection methods for P2P streaming systems
Authors: Tomoki Yoshihisa, Tadashi Nakano, Shun N. Watanabe, Tatsuya Suda
Venue: Proceedings of the 3rd International Conference on Bio-Inspired Models of Network, Information and Computing Sytems (2008)

Recently, P2P (Peer-to-Peer) streaming systems have attracted great attention. In P2P streaming systems, streaming data such as video and audio are divided into a number of small pieces for efficient data distribution. This approach allows peers to collect the pieces from each other while playing the streaming data. Our investigation into ecological systems suggests that the piece collection in P2P streaming systems is similar to the bee's nectar collection and that their nectar collecting behavior can be used as a model in designing piece collection methods for P2P streaming systems. In this paper, we propose data collection methods for P2P streaming systems inspired by bee's nectar collecting behavior. There are several types of bees in the bee ecology, which exhibit different behavior, and accordingly, we propose three different methods inspired by three typical bee types; those are honey, bumble, and carpenter bees. Suitable environments for the three methods may differ and are investigated in this paper.
Formal development of a washing machine controller by using formal design patterns
Authors: Xin Ben Li, Feng Xia Zhao
Venue: Proceedings of the 3rd WSEAS international conference on Computer engineering and applications (2009)

Users of Formal Methods are given sophisticated languages and tools for constructing models of complex systems. But they often lack some systematic methodological approaches that could help them. Design patterns used often in Object Oriented software can result in adapting and incorporating some pre-defined pieces of codes in a software project. Some formal design patterns are presented and applied to the development of a controller model in Event-B that is a formal method for modeling and reasoning about complex discrete system based on set-theory and predicate logic.
Restricted k-ary words and functional equations
Authors: Ghassan Firro, Toufik Mansour
Venue: Discrete Applied Mathematics (2009)

We present an algorithm for finding a system of recurrence relations for the number of k-ary words of length n that satisfy a certain set of conditions. A rewriting of these relations automatically gives a system of functional equations satisfied by the multivariate generating function that counts k-ary words by their length and the indices of the corresponding recurrence relations. We propose an approach to describing such equations. In several interesting cases the algorithm recovers and refines results on @t-avoiding k-ary words and k-ary words containing @t exactly once, where @t is either a classical, a generalized, or a distanced pattern of length three.
Cluster Based Personalized Search
Authors: Hyun Chul Lee, Allan Borodin
Venue: Proceedings of the 6th International Workshop on Algorithms and Models for the Web-Graph (2009)

We study personalized web ranking algorithms based on the existence of document clusterings. Motivated by the topic sensitive page ranking of Haveliwala [20], we develop and implement an efficient "local-cluster" algorithm by extending the web search algorithm of Achlioptas et al. [10]. We propose some formal criteria for evaluating such personalized ranking algorithms and provide some preliminary experiments in support of our analysis. Both theoretically and experimentally, our algorithm differs significantly from Topc Sensitive Page Rank.
Maximum Traffic Routing Problems in Wireless Mesh Networks
Authors: Yu-Liang Kuo, Chia-Cheng Hu, Chun-Yuan Chiu
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

This paper studies two NP-hard problems, the maximum bandwidth routing problem (MBRP) and the maximum flow routing problem (MFRP) in multi-hop wireless mesh networks (WMNs) to support diverse Quality-of-Service (QoS). First, upper bounds on their optimal values are derived, and a lower bound is derived on the feasible value obtained for the MBRP. Then, heuristic algorithms for the two problems are proposed. With the upper bound and the lower bound, an approximation ratio for the heuristic algorithm of the MBRP is obtained.
Bandwidth selection for a data sharpening estimator in nonparametric regression
Authors: Kanta Naito, Masahiro Yoshizaki
Venue: Journal of Multivariate Analysis (2009)

This paper is concerned with data-based selection of the bandwidth for a data sharpening estimator in nonparametric regression. Two kinds of bandwidths are considered: a bandwidth vector which has a different bandwidth for each covariate, and a scalar bandwidth that is common for all covariates. A plug-in method is developed and its theoretical performance is fully investigated. The proposed plug-in method works efficiently in our simulation study.
An Improved Ant Colony Broadcasting Algorithm for Wireless Sensor Networks
Authors: Nan Jiang, Rigui Zhou, Shuqun Yang, Qiulin Ding
Venue: International Journal of Distributed Sensor Networks (2009)

Recent advances in nano-technology have made it possible to develop a large variety of Micro Electro-Mechanical Systems (MEMS)-miniaturized low-power devices that integrate sensing, special-purpose computing, and wireless communications capabilities. A sensor network is a collection of many small devices, each with sensing, computation, and communication capability. It has many potential applications, such as building surveillance and environmental monitoring. Broadcasting is defined that communications between one source and all receiver in networks, and it is widely used in Wireless Sensor Networks. Therefore, how to design an efficient and scalable broadcast protocol is challenging and meaningful work. Ant Colony Algorithm is a bionic optimization algorithm which simulated insect behavior of ants swarm intelligence. It is robust, has excellent advantages of distributed computation mechanism, and it has been widely applied to the solution of TSP, production scheduling, Graph Coloring Problem, and other combinatorial optimization problems. Broadcasting in wireless sensor networks is very similar with the ants routing problem. The target nodes and source nodes for broadcasting can be respectively compared to food and ant nests, and broadcasting problem can be regarded as the issue that ants find the optimal path between food and nests. When using ant colony algorithm for broadcasting, ants pheromone is calculated to select the path in accordance with the transition probability, and each ant in the path does not need access to all the information before starting, thus this will avoid the calculation of overhead of the initialization of parameters information in all nodes and the paths, and achieve the goal of multi-path data broadcasting in large-scale sensor networks. In this paper, we describe the broadcasting problem in sensor networks and introduce a network model, and after considering energy efficient broadcast in such networks, combined the characteristic of Wireless Sensor Networks and the properties of ant algorithm to quickly identify an optimal path, we introduce and evaluate an improved ant colony broadcasting algorithm (IACBA), which can adaptively find the optimal broadcasting path without global network information. In our simulation, the notion of network density is introduced in order to identify classes of network topologies with similar characteristics. We mainly analyze energy depletion, minimum distance, and network lifetime, and the results show that out algorithm can reduce energy depletion dramatically and decrease communication distances in broadcasting, and our algorithms can prolong network lifetime by about 10%-20% compared with BIP, and about 30%-50% compared with flooding.
Learning and growth strategy metrics
Authors: Petko Ruskov, Yanka Todorova
Venue: Proceedings of the 9th International Conference on Computer Systems and Technologies and Workshop for PhD Students in Computing (2008)

Purpose -- to examine the best practices and metrics of a balanced scorecard BSC learning and growth view for academic education and research institution and to present process, targets and metrics. Design/methodology/approach -- based on an extensive literature review and analysis and on the authors exercise in information systems, education and training an assessment for human, information and organizational capital is developed. Practical implications -- described process for measurement and metrics can facilitate faculty and staff to formulate and measure strategic learning and growth view and to build competitive educational and research environment at the faculty. Originality/value -- the value of the process and metrics is in describing human, information and organisational capital in one view and in creating specific measures and indicatives for their improvement. Building of such an evaluation pattern allows further research about other components of the intellectual, information and organisational capital of the faculty bridging the literatures focused and expertise on intangible assets.
Microprogramming: the challenges of VLSI
Authors: Alice C. Parker, Wayne T. Wilner
Venue: Proceedings of the May 4-7, 1981, national computer conference (1981)

Digital system design has been affected dramatically by very-large-scale integration (VLSI). Microprogramming will be affected most greatly by the VLSI design problem. Hardware performing specific functions will be replaced by regular arrays of logic and memory. Design time for VLSI systems will depend on sophisticated design aids for hardware and microcode, and concurrent systems will be common. Microcode will be used in virtually all highly integrated systems.
Exploiting global optimizations for openmp programs in the openuh compiler
Authors: Lei Huang, Deepak Eachempati, Marcus W. Hervey, Barbara Chapman
Venue: Proceedings of the 14th ACM SIGPLAN symposium on Principles and practice of parallel programming (2009)

The advent of new parallel architectures has increased the need for parallel optimizing compilers to assist developers in creating efficient code. OpenUH is a state-of-the-art optimizing compiler, but it only performs a limited set of optimizations for OpenMP programs due to its conservative assumptions of shared memory programming. These limitations may prevent some OpenMP applications from being fully optimized to the extent of its sequential counterpart. This paper describes our design and implementation of a parallel data flow framework, consisting of a Parallel Control Flow Graph (PCFG) and a Parallel SSA (PSSA) representation in OpenUH, to model data flow for OpenMP programs. This framework enables the OpenUH compiler to perform all classical scalar optimizations for OpenMP programs, in addition to conducting OpenMP specific optimizations.
A discrete event simulation model for reliability modeling of a chemical plant
Authors: Bikram Sharda, Scott J. Bury
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

This paper discusses a discrete event simulation model developed to identify and understand the impact of different failures on the overall production capabilities in a chemical plant. The model will be used to understand key equipment components that contribute towards maximum production loss and to analyze the impact of a change policy on production losses. A change policy can be classified in terms of new equipment installation or increasing the stock level for the failure prone components. In this paper, we present the approach used and some preliminary results obtained from available data.
Formal Development of a Total Order Broadcast for Distributed Transactions Using Event-B
Authors: Divakar Yadav, Michael Butler
Venue: Methods, Models and Tools for Fault Tolerance (2009)

In a replicated database system, copies of the database are kept across several sites for fault-tolerance and availability. Data access in such systems is usually done within a transactional framework. A read-only transaction accesses data locally and an update transaction modifies the database at all sites. Total order broadcast primitives have been proposed to support transactions and allow fault-tolerant cooperation between the sites in a distributed system. In this paper, we identify and analyze the problem of formation of deadlocks among conflicting update transactions due to race conditions and outline how a system of total order broadcast prevents deadlocks and transaction failures. Later we outline how a refinement based approach with Event-B can be used for formal development of the models of total order broadcast. In this approach we begin with the abstract model of a total order broadcast and verify that the required ordering properties are preserved by the system. Subsequently, in a series of refinement steps we outline how an abstract total order can correctly be implemented by using a notion of sequence number. This technique requires us to discharge proof obligations due to consistency and refinement checking. To discharge the proof obligations we are required to discover invariants that describes the relationship between the abstract total order and the underlying mechanism.
Attribute-Based Relative Ranking of Robot for Task Assignment
Authors: B. B. Choudhury, B. B. Biswal, R. N. Mahapatra
Venue: Proceedings of the 2009 International Conference on Computer Engineering and Technology - Volume 01 (2009)

Availability of large number of robot configurations has made the robot workcell designers think over the issue of selecting the most suitable one for a given set of operations. The process of selection of the appropriate kind of robot must consider the various attributes of the robot manipulator in conjunction with the requirement of the various operations for accomplishing the task. The present work is an attempt to develop a systematic procedure for selection of robot based on an integrated model encompassing the manipulator attributes and manipulator requirements. The developed procedure can advantageously be used to standardize the robot selection process with view to perform a set of intended tasks. The work is also aimed at creating an exhaustive list of attributes and classifying them into different distinct categories. The coding scheme for the attributes and the relative ranking of the manipulators are illustrated with example
Per-thread cycle accounting in SMT processors
Authors: Stijn Eyerman, Lieven Eeckhout
Venue: ACM SIGPLAN Notices (2009)

This paper proposes a cycle accounting architecture for Simultaneous Multithreading (SMT) processors that estimates the execution times for each of the threads had they been executed alone, while they are running simultaneously on the SMT processor. This is done by accounting each cycle to either a base, miss event or waiting cycle component during multi-threaded execution. Single-threaded alone execution time is then estimated as the sum of the base and miss event components; the waiting cycle component represents the lost cycle count due to SMT execution. The cycle accounting architecture incurs reasonable hardware cost (around 1KB of storage) and estimates single-threaded performance with average prediction errors around 7.2% for two-program workloads and 11.7% for four-program workloads. The cycle accounting architecture has several important applications to system software and its interaction with SMT hardware. For one, the estimated single-thread alone execution time provides an accurate picture to system software of the actually consumed processor cycles per thread. The alone execution time instead of the total execution time (timeslice) may make system software scheduling policies more effective. Second, a new class of thread-progress aware SMT fetch policies based on per-thread progress indicators enable system software level priorities to be enforced at the hardware level.
Combined neural network model employing wavelet coefficients for EEG signals classification
Authors: Elif Derya Übeyli
Venue: Digital Signal Processing (2009)

This paper illustrates the use of combined neural network model to guide model selection for classification of electroencephalogram (EEG) signals. The EEG signals were decomposed into time-frequency representations using discrete wavelet transform and statistical features were calculated to depict their distribution. The first-level networks were implemented for the EEG signals classification using the statistical features as inputs. To improve diagnostic accuracy, the second-level networks were trained using the outputs of the first-level networks as input data. Three types of EEG signals (EEG signals recorded from healthy volunteers with eyes open, epilepsy patients in the epileptogenic zone during a seizure-free interval, and epilepsy patients during epileptic seizures) were classified with the accuracy of 94.83% by the combined neural network. The combined neural network model achieved accuracy rates which were higher than that of the stand-alone neural network model.
Media, affect, concession, and agreement in negotiation: IM versus telephone
Authors: Norman A. Johnson, Randolph B. Cooper
Venue: Decision Support Systems (2009)

The communication of affect, the exchange of offers, and the goal of reaching agreement are factors that play key roles in negotiation processes. Although instant messaging (IM) and phone are used for these processes, not much is known about how they influence these key factors. The present study is focused on this issue. By examining natural communication between negotiators who use these media, we find that computer mediation reduces both the amount of affect communicated and concession, which in turn decreases the likelihood of agreement. We also find that the efficacy of affect communicated is significantly reduced by computer mediation.