ppxscal/embedding_network huggingface dataset:
Concurrency control in real-time broadcast environments
Authors: Dang Depeng, Liu Yunsheng
Venue: Journal of Systems and Software (2003)

Owing to the unique characteristics of real-time broadcast environments, serializability is too strong as a correctness criterion and not suitable for mobile real-time transactions. Considering that relaxing serializability such as epsilon and similarity serializability may sacrifice database consistency to some extent, we propose using a correctness criterion called weak serializability. In this paper, we formally define weak serializability at first. After the necessary and sufficient conditions for weak serializability are shown, corresponding concurrency control protocol based on this criterion is outlined for real-time broadcast environments. Finally, in a series of simulation studies, experimental results show that the proposed protocol helps more mobile real-time transactions to meet their deadlines and improves response time while database consistency is maintained.
SMP: A Process-Driven Approach to Project Management
Authors: Marc Frappier, Mario Richard
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 8 - Volume 8 (2004)

SMP is a project management tool specifically designed for process-oriented software projects. It integrates six project management functions: process modelling, effort estimation, planning, tracking, control and measurement. Their integration is based on three basic principles : i) a project plan should follow from a process model; ii) effort estimation should be based on project historical data; iii) control should be based on units that can be tracked across several phases and activities. SMP is inspired from Watt's Humphrey Personal Software Process, which has been lifted to deal with large projects instead of personal projects.
Activity theory as a theoretical foundation for information systems research
Authors: George Ditsa
Venue: Information management: support systems & multimedia technology (2003)

Theoretical models from social psychology have been widely used by information systems (IS) researchers as theoretical foundations to explain and predict information systems use. Unfortunately, most of these models used ignore the social context in which IS is used, but rather focused mainly on the individual and the technology. History and time are as well ignored in most cases. The set of philosophical concepts presented by Activity Theory makes it possible to marry the human aspects and the technological aspects of information systems into a more holistic research approach in information systems. This chapter presents the basic concepts of Activity Theory and its potential as a theoretical foundation for information systems use research.
The impact of partnership attributes on EDI implementation success
Authors: Sangjae Lee, Gyoo Gun Lim
Venue: Information and Management (2003)

The growing interest in the use of electronic data interchange (EDI) to revolutionize the way in which business conducts trading activities leads to research questions concerning the characteristics of electronic partnerships that promote implementation success. The research model in this study shows that partnership attributes affect EDI implementation, which has three dimensions: integration, utilization and diversity, and performance. Partnership attributes encompass partner trust, interdependence, and commitment. Results show that partner trust, interdependence, and commitment affect the extent to which companies undertake EDI integration and increase the percentage of EDI exchange and performance. This suggests that companies contemplating EDI should set-up compatible business processes and a high-quality partner relationship for implementation and performance.
About one approach to the minimization of the errors of the tutoring of the neuron networks
Authors: Alexander P. Grinko, Michal M. Karpuk
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

The feasibility of function of errors with fractional exponent for solving of a problem of optimization and tutoring of neural networks was theoretically explored. The analytical expressions for estimation of parameters of the models or weight factors were obtained. The algorithms were designed and the numerical experiment on actual economic datas was held, where the efficiency of an offered procedure is shown.
Methods for Volumetric Reconstruction of Visual Scenes
Authors: Gregory G. Slabaugh, W. Bruce Culbertson, Thomas Malzbender, Mark R. Stevens, Ronald W. Schafer
Venue: International Journal of Computer Vision (2004)

In this paper, we present methods for 3D volumetric reconstruction of visual scenes photographed by multiple calibrated cameras placed at arbitrary viewpoints. Our goal is to generate a 3D model that can be rendered to synthesize new photo-realistic views of the scene. We improve upon existing voxel coloring/space carving approaches by introducing new ways to compute visibility and photo-consistency, as well as model infinitely large scenes. In particular, we describe a visibility approach that uses all possible color information from the photographs during reconstruction, photo-consistency measures that are more robust and/or require less manual intervention, and a volumetric warping method for application of these reconstruction methods to large-scale scenes.
A format for semantic equivalence comparison
Authors: Vashti Galpin
Venue: Theoretical Computer Science (2003)

