ppxscal/embedding_network huggingface dataset:
The shared-thread multiprocessor
Authors: Jeffery A. Brown, Dean M. Tullsen
Venue: Proceedings of the 22nd annual international conference on Supercomputing (2008)

This paper describes initial results for an architecture called the Shared-Thread Multiprocessor (STMP). The STMP combines features of a multithreaded processor and a chip multiprocessor; specifically, it enables distinct cores on a chip multiprocessor to share thread state. This shared thread state allows the system to schedule threads from a shared pool onto individual cores, allowing for rapid movement of threads between cores. This paper demonstrates and evaluates three benefits of this architecture: (1) By providing more thread state storage than available in the cores themselves, the architecture enjoys the ILP benefits of many threads, but carries the in-core complexity of supporting just a few. (2) Threads can move between cores fast enough to hide long-latency events such as memory accesses. This enables very-short-term load balancing in response to such events. (3) The system can redistribute threads to maximize symbiotic behavior and balance load much more often than traditional operating system thread scheduling and context switching.
Unsupervised identification of useful visual landmarks using multiple segmentations and top-down feedback
Authors: Pablo Espinace, Daniel Langdon, Alvaro Soto
Venue: Robotics and Autonomous Systems (2008)

In this paper, we tackle the problem of unsupervised selection and posterior recognition of visual landmarks in image sequences acquired by an indoor mobile robot. This is a highly valuable perceptual capability for a wide variety of robotic applications, in particular autonomous navigation. Our method combines a bottom-up data driven approach with top-down feedback provided by high level semantic representations. The bottom-up approach is based on three main mechanisms: visual attention, area segmentation, and landmark characterization. As there is no segmentation method that works properly in every situation, we integrate multiple segmentation algorithms in order to increase robustness of the approach. In terms of top-down feedback, this is provided by two information sources: (i) An estimation of the robot position that reduces the searching scope for potential matches with previously selected landmarks, (ii) A set of weights that, according to the results of previous recognitions, controls the influence of each segmentation algorithm in the recognition of each landmark. We test our approach with encouraging results in three datasets corresponding to real-world scenarios.
Oscillators for Modeling Biomass Growth Adaptation to Circadian Rhythms
Authors: Jaromír Fier, Pavel Zítek, Jan Cervený
Venue: Proceedings of the Tenth International Conference on Computer Modeling and Simulation (2008)

Two types of oscillators suitable for modeling the growth rate adaptation of biomass production process to circadian influences are presented and compared. These oscillators are forced by cyclic inputs representing basically the diurnal cycles corresponding to the periodical changes of light and dark phases and adapt their own natural circadian rhythm to them. This adaptation is referred to as entrainment and the oscillators considered for this circadian rhythm entrainment are based on Van der Pol and Lorenz type models. The Van der Pol type oscillator is proposed in a matrix form and subsequently compared with a generalized Lorenz model. The proposed oscillators are linked to a delayed Volterra model and the generic structure is applied to the case of cyanobacteria population growth. Using data recently obtained from the measurements on a laboratory-scale photobioreactor the parameters of oscillators are tuned to fit measured excited growth responses of cyanobacteria concentration.
Effective load balancing for cluster-based servers employing job preemption
Authors: Victoria Ungureanu, Benjamin Melamed, Michael Katehakis
Venue: Performance Evaluation (2008)

A cluster-based server consists of a front-end dispatcher and multiple back-end servers. The dispatcher receives incoming jobs, and then decides how to assign them to back-end servers, which in turn serve the jobs according to some discipline. Cluster-based servers have been widely deployed, as they combine good performance with low costs. Several assignment policies have been proposed for cluster-based servers, most of which aim to balance the load among back-end servers. There are two main strategies for load balancing: The first aims to balance the amount of workload at back-end servers, while the second aims to balance the number of jobs assigned to back-end servers. Examples of policies using these strategies are Dynamic and LC (Least Connected), respectively. In this paper we propose a policy, called LC*, which combines the two aforementioned strategies. The paper shows experimentally that when preemption is admitted (i.e., when jobs execute concurrently on back-end servers), LC* substantially outperforms bothDynamic and LC in terms of response-time metrics. This improved performance is achieved by using only information readily available to the dispatcher, rendering LC* a practical policy to implement. Finally, we study a refinement, called ALC* (Adaptive LC*), which further improves on the response-time performance of LC* by adapting its actions to incoming traffic rates.
Grid Resource Management System and Semantic Information System
Authors: Hyung-Lae Kim, Tae-Nyun Kim, Chang-Sung Jeong
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

