ppxscal/embedding_network huggingface dataset:
Adaptive hierarchical scheduling policy for enterprise grid computing systems
Authors: J. H. Abawajy
Venue: Journal of Network and Computer Applications (2009)

In an enterprise grid computing environments, users have access to multiple resources that may be distributed geographically. Thus, resource allocation and scheduling is a fundamental issue in achieving high performance on enterprise grid computing. Most of current job scheduling systems for enterprise grid computing provide batch queuing support and focused solely on the allocation of processors to jobs. However, since I/O is also a critical resource for many jobs, the allocation of processor and I/O resources must be coordinated to allow the system to operate most effectively. To this end, we present a hierarchical scheduling policy paying special attention to I/O and service-demands of parallel jobs in homogeneous and heterogeneous systems with background workload. The performance of the proposed scheduling policy is studied under various system and workload parameters through simulation. We also compare performance of the proposed policy with a static space-time sharing policy. The results show that the proposed policy performs substantially better than the static space-time sharing policy.
Settling the complexity of computing two-player Nash equilibria
Authors: Xi Chen, Xiaotie Deng, Shang-Hua Teng
Venue: Journal of the ACM (JACM) (2009)

We prove that Bimatrix, the problem of finding a Nash equilibrium in a two-player game, is complete for the complexity class PPAD (Polynomial Parity Argument, Directed version) introduced by Papadimitriou in 1991. Our result, building upon the work of Daskalakis et al. [2006a] on the complexity of four-player Nash equilibria, settles a long standing open problem in algorithmic game theory. It also serves as a starting point for a series of results concerning the complexity of two-player Nash equilibria. In particular, we prove the following theorems: &mdash;Bimatrix does not have a fully polynomial-time approximation scheme unless every problem in PPAD is solvable in polynomial time. &mdash;The smoothed complexity of the classic Lemke-Howson algorithm and, in fact, of any algorithm for Bimatrix is not polynomial unless every problem in PPAD is solvable in randomized polynomial time. Our results also have a complexity implication in mathematical economics: &mdash;Arrow-Debreu market equilibria are PPAD-hard to compute.
High performance on-chip differential signaling using passive compensation for global communication
Authors: Ling Zhang, Yulei Zhang, Akira Tsuchiya, Masanori Hashimoto, Ernest S. Kuh, Chung-Kuan Cheng
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

To address the performance limitation brought by the scaling issues of on-chip global wires, a new configuration for global wiring using on-chip lossy transmission lines is proposed and optimized. We propose a signaling structure to compensate the distortion and attenuation of on-chip transmission lines, which uses passive compensation and inserts repeated transceivers composing sense amplifiers and inverter chains. An optimization flow for designing this scheme based on eye-diagram prediction and sequential quadratic programming (SQP) is devised. This flow is used to study the latency, power dissipation and throughput performance of the new global wiring scheme as the technology scales from 90 nm to 22 nm. Comparing to repeated RC wire, experimental results demonstrate that at 22 nm technology node, the new scheme can reduce the normalized delay by 80%-95%, the normalized energy consumption by 50%-94%. The normalized latency is 10 ps/mm, the energy per bit is 20 pJ/m, and the throughput is 15 Gbps/&mu;m. All performance metrics are scalable with technology, which makes this approach a potential candidate to break the "interconnect wall" of digital system performance.
A Robust Active Appearance Models Search Algorithm
Authors: Yong-Fong Lin, Chih-Wei Tang
Venue: Proceedings of the 9th Pacific Rim Conference on Multimedia: Advances in Multimedia Information Processing (2008)

