ppxscal/embedding_network huggingface dataset:
Virtually competent? Competence and experience with Internet-based technologies among European parliamentarians
Authors: Beate Elvebakk
Venue: Information Polity (2004)

This article tries to determine the levels of experience and competence with the Internet among MPs in seven European countries, and to provide explanations for the differences found. The main objective of the article is to see whether the kinds of experience and skills that the MPs possess serve as a basis for important structural changes in the European democracies. Unsurprisingly, the survey shows that MPs in Northern Europe tend to use the Internet more than their colleagues in the South. The MPs also mostly use the Internet as replacement for other technologies, such as telephones and fax-machines, but a more innovative pattern of use may be found among Scottish and Danish MPs. The MPs are generally self-taught when it comes to Internet skills, and their competence is therefore linked to personal interest and previous careers rather than to such factors as political allegiance. Most of them see their competence as being satisfactory, although not outstanding. The article also discusses possible implications of electronic competence or lack thereof for the future of representative democracies.
RCanalyser: A Flexible Framework for the Detection of Data Races in Parallel Programs
Authors: Aoun Raza, Gunther Vogel
Venue: Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies (2008)

Creating multiple threads for performance gain is not only common for complex computations on supercomputers but also for ordinary application programs. Multi-threaded/parallel programs have many advantages but also introduce new types of errors that do not occur in purely sequential programs. Race conditions are one important class of these special problems because the effects of race conditions occur nondeterministically and range from incorrect results to unexpected program behaviour. This paper presents RCanalyser, a tool for the detection of race conditions, which is based on a Must_Locks analysis using a flexible interface for the integration of different points-to analyses. As the problem of detecting race conditions is NP-hard in the general case, the tool is restricted to the detection of so-called data races [1]. The tool is able to analyse C/C++programs that use thread APIs for the implementation and synchronization of concurrent units. We applied the tool to a set of real programs, which use the POSIX thread API, and present results and statistics.
Improving HLRTA*(k)
Authors: Carlos Hernández, Pedro Meseguer
Venue: Current Topics in Artificial Intelligence: 12th Conference of the Spanish Association for Artificial Intelligence, CAEPIA 2007, Salamanca, Spain, November 12-16, 2007. Selected Papers (2007)

Real-time search methods allow an agent to move in unknown environments. We provide two enhancements to the real-time search algorithm HLRTA*(k). First, we give a better way to perform bounded propagation, generating the HLRTA* LS (k) algorithm. Second, we consider the option of doing more than one action per planning step, by analyzing the quality of the heuristic found during lookahead, producing the HLRTA*(k,d) algorithm. We provide experimental evidence of the benefits of both algorithms, with respect to other real-time algorithms on existing benchmarks.
Modeling and Analyzing Disaster Recovery Plans as Business Processes
Authors: Andrzej Zalewski, Piotr Sztandera, Marcin Ludzia, Marek Zalewski
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

The importance of business continuity and disaster recovery (BC/DR) plans has grown considerably in the recent years, becoming a well-established practice to achieve organization's resiliency. There are several applicable standards, like BS 25999-1:2006, sets of guidelines and best practices in this field. BC/DR plans are typically text documents and exercising is still the main measure used to verify them. On the contrary, to the common practice we suggest to model BC/DR plans as business processes using ARIS methodology and models, which have proven successful in the Enterprise Resource Planning systems projects. This provides uniform representation of BC/DR plans that can be applied across the whole distributed organization, strengthens the efficiency of traditional manual analysis techniques like walk-throughs, helps to achieve completeness, consistency and makes possible computer simulation of BC/DR processes. Timing and dynamic behavior, resource utilization and completeness properties have been also defined. It is possible to analyze them with computer support based on proposed ARIS model of BC/DR plan.
TCP Contention Control: A Cross Layer Approach to Improve TCP Performance in Multihop Ad Hoc Networks
Authors: Ehsan Hamadani, Veselin Rakocevic
Venue: Proceedings of the 5th international conference on Wired/Wireless Internet Communications (2007)

