ppxscal/embedding_network huggingface dataset:
The PlayStation 3 for High-Performance Scientific Computing
Authors: Jakub Kurzak, Alfredo Buttari, Piotr Luszczek, Jack Dongarra
Venue: Computing in Science and Engineering (2008)

The heart of the Sony PlayStation 3, the STI CELL processor, wasn't originally intended for scientific number crunching, just as the PlayStation 3 itself wasn't meant primarily to serve such purposes. Yet, both these items could impact the high-performance computing world. This introductory article takes a closer look at the cause of this potential disturbance.
An Agent-Oriented Approach for the Dynamic Vehicle Routing Problem
Authors: Besma Zeddini, Moncef Temani, Adnan Yassine, Khaled Ghedira
Venue: Proceedings of the 2008 International Workshop on Advanced Information Systems for Enterprises (2008)

The Vehicle Routing Problem is usually treated as a static routing problem, since all information is known to the planner at the time the routing is being done. In this paper, we treat a dynamic version of the problem (DVRP) where requests arrive in a dynamic way and the solution methodology must therefore be able of promptly inserting new requests in the current vehicle rides. Due to the distributed aspect of VRPs, we propose a model based on self-organisation mechanism and a multi-agent system (MAS) to model the environment. We show that our model tackles this problem by providing vehicle agents, for a new request, to make the final decision via an auction negotiation process.
On removable circuits in graphs and matroids
Authors: Manoel Lemos, James Oxley
Venue: Journal of Graph Theory (1999)

Mader proved that every 2-connected simple graph G with minimum degree d exceeding three has a cycle C, the deletion of whose edges leaves a 2-connected graph. Jackson extended this by showing that C may be chosen to avoid any nominated edge of G and to have length at least d - 1. This article proves an extension of Jackson's theorem. In addition, a conjecture of Goddyn, van den Heuvel, and McGuinness is disproved when it is shown that a natural matroid dual of Mader's theorem fails. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 30: 51&ndash;66, 1999
MODIS tasselled cap: land cover characteristics expressed through transformed MODIS data
Authors: S. E. Lobser, W. B. Cohen
Venue: International Journal of Remote Sensing (2007)

The tasselled cap concept is extended to Moderate Resolution Imaging Spectroradiometer (MODIS) Nadir BRDF-Adjusted Reflectance (NBAR, MOD43) data. The transformation is based on a rigid rotation of principal component axes (PCAs) derived from a global sample spanning one full year of NBAR 16-day composites. To provide a standard for MODIS tasselled cap axes, we recommend an orientation in MODIS spectral band space as similar as possible to the orientation of the Landsat Thematic Mapper (TM) tasselled cap axes. To achieve this we first transformed our global sample of MODIS NBAR reflectance values to TM tasselled cap values using the existing TM transformation, then used an existing algorithm (Procrustes) to compute the transformation that minimizes the mean square difference between the TM transformed NBAR values and NBAR PCA values. This transformation can then be used as a standard to rotate the MODIS NBAR PCA axes into a new MODIS Kauth-Thomas (KT) orientation. Global land cover patterns in tasselled cap space are demonstrated graphically by linking the global sample with several other products, including the MODIS Land Cover product (MOD12) and the MODIS Vegetation Continuous Fields product (MOD44). Patterns seen at this global scale agree with previous explorations of TM tasselled cap space, but are shown here in greater detail with a globally representative sample. Temporal trends of eight smaller-scale BigFoot Project (www.fsl.orst.edu/larse/bigfoot) sites were also examined, confirming the spectral shifts in tasselled cap space related to phenology.
Location privacy via unlinkability: an alternative to cloaking and perturbation
Authors: Josep Domingo-Ferrer
Venue: Proceedings of the 2008 international workshop on Privacy and anonymity in information society (2008)

