ppxscal/embedding_network huggingface dataset:
Development of an RIA-based user interface for promotion of effectiveness in marine transportation
Authors: Young Seong Park, Jeong Hee Lee, Hyung Rim Choi, Hyun Soo Kim, Jae Un Jung, Jae Young Park
Venue: Proceedings of the 8th conference on Applied computer scince (2008)

This study aims to develop and evaluate an RIA-based user interface which can effectively support marine vehicle transportation planning. Currently, it is emphasized that user interface not only plays a role to show the results processed in systems but that it also has to take a role to support users' operations, promote usability and so forth Also it is necessary to modify information system so that it can effectively express and adapt to information changing on a real-time basis and provide the information in a timely manner. Thus, this study develops an RIA-based user interface and proves with evaluation that it contributes to operation support and enhancement of usability.
Requirements-based Access Control Analysis and Policy Specification (ReCAPS)
Authors: Qingfeng He, Annie I. Antón
Venue: Information and Software Technology (2009)

Access control (AC) is a mechanism for achieving confidentiality and integrity in software systems. Access control policies (ACPs) express rules concerning who can access what information, and under what conditions. ACP specification is not an explicit part of the software development process and is often isolated from requirements analysis activities, leaving systems vulnerable to security breaches because policies are specified without ensuring compliance with system requirements. In this paper, we present the Requirements-based Access Control Analysis and Policy Specification (ReCAPS) method for deriving and specifying ACPs, and discuss three validation efforts. The method integrates policy specification into the software development process, ensures consistency across software artifacts, and provides prescriptive guidance for how to specify ACPs. It also improves the quality of requirements specifications and system designs by clarifying ambiguities and resolving conflicts across these artifacts during the analysis, making a significant step towards ensuring that policies are enforced in a manner consistent with a system's requirements specifications. To date, the method has been applied within the context of four operational systems. Additionally, we have conducted an empirical study to evaluate its usefulness and effectiveness. A software tool, the Security and Privacy Requirements Analysis Tool (SPRAT), was developed to support ReCAPS analysis activities.
Tight-binding study of the optical properties of GaN/AlN polar and nonpolar quantum wells
Authors: A. Molina, A. García-Cristóbal, A. Cantarero
Venue: Microelectronics Journal (2009)

The electronic structure of wurtzite semiconductor superlattices (SLs) and quantum wells (QWs) is calculated by using the empirical tight-binding method. The basis used consists of four orbitals per atom (sp3 model), and the calculations include the spin-orbit coupling as well as the strain and electric polarization effects. We focus our study on GaN/AlN QWs wells grown both in polar (C) and nonpolar (A) directions. The band structure, wave functions and optical absorption spectrum are obtained and compared for both cases.
Benders, metric and cutset inequalities for multicommodity capacitated network design
Authors: Alysson M. Costa, Jean-François Cordeau, Bernard Gendron
Venue: Computational Optimization and Applications (2009)

Solving multicommodity capacitated network design problems is a hard task that requires the use of several strategies like relaxing some constraints and strengthening the model with valid inequalities. In this paper, we compare three sets of inequalities that have been widely used in this context: Benders, metric and cutset inequalities. We show that Benders inequalities associated to extreme rays are metric inequalities. We also show how to strengthen Benders inequalities associated to non-extreme rays to obtain metric inequalities. We show that cutset inequalities are Benders inequalities, but not necessarily metric inequalities. We give a necessary and sufficient condition for a cutset inequality to be a metric inequality. Computational experiments show the effectiveness of strengthening Benders and cutset inequalities to obtain metric inequalities.
Modified clock-controlled alternating step generators
Authors: Ali A. Kanso
Venue: Computer Communications (2009)

