ppxscal/embedding_network huggingface dataset:
Proceedings of the 4th international conference on Aspect-oriented software development
Venue: Aspect-oriented software development (2005)

AOSD 2005 is the fourth annual, international conference on Aspect-Oriented Software Development. It is the flagship forum on the state-of-the-art and the state-of-the-practice in AOSD. The conference was held in Chicago, Illinois (USA), from March 14-18, 2005. This volume comprises the proceedings of the research paper track of AOSD 2005.Over the past year, interest in AOSD has continued to grow among both researchers and practitioners, and significant advances have occurred, both technologically and in the rate and level of adoption of AOSD technologies. The conference program reflects this balance between leading-edge research and industrial application with a mix of keynote speeches, technical papers, invited industry talks, reports from practitioners, a student research event, an industrial panel on the topic of challenges and opportunities for industrial adoption of AOSD, exhibitions of some leading aspect-oriented technologies, and demonstrations from both researchers and practitioners. The eight workshops and ten tutorials held before the start of the main conference reflected the breadth of topics of interest to the AOSD community, from aspect programming languages, to software engineering practices and technologies across the software lifecycle that leverage or promote the use of AOSD, to the application of aspects to address significant problems in large-scale enterprise applications and particular domains.The 17 papers presented as part of the technical program were selected from 87 submissions. The program committee met on November 19 and 20, 2004 to select the papers. All papers were reviewed by at least three members of the program committee, except for papers submitted by program committee members, which were reviewed by at least five PC members.The technical program boasts two distinguished keynote speakers. IBM Fellow Grady Booch, a pioneer in software design and co-inventor of the Unified Modeling Language, focuses on the role AOSD could play in simplifying programming models. Dave Thomas, founder of Object Technologies International and Bedarra Research Labs, and a faculty member at Carleton University and University of Queensland, considers how AOSD technologies can cross the chasm from research to the mainstream.
Scene-Adapted Structured Light
Authors: Thomas P. Koninckx, Pieter Peers, Philip Dutre, Luc Van Gool
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

In order to overcome several limitations of structured light 3D acquisition methods, the colors, intensities, and shapes of the projected patterns are adapted to the scene. Based on a crude estimate of the scene geometry and reflectance characteristics, the local intensity ranges in the projected patterns are adapted, in order to avoid over- and under-exposure in the image. This avoids the infamous specularity problems and generally increases accuracy. The estimated geometry also helps to limit the effect of aliasing caused by the sampling of foreshortened patterns. Furthermore, the approach also acounts for the adverse effects that small motions during scanning would normally have. Moreover, the approach yields a confidence measure at every pixel of the range image. Last but not least, the scanner consists of consumer products only, and therefore is cheap.
On monotonic solutions of an integral equation of Volterra type
Authors: J. Caballero, J. Rocha, K. Sadarangani
Venue: Journal of Computational and Applied Mathematics (2005)

Using a technique associated with measures of noncompactness we prove the existence of nondecreasing solutions to integral equations of Volterra type in C[0,1].
A bijection for the total area of parallelogram polyominoes
Authors: Alberto Del Lungo, Maurice Nivat, Renzo Pinzani, Simone Rinaldi
Venue: Discrete Applied Mathematics (2004)

The sum of the areas of the parallelogram polyominoes having semi-perimeter n + 2 is equal to 4n. In this paper we give a simple proof of this property by means of a mapping from the cells of parallelogram polyominoes having semiperimeter n + 2 to the 4n words of length n of the free monoid {a, b, c, d}*. This mapping works in linear time. Then, we introduce a tiling game arising from this enumerative property.
Socially Aware Computation and Communication
Authors: Alex (Sandy) Pentland
Venue: Computer (2005)