The usual approach to location privacy is to cloak and/or perturb the positions or trajectories of the mobile objects. However, if unlinkability of the various interactions between a mobile object and the service/control system can be afforded and achieved, neither cloaking nor perturbation are necessary. This results in higher privacy for the mobile object and better accuracy of the aggregated mobility information gathered by the service/control system. We illustrate the feasibility of this approach in the scenario of car-to-car communication.
A dual scale heterogeneous organizational network model
Authors: Xudong Liu, Xiaoxuan Ma, Jun Han, Xuelian Lin
Venue: Proceedings of the 13th International Conference on Parallel and Distributed Systems - Volume 01 (2007)

Organizational network is one type of complex network featured distinct hierarchical structure, and the kernel of e-Government is information sharing and exchange based on organizational network. Therefore, the establishment of a manageable, scaleable and well-performed network structure becomes one of the crucial parts of the solution to the core problem in e-Government. This paper analyzes the characteristics of administrative organizational network, explores suitable strategies for optimization of organizational network model, defines a organizational tree model, and accordingly proposes a new organizational network model---DSHON (a Dual Scale Heterogeneous Organizational Network model). The proposed model is based on the structure of organizational tree, and the network performance is successfully promoted by adding shortcuts to the original tree according to the organizational distance between and the fitness of the nodes in the network. Simulation results show that the load allocation, transmission efficiency and network connectivity robustness are effectively improved in this model.
Design of a Intelligent Computing Aided Instruction System Based on the Computer Networks
Authors: Miao Li
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

On the basis of the analysis of present CAI system, this paper presents a kind of intelligent CAI design scheme based on network. The scheme not only achieved online teaching function of CAI system, but also adopted intelligent design idea to improve the teaching quality of CAI system.
Development of an Integrated Platform for Social Collaborations Based on Semantic Peer Network
Authors: Ching-Long Yeh, Yun-Maw Cheng, Li-Chieh Chen
Venue: Proceedings of the 2008 IEEE International Conference on Sensor Networks, Ubiquitous, and Trustworthy Computing (sutc 2008) (2008)

In the emerging Web 2.0, the popular services are sharing of contents of various sorts, where user can not only be consumer but also provider of content. The current Web 2.0 services, or social software systems, are primarily implemented by using the current web technology with lightweight programming in XML. The social software systems all have their own proprietary databases. In this paper, we propose to develop an integrated platform for social collaborations that supports user autonomous management over their contents. The infrastructure of the platform is a semi-structured on peer-to-peer network, consisting of simple nodes that provide common collaborative services for user, and rendezvous nodes that provide additional information aggregation services for node users. Through the collaboration service interface user can access the services used to see in social software, including weblog, wiki, annotation, bookmark sharing, etc.
Robust 4D segmentation of cells in confocal images
Authors: Damien Mischler, Barbara Romaniuk, Aassif Benassarou, Eric Bittar
Venue: Machine Graphics Vision International Journal (2006)

We present a method to automatically extract the evolution of the cell envelope in 4D confocal images. Our method is based on 4DReAM, a tracking system consisting of a previously presented deformable surface model, which can change its topology. The process consists in attracting the model for each volume of a 4D series towards an iso-surface of interest, and towards the image gradients. We then statistically estimate the characteristics of the cell surface on the nodes of the model, and reconstruct it. We show detailed results on the segmentation of the cell envelope during the mitosis.
Automatic extraction of paralinguistic information using prosodic features related to F0, duration and voice quality
Authors: Carlos Toshinori Ishi, Hiroshi Ishiguro, Norihiro Hagita
Venue: Speech Communication (2008)

