ppxscal/embedding_network huggingface dataset:
Characterization of Ni/Ho and Ni/Er fully silicided metal gates on SiO2 gate dielectric
Authors: Bao-Min Wang, Guo-Ping Ru, Yu-Long Jiang, Xin-Ping Qu, Bing-Zong Li, Ran Liu
Venue: Microelectronic Engineering (2008)

This paper investigates the effects of Ho and Er on the sheet resistance and crystallinity of Ni(Ho) and Ni(Er) silicides, the work function (WF) modulation of Ni(Ho) and Ni(Er) fully silicided (FUSI) gate electrodes on SiO"2 dielectric, and the FUSI gated SiO"2/Si interface trap properties by using high-frequency capacitance-voltage (C-V) and photonic high-frequency C-V measurements. It was found that as the thickness percentage of rare earth (RE) metal in the Ni(Ho) or Ni(Er) increases, the sheet resistance of the silicide increases. The crystallinity decreases in the Ni(Ho) and Ni(Er) silicides, and the crystallinity decreases as the Ho thickness percentage increases. As the thickness percentage of Ho in the Ni(Ho) increases from 13% to 30%, the flatband voltage (V"F"B) shift increases from -0.19 to -0.27V. The V"F"B shifts negatively 0.17V due to 10% Er incorporation in the Ni(Er). The V"F"B shift can be attributed to the effective WF decrease which may be due to the crystallinity decrease of Ni(Ho) and Ni(Er) FUSI. The interface trap density D"i"t calculated from the photonic high-frequency C-V curves is in good agreement with that calculated from the high-frequency and photonic high-frequency C-V curves. The Ho or Er addition does not increase the D"i"t.
The Product Line Hall of Fame
Authors: David M. Weiss
Venue: Proceedings of the 2008 12th International Software Product Line Conference (2008)

The Software Product Line Hall of Fame honors software product lines that can serve as examples to software product line developers.
New Architecture and Algorithm for Webserver Cluster Based on Linux Virtual Server
Authors: Yanping Gao, Xiangjun Li, Yandong Che
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

According to the growing of Internet, many websites have used clustering technologies to enlarge their performance. These days, LVS (Linux Virtual Server) software, which is free of charge and has good performance, has commonly been used to construct web server cluster. But when requests are increased, LVS can raise a bottleneck and can make the cluster system unable after all, because it has only single front-end. In this paper, we suggest a new architecture for webserver cluster based on LVS with multiple front-ends which can act as back-ends simultaneously. We also propose a scheduling algorithm to distribute requests equally to servers with considering their load. The proposed system and algorithm remove the bottleneck, and are useful in constructing small and middle-sized websites. In the proposed system, a server can make response directly to client’s request only when its load is not large enough. Otherwise, the server should redirect the request to a selected back-end with the lowest load. We hope that the webserver cluster with multiple front-end will be suitable and efficient for constructing small and middle-sized websites at the point of cost and performance.
Using CIAN for Specifying Collaborative Scripts in Learning Design
Authors: Francisco Jurado, Ana I. Molina, William J. Giraldo, Miguel A. Redondo, Manuel Ortega
Venue: Proceedings of the 5th international conference on Cooperative Design, Visualization, and Engineering (2008)

The standardization of eLearning environments and the design of collaboration scripts are two research areas that are acquiring a greater attention within the Computer Supported Collaborative Learning (CSCL) community. IMS Learning Design (IMS-LD) is the specification used to describe instructional strategies. In this paper we analyse the suitability and lacks of IMS-LD for modelling collaborative learning processes. Based on this result, we propose a reference model inside the IMS specifications core and the use of a graphical notation called CIAN (Collaborative Interactive Applications Notation) as CSCL scripting language. Using these specifications of a high level of abstraction and mappable to a computer-interpretable notation such as IMS-LD, allows hiding the particularities of the standard to instructional designers.
Toward an efficient triangle-based spherical harmonics representation of 3D objects
Authors: M. -H. Mousa, R. Chaine, S. Akkouche, E. Galin
Venue: Computer Aided Geometric Design (2008)