It is well known that one of the critical sources of TCP poor performance in multihop ad hoc networks lies in the TCP window mechanism that controls the amount of traffic sent into the network. In this paper, we propose a novel cross layer solution called "TCP Contention Control" that dynamically adjusts the amount of outstanding data in the network based on the level of contention experienced by packets as well as the throughput achieved by connections. Our simulation results show TCP Contention Control can drastically improve TCP performance over 802.11 multihop ad hoc networks.
Document-Base Extraction for Single-Label Text Classification
Authors: Yanbo J. Wang, Robert Sanderson, Frans Coenen, Paul Leng
Venue: Proceedings of the 10th international conference on Data Warehousing and Knowledge Discovery (2008)

Many text mining applications, especially when investigating Text Classification (TC), require experiments to be performed using common text-collections, such that results can be compared with alternative approaches. With regard to single-label TC, most text-collections (textual data-sources) in their original form have at least one of the following limitations: the overall volume of textual data is too large for ease of experimentation; there are many predefined classes; most of the classes consist of only a very few documents; some documents are labeled with a single class whereas others have multiple classes; and there are documents found with little or no actual text-content. In this paper, we propose a standard approach to automatically extract "qualified" document-bases from a given textual data-source that can be used more effectively and reliably in single-label TC experiments. The experimental results demonstrate that document-bases extracted based on our approach can be used effectively in single-label TC experiments.
A DRAM compatible Cu contact using self-aligned Ta-silicide and Ta-barrier
Authors: C. Zhao, J. Y. Ahn, N. Horiguchi, S. Demuynck, Zs. Tkei
Venue: Microelectronic Engineering (2008)

As an alternative to W contacts currently used in MOSFETs for DRAM, Cu contacts using self-aligned Ta-silicide and Ta-based barrier were studied experimentally. The silicidation of PVD Ta layers was studied first on 300mm blanket Si wafers. The developed method was applied to patterned wafers in the contacts, that land on poly gate and active areas of NMOS, with a sequence including the PVD of Ta, a silicidation annealing, a Ta-based Cu diffusion barrier and a Cu seed for plating the Cu plug. X-ray diffraction (XRD), X-ray reflection (XRR) and sheet resistance tests of the blanket wafers show that a Ta layer of about 10nm reacts with Si substrate and forms TaSi"2 at 650^oC in a reducing ambient. Cross-sectional SEM observation reveals that the selected processing flow fills the 90nm contacts. Top-view SEM observation on the samples after 420^oC sintering demonstrates that the Cu diffusion barrier is effective. I"o"n-I"o"f"f curves of the devices show a performance for NMOS comparable to the reference samples which use Ni(Pt)Si and the same barrier and Cu contacts, indicating that the stack of the barrier/TaSi"2/p-type Si has a contact resistance comparable to the barrier/Ni(Pt)Si/p-type Si.
Communication on Inductively Coupled Channels: Overview and Challenges
Authors: Øyvind Ytrehus
Venue: Proceedings of the 2nd international Castle meeting on Coding Theory and Applications (2008)

This paper presents an overview of coding methods and cryptographic techniques for inductively coupled channels. The paper discusses the requirements for coding on such channels, review modulation codes in use in practical systems, and propose new modulation coding techniques. Error correcting codes and the ways in which it may aid the communication on these channels are also covered. Cryptography is another crucial ingredient for a complete communication system. Inductively coupled channels pose special challenges for building a secure system. We give a brief overview of these challenges, and of some cryptographic building blocks and protocols that have been proposed to meet them.
A covering problem that is easy for trees but NP-complete for trivalent graphs
Authors: Rolf Bardeli, Michael Clausen, Andreas Ribbrock
Venue: Discrete Applied Mathematics (2008)