The use of acoustic-prosodic features related to F0, duration and voice quality is proposed and evaluated for automatic extraction of paralinguistic information (intentions, attitudes, and emotions) in dialogue speech. Perceptual experiments and acoustic analyses were conducted for monosyllabic interjections spoken in several speaking styles, conveying a variety of paralinguistic information. Experimental results indicated that the classical prosodic features, i.e., F0 and duration, were effective for discriminating groups of paralinguistic information expressing intentions, such as affirm, deny, filler, and ask for repetition, and accounted for 57% of the global detection rate, in a task of discriminating seven groups of paralinguistic information. On the other hand, voice quality features were effective for identifying part of the paralinguistic information expressing emotions or attitudes, such as surprised, disgusted and admired, leading to a 12% improvement in the global detection rate.
Tractability of parameterized completion problems on chordal and interval graphs: minimum fill-in and physical mapping
Authors: H. Kaplan
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We study the parameterized complexity of several NP-Hard graph completion problems: The minimum fill-in problem is to decide if a graph can be triangulated by adding at most k edges. We develop an O(k/sup 5/ mn+f(K)) algorithm for the problem on a graph with n vertices and m edges. In particular, this implies that the problem is fixed parameter tractable (FPT). proper interval graph completion problems, motivated by molecular biology, ask for adding edges in order to obtain a proper interval graph, so that a parameter in that graph does not exceed k. We show that the problem is FPT when k is the number of added edges. For the problem where k is the clique size, we give an O(f(k)n/sup k-1/) algorithm, so it is polynomial for fixed k. On the other hand, we prove its hardness in the parameterized hierarchy, so it is probably not FPT. Those results are obtained even when a set of edges which should not be added is given. That set can be given either explicitly or by a proper vertex coloring which the added edges should respect.
Graphical Methods for Efficient Likelihood Inference in Gaussian Covariance Models
Authors: Mathias Drton, Thomas S. Richardson
Venue: The Journal of Machine Learning Research (2008)

In graphical modelling, a bi-directed graph encodes marginal independences among random variables that are identified with the vertices of the graph. We show how to transform a bi-directed graph into a maximal ancestral graph that (i) represents the same independence structure as the original bi-directed graph, and (ii) minimizes the number of arrowheads among all ancestral graphs satisfying (i). Here the number of arrowheads of an ancestral graph is the number of directed edges plus twice the number of bi-directed edges. In Gaussian models, this construction can be used for more efficient iterative maximization of the likelihood function and to determine when maximum likelihood estimates are equal to empirical counterparts.
Modeling the formation of spontaneous wafer direct bonding under low temperature
Authors: Zirong Tang, Tielin Shi, Guanglan Liao, Shiyuan Liu
Venue: Microelectronic Engineering (2008)

Low temperature wafer direct bonding is one of critical technologies in micro/nano fabrication. In this study, a description of interfacial requirements for spontaneous wafer direct bonding under low temperature is proposed. The model relates the occurrence of bonding to interfacial adhesion energy, interfacial nano-topography and elasticity of wafers. Its derivation is based on Johnson-Kendall-Roberts (JKR) theory and a competition between the bonding energy and the deformation of interfacial micro/nano-roughness. The analysis identifies three bonding possibilities, namely spontaneous bonding without voids, spontaneous bonding with voids, and bonding under external pressure with gap or un-bondable. To verify the model, experiments were carried out for silicon wafers with different surface nano-scale roughness.
Source-level debugging with the whyline
Authors: Andrew J. Ko, Brad A. Myers
Venue: Proceedings of the 2008 international workshop on Cooperative and human aspects of software engineering (2008)

The visualizations of the Whyline are presented, which focus on supporting the exploration a source code and how it executes. The visualization is concise, simple to navigate, and mimics syntactic features of its target programming language for consistency. Two studies showed that users with the visualization completed a debugging task twice as fast as users without the visualization, partly due to features of the visualization. Applications of the visualizations to tasks other than debugging are discussed.
Telephony shoot-out
Authors: Dan Sawyer
Venue: Linux Journal (2008)

A little detective work uncovers the right VoIP solution for Podcast recording in Linux.
Design and implementation of VoIP device management scheme in SOHO environments
Authors: Sangwoo Jin, Gyehyeon Gyeong, Young Ik Eom
Venue: Proceedings of the 2nd international conference on Ubiquitous information management and communication (2008)