In classical frequency-based surface decomposition, there is always a restriction about the genus number of the object to obtain the spherical harmonics decomposition of spherical functions representing these objects. Such spherical functions are intrinsically associated to star-shaped objects. In this paper, we present a new and efficient spherical harmonics decomposition for spherical functions defining 3D triangulated objects. Our results can be extended to any triangular object of any genus number after segmentation into star-shaped surface patches and recomposition of the results in the implicit framework. We demonstrate that the evaluation of the spherical harmonics coefficients can be performed by a Monte Carlo integration over the edges, which makes the computation more accurate and faster than previous techniques, and provides a better control over the precision error in contrast to the volumetric or surfacic voxel-based methods. We present several applications of our research, including fast spectral surface reconstruction from point clouds, surface compression, progressive transmission, local surface smoothing and interactive geometric texture transfer.
The number of convex permutominoes
Authors: Paolo Boldi, Violetta Lonati, Roberto Radicioni, Massimo Santini
Venue: Information and Computation (2008)

Permutominoes are polyominoes defined by suitable pairs of permutations. In this paper we provide a formula to count the number of convex permutominoes of given perimeter. To this aim we define the transform of a generic pair of permutations, we characterize the transform of any pair defining a convex permutomino, and we solve the counting problem in the transformed space.
Rough Sets and Vague Sets
Authors: Zbigniew Bonikowski, Urszula Wybraniec-Skardowska
Venue: Proceedings of the international conference on Rough Sets and Intelligent Systems Paradigms (2007)

The subject-matter of the consideration touches the problem of vagueness. The notion of the rough set, originated by Zdzisław Pawlak, was constructed under the influence of vague information and methods of shaping systems of notions leading to conceptualization and representation of vague knowledge, so also systems of their scopes as some vague sets. This paper outlines some direction of searching for a solution to this problem. In the paper, in connection to the notion of the rough set, the notion of a vague set is introduced. Some operations on these sets and their properties are discussed. The considerations intend to take into account a classical approach to reasoning, based on vague premises, and suggest finding a logic of vague sentences as a non-classical logic in which all counterparts of tautologies of classical logic are laws.
Using Text Segmentation to Enhance the Cluster Hypothesis
Authors: Sylvain Lamprier, Tassadit Amghar, Bernard Levrat, Frédéric Saubion
Venue: Proceedings of the 13th international conference on Artificial Intelligence: Methodology, Systems, and Applications (2008)

An alternative way to tackle Information Retrieval, called Passage Retrieval, considers text fragments independently rather than assessing global relevance of documents. In such a context, the fact that relevant information is surrounded by parts of text deviating from the interesting topic does not penalize the document. In this paper, we propose to study the impact of the consideration of these text fragments on a document clustering process. The use of clustering in the field of Information Retrieval is mainly supported by the cluster hypothesis which states that relevant documents tend to be more similar one to each other than to non-relevant documents and hence a clustering process is likely to gather them. Previous experiments have shown that clustering the first retrieved documents as response to a user's query allows the Information Retrieval systems to improve their effectiveness. In the clustering process used in these studies, documents have been considered globally. Nevertheless, the assumption stating that a document can refer to more than one topic/concept may have also impacts on the document clustering process. Considering passages of the retrieved documents separately may allow to create more representative clusters of the addressed topics. Different approaches have been assessed and results show that using text fragments in the clustering process may turn out to be actually relevant.
Supporting predicate routing in DTN over MANET
Authors: Gabriele Ferrari Aggradi, Flavio Esposito, Ibrahim Matta
Venue: Proceedings of the third ACM workshop on Challenged networks (2008)