With the aid of AAMs search algorithm, Active Appearance Models (AAMs) can represent non-rigid image objects with shape and texture variations well. However, the performance of the traditional AAMs search algorithm(TAAMS) is limited by its assumption that the error function is convex. Therefore, this paper proposes a robust AAMs search algorithm (RAAMS) which combines the multi-pose search (MS) for better pose matching and an estimation mechanism of parameter search direction (EPSD) for more accurate search direction. Moreover, a precaution mechanism of local minimum (PLM) is proposed to avoid the search trapped into the local minimum of the error function. Experimental results show that the proposed algorithm can significantly reduce 36.41% of shape error and 30.81% of texture error between the synthesized instance and target image.
Effect of evaluators' cognitive style on heuristic evaluation: Field dependent and field independent evaluators
Authors: Chen Ling, Gavriel Salvendy
Venue: International Journal of Human-Computer Studies (2009)

Heuristic evaluation is a widely used usability evaluation method [Rosenbaum et al., 2000. A toolkit for strategic usability: results from workshops, panels, and surveys. In: Little, R., Nigay, L. (Eds.), In: Proceedings of ACM CHI 2000 Conference, New York, pp. 337-344]. But it suffers from large variability in the evaluation results due to differences among evaluators [Nielsen, 1993. Usability Engineering. Academic Press, Boston, MA]. The evaluation performance of evaluators with two types of cognitive styles-ten field independent (FI) subjects and ten field dependent (FD) subjects were compared. The results indicated that the FI subjects produced evaluation results with significantly higher thoroughness (t"1"8=3.49, p=0.0026), validity (t"1"8=4.26, p=0.0005), effectiveness (t"1"8=5.14, p=0.0001), and sensitivity (t"1"8=3.16, p=0.005) than the FD subjects. When assessing their own evaluation experiences, the FI subjects felt it was easier to find usability problems than the FD subjects (t"1"8=2.10, p=0.049), but the FD subjects felt more guided during the evaluation than the FI subjects (t"1"8=2.28, p=0.035).
Answering the call for more accountability: applying data profiling to museum metadata
Authors: Seth van Hooland, Yves Bontemps, Seth Kaufman
Venue: Proceedings of the 2008 International Conference on Dublin Core and Metadata Applications (2008)

Although the issue of metadata quality is recognized as an important topic within the metadata research community, the cultural heritage sector has been slow to develop methodologies, guidelines and tools for addressing this topic in practice. This paper concentrates on metadata quality specifically within the museum sector and describes the potential of data-profiling techniques for metadata quality evaluation. A case study illustrates the application of a general-purpose data-profiling tool on a large collection of metadata records from an ethnographic collection. After an analysis of the results of the case-study the paper reviews further steps in our research and presents the implementation of a metadata quality tool within an open-source collection management software.
Adaptive granular local search heuristic for a dynamic vehicle routing problem
Authors: Rodrigo Moretti Branchini, Vinícius Amaral Armentano, Arne Løkketangen
Venue: Computers and Operations Research (2009)

The advance of communication and information technologies based on satellite and wireless networks have allowed transportation companies to benefit from real-time information for dynamic vehicle routing with time windows. During daily operations, we consider the case in which customers can place requests such that their demand and location are stochastic variables. The time windows at customer locations can be violated although lateness costs are incurred. The objective is to define a set of vehicle routes which are dynamically updated to accommodate new customers in order to maximize the expected profit. This is the difference between the total revenue and the sum of lateness costs and costs associated with the total distance traveled. The solution approach makes use of a new constructive heuristic that scatters vehicles in the service area and an adaptive granular local search procedure. The strategies of letting a vehicle wait, positioning a vehicle in a region where customers are likely to appear, and diverting a vehicle away from its current destination are integrated within a granular local search heuristic. The performance of the proposed approach is assessed in test problems based on real-life Brazilian transportation companies.
Fault Tolerant Flip-Flop Design for Ultra-Low PowerSubthreshold Logic: Design and Analysis
Authors: Gaurav Dukle
Venue:  (2008)

