A two-stage hardware scheduler combining greedy and optimal scheduling

Greedy scheduling heuristics provide a low complexity and scalable albeit particularly sub-optimal strategy for hardware-based crossbar schedulers. In contrast, the maximum matching algorithm for Bipartite graphs can be used to provide optimal scheduling for crossbar-based interconnection networks with a significant complexity and scalability cost. In this paper, we show how maximum matching can be reformulated in terms of Boolean operations rather than the more traditional formulations. By leveraging the inherent parallelism available in custom hardware design, we reformulate maximum matching in terms of Boolean operations rather than matrix computations and introduce three maximum matching implementations in hardware. Specifically, we examine a Pure Logic Scheduler with three dimensions of parallelism, a Matrix Scheduler with two dimensions of parallelism and a Vector Scheduler with one dimension of parallelism. These designs reduce the algorithmic complexity for an N×N$N\times N$ network from O(N³)$O\left(N^3\right)$ to O(1)$O\left(1\right)$, O(K)$O\left(K\right)$, and O(KN)$O\left(KN\right)$, respectively, where K$K$ is the number of optimization steps. While an optimal scheduling algorithm requires K=2N−1$K=2N-1$ steps, by starting with our hardware-based greedy strategy to generate an initial schedule, our simulation results show that the maximum matching scheduler can achieve 99% of the optimal schedule when K=9$K=9$. We examine hardware and time complexity of these architectures for crossbar sizes of up to N=1024$N=1024$. Using FPGA synthesis results, we show that a greedy schedule for crossbars, ranging from 8×8 to 256×256, can be optimized in less than 20 ns per optimization step. For crossbars reaching 1024×1024 the scheduling can be completed in approximately 10 μs with current technology and could reach under 90 ns with future technologies.     

A compositional Petri net translation of general π-calculus terms

We propose a finite structural translation of possibly recursive π-calculus terms into Petri nets. This is achieved by using high-level nets together with an equivalence on markings in order to model entering into recursive calls, which do not need to be guarded. We view a computing system as consisting of a main program (π-calculus term) together with procedure declarations (recursive definitions of π-calculus identifiers). The control structure of these components is represented using disjoint high-level Petri nets, one for the main program and one for each of the procedure declarations. The program is executed once, while each procedure can be invoked several times (even concurrently), each such invocation being uniquely identified by structured tokens which correspond to the sequence of recursive calls along the execution path leading to that invocation.     

IT employment prospects: beyond the dotcom bubble

In the 1990s, enrollments grew rapidly in information systems (IS) and computer science. Then, beginning in 2000 and 2001, enrollments declined precipitously. This paper looks at the enrollment bubble and the dotcom bubble that drove IT enrollments. Although the enrollment bubble occurred worldwide, this paper focuses primarily on U.S. data, which is widely available, and secondarily on Western Europe data. The paper notes that the dotcom bubble was an investment disaster but that U.S. IT employment fell surprisingly little and soon surpassed the bubble's peak IT employment. In addition, U.S. IT unemployment rose to almost the level of total unemployment in 2003, then fell to traditional low levels by 2005. Job prospects in the U.S. and most other countries are good for the short term, and the U.S. Bureau of Labor Statistics employment projections for 2006–2016 indicate that job prospects in the U.S. will continue to be good for most IT jobs. However, offshoring is a persistent concern for students in Western Europe and the United States. The data on offshoring are of poor quality, but several studies indicate that IT job losses from offshoring are small and may be counterbalanced by gains in IT inshoring jobs. At the same time, offshoring and productivity gains appear to be making low-level jobs such as programming and user support less attractive. This means that IS and computer science programs will have to focus on producing higher-level job skills among graduates. In addition, students may have to stop considering the undergraduate degree to be a terminal degree in IS and computer science.     

Perfect forward secure identity-based authenticated key agreement protocol in the escrow mode

The majority of existing escrowable identity-based key agreement protocols only provide partial forward secrecy. Such protocols are, arguably, not suitable for many real-word applications, as the latter tends to require a stronger sense of forward secrecy—perfect forward secrecy. In this paper, we propose an efficient perfect forward-secure identity-based key agreement protocol in the escrow mode. We prove the security of our protocol in the random oracle model, assuming the intractability of the Gap Biline...     

Energy sector planning using multiple-index pinch analysis

