ppxscal/embedding_network huggingface dataset:
Network-Initiated Triggering for Mobility in Voice over 3GPP-WLAN
Authors: Wei-Kuo Chiang, Hsin-Fu Huang
Venue: Proceedings of the Fourth European Conference on Universal Multiservice Networks (2007)

This paper proposes a network-initiated triggering mechanism to facilitate terminal mobility with the session initiation protocol (SIP) in 3GPP Voice over WLAN (VoWLAN). We design the E2E Tunnel State Model running on the packet data gateway (PDG) using the CAMEL concept, and introduce the Mobility Server to re-establish sessions with third party call control (3PCC). The Mobility Server is triggered to provide the terminal mobility service from the PDG by detecting the state transition of E2E Tunnel State Model that represents the occurrence of a handover. This mechanism can advance the time to re-establish sessions. That is, our approach can provide smaller handover delay than SIP Mobility; moreover, it can handle mobility without additional support from the mobile host. In addition, the handover missing problem (messages lost) might happen when the MH moves under communication. With the help of the Mobility Server, the lost messages are re-sent, and the handover missing problem, including simultaneous movement, is therefore solved.
Function-Parallel Computation in a Data-Parallel Environment
Authors: Alex L. Cheung, Anthony P. Reeves
Venue: Proceedings of the 1993 International Conference on Parallel Processing - Volume 02 (1993)

Asynchromus problems are those which may be decomposed into a set of independenr sub-tasks which are suitable for concurrent execution. Th function paraIIeIism of these problems cannot normally be direcrly expressed using the data-parallel programming model. In this paper, data distribution strategies have been explored which allow an asynchronous problem to be implemented which function-parallelism in a data-parallel environment. When a problem can be implemented using both function-parallelism and data-parallelism, there are tradeoffs in using either approach. We have investigated the optimal balance between function-parallelism and data-parallelism for an asynchronous problem.
Hosaka and Spielberg Named Winners of 2006 Computer Pioneer Award
Venue: Computer (2007)

Mamoru Hosaka and Arnold Spielberg, two notable trailblazers in computing, recentlyreceived the Computer Pioneer Award, which honors individuals whose efforts resulted in thecreation and continued vitality of the electronic computing industry. Other topics covered inthis month's Computer Society Connection include a list of Computer Society members whowere named 2007 IEEE Fellows, information about nominating candidates for the 2008 classof IEEE Fellows, and a schedule for 2007 Computer Society meetings and elections.
Decision Support for Handling Mismatches between COTS Products and System Requirements
Authors: Abdallah Mohamed, Guenther Ruhe, Armin Eberlein
Venue: Proceedings of the Sixth International IEEE Conference on Commercial-off-the-Shelf (COTS)-Based Software Systems (2007)

In the process of selecting commercial off-the-shelf (COTS) products, it is inevitable to encounter mismatches between COTS products and system requirements. Mismatches occur when COTS attributes do not exactly match our requirements. Many of these mismatches are resolved after selecting a COTS product in order to improve its fitness with the requirements. This paper proposes a decision support approach that aims at addressing COTS mismatches during and after the selection process. Our approach can be integrated with existing COTS selection methods at two stages: (1) When evaluating COTS candidates: our approach is used to estimate the anticipated fitness of the candidates if their mismatches are resolved. This helps to base our COTS selection decisions on the fitness that the COTS candidates will eventually have if selected. (2) After selecting a COTS product: the approach suggests alternative plans for resolving the most appropriate mismatches using suitable actions, such that the most important risk, technical, and resource constraints are met. A case study from the e-services domain is used to illustrate the method and to discuss its added value.
A Privacy-Enhancing Radio Frequency Identification Tag: Implementation of the Clipped Tag
Authors: Paul A. Moskowitz, Andris Lauris, Stephen S. Morris
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications Workshops (2007)

The use of RFID tags for the tagging of individual consumer items is a distinct possibility The "Clipped Tag" has been suggested for individual items in order to enhance consumer privacy. The Clipped Tag allows the consumer to tear off a portion of the tag in order to transform a tag that may be read at a range of 10 meters to one than can only be read at a few cm. The use of these tags puts privacy protection in the hands of the consumer, provides a visual indication that the tag has been modified, but makes it possible for the tag to be used later for returns, recalls, or recycling. This paper describes an implementation of the Clipped Tag as a garment hang tag.
Communication Patterns over the Project Life Cycle--Evidence from a Virtual Project Exercise
Authors: Antti Nurmi, Pentti Marttiin, Matti Rossi
Venue: Proceedings of the 40th Annual Hawaii International Conference on System Sciences (2007)

