Filters








295,118 Hits in 2.1 sec

Capsule Reviews

2004 Computer journal  
The techniques used by intruders, as well as some of the proposed architectures for protecting servers, are reviewed.  ... 
doi:10.1093/comjnl/47.5.509 fatcat:2fudjk5j2nh65dnkg2sgvua2la

Capsule Reviews

Fairouz Kamareddine
2007 Computer journal  
CAPSULE REVIEWS REFERENCE [ 1 ] 1 Bein, D., Datta, A.K. and Karaata, M.H. (200?) An Optimal Snap-Stabilizing Multi-Wave Algorithm. The Computer Journal, doi:10.1093/comjnl/bxl081.  ...  In particular: † notions such as the pseudocode for quantum computing, the QRAM (quantum random access machine) model, etc. are reviewed. † The first real quantum programming language QCL is reviewed.  ...  To do so, the paper reviews the notion of computability especially as it was viewed by Turing, Church and Kleene.  ... 
doi:10.1093/comjnl/bxm010 fatcat:aj5zoxoz3bg7vigyokcbounxxu

Capsule Reviews

F. Kamareddine
2005 Computer journal  
Different warm-up strategies have been used in the literature and are reviewed in the paper.  ...  The paper achieves this using a novel image analysis technique based on the pyramidic layering concept, the so-called Copasetic clustering, which enables the review of historical information and helps  ...  Capsule Reviews to encrypt/decrypt transmitted messages amongst the participants over an open channel. Multiparty key agreement protocols can be either authenticated or non-authenticated.  ... 
doi:10.1093/comjnl/bxh123 fatcat:nr7nzneqabcxxohtb2ip4jk2gq

Capsule Reviews

2005 Computer journal  
Hashing of databases with the use of metric properties of the hamming space. V. Balakirsky Hashing of databases is a particular approach to the storage of a collection of items and the retrieval of those items of the collection whose key values match given key values. The key value of an item determines the address for the storage of that item. Collisions occur when different keys have the same addresses. Since there is a trade-off between cost of storage and fast access time and since main
more » ... ries usually have fast access time and a size limited by increasing cost, databases are stored in a secondary memory with slow access. The number of required access can be reduced if the values of a hash function are stored in the main memory, the records of a database are stored in an external memory and a working memory is used for storing pre-computed values of the hash function. This paper aims at solving the following task: 'given a pattern and a fixed size of working memory, form the set of addresses of records that can disagree with the pattern in the number of positions smaller than the given threshold value'. The paper uses the metric properties of the Hamming space for searching procedures. The author shows that the triangle inequality for Hamming distances generates a rejection rule for the records to be included in the subject of records that can be close to the given pattern. This rejection rule is exploited in the given hashing algorithm. An estimation of the performance of the hashing algorithm is given.
doi:10.1093/comjnl/bxh069 fatcat:7mgwvsfdbnc3tjhkyvjhr3w7by

Capsule Reviews

