ppxscal/embedding_network huggingface dataset:
Looking at you: computer generated graphical - human interaction
Authors: Giselle Isner
Venue: Journal of Computing Sciences in Colleges (2004)

Currently computers do not interact with their users in the same manner people interact with each other, but it has been argued that this would facilitate better human-computer interaction [3]. We have heard of robots which behave like living dogs (Sony's AIBO), or who can aid in cleaning up a home (iRobot's iRoomba). We already interact with our computers by clicking on a mouse, or entering commands from the keyboard, but how much easier it would be if we could simply dictate things to our computer, or even point to the screen, and get a response as quickly as if we were speaking to a human. There is already a limited technological basis for this kind of interface: Vivid's Mandala system, which can be found at museums and amusement parks, allows users and computer generated graphics to interact with one another using a video camera for input and green-screen technology.
Strategic aspirations for net-enabled business
Authors: Gary Hackbarth, William J. Kettinger
Venue: European Journal of Information Systems (2004)

The net-enabled business innovation cycle (NEBIC) model describes a path by which firms employ dynamic capabilities to leverage net-enablement. Some firms strategically aspire to follow this path in a more gradual fashion striving for business process improvements (incremental strategy) while others aspire to exploit rapidly net-enablement to achieve business innovation (leapfrogging strategy) that offers completely new market opportunities. Study results suggest that firms adopt accelerated leapfrogging strategies when faced with more severe external competitive pressures. This combined with strong leadership, a propensity to embrace internal user involvement, IT maturity, and an accommodating firm structure, as indicated by path accelerators, result in higher aspirations for business innovation. Firms shying away from leapfrogging strategies tend to protect existing customers and employees from more radical changes. These firms sometimes lacked the internal capability to enact more aggressive strategies and thus had to acquire the necessary capabilities before aspiring for business innovation.
Load Balancing in Arbitrary Network Topologies with Stochastic Adversarial Input
Authors: Aris Anagnostopoulos, Adam Kirsch, Eli Upfal
Venue: SIAM Journal on Computing (2005)

