Miracle-dz/UniFAR-FTUs huggingface dataset:
An optimization framework for routing on optical Network-on-Chips (ONoCs) from a networking perspective

As increasing numbers of CPU cores are placed on single-processor chips, conventional electronic interconnects for on-chip communications are becoming a bottleneck, due to difficulties in meeting ever-increasing demands on throughput and increasingly undesirable energy consumption. A potential solution is offered by Optical Networks-on-Chips (ONoCs): an emerging communication architecture for new generation multicore systems. Optical interconnection among cores at the chip level can offer ultra-high communication bandwidth, low latency, and high energy efficiency. This paper provides a brief review and sheds some insights on the unique characteristics and constraints of ONoCs for designing efficient routing schemes, especially from the networking perspective. Based on the properties of ONoCs, we propose an optimization framework for routing and wavelength assignment on ONoCs, which can be used to guide the upgrade from un-optimized ONoCs to optimized ONoCs. This paper provides the insight and guidance for high-level routing design in future research.
A novel design approach for lower limb rehabilitation training robot

The restoration of walking capability is very important after central nervous system (CNS) injury. Rehabilitation training robot can replace therapists to help patients do walking training by accurately simulating the human lower limb movement, and achieve the purpose of rehabilitation ultimately. In order to further improve the rehabilitation robots' intelligent and rehabilitation training effect and completely replace therapists to some extent, a new design method is proposed in this paper: firstly, the pleasant mechanical structure design method for the rehabilitation robot is put forward. Then, the rehabilitation robot's perceptual system is designed, which includes the detection methods of bioelectric and physical signals and the effective integration of the sensor network based on multi-agent system are presented. Finally, the superiority of the rehabilitation robot designed in this paper is described through results analysis.
A Regional Labour Market Profile

As unacceptably high unemployment levels persist throughout the OECD so greater attention is being paid to differences in the way regional Labour markets adjust to growth and recession. Comparatively speaking New Zealand has lacked both the conceptual and empirical analyses necessary to build local and regional specific approaches into its active labour market policies - despite the persistence of regional disparities through the post war period. When regional differences are raised for public discussion in New Zealand it is the geographical variations in the unemployment rate that usually receives attention. What this paper shows is that unemployment is merely the surface phenomenon of a condition which is much more deeply embedded in the regional labour markets affected. This is illustrated by constructing a regional labour market profile which measures each of the 14 regions on four separate labour market indicators. When applied at the height of the New Zealand recession in 1991 the profile demonstrated how regions with high unemployment rates not only experience Low labour force participation rates but that when members of the labour force in such regions do find work they work fewer hours and even when fulltime employment is obtained the levels of remuneration are lower than those in the more buoyant regions. The result of these interconnected characteristics of regional labour markets is a series of indirect multipliers which serve to exaggerate and compound the effect of depressed labour demand on weaker markets.
The normalized Laplacian Estrada index of a graph

In this paper, we define and investigate the normalized Laplacian Estrada index of a graph. Some bounds for the normalized Laplacian Estrada index of a graph in term of its vertex number, maximum (or minimum) degree are obtained, some inequalities between the normalized Laplacian Estrada and the normalized Laplacian energy are also obtained.
Energy saving information cascades in online social networks: An agent-based simulation study

Information shared through online social networking platforms is spread from user to user. Although some researchers have argued that this phenomenon can unfold similarly to an epidemic, others have found that information disseminates within a narrow range, propagating only a few levels in a communication network. In an effort to resolve these conflicting findings, we developed an information cascade model to conduct a variance-based global sensitivity analysis (GSA) to determine the influence of two network attributes on the diffusion of energy saving information. The simulation results of the base model showed that energy saving information failed to generate deep cascades. Also, the results from the GSA demonstrated that network density and the number of an initiator's connections had limited influence on information cascades. These findings suggest that massive network structures and a large number of potential recipients do not engender deep cascades of energy saving information in online social networks.
A Note on Almost Perfect Probabilistically Checkable Proofs of Proximity