We consider a Delay Tolerant Network (DTN) whose users (nodes) are connected by an underlying Mobile Ad hoc Network (MANET) substrate. Users can declaratively express high-level policy constraints on how "content" should be routed. For example, content may be diverted through an intermediary DTN node for the purposes of preprocessing, authentication, etc. To support such capability, we implement Predicate Routing [7] where high-level constraints of DTN nodes are mapped into low-level routing predicates at the MANET level. Our testbed uses a Linux system architecture and leverages User Mode Linux [2] to emulate every node running a DTN Reference Implementation code [5]. In our initial prototype, we use the On Demand Distance Vector (AODV) MANET routing protocol. We use the network simulator ns-2 (ns-emulation version) to simulate the mobility and wireless connectivity of both DTN and MANET nodes. We show preliminary throughput results showing the efficient and correct operation of propagating routing predicates, and as a side effect, the performance benefit of content re-routing that dynamically (on-demand) breaks the underlying end-to-end TCP connection into shorter-length TCP connections.
Satellitelab: adding heterogeneity to planetary-scale network testbeds
Authors: Marcel Dischinger, Andreas Haeberlen, Ivan Beschastnikh, Krishna P. Gummadi, Stefan Saroiu
Venue: ACM SIGCOMM Computer Communication Review (2008)

Planetary-scale network testbeds like PlanetLab and RON have become indispensable for evaluating prototypes of distributed systems under realistic Internet conditions. However, current testbeds lack the heterogeneity that characterizes the commercial Internet. For example, most testbed nodes are connected to well-provisioned research networks, whereas most Internet nodes are in edge networks. In this paper, we present the design, implementation, and evaluation of SatelliteLab, a testbed that includes nodes from a diverse set of Internet edge networks. SatelliteLab has a two-tier architecture, in which well-provisioned nodes called planets form the core, and lightweight nodes called satellites connect to the planets from the periphery. The application code of an experiment runs on the planets, whereas the satellites only forward network traffic. Thus, the traffic is subjected to the network conditions of the satellites, which greatly improves the testbed's network heterogeneity. The separation of code execution and traffic forwarding enables satellites to remain lightweight, which lowers the barrier to entry for Internet edge nodes. Our prototype of SatelliteLab uses PlanetLab nodes as planets and a set of 32 volunteered satellites with diverse network characteristics. These satellites consist of desktops, laptops, and handhelds connected to the Internet via cable, DSL, ISDN, Wi-Fi, Bluetooth, and cellular links. We evaluate SatelliteLab's design, and we demonstrate the benefits of evaluating applications on SatelliteLab.
Research on a Flexible Workflow Management System Based on Web
Authors: Luo Jin, Zu Xiao-Fang, Wu Xin-Cai, Zhang Cheng
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Flexible workflow is one of hot points in current workflow research. A kind of design model of flexible workflow management system has been given based on the standard WFMC reference Model and flexible requirement of workflow system in practice in this paper. The design thought of constructing workflow template through activity network diagram with organizations, activities, roles also has been introduced in detail, which has been successfully applied in practice in the end. The model has six features of ideal workflow model: 1) Formal requirements; 2) graphical features; 3) complete expression; 4) level feature; 5) convenience of the performance analysis and optimization; 6) flexibility. Therefore, it will be a typical flexible workflow management system which makes theory innovation and practical value to some certain extent.
Validation and translation of epsilon-solids
Authors: Vadim Shapiro
Venue:  (2007)

The formulation of data accuracy and algorithm precision is fundamental in geometric modeling from both theoretical and practical perspectives. Theoretically, the classical theory of r-sets in solid modeling assumes exactness in both data and algorithms, while the formulation of precision is missing. Practically, individual geometric modeling systems use small numerical constants to address "robust" geometric computation problems. However, "robustnes" in a single modeling system does not guarantee "interoperability" in the exchange and translation of geometric models between different modeling systems, due to the lack of a formal characterization of data and algorithm precisions. This thesis proposes the theory of &epsiv;-solidity as a formal set model supporting applications from robustness and interoperability. The &epsiv;-solids model is a generalization of the classical r-sets model by replacing infinitesimal small neighborhoods with finite size neighborhoods of &epsiv;, where the size of neighborhood &epsiv; corresponds to the precision of data and algorithms. The model demands a substantial revision of classical theory, which involves the generalizations of topological operations of interior, closure and boundary, notions of regularity, and boolean set operations to their &epsiv; counterparts. This thesis also proposes a formal boundary representation scheme for &epsiv;-solids, tolerant cell complex, where Euclidean cells are replaced with tolerant cells to model boundary vertices, edges, and faces with inaccurate geometric embedding. Based on the proposed theory, this thesis gives a formulation of data translation as maintaining validity and consistency, and demonstrates that validity can be maintained in many cases with improved robustness, especially in Point Membership Classification.
Switching Surface Design for Periodically Operated Discretely Controlled Continuous Systems
Authors: Axel Schild, Jan Lunze
Venue: Proceedings of the 11th international workshop on Hybrid Systems: Computation and Control (2008)