We study the long-term (steady state) performance of a simple, randomized, local load balancing technique under a broad range of input conditions. We assume a system of n processors connected by an arbitrary network topology. Jobs are placed in the processors by a deterministic or randomized adversary. The adversary knows the current and past load distribution in the network and can use this information to place the new tasks in the processors. A node can execute one job per step, and can also participate in one load balancing operation in which it can move tasks to a direct neighbor in the network. In the protocol we analyze here, a node equalizes its load with a random neighbor in the graph.Our analysis of the protocol does not assume any particular input distribution. The input is generated by an arbitrary deterministic or probabilistic adversary subject only to some weak statistical properties. For stability and expected performance of the system we adopt the stochastic adversary model of [Borodin et al., J. ACM, 48 (2001), pp. 13--38]. For high-probability bounds we introduce a more restricted input model, the strongly bounded adversary.Assuming the stochastic adversarial input model, we show that if the adversary does not trivially overload the network (i.e., there is an integer $w\geq 1$ such that the expected number of new jobs in any interval of length $w$ is bounded by $\lambda nw$ for some $\lambdaWhen the system is stable, the next performance parameter of interest is the waiting time of jobs. We develop expected and high probability bounds on the total load in the system and the waiting time of jobs in terms of the network topology. In particular, in the above stochastic adversary model, if the network is an expander graph, the expected wait of a task is O(w + log n), and in the strongly bounded adversary model the waiting time of a task is O(w + log n) with high probability.We contrast these results with the work stealing load balancing protocol, where we show that in sparse networks, the load in the system and the waiting time can be exponential in the network size.
Recent progress in medical imaging technology
Authors: Masahiro Endo
Venue: Systems and Computers in Japan (2005)

Medical imaging is the general name given to the methodology in which a biological object's structure or function, which is usually invisible, is visualized by using physical media such as X-rays for the diagnosis and treatment of diseases. The method is divided into ultrasonic imaging, magnetic resonance imaging, nuclear medical imaging, X-ray imaging, and the like, according to the physical media employed. These modalities have their own features and have been used to compete with and complement each other, offering indispensable techniques for medical care. Medical imaging is supported by highly developed engineering technologies, and the medical and engineering technologies in combination are referred to as medical imaging technology. This paper presents a survey of recent developments in medical imaging technology, focusing on magnetic resonance imaging, nuclear medical imaging, and X-ray imaging. &copy; 2005 Wiley Periodicals, Inc. Syst Comp Jpn, 36(3): 1&ndash;17, 2005; Published online in Wiley InterScience (). DOI 10.1002&sol;scj.20154
Performers go web
Authors: Patricia Jung
Venue: Linux Journal (2005)

That on-line animation was pretty funny, but how about performing a show live? Here's new software that makes it possible.
GE adjunct test report: object-oriented design and scoring for MUC-4
Authors: George Krupka, Lisa Rau
Venue: Proceedings of the 4th conference on Message understanding (1992)

This paper reports on the results of the adjunct test performed by GE for the MUC-4 evaluation of text processing systems. In this test, we evaluated the effect of an object-oriented template design and associated matching conditions on the scores. The results indicate that the current MUC-4 "flat" templade design with cross-references closely approximates a true object-oriented design. However the object-oriented design allows for additional performance data to be calculated, facilitating diagnosis.
Agents in object-oriented software engineering
Authors: Alessandro F. Garcia, Carlos J. P. de Lucena, Donald D. Cowan
Venue: Software&mdash;Practice Experience (2004)

Software engineers of multi-agent systems &lpar;MASs&rpar; are faced with different concerns such as autonomy, adaptation, interaction, collaboration, learning, and mobility, which are essentially different from classical concerns addressed in object-oriented software engineering. MAS developers, however, have relied mostly on object-oriented design techniques and programming languages, such as Java. This often leads to a poor separation of MAS concerns and in turn to the production of MASs that are difficult to maintain and reuse. This paper discusses software engineering approaches for MASs, and presents a new method for integrating agents into object-oriented software engineering from an early stage of design. The proposed approach encourages the separate handling of MAS concerns, and provides a disciplined scheme for their composition. Our proposal explores the benefits of aspect-oriented software development for the incorporation of agents into object-oriented systems. We also illustrate our aspect-oriented approach through the Portalware multi-agent system, a Web-based environment for the development of e-commerce portals. Copyright &copy; 2004 John Wiley & Sons, Ltd.
An architecture for elliptic curve cryptograph computation
Authors: Masaaki Shirase, Yasushi Hibino
Venue: ACM SIGARCH Computer Architecture News (2005)

It is known that several public key cryptosystems such as RSAs, ElGamals and elliptic curve cryptosystems [1], and also elliptic curve cryptosystems require smaller keys and more efficient operation than RSAs and ElGamals for same security. For example, elliptic curve cryptosystems with 160 bits key have same security as RSAs and ElGamals with 1024 bits key have. We focus elliptic curve cryptosystems and propose an architecture of computation unit for an elliptic curve cryptosystem with small hardware.
Multi-representation interaction for physically based modeling
Authors: Zeki Melek, John Keyser
Venue: Proceedings of the 2005 ACM symposium on Solid and physical modeling (2005)

For simulations involving complex objects, a number of different properties must be represented. An example of this is in modeling an object undergoing combustion---heat amounts, fuel consumption, and even object shape must be modeled and changed over time. Ideally we would put everything into a unified representation, but this is sometimes not possible/feasible due to measurement limitations or the suitability of a specific representation. In this paper we define a multi-representation framework for dealing with multiple properties and their interactions within an object. This model is especially useful in physically based modeling, where the time variation of some properties affect other properties including geometry or topology. As a motivating example case, we present a method for modeling decomposition of a burning object.
Extraction of Film Takes for Cinematic Analysis
Authors: Ba Tu Truong, Svetha Venkatesh, Chitra Dorai
Venue: Multimedia Tools and Applications (2005)

In this paper, we focus on the `reverse editing' problem in movie analysis, i.e., the extraction of film takes, original camera shots that a film editor extracts and arranges to produce a finished scene. The ability to disassemble final scenes and shots into takes is essential for nonlinear browsing, content annotation and the extraction of higher order cinematic constructs from film. A two-part framework for take extraction is proposed. The first part focuses on the filtering out action-driven scenes for which take extraction is not useful. The second part focuses on extracting film takes using agglomerative hierarchical clustering methods along with different similarity metrics and group distances and demonstrates our findings with 10 movies.
Active Polyhedron: Surface Evolution Theory Applied to Deformable Meshes
Authors: Greg Slabaugh, Gozde Unal
Venue: Proceedings of the 2005 IEEE Computer Society Conference on Computer Vision and Pattern Recognition (CVPR'05) - Volume 2 - Volume 02 (2005)

This paper presents a novel 3D deformable surface that we call an active polyhedron. Rooted in surface evolution theory, an active polyhedron is a polyhedral surface whose vertices deform to minimize a regional and/or boundary-based energy functional. Unlike continuous active surface models, the vertex motion of an active polyhedron is computed by integrating speed terms over polygonal faces of the surface. The resulting ordinary differential equations (ODEs) provide improved robustness to noise and allow for larger time steps compared to continuous active surfaces implemented with level set methods. We describe an electrostatic regularization technique that achieves global regularization while better preserving sharper local features. Experimental results demonstrate the effectiveness of an active polyhedron in solving segmentation problems as well as surface reconstruction from unorganized points.
Vectorizing and Querying Large XML Repositories
Authors: Peter Buneman, Byron Choi, Wenfei Fan, Robert Hutchison, Robert Mann, Stratis D. Viglas
Venue: Proceedings of the 21st International Conference on Data Engineering (2005)

Vertical partitioning is a well-known technique for optimizing query performance in relational databases. An extreme form of this technique, which we call vectorization, is to store each column separately. We use a generalization of vectorization as the basis for a native XML store. The idea is to decompose an XML document into a set of vectors that contain the data values and a compressed skeleton that describes the structure. In order to query this representation and produce results in the same vectorized format, we consider a practical fragment of XQuery and introduce the notion of query graphs and a novel graph reduction algorithm that allows us to leverage relational optimization techniques as well as to reduce the unnecessary loading of data vectors and decompression of skeletons. A preliminary experimental study based on some scientific and synthetic XML data repositories in the order of gigabytes supports the claim that these techniques are scalable and have the potential to provide performance comparable with established relational database technology.
An expert system for mix design of high performance concrete
Authors: Muhammad Fauzi Mohd. Zain, Md. Nazrul Islam, Ir. Hassan Basri
Venue: Advances in Engineering Software (2005)

This paper describes a prototype expert system called HPCMIX that provides proportion of trial mix of High Performance Concrete (HPC) and recommendations on mix adjustment. The knowledge was acquired from various textual sources and human experts. The system was developed using hybrid knowledge representation technique. It is capable of selecting proportions of mixing water, cement, supplementary cementitious materials, aggregates and superplasticizer, considering the effects of air content as well as water contributed by superplasticizer and moisture conditions of aggregates. Similar to most expert systems, this system has explanation facilities, can be incrementally expanded, and has an easy to understand knowledge base. The system was tested using a sample project. The system's selection of mix proportions and recommendations regarding mix adjustment were compared favourably with those of experts. The system is user-friendly and can be used as an educational tool.
Integrated differentiated survivability in IP over WDM networks
Authors: Wei Wei, Qing-Ji Zeng
Venue: Journal of Computer Science and Technology (2004)

The problem of differentiated Multi-Layer Integrated Survivability (MLIS) in IP over WDM networks is studied, which is decomposed into three sub-problems: survivable strategies design (SSD), spare capacity dimensioning (SCD), and dynamic survivable routing (DSR). A related work of network survivability in IP over WDM networks is firstly provided, and adaptive survivable strategies are also designed. A new Integrated Shared Pool (ISP) approach for SCD is then proposed, which is formulated by using integer-programming theory. Moreover, a novel survivable routing scheme called Differentiated Integrated Survivability Algorithm (DISA) for DSR is developed. Simulation results show that the proposed integrated survivability scheme performs much better than other solutions (e.g., "highest layer recovery" and "lowest layer recovery" schemes) in terms of traffic blocking ratio, spare resource requirement, and average traffic recovery ratio in IP over WDM networks.
Early research experience with OpenAccess gear: an open source development environment for physical design
Authors: Zhong Xiu, David A. Papa, Philip Chong, Christoph Albrecht, Andreas Kuehlmann, Rob A. Rutenbar, Igor L. Markov
Venue: Proceedings of the 2005 international symposium on Physical design (2005)

Physical design EDA research in academia has historically been based on infrastructure developed independently by individual contributors. This has led to fragmentation in the community, where interaction, data interchange and comparison of results between tools are difficult. We discuss our early experience with the OpenAccess Gear system, an open source software initiative intended to provide pieces of the critical integration and analysis infrastructure that are taken for granted in proprietary tools, but often wholly absent in research tools. Built on top of the widely available OpenAccess database, OA Gear provides components such as industrial-strength static timing analysis and extensible layout and netlist visualization. We discuss preliminary results from two on-going research efforts that have adopted OA Gear as their infrastructure: retrofitting the University of Michigan Capo placer into this environment, and the addition of a timing-driven capability to the Carnegie Mellon Warp placer.
Using Formal Concept Analysis to Establish Model Dependencies
Authors: Igor Ivkovic, Kostas Kontogiannis
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Software models evolve at different levels of abstraction, from the requirements specification to development of the source code. The models underlying this process are related and their elements are usually mutually dependent. To preserve consistency and enable synchronization when models are altered due to evolution, the underlying model dependencies need to be established and maintained. As there is a potentially large number of such relations, this process should be automated for suitable scenarios. This paper introduces a tractable approach to automating identification and encoding of model dependencies that can be used for model synchronization. The approach first uses association rules to map types between models and different levels of abstraction. It then makes use of formal concept analysis (FCA) on attributes of extracted models to identify clusters of model elements.
Merging Requirements Views with Incompleteness and Inconsistency
Authors: Ana Belen Barragans Martinez, Jose J. Pazos Arias, Ana Fernandez Vilas
Venue: Proceedings of the 2005 Australian conference on Software Engineering (2005)

The purpose of X-SCTL/MUS methodology is to support the collaborative development of software requirements specifications. It is a viewpoint-based approach which separates the descriptions provided by different stakeholders, and concentrates on identifying and resolving conflicts between them. X-SCTL/MUS allows the incremental development of each partial model, facilitating the task division and decreasing the development complexity. In order to fulfill all these exigencies, one of its functionalities consists in providing a way to compose requirements from different agents in a merged specification which represents explicitly overspecification and underspecification phenomena and over which, for instance, it is possible to formally verify properties. The main issue in this paper is precisely the description of the composition operator used to obtain the merged model representing the stakeholdersý requirements. We will show the criteria employed to select the composition operator that fits the desired characteristics best. Finally, the contribution will be illustrated with a little but explanatory example.
Uniform Remeshing with an Adaptive Domain: A New Scheme for View-Dependent Level-of-Detail Rendering of Meshes
Authors: Yuanchen Zhu
Venue: IEEE Transactions on Visualization and Computer Graphics (2005)

We present a new algorithm for view-dependent level-of-detail rendering of meshes. Not only can it effectively resolve complex geometry features similar to edge collapse-based schemes, but it also produces meshes that modern graphics hardware can render efficiently. This is accomplished through a novel hybrid approach: For each frame, we view-dependently refine the progressive mesh (PM) representation of the original mesh and use the output as the base domain of uniform regular refinements. The algorithm exploits frame-to-frame coherence and only updates portions of the output mesh corresponding to modified domain triangles. The PM representation is built using a custom volume preservation-based error function. A simple k-d tree enhanced jump-and-walk scheme is used to quickly map from the dynamic base domain to the original mesh during regular refinements. In practice, the PM refinement provides a view-optimized base domain for later regular refinements. The regular refinements ensure almost-everywhere regularity of output meshes, allowing optimization for vertex cache coherence and caching of geometry data in high-performance graphics memory. Combined, they also have the effect of allowing our algorithm to operate on uniform clusters of triangles instead of individual ones, reducing CPU workload.
An Extensible Platform for Evaluating Security Protocols
Authors: Seny Kamara, Darren Davis, Lucas Ballard, Ryan Caudy, Fabian Monrose
Venue: Proceedings of the 38th annual Symposium on Simulation (2005)

We present a discrete-event network simulator, called Simnet, designed specifically for analyzing network-security protocols. The design and implementation is focused on simplicity of abstraction and extensibility. Moreover, its modular architecture allows operators to dynamically customize running simulations. To demonstrate its strengths we present cases studies that focus on examining security-centric problem domains. In particular, we present an analysis of worm propagation modeling for worms with varying target selection algorithms on topologies representing a few million hosts. Additionally, we examine the use of countermeasures such as aggregate congestion control as a defense against DDoS attacks, and present analysis for a variant called direct-Pushback. Lastly, we provide an empirical analysis of the computational and bandwidth overhead induced by proposed security extensions to DNS. These experiments hopefully illustrate that Simnet is not only scalable and efficient, but provides a viable platform for prototyping and analyzing non-trivial security protocols ¿ a task which we argue cannot be easily accomplished elsewhere.
ISconf: Theory, Practice, and Beyond
Authors: Luke Kanies
Venue: Proceedings of the 17th USENIX conference on System administration (2003)

ISconf is a configuration management system (CMS) developed through years of experience automating configuration management. As the number of CMS's available for use increases, attempts have been made to explain why one should use ISconf instead of those other tools; specifically, a stark contrast has been made between tools which depend on convergence, like <tt>cfengine</tt>, and ISconf, which strives for congruence. This paper discusses production experience with ISconf, what was good and what was bad, and also analyses recently developed theories used to explain why ISconf might be superior to other tools. It further discusses experience integrating ISconf with <tt>cfengine</tt>, a process in direct conflict with the accepted ground rules for using ISconf. Based upon this experience, there are serious limitations in practical usage of ISconf, and proposed theories that support its use are insufficient and unconvincing. Although ISconf has been found to be a useful tool, it cannot be considered a sufficiently useful or powerful answer to arbitrary configuration management needs on its own.