Well functioning communication is vital to the success of projects, especially in virtual or distributed environments. To study how communication evolves over time we studied how students from three different Finnish universities communicated via Virtual Learning Environment (VLE) tool during a joint three month project work exercise, where students worked with real clients. We analyzed over 1000 discussion list messages and came up with seven categories that represent the topics discussed in message board discussions. Most of the messages were task-ralated, and therefore, there were fewer than expected messages that served social or community building purpose. Most of the messages were sent during the middle phase of the project. In later stages of the project the communication became close to pure information sharing as the percentage of these kinds of messages increased.
Using software architecture techniques to support the modular certification of safety-critical systems
Authors: Tim Kelly
Venue: Proceedings of the eleventh Australian workshop on Safety critical systems and software - Volume 69 (2007)

In software engineering the role of software architecture as a means of managing complexity and achieving emergent qualities such as modifiability is increasingly well understood. In this paper we demonstrate how many principles from the field of software architecture can be brought across to the field of safety case management in order to help manage complex safety cases. Traditional approaches to certification of modular systems as a statically defined configuration of components can result in a large certification overhead being associated with any module update or addition. A more promising approach is to attempt to establish a modular, compositional, approach to constructing safety cases that has a correspondence with the modular structure of the underlying architecture. This paper establishes the mechanisms for managing and representing safety cases as a composition of safety case 'modules'. Having defined the concept of a modular safety case, the paper also describes principles for their definition and evaluation. An example generic modular safety case architecture for Integrated Modular Avionics (IMA) based systems is presented as a means of illustrating the concepts defined.
A Simple Model and Infrastructure for Context-Aware Browsing of the World
Authors: Gabriella Castelli, Alberto Rosi, Marco Mamei, Franco Zambonelli
Venue: Proceedings of the Fifth IEEE International Conference on Pervasive Computing and Communications (2007)

The imminent mass deployment of pervasive computing technologies such as sensor networks and RFID tags, together with the increasing participation of the Web community in feeding geo-located information within tools such as Google Earth, will soon make available an incredible amount of information about the physical and social worlds and their processes. This opens up the possibility of exploiting all such information for the provisioning of pervasive context-aware services for "browsing the world", i.e., for facilitating users in gathering information about the world, interacting with it, and understanding it. However, for this to occur, proper models and infrastructures must be developed. In this paper we propose a simple model for the representation of contextual information, the design and implementation of a general infrastructure for browsing the world, as well as some exemplar services we have implemented over it.
Selection and Fusion of Color Models for Image Feature Detection
Authors: Harro Stokman Theo Gevers
Venue: IEEE Transactions on Pattern Analysis and Machine Intelligence (2007)

The choice of a color model is of great importance for many computer vision algorithms (e.g., feature detection, object recognition, and tracking) as the chosen color model induces the equivalence classes to the actual algorithms. As there are many color models available, the inherent difficulty is how to automatically select a single color model or, alternatively, a weighted subset of color models producing the best result for a particular task. The subsequent hurdle is how to obtain a proper fusion scheme for the algorithms so that the results are combined in an optimal setting. To achieve proper color model selection and fusion of feature detection algorithms, in this paper, we propose a method that exploits nonperfect correlation between color models or feature detection algorithms derived from the principles of diversification. As a consequence, a proper balance is obtained between repeatability and distinctiveness. The result is a weighting scheme which yields maximal feature discrimination. The method is verified experimentally for three different image feature detectors. The experimental results show that the fusion method provides feature detection results having a higher discriminative power than the standard weighting scheme. Further, it is experimentally shown that the color model selection scheme provides a proper balance between color invariance (repeatability) and discriminative power (distinctiveness).
Towards scalable and data efficient learning of Markov boundaries
Authors: Jose M. Peòa, Roland Nilsson, Johan Björkegren, Jesper Tegnér
Venue: International Journal of Approximate Reasoning (2007)

We propose algorithms for learning Markov boundaries from data without having to learn a Bayesian network first. We study their correctness, scalability and data efficiency. The last two properties are important because we aim to apply the algorithms to identify the minimal set of features that is needed for probabilistic classification in databases with thousands of features but few instances, e.g. gene expression databases. We evaluate the algorithms on synthetic and real databases, including one with 139,351 features.
Effective Retrieval of High Dimensional Vector by Class Coding in Vegetable Geographical Origin Identification System
Authors: Nobuyoshi Sato, Minoru Uehara, Koichiro Shimomura, Hirobumi Yamamoto, Kenichi Kamijo
Venue: Proceedings of the 27th International Conference on Distributed Computing Systems Workshops (2007)