F. Kamareddine
2005 Computer journal  
The best currently known general parsing algorithms are order n 3 . The standard LR parsing algorithm allows linear parsing of LR(1) grammars but programming languages are not LR(1) and moreover, an LR(1) grammer can become non-LR(1) when some extra actions are added to the grammar. Natural languages use grammars that are not LR(1), and in natural language parsing, general parsing algorithms have been developed that can deal better with the ambiguities of natural language. The GLR algorithm
more » ... osed by Tomita is a generalization of the standard LR algorithm based on the observation of a particular parsing algorithm from the field of natural language parsing. GLR is attractive for programming language design and allows addressing the problems of non-LR(1) grammars without losing the ability to treat LR(1) grammars. However, the GLR algorithm is worst case unbounded polynomial. Aycock and Horspool described an approach where larger regular sublanguages are located reducing stack calls in the Tomita style parsing. However, both Tomita's algorithm and Aycock and Horspool's algorithm fail to terminate if the grammar contains hidden left recursion. OpenMP is a parallel programming model which facilitates parallelization of applications in a portable manner. This paper surveys practical compiler optimization techniques, and the implications of their use with programs developed using the OpenMP model. Issues relating to optimization of C++ and Fortran codes are discussed, as are benchmark software standards based on Pentium and Itanium processor systems. Taxonomy of Distributed Event-Based Programming Systems. Meier and Cahill Event-based communication is an important paradigm for asynchronously interconnecting the components in a distributed and heterogeneous environment, and allows components to interact anonymously. Event-based middleware and models are currently being applied to a wide range of application domains. This paper presents a survey of existing event systems structured as a taxonomy of distributed eventbased programming systems. A taxonomy presents a set of generic event system properties and can be used to classify any distributed event-based programming system. The root of the taxonomy defines the relationship between an event system, an event service and an event model. Furthermore, the event service is classified according to its organization and interaction model and the taxonomy considers functional and non-functional properties including security, mobility and quality of service. The hierarchical structure on which the taxonomy is based may easily cope with the advances of event systems and their extensions with additional novel properties.
doi:10.1093/comjnl/bxh137 fatcat:iby5tpg4q5eezmzczhzpx7kcs4

Capsule Reviews

F. Kamareddine
2011 Computer journal  
This proposed method has been applied 1006 Capsule Reviews to five commonly used sorting algorithms and a prototype analyser is developed to automatically compute and convert algorithms into characteristic  ...  The author reviews work on computing bending and discrete bending energy and states that in a polygonal region with holes but that does not edge-cross itself, it is hard to find the shortest path between  ... 
doi:10.1093/comjnl/bxr058 fatcat:5c54tofft5drbnkvm7zu7vkhqe

Capsule Reviews

2004 Computer journal  
Different approaches that transmit multimedia information via the internet have already been proposed in the literature. In multimedia Systems, however, it is vital to integrate several media streams (e.g. video, audio, text and image). Moreover, in Multimedia-on-Demand (MOD) systems, it is necessary to have VCR-like user interactions (e.g. reversing the presentation sequence, skipping forward or backwards several media units, freezing the presentation for a while and then restarting it, and
more » ... ling down or up the presentation speed). Such requirements when transmitting multimedia information and allowing users' interactions cause MOD systems to face major problems. For example, how to synchronize multimedia information so that associated information units, which are sent simulateneously, do indeed arrive simultaneously at the client site. Since transmission delays remain largely unpredictable and uncontrollable, synchronization control of an interactive MOD system is complicated and difficult. This paper proposes several control schemes to handle transmission and user interactions in an MOD system. This is done by using several buffers to control the information (especially the feedback information provided by the clients to the peered server according to its buffered status; the server then uses such information to control the transmission). These buffers are managed by control schemes so that they don't overflow or underflow. The authors demonstrate the feasibility of their control schemes by providing some performance measurements.
doi:10.1093/comjnl/47.2.137 fatcat:vbufakrx5badzb7rx6vsfaquim

Capsule Reviews

2002 Computer journal  
In this issue we introduce a new section of the Journal called Capsule Reviews.  ...  It is intended to provide a short succinct review of each paper in the issue, in order to bring the content to a wider readership. All reviews here are by Associate Editor, Fairouz Kamareddine.  ...  It provides a strongly partitioned real-time system (SPIRIT) with a two-level hierarchical scheduling 380 CAPSULE REVIEWS mechanism used to schedule processors.  ... 
doi:10.1093/comjnl/45.4.379 fatcat:zixoj3jpxrb2vhfrkfnqvnmyq4

Capsule Reviews

2004 Computer journal  
doi:10.1093/comjnl/47.6.625 fatcat:3nnbivjjsjerhaotoyfl3h4xma

Capsule Reviews