Most would agree that todayýs communication technology seems to be at war with human society. Pagers buzz, cell phones interrupt, and e-mail begs for attention. Technologists have responded with well-meaning solutions that ultimately fail because they ignore the core problem: Computers are socially ignorant.A research group at MIT is taking the first steps toward quantifying social context in human communication. These researchers have developed three socially aware platforms that objectively measure several aspects of social context, including analyzing the speakerýs tone of voice,facial movement, or gestures.
A Semantic Interoperability Extension Model to the ebXML Registry
Authors: Wudong Liu, Lulu He, Jing Liu, Keqing He
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume I - Volume 01 (2005)

The ebXML registry & repository standard is one of the most well accepted standards in the field of registry. Several products claiming to be ebXML compatible have been developed. While the ebXML standard is initially designed for registering and storing e-business related artifacts for the automation of the e-business, it doesn't prevent us from using it as a versatile registry and repository for any kind of industrial artifacts. However, some problems arise in this case. This paper describes a semantic model for the ebXML registry and also illustrates how to utilize it to extend semantic interoperability. The model doesn't violate the existing ebRS or ebRIM standard. On the contrary, it's based on and complementary to them, which is essentially important when we register artifacts in a versatile and federated environment.
Multidisciplinary Applications of Detached-Eddy Simulation to Separated Flows at High Reynolds Numbers
Authors: Scott A. Morton, Denis Kholodar, Thomas Billingsley, James R. Forsythe, Kenneth E. Wurtzler, Kyle D. Squires, Russell M. Cummings, Philippe R. Spalart
Venue: Proceedings of the 2004 Users Group Conference (2004)

The current effort develops and demonstrates the application of high resolution turbulence modeling to flight mechanics and aeroelasticity of air vehicles at flight conditions where the vehicle is experiencing massively separated flow fields. The effort has both a basic research component to aid in developing the method and an applied component where the method is used to demonstrate an ability to simulate current DoD aircraft issues in flight mechanics and aeroelasticity. The high resolution turbulence method is a hybrid Reynolds Averaged Navier-Stokes (RANS) Large-Eddy Simulation (LES) method introduced by Spalart et al. in 1997 called Detached-Eddy Simulation (DES) implemented in an unstructured Navier-Stokes solver, Cobalt. In the basic research component, DES has been applied to an Aerospatiale-A airfoil at an angle of attack of 13.3 degrees and a Reynolds number of 2 million. The project is called DESFOIL and simulates laminar-to-turbulent transition, adverse pressure gradients, streamline curvature, and boundary layer separation of a 3-D airfoil strip. This study is in the early stages of developing a baseline for RANS and DES computations. DES has also been applied to flight mechanic and aeroelasticity problems of DoD air vehicles to demonstrate the utility of DES and also discover some of the nonlinear mechanisms causing these flight issues. The applications studied include the F/A-18E forced motion about the roll axis and one degree of freedom simulation of abrupt wing stall (AWS), the F/A-18C at conditions of tail buffet, the CV-22 Tilt Rotor aircraft in a vortex ring state (VRS), and the ARGUS missile at conditions where it experiences coning motion.
Reducing Security Overhead for Mobile Networks
Authors: Fangguo Zhang, Yi Mu, Willy Susilo
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Security of mobile communications comes with the cost of computational overhead. Reducing the overhead in security computations is critical to ensure the overall performance of a mobile network. In this paper, we present the notion of online/offline signcryption, where most of computations are carried out offline and the online part of our scheme does not require any exponent computations and therefore is very efficient. Our scheme allows any third party to verify the encryption without compromising confidentiality. We also show that our scheme is secure against existential forgery under chosen message attacks and adaptively chosen ciphertext attacks under the notion of indistinguishability of ciphertext.
Unification Grammars and Off-Line Parsability
Authors: Efrat Jaeger, Nissim Francez, Shuly Wintner
Venue: Journal of Logic, Language and Information (2005)