By definition, a P2-graph@C is an undirected graph in which every vertex is contained in a path of length two. For such a graph, pc(@C) denotes the minimum number of paths of length two that cover all n vertices of @C. We prove that @?n/3@?@?pc(@C)@?@?n/2@? and show that these upper and lower bounds are tight. Furthermore we show that every connected P2-graph @C contains a spanning tree T such that pc(@C)=pc(T). We present a linear time algorithm that produces optimal 2-path covers for trees. This is contrasted by the result that the decision problem pc(@C)=?n/3 is NP-complete for trivalent graphs. This graph theoretical problem originates from the task of searching a large database of biological molecules such as the Protein Data Bank (PDB) by content.
Unlinkable Randomizable Signature and Its Application in Group Signature
Authors: Sujing Zhou, Dongdai Lin
Venue: Information Security and Cryptology: Third SKLOIS Conference, Inscrypt 2007, Xining, China, August 31 - September 5, 2007, Revised Selected Papers (2007)

We formalize a generic method of constructing efficient group signatures, specifically, we define new notions of unlinkable randomizable signature, indirectly signable signature and Σ-protocol friendly signature.We conclude that designing efficient secure group signatures can be boiled down to designing ordinary signatures satisfying the above three properties, which is supported by observations that almost all currently known secure efficient group signatures have alternative constructions in this line without deteriorating the efficiency.
A Simulation-Based Hybrid Optimization Technique for Low Noise Amplifier Design Automation
Authors: Yiming Li, Shao-Ming Yu, Yih-Lang Li
Venue: Proceedings of the 7th international conference on Computational Science, Part IV: ICCS 2007 (2007)

In this paper, a simulation-based optimization technique for integrated circuit (IC) design automation is presented. Based on a genetic algorithm (GA), Levenberg-Marquardt (LM) method, and circuit simulator, a window-interfaced prototype of computer-aided design (CAD) is developed for IC design. Considering low noise amplifier (LNA) IC, we simultaneously evaluate specifications including S parameters, K factor, noise figure, and input third-order intercept point in the optimization process. If the simulated results meet the aforementioned constraints, the prototype outputs the optimized parameters. Otherwise, CAD activates GA for global optimization; simultaneously, LM method searches solutions with the results of GA. The prototype then calls a circuit simulator to compute and evaluate newer results until all specifications are matched. More than fifteen parameters including device sizes, passive components, and biasing conditions are optimized for the aforementioned constraints. For LNA IC with 0.18μm metal-oxide-silicon filed effect transistors, benchmark results confirm the functionality of the implemented prototype.
Learning with Kernels in Description Logics
Authors: Nicola Fanizzi, Claudia D'Amato, Floriana Esposito
Venue: Proceedings of the 18th international conference on Inductive Logic Programming (2008)

We tackle the problem of statistical learning in the standard knowledge base representations for the Semantic Web which are ultimately expressed in description Logics. Specifically, in our method a kernel functions for the $\mathcal{ALCN}$ logic integrates with a support vector machine which enables the usage of statistical learning with reference representations. Experiments where performed in which kernel classification is applied to the tasks of resource retrieval and query answering on OWL ontologies.
Noncanonical Base Pairing in RNA: Topological and NBO Analysis of Hoogsteen Edge - Sugar Edge Interactions
Authors: Purshotam Sharma, Harjinder Singh, Abhijit Mitra
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

Hoogsteen sugar pattern of RNA base pairing is studied using density functional theory. Hydrogen bonding patterns of these base pairs are characteristized using NBO analysis and AIM analysis. Correlation between strength of base pairing and the nature of donor-acceptor combinations is also carried out.
Unsupervised Learning of Saliency Concepts for Natural Image Classification and Retrieval
Authors: A. Perina, M. Cristani, V. Murino
Venue: Proceedings of the 13th Iberoamerican congress on Pattern Recognition: Progress in Pattern Recognition, Image Analysis and Applications (2008)