Internet telephone uses VoIP as its communication protocol, where it provides various additional services with inexpensive fare when the terminal is connected to the Internet. The existing auto-provisioning systems that manage Internet telephone terminals are targeting large size VoIP service providers or enterprises, and have few considerations on the convenience of management for small size environments. The difficult installation and management procedure of the current auto-provisioning systems prevents Internet telephone system from getting popular. Easy installation and management system is needed in order to spread out Internet telephone system. In this paper, we design and implement the auto-provisioning system that provides easy installation and management services in small size environments such as SOHO environments.
Open Source Software in Industry
Authors: Christof Ebert
Venue: IEEE Software (2008)

Many of today's most innovative products and solutions are developed on the basis of free and open source software (FOSS).
Reliable Opto-Electronic Hybrid Interconnection Network
Authors: Liquan Xiao, Kefei Wang
Venue: Proceedings of the The International Symposium on Parallel Architectures, Algorithms, and Networks (2008)

The interconnection network plays a critical role in the cost and performance of a high performance parallel computer and it is closely related with signaling technology. Electrical signaling is inexpensive but limited in range by the frequency dependent attenuation. Emerging optical technology enables new topologies by allowing links to cover large distances but at a significant premium in cost. In addition, parallel transmission presents low latency but its frequency limited by the timing skew. Serial transmission greatly improves the signaling rate but it needs added latency to re-synchronize data. This paper describes the Reliable Opto-Electronic Hybrid Interconnection Network (ROEHIN). ROEHIN exploits emerging high-speed optical and electrical links, parallel and serial transmission to provide cost effective scalability. The ROEHIN router is an 8x8 ASIC, which supports adaptive source-base routing and multicast communication. The ROEHIN topology and packaging takes advantage of signaling technology and provides graceful degradation in the presence of faults.
A Novel Reputation Computing Model for Mobile Agent-Based E-Commerce Systems
Authors: Zaobin Gan, Yijie Li, Guoqiang Xiao, Dengwen Wei
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

Mobile Agent based e-commerce systems are increasingly drawing more and more attention in recent years. However, there exist some transaction risks while enabling agents make purchase decisions and exploit information to other unknown agents in the virtual markets. Trust and reputation are widely introduced to mitigate this risk by deriving the trustworthiness of certain agent from his transaction history. Despite existing of some proposed reputation-based trust models addressing the above issue, most of them cannot readily be used since there are many unforseen changes in the electronic markets. To this end, this paper proposes a novel reputation computing model that integrates a direct reputation and a recommended reputation. Specially, we present a three-factor method to evaluate the direct reputation from personal self-experience, and adopt the vector similarity to evaluate the recommendation credibility that can effectively detect the dishonest recommendations. In addition, we amend the short term reputation and penalty factor metric to make our mechanism effective in detecting malicious agents with strategic behavior. Our experiments show that the model is highly dependable and effective.
Intra Domain Route Optimization for Ubiquitous
Authors: Hye-Young Kim, Young-Sik Jeong, Laurence T. Yang
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

The main advantage of a wireless network is user mobility, which calls for efficient routing support at the network layer. An architecture combines Hierarchical Mobile IPv6 and Network Mobility for a network mobile and mobile nodes move in tandem and make a hierarchy in the wireless network to management of micro-mobility and seamless handoff. But the capability of the architecture for intra domain route optimization is impaired. So we propose a functionality in domain nodes to enable intra domain path optimization for ubiquitous network. It is shown that intra domain cost effect is beneficial in every hierarchical domain that span mesh network topology. We address the key function for our proposed scheme and simulate the usefulness of our proposed method using mathematically analyze. We then testify that the proposal has best performance compared with Network Mobility protocol.
Human-competitive machine invention by means of genetic programming
Authors: John r. Koza
Venue: Artificial Intelligence for Engineering Design, Analysis and Manufacturing (2008)