This paper presents a new format for process algebras, the extended tyft/tyxt format which generalises the tyft/tyxt format of Groote and Vaandrager. The format differs from most previous formats in that the labels on transitions are treated as many-sorted terms. Bisimulation is a congruence for all operators defined by extended transition system specifications in this format.When one extended transition system specification is summed with another, the resulting bisimulation can either identify more terms (an abstracting extension up to bisimulation) or fewer terms (a refining extension up to bisimulation) than the original bisimulation on the individual system. The notions of abstracting extension and refining extension are defined, and two theorems are presented giving conditions required for achieving each type of extension. These results provide a way to compare different semantic equivalences defined for different process algebras.Finally, an application of this theory to semantic equivalence comparison is given for a new result relating Castellani's pomset equivalence and Krishan's multiprocessor equivalence.
A simple undecidable problem: the inclusion problem for finite substitutions on ab*c
Authors: J. Karhumäki, L. P. Lisovik
Venue: Information and Computation (2003)

As an evidence of the power of finite unary substitutions we show that the inclusion problem for finite substitutions on the language L = ab*c is undecidable, i.e., it is undecidable whether for two finite substitutions φ and ψ the relation φ(w) ⊆ ψ(w) holds for all w in L.
A New Self-Checking Sum-Bit Duplicated Carry-Select Adder
Authors: E. S. Sogomonyan, D. Marienfeld, V. Ocheretnij, M. Gössel
Venue: Proceedings of the conference on Design, automation and test in Europe - Volume 2 (2004)

In this paper the first code-disjoint totally self-checking carry-select adder is proposed. The adder blocks are fast ripple adders with a single NAND-gate delay for carry-propagation per cell. In every adder block both the sum-bits and the corresponding inverted sum-bits are simultaneously implemented. The parity of the input operands is checked against the XOR-sum of the propagate signals. For 64 bits area and maximal delay are determined by theSYNOPSYS CAD tool of the EUROCHIP project. Compared to a 64 bit carry-select adder without error detection the delay of the most significant sum-bit does not increase. The area is 170% of a 64 bit carry-select adder (without error detection and not code-disjoint).
Comparison of simulated annealing and mean field annealing as applied to the generation of block designs
Authors: Pau Bofill, Roger Guimerà, Carme Torras
Venue: Neural Networks (2003)

This paper describes an experimental comparison between a discrete stochastic optimization procedure (Simulated Annealing, SA) and a continuous deterministic one (Mean Field Annealing), as applied to the generation of Balanced Incomplete Block Designs (BIBDs). A neural cost function for BIBD generation is proposed with connections of arity four, and its continuous counterpart is derived as required by the mean field formulation. Both strategies are optimized with regard to the critical temperature, and the expected cost to the first solution is used as a performance measure for the comparison. The results show that SA performs slightly better, but the most important observation is that the pattern of difficulty across the 25 problem instances tried is very similar for both strategies, implying that the main factor to success is the energy landscape, rather than the exploration procedure used.
Uniform Intersecting Families with Covering Number Restrictions
Authors: P. Frankl, K. Ota, N. Tokushige
Venue: Combinatorics, Probability and Computing (1998)

It is known that any k-uniform family with covering number t has at most kt t-covers. In this paper, we deal with intersecting families and give better upper bounds for the number of t-covers. Let pt(k) be the maximum number of t-covers in any k-uniform intersecting families with covering number t. We prove that, for a fixed t,***** Insert equation here *****In the cases of t=4 and 5, we also prove that the coefficient of kt&minus;1 in pt(k) is exactly (t2).
Adaptive core multicast routing protocol
Authors: Sangho Park, Daeyeon Park
Venue: Wireless Networks (2004)