We proposed a vegetable geographical origin identification system using difference of trace element composition by cultivated places to prevent camouflaging geographical origin. The system compared trace element compositions by calculating correlation coefficient. This is one-to-one comparison and makes system response time to identify slow. To solve this problem, we employed Similarity Preserve Hash (SPH) to reduce the number of target of one-to-one comparison and realized efficient identification to some degree. Although SPH makes identification itself faster, however, SPH wastes long time to retrieve trace element data for one-to-one comparison from database. In this paper, we discuss on coding of trace element composition to efficient retrieval from databases and realize efficient identification.
Meeting the challenge of expanding participation in the undergraduate research experience
Authors: A. Q. Gates
Venue: Proceedings of the 28th Annual Frontiers in Education - Volume 03 (1998)

The benefits of working in a research group are clear: students develop domain expertise, gain an understanding and appreciation of the research process and its practice, and acquire team, communication, problem-solving and higher-level thinking skills. Students with this experience are better equipped to make informed judgements about technical matters and to communicate and work in teams to solve complex problems. Clearly, this type of research experience must be made available to a broader population. This paper discusses how the Systems and Software Engineering Affinity Research Group model provides a socialization and infrastructure mechanism that supports the development and management of large research groups that engage undergraduate and graduate students with a wide range of skill levels and experiences in research and projects. This nonhierarchical model integrates students into both a small research group and the encompassing large research group and uses structured activities to develop their technical, communication, group and research skills.
Strategies for Reserving Resources on a Grid Environment
Authors: Antonella Di Stefano, Emiliano Tramontana, Daniele Zito
Venue: Proceedings of the 15th IEEE International Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises (2006)

Ensuring that a job executes at the desired timeframe in a Grid environment is possible only when reservation policies are employed. Such policies often require users to predict job needs in terms of duration and CPU capability. However, the efficient use of resources can be jeopardised by the low accuracy of user predictions. This paper proposes: (i) an automatic support for detecting the job characteristics and timing requirements, and (ii) a novel admission control policy relaying on such a knowledge and some indications on credential and reputation that requests could bring. The developed reservation component has been integrated into Globus Toolkit in a way that let users perform just allocation, when reservation is unnecessary or impossible.
Efficiently scheduling X clients
Authors: Keith Packard
Venue: Proceedings of the annual conference on USENIX Annual Technical Conference (2000)

The X server is charged with providing window system services to many applications simultaneously, and needs a scheduling mechanism to distribute it's limited resources among these applications. The original scheduling mechanism was simplistic and caused graphics-intensive applications to starve interactive applications. A new scheduling mechanism has been designed which fairly distributes time among the requesting applications while at the same time increasing performance by a small amount. Descriptions of the original and new scheduling mechanism and empirical measurements demonstrating the effects of scheduling within the X server are included along with a discussion on how the design was arrived at.
Bayesian multivariate Poisson mixtures with an unknown number of components
Authors: Loukia Meligkotsidou
Venue: Statistics and Computing (2007)

In this paper we present Bayesian analysis of finite mixtures of multivariate Poisson distributions with an unknown number of components. The multivariate Poisson distribution can be regarded as the discrete counterpart of the multivariate normal distribution, which is suitable for modelling multivariate count data. Mixtures of multivariate Poisson distributions allow for overdispersion and for negative correlations between variables. To perform Bayesian analysis of these models we adopt a reversible jump Markov chain Monte Carlo (MCMC) algorithm with birth and death moves for updating the number of components. We present results obtained from applying our modelling approach to simulated and real data. Furthermore, we apply our approach to a problem in multivariate disease mapping, namely joint modelling of diseases with correlated counts.
Building a community-based Linux certification program: an update on the progress of the Linux professional institute
Authors: Dan York
Venue: Proceedings of the 3rd annual conference on Atlanta Linux Showcase - Volume 3 (1999)

A report to the community on the progress of the LPI certification program (which will be well underway at the time of presentation), explaining future directions, outlining how people can become more involved in the process, and soliciting feedback from people there at the session.
An analysis and comparison of conservative upwind difference schemes for ideal and non-ideal gases
Authors: P. Glaister
Venue: Computers Mathematics with Applications (2007)

In a recent paper [P. Glaister, Conservative upwind difference schemes for the Euler equations, Comput. Math. Appl. 45 (2003) 1673-1682] a number of numerical schemes were presented for the Euler equations governing compressible flows of an ideal gas, the principal one of which is based on a conservative linearisation approach. This scheme was subsequently extended to encompass compressible flows of real gases where the equation of state allows for non-ideal gases [P. Glaister, Conservative upwind difference schemes for compressible flows of a real gas, Comput. Math. Appl. 48 (2004) 469-480]. These schemes use different parameter vectors in their construction and, consequently, the scheme in [P. Glaister, Conservative upwind difference schemes for compressible flows of a real gas, Comput. Math. Appl. 48 (2004) 469-480] when applied to the special case of an ideal gas is not identical to the principal ideal gas scheme in [P. Glaister, Conservative upwind difference schemes for the Euler equations, Comput. Math. Appl. 45 (2003) 1673-1682]. In this paper it is shown how these schemes are related, followed by a numerical comparison when each is applied to two standard test problems.
PeerStripe: a p2p-based large-file storage for desktop grids
Authors: Chreston Miller, Patrick Butler, Ankur Shah, Ali R. Butt
Venue: Proceedings of the 16th international symposium on High performance distributed computing (2007)