In this paper, a novel multi-scale, statistical approach for natural image representation is presented. The approach selects, at different scales, sets of features that represent exclusively the most typical visual elements of several natural scene categories, disregarding other non-characteristic, clutter, elements. Such features provide also a robust image visual signature, useful for scene understanding, image classification and retrieval. The approach lies upon a structured generative model efficiently trained through variational learning. Results regarding image classification and retrieval prove the goodness of the approach.
Using Metaheuristics in a Parallel Computing Course
Authors: Ángel-Luis Calvo, Ana Cortés, Domingo Giménez, Carmela Pozuelo
Venue: Proceedings of the 8th international conference on Computational Science, Part II (2008)

In this paper the use of metaheuristics techniques in a parallel computing course is explained. In the practicals of the course different metaheuristics are used in the solution of a mapping problem in which processes are assigned to processors in a heterogeneous environment, with heterogeneity in computation and in the network. The parallelization of the metaheuristics is also considered.
Single-machine scheduling with general learning functions
Authors: Ji-Bo Wang
Venue: Computers Mathematics with Applications (2008)

In this study we consider the single-machine scheduling problem with a sum-of-processing-times-based learning effect. The sum-of-processing-times-based learning effect of a job is assumed to be a function of the sum of the normal processing times of the already processed jobs. We prove that the shortest processing time (SPT) rule is optimal for the sum of completion times square minimization problem. We also show by examples that the optimal schedule for the classical version of the problem is not optimal in the presence of a sum-of-processing-times-based learning effect for the following three objective functions: the weighted sum of completion times, the maximum lateness and the number of tardy jobs. But for some special cases, we prove that the weighted shortest processing time (WSPT) rule, the earliest due date (EDD) rule and Moore's algorithm can construct an optimal schedule for the problem to minimize these objective functions, respectively.
A Hybrid Ant-Based System for Gate Assignment Problem
Authors: Camelia-M. Pintea, Petrica C. Pop, Camelia Chira, D. Dumitrescu
Venue: Proceedings of the 3rd international workshop on Hybrid Artificial Intelligence Systems (2008)

This paper presents an ant system coupled with a local search applied to an over-constrained airport gate assignment problem (AGAP). In the airport gate assignment problem we are interested in selecting and allocating aircrafts to the gates such that the total passenger connection time is minimized. Our algorithm uses pheromone trail information to perform modifications on AGAP solutions, unlike traditional ant systems that use pheromone trail information to construct complete solutions. The algorithm is analyzed and compared with tabu search heuristic and Ant Colony System metaheuristic.
Rotation points from motion capture data using a closed form solution
Authors: Sudhanshu Kumar Semwal
Venue:  (2008)

Four new closed-form methods are present to find rotation points of a skeleton from motion capture data. A generic skeleton can be directly extracted from noisy data with no previous knowledge of skeleton measurements. The new methods are ten times faster than the next fastest and a hundred times faster than the most widely accepted method. Two phases are used to produce an accurate skeleton of the captured data. The first phase, fitting the skeleton, is robust even with noisy motion capture data. The formulae use an asymptotically unbiased version of the Generalized Delogne-Kasa (GDKE) Hyperspherical Estimation (first estimator: UGDK). The second estimator takes advantage of multiple markers located at different distances from the rotation point (MGDK) thereby increasing accuracy. The third estimator removes singularities to allow for cylindrical joint motion (SGDK). The fourth estimator incrementally improves an answer and has advantages of constant memory requirements suitable for firmware applications (IGDK). The UGDK produces the answer faster than any previous algorithm and with the same efficiency with respect to the Cram&eacute;r-Rao Lower Bound for fitting spheres and circles. The UGDK method significantly reduces the amount of work needed for calculating rotation points by only requiring 26N flops for each joint. The next fastest method, Linear Least-Squares requires 236N flops. In-depth statistical analysis shows the UGDK method converges to the actual rotation point with an error of O(&sigma;/&radic;N) improving on the GDKE's biased answer of O(&sigma;). The second phase is a real-time algorithm to draw the skeleton at each time frame with as little as one point on a segment. Flexibility of motion is displayed in detail as the figure follows the captured motion more closely. The main contributions in this dissertation are the new unbiased center formulae; the full statistical analysis of this new formula; and the analysis of when the best measurement conditions are to initiate the formula. The dissertation further establishes the application of these new formulae to motion capture to produce a real-time method of drawing skeletons of arbitrary articulated figures.
A note on the trackability of dynamic sensor networks
Authors: Yichuan Ding
Venue: Proceedings of the first ACM international workshop on Mobile entity localization and tracking in GPS-less environments (2008)

