ppxscal/embedding_network huggingface dataset:
Two-Dimensional Framework for Analyzing Variabilities in Software Product Lines
Authors: Mikyeong Moon, Heung Seok Chae, Junseok Park, Keunhyuk Yeom
Venue: Proceedings of the Seventh IEEE/ACIS International Conference on Computer and Information Science (icis 2008) (2008)

Commonality and variability play central roles in all product line development processes. Indeed, at each phase of core assets development, variabilities can exist at different levels of abstraction and in addition can be concretized by different artifacts. In this paper, we suggest a 2-dimensional framework for analyzing variabilities of core assets in software product lines. In the vertical analysis, variations are analyzed at different abstract levels, in which the region of commonality is first identified, and variation points are accordingly defined. In the horizontal analysis, variation types are elaborated according to the characteristics of requirements and architecture. With this framework, the variability of assets can be consistently and explicitly described, allowing variations to be traced in core assets and seamless reuse of core assets across the entire life cycle.
Local optimization of global objectives: competitive distributed deadlock resolution and resource allocation
Authors: B. Awerbuch
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

The work is motivated by deadlock resolution and resource allocation problems, occurring in distributed server-client architectures. We consider a very general setting which includes, as special cases, distributed bandwidth management in communication networks, as well as variations of classical problems in distributed computing and communication networking such as deadlock: resolution and "dining philosophers". In the current paper, we exhibit first local solutions with globally-optimum performance guarantees. An application of our method is distributed bandwidth management in communication networks. In this setting, deadlock resolution (and maximum fractional independent set) corresponds to admission control maximizing network throughput. Job scheduling (and minimum fractional coloring) corresponds to route selection that minimizes load.
Playground games: a design strategy for supporting and understanding coordinated activity
Authors: Deborah Tatar, Joon-Suk Lee, Nouf Alaloula
Venue: Proceedings of the 7th ACM conference on Designing interactive systems (2008)

From a design point of view, coordination is radically undertheorized and under-explored. Arguably, playground games are the universal, cross-cultural venue in which people learn about and explore coordination between one another, and between the worlds of articulated rules and the worlds of experience and action. They can therefore (1) teach us about the processes inherent in human coordination, (2) provide a model of desirable coordinative possibilities, and (3) act as a design framework from which to explore the relationship between game and game play---or, to put it in terms of an inherent tension in human-computer interaction, between plans and situated actions. When brought together with a computer language for coordination that helps us pare down coordinative complexity to essential components, we can create systems that have highly distributed control structures. In this paper, we present the design of four such student-created collaborative, distributed, interactive systems for face-to-face use. These take their inspiration from playground games with respect to who can play (plurality), how (appropriability) and to what ends (acompetitiveness). As it happens, our sample systems are themselves games; however, taking playground games as our model helps us create systems that support game play featuring not enforcement of plans but emergence of rules, roles, and turn taking.
A global constraint for total weighted completion time for cumulative resources
Authors: András Kovács, J. Christopher Beck
Venue: Engineering Applications of Artificial Intelligence (2008)

The criterion of total weighted completion time occurs as a sub-problem of combinatorial optimization problems in such diverse areas as scheduling, container loading and storage assignment in warehouses. These applications often necessitate considering a rich set of requirements and preferences, which makes constraint programming (CP) an effective modeling and solving approach. On the other hand, basic CP techniques can be inefficient in solving models that require inference over sum type expressions. In this paper, we address increasing the solution efficiency of constraint-based approaches to cumulative resource scheduling with the above criterion. Extending previous results for unary capacity resources, we define the COMPLETION"m global constraint for propagating the total weighted completion time of activities that require the same cumulative resource. We present empirical results in two different problem domains: scheduling a single cumulative resource, and container loading with constraints on the location of the center of gravity. In both domains, the proposed constraint propagation algorithm out-performs existing propagation techniques.
Efficient controller implementations for robot control
Authors: S. Commuri, V. Tadigotla, L. Sliger
Venue: Proceedings of the 5th WSEAS International Conference on Circuits, Systems, Electronics, Control & Signal Processing (2006)

Field Programmable Gate Arrays (FPGAs) have emerged as the platform of choice for the rapid prototyping and testing of hardware circuits. The dynamic creation of hardware circuits in FPGAs provides an efficient mechanism for customizing the hardware for specific task objectives. The ability of these devices to be reprogrammed during run-time enables the hardware circuitry to adapt to changing task requirements and to accommodate system faults. In this paper, the use of FPGAs in implementing different behaviors and controllers for a mobile robot application is presented. It is shown that the computational hardware can be optimized for each task and sophisticated behaviors and controllers implemented in an efficient manner. The proposed approach is validated through a case study where a robot is configured to meet application specific requirements and the controllers on this robot are modified dynamically using Xilinx Virtex-II Pro FPGAs.
A 3.2Gb/s clock and data recovery circuit without reference clock for a high-speed serial data link
Authors: Kang jik Kim, Ki sang Jeong, Seong ik Cho
Venue: Proceedings of the 2nd WSEAS International Conference on Circuits, Systems, Signal and Telecommunications (2008)

