ppxscal/embedding_network huggingface dataset:
A MAP Algorithm to Super-Resolution Image Reconstruction
Authors: Huanfeng Shen, Pingxiang Li, Liangpei Zhang, Yindi Zhao
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Super-resolution image reconstruction has been one of the most active research areas in recent years. In this paper, a new super-resolution algorithm is proposed to the problem of obtaining a high-resolution image from several low-resolution images that have been sub-sampled and displaced by different amounts of sub-pixel shifts. The algorithm is based on the MAP framework, solving the optimization by proposed iteration steps. At each iteration step, the regularization parameter is updated using the partially reconstructed image solved at the last step. The proposed algorithm is tested on synthetic images, and the reconstructed images are evaluated by the PSNR method. The results indicate that the proposed algorithm has considerable effectiveness in terms of both objective measurements and visual evaluation.
An empirical study of system design instability metric and design evolution in an agile software process
Authors: Mohammad Alshayeb, Wei Li
Venue: Journal of Systems and Software (2005)

Software project tracking and project plan adjustment are two important software engineering activities. The class growth shows the design evolution of the software. The System Design Instability (SDI) metric indicates the progress of an object-oriented (OO) project once the project is set in motion. The SDI metric provides information on project evolution to project managers for possible adjustment to the project plan. The objectives of this paper are to test if the System Design Instability metric can be used to estimate and re-plan software projects in an XP-like agile process and study system design evolution in the Agile software process. We present an empirical study of the class growth and the SDI metric in two OO systems, developed using an agile process similar to Extreme Programming (XP). We analyzed the system evolutionary data collected on a daily basis from the two systems. We concluded that: the systems' class growth follows observable trends, the SDI metric can indicate project progress with certain trends, and the SDI metric is correlated with XP activities. In both of the analyzed systems, we observed two consistent jumps in the SDI metric values in early and late development phases. Part of the results agrees with a previous empirical study in another environment.
Role-based refactoring of crosscutting concerns
Authors: Jan Hannemann, Gail C. Murphy, Gregor Kiczales
Venue: Proceedings of the 4th international conference on Aspect-oriented software development (2005)

Improving the structure of code can help developers work with a software system more efficiently and more consistently. To aid developers in re-structuring the implementation of crosscutting concerns using aspect-oriented programming, we introduce a role-based refactoring approach and tool. Crosscutting concerns (CCCs) are described in terms of abstract roles, and instructions for refactoring crosscutting concerns are written in terms of those roles. To apply a refactoring, a developer maps a subset of the roles to concrete program elements; a tool can then help complete the mapping of roles to the existing program. Refactoring instructors are then applied to manipulate and modularize the concrete elements corresponding to the crosscutting concern. Evaluation of the prototype tool on a graphical editing framework suggests that the approach helps planning and executing complex CCC refactorings.
On capacity sharing in network congestion epochs
Authors: Diego Lanzi
Venue: Netnomics (2004)

Seeing network resources as a public good involves to mantain open and shared access to them for any user. Nevertheless, these conditions may be really difficult to achieve in presence of well-endowed users with heavy data flows. Our purpose here is to provide a two stage game form for managing heavy data flows which may cause network congestion or monopolization. Using an axiomatic approach, we show that the mechanism proposed attains economic efficiency and it implements capacity sharing.
VisDP: A Web Service for Visualizing Design Patterns on Demand
Authors: Jing Dong, Sheng Yang, Kang Zhang
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Design patterns document good design solutions to a recurring problem in a particular context. They are typically modeled using UML. In practice, however, pattern-related information is lost when a design pattern is applied or composed because UML does not keep track of this information. Consequently, the designer cannot identify design patterns used in software system design diagrams. The benefits of design patterns are compromised because the designers cannot communicate with each other in terms of the design patterns they use and their design decisions and tradeoffs. In this paper, we present a web service (VisDP) for explicitly visualizing design patterns in UML diagrams. This web service is developed based on a UML profile containing new stereotypes, tagged values and constraints for visualizing design patterns in UML diagrams. With this service, the user is able to identify design patterns by moving the mouse and viewing color changes in UML diagrams. Additional pattern-related information can be dynamically displayed based on the mouse location.
An approach for quality of service adaptation in service-oriented Grids: Research Articles
Authors: Rashid Al-Ali, Abdelhakim Hafid, Omer Rana, David Walker
Venue: Concurrency and Computation: Practice Experience (2004)

