ppxscal/embedding_network huggingface dataset:
Applying and Evaluating Active Technologies in Distributed Management
Authors: Jürgen Quittek, Marcus Brunner
Venue: Journal of Network and Systems Management (2003)

The idea of Distributed Management has been around for quite some time. In recent years, several different technologies have been developed to implement this paradigm. However, until today a practical comparison of these technologies with the implementation of various management applications has&mdash;to the authors knowledge&mdash;not been made. Therefore, this paper discusses and compares the application of different active technologies to distributed Internet management. Three management application areas that profit from the Distributed Management paradigm are investigated: scalable monitoring, explicit placement of management tasks, and remote systems management of network nodes. The specific requirements of these application areas are analyzed and compared to the capabilities of three different active Distributed Management technologies: the Internet Engineering Task Force (IETF) Script MIB, the active network backbone (ABone), and the mobile agent platform Voyager. For all combinations of technologies and application areas, prototype implementations have been made, that demonstrate strengths and weaknesses of current Distributed Management technologies. The paper evaluates the tested technologies and concludes with suggestions for improvements.
Cross-talk and intermediate frequency deviation effects on phase-shift range finder
Authors: S. Mohammad Nejad, S. Baghal Oliaee
Venue: Iranian Journal of Science and Technology (2002)

In this paper, design and assembly of a new phase-shift range finder and also the cross-talk effect and the effect of intermediate frequency (IF) deviation on the range finder, is presented. Using the heterodyne technique, the system was able to measure very small phase-shifts, hence, considerably increasing the accuracy of the distance measurements. Since the major error in such systems is due to the phase measurement (counter-clock pulse), related to the cross-talk and the frequency shift, it was necessary to take especial steps to decrease these errors. Therefore, after testing the system, practically a simulation of the system was also carried out. Using the simulation results, the error due to the cross-talk was about 2% in the worst condition. The error related to the frequency changes was about zero, and the resolution due to the counter-clock pulse became 21 mm. Considering the signal to noise ratio of 20dB and the noise current of 42.8pA at the input current to voltage inverter, the lowest detectable optical power at the APD input, which the noise could be ignored, was 23 pW.
Extended quasi-static scheduling for formal synthesis and code generation of embedded software
Authors: Feng-Shi Su, Pao-Ann Hsiung
Venue: Proceedings of the tenth international symposium on Hardware/software codesign (2002)

With the computerization of most daily-life amenities such as home appliances, the software in a real-time embedded system now accounts for as much as 70% of a system design. On one hand, this increase in software has made embedded systems more accessible and easy to use, while on the other hand, it has also necessitated further research on how complex embedded software can be designed automatically and correctly. Enhancing recent advances in this research, we propose an Extended Quasi-Static Scheduling (EQSS) method for formally synthesizing and automatically generating code for embedded software, using the Complex-Choice Petri Nets (CCPN) model. Our method improves on previous work in three ways: (1) by removing model restrictions to cover a much wider range of applications, (2) by proposing an extended algorithm to schedule the more unrestricted model, and (3) by implementing a code generator that can produce multi-threaded embedded software programs. The requirements of an embedded software are specified by a set of CCPN, which is scheduled using EQSS such that the schedules satisfy limited embedded memory requirements and task precedence constraints. Finally, a POSIX-based multi-threaded embedded software program is generated in the C programming language. Through an example, we illustrate the feasibility and advantages of the proposed EQSS method.
AI and agents: state of the art
Authors: Eduardo Alonso
Venue: AI Magazine (2002)

This article is a reflection on agent-based AI. My contention is that AI research should focus on interactive, autonomous systems, that is, agents. Emergent technologies demand so. We see how recent developments in (multi-) agent-oriented research have taken us closer to the original AI goal, namely, to build intelligent systems of general competence. Agents are not the panacea though. I point out several areas such as design description, implementation, reusability, and security that must be developed before agents are universally accepted as the AI of the future.
Tools for Inventing Organizations: Toward a Handbook of Organizational Processes
Authors: Thomas W. Malone, Kevin Crowston, Jintae Lee, Brian Pentland, Chrysanthos Dellarocas, George Wyner, John Quimby, Charles S. Osborn, Abraham Bernstein, George Herman, Mark Klein, Elissa O'Donnell
Venue: Management Science (1999)