A 3.2Gb/s clock and data recovery (CDR) circuit for a high-speed serial link without the reference clock is described. The CDR has a phase and frequency detector (PD and FD), which incorporates a half-rate bang-bang type oversampling PD and a half-rate frequency detector that can achieve low-jitter operation and improve pull-in range. The PD of oversamping method finds a phase error by generating four phase up/down signals. The FD also finds a frequency error by generating frequency up/down signals. Therefore these six signals control three charge pump (CP) respectively. It also has a ring oscillator type voltage controlled oscillator (VCO) and three charge pumps. The VCO consists of four fully differential delay cells with rail-to-rail current bias scheme that can increase the VCO tuning range and tuning linearity and each delay cell has a duty-cycle circuit(DCC) as a buffer of the duty-cycle mismatch compensation. The CDR circuit was designed for fabrication using 0.18um 1P6M CMOS process. The designed circuit consumes 148mW from 1.8V supply voltage according to simulation results.
Backward channel aware Wyner-Ziv video coding: A study of complexity, rate, and distortion tradeoff
Authors: Limin Liu, Zhen Li, Edward J. Delp
Venue: Image Communication (2008)

Wyner-Ziv video coding is a coding method that exploits source statistics at the decoder. Many Wyner-Ziv video coding schemes encode a video sequence into two types of frames, key frames and Wyner-Ziv frames, and rely on the frequent use of INTRA frames as key frames such that the decoder can derive sufficiently accurate side information. While the use of INTRA frame as key frames keeps the encoding complexity low, it also leads to much lower coding efficiency compared to state-of-the-art predictive video coding. In this paper we present a Wyner-Ziv video coding scheme that uses backward channel aware motion estimation to encode the key frames, where motion estimation is performed at the decoder and motion information is sent back to the encoder. Two motion vector selection methods are proposed and we present a model to study the complexity-rate-distortion tradeoff in such coding schemes.
Graphs of degree 4 are 5-edge-choosable
Authors: Martin Juvan, Bojan Mohar, Riste Skrekovski
Venue: Journal of Graph Theory (1999)

It is shown that every simple graph with maximal degree 4 is 5-edge-choosable. &copy; 1999 John Wiley & Sons, Inc. J Graph Theory 32: 250&ndash;264, 1999
Establishing a mobile blog system in a distance education environment
Authors: Teemu H. Laine, Jarkko Suhonen
Venue: International Journal of Mobile Learning and Organisation (2008)

Distance-learning programs often encounter problems with student motivation and performance. In the Virtual Studies of Computer Science (ViSCoS) program, these problems stem partly from lack of learning community. Furthermore, distance learning is not always location- and time-agnostic. ViSCoS Mobile is an m-learning extension to ViSCoS that frees students to study anywhere and anytime. We present the first design, implementation and evaluation of a mobile blog system Advanced Postman for ViSCoS. Preliminary testing of the system indicated that moblogs can be used successfully as a reporting tool on a programming project course. The results are applicable to any distance-learning program.
Adaptive Branch and Bound Using SAT to Estimate False Crosstalk
Authors: Murthy Palla, Jens Bargfrede, Klaus Koch, Walter Anheier, Rolf Drechsler
Venue: Proceedings of the 9th international symposium on Quality Electronic Design (2008)

Accurate crosstalk analysis has become a key issue in Static Timing Analysis of modern deep–submicron digital circuits. The inherent logic and timing properties of the circuit are often neglected in the crosstalk estimation process resulting in an overly pessimistic analysis. The problem of considering the logic correlations of the circuit to eliminate false crosstalk has been widely studied, but still lacks a very efficient solution also due to its NP–hard nature. In this paper, we propose a SAT solver based approach to efficiently solve the false crosstalk problem. We also propose a novel and very powerful bounding technique called Adaptive Bounding as well as an aggressor ordering technique called Simple Aggressor Ordering for the branch and bound method running on top of the SAT solver. These techniques are proven to drastically increase the speed of false crosstalk analysis to an extent that nets with hundreds of aggressors can be handled. The results of this approach on the ISCAS89 benchmark circuits are provided.
Coordinating Almost Synchronous Communication Streams
Authors: Walter Dosch
Venue: Proceedings of the Third International Conference on Systems (2008)