Probabilistically checkable proofs of proximity (PCPP) are proof systems where the verifier is given a 3SAT formula, but has only oracle access to an assignment and a proof. The verifier accepts a satisfying assignment with a valid proof, and rejects (with high enough probability) an assignment that is far from all satisfying assignments (for any given proof). In this work, we focus on the type of computation the verifier is allowed to make. Assuming P $\neq$ NP, there can be no PCPP when the verifier is only allowed to answer according to constraints from a set that forms a CSP that is solvable in P. Therefore, the notion of PCPP is relaxed to almost perfect probabilistically checkable proofs of proximity (APPCPP), where the verifier is allowed to reject a satisfying assignment with a valid proof, with arbitrary small probability. We show, unconditionally, a dichotomy of sets of allowable computations: sets that have APPCPPs (which actually follows because they have PCPPs) and sets that do not. This dichotomy turns out to be the same as that of the Dichotomy Theorem, which can be thought of as dividing sets of allowable verifier computations into sets that give rise to NP-hard CSPs, and sets that give rise to CSPs that are solvable in P.
Unaligned Binary Codes for Index Compression in Schema-Independent Text Retrieval Systems

We examine index compression techniques for schemaindependent inverted files used in text retrieval systems. Schema-independent inverted files contain full positional information for all index terms and allow the structural unit of retrieval to be specified dynamically at query time, rather than statically during index construction. Schemaindependent indices have different characteristics than document-oriented indices, and this difference can affect the effectiveness of index compression algorithms greatly. Our experimental results show that unaligned binary codes that take into account the special properties of schema-independent indices achieve better compression rates than methods designed for compressing document indices and that they can reduce the size of the index by around 15% compared to byte-aligned index compression. Moreover, we present a number of performance-enhancing techniques that may be used to very efficiently decode unaligned codes. Thus, their more compact index representation does not carry the cost of a substantially decreased query processing performance. This contradicts most earlier results on the decoding performance of unaligned codes.
Finding galaxy clusters using Voronoi tessellations

We present an objective and automated procedure for detecting clusters of galaxies in imaging galaxy surveys. Our Voronoi Galaxy Cluster Finder (VGCF) uses galaxy positions and magnitudes to find clusters and determine their main features: size, richness and contrast above the background. The VGCF uses the Voronoi tessellation to evaluate the local density and to identify clusters as significative density fluctuations above the background. The significance threshold needs to be set by the user, but experimenting with different choices is very easy since it does not require a whole new run of the algorithm. The VGCF is non-parametric and does not smooth the data. As a consequence, clusters are identified irrespective of their shape and their identification is only slightly affected by border effects and by holes in the galaxy distribution on the sky. The algorithm is fast, and automatically assigns members to structures. A test run of the VGCF on the PDCS field centered at $\alpha = 13^{\rm h}26^{\rm m}$ and δ = +$29\degr$52´(J2000) produces 37 clusters. Of these clusters, 12 are VGCF counterparts of the 13 PDCS clusters detected at the 3 σ level and with estimated redshifts from $z=0.2$ to $z=0.6$. Of the remaining 25 systems, 2 are PDCS clusters with confidence level $< 3\sigma$ and redshift $z \leq 0.6$. Inspection of the 23 new VGCF clusters indicates that several of these clusters may have been missed by the matched filter algorithm for one or more of the following reasons: a) they are very poor, b) they are extremely elongated, c) they lie too close to a rich and/or low redshift cluster.
Scheduling shared memory multicore architectures in A UTO FOCUS 3 using Satisfiability Modulo Theories