This paper describes a novel theoretic al and empirical approach to tasks such as business process redesign and knowledge management. The project involves collecting examples of how different organizations perform similar processes, and organizing these examples in an on-line "process handbook." The handbook is intended to help people: (1) redesign existing organizational processes, (2) invent new organizational processes (especially ones that take advantage of information technology), and (3) share ideas about organizational practices. A key element of the work is an approach to analyzing processes at various levels of abstraction, thus capturing both the details of specific processes as well as the "deep structure" of their similarities. This approach uses ideas from computer science about inheritance and from coordination theory about managing dependencies. A primary advantage of the approach is that it allows people to explicitly represent the similarities (and differences) among related processes and to easily find or generate sensible alternatives for how a given process could be performed. In addition to describing this new approach, the work reported here demonstrates the basic technical feasibility of these ideas and gives one example of their use in a field study.
Partitioning the Attribute Set for a Probabilistic Reasoning System
Authors: Sumit Sarkar, Deb Ghosh
Venue: INFORMS Journal on Computing (1998)

The ability of a computerized system to model the reasoning process of humans has become an important area of research. This research considers a probabilistic reasoning system for applications that require decision making under uncertain conditions. The reasoning system captures the uncertainty associated with different feasible outcomes, and based on historical data, provides users with a measure of this uncertainty. To make accurate predictions, the scheme requires that predictive variables that are not conditionally independent of each other given the outcome be grouped into compound attributes for the purpose of estimating probabilities. These compound attributes partition the entire set of predictive attributes into disjoint sets. An important design issue, then, is that the appropriate partitioning scheme be obtained before the reasoning scheme is used in practice. We formulate the problem of finding the optimal partitioning scheme, and present five different (although related) heuristic techniques to induce partitions from historical cases. Using simulated data, all five techniques are shown to capture accurately underlying dependencies across attributes when a reasonable amount of historical data is available for analysis. In situations where few historical cases are available, the induced structures are less accurate. In such situations, the performance of induced structures for making probability predictions is nevertheless found to be as good as that when using the true structure. Finally, we test for external validity by applying the techniques on a real-world dataset on credit applications for a bank. We show, using this dataset, that (i) the classificatory performance of the reasoning system using structures generated by the heuristic techniques is as good as the performance of the widely used decision tree induction algorithm C4.5, and (ii) the induced structures are able to provide reliable probability estimates for making decisions in environments with asymmetric misclassification costs.
Language adaptation helps language acquisition
Authors: Willem Zuidema
Venue: Proceedings of the seventh international conference on simulation of adaptive behavior on From animals to animats (2002)

Language acquisition is a very particular type of learning problem: it is a problem where the target of the learning process is itself the outcome of a learning process. Language can therefore adapt to the learning algorithm. I present a model that shows that due to this effect - and contrary to some claims from the Universal Grammar tradition - "unlearnable" grammars can be successfully acquired, and grammatical coherence in a population can be maintained.
Interactive visual debugging with UML
Authors: Timothy Jacobs, Benjamin Musial
Venue: Proceedings of the 2003 ACM symposium on Software visualization (2003)

Software debugging is an extremely difficult cognitive process requiring comprehension of overall application behavior along with detailed understanding of specific application components. Typical debuggers provide inadequate support for this process, focusing primarily on the details accessible through source code. To overcome this deficiency, we link dynamic program execution state to a Unified Modeling Language (UML) object diagram. We enhance the standard UML diagram with focus + context, graph layout, and color encoding techniques that organize and present objects and events in a manner that facilitates analysis of system behavior. We support debugging using high level abstractions commonly used in system design, while maintaining access to low level details with an interactive display.
Sub-90nm technologies: challenges and opportunities for CAD
Authors: Tanay Karnik, Shekhar Borkar, Vivek De
Venue: Proceedings of the 2002 IEEE/ACM international conference on Computer-aided design (2002)

Future high performance microprocessor design with technology scaling beyond 90nm will pose two major challenges: (1) energy and power, and (2) parameter variations. Design practice will have to change from deterministic design to probabilistic and statistical design. This paper discusses circuit techniques and design automation opportunities to overcome the challenges.
Distributed algorithms with dynamical random transitions
Authors: Nadine Guillotin-Plantard, René Schott
Venue: Random Structures Algorithms (2002)