Discretely controlled continuous systems (DCCS) represent an important class of hybrid systems, in which a continuous process is regulated by a discrete controller. The paper introduces a novel model-based design procedure for periodically operated DCCS with the objective to produce a periodic stationary operation. The method exploits an equivalence to periodic control systems to obtain an event-driven switching strategy that locally stabilizes a predetermined limit cycle and enforces a desired transient behavior. In contrast to earlier results, the controller responds to deviations without a dead time.
Research on the Cause and Efficiency of Regional Scientific and Technical Output: Evidence from Six Provinces in China
Authors: Wuwei Li, Yuhong Wang, Feng Li
Venue: Proceedings of the 2008 International Symposiums on Information Processing (2008)

Based on the statistics in 2005 from six provinces in the central region of China released by National Bureau of Statistics of China, this paper applies grey incidence analysis to analyze the cause and efficiency of regional scientific and technical output. After detail research, some results have been concluded: (1) In order to increase the standard of scientific and technical output in six provinces, we have to pay fully attention to increasing not only the expenditures for S&T activities, but the total amount of scientists and engineers. (2) Based on the degree of grey incidence calculated, we come to a conclusion that the level of efficiency of regional scientific and technical output of six provinces descends from the top to the low as follows: Hubei, Hunan, Anhui, Jiangxi, Shanxi, Henan. Research result shows that this method can provide valuable information for governments in making appropriate scientific and technical policies.
Guest Editors' Introduction: Dynamic Information Dissemination
Authors: Krithi Ramamritham, Prashant Shenoy
Venue: IEEE Internet Computing (2007)

Dissemination and delivery of rapidly changing information to large user communities remains a challenge on the Web. Consequently, we need techniques to disseminate such data as efficiently as possible. To this end, researchers are focusing on new approaches to building efficient, resilient, and scalable content-distribution networks.
Realistic Performance Prediction Tool for the Parallel Block LU Factorization Algorithm
Authors: Raimondas Čiegis Vadimas Starikovičius
Venue: Informatica (2003)

This work describes a realistic performance prediction tool for the parallel block LU factorization algorithm. It takes into account the computational workload, communication costs and the overlapping of communications by useful computations. Estimation of the tool parameters and benchmarking are also discussed. Using this tool we develop a simple heuristic for scheduling LU factorization tasks. Results of numerical experiments are presented.
High-frequency simulations of global seismic wave propagation using SPECFEM3D_GLOBE on 62K processors
Authors: Laura Carrington, Dimitri Komatitsch, Michael Laurenzano, Mustafa M Tikir, David Michéa, Nicolas Le Goff, Allan Snavely, Jeroen Tromp
Venue: Proceedings of the 2008 ACM/IEEE conference on Supercomputing (2008)