In this paper, we present semantic Grid management system (SGMS) and semantic information system (SIS) for efficient Grid application execution services. SGMS is a centralized Grid service middleware for executing resource allocation, data distribution, job execution, and monitoring by using agent based resource management system. SIS is an advanced service broker based on web service and ontology for Grid computing environment. Both SGMS and SIS have web services to communication with other Grid services and to provide uniform service interfaces.
Portable Storage and Data Loss
Authors: Stephen Farrell
Venue: IEEE Internet Computing (2008)

Data loss or leakage occurs in many organizations, frequently with significant impacts, both in terms of incident-handling costs and of damage to the organization's reputation. The author briefly considers some recent incidents, describes some practical mitigation steps, and looks at how to plan, in advance, for handling such events.
A Coordination Model for Improving Software System Attack-Tolerance and Survivability in Open Hostile Environments
Authors: Shangping Ren, Yue Yu, Kevin A. Kwiat, Jeffrey Tsai
Venue: International Journal of Distributed Sensor Networks (2007)

This paper presents a coordination model that contains three active entities: actors, roles, and coordinators. Actors abstract the system's functionalities while roles and coordinators statically encapsulate coordination constraints and dynamically propagate these constraints among themselves and onto the actors. A software system's attack-tolerance and survivability in open hostile environments are enhanced through appropriate constraint propagations and constraint enforcements. The role represents a group of actors that share the same set of behaviors declared by the role. Coordination and coordination constraints in the model are categorized into two classes: inter-role coordination and intra-role coordination. The coordinators are responsible for inter-role coordination; while the roles are not only abstractions for a set of behaviors they also coordinate the actors which share the same role. This setting implies that both the coordination constraints and coordination activities are decentralized and distributed among the coordinators and the roles. The decentralization not only shields the system from single point of failures, but also provides a foundation that survivable feedback loops can be built upon. The survivable feedback loops presented in the model resist the contamination of the system by faulty elements and thereby protect the whole system from being broken down by single failures.
Efficient Projection for Compressed Sensing
Authors: Vo Dinh Minh Nhat, Duc Vo, Subhash Challa, SungYoung Lee
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Compressed sensing (CS), a joint compression and sensing process, is a emerging field of activity in which the signal is sampled and simultaneously compressed at a greatly reduced rate. In CS, the projection matrix is chosen at random which would lead to inefficient performance of CS. Recently, an optimized projection (OP) was chosen such that it leads to better coherence of the effective dictionary, leading substantially better CS reconstruction performance. This is the only recent work related to the optimization of projection matrix, but the major drawback of this approach is that its algorithm is an iterative and high complexity one. It is considered that an efficient and lightweight algorithm for designing projection matrix would usefully supplement and enhance the performance of CS. In this paper, we propose an algorithm to obtain such an projection matrix called efficient projection (EP) which is designed in such a way that the new projected dictionary will have the structure as much similar as the original dictionary. For this purpose, we use Multidimensional Scaling (MDS) technique which helps to find a low-dimensional new projected dictionary such that the pairwise distances between new atoms in this new projected dictionary match as well as possible the original atoms in original dictionary. This leads to a solution for EP which is very simple and can be obtained by doing singular value decomposition of original dictionary. The experiments show the novelty of our approach when it can gain a comparative performance with a very low complexity compared to that of OP.
ASRTS: An Agent-Based Simulator for Real-Time Schedulers
Authors: Moutaz Saleh, Zulaiha Ali Othman, Abdullah Mohd Zin
Venue: Proceedings of the 2008 Second Asia International Conference on Modelling & Simulation (AMS) (2008)

In response to the complexity of communication networks, simulation was and remains the only way to evaluate network performance. Unfortunately, traditional simulation methods are not adapted to all networks such as networks with quality of service and networks with dynamic aspect. To overcome this limitation, a new method to simulate dynamic networks based on multi-agents simulation had been proposed. In this paper, we introduce a timely-constrained Agent-based Simulator for Real-Time Schedulers (ASRTS). Our Simulator not only provides the underlying software to build autonomous agents, but also it has the capability to express and enforce timing constraints on actions if the real-time schedulers decide to benefit from the flexible and responsive nature of agents in a multi-agent system.
Why MSN Lost to QQ in China Market? Different Privacy Protection Design
Authors: Zhaoli Meng, Meiyun Zuo
Venue: Proceedings of the 2008 International Conference on Information Security and Assurance (isa 2008) (2008)