Pinch analysis was initially developed as a methodology for optimizing energy efficiency in process plants. Applications of pinch analysis applications are based on common principles of using stream quantity and quality to determine optimal system targets. This initial targeting step identifies the pinch point, which then allows complex problems to be decomposed for the subsequent design of an optimal network using insights drawn from the targeting stage. One important class of pinch analysis problems is energy planning with footprint constraints, which began with the development of carbon emissions pinch analysis; in such problems, energy sources and demands are characterized by carbon footprint as the quality index. This methodology has been extended by using alternative quality indexes that measure different sustainability dimensions, such as water footprint, land footprint, emergy transformity, inoperability risk, energy return on investment and human fatalities. Pinch analysis variants still have the limitation of being able to use one quality index at a time, while previous attempts to develop pinch analysis methods using multiple indices have only been partially successful for special cases. In this work, a multiple-index pinch analysis method is developed by using an aggregate quality index, based on a weighted linear function of different quality indexes normally used in energy planning. The weights used to compute the aggregate index are determined via the analytic hierarchy process. A case study for Indian power sector is solved to illustrate how this approach allows multiple sustainability dimensions to be accounted for in energy planning.     

1996 editorial: 50th Anniversary Issue of the American Psychologist.

Presents an editorial on the 50th Anniversary Issue of The American Psychologist by the CEO and Executive Vice President of the American Psychological Association. An overview of changes to the journal and the developments in electronic communications pare presented, and the implications for international exchange in scholarly publishing are discussed. (0 ref) (PsycINFO Database Record (c) 2010 APA, all rights reserved)     

Proteomics in chronic kidney disease: The issues clinical nephrologists need an answer for

A growing number of patients are recognised to have chronic kidney disease (CKD). However, only a minority will progress to end-stage renal disease requiring dialysis or transplantation. Currently available diagnostic and staging tools frequently fail to identify those at higher risk of progression or death. Furthermore within specific disease entities there are shortcomings in the prediction of the need for therapeutic interventions or the response to different forms of therapy. Kidney and urine proteomic biomarkers are considered as promising diagnostic tools to predict CKD progression early in diabetic nephropathy, facilitating timely and selective intervention that may reduce the related health-care expenditures. However, independent groups have not validated these findings and the technique is not currently available for routine clinical care. Furthermore, there are gaps in our understanding of predictors of progression or need for therapy in non-diabetic CKD. Presumably, a combination of tissue and urine biomarkers will be more informative than individual markers. This review identifies clinical questions in need of an answer, summarises current information on proteomic biomarkers and CKD, and describes the European Kidney and Urine Proteomics initiative that has been launched to carry out a clinical study aimed at identifying urinary proteomic biomarkers distinguishing between fast and slow progressors among patients with biopsy-proven primary glomerulopathies.     

Examining knowledge contribution from the perspective of an online identity in blogging communities

Knowledge contribution is one of the essential factors behind the success of blogging communities (BCs). This research studies knowledge contribution behavior in a BC from the perspective of knowledge contributors and their characteristics using the lens of social identity theory. Social identity theory asserts that individuals are fundamentally motivated to present or communicate their identities in everyday social life through behavior. A similar line of reasoning can be used to argue that members of a BC would also be motivated to communicate their online identities through their behavior, that is, through knowledge contribution in the BC. Specifically, this study conceptualized the online identity and examined the effects of its personal (online kindness, online social skills, and online creativity) and social aspects (BC involvement) on knowledge contribution. The data was collected using an online survey from the members of Cyworld, a popular BC in South Korea and a few other countries (members from South Korea were included in this study). The results indicate that both the personal and social aspects of online identity and their interactions significantly influenced knowledge contribution. Based on the findings, this study offers suggestions to organizers of BCs to enhance the knowledge contribution from their members.     

Direction coding using a tactile chair

This laboratory study examined the possibility of using a car seat instrumented with a tactile display to communicate directional information to a driver. A car seat fitted with an 8 × 8 matrix of vibrators embedded in the seat pan was used to code eight different directions. Localization response time and angular accuracy were examined as a function of stimulus direction, presence of a tactile attention cue, temporal pattern, stimulus layout, age, and gender. The mean absolute angular error was 23°, and both localization accuracy and response times were superior for the back left, backward, and back right directions. Of the various temporal pattern/attention cue combinations examined, results favored the relatively fast patterns consisting of vibration bursts of 125 or 250 ms without a centrally located attention cue over 500 ms bursts that were preceded by an attention cue. Observed age and gender effects were relatively modest, suggesting that using tactile cueing to communicate direction is effective across a wide range of users. In addition, the tactile stimulus was detected by more than 90% of the participants under surprise trial conditions. Overall, these results indicate that the tactile chair provides a promising and robust method of providing directional information.     

An alternative Kalman-Yakubovich-Popov lemma and some extensions

This paper introduces an alternative formulation of the Kalman-Yakubovich-Popov (KYP) Lemma, relating an infinite dimensional Frequency Domain Inequality (FDI) to a pair of finite dimensional Linear Matrix Inequalities (LMI). It is shown that this new formulation encompasses previous generalizations of the KYP Lemma which hold in the case the coefficient matrix of the FDI does not depend on frequency. In addition, it allows the coefficient matrix of the frequency domain inequality to vary affinely with the frequency parameter. One application of this results is illustrated in an example of computing upper bounds to the structured singular value with frequency-dependent scalings.