In this paper, we propose a class of binary keystream generators, called modified clock-controlled alternating step generators, and referred to as &Omega;K, intended for hardware implementation. This class belongs to the family of clock-controlled generators, and is related to the class of alternating step generators (ASG). Two distinct subclasses of &Omega;K are investigated in details, namely mixed and linear generators. &Omega;K has been designed to produce keystreams with guaranteed randomness properties such as long period, high linear complexity and nice statistical distribution properties. The resistance of the proposed generators to well-known cryptanalytic attacks is investigated. Furthermore, the irregular clocking introduced is shown to provide a certain level of strengthened security against several cryptanalytic attacks. Finally, a hardware implementation of a generator of &Omega;K is provided.
History: The use of the kalman filter for human motion tracking in virtual reality
Authors: Gregory F. Welch
Venue: Presence: Teleoperators and Virtual Environments (2009)

In 1960 Rudolph E. Kalman published his now famous article describing a recursive solution to the discrete-data linear filtering problem (Kalman, “A new approach to linear filtering and prediction problems,” Transactions of the ASME---Journal of Basic Engineering, 82 (D), 35--45, 1960). Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and applications, particularly in the area of autonomous or assisted navigation. The purpose of this paper is to acknowledge the approaching 50th anniversary of the Kalman filter with a look back at the use of the filter for human motion tracking in virtual reality (VR) and augmented reality (AR). In recent years there has been an explosion in the use of the Kalman filter in VR/AR. In fact, at technical conferences related to VR these days, it would be unusual to see a paper on tracking that did not use some form of a Kalman filter, or draw comparisons to those that do. As such, rather than attempt a comprehensive survey of all uses of the Kalman filter to date, what follows focuses primarily on the early discovery and subsequent period of evolution of the Kalman filter in VR, along with a few examples of modern commercial systems that use the Kalman filter. This paper begins with a very brief introduction to the Kalman filter, a brief look at the origins of VR, a little about tracking in VR---in particular the work and conditions that gave rise to the use of the filter, and then the evolution of the use of the filter in VR.
Metadata interoperability in public sector information
Authors: Lina Bountouri, Christos Papatheodorou, Vasilis Soulikias, Mathios Stratis
Venue: Journal of Information Science (2009)

Over recent years, there has been a worldwide growing need for interoperability among the systems that manage and reuse public sector information. This paper explores the documentation needs for public sector information and focuses on metadata interoperability issues. The research work studies a variety of public sector information metadata standards and guidelines internationally accepted and presents two methodologies to obtain interoperability. The first develops an application profile, while the second is based on the semantic integration approach and results in the creation of an ontology. The outcomes of the two approaches are compared under the prism of their scope and usage in terms of interoperability during the metadata integration process.
Service-Oriented Architectures Testing: A Survey
Authors: Gerardo Canfora, Massimiliano Penta
Venue: Software Engineering: International Summer Schools, ISSSE 2006-2008, Salerno, Italy, Revised Tutorial Lectures (2009)

Testing of Service Oriented Architectures (SOA) plays a critical role in ensuring a successful deployment in any enterprise. SOA testing must span several levels, from individual services to inter-enterprise federations of systems, and must cover functional and non-functional aspects.SOA unique combination of features, such as run-time discovery of services, ultra-late binding, QoS aware composition, and SLA automated negotiation, challenge many existing testing techniques. As an example, run-time discovery and ultra-late binding entail that the actual configuration of a system is known only during the execution, and this makes many existing integration testing techniques inadequate. Similarly, QoS aware composition and SLA automated negotiation means that a service may deliver with different performances in different contexts, thus making most existing performance testing techniques to fail.Whilst SOA testing is a recent area of investigation, the literature presents a number of approaches and techniques that either extend traditional testing or develop novel ideas with the aim of addressing the specific problems of testing service-centric systems. This chapter reports a survey of recent research achievements related to SOA testing. Challenges are analyzed from the viewpoints of different stakeholders and solutions are presented for different levels of testing, including unit, integration, and regression testing. The chapter covers both functional and non-functional testing, and explores ways to improve the testability of SOA.
Transparent 2-D markers on an LCD tabletop system
Authors: Hideki Koike, Wataru Nishikawa, Kentaro Fukuchi
Venue: Proceedings of the 27th international conference on Human factors in computing systems (2009)