This paper presents an approach to task and message scheduling for multicore architectures using a shared memory. A shared memory architecture is used in most of the current multicore systems. The presented approach is integrated in the AUTOFOCUS 3 toolchain that allows to automatically compute schedules for this architecture to fulfill certain system requirements. AUTOFOCUS 3 models are based on a formally defined system model using explicit data-flow and discrete-time semantics. Our approach relies on a symbolic encoding scheme, based on a scheduling model, that we generate out of AUTOFOCUS 3 system architectures. This encoding scheme relies on the AUTOFOCUS 3 semantics of strongand weak-causal components and enables to generate schedules, that fulfill certain system properties. In this paper we focus on finding optimized schedules with respect to the global discrete time base. This paper provides a formalization that describes the scheduling problem as a satisfiability problem using boolean formulas and linear arithmetical constraints. A state-of-the-art satisfiability modulo theories (SMT) solver is then used to compute these schedules. This paper demonstrates that state-of-the art satisfiability modulo theories solver can be used to to compute a schedule that fulfills certain system requirements and meet the challenges of providing both a convenient modeling language and the performance to solve industrialized-sized design problems.
Automated End-To-End System Diagnosis of Networked Printing Services Using Model-Based Reasoning

distributed service management, client-server systems, automated end-to-end diagnostics, model-based reasoning, MBR, network printing, artificial intelligence Modern applications increasingly depend on services that are distributed across the infrastructure, for example, printing, mail and database services. This is especially so in mobile computing, where network access is used to compensate for the paucity of onboard resources. However, the increased dependence on distributed services poses a challenge to IT departments whose personnel and tools typically focus on individual components of the distributed service. This calls for IT management tools that have an end-to-end perspective on entire distributed services.
ONLINE CONSUMERS ’ PERCEPTION ON PRICE FAIRNESS

This study adopts illusion of control and lateral consumer relationship to investigate their effects on price fairness in online auction and group buying context. These two variables have been known to have strong influences in fairness perception on human decision making processes and outcomes. Through laboratory experiments, this study demonstrates that consumers’ perception on illusion of control in price determination and advantageous lateral consumer relationship significantly affect price fairness perception in both the online auction and group buying environments. The findings are expected to provide researchers and managers with useful insights to conduct future studies on uncovering the nomological networks associated with price fairness perception and to develop better pricing strategies and design effective dynamic pricing mechanisms.
Disposition of lipids in the postprandial state

RCcemment, il est apparu un intCret renouvele pour la rCgulation du mktabolisme postprandial des lipides, pour les facteurs qui influencent l’utilisation des lipides aprks la consommation des repas. Cet inter& est la conskquence de ce qu’il a CtC montrC que les lipoprotCines riches en triacylglydrol, les chylomicrons et les VLDL sont impliqukes dans la pathogenkse de la maladie coronarienne. Les chylomicrons dCrivCs de l’alimentation sont les plus importants responsables de l’augmentation du triacylglycerol aprks les repas, avec moins de 20% de l’augmentation du triacylglycerol mis au compte des augmentations de YapolipoprotCine B-100 contenant des VLDL. Les rCsultats actuels suggkrent que l’augmentation prCcoce des VLDL aprks les repas est due a l’alteration de 1’Climination de ces particules, du fait de l’influx des chylomicrons qui sont les substrats prkfkrentiels pour la lipoprotiine lipase (LPL). I1 est possible que les hormones de l’axe entCro-insulaire, l’insuline et le polypeptide insulinothropique dependant du glucose (GIP), participent B un mCcanisme homkostatique sensible a l’alimentation, qui rCgule l’utilisation des lipides en rCponse aux variations dans la prise des lipides dans l’alimentation. Ces deux hormones stimulent l’activitk de la LPL et, il a Ct& observC in v i m , que le GIP favorisait les actions lipolytiques de l’insuline. La co-sCcrCtion de ces hormones en rCponse a l’ingestion des repas renforcera de ce fait le relargage d’acides gras non estCrifiCs (NEFA) B partir du triacylglycerol circulant. La demonstration que la secretion de GIP est modifiCe par la quantitC et le type de graisse de l’alimentation fournit un mecanisme potentiel par lequel 1’Cvacuation du triacylglycerol peut ttre rCgulC en coordination en rkponse B la charge de graisse dans l’alimentation. I1 est possible que le maintien d’un gradient de concentration de NEFA entre le plasma sanguin et l’adipocyte soit un composant important de la rCgulation normale de l’utilisation des lipides, puisqu’il a CtC montrC que l’absence de captation de NEFA et l’accumulation de NEFA h la surface endothkliale entrainaient le relargage et l’inactivation de la LPL. Un fragment du complement C3, identifik comme C3 des Arg, s’est rCvelC ttre synthCtisC dans le tissu adipeux, et a CtC dCsignC sous l’appellation de protCine stimulant l’acylation (ASP) en raison de sa capacitt B stimuler in v i m la synthkse du triacylglycerol dans les adipocytes et dans les fibroblastes de la peau. L‘ASP stimule l’estkrification des acides gras en triacylglycerol en stimulant de captation du glucose de l’adipocyte par la translocation des transporteurs du glucose, et en stimulant 1’Ctape rkgulatoire du taux dans la synthkse du triacylglycCro1 B l’acyltransfkrase diacylglyc6rol. Chez les sujets humains, l’administration d’une charge de graisse (mais non de glucose)
Threshold Disjunctive Codes