SPECFEM3D_GLOBE is a spectral-element application enabling the simulation of global seismic wave propagation in 3D anelastic, anisotropic, rotating and self-gravitating Earth models at unprecedented resolution. A fundamental challenge in global seismology is to model the propagation of waves with periods between 1 and 2 seconds, the highest frequency signals that can propagate clear across the Earth. These waves help reveal the 3D structure of the Earth's deep interior and can be compared to seismographic recordings. We broke the 2 second barrier using the 62K processor Ranger system at TACC. Indeed we broke the barrier using just half of Ranger, by reaching a period of 1.84 seconds with sustained 28.7 Tflops on 32K processors. We obtained similar results on the XT4 Franklin system at NERSC and the XT4 Kraken system at University of Tennessee Knoxville, while a similar run on the 28K processor Jaguar system at ORNL, which has better memory bandwidth per processor, sustained 35.7 Tflops (a higher flops rate) with a 1.94 shortest period. Thus we have enabled a powerful new tool for seismic wave simulation, one that operates in the same frequency regimes as nature; in seismology there is no need to pursue periods much smaller because higher frequency signals do not propagate across the entire globe. We employed performance modeling methods to identify performance bottlenecks and worked through issues of parallel I/O and scalability. Improved mesh design and numbering results in excellent load balancing and few cache misses. The primary achievements are not just the scalability and high teraflops number, but a historic step towards understanding the physics and chemistry of the Earth's interior at unprecedented resolution.
Panel: Complexity and Resilience
Authors: Aad Moorsel
Venue: Proceedings of the 27th international conference on Computer Safety, Reliability, and Security (2008)

The complexity of modern-day information systems creates large dependability challenges. As described in the ReSIST (Resilience for Survivability in IST) working programme [1], "current state-of-knowledge and state-of-the-art reasonably enable the construction and operation of critical systems, be they safety-critical (e.g., avionics, railway signalling, nuclear control) or availability-critical (e.g., back-end servers for transaction processing). However, the situation drastically worsens when considering large, networked, evolving, systems either fixed or mobile, with demanding requirements driven by their domain of application, i.e., ubiquitous systems. There is statistical evidence that these emerging systems suffer froma significant drop in dependability and security in comparison with the former systems. There is thus a dependability and security gap opening in front of us that, if not filled, will endanger the very basis and advent of information systems."
Automobile Driving Behavior Recognition Using Boosting Sequential Labeling Method for Adaptive Driver Assistance Systems
Authors: Wathanyoo Khaisongkram, Pongsathorn Raksincharoensak, Masamichi Shimosaka, Taketoshi Mori, Tomomasa Sato, Masao Nagai
Venue: Proceedings of the 31st annual German conference on Advances in Artificial Intelligence (2008)

Recent advances in practical adaptive driving assistance systems and sensing technology for automobiles have led to a detailed study of individual human driving behavior. In such a study, we need to deal with a large amount of stored data, which can be managed by splitting the analysis according to the driving states described by driver maneuvers and driving environment. As the first step of our long-term project, the driving behavior learning is formulated as a recognition problem of the driving states. Here, the classifier for recognizing the driving states is modeled via the boosting sequential labeling method (BSLM). We consider the recognition problems formed from driving data of three subject drivers who drove on two roads. In each problem, the classifier trained through BSLM is validated by analyzing the recognition accuracy of each driving state. The results indicate that even though the recognition accuracies of braking and decelerating states are mediocre, accuracies of the following, cruising an stopping states are exceptionally precise.
I-Sounds
Authors: Ricardo Cruz, António Brisson, Ana Paiva, Eduardo Lopes
Venue: Proceedings of the 2nd international conference on Affective Computing and Intelligent Interaction (2007)

I-Sounds aims to increase the Affective Bandwidth of an Interactive Drama system called I-Shadows, implementing a fully emergent system that generates affective music, based on musical theory and on the emotional state of the characters.
A Neural Framework for Robot Motor Learning Based on Memory Consolidation
Authors: Heni Ben Amor, Shuhei Ikemoto, Takashi Minato, Bernhard Jung, Hiroshi Ishiguro
Venue: Proceedings of the 8th international conference on Adaptive and Natural Computing Algorithms, Part II (2007)

Neural networks are a popular technique for learning the adaptive control of non-linear plants. When applied to the complex control of android robots, however, they suffer from serious limitations such as the moving target problem, i.e. the interference between old and newly learned knowledge. However, in order to achieve lifelong learning, it is important that robots are able to acquire new motor skills without forgetting previously learned ones. To overcome these problems, we propose a new framework for motor learning, which is based on consolidation. The framework contains a new rehearsal algorithm for retaining previously acquired knowledge and a growing neural network. In experiments, the framework was successfully applied to an artifical benchmark problem and a real-world android robot.