An almost synchronous stream consists of a sequence of proper messages and pauses transmitted over a directed channel. The paper presents the transformational design of a communicating component which coordinates two almost synchronous streams. A proper message on one input channel is forwarded to the corresponding output channel as soon as there arrives a proper message on the other input channel as well. We refine the stream-based input/output behaviour to a state-based implementation exploiting two major transformations. The first transformation refines the component's infinite behaviour to a finite behaviour. The second transformation implements the component's finite behaviour by a state transition machine. The component's internal state is extracted from the input histories using a history abstraction function. Altogether, we explicate a formal method how to refine a specified infinite input/output behaviour of a communicating component by a state transition machine in the setting of almost synchronous streams.
Original paper: GIS-based planning support system for rural land-use allocation
Authors: Inés Santé-Riveira, Rafael Crecente-Maseda, David Miranda-Barrós
Venue: Computers and Electronics in Agriculture (2008)

This article describes a planning support system for rural land-use allocation. The system is called RULES (RUral Land-use Exploration System) and is based on a geographic information system (GIS). Other software components have been incorporated into the GIS to link external analytical models to the system. These analytical techniques support three basic stages in a rural land-use planning model: land suitability evaluation, land-use area optimization, and spatial allocation of land uses. Land evaluation is carried out using multicriteria evaluation methods and the FAO framework. A multiobjective linear programming model has been designed for the optimization of land-use areas, where the objectives include economic, social, and environmental aspects. Suitability maps and land-use areas obtained in the two previous stages are used to design the final land-use map using three techniques: hierarchical optimization, ideal point analysis, and an algorithm based on simulated annealing. The system has been applied in Terra Cha (a region in NW Spain), thereby demonstrating its efficacy. The system enabled alternative land-use plans to be generated for this region according to different stakeholders' perspectives. This tool contributes to directing and supporting discussion throughout the planning process.
Proceeding of the 1st ACM international workshop on Foundations of wireless ad hoc and sensor networking and computing
Venue: International Symposium on Mobile Ad Hoc Networking Computing (2008)