International software providers have entered the Chinese market in recent years. One typical example is MSN. As an indigenous IT product, QQ provides almost the same functions as MSN and has competed with MSN for years. Market surveys indicate that QQ dominates the local instant message market. Why did QQ win the battle with MSN in the Chinese market? In this paper, we investigate the detailed designs of MSN vs. QQ, focusing in particular on their privacy protection. We find that, in general, users’ privacy concern level is low in China. Users show inclination to be connected with strangers in a virtual community. They may trade off certain levels of privacy protection to gain the chance of visiting by strangers. Moreover, the position of control could mitigate users’ privacy concerns. Indigenous IT products, such as QQ, understand and leverage users’ behavior. By lowering privacy protection and providing various control tools, QQ successfully caters to the need of a young generation in China, the main Internet users in China. Such results shed light on how to survive in the Chinese market for international IT product providers.
Microelectronic Circuit Design, 3rd edition
Authors: Travis N. Blalock
Venue:  (2007)

This preview guide presents the first 10 chapters of the our new title by Richard Jaeger: Microelectronic Circuit Design. This cutting edge new text develops a comprehensive understanding of the basic techniques of modern electronic circuit design, analog and digital, discrete and integrated. Digital electronics has evolved to be an extremely important area of circuit design, but it is included almost as an after-thought in the majority of introductory electronics texts. This book presents a much more balanced coverage of analog and digital circuits. The writing integrates the author's extensive industrial backround in precision analog and digital design with his many years of experience in the classroom.
An Empirical Study on the Capacity and Performance of 3G Networks
Authors: Wee Lum Tan, Fung Lam, Wing Cheong Lau
Venue: IEEE Transactions on Mobile Computing (2008)

This paper presents the findings of an extensive measurement study on multiple commercial 3G networks. We have investigated the performance of those 3G networks in terms of their data throughput, latency, video and voice calls handling capacities, and their ability to provide service guarantees to different traffic classes under saturated and lightly-loaded network conditions. Our findings point to the diverse nature of the network resources allocation mechanisms and the call admission control policies adopted by different operators. It is also found that the 3G network operators seem to have extensively customized their network configurations in a cell-by-cell manner according to the individual site's local demographics, projected traffic demand and the target coverage area of the cell. As such, the cell capacity varies widely not only across different operators but also across different measurement sites of the same operator. The results also show that it is practically impossible to predict the actual capacity of a cell based on known theoretical models and standard parameters, even when supplemented by key field measurements such as the received signal-to-noise ratio (Ec/N0)
Closing information loops with extended PLM
Authors: Riaz Ahmad, Fan Yuqing, Zhilun Cheng, Zou Jihua
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Aerospace and automobile industry today is faced with intense market competition. Enterprise ability to customization, time to market and competitive price is recipe for wining markets. Two most common approaches taken by the enterprise to attain said objective are out sourcing of design, and effective reuse of their intellectual capital. In either case product lifecycle management is powerful enabler, that dictates for integrated information systems that cover all phases of lifecycle. Also, multidisciplinary teams sharing information at global level, during product development and in the phases beyond call for collaborative information systems. Born in CIM, PLM holds the promise for seamlessly integrating information throughout the phases of product's lifecycle[1]. Using Teamcenter enterprise as PLM system, in this paper we instantiate some customized views, with discussion about related PLM aspect. Then we propose a trace and track system for physical product after it has been delivered to user. PLM concept with support of electronic product code information system (EPCIS) has been extended to ePLM.
Pooled ANOVA
Authors: Michael Last, Gheorghe Luta, Alex Orso, Adam Porter, Stan Young
Venue: Computational Statistics Data Analysis (2008)

We introduce Pooled ANOVA, a greedy algorithm to sequentially select the rare important factors from a large set of factors. Problems such as computer simulations and software performance tuning involve a large number of factors, few of which have an important effect on the outcome or performance measure. We pool multiple factors together, and test the pool for significance. If the pool has a significant effect we retain the factors for deconfounding. If not, we either declare that none of the factors are important, or retain them for follow-up decoding, depending on our assumptions and stage of testing. The sparser important factors are, the bigger the savings. Pooled ANOVA requires fewer assumptions than other, similar methods (e.g. sequential bifurcation), such as not requiring all important effects to have the same sign. We demonstrate savings of 25%-35% when compared to a conventional ANOVA, and also the ability to work in a setting where Sequential Bifurcation fails.
Civil Society and Cyber Society: The Role of the Internet in Community Associations and Democratic Politics
Authors: Michael J. Jensen, James N. Danziger, Alladi Venkatesh
Venue: The Information Society (2006)

A healthy civil society has long been held as vital to a healthy democracy and there is interest in whether the Internet affects this linkage. This paper explores the relationships between offline and online modes of associational life and also analyzes offline and online interactions with local governments in the US context. Based on our empirical analyses of 1,203 respondents, we show that online participation is not simply an extension of offline participation, but can be distinguished in important ways. First, we find that political and community-oriented engagements cluster separately from more private-regarding engagements. Second, participants of online democratic engagement are not characterized by the SES markers associated with offline democratic engagement who are older, have higher incomes, and have lived in the community longer. Finally, we find significant links between democratic engagement with the political system and involvement with political associations (but not social and community-oriented associations).
Hamiltonicity and forbidden subgraphs in 4-connected graphs
Authors: Florian Pfender
Venue: Journal of Graph Theory (2005)