Let $1 \le s < t$, $N \ge 1$ be integers and a complex electronic circuit of size $t$ is said to be an $s$-active, $\; s \ll t$, and can work as a system block if not more than $s$ elements of the circuit are defective. Otherwise, the circuit is said to be an $s$-defective and should be substituted for the similar $s$-active circuit. Suppose that there exists a possibility to check the $s$-activity of the circuit using $N$ non-adaptive group tests identified by a conventional disjunctive $s$-code $X$ of size~$t$ and length~$N$. As usually, we say that any group test yields the positive response if the group contains at least one defective element. In this case, there is no any interest to look for the defective elements. We need to decide on the number of the defective elements in the circuit without knowing the code~$X$. In addition, the decision has the minimal possible complexity because it is based on the simple comparison of a fixed threshold $T$, $0 \le T \le N - 1$, with the number of positive responses $p$, $0 \le p \le N$, obtained after carrying out $N$ non-adaptive tests prescribed by the disjunctive $s$-code~$X$. For the introduced group testing problem, a new class of the well-known disjunctive $s$-codes called the threshold disjunctive $s$-codes is defined. The aim of our paper is to discuss both some constructions of suboptimal threshold disjunctive $s$-codes and the best random coding bounds on the rate of threshold disjunctive $s$-codes.
Peak Oil and the Twilight of Growth

If we are to be successful in our goal of generating legal systems that genuinely serve to protect the integrity of Earth’s ecosystems, it will be necessary to confront directly the growth model of progress that is currently driving the global economy toward ecological catastrophe. Since the global economy already exceeds the sustainable carrying capacity of the planet, and since the poorest nations must still expand their economic capacities merely to provide for their basic needs, it follows that the richest nations should at once enter a phase of planned economic contraction (i.e. degrowth). Needless to say, there are no signs that the richest nations are prepared to adopt or even consider such a policy. In this paper I will explore the significance of 'peak oil' and argue that the looming stagnation in the supply of cheap energy (of liquid fuels in particular) suggests that we are entering the twilight of global economic growth, whether we like it or not. Some of the implications of this will be explored.
Itrustpage: a user-assisted anti-phishing tool

Despite the many solutions proposed by industry and the research community to address phishing attacks, this problem continues to cause enormous damage. Because of our inability to deter phishing attacks, the research community needs to develop new approaches to anti-phishing solutions. Most of today's anti-phishing technologies focus on automatically detecting and preventing phishing attacks. While automation makes anti-phishing tools user-friendly, automation also makes them suffer from false positives, false negatives, and various practical hurdles. As a result, attackers often find simple ways to escape automatic detection. This paper presents iTrustPage - an anti-phishing tool that does not rely completely on automation to detect phishing. Instead, iTrustPage relies on user input and external repositories of information to prevent users from filling out phishing Web forms. With iTrustPage, users help to decide whether or not a Web page is legitimate. Because iTrustPage is user-assisted, iTrustPage avoids the false positives and the false negatives associated with automatic phishing detection. We implemented iTrustPage as a downloadable extension to FireFox. After being featured on the Mozilla website for FireFox extensions, iTrustPage was downloaded by more than 5,000 users in a two week period. We present an analysis of our tool's effectiveness and ease of use based on our examination of usage logs collected from the 2,050 users who used iTrustPage for more than two weeks. Based on these logs, we find that iTrustPage disrupts users on fewer than 2% of the pages they visit, and the number of disruptions decreases over time.
Let's put the car in your phone!