Unification grammars are known to be Turing-equivalent; given a grammar G and a word w, it is undecidable whether w ¿ L(G). In order to ensure decidability, several constraints on grammars, commonly known as off-line parsability (OLP), were suggested, such that the recognition problem is decidable for grammars which satisfy OLP. An open question is whether it is decidable if a given grammar satisfies OLP. In this paper we investigate various definitions of OLP and discuss their interrelations, proving that some of the OLP variants are indeed undecidable. We then present a novel, decidable OLP constraint which is more liberal than the existing decidable ones.
Incorporating physical co-presence at events into digital social networking
Authors: Scott Counts, John Geraci
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

As mobile devices become location-aware, it will become possible to know when people are physically co-located and to incorporate this information into social software. Is this valuable? A prototype social networking system based on physical co-presence was created and tested wizard-of-oz-style at four different physical social events by providing event attendees a digital link back to others at the event. Usage of the system was higher than expected, suggesting a meaningful role for incorporating shared physical events into social networking software. Usage and questionnaire analyses suggest some guidelines for design of such systems.
Deploying sensor networks with guaranteed capacity and fault tolerance
Authors: Jonathan L. Bredin, Erik D. Demaine, MohammadTaghi Hajiaghayi, Daniela Rus
Venue: Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing (2005)

We consider the problem of deploying or repairing a sensor network to guarantee a specified level of multi-path connectivity (k-connectivity) between all nodes. Such a guarantee simultaneously provides fault tolerance against node failures and high capacity through multi-path routing. We design and analyze the first algorithms that place an almost-minimum number of additional sensors to augment an existing network into a k-connected network, for any desired parameter k. Our algorithms have provable guarantees on the quality of the solution. Specifically, we prove that the number of additional sensors is within a constant factor of the absolute minimum, for any fixed k. We have implemented greedy and distributed versions of this algorithm, and demonstrate in simulation that they produce high-quality placements for the additional sensors. We are also in the process of using our algorithms to deploy nodes in a physical sensor network using a mobile robot.
A user-centric anonymous authorisation framework in e-commerce environment
Authors: Richard Au, Harikrishna Vasanta, Kim-Kwang Raymond Choo, Mark Looi
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

A novel user-centric authorisation framework suitable for e-commerce in an open environment is proposed. The credential-based approach allows a user to gain access rights anonymously from various service providers who may not have pre-existing relationships. Trust establishment is achieved by making use of referrals from external third parties in the form of Anonymous Attribute Certificates. The concepts of One-task Authorisation Key and Binding Signature are proposed to facilitate pseudonymity in authorisation service. These mechanisms enhance user privacy and tackle the problem of scalability in identity-based access control systems.
Computational Science on the Grid: From Testbeds to Production
Authors: Gabriel Mateescu, Jean-Claude Cote
Venue: Proceedings of the 19th International Symposium on High Performance Computing Systems and Applications (2005)

We survey the steps involved in performing computational science simulations on the grid and identify requirements specific to grids for computational science. Building on this, we determine features that these kinds of grids should possess in order to support secure authentication as well as effective deployment, execution and scheduling of applications. We evaluate recently proposed approaches that address these issues and suggest new solutions for user authentication and grid scheduling.
Extending knowledge management to mobile workplaces
Authors: Volker Derballa, Key Pousttchi
Venue: Proceedings of the 6th international conference on Electronic commerce (2004)

Knowledge and Knowledge Management (KM) are evolving into an increasingly eminent source of competitive advantage. However, for the time being, the potential of KM is usually limited to stationary workplaces. This excludes a multiplicity of mobile workers, many of them in charge of knowledge-intensive activities. This paper examines the capabilities and limitations of mobile technology usage in order to support KM. After a general overview of KM, the relevant mobile technology is introduced. Subsequently, the theory of mobile added values is employed to analyze the contributions of mobile technology for supporting KM in the different phases of the KM process. Especially the process of knowledge distribution is qualified to be supported through mobile technology.
Design and Implementation of a Library of Network Protocols in CD++
Authors: Mohamed Abd El-Salam Ahmed, Khalil Yonis, Abdul-Rahman Elsahfei, Gabriel Wainer
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