Let T be the line graph of the unique tree F on 8 vertices with degree sequence (3,3,3,1,1,1,1,1), i.e., T is a chain of three triangles. We show that every 4-connected {T, K1,3}-free graph has a hamiltonian cycle. &copy; 2005 Wiley Periodicals, Inc. J Graph Theory 49: 262272, 2005
A Fast and Optimal Method Based on Fuzzy Neural Networks for SINS Initial Alignment
Authors: Xu Bo, Sun Feng, Yu Fei, Liu Fuqiang
Venue: Proceedings of the First International Workshop on Knowledge Discovery and Data Mining (2008)

The paper presents an approach which applies LQ optimal control in Strap-down Inertial Navigation System (SINS) initial alignment. The detailed analysis process about this method has been shown, and anti-jamming designs were done for the approximate step-wise disturbance which appeared in the system, to gain the optimal control parameter, the fuzzy neural network is used in the method. Simulations are performed to validate the scheme for initial alignment, obtained the same precision to other alignment method. And the most splendid was that the using of the LQ optimal control reduces the alignment time consumedly, much more quickly than other traditional method. What is discovered in the simulation is while the initial error angles were smaller than 10 rees; error angle will converge to quite good cision in several seconds.
A New Image Steganography Based on 2k Correction and Edge-Detection
Authors: Jae-Gil Yu, Eun-Joon Yoon, Sang-Ho Shin, Kee-Young Yoo
Venue: Proceedings of the Fifth International Conference on Information Technology: New Generations (2008)

In this paper, we propose a new image steganography scheme which is a kind of spatial domain technique. In order to hide secret data in cover-image, we use the just noticeabledifference (JND) technique and method of contrast sensitivity function (CSF). This is an edge-detection which uses part information of each pixel-value. In order to have better imperceptibility, we propose a mathematical method which is the 2k correction. Proposed scheme can embed more data than previous schemes [6, 5, 13], and shows better imperceptibility. To prove this scheme, we performed several experiments, and compared the experimental results with the related previous works.
An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms
Authors: T. Leighton, S. Rao
Venue: Proceedings of the 29th Annual Symposium on Foundations of Computer Science (1988)

A multicommodity flow problem is considered where for each pair of vertices (u, v) it is required to send f half-units of commodity (u, v) from u to v and f half-units of commodity (v, u) from v to u without violating capacity constraints. The main result is an algorithm for performing the task provided that the capacity of each cut exceeds the demand across the cut by a Theta (log n) factor. The condition on cuts is required in the worst case, and is trivially within a Theta (log n) factor of optimal for any flow problem. The result can be used to construct the first polylog-times optimal approximation algorithms for a wide variety of problems, including minimum quotient separators, 1/3-2/3 separators, bifurcators, crossing number, and VLSI layout area. It can also be used to route packets efficiently in arbitrary distributed networks.
Brief Communication: On the use of overlapping lattices for screening to find pairs of nearby points in two and three dimensions
Authors: Vineet Sangar, Victor I. Lesk, Arthur M. Lesk
Venue: Computational Biology and Chemistry (2008)

In designing an algorithm to find pairs of points that are within Euclidean distance d it is effective to use a screening procedure to reject most pairs of points that are far apart. A procedure based on multiple, overlapping lattices can efficiently identify close points and exclude distant ones.
Refining a triangulation of a planar straight-line graph to eliminate large angles
Authors: S. A. Mitchell
Venue: Proceedings of the 1993 IEEE 34th Annual Foundations of Computer Science (1993)

We show that any planar straight line graph (PSLG) with v vertices can be triangulated with no angle larger than 7/spl pi//8 by adding O(v/sup 2/log v) Steiner points in O(v/sup 2/log/sup 2/ v) time. We first triangulate the PSLG with an arbitrary constrained triangulation and then refine that triangulation by adding additional vertices and edges. We follow a lazy strategy of starting from an obtuse angle and exploring the triangulation in search of a sequence of Steiner points that will satisfy a local angle condition. Explorations may either terminate successfully (for example at a triangle vertex), or merge. Some PSLGs require /spl Omega/(v/sup 2/) Steiner points in any triangulation achieving any largest angle bound less than /spl pi/. Hence the number of Steiner points added by our algorithm is within a log v factor of worst case optimal. For most inputs the number of Steiner points and running time would be considerably smaller than in the worst case.