In desktop grids the use of off-the-shelf shared components makes the use of dedicated resources economically nonviable and increases the complexity of design of efficient storage systems that are required to address the exponentially growing storage demands of modern applications that run on these platforms. To address this challenge, we present PeerStripe, a storage system that transparently distributes files to storage space contributed by participants that have joined a peer-to-peer (p2p) network. PeerStripe uses structured p2p routing to yield a scalable, robust, reliable, and self-organizing storage system. The novelty of PeerStripe lies in its ingenious use of striping and error coding techniques in a heterogeneous distributed environment to stor every large data files. Our evaluation of PeerStripe shows that it can achieve acceptable performance for applications in desktop grids.
An extrinsic calibration method for 3D range surface sensors: an application in radiotherapy patient positioning
Authors: Ruben Posada-Gomez, Giner Alor-Hernandez, Mario Alberto Garcia-Martinez, Juan Antonio Quintana-Silva
Venue: Proceedings of the 17th International Conference on Electronics, Communications and Computers (2007)

The use of 3D surface sensor has been recently proposed for patient positioning in radiotherapy treatments. In this kind of applications, relating the coordinate system of 3d sensor with the coordinate system of treatment's room is crucial and needs a sensor's calibration. Sensor's calibration depends of its measuring principle; so calibrating a time-of-fly sensor has some differences to calibrating an active triangulation sensor. Additionally the intrinsic calibration requires knowing the internal parameters of sensor, which are frequently unknown for final user. This work presents a method for calibrating 3D surface sensor independently of its measuring principle. It uses directly the cloud of points to retrieve the extrinsic parameters, relating the virtual sensor space with a real coordinate system (three laser's beams of a radiotherapy room). A comparison between two different calibrations objects is presented. The use of 3D points allows a flexible, accurate and robust extrinsic calibration. Tests results show that it is possible to relate two coordinates systems with less of 1.2 mm error.
A Secure Key Exchange and Mutual Authentication Protocol for Wireless Mobile Communications
Authors: HE Yijun, XU Nan, LI Jie
Venue: Proceedings of the The Second International Conference on Availability, Reliability and Security (2007)

We propose an efficient and secure Mutual Authentication and Key Exchange Protocol suitable for applications using low-power mobile communications. It maintains the required level of security and has the property of perfect forward secrecy which is not possessed by other protocols such as ES-MAKEP, LMAKEP, and I-MAKEP. Moreover, the paper also provides a formal proof to guarantee the security of the proposed protocol. Further, we apply the proposed authentication and key exchange solution to WTLS to obtain a more secure protocol.
Theory of Generalized Branch and Combine Clock Networks
Authors: Ahmed El-Amawy, Priyalal Kulasinghe
Venue: Proceedings of the 1994 International Conference on Parallel Processing - Volume 01 (1994)

In a recent development a new clock distribution scheme, called Branch-and-Combine or BaC, has been introduced. The scheme is the first to guarantee constant skew bound regardless of network size. In this paper we generalize and extend the work on BaC networks. We establish some interesting results on clocking paths, node input sequences, node inputs' relative timing, network stability, and skew bound. Furthermore, this study establishes an upper bound on maximum clocking rates for BaC networks which is about double that predicted by earlier studies.
Routing dynamics measurement and detection for next step Internet signaling protocol
Authors: C. Shen, H. Schulzrinne, Sung-Hyuck Lee
Venue: Proceedings of the End-to-End Monitoring Techniques and Services on 2005. Workshop (2005)

A next step in signaling (NSIS) protocol is currently under standardization by the Internet Engineering Task Force (IETF) to support various applications that need to manipulate control information along the flow path. This paper addresses the NSIS protocol and IP routing interaction problem. We conducted routing measurement experiments to characterize the current Internet path dynamics, and discussed the impact of the observations on NSIS protocol design. The focus of our study is route change. We introduce NSIS-affecting route changes and define them in typical NSIS deployment models. With the NSIS deployment models in mind, we evaluate the simple packet TTL monitoring route change detection method. Finally, we propose a new route change detection method based on one-way-delay monitoring and provide preliminary evaluation.