Today high-end cars have extremely complex E/E architectures - with 50-100 electronic control units (ECUs), connected by communication buses like CAN, FlexRay and Ethernet. They are used to run several (control) applications with many million lines of code. We propose a radically new architecture where all these applications are instead run on a mobile phone being carried by the driver. The car now has a considerably simpler architecture with few or no ECUs, using RF links to connect sensors and actuators to the mobile phone with a powerful multicore processor. We discuss the advantages and challenges and describe a small prototype implementation with an adaptive cruise control application.
Study on Pricing Model of Online Auction under Competitive Strategy

E-commerce auction has the auction properties unlike ordinary e-commerce transactions. The online auctions, allowed bidding, become into a new trading model based on the network for the exchange and auction technology. This paper firstly gives the overview of the online auction pricing mechanism and introduces the e-commerce auction market and its characteristics on the one hand. On the other hand, it discusses the factors affecting the price of online auctions from three aspects, the information flow, the business objectives and the risk factors. And then, it discusses the six types of e-auction pricing strategy. Lastly, facing the factors and the different strategies, it presents the win-win pricing model on the online e-commerce auction British-based both for auction operators and consumers.
Topological Ordering of Function Words in Hierarchical Phrase-based Translation

Hierarchical phrase-based models are attractive because they provide a consistent framework within which to characterize both local and long-distance reorderings, but they also make it difficult to distinguish many implausible reorderings from those that are linguistically plausible. Rather than appealing to annotation-driven syntactic modeling, we address this problem by observing the influential role of function words in determining syntactic structure, and introducing soft constraints on function word relationships as part of a standard log-linear hierarchical phrase-based model. Experimentation on Chinese-English and Arabic-English translation demonstrates that the approach yields significant gains in performance.
Time Domain Optimization Techniques for Blind Separation of Non-stationary Convolutive Mixed Signals

This paper aims to solve the problem of Blind Signal Separation (BSS) in a convolutive environment based on output correlation matrix diagonalization. Firstly an extension of the closed form gradient and Newton methods used by Joho and Rahbar [1] is developed which encapsulates the more difficult convolutive mixing case. This extension is completely in the time domain and thus avoids the inherent permutation problem associated with frequency domain approaches. We also compare the performance of three commonly used algorithms including Gradient, Newton and global optimization algorithms in terms of their convergence behavior and separation performance in the instantaneous case and then the convolutive case.
Feedback gains for correcting small perturbations to standing posture

A dynamical model of the neuromusculoskeletal mechanics of a cat hind limb has been developed and used to investigate the feedback regulation of standing posture under small perturbations. The model is a three-joint limb, moving only in the sagittal plane and driven by ten musculotendon actuators each having response dynamics dependent on activation kinetics and muscle kinematics. Under small perturbations the nonlinear postural regulation mechanism is approximately linear, and sensors that could provide state feedback exist. Thus, the linear quadratic regulator is proposed as a model for the structure of the feedback controller for regulation of small perturbations. System states are chosen to correspond to the known outputs of physiological sensors: muscle forces, a combination of muscle lengths and velocities, joint angles and velocities, and motoneuron activities. Thus the feedback gain matrices computed can be related to the spinal neural circuits. It is shown that a strategy of regulating all the states leads to controllers that best mimic the externally measured behavior of real cats. <<ETX>>