Tabletop systems are currently being focused on and many applications using these systems are being developed. In such tabletop systems, how to recognize real objects on the table is an essential and important issue. In existing tabletop systems, 2-D markers have been often used. However, their black-and-white pattern, which means nothing to humans, spoils the appearance of the object. We developed transparent markers on a liquid crystal display (LCD) tabletop system by using the polarization features of the LCD and optical lms. In particular, through experiments with various kinds of optical films, we found that two halfwave plates make the markers rotation invariant. By using the transparent markers, tangible transparent Magic Lenses(TM) applications were developed.
Mobile messaging using public key infrastructure: m-PKI
Authors: Nor Badrul Anuar, Lai Ngan Kuen, Omar Zakaria, Abdullah Gani
Venue: Proceedings of the 12th WSEAS international conference on Computers (2008)

Presently, mobile handheld device has successfully replaced traditional telephone to become the most popular wireless communication tools. Mobile Short Message Service (SMS) and Multimedia Message Service (MMS) fulfill almost all the user requirements as an effective communication and information delivering service. Since SMS/MMS become so popular on daily communication, there is a demand to communicate or exchange confidential information in a secure environment. Public Key Infrastructure (PKI) is a proven solution, which using pairing of key, for secure communication encryption. In this paper, M -PKI is introduced to provide PKI encryption to the mobile SMS and MMS.
Hardware Designs for Decimal Floating-Point Addition and Related Operations
Authors: Liang-Kai Wang, Michael J. Schulte, John D. Thompson, Nandini Jairam
Venue: IEEE Transactions on Computers (2009)

Decimal arithmetic is often used in commercial, financial, and Internet-based applications. Due to the growing importance of decimal floating-point (DFP) arithmetic, the IEEE 754 Draft Standard for Floating-Point Arithmetic (IEEE P754) includes specifications for DFP arithmetic. This paper gives an overview of DFP arithmetic in IEEE P754 and discusses previous research on decimal fixed-point and floating-point addition. It also presents novel designs for a DFP adder and a DFP multifunction unit (DFP MFU) that comply with IEEE P754. To reduce their delay, the DFP adder and MFU both use decimal injection-based rounding, a new form of decimal operand alignment, and a fast flag-based method for rounding and overflow detection. Synthesis results indicate that the proposed DFP adder is roughly 21% faster and 1.6% smaller than a previous DFP adder design, when implemented in the same technology. Compared to the DFP adder, the DFP MFU provides six additional operations, yet only has 2.8% more delay and 9.7% more area. A pipelined version of the DFP MFU has a latency of six cycles, a throughput of one result per cycle, an estimated critical path delay of 12.9 fanout-offour (FO4) inverter delays, and an estimated area of 0.2953mm2.
Bio-inspired Algorithms for the Vehicle Routing Problem, 1st edition
Authors: Francisco Baptista Pereira, Jorge Tavares
Venue:  (2008)

The vehicle routing problem (VRP) is one of the most famous combinatorial optimization problems. In simple terms, the goal is to determine a set of routes with overall minimum cost that can satisfy several geographical scattered demands. Biological inspired computation is a field devoted to the development of computational tools modeled after principles that exist in natural systems. The adoption of such design principles enables the production of problem solving techniques with enhanced robustness and flexibility, able to tackle complex optimization situations. The goal of the volume is to present a collection of state-of-the-art contributions describing recent developments concerning the application of bio-inspired algorithms to the VRP. Over the 9 chapters, different algorithmic approaches are considered and a diverse set of problem variants are addressed. Some contributions focus on standard benchmarks widely adopted by the research community, while others address real-world situations.
Research on the Combinational Evaluation of the Market Value of Listed Company
Authors: Nian-chu Zeng, Wei-dong Li
Venue: Proceedings of the 2009 Second International Workshop on Knowledge Discovery and Data Mining (2009)