Fairouz Kamareddine
2006 Computer journal  
This nontraditional "casebook" presents a balanced and nonpartisan survey of the situations and law encountered in labor arbitration. The book offers eighteen separate hypothetical case files, each based upon actual arbitration cases, which include witness examination transcripts and exhibits. The authors, who come from academia, union, and management labor law practice, have kept the needs of practitioners, students, and sophisticated nonlawyers in mind. The hypothetical cases cover such
more » ... as absenteeism, drugs, sexual harassment, unsatisfactory performance, seniority, leaves of absence and holidays, strikes and lockouts, and management rights. Several appendices are also included, which contain sample forms, briefs, and statements, as well as examples of typical arbitration awards in selected areas of labor and employment law. Readers are to examine the case files from the standpoint of an advocate from both the management and union/employee side, as well as from the impartial standpoint of the arbitrator, and are to work through the case from pre-hearing activities to closing statements and the award.
doi:10.1093/comjnl/bxl005 fatcat:f222j7pfefd6vh6ffplmbqzihe

Capsule Reviews

F. Kamareddine
2012 Computer journal  
Leung The Computer Journal, Vol. 55 No. 2, 2012 134 Capsule Reviews Performance Analysis and Optimization of the OP2 Framework on Many-Core Architectures. M.B. Giles, G.R. Mudalige, Z. Sharif, G.  ...  After a review of related work, the authors introduce their molecular docking engine BUDE (which has been under development since 2001) and a many-core parallelization of BUDE using the emerging industry  ... 
doi:10.1093/comjnl/bxs007 fatcat:z6ls7irgiratxjsde5jtwqtysu

Capsule Reviews

2004 Computer journal  
The paper reviews three alternative models of computation: Milner's π -calculus of mobile processes, the interaction machines of the first author (which describes interactions in object-oriented and distributed  ... 
doi:10.1093/comjnl/47.1.1 fatcat:hm62ki3tarhprbbkleomuvbbue

Capsule Reviews

F. Kamareddine
2012 Computer journal  
This nontraditional "casebook" presents a balanced and nonpartisan survey of the situations and law encountered in labor arbitration. The book offers eighteen separate hypothetical case files, each based upon actual arbitration cases, which include witness examination transcripts and exhibits. The authors, who come from academia, union, and management labor law practice, have kept the needs of practitioners, students, and sophisticated nonlawyers in mind. The hypothetical cases cover such
more » ... as absenteeism, drugs, sexual harassment, unsatisfactory performance, seniority, leaves of absence and holidays, strikes and lockouts, and management rights. Several appendices are also included, which contain sample forms, briefs, and statements, as well as examples of typical arbitration awards in selected areas of labor and employment law. Readers are to examine the case files from the standpoint of an advocate from both the management and union/employee side, as well as from the impartial standpoint of the arbitrator, and are to work through the case from pre-hearing activities to closing statements and the award.
doi:10.1093/comjnl/bxs145 fatcat:cc5x6vrtvng45ojoh43wpc4ugq

Capsule Reviews