The Adaptive Core Multicast Routing Protocol (ACMRP) is proposed for multicast routing in ad hoc networks. ACMRP is on demand core-based multicast routing protocol that is based on a multicast mesh. In ACMRP, a core is not well-known and it adapts to the current network topology and group membership. The enhanced adaptivity minimizes the core dependency and, accordingly, improves performance and robustness of ACMRP. A multicast mesh is created and maintained by the periodic flooding of the adaptive core. Since the flooding traffic is evenly maintained and a mesh provides rich connectivity among group members, ACMRP can achieve efficiency, scalability, and effectiveness. We evaluate scalability and performance of ACMRP via simulation.
PRISMS: an Approach to Software Process Improvement for Small to Medium Enterprises
Authors: Pat Allen, Muthu Ramachandran, Hisham Abushama
Venue: Proceedings of the Third International Conference on Quality Software (2003)

The paper describes an ongoing project to define asuitable process model for software process improvementin small to medium organizations. This is being carriedout as a collaborative project between Leeds MetropolitanUniversity and four small to medium companies who arecurrently implementing SPI programs. Key features of thePRISMS process are: explicitly relating improvementgoals to business goals, which are used to choose andprioritize key process areas for improvement; the use of asimplified and tailorable assessment method based onCMM [1]; the definition and use of metrics from theoutset; and mechanisms to encourage maximumtransparency in the process and participation by allstakeholders.
Computing curricula 2004: the overview project
Authors: Russell Shackelford, Lillian Cassel, James Cross, John Impagliazzo, Eydie Lawson, Richard LeBlanc, Andrew McGettrick, Robert Sloan, Heikki Topi
Venue: Proceedings of the 35th SIGCSE technical symposium on Computer science education (2004)

In 2001, the ACM and the IEEE-CS published Computing Curricula 2001 which contains curriculum recommendations for undergraduate programs in computer science. That report also called for additional discipline-specific volumes for each of computer engineering, information systems, and software engineering. In addition, it called for an Overview Volume to provide a synthesis of the various volumes. The Computing Curricula 2004 Task Force has undertaken a two-pronged strategy to fulfill the latter charge. The purpose of this session is to present an overview of the Task Force's work and to generate feedback from the SIGCSE membership to the Task Force about the direction and plans we have undertaken.
A deployable framework for providing better than best-effort quality of service for traffic flows
Authors: Raheem Abdul Beyah
Venue:  (2003)