Genetic programming is a systematic method for getting computers to automatically solve problems. Genetic programming uses the Darwinian principle of natural selection and analogs of recombination (crossover), mutation, gene duplication, gene deletion, and certain mechanisms of developmental biology to progressively breed, over a series of many generations, an improved population of candidate solutions to a problem. This paper makes the points that genetic programming now routinely delivers human-competitive machine intelligence for problems of automated design and can serve as an automated invention machine.
Black Box, Pandora's Box or Virtual Toolbox? An Experiment in a Journal's Transparent Peer Review on the Web
Authors: Paul Maharg, Nigel Duncan
Venue: International Review of Law, Computers and Technology (2007)

We all accept that peer review is an essential part of journal publication in all disciplines, but almost everyone is agreed that it could be improved. This article describes an experiment in peer review with a legal education journal The Law Teacher. It reports on the process, and describes ways in which the process can be improved for the future.
Special Evaluation: A Practical Simulation-Based Method for Accurate Performance Evaluation of Routing Protocols in Wireless Sensor Networks
Authors: Ehsan Ahvar, Mahmood Fathy
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Some simulators were designed for wireless sensor networks. The main goal of these simulators is to provide a framework to closely model and simulate various sensor networks scenarios. Two important factors for accurate evaluation are simulator and method of simulation. In this paper, we don’t want to produce a new simulator for sensor networks. We will show how to use current simulators for getting accurate results. On the other hand, we will talk about the role of evaluation methods in simulation results and show current evaluation method; analysis of routing protocols based on results of finite states of network, isn’t an exact evaluation for using in a special application for sensor networks. Then we offer a method for accurate and practical evaluation of routing protocols in sensor networks. We name it Special evaluation method and compare it with traditional evaluation method. Then, we show that our offer method has more accurate results than traditional evaluation method. Finally, We find reasons of result difference between two methods.
Modeling and simulation of hybrid systems using a special class of timed Petri net
Authors: Abolfazl Jalilvand, Sohrab Khanmohammadi, Fereidoon Shabani Nia
Venue: Proceedings of the 9th International Conference on Circuits (2005)

Dynamic systems with a mix of continuous and discrete components called hybrid systems frequently arise in engineering applications. By modeling these different components using differential equations and discrete events, it is possible to represent a wide range of phenomena present in physical and technological systems. Since many of these applications are safety critical, it is important to use reliable methods to simulate hybrid systems. This paper deals with modeling and simulation of hybrid systems using an extended form of timed Petri net. The proposed method is used for modeling of an illustrative hybrid system example. The simulation results are obtained by a modified Petri net toolbox.
Step-and-scan maskless lithography for ultra large scale DNA chips
Authors: Omar D. Negrete, Franco Cerrina
Venue: Microelectronic Engineering (2008)

A maskless photolithography test bed was constructed to examine the requirements for stepper-based synthesis of Ultra Large Scale DNA chips (ULS-DNA chips). The test bed is based on a microscope optical layout with a 5xreduction imaging lens and micro/nano controlled staging at the image plane. Spatial light modulation is enabled by a Digital Micromirror Device (Texas Instruments DMD 0.7XGA) and the positioning system is composed of a piezoelectric nano-positioner (nPoint Inc., Madison, WI) mounted on a high precision linear-motor stage (Newport Corp., Irvine, CA). With this test bed we examined the requirements of overlay and alignment in a stepper-based DNA microarray synthesis system. We demonstrated multi-field chip synthesis with a spot size of 3.15@mm at the 5xreduction. All tests were verified by standard hybridization, and fluorescence microscopy. In addition to our demonstration of step-and-scan lithography for DNA chip synthesis, we drafted and modeled an imaging optic for a production scale tool capable of synthesizing DNA chips containing up to 20 million pixels.