Low power consumption and radiation hardness aregenerally competing requirements for spaceelectronics as well as many earth-bound highreliability applications. Recently, subthresholdlogic has emerged as a technology that can deliverthe theoretical minimum energy per computation byrunning at ultra-low levels. The resultingperformance degradation is tolerable due the dramaticincrease in energy efficiency. However, operatingcircuits at such low voltages decreases the criticalcharge - Qcrit - required to corrupt the contents ofmemories and sequential elements. The marriage ofsubthreshold logic and high-reliability electronicsis inevitable, yet there has been to date noinvestigation of the effects of radiation on circuitsthat operate at such low voltages. This book provides a comprehensive comparison of a variety oftraditional flip-flop designs at subthreshold levels- not just in terms of performance, power and areabut radiation hardness as well. Furthermore, a novelflip-flop design is presented, which is optimized forrobust subthreshold operation.
Ferret: Programming language support for multiple dynamic classification
Authors: Bard Bloom, Paul Keyser, Ian Simmonds, Mark Wegman
Venue: Computer Languages, Systems and Structures (2009)

We introduce a concept of multiple dynamic classification, a powerful generalization of single-inheritance OO, and a language Ferret which implements it. Multiple classification allows Male, Female, and Married to be subclasses of Person, arranged so that a single Person object may be both Male and Married, but may not be both Male and Female. Dynamic classification allows classes to change: a Person may acquire or lose Married status. The subclasses are true subclasses. Married carries fields (e.g., spouse) which are specific to married people. Methods may be defined on classes, and even on Boolean combinations of class: Male&Married. Ferret provides a generalization of superclass calls, so that the methods for Male&Married can be based on those for Male and Married, without losing other classifications like Employee. Ferret has mutators, analogous to constructors but applicable when objects change class. The resulting language is powerful and highly expressive.
Predictable Real-Time Java Profile Based on RTSJ
Authors: Yongxian Jin
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Based on the analysis of limitations of existing Real Time Specification for Java (RTSJ) and Java developing model, we have designed a predictable real time Java developing profile which can be used to develop embedded high-reliability real-time systems. The profile adopts a three-layer developing architecture, including Creation Layer, Execution Layer and Recycle Layer. The Creation Layer creates and starts various groups of threads and objects. The Execution Layer executes threads that have been started. The Recycle Layer recovers the memory that is no longer in use. The application practice shows that the mechanisms, such as creating various groups of threads, periodic garbage collection, etc, not only guarantee the predictability of system developed with this profile, but also reduce memory usage of system requirement.
Maximum memory capacity on neural networks with short-term synaptic depression and facilitation
Authors: Jorge F. Mejias, Joaquín J. Torres
Venue: Neural Computation (2009)

In this work, we study, analytically and employing Monte Carlo simulations, the influence of the competition between several activity-dependent synaptic processes, such as short-term synaptic facilitation and depression, on the maximum memory storage capacity in a neural network. In contrast to the case of synaptic depression, which drastically reduces the capacity of the network to store and retrieve “static” activity patterns, synaptic facilitation enhances the storage capacity in different contexts. In particular, we found optimal values of the relevant synaptic parameters (such as the neurotransmitter release probability or the characteristic facilitation time constant) for which the storage capacity can be maximal and similar to the one obtained with static synapses, that is, without activity-dependent processes. We conclude that depressing synapses with a certain level of facilitation allow recovering the good retrieval properties of networks with static synapses while maintaining the nonlinear characteristics of dynamic synapses, convenient for information processing and coding.
Development and implementation of e-government services in Turkey: issues of standardization, inclusion, citizen and satisfaction
Authors: Asim Balci, Erhan Kumaş, Hamza Taşdelen, Elif Süngü, Tolga Medeni, Tunç D. Medeni
Venue: Proceedings of the 2nd International Conference on Theory and Practice of Electronic Governance (2008)

This paper discusses the development and implementation of e-government services in Turkey. With the background information about e-government in general, Turkish case of e-government initiatives is discussed with a specific focus on "e-Government Gateway Project". Issues of Standardization, Inclusion, Citizen Satisfaction, Integration and Interoperability are highlighted as current, hot topics and future prospects.
Framework Design Pattern Annotation: Implementation and Application of the UML-F Profilefor Framework Architectures
Authors: Thomas Aschauer
Venue:  (2008)