Over the past decade the Internet has evolved significantly. Additionally, the applications that rely on the Internet as a communications channel have also undertaken a significant transformation. Simple low bitrate data transfers have become the minority. Now, the Internet finds itself clogged with multimedia files, mainly from file sharing applications. Additionally, more real-time applications have also found themselves sharing this network. The problem with real-time applications is that they require bounds on specific path quality. The current infrastructure is incapable of providing these required guarantees, leaving the real-time traffic to fend for itself on this best-effort network that makes no quality of service (QoS) guarantees. QoS is not only sought after for real-time traffic, regular best-effort traffic such as mail transfers and file transfers would also benefit from a higher level of QoS. Several techniques have been proposed to provide such benefits. Though some techniques have proven successful, these solutions can not be widely deployed due to the massive overhaul of the current infrastructure that they require. Until this overhaul of the network occurs, an iterative approach can be taken to provide some level of improved QoS to best-effort traffic flows. Additionally, this can be widely deployed. Thus, we have a tradeoff in the solution's ability to be deployed and its ability to quantify and guarantee the level of QoS seen by a flow. This thesis takes an iterative approach in that we provide several deployable techniques that do not quantify the flow improvement but provide improved QoS to the flows seen in the test network for the majority of the time, thus moving us closer to the goal of end-to-end QoS. In this thesis, we study the link dynamics of the live Internet test network and note inefficiencies. We then design and deploy a generic overlay architecture (Generalized Application Layer Overlay) that keeps track of relevant path quality metrics. Finally, we present two deployable approaches (Application Layer Switching and Application Layer Striping) that extend the current overlay architecture, and show that immediately, in a deployable fashion, we can improve the QoS of Internet traffic flows.
Experiments on Processing and Linking Semantically Augmented Requirement Specifications
Authors: Daniel Conte de Leon, Jim Alves-Foss
Venue: Proceedings of the Proceedings of the 37th Annual Hawaii International Conference on System Sciences (HICSS'04) - Track 9 - Volume 9 (2004)

Today's critical systems increasingly rely on computers and software. However, market pressure, problems in the application of formal methods, and ineffective traceability techniques may all exacerbate the difficulty of applying adequate assurance techniques to the design and development of safe and trustworthy systems. Necessity dictates that engineers target criticalsections that require formal verification and high reliability. To achieve this objective, we need to implement and maintain linking relationships among system work products and be able to propagate criticality of requirements to subsequent work products. We successfully implemented traceability between an informal requirements document and its formal specification using two new XML-derived markup languages. We addressed the issues of specifying and propagating criticality of requirements and consistency of this determination within and between work products.
Elastic servers in CORDS
Authors: Germán S. Goldszmidt
Venue: Proceedings of the 1992 conference of the Centre for Advanced Studies on Collaborative research - Volume 2 (1992)

The traditional client server paradigm for distributed computing, fixes the functionality and interfaces provided by server processes at compile time. While this scheme is powerful enough for many distributed applications, it is too inflexible for many others, such as those envisioned by the CORDS research project. In many applications, there is a need to dynamically add to (and sometimes restrict) the functionality of a server while it is executing. Lacking this ability, servers are often designed with narrow interfaces. This forces applications to engage in abnormally fine grained and complex process interactions, resulting in inefficient use of both computational cycles and communication bandwidth. This paper describes a more flexible paradigm, elastic servers, whose functionality can be extended at execution time by delegating new functional procedures to them.
Design of Power Amplifiers at 2.4 GHz/900 MHz and Implementation of On-chip Linearization Technique in 0.18/0.25 µm CMOS
Authors: Padmanava Sen, Vipul Garg, Ramesh Garg, Nirmal B. Chakrabarti
Venue: Proceedings of the 17th International Conference on VLSI Design (2004)

This paper presents a step by step design of poweramplifiers at 2.4 GHz (for WLAN applications) and on-chiplinearization of these amplifiers. CMOS poweramplifiers are designed at 2.4 GHz with output powerranging from 30 mW to 100 mW with efficiency varyingfrom 20%-40%. Two or three stages are cascadedaccording to the gain and efficiency requirements. Thetopology used for 2.4 GHz amplifier is also verified as apart of an FM transmitter at 900 MHz. All theseintegrated power amplifiers are not intended to have avery good linearity. At the later part of this work, feed-forwardtechnique is used for linearization of a 2.4 GHztwo-stage power amplifier in 0.25 µm CMOS8 process.The power output of the linear amplifier (in push-pullconfiguration) is 17 dBm with 20% efficiency. The in-bandnon-linearity (from two-tone simulations) is given by 3rdorder inter-modulation product and is about 40 dBc. Foron-chip combining, transformers and baluns are used. Allthe circuits are simulated using CADENCE tools (ICFB).Inductors, transformers and baluns are designed andsimulated using ASITIC tools [1]. The power amplifiersare currently under fabrication in CMOS8 (0.25 µm) andCMOS9 (0.18 µm) processes.
Least Squares Methods for the Coupling of FEM and BEM
Authors: Gabriel N. Gatica, Helmut Harbrecht, Reinhold Schneider
Venue: SIAM Journal on Numerical Analysis (2003)

In the present paper we propose least squares formulations for the numerical solution of exterior boundary value problems. The partial differential equation is a first order system in a bounded subdomain, and the unbounded subdomain is treated by means of boundary integral equations. The first order system is derived from a strongly elliptic second order system. The analysis of the present least squares formulations is reduced to the analysis of the Galerkin method for the coupling of finite element and boundary element methods (FEM and BEM) of the second order problem. The least squares approach requires no stability condition. However, it requires the computation of negative as well as of half integer Sobolev norms. The arising linear systems can be preconditioned to have condition numbers $\sim 1$. The present methods benefit strongly from the use of biorthogonal wavelets on the coupling boundary and the computation of corresponding equivalent norms in Sobolev spaces. In particular, the application of Green's formula leads to an efficient discretization of least squares formulations.
Acyclic Homomorphisms and Circular Colorings of Digraphs
Authors: Tomás Feder
Venue: SIAM Journal on Discrete Mathematics (2004)

An acyclic homomorphism of a digraph $D$ into a digraph $F$ is a mapping $\phi\colon V(D) \to V(F)$ such that for every arc $uv\in E(D)$, either $\phi(u)=\phi(v)$ or $\phi(u)\phi(v)$ is an arc of $F$, and for every vertex $v\in V(F)$, the subgraph of $D$ induced on $\phi^{-1}(v)$ is acyclic. For each fixed digraph $F$ we consider the following decision problem: Does a given input digraph $D$ admit an acyclic homomorphism to $F$? We prove that this problem is NP-complete unless $F$ is acyclic, in which case it is polynomial time solvable. From this we conclude that it is NP-complete to decide if the circular chromatic number of a given digraph is at most $q$, for any rational number $q > 1$. We discuss the complexity of the problems restricted to planar graphs. We also refine the proof to deduce that certain $F$-coloring problems are NP-complete.
Using refactoring and unification rules to assist framework evolution
Authors: Mariela Cortes, Marcus Fontoura, Carlos Lucena
Venue: ACM SIGSOFT Software Engineering Notes (2003)

Although object-oriented software development has experienced the benefits of using frameworks, a thorough understanding of how to change them to meet evolving requirement needs is still object of research. Therefore framework development is very expensive, not only because of the intrinsic difficulty related to capturing the domain theory, but also because of the lack of appropriate methods and techniques to support the evolution and redesign of the framework architecture. This paper proposes the use of refactoring and unification rules to assist framework evolution. The approach is illustrated through the JUnit testing framework.
Symmetric multistep methods with minimal phase-lag for the approximate solution of orbital problems
Authors: D. Sakas, T. E. Simos
Venue: Proceedings of the international conference on Computational methods in sciences and engineering (2003)

An explicit hybrid symmetric six-step method of algebraic order six is presented in this paper. The method has phase-lag of order ten. Numerical comparative results from the application of the new method to well known periodic orbital problems, clearly demonstrate the superior efficiency of the method presented in this paper compared with methods of the same characteristics.
ADVcharts: a graphical specification for abstract data views
Authors: L. M. F. Carneiro, D. D. Cowan, C. J. P. Lucena
Venue: Proceedings of the 1993 conference of the Centre for Advanced Studies on Collaborative research: software engineering - Volume 1 (1993)

This paper introduces ADVcharts, a new visual formalism for specifying the behavior of interactive systems in terms of state machines. ADV charts combine the concepts and notations of Abstract Data Views, Objectcharts, Statecharts, Petri-nets, and Calculus of Concurrent Systems. ADVcharts were created to provide a formal semantics for Abstract Data Views---a new design concept for user interfaces---, while also serving as a foundation for a future design methodology for interactive systems. The semantics of ADVcharts are presented through an example.The paper concludes by demonstrating that VDM-like specifications can be derived directly from ADVcharts, thus providing the Abstract Data Views concept with both visual and textual modes of formal description.
Standards insecurity
Authors: Rebecca T. Mercuri
Venue: Communications of the ACM (2003)

Standards can provide an important component in the computer security environment but they should not be relied on blindly.