We analyze a model of exhaustion of shared resources where allocation and deal-location requests are modeled by dynamical random variables as follows: Let (E, A, µ, T) be a dynamical system where (E, A, µ) is a probability space and T is a transformation defined on E. Let d ≥ 1 and f1,.....,fd be functions defined on E with values in [0, 1/d]. Let (Xi)i ≥ 1 be a sequence of independent random vectors with values in Zd. Let x ∈ E and (ej)1 ≤ j ≤ d be the unit coordinate vectors of Zd. For every i ≥ 1, the law of the random vector Xi is given by P(Xi = z) = {fj(Tix) if z = ej, 1/d - fj(Tix) if z = -ej, 0 otherwise. We write S0 = 0, Sn = ∑ sum n i=1 Xi for n ≥ 1 for the Zd-random walk generated by the family (Xi)i ≥ 1. When T is a rotation on the torus then explicit calculations are possible. This stochastic model is a (small) step towards the analysis of distributed algorithms when allocation and deallocation requests are time dependent. It subsumes the models of colliding stacks and of exhaustion of shared memory considered in the literature [14, 15, 11, 16, 17, 20]. The technique is applicable to other stochastically modeled resource allocation protocols such as option pricing in financial markets and dam management problems.
Numerical calculation of the density of prime numbers with a given least primitive root
Authors: A. Paszkiewicz, A. Schinzel
Venue: Mathematics of Computation (2002)

In this paper the densities D(i) of prime numbers p having the least primitive root g(p) = i, where i is equal to one of the initial positive integers less than 32, have been numerically calculated. The computations were carried out under the assumption of the Generalised Riemann Hypothesis. The results of these computations were compared with the results of numerical frequency estimations.
Non-euclidean genetic FCM clustering algorithm
Authors: Sergio López García, Luis Magdalena, Juan R. Velasco
Venue: Technologies for constructing intelligent systems: Tasks (2002)

The standard FCM clustering algorithm is a powerful mathematical tool widely used in many practical problems. Nevertheless, it is dependent on initial conditions and either the number of clusters and the distance definition must be predefined. In [15,11] the authors presented the Genetic FCM clustering, that improves the first and second drawbacks, but not the third one. This article shows how the definition of the distance can be included in the genetic structure. Several results applied to the Iris data set are also shown.
3D shape recovery of complex objects from multiple silhouette images
Authors: Yen-Hsiang Fang, Hong-Long Chou, Zen Chen
Venue: Pattern Recognition Letters (2003)

A reconstruction method is proposed which represents the object with a line-based geometric model. The method does not need the point correspondence information in recovering the 3D object geometry. It is based on the concept of volume intersection, but it is substantially different from the existing octree-based reconstruction methods in the aspects of data structure, reconstruction process and representation uniqueness under a 2D rigid motion. For visualizing the 3D reconstructed object geometry a conversion from the line-based geometric model to a bounded triangular mesh model is developed. The experimental results show that the method is capable of capturing the different details of the object. And it works fast and requires a relatively low memory space.
Efficient Algorithms for Prefix and General Prefix Computations on Distributed Shared Memory Systems with Applications
Authors: V. Kamakoti, N. Balakrishnan
Venue: Proceedings of the 1997 International Conference on Parallel and Distributed Systems (1997)

The paper presents efficient scalable algorithms for Prefix (PC) and General Prefix (GPC) Computations on a Distributed Shared Memory (DSM) system with applications.
A rational quartic Bézier representation for conics
Authors: Lian Fang
Venue: Computer Aided Geometric Design (2002)

This paper presents a special representation for conic sections in the form of a rational quartic Bézier curve which has the same weight for all control points but the middle one. This representation allows a conic section to be joined with other conics in the same form or other integral B-spline curves in a way that the joined curve still possesses C1 continuity in the homogeneous space, which is not possible if rational quadratic representation is adopted. This also allows the creation of skinned surfaces from section curves containing conic sections to possess better parametrization and curvature property.
A new algorithm for the maximum-weight clique problem
Authors: Patric R. J. Östergård
Venue: Nordic Journal of Computing (2001)

Given a graph, in the maximum clique problem one wants to find the largest number of vertices, any two of which are adjacent. In the maximum-weight clique problem, the vertices have positive, integer weights, and one wants to find a clique with maximum weight. A recent algorithm for the maximum clique problem is here used as a basis for developing an algorithm for the weighted case. Computational experiments with random graphs show that this new algorithm is faster than earlier algorithms in many cases. A set of weighted graphs obtained from the problem of constructing good constant weight error-correcting codes are proposed as test cases for maximum-weight clique algorithms; in fact, one of these leads to a new record-breaking code.
What Drives Employment Relationships in Taxicab Organizations? Linking Agency to Firm Capabilities and Strategic Opportunities
Authors: Peter D. Sherer, Nikolai Rogovsky, Norman Wright
Venue: Organization Science (1998)

Agency theorists argue that organizations typically get little value from using employees and that they should instead use nonemployees operating fully as residual claimants. Yet, even in a context where those theorists would predict virtually no employees-taxicab organizations-they are common. What drives the use of employment relationships in these organizations? The authors show how employment relationships are linked to firm capabilities and strategic opportunities in a sample of taxicab organizations, relying on arguments about the linkage of employment to the internal liquidity of labor, organizational routines, and internal cooperation. The theoretical arguments and findings suggest what organizations gain by having employment relationships and show that integrating the agency theoretic argument with the other theoretical arguments leads toward a resource-based view of strategy and human resources. The authors highlight the importance of embedding arguments on the internal management of human resources in the strategic and competitive context in which organizations operate. Their arguments also have implications for the resource-based approach to strategy in mapping the resource space of human assets in organiz ations and, within that space, directing attention to how organizations gain sustainable competitive advantage through managing human resources.
A combinatorial study of partial order polytopes
Authors: Samuel Fiorini
Venue: European Journal of Combinatorics (2003)

To each finite set with at least two elements, there corresponds a partial order polytope. It is defined as the convex hull of the characteristic vectors of all partial orders which have that set as ground set. This 0/1-polytope contains the linear ordering polytope as a proper face. The present article deals with the facial structure of partial order polytopes. Our main results are: (i) a proof that the nonadjacency problem on partial order polytopes is NP-complete; (ii) a characterization of the polytopes that are affinely equivalent to a face of some partial order polytope.
Visual homing is possible without landmarks: a path integration study in virtual reality
Authors: Bernhard E. Riecke, Henricus A. H. C. van Veen, Heinrich H. Bülthoff
Venue: Presence: Teleoperators and Virtual Environments (2002)

The literature often suggests that proprioceptive and especially vestibular cues are required for navigation and spatial orientation tasks involving rotations of the observer. To test this notion, we conducted a set of experiments in virtual environments in which only visual cues were provided. Participants had to execute turns, reproduce distances, or perform triangle completion tasks. Most experiments were performed in a simulated 3D field of blobs, thus restricting navigation strategies to path integration based on optic flow. For our experimental set-up (half-cylindrical 180 deg. projection screen), optic flow information alone proved to be sufficient for untrained participants to perform turns and reproduce distances with negligible systematic errors, irrespective of movement velocity. Path integration by optic flow was sufficient for homing by triangle completion, but homing distances were biased towards the mean response. Additional landmarks that were only temporarily available did not improve homing performance. However, navigation by stable, reliable landmarks led to almost perfect homing performance. Mental spatial ability test scores correlated positively with homing performance, especially for the more complex triangle completion tasks-suggesting that mental spatial abilities might be a determining factor for navigation performance. In summary, visual path integration without any vestibular or kinesthetic cues can be sufficient for elementary navigation tasks like rotations, translations, and triangle completion.
16.4-Tflops direct numerical simulation of turbulence by a Fourier spectral method on the Earth Simulator
Authors: Mitsuo Yokokawa, Ken'ichi Itakura, Atsuya Uno, Takashi Ishihara, Yukio Kaneda
Venue: Proceedings of the 2002 ACM/IEEE conference on Supercomputing (2002)

The high-resolution direct numerical simulations (DNSs) of incompressible turbulence with numbers of grid points up to 40963 have been executed on the Earth Simulator (ES). The DNSs are based on the Fourier spectral method, so that the equation for mass conservation is accurately solved. In DNS based on the spectral method, most of the computation time is consumed in calculating the three-dimensional (3D) Fast Fourier Transform (FFT), which requires huge-scale global data transfer and has been the major stumbling block that has prevented truly high-performance computing. By implementing new methods to efficiently perform the 3D-FFT on the ES, we have achieved DNS at 16.4 Tflops on 20483 grid points. The DNS yields an energy spectrum exhibiting a wide inertial subrange, in contrast to previous DNSs with lower resolutions, and therefore provides valuable data for the study of the universal features of turbulence at large Reynolds number.
Customer Service Competition in Capacitated Systems
Authors: Joseph Hall, Evan Porteus
Venue: Manufacturing Service Operations Management (2000)

We investigate a simple dynamic model of firm behavior in which firms compete by investing in capacity that is used to provide a good or service to their customers. There is a fixed total market of customers whose demands for the good or service are random and who divide their patronage between the firms in each period. Periodically, the market shares of the two firms can change based on the realized level of customer service provided in the prior period. We assume that the expected level of customer service can be expressed as a function of the (per customer) capacity of the firms' service delivery systems, and that service declines as the capacity decreases. The firms differ in their customers' willingness to defect when confronted by service failure. The primary issue we address is the firms' capacity decisions in response to customer service concerns and competitive pressure. We provide conditions under which the firms' optimal (i.e., equilibrium) capacity levels in a period are proportional to the size of their respective customer bases in that period. Further, we develop expressions for the value of a firm's customers and the implicit cost of service failure. Results for both single-period and finite-horizon problems are investigated and applied to two examples: (1) competition between Internet service providers who operate systems that we approximate by simple loss-type queueing models, and (2) competition between make-to-stock producers who operate systems that we approximate by newsvendor inventory models. For both examples, solutions are derived and interpreted.