Since the last decade, Semidefinite programming (SDP) has found its important application in locating the ad hoc wireless sensor networks. By choosing proper decomposition and computation schemes, SDP has been shown very efficient to handle the localization problem. Previous research also has shown that the SDP locates the sensor networks in Rd correctly provided the underlying framework is strong uniquely localizable. In this paper, we consider the localization problem in a more general and practical scenario, that is, the sensors are in movement following a certain trajectory. We show that given the initial position of each sensor and the instantaneous distance data, the dynamic sensor networks can be can be tracked correctly in the near future when the underlying framework is infinitesimal rigid and the trajectories of the sensors are subject to mild conditions. Our result also provides a way to approximate the sensor trajectories using Taylor series based on the distance data.
Item-specific training reduces prefrontal cortical involvement in perceptual awareness
Authors: Johan Eriksson, Anne Larsson, Lars Nyberg
Venue: Journal of Cognitive Neuroscience (2008)

Previous studies on the neural correlates of perceptual awareness implicate sensory-specific regions and higher cortical regions such as the prefrontal cortex (PFC) in this process. The specific role of PFC regions is, however, unknown. PFC activity could be bottom-up driven, integrating signals from sensory regions. Alternatively, PFC regions could serve more active top-down processes that help to define the content of consciousness. To compare these alternative views of PFC function, we used functional magnetic resonance imaging and measured brain activity specifically related to conscious perception of items that varied in ease of identification (by being presented 0, 12, or 60 times previously). A bottom-up account predicts that PFC activity would be largely insensitive to stimulus difficulty, whereas a top-down account predicts reduced PFC activity as identification becomes easier. The results supported the latter prediction by showing reduced activity for previously presented compared to novel items in the PFC and several other regions. This was further confirmed by a functional connectivity analysis showing that the interaction between frontal and visual sensory regions declined as a function of ease of identification. Given the attribution of top-down processing to PFC regions in combination with the marked decline in PFC activity for easy items, these findings challenge the prevailing notion that the PFC is necessary for consciousness.
Panel: Usable Cryptography: Manifest Destiny or Oxymoron?
Authors: Mary Ellen Zurko, Andrew S. Patrick
Venue: Financial Cryptography and Data Security: 12th International Conference, FC 2008, Cozumel, Mexico, January 28-31, 2008. Revised Selected Papers (2008)

Outside of SSL, Notes/Domino, and federal PKIs, PK cryptography hasn't caught on. SSL is hugely successful in providing network protection. But its server authentication feature is currently useless in phishing attacks, and its client authentication is largely unused. A number of user studies indicate that while some subset of users know about and notice "the padlock", few know what it really is, and none use it to protect them from phishing. This panel posits that the points where the cryptographic system meets the user are where its success has been blocked (e.g. key mgmt, password for protecting keys, understanding risk, threat, and assurance). We explore that assumption, and the past, present, and future of usable cryptography.
Modeling and performance analysis of realizable optical queue with service differentiation capability
Authors: Xuguang Shao, Liren Zhang, Ping Shum
Venue: Computer Communications (2008)

We propose an optical queue architecture that can be realized by implementing the state-of-art optical buffer technology in the near future. This optical queue can be used at the output port of an optical packet switch/router in an optical switching network (OPS), which resembles its electronic equivalent in terms of operational functionality. Detailed construction and operation scenarios of the optical queue are elaborated. Analytical modeling is done to investigate the switch with this optical buffer structure. Results obtained demonstrate the capability of providing service differentiation by using our proposed optical buffer system with multiple thresholds control mechanism.