Combinational evaluation method is a new kind of evaluation method which has been brought forward these years. Since the evaluation result of combinational evaluation method is more reasonable than that of single evaluation method, it is much more popular in application. Now more and more people participate in the stock investment, it is necessary to evaluate the market value of the related listed companies. In this paper, we introduce the principle of combinational evaluation method first and then construct an index system to evaluate the market value of listed companies in China’s medicine industry both with single evaluation method and combinational evaluation method. The advantage of combinational evaluation method is proved with the comparison of the final evaluation results.
Empirical bond order potential calculations of the elastic properties of epitaxial InGaSbAs layers
Authors: V. Haxha, R. Garg, M. A. Migliorato, I. W. Drouzas, J. M. Ulloa, P. M. Koenraad, M. J. Steer, H. Y. Liu, M. J. Hopkinson, D. J. Mowbray
Venue: Microelectronics Journal (2009)

In this paper, we show the use of an optimally parameterized empirical potential of the Abell-Tersoff type and demonstrate that we can obtain a deep level of insight into the properties of the epitaxially grown quaternary alloy InGaAsSb. We find that the strain energy as a function of composition does not follow intuitive averages between the binary constituents and that the theoretical behaviour appears to be substantiated by experimental evidence of growth of InAs self-assembled quantum dots capped by GaSbAs.
On the futility of statistical power optimization
Authors: Jason Cong, Puneet Gupta, John Lee
Venue: Proceedings of the 2009 Asia and South Pacific Design Automation Conference (2009)

In response to the increasing variations in integrated-circuit manufacturing, the current trend is to create designs that take these variations into account statistically. In this paper we try to quantify the difference between the statistical and deterministic optima of leakage power while making no assumptions about the delay model. We develop a framework for deriving a theoretical upper-bound on the suboptimality that is incurred by using the deterministic optimum as an approximation for the statistical optimum. On average, the bound is 2.4% for a suite of benchmark circuits in a 45nm technology. We further give an intuitive explanation and show, by using solution rank orders, that the practical suboptimality gap is much lower. Therefore, the need for statistical power modeling for the purpose of optimization is questionable.
A PrivacyCA for Anonymity and Trust
Authors: Martin Pirker, Ronald Toegl, Daniel Hein, Peter Danner
Venue: Proceedings of the 2nd International Conference on Trusted Computing (2009)

Trusted Computing (TC) as envisioned by the Trusted Computing Group promises a solution to the problem of establishing a trust relationship between otherwise unrelated platforms. In order to achieve this goal the platform has to be equipped with a Trusted Platform Module (TPM), which is true for millions of contemporary personal computers. The TPM provides solutions for measuring the state of a platform and reporting it in an authentic way to another entity. The same cryptographic means that ensure the authenticity also allow unique identification of the platform and therefore pose a privacy problem. To circumvent this problem the TCG proposed a trusted third party, the Privacy Certification Authority (PrivacyCA).Unfortunately, currently no PrivacyCA is generally available. In this paper we introduce our freely available implementation of a PrivacyCA. In addition, our PrivacyCA is itself a trusted service. It is capable of reporting its state to clients. Furthermore, we use a novel way to minimize the Trusted Computing Base of Java-based applications in conjunction with hardware-supported virtualization. We automatically generate the service interface from a structural specification. Thus, to the best of our knowledge, we were not only first to make this crucial service publicly available, but now also provide a trustworthy service whose privacy policy can be attested to its users by employing TC mechanisms.
The rate of convergence of GMRES on a tridiagonal Toeplitz linear system
Authors: Ren-Cang Li, Wei Zhang
Venue: Numerische Mathematik (2009)