Simulation-based analysis can help to design, study and configure computer networks, in order to assess the best possible solution to particular problems. We propose the creation of a tool for modeling and simulation (M&S) of networks built on the DEVS formalism. DEVS allows for the formal definition of discrete event models interacting together, which can be used to analyze properties about the systems we model. These models can be executed under different simulation environments, and they can be easily integrated with models of other phenomena, described with different techniques. Here, we present the definition and implementation of a library of DEVS models constructed as the initial building block for such a network simulator based on the CD++ tool.
Multi-sequences with d-perfect property
Authors: Xiutao Feng, Quanlong Wang, Zongduo Dai
Venue: Journal of Complexity (2005)

Sequences with almost perfect linear complexity profile are defined by Niederreiter (Proceedings of the Salzburg Conference 1986, Vol. 5, Teubner, Stuttgart, 1987, pp. 221-233). Xing and Lam (IEEE Trans. Inform. Theory 45 (1999) 1267; J. Complexity 16 (2000) 661) extended this concept from the case of single sequences to the case of multi-sequences and further proposed the concept of d-perfect multi-sequences. In this paper, based on the technique of m-continued fractions due to Dai et al. we investigate the property of d-perfect multi-sequences and obtain a sufficient and necessary condition of d-perfect multi-sequences. We show that d-perfect multi-sequences are not always strongly d-perfect. In particular, we give an example to disprove the conjecture proposed by Xing (2000) on d-perfect multisequences.
Embedded System Engineering Using C/C++ Based Design Methodologies
Authors: Claudio Talarico, Aseem Gupta, Ebenezer Peter, Jerzy W. Rozenblit
Venue: Proceedings of the 12th IEEE International Conference and Workshops on Engineering of Computer-Based Systems (2005)

This paper analyzes and compares the effectiveness of various system level design methodologies in assessing performance of embedded computing systems from the earliest stages of the design flow. The different methodologies are illustrated and evaluated by applying them to the design of an aircraft pressurization system (APS). The APS is mapped on a heterogeneous hardware/software platform consisting of two ASICs and a microcontroller. The results demonstrate the high impact of computer aided design (CAD) tools on design time and quality.
Molecular structure determination on a computational and data grid
Authors: Mark L. Green, Russ Miller
Venue: Parallel Computing (2004)

The focus of this paper is on the design and implementation of a critical program in structural biology onto two computational and data grids. The first is the Buffalo-based ACDC grid, which uses facilities at several research institutions in Western New York. The second is Grid2003, the iVDGL grid established late in 2003 primarily for physics and astronomy applications. In this paper, we present an overview of the ACDC Grid and Grid2003, focusing on the implementation of several new ACDC computational and grid tools.
Web resource geographic location classification and detection
Authors: Chuang Wang, Xing Xie, Lee Wang, Yansheng Lu, Wei-Ying Ma
Venue: Special interest tracks and posters of the 14th international conference on World Wide Web (2005)

Rapid pervasion of the web into users' daily lives has put much importance on capturing location-specific information on the web, due to the fact that most human activities occur locally around where a user is located. This is especially true in the increasingly popular mobile and local search environments. Thus, how to correctly and effectively detect locations from web resources has become a key challenge to location-based web applications. In this paper, we first explicitly distinguish the locations of web resources into three types to cater to different application needs: 1) provider location; 2) content location; and 3) serving location. Then we describe a unified system that computes each of the three locations, employing a set of algorithms and different geographic sources.
Coordination without communication: the case of the flocking problem
Authors: Vincenzo Gervasi, Giuseppe Prencipe
Venue: Discrete Applied Mathematics (2004)