The Unified Modeling Language has established as thestandard language for the specification, design, anddocumentation of software systems. For someapplication domains, such as for the development ofobject-oriented application frameworks, the UML doesnot support specific requirements.As an extension to the basic language, the UML-FProfile for Framework Architectures supports theannotation of design patterns in framework designdiagrams. Framework developers can explicitlydocument their design decisions, which help users tobetter understand the framework.In this book the author presents an updated UML-Fprofile compatible to UML 2 and its implementationin a state-of-the-art modeling tool. This enablesframework developers to easily annotate designpatterns in structure diagrams, to manage them, andto visualize the annotated patterns in two differentnotations.Two case studies show the applicability of thisapproach. In the first case study, a small userinterface support framework is documented. In thesecond case study, the tool is used to document theplug-in interface of a compiler for real-timespecifications.
An Area Localization Scheme for Large Scale Underwater Wireless Sensor Networks
Authors: Yi Zhou, Jianhua He, Kai Chen, Jianbo Chen, Alei Liang
Venue: Proceedings of the 2009 WRI International Conference on Communications and Mobile Computing - Volume 01 (2009)

In this paper, we study an area localization problem in large scale Underwater Wireless Sensor Networks (UWSNs). The limited bandwidth, the severely impaired channel and the cost of underwater equipment all makes the underwater localization problem very challenging. Exact localization is very difficult for UWSNs in deep underwater environment. We propose a Mobile DETs based efficient 3D multi-power Area Localization Scheme (3D-MALS) to address the challenging problem. In the proposed scheme, the ideas of 2D multi-power Area Localization Scheme(2D-ALS) [6] and utilizing Detachable Elevator Transceiver (DET) are used to achieve the simplicity, location accuracy, scalability and low cost performances. The DET can rise and down to broadcast its position. And it is assumed that all the underwater nodes underwater have pressure sensors and know their z coordinates. The simulation results show that our proposed scheme is very efficient.
Translating non-standard extensions to standard Pascal
Authors: Viswanathan Santhanam
Venue: Proceedings of the May 19-22, 1980, national computer conference (1980)

Extensions to a programming language are often introduced by individual implementors for a variety of reasons. In some cases, a new construct may allow the programmer to take advantage of a unique hardware or software feature in the specific system. In other cases, the application for which the language is frequently employed may warrant simpler and more efficient constructs. Whatever the motive, extensions, in general, severely limit portability of programs. Often it is necessary to manually translate non-standard features before a program can be successfully adapted to a new environment. If we must live with such extensions at all, ideally we would like to be able to translate all extensions automatically to make the adaptation expedient and reliable.
The implementation guidance for practicing network isolation by referring to ISO-17799 standard
Authors: Yeu-Pong Lai, Ruan-Han Dai
Venue: Computer Standards Interfaces (2009)

In these years, the company budgets are raised dramatically for eliminating the security problems or mitigating the security risks in companies, but the numbers of incidents happening on computer systems in intranet or internet are still increasing. Many researchers proposed the way-to isolate the computers storing sensitive information for preventing information on these computers revealed or vulnerability on these computers exploited. However, there are few materials available for implementing network isolation. In this paper, we define ways of network isolation, ''physical isolation'' and ''logical isolation''. In ISO-17799, there is no implementation guidance for practicing network logical isolation but auditing network physical isolation. This paper also provides the implementation guidance of network isolation in two aspects. One is for the technique viewpoints. The other aspect is for management viewpoints. These proposed implementation outlines and security measures will be considered in revising the security plan, ''The Implementation Plan for Information Security Level in Government Departments'' [''The implementation plan for information security level in government departments,'' National Information and Communication Security Taskforce, Taiwan R.O.C., Programs, Jul. 20 2005].
On monogenic nondeterministic automata
Authors: Csanád Imreh, Masami Ito
Venue: Acta Cybernetica (2008)