The Generalized Minimal Residual method (GMRES) is often used to solve a nonsymmetric linear system Ax&#x00a0;=&#x00a0;b. But its convergence analysis is a rather difficult task in general. A commonly used approach is to diagonalize A&#x00a0;=&#x00a0;X&#x039b; X &#x2212;1 and then separate the study of GMRES convergence behavior into optimizing the condition number of X and a polynomial minimization problem over A&#x2019;s spectrum. This artificial separation could greatly overestimate GMRES residuals and likely yields error bounds that are too far from the actual ones. On the other hand, considering the effects of both A&#x2019;s spectrum and the conditioning of X at the same time poses a difficult challenge, perhaps impossible to deal with in general but only possible for certain particular linear systems. This paper will do so for a (nonsymmetric) tridiagonal Toeplitz system. Sharp error bounds on and sometimes exact expressions for residuals are obtained. These expressions and/or bounds are in terms of the three parameters that define A and Chebyshev polynomials of the first kind.
Enhancing simulation as improvement and decision support system tool
Authors: Heriberto Garcia, Eduardo Garcia
Venue: Proceedings of the 40th Conference on Winter Simulation (2008)

Lecturing a Discrete Event Simulation course implies some challenges for the instructors. These challenges implies taking decisions from the design of the course to the selection of the didactic strategy to be used in each lecture. On the other hand, the use of games during a lecture make easier the understanding of simulation concepts. Moreover, games may be designed to show the impact of changing the value of the decision variables, similar to a decision support system software. This paper presents a methodology to design an interactive simulation game, useful to teach discrete event simulation for undergraduate courses. The main objective of the game is to create an environment to make easier the students' understanding about simulation, such that they may learn the benefits of using simulation as modeling and analysis tool, and they may receive training on decision making concepts.
On measured behavior of the ARPA network
Authors: Leonard Kleinrock, William E. Naylor
Venue: Proceedings of the May 6-10, 1974, national computer conference and exposition (1974)

The purpose of this paper is to present and evaluate the results of recent measurements of the ARPA network. We first discuss the tools available for performing these measurements. We then describe the results of a particular experiment, which consisted of data collection over a continuous seven day period. The measured quantities included input traffic, line traffic, and message delays. This data is discussed in terms of network behavior and compared to analytic models. Lastly, we consider some implications and tradeoffs derived from these measurements which provide insight regarding the performance of computer networks.
Low-power mixed-signal CVNS-based 64-bit adder for media signal processing
Authors: Mitra Mirhassani, Majid Ahmadi, Graham A. Jullien
Venue: IEEE Transactions on Very Large Scale Integration (VLSI) Systems (2008)

In this paper, design of a mixed-signal 64-bit adder based on the continuous valued number system (CVNS) is presented. The 64-bit adder is generated by cascading four 16-bit radix-2 CVNS adders. Truncated summation of the CVNS digits reduced the number of required interconnections in the system, which in turn reduced design complexity and hardware costs. This adder can perform one 64-bit, two 32-bit, four 16-bit, or eight 8-bit additions on demand for media signal processing applications. The compact and low-power and low-noise design of the adder is suitable for this type of application. The 64-bit adder designed in TSMC CMOS 0.18-µm technology, has a worst case delay of 1.5 ns, energy dissipation of about 14 pJ with the core area of 13 250µm2.
Using Wikis to support the Net Generation in improving knowledge acquisition in capstone projects
Authors: Eric Ras, Jörg Rech
Venue: Journal of Systems and Software (2009)

Students have to cope with new technologies, changing environments, and conflicting changes in capstone projects. They often lack practical experience, which might lead to failing to achieve a project's learning goals. In addition, the Net Generation students put new requirements upon software engineering education because they are digitally literate, always connected to the Internet and their social networks. They react fast and multitask, prefer an experimental working approach, are communicative, and need personalized learning and working environments. Reusing experiences from other students provides a first step towards building up practical knowledge and implementing experiential learning in higher education. In order to further improve knowledge acquisition during experience reuse, we present an approach based on Web 2.0 technologies that generates so-called learning spaces. This approach automatically enriches experiences with additional learning content and contextual information. To evaluate our approach, we conducted a controlled experiment, which showed a statistically significant improvement for knowledge acquisition of 204% compared to conventional experience descriptions. From a technical perspective, the approach provides a good basis for future applications that support learning at the workplace in academia and industry for the Net Generation.