F. Kamareddine
2005 Computer journal  
Scheduling. K. Subramani Usually, traditional scheduling models assume that the execution time of a job is constant in every instance of its invocation. In real-time scheduling models, this assumption is both inaccurate and dangerous. Moreover, unlike traditional scheduling models, real-time scheduling models are often constrained by complex time relationships between jobs. Under these requirements of a real-time scheduling system, a number of competing definitions exist for schedulability and
more » ... t becomes difficult to choose the best one. This paper addresses the issue of schedulability through the degree of clairvoyance afforded to the dispatcher by the realtime application under consideration. In real-time systems, the dispatcher is concerned with strategies to assign jobs (from a job-set that he assesses to be feasible) on the time line. Depending on the application, there are three schedulability specifications: zero clairvoyance, partial clairvoyance and total clairvoyance, which cover cases where the dispatcher is unaware of the execution time of a job and where he knows the execution time of a job even before it commences. The scheduling framework proposed in this paper, the socalled execution time constraints (E-T-C) model, is shown to deal well with specifying intra-period constraints and is motivated through examples from real-time design. The E-T-C model is further extended into the E-T-C-P model that explicitly accommodates inter-period constraints needed in applications where the positioning of jobs within a scheduling window is affected by the positioning of jobs in the previous window and further affects the positioning of jobs in the next window. DCOBE: Distributed Composite Object Based Environment. G. Yilmaz and N. Erdogan Distributed systems allow collaboration and co-operation between a number of interconnected computers and networks and enable the sharing of goals and data. In the recent design and implementation of computer systems, one sees a clear emphasis on collaborative information management and distribution. The main purpose of this paper is to introduce a new programming model for distributed systems. The proposed model, the so-called distributed composite objects (DCO) model, is based on 'composition' and 'replication'. Composition (or aggregation) allows aggregating multiple sub-objects into a single composite object and by doing so reduces the complexity. Replication allows for various copies of an object extending the object concept to the distributed environment. In DCO, sub-objects of a composite object are replicated on different address spaces to ensure availability and quick local access. No additional tasks are imposed on the application developer since the programing steps to create a DCO are similar to those required for a regular object. In order to conceal the implementation details of the DCO model behind the interface, the authors provide a transparent middleware software layer built on the Java Virtual Machine and known as the distributed composite object based environment (DCOBE). The DCOBE environment works on heterogeneous platforms. The creation and access of a DCO is illustrated by an example. Furthermore, in order to show the benefits of the DCO model, the paper uses a realtime collaborative writing system that allows two or more physically dispersed people work together on producing a book. Performance results which evaluate the DCOBE are also given. Affinity-Based Routing in Zoned Mirrored Disks. A. Thomasian and C. Han Mirrored disks store the same data at the two disks so that read requests can be processed by either disk, while write requests update both disks. In this way, mirrored disks are fault-tolerant, increase access bandwidth and decrease access time. Performance can be further improved by other means, in particular, by manipulating the routing of requests. This paper investigates a static affinity-based routing method which sends read requests destined to outer cylinders to the so-called outer disk, and those destined to inner cylinders to the so-called inner disk. Write requests are ignored in this paper since they enjoy no performance advantages in mirrored disks. Furthermore, the inner and outer disk cylinders are delineated by the so-called pivot point which helps in maintaining the balance between the loads of the outer and inner disks and in reducing the seek distance for some cylinders. Disks can be zoned (i.e. the number of sectors per track on outer cylinders is higher than that on inner cylinders) or not zoned (in this case, each track has the same capacity). In disks without zoning, the pivot point is The
doi:10.1093/comjnl/bxh106 fatcat:adlbb4m3cfb4lbgahw2jh4my5q

Capsule Reviews

2004 Computer journal  
Middleware technologies facilitate high-level network services and abstract service environments for distributed applications. The success of middleware technologies is largely due to their ability to make service support transparent by hiding the implementation details from the applications. However, this transparency is not so easy to achieve in a mobile environment, since it is hard to completely hide the implementation details from the applications because bandwidths may not always be
more » ... connectivity may not be always on, and error rates may not always be low. The means that in mobile environments, instead of transparency, one needs an awareness of the environment that allows application designers to inspect the execution context and adapt the middleware behaviour. The paper argues that applications operating in such environments are oblivious to the operating context and this often results in premature termination. Instead, the paper proposes the development of a middleware with a degree of transparency, while also allowing the direct awareness of applications of the changes of the operating context so that they can participate in resource allocation and adaptation in response to the dynamic operating environment. In such a context-aware middleware, suitable control mechanisms are needed to allow the active participation of applications. This paper describes the design and implementation of a highly adaptive event-driven mobile middleware. The described system represents a mobile middleware that effectively detects environmental changes and supports wireless adaptation. Initial performance results indicate the ability of the system to sustain a relatively high event-processing rate for small numbers of event resources.
doi:10.1093/comjnl/47.3.275 fatcat:hh35mveb4vflvavm52tzhrvr7u
« Previous Showing results 1 — 15 out of 295,118 results