A finite automaton is said to be directable if it has an input word, a directing word, which takes it from every state into the same state. For nondeterministic (n.d.) automata, directability can be generalized in several ways, three such notions, D1-, D2-, and D3-directability, are used. In this paper, we consider monogenic n.d. automata, and for each i = 1,2,3, we present sharp bounds for the maximal lengths of the shortest Di-directing words.
A Hybrid Fourier---Chebyshev Method for Partial Differential Equations
Authors: Rodrigo B. Platte, Anne Gelb
Venue: Journal of Scientific Computing (2009)

We propose a pseudospectral hybrid algorithm to approximate the solution of partial differential equations (PDEs) with non-periodic boundary conditions. Most of the approximations are computed using Fourier expansions that can be efficiently obtained by fast Fourier transforms. To avoid the Gibbs phenomenon, super-Gaussian window functions are used in physical space. Near the boundaries, we use local polynomial approximations to correct the solution. We analyze the accuracy and eigenvalue stability of the method for several PDEs. The method compares favorably to traditional spectral methods, and numerical results indicate that for hyperbolic problems a time step restriction of O(1/N) is sufficient for stability.
Chaotic noise MOS generator based on logistic map
Authors: A. Díaz-Méndez, J. V. Marquina-Pérez, M. Cruz-Irisson, R. Vázquez-Medina, J. L. Del-Río-Correa
Venue: Microelectronics Journal (2009)

The Birkhoff's ergodic theorem (BET), bifurcation diagram (BD) and Lyapunov's exponent (LE) are used in order to design a chaotic noise generator that is governed by the logistic map (LM). For this, a MOS analog circuit that operates in the current-mode, which is based on translinear principle (TLP), is used. To iterate the transference function of this circuit and also to maintain the parameter control of the LM, a current amplifier has been used. The specifications of the design are obtained from the analysis of the model. The results demonstrate the correct operation of the circuit, even when a mismatching of 2% is considered between the devices that control the operation region. The statistical distribution of the output signal on the circuit is similar to uniform distribution and it is related with the parameter value that rules the transfer function of the circuit.
Team analytics: understanding teams in the global workplace
Authors: Jan H. Pieper, Julia Grace, Stephen Dill
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Many medium and large companies maintain internal employee directories. Unfortunately, most directories only allow the lookup of individual profiles, one profile at a time. Team Analytics is a novel application that integrates information from disparate enterprise tools for groups of people. Besides accelerating the lookup process, Team Analytics also displays information that is only available in the group context, such as an organizational chart and time zone awareness. We present the Team Analytics application, its integration with our corporate email client, and results from a user survey that evaluates various aspects of the application.
Splitting cubes: a fast and robust technique for virtual cutting
Authors: Nico Pietroni, Fabio Ganovelli, Paolo Cignoni, Roberto Scopigno
Venue: The Visual Computer: International Journal of Computer Graphics (2009)

This paper presents the splitting cubes, a fast and robust technique for performing interactive virtual cutting on deformable objects. The technique relies on two ideas. The first one is to embed the deformable object in a regular grid, to apply the deformation function to the grid nodes and to interpolate the deformation inside each cell from its 8 nodes. The second idea is to produce a tessellation for the boundary of the object on the base of the intersections of such boundary with the edges of the grid. Please note that the boundary can be expressed in any way; for example it can be a triangle mesh, an implicit or a parametric surface. The only requirement is that the intersection between the boundary and the grid edges can be computed. This paper shows how the interpolation of the deformation inside the cells can be used to produce discontinuities in the deformation function, and the intersections of the cut surface can be used to visually show the cuts on the object. The splitting cubes is essentially a tessellation algorithm for growing, deformable surface, and it can be applied to any method for animating deformable objects. In this paper the case of the mesh-free methods (MMs) is considered: in this context, we described a practical GPU friendly method, that we named the extended visibility criterion, to introduce discontinuities of the deformation.