Some applications utilizing Grid computing infrastructure require the simultaneous allocation of resources, such as compute servers, networks, memory, disk storage and other specialized resources. Collaborative working and visualization is one example of such applications. In this context, quality of service (QoS) is related to Grid services, and not just to the network connecting these services. With the emerging interest in service-oriented Grids, resources may be advertised and traded as services based on a service level agreement (SLA). Such a SLA must include both general and technical specifications, including pricing policy and properties of the resources required to execute the service, to ensure QoS requirements are satisfied. An approach for QoS adaptation is presented to enable the dynamic adjustment of behavior of an application based on changes in the pre-defined SLA. The approach is particularly useful if workload or network traffic changes in unpredictable ways during an active session. Copyright &copy; 2004 John Wiley & Sons, Ltd.
A pumping lemma and decidability problems for recognizable tree series
Authors: Björn Borchardt
Venue: Acta Cybernetica (2004)

In the present paper we show that given a tree series S, which is accepted by (a) a deterministic bottom-up finite state weighted tree automaton (for short: bu-w-fta) or (b) a non-deterministic bu-w-fta over a locally finite semiring, there exists for every input tree t ∈ supp(S) a decomposition t = C'[C[s]] into contexts C, C' and an input tree s as well as there exist semiring elements a, a', b, b', c such that the equation (S, C'[Cn[s]]) = a' ⊙ an ⊙ c ⊙ bn ⊙ b' holds for every non-negative integer n. In order to prove this pumping lemma we extend the power-set construction of classical theories and show that for every non-deterministic bu-w-fta over a locally finite semiring there exists an equivalent deterministic one. By applying the pumping lemma we prove the decidability of a tree series S being constant on its support, S being constant, S being boolean, the support of S being the empty set, and the support of S being a finite set provided that S is accepted by (a) a deterministic bu-w-fta over a commutative semiring or (b) a non-deterministic bu-w-fta over a locally finite commutative semiring.
An Analysis of Notification Related Specifications for Web/Grid Applications
Authors: Shrideep Pallickara, Geoffrey Fox
Venue: Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'05) - Volume II - Volume 02 (2005)

Notification is especially important in the Service Oriented Architecture (SOA) model engendered by Web Services. where Web Services interact with each other through the exchange of messages. In this paper we compare and contrast two competing specifications in the area of notifications. The first one, WS-Notification, is part of the Web Service Resource Framework (WSRF). The second one is the WS-Eventing specification. These specifications are expected to have far reaching implications on the development of asynchronous, complex, dynamic systems.
Counting networks with arbitrary fan-out
Authors: Eran Aharonson, Hagit Attiya
Venue: Distributed Computing (1995)

It is shown that an acyclic smoothing network (and hence counting network) with fan-out n cannot be constructed from balancers of fan-out b1,..., bk, if there exists a prime factor p of n, such that p does not divide bi, for all i, 1 ≤ i ≤ k. This holds regardless of the depth, fan-in or size of the network, as long as they are finite. On the positive side, a simple construction of cyclic counting networks with fan-out n, for arbitrary n, is presented. An acyclic counting network with fan-in and fan-out p2k, for any integer k ≥ 0, is constructed out of 2-balancers and p-balancers.
Construction of the tests of combinational circuit failures by analyzing the orthogonal disjunctive normal forms represented by the alternative graphs
Authors: A. Yu. Matrosova, A. G. Pleshkov, R. R. Ubar
Venue: Automation and Remote Control (2005)

A method to design tests for the bit-stuck and arbitrary failures of the elements of combinational circuits was proposed. It is based on a graphical description of the orthogonal disjunctive normal forms of the functions realized by the circuit. The graphical description of the circuit by an alternative graph, which was later named the structurally synthesized binary decision diagram graph, carries, along with information about the circuit structure, the orthogonal disjunctive normal forms of the functions of this circuit. The properties of the structurally synthesized binary decision diagram graph allow one, on the one hand, to use it for construction of tests of various circuit failures and, on the other hand, to reduce enumeration at determination of the tests flowing to the use of the orthogonal disjunctive normal forms realized by the circuit and its subcircuits. A full structurally synthesized binary decision diagram graph that features the potential of the structurally synthesized binary decision diagram graph and does not differ so much from the traditional binary decision diagram graphs was introduced to facilitate explanation of the method. The proposed method of test design enables one to determine the entire set of test patterns by determining successively the conjunctions representing these test.
A partitioning technique for LSI chips
Authors: Pao-Tsin Wang
Venue: ACM SIGDA Newsletter (1974)

A technique for partitioning LSI chips is presented in this paper. This technique is a refinement of the author's previous work [1].
Implementing a NTP-based time service within a distributed middleware system
Authors: Hasan Bulut, Shrideep Pallickara, Geoffrey Fox
Venue: Proceedings of the 3rd international symposium on Principles and practice of programming in Java (2004)

Time ordering of events generated by entities existing within a distributed infrastructure is far more difficult than time ordering of events generated by a group of entities having access to the same underlying clock. Network Time Protocol (NTP) has been developed and provided to the public to let them adjust their local computer time from single (multiple) time source(s), which are usually atomic time servers provided by various organizations, like NIST and USNO. In this paper, we describe the implementation of a NTP based time service used within NaradaBrokering, which is an open source distributed middleware system. We will also provide test results obtained using this time service.
Intelligent control of a stepping motor drive using an adaptive neuro-fuzzy inference system
Authors: Patricia Melin, Oscar Castillo
Venue: Information Sciences&mdash;Informatics and Computer Science: An International Journal (2005)

Stepping motors are widely used in robotics and in the numerical control of machine tools where they have to perform high-precision positioning operations. However, the variations of the mechanical configuration of the drive, which are common to these two applications, can lead to a loss of synchronism for high stepping rates. Moreover, the classical open-loop speed control is weak and a closed-loop control becomes necessary. In this paper, fuzzy logic is applied to control the speed of a stepping motor drive with feedback. A neuro-fuzzy hybrid approach is used to design the fuzzy rule base of the intelligent system for control. In particular, we used the ANFIS methodology to build a Sugeno fuzzy model for controlling the stepping motor drive. An advanced test bed is used in order to evaluate the tracking properties and the robustness capacities of the fuzzy logic controller.
Impartial evaluation in software reliability practice
Authors: Wen-Kui Chang, Shuen-Lin Jeng
Venue: Journal of Systems and Software (2005)

In the past decade, the size scale of software systems and their technical complexity has become much more complicated. Accordingly, quality assessment of software applications has been intensively investigated lately. Among popular software quality metrics, software reliability has been proven to be one of the most useful indices in evaluating software applications. In the literature, statistical usage testing has been widely shown to be effective in estimating software reliability. Essentially, it first transfers the practical operations of a software system into a usage model, which then forms a basis for performing statistical testing and analyzing software reliability. This research investigates the extension of statistical usage testing by considering any prior information or prejudgment on software quality before performing a validation test, and propose the derivation of impartial reliability evaluation that is fair for both the software producer and consumer (end user). A numerical demonstration of validating the correctness of hyper links on a web site via the proposed computation is illustrated and discussed. The suggested mechanism with some prior information will converge much more quickly than other similar reliability models. In addition, the proposed framework also provides the flexibility of taking the practical prejudgment into account.
RNAi for plant functional genomics: Conference Reviews
Authors: Louisa Matthew
Venue: Comparative and Functional Genomics (2004)

A major challenge in the post-genome era of plant biology is to determine the functions of all the genes in the plant genome. A straightforward approach to this problem is to reduce or knock out expression of a gene with the hope of seeing a phenotype that is suggestive of its function. Insertional mutagenesis is a useful tool for this type of study, but it is limited by gene redundancy, lethal knock-outs, non-tagged mutants and the inability to target the inserted element to a specific gene. RNA interference (RNAi) of plant genes, using constructs encoding self-complementary &lsquo;hairpin&rsquo; RNA, largely overcomes these problems. RNAi has been used very effectively in Caenorhabditis elegans functional genomics, and resources are currently being developed for the application of RNAi to high-throughput plant functional genomics. Copyright &copy; 2004 John Wiley & Sons, Ltd.
Comparison of methods for estimating the parameters of linear dynamic systems by measurements of short sections of transient processes
Authors: A. A. Lomov
Venue: Automation and Remote Control (2005)

Various versions are compared of the multidimensional method of orthogonal regression in the problem of estimating the parameters of linear systems by short sections of transient processes with additive measuring perturbations. The methods are classified by the degree of the use of information on linear links between counts of trajectories of a dynamic object.
A Robust Hand Tracking and Gesture Recognition Method for Wearable Visual Interfaces and Its Applications
Authors: Yang Liu, Yunde Jia
Venue: Proceedings of the Third International Conference on Image and Graphics (2004)

Gesture-based interface is one of the most promising modes of human-computer interaction for wearable computers. This paper proposes a robust hand tracking and gesture recognition method for wearable visual interfaces, which is an extension of ICONDENSATION algorithm. The method integrates shape and depth information for robust hand tracking. Gesture recognition is realized through the maximum posterior estimation of several pre-defined gestures. The experimental results show that the proposed method works well in dynamic and complex background. Several promising applications in wearable computers are also discussed.
A preference aggregation method through the estimation of utility intervals
Authors: Ying-Ming Wang, Jian-Bo Yang, Dong-Ling Xu
Venue: Computers and Operations Research (2005)

In this paper, a preference aggregation method is developed for ranking alternative courses of actions by combining preference rankings of alternatives given on individual criteria or by individual decision makers. In the method, preference rankings are viewed as constraints on alternative utilities, which are normalized, and linear programming models are constructed to estimate utility intervals, which are weighted and averaged to generate an aggregated utility interval. A simple yet pragmatic interval ranking method is used to compare and/or rank alternatives. The final ranking is generated as the most likely ranking with certain degrees of belief. Three numerical examples are examined to illustrate the potential applications of the proposed method.
Domain decomposition method for dynamic faulting under slip-dependent friction
Authors: Lori Badea, Ioan R. Ionescu, Sylvie Wolf
Venue: Journal of Computational Physics (2004)

The anti-plane shearing problem on a system of finite faults under a slip-dependent friction in a linear elastic domain is considered. Using a Newmark method for the time discretization of the problem, we have obtained an elliptic variational inequality at each time step. An upper bound for the time step size, which is not a CFL condition, is deduced from the solution uniqueness criterion using the first eigenvalue of the tangent problem. Finite element form of the variational inequality is solved by a Schwarz method assuming that the inner nodes of the domain lie in one subdomain and the nodes on the fault lie in other subdomains. Two decompositions of the domain are analyzed, one made up of two subdomains and another one with three subdomains. Numerical experiments are performed to illustrate convergence for a single time step (convergence of the Schwarz algorithm, influence of the mesh size, influence of the time step), convergence in time (instability capturing, energy dissipation, optimal time step) and an application to a relevant physical problem (interacting parallel fault segments).
Method of spherical harmonic series in the problem of minimization of atmosphere pollution by fractions of harmful admixtures
Authors: Ramiz Rafatov
Venue: Mathematics and Computers in Simulation (2004)

The problem of minimization of atmosphere pollution by fractions of harmful admixtures is studied. It is supposed that a controlled object is described by non-stationary integral-differential transfer equation with special boundary conditions and control parameters, which are included in the right part of equation as delta-functions. Minimized integral quadratic functional characterizes energy expenditure for control and depends on the average squared deflection of fraction concentration from the desired final state. Optimal conditions are obtained with the help of Pontryagin's maximum principle. The method of spherical harmonic series is applied.
Multiple virtual rafts: a multi-user paradigm for interacting with communities of autonomous characters
Authors: Bill Tomlinson, Jesse Gray, Man Lok Yau
Venue: CHI '05 extended abstracts on Human factors in computing systems (2005)

This paper describes a multi-user version of the "Virtual Raft Project" being exhibited in the Interactivity Program at CHI 2005. The Virtual Raft Project is an interactive installation in which communities of autonomous animated characters inhabit desktop "virtual islands." A human participant may transport the characters between the islands via a mobile device-based "virtual raft." This paper describes an implementation of a multi-user version of this project, in which several virtual rafts may be used simultaneously to carry characters among the islands. The multi-user experience improves on the single-user original in four ways: increased throughput, increased collaboration among the participants, increased enjoyment for the participants, and the introduction of a new mode of interaction (characters jumping directly from one raft to another). This paper also provides a preliminary evaluation of the entire system through observations from a deployment of the Virtual Raft Project to approximately two hundred people.
Periodic Contention-Free Multiple Access for Power Line Communication Networks
Authors: Yu-Ju Lin, Haniph A. Latchman, Jonathan C. L. Liu, Richard Newman
Venue: Proceedings of the 19th International Conference on Advanced Information Networking and Applications - Volume 2 (2005)

There is industrial intent to use Powerline Communication (PLC) PLC networks in the home for delivery of multimedia data, with associated challenging quality of service (QoS) requirements. Existing protocols for PLC, for wireless networks, or even for wired networks cannot meet these challenges efficiently. This paper proposes and analyzes a new protocol designed to provide the high QoS needed for delivery of multiple multimedia streams in a PLC environment. The proposed protocol, Periodic Contention-Free Multiple Access (PCF/MA), directly addresses the issues of channel noise, hidden nodes and near-far effects. The proposed PCF/MA performance is analyzed theoretically and its performance is simulated. The results show that 85Mbps MAC throughput is possible with 100Mbps channel data rate, even when there are hidden nodes in the network.
Network+ Exam Cram 2, Second Edition
Authors: Mike Harwood
Venue:  (2005)

Attention Network + Candidates: Stop spending valuable study time sorting through confusing study aids. Network + Exam Cram 2 is the second edition of a best-selling Network + study guide that gives you unique insight into exam concepts. Packed with test-taking strategies, time-saving tips and Exam Notes, only the information that you need to know for the test is included in a logical, easy-to-follow format. You will also receive a CD that includes over 100 practice test questions and the Cram Sheet tear card for last-minute test review. Network + Exam Cram 2 is the smarter, more efficient way to get certified.