In this paper, we study the distributed coordination and control of a set of asynchronous, anonymous, memoryless mobile vehicles that can freely move on a two-dimensional plane but cannot communicate among themselves. In particular, we analyze the problem of forming a certain pattern and following a designated vehicle, referred to as the leader, while maintaining the pattern: the flocking problem. We provide an algorithm to solve the flocking problem, together with theoretical considerations on its correctness and applicability, and numerical simulation showing the actual behavior of the algorithm. We also propose two variants of the algorithm sporting a more stable convergence, and analyze how different conditions on the equipment available to the vehicles and on the amount of knowledge they share affect the kind of patterns that can be formed.
Key agreement from weak bit agreement
Authors: Thomas Holenstein
Venue: Proceedings of the thirty-seventh annual ACM symposium on Theory of computing (2005)

Assume that Alice and Bob, given an authentic channel, have a protocol where they end up with a bit SA and SB, respectively, such that with probability 1+ε/2 these bits are equal. Further assume that conditioned on the event SA =n SB no polynomial time bounded algorithm can predict the bit better than with probability 1-δ/2. Is it possible to obtain key agreement from such a primitive? We show that for constant δ and ε the answer is yes if and only if δ > 1-ε/1+ε, both for uniform and non-uniform adversaries.The main computational technique used in this paper is a strengthening of Impagliazzo's hard-core lemma to the uniform case and to a set size parameter which is tight (i.e., twice the original size). This may be of independent interest.
A Single-Computer Grid Gateway Using Virtual Machines
Authors: Stephen Childs, Brian Coghlan, David O'Callaghan, Geoff Quigley, John Walsh
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 1 (2005)

Grid middleware is enabling resource sharing between computing centres across the world and sites with existing clusters are eager to connect to the Grid using middleware such as that developed by the LHC Computing Grid (LCG) project. However; the hardware requirementsfor access to the Grid remain high: a standard LCG Grid gateway requiresfour separate servers. Wepropose the use of Virtual Machine (VM) technology to run multiple OS instances, allowing a full Grid gateway to be hosted on a single computer. This would significantly reduce the hardware, installation and management commitments required of a site that wants to connect to the Grid. In this paper, we outline the architecture of a single-computer Grid gateway. We evaluate implementations of this architecture using two popular open-source VMs: Xen and User-Mode Linux (UML). Our results show that Xen outperforms UML for installation tasks and standard gateway operations. Configuration is similar to that of sites running multi-computer gateways, making it easy to keep site installation profiles Synchronised. Our VM gateway architecture provides a low-cost entrypath to the Grid and will be of interest to many institutions wishing to connect their existing facilities.
Development of fluid-based heating and pressing systems for micro hot embossing
Authors: J.-H. Chang, S.-Y. Yang
Venue: Microsystem Technologies (2005)

This paper reports three innovative methods of rapid heating and uniform pressing for micro hot embossing. Fluids were used as heating and pressing media. With these three systems, the temperature of substrate rises rapidly and uniform pressure is exerted over the whole substrate. The working fluids used in this experiment included steam, gas, and oil. In addition, rapid heating through far infrared radiation (FIR) was also implemented with a gas pressurized hot embossing process. It was found that a 0.2 millimeter-thick PVC substrate can be heated from 25&#x00b0;C to 130&#x00b0;C in 30 seconds using steam heating, in only 25 seconds using FIR heating, and in 3.5 minutes using oil heating. The heating speeds of all three methods are much faster than those using conventional hot-plate heating, which takes more than 10 minutes. Successful replications of micro-features onto substrates have been achieved.
Oscillation conditions of nonlinear systems with static feedback
Authors: D. V. Efimov, A. L. Fradkov
Venue: Automation and Remote Control (2005)

Conditions are proposed of the availability of the oscillation property in the sense of Yakubovich in a system with a nonlinear nominal portion enclosed by static nonlinear output feedback.A technique is worked out to calculate analytical estimates for the amplitude of oscillations in the system.The relation between estimates for the amplitude of oscillations and the index of excitability of the system with respect to the input is established.Examples are given of the computer modeling for systems of the 2nd and the 3rd order,including Van der Pol and Lorentz systems conforming the applicability of the suggested solutions.