Welcome to the first ACM International Workshop on Foundations of Wireless Ad Hoc and Sensor Networking and Computing (FOWANC'08). FOWANC'08 is devoted to distributed algorithms and theoretical methods in the context of wireless ad hoc and sensor networking and computing. This workshop is intended to foster cooperation among researchers in wireless ad hoc and sensor networking and theoreticians in algorithm and theory, and push the theoretical research forward for a deeper understanding about ad hoc and sensor networking and computing. This year, ACM FOWANC received 38 paper submissions from authors spread over 19 countries across the globe. Every paper received three peer reviews from our technical program committee and external reviewers. The Technical Program Committee and all reviewers did an excellent job in reviewing papers. The group was very diverse, with people from industry, the national laboratories, and universities all over the world. After thorough analysis of the reviews returned, we accepted 13 papers for the workshop with a 34% acceptance rate. The papers overall were of excellent quality.
Managing Master Data with XML Schema and UML
Authors: Ludovic Menet, Myriam Lamolle, Amar Zerdazi
Venue: Proceedings of the 2008 International Workshop on Advanced Information Systems for Enterprises (2008)

To manage parameters, the majority of Information Systems is concerned by heterogeneity in both data and solutions. Consequently, the management of this data becomes complex, inefficient, insecure and expensive. The need to use a structured formalism to handle complex data appears. We suggest a data integration solution based on a XML architecture. This architecture embeds a Master Data Management in the Information System. The unification of Master Data is primarily done by the definition of models. These models are XML Schema documents describing complex data structures. We propose to enrich the structure and the semantics of these models by defining a metamodel. In the metamodel, we introduce semantic object relations for defining links between concepts. The resulting metamodel is used to define an UML profile and to optimize operations such as models validation, data factorization and trees representation. Moreover, UML profile is exploited to make easier the definition of models.
Mapping damage during the Bam (Iran) earthquake using interferometric coherence
Authors: J. Hoffmann
Venue: International Journal of Remote Sensing (2007)

We use changes in the interferometric coherence to map earthquake damage that occurred in the city of Bam during the Bam earthquake on 26 December 2003. The approach presented here defines a coherence change index that can be interpreted quantitatively in terms of damage during a catastrophic event like a major earthquake. Using five differential interferometric synthetic aperture radar images, we compute maps of interferometric coherence. Three coherence change images are computed from these based on different interferograms. These three damage assessments yield very similar results despite the range of times and interferometric baselines spanned. This coherence-based damage assessment also agrees closely with independent damage maps derived from other types of imagery. Using existing or planned synthetic aperture radar (SAR) satellites, coherence-based damage assessments can be obtained within days after a catastrophic event, provided the necessary reference images are prepared ahead of time. As SAR sensors can operate independently of weather conditions and daylight, this may present a reliable and robust means of damage assessment.
New Computational Intelligence Paradigm for Estimating the Software Project Effort
Authors: Emad A. El-Sebakhy
Venue: Proceedings of the 22nd International Conference on Advanced Information Networking and Applications - Workshops (2008)

Recently, there are numerous techniques have been proposed to forecast and identify the software development effort; such prediction has a prominent impact on the success of software development projects. The most common methods for estimating software development efforts that have been proposed in literature are: line of code (LOC)-based constructive cost model (COCOMO), function pointbased regression model (FP), neural network model(NN), and case-based reasoning (CBR). Recent research has tended to focus on the use of function points (FPs) in estimating the software development efforts, however, a precise estimation should not only consider the FPs, which represent the size of the software, but should also include various elements of the development environment for its estimation. Therefore, the main benefit of this study is to design and analyze both function points and development environments of recent software development cases. Therefore, this paper presents a new intelligence paradigm scheme based on functional network to forecast that emphasizes on numerous software development elements. Both implementation and learning process are based on the utilization of functional networks as a new modeling scheme and investigate its efficiency as a software development estimation model for predicting the software development efforts.
Wireless Networked Chinese Telemedicine System: Method and Apparatus for Remote Pulse Information Retrieval and Diagnosis
Authors: Shilong Lu, Rui Wang, Li Cui, Ze Zhao, Youhua Yu, Zengyu Shan
Venue: Proceedings of the 2008 Sixth Annual IEEE International Conference on Pervasive Computing and Communications (2008)

There is a growing need for medical care resources when people pay more and more attention to their health conditions. The hospitals, however, can not satisfy all those ever-increasing requirements. There is hence a contradiction between the needs of the medical care and resource availability. A remote telemedical care system is a possible optimistic way towards solv-ing this problem with the support of emerging new technologies. In this paper, we present the develop-ment of a wireless networked Chinese telemedicine system for remote pulse information monitoring, namely WNCTs, based on the principle of Chinese pulse diagnosis in Chinese medicine (CPD). The pro-posed wearing system may collect the pulse condition, analyze the information by data fusion and provide diagnostic results. The distinctive features of the pro-posed wireless system include: small in size, light in weight, multiple of type pulse detection and networked users’ remote management. In this paper we provide the design and implementation of the wearing wireless networked Chinese telemedicine system. We also dem-onstrate the use of the system in pulse information re-trieval. Our results indicate significant practical feasi-bility of the networked telemedicine system.
On syntactic versus computational views of approximability
Authors: S. Khanna, R. Motwani
Venue: Proceedings of the 35th Annual Symposium on Foundations of Computer Science (1994)

We attempt to reconcile the two distinct views of approximation classes: syntactic and computational. Syntactic classes such as MAX SNP permit structural results and have natural complete problems, while computational classes such as APX allow us to work with classes of problems whose approximability is well-understood. Our results provide a syntactic characterization of computational classes, and give a computational framework for syntactic classes.
Measurement and emulation of time varying packet delay with applications to networked haptic virtual environments
Authors: Ganesh Sankaranarayanan, Lauren Potter, Blake Hannaford
Venue: Proceedings of the 1st international conference on Robot communication and coordination (2007)

Networked haptic virtual environments (NHVEs) are increasingly being used in medical simulation, aircraft maintenance training, and other similar fields. In this paper we present the implementation of a network emulator that can create realistic Internet-like characteristics in a laboratory setting for networked haptics. We compare the quality of this delay emulator to actual measurements taken on the Internet by reflecting UDP data packets and analyzing their round-trip delay distribution and packet loss.
Network P2P for Exploring and Visualization of Proteomic Data: Possibility of Handling Data and Analysing Them under Different Perspectives
Authors: G. Mercurio, S. Maglio, A. Agrusti, G. De Nunzio, R. Cataldo, I. De Mitri, M. Favetta, A. Massafra, G. Marsella, D. Vergara, M. Maffia, A. Vasilateanu, L. D. Serbanati
Venue: Proceedings of the 2008 International Conference on Biocomputation, Bioinformatics, and Biomedical Technologies (2008)

Our group has started a project aiming at the development of analysis algorithms devoted to images produced by two-dimensional electrophoresis (2-DE) for general applications in the field of proteomics. General analysis problems have been addressed, with the ultimate goal of the maximization of the "automation level" of the analysis procedure, without reducing the accuracy now reachable only with manual intervention. For this, the group is analyzing 2-DE images that are already stored or that will be produced by means of the instrumentation and the know-how of the biologists participating to the project. It's obvious that the "key" for the project success is primarily the availability of many images produced by different groups, but especially their "comparability", and their significant "clinical contextualization". For these reasons, the group has started the implementation of federation of heterogeneous bio banks of images founded on open Registry/Repository for P2P architecture (ebXML RR)[1], on images stored with standard metadata for their comparability (EFMI MIP) [2], and on standard electronic documents for their clinical contextualization (HL7 CDA) [3]. This paper summarizes the concepts of the initiative and describes possibility of handling data and analysing them under different perspectives.